1 diff -Nur binutils-2.13.90.0.18.orig/gas/Makefile.am binutils-2.13.90.0.18/gas/Makefile.am
2 --- binutils-2.13.90.0.18.orig/gas/Makefile.am Sun Feb 2 03:21:17 2003
3 +++ binutils-2.13.90.0.18/gas/Makefile.am Sun Feb 2 12:25:10 2003
8 -CFILES = $(GAS_CFILES) itbl-ops.c
9 +CFILES = $(GAS_CFILES) gasp.c itbl-ops.c
15 # Note: GASP is now deprecated and has been removed. It is still
16 # available in the CVS archive or older binutils releases if it is needed.
17 -noinst_PROGRAMS = as-new
18 +# ...and it is needed for few packages in distribution.
19 +noinst_PROGRAMS = as-new gasp-new
20 noinst_SCRIPTS = $(GDBINIT)
21 EXTRA_SCRIPTS = .gdbinit
24 as.h asintl.h bignum.h bit_fix.h config.h emul.h expr.h flonum.h \
25 frags.h hash.h listing.h obj.h read.h symbols.h tc.h write.h
27 +gasp_new_SOURCES = gasp.c macro.c sb.c hash.c
28 +gasp_new_LDADD = ../libiberty/libiberty.a $(INTLLIBS)
29 +gasp_new_DEPENDENCIES = ../libiberty/libiberty.a $(INTLDEPS)
31 EXPECT = `if [ -f $${rootme}/../expect/expect ] ; then \
32 echo $${rootme}/../expect/expect ; \
33 else echo expect ; fi`
35 $(INCDIR)/obstack.h subsegs.h struc-symbol.h
36 write.o: write.c $(INCDIR)/symcat.h subsegs.h $(INCDIR)/obstack.h \
37 output-file.h dwarf2dbg.h
38 +gasp.o: gasp.c $(INCDIR)/getopt.h $(INCDIR)/safe-ctype.h \
39 + sb.h macro.h $(INCDIR)/xregex.h $(INCDIR)/xregex2.h
40 itbl-ops.o: itbl-ops.c itbl-ops.h $(INCDIR)/symcat.h
41 e-crisaout.o: $(srcdir)/config/e-crisaout.c $(INCDIR)/symcat.h \
43 diff -Nur binutils-2.13.90.0.18.orig/gas/doc/Makefile.am binutils-2.13.90.0.18/gas/doc/Makefile.am
44 --- binutils-2.13.90.0.18.orig/gas/doc/Makefile.am Sun Feb 2 03:21:17 2003
45 +++ binutils-2.13.90.0.18/gas/doc/Makefile.am Sun Feb 2 12:35:43 2003
50 -info_TEXINFOS = as.texinfo
51 +info_TEXINFOS = as.texinfo gasp.texinfo
53 asconfig.texi: $(CONFIG).texi
55 diff -Nur binutils-2.14.90.0.7.orig/gas/doc/gasp.texinfo binutils-2.14.90.0.7/gas/doc/gasp.texinfo
56 --- binutils-2.14.90.0.7.orig/gas/doc/gasp.texinfo Thu Jan 1 01:00:00 1970
57 +++ binutils-2.14.90.0.7/gas/doc/gasp.texinfo Wed Oct 30 05:09:13 2002
59 +\input texinfo @c -*- Texinfo -*-
60 +@setfilename gasp.info
62 +@c This file documents the assembly preprocessor "GASP"
64 +@c Copyright 1994, 1995, 2000, 2002 Free Software Foundation, Inc.
66 +@c Permission is granted to copy, distribute and/or modify this document
67 +@c under the terms of the GNU Free Documentation License, Version 1.1
68 +@c or any later version published by the Free Software Foundation;
69 +@c with no Invariant Sections, with no Front-Cover Texts, and with no
70 +@c Back-Cover Texts. A copy of the license is included in the
71 +@c section entitled "GNU Free Documentation License".
76 +* gasp: (gasp). The GNU Assembler Preprocessor
85 +@setchapternewpage odd
88 +@c FIXME boring title
89 +@title GASP, an assembly preprocessor
90 +@subtitle for GASP version 1
97 +{\parskip=0pt \hfill Cygnus Support\par
101 +@vskip 0pt plus 1filll
102 +Copyright @copyright{} 1994, 1995, 2000, 2002 Free Software Foundation, Inc.
104 + Permission is granted to copy, distribute and/or modify this document
105 + under the terms of the GNU Free Documentation License, Version 1.1
106 + or any later version published by the Free Software Foundation;
107 + with no Invariant Sections, with no Front-Cover Texts, and with no
108 + Back-Cover Texts. A copy of the license is included in the
109 + section entitled "GNU Free Documentation License".
114 +Copyright @copyright{} 1994, 1995, 2000, 2002 Free Software Foundation, Inc.
117 +Permission is granted to process this file through TeX and print the
118 +results, provided the printed document carries a copying permission
119 +notice identical to this one except for the removal of this paragraph
120 +(this paragraph not being relevant to the printed manual).
123 + Permission is granted to copy, distribute and/or modify this document
124 + under the terms of the GNU Free Documentation License, Version 1.1
125 + or any later version published by the Free Software Foundation;
126 + with no Invariant Sections, with no Front-Cover Texts, and with no
127 + Back-Cover Texts. A copy of the license is included in the
128 + section entitled "GNU Free Documentation License".
134 +GASP is a preprocessor for assembly programs.
136 +This file describes version 1 of GASP.
138 +Steve Chamberlain wrote GASP; Roland Pesch wrote this manual.
141 +* Overview:: What is GASP?
142 +* Invoking GASP:: Command line options.
143 +* Commands:: Preprocessor commands.
144 +* GNU Free Documentation License:: GNU Free Documentation License
150 +@chapter What is GASP?
152 +The primary purpose of the @sc{gnu} assembler is to assemble the output of
153 +other programs---notably compilers. When you have to hand-code
154 +specialized routines in assembly, that means the @sc{gnu} assembler is
155 +an unfriendly processor: it has no directives for macros, conditionals,
156 +or many other conveniences that you might expect.
158 +In some cases you can simply use the C preprocessor, or a generalized
159 +preprocessor like @sc{m4}; but this can be awkward, since none of these
160 +things are designed with assembly in mind.
162 +@sc{gasp} fills this need. It is expressly designed to provide the
163 +facilities you need with hand-coded assembly code. Implementing it as a
164 +preprocessor, rather than part of the assembler, allows the maximum
165 +flexibility: you can use it with hand-coded assembly, without paying a
166 +penalty of added complexity in the assembler you use for compiler
169 +@emph{Note} The use of @sc{gasp} has now been deprecated. Anything
170 +that it could do can now be done by the macro facilities built into
171 +@sc{gas} itself. At some point in the future the @sc{gasp} sources will
172 +be removed entirely from the binutils distribution.
174 +Here is a small example to give the flavor of @sc{gasp}. This input to
179 + .MACRO saveregs from=8 to=14
180 +count .ASSIGNA \from
181 + ! save r\from..r\to
182 + .AWHILE \&count LE \to
184 +count .ASSIGNA \&count + 1
190 +bar: mov #H'dead+10,r0
191 +foo .SDATAC "hello"<10>
197 +generates this assembly program:
206 +bar: mov #57005+10,r0
207 +foo: .byte 6,104,101,108,108,111,10
212 +@chapter Command Line Options
214 +@c FIXME! Or is there a simpler way, calling from GAS option?
215 +The simplest way to use @sc{gasp} is to run it as a filter and assemble
216 +its output. In Unix and its ilk, you can do this, for example:
218 +@c FIXME! GASP filename suffix convention?
220 +$ gasp prog.asm | as -o prog.o
223 +Naturally, there are also a few command-line options to allow you to
224 +request variations on this basic theme. Here is the full set of
225 +possibilities for the @sc{gasp} command line.
228 +gasp [ -a | --alternate ]
229 + [ -c @var{char} | --commentchar @var{char} ]
230 + [ -d | --debug ] [ -h | --help ] [ -M | --mri ]
231 + [ -o @var{outfile} | --output @var{outfile} ]
232 + [ -p | --print ] [ -s | --copysource ]
233 + [ -u | --unreasonable ] [ -v | --version ]
234 + @var{infile} @dots{}
238 +@item @var{infile} @dots{}
239 +@c FIXME! Why not stdin as default infile?
240 +The input file names. You must specify at least one input file; if you
241 +specify more, @sc{gasp} preprocesses them all, concatenating the output
242 +in the order you list the @var{infile} arguments.
244 +Mark the end of each input file with the preprocessor command
245 +@code{.END}. @xref{Other Commands,, Miscellaneous commands}.
249 +Use alternative macro syntax. @xref{Alternate,, Alternate macro
250 +syntax}, for a discussion of how this syntax differs from the default
253 +@cindex comment character, changing
254 +@cindex semicolon, as comment
255 +@cindex exclamation mark, as comment
256 +@cindex shriek, as comment
257 +@cindex bang, as comment
258 +@cindex @code{!} default comment char
259 +@cindex @code{;} as comment char
260 +@item -c '@var{char}'
261 +@itemx --commentchar '@var{char}'
262 +Use @var{char} as the comment character. The default comment character
263 +is @samp{!}. For example, to use a semicolon as the comment character,
264 +specify @w{@samp{-c ';'}} on the @sc{gasp} command line. Since
265 +assembler command characters often have special significance to command
266 +shells, it is a good idea to quote or escape @var{char} when you specify
267 +a comment character.
269 +For the sake of simplicity, all examples in this manual use the default
270 +comment character @samp{!}.
274 +Show debugging statistics. In this version of @sc{gasp}, this option
275 +produces statistics about the string buffers that @sc{gasp} allocates
276 +internally. For each defined buffersize @var{s}, @sc{gasp} shows the
277 +number of strings @var{n} that it allocated, with a line like this:
280 +strings size @var{s} : @var{n}
284 +@sc{gasp} displays these statistics on the standard error stream, when
289 +Display a summary of the @sc{gasp} command line options.
293 +Use MRI compatibility mode. Using this option causes @sc{gasp} to
294 +accept the syntax and pseudo-ops used by the Microtec Research
295 +@code{ASM68K} assembler.
297 +@item -o @var{outfile}
298 +@itemx --output @var{outfile}
299 +Write the output in a file called @var{outfile}. If you do not use the
300 +@samp{-o} option, @sc{gasp} writes its output on the standard output
305 +Print line numbers. @sc{gasp} obeys this option @emph{only} if you also
306 +specify @samp{-s} to copy source lines to its output. With @samp{-s
307 +-p}, @sc{gasp} displays the line number of each source line copied
308 +(immediately after the comment character at the beginning of the line).
312 +Copy the source lines to the output file. Use this option
313 +to see the effect of each preprocessor line on the @sc{gasp} output.
314 +@sc{gasp} places a comment character (@samp{!} by default) at
315 +the beginning of each source line it copies, so that you can use this
316 +option and still assemble the result.
319 +@itemx --unreasonable
320 +Bypass ``unreasonable expansion'' limit. Since you can define @sc{gasp}
321 +macros inside other macro definitions, the preprocessor normally
322 +includes a sanity check. If your program requires more than 1,000
323 +nested expansions, @sc{gasp} normally exits with an error message. Use
324 +this option to turn off this check, allowing unlimited nested
329 +Display the @sc{gasp} version number.
333 +@chapter Preprocessor Commands
335 +@sc{gasp} commands have a straightforward syntax that fits in well with
336 +assembly conventions. In general, a command extends for a line, and may
337 +have up to three fields: an optional label, the command itself, and
338 +optional arguments to the command. You can write commands in upper or
339 +lower case, though this manual shows them in upper case. @xref{Syntax
340 +Details,, Details of the GASP syntax}, for more information.
355 +@section Conditional assembly
357 +The conditional-assembly directives allow you to include or exclude
358 +portions of an assembly depending on how a pair of expressions, or a
359 +pair of strings, compare.
361 +The overall structure of conditionals is familiar from many other
362 +contexts. @code{.AIF} marks the start of a conditional, and precedes
363 +assembly for the case when the condition is true. An optional
364 +@code{.AELSE} precedes assembly for the converse case, and an
365 +@code{.AENDI} marks the end of the condition.
367 +@c FIXME! Why doesn't -u turn off this check?
368 +You may nest conditionals up to a depth of 100; @sc{gasp} rejects
369 +nesting beyond that, because it may indicate a bug in your macro
372 +@c FIXME! Why isn't there something like cpp's -D option? Conditionals
373 +@c would be much more useful if there were.
374 +Conditionals are primarily useful inside macro definitions, where you
375 +often need different effects depending on argument values.
376 +@xref{Macros,, Defining your own directives}, for details about defining
380 +@item .AIF @var{expra} @var{cmp} @var{exprb}
381 +@itemx .AIF "@var{stra}" @var{cmp} "@var{strb}"
383 +The governing condition goes on the same line as the @code{.AIF}
384 +preprocessor command. You may compare either two strings, or two
387 +When you compare strings, only two conditional @var{cmp} comparison
388 +operators are available: @samp{EQ} (true if @var{stra} and @var{strb}
389 +are identical), and @samp{NE} (the opposite).
391 +When you compare two expressions, @emph{both expressions must be
392 +absolute} (@pxref{Expressions,, Arithmetic expressions in GASP}). You
393 +can use these @var{cmp} comparison operators with expressions:
397 +Are @var{expra} and @var{exprb} equal? (For strings, are @var{stra} and
398 +@var{strb} identical?)
401 +Are @var{expra} and @var{exprb} different? (For strings, are @var{stra}
402 +and @var{strb} different?
405 +Is @var{expra} less than @var{exprb}? (Not allowed for strings.)
408 +Is @var{expra} less than or equal to @var{exprb}? (Not allowed for strings.)
411 +Is @var{expra} greater than @var{exprb}? (Not allowed for strings.)
414 +Is @var{expra} greater than or equal to @var{exprb}? (Not allowed for
419 +Marks the start of assembly code to be included if the condition fails.
420 +Optional, and only allowed within a conditional (between @code{.AIF} and
424 +Marks the end of a conditional assembly.
428 +@section Repetitive sections of assembly
430 +Two preprocessor directives allow you to repeatedly issue copies of the
431 +same block of assembly code.
434 +@item .AREPEAT @var{aexp}
436 +If you simply need to repeat the same block of assembly over and over a
437 +fixed number of times, sandwich one instance of the repeated block
438 +between @code{.AREPEAT} and @code{.AENDR}. Specify the number of
439 +copies as @var{aexp} (which must be an absolute expression). For
440 +example, this repeats two assembly statements three times in succession:
451 +@item .AWHILE @var{expra} @var{cmp} @var{exprb}
453 +@itemx .AWHILE @var{stra} @var{cmp} @var{strb}
455 +To repeat a block of assembly depending on a conditional test, rather
456 +than repeating it for a specific number of times, use @code{.AWHILE}.
457 +@code{.AENDW} marks the end of the repeated block. The conditional
458 +comparison works exactly the same way as for @code{.AIF}, with the same
459 +comparison operators (@pxref{Conditionals,, Conditional assembly}).
461 +Since the terms of the comparison must be absolute expression,
462 +@code{.AWHILE} is primarily useful within macros. @xref{Macros,,
463 +Defining your own directives}.
466 +@cindex loops, breaking out of
467 +@cindex breaking out of loops
468 +You can use the @code{.EXITM} preprocessor directive to break out of
469 +loops early (as well as to break out of macros). @xref{Macros,,
470 +Defining your own directives}.
473 +@section Preprocessor variables
475 +You can use variables in @sc{gasp} to represent strings, registers, or
476 +the results of expressions.
478 +You must distinguish two kinds of variables:
481 +Variables defined with @code{.EQU} or @code{.ASSIGN}. To evaluate this
482 +kind of variable in your assembly output, simply mention its name. For
483 +example, these two lines define and use a variable @samp{eg}:
493 +@emph{Do not use} this kind of variable in conditional expressions or
494 +while loops; @sc{gasp} only evaluates these variables when writing
498 +Variables for use during preprocessing. You can define these
499 +with @code{.ASSIGNC} or @code{.ASSIGNA}. To evaluate this
500 +kind of variable, write @samp{\&} before the variable name; for example,
506 + .AWHILE \&opcit GT 0
512 +@sc{gasp} treats macro arguments almost the same way, but to evaluate
513 +them you use the prefix @samp{\} rather than @samp{\&}.
514 +@xref{Macros,, Defining your own directives}.
518 +@item @var{pvar} .EQU @var{expr}
519 +@c FIXME! Anything to beware of re GAS directive of same name?
520 +Assign preprocessor variable @var{pvar} the value of the expression
521 +@var{expr}. There are no restrictions on redefinition; use @samp{.EQU}
522 +with the same @var{pvar} as often as you find it convenient.
524 +@item @var{pvar} .ASSIGN @var{expr}
525 +Almost the same as @code{.EQU}, save that you may not redefine
526 +@var{pvar} using @code{.ASSIGN} once it has a value.
527 +@c FIXME!! Supposed to work this way, apparently, but on 9feb94 works
530 +@item @var{pvar} .ASSIGNA @var{aexpr}
531 +Define a variable with a numeric value, for use during preprocessing.
532 +@var{aexpr} must be an absolute expression. You can redefine variables
533 +with @code{.ASSIGNA} at any time.
535 +@item @var{pvar} .ASSIGNC "@var{str}"
536 +Define a variable with a string value, for use during preprocessing.
537 +You can redefine variables with @code{.ASSIGNC} at any time.
539 +@item @var{pvar} .REG (@var{register})
540 +Use @code{.REG} to define a variable that represents a register. In
541 +particular, @var{register} is @emph{not evaluated} as an expression.
542 +You may use @code{.REG} at will to redefine register variables.
545 +All these directives accept the variable name in the ``label'' position,
546 +that is at the left margin. You may specify a colon after the variable
547 +name if you wish; the first example above could have started @samp{eg:}
548 +with the same effect.
550 +@c pagebreak makes for better aesthetics---ensures macro and expansion together
553 +@section Defining your own directives
555 +The commands @code{.MACRO} and @code{.ENDM} allow you to define macros
556 +that generate assembly output. You can use these macros with a syntax
557 +similar to built-in @sc{gasp} or assembler directives. For example,
558 +this definition specifies a macro @code{SUM} that adds together a range of
559 +consecutive registers:
563 + .MACRO SUM FROM=0, TO=9
566 +COUNT .ASSIGNA \FROM+1
567 + .AWHILE \&COUNT LE \TO
569 +COUNT .ASSIGNA \&COUNT+1
576 +With that definition, @samp{SUM 0,5} generates this assembly output:
591 +@item .MACRO @var{macname}
592 +@itemx .MACRO @var{macname} @var{macargs} @dots{}
593 +Begin the definition of a macro called @var{macname}. If your macro
594 +definition requires arguments, specify their names after the macro name,
595 +separated by commas or spaces. You can supply a default value for any
596 +macro argument by following the name with @samp{=@var{deflt}}. For
597 +example, these are all valid @code{.MACRO} statements:
601 +Begin the definition of a macro called @code{COMM}, which takes no
604 +@item .MACRO PLUS1 P, P1
605 +@itemx .MACRO PLUS1 P P1
606 +Either statement begins the definition of a macro called @code{PLUS1},
607 +which takes two arguments; within the macro definition, write
608 +@samp{\P} or @samp{\P1} to evaluate the arguments.
610 +@item .MACRO RESERVE_STR P1=0 P2
611 +Begin the definition of a macro called @code{RESERVE_STR}, with two
612 +arguments. The first argument has a default value, but not the second.
613 +After the definition is complete, you can call the macro either as
614 +@samp{RESERVE_STR @var{a},@var{b}} (with @samp{\P1} evaluating to
615 +@var{a} and @samp{\P2} evaluating to @var{b}), or as @samp{RESERVE_STR
616 +,@var{b}} (with @samp{\P1} evaluating as the default, in this case
617 +@samp{0}, and @samp{\P2} evaluating to @var{b}).
620 +When you call a macro, you can specify the argument values either by
621 +position, or by keyword. For example, @samp{SUM 9,17} is equivalent to
622 +@samp{SUM TO=17, FROM=9}. Macro arguments are preprocessor variables
623 +similar to the variables you define with @samp{.ASSIGNA} or
624 +@samp{.ASSIGNC}; in particular, you can use them in conditionals or for
625 +loop control. (The only difference is the prefix you write to evaluate
626 +the variable: for a macro argument, write @samp{\@var{argname}}, but for
627 +a preprocessor variable, write @samp{\&@var{varname}}.)
629 +@item @var{name} .MACRO
630 +@itemx @var{name} .MACRO ( @var{macargs} @dots{} )
631 +@c FIXME check: I think no error _and_ no args recognized if I use form
632 +@c NAME .MACRO ARG ARG
633 +An alternative form of introducing a macro definition: specify the macro
634 +name in the label position, and the arguments (if any) between
635 +parentheses after the name. Defaulting rules and usage work the same
636 +way as for the other macro definition syntax.
639 +Mark the end of a macro definition.
642 +Exit early from the current macro definition, @code{.AREPEAT} loop, or
643 +@code{.AWHILE} loop.
645 +@cindex number of macros executed
646 +@cindex macros, count executed
648 +@sc{gasp} maintains a counter of how many macros it has
649 +executed in this pseudo-variable; you can copy that number to your
650 +output with @samp{\@@}, but @emph{only within a macro definition}.
652 +@item LOCAL @var{name} [ , @dots{} ]
653 +@emph{Warning: @code{LOCAL} is only available if you select ``alternate
654 +macro syntax'' with @samp{-a} or @samp{--alternate}.} @xref{Alternate,,
655 +Alternate macro syntax}.
657 +Generate a string replacement for each of the @var{name} arguments, and
658 +replace any instances of @var{name} in each macro expansion. The
659 +replacement string is unique in the assembly, and different for each
660 +separate macro expansion. @code{LOCAL} allows you to write macros that
661 +define symbols, without fear of conflict between separate macro expansions.
665 +@section Data output
667 +In assembly code, you often need to specify working areas of memory;
668 +depending on the application, you may want to initialize such memory or
669 +not. @sc{gasp} provides preprocessor directives to help you avoid
670 +repetitive coding for both purposes.
672 +You can use labels as usual to mark the data areas.
680 +@subsection Initialized data
682 +These are the @sc{gasp} directives for initialized data, and the standard
683 +@sc{gnu} assembler directives they expand to:
686 +@item .DATA @var{expr}, @var{expr}, @dots{}
687 +@itemx .DATA.B @var{expr}, @var{expr}, @dots{}
688 +@itemx .DATA.W @var{expr}, @var{expr}, @dots{}
689 +@itemx .DATA.L @var{expr}, @var{expr}, @dots{}
690 +Evaluate arithmetic expressions @var{expr}, and emit the corresponding
691 +@code{as} directive (labelled with @var{lab}). The unqualified
692 +@code{.DATA} emits @samp{.long}; @code{.DATA.B} emits @samp{.byte};
693 +@code{.DATA.W} emits @samp{.short}; and @code{.DATA.L} emits
696 +For example, @samp{foo .DATA 1,2,3} emits @samp{foo: .long 1,2,3}.
698 +@item .DATAB @var{repeat}, @var{expr}
699 +@itemx .DATAB.B @var{repeat}, @var{expr}
700 +@itemx .DATAB.W @var{repeat}, @var{expr}
701 +@itemx .DATAB.L @var{repeat}, @var{expr}
702 +@c FIXME! Looks like gasp accepts and ignores args after 2nd.
703 +Make @code{as} emit @var{repeat} copies of the value of the expression
704 +@var{expr} (using the @code{as} directive @code{.fill}).
705 +@samp{.DATAB.B} repeats one-byte values; @samp{.DATAB.W} repeats
706 +two-byte values; and @samp{.DATAB.L} repeats four-byte values.
707 +@samp{.DATAB} without a suffix repeats four-byte values, just like
710 +@c FIXME! Allowing zero might be useful for edge conditions in macros.
711 +@var{repeat} must be an absolute expression with a positive value.
713 +@item .SDATA "@var{str}" @dots{}
714 +String data. Emits a concatenation of bytes, precisely as you specify
715 +them (in particular, @emph{nothing is added to mark the end} of the
716 +string). @xref{Constants,, String and numeric constants}, for details
717 +about how to write strings. @code{.SDATA} concatenates multiple
718 +arguments, making it easy to switch between string representations. You
719 +can use commas to separate the individual arguments for clarity, if you
722 +@item .SDATAB @var{repeat}, "@var{str}" @dots{}
723 +Repeated string data. The first argument specifies how many copies of
724 +the string to emit; the remaining arguments specify the string, in the
725 +same way as the arguments to @code{.SDATA}.
727 +@item .SDATAZ "@var{str}" @dots{}
728 +Zero-terminated string data. Just like @code{.SDATA}, except that
729 +@code{.SDATAZ} writes a zero byte at the end of the string.
731 +@item .SDATAC "@var{str}" @dots{}
732 +Count-prefixed string data. Just like @code{.SDATA}, except that
733 +@sc{gasp} precedes the string with a leading one-byte count. For
734 +example, @samp{.SDATAC "HI"} generates @samp{.byte 2,72,73}. Since the
735 +count field is only one byte, you can only use @code{.SDATAC} for
736 +strings less than 256 bytes in length.
740 +@subsection Uninitialized data
742 +@c FIXME! .space different on some platforms, notably HPPA. Config?
743 +Use the @code{.RES}, @code{.SRES}, @code{.SRESC}, and @code{.SRESZ}
744 +directives to reserve memory and leave it uninitialized. @sc{gasp}
745 +resolves these directives to appropriate calls of the @sc{gnu}
746 +@code{as} @code{.space} directive.
749 +@item .RES @var{count}
750 +@itemx .RES.B @var{count}
751 +@itemx .RES.W @var{count}
752 +@itemx .RES.L @var{count}
753 +Reserve room for @var{count} uninitialized elements of data. The
754 +suffix specifies the size of each element: @code{.RES.B} reserves
755 +@var{count} bytes, @code{.RES.W} reserves @var{count} pairs of bytes,
756 +and @code{.RES.L} reserves @var{count} quartets. @code{.RES} without a
757 +suffix is equivalent to @code{.RES.L}.
759 +@item .SRES @var{count}
760 +@itemx .SRES.B @var{count}
761 +@itemx .SRES.W @var{count}
762 +@itemx .SRES.L @var{count}
763 +@c FIXME! This is boring. Shouldn't it at least have a different
764 +@c default size? (e.g. the "S" suggests "string", for which .B
765 +@c would be more appropriate)
766 +@code{.SRES} is a synonym for @samp{.RES}.
768 +@item .SRESC @var{count}
769 +@itemx .SRESC.B @var{count}
770 +@itemx .SRESC.W @var{count}
771 +@itemx .SRESC.L @var{count}
772 +Like @code{.SRES}, but reserves space for @code{@var{count}+1} elements.
774 +@item .SRESZ @var{count}
775 +@itemx .SRESZ.B @var{count}
776 +@itemx .SRESZ.W @var{count}
777 +@itemx .SRESZ.L @var{count}
778 +Like @code{.SRES}, but reserves space for @code{@var{count}+1} elements.
782 +@section Assembly listing control
784 +The @sc{gasp} listing-control directives correspond to
785 +related @sc{gnu} @code{as} directives.
789 +@itemx .PRINT NOLIST
790 +Print control. This directive emits the @sc{gnu} @code{as} directive
791 +@code{.list} or @code{.nolist}, according to its argument. @xref{List,,
792 +@code{.list}, as.info, Using as}, for details on how these directives
795 +@item .FORM LIN=@var{ln}
796 +@itemx .FORM COL=@var{cols}
797 +@itemx .FORM LIN=@var{ln} COL=@var{cols}
798 +Specify the page size for assembly listings: @var{ln} represents the
799 +number of lines, and @var{cols} the number of columns. You may specify
800 +either page dimension independently, or both together. If you do not
801 +specify the number of lines, @sc{gasp} assumes 60 lines; if you do not
802 +specify the number of columns, @sc{gasp} assumes 132 columns.
803 +(Any values you may have specified in previous instances of @code{.FORM}
804 +do @emph{not} carry over as defaults.) Emits the @code{.psize}
805 +assembler directive.
807 +@item .HEADING @var{string}
808 +Specify @var{string} as the title of your assembly listings. Emits
809 +@samp{.title "@var{string}"}.
812 +Force a new page in assembly listings. Emits @samp{.eject}.
815 +@node Other Commands
816 +@section Miscellaneous commands
820 +Use the alternate macro syntax henceforth in the assembly.
821 +@xref{Alternate,, Alternate macro syntax}.
824 +@c FIXME! This is very strange, since _GAS_ understands .org
825 +This command is recognized, but not yet implemented. @sc{gasp}
826 +generates an error message for programs that use @code{.ORG}.
828 +@item .RADIX @var{s}
829 +@c FIXME no test cases in testsuite/gasp
830 +@sc{gasp} understands numbers in any of base two, eight, ten, or
831 +sixteen. You can encode the base explicitly in any numeric constant
832 +(@pxref{Constants,, String and numeric constants}). If you write
833 +numbers without an explicit indication of the base, the most recent
834 +@samp{.RADIX @var{s}} command determines how they are interpreted.
835 +@var{s} is a single letter, one of the following:
845 +Base 10. This is the original default radix.
851 +You may specify the argument @var{s} in lower case (any of @samp{bqdh})
852 +with the same effects.
854 +@item .EXPORT @var{name}
855 +@itemx .GLOBAL @var{name}
856 +@c FIXME! No test cases in testsuite/gasp
857 +Declare @var{name} global (emits @samp{.global @var{name}}). The two
858 +directives are synonymous.
861 +No effect: @sc{gasp} accepts this directive, and silently ignores it.
864 +Mark end of each preprocessor file. @sc{gasp} issues a warning if it
865 +reaches end of file without seeing this command.
867 +@item .INCLUDE "@var{str}"
868 +Preprocess the file named by @var{str}, as if its contents appeared
869 +where the @code{.INCLUDE} directive does. @sc{gasp} imposes a maximum
870 +limit of 30 stacked include files, as a sanity check.
871 +@c FIXME! Why is include depth not affected by -u?
873 +@item .ALIGN @var{size}
874 +@c FIXME! Why is this not utterly pointless?
875 +Evaluate the absolute expression @var{size}, and emit the assembly
876 +instruction @samp{.align @var{size}} using the result.
879 +@node Syntax Details
880 +@section Details of the GASP syntax
882 +Since @sc{gasp} is meant to work with assembly code, its statement
883 +syntax has no surprises for the assembly programmer.
886 +@emph{Whitespace} (blanks or tabs; @emph{not} newline) is partially
887 +significant, in that it delimits up to three fields in a line. The
888 +amount of whitespace does not matter; you may line up fields in separate
889 +lines if you wish, but @sc{gasp} does not require that.
891 +@cindex fields of @sc{gasp} source line
893 +The @emph{first field}, an optional @dfn{label}, must be flush left in a
894 +line (with no leading whitespace) if it appears at all. You may use a
895 +colon after the label if you wish; @sc{gasp} neither requires the colon
896 +nor objects to it (but will not include it as part of the label name).
898 +@cindex directive field
899 +The @emph{second field}, which must appear after some whitespace,
900 +contains a @sc{gasp} or assembly @dfn{directive}.
902 +@cindex argument fields
903 +Any @emph{further fields} on a line are @dfn{arguments} to the
904 +directive; you can separate them from one another using either commas or
916 +@subsection Special syntactic markers
918 +@sc{gasp} recognizes a few special markers: to delimit comments, to
919 +continue a statement on the next line, to separate symbols from other
920 +characters, and to copy text to the output literally. (One other
921 +special marker, @samp{\@@}, works only within macro definitions;
922 +@pxref{Macros,, Defining your own directives}.)
925 +The trailing part of any @sc{gasp} source line may be a @dfn{comment}.
926 +A comment begins with the first unquoted comment character (@samp{!} by
927 +default), or an escaped or doubled comment character (@samp{\!} or
928 +@samp{!!} by default), and extends to the end of a line. You can
929 +specify what comment character to use with the @samp{-c} option
930 +(@pxref{Invoking GASP,, Command Line Options}). The two kinds of
931 +comment markers lead to slightly different treatment:
935 +A single, un-escaped comment character generates an assembly comment in
936 +the @sc{gasp} output. @sc{gasp} evaluates any preprocessor variables
937 +(macro arguments, or variables defined with @code{.ASSIGNA} or
938 +@code{.ASSIGNC}) present. For example, a macro that begins like this
941 + .MACRO SUM FROM=0, TO=9
946 +issues as the first line of output a comment that records the
947 +values you used to call the macro.
949 +@c comments, preprocessor-only
950 +@c preprocessor-only comments
951 +@c GASP-only comments
954 +Either an escaped comment character, or a double comment character,
955 +marks a @sc{gasp} source comment. @sc{gasp} does not copy such comments
956 +to the assembly output.
959 +@cindex continuation character
961 +To @emph{continue a statement} on the next line of the file, begin the
962 +second line with the character @samp{+}.
964 +@cindex literal copy to output
965 +@cindex copying literally to output
966 +@cindex preprocessing, avoiding
967 +@cindex avoiding preprocessing
968 +Occasionally you may want to prevent @sc{gasp} from preprocessing some
969 +particular bit of text. To @emph{copy literally} from the @sc{gasp}
970 +source to its output, place @samp{\(} before the string to copy, and
971 +@samp{)} at the end. For example, write @samp{\(\!)} if you need the
972 +characters @samp{\!} in your assembly output.
974 +@cindex symbol separator
975 +@cindex text, separating from symbols
976 +@cindex symbols, separating from text
977 +To @emph{separate a preprocessor variable} from text to appear
978 +immediately after its value, write a single quote (@code{'}). For
979 +example, @samp{.SDATA "\P'1"} writes a string built by concatenating the
980 +value of @code{P} and the digit @samp{1}. (You cannot achieve this by
981 +writing just @samp{\P1}, since @samp{P1} is itself a valid name for a
982 +preprocessor variable.)
985 +@subsection String and numeric constants
987 +There are two ways of writing @dfn{string constants} in @sc{gasp}: as
988 +literal text, and by numeric byte value. Specify a string literal
989 +between double quotes (@code{"@var{str}"}). Specify an individual
990 +numeric byte value as an absolute expression between angle brackets
991 +(@code{<@var{expr}>}. Directives that output strings allow you to
992 +specify any number of either kind of value, in whatever order is
993 +convenient, and concatenate the result. (Alternate syntax mode
994 +introduces a number of alternative string notations; @pxref{Alternate,,
995 +Alternate macro syntax}.)
997 +@c Details of numeric notation, e.g. base prefixes
998 +You can write @dfn{numeric constants} either in a specific base, or in
999 +whatever base is currently selected (either 10, or selected by the most
1000 +recent @code{.RADIX}).
1002 +To write a number in a @emph{specific base}, use the pattern
1003 +@code{@var{s}'@var{ddd}}: a base specifier character @var{s}, followed
1004 +by a single quote followed by digits @var{ddd}. The base specifier
1005 +character matches those you can specify with @code{.RADIX}: @samp{B} for
1006 +base 2, @samp{Q} for base 8, @samp{D} for base 10, and @samp{H} for base
1007 +16. (You can write this character in lower case if you prefer.)
1009 +You can write floating point constants using the same syntax recognised
1010 +by GAS @ref{Flonums,,Flonums,as,The GNU Assembler.}. A constraint is
1011 +that these constants will be interpreted as decimal values irrespective
1012 +of the currently selected base.
1014 +@c FIXME! What are rules for recognizing number in deflt base? Whatever
1015 +@c is left over after parsing other things??
1018 +@subsection Symbols
1020 +@sc{gasp} recognizes symbol names that start with any alphabetic character,
1021 +@samp{_}, or @samp{$}, and continue with any of the same characters or
1022 +with digits. Label names follow the same rules.
1025 +@subsection Arithmetic expressions in GASP
1027 +@cindex absolute expressions
1028 +@cindex relocatable expressions
1029 +There are two kinds of expressions, depending on their result:
1030 +@dfn{absolute} expressions, which resolve to a constant (that is, they
1031 +do not involve any values unknown to @sc{gasp}), and @dfn{relocatable}
1032 +expressions, which must reduce to the form
1035 +@var{addsym}+@var{const}-@var{subsym}
1039 +where @var{addsym} and @var{subsym} are assembly symbols of unknown
1040 +value, and @var{const} is a constant.
1042 +Arithmetic for @sc{gasp} expressions follows very similar rules to C.
1043 +You can use parentheses to change precedence; otherwise, arithmetic
1044 +primitives have decreasing precedence in the order of the following
1049 +Single-argument @code{+} (identity), @code{-} (arithmetic opposite), or
1050 +@code{~} (bitwise negation). @emph{The argument must be an absolute
1054 +@code{*} (multiplication) and @code{/} (division). @emph{Both arguments
1055 +must be absolute expressions.}
1058 +@code{+} (addition) and @code{-} (subtraction). @emph{At least one argument
1060 +@c FIXME! Actually, subtraction doesn't check for this.
1063 +@code{&} (bitwise and). @emph{Both arguments must be absolute.}
1066 +@c FIXME! I agree ~ is a better notation than ^ for xor, but is the
1067 +@c improvement worth differing from C?
1068 +@code{|} (bitwise or) and @code{~} (bitwise exclusive or; @code{^} in
1069 +C). @emph{Both arguments must be absolute.}
1072 +@node String Builtins
1073 +@subsection String primitives
1075 +You can use these primitives to manipulate strings (in the argument
1076 +field of @sc{gasp} statements):
1079 +@item .LEN("@var{str}")
1080 +Calculate the length of string @code{"@var{str}"}, as an absolute
1081 +expression. For example, @samp{.RES.B .LEN("sample")} reserves six
1084 +@item .INSTR("@var{string}", "@var{seg}", @var{ix})
1085 +Search for the first occurrence of @var{seg} after position @var{ix} of
1086 +@var{string}. For example, @samp{.INSTR("ABCDEFG", "CDE", 0)} evaluates
1087 +to the absolute result @code{2}.
1089 +The result is @code{-1} if @var{seg} does not occur in @var{string}
1090 +after position @var{ix}.
1092 +@item .SUBSTR("@var{string}",@var{start},@var{len})
1093 +The substring of @var{string} beginning at byte number @var{start} and
1094 +extending for @var{len} bytes.
1098 +@section Alternate macro syntax
1100 +If you specify @samp{-a} or @samp{--alternate} on the @sc{gasp} command
1101 +line, the preprocessor uses somewhat different syntax. This syntax is
1102 +reminiscent of the syntax of Phar Lap macro assembler, but it
1103 +is @emph{not} meant to be a full emulation of Phar Lap or similar
1104 +assemblers. In particular, @sc{gasp} does not support directives such
1105 +as @code{DB} and @code{IRP}, even in alternate syntax mode.
1107 +In particular, @samp{-a} (or @samp{--alternate}) elicits these
1111 +@item Preprocessor directives
1112 +You can use @sc{gasp} preprocessor directives without a leading @samp{.}
1113 +dot. For example, you can write @samp{SDATA} with the same effect as
1117 +One additional directive, @code{LOCAL}, is available. @xref{Macros,,
1118 +Defining your own directives}, for an explanation of how to use
1122 +@item String delimiters
1123 +You can write strings delimited in these other ways besides
1124 +@code{"@var{string}"}:
1127 +@item '@var{string}'
1128 +You can delimit strings with single-quote charaters.
1130 +@item <@var{string}>
1131 +You can delimit strings with matching angle brackets.
1134 +@item single-character string escape
1135 +To include any single character literally in a string (even if the
1136 +character would otherwise have some special meaning), you can prefix the
1137 +character with @samp{!} (an exclamation mark). For example, you can
1138 +write @samp{<4.3 !> 5.4!!>} to get the literal text @samp{4.3 > 5.4!}.
1140 +@item Expression results as strings
1141 +You can write @samp{%@var{expr}} to evaluate the expression @var{expr}
1142 +and use the result as a string.
1145 +@node GNU Free Documentation License
1146 +@chapter GNU Free Documentation License
1148 + GNU Free Documentation License
1150 + Version 1.1, March 2000
1152 + Copyright (C) 2000 Free Software Foundation, Inc.
1153 + 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
1155 + Everyone is permitted to copy and distribute verbatim copies
1156 + of this license document, but changing it is not allowed.
1161 +The purpose of this License is to make a manual, textbook, or other
1162 +written document "free" in the sense of freedom: to assure everyone
1163 +the effective freedom to copy and redistribute it, with or without
1164 +modifying it, either commercially or noncommercially. Secondarily,
1165 +this License preserves for the author and publisher a way to get
1166 +credit for their work, while not being considered responsible for
1167 +modifications made by others.
1169 +This License is a kind of "copyleft", which means that derivative
1170 +works of the document must themselves be free in the same sense. It
1171 +complements the GNU General Public License, which is a copyleft
1172 +license designed for free software.
1174 +We have designed this License in order to use it for manuals for free
1175 +software, because free software needs free documentation: a free
1176 +program should come with manuals providing the same freedoms that the
1177 +software does. But this License is not limited to software manuals;
1178 +it can be used for any textual work, regardless of subject matter or
1179 +whether it is published as a printed book. We recommend this License
1180 +principally for works whose purpose is instruction or reference.
1183 +1. APPLICABILITY AND DEFINITIONS
1185 +This License applies to any manual or other work that contains a
1186 +notice placed by the copyright holder saying it can be distributed
1187 +under the terms of this License. The "Document", below, refers to any
1188 +such manual or work. Any member of the public is a licensee, and is
1189 +addressed as "you".
1191 +A "Modified Version" of the Document means any work containing the
1192 +Document or a portion of it, either copied verbatim, or with
1193 +modifications and/or translated into another language.
1195 +A "Secondary Section" is a named appendix or a front-matter section of
1196 +the Document that deals exclusively with the relationship of the
1197 +publishers or authors of the Document to the Document's overall subject
1198 +(or to related matters) and contains nothing that could fall directly
1199 +within that overall subject. (For example, if the Document is in part a
1200 +textbook of mathematics, a Secondary Section may not explain any
1201 +mathematics.) The relationship could be a matter of historical
1202 +connection with the subject or with related matters, or of legal,
1203 +commercial, philosophical, ethical or political position regarding
1206 +The "Invariant Sections" are certain Secondary Sections whose titles
1207 +are designated, as being those of Invariant Sections, in the notice
1208 +that says that the Document is released under this License.
1210 +The "Cover Texts" are certain short passages of text that are listed,
1211 +as Front-Cover Texts or Back-Cover Texts, in the notice that says that
1212 +the Document is released under this License.
1214 +A "Transparent" copy of the Document means a machine-readable copy,
1215 +represented in a format whose specification is available to the
1216 +general public, whose contents can be viewed and edited directly and
1217 +straightforwardly with generic text editors or (for images composed of
1218 +pixels) generic paint programs or (for drawings) some widely available
1219 +drawing editor, and that is suitable for input to text formatters or
1220 +for automatic translation to a variety of formats suitable for input
1221 +to text formatters. A copy made in an otherwise Transparent file
1222 +format whose markup has been designed to thwart or discourage
1223 +subsequent modification by readers is not Transparent. A copy that is
1224 +not "Transparent" is called "Opaque".
1226 +Examples of suitable formats for Transparent copies include plain
1227 +ASCII without markup, Texinfo input format, LaTeX input format, SGML
1228 +or XML using a publicly available DTD, and standard-conforming simple
1229 +HTML designed for human modification. Opaque formats include
1230 +PostScript, PDF, proprietary formats that can be read and edited only
1231 +by proprietary word processors, SGML or XML for which the DTD and/or
1232 +processing tools are not generally available, and the
1233 +machine-generated HTML produced by some word processors for output
1236 +The "Title Page" means, for a printed book, the title page itself,
1237 +plus such following pages as are needed to hold, legibly, the material
1238 +this License requires to appear in the title page. For works in
1239 +formats which do not have any title page as such, "Title Page" means
1240 +the text near the most prominent appearance of the work's title,
1241 +preceding the beginning of the body of the text.
1244 +2. VERBATIM COPYING
1246 +You may copy and distribute the Document in any medium, either
1247 +commercially or noncommercially, provided that this License, the
1248 +copyright notices, and the license notice saying this License applies
1249 +to the Document are reproduced in all copies, and that you add no other
1250 +conditions whatsoever to those of this License. You may not use
1251 +technical measures to obstruct or control the reading or further
1252 +copying of the copies you make or distribute. However, you may accept
1253 +compensation in exchange for copies. If you distribute a large enough
1254 +number of copies you must also follow the conditions in section 3.
1256 +You may also lend copies, under the same conditions stated above, and
1257 +you may publicly display copies.
1260 +3. COPYING IN QUANTITY
1262 +If you publish printed copies of the Document numbering more than 100,
1263 +and the Document's license notice requires Cover Texts, you must enclose
1264 +the copies in covers that carry, clearly and legibly, all these Cover
1265 +Texts: Front-Cover Texts on the front cover, and Back-Cover Texts on
1266 +the back cover. Both covers must also clearly and legibly identify
1267 +you as the publisher of these copies. The front cover must present
1268 +the full title with all words of the title equally prominent and
1269 +visible. You may add other material on the covers in addition.
1270 +Copying with changes limited to the covers, as long as they preserve
1271 +the title of the Document and satisfy these conditions, can be treated
1272 +as verbatim copying in other respects.
1274 +If the required texts for either cover are too voluminous to fit
1275 +legibly, you should put the first ones listed (as many as fit
1276 +reasonably) on the actual cover, and continue the rest onto adjacent
1279 +If you publish or distribute Opaque copies of the Document numbering
1280 +more than 100, you must either include a machine-readable Transparent
1281 +copy along with each Opaque copy, or state in or with each Opaque copy
1282 +a publicly-accessible computer-network location containing a complete
1283 +Transparent copy of the Document, free of added material, which the
1284 +general network-using public has access to download anonymously at no
1285 +charge using public-standard network protocols. If you use the latter
1286 +option, you must take reasonably prudent steps, when you begin
1287 +distribution of Opaque copies in quantity, to ensure that this
1288 +Transparent copy will remain thus accessible at the stated location
1289 +until at least one year after the last time you distribute an Opaque
1290 +copy (directly or through your agents or retailers) of that edition to
1293 +It is requested, but not required, that you contact the authors of the
1294 +Document well before redistributing any large number of copies, to give
1295 +them a chance to provide you with an updated version of the Document.
1300 +You may copy and distribute a Modified Version of the Document under
1301 +the conditions of sections 2 and 3 above, provided that you release
1302 +the Modified Version under precisely this License, with the Modified
1303 +Version filling the role of the Document, thus licensing distribution
1304 +and modification of the Modified Version to whoever possesses a copy
1305 +of it. In addition, you must do these things in the Modified Version:
1307 +A. Use in the Title Page (and on the covers, if any) a title distinct
1308 + from that of the Document, and from those of previous versions
1309 + (which should, if there were any, be listed in the History section
1310 + of the Document). You may use the same title as a previous version
1311 + if the original publisher of that version gives permission.
1312 +B. List on the Title Page, as authors, one or more persons or entities
1313 + responsible for authorship of the modifications in the Modified
1314 + Version, together with at least five of the principal authors of the
1315 + Document (all of its principal authors, if it has less than five).
1316 +C. State on the Title page the name of the publisher of the
1317 + Modified Version, as the publisher.
1318 +D. Preserve all the copyright notices of the Document.
1319 +E. Add an appropriate copyright notice for your modifications
1320 + adjacent to the other copyright notices.
1321 +F. Include, immediately after the copyright notices, a license notice
1322 + giving the public permission to use the Modified Version under the
1323 + terms of this License, in the form shown in the Addendum below.
1324 +G. Preserve in that license notice the full lists of Invariant Sections
1325 + and required Cover Texts given in the Document's license notice.
1326 +H. Include an unaltered copy of this License.
1327 +I. Preserve the section entitled "History", and its title, and add to
1328 + it an item stating at least the title, year, new authors, and
1329 + publisher of the Modified Version as given on the Title Page. If
1330 + there is no section entitled "History" in the Document, create one
1331 + stating the title, year, authors, and publisher of the Document as
1332 + given on its Title Page, then add an item describing the Modified
1333 + Version as stated in the previous sentence.
1334 +J. Preserve the network location, if any, given in the Document for
1335 + public access to a Transparent copy of the Document, and likewise
1336 + the network locations given in the Document for previous versions
1337 + it was based on. These may be placed in the "History" section.
1338 + You may omit a network location for a work that was published at
1339 + least four years before the Document itself, or if the original
1340 + publisher of the version it refers to gives permission.
1341 +K. In any section entitled "Acknowledgements" or "Dedications",
1342 + preserve the section's title, and preserve in the section all the
1343 + substance and tone of each of the contributor acknowledgements
1344 + and/or dedications given therein.
1345 +L. Preserve all the Invariant Sections of the Document,
1346 + unaltered in their text and in their titles. Section numbers
1347 + or the equivalent are not considered part of the section titles.
1348 +M. Delete any section entitled "Endorsements". Such a section
1349 + may not be included in the Modified Version.
1350 +N. Do not retitle any existing section as "Endorsements"
1351 + or to conflict in title with any Invariant Section.
1353 +If the Modified Version includes new front-matter sections or
1354 +appendices that qualify as Secondary Sections and contain no material
1355 +copied from the Document, you may at your option designate some or all
1356 +of these sections as invariant. To do this, add their titles to the
1357 +list of Invariant Sections in the Modified Version's license notice.
1358 +These titles must be distinct from any other section titles.
1360 +You may add a section entitled "Endorsements", provided it contains
1361 +nothing but endorsements of your Modified Version by various
1362 +parties--for example, statements of peer review or that the text has
1363 +been approved by an organization as the authoritative definition of a
1366 +You may add a passage of up to five words as a Front-Cover Text, and a
1367 +passage of up to 25 words as a Back-Cover Text, to the end of the list
1368 +of Cover Texts in the Modified Version. Only one passage of
1369 +Front-Cover Text and one of Back-Cover Text may be added by (or
1370 +through arrangements made by) any one entity. If the Document already
1371 +includes a cover text for the same cover, previously added by you or
1372 +by arrangement made by the same entity you are acting on behalf of,
1373 +you may not add another; but you may replace the old one, on explicit
1374 +permission from the previous publisher that added the old one.
1376 +The author(s) and publisher(s) of the Document do not by this License
1377 +give permission to use their names for publicity for or to assert or
1378 +imply endorsement of any Modified Version.
1381 +5. COMBINING DOCUMENTS
1383 +You may combine the Document with other documents released under this
1384 +License, under the terms defined in section 4 above for modified
1385 +versions, provided that you include in the combination all of the
1386 +Invariant Sections of all of the original documents, unmodified, and
1387 +list them all as Invariant Sections of your combined work in its
1390 +The combined work need only contain one copy of this License, and
1391 +multiple identical Invariant Sections may be replaced with a single
1392 +copy. If there are multiple Invariant Sections with the same name but
1393 +different contents, make the title of each such section unique by
1394 +adding at the end of it, in parentheses, the name of the original
1395 +author or publisher of that section if known, or else a unique number.
1396 +Make the same adjustment to the section titles in the list of
1397 +Invariant Sections in the license notice of the combined work.
1399 +In the combination, you must combine any sections entitled "History"
1400 +in the various original documents, forming one section entitled
1401 +"History"; likewise combine any sections entitled "Acknowledgements",
1402 +and any sections entitled "Dedications". You must delete all sections
1403 +entitled "Endorsements."
1406 +6. COLLECTIONS OF DOCUMENTS
1408 +You may make a collection consisting of the Document and other documents
1409 +released under this License, and replace the individual copies of this
1410 +License in the various documents with a single copy that is included in
1411 +the collection, provided that you follow the rules of this License for
1412 +verbatim copying of each of the documents in all other respects.
1414 +You may extract a single document from such a collection, and distribute
1415 +it individually under this License, provided you insert a copy of this
1416 +License into the extracted document, and follow this License in all
1417 +other respects regarding verbatim copying of that document.
1420 +7. AGGREGATION WITH INDEPENDENT WORKS
1422 +A compilation of the Document or its derivatives with other separate
1423 +and independent documents or works, in or on a volume of a storage or
1424 +distribution medium, does not as a whole count as a Modified Version
1425 +of the Document, provided no compilation copyright is claimed for the
1426 +compilation. Such a compilation is called an "aggregate", and this
1427 +License does not apply to the other self-contained works thus compiled
1428 +with the Document, on account of their being thus compiled, if they
1429 +are not themselves derivative works of the Document.
1431 +If the Cover Text requirement of section 3 is applicable to these
1432 +copies of the Document, then if the Document is less than one quarter
1433 +of the entire aggregate, the Document's Cover Texts may be placed on
1434 +covers that surround only the Document within the aggregate.
1435 +Otherwise they must appear on covers around the whole aggregate.
1440 +Translation is considered a kind of modification, so you may
1441 +distribute translations of the Document under the terms of section 4.
1442 +Replacing Invariant Sections with translations requires special
1443 +permission from their copyright holders, but you may include
1444 +translations of some or all Invariant Sections in addition to the
1445 +original versions of these Invariant Sections. You may include a
1446 +translation of this License provided that you also include the
1447 +original English version of this License. In case of a disagreement
1448 +between the translation and the original English version of this
1449 +License, the original English version will prevail.
1454 +You may not copy, modify, sublicense, or distribute the Document except
1455 +as expressly provided for under this License. Any other attempt to
1456 +copy, modify, sublicense or distribute the Document is void, and will
1457 +automatically terminate your rights under this License. However,
1458 +parties who have received copies, or rights, from you under this
1459 +License will not have their licenses terminated so long as such
1460 +parties remain in full compliance.
1463 +10. FUTURE REVISIONS OF THIS LICENSE
1465 +The Free Software Foundation may publish new, revised versions
1466 +of the GNU Free Documentation License from time to time. Such new
1467 +versions will be similar in spirit to the present version, but may
1468 +differ in detail to address new problems or concerns. See
1469 +http://www.gnu.org/copyleft/.
1471 +Each version of the License is given a distinguishing version number.
1472 +If the Document specifies that a particular numbered version of this
1473 +License "or any later version" applies to it, you have the option of
1474 +following the terms and conditions either of that specified version or
1475 +of any later version that has been published (not as a draft) by the
1476 +Free Software Foundation. If the Document does not specify a version
1477 +number of this License, you may choose any version ever published (not
1478 +as a draft) by the Free Software Foundation.
1481 +ADDENDUM: How to use this License for your documents
1483 +To use this License in a document you have written, include a copy of
1484 +the License in the document and put the following copyright and
1485 +license notices just after the title page:
1488 + Copyright (c) YEAR YOUR NAME.
1489 + Permission is granted to copy, distribute and/or modify this document
1490 + under the terms of the GNU Free Documentation License, Version 1.1
1491 + or any later version published by the Free Software Foundation;
1492 + with the Invariant Sections being LIST THEIR TITLES, with the
1493 + Front-Cover Texts being LIST, and with the Back-Cover Texts being LIST.
1494 + A copy of the license is included in the section entitled "GNU
1495 + Free Documentation License".
1498 +If you have no Invariant Sections, write "with no Invariant Sections"
1499 +instead of saying which ones are invariant. If you have no
1500 +Front-Cover Texts, write "no Front-Cover Texts" instead of
1501 +"Front-Cover Texts being LIST"; likewise for Back-Cover Texts.
1503 +If your document contains nontrivial examples of program code, we
1504 +recommend releasing these examples in parallel under your choice of
1505 +free software license, such as the GNU General Public License,
1506 +to permit their use in free software.
1515 diff -Nur binutils-2.13.90.0.18.orig/gas/gasp.c binutils-2.13.90.0.18/gas/gasp.c
1516 --- binutils-2.13.90.0.18.orig/gas/gasp.c Thu Jan 1 01:00:00 1970
1517 +++ binutils-2.13.90.0.18/gas/gasp.c Sun May 26 18:57:12 2002
1519 +/* gasp.c - Gnu assembler preprocessor main program.
1520 + Copyright 1994, 1995, 1996, 1997, 1998, 1999, 2000, 2001, 2002
1521 + Free Software Foundation, Inc.
1523 + Written by Steve and Judy Chamberlain of Cygnus Support,
1526 + This file is part of GASP, the GNU Assembler Preprocessor.
1528 + GASP is free software; you can redistribute it and/or modify
1529 + it under the terms of the GNU General Public License as published by
1530 + the Free Software Foundation; either version 2, or (at your option)
1531 + any later version.
1533 + GASP is distributed in the hope that it will be useful,
1534 + but WITHOUT ANY WARRANTY; without even the implied warranty of
1535 + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
1536 + GNU General Public License for more details.
1538 + You should have received a copy of the GNU General Public License
1539 + along with GASP; see the file COPYING. If not, write to the Free
1540 + Software Foundation, 59 Temple Place - Suite 330, Boston, MA
1541 + 02111-1307, USA. */
1544 +This program translates the input macros and stuff into a form
1545 +suitable for gas to consume.
1547 + gasp [-sdhau] [-c char] [-o <outfile>] <infile>*
1549 + -s copy source to output
1550 + -c <char> comments are started with <char> instead of !
1551 + -u allow unreasonable stuff
1552 + -p print line numbers
1553 + -d print debugging stats
1554 + -s semi colons start comments
1555 + -a use alternate syntax
1556 + Pseudo ops can start with or without a .
1557 + Labels have to be in first column.
1558 + -I specify include dir
1559 + Macro arg parameters subsituted by name, don't need the &.
1560 + String can start with ' too.
1561 + Strings can be surrounded by <..>
1562 + A %<exp> in a string evaluates the expression
1563 + Literal char in a string with !
1566 +#include "config.h"
1567 +#include "bin-bugs.h"
1569 +#include <assert.h>
1571 +#include <string.h>
1572 +#include "getopt.h"
1574 +#ifdef HAVE_STDLIB_H
1575 +#include <stdlib.h>
1578 +#ifdef NEED_MALLOC_DECLARATION
1579 +extern char *malloc ();
1582 +#include "ansidecl.h"
1583 +#include "libiberty.h"
1584 +#include "safe-ctype.h"
1587 +#include "asintl.h"
1588 +#include "xregex.h"
1590 +char *program_version = "1.2";
1592 +/* This is normally declared in as.h, but we don't include that. We
1593 + need the function because other files linked with gasp.c might call
1595 +extern void as_abort PARAMS ((const char *, int, const char *));
1597 +/* The default obstack chunk size. If we set this to zero, the
1598 + obstack code will use whatever will fit in a 4096 byte block. This
1599 + is used by the hash table code used by macro.c. */
1602 +#define MAX_INCLUDES 30 /* Maximum include depth. */
1603 +#define MAX_REASONABLE 1000 /* Maximum number of expansions. */
1605 +int unreasonable; /* -u on command line. */
1606 +int stats; /* -d on command line. */
1607 +int print_line_number; /* -p flag on command line. */
1608 +int copysource; /* -c flag on command line. */
1609 +int warnings; /* Number of WARNINGs generated so far. */
1610 +int errors; /* Number of ERRORs generated so far. */
1611 +int fatals; /* Number of fatal ERRORs generated so far (either 0 or 1). */
1612 +int alternate = 0; /* -a on command line. */
1613 +int mri = 0; /* -M on command line. */
1614 +char comment_char = '!';
1615 +int radix = 10; /* Default radix. */
1617 +int had_end; /* Seen .END. */
1619 +/* The output stream. */
1622 +/* The attributes of each character are stored as a bit pattern
1623 + chartype, which gives us quick tests. */
1629 +#define COMMENTBIT 16
1631 +#define ISCOMMENTCHAR(x) (chartype[(unsigned char)(x)] & COMMENTBIT)
1632 +#define ISFIRSTCHAR(x) (chartype[(unsigned char)(x)] & FIRSTBIT)
1633 +#define ISNEXTCHAR(x) (chartype[(unsigned char)(x)] & NEXTBIT)
1634 +#define ISSEP(x) (chartype[(unsigned char)(x)] & SEPBIT)
1635 +#define ISWHITE(x) (chartype[(unsigned char)(x)] & WHITEBIT)
1636 +#define ISBASE(x) (chartype[(unsigned char)(x)] & BASEBIT)
1637 +static char chartype[256];
1639 +/* Conditional assembly uses the `ifstack'. Each aif pushes another
1640 + entry onto the stack, and sets the on flag if it should. The aelse
1641 + sets hadelse, and toggles on. An aend pops a level. We limit to
1642 + 100 levels of nesting, not because we're facists pigs with read
1643 + only minds, but because more than 100 levels of nesting is probably
1644 + a bug in the user's macro structure. */
1646 +#define IFNESTING 100
1648 + int on; /* Is the level being output. */
1649 + int hadelse; /* Has an aelse been seen. */
1650 +} ifstack[IFNESTING];
1654 +/* The final and intermediate results of expression evaluation are kept in
1655 + exp_t's. Note that a symbol is not an sb, but a pointer into the input
1656 + line. It must be coped somewhere safe before the next line is read in. */
1664 + int value; /* Constant part. */
1665 + symbol add_symbol; /* Name part. */
1666 + symbol sub_symbol; /* Name part. */
1669 +/* Hashing is done in a pretty standard way. A hash_table has a
1670 + pointer to a vector of pointers to hash_entrys, and the size of the
1671 + vector. A hash_entry contains a union of all the info we like to
1672 + store in hash table. If there is a hash collision, hash_entries
1673 + with the same hash are kept in a chain. */
1675 +/* What the data in a hash_entry means. */
1677 + hash_integer, /* Name->integer mapping. */
1678 + hash_string, /* Name->string mapping. */
1679 + hash_macro, /* Name is a macro. */
1680 + hash_formal /* Name is a formal argument. */
1683 +typedef struct hs {
1684 + sb key; /* Symbol name. */
1685 + hash_type type; /* Symbol meaning. */
1689 + struct macro_struct *m;
1690 + struct formal_struct *f;
1692 + struct hs *next; /* Next hash_entry with same hash key. */
1696 + hash_entry **table;
1700 +/* How we nest files and expand macros etc.
1702 + We keep a stack of of include_stack structs. Each include file
1703 + pushes a new level onto the stack. We keep an sb with a pushback
1704 + too. unget chars are pushed onto the pushback sb, getchars first
1705 + checks the pushback sb before reading from the input stream.
1707 + Small things are expanded by adding the text of the item onto the
1708 + pushback sb. Larger items are grown by pushing a new level and
1709 + allocating the entire pushback buf for the item. Each time
1710 + something like a macro is expanded, the stack index is changed. We
1711 + can then perform an exitm by popping all entries off the stack with
1712 + the same stack index. If we're being reasonable, we can detect
1713 + recusive expansion by checking the index is reasonably small. */
1716 + include_file, include_repeat, include_while, include_macro
1719 +struct include_stack {
1720 + sb pushback; /* Current pushback stream. */
1721 + int pushback_index; /* Next char to read from stream. */
1722 + FILE *handle; /* Open file. */
1723 + sb name; /* Name of file. */
1724 + int linecount; /* Number of lines read so far. */
1725 + include_type type;
1726 + int index; /* Index of this layer. */
1727 +} include_stack[MAX_INCLUDES];
1729 +struct include_stack *sp;
1730 +#define isp (sp - include_stack)
1732 +/* Include file list. */
1734 +typedef struct include_path {
1735 + struct include_path *next;
1739 +include_path *paths_head;
1740 +include_path *paths_tail;
1742 +static void quit PARAMS ((void));
1743 +static void hash_new_table PARAMS ((int, hash_table *));
1744 +static int hash PARAMS ((sb *));
1745 +static hash_entry *hash_create PARAMS ((hash_table *, sb *));
1746 +static void hash_add_to_string_table PARAMS ((hash_table *, sb *, sb *, int));
1747 +static void hash_add_to_int_table PARAMS ((hash_table *, sb *, int));
1748 +static hash_entry *hash_lookup PARAMS ((hash_table *, sb *));
1749 +static void checkconst PARAMS ((int, exp_t *));
1750 +static int is_flonum PARAMS ((int, sb *));
1751 +static int chew_flonum PARAMS ((int, sb *, sb *));
1752 +static int sb_strtol PARAMS ((int, sb *, int, int *));
1753 +static int level_0 PARAMS ((int, sb *, exp_t *));
1754 +static int level_1 PARAMS ((int, sb *, exp_t *));
1755 +static int level_2 PARAMS ((int, sb *, exp_t *));
1756 +static int level_3 PARAMS ((int, sb *, exp_t *));
1757 +static int level_4 PARAMS ((int, sb *, exp_t *));
1758 +static int level_5 PARAMS ((int, sb *, exp_t *));
1759 +static int exp_parse PARAMS ((int, sb *, exp_t *));
1760 +static void exp_string PARAMS ((exp_t *, sb *));
1761 +static int exp_get_abs PARAMS ((const char *, int, sb *, int *));
1763 +static void strip_comments PARAMS ((sb *));
1765 +static void unget PARAMS ((int));
1766 +static void include_buf PARAMS ((sb *, sb *, include_type, int));
1767 +static void include_print_where_line PARAMS ((FILE *));
1768 +static void include_print_line PARAMS ((FILE *));
1769 +static int get_line PARAMS ((sb *));
1770 +static int grab_label PARAMS ((sb *, sb *));
1771 +static void change_base PARAMS ((int, sb *, sb *));
1772 +static void do_end PARAMS ((sb *));
1773 +static void do_assign PARAMS ((int, int, sb *));
1774 +static void do_radix PARAMS ((sb *));
1775 +static int get_opsize PARAMS ((int, sb *, int *));
1776 +static int eol PARAMS ((int, sb *));
1777 +static void do_data PARAMS ((int, sb *, int));
1778 +static void do_datab PARAMS ((int, sb *));
1779 +static void do_align PARAMS ((int, sb *));
1780 +static void do_res PARAMS ((int, sb *, int));
1781 +static void do_export PARAMS ((sb *));
1782 +static void do_print PARAMS ((int, sb *));
1783 +static void do_heading PARAMS ((int, sb *));
1784 +static void do_page PARAMS ((void));
1785 +static void do_form PARAMS ((int, sb *));
1786 +static int get_any_string PARAMS ((int, sb *, sb *, int, int));
1787 +static int skip_openp PARAMS ((int, sb *));
1788 +static int skip_closep PARAMS ((int, sb *));
1789 +static int dolen PARAMS ((int, sb *, sb *));
1790 +static int doinstr PARAMS ((int, sb *, sb *));
1791 +static int dosubstr PARAMS ((int, sb *, sb *));
1792 +static void process_assigns PARAMS ((int, sb *, sb *));
1793 +static int get_and_process PARAMS ((int, sb *, sb *));
1794 +static void process_file PARAMS ((void));
1795 +static void free_old_entry PARAMS ((hash_entry *));
1796 +static void do_assigna PARAMS ((int, sb *));
1797 +static void do_assignc PARAMS ((int, sb *));
1798 +static void do_reg PARAMS ((int, sb *));
1799 +static int condass_lookup_name PARAMS ((sb *, int, sb *, int));
1800 +static int whatcond PARAMS ((int, sb *, int *));
1801 +static int istrue PARAMS ((int, sb *));
1802 +static void do_aif PARAMS ((int, sb *));
1803 +static void do_aelse PARAMS ((void));
1804 +static void do_aendi PARAMS ((void));
1805 +static int condass_on PARAMS ((void));
1806 +static void do_if PARAMS ((int, sb *, int));
1807 +static int get_mri_string PARAMS ((int, sb *, sb *, int));
1808 +static void do_ifc PARAMS ((int, sb *, int));
1809 +static void do_aendr PARAMS ((void));
1810 +static void do_awhile PARAMS ((int, sb *));
1811 +static void do_aendw PARAMS ((void));
1812 +static void do_exitm PARAMS ((void));
1813 +static void do_arepeat PARAMS ((int, sb *));
1814 +static void do_endm PARAMS ((void));
1815 +static void do_irp PARAMS ((int, sb *, int));
1816 +static void do_local PARAMS ((int, sb *));
1817 +static void do_macro PARAMS ((int, sb *));
1818 +static int macro_op PARAMS ((int, sb *));
1819 +static int getstring PARAMS ((int, sb *, sb *));
1820 +static void do_sdata PARAMS ((int, sb *, int));
1821 +static void do_sdatab PARAMS ((int, sb *));
1822 +static int new_file PARAMS ((const char *));
1823 +static void do_include PARAMS ((int, sb *));
1824 +static void include_pop PARAMS ((void));
1825 +static int get PARAMS ((void));
1826 +static int linecount PARAMS ((void));
1827 +static int include_next_index PARAMS ((void));
1828 +static void chartype_init PARAMS ((void));
1829 +static int process_pseudo_op PARAMS ((int, sb *, sb *));
1830 +static void add_keyword PARAMS ((const char *, int));
1831 +static void process_init PARAMS ((void));
1832 +static void do_define PARAMS ((const char *));
1833 +static void show_usage PARAMS ((FILE *, int));
1834 +static void show_help PARAMS ((void));
1839 + include_print_where_line (stderr); \
1849 + include_print_where_line (stderr); \
1855 +#define WARNING(x) \
1858 + include_print_where_line (stderr); \
1864 +/* Exit the program and return the right ERROR code. */
1870 + if (fatals + errors)
1878 + for (i = 0; i < sb_max_power_two; i++)
1880 + fprintf (stderr, "strings size %8d : %d\n",
1881 + 1 << i, string_count[i]);
1887 +/* Hash table maintenance. */
1889 +/* Build a new hash table with size buckets
1890 + and fill in the info at ptr. */
1893 +hash_new_table (size, ptr)
1899 + ptr->table = (hash_entry **) xmalloc (size * (sizeof (hash_entry *)));
1900 + /* Fill with null-pointer, not zero-bit-pattern. */
1901 + for (i = 0; i < size; i++)
1902 + ptr->table[i] = 0;
1905 +/* Calculate and return the hash value of the sb at key. */
1913 + char *p = key->ptr;
1914 + for (i = 0; i < key->len; i++)
1916 + k ^= (k << 2) ^ *p;
1919 + return k & 0xf0fff;
1922 +/* Look up key in hash_table tab. If present, then return it,
1923 + otherwise build a new one and fill it with hash_integer. */
1925 +static hash_entry *
1926 +hash_create (tab, key)
1930 + int k = hash (key) % tab->size;
1932 + hash_entry **table = tab->table;
1940 + hash_entry *n = (hash_entry *) xmalloc (sizeof (hash_entry));
1941 + n->next = table[k];
1943 + sb_add_sb (&n->key, key);
1945 + n->type = hash_integer;
1948 + if (strncmp (table[k]->key.ptr, key->ptr, key->len) == 0)
1956 +/* Add sb name with key into hash_table tab.
1957 + If replacing old value and again, then ERROR. */
1960 +hash_add_to_string_table (tab, key, name, again)
1966 + hash_entry *ptr = hash_create (tab, key);
1967 + if (ptr->type == hash_integer)
1969 + sb_new (&ptr->value.s);
1971 + if (ptr->value.s.len)
1974 + ERROR ((stderr, _("redefinition not allowed\n")));
1977 + ptr->type = hash_string;
1978 + sb_reset (&ptr->value.s);
1980 + sb_add_sb (&ptr->value.s, name);
1983 +/* Add integer name to hash_table tab with sb key. */
1986 +hash_add_to_int_table (tab, key, name)
1991 + hash_entry *ptr = hash_create (tab, key);
1992 + ptr->value.i = name;
1995 +/* Look up sb key in hash_table tab.
1996 + If found, return hash_entry result, else 0. */
1998 +static hash_entry *
1999 +hash_lookup (tab, key)
2003 + int k = hash (key) % tab->size;
2004 + hash_entry **table = tab->table;
2005 + hash_entry *p = table[k];
2008 + if (p->key.len == key->len
2009 + && strncmp (p->key.ptr, key->ptr, key->len) == 0)
2018 + are handled in a really simple recursive decent way. each bit of
2019 + the machine takes an index into an sb and a pointer to an exp_t,
2020 + modifies the *exp_t and returns the index of the first character
2021 + past the part of the expression parsed.
2023 + expression precedence:
2032 +/* Make sure that the exp_t at term is constant.
2033 + If not the give the op ERROR. */
2036 +checkconst (op, term)
2040 + if (term->add_symbol.len
2041 + || term->sub_symbol.len)
2043 + ERROR ((stderr, _("the %c operator cannot take non-absolute arguments.\n"), op));
2047 +/* Chew the flonum from the string starting at idx. Adjust idx to
2048 + point to the next character after the flonum. */
2051 +chew_flonum (idx, string, out)
2060 + /* Duplicate and null terminate `string'. */
2062 + sb_add_sb (&buf, string);
2063 + sb_add_char (&buf, '\0');
2065 + if (regcomp (®, "([0-9]*\\.[0-9]+([eE][+-]?[0-9]+)?)", REG_EXTENDED) != 0)
2067 + if (regexec (®, &buf.ptr[idx], 1, &match, 0) != 0)
2070 + /* Copy the match to the output. */
2071 + assert (match.rm_eo >= match.rm_so);
2072 + sb_add_buffer (out, &buf.ptr[idx], match.rm_eo - match.rm_so);
2076 + idx += match.rm_eo;
2081 +is_flonum (idx, string)
2089 + /* Duplicate and null terminate `string'. */
2091 + sb_add_sb (&buf, string);
2092 + sb_add_char (&buf, '\0');
2094 + if (regcomp (®, "^[0-9]*\\.[0-9]+([eE][+-]?[0-9]+)?", REG_EXTENDED) != 0)
2097 + rc = regexec (®, &buf.ptr[idx], 0, NULL, 0);
2103 +/* Turn the number in string at idx into a number of base, fill in
2104 + ptr, and return the index of the first character not in the number. */
2107 +sb_strtol (idx, string, base, ptr)
2114 + idx = sb_skip_white (idx, string);
2116 + while (idx < string->len)
2118 + int ch = string->ptr[idx];
2122 + else if (ch >= 'a' && ch <= 'f')
2123 + dig = ch - 'a' + 10;
2124 + else if (ch >= 'A' && ch <= 'F')
2125 + dig = ch - 'A' + 10;
2132 + value = value * base + dig;
2140 +level_0 (idx, string, lhs)
2145 + lhs->add_symbol.len = 0;
2146 + lhs->add_symbol.name = 0;
2148 + lhs->sub_symbol.len = 0;
2149 + lhs->sub_symbol.name = 0;
2151 + idx = sb_skip_white (idx, string);
2155 + if (ISDIGIT (string->ptr[idx]))
2157 + idx = sb_strtol (idx, string, 10, &lhs->value);
2159 + else if (ISFIRSTCHAR (string->ptr[idx]))
2162 + lhs->add_symbol.name = string->ptr + idx;
2163 + while (idx < string->len && ISNEXTCHAR (string->ptr[idx]))
2168 + lhs->add_symbol.len = len;
2170 + else if (string->ptr[idx] == '"')
2174 + ERROR ((stderr, _("string where expression expected.\n")));
2175 + idx = getstring (idx, string, &acc);
2180 + ERROR ((stderr, _("can't find primary in expression.\n")));
2183 + return sb_skip_white (idx, string);
2187 +level_1 (idx, string, lhs)
2192 + idx = sb_skip_white (idx, string);
2194 + switch (string->ptr[idx])
2197 + idx = level_1 (idx + 1, string, lhs);
2200 + idx = level_1 (idx + 1, string, lhs);
2201 + checkconst ('~', lhs);
2202 + lhs->value = ~lhs->value;
2207 + idx = level_1 (idx + 1, string, lhs);
2208 + lhs->value = -lhs->value;
2209 + t = lhs->add_symbol;
2210 + lhs->add_symbol = lhs->sub_symbol;
2211 + lhs->sub_symbol = t;
2216 + idx = level_5 (sb_skip_white (idx, string), string, lhs);
2217 + if (string->ptr[idx] != ')')
2218 + ERROR ((stderr, _("misplaced closing parens.\n")));
2223 + idx = level_0 (idx, string, lhs);
2226 + return sb_skip_white (idx, string);
2230 +level_2 (idx, string, lhs)
2237 + idx = level_1 (idx, string, lhs);
2239 + while (idx < string->len && (string->ptr[idx] == '*'
2240 + || string->ptr[idx] == '/'))
2242 + char op = string->ptr[idx++];
2243 + idx = level_1 (idx, string, &rhs);
2247 + checkconst ('*', lhs);
2248 + checkconst ('*', &rhs);
2249 + lhs->value *= rhs.value;
2252 + checkconst ('/', lhs);
2253 + checkconst ('/', &rhs);
2254 + if (rhs.value == 0)
2255 + ERROR ((stderr, _("attempt to divide by zero.\n")));
2257 + lhs->value /= rhs.value;
2261 + return sb_skip_white (idx, string);
2265 +level_3 (idx, string, lhs)
2272 + idx = level_2 (idx, string, lhs);
2274 + while (idx < string->len
2275 + && (string->ptr[idx] == '+'
2276 + || string->ptr[idx] == '-'))
2278 + char op = string->ptr[idx++];
2279 + idx = level_2 (idx, string, &rhs);
2283 + lhs->value += rhs.value;
2284 + if (lhs->add_symbol.name && rhs.add_symbol.name)
2286 + ERROR ((stderr, _("can't add two relocatable expressions\n")));
2288 + /* Change nn+symbol to symbol + nn. */
2289 + if (rhs.add_symbol.name)
2291 + lhs->add_symbol = rhs.add_symbol;
2295 + lhs->value -= rhs.value;
2296 + lhs->sub_symbol = rhs.add_symbol;
2300 + return sb_skip_white (idx, string);
2304 +level_4 (idx, string, lhs)
2311 + idx = level_3 (idx, string, lhs);
2313 + while (idx < string->len &&
2314 + string->ptr[idx] == '&')
2316 + char op = string->ptr[idx++];
2317 + idx = level_3 (idx, string, &rhs);
2321 + checkconst ('&', lhs);
2322 + checkconst ('&', &rhs);
2323 + lhs->value &= rhs.value;
2327 + return sb_skip_white (idx, string);
2331 +level_5 (idx, string, lhs)
2338 + idx = level_4 (idx, string, lhs);
2340 + while (idx < string->len
2341 + && (string->ptr[idx] == '|' || string->ptr[idx] == '~'))
2343 + char op = string->ptr[idx++];
2344 + idx = level_4 (idx, string, &rhs);
2348 + checkconst ('|', lhs);
2349 + checkconst ('|', &rhs);
2350 + lhs->value |= rhs.value;
2353 + checkconst ('~', lhs);
2354 + checkconst ('~', &rhs);
2355 + lhs->value ^= rhs.value;
2359 + return sb_skip_white (idx, string);
2362 +/* Parse the expression at offset idx into string, fill up res with
2363 + the result. Return the index of the first char past the
2367 +exp_parse (idx, string, res)
2372 + return level_5 (sb_skip_white (idx, string), string, res);
2375 +/* Turn the expression at exp into text and glue it onto the end of
2379 +exp_string (exp, string)
2385 + sb_reset (string);
2387 + if (exp->add_symbol.len)
2389 + sb_add_buffer (string, exp->add_symbol.name, exp->add_symbol.len);
2397 + sb_add_char (string, '+');
2398 + sprintf (buf, "%d", exp->value);
2399 + sb_add_string (string, buf);
2403 + if (exp->sub_symbol.len)
2405 + sb_add_char (string, '-');
2406 + sb_add_buffer (string, exp->add_symbol.name, exp->add_symbol.len);
2412 + sb_add_char (string, '0');
2415 +/* Parse the expression at offset idx into sb in. Return the value in
2416 + val. If the expression is not constant, give ERROR emsg. Return
2417 + the index of the first character past the end of the expression. */
2420 +exp_get_abs (emsg, idx, in, val)
2427 + idx = exp_parse (idx, in, &res);
2428 + if (res.add_symbol.len || res.sub_symbol.len)
2429 + ERROR ((stderr, "%s", emsg));
2434 +/* Current label parsed from line. */
2437 +/* Hash table for all assigned variables. */
2438 +hash_table assign_hash_table;
2440 +/* Hash table for keyword. */
2441 +hash_table keyword_hash_table;
2443 +/* Hash table for eq variables. */
2446 +#define in_comment ';'
2450 +strip_comments (out)
2453 + char *s = out->ptr;
2455 + for (i = 0; i < out->len; i++)
2457 + if (ISCOMMENTCHAR (s[i]))
2466 +/* Push back character ch so that it can be read again. */
2476 + if (sp->pushback_index)
2477 + sp->pushback_index--;
2479 + sb_add_char (&sp->pushback, ch);
2482 +/* Push the sb ptr onto the include stack, with the given name, type
2486 +include_buf (name, ptr, type, index)
2489 + include_type type;
2493 + if (sp - include_stack >= MAX_INCLUDES)
2494 + FATAL ((stderr, _("unreasonable nesting.\n")));
2495 + sb_new (&sp->name);
2496 + sb_add_sb (&sp->name, name);
2498 + sp->linecount = 1;
2499 + sp->pushback_index = 0;
2501 + sp->index = index;
2502 + sb_new (&sp->pushback);
2503 + sb_add_sb (&sp->pushback, ptr);
2506 +/* Used in ERROR messages, print info on where the include stack is
2510 +include_print_where_line (file)
2513 + struct include_stack *p = include_stack + 1;
2517 + fprintf (file, "%s:%d ", sb_name (&p->name), p->linecount - 1);
2522 +/* Used in listings, print the line number onto file. */
2525 +include_print_line (file)
2529 + struct include_stack *p = include_stack + 1;
2531 + n = fprintf (file, "%4d", p->linecount);
2535 + n += fprintf (file, ".%d", p->linecount);
2540 + fprintf (file, " ");
2545 +/* Read a line from the top of the include stack into sb in. */
2552 + int more = 1, ch = 0;
2556 + putc (comment_char, outfile);
2557 + if (print_line_number)
2558 + include_print_line (outfile);
2565 + while (ch == '\r')
2572 + WARNING ((stderr, _("End of file not at start of line.\n")));
2574 + putc ('\n', outfile);
2584 + putc (ch, outfile);
2593 + /* Continued line. */
2596 + putc (comment_char, outfile);
2597 + putc ('+', outfile);
2610 + sb_add_char (in, ch);
2615 + return more ? ch : 0;
2618 +/* Find a label from sb in and put it in out. */
2621 +grab_label (in, out)
2627 + if (ISFIRSTCHAR (in->ptr[i]) || in->ptr[i] == '\\')
2629 + sb_add_char (out, in->ptr[i]);
2631 + while ((ISNEXTCHAR (in->ptr[i])
2632 + || in->ptr[i] == '\\'
2633 + || in->ptr[i] == '&')
2636 + sb_add_char (out, in->ptr[i]);
2643 +/* Find all strange base stuff and turn into decimal. Also
2644 + find all the other numbers and convert them from the default radix. */
2647 +change_base (idx, in, out)
2654 + while (idx < in->len)
2656 + if (in->ptr[idx] == '\\'
2657 + && idx + 1 < in->len
2658 + && in->ptr[idx + 1] == '(')
2661 + while (idx < in->len
2662 + && in->ptr[idx] != ')')
2664 + sb_add_char (out, in->ptr[idx]);
2667 + if (idx < in->len)
2670 + else if (idx < in->len - 1 && in->ptr[idx + 1] == '\'' && ! mri)
2674 + switch (in->ptr[idx])
2693 + ERROR ((stderr, _("Illegal base character %c.\n"), in->ptr[idx]));
2698 + idx = sb_strtol (idx + 2, in, base, &value);
2699 + sprintf (buffer, "%d", value);
2700 + sb_add_string (out, buffer);
2702 + else if (ISFIRSTCHAR (in->ptr[idx]))
2704 + /* Copy entire names through quickly. */
2705 + sb_add_char (out, in->ptr[idx]);
2707 + while (idx < in->len && ISNEXTCHAR (in->ptr[idx]))
2709 + sb_add_char (out, in->ptr[idx]);
2713 + else if (is_flonum (idx, in))
2715 + idx = chew_flonum (idx, in, out);
2717 + else if (ISDIGIT (in->ptr[idx]))
2720 + /* All numbers must start with a digit, let's chew it and
2721 + spit out decimal. */
2722 + idx = sb_strtol (idx, in, radix, &value);
2723 + sprintf (buffer, "%d", value);
2724 + sb_add_string (out, buffer);
2726 + /* Skip all undigsested letters. */
2727 + while (idx < in->len && ISNEXTCHAR (in->ptr[idx]))
2729 + sb_add_char (out, in->ptr[idx]);
2733 + else if (in->ptr[idx] == '"' || in->ptr[idx] == '\'')
2735 + char tchar = in->ptr[idx];
2736 + /* Copy entire names through quickly. */
2737 + sb_add_char (out, in->ptr[idx]);
2739 + while (idx < in->len && in->ptr[idx] != tchar)
2741 + sb_add_char (out, in->ptr[idx]);
2747 + /* Nothing special, just pass it through. */
2748 + sb_add_char (out, in->ptr[idx]);
2763 + fprintf (outfile, "%s\n", sb_name (in));
2769 +do_assign (again, idx, in)
2774 + /* Stick label in symbol table with following value. */
2779 + idx = exp_parse (idx, in, &e);
2780 + exp_string (&e, &acc);
2781 + hash_add_to_string_table (&assign_hash_table, &label, &acc, again);
2785 +/* .radix [b|q|d|h] */
2791 + int idx = sb_skip_white (0, ptr);
2792 + switch (ptr->ptr[idx])
2811 + ERROR ((stderr, _("radix is %c must be one of b, q, d or h"), radix));
2815 +/* Parse off a .b, .w or .l. */
2818 +get_opsize (idx, in, size)
2824 + if (in->ptr[idx] == '.')
2828 + switch (in->ptr[idx])
2846 + ERROR ((stderr, _("size must be one of b, w or l, is %c.\n"), in->ptr[idx]));
2859 + idx = sb_skip_white (idx, line);
2860 + if (idx < line->len
2861 + && ISCOMMENTCHAR(line->ptr[idx]))
2863 + if (idx >= line->len)
2868 +/* .data [.b|.w|.l] <data>*
2869 + or d[bwl] <data>* */
2872 +do_data (idx, in, size)
2878 + char *opname = ".yikes!";
2884 + idx = get_opsize (idx, in, &opsize);
2896 + opname = ".short";
2903 + fprintf (outfile, "%s\t", opname);
2905 + idx = sb_skip_white (idx, in);
2909 + && in->ptr[idx] == '"')
2912 + idx = getstring (idx, in, &acc);
2913 + for (i = 0; i < acc.len; i++)
2916 + fprintf (outfile, ",");
2917 + fprintf (outfile, "%d", acc.ptr[i]);
2922 + while (!eol (idx, in))
2925 + idx = exp_parse (idx, in, &e);
2926 + exp_string (&e, &acc);
2927 + sb_add_char (&acc, 0);
2928 + fprintf (outfile, "%s", acc.ptr);
2929 + if (idx < in->len && in->ptr[idx] == ',')
2931 + fprintf (outfile, ",");
2937 + sb_print_at (outfile, idx, in);
2938 + fprintf (outfile, "\n");
2941 +/* .datab [.b|.w|.l] <repeat>,<fill> */
2952 + idx = get_opsize (idx, in, &opsize);
2954 + idx = exp_get_abs (_("datab repeat must be constant.\n"), idx, in, &repeat);
2955 + idx = sb_skip_comma (idx, in);
2956 + idx = exp_get_abs (_("datab data must be absolute.\n"), idx, in, &fill);
2958 + fprintf (outfile, ".fill\t%d,%d,%d\n", repeat, opsize, fill);
2961 +/* .align <size> */
2968 + int al, have_fill, fill;
2970 + idx = exp_get_abs (_("align needs absolute expression.\n"), idx, in, &al);
2971 + idx = sb_skip_white (idx, in);
2974 + if (! eol (idx, in))
2976 + idx = sb_skip_comma (idx, in);
2977 + idx = exp_get_abs (_(".align needs absolute fill value.\n"), idx, in,
2982 + fprintf (outfile, ".align %d", al);
2984 + fprintf (outfile, ",%d", fill);
2985 + fprintf (outfile, "\n");
2988 +/* .res[.b|.w|.l] <size> */
2991 +do_res (idx, in, type)
2999 + idx = get_opsize (idx, in, &size);
3000 + while (!eol (idx, in))
3002 + idx = sb_skip_white (idx, in);
3003 + if (in->ptr[idx] == ',')
3005 + idx = exp_get_abs (_("res needs absolute expression for fill count.\n"), idx, in, &count);
3007 + if (type == 'c' || type == 'z')
3010 + fprintf (outfile, ".space %d\n", count * size);
3020 + fprintf (outfile, ".global %s\n", sb_name (in));
3023 +/* .print [list] [nolist] */
3030 + idx = sb_skip_white (idx, in);
3031 + while (idx < in->len)
3033 + if (strncasecmp (in->ptr + idx, "LIST", 4) == 0)
3035 + fprintf (outfile, ".list\n");
3038 + else if (strncasecmp (in->ptr + idx, "NOLIST", 6) == 0)
3040 + fprintf (outfile, ".nolist\n");
3050 +do_heading (idx, in)
3056 + idx = getstring (idx, in, &head);
3057 + fprintf (outfile, ".title \"%s\"\n", sb_name (&head));
3066 + fprintf (outfile, ".eject\n");
3069 +/* .form [lin=<value>] [col=<value>] */
3077 + int columns = 132;
3078 + idx = sb_skip_white (idx, in);
3080 + while (idx < in->len)
3083 + if (strncasecmp (in->ptr + idx, "LIN=", 4) == 0)
3086 + idx = exp_get_abs (_("form LIN= needs absolute expresssion.\n"), idx, in, &lines);
3089 + if (strncasecmp (in->ptr + idx, _("COL="), 4) == 0)
3092 + idx = exp_get_abs (_("form COL= needs absolute expresssion.\n"), idx, in, &columns);
3097 + fprintf (outfile, ".psize %d,%d\n", lines, columns);
3101 +/* Fetch string from the input stream,
3103 + 'Bxyx<whitespace> -> return 'Bxyza
3104 + %<char> -> return string of decimal value of x
3105 + "<string>" -> return string
3106 + xyx<whitespace> -> return xyz
3110 +get_any_string (idx, in, out, expand, pretend_quoted)
3115 + int pretend_quoted;
3118 + idx = sb_skip_white (idx, in);
3120 + if (idx < in->len)
3122 + if (in->len > 2 && in->ptr[idx + 1] == '\'' && ISBASE (in->ptr[idx]))
3124 + while (!ISSEP (in->ptr[idx]))
3125 + sb_add_char (out, in->ptr[idx++]);
3127 + else if (in->ptr[idx] == '%'
3133 + /* Turns the next expression into a string. */
3134 + /* xgettext: no-c-format */
3135 + idx = exp_get_abs (_("% operator needs absolute expression"),
3139 + sprintf (buf, "%d", val);
3140 + sb_add_string (out, buf);
3142 + else if (in->ptr[idx] == '"'
3143 + || in->ptr[idx] == '<'
3144 + || (alternate && in->ptr[idx] == '\''))
3146 + if (alternate && expand)
3148 + /* Keep the quotes. */
3149 + sb_add_char (out, '\"');
3151 + idx = getstring (idx, in, out);
3152 + sb_add_char (out, '\"');
3157 + idx = getstring (idx, in, out);
3162 + while (idx < in->len
3163 + && (in->ptr[idx] == '"'
3164 + || in->ptr[idx] == '\''
3166 + || !ISSEP (in->ptr[idx])))
3168 + if (in->ptr[idx] == '"'
3169 + || in->ptr[idx] == '\'')
3171 + char tchar = in->ptr[idx];
3172 + sb_add_char (out, in->ptr[idx++]);
3173 + while (idx < in->len
3174 + && in->ptr[idx] != tchar)
3175 + sb_add_char (out, in->ptr[idx++]);
3176 + if (idx == in->len)
3179 + sb_add_char (out, in->ptr[idx++]);
3187 +/* Skip along sb in starting at idx, suck off whitespace a ( and more
3188 + whitespace. Return the idx of the next char. */
3191 +skip_openp (idx, in)
3195 + idx = sb_skip_white (idx, in);
3196 + if (in->ptr[idx] != '(')
3197 + ERROR ((stderr, _("misplaced ( .\n")));
3198 + idx = sb_skip_white (idx + 1, in);
3202 +/* Skip along sb in starting at idx, suck off whitespace a ) and more
3203 + whitespace. Return the idx of the next char. */
3206 +skip_closep (idx, in)
3210 + idx = sb_skip_white (idx, in);
3211 + if (in->ptr[idx] != ')')
3212 + ERROR ((stderr, _("misplaced ).\n")));
3213 + idx = sb_skip_white (idx + 1, in);
3220 +dolen (idx, in, out)
3229 + sb_new (&stringout);
3230 + idx = skip_openp (idx, in);
3231 + idx = get_and_process (idx, in, &stringout);
3232 + idx = skip_closep (idx, in);
3233 + sprintf (buffer, "%d", stringout.len);
3234 + sb_add_string (out, buffer);
3236 + sb_kill (&stringout);
3243 +doinstr (idx, in, out)
3257 + idx = skip_openp (idx, in);
3258 + idx = get_and_process (idx, in, &string);
3259 + idx = sb_skip_comma (idx, in);
3260 + idx = get_and_process (idx, in, &search);
3261 + idx = sb_skip_comma (idx, in);
3262 + if (ISDIGIT (in->ptr[idx]))
3264 + idx = exp_get_abs (_(".instr needs absolute expresson.\n"), idx, in, &start);
3270 + idx = skip_closep (idx, in);
3272 + for (i = start; i < string.len; i++)
3274 + if (strncmp (string.ptr + i, search.ptr, search.len) == 0)
3280 + sprintf (buffer, "%d", res);
3281 + sb_add_string (out, buffer);
3282 + sb_kill (&string);
3283 + sb_kill (&search);
3288 +dosubstr (idx, in, out)
3298 + idx = skip_openp (idx, in);
3299 + idx = get_and_process (idx, in, &string);
3300 + idx = sb_skip_comma (idx, in);
3301 + idx = exp_get_abs (_("need absolute position.\n"), idx, in, &pos);
3302 + idx = sb_skip_comma (idx, in);
3303 + idx = exp_get_abs (_("need absolute length.\n"), idx, in, &len);
3304 + idx = skip_closep (idx, in);
3306 + if (len < 0 || pos < 0 ||
3308 + || pos + len > string.len)
3310 + sb_add_string (out, " ");
3314 + sb_add_char (out, '"');
3317 + sb_add_char (out, string.ptr[pos++]);
3320 + sb_add_char (out, '"');
3322 + sb_kill (&string);
3326 +/* Scan line, change tokens in the hash table to their replacements. */
3329 +process_assigns (idx, in, buf)
3334 + while (idx < in->len)
3337 + if (in->ptr[idx] == '\\'
3338 + && idx + 1 < in->len
3339 + && in->ptr[idx + 1] == '(')
3343 + sb_add_char (buf, in->ptr[idx]);
3346 + while (idx < in->len && in->ptr[idx - 1] != ')');
3348 + else if (in->ptr[idx] == '\\'
3349 + && idx + 1 < in->len
3350 + && in->ptr[idx + 1] == '&')
3352 + idx = condass_lookup_name (in, idx + 2, buf, 1);
3354 + else if (in->ptr[idx] == '\\'
3355 + && idx + 1 < in->len
3356 + && in->ptr[idx + 1] == '$')
3358 + idx = condass_lookup_name (in, idx + 2, buf, 0);
3360 + else if (idx + 3 < in->len
3361 + && in->ptr[idx] == '.'
3362 + && TOUPPER (in->ptr[idx + 1]) == 'L'
3363 + && TOUPPER (in->ptr[idx + 2]) == 'E'
3364 + && TOUPPER (in->ptr[idx + 3]) == 'N')
3365 + idx = dolen (idx + 4, in, buf);
3366 + else if (idx + 6 < in->len
3367 + && in->ptr[idx] == '.'
3368 + && TOUPPER (in->ptr[idx + 1]) == 'I'
3369 + && TOUPPER (in->ptr[idx + 2]) == 'N'
3370 + && TOUPPER (in->ptr[idx + 3]) == 'S'
3371 + && TOUPPER (in->ptr[idx + 4]) == 'T'
3372 + && TOUPPER (in->ptr[idx + 5]) == 'R')
3373 + idx = doinstr (idx + 6, in, buf);
3374 + else if (idx + 7 < in->len
3375 + && in->ptr[idx] == '.'
3376 + && TOUPPER (in->ptr[idx + 1]) == 'S'
3377 + && TOUPPER (in->ptr[idx + 2]) == 'U'
3378 + && TOUPPER (in->ptr[idx + 3]) == 'B'
3379 + && TOUPPER (in->ptr[idx + 4]) == 'S'
3380 + && TOUPPER (in->ptr[idx + 5]) == 'T'
3381 + && TOUPPER (in->ptr[idx + 6]) == 'R')
3382 + idx = dosubstr (idx + 7, in, buf);
3383 + else if (ISFIRSTCHAR (in->ptr[idx]))
3385 + /* May be a simple name subsitution, see if we have a word. */
3387 + int cur = idx + 1;
3388 + while (cur < in->len
3389 + && (ISNEXTCHAR (in->ptr[cur])))
3393 + sb_add_buffer (&acc, in->ptr + idx, cur - idx);
3394 + ptr = hash_lookup (&assign_hash_table, &acc);
3397 + /* Found a definition for it. */
3398 + sb_add_sb (buf, &ptr->value.s);
3402 + /* No definition, just copy the word. */
3403 + sb_add_sb (buf, &acc);
3410 + sb_add_char (buf, in->ptr[idx++]);
3416 +get_and_process (idx, in, out)
3423 + idx = get_any_string (idx, in, &t, 1, 0);
3424 + process_assigns (0, &t, out);
3442 + sb_new (&label_in);
3444 + more = get_line (&line);
3447 + /* Find any label and pseudo op that we're intested in. */
3449 + if (line.len == 0)
3451 + if (condass_on ())
3452 + fprintf (outfile, "\n");
3455 + && (line.ptr[0] == '*'
3456 + || line.ptr[0] == '!'))
3458 + /* MRI line comment. */
3459 + fprintf (outfile, "%s", sb_name (&line));
3463 + l = grab_label (&line, &label_in);
3464 + sb_reset (&label);
3466 + if (line.ptr[l] == ':')
3468 + while (ISWHITE (line.ptr[l]) && l < line.len)
3475 + /* Munge the label, unless this is EQU or ASSIGN. */
3478 + && (line.ptr[l] == '.' || alternate || mri))
3482 + if (line.ptr[lx] == '.')
3484 + if (lx + 3 <= line.len
3485 + && strncasecmp ("EQU", line.ptr + lx, 3) == 0
3486 + && (lx + 3 == line.len
3487 + || ! ISFIRSTCHAR (line.ptr[lx + 3])))
3489 + else if (lx + 6 <= line.len
3490 + && strncasecmp ("ASSIGN", line.ptr + lx, 6) == 0
3491 + && (lx + 6 == line.len
3492 + || ! ISFIRSTCHAR (line.ptr[lx + 6])))
3497 + process_assigns (0, &label_in, &label);
3499 + sb_add_sb (&label, &label_in);
3504 + if (process_pseudo_op (l, &line, &acc))
3508 + else if (condass_on ())
3510 + if (macro_op (l, &line))
3519 + fprintf (outfile, "%s:\t", sb_name (&label));
3522 + fprintf (outfile, "\t");
3524 + process_assigns (l, &line, &t1);
3526 + change_base (0, &t1, &t2);
3527 + fprintf (outfile, "%s\n", sb_name (&t2));
3534 + /* Only a label on this line. */
3535 + if (label.len && condass_on ())
3537 + fprintf (outfile, "%s:\n", sb_name (&label));
3545 + more = get_line (&line);
3548 + if (!had_end && !mri)
3549 + WARNING ((stderr, _("END missing from end of file.\n")));
3553 +free_old_entry (ptr)
3558 + if (ptr->type == hash_string)
3559 + sb_kill (&ptr->value.s);
3563 +/* name: .ASSIGNA <value> */
3566 +do_assigna (idx, in)
3574 + process_assigns (idx, in, &tmp);
3575 + idx = exp_get_abs (_(".ASSIGNA needs constant expression argument.\n"), 0, &tmp, &val);
3579 + ERROR ((stderr, _(".ASSIGNA without label.\n")));
3583 + hash_entry *ptr = hash_create (&vars, &label);
3584 + free_old_entry (ptr);
3585 + ptr->type = hash_integer;
3586 + ptr->value.i = val;
3591 +/* name: .ASSIGNC <string> */
3594 +do_assignc (idx, in)
3600 + idx = getstring (idx, in, &acc);
3604 + ERROR ((stderr, _(".ASSIGNS without label.\n")));
3608 + hash_entry *ptr = hash_create (&vars, &label);
3609 + free_old_entry (ptr);
3610 + ptr->type = hash_string;
3611 + sb_new (&ptr->value.s);
3612 + sb_add_sb (&ptr->value.s, &acc);
3617 +/* name: .REG (reg) */
3624 + /* Remove reg stuff from inside parens. */
3627 + idx = skip_openp (idx, in);
3629 + idx = sb_skip_white (idx, in);
3631 + while (idx < in->len
3634 + : in->ptr[idx] != ')'))
3636 + sb_add_char (&what, in->ptr[idx]);
3639 + hash_add_to_string_table (&assign_hash_table, &label, &what, 1);
3644 +condass_lookup_name (inbuf, idx, out, warn)
3652 + sb_new (&condass_acc);
3654 + while (idx < inbuf->len
3655 + && ISNEXTCHAR (inbuf->ptr[idx]))
3657 + sb_add_char (&condass_acc, inbuf->ptr[idx++]);
3660 + if (inbuf->ptr[idx] == '\'')
3662 + ptr = hash_lookup (&vars, &condass_acc);
3668 + WARNING ((stderr, _("Can't find preprocessor variable %s.\n"), sb_name (&condass_acc)));
3672 + sb_add_string (out, "0");
3677 + if (ptr->type == hash_integer)
3680 + sprintf (buffer, "%d", ptr->value.i);
3681 + sb_add_string (out, buffer);
3685 + sb_add_sb (out, &ptr->value.s);
3688 + sb_kill (&condass_acc);
3701 +whatcond (idx, in, val)
3708 + idx = sb_skip_white (idx, in);
3710 + if (idx + 1 < in->len)
3715 + p = in->ptr + idx;
3716 + a = TOUPPER (p[0]);
3717 + b = TOUPPER (p[1]);
3718 + if (a == 'E' && b == 'Q')
3720 + else if (a == 'N' && b == 'E')
3722 + else if (a == 'L' && b == 'T')
3724 + else if (a == 'L' && b == 'E')
3726 + else if (a == 'G' && b == 'T')
3728 + else if (a == 'G' && b == 'E')
3731 + if (cond == NEVER)
3733 + ERROR ((stderr, _("Comparison operator must be one of EQ, NE, LT, LE, GT or GE.\n")));
3736 + idx = sb_skip_white (idx + 2, in);
3753 + idx = sb_skip_white (idx, in);
3755 + if (in->ptr[idx] == '"')
3759 + /* This is a string comparision. */
3760 + idx = getstring (idx, in, &acc_a);
3761 + idx = whatcond (idx, in, &cond);
3762 + idx = getstring (idx, in, &acc_b);
3763 + same = acc_a.len == acc_b.len
3764 + && (strncmp (acc_a.ptr, acc_b.ptr, acc_a.len) == 0);
3766 + if (cond != EQ && cond != NE)
3768 + ERROR ((stderr, _("Comparison operator for strings must be EQ or NE\n")));
3772 + res = (cond != EQ) ^ same;
3775 + /* This is a numeric expression. */
3780 + idx = exp_get_abs (_("Conditional operator must have absolute operands.\n"), idx, in, &vala);
3781 + idx = whatcond (idx, in, &cond);
3782 + idx = sb_skip_white (idx, in);
3783 + if (in->ptr[idx] == '"')
3785 + WARNING ((stderr, _("String compared against expression.\n")));
3790 + idx = exp_get_abs (_("Conditional operator must have absolute operands.\n"), idx, in, &valb);
3797 + res = vala == valb;
3800 + res = vala != valb;
3803 + res = vala < valb;
3806 + res = vala <= valb;
3809 + res = vala > valb;
3812 + res = vala >= valb;
3834 + if (ifi >= IFNESTING)
3836 + FATAL ((stderr, _("AIF nesting unreasonable.\n")));
3839 + ifstack[ifi].on = ifstack[ifi - 1].on ? istrue (idx, in) : 0;
3840 + ifstack[ifi].hadelse = 0;
3848 + ifstack[ifi].on = ifstack[ifi - 1].on ? !ifstack[ifi].on : 0;
3849 + if (ifstack[ifi].hadelse)
3851 + ERROR ((stderr, _("Multiple AELSEs in AIF.\n")));
3853 + ifstack[ifi].hadelse = 1;
3867 + ERROR ((stderr, _("AENDI without AIF.\n")));
3874 + return ifstack[ifi].on;
3877 +/* MRI IFEQ, IFNE, IFLT, IFLE, IFGE, IFGT. */
3880 +do_if (idx, in, cond)
3888 + if (ifi >= IFNESTING)
3890 + FATAL ((stderr, _("IF nesting unreasonable.\n")));
3893 + idx = exp_get_abs (_("Conditional operator must have absolute operands.\n"),
3898 + case EQ: res = val == 0; break;
3899 + case NE: res = val != 0; break;
3900 + case LT: res = val < 0; break;
3901 + case LE: res = val <= 0; break;
3902 + case GE: res = val >= 0; break;
3903 + case GT: res = val > 0; break;
3907 + ifstack[ifi].on = ifstack[ifi - 1].on ? res : 0;
3908 + ifstack[ifi].hadelse = 0;
3911 +/* Get a string for the MRI IFC or IFNC pseudo-ops. */
3914 +get_mri_string (idx, in, val, terminator)
3920 + idx = sb_skip_white (idx, in);
3923 + && in->ptr[idx] == '\'')
3925 + sb_add_char (val, '\'');
3926 + for (++idx; idx < in->len; ++idx)
3928 + sb_add_char (val, in->ptr[idx]);
3929 + if (in->ptr[idx] == '\'')
3932 + if (idx >= in->len
3933 + || in->ptr[idx] != '\'')
3937 + idx = sb_skip_white (idx, in);
3943 + while (idx < in->len
3944 + && in->ptr[idx] != terminator)
3946 + sb_add_char (val, in->ptr[idx]);
3950 + while (i >= 0 && ISWHITE (val->ptr[i]))
3958 +/* MRI IFC, IFNC */
3961 +do_ifc (idx, in, ifnc)
3970 + if (ifi >= IFNESTING)
3972 + FATAL ((stderr, _("IF nesting unreasonable.\n")));
3978 + idx = get_mri_string (idx, in, &first, ',');
3980 + if (idx >= in->len || in->ptr[idx] != ',')
3982 + ERROR ((stderr, _("Bad format for IF or IFNC.\n")));
3986 + idx = get_mri_string (idx + 1, in, &second, ';');
3988 + res = (first.len == second.len
3989 + && strncmp (first.ptr, second.ptr, first.len) == 0);
3993 + ifstack[ifi].on = ifstack[ifi - 1].on ? res : 0;
3994 + ifstack[ifi].hadelse = 0;
4003 + ERROR ((stderr, _("AENDR without a AREPEAT.\n")));
4005 + ERROR ((stderr, _("ENDR without a REPT.\n")));
4011 +do_awhile (idx, in)
4015 + int line = linecount ();
4023 + process_assigns (idx, in, &exp);
4024 + doit = istrue (0, &exp);
4026 + if (! buffer_and_nest ("AWHILE", "AENDW", &sub, get_line))
4027 + FATAL ((stderr, _("AWHILE without a AENDW at %d.\n"), line - 1));
4042 + int index = include_next_index ();
4046 + sb_add_sb (©, &sub);
4047 + sb_add_sb (©, in);
4048 + sb_add_string (©, "\n");
4049 + sb_add_sb (©, &sub);
4050 + sb_add_string (©, "\t.AENDW\n");
4051 + /* Push another WHILE. */
4052 + include_buf (&exp, ©, include_while, index);
4064 + ERROR ((stderr, _("AENDW without a AENDW.\n")));
4069 + Pop things off the include stack until the type and index changes. */
4074 + include_type type = sp->type;
4075 + if (type == include_repeat
4076 + || type == include_while
4077 + || type == include_macro)
4079 + int index = sp->index;
4081 + while (sp->index == index
4082 + && sp->type == type)
4092 +do_arepeat (idx, in)
4096 + int line = linecount ();
4097 + sb exp; /* Buffer with expression in it. */
4098 + sb copy; /* Expanded repeat block. */
4099 + sb sub; /* Contents of AREPEAT. */
4107 + process_assigns (idx, in, &exp);
4108 + idx = exp_get_abs (_("AREPEAT must have absolute operand.\n"), 0, &exp, &rc);
4110 + ret = buffer_and_nest ("AREPEAT", "AENDR", &sub, get_line);
4112 + ret = buffer_and_nest ("REPT", "ENDR", &sub, get_line);
4114 + FATAL ((stderr, _("AREPEAT without a AENDR at %d.\n"), line - 1));
4117 + /* Push back the text following the repeat, and another repeat block
4128 + int index = include_next_index ();
4129 + sb_add_sb (©, &sub);
4133 + sprintf (buffer, "\t.AREPEAT %d\n", rc - 1);
4135 + sprintf (buffer, "\tREPT %d\n", rc - 1);
4136 + sb_add_string (©, buffer);
4137 + sb_add_sb (©, &sub);
4139 + sb_add_string (©, " .AENDR\n");
4141 + sb_add_string (©, " ENDR\n");
4144 + include_buf (&exp, ©, include_repeat, index);
4156 + ERROR ((stderr, _(".ENDM without a matching .MACRO.\n")));
4159 +/* MRI IRP pseudo-op. */
4162 +do_irp (idx, in, irpc)
4172 + err = expand_irp (irpc, idx, in, &out, get_line, comment_char);
4174 + ERROR ((stderr, "%s\n", err));
4176 + fprintf (outfile, "%s", sb_terminate (&out));
4181 +/* Macro processing. */
4183 +/* Parse off LOCAL n1, n2,... Invent a label name for it. */
4186 +do_local (idx, line)
4187 + int idx ATTRIBUTE_UNUSED;
4188 + sb *line ATTRIBUTE_UNUSED;
4190 + ERROR ((stderr, _("LOCAL outside of MACRO")));
4199 + int line = linecount ();
4201 + err = define_macro (idx, in, &label, get_line, (const char **) NULL);
4203 + ERROR ((stderr, _("macro at line %d: %s\n"), line - 1, err));
4215 + if (! macro_defined)
4218 + sb_terminate (in);
4219 + if (! check_macro (in->ptr + idx, &out, comment_char, &err, NULL))
4223 + ERROR ((stderr, "%s\n", err));
4226 + sb_add_string (&name, _("macro expansion"));
4228 + include_buf (&name, &out, include_macro, include_next_index ());
4236 +/* String handling. */
4239 +getstring (idx, in, acc)
4244 + idx = sb_skip_white (idx, in);
4246 + while (idx < in->len
4247 + && (in->ptr[idx] == '"'
4248 + || in->ptr[idx] == '<'
4249 + || (in->ptr[idx] == '\'' && alternate)))
4251 + if (in->ptr[idx] == '<')
4253 + if (alternate || mri)
4257 + while ((in->ptr[idx] != '>' || nest)
4260 + if (in->ptr[idx] == '!')
4263 + sb_add_char (acc, in->ptr[idx++]);
4267 + if (in->ptr[idx] == '>')
4269 + if (in->ptr[idx] == '<')
4271 + sb_add_char (acc, in->ptr[idx++]);
4280 + idx = exp_get_abs (_("Character code in string must be absolute expression.\n"),
4282 + sb_add_char (acc, code);
4284 + if (in->ptr[idx] != '>')
4285 + ERROR ((stderr, _("Missing > for character code.\n")));
4289 + else if (in->ptr[idx] == '"' || in->ptr[idx] == '\'')
4291 + char tchar = in->ptr[idx];
4293 + while (idx < in->len)
4295 + if (alternate && in->ptr[idx] == '!')
4298 + sb_add_char (acc, in->ptr[idx++]);
4302 + if (in->ptr[idx] == tchar)
4305 + if (idx >= in->len || in->ptr[idx] != tchar)
4308 + sb_add_char (acc, in->ptr[idx]);
4318 +/* .SDATA[C|Z] <string> */
4321 +do_sdata (idx, in, type)
4330 + fprintf (outfile, ".byte\t");
4332 + while (!eol (idx, in))
4336 + idx = sb_skip_white (idx, in);
4337 + while (!eol (idx, in))
4339 + pidx = idx = get_any_string (idx, in, &acc, 0, 1);
4342 + if (acc.len > 255)
4344 + ERROR ((stderr, _("string for SDATAC longer than 255 characters (%d).\n"), acc.len));
4346 + fprintf (outfile, "%d", acc.len);
4350 + for (i = 0; i < acc.len; i++)
4354 + fprintf (outfile, ",");
4356 + fprintf (outfile, "%d", acc.ptr[i]);
4363 + fprintf (outfile, ",");
4364 + fprintf (outfile, "0");
4366 + idx = sb_skip_comma (idx, in);
4370 + if (!alternate && in->ptr[idx] != ',' && idx != in->len)
4372 + fprintf (outfile, "\n");
4373 + ERROR ((stderr, _("illegal character in SDATA line (0x%x).\n"),
4380 + fprintf (outfile, "\n");
4383 +/* .SDATAB <count> <string> */
4386 +do_sdatab (idx, in)
4395 + idx = exp_get_abs (_("Must have absolute SDATAB repeat count.\n"), idx, in, &repeat);
4398 + ERROR ((stderr, _("Must have positive SDATAB repeat count (%d).\n"), repeat));
4402 + idx = sb_skip_comma (idx, in);
4403 + idx = getstring (idx, in, &acc);
4405 + for (i = 0; i < repeat; i++)
4408 + fprintf (outfile, "\t");
4409 + fprintf (outfile, ".byte\t");
4410 + sb_print (outfile, &acc);
4411 + fprintf (outfile, "\n");
4421 + FILE *newone = fopen (name, "r");
4425 + if (isp == MAX_INCLUDES)
4426 + FATAL ((stderr, _("Unreasonable include depth (%ld).\n"), (long) isp));
4429 + sp->handle = newone;
4431 + sb_new (&sp->name);
4432 + sb_add_string (&sp->name, name);
4434 + sp->linecount = 1;
4435 + sp->pushback_index = 0;
4436 + sp->type = include_file;
4438 + sb_new (&sp->pushback);
4443 +do_include (idx, in)
4449 + include_path *includes;
4455 + idx = getstring (idx, in, &t);
4458 + idx = sb_skip_white (idx, in);
4459 + while (idx < in->len && ! ISWHITE (in->ptr[idx]))
4461 + sb_add_char (&t, in->ptr[idx]);
4466 + for (includes = paths_head; includes; includes = includes->next)
4469 + sb_add_sb (&cat, &includes->path);
4470 + sb_add_char (&cat, '/');
4471 + sb_add_sb (&cat, &t);
4472 + if (new_file (sb_name (&cat)))
4479 + if (! new_file (sb_name (&t)))
4480 + FATAL ((stderr, _("Can't open include file `%s'.\n"), sb_name (&t)));
4489 + if (sp != include_stack)
4492 + fclose (sp->handle);
4497 +/* Get the next character from the include stack. If there's anything
4498 + in the pushback buffer, take that first. If we're at eof, pop from
4499 + the stack and try again. Keep the linecount up to date. */
4506 + if (sp->pushback.len != sp->pushback_index)
4508 + r = (char) (sp->pushback.ptr[sp->pushback_index++]);
4509 + /* When they've all gone, reset the pointer. */
4510 + if (sp->pushback_index == sp->pushback.len)
4512 + sp->pushback.len = 0;
4513 + sp->pushback_index = 0;
4516 + else if (sp->handle)
4518 + r = getc (sp->handle);
4523 + if (r == EOF && isp)
4527 + while (r == EOF && isp)
4545 + return sp->linecount;
4549 +include_next_index ()
4553 + && index > MAX_REASONABLE)
4554 + FATAL ((stderr, _("Unreasonable expansion (-u turns off check).\n")));
4558 +/* Initialize the chartype vector. */
4564 + for (x = 0; x < 256; x++)
4566 + if (ISALPHA (x) || x == '_' || x == '$')
4567 + chartype[x] |= FIRSTBIT;
4569 + if (mri && x == '.')
4570 + chartype[x] |= FIRSTBIT;
4572 + if (ISDIGIT (x) || ISALPHA (x) || x == '_' || x == '$')
4573 + chartype[x] |= NEXTBIT;
4575 + if (x == ' ' || x == '\t' || x == ',' || x == '"' || x == ';'
4576 + || x == '"' || x == '<' || x == '>' || x == ')' || x == '(')
4577 + chartype[x] |= SEPBIT;
4579 + if (x == 'b' || x == 'B'
4580 + || x == 'q' || x == 'Q'
4581 + || x == 'h' || x == 'H'
4582 + || x == 'd' || x == 'D')
4583 + chartype [x] |= BASEBIT;
4585 + if (x == ' ' || x == '\t')
4586 + chartype[x] |= WHITEBIT;
4588 + if (x == comment_char)
4589 + chartype[x] |= COMMENTBIT;
4593 +/* What to do with all the keywords. */
4594 +#define PROCESS 0x1000 /* Run substitution over the line. */
4595 +#define LAB 0x2000 /* Spit out the label. */
4597 +#define K_EQU (PROCESS|1)
4598 +#define K_ASSIGN (PROCESS|2)
4599 +#define K_REG (PROCESS|3)
4600 +#define K_ORG (PROCESS|4)
4601 +#define K_RADIX (PROCESS|5)
4602 +#define K_DATA (LAB|PROCESS|6)
4603 +#define K_DATAB (LAB|PROCESS|7)
4604 +#define K_SDATA (LAB|PROCESS|8)
4605 +#define K_SDATAB (LAB|PROCESS|9)
4606 +#define K_SDATAC (LAB|PROCESS|10)
4607 +#define K_SDATAZ (LAB|PROCESS|11)
4608 +#define K_RES (LAB|PROCESS|12)
4609 +#define K_SRES (LAB|PROCESS|13)
4610 +#define K_SRESC (LAB|PROCESS|14)
4611 +#define K_SRESZ (LAB|PROCESS|15)
4612 +#define K_EXPORT (LAB|PROCESS|16)
4613 +#define K_GLOBAL (LAB|PROCESS|17)
4614 +#define K_PRINT (LAB|PROCESS|19)
4615 +#define K_FORM (LAB|PROCESS|20)
4616 +#define K_HEADING (LAB|PROCESS|21)
4617 +#define K_PAGE (LAB|PROCESS|22)
4618 +#define K_IMPORT (LAB|PROCESS|23)
4619 +#define K_PROGRAM (LAB|PROCESS|24)
4620 +#define K_END (PROCESS|25)
4621 +#define K_INCLUDE (PROCESS|26)
4622 +#define K_IGNORED (PROCESS|27)
4623 +#define K_ASSIGNA (PROCESS|28)
4624 +#define K_ASSIGNC (29)
4625 +#define K_AIF (PROCESS|30)
4626 +#define K_AELSE (PROCESS|31)
4627 +#define K_AENDI (PROCESS|32)
4628 +#define K_AREPEAT (PROCESS|33)
4629 +#define K_AENDR (PROCESS|34)
4630 +#define K_AWHILE (35)
4631 +#define K_AENDW (PROCESS|36)
4632 +#define K_EXITM (37)
4633 +#define K_MACRO (PROCESS|38)
4634 +#define K_ENDM (39)
4635 +#define K_ALIGN (PROCESS|LAB|40)
4636 +#define K_ALTERNATE (41)
4637 +#define K_DB (LAB|PROCESS|42)
4638 +#define K_DW (LAB|PROCESS|43)
4639 +#define K_DL (LAB|PROCESS|44)
4640 +#define K_LOCAL (45)
4641 +#define K_IFEQ (PROCESS|46)
4642 +#define K_IFNE (PROCESS|47)
4643 +#define K_IFLT (PROCESS|48)
4644 +#define K_IFLE (PROCESS|49)
4645 +#define K_IFGE (PROCESS|50)
4646 +#define K_IFGT (PROCESS|51)
4647 +#define K_IFC (PROCESS|52)
4648 +#define K_IFNC (PROCESS|53)
4649 +#define K_IRP (PROCESS|54)
4650 +#define K_IRPC (PROCESS|55)
4658 +static struct keyword kinfo[] = {
4659 + { "EQU", K_EQU, 0 },
4660 + { "ALTERNATE", K_ALTERNATE, 0 },
4661 + { "ASSIGN", K_ASSIGN, 0 },
4662 + { "REG", K_REG, 0 },
4663 + { "ORG", K_ORG, 0 },
4664 + { "RADIX", K_RADIX, 0 },
4665 + { "DATA", K_DATA, 0 },
4666 + { "DB", K_DB, 0 },
4667 + { "DW", K_DW, 0 },
4668 + { "DL", K_DL, 0 },
4669 + { "DATAB", K_DATAB, 0 },
4670 + { "SDATA", K_SDATA, 0 },
4671 + { "SDATAB", K_SDATAB, 0 },
4672 + { "SDATAZ", K_SDATAZ, 0 },
4673 + { "SDATAC", K_SDATAC, 0 },
4674 + { "RES", K_RES, 0 },
4675 + { "SRES", K_SRES, 0 },
4676 + { "SRESC", K_SRESC, 0 },
4677 + { "SRESZ", K_SRESZ, 0 },
4678 + { "EXPORT", K_EXPORT, 0 },
4679 + { "GLOBAL", K_GLOBAL, 0 },
4680 + { "PRINT", K_PRINT, 0 },
4681 + { "FORM", K_FORM, 0 },
4682 + { "HEADING", K_HEADING, 0 },
4683 + { "PAGE", K_PAGE, 0 },
4684 + { "PROGRAM", K_IGNORED, 0 },
4685 + { "END", K_END, 0 },
4686 + { "INCLUDE", K_INCLUDE, 0 },
4687 + { "ASSIGNA", K_ASSIGNA, 0 },
4688 + { "ASSIGNC", K_ASSIGNC, 0 },
4689 + { "AIF", K_AIF, 0 },
4690 + { "AELSE", K_AELSE, 0 },
4691 + { "AENDI", K_AENDI, 0 },
4692 + { "AREPEAT", K_AREPEAT, 0 },
4693 + { "AENDR", K_AENDR, 0 },
4694 + { "EXITM", K_EXITM, 0 },
4695 + { "MACRO", K_MACRO, 0 },
4696 + { "ENDM", K_ENDM, 0 },
4697 + { "AWHILE", K_AWHILE, 0 },
4698 + { "ALIGN", K_ALIGN, 0 },
4699 + { "AENDW", K_AENDW, 0 },
4700 + { "ALTERNATE", K_ALTERNATE, 0 },
4701 + { "LOCAL", K_LOCAL, 0 },
4705 +/* Although the conditional operators are handled by gas, we need to
4706 + handle them here as well, in case they are used in a recursive
4707 + macro to end the recursion. */
4709 +static struct keyword mrikinfo[] = {
4710 + { "IFEQ", K_IFEQ, 0 },
4711 + { "IFNE", K_IFNE, 0 },
4712 + { "IFLT", K_IFLT, 0 },
4713 + { "IFLE", K_IFLE, 0 },
4714 + { "IFGE", K_IFGE, 0 },
4715 + { "IFGT", K_IFGT, 0 },
4716 + { "IFC", K_IFC, 0 },
4717 + { "IFNC", K_IFNC, 0 },
4718 + { "ELSEC", K_AELSE, 0 },
4719 + { "ENDC", K_AENDI, 0 },
4720 + { "MEXIT", K_EXITM, 0 },
4721 + { "REPT", K_AREPEAT, 0 },
4722 + { "IRP", K_IRP, 0 },
4723 + { "IRPC", K_IRPC, 0 },
4724 + { "ENDR", K_AENDR, 0 },
4728 +/* Look for a pseudo op on the line. If one's there then call
4732 +process_pseudo_op (idx, line, acc)
4739 + if (line->ptr[idx] == '.' || alternate || mri)
4741 + /* Scan forward and find pseudo name. */
4747 + if (line->ptr[idx] == '.')
4749 + in = line->ptr + idx;
4754 + while (idx < line->len && *e && ISFIRSTCHAR (*e))
4756 + sb_add_char (acc, *e);
4761 + ptr = hash_lookup (&keyword_hash_table, acc);
4766 + /* This one causes lots of pain when trying to preprocess
4768 + WARNING ((stderr, _("Unrecognised pseudo op `%s'.\n"),
4773 + if (ptr->value.i & LAB)
4775 + /* Output the label. */
4778 + fprintf (outfile, "%s:\t", sb_name (&label));
4781 + fprintf (outfile, "\t");
4784 + if (mri && ptr->value.i == K_END)
4789 + sb_add_buffer (&t, line->ptr + oidx, idx - oidx);
4790 + fprintf (outfile, "\t%s", sb_name (&t));
4794 + if (ptr->value.i & PROCESS)
4796 + /* Polish the rest of the line before handling the pseudo op. */
4798 + strip_comments (line);
4801 + process_assigns (idx, line, acc);
4803 + change_base (0, acc, line);
4806 + if (!condass_on ())
4808 + switch (ptr->value.i)
4811 + do_aif (idx, line);
4824 + switch (ptr->value.i)
4828 + macro_init (1, mri, 0, exp_get_abs);
4837 + ERROR ((stderr, _("ORG command not allowed.\n")));
4843 + do_data (idx, line, 1);
4846 + do_data (idx, line, 2);
4849 + do_data (idx, line, 4);
4852 + do_data (idx, line, 0);
4855 + do_datab (idx, line);
4858 + do_sdata (idx, line, 0);
4861 + do_sdatab (idx, line);
4864 + do_sdata (idx, line, 'c');
4867 + do_sdata (idx, line, 'z');
4870 + do_assign (0, 0, line);
4873 + do_aif (idx, line);
4876 + do_arepeat (idx, line);
4882 + do_awhile (idx, line);
4888 + do_assign (1, idx, line);
4891 + do_align (idx, line);
4894 + do_res (idx, line, 0);
4897 + do_res (idx, line, 's');
4900 + do_include (idx, line);
4903 + do_local (idx, line);
4906 + do_macro (idx, line);
4912 + do_res (idx, line, 'c');
4915 + do_print (idx, line);
4918 + do_form (idx, line);
4921 + do_heading (idx, line);
4933 + do_res (idx, line, 'z');
4941 + do_assigna (idx, line);
4944 + do_assignc (idx, line);
4950 + do_reg (idx, line);
4953 + do_if (idx, line, EQ);
4956 + do_if (idx, line, NE);
4959 + do_if (idx, line, LT);
4962 + do_if (idx, line, LE);
4965 + do_if (idx, line, GE);
4968 + do_if (idx, line, GT);
4971 + do_ifc (idx, line, 0);
4974 + do_ifc (idx, line, 1);
4977 + do_irp (idx, line, 0);
4980 + do_irp (idx, line, 1);
4988 +/* Add a keyword to the hash table. */
4991 +add_keyword (name, code)
4999 + sb_add_string (&label, name);
5001 + hash_add_to_int_table (&keyword_hash_table, &label, code);
5003 + sb_reset (&label);
5004 + for (j = 0; name[j]; j++)
5005 + sb_add_char (&label, name[j] - 'A' + 'a');
5006 + hash_add_to_int_table (&keyword_hash_table, &label, code);
5011 +/* Build the keyword hash table - put each keyword in the table twice,
5012 + once upper and once lower case. */
5019 + for (i = 0; kinfo[i].name; i++)
5020 + add_keyword (kinfo[i].name, kinfo[i].code);
5024 + for (i = 0; mrikinfo[i].name; i++)
5025 + add_keyword (mrikinfo[i].name, mrikinfo[i].code);
5031 + const char *string;
5040 + if (*string == '=')
5047 + sb_add_char (&value, *string);
5050 + exp_get_abs (_("Invalid expression on command line.\n"),
5055 + sb_add_char (&label, *string);
5060 + ptr = hash_create (&vars, &label);
5061 + free_old_entry (ptr);
5062 + ptr->type = hash_integer;
5063 + ptr->value.i = res;
5067 +char *program_name;
5069 +/* The list of long options. */
5070 +static struct option long_options[] =
5072 + { "alternate", no_argument, 0, 'a' },
5073 + { "include", required_argument, 0, 'I' },
5074 + { "commentchar", required_argument, 0, 'c' },
5075 + { "copysource", no_argument, 0, 's' },
5076 + { "debug", no_argument, 0, 'd' },
5077 + { "help", no_argument, 0, 'h' },
5078 + { "mri", no_argument, 0, 'M' },
5079 + { "output", required_argument, 0, 'o' },
5080 + { "print", no_argument, 0, 'p' },
5081 + { "unreasonable", no_argument, 0, 'u' },
5082 + { "version", no_argument, 0, 'v' },
5083 + { "define", required_argument, 0, 'd' },
5084 + { NULL, no_argument, 0, 0 }
5087 +/* Show a usage message and exit. */
5089 +show_usage (file, status)
5093 + fprintf (file, _("\
5095 + [-a] [--alternate] enter alternate macro mode\n\
5096 + [-c char] [--commentchar char] change the comment character from !\n\
5097 + [-d] [--debug] print some debugging info\n\
5098 + [-h] [--help] print this message\n\
5099 + [-M] [--mri] enter MRI compatibility mode\n\
5100 + [-o out] [--output out] set the output file\n\
5101 + [-p] [--print] print line numbers\n"), program_name);
5102 + fprintf (file, _("\
5103 + [-s] [--copysource] copy source through as comments \n\
5104 + [-u] [--unreasonable] allow unreasonable nesting\n\
5105 + [-v] [--version] print the program version\n\
5106 + [-Dname=value] create preprocessor variable called name, with value\n\
5107 + [-Ipath] add to include path list\n\
5110 + printf (_("Report bugs to %s\n"), REPORT_BUGS_TO);
5114 +/* Display a help message and exit. */
5119 + printf (_("%s: Gnu Assembler Macro Preprocessor\n"), program_name);
5120 + show_usage (stdout, 0);
5123 +int main PARAMS ((int, char **));
5131 + char *out_name = 0;
5132 + sp = include_stack;
5134 + ifstack[0].on = 1;
5137 +#if defined (HAVE_SETLOCALE) && defined (HAVE_LC_MESSAGES)
5138 + setlocale (LC_MESSAGES, "");
5140 +#if defined (HAVE_SETLOCALE)
5141 + setlocale (LC_CTYPE, "");
5143 + bindtextdomain (PACKAGE, LOCALEDIR);
5144 + textdomain (PACKAGE);
5146 + program_name = argv[0];
5147 + xmalloc_set_program_name (program_name);
5149 + hash_new_table (101, &keyword_hash_table);
5150 + hash_new_table (101, &assign_hash_table);
5151 + hash_new_table (101, &vars);
5155 + while ((opt = getopt_long (argc, argv, "I:sdhavc:upo:D:M", long_options,
5162 + out_name = optarg;
5169 + include_path *p = (include_path *) xmalloc (sizeof (include_path));
5171 + sb_new (&p->path);
5172 + sb_add_string (&p->path, optarg);
5174 + paths_tail->next = p;
5181 + print_line_number = 1;
5184 + comment_char = optarg[0];
5196 + do_define (optarg);
5200 + comment_char = ';';
5206 + /* This output is intended to follow the GNU standards document. */
5207 + printf (_("GNU assembler pre-processor %s\n"), program_version);
5208 + printf (_("Copyright 1996 Free Software Foundation, Inc.\n"));
5210 +This program is free software; you may redistribute it under the terms of\n\
5211 +the GNU General Public License. This program has absolutely no warranty.\n"));
5217 + show_usage (stderr, 1);
5224 + macro_init (alternate, mri, 0, exp_get_abs);
5228 + outfile = fopen (out_name, "w");
5231 + fprintf (stderr, _("%s: Can't open output file `%s'.\n"),
5232 + program_name, out_name);
5245 + /* Process all the input files. */
5247 + while (optind < argc)
5249 + if (new_file (argv[optind]))
5255 + fprintf (stderr, _("%s: Can't open input file `%s'.\n"),
5256 + program_name, argv[optind]);
5266 +/* This function is used because an abort in some of the other files
5267 + may be compiled into as_abort because they include as.h. */
5270 +as_abort (file, line, fn)
5271 + const char *file, *fn;
5274 + fprintf (stderr, _("Internal error, aborting at %s line %d"), file, line);
5276 + fprintf (stderr, " in %s", fn);
5277 + fprintf (stderr, _("\nPlease report this bug.\n"));
5280 --- binutils-2.14.90.0.8/gas/macro.c.orig Wed Jan 14 22:07:45 2004
5281 +++ binutils-2.14.90.0.8/gas/macro.c Thu Jan 15 10:46:06 2004
5283 static int get_apost_token (int, sb *, sb *, int);
5284 static int sub_actual (int, sb *, sb *, struct hash_control *, int, sb *, int);
5285 static const char *macro_expand_body
5286 - (sb *, sb *, formal_entry *, struct hash_control *, int);
5287 -static const char *macro_expand (int, sb *, macro_entry *, sb *);
5288 + (sb *, sb *, formal_entry *, struct hash_control *, int, int);
5289 +static const char *macro_expand (int, sb *, macro_entry *, sb *, int);
5291 #define ISWHITE(x) ((x) == ' ' || (x) == '\t')
5296 macro_expand_body (sb *in, sb *out, formal_entry *formals,
5297 - struct hash_control *formal_hash, int locals)
5298 + struct hash_control *formal_hash, int comment_char, int locals)
5302 @@ -649,7 +649,14 @@
5303 else if (in->ptr[src] == '\\')
5306 - if (in->ptr[src] == '(')
5307 + if (in->ptr[src] == comment_char && comment_char != '\0')
5309 + /* This is a comment, just drop the rest of the line. */
5310 + while (src < in->len
5311 + && in->ptr[src] != '\n')
5314 + else if (in->ptr[src] == '(')
5316 /* Sub in till the next ')' literally. */
5321 src = sb_skip_white (src + 5, in);
5322 - while (in->ptr[src] != '\n')
5323 + while (in->ptr[src] != '\n' && in->ptr[src] != comment_char)
5327 @@ -759,6 +766,17 @@
5331 + else if (comment_char != '\0'
5332 + && in->ptr[src] == comment_char
5333 + && src + 1 < in->len
5334 + && in->ptr[src + 1] == comment_char
5337 + /* Two comment chars in a row cause the rest of the line to
5339 + while (src < in->len && in->ptr[src] != '\n')
5342 else if (in->ptr[src] == '"'
5343 || (macro_mri && in->ptr[src] == '\''))
5349 -macro_expand (int idx, sb *in, macro_entry *m, sb *out)
5350 +macro_expand (int idx, sb *in, macro_entry *m, sb *out, int comment_char)
5356 /* Peel off the actuals and store them away in the hash tables' actuals. */
5357 idx = sb_skip_white (idx, in);
5358 - while (idx < in->len)
5359 + while (idx < in->len && in->ptr[idx] != comment_char)
5363 @@ -993,7 +1011,7 @@
5364 sb_add_string (&ptr->actual, buffer);
5367 - err = macro_expand_body (&m->sub, out, m->formals, m->formal_hash, 1);
5368 + err = macro_expand_body (&m->sub, out, m->formals, m->formal_hash, comment_char, 1);
5372 @@ -1029,7 +1047,7 @@
5373 *EXPAND. Return 1 if a macro is found, 0 otherwise. */
5376 -check_macro (const char *line, sb *expand,
5377 +check_macro (const char *line, sb *expand, int comment_char,
5378 const char **error, macro_entry **info)
5381 @@ -1066,7 +1084,7 @@
5382 sb_add_char (&line_sb, *s++);
5385 - *error = macro_expand (0, &line_sb, macro, expand);
5386 + *error = macro_expand (0, &line_sb, macro, expand, comment_char);
5390 @@ -1090,7 +1108,7 @@
5391 success, or an error message otherwise. */
5394 -expand_irp (int irpc, int idx, sb *in, sb *out, int (*get_line) (sb *))
5395 +expand_irp (int irpc, int idx, sb *in, sb *out, int (*get_line) (sb *), int comment_char)
5399 @@ -1128,10 +1146,10 @@
5402 idx = sb_skip_comma (idx, in);
5403 - if (idx >= in->len)
5404 + if (idx >= in->len || in->ptr[idx] == comment_char)
5406 /* Expand once with a null string. */
5407 - err = macro_expand_body (&sub, out, &f, h, 0);
5408 + err = macro_expand_body (&sub, out, &f, h, comment_char, 0);
5412 @@ -1139,7 +1157,7 @@
5414 if (irpc && in->ptr[idx] == '"')
5416 - while (idx < in->len)
5417 + while (idx < in->len && in->ptr[idx] != comment_char)
5420 idx = get_any_string (idx, in, &f.actual, 1, 0);
5421 @@ -1150,7 +1168,7 @@
5424 nxt = sb_skip_white (idx + 1, in);
5425 - if (nxt >= in->len)
5426 + if (nxt >= in->len || in->ptr[nxt] == comment_char)
5430 @@ -1160,7 +1178,7 @@
5431 sb_add_char (&f.actual, in->ptr[idx]);
5434 - err = macro_expand_body (&sub, out, &f, h, 0);
5435 + err = macro_expand_body (&sub, out, &f, h, comment_char, 0);
5439 --- binutils-2.14.90.0.8/gas/macro.h.orig Wed Jan 14 22:07:45 2004
5440 +++ binutils-2.14.90.0.8/gas/macro.h Thu Jan 15 10:43:32 2004
5442 extern void macro_mri_mode (int);
5443 extern const char *define_macro
5444 (int, sb *, sb *, int (*) (sb *), const char **);
5445 -extern int check_macro (const char *, sb *, const char **, macro_entry **);
5446 +extern int check_macro (const char *, sb *, int, const char **, macro_entry **);
5447 extern void delete_macro (const char *);
5448 -extern const char *expand_irp (int, int, sb *, sb *, int (*) (sb *));
5449 +extern const char *expand_irp (int, int, sb *, sb *, int (*) (sb *), int);
5452 diff -Nur binutils-2.13.90.0.18.orig/gas/read.c binutils-2.13.90.0.18/gas/read.c
5453 --- binutils-2.13.90.0.18.orig/gas/read.c Sun Feb 2 03:21:18 2003
5454 +++ binutils-2.13.90.0.18/gas/read.c Sun Feb 2 15:26:06 2003
5459 - if (check_macro (s, &out, &err, ¯o))
5460 + if (check_macro (s, &out, '\0', &err, ¯o))
5464 @@ -1855,7 +1855,7 @@
5468 - err = expand_irp (irpc, 0, &s, &out, get_line_sb);
5469 + err = expand_irp (irpc, 0, &s, &out, get_line_sb, '\0');
5471 as_bad_where (file, line, "%s", err);