2 // RMAC - Reboot's Macro Assembler for the Atari Jaguar Console System
3 // RMAC.C - Main Application Code
4 // Copyright (C) 199x Landon Dyer, 2011 Reboot and Friends
5 // RMAC derived from MADMAC v1.07 Written by Landon Dyer, 1986
6 // Source Utilised with the Kind Permission of Landon Dyer
25 int perm_verb_flag; // Permanently verbose, interactive mode
26 int list_flag; // "-l" Listing flag on command line
27 int verb_flag; // Be verbose about what's going on
28 int as68_flag; // as68 kludge mode
29 int glob_flag; // Assume undefined symbols are global
30 int lsym_flag; // Include local symbols in object file
31 int sbra_flag; // Warn about possible short branches
32 int obj_format; // Object format flag
33 int debug; // [1..9] Enable debugging levels
34 int err_flag; // '-e' specified
35 int err_fd; // File to write error messages to
36 int rgpu, rdsp; // Assembling Jaguar GPU or DSP code
37 int list_fd; // File to write listing to
38 int regbank; // RISC register bank
39 int segpadsize; // Segment padding size
40 int endian; // Host processor endianess
41 char * objfname; // Object filename pointer
42 char * firstfname; // First source filename
43 char * cmdlnexec; // Executable name, pointer to ARGV[0]
44 char * searchpath; // Search path for include files
45 char defname[] = "noname.o"; // Default output filename
47 // Under Windows and UNIX malloc() is an expensive call, so for small amounts
48 // of memory we allocate from a previously allocated buffer.
50 #define A_AMOUNT 4096 // Amount to malloc() at a time
51 #define A_THRESH 64 // Use malloc() for amounts >= A_THRESH
53 static LONG a_amount; // Amount left at a_ptr
54 static char * a_ptr; // Next free chunk
55 LONG amemtot; // amem() total of requests
57 // Qsort; The THRESHold below is the insertion sort threshold, and has been adjusted
58 // for records of size 48 bytes.The MTHREShold is where we stop finding a better median.
60 #define THRESH 4 // Threshold for insertion
61 #define MTHRESH 6 // Threshold for median
63 static int (*qcmp)(); // The comparison routine
64 static int qsz; // Size of each record
65 static int thresh; // THRESHold in chars
66 static int mthresh; // MTHRESHold in chars
68 // This is unused BOLLOCKS
71 // qst: Do a quicksort. First, find the median element, and put that one in the
72 // first place as the discriminator. (This "median" is just the median of the
73 // first, last and middle elements). (Using this median instead of the first
74 // element is a big win). Then, the usual partitioning/swapping, followed by
75 // moving the discriminator into the right place. Then, figure out the sizes of
76 // the two partions, do the smaller one recursively and the larger one via a
77 // repeat of this code. Stopping when there are less than THRESH elements in a
78 // partition and cleaning up with an insertion sort (in our caller) is a huge
79 // win. All data swaps are done in-line, which is space-losing but time-saving.
80 // (And there are only three places where this is done).
82 static int qst(char * base, char * max)
84 char c, * i, * j, * jj;
90 * At the top here, lo is the number of characters of elements in the
91 * current partition. (Which should be max - base).
92 * Find the median of the first, last, and middle element and make
93 * that the middle element. Set j to largest of first and middle.
94 * If max is larger than that guy, then it's that guy, else compare
95 * max with loser of first and take larger. Things are set up to
96 * prefer the middle, then the first in case of ties.
98 lo = max - base; /* number of elements as chars */
102 mid = i = base + qsz * ((lo / qsz) >> 1);
106 j = (qcmp((jj = base), i) > 0 ? jj : i);
108 if (qcmp(j, (tmp = max - qsz)) > 0)
110 /* switch to first loser */
111 j = (j == jj ? i : jj);
113 if (qcmp(j, tmp) < 0)
132 * Semi-standard quicksort partitioning/swapping
134 for(i=base, j=max-qsz; ;)
136 while (i < mid && qcmp(i, mid) <= 0)
141 if (qcmp(mid, j) <= 0)
147 tmp = i + qsz; /* value of i after swap */
151 /* j <-> mid, new mid is j */
170 /* i <-> mid, new mid is i */
172 tmp = mid = i; /* value of i after swap */
190 * Look at sizes of the two partitions, do the smaller
191 * one first by recursion, then do the larger one by
192 * making sure lo is its size, base and max are update
193 * correctly, and branching back. But only repeat
194 * (recursively or by branching) if the partition is
195 * of at least size THRESH.
199 if ((lo = j - base) <= (hi = max - i))
215 while (lo >= thresh);
223 * First, set up some global parameters for qst to share. Then, quicksort
224 * with qst(), and then a cleanup insertion sort ourselves. Sound simple?
227 int rmac_qsort(char * base, int n, int size, int (*compar)())
229 register char c, * i, * j, * lo, * hi;
237 thresh = qsz * THRESH;
238 mthresh = qsz * MTHRESH;
239 max = base + n * qsz;
252 * First put smallest element, which must be in the first THRESH, in
253 * the first position as a sentinel. This is done just by searching
254 * the first THRESH elements (or the first n if n < THRESH), finding
255 * the min, and swapping it into the first position.
257 for(j=lo=base; (lo+=qsz)<hi;)
265 /* swap j into place */
266 for(i=base, hi=base+qsz; i<hi;)
275 * With our sentinel in place, we now run the following hyper-fast
276 * insertion sort. For each remaining element, min, from [1] to [n-1],
277 * set hi to the index of the element AFTER which this one goes.
278 * Then, do the standard insertion sort shift on a character at a time
279 * basis for each element in the frob.
281 for(min=base; (hi=min+=qsz)<max;)
283 while (qcmp(hi -= qsz, min) > 0)
286 if ((hi += qsz) != min)
288 for(lo=min+qsz; --lo>=min;)
292 for(i=j=lo; (j-=qsz)>=hi; i=j)
306 // Allocate memory; Panic and Quit if we Run Out
308 char * amem(LONG amount)
312 // if (amount & 1) // Keep word alignment
314 amount = (amount + 1) & ~(0x01); // Keep word alignment
316 // Honor *small* request (< 64 bytes)
317 if (amount < A_THRESH)
319 if (a_amount < amount)
321 a_ptr = amem(A_AMOUNT); // Allocate 4K bytes
331 amemtot += amount; // Bump total alloc
332 p = (char *)malloc(amount); // Get memory from malloc
335 fatal("Memory exhausted!");
337 memset(p, 0, amount);
346 // Copy stuff around, return pointer to dest+count+1 (doesn't handle overlap)
348 char * copy(char * dest, char * src, LONG count)
358 // Clear a region of memory
360 void clear(char * dest, LONG count)
368 // Check to see if the string is a keyword. Returns -1, or a value from the
371 int kmatch(char * p, int * base, int * check, int * tab, int * accept)
376 for(state=0; state>=0;)
378 j = base[state] + (int)tolowertab[*p];
380 if (check[j] != state)
381 { // Reject, character doesn't match
382 state = -1; // No match
387 { // Must accept or reject at EOS
388 state = accept[j]; // (-1 on no terminal match)
400 // Auto-even a section
402 void autoeven(int sect)
411 // Manipulate file extension.
412 // `name' must be large enough to hold any possible filename.
413 // If `stripp' is nonzero, any old extension is removed.
414 // Then, if the file does not already have an extension,
415 // `extension' is appended to the filename.
417 char * fext(char * name, char * extension, int stripp)
419 char * s, * beg; // String pointers
421 // Find beginning of "real" name
422 beg = name + strlen(name) - 1;
424 for(; beg>name; --beg)
426 if (*beg == SLASHCHAR)
434 { // Clobber any old extension
435 for(s=beg; *s && *s!='.'; ++s)
441 for(s=beg; *s!='.'; ++s)
444 { // Append the new extension
445 strcat(beg, extension);
455 // Return `item'nth element of semicolon-seperated pathnames specified in the
456 // enviroment string `s'. Copy the pathname to `buf'. Return 0 if the `item'
457 // nth path doesn't exist.
459 // [`item' ranges from 0 to N-1, where N = #elements in search path]
461 int nthpath(char * env_var, int itemno, char * buf)
463 char * s = searchpath;
472 while (*s != EOS && *s++ != ';')
478 while (*s != EOS && *s != ';')
488 // Display Command Line Help
490 void display_help(void)
493 printf(" %s [options] srcfile\n", cmdlnexec);
495 printf("Options:\n");
496 printf(" -? or -h display usage information\n");
497 printf(" -dsymbol[=value] define symbol\n");
498 printf(" -e[errorfile] send error messages to file, not stdout\n");
499 printf(" -f[format] output object file format\n");
500 printf(" b: BSD (use this for Jaguar)\n");
501 printf(" -i[path] directory to search for include files\n");
502 printf(" -l[filename] create an output listing file\n");
503 printf(" -o file output file name\n");
504 printf(" -r[size] pad segments to boundary size specified\n");
505 printf(" w: word (2 bytes, default alignment)\n");
506 printf(" l: long (4 bytes)\n");
507 printf(" p: phrase (8 bytes)\n");
508 printf(" d: double phrase (16 bytes)\n");
509 printf(" q: quad phrase (32 bytes)\n");
510 printf(" -s warn about possible short branches\n");
511 printf(" -u force referenced and undefined symbols global\n");
512 printf(" -v set verbose mode\n");
513 printf(" -y[pagelen] set page line length (default: 61)\n");
519 // Display Version Information
521 void display_version(void)
523 printf("\nReboot's Macro Assembler for Atari Jaguar\n");
524 printf("Copyright (C) 199x Landon Dyer, 2011 Reboot\n");
525 printf("V%01i.%01i.%01i %s (%s)\n\n", MAJOR, MINOR, PATCH, __DATE__, PLATFORM);
530 // Process Command Line Arguments and do an Assembly
532 int process(int argc, char ** argv)
534 int argno; // Argument number
535 SYM * sy; // Pointer to a symbol record
536 char * s; // String pointer
537 int fd; // File descriptor
538 char fnbuf[FNSIZ]; // Filename buffer
541 errcnt = 0; // Initialise error count
542 listing = 0; // Initialise listing level
543 list_flag = 0; // Initialise listing flag
544 verb_flag = perm_verb_flag; // Initialise verbose flag
545 as68_flag = 0; // Initialise as68 kludge mode
546 glob_flag = 0; // Initialise .globl flag
547 sbra_flag = 0; // Initialise short branch flag
548 debug = 0; // Initialise debug flag
549 searchpath = NULL; // Initialise search path
550 objfname = NULL; // Initialise object filename
551 list_fname = NULL; // Initialise listing filename
552 err_fname = NULL; // Initialise error filename
553 obj_format = BSD; // Initialise object format
554 firstfname = NULL; // Initialise first filename
555 err_fd = ERROUT; // Initialise error file descriptor
556 err_flag = 0; // Initialise error flag
557 rgpu = 0; // Initialise GPU assembly flag
558 rdsp = 0; // Initialise DSP assembly flag
559 lsym_flag = 1; // Include local symbols in object file
560 regbank = BANK_N; // No RISC register bank specified
561 orgactive = 0; // Not in RISC org section
562 orgwarning = 0; // No ORG warning issued
564 segpadsize = 2; // Initialise segment padding size
566 // Initialise modules
567 InitSymbolTable(); // Symbol table
568 init_token(); // Tokenizer
569 init_procln(); // Line processor
570 init_expr(); // Expression analyzer
571 init_sect(); // Section manager / code generator
572 init_mark(); // Mark tape-recorder
573 InitMacro(); // Macro processor
574 init_list(); // Listing generator
576 // Process command line arguments and assemble source files
577 for(argno=0; argno<argc; ++argno)
579 if (*argv[argno] == '-')
581 switch (argv[argno][1])
583 case 'd': // Define symbol
585 for(s=argv[argno]+2; *s!=EOS;)
594 if (argv[argno][2] == EOS)
596 printf("-d: empty symbol\n");
601 sy = lookup(argv[argno] + 2, 0, 0);
605 sy = NewSymbol(argv[argno] + 2, LABEL, 0);
609 sy->sattr = DEFINED | EQUATED | ABS;
612 sy->svalue = (VALUE)atoi(s);
617 case 'e': // Redirect error message output
619 err_fname = argv[argno] + 2;
621 case 'f': // -f<format>
623 switch (argv[argno][2])
626 case 'b': // -fb = BSD (Jaguar Recommended)
631 printf("-f: unknown object format specified\n");
636 case 'g': // Debugging flag
638 printf("Debugging flag (-g) not yet implemented\n");
640 case 'i': // Set directory search path
642 searchpath = argv[argno] + 2;
644 case 'l': // Produce listing file
646 list_fname = argv[argno] + 2;
651 case 'o': // Direct object file output
653 if (argv[argno][2] != EOS)
654 objfname = argv[argno] + 2;
659 printf("Missing argument to -o");
663 objfname = argv[argno];
667 case 'r': // Pad seg to requested boundary size
669 switch(argv[argno][2])
671 case 'w': case 'W': segpadsize = 2; break;
672 case 'l': case 'L': segpadsize = 4; break;
673 case 'p': case 'P': segpadsize = 8; break;
674 case 'd': case 'D': segpadsize = 16; break;
675 case 'q': case 'Q': segpadsize = 32; break;
676 default: segpadsize = 2; break; // Effective autoeven();
679 case 's': // Warn about possible short branches
683 case 'u': // Make undefined symbols .globl
687 case 'v': // Verbose flag
695 case 'x': // Turn on debugging
698 printf("~ Debugging ON\n");
700 case 'y': // -y<pagelen>
702 pagelen = atoi(argv[argno] + 2);
706 printf("-y: bad page length\n");
712 case EOS: // Input is stdin
713 if (firstfname == NULL) // Kludge first filename
714 firstfname = defname;
716 include(0, "(stdin)");
719 case 'h': // Display command line usage
728 printf("Unknown switch: %s\n\n", argv[argno]);
736 // Record first filename.
737 if (firstfname == NULL)
738 firstfname = argv[argno];
740 strcpy(fnbuf, argv[argno]);
741 fext(fnbuf, ".s", 0);
746 printf("Cannot open: %s\n", fnbuf);
756 // Wind-up processing;
757 // o save current section (no more code generation)
758 // o do auto-even of all sections (or boundary alignment as requested through '-r')
759 // o determine name of object file:
760 // - "foo.o" for linkable output;
761 // - "foo.prg" for GEMDOS executable (-p flag).
764 for(i=TEXT; i<=BSS; i<<=1)
770 case 2: d_even(); break;
771 case 4: d_long(); break;
772 case 8: d_phrase(); break;
773 case 16: d_dphrase(); break;
774 case 32: d_qphrase(); break;
780 if (objfname == NULL)
782 if (firstfname == NULL)
783 firstfname = defname;
785 strcpy(fnbuf, firstfname);
786 //fext(fnbuf, prg_flag ? ".prg" : ".o", 1);
787 fext(fnbuf, ".o", 1);
791 // With one pass finished, go back and:
792 // (1) run through all the fixups and resolve forward references;
793 // (1.5) ensure that remaining fixups can be handled by the linker
794 // (`lo68' format, extended (postfix) format....)
795 // (2) generate the output file image and symbol table;
796 // (3) generate relocation information from left-over fixups.
797 ResolveAllFixups(); // Do all fixups
798 stopmark(); // Stop mark tape-recorder
802 if ((fd = open(objfname, _OPEN_FLAGS, _PERM_MODE)) < 0)
808 printf("[Writing %s file: %s]\n", s, objfname);
821 printf("[Wrapping-up listing file]\n");
831 DEBUG dump_everything();
838 // Determine Processor Endianess
840 int get_endianess(void)
843 char * p = (char *)&i;
853 // Application Entry Point; Handle the Command Line
855 int main(int argc, char ** argv)
857 perm_verb_flag = 0; // Clobber "permanent" verbose flag
858 cmdlnexec = argv[0]; // Obtain executable name
860 endian = get_endianess(); // Get processor endianess
862 // If commands were passed in, process them
865 return process(argc - 1, argv + 1);