-/* Copyright 2007 TeX Users Group
- Copyright 2014 Clerk Ma
-
- This program is free software; you can redistribute it and/or modify
- it under the terms of the GNU General Public License as published by
- the Free Software Foundation; either version 2 of the License, or
- (at your option) any later version.
-
- This program is distributed in the hope that it will be useful, but
- WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
- General Public License for more details.
-
- You should have received a copy of the GNU General Public License
- along with this program; if not, write to the Free Software
- Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
- 02110-1301 USA. */
-
-#define EXTERN extern
-
-#include "texd.h"
-
-#define USEOUREALLOC
-#define USEMEMSET
-
-#ifdef USEOUREALLOC
- #define REALLOC ourrealloc
-#else
- #define REALLOC realloc
-#endif
-
-int wantcopyrght = 1;
-
-char *compiletime = __TIME__;
-char *compiledate = __DATE__;
-char *www = "http://www.tug.org/yandy";
-char *copyright = "\nCopyright (C) 1993--2000 Y&Y, Inc.\n"
- "Copyright (C) 2007 TeX Users Group.\n"
- "Copyright (C) 2014 Clerk Ma.\n\n"
- "This program is free software; you can redistribute it and/or modify\n"
- "it under the terms of the GNU General Public License as published by\n"
- "the Free Software Foundation; either version 2 of the License, or\n"
- "(at your option) any later version.\n\n ";
-char *yandyversion = "2.3.0";
-char *application = "Y&Y TeX";
-char *tex_version = "This is TeX, Version 3.14159265";
-
-clock_t start_time, main_time, finish_time;
-
-char * dvi_directory = "";
-char * log_directory = "";
-char * aux_directory = "";
-char * fmt_directory = "";
-char * pdf_directory = "";
-
-char * texpath = "";
-
-char log_line[MAXLINE]; // used also in tex9.c
-
-int mem_spec_flag = 0; /* non-zero if `-m=...' was used */
-int format_spec = 0; /* non-zero if a format specified on command line */
-int closed_already = 0; /* make sure we don't try this more than once */
-boolean reorder_arg_flag = true; /* put command line flags/arguments first */
-
-/* Mapping from Windows ANSI to DOS code page 850 96/Jan/20 */
-/* Used in tex0.c with wintodos[c-128] */
-
-unsigned char wintodos[128] =
-{
- 0, 0, 0, 159, 0, 0, 0, 0,
- 94, 0, 0, 0, 0, 0, 0, 0,
- 0, 96, 39, 0, 0, 7, 0, 0,
- 126, 0, 0, 0, 0, 0, 0, 0,
- 32, 173, 189, 156, 207, 190, 221, 21,
- 0, 184, 166, 174, 170, 45, 169, 0,
- 248, 241, 253, 252, 0, 230, 20, 250,
- 0, 251, 167, 175, 172, 171, 243, 168,
- 183, 181, 182, 199, 142, 143, 146, 128,
- 212, 144, 210, 211, 222, 214, 215, 216,
- 209, 165, 227, 224, 226, 229, 153, 158,
- 157, 235, 233, 234, 154, 237, 232, 225,
- 133, 160, 131, 198, 132, 134, 145, 135,
- 138, 130, 136, 137, 141, 161, 140, 139,
- 208, 164, 149, 162, 147, 228, 148, 246,
- 155, 151, 163, 150, 129, 236, 231, 152
-};
-
-void show_usage (void)
-{
- printf("\n"
- " Useage: yanytex [OPTION]... [+format_file] [tex_file]\n\n"
- " --help -?\n"
- " show this usage summary\n"
- " --initex -i\n"
- " start up as iniTeX (create format file)\n"
- " --verbose -v\n"
- " be verbose (show implementation version number)\n"
- " -n do not allow `non ASCII' characters in input files (complain instead)\n"
- " --showhex -w\n"
- " do not show `non ASCII' characters in hexadecimal (show as is)\n"
- " -d do not allow DOS style file names - i.e. do not convert \\ to /\n"
- " -r do not allow Mac style termination - i.e. do not convert \\r to \\n\n"
- " --patterns -p\n"
- " allow use of \\patterns after loading format (iniTeX only)\n"
- " --knuthify -K\n"
- " disable all extensions to basic TeX\n"
- " --main-memory -m\n"
- " initial main memory size in kilo words (iniTeX only)\n"
- " --hyph-size -e\n"
- " hyphenation exception dictionary size (iniTeX only)\n"
- " --trie-size -h\n"
- " hyphenation pattern trie size (iniTeX only)\n"
- " --xchr-file -x\n"
- " use `non ASCII' character mapping (xchr[]) defined in file\n"
- " --key-file -k\n"
- " use `key replacement' defined in file\n"
- " --dvi-dir -o\n"
- " write DVI file in specified directory (default current directory)\n"
- " --log-dir -l\n"
- " write LOG file in specified directory (default current directory)\n"
- " --aux-dir -a\n"
- " write AUX file in specified directory (default current directory)\n");
-
-#ifndef _WINDOWS
- uexit(EXIT_FAILURE); // has this been setup yet ???
-#endif
-}
-
-/* -z do not discard control-Z at end of input file (treat as character)\n\ */
-
-/* \t-d\tallow DOS style file names - i.e. convert \\ to / \n\ */
-/* \t\t(applies to file name and format file name, if present)\n\ */
-/* \t-r\tallow Mac style line termination - i.e. convert \\r to \\n \n\ */
-
-// Sep 27 1990 => 1990 Sep 27
-// 012456789 0123456789
-void scivilize (char * date)
-{
- int k;
- char pyear[6];
-
- strcpy (pyear, date + 7);
-
- for (k = 5; k >= 0; k--)
- date[k + 5] = date[k];
-
- for (k = 0; k < 4; k++)
- date[k] = pyear[k];
-
- date[4] = ' ';
-
- if (date[9] == ' ')
- date[9] = '0'; /* replace space by '0' */
-}
-
-// Thu Sep 27 06:26:35 1990 => 1990 Sep 27 06:26:35
-void lcivilize (char * date)
-{
- int k;
- char pyear[6];
-
- strcpy (pyear, date + 20);
-
- for (k = 18; k >= 0; k--)
- date[k+1] = date[k];
-
- date[20] = '\0';
-
- for (k = 0; k < 4; k++)
- date[k] = pyear[k];
-
- date[4] = ' ';
-}
-
-// now writes result into given buffer
-void stamp_it (char *s)
-{
- char date[11 + 1];
-
- strcpy(date, compiledate);
- scivilize(date);
- sprintf(s, "%s %s ", application, yandyversion);
- s += strlen(s);
- sprintf(s, "(compiled time: %s %s)", date, compiletime);
- s += strlen(s);
-}
-
-void stampcopy (char *s)
-{
- if (wantcopyrght)
- {
- sprintf(s, "%s %s", copyright, www);
- }
-}
-
-#define MAXCHRS 256
-#define NOTDEF 127
-
-void read_xchr_sub (FILE * xchr_input)
-{
- char buffer[file_name_size];
- int k, from, to, count = 0;
- char *s;
-
- memset(xchr, NOTDEF, MAXCHRS);
- memset(xord, NOTDEF, MAXCHRS);
-
-#ifdef ALLOCATEBUFFER
- while (fgets(buffer, current_buf_size, xchr_input) != NULL)
-#else
- while (fgets(buffer, sizeof(buffer), xchr_input) != NULL)
-#endif
- {
- if (*buffer == '%' || *buffer == ';' || *buffer == '\n')
- continue;
-
- from = (int) strtol (buffer, &s, 0);
- to = (int) strtol (s, NULL, 0);
-
- if (from >= 0 && from < MAXCHRS && to >= 0 && to < MAXCHRS)
- {
- if (xchr[from] == (unsigned char) NOTDEF)
- {
- xchr[from] = (unsigned char) to;
- }
- else
- {
- sprintf(log_line, "NOTE: %s collision: %d => %d, %d\n", "xchr", from, xchr[from], to);
- show_line(log_line, 0);
- }
-
- if (xord[to] == NOTDEF)
- {
- xord[to] = (unsigned char) from;
- }
- else
- {
- sprintf(log_line, "NOTE: %s collision: %d => %d, %d\n", "xord", to, xord[to], from);
- show_line(log_line, 0);
- }
-
- count++;
- }
- }
-
- for (k = 0; k < MAXCHRS; k++)
- {
- if (xchr[k] == NOTDEF) /* if it has not been filled */
- {
- if (xord[k] == NOTDEF) /* see whether used already */
- {
- xchr[k] = (unsigned char) k; /* no, so make identity */
- xord[k] = (unsigned char) k; /* no, so make identity */
- }
- }
- }
-
- xchr[NOTDEF] = NOTDEF; /* fixed point of mapping */
-
- if (trace_flag)
- {
- sprintf(log_line, "Read %d xchr[] pairs:\n", count);
- show_line(log_line, 0);
-
- for (k = 0; k < MAXCHRS; k++)
- {
- if (xchr[k] != NOTDEF)
- {
- sprintf(log_line, "%d => %d\n", k, xchr[k]);
- show_line(log_line, 0);
- }
- }
- }
-}
-
-char *replacement[MAXCHRS]; /* pointers to replacement strings */
-
-void read_repl_sub (FILE * repl_input)
-{
- int k, n, m, chrs;
- char buffer[file_name_size];
- char charname[128];
- int charnum[10];
- char *s, *t;
-
- memset(replacement, 0, MAXCHRS * sizeof(replacement[ 0]));
-
-
- while (fgets(buffer, file_name_size, repl_input) != NULL)
- {
- if (*buffer == '%' || *buffer == ';' || *buffer == '\n')
- continue;
-
- if ((m = sscanf(buffer, "%d%n %s", &chrs, &n, &charname)) == 0)
- continue;
- else if (m == 2)
- {
- if (*charname == '"') /* deal with quoted string "..." */
- {
- s = buffer + n;
- t = charname;
-
- while (*s != '"' && *s != '\0')
- s++; /* step up to " */
-
- if (*s++ == '\0')
- continue; /* sanity check */
-
- while (*s != '\0')
- {
- if (*s == '"')
- {
- s++; /* is it "" perhaps ? */
-
- if (*s != '"')
- break; /* no, end of string */
- }
-
- *t++ = *s++; /* copy over */
- }
-
- *t = '\0'; /* and terminate */
- }
-
- if (chrs >= 0 && chrs < MAXCHRS)
- replacement[chrs] = xstrdup(charname);
- }
-/* presently the following can never get triggered */
-/* which is good, because it is perhaps not right ... */
- else if ((m = sscanf (buffer, "%d %d %d %d %d %d %d %d %d %d %d",
- &chrs, charnum, charnum+1, charnum+2, charnum+3, charnum+4,
- charnum+5, charnum+6, charnum+7, charnum+8, charnum+9)) > 1) {
-/* for (k = 0; k < n-1; k++) charname[k] = (char) charnum; */
- for (k = 0; k < n-1; k++) charname[k] = (char) charnum[k];
- charname[m] = '\0';
- if (chrs >= 0 && chrs < MAXCHRS)
- replacement[chrs] = xstrdup(charname);
- }
- else {
- sprintf(log_line, "ERROR: don't understand %s", buffer);
- show_line(log_line, 1);
- }
- }
-
- if (trace_flag)
- {
- puts("Key replacement table\n");
-
- for (k = 0; k < MAXCHRS; k++)
- {
- if (replacement[k] != NULL)
- {
- sprintf(log_line, "%d\t%s\n", k, replacement[k]);
- show_line(log_line, 0);
- }
- }
- }
-}
-
-/* Following used both to read xchr[] file and key replacement file */
-/* the flag is 0 for -x=... and the flag is 1 for -k=... */
-int read_xchr_file (char *filename, int flag, char *argv[])
-{
- FILE *pinput;
- char infile[file_name_size];
- char *s;
-
- if (filename == NULL)
- return -1;
-
- if (trace_flag)
- {
- sprintf(log_line, "Reading xchr/repl %s\n", filename);
- show_line(log_line, 0);
- }
-
-/* first try using file as specified */
- strcpy(infile, filename);
-
- if (trace_flag)
- {
- sprintf(log_line, "Trying %s\n", infile);
- show_line(log_line, 0);
- }
-
- pinput = fopen (infile, "r");
-
- if (pinput == NULL)
- {
- if (strrchr(infile, '.') == NULL)
- {
- if (flag == 0)
- strcat(infile, ".map");
- else
- strcat(infile, ".key");
-
- if (trace_flag)
- {
- sprintf(log_line, "Trying %s\n", infile);
- show_line(log_line, 0);
- }
-
- pinput = fopen (infile, "r");
- }
- }
-
- if (pinput == NULL)
- {
- strcpy(infile, argv[0]); /* try TeX program path */
-
- if ((s = strrchr (infile, '\\')) != NULL) *(s+1) = '\0';
- else if ((s = strrchr (infile, '/')) != NULL) *(s+1) = '\0';
- else if ((s = strrchr (infile, ':')) != NULL) *(s+1) = '\0';
-
- strcat (infile, filename);
-
- if (trace_flag)
- {
- sprintf(log_line, "Trying %s\n", infile);
- show_line(log_line, 0);
- }
-
- pinput = fopen (infile, "r");
-
- if (pinput == NULL)
- {
- if (strchr(infile, '.') == NULL)
- {
- if (flag == 0)
- strcat(infile, ".map");
- else
- strcat(infile, ".key");
-
- if (trace_flag)
- {
- sprintf(log_line, "Trying %s\n", infile);
- show_line(log_line, 0);
- }
-
- pinput = fopen (infile, "r");
- }
- }
- }
-
- if (pinput == NULL) /* 97/July/31 */
- {
- strcpy (infile, argv[0]); /* try TeX program path */
-
- if ((s = strrchr (infile, '\\')) != NULL) *(s+1) = '\0';
- else if ((s = strrchr (infile, '/')) != NULL) *(s+1) = '\0';
- else if ((s = strrchr (infile, ':')) != NULL) *(s+1) = '\0';
-
- strcat (infile, "keyboard\\");
- strcat (infile, filename);
-
- if (trace_flag)
- {
- sprintf(log_line, "Trying %s\n", infile);
- show_line(log_line, 0);
- }
-
- pinput = fopen (infile, "r");
-
- if (pinput == NULL)
- {
- if (strchr(infile, '.') == NULL)
- {
- if (flag == 0)
- strcat(infile, ".map");
- else
- strcat(infile, ".key");
-
- if (trace_flag)
- {
- sprintf(log_line, "Trying %s\n", infile);
- show_line(log_line, 0);
- }
-
- pinput = fopen (infile, "r");
- }
- }
- }
-/* Note: can't look in TeX source file dir, since that is not known yet */
- if (pinput == NULL)
- {
- sprintf(log_line, "ERROR: Sorry, cannot find %s file %s",
- flag ? " xchr[]" : "key mapping", filename);
- show_line(log_line, 1);
- perrormod (filename);
- return 0; // failed
- }
-
- if (flag == 0)
- read_xchr_sub (pinput);
- else
- read_repl_sub (pinput);
-
- (void) fclose (pinput);
- return 1;
-}
-
-/* need to also set `key_replace' here based on command line */
-/* need to also allocate `buffercopy' here and free at end */
-/* need to call `readreplace' in appropriate place */
-
-/* *** *** *** *** *** *** *** *** *** *** *** *** *** *** *** *** *** *** */
-
-#define MAXSPLITS 3
-
-/* ad hoc default minimum growth in memory realloc is 62% */
-/* golden ratio (1 + \sqrt{5}) / 2 = 1.618033989... */
-int percent_grow = 62; /* default minimum growth in memory realloc is 62% */
-int total_allocated = 0; /* total memory allocated so far */
-int ini_max_address = 0; /* maximum address when starting */
-int max_address = 0; /* maximum address seen in allocated memory */
-
-
-void show_maximums (FILE * output)
-{
- sprintf(log_line, "Max allocated %d --- max address %d\n", total_allocated, max_address);
- fputs(log_line, output);
-}
-
-/* our own version of realloc --- avoid supposed MicroSoft version bug */
-/* also tries _expand first, which can avoid address growth ... */
-
-#ifdef USEOUREALLOC
-void *ourrealloc (void *old, size_t new_size)
-{
- void * mnew;
- size_t old_size, overlap;
-
- /* round up to nearest multiple of four bytes */
- /* avoid unlikely alignment */
- if ((new_size % 4) != 0)
- new_size = ((new_size / 4) + 1) * 4;
-
- if (old == NULL)
- return malloc (new_size); /* no old block - use malloc */
-
-#ifdef _WIN32
- old_size = _msize (old);
-#else
- old_size = malloc_usable_size (old);
-#endif
-
- if (old_size >= new_size && old_size < new_size + 4)
- return old;
-
-#ifdef _WIN32
- mnew = _expand (old, new_size); /* first try and expand in place MSVC */
-#else
- mnew = realloc (old, new_size);
-#endif
-
- if (mnew != NULL)
- {
- if (trace_flag)
- {
- sprintf(log_line, "EXPANDED! %p (%d) == %p (%d)\n",
- mnew, new_size, old, old_size);
- show_line(log_line, 0);
- }
-
- return mnew;
- }
-
- /* do this if you want to call the real realloc next - */
- mnew = realloc (old, new_size);
-
- if (mnew != NULL)
- return mnew;
-
- /* we are screwed typically if we ever drop through here - no more space */
- mnew = malloc (new_size); /* otherwise find new space */
-
- if (mnew == NULL)
- return mnew; /* if unable to allocate */
-
- if (old_size < new_size)
- overlap = old_size;
- else
- overlap = new_size;
-
- memcpy (mnew, old, overlap); /* copy old data to new area */
- free(old); /* free the old area */
-
- return mnew;
-}
-#endif
-
-void memory_error (char *s, int n)
-{
- if (log_opened)
- {
- fprintf(log_file, "\n! Unable to allocate %d bytes for %s\n", n, s);
- show_maximums(log_file);
- }
-
- sprintf(log_line, "\n! Unable to allocate %d bytes for %s\n", n, s);
- show_line(log_line, 1);
- show_maximums(stderr);
-}
-
-void trace_memory (char *s, int n)
-{
- printf("Allocating %d bytes for %s\n", n, s);
-}
-
-void update_statistics (int address, int size, int old_size)
-{
- if (address + size > max_address)
- max_address = address + size;
-
- total_allocated = total_allocated + size - old_size;
-}
-
-void probe_memory (void)
-{
- char *s = (char *) malloc(4); /* get current top address */
- free(s);
- update_statistics ((int) s, 0, 0); /* show where we are */
-}
-
-void probe_show (void)
-{
- probe_memory();
- show_maximums(stdout);
-}
-
-size_t roundup (size_t n)
-{
- if ((n % 4) == 0)
- return n;
- else
- return ((n / 4) + 1) * 4;
-}
-
-#ifdef ALLOCATETRIES
-/* returns -1 if it fails */
-
-int allocate_tries (int trie_max)
-{
- int n, nl, no, nc;
-
- if (trie_max > 1000000)
- trie_max = 1000000;
-
- nl = (trie_max + 1) * sizeof(halfword);
- no = (trie_max + 1) * sizeof(halfword);
- nc = (trie_max + 1) * sizeof(quarterword);
- n = nl + no + nc;
-
- if (trace_flag)
- trace_memory("hyphen trie", n);
-
- trie_trl = (halfword *) malloc(roundup(nl));
- trie_tro = (halfword *) malloc(roundup(no));
- trie_trc = (quarterword *) malloc(roundup(nc));
-
- if (trie_trl == NULL || trie_tro == NULL || trie_trc == NULL)
- {
- memory_error("hyphen trie", n);
- return -1;
- }
-
- if (trace_flag)
- {
- sprintf(log_line, "Addresses trie_trl %p trie_tro %p trie_trc %p\n", trie_trl, trie_tro, trie_trc);
- show_line(log_line, 0);
- }
-
- update_statistics((int) trie_trl, nl, 0);
- update_statistics((int) trie_tro, no, 0);
- update_statistics((int) trie_trc, nc, 0);
-
- trie_size = trie_max;
-
- if (trace_flag)
- probe_show();
-
- return 0; // success
-}
-#endif
-
-#ifdef ALLOCATEHYPHEN
-boolean prime(int); /* test function later in this file */
-
-int current_prime = 0; /* remember in case reallocated later */
-
-/* we don't return an address here, since TWO memory regions allocated */
-/* plus, we don't really reallocate, we FLUSH the old information totally */
-/* returns -1 if it fails */
-
-int realloc_hyphen (int hyphen_prime)
-{
- int n, nw, nl;
-
- if (!prime(hyphen_prime))
- {
- sprintf(log_line, "ERROR: non-prime hyphen exception number (%d)\n", hyphen_prime);
- show_line(log_line, 1);
- return -1;
- }
-
-/* need not/cannot preserve old contents when hyphen prime is changed */
-/* if (hyph_list != NULL) free(hyph_list); */
-/* if (hyph_word != NULL) free(hyph_word); */
-/* important + 1 since str_number hyph_word[hyphen_prime + 1] in original etc. */
- nw = (hyphen_prime + 1) * sizeof(str_number);
- nl = (hyphen_prime + 1) * sizeof(halfword);
- n = nw + nl;
-
- if (trace_flag)
- trace_memory("hyphen exception", n);
-
- hyph_word = (str_number *) REALLOC (hyph_word, nw);
- hyph_list = (halfword *) REALLOC (hyph_list, nl);
-
- if (hyph_word == NULL || hyph_list == NULL)
- {
- memory_error("hyphen exception", n);
- return -1;
- }
-
- if (trace_flag)
- {
- sprintf(log_line, "Addresses hyph_word %p hyph_list %p\n", hyph_word, hyph_list);
- show_line(log_line, 0);
- }
-
-/* cannot preserve old contents when hyphen prime is changed */
-#ifdef USEMEMSET
- memset(hyph_word, 0, (hyphen_prime + 1) * sizeof (hyph_word[0]));
-#else
- for (k = 0; k <= hyphen_prime; k++)
- hyph_word[k]= 0;
-#endif
-
-#ifdef USEMEMSET
- memset(hyph_list, 0, (hyphen_prime + 1) * sizeof (hyph_list[0]));
-#else
- for (k = 0; k <= hyphen_prime; k++)
- hyph_list[k]= 0;
-#endif
-
- hyph_count = 0;
-
- if (current_prime != 0)
- {
- update_statistics((int) hyph_word, nw, (current_prime + 1) * sizeof(str_number));
- update_statistics((int) hyph_list, nl, (current_prime + 1) * sizeof(halfword));
- }
- else
- {
- update_statistics((int) hyph_word, nw, 0);
- update_statistics((int) hyph_list, nl, 0);
- }
-
- current_prime = hyphen_prime;
-
- if (trace_flag)
- probe_show();
-
- return 0; // success
-}
-#endif
-
-int current_mem_size = 0; /* current total words in main mem allocated -1 */
-
-/* this gets called from itex.c when it figures out what mem_top is */
-/* or gets called from here when in ini_TeX mode */ /* and nowhere else */
-/* initial allocation only, may get expanded later */
-/* NOTE: we DON't use ALLOCATEHIGH & ALLOCATELOW anymore */
-/* returns NULL if it fails */
-
-#ifdef ALLOCATEMAIN
-/* initial main memory alloc - mem_top */
-memory_word *allocate_main_memory (int size)
-{
- int n;
-
- if (main_memory != NULL)
- {
- if (trace_flag)
- puts("Reallocating initial memory allocation");
- }
-
- mem_top = mem_bot + size;
- mem_max = mem_top;
- mem_start = 0; /* bottom of memory allocated by system */
- mem_min = 0; /* bottom of area made available to TeX */
- n = (mem_max - mem_start + 1) * sizeof (memory_word); /* 256k * 8 = 2000 k */
-
- if (trace_flag)
- trace_memory("main memory", n);
-
- main_memory = (memory_word *) REALLOC (main_memory, n);
-
- if (main_memory == NULL)
- {
- memory_error("initial main memory", n);
-// exit (1);
- return NULL;
- }
-
- if (trace_flag)
- {
- sprintf(log_line, "Address main memory == %p\n", main_memory);
- show_line(log_line, 0);
- }
-
- mem = main_memory;
-
- if (mem_start != 0 && !is_initex)
- mem = main_memory - mem_start;
-
- if (trace_flag)
- {
- sprintf(log_line, "Offset address main memory == %p\n", mem);
- show_line(log_line, 0);
- }
-
- update_statistics((int) main_memory, n, (current_mem_size + 1) * sizeof (memory_word));
-/* current_mem_size = (mem_max - mem_start + 1); */
- current_mem_size = mem_max - mem_start; /* total number of words - 1 */
-
- if (trace_flag)
- probe_show();
-
- return mem;
-}
-#endif
-
-#ifdef ALLOCATEMAIN
-/* int firstallocation = 1; */
-
-/* increase main memory allocation at low end and high end */
-/* called only from tex0.c *//* called with one of lo_size or hi_size == 0 */
-/* returns NULL if it fails */
-
-memory_word * realloc_main (int lo_size, int hi_size)
-{
- int k, min_size;
- int new_size = 0;
- int n = 0;
- memory_word * new_memory = NULL;
-
- if (trace_flag)
- {
- sprintf(log_line, "WARNING: Entering realloc_main lo %d hi %d\n", lo_size, hi_size);
- show_line(log_line, 0);
- }
-
- if (is_initex)
- {
- puts("ERROR: Cannot extent main memory in iniTeX\n");
-
- if (!knuth_flag)
- puts("Please use `-m=...' on command line");
-
- return NULL;
- }
-
- if (trace_flag)
- {
- sprintf(log_line, "Old Address %s == %p\n", "main memory", main_memory);
- show_line(log_line, 0);
- }
-
- /* if we REALLY run up to limit ! */
- if (current_mem_size + 1 == max_mem_size)
- {
- memory_error("main memory", (max_mem_size + 1) * sizeof(memory_word));
-
- return NULL;
- }
-
-/* first allocation should expand *both* lo and hi */
- if (hi_size == 0 && mem_end == mem_max)
- hi_size = lo_size;
-
- if (lo_size == 0 && mem_start == mem_min)
- lo_size = hi_size;
-
-/* try and prevent excessive frequent reallocations */
-/* while avoiding over allocation by too much */
- min_size = current_mem_size / 100 * percent_grow;
-
- if (lo_size + hi_size < min_size)
- {
- if (lo_size > 0 && hi_size > 0)
- {
- lo_size = min_size / 2;
- hi_size = min_size / 2;
- }
- else if (lo_size > 0)
- lo_size = min_size;
- else if (hi_size > 0)
- hi_size = min_size;
- }
-
- if (lo_size > 0 && lo_size < mem_top / 2)
- lo_size = mem_top / 2;
-
- if (hi_size > 0 && hi_size < mem_top / 2)
- hi_size = mem_top / 2;
-
- for (k = 0; k < MAXSPLITS; k++)
- {
- new_size = current_mem_size + lo_size + hi_size;
-
- if (new_size >= max_mem_size) /* bump against limit - ha ha ha */
- {
- while (new_size >= max_mem_size)
- {
- lo_size = lo_size / 2;
- hi_size = hi_size / 2;
- new_size = current_mem_size + lo_size + hi_size;
- }
- }
-
- n = (new_size + 1) * sizeof (memory_word);
-
- if (trace_flag)
- trace_memory("main memory", n);
-
- new_memory = (memory_word *) REALLOC (main_memory, n);
-
- if (new_memory != NULL)
- break; /* did we get it ? */
-
- if (current_mem_size == 0)
- break; /* in case we ever use for initial */
-
- lo_size = lo_size / 2; hi_size = hi_size / 2;
- }
-
- if (new_memory == NULL)
- {
- memory_error("main memory", n);
- return mem;
- }
-
- if (trace_flag)
- {
- sprintf(log_line, "New Address %s == %p\n", "main memory", new_memory);
- show_line(log_line, 0);
- }
-
- if (lo_size > 0)
- {
-/* shift everything upward to make space for new low area */
- if (trace_flag)
- {
- sprintf(log_line, "memmove %p %p %d \n", new_memory + lo_size,
- new_memory, (current_mem_size + 1) * sizeof(memory_word));
- show_line(log_line, 0);
- }
-
- memmove (new_memory + lo_size, new_memory,
- (current_mem_size + 1) * sizeof(memory_word));
-/* could reduce words moved by (mem_max - mem_end) */
- }
-
- main_memory = new_memory; /* remember for free later */
-
- if (lo_size > 0)
- mem_start = mem_start - lo_size; /* update lower limit */
-
- if (hi_size > 0)
- mem_max = mem_max + hi_size; /* update upper limit */
-
- update_statistics ((int) main_memory, n,
- (current_mem_size + 1) * sizeof (memory_word));
- current_mem_size = new_size;
-
- if (current_mem_size != mem_max - mem_start)
- {
- puts("ERROR: Impossible Memory Error");
- }
-
- if (mem_start != 0)
- mem = main_memory - mem_start;
- else
- mem = main_memory;
-
- if (trace_flag)
- probe_show();
-
- return mem;
-}
-#endif
-
-#ifdef ALLOCATEFONT
-int current_font_mem_size = 0;
-
-/* fmemoryword can be either halfword or memory_word */
-memory_word * realloc_font_info (int size)
-{
- memory_word * new_font_info = NULL;
- int k, min_size;
- int new_size = 0;
- int n = 0;
-
- if (trace_flag)
- {
- sprintf(log_line, "Old Address %s == %p\n", "font_info", font_info);
- show_line(log_line, 0);
- }
-/* during initial allocation, font_info == NULL - realloc acts like malloc */
-/* during initial allocation current_font_mem_size == 0 */
- if (current_font_mem_size == font_mem_size) /* if we REALLY run up to limit */
- {
-/* memory_error("font", (font_mem_size + 1) * sizeof(memory_word)); */
- return font_info; /* pass it back to TeX 99/Fabe/4 */
- }
-/* try and prevent excessive frequent reallocations */
-/* while avoiding over allocation by too much */
-/* min_size = current_font_mem_size / 2; */
- min_size = current_font_mem_size / 100 * percent_grow;
-
- if (size < min_size)
- size = min_size;
-
- if (size < initial_font_mem_size)
- size = initial_font_mem_size;
-
- for (k=0; k < MAXSPLITS; k++)
- {
- new_size = current_font_mem_size + size;
-
- if (new_size > font_mem_size)
- new_size = font_mem_size; /* bump against limit */
-
-/* important + 1 since fmemoryword font_info[font_mem_size + 1] original */
- n = (new_size + 1) * sizeof (memory_word);
-
- if (trace_flag)
- trace_memory("font_info", n);
-
- new_font_info = (memory_word *) REALLOC (font_info, n);
-
- if (new_font_info != NULL)
- break; /* did we get it ? */
-
- if (current_font_mem_size == 0)
- break; /* initial allocation must work */
-
- size = size / 2;
- }
-
- if (new_font_info == NULL)
- {
- memory_error("font", n);
- return font_info; /* try and continue !!! */
- }
-
- font_info = new_font_info;
-
- if (trace_flag)
- {
- sprintf(log_line, "New Address %s == %p\n", "font_info", font_info);
- show_line(log_line, 0);
- }
-
- update_statistics ((int) font_info, n, current_font_mem_size * sizeof(memory_word));
- current_font_mem_size = new_size;
-
- if (trace_flag)
- probe_show();
-
- return font_info;
-}
-#endif
-
-#ifdef ALLOCATESTRING
-int current_pool_size = 0;
-
-packed_ASCII_code * realloc_str_pool (int size)
-{
- int k, min_size;
- int new_size = 0;
- int n = 0;
- packed_ASCII_code *newstrpool = NULL;
-
- if (trace_flag)
- {
- sprintf(log_line, "Old Address %s == %p\n", "string pool", str_pool);
- show_line(log_line, 0);
- }
-
- if (current_pool_size == pool_size)
- {
-/* memory_error ("string pool", (pool_size + 1) * sizeof(packed_ASCII_code)); */
-/* exit (1); */
- return str_pool; /* pass it back to TeX 99/Fabe/4 */
- }
-
- min_size = current_pool_size / 100 * percent_grow;
-
- if (size < min_size)
- size = min_size;
-
- if (size < initial_pool_size)
- size = initial_pool_size;
-
- for (k = 0; k < MAXSPLITS; k++)
- {
- new_size = current_pool_size + size;
-
- if (new_size > pool_size)
- new_size = pool_size;
-/* important + 1 since packed_ASCII_code str_pool[pool_size + 1]; in original */
- n = (new_size + 1) * sizeof (packed_ASCII_code);
-
- if (trace_flag)
- trace_memory("str_pool", n);
-
- newstrpool = (packed_ASCII_code *) REALLOC (str_pool, n); /* 95/Sep/24 */
-
- if (newstrpool != NULL)
- break; /* did we get it ? */
-
- if (current_pool_size == 0)
- break; /* initial allocation must work */
-
- size = size / 2; /* else can retry smaller */
- }
-
- if (newstrpool == NULL)
- {
- memory_error("string pool", n);
- return str_pool; /* try and continue !!! */
- }
-
- str_pool = newstrpool;
- update_statistics ((int) str_pool, n, current_pool_size);
- current_pool_size = new_size;
-
- if (trace_flag)
- {
- sprintf(log_line, "New Address %s == %p\n", "string pool", str_pool);
- show_line(log_line, 0);
- }
-
- if (trace_flag)
- probe_show();
-
- return str_pool;
-}
-#endif
-
-#ifdef ALLOCATESTRING
-int current_max_strings = 0;
-
-pool_pointer *realloc_str_start (int size)
-{
- int k, min_size;
- int n = 0;
- int new_size = 0;
- pool_pointer * new_str_start = NULL;
-
- if (trace_flag)
- {
- sprintf(log_line, "Old Address %s == %p\n", "string start", str_start);
- show_line(log_line, 0);
- }
-
- if (current_max_strings == max_strings)
- {
-/* memory_error ("string pointer", (max_strings + 1) * sizeof(pool_pointer)); */
-/* exit (1); */
- return str_start; /* pass it back to TeX 99/Fabe/4 */
- }
-
- min_size = current_max_strings / 100 * percent_grow;
-
- if (size < min_size)
- size = min_size;
-
- if (size < initial_max_strings)
- size = initial_max_strings;
-
- for (k = 0; k < MAXSPLITS; k++)
- {
- new_size = current_max_strings + size;
-
- if (new_size > max_strings)
- new_size = max_strings;
-/* important + 1 since str_start[maxstring + 1] originally */
- n = (new_size + 1) * sizeof (pool_pointer);
-
- if (trace_flag)
- trace_memory("str_start", n);
-
- new_str_start = (pool_pointer *) REALLOC (str_start, n);
-
- if (new_str_start != NULL)
- break; /* did we get it ? */
-
- if (current_max_strings == 0)
- break; /* initial allocation must work */
-
- size = size / 2; /* otherwise can try smaller */
- }
-
- if (new_str_start == NULL)
- {
- memory_error("string pointer", n);
- return str_start; /* try and continue */
- }
-
- str_start = new_str_start;
- update_statistics((int) str_start, n, current_max_strings * sizeof (pool_pointer));
- current_max_strings = new_size;
-
- if (trace_flag)
- {
- sprintf(log_line, "New Address %s == %p\n", "string start", str_start);
- show_line(log_line, 0);
- }
-
- if (trace_flag)
- probe_show();
-
- return str_start;
-}
-#endif
-
-#ifdef ALLOCATEINI
-/* returns -1 if it fails */
-/* size == trie_size */
-int allocate_ini (int size)
-{
- int n, nl, no, nc, nr, nh, nt;
-
- nh = nr = nl = (size + 1) * sizeof(trie_pointer);
- no = (size + 1) * sizeof(trie_op_code);
- nc = (size + 1) * sizeof(packed_ASCII_code);
-/* nt = (size + 1) * sizeof(boolean); */
- nt = (size + 1) * sizeof(char);
- n = nl + no + nc + nr + nh + nt;
-/* n = (size + 1) * (sizeof(packed_ASCII_code) + sizeof(trie_op_code) +
- 3 * sizeof(trie_pointer) + sizeof (char)); */
- if (trace_flag)
- trace_memory ("iniTeX hyphen trie", n);
-
- trie_l = (trie_pointer *) malloc (roundup(nl));
- trie_o = (trie_op_code *) malloc (roundup(no));
- trie_c = (packed_ASCII_code *) malloc (roundup(nc));
- trie_r = (trie_pointer *) malloc (roundup(nr));
- trie_hash = (trie_pointer *) malloc (roundup(nh));
- trie_taken = (char *) malloc (roundup(nt));
-
- if (trie_c == NULL || trie_o == NULL || trie_l == NULL || trie_r == NULL ||
- trie_hash == NULL || trie_taken == NULL)
- {
- memory_error("iniTeX hyphen trie", n);
-// exit (1); /* serious error */
- return -1;
- }
-
- if (trace_flag)
- {
- sprintf(log_line, "Addresses trie_l %p trie_o %p trie_c %p\n", trie_l, trie_o, trie_c);
- show_line(log_line, 0);
- sprintf(log_line, "Addresses trie_r %p trie_hash %p trie_taken %p\n",
- trie_r, trie_hash, trie_taken);
- show_line(log_line, 0);
- }
-
- update_statistics ((int) trie_l, nl, 0);
- update_statistics ((int) trie_o, no, 0);
- update_statistics ((int) trie_c, nc, 0);
- update_statistics ((int) trie_r, nr, 0);
- update_statistics ((int) trie_hash, nh, 0);
- update_statistics ((int) trie_taken, nt, 0);
-/* trie_size = size; */ /* ??? */
- if (trace_flag)
- probe_show();
-
- return 0; // success
-}
-#endif
-
-#ifdef ALLOCATESAVESTACK
-int current_save_size = 0;
-
-memory_word *realloc_save_stack (int size)
-{
- int k, min_size;
- int n = 0, new_size = 0;
- memory_word * new_save_stack = NULL;
-
- if (trace_flag)
- {
- sprintf(log_line, "Old Address %s == %p\n", "save stack", save_stack);
- show_line(log_line, 0);
- }
-
- if (current_save_size == save_size) /* arbitrary limit */
- {
-/* memory_error ("save stack", (save_size + 1) * sizeof(memory_word)); */
-/* exit (1); */
- return save_stack; /* let TeX handle the error */
- }
-
- min_size = current_save_size / 100 * percent_grow;
-
- if (size < min_size)
- size = min_size;
-
- if (size < initial_save_size)
- size = initial_save_size;
-
- for (k = 0; k < MAXSPLITS; k++)
- {
- new_size = current_save_size + size;
-
- if (new_size > save_size)
- new_size = save_size;
-
- n = (new_size + 1) * sizeof (memory_word); /* save_stack[save_size + 1] */
-
- if (trace_flag)
- trace_memory("save_stack", n);
-
- new_save_stack = (memory_word *) REALLOC (save_stack, n);
-
- if (new_save_stack != NULL)
- break; /* did we get it ? */
-
- if (current_save_size == 0)
- break; /* initial allocation must work */
-
- size = size / 2; /* else can retry smaller */
- }
-
- if (new_save_stack == NULL)
- {
- memory_error("save stack", n);
- return save_stack; /* try and continue !!! */
- }
-
- save_stack = new_save_stack;
- update_statistics ((int) save_stack, n, current_save_size);
- current_save_size = new_size;
-
- if (trace_flag)
- {
- sprintf(log_line, "Current %s %d\n", "save_size", current_save_size);
- show_line(log_line, 0);
- sprintf(log_line, "New Address %s == %p\n", "save stack", save_stack);
- show_line(log_line, 0);
- }
-
- if (trace_flag)
- probe_show();
-
- return save_stack;
-}
-#endif
-
-#ifdef ALLOCATEINPUTSTACK
-int current_stack_size = 0; /* input stack size */
-
-in_state_record *realloc_input_stack (int size)
-{
- int k, min_size;
- int n = 0, new_size = 0;
- in_state_record * new_input_stack = NULL;
-
- if (trace_flag)
- {
- sprintf(log_line, "Old Address %s == %p\n", "input stack", input_stack);
- show_line(log_line, 0);
- }
-
- if (current_stack_size == stack_size) /* arbitrary limit */
- {
-/* memory_error ("input stack", (stack_size + 1) * sizeof(in_state_record)); */
-/* exit (1); */
- return input_stack;
- }
-
- min_size = current_stack_size / 100 * percent_grow;
-
- if (size < min_size)
- size = min_size;
-
- if (size < initial_stack_size)
- size = initial_stack_size;
-
- for (k = 0; k < MAXSPLITS; k++)
- {
- new_size = current_stack_size + size;
-
- if (new_size > stack_size)
- new_size = stack_size;
-
- n = (new_size + 1) * sizeof (in_state_record); /* input_stack[stack_size + 1] */
-
- if (trace_flag)
- trace_memory("input_stack", n);
-
- new_input_stack = (in_state_record *) REALLOC (input_stack, n);
-
- if (new_input_stack != NULL)
- break; /* did we get it ? */
-
- if (current_stack_size == 0)
- break; /* initial allocation must work */
-
- size = size / 2; /* else can retry smaller */
- }
-
- if (new_input_stack == NULL)
- {
- memory_error("input stack", n);
- return input_stack; /* try and continue !!! */
- }
-
- input_stack = new_input_stack;
- update_statistics ((int) input_stack, n, current_stack_size);
- current_stack_size = new_size;
-
- if (trace_flag)
- {
- sprintf(log_line, "Current %s %d\n", "stack_size", current_stack_size);
- show_line(log_line, 0);
- sprintf(log_line, "New Address %s == %p\n", "input stack", input_stack);
- show_line(log_line, 0);
- }
-
- if (trace_flag)
- probe_show(); /* 94/Mar/25 */
-
- return input_stack;
-}
-#endif
-
-#ifdef ALLOCATENESTSTACK
-int current_nest_size = 0; /* current nest size */
-
-list_state_record *realloc_nest_stack (int size)
-{
- int k, min_size;
- int n = 0, new_size = 0;
- list_state_record * new_nest = NULL;
-
- if (trace_flag)
- {
- sprintf(log_line, "Old Address %s == %p\n", "nest stack", nest);
- show_line(log_line, 0);
- }
-
- if (current_nest_size == nest_size) /* arbitrary limit */
- {
-/* memory_error ("nest stack", (nest_size + 1) * sizeof(list_state_record)); */
-/* exit (1); */
- return nest; /* let TeX handle the error */
- }
-
- min_size = current_nest_size / 100 * percent_grow;
-
- if (size < min_size)
- size = min_size;
-
- if (size < initial_nest_size)
- size = initial_nest_size;
-
- for (k = 0; k < MAXSPLITS; k++)
- {
- new_size = current_nest_size + size;
-
- if (new_size > nest_size)
- new_size = nest_size;
-
- n = (new_size + 1) * sizeof (list_state_record); /* nest[nest_size + 1] */
-
- if (trace_flag)
- trace_memory("nest stack", n);
-
- new_nest = (list_state_record *) REALLOC (nest, n);
-
- if (new_nest != NULL)
- break; /* did we get it ? */
-
- if (current_nest_size == 0)
- break; /* initial allocation must work */
-
- size = size / 2; /* else can retry smaller */
- }
-
- if (new_nest == NULL)
- {
- memory_error("nest stack", n);
- return nest; /* try and continue !!! */
- }
-
- nest = new_nest;
- update_statistics ((int) nest, n, current_nest_size);
- current_nest_size = new_size;
-
- if (trace_flag)
- {
- sprintf(log_line, "Current %s %d\n", "nest_size", current_nest_size);
- show_line(log_line, 0);
- sprintf(log_line, "New Address %s == %p\n", "nest stack", nest);
- show_line(log_line, 0);
- }
-
- if (trace_flag)
- probe_show();
-
- return nest;
-}
-#endif
-
-#ifdef ALLOCATEPARAMSTACK
-int current_param_size = 0;
-
-halfword *realloc_param_stack (int size)
-{
- int k, min_size;
- int n = 0, new_size = 0;
- halfword * new_param = NULL;
-
- if (trace_flag)
- {
- sprintf(log_line, "Old Address %s == %p\n", "param stack", param_stack);
- show_line(log_line, 0);
- }
-
- if (current_param_size == param_size) /* arbitrary limit */
- {
-/* memory_error ("param stack", (param_size + 1) * sizeof(halfword)); */
-/* exit (1); */
- return param_stack; /* let TeX handle the error */
- }
-
- min_size = current_param_size / 100 * percent_grow;
-
- if (size < min_size)
- size = min_size;
-
- if (size < initial_param_size)
- size = initial_param_size;
-
- for (k = 0; k < MAXSPLITS; k++)
- {
- new_size = current_param_size + size;
-
- if (new_size > param_size)
- new_size = param_size;
-
- n = (new_size + 1) * sizeof (halfword); /* param_stack[param_size + 1] */
-
- if (trace_flag)
- trace_memory("param stack", n);
-
- new_param = (halfword *) REALLOC (param_stack, n);
-
- if (new_param != NULL)
- break; /* did we get it ? */
-
- if (current_param_size == 0)
- break; /* initial allocation must work */
-
- size = size / 2; /* else can retry smaller */
- }
-
- if (new_param == NULL)
- {
- memory_error("param stack", n);
- return param_stack; /* try and continue !!! */
- }
-
- param_stack = new_param;
- update_statistics ((int) param_stack, n, current_param_size);
- current_param_size = new_size;
-
- if (trace_flag)
- {
- sprintf(log_line, "Current %s %d\n", "param_size", current_param_size);
- show_line(log_line, 0);
- sprintf(log_line, "New Address %s == %p\n", "param stack", param_stack);
- show_line(log_line, 0);
- }
-
- if (trace_flag)
- probe_show(); /* 94/Mar/25 */
-
- return param_stack;
-}
-#endif
-
-#ifdef ALLOCATEBUFFER
-int current_buf_size = 0;
-
-ASCII_code * realloc_buffer (int size)
-{
- int k, min_size;
- int n = 0, new_size = 0;
- ASCII_code * new_buffer = NULL;
-
- if (trace_flag)
- {
- sprintf(log_line, "Old Address %s == %p\n", "buffer", buffer);
- show_line(log_line, 0);
- }
-
- if (current_buf_size == buf_size)
- {
-/* memory_error ("buffer", buf_size); */
-/* exit (1); */
- return buffer; /* pass it back to TeX 99/Fabe/4 */
- }
-
- min_size = current_buf_size / 100 * percent_grow;
-
- if (size < min_size)
- size = min_size;
-
- if (size < initial_buf_size)
- size = initial_buf_size;
-
- for (k = 0; k < MAXSPLITS; k++)
- {
- new_size = current_buf_size + size;
-
- if (new_size > buf_size)
- new_size = buf_size;
-
- n = (new_size + 1) * sizeof(ASCII_code);
-
- if (trace_flag)
- trace_memory("buffer", n);
-
- new_buffer = (ASCII_code *) REALLOC (buffer, n);
-
- if (new_buffer != NULL)
- break; /* did we get it ? */
-
- if (current_buf_size == 0)
- break; /* initial allocation must work */
-
- size = size / 2;
- }
-
- if (new_buffer == NULL)
- {
- memory_error("buffer", n);
- return buffer; /* try and continue !!! */
- }
-
- buffer = new_buffer;
- update_statistics ((int) buffer, n, current_buf_size);
-
-#ifdef USEMEMSET
- memset(buffer + current_buf_size, 0, new_size - current_buf_size);
-#else
- for (k = current_buf_size; k < new_size; k++) buffer[k]= 0;
-#endif
-
- current_buf_size = new_size;
-
- if (trace_flag)
- {
- sprintf(log_line, "Current %s %d\n", "buffer", current_buf_size);
- show_line(log_line, 0);
- sprintf(log_line, "New Address %s == %p\n", "buffer", buffer);
- show_line(log_line, 0);
- }
-
- if (trace_flag)
- probe_show();
-
- return buffer;
-}
-#endif
-
-/* here is the main memory allocation routine -- calls the above */
-/* returns -1 if it fails */
-/* allocate rather than static 93/Nov/26 */
-int allocate_memory (void)
-{
-#ifdef ALLOCATEINPUTSTACK
- input_stack = NULL;
- current_stack_size = 0;
- input_stack = realloc_input_stack (initial_stack_size); /* + 1 */
-#endif
-
-#ifdef ALLOCATENESTSTACK
- nest = NULL;
- current_nest_size = 0;
- nest = realloc_nest_stack (initial_nest_size); /* + 1 */
-#endif
-
-#ifdef ALLOCATEPARAMSTACK
- param_stack = NULL;
- current_param_size = 0;
- param_stack = realloc_param_stack (initial_param_size); /* + 1 */
-#endif
-
-#ifdef ALLOCATESAVESTACK
- save_stack = NULL;
- current_save_size = 0;
- save_stack = realloc_save_stack (initial_save_size);
-#endif
-
-#ifdef IGNORED
- buffer = NULL; /* need to do earlier */
- current_buf_size = 0;
- buffer = realloc_buffer (initial_buf_size);
-#endif
-
-#ifdef ALLOCATESTRING
- str_pool = NULL;
- current_pool_size = 0;
- str_start = NULL;
- current_max_strings = 0;
-
-/* maybe taylor allocations to actual pool file 1300 strings 27000 bytes ? */
- if (is_initex)
- {
- if (trace_flag)
- puts("ini TeX pool and string allocation\n");
-
- str_pool = realloc_str_pool(initial_pool_size);
- str_start = realloc_str_start(initial_max_strings);
- }
-#endif
-
-/* the following can save a lot of the usual 800k fixed allocation */
-#ifdef ALLOCATEFONT
- font_info = NULL;
- current_font_mem_size = 0;
-/* if not iniTeX, then do initial allocation on fmt file read in itex.c */
-/* if ini-TeX we need to do it here - no format file read later */
- if (is_initex)
- font_info = realloc_font_info (initial_font_mem_size);
-#endif
-
-#ifdef ALLOCATEMAIN
- main_memory = NULL;
- mem = NULL;
- mem_min = mem_bot; /* just to avoid complaints in texbody */
- mem_top = mem_initex;
- mem_max = mem_top;
-/* allocate main memory here if this is iniTeX */
-/* otherwise wait for format undumping in itex.c ... */
- if (is_initex)
- {
-/* avoid this if format specified on command line ??? */
-/* allocate_main_memory(mem_initex); */ /* made variable ! */
- mem = allocate_main_memory(mem_initex); /* made variable ! */
- if (mem == NULL)
-// exit (1);
- return -1; /* serious error */
- }
-#endif
-
-/* now for the hyphenation exception stuff */
-#ifdef ALLOCATEHYPHEN
- hyph_word = NULL;
- hyph_list = NULL;
-/* this will be overridden later by what is in format file */
- hyphen_prime = default_hyphen_prime;
-/* non ini-TeX use assumes format will be read and that specifies size */
- if (is_initex)
- {
- if (new_hyphen_prime)
- hyphen_prime = new_hyphen_prime;
-
- if (realloc_hyphen(hyphen_prime)) /* allocate just in case no format */
- return -1;
- }
-#endif
-
-/* now for memory for the part of the hyphenation stuff that always needed */
-/* if iniTeX, need to allocate pre-determined fixed amount - trie_size */
-/* if iniTeX not selected, allocate only enough later - undump in itex.c ! */
-#ifdef ALLOCATETRIES
- if (is_initex)
- {
- if (allocate_tries (trie_size))
- return -1;
- }
-#endif
-
-/* now for memory for hyphenation stuff needed only when running iniTeX */
-#ifdef ALLOCATEINI
- if (is_initex)
- {
- if (allocate_ini(trie_size))
- return -1;
- }
- else
- {
- trie_l = trie_r = trie_o = trie_hash = NULL; /* (trie_size + 1) * integer */
- trie_c = NULL; /* (trie_size + 1) * char */
- trie_taken = NULL; /* (trie_size + 1) * boolean */
- }
-#endif
-
- return 0; // success
-}
-
-/* returns non-zero if error - done to test integrity of stack mostly */
-int free_memory (void)
-{
- unsigned int heap_total = 0;
-
- if (trace_flag)
- puts("free_memory ");
-
- if (verbose_flag || trace_flag)
- show_maximums(stdout);
-
- if (trace_flag)
- {
- sprintf(log_line, "Heap total: %u bytes --- max address %u\n",
- heap_total, max_address);
- show_line(log_line, 0);
- }
-
- if (trace_flag)
- {
- printf("Main Memory: variable node %lld (%lld - %ld);\n"
- " one word %ld (%ld - %ld)\n",
- lo_mem_max - mem_min, mem_min, lo_mem_max,
- mem_end - hi_mem_min, hi_mem_min, mem_end);
- }
-
- if (trace_flag)
- puts("Freeing memory again");
-
-/* only free memory if safe ... additional check */
-#ifdef ALLOCATEINI
- if (is_initex)
- {
- if (trie_taken != NULL)
- free(trie_taken);
-
- if (trie_hash != NULL)
- free(trie_hash);
-
- if (trie_r != NULL)
- free(trie_r);
-
- if (trie_c != NULL)
- free(trie_c);
-
- if (trie_o != NULL)
- free(trie_o);
-
- if (trie_l != NULL)
- free(trie_l);
-
- trie_taken = NULL;
- trie_hash = trie_l = trie_r = NULL;
- trie_c = NULL;
- trie_o = NULL;
- }
-#endif
-
-#ifdef ALLOCATETRIES
- if (trie_trc != NULL)
- free (trie_trc);
-
- if (trie_tro != NULL)
- free (trie_tro);
-
- if (trie_trl != NULL)
- free (trie_trl);
-
- trie_trc = NULL;
- trie_tro = trie_trl = NULL;
-#endif
-
-#ifdef ALLOCATEHYPHEN
- if (hyph_list != NULL)
- free(hyph_list);
-
- if (hyph_word != NULL)
- free(hyph_word);
-
- hyph_list = NULL;
- hyph_word = NULL;
-#endif
-
-#ifdef ALLOCATEMAIN
- if (main_memory != NULL)
- free(main_memory);
-
- main_memory = NULL;
-#endif
-
-#ifdef ALLOCATEFONT
- if (font_info != NULL)
- free(font_info);
-
- font_info = NULL;
-#endif
-
-#ifdef ALLOCATESTRING
- if (str_start != NULL)
- free(str_start);
-
- if (str_pool != NULL)
- free(str_pool);
-
- str_start = NULL;
- str_pool = NULL;
-#endif
-
-#ifdef ALLOCATEPARAMSTACK
- if (param_stack != NULL)
- free(param_stack);
-
- param_stack = NULL;
-#endif
-
-#ifdef ALLOCATENESTSTACK
- if (nest != NULL)
- free(nest);
-
- nest = NULL;
-#endif
-
-#ifdef ALLOCATEINPUTSTACK
- if (input_stack != NULL)
- free(input_stack);
-
- input_stack = NULL;
-#endif
-
-#ifdef ALLOCATESAVESTACK
- if (save_stack != NULL)
- free(save_stack);
-
- save_stack = NULL;
-#endif
-
- if (format_file != NULL)
- free(format_file);
-
- if (source_direct != NULL)
- free(source_direct);
-
- format_file = source_direct = NULL;
-
- if (dvi_file_name != NULL)
- free(dvi_file_name);
-
- if (log_file_name != NULL)
- free(log_file_name);
-
- if (pdf_file_name != NULL)
- free(pdf_file_name);
-
- pdf_file_name = log_file_name = dvi_file_name = NULL;
-
- return 0;
-}
-
-boolean prime (int x)
-{
- int k;
- int sum = 1; /* 1 + 3 + 5 + k = (k + 1) * (k + 1) / 4 */
-
- if (x % 2 == 0)
- return false;
-
- for (k = 3; k < x; k = k + 2)
- {
- if (x % k == 0)
- return false;
-
- if (sum * 4 > x)
- return true;
-
- sum += k;
- }
-
- return true;
-}
-
-int quitflag = 0;
-boolean show_use = false;
-boolean floating = false;
-
-void complainarg (int c, char *s)
-{
- sprintf(log_line, "ERROR: Do not understand `%c' argument value `%s'\n", c, s);
- show_line(log_line, 1);
- show_use = 1;
-}
-
-/* following is list of allowed command line flags and args */
-
-char *allowedargs = "+bcdfijnpqrstvwyzABCDFGIJKLMNOPQRSTVWXYZ023456789?a=e=g=h=k=l=m=o=u=x=E=H=P=U=";
-
-void reorderargs (int ac, char **av)
-{
- int n, m;
- char *s, *t;
- char takeargs[256]; /* large enough for all command line arg chars */
-
- if (ac < 3)
- {
- return; /* no args ! */
- }
-
- s = allowedargs;
- t = takeargs; /* list of those that take args */
-
- while (*s != '\0' && *(s + 1) != '\0')
- {
- if (*(s + 1) == '=')
- *t++ = *s++; /* copy over --- without the = */
-
- s++;
- }
-
- *t = '\0';
-
- if (trace_flag)
- {
- show_line(takeargs, 0);
- show_char('\n');
- }
-
- n = 1;
-
- for (;;)
- {
- if (*av[n] != '-')
- break;
-
- if (n + 1 < ac && *(av[n] + 2) == '\0' &&
- strchr(takeargs, *(av[n] + 1)) != NULL)
- n += 2; /* step over it */
- else
- n++;
-
- if (n == ac)
- break;
- }
-
- for (;;)
- {
- if (n == ac)
- break;
-
- m = n;
-
- while (m < ac && *av[m] != '-')
- m++; /* first command */
-
- if (m == ac)
- break;
-/* does it take an argument ? and is this argument next ? */
-/* check first whether the `-x' is isolated, or arg follows directly */
-/* then check whether this is one of those that takes an argument */
- if (m+1 < ac && *(av[m] + 2) == '\0' &&
- strchr(takeargs, *(av[m] + 1)) != NULL)
- {
- s = av[m]; /* move command down before non-command */
- t = av[m + 1];
-
- for (; m > n; m--)
- av[m + 1] = av[m - 1];
-
- av[n] = s;
- av[n + 1] = t;
- n += 2; /* step over moved args */
- }
- else
- {
- s = av[m]; /* move command down before non-command */
-
- for (; m > n; m--)
- av[m] = av[m - 1];
-
- av[n] = s;
- n++; /* step over moved args */
- }
- }
-}
-
-int test_align (int address, int size, char *str)
-{
- int n;
-
- if (size > 4)
- n = address % 4;
- else
- n = address % size;
-
- if (n != 0)
- {
- sprintf(log_line, "OFFSET %d (ELEMENT %d) in %s\n", n, size, str);
- show_line(log_line, 0);
- }
-
- return n;
-}
-
-/* activate detailed checking of alignment when trace_flag is set */
-
-void check_fixed_align (int flag)
-{
- (void) flag;
-
- if (test_align ((int) &mem_top, 4, "FIXED ALIGNMENT"))
- {
- puts("PLEASE RECOMPILE ME!\n");
- }
-
-#ifdef CHECKALIGNMENT
- if (!flag)
- return;
-
- test_align ((int) &mem_top, 4, "mem_top");
- test_align ((int) &mem_max, 4, "mem_max");
- test_align ((int) &mem_min, 4, "mem_min");
- test_align ((int) &bad, 4, "bad");
- test_align ((int) &trie_size, 4, "trie_size");
- test_align ((int) &xord, sizeof(xord[0]), "xord"); /* no op */
- test_align ((int) &xchr, sizeof(xchr[0]), "xchr"); /* no op */
- test_align ((int) &name_length, 4, "name_length");
- test_align ((int) &first, 4, "first");
- test_align ((int) &last, 4, "last");
- test_align ((int) &max_buf_stack, 4, "max_buf_stack");
- test_align ((int) &pool_ptr, 4, "pool_ptr");
- test_align ((int) &str_ptr, 4, "str_ptr");
- test_align ((int) &init_pool_ptr, 4, "init_pool_ptr");
- test_align ((int) &init_str_ptr, 4, "init_str_ptr");
- test_align ((int) &log_file, 4, "log_file");
- test_align ((int) &tally, 4, "tally");
- test_align ((int) &term_offset, 4, "term_offset");
- test_align ((int) &file_offset, 4, "file_offset");
- test_align ((int) &trick_count, 4, "trick_count");
- test_align ((int) &first_count, 4, "first_count");
- test_align ((int) &deletions_allowed, 4, "deletions_allowed");
- test_align ((int) &set_box_allowed, 4, "set_box_allowed");
- test_align ((int) &help_line, sizeof(help_line[0]), "help_line");
- test_align ((int) &use_err_help, 4, "use_err_help");
- test_align ((int) &interrupt, 4, "interrupt");
- test_align ((int) &OK_to_interrupt, 4, "OK_to_interrupt");
- test_align ((int) &arith_error, 4, "arith_error");
- test_align ((int) &tex_remainder, 4, "tex_remainder");
- test_align ((int) &temp_ptr, 4, "temp_ptr");
- test_align ((int) &lo_mem_max, 4, "lo_mem_max");
- test_align ((int) &hi_mem_min, 4, "hi_mem_min");
- test_align ((int) &var_used, 4, "var_used");
- test_align ((int) &dyn_used, 4, "dyn_used");
- test_align ((int) &avail, 4, "avail");
- test_align ((int) &mem_end, 4, "mem_end");
- test_align ((int) &mem_start, 4, "mem_start");
- test_align ((int) &rover, 4, "rover");
- test_align ((int) &font_in_short_display, 4, "font_in_short_display");
- test_align ((int) &depth_threshold, 4, "depth_threshold");
- test_align ((int) &breadth_max, 4, "breadth_max");
- test_align ((int) &nest, sizeof(nest[0]), "nest");
-/* test_align ((int) &xeq_level, sizeof(xeq_level[0]), "xeq_level"); */
- test_align ((int) &zzzad, sizeof(zzzad[0]), "zzzad");
-/* test_align ((int) &hash, sizeof(hash[0]), "hash"); */
- test_align ((int) &zzzae, sizeof(zzzae[0]), "zzzae");
-
- test_align ((int) &save_stack, sizeof(save_stack[0]), "save_stack");
- test_align ((int) &input_stack, sizeof(input_stack[0]), "input_stack");
- test_align ((int) &input_file, sizeof(input_file[0]), "input_file");
- test_align ((int) &line_stack, sizeof(line_stack[0]), "line_stack");
- test_align ((int) ¶m_stack, sizeof(param_stack[0]), "param_stack");
- test_align ((int) &cur_mark, sizeof(cur_mark[0]), "cur_mark");
- test_align ((int) &pstack, sizeof(pstack[0]), "pstack");
- test_align ((int) &read_file, sizeof(read_file[0]), "read_file");
-
- test_align ((int) &font_check, sizeof(font_check[0]), "font_check");
- test_align ((int) &font_size, sizeof(font_size[0]), "font_size");
- test_align ((int) &font_dsize, sizeof(font_dsize[0]), "font_dsize");
- test_align ((int) &font_params, sizeof(font_params[0]), "font_params");
- test_align ((int) &font_name, sizeof(font_name[0]), "font_name");
- test_align ((int) &font_area, sizeof(font_area[0]), "font_area");
- test_align ((int) &font_bc, sizeof(font_bc[0]), "font_bc");
- test_align ((int) &font_ec, sizeof(font_ec[0]), "font_ec");
- test_align ((int) &font_glue, sizeof(font_glue[0]), "font_glue");
- test_align ((int) &font_used, sizeof(font_used[0]), "font_used");
- test_align ((int) &hyphen_char, sizeof(hyphen_char[0]), "hyphen_char");
- test_align ((int) &skew_char, sizeof(skew_char[0]), "skew_char");
- test_align ((int) &bchar_label, sizeof(bchar_label[0]), "bchar_label");
- test_align ((int) &font_bchar, sizeof(font_bchar[0]), "font_bchar");
- test_align ((int) &font_false_bchar, sizeof(font_false_bchar[0]), "font_false_bchar");
- test_align ((int) &char_base, sizeof(char_base[0]), "char_base");
- test_align ((int) &width_base, sizeof(width_base[0]), "width_base");
- test_align ((int) &height_base, sizeof(height_base[0]), "height_base");
- test_align ((int) &depth_base, sizeof(depth_base[0]), "depth_base");
- test_align ((int) &italic_base, sizeof(italic_base[0]), "italic_base");
- test_align ((int) &lig_kern_base, sizeof(lig_kern_base[0]), "lig_kern_base");
- test_align ((int) &kern_base, sizeof(kern_base[0]), "kern_base");
- test_align ((int) &exten_base, sizeof(exten_base[0]), "exten_base");
- test_align ((int) ¶m_base, sizeof(param_base[0]), "param_base");
-
-#ifdef ALLOCATEDVIBUF
- test_align ((int) &zdvibuf, sizeof(zdvibuf[0]), "zdvibuf"); /* no op */
-#endif
-
- test_align ((int) &total_stretch, sizeof(total_stretch[0]), "total_stretch");
- test_align ((int) &total_shrink, sizeof(total_shrink[0]), "total_shrink");
- test_align ((int) &active_width, sizeof(active_width[0]), "active_width");
- test_align ((int) &cur_active_width, sizeof(cur_active_width[0]), "cur_active_width");
- test_align ((int) &background, sizeof(background[0]), "background");
- test_align ((int) &break_width, sizeof(break_width[0]), "break_width");
- test_align ((int) &minimal_demerits, sizeof(minimal_demerits[0]), "minimal_demerits");
- test_align ((int) &best_place, sizeof(best_place[0]), "best_place");
- test_align ((int) &best_pl_line, sizeof(best_pl_line[0]), "best_pl_line");
- test_align ((int) &hc, sizeof(hc[0]), "hc");
- test_align ((int) &hu, sizeof(hu[0]), "hu");
- test_align ((int) &hyf, sizeof(hyf[0]), "hyf");
-/* test_align ((int) &x, sizeof(x[0]), "x"); */
-
- test_align ((int) &hyf_distance, sizeof(hyf_distance[0]), "hyf_distance");
- test_align ((int) &hyf_num, sizeof(hyf_num[0]), "hyf_num");
- test_align ((int) &hyf_next, sizeof(hyf_next[0]), "hyf_next");
- test_align ((int) &op_start, sizeof(op_start[0]), "op_start");
-
-/* test_align ((int) &trie_op_hash, sizeof(trie_op_hash[0]), "trie_op_hash"); */
- test_align ((int) &zzzaf, sizeof(zzzaf[0]), "zzzaf");
- test_align ((int) &trie_used, sizeof(trie_used[0]), "trie_used");
-/* test_align ((int) &trie_op_lang, sizeof(trie_op_lang[0]), "trie_op_lang");*/
- test_align ((int) &trie_op_val, sizeof(trie_op_val[0]), "trie_op_val");
-
- test_align ((int) &trie_min, sizeof(trie_min[0]), "trie_min");
- test_align ((int) &page_so_far, sizeof(page_so_far[0]), "page_so_far");
- test_align ((int) &write_file, sizeof(write_file[0]), "write_file");
- test_align ((int) &write_open, sizeof(write_open[0]), "write_open");
-#endif
-}
-
-void check_alloc_align (int flag)
-{
- (void) flag;
-
- if (test_align((int) eqtb, sizeof(eqtb[0]), "ALLOCATED ALIGNMENT"))
- puts("PLEASE RECOMPILE ME!\n");
-
-#ifdef CHECKALIGNMENT
- if (!flag)
- return;
-
-#ifndef ALLOCZEQTB
- test_align ((int) zeqtb, sizeof(zeqtb[0]), "zeqtb");
-#endif
-
-#ifndef ALLOCATEDVIBUF
- test_align ((int) &zdvibuf, sizeof(zdvibuf[0]), "zdvibuf"); /* no op */
-#endif
-
- test_align ((int) str_pool, sizeof(str_pool[0]), "str_pool"); /* no op */
- test_align ((int) str_start, sizeof(str_start[0]), "str_start");
- test_align ((int) zmem, sizeof(zmem[0]), "main memory");
- test_align ((int) font_info, sizeof(font_info[0]), "font memory");
- test_align ((int) trie_trl, sizeof(trie_trl[0]), "trie_trl");
- test_align ((int) trie_tro, sizeof(trie_tro[0]), "trie_tro");
- test_align ((int) trie_trc, sizeof(trie_trc[0]), "trie_trc");
- test_align ((int) hyph_word, sizeof(hyph_word[0]), "hyph_word");
- test_align ((int) hyph_list, sizeof(hyph_list[0]), "hyph_list");
-/* test_align ((int) trie_c, sizeof(trie_c[0]), "trie_c"); *//* no op */
- test_align ((int) trie_o, sizeof(trie_o[0]), "trie_o");
- test_align ((int) trie_l, sizeof(trie_l[0]), "trie_l");
- test_align ((int) trie_r, sizeof(trie_r[0]), "trie_r");
- test_align ((int) trie_hash, sizeof(trie_hash[0]), "trie_hash");
- test_align ((int) trie_taken, sizeof(trie_taken[0]), "trie_taken");
-#endif
-}
-
-boolean backwardflag = false; /* don't cripple all advanced features */
-boolean shorten_file_name = false; /* don't shorten file names to 8+3 for DOS */
-boolean usesourcedirectory = true; /* use source file directory as local when WorkingDirectory is set */
-
-/* cache to prevent allocating twice in a row */
-
-char *lastname = NULL, *lastvalue = NULL;
-
-/* returns allocated string -- these strings are not freed again */
-/* is it safe to do that now ? 98/Jan/31 */
-char * grabenv (char * varname)
-{
- char *s;
-
- if (varname == NULL)
- return NULL;
-
- if (*varname == '\0')
- return NULL;
-
- if (lastname != NULL && strcasecmp(lastname, varname) == 0)
- {
- if (trace_flag)
- {
- sprintf(log_line, "Cache hit: %s=%s\n", lastname, lastvalue);
- show_line(log_line, 0);
- }
-
- return xstrdup(lastvalue);
- }
-
- s = getenv(varname);
-
- if (s != NULL)
- {
- if (lastname != NULL)
- free(lastname);
-
- lastname = xstrdup(varname);
-
- if (lastvalue != NULL)
- free(lastvalue);
-
- lastvalue = xstrdup(s);
-
- return xstrdup(s);
- }
- else
- return NULL;
-}
-
-void flush_trailing_slash (char *directory)
-{
- char *s;
-
- if (strcmp(directory, "") != 0)
- {
- s = directory + strlen(directory) - 1;
-
- if (*s == '\\' || *s == '/')
- *s = '\0';
- }
-}
-
-void knuthify (void)
-{
- restrict_to_ascii = false; /* don't complain non ASCII */
- allow_patterns = false; /* don't allow pattern redefinition */
- show_in_hex = true; /* show character code in hex */
- show_in_dos = false; /* redundant with previous */
- show_numeric = false; /* don't show character code decimal */
- show_missing = false; /* don't show missing characters */
- civilize_flag = false; /* don't reorder date fields */
- c_style_flag = false; /* don't add file name to error msg */
- show_fmt_flag = false; /* don't show format file in log */
- show_tfm_flag = false; /* don't show metric file in log */
- tab_step = 0;
- show_line_break_stats = false; /* do not show line break stats */
- show_fonts_used = false;
- default_rule = 26214; /* revert to default rule thickness */
- pseudo_tilde = false;
- pseudo_space = false;
- show_texinput_flag = false;
- truncate_long_lines = false;
- allow_quoted_names = false;
- show_cs_names = false;
- font_dimen_zero = false;
- ignore_frozen = false;
- suppress_f_ligs = false;
- full_file_name_flag = false;
- knuth_flag = true; /* so other code can know about this */
-}
-
-/* following made global so analyze_flag can be made separate procedure */
-
-char * xchr_file = NULL;
-char * repl_file = NULL;
-
-char * short_options = "m:e:h:0:H:g:P:o:l:a:wvpiKLZMdp2t?u";
-
-static struct option long_options[] =
-{
- {"main-memory", 1, 0, 'm'},
- {"hyph-size", 1, 0, 'e'},
- {"trie-size", 1, 0, 'h'},
- {"backend", 1, 0, '0'},
- {"tab-step", 1, 0, 'H'},
- {"percent-grow", 1, 0, 'g'},
- {"default-rule", 1, 0, 'P'},
- {"dvi-dir", 1, 0, 'o'},
- {"log-dir", 1, 0, 'l'},
- {"aux-dir", 1, 0, 'a'},
- {"showhex", 0, 0, 'w'},
- {"verbose", 0, 0, 'v'},
- {"patterns", 0, 0, 'p'},
- {"initex", 0, 0, 'i'},
- {"knuthify", 0, 0, 'K'},
- {"cstyle", 0, 0, 'L'},
- {"showtfm", 0, 0, 'Z'},
- {"showmissing", 0, 0, 'M'},
- {"deslash", 0, 0, 'd'},
- {"patterns", 0, 0, 'p'},
- {"suppressflig", 0, 0, '2'},
- {"trace", 0, 0, 't'},
- {"help", 0, 0, '?'},
- {"usage", 0, 0, 'u'},
- {NULL, 0, 0, 0}
-};
-
-int analyze_flag (int c, char *optarg)
-{
- switch (c)
- {
- case 'v':
- want_version = true;
- verbose_flag = true;
- break;
- case 'i':
- is_initex = true;
- break;
- case 'Q':
- interaction = batch_mode; /* quiet mode */
- break;
- case 'R':
- interaction = nonstop_mode; /* run mode */
- break;
- case 'S':
- interaction = scroll_mode; /* scroll mode */
- break;
- case 'T':
- interaction = error_stop_mode; /* tex mode */
- break;
- case 'K':
- backwardflag = true;
- knuthify(); /* revert to `standard' Knuth TeX */
- break;
- case 'L':
- c_style_flag = true; /* C style error msg 94/Mar/21 */
- break;
- case 'Z':
- show_tfm_flag = true; /* show TFM in log file 94/Jun/21 */
- break;
- case 'M':
- show_missing = false; /* do not show missing 94/June/10 */
- break;
- case 'd':
- deslash = false; /* flipped 93/Nov/18 */
- /* pseudo_tilde = 0; */ /* new 95/Sep/26 */
- break;
- case 'p':
- allow_patterns = true; /* 93/Nov/26 */
- /* reset_exceptions = true; */ /* 93/Dec/23 */
- break;
-/* case 'w': show_in_hex = false; */ /* 94/Jan/26 */
- case 'w':
- show_in_hex = true; /* flipped 00/Jun/18 */
- break;
- case 'j':
- show_in_dos = true; /* 96/Jan/26 */
- break;
- case 'n':
- restrict_to_ascii = true; /* 0 - 127 1994/Jan/21 */
- break;
- case '7':
- usesourcedirectory = false; /* use working dir 98/Sep/29 */
- break;
- case 'f':
- show_fonts_used = false; /* 97/Dec/24 */
- break;
- case '8':
- shorten_file_name = true; /* 95/Feb/20 */
- break;
- case '9':
- show_cs_names = true; /* 98/Mar/31 */
- break;
- case '4':
- ignore_frozen = true; /* 98/Oct/5 */
- break;
- case '5':
- font_dimen_zero = false; /* 98/Oct/5 */
- break;
- case 'F':
- show_texinput_flag = false; /* 98/Jan/28 */
- break;
-/* case 'X': truncate_long_lines = false; */ /* 98/Feb/2 */
- /* break; */
- case 'J':
- show_line_break_stats = false; /* 96/Feb/8 */
- break;
- case 'O':
- show_fmt_flag = false; /* 94/Jun/21 */
- break;
- case '2':
- suppress_f_ligs = true; /* 99/Jan/5 f-lig */
- break;
- case 'z':
- full_file_name_flag = false; // 00 Jun 18
- break;
- case 't':
- trace_flag = true;
- break;
- case 'q':
- quitflag++; /* 93/Dec/16 */
- break;
-/* The following are really obscure and should not be advertized */
- case 's':
- show_current = false; /* tex8 93/Dec/14 */
- break;
- case 'N':
- show_numeric = false; /* 93/Dec/21 */
- break;
- case 'A':
- civilize_flag = false; /* 93/Dec/16 */
- break;
- case 'B':
- open_trace_flag = true; /* openinou 1994/Jan/8 */
- break;
- case 'Y':
- reorder_arg_flag = false; /* local */
- break;
-
- case 'm':
- if (optarg == 0)
- mem_initex = mem_top;
- else
- mem_initex = atoi(optarg) * 1024;
-
- if (mem_initex == 0)
- complainarg(c, optarg);
-
- mem_spec_flag = 1;
- break;
-
-#ifdef VARIABLETRIESIZE
- case 'h':
- if (optarg == 0)
- trie_size = default_trie_size;
- else
- trie_size = atoi(optarg);
-
- if (trie_size == 0)
- complainarg(c, optarg);
- break;
-#endif
-
-#ifdef ALLOCATEHYPHEN
- case 'e':
- if (optarg == 0)
- new_hyphen_prime = hyphen_prime * 2;
- else
- new_hyphen_prime = atoi(optarg);
-
- if (new_hyphen_prime == 0)
- complainarg(c, optarg);
-
- break;
-#endif
- case 'g':
- if (optarg == 0)
- percent_grow = 62;
- else
- percent_grow = atoi(optarg);
-
- if (percent_grow == 0)
- complainarg(c, optarg);
-
- break;
-
- case 'U':
- if (optarg == 0)
- pseudo_tilde = 0;
- else
- pseudo_tilde = atoi(optarg);
-
- if (pseudo_tilde > 255)
- pseudo_tilde = 255;
- else if (pseudo_tilde < 128)
- pseudo_tilde = 128;
-
- break;
-
- case 'H':
- if (optarg == 0)
- tab_step = 8;
- else
- tab_step = atoi(optarg);
- if (tab_step == 0)
- complainarg(c, optarg);
- break;
- case 'x':
- if (optarg == 0)
- xchr_file = xstrdup("xchr.map");
- else
- xchr_file = xstrdup(optarg);
-
- if (xchr_file == NULL || *xchr_file == '\0')
- complainarg(c, optarg);
- break;
- case 'k':
- if (optarg == 0)
- repl_file = xstrdup("repl.key");
- else
- repl_file = xstrdup(optarg);
-
- if (repl_file == NULL || *repl_file == '\0')
- complainarg(c, optarg);
- break;
- case 'P':
- if (optarg == 0)
- default_rule = 26214;
- else
- default_rule = atoi(optarg);
-
- if (default_rule == 0)
- complainarg(c, optarg);
- break;
- case 'E':
- if (optarg != 0)
- putenv(optarg);
- else
- complainarg(c, optarg);
- break;
- case 'o':
- if (optarg == 0)
- dvi_directory = "";
- else
- dvi_directory = xstrdup(optarg);
-
- if (strcmp(dvi_directory, "") == 0)
- complainarg(c, optarg);
-
- break;
- case '0':
- {
- char * format_spec = NULL;
-
- if (optarg != 0)
- format_spec = xstrdup(optarg);
-
- if (!strcmp(format_spec, "pdf"))
- shipout_flag = out_pdf_flag;
- else if (!strcmp(format_spec, "dvi"))
- shipout_flag = out_dvi_flag;
- else if (!strcmp(format_spec, "xdv"))
- shipout_flag = out_xdv_flag;
- else
- {
- sprintf(log_line, "ERROR: Do not understand shipout flag `%s'\n", format_spec);
- show_line(log_line, 1);
- }
- }
- break;
- case 'l':
- if (optarg == 0)
- log_directory = "";
- else
- log_directory = xstrdup(optarg);
-
- if (strcmp(log_directory, "") == 0)
- complainarg(c, optarg);
-
- break;
-
- case 'a':
- if (optarg == 0)
- aux_directory = "";
- else
- aux_directory = xstrdup(optarg);
-
- if (strcmp(aux_directory, "") == 0)
- complainarg(c, optarg);
-
- break;
-
- case '?':
- default:
- show_use = true;
- return -1;
- break;
- }
-
- return 0;
-}
-
-void strip_name (char *pathname)
-{
- char *s;
-
- if ((s = strrchr(pathname, '\\')) != NULL)
- ;
- else if ((s = strrchr(pathname, '/')) != NULL)
- ;
- else if ((s = strrchr(pathname, ':')) != NULL)
- s++;
- else
- s = pathname;
-
- *s = '\0';
-}
-
-int read_command_line (int ac, char **av)
-{
- int c;
- char *optargnew;
- int option_idx = 0;
-
- if (ac < 2)
- return 0;
-
- while ((c = getopt_long_only(ac, av, short_options, long_options, &option_idx)) != EOF)
- {
- if (optarg != 0 && *optarg == '=')
- optargnew = optarg + 1;
- else
- optargnew = optarg;
-
- analyze_flag (c, optargnew);
- }
-
- if (show_use || quitflag == 3)
- {
- stamp_it(log_line);
- strcat(log_line, "\n");
- show_line(log_line, 0);
- //stampcopy(log_line);
- //strcat(log_line, "\n");
- //show_line(log_line, 0);
-
- if (show_use)
- show_usage();
- else if (quitflag == 3)
- {
- strcat(log_line, "\n");
- show_line(log_line, 0);
- }
-
- return -1; // failure
- }
-
- if (repl_file != NULL && *repl_file != '\0')
- {
- if (read_xchr_file(repl_file, 1, av))
- {
- if (trace_flag)
- puts("KEY REPLACE ON\n");
-
- key_replace = true;
- }
- }
-
- if (xchr_file != NULL && *xchr_file != '\0')
- {
- if (read_xchr_file(xchr_file, 0, av))
- {
- if (trace_flag)
- puts("NON ASCII ON\n");
-
- non_ascii = true;
- }
- }
-
- return 0;
-}
-
-int init_commands (int ac, char **av)
-{
- shipout_flag = out_dvi_flag;
- is_initex = false;
- allow_patterns = false;
- reset_exceptions = false;
- non_ascii = false;
- key_replace = false;
- want_version = false;
- open_trace_flag = false;
- trace_flag = false;
- verbose_flag = false;
- restrict_to_ascii = false;
- show_in_hex = false; /* default is not to show as hex code ^^ 00/Jun/18 */
- show_in_dos = false; /* default is not to translate to DOS 850 */
- return_flag = true; // hard wired now
- trimeof = true; // hard wired now
- deslash = true;
- pseudo_tilde = 254; /* default '~' replace 95/Sep/26 filledbox DOS 850 */
- pseudo_space = 255; /* default ' ' replace 97/June/5 nbspace DOS 850 */
- default_rule = 26214; /* default rule variable 95/Oct/9 */
- show_current = true;
- civilize_flag = true;
- show_numeric = true;
- show_missing = true;
- c_style_flag = false; /* use c-style error output */
- show_fmt_flag = true; /* show format file in log */
- show_tfm_flag = false; /* don't show metric file in log */
- shorten_file_name = false; /* don't shorten file names to 8+3 */
- show_texinput_flag = true; /* show TEXINPUTS and TEXFONTS */
- truncate_long_lines = true; /* truncate long lines */
- tab_step = 0; /* do not replace tabs with spaces */
- show_line_break_stats = true; /* show line break statistics 96/Feb/8 */
- show_fonts_used = true; /* show fonts used in LOG file 97/Dec/24 */
- allow_quoted_names = true; /* allow quoted names with spaces 98/Mar/15 */
- show_cs_names = false;
- knuth_flag = false; /* allow extensions to TeX */
- full_file_name_flag = true; /* new default 2000 June 18 */
- errout = stdout; /* as opposed to stderr say --- used ??? */
- new_hyphen_prime = 0;
-
-#ifdef VARIABLETRIESIZE
-/* trie_size = default_trie_size; */
- trie_size = 0;
-#endif
-
- mem_extra_high = 0;
- mem_extra_low = 0;
- mem_initex = 0;
-
- format_name = "plain";
-
- encoding_name = "";
-
- if (read_command_line(ac, av) < 0)
- return -1;
-
- if (optind == 0)
- optind = ac;
-
-/*
- if (want_version)
- {
- stamp_it(log_line);
- strcat(log_line, "\n");
- show_line(log_line, 0);
- stampcopy(log_line);
- strcat(log_line, "\n");
- show_line(log_line, 0);
- }
-*/
-
- return 0;
-}
-
-void initial_memory (void)
-{
- /* set initial memory allocations */
- if (mem_extra_high < 0)
- mem_extra_high = 0;
-
- if (mem_extra_low < 0)
- mem_extra_low = 0;
-
- if (mem_initex < 0)
- mem_initex = 0;
-
- if (is_initex)
- {
- #if defined(ALLOCATEHIGH) || defined(ALLOCATELOW)
- if (mem_extra_high != 0 || mem_extra_low != 0)
- {
- puts("ERROR: Cannot extend main memory in iniTeX\n");
- mem_extra_high = 0; mem_extra_low = 0;
- }
-#endif
- }
- else
- {
- if (mem_initex != 0)
- {
- puts("ERROR: Can only set initial main memory size in iniTeX\n");
- mem_initex = 0;
- }
-
- if (trie_size != 0)
- {
- puts("ERROR: Need only set hyphenation trie size in iniTeX\n");
-/* trie_size = 0; */
- }
- }
- if (mem_initex == 0)
- mem_initex = default_mem_top;
-
- if (trie_size == 0)
- trie_size = default_trie_size;
-/* Just in case user mistakenly specified words instead of kilo words */
- if (mem_extra_high > 10000L * 1024L)
- mem_extra_high = mem_extra_high / 1024;
-
- if (mem_extra_low > 10000L * 1024L)
- mem_extra_low = mem_extra_low / 1024;
-
- if (mem_initex > 10000L * 1024L)
- mem_initex = mem_initex / 1024;
-
- if (mem_initex > 2048L * 1024L) /* extend main memory by 16 mega byte! */
- {
- puts("WARNING: There may be no benefit to asking for so much memory\n");
-/* mem_initex = 2048 * 1024; */
- }
-
- if (new_hyphen_prime < 0)
- new_hyphen_prime = 0;
-
- if (new_hyphen_prime > 0)
- {
- if (! is_initex)
- puts("ERROR: Can only set hyphen prime in iniTeX\n");
- else
- {
- if (new_hyphen_prime % 2 == 0)
- new_hyphen_prime++;
-
- while (!prime(new_hyphen_prime))
- new_hyphen_prime = new_hyphen_prime + 2;
-
- if (trace_flag)
- {
- sprintf(log_line, "Using %d as hyphen prime\n", new_hyphen_prime);
- show_line(log_line, 0);
- }
- }
- }
-
- if (percent_grow > 100)
- percent_grow = percent_grow - 100;
-
- if (percent_grow > 100)
- percent_grow = 100; /* upper limit - double */
-
- if (percent_grow < 10)
- percent_grow = 10; /* lower limit - 10% */
-}
-
-/**********************************************************************/
-
-void perrormod (char *s)
-{
- sprintf(log_line, "`%s': %s\n", s, strerror(errno));
- show_line(log_line, 1);
-}
-
-/*************************************************************************/
-
-/* convert tilde to pseudo_tilde to hide it from TeX --- 95/Sep/26 */
-/* convert space to pseudo_space to hide it from TeX --- 97/Jun/5 */
-/* called only if pseudo_tilde != 0 or pseudo_space != 0 */
-/* this is then undone in tex3.c both for fopen input and output */
-/* not ideal, since pseudo name appears in log and in error messages ... */
-
-void hidetwiddle (char *tname)
-{
- char *s = tname;
-
-#ifdef DEBUGTWIDDLE
- if (trace_flag)
- {
- sprintf(log_line, "Hidetwiddle %s", tname);
- show_line(log_line, 0);
- }
-#endif
-
- while (*s != '\0')
- {
- if (*s == '~' && pseudo_tilde != 0)
- *s = (char) pseudo_tilde; /* typically 254 */
- else if (*s == ' ' && pseudo_space != 0)
- *s = (char) pseudo_space; /* typically 255 */
- s++;
- }
-
-#ifdef DEBUGTWIDDLE
- if (trace_flag)
- {
- sprintf(log_line, "=> %s\n", tname);
- show_line(log_line, 0);
- }
-#endif
-}
-
-void deslash_all (int ac, char **av)
-{
- char buffer[file_name_size];
- char *s;
-
- if ((s = grabenv("TEXDVI")) != NULL)
- dvi_directory = s;
-
- if ((s = grabenv("TEXLOG")) != NULL)
- log_directory = s;
-
- if ((s = grabenv("TEXAUX")) != NULL)
- aux_directory = s;
-
- if ((s = grabenv("TEXFMT")) != NULL)
- fmt_directory = s;
-
- if ((s = grabenv("TEXPDF")) != NULL)
- pdf_directory = s;
-
- strcpy(buffer, av[0]);
-
- if ((s = strrchr(buffer, '\\')) != NULL)
- *(s + 1) = '\0';
- else if ((s = strrchr(buffer, '/')) != NULL)
- *(s + 1) = '\0';
- else if ((s = strrchr(buffer, ':')) != NULL)
- *(s + 1) = '\0';
-
- s = buffer + strlen(buffer) - 1;
-
- if (*s == '\\' || *s == '/')
- *s = '\0';
-
- texpath = xstrdup(buffer);
-
- if (strcmp(dvi_directory, "") != 0)
- flush_trailing_slash(dvi_directory);
-
- if (strcmp(log_directory, "") != 0)
- flush_trailing_slash(log_directory);
-
- if (strcmp(aux_directory, "") != 0)
- flush_trailing_slash(aux_directory);
-
- if (strcmp(fmt_directory, "") != 0)
- flush_trailing_slash(fmt_directory);
-
- if (strcmp(pdf_directory, "") != 0)
- flush_trailing_slash(pdf_directory);
-
- if (deslash)
- {
- unixify (texpath);
-
- if (strcmp(dvi_directory, "") != 0)
- unixify(dvi_directory);
-
- if (strcmp(log_directory, "") != 0)
- unixify(log_directory);
-
- if (strcmp(aux_directory, "") != 0)
- unixify(aux_directory);
-
- if (strcmp(fmt_directory, "") != 0)
- unixify(fmt_directory);
-
- if (strcmp(pdf_directory, "") != 0)
- unixify(pdf_directory);
- }
-
- format_spec = 0;
-
- if (optind < ac && optind > 0)
- {
- if (deslash)
- {
- if (trace_flag || debug_flag)
- {
- sprintf(log_line, "deslash: k %d argv[k] %s (argc %d)\n",
- optind, av[optind], ac);
- show_line(log_line, 0);
- }
-
- unixify(av[optind]);
- }
-
- if (pseudo_tilde != 0 || pseudo_space != 0)
- hidetwiddle (av[optind]);
-
- if (*av[optind] == '&' || *av[optind] == '+')
- {
- format_spec = 1;
- format_name = xstrdup(av[optind] + 1);
-
- if (optind + 1 < ac)
- {
- if (deslash)
- {
- if (trace_flag || debug_flag)
- {
- sprintf(log_line, "deslash: k %d argv[k] %s (argc %d)\n",
- optind + 1, av[optind + 1], ac);
- show_line(log_line, 0);
- }
-
- unixify(av[optind + 1]);
- }
-
- if (pseudo_tilde != 0 || pseudo_space != 0)
- hidetwiddle (av[optind + 1]);
- }
- }
- }
-}
-
-/* note: those optarg == 0 test don't really work ... */
-/* note: optarg starts at = in case of x=... */
-
-int main_init (int ac, char **av)
-{
- kpse_set_program_name(av[0], NULL);
- xputenv("engine", "yandytex");
-
- if (sizeof(memory_word) != sizeof(halfword) * 2)
- printf("ERROR: Bad word size %d!\n", sizeof(memory_word));
-
- start_time = clock();
- main_time = start_time;
-
-/* reset all allocatable memory pointers to NULL - in case we drop out */
- main_memory = NULL;
- font_info = NULL;
- str_pool = NULL;
- str_start = NULL;
-
-#ifdef ALLOCATESAVESTACK
- save_stack = NULL;
-#endif
-
-#ifdef ALLOCATEBUFFER
- buffer = NULL;
- current_buf_size = 0;
- buffer = realloc_buffer (initial_buf_size);
-#endif
-
- hyph_list = NULL;
- hyph_word = NULL;
- trie_taken = NULL;
- trie_hash = NULL;
- trie_r = NULL;
- trie_c = NULL;
- trie_o = NULL;
- trie_l = NULL;
- trie_trc = NULL;
- trie_tro = NULL;
- trie_trl = NULL;
-
- log_opened = false; /* so can tell whether opened */
- interaction = -1; /* default state => 3 */
- missing_characters = 0; /* none yet! */
- font_dimen_zero = true; /* \fontdimen0 for checksum 98/Oct/5 */
- ignore_frozen = false; /* default is not to ignore 98/Oct/5 */
- suppress_f_ligs = false; /* default is not to ignore f-ligs */
-
- if (ac > 1 && !strncmp(av[1], "-Y", 2))
- reorder_arg_flag = false;
-
- if (reorder_arg_flag)
- reorderargs(ac, av);
-
- if (init_commands(ac, av))
- return -1;
-
- check_fixed_align(trace_flag);
-
- format_file = NULL;
- source_direct = NULL;
- dvi_file_name = NULL;
- log_file_name = NULL;
- pdf_file_name = NULL;
-
- first_pass_count = 0;
- second_pass_count = 0;
- final_pass_count = 0;
- paragraph_failed = 0;
- single_line = 0;
- overfull_hbox = 0;
- underfull_hbox = 0;
- overfull_vbox = 0;
- underfull_vbox = 0;
- closed_already = 0;
-
- if (trace_flag)
- puts("Entering init (local.c)");
-
- probe_memory();
- ini_max_address = max_address;
-
- if (trace_flag)
- show_maximums(stdout);
-
- initial_memory();
- deslash_all(ac, av);
- no_interrupts = 0;
-
- if (format_spec && mem_spec_flag)
- puts("WARNING: Cannot change initial main memory size when format specified");
-
- if (allocate_memory() != 0)
- return -1;
-
- check_alloc_align(trace_flag);
-
- if (trace_flag)
- puts("Leaving init (local.c)");
-
- return 0;
-}
-
-#define CLK_TCK CLOCKS_PER_SEC
-
-void show_inter_val (clock_t inter_val)
-{
- int seconds, tenths, hundredth, thousands;
-
- if (inter_val >= CLK_TCK * 10)
- {
- tenths = (inter_val * 10 + CLK_TCK / 2) / CLK_TCK;
- seconds = tenths / 10;
- tenths = tenths % 10;
- printf("%d.%d", seconds, tenths);
- }
- else if (inter_val >= CLK_TCK)
- {
- hundredth = (inter_val * 100 + CLK_TCK / 2) / CLK_TCK;
- seconds = hundredth / 100;
- hundredth = hundredth % 100;
- printf("%d.%02d", seconds, hundredth);
- }
- else if (inter_val > 0)
- {
- thousands = (inter_val * 1000 + CLK_TCK / 2) / CLK_TCK;
- seconds = thousands / 1000;
- thousands = thousands % 1000;
- printf("%d.%03d", seconds, thousands);
- }
- else
- show_line("0", 0);
-}
-
-int endit(int flag)
-{
- finish_time = clock();
-
- if (missing_characters != 0)
- flag = 1;
-
- if (missing_characters)
- {
- sprintf(log_line, "! There %s %d missing character%s --- see log file\n",
- (missing_characters == 1) ? "was" : "were", missing_characters,
- (missing_characters == 1) ? "" : "s");
- show_line(log_line, 0);
- }
-
- if (free_memory() != 0)
- flag++;
-
- if (verbose_flag)
- {
- printf("Total ");
- show_inter_val(finish_time - start_time);
- printf(" sec (");
- show_inter_val(main_time - start_time);
- printf(" format load + ");
- show_inter_val(finish_time - main_time);
- printf(" processing) ");
-
- if (total_pages > 0)
- {
- show_inter_val((finish_time - main_time) / total_pages);
- printf(" sec per page.");
- }
- }
-
- return flag;
-}
-// printf control sequences' name
-void print_cs_name (FILE *output, int h)
-{
- int c, textof, n;
-
- memset(log_line, 0, sizeof(log_line));
-
- textof = hash[h].rh;
-
- if (textof == 0)
- return;
-
- c = sprintf(log_line, "(%d), ", h);
- n = length(textof);
-
- memmove(log_line + c, str_pool + str_start[textof], n);
- memmove(log_line + c + n, "\n", 2);
-
- if (output == stderr)
- {
- show_line(log_line, 1);
- }
- else
- {
- if (output == stdout)
- show_line(log_line, 0);
- else
- fprintf(output, "%s", log_line);
- }
-
-}
-// prototype
-int compare_strn (int, int, int, int);
-/* compare two csnames in qsort */
-int compare_cs (const void *cp1, const void *cp2)
-{
- int c1, c2, l1, l2, k1, k2, textof1, textof2;
-
- c1 = *(int *)cp1;
- c2 = *(int *)cp2;
- textof1 = hash[c1].rh;
- textof2 = hash[c2].rh;
- l1 = length(textof1);
- l2 = length(textof2);
- k1 = str_start[textof1];
- k2 = str_start[textof2];
-
- return compare_strn(k1, l1, k2, l2);
-}
-
-char * csused = NULL;
-
-/* Allocate table of indeces to allow sorting on csname */
-/* Allocate flags to remember which ones already listed at start */
-/* pass = 0 --> fmt */
-/* pass = 1 --> after */
-void print_cs_names (FILE *output, int pass)
-{
- int h, k, ccount, repeatflag;
- int *cnumtable;
- int nfcs = frozen_control_sequence;
-
- if (pass == 0 && csused == NULL)
- {
- csused = (char *) malloc (nfcs);
-
- if (csused == NULL)
- return;
-
-#ifdef USEMEMSET
- memset(csused, 0, nfcs);
-#else
- for (h = 0; h < (hash_size + 780); h++)
- csused[h] = 0;
-#endif
- }
-
- ccount = 0;
-
- for (h = hash_base + 1; h < nfcs; h++)
- {
- if (pass == 1 && csused[h])
- continue;
-
- if (hash[h].rh != 0)
- {
- if (pass == 0)
- csused[h] = 1;
-
- ccount++;
- }
- }
-
- sprintf(log_line, "\n%d %s multiletter control sequences:\n",
- ccount, (pass == 1) ? "new" : "");
-
- if (output == stderr)
- {
- show_line(log_line, 1);
- }
- else
- {
- if (output == stdout)
- show_line(log_line, 0);
- else
- fprintf(output, "%s", log_line);
- }
-
- if (ccount > 0)
- {
- cnumtable = (int *) malloc (ccount * sizeof(int));
-
- if (cnumtable == NULL)
- return;
-
- ccount = 0;
-
- for (h = hash_base + 1; h < nfcs; h++)
- {
- if (pass == 1 && csused[h])
- continue;
-
- if (hash[h].rh != 0)
- cnumtable[ccount++] = h;
- }
-
- //qsort ((void *)cnumtable, ccount, sizeof (int), &compare_cs);
-
- repeatflag = 0;
-
- for (k = 0; k < ccount; k++)
- {
- h = cnumtable[k];
-
- if (pass == 1 && csused[h])
- continue;
-
- print_cs_name(output, h);
- }
-
- sprintf(log_line, "\n");
-
- if (output == stderr)
- {
- show_line(log_line, 1);
- }
- else
- {
- if (output == stdout)
- show_line(log_line, 0);
- else
- fprintf(output, "%s", log_line);
- }
-
- free((void *)cnumtable);
- }
-
- if (pass == 1 && csused != NULL)
- {
- free(csused);
- csused = NULL;
- }
-}
-
-/* k1 and k2 are positions in string pool */
-/* l1 and l2 are lengths of strings */
-int compare_strn (int k1, int l1, int k2, int l2)
-{
- int c1, c2;
-
- while (l1 > 0 && l2 > 0)
- {
- c1 = str_pool[k1];
- c2 = str_pool[k2];
-
- if (c1 > c2)
- return 1;
- else if (c2 > c1)
- return -1;
-
- l1--; l2--;
- k1++; k2++;
- }
-
- if (l1 > 0)
- return 1; /* first string longer */
- else if (l2 > 0)
- return -1; /* second string longer */
-
- return 0; /* strings match */
-}
-/* compare two font names and their at sizes in qsort */
-int compare_fnt (const void *fp1, const void *fp2)
-{
- int f1, f2, l1, l2, k1, k2, s;
-
- f1 = *(short *)fp1;
- f2 = *(short *)fp2;
- l1 = length(font_name[f1]);
- l2 = length(font_name[f2]);
- k1 = str_start[font_name[f1]];
- k2 = str_start[font_name[f2]];
-
- s = compare_strn (k1, l1, k2, l2);
-
- if (s != 0)
- return s;
-
- if (font_size[f1] > font_size[f2])
- return 1;
- else if (font_size[f1] < font_size[f2])
- return -1;
-
- return 0; /* should not ever get here */
-}
-/* compare two font names */
-int compare_fnt_name (int f1, int f2)
-{
- int l1, l2, k1, k2, s;
-
- l1 = length(font_name[f1]);
- l2 = length(font_name[f2]);
- k1 = str_start[font_name[f1]];
- k2 = str_start[font_name[f2]];
-
- s = compare_strn (k1, l1, k2, l2);
-
- return s;
-}
-/* decode checksum information */
-unsigned long checkdefault = 0x59265920; /* default signature */
-int decode_fourty (unsigned long checksum, char *codingvector)
-{
- int c;
- int k;
-
- if (checksum == 0)
- {
- strcpy(codingvector, "unknwn");
- return 1;
- }
- else if ((checksum >> 8) == (checkdefault >> 8))
- {
- strcpy (codingvector, "fixed ");
- return 1;
- }
- else
- {
- for (k = 0; k < 6; k++)
- {
- c = (int) (checksum % 40);
- checksum = checksum / 40;
-
- if (c <= 'z' - 'a')
- c = c + 'a';
- else if (c < 36)
- c = (c + '0') - ('z' - 'a') - 1;
- else if (c == 36)
- c = '-';
- else if (c == 37)
- c = '&';
- else if (c == 38)
- c = '_';
- else
- c = '.';
-
- codingvector[5-k] = (char) c;
- }
- codingvector[6] = '\0';
- }
-
- return 0;
-}
-
-double sclpnt (long x)
-{
- double pt;
-
- pt = (double) x / 65536.0;
- pt = (double) ((int) (pt * 1000.0 + 0.5)) / 1000.0;
-
- return (pt);
-}
-
-void dvi_font_show(internal_font_number f, int suppressname)
-{
- int a, l, k, n;
- unsigned long checksum;
- char checksumvector[8];
- char buffer[32];
-
- putc(' ', log_file);
-
- if (suppressname == 0)
- {
- a = length(font_area[f]);
- l = length(font_name[f]);
-
- k = str_start[font_area[f]];
-
- memcpy(buffer, str_pool + k, length(font_area[f]));
- fwrite(buffer, sizeof(char), length(font_area[f]), log_file);
-
- k = str_start[font_name[f]];
-
- memcpy(buffer, str_pool + k, length(font_name[f]));
- fwrite(buffer, sizeof(char), length(font_name[f]), log_file);
- }
- else a = l = 0;
-
- for (k = a + l; k < 16; k++)
- putc(' ', log_file);
-
- sprintf(buffer, "at %lgpt ", sclpnt(font_size[f]));
- fputs(buffer, log_file);
-
- if (suppressname == 0)
- {
- n = strlen(buffer);
-
- for (k = n; k < 16; k++)
- putc(' ', log_file);
-
- checksum = (((font_check[f].b0) << 8 | font_check[f].b1) << 8 | font_check[f].b2) << 8 | font_check[f].b3;
- decode_fourty(checksum, checksumvector);
- fprintf(log_file, "encoding: %s..", checksumvector);
- }
-
- putc('\n', log_file);
-}
-/* Allocate table of indeces to allow sorting on font name */
-void show_font_info (void)
-{
- int k, m, fcount, repeatflag;
- short *fnumtable;
-
- fcount = 0;
-
- for (k = 1; k <= font_ptr; k++)
- if (font_used[k])
- fcount++;
-
- if (fcount == 0)
- return;
-
- fnumtable = (short *) malloc(fcount * sizeof(short));
-
- fprintf(log_file, "\nUsed %d font%s:\n", fcount, (fcount == 1) ? "" : "s");
-
- fcount = 0;
-
- for (k = 1; k <= font_ptr; k++)
- if (font_used[k])
- fnumtable[fcount++] = (short) k;
-
- qsort ((void *)fnumtable, fcount, sizeof(short), &compare_fnt);
-
- repeatflag = 0;
-
- for (m = 0; m < fcount; m++)
- {
- if (m > 0)
- {
- if (compare_fnt_name(fnumtable[m-1], fnumtable[m]) == 0)
- repeatflag = 1;
- else
- repeatflag = 0;
- }
-
- dvi_font_show(fnumtable[m], repeatflag);
- }
-
- free((void *)fnumtable);
-}
\ No newline at end of file
+/*\r
+ Copyright 2007 TeX Users Group\r
+ Copyright 2014 Clerk Ma \r
+\r
+ This program is free software; you can redistribute it and/or modify\r
+ it under the terms of the GNU General Public License as published by\r
+ the Free Software Foundation; either version 2 of the License, or\r
+ (at your option) any later version.\r
+\r
+ This program is distributed in the hope that it will be useful, but\r
+ WITHOUT ANY WARRANTY; without even the implied warranty of\r
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU\r
+ General Public License for more details.\r
+\r
+ You should have received a copy of the GNU General Public License\r
+ along with this program; if not, write to the Free Software\r
+ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA\r
+ 02110-1301 USA.\r
+*/\r
+\r
+#if defined (__ANDROID__)\r
+ #define malloc_usable_size dlmalloc_usable_size\r
+#elif defined (__APPLE__)\r
+ #include <malloc/malloc.h>\r
+ #define malloc_usable_size malloc_size\r
+#endif\r
+\r
+#define EXTERN extern\r
+\r
+#include "yandytex.h"\r
+\r
+#define USEOUREALLOC\r
+#define USEMEMSET\r
+\r
+#ifdef USEOUREALLOC\r
+ #define REALLOC ourrealloc\r
+#else\r
+ #define REALLOC realloc\r
+#endif\r
+\r
+#if defined (__clang__)\r
+const char * compiler = "Clang";\r
+#elif defined (__GNUC__) || defined(__GNUG__)\r
+const char * compiler = "GCC";\r
+#elif defined (_MSC_VER)\r
+const char * compiler = "MSVC";\r
+#else\r
+const char * compiler = "Unknown";\r
+#endif\r
+\r
+#if defined (_WIN64)\r
+const char * dist = "Win64";\r
+#elif defined (_WIN32)\r
+const char * dist = "Win32";\r
+#elif defined (__ANDROID__)\r
+const char * dist = "Android";\r
+#elif defined (__APPLE__)\r
+const char * dist = "Darwin";\r
+#elif defined (__gnu_linux__)\r
+const char * dist = "Linux";\r
+#else\r
+const char * dist = "Unknown";\r
+#endif\r
+\r
+const char * compiletime = __TIME__;\r
+const char * compiledate = __DATE__;\r
+const char * yandyversion = "2.3.0";\r
+const char * application = "Y&Y TeX";\r
+const char * banner = "This is TeX, Version 3.14159265";\r
+\r
+void print_banner (void)\r
+{\r
+ char dist_ver[256];\r
+ memset(dist_ver, 0, sizeof(dist_ver));\r
+ sprintf(dist_ver, "%s (%s %s)", banner, application, yandyversion);\r
+ prints(dist_ver);\r
+}\r
+\r
+clock_t start_time, main_time, finish_time;\r
+\r
+char * dvi_directory = "";\r
+char * log_directory = "";\r
+char * aux_directory = "";\r
+char * fmt_directory = "";\r
+char * pdf_directory = "";\r
+\r
+char log_line[256];\r
+\r
+boolean mem_spec_flag = false;\r
+boolean format_spec = false;\r
+boolean reorder_arg_flag = true; /* put command line flags/arguments first */\r
+\r
+void show_usage (void)\r
+{\r
+ printf("\n"\r
+ "Useage: yandytex [OPTION]... [+format_file] [file]\n\n"\r
+ "--help -? show this usage summary\n"\r
+ "--initex -i start up as initex (create format file)\n"\r
+ "--verbose -v be verbose (show implementation version number)\n"\r
+ "--ascii -n do not allow `non ASCII' characters in input files\n"\r
+ " (complain instead)\n"\r
+ "--showhex -w do not show `non ASCII' characters in hexadecimal\n"\r
+ " (show as is)\n"\r
+ "--patterns -p allow use of \\patterns after loading format (initex only)\n"\r
+ "--knuthify -K disable all extensions to basic TeX\n"\r
+ "--main-mem -m initial main memory size in kilo words (initex only)\n"\r
+ "--hyph-size -e hyphenation exception dictionary size (initex only)\n"\r
+ "--trie-size -h hyphenation pattern trie size (initex only)\n"\r
+ "--xchr-file -x use `non ASCII' character mapping (xchr[]) defined in file\n"\r
+ "--key-file -k use `key replacement' defined in file\n"\r
+ "--dvi-dir -o write DVI file in specified directory (default '.')\n"\r
+ "--log-dir -l write LOG file in specified directory (default '.')\n"\r
+ "--aux-dir -a write AUX file in specified directory (default '.')\n");\r
+ uexit(EXIT_FAILURE);\r
+}\r
+\r
+// Sep 27 1990 => 1990 Sep 27\r
+// 0123456789 0123456789\r
+void scivilize (char * date)\r
+{\r
+ int k;\r
+ char pyear[6];\r
+\r
+ strcpy(pyear, date + 7);\r
+\r
+ for (k = 5; k >= 0; k--)\r
+ date[k + 5] = date[k];\r
+\r
+ for (k = 0; k < 4; k++)\r
+ date[k] = pyear[k];\r
+\r
+ date[4] = ' ';\r
+\r
+ if (date[9] == ' ')\r
+ date[9] = '0';\r
+}\r
+\r
+void stamp_it (char * s)\r
+{\r
+ char date[11 + 1];\r
+\r
+ strcpy(date, compiledate);\r
+ scivilize(date);\r
+ sprintf(s, "%s %s (compiled time: %s %s with %s/%s)",\r
+ application, yandyversion, date, compiletime, dist, compiler);\r
+ s += strlen(s);\r
+}\r
+\r
+#define MAXCHRS 256\r
+#define NOTDEF 127\r
+\r
+void read_xchr_sub (FILE * xchr_input)\r
+{\r
+ char buffer[file_name_size];\r
+ int k, from, to, count = 0;\r
+ char * s;\r
+\r
+ memset(xchr, NOTDEF, MAXCHRS);\r
+ memset(xord, NOTDEF, MAXCHRS);\r
+\r
+#ifdef ALLOCATEBUFFER\r
+ while (fgets(buffer, current_buf_size, xchr_input) != NULL)\r
+#else\r
+ while (fgets(buffer, sizeof(buffer), xchr_input) != NULL)\r
+#endif\r
+ {\r
+ if (*buffer == '%' || *buffer == ';' || *buffer == '\n')\r
+ continue;\r
+\r
+ from = (int) strtol (buffer, &s, 0);\r
+ to = (int) strtol (s, NULL, 0);\r
+\r
+ if (from >= 0 && from < MAXCHRS && to >= 0 && to < MAXCHRS)\r
+ {\r
+ if (xchr[from] == NOTDEF)\r
+ xchr[from] = (unsigned char) to;\r
+ else\r
+ printf("NOTE: %s collision: %d => %d, %d\n", "xchr", from, xchr[from], to);\r
+\r
+ if (xord[to] == NOTDEF)\r
+ xord[to] = (unsigned char) from;\r
+ else\r
+ printf("NOTE: %s collision: %d => %d, %d\n", "xord", to, xord[to], from);\r
+\r
+ count++;\r
+ }\r
+ }\r
+\r
+ for (k = 0; k < MAXCHRS; k++)\r
+ {\r
+ if (xchr[k] == NOTDEF) /* if it has not been filled */\r
+ {\r
+ if (xord[k] == NOTDEF) /* see whether used already */\r
+ {\r
+ xchr[k] = (unsigned char) k; /* no, so make identity */\r
+ xord[k] = (unsigned char) k; /* no, so make identity */\r
+ }\r
+ }\r
+ }\r
+\r
+ xchr[NOTDEF] = NOTDEF; /* fixed point of mapping */\r
+\r
+ if (trace_flag)\r
+ {\r
+ printf("Read %d xchr[] pairs:\n", count);\r
+\r
+ for (k = 0; k < MAXCHRS; k++)\r
+ {\r
+ if (xchr[k] != NOTDEF)\r
+ printf("%d => %d\n", k, xchr[k]);\r
+ }\r
+ }\r
+}\r
+\r
+char * replacement[MAXCHRS]; /* pointers to replacement strings */\r
+\r
+void read_repl_sub (FILE * repl_input)\r
+{\r
+ int k, n, m, chrs;\r
+ char buffer[file_name_size];\r
+ char charname[128];\r
+ int charnum[10];\r
+ char * s, * t;\r
+ \r
+ memset(replacement, 0, MAXCHRS * sizeof(replacement[0]));\r
+\r
+ while (fgets(buffer, file_name_size, repl_input) != NULL)\r
+ {\r
+ if (*buffer == '%' || *buffer == ';' || *buffer == '\n')\r
+ continue;\r
+\r
+ if ((m = sscanf(buffer, "%d%n %s", &chrs, &n, (char *)&charname)) == 0)\r
+ continue;\r
+ else if (m == 2)\r
+ {\r
+ if (*charname == '"') /* deal with quoted string "..." */\r
+ {\r
+ s = buffer + n;\r
+ t = charname;\r
+\r
+ while (*s != '"' && *s != '\0')\r
+ s++; /* step up to " */\r
+\r
+ if (*s++ == '\0')\r
+ continue; /* sanity check */\r
+\r
+ while (*s != '\0')\r
+ {\r
+ if (*s == '"')\r
+ {\r
+ s++; /* is it "" perhaps ? */\r
+\r
+ if (*s != '"')\r
+ break; /* no, end of string */\r
+ }\r
+\r
+ *t++ = *s++; /* copy over */\r
+ }\r
+\r
+ *t = '\0'; /* and terminate */\r
+ }\r
+\r
+ if (chrs >= 0 && chrs < MAXCHRS)\r
+ replacement[chrs] = xstrdup(charname);\r
+ }\r
+/* presently the following can never get triggered */\r
+/* which is good, because it is perhaps not right ... */\r
+ else if ((m = sscanf (buffer, "%d %d %d %d %d %d %d %d %d %d %d",\r
+ &chrs, charnum, charnum+1, charnum+2, charnum+3, charnum+4,\r
+ charnum+5, charnum+6, charnum+7, charnum+8, charnum+9)) > 1) {\r
+/* for (k = 0; k < n-1; k++) charname[k] = (char) charnum; */\r
+ for (k = 0; k < n-1; k++) charname[k] = (char) charnum[k];\r
+ charname[m] = '\0';\r
+ if (chrs >= 0 && chrs < MAXCHRS)\r
+ replacement[chrs] = xstrdup(charname); \r
+ }\r
+ else\r
+ printf("ERROR: don't understand %s", buffer);\r
+ }\r
+\r
+ if (trace_flag)\r
+ {\r
+ puts("Key replacement table");\r
+\r
+ for (k = 0; k < MAXCHRS; k++)\r
+ {\r
+ if (replacement[k] != NULL)\r
+ printf("%d\t%s\n", k, replacement[k]);\r
+ }\r
+ }\r
+}\r
+\r
+/* Following used both to read xchr[] file and key replacement file */\r
+/* the flag is 0 for -x=... and the flag is 1 for -k=... */\r
+int read_xchr_file (char *filename, int flag, char *argv[])\r
+{\r
+ FILE *xchr_input;\r
+ char infile[file_name_size];\r
+ char *s;\r
+\r
+ if (filename == NULL)\r
+ return -1;\r
+\r
+ if (trace_flag)\r
+ printf("Reading xchr/repl %s\n", filename);\r
+\r
+ /* first try using file as specified */\r
+ strcpy(infile, filename);\r
+\r
+ if (trace_flag)\r
+ printf("Trying %s\n", infile);\r
+\r
+ xchr_input = fopen (infile, "r");\r
+\r
+ if (xchr_input == NULL)\r
+ {\r
+ if (strrchr(infile, '.') == NULL)\r
+ {\r
+ if (flag == 0)\r
+ strcat(infile, ".map");\r
+ else\r
+ strcat(infile, ".key");\r
+\r
+ if (trace_flag)\r
+ printf("Trying %s\n", infile);\r
+ \r
+ xchr_input = fopen(infile, "r");\r
+ }\r
+ }\r
+\r
+ if (xchr_input == NULL)\r
+ {\r
+ strcpy(infile, argv[0]); /* try TeX program path */\r
+\r
+ if ((s = strrchr (infile, '\\')) != NULL)\r
+ *(s+1) = '\0';\r
+ else if ((s = strrchr (infile, '/')) != NULL)\r
+ *(s+1) = '\0';\r
+ else if ((s = strrchr (infile, ':')) != NULL)\r
+ *(s+1) = '\0';\r
+\r
+ strcat (infile, filename);\r
+\r
+ if (trace_flag)\r
+ printf("Trying %s\n", infile);\r
+\r
+ xchr_input = fopen (infile, "r");\r
+\r
+ if (xchr_input == NULL)\r
+ {\r
+ if (strchr(infile, '.') == NULL)\r
+ {\r
+ if (flag == 0)\r
+ strcat(infile, ".map");\r
+ else\r
+ strcat(infile, ".key");\r
+\r
+ if (trace_flag)\r
+ printf("Trying %s\n", infile);\r
+\r
+ xchr_input = fopen (infile, "r");\r
+ }\r
+ }\r
+ }\r
+\r
+ if (xchr_input == NULL)\r
+ {\r
+ strcpy(infile, argv[0]); /* try TeX program path */\r
+\r
+ if ((s = strrchr (infile, '\\')) != NULL)\r
+ *(s + 1) = '\0';\r
+ else if ((s = strrchr (infile, '/')) != NULL)\r
+ *(s + 1) = '\0';\r
+ else if ((s = strrchr (infile, ':')) != NULL)\r
+ *(s + 1) = '\0';\r
+\r
+ strcat(infile, "keyboard\\");\r
+ strcat(infile, filename);\r
+\r
+ if (trace_flag)\r
+ printf("Trying %s\n", infile);\r
+\r
+ xchr_input = fopen (infile, "r");\r
+\r
+ if (xchr_input == NULL)\r
+ {\r
+ if (strchr(infile, '.') == NULL)\r
+ {\r
+ if (flag == 0)\r
+ strcat(infile, ".map");\r
+ else\r
+ strcat(infile, ".key");\r
+\r
+ if (trace_flag)\r
+ printf("Trying %s\n", infile);\r
+\r
+ xchr_input = fopen (infile, "r");\r
+ }\r
+ }\r
+ }\r
+\r
+ /* Note: can't look in TeX source file dir, since that is not known yet */\r
+ if (xchr_input == NULL)\r
+ {\r
+ printf("ERROR: Sorry, cannot find %s file %s",\r
+ flag ? " xchr[]" : "key mapping", filename);\r
+ perrormod (filename);\r
+ return 0;\r
+ }\r
+\r
+ if (flag == 0)\r
+ read_xchr_sub(xchr_input);\r
+ else\r
+ read_repl_sub(xchr_input);\r
+\r
+ (void) fclose(xchr_input);\r
+\r
+ return 1;\r
+}\r
+\r
+/* need to also set `key_replace' here based on command line */\r
+/* need to also allocate `buffercopy' here and free at end */\r
+/* need to call `readreplace' in appropriate place */\r
+\r
+#define MAXSPLITS 3\r
+\r
+/* ad hoc default minimum growth in memory realloc is 62% */\r
+/* golden ratio (1 + \sqrt{5}) / 2 = 1.618033989... */\r
+int percent_grow = 62; /* default minimum growth in memory realloc is 62% */\r
+int total_allocated = 0; /* total memory allocated so far */\r
+int ini_max_address = 0; /* maximum address when starting */\r
+int max_address = 0; /* maximum address seen in allocated memory */\r
+\r
+\r
+void show_maximums (FILE * output)\r
+{\r
+ sprintf(log_line, "Max allocated %d --- max address %d\n", total_allocated, max_address);\r
+ fputs(log_line, output);\r
+}\r
+\r
+/* our own version of realloc --- avoid supposed MicroSoft version bug */\r
+/* also tries _expand first, which can avoid address growth ... */\r
+\r
+#ifdef USEOUREALLOC \r
+void * ourrealloc (void * old, size_t new_size)\r
+{\r
+ void * mnew;\r
+ size_t old_size, overlap;\r
+ \r
+ /* round up to nearest multiple of four bytes */\r
+ /* avoid unlikely alignment */\r
+ if ((new_size % 4) != 0)\r
+ new_size = ((new_size / 4) + 1) * 4;\r
+\r
+ if (old == NULL)\r
+ return malloc (new_size); /* no old block - use malloc */\r
+\r
+#ifdef _WIN32\r
+ old_size = _msize (old);\r
+#else\r
+ old_size = malloc_usable_size (old);\r
+#endif\r
+\r
+ if (old_size >= new_size && old_size < new_size + 4)\r
+ return old;\r
+\r
+#ifdef _WIN32\r
+ mnew = _expand (old, new_size); /* first try and expand in place MSVC */\r
+#else\r
+ mnew = realloc (old, new_size);\r
+#endif\r
+\r
+ if (mnew != NULL)\r
+ {\r
+ if (trace_flag)\r
+ printf("EXPANDED! %p (%ld) == %p (%ld)\n",\r
+ mnew, new_size, old, old_size);\r
+\r
+ return mnew;\r
+ }\r
+\r
+ /* do this if you want to call the real realloc next - */\r
+ mnew = realloc (old, new_size);\r
+\r
+ if (mnew != NULL)\r
+ return mnew;\r
+\r
+ /* we are screwed typically if we ever drop through here - no more space */\r
+ mnew = malloc (new_size); /* otherwise find new space */\r
+\r
+ if (mnew == NULL)\r
+ return mnew; /* if unable to allocate */\r
+\r
+ if (old_size < new_size)\r
+ overlap = old_size;\r
+ else\r
+ overlap = new_size;\r
+\r
+ memcpy (mnew, old, overlap); /* copy old data to new area */\r
+ free(old); /* free the old area */\r
+\r
+ return mnew;\r
+}\r
+#endif\r
+\r
+void memory_error (const char * s, int n)\r
+{\r
+ if (log_opened)\r
+ {\r
+ log_printf("\n! Unable to allocate %d bytes for %s\n", n, s);\r
+ show_maximums(log_file);\r
+ }\r
+\r
+ printf("\n! Unable to allocate %d bytes for %s\n", n, s);\r
+ show_maximums(stderr);\r
+}\r
+\r
+void trace_memory (const char * s, int n)\r
+{\r
+ printf("Allocating %d bytes for %s\n", n, s);\r
+}\r
+\r
+void update_statistics (long address, int size, int old_size)\r
+{\r
+ if (address + size > max_address)\r
+ max_address = address + size;\r
+\r
+ total_allocated = total_allocated + size - old_size;\r
+}\r
+\r
+void probe_memory (void)\r
+{\r
+ char * s = (char *) malloc(sizeof(void *));\r
+ free(s);\r
+ update_statistics ((long) s, 0, 0);\r
+}\r
+\r
+void probe_show (void)\r
+{\r
+ probe_memory();\r
+ show_maximums(stdout);\r
+}\r
+\r
+size_t roundup (size_t n)\r
+{\r
+ if ((n % sizeof(void *)) == 0)\r
+ return n;\r
+ else\r
+ return ((n / sizeof(void *)) + 1) * sizeof(void *);\r
+}\r
+\r
+#ifdef ALLOCATETRIES\r
+/* returns -1 if it fails */\r
+\r
+int allocate_tries (int trie_max)\r
+{\r
+ int n, nl, no, nc;\r
+\r
+ if (trie_max > 1000000)\r
+ trie_max = 1000000;\r
+\r
+ nl = (trie_max + 1) * sizeof(halfword);\r
+ no = (trie_max + 1) * sizeof(halfword);\r
+ nc = (trie_max + 1) * sizeof(quarterword);\r
+ n = nl + no + nc;\r
+\r
+ if (trace_flag)\r
+ trace_memory("hyphen trie", n);\r
+\r
+ trie_trl = (halfword *) malloc(roundup(nl));\r
+ trie_tro = (halfword *) malloc(roundup(no));\r
+ trie_trc = (quarterword *) malloc(roundup(nc));\r
+\r
+ if (trie_trl == NULL || trie_tro == NULL || trie_trc == NULL)\r
+ {\r
+ memory_error("hyphen trie", n);\r
+ return -1;\r
+ }\r
+\r
+ if (trace_flag)\r
+ printf("Addresses trie_trl %p trie_tro %p trie_trc %p\n", trie_trl, trie_tro, trie_trc);\r
+\r
+ update_statistics((long) trie_trl, nl, 0);\r
+ update_statistics((long) trie_tro, no, 0);\r
+ update_statistics((long) trie_trc, nc, 0);\r
+\r
+ trie_size = trie_max;\r
+\r
+ if (trace_flag)\r
+ probe_show();\r
+\r
+ return 0; // success\r
+}\r
+#endif\r
+\r
+#ifdef ALLOCATEHYPHEN\r
+int current_prime = 0; /* remember in case reallocated later */\r
+\r
+/* we don't return an address here, since TWO memory regions allocated */\r
+/* plus, we don't really reallocate, we FLUSH the old information totally */\r
+/* returns -1 if it fails */\r
+\r
+int realloc_hyphen (int hyphen_prime)\r
+{\r
+ int n, nw, nl;\r
+\r
+ if (!prime(hyphen_prime))\r
+ {\r
+ printf("ERROR: non-prime hyphen exception number (%d)\n", hyphen_prime);\r
+ return -1;\r
+ }\r
+\r
+/* need not/cannot preserve old contents when hyphen prime is changed */\r
+/* if (hyph_list != NULL) free(hyph_list); */\r
+/* if (hyph_word != NULL) free(hyph_word); */\r
+ nw = (hyphen_prime + 1) * sizeof(str_number);\r
+ nl = (hyphen_prime + 1) * sizeof(halfword);\r
+ n = nw + nl;\r
+\r
+ if (trace_flag)\r
+ trace_memory("hyphen exception", n);\r
+\r
+ hyph_word = (str_number *) REALLOC (hyph_word, nw);\r
+ hyph_list = (halfword *) REALLOC (hyph_list, nl);\r
+\r
+ if (hyph_word == NULL || hyph_list == NULL)\r
+ {\r
+ memory_error("hyphen exception", n);\r
+ return -1;\r
+ }\r
+\r
+ if (trace_flag)\r
+ printf("Addresses hyph_word %p hyph_list %p\n", hyph_word, hyph_list);\r
+\r
+/* cannot preserve old contents when hyphen prime is changed */\r
+#ifdef USEMEMSET\r
+ memset(hyph_word, 0, (hyphen_prime + 1) * sizeof (hyph_word[0]));\r
+#else\r
+ for (k = 0; k <= hyphen_prime; k++)\r
+ hyph_word[k]= 0;\r
+#endif\r
+\r
+#ifdef USEMEMSET\r
+ memset(hyph_list, 0, (hyphen_prime + 1) * sizeof (hyph_list[0]));\r
+#else\r
+ for (k = 0; k <= hyphen_prime; k++)\r
+ hyph_list[k]= 0;\r
+#endif\r
+\r
+ hyph_count = 0;\r
+\r
+ if (current_prime != 0)\r
+ {\r
+ update_statistics((long) hyph_word, nw, (current_prime + 1) * sizeof(str_number));\r
+ update_statistics((long) hyph_list, nl, (current_prime + 1) * sizeof(halfword));\r
+ }\r
+ else\r
+ {\r
+ update_statistics((long) hyph_word, nw, 0);\r
+ update_statistics((long) hyph_list, nl, 0);\r
+ }\r
+\r
+ current_prime = hyphen_prime;\r
+\r
+ if (trace_flag)\r
+ probe_show();\r
+\r
+ return 0; // success\r
+}\r
+#endif\r
+\r
+int current_mem_size = 0; /* current total words in main mem allocated -1 */\r
+\r
+/* this gets called from itex.c when it figures out what mem_top is */\r
+/* or gets called from here when in ini_TeX mode */ /* and nowhere else */\r
+/* initial allocation only, may get expanded later */\r
+/* NOTE: we DON't use ALLOCATEHIGH & ALLOCATELOW anymore */\r
+/* returns NULL if it fails */\r
+\r
+#ifdef ALLOCATEMAIN \r
+/* initial main memory alloc - mem_top */\r
+memory_word * allocate_main_memory (int size)\r
+{\r
+ int n;\r
+\r
+ if (main_memory != NULL)\r
+ {\r
+ if (trace_flag)\r
+ puts("Reallocating initial memory allocation");\r
+ }\r
+\r
+ mem_top = mem_bot + size;\r
+ mem_max = mem_top;\r
+ mem_start = 0; /* bottom of memory allocated by system */\r
+ mem_min = 0; /* bottom of area made available to TeX */\r
+ n = (mem_max - mem_start + 1) * sizeof (memory_word);\r
+\r
+ if (trace_flag)\r
+ trace_memory("main memory", n);\r
+\r
+ main_memory = (memory_word *) REALLOC (main_memory, n);\r
+\r
+ if (main_memory == NULL)\r
+ {\r
+ memory_error("initial main memory", n);\r
+ return NULL;\r
+ }\r
+\r
+ if (trace_flag)\r
+ printf("Address main memory == %p\n", main_memory);\r
+\r
+ mem = main_memory;\r
+\r
+ if (mem_start != 0 && !is_initex)\r
+ mem = main_memory - mem_start;\r
+\r
+ if (trace_flag)\r
+ printf("Offset address main memory == %p\n", mem);\r
+\r
+ update_statistics((long) main_memory, n, (current_mem_size + 1) * sizeof (memory_word));\r
+/* current_mem_size = (mem_max - mem_start + 1); */\r
+ current_mem_size = mem_max - mem_start; /* total number of words - 1 */\r
+\r
+ if (trace_flag)\r
+ probe_show();\r
+\r
+ return mem;\r
+}\r
+#endif\r
+\r
+#ifdef ALLOCATEMAIN\r
+/* int firstallocation = 1; */\r
+\r
+/* increase main memory allocation at low end and high end */\r
+/* called only from tex0.c *//* called with one of lo_size or hi_size == 0 */\r
+/* returns NULL if it fails */\r
+\r
+memory_word * realloc_main (int lo_size, int hi_size)\r
+{ \r
+ int k, min_size;\r
+ int new_size = 0;\r
+ int n = 0;\r
+ memory_word * new_memory = NULL;\r
+\r
+ if (trace_flag)\r
+ printf("WARNING: Entering realloc_main lo %d hi %d\n", lo_size, hi_size);\r
+\r
+ if (is_initex)\r
+ {\r
+ puts("ERROR: Cannot extent main memory in initex");\r
+\r
+ if (!knuth_flag)\r
+ puts("Please use `-m=...' on command line");\r
+\r
+ return NULL;\r
+ }\r
+\r
+ if (trace_flag)\r
+ printf("Old Address %s == %p\n", "main memory", main_memory);\r
+\r
+ /* if we REALLY run up to limit ! */\r
+ if (current_mem_size + 1 == max_mem_size)\r
+ {\r
+ memory_error("main memory", (max_mem_size + 1) * sizeof(memory_word));\r
+ return NULL;\r
+ }\r
+\r
+/* first allocation should expand *both* lo and hi */\r
+ if (hi_size == 0 && mem_end == mem_max)\r
+ hi_size = lo_size;\r
+\r
+ if (lo_size == 0 && mem_start == mem_min)\r
+ lo_size = hi_size;\r
+\r
+/* try and prevent excessive frequent reallocations */\r
+/* while avoiding over allocation by too much */\r
+ min_size = current_mem_size / 100 * percent_grow;\r
+\r
+ if (lo_size + hi_size < min_size)\r
+ {\r
+ if (lo_size > 0 && hi_size > 0)\r
+ {\r
+ lo_size = min_size / 2;\r
+ hi_size = min_size / 2;\r
+ }\r
+ else if (lo_size > 0)\r
+ lo_size = min_size;\r
+ else if (hi_size > 0)\r
+ hi_size = min_size;\r
+ }\r
+\r
+ if (lo_size > 0 && lo_size < mem_top / 2)\r
+ lo_size = mem_top / 2;\r
+\r
+ if (hi_size > 0 && hi_size < mem_top / 2)\r
+ hi_size = mem_top / 2;\r
+\r
+ for (k = 0; k < MAXSPLITS; k++)\r
+ {\r
+ new_size = current_mem_size + lo_size + hi_size;\r
+\r
+ if (new_size >= max_mem_size) /* bump against limit - ha ha ha */\r
+ {\r
+ while (new_size >= max_mem_size)\r
+ {\r
+ lo_size = lo_size / 2;\r
+ hi_size = hi_size / 2;\r
+ new_size = current_mem_size + lo_size + hi_size;\r
+ }\r
+ }\r
+\r
+ n = (new_size + 1) * sizeof (memory_word);\r
+\r
+ if (trace_flag)\r
+ trace_memory("main memory", n);\r
+\r
+ new_memory = (memory_word *) REALLOC (main_memory, n);\r
+\r
+ if (new_memory != NULL)\r
+ break; /* did we get it ? */\r
+\r
+ if (current_mem_size == 0)\r
+ break; /* in case we ever use for initial */\r
+\r
+ lo_size = lo_size / 2; hi_size = hi_size / 2;\r
+ }\r
+\r
+ if (new_memory == NULL)\r
+ {\r
+ memory_error("main memory", n);\r
+ return mem;\r
+ }\r
+\r
+ if (trace_flag)\r
+ printf("New Address %s == %p\n", "main memory", new_memory);\r
+\r
+ if (lo_size > 0)\r
+ {\r
+/* shift everything upward to make space for new low area */\r
+ if (trace_flag)\r
+ printf("memmove %p %p %ld \n", new_memory + lo_size,\r
+ new_memory, (current_mem_size + 1) * sizeof(memory_word));\r
+\r
+ memmove (new_memory + lo_size, new_memory,\r
+ (current_mem_size + 1) * sizeof(memory_word));\r
+/* could reduce words moved by (mem_max - mem_end) */\r
+ }\r
+\r
+ main_memory = new_memory; /* remember for free later */\r
+\r
+ if (lo_size > 0)\r
+ mem_start = mem_start - lo_size; /* update lower limit */\r
+\r
+ if (hi_size > 0)\r
+ mem_max = mem_max + hi_size; /* update upper limit */\r
+\r
+ update_statistics ((long) main_memory, n,\r
+ (current_mem_size + 1) * sizeof (memory_word));\r
+ current_mem_size = new_size;\r
+\r
+ if (current_mem_size != mem_max - mem_start)\r
+ puts("ERROR: Impossible Memory Error");\r
+\r
+ if (mem_start != 0)\r
+ mem = main_memory - mem_start;\r
+ else\r
+ mem = main_memory;\r
+\r
+ if (trace_flag)\r
+ probe_show();\r
+\r
+ return mem;\r
+}\r
+#endif\r
+\r
+#ifdef ALLOCATEFONT\r
+int current_font_mem_size = 0;\r
+\r
+memory_word * realloc_font_info (int size)\r
+{\r
+ memory_word * new_font_info = NULL;\r
+ int k, min_size;\r
+ int new_size = 0;\r
+ int n = 0;\r
+\r
+ if (trace_flag)\r
+ printf("Old Address %s == %p\n", "font_info", font_info);\r
+\r
+ /* during initial allocation, font_info == NULL - realloc acts like malloc */\r
+ /* during initial allocation current_font_mem_size == 0 */\r
+ if (current_font_mem_size == font_mem_size) /* if we REALLY run up to limit */\r
+ {\r
+ /* memory_error("font", (font_mem_size + 1) * sizeof(memory_word)); */\r
+ return font_info; /* pass it back to TeX 99/Fabe/4 */\r
+ }\r
+ /* try and prevent excessive frequent reallocations */\r
+ /* while avoiding over allocation by too much */\r
+ /* min_size = current_font_mem_size / 2; */\r
+ min_size = current_font_mem_size / 100 * percent_grow;\r
+\r
+ if (size < min_size)\r
+ size = min_size;\r
+\r
+ if (size < initial_font_mem_size)\r
+ size = initial_font_mem_size;\r
+\r
+ for (k=0; k < MAXSPLITS; k++)\r
+ {\r
+ new_size = current_font_mem_size + size;\r
+\r
+ if (new_size > font_mem_size)\r
+ new_size = font_mem_size; /* bump against limit */\r
+\r
+/* important + 1 since fmemoryword font_info[font_mem_size + 1] original */\r
+ n = (new_size + 1) * sizeof (memory_word);\r
+\r
+ if (trace_flag)\r
+ trace_memory("font_info", n);\r
+\r
+ new_font_info = (memory_word *) REALLOC (font_info, n);\r
+\r
+ if (new_font_info != NULL)\r
+ break; /* did we get it ? */\r
+\r
+ if (current_font_mem_size == 0)\r
+ break; /* initial allocation must work */\r
+\r
+ size = size / 2;\r
+ }\r
+\r
+ if (new_font_info == NULL)\r
+ {\r
+ memory_error("font", n);\r
+ return font_info; /* try and continue !!! */\r
+ }\r
+\r
+ font_info = new_font_info;\r
+\r
+ if (trace_flag)\r
+ printf("New Address %s == %p\n", "font_info", font_info);\r
+\r
+ update_statistics ((long) font_info, n, current_font_mem_size * sizeof(memory_word));\r
+ current_font_mem_size = new_size;\r
+\r
+ if (trace_flag)\r
+ probe_show();\r
+\r
+ return font_info;\r
+}\r
+#endif\r
+\r
+#ifdef ALLOCATESTRING\r
+int current_pool_size = 0;\r
+\r
+packed_ASCII_code * realloc_str_pool (int size)\r
+{\r
+ int k, min_size;\r
+ int new_size = 0;\r
+ int n = 0;\r
+ packed_ASCII_code * new_str_pool = NULL;\r
+\r
+ if (trace_flag)\r
+ printf("Old Address %s == %p\n", "string pool", str_pool);\r
+\r
+ if (current_pool_size == pool_size)\r
+ {\r
+/* memory_error ("string pool", (pool_size + 1) * sizeof(packed_ASCII_code)); */\r
+/* exit (1); */\r
+ return str_pool; /* pass it back to TeX 99/Fabe/4 */\r
+ }\r
+\r
+ min_size = current_pool_size / 100 * percent_grow;\r
+\r
+ if (size < min_size)\r
+ size = min_size;\r
+\r
+ if (size < initial_pool_size)\r
+ size = initial_pool_size;\r
+\r
+ for (k = 0; k < MAXSPLITS; k++)\r
+ {\r
+ new_size = current_pool_size + size;\r
+\r
+ if (new_size > pool_size)\r
+ new_size = pool_size;\r
+/* important + 1 since packed_ASCII_code str_pool[pool_size + 1]; in original */\r
+ n = (new_size + 1) * sizeof (packed_ASCII_code);\r
+\r
+ if (trace_flag)\r
+ trace_memory("str_pool", n);\r
+\r
+ new_str_pool = (packed_ASCII_code *) REALLOC (str_pool, n); /* 95/Sep/24 */\r
+\r
+ if (new_str_pool != NULL)\r
+ break; /* did we get it ? */\r
+\r
+ if (current_pool_size == 0)\r
+ break; /* initial allocation must work */\r
+\r
+ size = size / 2; /* else can retry smaller */\r
+ }\r
+\r
+ if (new_str_pool == NULL)\r
+ {\r
+ memory_error("string pool", n);\r
+ return str_pool; /* try and continue !!! */\r
+ }\r
+\r
+ str_pool = new_str_pool;\r
+ update_statistics ((long) str_pool, n, current_pool_size);\r
+ current_pool_size = new_size;\r
+\r
+ if (trace_flag)\r
+ printf("New Address %s == %p\n", "string pool", str_pool);\r
+ \r
+ if (trace_flag)\r
+ probe_show();\r
+\r
+ return str_pool;\r
+}\r
+#endif\r
+\r
+#ifdef ALLOCATESTRING\r
+int current_max_strings = 0;\r
+\r
+pool_pointer * realloc_str_start (int size)\r
+{\r
+ int k, min_size;\r
+ int n = 0;\r
+ int new_size = 0;\r
+ pool_pointer * new_str_start = NULL;\r
+\r
+ if (trace_flag)\r
+ printf("Old Address %s == %p\n", "string start", str_start);\r
+\r
+ if (current_max_strings == max_strings)\r
+ {\r
+/* memory_error ("string pointer", (max_strings + 1) * sizeof(pool_pointer)); */\r
+/* exit (1); */\r
+ return str_start; /* pass it back to TeX 99/Fabe/4 */\r
+ }\r
+\r
+ min_size = current_max_strings / 100 * percent_grow;\r
+\r
+ if (size < min_size)\r
+ size = min_size;\r
+\r
+ if (size < initial_max_strings)\r
+ size = initial_max_strings;\r
+\r
+ for (k = 0; k < MAXSPLITS; k++)\r
+ {\r
+ new_size = current_max_strings + size;\r
+\r
+ if (new_size > max_strings)\r
+ new_size = max_strings;\r
+/* important + 1 since str_start[maxstring + 1] originally */\r
+ n = (new_size + 1) * sizeof (pool_pointer);\r
+\r
+ if (trace_flag)\r
+ trace_memory("str_start", n);\r
+\r
+ new_str_start = (pool_pointer *) REALLOC (str_start, n);\r
+\r
+ if (new_str_start != NULL)\r
+ break; /* did we get it ? */\r
+\r
+ if (current_max_strings == 0)\r
+ break; /* initial allocation must work */\r
+\r
+ size = size / 2; /* otherwise can try smaller */\r
+ }\r
+\r
+ if (new_str_start == NULL)\r
+ {\r
+ memory_error("string pointer", n);\r
+ return str_start; /* try and continue */\r
+ }\r
+\r
+ str_start = new_str_start;\r
+ update_statistics((long) str_start, n, current_max_strings * sizeof (pool_pointer));\r
+ current_max_strings = new_size;\r
+\r
+ if (trace_flag)\r
+ printf("New Address %s == %p\n", "string start", str_start);\r
+\r
+ if (trace_flag)\r
+ probe_show();\r
+\r
+ return str_start;\r
+}\r
+#endif\r
+\r
+#ifdef ALLOCATEINI\r
+/* returns -1 if it fails */\r
+/* size == trie_size */\r
+int allocate_ini (int size)\r
+{\r
+ int n, nl, no, nc, nr, nh, nt;\r
+\r
+ nh = (size + 1) * sizeof(trie_pointer);\r
+ nr = (size + 1) * sizeof(trie_pointer);\r
+ nl = (size + 1) * sizeof(trie_pointer);\r
+ no = (size + 1) * sizeof(trie_op_code);\r
+ nc = (size + 1) * sizeof(packed_ASCII_code);\r
+ nt = (size + 1) * sizeof(char);\r
+ n = nl + no + nc + nr + nh + nt;\r
+\r
+ if (trace_flag)\r
+ trace_memory ("initex hyphen trie", n);\r
+\r
+ trie_l = (trie_pointer *) malloc (roundup(nl));\r
+ trie_o = (trie_op_code *) malloc (roundup(no));\r
+ trie_c = (packed_ASCII_code *) malloc (roundup(nc));\r
+ trie_r = (trie_pointer *) malloc (roundup(nr));\r
+ trie_hash = (trie_pointer *) malloc (roundup(nh));\r
+ trie_taken = (char *) malloc (roundup(nt));\r
+ \r
+ if (trie_c == NULL || trie_o == NULL || trie_l == NULL || trie_r == NULL ||\r
+ trie_hash == NULL || trie_taken == NULL)\r
+ {\r
+ memory_error("initex hyphen trie", n);\r
+ return -1;\r
+ }\r
+ \r
+ if (trace_flag)\r
+ {\r
+ printf("Addresses: trie_l %p trie_o %p trie_c %p\n", trie_l, trie_o, trie_c);\r
+ printf("Addresses: trie_r %p trie_hash %p trie_taken %p\n", trie_r, trie_hash, trie_taken);\r
+ }\r
+\r
+ update_statistics ((long) trie_l, nl, 0);\r
+ update_statistics ((long) trie_o, no, 0);\r
+ update_statistics ((long) trie_c, nc, 0);\r
+ update_statistics ((long) trie_r, nr, 0);\r
+ update_statistics ((long) trie_hash, nh, 0);\r
+ update_statistics ((long) trie_taken, nt, 0);\r
+\r
+ if (trace_flag)\r
+ probe_show();\r
+\r
+ return 0; // success\r
+}\r
+#endif\r
+\r
+#ifdef ALLOCATESAVESTACK\r
+int current_save_size = 0;\r
+\r
+memory_word * realloc_save_stack (int size)\r
+{\r
+ int k, min_size;\r
+ int n = 0, new_size = 0;\r
+ memory_word * new_save_stack = NULL;\r
+\r
+ if (trace_flag)\r
+ printf("Old Address %s == %p\n", "save stack", save_stack);\r
+\r
+ if (current_save_size == save_size)\r
+ {\r
+ return save_stack; /* let TeX handle the error */\r
+ }\r
+\r
+ min_size = current_save_size / 100 * percent_grow;\r
+\r
+ if (size < min_size)\r
+ size = min_size;\r
+\r
+ if (size < initial_save_size)\r
+ size = initial_save_size;\r
+\r
+ for (k = 0; k < MAXSPLITS; k++)\r
+ {\r
+ new_size = current_save_size + size;\r
+\r
+ if (new_size > save_size)\r
+ new_size = save_size;\r
+\r
+ n = (new_size + 1) * sizeof (memory_word);\r
+\r
+ if (trace_flag)\r
+ trace_memory("save_stack", n);\r
+\r
+ new_save_stack = (memory_word *) REALLOC (save_stack, n);\r
+\r
+ if (new_save_stack != NULL)\r
+ break; /* did we get it ? */\r
+\r
+ if (current_save_size == 0)\r
+ break; /* initial allocation must work */\r
+\r
+ size = size / 2; /* else can retry smaller */\r
+ }\r
+\r
+ if (new_save_stack == NULL)\r
+ {\r
+ memory_error("save_stack", n);\r
+ return save_stack; /* try and continue !!! */\r
+ }\r
+\r
+ save_stack = new_save_stack;\r
+ update_statistics ((long) save_stack, n, current_save_size);\r
+ current_save_size = new_size;\r
+\r
+ if (trace_flag)\r
+ {\r
+ printf("Current %s %d\n", "save_size", current_save_size);\r
+ printf("New Address %s == %p\n", "save stack", save_stack);\r
+ }\r
+\r
+ if (trace_flag)\r
+ probe_show();\r
+\r
+ return save_stack;\r
+}\r
+#endif\r
+\r
+#ifdef ALLOCATEINPUTSTACK\r
+int current_stack_size = 0; /* input stack size */\r
+\r
+in_state_record * realloc_input_stack (int size)\r
+{\r
+ int k, min_size;\r
+ int n = 0, new_size = 0;\r
+ in_state_record * new_input_stack = NULL;\r
+\r
+ if (trace_flag)\r
+ printf("Old Address %s == %p\n", "input stack", input_stack);\r
+\r
+ if (current_stack_size == stack_size)\r
+ {\r
+ return input_stack;\r
+ }\r
+\r
+ min_size = current_stack_size / 100 * percent_grow;\r
+\r
+ if (size < min_size)\r
+ size = min_size;\r
+\r
+ if (size < initial_stack_size)\r
+ size = initial_stack_size;\r
+\r
+ for (k = 0; k < MAXSPLITS; k++)\r
+ {\r
+ new_size = current_stack_size + size;\r
+\r
+ if (new_size > stack_size)\r
+ new_size = stack_size;\r
+\r
+ n = (new_size + 1) * sizeof(in_state_record);\r
+\r
+ if (trace_flag)\r
+ trace_memory("input_stack", n);\r
+\r
+ new_input_stack = (in_state_record *) REALLOC (input_stack, n);\r
+\r
+ if (new_input_stack != NULL)\r
+ break; /* did we get it ? */\r
+\r
+ if (current_stack_size == 0)\r
+ break; /* initial allocation must work */\r
+\r
+ size = size / 2; /* else can retry smaller */\r
+ }\r
+\r
+ if (new_input_stack == NULL)\r
+ {\r
+ memory_error("input stack", n);\r
+ return input_stack; /* try and continue !!! */\r
+ }\r
+\r
+ input_stack = new_input_stack;\r
+ update_statistics ((long) input_stack, n, current_stack_size);\r
+ current_stack_size = new_size;\r
+\r
+ if (trace_flag)\r
+ {\r
+ printf("Current %s %d\n", "stack_size", current_stack_size);\r
+ printf("New Address %s == %p\n", "input stack", input_stack);\r
+ }\r
+\r
+ if (trace_flag)\r
+ probe_show();\r
+\r
+ return input_stack;\r
+}\r
+#endif\r
+\r
+#ifdef ALLOCATENESTSTACK\r
+int current_nest_size = 0; /* current nest size */\r
+\r
+list_state_record * realloc_nest_stack (int size)\r
+{\r
+ int k, min_size;\r
+ int n = 0, new_size = 0;\r
+ list_state_record * new_nest = NULL;\r
+\r
+ if (trace_flag)\r
+ printf("Old Address %s == %p\n", "nest stack", nest);\r
+\r
+ if (current_nest_size == nest_size)\r
+ {\r
+ return nest;\r
+ }\r
+\r
+ min_size = current_nest_size / 100 * percent_grow;\r
+\r
+ if (size < min_size)\r
+ size = min_size;\r
+\r
+ if (size < initial_nest_size)\r
+ size = initial_nest_size;\r
+\r
+ for (k = 0; k < MAXSPLITS; k++)\r
+ {\r
+ new_size = current_nest_size + size;\r
+\r
+ if (new_size > nest_size)\r
+ new_size = nest_size;\r
+\r
+ n = (new_size + 1) * sizeof (list_state_record);\r
+\r
+ if (trace_flag)\r
+ trace_memory("nest stack", n);\r
+\r
+ new_nest = (list_state_record *) REALLOC (nest, n);\r
+\r
+ if (new_nest != NULL)\r
+ break; /* did we get it ? */\r
+\r
+ if (current_nest_size == 0)\r
+ break; /* initial allocation must work */\r
+\r
+ size = size / 2; /* else can retry smaller */\r
+ }\r
+\r
+ if (new_nest == NULL)\r
+ {\r
+ memory_error("nest stack", n);\r
+ return nest; /* try and continue !!! */\r
+ }\r
+\r
+ nest = new_nest;\r
+ update_statistics ((long) nest, n, current_nest_size);\r
+ current_nest_size = new_size;\r
+\r
+ if (trace_flag)\r
+ {\r
+ printf("Current %s %d\n", "nest_size", current_nest_size);\r
+ printf("New Address %s == %p\n", "nest stack", nest);\r
+ }\r
+\r
+ if (trace_flag)\r
+ probe_show();\r
+\r
+ return nest;\r
+}\r
+#endif\r
+\r
+#ifdef ALLOCATEPARAMSTACK\r
+int current_param_size = 0;\r
+\r
+halfword * realloc_param_stack (int size)\r
+{\r
+ int k, min_size;\r
+ int n = 0, new_size = 0;\r
+ halfword * new_param = NULL;\r
+\r
+ if (trace_flag)\r
+ printf("Old Address %s == %p\n", "param stack", param_stack);\r
+\r
+ if (current_param_size == param_size)\r
+ {\r
+ return param_stack;\r
+ }\r
+\r
+ min_size = current_param_size / 100 * percent_grow;\r
+\r
+ if (size < min_size)\r
+ size = min_size;\r
+\r
+ if (size < initial_param_size)\r
+ size = initial_param_size;\r
+\r
+ for (k = 0; k < MAXSPLITS; k++)\r
+ {\r
+ new_size = current_param_size + size;\r
+\r
+ if (new_size > param_size)\r
+ new_size = param_size;\r
+\r
+ n = (new_size + 1) * sizeof(pointer);\r
+\r
+ if (trace_flag)\r
+ trace_memory("param stack", n);\r
+\r
+ new_param = (pointer *) REALLOC (param_stack, n);\r
+\r
+ if (new_param != NULL)\r
+ break; /* did we get it ? */\r
+\r
+ if (current_param_size == 0)\r
+ break; /* initial allocation must work */\r
+\r
+ size = size / 2; /* else can retry smaller */\r
+ }\r
+\r
+ if (new_param == NULL)\r
+ {\r
+ memory_error("param stack", n);\r
+ return param_stack; /* try and continue !!! */\r
+ }\r
+\r
+ param_stack = new_param;\r
+ update_statistics((long) param_stack, n, current_param_size);\r
+ current_param_size = new_size;\r
+\r
+ if (trace_flag)\r
+ {\r
+ printf("Current %s %d\n", "param_size", current_param_size);\r
+ printf("New Address %s == %p\n", "param stack", param_stack);\r
+ }\r
+\r
+ if (trace_flag)\r
+ probe_show();\r
+\r
+ return param_stack;\r
+}\r
+#endif\r
+\r
+#ifdef ALLOCATEBUFFER\r
+int current_buf_size = 0;\r
+\r
+ASCII_code * realloc_buffer (int size)\r
+{\r
+ int k, min_size;\r
+ int n = 0, new_size = 0;\r
+ ASCII_code * new_buffer = NULL;\r
+\r
+ if (trace_flag)\r
+ printf("Old Address %s == %p\n", "buffer", buffer);\r
+\r
+ if (current_buf_size == buf_size)\r
+ {\r
+ return buffer;\r
+ }\r
+\r
+ min_size = current_buf_size / 100 * percent_grow;\r
+\r
+ if (size < min_size)\r
+ size = min_size;\r
+\r
+ if (size < initial_buf_size)\r
+ size = initial_buf_size;\r
+\r
+ for (k = 0; k < MAXSPLITS; k++)\r
+ {\r
+ new_size = current_buf_size + size;\r
+\r
+ if (new_size > buf_size)\r
+ new_size = buf_size;\r
+\r
+ n = (new_size + 1) * sizeof(ASCII_code);\r
+\r
+ if (trace_flag)\r
+ trace_memory("buffer", n);\r
+\r
+ new_buffer = (ASCII_code *) REALLOC (buffer, n);\r
+\r
+ if (new_buffer != NULL)\r
+ break; /* did we get it ? */\r
+\r
+ if (current_buf_size == 0)\r
+ break; /* initial allocation must work */\r
+\r
+ size = size / 2;\r
+ }\r
+\r
+ if (new_buffer == NULL)\r
+ {\r
+ memory_error("buffer", n);\r
+ return buffer; /* try and continue !!! */\r
+ }\r
+\r
+ buffer = new_buffer;\r
+ update_statistics ((long) buffer, n, current_buf_size);\r
+\r
+#ifdef USEMEMSET\r
+ memset(buffer + current_buf_size, 0, new_size - current_buf_size);\r
+#else\r
+ for (k = current_buf_size; k < new_size; k++)\r
+ buffer[k] = 0;\r
+#endif\r
+\r
+ current_buf_size = new_size;\r
+\r
+ if (trace_flag)\r
+ {\r
+ printf("Current %s %d\n", "buffer", current_buf_size);\r
+ printf("New Address %s == %p\n", "buffer", buffer);\r
+ }\r
+\r
+ if (trace_flag)\r
+ probe_show();\r
+\r
+ return buffer;\r
+}\r
+#endif\r
+\r
+/* here is the main memory allocation routine -- calls the above */\r
+/* returns -1 if it fails */\r
+/* allocate rather than static 93/Nov/26 */\r
+int allocate_memory (void)\r
+{\r
+#ifdef ALLOCATEINPUTSTACK\r
+ input_stack = NULL;\r
+ current_stack_size = 0;\r
+ input_stack = realloc_input_stack(initial_stack_size);\r
+#endif\r
+\r
+#ifdef ALLOCATENESTSTACK\r
+ nest = NULL;\r
+ current_nest_size = 0;\r
+ nest = realloc_nest_stack(initial_nest_size);\r
+#endif\r
+\r
+#ifdef ALLOCATEPARAMSTACK\r
+ param_stack = NULL;\r
+ current_param_size = 0;\r
+ param_stack = realloc_param_stack(initial_param_size);\r
+#endif\r
+\r
+#ifdef ALLOCATESAVESTACK\r
+ save_stack = NULL;\r
+ current_save_size = 0;\r
+ save_stack = realloc_save_stack (initial_save_size);\r
+#endif\r
+\r
+#ifdef IGNORED\r
+ buffer = NULL; /* need to do earlier */\r
+ current_buf_size = 0;\r
+ buffer = realloc_buffer (initial_buf_size);\r
+#endif\r
+\r
+#ifdef ALLOCATESTRING\r
+ str_pool = NULL;\r
+ current_pool_size = 0;\r
+ str_start = NULL;\r
+ current_max_strings = 0;\r
+\r
+/* maybe taylor allocations to actual pool file 1300 strings 27000 bytes ? */\r
+ if (is_initex)\r
+ {\r
+ if (trace_flag)\r
+ puts("ini TeX pool and string allocation");\r
+\r
+ str_pool = realloc_str_pool(initial_pool_size);\r
+ str_start = realloc_str_start(initial_max_strings);\r
+ }\r
+#endif\r
+\r
+/* the following can save a lot of the usual 800k fixed allocation */\r
+#ifdef ALLOCATEFONT\r
+ font_info = NULL;\r
+ current_font_mem_size = 0;\r
+/* if not iniTeX, then do initial allocation on fmt file read in itex.c */\r
+/* if ini-TeX we need to do it here - no format file read later */\r
+ if (is_initex)\r
+ font_info = realloc_font_info(initial_font_mem_size);\r
+#endif\r
+\r
+#ifdef ALLOCATEMAIN\r
+ main_memory = NULL;\r
+ mem = NULL;\r
+ mem_min = mem_bot; /* just to avoid complaints in texbody */\r
+ mem_top = mem_initex;\r
+ mem_max = mem_top;\r
+/* allocate main memory here if this is iniTeX */\r
+/* otherwise wait for format undumping in itex.c ... */\r
+ if (is_initex)\r
+ {\r
+ /* avoid this if format specified on command line ??? */\r
+ mem = allocate_main_memory(mem_initex); /* made variable ! */\r
+\r
+ if (mem == NULL)\r
+ return -1;\r
+ }\r
+#endif\r
+\r
+/* now for the hyphenation exception stuff */\r
+#ifdef ALLOCATEHYPHEN\r
+ hyph_word = NULL;\r
+ hyph_list = NULL;\r
+/* this will be overridden later by what is in format file */\r
+ hyphen_prime = default_hyphen_prime;\r
+/* non ini-TeX use assumes format will be read and that specifies size */\r
+ if (is_initex)\r
+ {\r
+ if (new_hyphen_prime)\r
+ hyphen_prime = new_hyphen_prime;\r
+\r
+ if (realloc_hyphen(hyphen_prime)) /* allocate just in case no format */\r
+ return -1;\r
+ }\r
+#endif\r
+\r
+/* now for memory for the part of the hyphenation stuff that always needed */\r
+/* if iniTeX, need to allocate pre-determined fixed amount - trie_size */\r
+/* if iniTeX not selected, allocate only enough later - undump in itex.c ! */\r
+#ifdef ALLOCATETRIES\r
+ if (is_initex)\r
+ {\r
+ if (allocate_tries (trie_size))\r
+ return -1;\r
+ }\r
+#endif\r
+\r
+/* now for memory for hyphenation stuff needed only when running iniTeX */\r
+#ifdef ALLOCATEINI\r
+ if (is_initex)\r
+ {\r
+ if (allocate_ini(trie_size))\r
+ return -1;\r
+ }\r
+ else\r
+ {\r
+ trie_l = NULL;\r
+ trie_r = NULL;\r
+ trie_o = NULL;\r
+ trie_hash = NULL;\r
+ trie_c = NULL;\r
+ trie_taken = NULL;\r
+ }\r
+#endif\r
+\r
+ return 0; // success\r
+}\r
+\r
+/* returns non-zero if error - done to test integrity of stack mostly */\r
+int free_memory (void)\r
+{\r
+ unsigned int heap_total = 0;\r
+\r
+ if (trace_flag)\r
+ puts("free_memory ");\r
+\r
+ if (verbose_flag || trace_flag)\r
+ show_maximums(stdout); \r
+\r
+ if (trace_flag)\r
+ {\r
+ printf("Heap total: %u bytes --- max address %u\n", \r
+ heap_total, max_address);\r
+ printf("Main Memory: variable node %lld (%lld - %d);\n"\r
+ " one word %d (%d - %d)\n",\r
+ lo_mem_max - mem_min, mem_min, lo_mem_max,\r
+ mem_end - hi_mem_min, hi_mem_min, mem_end);\r
+ puts("Freeing memory again");\r
+ }\r
+\r
+/* only free memory if safe ... additional check */\r
+#ifdef ALLOCATEINI\r
+ if (is_initex)\r
+ {\r
+ if (trie_taken != NULL)\r
+ free(trie_taken);\r
+\r
+ if (trie_hash != NULL)\r
+ free(trie_hash);\r
+\r
+ if (trie_r != NULL)\r
+ free(trie_r);\r
+\r
+ if (trie_c != NULL)\r
+ free(trie_c);\r
+\r
+ if (trie_o != NULL)\r
+ free(trie_o);\r
+\r
+ if (trie_l != NULL)\r
+ free(trie_l);\r
+\r
+ trie_taken = NULL;\r
+ trie_hash = NULL;\r
+ trie_l = NULL;\r
+ trie_r = NULL;\r
+ trie_c = NULL;\r
+ trie_o = NULL;\r
+ }\r
+#endif\r
+\r
+#ifdef ALLOCATETRIES\r
+ if (trie_trc != NULL)\r
+ free(trie_trc);\r
+\r
+ if (trie_tro != NULL)\r
+ free(trie_tro);\r
+\r
+ if (trie_trl != NULL)\r
+ free(trie_trl);\r
+\r
+ trie_trc = NULL;\r
+ trie_tro = NULL;\r
+ trie_trl = NULL;\r
+#endif\r
+\r
+#ifdef ALLOCATEHYPHEN\r
+ if (hyph_list != NULL)\r
+ free(hyph_list);\r
+\r
+ if (hyph_word != NULL)\r
+ free(hyph_word);\r
+\r
+ hyph_list = NULL;\r
+ hyph_word = NULL;\r
+#endif\r
+\r
+#ifdef ALLOCATEMAIN\r
+ if (main_memory != NULL)\r
+ free(main_memory);\r
+\r
+ main_memory = NULL;\r
+#endif\r
+\r
+#ifdef ALLOCATEFONT\r
+ if (font_info != NULL)\r
+ free(font_info);\r
+\r
+ font_info = NULL;\r
+#endif\r
+\r
+#ifdef ALLOCATESTRING\r
+ if (str_start != NULL)\r
+ free(str_start);\r
+\r
+ if (str_pool != NULL)\r
+ free(str_pool);\r
+\r
+ str_start = NULL;\r
+ str_pool = NULL;\r
+#endif\r
+\r
+#ifdef ALLOCATEPARAMSTACK\r
+ if (param_stack != NULL)\r
+ free(param_stack);\r
+\r
+ param_stack = NULL;\r
+#endif\r
+\r
+#ifdef ALLOCATENESTSTACK\r
+ if (nest != NULL)\r
+ free(nest);\r
+\r
+ nest = NULL;\r
+#endif\r
+\r
+#ifdef ALLOCATEINPUTSTACK\r
+ if (input_stack != NULL)\r
+ free(input_stack);\r
+\r
+ input_stack = NULL;\r
+#endif\r
+\r
+#ifdef ALLOCATESAVESTACK\r
+ if (save_stack != NULL)\r
+ free(save_stack);\r
+\r
+ save_stack = NULL;\r
+#endif\r
+\r
+ if (format_file != NULL)\r
+ free(format_file);\r
+\r
+ if (source_direct != NULL)\r
+ free(source_direct);\r
+\r
+ format_file = NULL;\r
+ source_direct = NULL;\r
+\r
+ if (dvi_file_name != NULL)\r
+ free(dvi_file_name);\r
+\r
+ if (log_file_name != NULL)\r
+ free(log_file_name);\r
+\r
+ if (pdf_file_name != NULL)\r
+ free(pdf_file_name);\r
+\r
+ pdf_file_name = NULL;\r
+ log_file_name = NULL;\r
+ dvi_file_name = NULL;\r
+\r
+ return 0;\r
+}\r
+\r
+boolean prime (int x)\r
+{\r
+ int k;\r
+ int sum = 1; /* 1 + 3 + 5 + k = (k + 1) * (k + 1) / 4 */\r
+\r
+ if (x % 2 == 0)\r
+ return false;\r
+\r
+ for (k = 3; k < x; k = k + 2)\r
+ {\r
+ if (x % k == 0)\r
+ return false;\r
+\r
+ if (sum * 4 > x)\r
+ return true;\r
+\r
+ sum += k;\r
+ }\r
+\r
+ return true;\r
+}\r
+\r
+boolean show_use = false;\r
+\r
+void complainarg (int c, char *s)\r
+{\r
+ printf("ERROR: Do not understand `%c' argument value `%s'\n", c, s);\r
+ show_use = true;\r
+}\r
+\r
+/* following is list of allowed command line flags and args */\r
+\r
+char *allowedargs = "+bcdfijnpqrstvwyzABCDFGIJKLMNOPQRSTVWXYZ023456789?a=e=g=h=k=l=m=o=u=x=E=H=P=U=";\r
+\r
+void reorderargs (int ac, char **av)\r
+{\r
+ int n, m;\r
+ char *s, *t;\r
+ char takeargs[256]; /* large enough for all command line arg chars */\r
+\r
+ if (ac < 3)\r
+ {\r
+ return; /* no args ! */\r
+ }\r
+\r
+ s = allowedargs;\r
+ t = takeargs; /* list of those that take args */\r
+\r
+ while (*s != '\0' && *(s + 1) != '\0')\r
+ {\r
+ if (*(s + 1) == '=')\r
+ *t++ = *s++; /* copy over --- without the = */\r
+\r
+ s++;\r
+ }\r
+\r
+ *t = '\0';\r
+\r
+ if (trace_flag)\r
+ {\r
+ show_line(takeargs, 0);\r
+ wterm_cr();\r
+ }\r
+ \r
+ n = 1;\r
+\r
+ for (;;)\r
+ {\r
+ if (*av[n] != '-')\r
+ break;\r
+\r
+ if (n + 1 < ac && *(av[n] + 2) == '\0' &&\r
+ strchr(takeargs, *(av[n] + 1)) != NULL)\r
+ n += 2; /* step over it */\r
+ else\r
+ n++;\r
+\r
+ if (n == ac)\r
+ break;\r
+ }\r
+\r
+ for (;;)\r
+ {\r
+ if (n == ac)\r
+ break;\r
+\r
+ m = n;\r
+\r
+ while (m < ac && *av[m] != '-')\r
+ m++; /* first command */\r
+\r
+ if (m == ac)\r
+ break;\r
+/* does it take an argument ? and is this argument next ? */\r
+/* check first whether the `-x' is isolated, or arg follows directly */\r
+/* then check whether this is one of those that takes an argument */\r
+ if (m+1 < ac && *(av[m] + 2) == '\0' &&\r
+ strchr(takeargs, *(av[m] + 1)) != NULL)\r
+ {\r
+ s = av[m]; /* move command down before non-command */\r
+ t = av[m + 1];\r
+\r
+ for (; m > n; m--)\r
+ av[m + 1] = av[m - 1];\r
+\r
+ av[n] = s;\r
+ av[n + 1] = t;\r
+ n += 2; /* step over moved args */\r
+ }\r
+ else\r
+ {\r
+ s = av[m]; /* move command down before non-command */\r
+\r
+ for (; m > n; m--)\r
+ av[m] = av[m - 1];\r
+\r
+ av[n] = s;\r
+ n++; /* step over moved args */\r
+ }\r
+ }\r
+}\r
+\r
+int test_align (long address, int size, const char *str)\r
+{\r
+ int n;\r
+\r
+ if (size > sizeof(void *))\r
+ n = address % sizeof(void *);\r
+ else\r
+ n = address % size;\r
+\r
+ if (n != 0)\r
+ printf("OFFSET %d (ELEMENT %d) in %s\n", n, size, str);\r
+\r
+ return n;\r
+}\r
+\r
+/* activate detailed checking of alignment when trace_flag is set */\r
+\r
+void check_fixed_align (int flag)\r
+{\r
+ (void) flag;\r
+\r
+ if (test_align ((long) &mem_top, 4, "FIXED ALIGNMENT"))\r
+ {\r
+ puts("PLEASE RECOMPILE ME!");\r
+ }\r
+\r
+#ifdef CHECKALIGNMENT\r
+ if (!flag)\r
+ return;\r
+\r
+ test_align ((long) &mem_top, 4, "mem_top");\r
+ test_align ((long) &mem_max, 4, "mem_max");\r
+ test_align ((long) &mem_min, 4, "mem_min");\r
+ test_align ((long) &bad, 4, "bad");\r
+ test_align ((long) &trie_size, 4, "trie_size");\r
+ test_align ((long) &xord, sizeof(xord[0]), "xord");\r
+ test_align ((long) &xchr, sizeof(xchr[0]), "xchr");\r
+ test_align ((long) &name_length, 4, "name_length");\r
+ test_align ((long) &first, 4, "first");\r
+ test_align ((long) &last, 4, "last");\r
+ test_align ((long) &max_buf_stack, 4, "max_buf_stack");\r
+ test_align ((long) &pool_ptr, 4, "pool_ptr");\r
+ test_align ((long) &str_ptr, 4, "str_ptr");\r
+ test_align ((long) &init_pool_ptr, 4, "init_pool_ptr");\r
+ test_align ((long) &init_str_ptr, 4, "init_str_ptr");\r
+ test_align ((long) &log_file, 4, "log_file");\r
+ test_align ((long) &tally, 4, "tally");\r
+ test_align ((long) &term_offset, 4, "term_offset");\r
+ test_align ((long) &file_offset, 4, "file_offset");\r
+ test_align ((long) &trick_count, 4, "trick_count");\r
+ test_align ((long) &first_count, 4, "first_count");\r
+ test_align ((long) &deletions_allowed, 4, "deletions_allowed");\r
+ test_align ((long) &set_box_allowed, 4, "set_box_allowed");\r
+ test_align ((long) &help_line, sizeof(help_line[0]), "help_line");\r
+ test_align ((long) &use_err_help, 4, "use_err_help");\r
+ test_align ((long) &interrupt, 4, "interrupt");\r
+ test_align ((long) &OK_to_interrupt, 4, "OK_to_interrupt");\r
+ test_align ((long) &arith_error, 4, "arith_error");\r
+ test_align ((long) &tex_remainder, 4, "tex_remainder");\r
+ test_align ((long) &temp_ptr, 4, "temp_ptr");\r
+ test_align ((long) &lo_mem_max, 4, "lo_mem_max");\r
+ test_align ((long) &hi_mem_min, 4, "hi_mem_min");\r
+ test_align ((long) &var_used, 4, "var_used");\r
+ test_align ((long) &dyn_used, 4, "dyn_used");\r
+ test_align ((long) &avail, 4, "avail");\r
+ test_align ((long) &mem_end, 4, "mem_end");\r
+ test_align ((long) &mem_start, 4, "mem_start");\r
+ test_align ((long) &rover, 4, "rover");\r
+ test_align ((long) &font_in_short_display, 4, "font_in_short_display");\r
+ test_align ((long) &depth_threshold, 4, "depth_threshold");\r
+ test_align ((long) &breadth_max, 4, "breadth_max");\r
+ test_align ((long) &nest, sizeof(nest[0]), "nest");\r
+ // test_align ((long) &xeq_level, sizeof(xeq_level[0]), "xeq_level");\r
+ test_align ((long) &zzzad, sizeof(zzzad[0]), "zzzad");\r
+ // test_align ((long) &hash, sizeof(hash[0]), "hash");\r
+ test_align ((long) &zzzae, sizeof(zzzae[0]), "zzzae");\r
+ test_align ((long) &save_stack, sizeof(save_stack[0]), "save_stack");\r
+ test_align ((long) &input_stack, sizeof(input_stack[0]), "input_stack");\r
+ test_align ((long) &input_file, sizeof(input_file[0]), "input_file");\r
+ test_align ((long) &line_stack, sizeof(line_stack[0]), "line_stack");\r
+ test_align ((long) ¶m_stack, sizeof(param_stack[0]), "param_stack");\r
+ test_align ((long) &cur_mark, sizeof(cur_mark[0]), "cur_mark");\r
+ test_align ((long) &pstack, sizeof(pstack[0]), "pstack");\r
+ test_align ((long) &read_file, sizeof(read_file[0]), "read_file");\r
+ test_align ((long) &font_check, sizeof(font_check[0]), "font_check");\r
+ test_align ((long) &font_size, sizeof(font_size[0]), "font_size");\r
+ test_align ((long) &font_dsize, sizeof(font_dsize[0]), "font_dsize");\r
+ test_align ((long) &font_params, sizeof(font_params[0]), "font_params");\r
+ test_align ((long) &font_name, sizeof(font_name[0]), "font_name");\r
+ test_align ((long) &font_area, sizeof(font_area[0]), "font_area");\r
+ test_align ((long) &font_bc, sizeof(font_bc[0]), "font_bc");\r
+ test_align ((long) &font_ec, sizeof(font_ec[0]), "font_ec");\r
+ test_align ((long) &font_glue, sizeof(font_glue[0]), "font_glue");\r
+ test_align ((long) &font_used, sizeof(font_used[0]), "font_used");\r
+ test_align ((long) &hyphen_char, sizeof(hyphen_char[0]), "hyphen_char");\r
+ test_align ((long) &skew_char, sizeof(skew_char[0]), "skew_char");\r
+ test_align ((long) &bchar_label, sizeof(bchar_label[0]), "bchar_label");\r
+ test_align ((long) &font_bchar, sizeof(font_bchar[0]), "font_bchar");\r
+ test_align ((long) &font_false_bchar, sizeof(font_false_bchar[0]), "font_false_bchar");\r
+ test_align ((long) &char_base, sizeof(char_base[0]), "char_base");\r
+ test_align ((long) &width_base, sizeof(width_base[0]), "width_base");\r
+ test_align ((long) &height_base, sizeof(height_base[0]), "height_base");\r
+ test_align ((long) &depth_base, sizeof(depth_base[0]), "depth_base");\r
+ test_align ((long) &italic_base, sizeof(italic_base[0]), "italic_base");\r
+ test_align ((long) &lig_kern_base, sizeof(lig_kern_base[0]), "lig_kern_base");\r
+ test_align ((long) &kern_base, sizeof(kern_base[0]), "kern_base");\r
+ test_align ((long) &exten_base, sizeof(exten_base[0]), "exten_base");\r
+ test_align ((long) ¶m_base, sizeof(param_base[0]), "param_base");\r
+ test_align ((long) &total_stretch, sizeof(total_stretch[0]), "total_stretch");\r
+ test_align ((long) &total_shrink, sizeof(total_shrink[0]), "total_shrink");\r
+ test_align ((long) &active_width, sizeof(active_width[0]), "active_width");\r
+ test_align ((long) &cur_active_width, sizeof(cur_active_width[0]), "cur_active_width");\r
+ test_align ((long) &background, sizeof(background[0]), "background");\r
+ test_align ((long) &break_width, sizeof(break_width[0]), "break_width");\r
+ test_align ((long) &minimal_demerits, sizeof(minimal_demerits[0]), "minimal_demerits");\r
+ test_align ((long) &best_place, sizeof(best_place[0]), "best_place");\r
+ test_align ((long) &best_pl_line, sizeof(best_pl_line[0]), "best_pl_line");\r
+ test_align ((long) &hc, sizeof(hc[0]), "hc");\r
+ test_align ((long) &hu, sizeof(hu[0]), "hu");\r
+ test_align ((long) &hyf, sizeof(hyf[0]), "hyf");\r
+ // test_align ((long) &x, sizeof(x[0]), "x");\r
+ test_align ((long) &hyf_distance, sizeof(hyf_distance[0]), "hyf_distance");\r
+ test_align ((long) &hyf_num, sizeof(hyf_num[0]), "hyf_num");\r
+ test_align ((long) &hyf_next, sizeof(hyf_next[0]), "hyf_next");\r
+ test_align ((long) &op_start, sizeof(op_start[0]), "op_start");\r
+ // test_align ((long) &trie_op_hash, sizeof(trie_op_hash[0]), "trie_op_hash");\r
+ test_align ((long) &trie_used, sizeof(trie_used[0]), "trie_used");\r
+/* test_align ((long) &trie_op_lang, sizeof(trie_op_lang[0]), "trie_op_lang");*/\r
+ test_align ((long) &trie_op_val, sizeof(trie_op_val[0]), "trie_op_val");\r
+ test_align ((long) &trie_min, sizeof(trie_min[0]), "trie_min");\r
+ test_align ((long) &page_so_far, sizeof(page_so_far[0]), "page_so_far");\r
+ test_align ((long) &write_file, sizeof(write_file[0]), "write_file");\r
+ test_align ((long) &write_open, sizeof(write_open[0]), "write_open");\r
+#endif\r
+}\r
+\r
+void check_alloc_align (int flag)\r
+{\r
+ (void) flag;\r
+\r
+ if (test_align((long) eqtb, sizeof(eqtb[0]), "ALLOCATED ALIGNMENT"))\r
+ puts("PLEASE RECOMPILE ME!");\r
+\r
+#ifdef CHECKALIGNMENT\r
+ if (!flag)\r
+ return;\r
+\r
+#ifndef ALLOCZEQTB\r
+ test_align ((long) eqtb, sizeof(eqtb[0]), "eqtb"); \r
+#endif\r
+\r
+ test_align ((long) str_pool, sizeof(str_pool[0]), "str_pool"); /* no op */\r
+ test_align ((long) str_start, sizeof(str_start[0]), "str_start");\r
+ test_align ((long) mem, sizeof(mem[0]), "main memory");\r
+ test_align ((long) font_info, sizeof(font_info[0]), "font memory");\r
+ test_align ((long) trie_trl, sizeof(trie_trl[0]), "trie_trl");\r
+ test_align ((long) trie_tro, sizeof(trie_tro[0]), "trie_tro");\r
+ test_align ((long) trie_trc, sizeof(trie_trc[0]), "trie_trc");\r
+ test_align ((long) hyph_word, sizeof(hyph_word[0]), "hyph_word");\r
+ test_align ((long) hyph_list, sizeof(hyph_list[0]), "hyph_list");\r
+/* test_align ((long) trie_c, sizeof(trie_c[0]), "trie_c"); *//* no op */\r
+ test_align ((long) trie_o, sizeof(trie_o[0]), "trie_o");\r
+ test_align ((long) trie_l, sizeof(trie_l[0]), "trie_l");\r
+ test_align ((long) trie_r, sizeof(trie_r[0]), "trie_r");\r
+ test_align ((long) trie_hash, sizeof(trie_hash[0]), "trie_hash");\r
+ test_align ((long) trie_taken, sizeof(trie_taken[0]), "trie_taken");\r
+#endif\r
+}\r
+\r
+boolean shorten_file_name = false; /* don't shorten file names to 8+3 for DOS */\r
+\r
+/* cache to prevent allocating twice in a row */\r
+\r
+char * lastname = NULL;\r
+char * lastvalue = NULL;\r
+\r
+/* returns allocated string -- these strings are not freed again */\r
+/* is it safe to do that now ? 98/Jan/31 */\r
+char * grabenv (const char * varname)\r
+{\r
+ char * s;\r
+\r
+ if (varname == NULL)\r
+ return NULL;\r
+\r
+ if (*varname == '\0')\r
+ return NULL;\r
+\r
+ if (lastname != NULL && strcasecmp(lastname, varname) == 0)\r
+ {\r
+ if (trace_flag)\r
+ printf("Cache hit: %s=%s\n", lastname, lastvalue);\r
+\r
+ return xstrdup(lastvalue);\r
+ }\r
+\r
+ s = getenv(varname);\r
+\r
+ if (s != NULL)\r
+ {\r
+ if (lastname != NULL)\r
+ free(lastname);\r
+\r
+ lastname = xstrdup(varname);\r
+\r
+ if (lastvalue != NULL)\r
+ free(lastvalue);\r
+\r
+ lastvalue = xstrdup(s);\r
+\r
+ return xstrdup(s);\r
+ }\r
+ else\r
+ return NULL;\r
+}\r
+\r
+void flush_trailing_slash (char * directory)\r
+{\r
+ char * s;\r
+\r
+ if (strcmp(directory, "") != 0)\r
+ {\r
+ s = directory + strlen(directory) - 1;\r
+\r
+ if (*s == '\\' || *s == '/')\r
+ *s = '\0';\r
+ }\r
+}\r
+\r
+void knuthify (void)\r
+{\r
+ restrict_to_ascii = false; /* don't complain non ASCII */\r
+ allow_patterns = false; /* don't allow pattern redefinition */\r
+ show_in_hex = true; /* show character code in hex */\r
+ show_numeric = false; /* don't show character code decimal */\r
+ show_missing = false; /* don't show missing characters */\r
+ civilize_flag = false; /* don't reorder date fields */\r
+ c_style_flag = false; /* don't add file name to error msg */\r
+ show_fmt_flag = false; /* don't show format file in log */\r
+ show_tfm_flag = false; /* don't show metric file in log */\r
+ tab_step = 0; /* tab's size of width */\r
+ show_line_break_stats = false; /* do not show line break stats */\r
+ show_fonts_used = false;\r
+ default_rule = 26214; /* revert to default rule thickness */\r
+ pseudo_tilde = false;\r
+ pseudo_space = false;\r
+ truncate_long_lines = false;\r
+ allow_quoted_names = false;\r
+ show_cs_names = false;\r
+ ignore_frozen = false;\r
+ suppress_f_ligs = false;\r
+ full_file_name_flag = false;\r
+ knuth_flag = true; /* so other code can know about this */\r
+}\r
+\r
+/* following made global so analyze_flag can be made separate procedure */\r
+\r
+char * xchr_file = NULL;\r
+char * repl_file = NULL;\r
+\r
+const char * short_options = "m:e:h:0:H:g:P:o:l:a:r:kwvpiKLZMd2t?u";\r
+\r
+static struct option long_options[] =\r
+{\r
+ {"main-memory", required_argument, NULL, 'm'},\r
+ {"hyph-size", required_argument, NULL, 'e'},\r
+ {"trie-size", required_argument, NULL, 'h'},\r
+ {"backend", required_argument, NULL, '0'},\r
+ {"tab-step", required_argument, NULL, 'H'},\r
+ {"percent-grow", required_argument, NULL, 'g'},\r
+ {"default-rule", required_argument, NULL, 'P'},\r
+ {"dvi-dir", required_argument, NULL, 'o'},\r
+ {"log-dir", required_argument, NULL, 'l'},\r
+ {"aux-dir", required_argument, NULL, 'a'},\r
+ {"key-file", required_argument, NULL, 'k'},\r
+ {"jobname", required_argument, NULL, 'r'},\r
+ {"showhex", no_argument, NULL, 'w'},\r
+ {"verbose", no_argument, NULL, 'v'},\r
+ {"patterns", no_argument, NULL, 'p'},\r
+ {"initex", no_argument, NULL, 'i'},\r
+ {"knuthify", no_argument, NULL, 'K'},\r
+ {"cstyle", no_argument, NULL, 'L'},\r
+ {"showtfm", no_argument, NULL, 'Z'},\r
+ {"showmissing", no_argument, NULL, 'M'},\r
+ {"deslash", no_argument, NULL, 'd'},\r
+ {"suppressflig", no_argument, NULL, '2'},\r
+ {"trace", no_argument, NULL, 't'},\r
+ {"help", no_argument, NULL, '?'},\r
+ {"usage", no_argument, NULL, 'u'},\r
+ {NULL, 0, 0, 0}\r
+};\r
+\r
+int analyze_flag (int c, char * optarg)\r
+{\r
+ switch (c)\r
+ {\r
+ case 'r':\r
+ c_job_name = optarg;\r
+ break;\r
+ case 'v':\r
+ verbose_flag = true;\r
+ break;\r
+ case 'i':\r
+ is_initex = true;\r
+ break;\r
+ case 'Q':\r
+ interaction = batch_mode;\r
+ break;\r
+ case 'R':\r
+ interaction = nonstop_mode;\r
+ break;\r
+ case 'S':\r
+ interaction = scroll_mode;\r
+ break;\r
+ case 'T':\r
+ interaction = error_stop_mode;\r
+ break;\r
+ case 'K':\r
+ knuthify();\r
+ break;\r
+ case 'L':\r
+ c_style_flag = true;\r
+ break;\r
+ case 'Z':\r
+ show_tfm_flag = true;\r
+ break;\r
+ case 'M':\r
+ show_missing = false;\r
+ break;\r
+ case 'd':\r
+ deslash = false;\r
+ break;\r
+ case 'p':\r
+ allow_patterns = true;\r
+ break;\r
+ case 'w':\r
+ show_in_hex = true;\r
+ break;\r
+ case 'n':\r
+ restrict_to_ascii = true; /* 0 - 127 1994/Jan/21 */\r
+ break;\r
+ case 'f':\r
+ show_fonts_used = false;\r
+ break;\r
+ case '8':\r
+ shorten_file_name = true;\r
+ break;\r
+ case '9':\r
+ show_cs_names = true;\r
+ break;\r
+ case '4':\r
+ ignore_frozen = true;\r
+ break;\r
+ case 'J':\r
+ show_line_break_stats = false; /* 96/Feb/8 */\r
+ break;\r
+ case 'O':\r
+ show_fmt_flag = false; /* 94/Jun/21 */\r
+ break;\r
+ case '2':\r
+ suppress_f_ligs = true; /* 99/Jan/5 f-lig */\r
+ break;\r
+ case 'z':\r
+ full_file_name_flag = false; // 00 Jun 18\r
+ break;\r
+ case 't':\r
+ trace_flag = true;\r
+ break;\r
+/* The following are really obscure and should not be advertized */\r
+ case 's':\r
+ show_current = false;\r
+ break;\r
+ case 'N':\r
+ show_numeric = false;\r
+ break;\r
+ case 'A':\r
+ civilize_flag = false;\r
+ break; \r
+ case 'B':\r
+ open_trace_flag = true;\r
+ break;\r
+ case 'Y':\r
+ reorder_arg_flag = false; /* local */\r
+ break;\r
+\r
+ case 'm':\r
+ if (optarg == 0)\r
+ mem_initex = mem_top;\r
+ else\r
+ mem_initex = atoi(optarg) * 1024;\r
+\r
+ if (mem_initex == 0)\r
+ complainarg(c, optarg);\r
+\r
+ mem_spec_flag = true;\r
+ break;\r
+\r
+#ifdef VARIABLETRIESIZE\r
+ case 'h':\r
+ if (optarg == 0)\r
+ {\r
+ //trie_size = atoi(kpse_var_value("trie_size"));\r
+ trie_size = default_trie_size;\r
+ }\r
+ else\r
+ trie_size = atoi(optarg);\r
+\r
+ if (trie_size == 0)\r
+ complainarg(c, optarg);\r
+ break;\r
+#endif\r
+\r
+#ifdef ALLOCATEHYPHEN\r
+ case 'e':\r
+ if (optarg == 0)\r
+ new_hyphen_prime = hyphen_prime * 2;\r
+ else\r
+ new_hyphen_prime = atoi(optarg);\r
+\r
+ if (new_hyphen_prime == 0)\r
+ complainarg(c, optarg);\r
+\r
+ break;\r
+#endif\r
+ case 'g':\r
+ if (optarg == 0)\r
+ percent_grow = 62;\r
+ else\r
+ percent_grow = atoi(optarg);\r
+\r
+ if (percent_grow == 0)\r
+ complainarg(c, optarg);\r
+\r
+ break;\r
+\r
+ case 'U':\r
+ if (optarg == 0)\r
+ pseudo_tilde = 0;\r
+ else\r
+ pseudo_tilde = atoi(optarg);\r
+\r
+ if (pseudo_tilde > 255)\r
+ pseudo_tilde = 255;\r
+ else if (pseudo_tilde < 128)\r
+ pseudo_tilde = 128;\r
+\r
+ break;\r
+\r
+ case 'H':\r
+ if (optarg == 0)\r
+ tab_step = 8;\r
+ else\r
+ tab_step = atoi(optarg);\r
+ if (tab_step == 0)\r
+ complainarg(c, optarg);\r
+ break;\r
+\r
+ case 'x':\r
+ if (optarg == 0)\r
+ xchr_file = xstrdup("xchr.map");\r
+ else\r
+ xchr_file = xstrdup(optarg);\r
+\r
+ if (xchr_file == NULL || *xchr_file == '\0')\r
+ complainarg(c, optarg);\r
+ break;\r
+\r
+ case 'k':\r
+ if (optarg == 0)\r
+ repl_file = xstrdup("repl.key");\r
+ else\r
+ repl_file = xstrdup(optarg);\r
+\r
+ if (repl_file == NULL || *repl_file == '\0')\r
+ complainarg(c, optarg);\r
+ break;\r
+\r
+ case 'P':\r
+ if (optarg == 0)\r
+ default_rule = 26214;\r
+ else\r
+ default_rule = atoi(optarg);\r
+\r
+ if (default_rule == 0)\r
+ complainarg(c, optarg);\r
+ break;\r
+\r
+ case 'E':\r
+ if (optarg != 0)\r
+ putenv(optarg);\r
+ else\r
+ complainarg(c, optarg);\r
+ break;\r
+\r
+ case 'o':\r
+ if (optarg == 0)\r
+ dvi_directory = "";\r
+ else\r
+ dvi_directory = xstrdup(optarg);\r
+\r
+ if (strcmp(dvi_directory, "") == 0)\r
+ complainarg(c, optarg);\r
+\r
+ break;\r
+\r
+ case 'l':\r
+ if (optarg == 0)\r
+ log_directory = "";\r
+ else\r
+ log_directory = xstrdup(optarg);\r
+\r
+ if (strcmp(log_directory, "") == 0)\r
+ complainarg(c, optarg);\r
+\r
+ break;\r
+\r
+ case 'a':\r
+ if (optarg == 0)\r
+ aux_directory = "";\r
+ else\r
+ aux_directory = xstrdup(optarg);\r
+\r
+ if (strcmp(aux_directory, "") == 0)\r
+ complainarg(c, optarg);\r
+\r
+ break;\r
+\r
+ case '?':\r
+ default:\r
+ show_use = true;\r
+ return -1;\r
+ break;\r
+ }\r
+\r
+ return 0;\r
+}\r
+\r
+void strip_name (char *pathname)\r
+{\r
+ char *s;\r
+\r
+ if ((s = strrchr(pathname, '\\')) != NULL)\r
+ ;\r
+ else if ((s = strrchr(pathname, '/')) != NULL)\r
+ ;\r
+ else if ((s = strrchr(pathname, ':')) != NULL)\r
+ s++;\r
+ else\r
+ s = pathname;\r
+\r
+ *s = '\0';\r
+}\r
+\r
+int read_command_line (int ac, char **av)\r
+{ \r
+ int c;\r
+ char *optargnew;\r
+ int option_idx = 0;\r
+\r
+ if (ac < 2)\r
+ return 0;\r
+\r
+ while ((c = getopt_long_only(ac, av, short_options, long_options, &option_idx)) != EOF)\r
+ {\r
+ if (optarg != 0 && *optarg == '=')\r
+ optargnew = optarg + 1;\r
+ else\r
+ optargnew = optarg;\r
+\r
+ analyze_flag(c, optargnew);\r
+ }\r
+\r
+ if (show_use)\r
+ {\r
+ stamp_it(log_line);\r
+ strcat(log_line, "\n");\r
+ show_line(log_line, 0);\r
+ show_usage();\r
+ return -1; // failure\r
+ } \r
+\r
+ if (repl_file != NULL && *repl_file != '\0')\r
+ {\r
+ if (read_xchr_file(repl_file, 1, av))\r
+ {\r
+ if (trace_flag)\r
+ puts("KEY REPLACE ON");\r
+\r
+ key_replace = true;\r
+ }\r
+ } \r
+\r
+ if (xchr_file != NULL && *xchr_file != '\0')\r
+ {\r
+ if (read_xchr_file(xchr_file, 0, av))\r
+ {\r
+ if (trace_flag)\r
+ puts("NON ASCII ON");\r
+\r
+ non_ascii = true;\r
+ }\r
+ } \r
+\r
+ return 0;\r
+}\r
+\r
+int init_commands (int ac, char **av)\r
+{\r
+ is_initex = false; \r
+ allow_patterns = false;\r
+ reset_exceptions = false;\r
+ non_ascii = false;\r
+ key_replace = false;\r
+ open_trace_flag = false;\r
+ trace_flag = false;\r
+ verbose_flag = false;\r
+ restrict_to_ascii = false;\r
+ show_in_hex = false; /* default is not to show as hex code ^^ 00/Jun/18 */\r
+ return_flag = true; // hard wired now\r
+ trimeof = true; // hard wired now\r
+ deslash = true;\r
+ pseudo_tilde = 254; /* default '~' replace 95/Sep/26 filledbox DOS 850 */\r
+ pseudo_space = 255; /* default ' ' replace 97/June/5 nbspace DOS 850 */\r
+ default_rule = 26214;\r
+ show_current = true;\r
+ civilize_flag = true;\r
+ show_numeric = true;\r
+ show_missing = true;\r
+ c_style_flag = false;\r
+ show_fmt_flag = true;\r
+ show_tfm_flag = false; /* don't show metric file in log */\r
+ shorten_file_name = false; /* don't shorten file names to 8+3 */\r
+ truncate_long_lines = true; /* truncate long lines */\r
+ tab_step = 0; /* do not replace tabs with spaces */\r
+ show_line_break_stats = true; /* show line break statistics 96/Feb/8 */\r
+ show_fonts_used = true; /* show fonts used in LOG file 97/Dec/24 */\r
+ allow_quoted_names = true; /* allow quoted names with spaces 98/Mar/15 */\r
+ show_cs_names = false;\r
+ knuth_flag = false;\r
+ full_file_name_flag = true; /* new default 2000 June 18 */\r
+ errout = stdout; /* as opposed to stderr say --- used ??? */\r
+ new_hyphen_prime = 0;\r
+\r
+#ifdef VARIABLETRIESIZE\r
+ // trie_size = default_trie_size;\r
+ trie_size = 0;\r
+#endif\r
+\r
+ mem_extra_high = 0;\r
+ mem_extra_low = 0;\r
+ mem_initex = 0;\r
+ format_name = "plain";\r
+\r
+ if (read_command_line(ac, av) < 0)\r
+ return -1;\r
+\r
+ if (optind == 0)\r
+ optind = ac;\r
+\r
+ return 0;\r
+}\r
+\r
+void initial_memory (void)\r
+{\r
+ /* set initial memory allocations */\r
+ if (mem_extra_high < 0)\r
+ mem_extra_high = 0;\r
+\r
+ if (mem_extra_low < 0)\r
+ mem_extra_low = 0;\r
+\r
+ if (mem_initex < 0)\r
+ mem_initex = 0;\r
+\r
+ if (!is_initex)\r
+ {\r
+ if (mem_initex != 0)\r
+ {\r
+ puts("ERROR: Can only set initial main memory size in initex");\r
+ mem_initex = 0;\r
+ }\r
+\r
+ if (trie_size != 0)\r
+ {\r
+ puts("ERROR: Need only set hyphenation trie size in initex");\r
+/* trie_size = 0; */\r
+ }\r
+ }\r
+\r
+ if (mem_initex == 0)\r
+ mem_initex = default_mem_top;\r
+\r
+ if (trie_size == 0)\r
+ trie_size = default_trie_size;\r
+\r
+/* Just in case user mistakenly specified words instead of kilo words */\r
+ if (mem_extra_high > 10000L * 1024L)\r
+ mem_extra_high = mem_extra_high / 1024;\r
+\r
+ if (mem_extra_low > 10000L * 1024L)\r
+ mem_extra_low = mem_extra_low / 1024;\r
+\r
+ if (mem_initex > 10000L * 1024L)\r
+ mem_initex = mem_initex / 1024;\r
+\r
+ if (mem_initex > 2048L * 1024L) /* extend main memory by 16 mega byte! */\r
+ {\r
+ puts("WARNING: There may be no benefit to asking for so much memory");\r
+/* mem_initex = 2048 * 1024; */\r
+ }\r
+\r
+ if (new_hyphen_prime < 0)\r
+ new_hyphen_prime = 0;\r
+\r
+ if (new_hyphen_prime > 0)\r
+ {\r
+ if (! is_initex)\r
+ puts("ERROR: Can only set hyphen prime in initex");\r
+ else\r
+ {\r
+ if (new_hyphen_prime % 2 == 0)\r
+ new_hyphen_prime++;\r
+\r
+ while (!prime(new_hyphen_prime))\r
+ new_hyphen_prime = new_hyphen_prime + 2;\r
+\r
+ if (trace_flag)\r
+ printf("Using %d as hyphen prime\n", new_hyphen_prime);\r
+ }\r
+ }\r
+\r
+ if (percent_grow > 100)\r
+ percent_grow = percent_grow - 100;\r
+\r
+ if (percent_grow > 100)\r
+ percent_grow = 100; /* upper limit - double */\r
+\r
+ if (percent_grow < 10)\r
+ percent_grow = 10; /* lower limit - 10% */\r
+}\r
+\r
+void perrormod (const char * s)\r
+{\r
+ printf("`%s': %s\n", s, strerror(errno));\r
+}\r
+\r
+/* convert tilde to pseudo_tilde to hide it from TeX --- 95/Sep/26 */\r
+/* convert space to pseudo_space to hide it from TeX --- 97/Jun/5 */\r
+/* called only if pseudo_tilde != 0 or pseudo_space != 0 */\r
+/* this is then undone in tex3.c both for fopen input and output */\r
+/* not ideal, since pseudo name appears in log and in error messages ... */\r
+\r
+void hidetwiddle (char *tname)\r
+{\r
+ char *s = tname;\r
+\r
+#ifdef DEBUGTWIDDLE\r
+ if (trace_flag)\r
+ printf("Hidetwiddle %s", tname);\r
+#endif\r
+\r
+ while (*s != '\0')\r
+ {\r
+ if (*s == '~' && pseudo_tilde != 0)\r
+ *s = (char) pseudo_tilde; /* typically 254 */\r
+ else if (*s == ' ' && pseudo_space != 0)\r
+ *s = (char) pseudo_space; /* typically 255 */\r
+ s++;\r
+ }\r
+\r
+#ifdef DEBUGTWIDDLE\r
+ if (trace_flag)\r
+ printf("=> %s\n", tname);\r
+#endif\r
+}\r
+\r
+void deslash_all (int ac, char **av)\r
+{\r
+ char buffer[file_name_size]; \r
+ char *s;\r
+\r
+ if ((s = grabenv("TEXDVI")) != NULL)\r
+ dvi_directory = s;\r
+\r
+ if ((s = grabenv("TEXLOG")) != NULL)\r
+ log_directory = s;\r
+\r
+ if ((s = grabenv("TEXAUX")) != NULL)\r
+ aux_directory = s;\r
+\r
+ if ((s = grabenv("TEXFMT")) != NULL)\r
+ fmt_directory = s;\r
+\r
+ if ((s = grabenv("TEXPDF")) != NULL)\r
+ pdf_directory = s;\r
+\r
+ strcpy(buffer, av[0]);\r
+\r
+ if ((s = strrchr(buffer, '\\')) != NULL)\r
+ *(s + 1) = '\0';\r
+ else if ((s = strrchr(buffer, '/')) != NULL)\r
+ *(s + 1) = '\0';\r
+ else if ((s = strrchr(buffer, ':')) != NULL)\r
+ *(s + 1) = '\0';\r
+\r
+ s = buffer + strlen(buffer) - 1;\r
+\r
+ if (*s == '\\' || *s == '/')\r
+ *s = '\0';\r
+\r
+ if (strcmp(dvi_directory, "") != 0)\r
+ flush_trailing_slash(dvi_directory);\r
+\r
+ if (strcmp(log_directory, "") != 0)\r
+ flush_trailing_slash(log_directory);\r
+\r
+ if (strcmp(aux_directory, "") != 0)\r
+ flush_trailing_slash(aux_directory);\r
+\r
+ if (strcmp(fmt_directory, "") != 0)\r
+ flush_trailing_slash(fmt_directory);\r
+\r
+ if (strcmp(pdf_directory, "") != 0)\r
+ flush_trailing_slash(pdf_directory);\r
+\r
+ if (deslash)\r
+ {\r
+ if (strcmp(dvi_directory, "") != 0)\r
+ unixify(dvi_directory);\r
+ \r
+ if (strcmp(log_directory, "") != 0)\r
+ unixify(log_directory);\r
+\r
+ if (strcmp(aux_directory, "") != 0)\r
+ unixify(aux_directory);\r
+\r
+ if (strcmp(fmt_directory, "") != 0)\r
+ unixify(fmt_directory);\r
+\r
+ if (strcmp(pdf_directory, "") != 0)\r
+ unixify(pdf_directory);\r
+ }\r
+\r
+ format_spec = false;\r
+\r
+ if (optind < ac && optind > 0)\r
+ {\r
+ if (deslash)\r
+ {\r
+ if (trace_flag)\r
+ printf("deslash: k %d argv[k] %s (argc %d)\n", optind, av[optind], ac);\r
+\r
+ unixify(av[optind]);\r
+ }\r
+\r
+ if (pseudo_tilde != 0 || pseudo_space != 0)\r
+ hidetwiddle(av[optind]);\r
+\r
+ if (*av[optind] == '&' || *av[optind] == '+')\r
+ {\r
+ format_spec = true;\r
+ format_name = xstrdup(av[optind] + 1);\r
+\r
+ if (optind + 1 < ac)\r
+ {\r
+ if (deslash)\r
+ {\r
+ if (trace_flag)\r
+ printf("deslash: k %d argv[k] %s (argc %d)\n", optind + 1, av[optind + 1], ac);\r
+\r
+ unixify(av[optind + 1]);\r
+ }\r
+\r
+ if (pseudo_tilde != 0 || pseudo_space != 0)\r
+ hidetwiddle(av[optind + 1]);\r
+ }\r
+ } \r
+ }\r
+}\r
+\r
+int main_init (int ac, char ** av)\r
+{\r
+ kpse_set_program_name(av[0], "dvipdfmx");\r
+ xputenv("engine", "yandytex");\r
+\r
+ if (sizeof(memory_word) != sizeof(halfword) * 2)\r
+ printf("ERROR: Bad word size %ld!\n", sizeof(memory_word));\r
+\r
+ start_time = clock();\r
+ main_time = start_time;\r
+\r
+/* reset all allocatable memory pointers to NULL - in case we drop out */\r
+ main_memory = NULL;\r
+ font_info = NULL;\r
+ str_pool = NULL;\r
+ str_start = NULL;\r
+\r
+#ifdef ALLOCATESAVESTACK\r
+ save_stack = NULL; \r
+#endif\r
+\r
+#ifdef ALLOCATEBUFFER\r
+ buffer = NULL;\r
+ current_buf_size = 0;\r
+ buffer = realloc_buffer(initial_buf_size);\r
+#endif\r
+\r
+ hyph_list = NULL;\r
+ hyph_word = NULL;\r
+ trie_taken = NULL;\r
+ trie_hash = NULL;\r
+ trie_r = NULL;\r
+ trie_c = NULL;\r
+ trie_o = NULL;\r
+ trie_l = NULL;\r
+ trie_trc = NULL;\r
+ trie_tro = NULL;\r
+ trie_trl = NULL;\r
+\r
+ log_opened = false; /* so can tell whether opened */\r
+ interaction = -1; /* default state => 3 */\r
+ missing_characters = 0; /* none yet! */\r
+ ignore_frozen = false; /* default is not to ignore 98/Oct/5 */\r
+ suppress_f_ligs = false; /* default is not to ignore f-ligs */\r
+\r
+ if (ac > 1 && !strncmp(av[1], "-Y", 2))\r
+ reorder_arg_flag = false;\r
+\r
+ if (reorder_arg_flag)\r
+ reorderargs(ac, av); \r
+\r
+ if (init_commands(ac, av))\r
+ return -1;\r
+\r
+ check_fixed_align(trace_flag);\r
+\r
+ format_file = NULL;\r
+ source_direct = NULL;\r
+ dvi_file_name = NULL;\r
+ log_file_name = NULL;\r
+ pdf_file_name = NULL;\r
+\r
+ first_pass_count = 0;\r
+ second_pass_count = 0;\r
+ final_pass_count = 0;\r
+ paragraph_failed = 0;\r
+ single_line = 0;\r
+ overfull_hbox = 0;\r
+ underfull_hbox = 0;\r
+ overfull_vbox = 0;\r
+ underfull_vbox = 0;\r
+\r
+ if (trace_flag)\r
+ puts("Entering main_init() (local.c).");\r
+\r
+ probe_memory();\r
+ ini_max_address = max_address;\r
+\r
+ if (trace_flag)\r
+ show_maximums(stdout);\r
+\r
+ initial_memory();\r
+ deslash_all(ac, av);\r
+\r
+ if (format_spec && mem_spec_flag)\r
+ puts("WARNING: Cannot change initial main_memory size when format specified");\r
+\r
+ if (allocate_memory() != 0)\r
+ return -1;\r
+\r
+ check_alloc_align(trace_flag);\r
+\r
+ if (trace_flag)\r
+ puts("Leaving main_init() (local.c).");\r
+\r
+ return 0;\r
+}\r
+\r
+#ifdef __APPLE__\r
+#undef CLK_TCK\r
+#endif\r
+#define CLK_TCK CLOCKS_PER_SEC\r
+\r
+\r
+void show_inter_val (clock_t inter_val)\r
+{\r
+ int seconds, tenths, hundredth, thousands;\r
+\r
+ if (inter_val >= CLK_TCK * 10)\r
+ {\r
+ tenths = (inter_val * 10 + CLK_TCK / 2) / CLK_TCK; \r
+ seconds = tenths / 10; \r
+ tenths = tenths % 10;\r
+ printf("%d.%d", seconds, tenths);\r
+ }\r
+ else if (inter_val >= CLK_TCK)\r
+ {\r
+ hundredth = (inter_val * 100 + CLK_TCK / 2) / CLK_TCK;\r
+ seconds = hundredth / 100;\r
+ hundredth = hundredth % 100;\r
+ printf("%d.%02d", seconds, hundredth);\r
+ }\r
+ else if (inter_val > 0)\r
+ {\r
+ thousands = (inter_val * 1000 + CLK_TCK / 2) / CLK_TCK;\r
+ seconds = thousands / 1000;\r
+ thousands = thousands % 1000;\r
+ printf("%d.%03d", seconds, thousands);\r
+ }\r
+ else\r
+ show_line("0", 0);\r
+}\r
+\r
+int endit (int flag)\r
+{\r
+ finish_time = clock();\r
+\r
+ if (missing_characters != 0)\r
+ flag = 1;\r
+\r
+ if (missing_characters)\r
+ printf("! There %s %d missing character%s --- see log file\n",\r
+ (missing_characters == 1) ? "was" : "were", missing_characters,\r
+ (missing_characters == 1) ? "" : "s");\r
+\r
+ if (free_memory() != 0)\r
+ flag++;\r
+\r
+ if (verbose_flag)\r
+ {\r
+ printf("Total ");\r
+ show_inter_val(finish_time - start_time);\r
+ printf(" sec (");\r
+ show_inter_val(main_time - start_time);\r
+ printf(" format load + ");\r
+ show_inter_val(finish_time - main_time);\r
+ printf(" processing) ");\r
+\r
+ if (total_pages > 0)\r
+ {\r
+ show_inter_val((finish_time - main_time) / total_pages);\r
+ printf(" sec per page.\n");\r
+ }\r
+ }\r
+\r
+ return flag;\r
+}\r
+// printf control sequences' name\r
+void print_cs_name (FILE * output, int h)\r
+{\r
+ int c, textof, n;\r
+\r
+ memset(log_line, 0, sizeof(log_line));\r
+\r
+ textof = hash[h].rh;\r
+\r
+ if (textof == 0)\r
+ return;\r
+\r
+ c = sprintf(log_line, "(%d), ", h);\r
+ n = length(textof);\r
+\r
+ memmove(log_line + c, str_pool + str_start[textof], n);\r
+ memmove(log_line + c + n, "\n", 2);\r
+\r
+ if (output == stderr)\r
+ show_line(log_line, 1);\r
+ else if (output == stdout)\r
+ show_line(log_line, 0);\r
+ else\r
+ fprintf(output, "%s", log_line);\r
+}\r
+// prototype\r
+int compare_strn (int, int, int, int);\r
+/* compare two csnames in qsort */\r
+int compare_cs (const void *cp1, const void *cp2)\r
+{\r
+ int c1, c2, l1, l2, k1, k2, textof1, textof2;\r
+\r
+ c1 = *(int *)cp1;\r
+ c2 = *(int *)cp2;\r
+ textof1 = hash[c1].rh;\r
+ textof2 = hash[c2].rh;\r
+ l1 = length(textof1);\r
+ l2 = length(textof2);\r
+ k1 = str_start[textof1];\r
+ k2 = str_start[textof2];\r
+\r
+ return compare_strn(k1, l1, k2, l2);\r
+}\r
+\r
+char * csused = NULL;\r
+\r
+/* Allocate table of indeces to allow sorting on csname */\r
+/* Allocate flags to remember which ones already listed at start */\r
+/* pass = 0 --> fmt */\r
+/* pass = 1 --> after */\r
+void print_cs_names (FILE *output, int pass)\r
+{\r
+ int h, k, ccount, repeatflag;\r
+ int *cnumtable;\r
+ int nfcs = frozen_control_sequence;\r
+\r
+ if (pass == 0 && csused == NULL)\r
+ {\r
+ csused = (char *) malloc (nfcs);\r
+\r
+ if (csused == NULL)\r
+ return;\r
+\r
+#ifdef USEMEMSET\r
+ memset(csused, 0, nfcs);\r
+#else\r
+ for (h = 0; h < (hash_size + 780); h++)\r
+ csused[h] = 0;\r
+#endif\r
+ }\r
+\r
+ ccount = 0;\r
+\r
+ for (h = hash_base + 1; h < nfcs; h++)\r
+ {\r
+ if (pass == 1 && csused[h])\r
+ continue;\r
+\r
+ if (text(h) != 0)\r
+ {\r
+ if (pass == 0)\r
+ csused[h] = 1;\r
+\r
+ ccount++;\r
+ }\r
+ }\r
+\r
+ sprintf(log_line, "\n%d %s multiletter control sequences:\n",\r
+ ccount, (pass == 1) ? "new" : "");\r
+\r
+ if (output == stderr)\r
+ show_line(log_line, 1);\r
+ else if (output == stdout)\r
+ show_line(log_line, 0);\r
+ else\r
+ fprintf(output, "%s", log_line);\r
+\r
+ if (ccount > 0)\r
+ {\r
+ cnumtable = (int *) malloc (ccount * sizeof(int));\r
+\r
+ if (cnumtable == NULL)\r
+ return;\r
+\r
+ ccount = 0;\r
+\r
+ for (h = hash_base + 1; h < nfcs; h++)\r
+ {\r
+ if (pass == 1 && csused[h])\r
+ continue;\r
+\r
+ if (hash[h].rh != 0)\r
+ cnumtable[ccount++] = h;\r
+ }\r
+\r
+ //qsort ((void *)cnumtable, ccount, sizeof (int), &compare_cs);\r
+\r
+ repeatflag = 0;\r
+\r
+ for (k = 0; k < ccount; k++)\r
+ {\r
+ h = cnumtable[k];\r
+\r
+ if (pass == 1 && csused[h])\r
+ continue;\r
+\r
+ print_cs_name(output, h);\r
+ }\r
+\r
+ sprintf(log_line, "\n");\r
+\r
+ if (output == stderr)\r
+ show_line(log_line, 1);\r
+ else if (output == stdout)\r
+ show_line(log_line, 0);\r
+ else\r
+ fprintf(output, "%s", log_line);\r
+\r
+ free((void *)cnumtable);\r
+ }\r
+\r
+ if (pass == 1 && csused != NULL)\r
+ {\r
+ free(csused);\r
+ csused = NULL;\r
+ }\r
+}\r
+\r
+/* k1 and k2 are positions in string pool */\r
+/* l1 and l2 are lengths of strings */\r
+int compare_strn (int k1, int l1, int k2, int l2)\r
+{\r
+ int c1, c2;\r
+\r
+ while (l1 > 0 && l2 > 0)\r
+ {\r
+ c1 = str_pool[k1];\r
+ c2 = str_pool[k2];\r
+\r
+ if (c1 > c2)\r
+ return 1;\r
+ else if (c2 > c1)\r
+ return -1;\r
+\r
+ l1--; l2--;\r
+ k1++; k2++;\r
+ }\r
+\r
+ if (l1 > 0)\r
+ return 1; /* first string longer */\r
+ else if (l2 > 0)\r
+ return -1; /* second string longer */\r
+\r
+ return 0; /* strings match */\r
+}\r
+/* compare two font names and their at sizes in qsort */\r
+int compare_fnt (const void * fp1, const void * fp2)\r
+{\r
+ int f1, f2, l1, l2, k1, k2, s;\r
+\r
+ f1 = *(short *)fp1;\r
+ f2 = *(short *)fp2;\r
+ l1 = length(font_name[f1]);\r
+ l2 = length(font_name[f2]);\r
+ k1 = str_start[font_name[f1]]; \r
+ k2 = str_start[font_name[f2]]; \r
+\r
+ s = compare_strn (k1, l1, k2, l2);\r
+\r
+ if (s != 0)\r
+ return s;\r
+\r
+ if (font_size[f1] > font_size[f2])\r
+ return 1;\r
+ else if (font_size[f1] < font_size[f2])\r
+ return -1;\r
+\r
+ return 0; /* should not ever get here */\r
+}\r
+/* compare two font names */\r
+int compare_fnt_name (int f1, int f2)\r
+{\r
+ int l1, l2, k1, k2, s;\r
+\r
+ l1 = length(font_name[f1]);\r
+ l2 = length(font_name[f2]); \r
+ k1 = str_start[font_name[f1]]; \r
+ k2 = str_start[font_name[f2]]; \r
+\r
+ s = compare_strn (k1, l1, k2, l2);\r
+\r
+ return s;\r
+}\r
+/* decode checksum information */\r
+const unsigned long checkdefault = 0x59265920;\r
+int decode_fourty (unsigned long checksum, char *codingvector)\r
+{\r
+ int c;\r
+ int k;\r
+\r
+ if (checksum == 0)\r
+ {\r
+ strcpy(codingvector, "unknwn");\r
+ return 1;\r
+ }\r
+ else if ((checksum >> 8) == (checkdefault >> 8))\r
+ {\r
+ strcpy (codingvector, "fixed ");\r
+ return 1;\r
+ }\r
+ else\r
+ {\r
+ for (k = 0; k < 6; k++)\r
+ {\r
+ c = (int) (checksum % 40);\r
+ checksum = checksum / 40;\r
+ \r
+ if (c <= 'z' - 'a')\r
+ c = c + 'a';\r
+ else if (c < 36)\r
+ c = (c + '0') - ('z' - 'a') - 1;\r
+ else if (c == 36)\r
+ c = '-';\r
+ else if (c == 37)\r
+ c = '&';\r
+ else if (c == 38)\r
+ c = '_';\r
+ else\r
+ c = '.';\r
+ \r
+ codingvector[5-k] = (char) c;\r
+ }\r
+\r
+ codingvector[6] = '\0';\r
+ }\r
+\r
+ return 0;\r
+}\r
+\r
+double sclpnt (long x)\r
+{\r
+ double pt;\r
+\r
+ pt = (double) x / 65536.0;\r
+ pt = (double) ((int) (pt * 1000.0 + 0.5)) / 1000.0;\r
+\r
+ return (pt);\r
+}\r
+\r
+void dvi_font_show (internal_font_number f, int suppressname)\r
+{\r
+ int a, l, k, n;\r
+ unsigned long checksum;\r
+ char checksumvector[8];\r
+ char buffer[32];\r
+\r
+ putc(' ', log_file);\r
+\r
+ if (suppressname == 0)\r
+ {\r
+ a = length(font_area[f]);\r
+ l = length(font_name[f]);\r
+\r
+ k = str_start[font_area[f]];\r
+\r
+ memcpy(buffer, str_pool + k, length(font_area[f]));\r
+ fwrite(buffer, sizeof(char), length(font_area[f]), log_file);\r
+\r
+ k = str_start[font_name[f]];\r
+\r
+ memcpy(buffer, str_pool + k, length(font_name[f]));\r
+ fwrite(buffer, sizeof(char), length(font_name[f]), log_file);\r
+ }\r
+ else a = l = 0;\r
+\r
+ for (k = a + l; k < 16; k++)\r
+ putc(' ', log_file);\r
+\r
+ sprintf(buffer, "at %lgpt ", sclpnt(font_size[f]));\r
+ fputs(buffer, log_file);\r
+\r
+ if (suppressname == 0)\r
+ {\r
+ n = strlen(buffer);\r
+\r
+ for (k = n; k < 16; k++)\r
+ putc(' ', log_file);\r
+\r
+ checksum = (((font_check[f].b0) << 8 | font_check[f].b1) << 8 | font_check[f].b2) << 8 | font_check[f].b3;\r
+ decode_fourty(checksum, checksumvector);\r
+ log_printf("encoding: %s..", checksumvector);\r
+ }\r
+\r
+ putc('\n', log_file);\r
+}\r
+/* Allocate table of indeces to allow sorting on font name */\r
+void show_font_info (void)\r
+{\r
+ int k, m, fcount, repeatflag;\r
+ short *fnumtable;\r
+\r
+ fcount = 0;\r
+\r
+ for (k = 1; k <= font_ptr; k++)\r
+ if (font_used[k])\r
+ fcount++;\r
+\r
+ if (fcount == 0)\r
+ return;\r
+\r
+ fnumtable = (short *) malloc(fcount * sizeof(short));\r
+\r
+ log_printf("\nUsed %d font%s:\n", fcount, (fcount == 1) ? "" : "s");\r
+\r
+ fcount = 0;\r
+\r
+ for (k = 1; k <= font_ptr; k++) \r
+ if (font_used[k])\r
+ fnumtable[fcount++] = (short) k;\r
+\r
+ qsort ((void *)fnumtable, fcount, sizeof(short), &compare_fnt);\r
+\r
+ repeatflag = 0;\r
+\r
+ for (m = 0; m < fcount; m++)\r
+ {\r
+ if (m > 0)\r
+ {\r
+ if (compare_fnt_name(fnumtable[m - 1], fnumtable[m]) == 0)\r
+ repeatflag = 1;\r
+ else\r
+ repeatflag = 0;\r
+ }\r
+\r
+ dvi_font_show(fnumtable[m], repeatflag);\r
+ }\r
+\r
+ free((void *)fnumtable);\r
+}\r
OSDN Git Service
