-int perm_verb_flag; // Permanently verbose, interactive mode
-int list_flag; // "-l" Listing flag on command line
-int verb_flag; // Be verbose about what's going on
-int as68_flag; // as68 kludge mode
-int glob_flag; // Assume undefined symbols are global
-int lsym_flag; // Include local symbols in object file
-int sbra_flag; // Warn about possible short branches
-int obj_format; // Object format flag
-int debug; // [1..9] Enable debugging levels
-int err_flag; // '-e' specified
-int err_fd; // File to write error messages to
-int rgpu, rdsp; // Assembling Jaguar GPU or DSP code
-int list_fd; // File to write listing to
-int regbank; // RISC register bank
-int segpadsize; // Segment padding size
-int in_main; // In main memory flag for GPUMAIN
-int endian; // Processor endianess
-char *objfname; // Object filename pointer
-char *firstfname; // First source filename
-char *cmdlnexec; // Executable name, pointer to ARGV[0]
-char *searchpath; // Search path for include files
-char defname[] = "noname.o"; // Default output filename
-
-// Under Windows and UNIX malloc() is an expensive call, so for small amounts of memory we allocate
-// from a previously allocated buffer.
-
-#define A_AMOUNT 4096 // Amount to malloc() at a time
-#define A_THRESH 64 // Use malloc() for amounts >= A_THRESH
-
-static LONG a_amount; // Amount left at a_ptr
-static char *a_ptr; // Next free chunk
-LONG amemtot; // amem() total of requests
-
-// Qsort; The THRESHold below is the insertion sort threshold, and has been adjusted
-// for records of size 48 bytes.The MTHREShold is where we stop finding a better median.
-
-#define THRESH 4 // Threshold for insertion
-#define MTHRESH 6 // Threshold for median
-
-static int (*qcmp)(); // The comparison routine
-static int qsz; // Size of each record
-static int thresh; // THRESHold in chars
-static int mthresh; // MTHRESHold in chars
-
-// qst: Do a quicksort. First, find the median element, and put that one in the first place as
-// the discriminator. (This "median" is just the median of the first, last and middle elements).
-// (Using this median instead of the first element is a big win). Then, the usual
-// partitioning/swapping, followed by moving the discriminator into the right place. Then,
-// figure out the sizes of the two partions, do the smaller one recursively and the larger one
-// via a repeat of this code. Stopping when there are less than THRESH elements in a partition
-// and cleaning up with an insertion sort (in our caller) is a huge win. All data swaps are done
-// in-line, which is space-losing but time-saving. (And there are only three places where
-// this is done).
-
-static int qst(char *base, char *max) {
- char c, *i, *j, *jj;
- int ii;
- char *mid, *tmp;
- long lo, hi;
-
- /*
- * At the top here, lo is the number of characters of elements in the
- * current partition. (Which should be max - base).
- * Find the median of the first, last, and middle element and make
- * that the middle element. Set j to largest of first and middle.
- * If max is larger than that guy, then it's that guy, else compare
- * max with loser of first and take larger. Things are set up to
- * prefer the middle, then the first in case of ties.
- */
- lo = max - base; /* number of elements as chars */
- do {
- mid = i = base + qsz * ((lo / qsz) >> 1);
- if (lo >= mthresh) {
- j = (qcmp((jj = base), i) > 0 ? jj : i);
- if (qcmp(j, (tmp = max - qsz)) > 0) {
- /* switch to first loser */
- j = (j == jj ? i : jj);
- if (qcmp(j, tmp) < 0)
- j = tmp;
- }
- if (j != i) {
- ii = qsz;
- do {
- c = *i;
- *i++ = *j;
- *j++ = c;
- } while (--ii);
- }
- }
- /*
- * Semi-standard quicksort partitioning/swapping
- */
- for (i = base, j = max - qsz; ; ) {
- while (i < mid && qcmp(i, mid) <= 0)
- i += qsz;
- while (j > mid) {
- if (qcmp(mid, j) <= 0) {
- j -= qsz;
- continue;
- }
- tmp = i + qsz; /* value of i after swap */
- if (i == mid) {
- /* j <-> mid, new mid is j */
- mid = jj = j;
- } else {
- /* i <-> j */
- jj = j;
- j -= qsz;
- }
- goto swap;
- }
- if (i == mid) {
- break;
- } else {
- /* i <-> mid, new mid is i */
- jj = mid;
- tmp = mid = i; /* value of i after swap */
- j -= qsz;
- }
-swap:
- ii = qsz;
- do {
- c = *i;
- *i++ = *jj;
- *jj++ = c;
- } while (--ii);
- i = tmp;
- }
- /*
- * Look at sizes of the two partitions, do the smaller
- * one first by recursion, then do the larger one by
- * making sure lo is its size, base and max are update
- * correctly, and branching back. But only repeat
- * (recursively or by branching) if the partition is
- * of at least size THRESH.
- */
- i = (j = mid) + qsz;
- if ((lo = j - base) <= (hi = max - i)) {
- if (lo >= thresh)
- qst(base, j);
- base = i;
- lo = hi;
- } else {
- if (hi >= thresh)
- qst(i, max);
- max = j;
- }
- } while (lo >= thresh);
-
- return(0);
-}
-
-/*
- * qsort:
- * First, set up some global parameters for qst to share. Then, quicksort
- * with qst(), and then a cleanup insertion sort ourselves. Sound simple?
- * It's not...
- */
-
-int rmac_qsort(char *base, int n, int size, int (*compar)()) {
- register char c, *i, *j, *lo, *hi;
- char *min, *max;
-
- if (n <= 1)
- return(0);
- qsz = size;
- qcmp = compar;
- thresh = qsz * THRESH;
- mthresh = qsz * MTHRESH;
- max = base + n * qsz;
- if (n >= THRESH) {
- qst(base, max);
- hi = base + thresh;
- } else {
- hi = max;
- }
- /*
- * First put smallest element, which must be in the first THRESH, in
- * the first position as a sentinel. This is done just by searching
- * the first THRESH elements (or the first n if n < THRESH), finding
- * the min, and swapping it into the first position.
- */
- for (j = lo = base; (lo += qsz) < hi; )
- if (qcmp(j, lo) > 0)
- j = lo;
- if (j != base) {
- /* swap j into place */
- for (i = base, hi = base + qsz; i < hi; ) {
- c = *j;
- *j++ = *i;
- *i++ = c;
- }
- }
- /*
- * With our sentinel in place, we now run the following hyper-fast
- * insertion sort. For each remaining element, min, from [1] to [n-1],
- * set hi to the index of the element AFTER which this one goes.
- * Then, do the standard insertion sort shift on a character at a time
- * basis for each element in the frob.
- */
- for (min = base; (hi = min += qsz) < max; ) {
- while (qcmp(hi -= qsz, min) > 0)
- /* void */;
- if ((hi += qsz) != min) {
- for (lo = min + qsz; --lo >= min; ) {
- c = *lo;
- for (i = j = lo; (j -= qsz) >= hi; i = j)
- *i = *j;
- *i = c;
- }
- }
- }
- return(0);
-}
-
-//
-// --- Allocate memory; Panic and Quit if we Run Out -----------------------------------------------
-//
-
-char * amem(LONG amount)
-{
- char * p;
-
- if (amount & 1) // Keep word alignment
- ++amount;
-
- if (amount < A_THRESH)
- { // Honor *small* request
- if (a_amount < amount)
- {
- a_ptr = amem(A_AMOUNT);
- a_amount = A_AMOUNT;
- }
-
- p = a_ptr;
- a_ptr += amount;
- a_amount -= amount;
- }
- else
- {
- amemtot += amount; // Bump total alloc
- p = (char *)malloc(amount); // Get memory from malloc
-
- if ((LONG)p == (LONG)NULL)
- fatal("memory exhausted");
-
- memset(p, 0, amount);
- }
+int perm_verb_flag; // Permanently verbose, interactive mode
+int list_flag; // "-l" listing flag on command line
+int list_pag = 1; // Enable listing pagination by default
+int verb_flag; // Be verbose about what's going on
+int m6502; // 1, assembling 6502 code
+int as68_flag; // as68 kludge mode
+int glob_flag; // Assume undefined symbols are global
+int lsym_flag; // Include local symbols in object file
+int sbra_flag; // Warn about possible short branches
+int prg_flag; // !=0, produce .PRG executable (2=symbols)
+int legacy_flag; // Do stuff like insert code in RISC assembler
+int obj_format; // Object format flag
+int debug; // [1..9] Enable debugging levels
+int err_flag; // '-e' specified
+int err_fd; // File to write error messages to
+int rgpu, rdsp; // Assembling Jaguar GPU or DSP code
+int dsp56001; // Assembling DSP 56001 code
+int list_fd; // File to write listing to
+int regbank; // RISC register bank
+int segpadsize; // Segment padding size
+int endian; // Host processor endianess (0 = LE, 1 = BE)
+char * objfname; // Object filename pointer
+char * firstfname; // First source filename
+char * cmdlnexec; // Executable name, pointer to ARGV[0]
+char * searchpath; // Search path for include files
+char defname[] = "noname.o"; // Default output filename
+int optim_flags[OPT_COUNT]; // Specific optimisations on/off matrix
+int activecpu = CPU_68000; // Active 68k CPU (68000 by default)
+int activefpu = FPU_NONE; // Active FPU (none by default)