5 #define VERSION_MAJOR "0"
6 #define VERSION_MINOR "72"
7 #define RELEASE_DATE "10 February 2010"
8 #define VERSION VERSION_MAJOR "." VERSION_MINOR
15 #include <sys/types.h>
25 #define MAX_CWD_SIZE 4096
26 #define MAX_ALLOCATION_PASSES 100
28 /* NOTE: Before you even start thinking to touch anything
29 * in this code, set DEBUG_ROMCC_WARNINGS to 1 to get an
30 * insight on the original author's thoughts. We introduced
31 * this switch as romcc was about the only thing producing
32 * massive warnings in our code..
34 #define DEBUG_ROMCC_WARNINGS 0
36 #define DEBUG_CONSISTENCY 1
37 #define DEBUG_SDP_BLOCKS 0
38 #define DEBUG_TRIPLE_COLOR 0
40 #define DEBUG_DISPLAY_USES 1
41 #define DEBUG_DISPLAY_TYPES 1
42 #define DEBUG_REPLACE_CLOSURE_TYPE_HIRES 0
43 #define DEBUG_DECOMPOSE_PRINT_TUPLES 0
44 #define DEBUG_DECOMPOSE_HIRES 0
45 #define DEBUG_INITIALIZER 0
46 #define DEBUG_UPDATE_CLOSURE_TYPE 0
47 #define DEBUG_LOCAL_TRIPLE 0
48 #define DEBUG_BASIC_BLOCKS_VERBOSE 0
49 #define DEBUG_CPS_RENAME_VARIABLES_HIRES 0
50 #define DEBUG_SIMPLIFY_HIRES 0
51 #define DEBUG_SHRINKING 0
52 #define DEBUG_COALESCE_HITCHES 0
53 #define DEBUG_CODE_ELIMINATION 0
55 #define DEBUG_EXPLICIT_CLOSURES 0
57 #if DEBUG_ROMCC_WARNINGS
58 #warning "FIXME give clear error messages about unused variables"
59 #warning "FIXME properly handle multi dimensional arrays"
60 #warning "FIXME handle multiple register sizes"
63 /* Control flow graph of a loop without goto.
74 * |\ GGG HHH | continue;
102 * DFlocal(X) = { Y <- Succ(X) | idom(Y) != X }
103 * DFup(Z) = { Y <- DF(Z) | idom(Y) != X }
106 * [] == DFlocal(X) U DF(X)
109 * Dominator graph of the same nodes.
113 * BBB JJJ BBB: [ JJJ ] ( JJJ ) JJJ: [ ] ()
115 * CCC CCC: [ ] ( BBB, JJJ )
117 * DDD EEE DDD: [ ] ( BBB ) EEE: [ JJJ ] ()
119 * FFF FFF: [ ] ( BBB )
121 * GGG HHH GGG: [ ] ( BBB ) HHH: [ BBB ] ()
123 * III III: [ BBB ] ()
126 * BBB and JJJ are definitely the dominance frontier.
127 * Where do I place phi functions and how do I make that decision.
132 const char *filename;
133 struct filelist *next;
136 struct filelist *include_filelist = NULL;
138 static void __attribute__((noreturn)) die(char *fmt, ...)
143 vfprintf(stderr, fmt, args);
150 static void *xmalloc(size_t size, const char *name)
155 die("Cannot malloc %ld bytes to hold %s: %s\n",
156 size + 0UL, name, strerror(errno));
161 static void *xcmalloc(size_t size, const char *name)
164 buf = xmalloc(size, name);
165 memset(buf, 0, size);
169 static void *xrealloc(void *ptr, size_t size, const char *name)
172 buf = realloc(ptr, size);
174 die("Cannot realloc %ld bytes to hold %s: %s\n",
175 size + 0UL, name, strerror(errno));
180 static void xfree(const void *ptr)
185 static char *xstrdup(const char *str)
190 new = xmalloc(len + 1, "xstrdup string");
191 memcpy(new, str, len);
196 static void xchdir(const char *path)
198 if (chdir(path) != 0) {
199 die("chdir to `%s' failed: %s\n",
200 path, strerror(errno));
204 static int exists(const char *dirname, const char *filename)
206 char cwd[MAX_CWD_SIZE];
209 if (getcwd(cwd, sizeof(cwd)) == 0) {
210 die("cwd buffer to small");
214 if (chdir(dirname) != 0) {
217 if (does_exist && (access(filename, O_RDONLY) < 0)) {
218 if ((errno != EACCES) && (errno != EROFS)) {
227 static char *slurp_file(const char *dirname, const char *filename, off_t *r_size)
229 char cwd[MAX_CWD_SIZE];
231 off_t size, progress;
239 if (getcwd(cwd, sizeof(cwd)) == 0) {
240 die("cwd buffer to small");
243 file = fopen(filename, "rb");
246 die("Cannot open '%s' : %s\n",
247 filename, strerror(errno));
249 fseek(file, 0, SEEK_END);
251 fseek(file, 0, SEEK_SET);
253 buf = xmalloc(size +2, filename);
254 buf[size] = '\n'; /* Make certain the file is newline terminated */
255 buf[size+1] = '\0'; /* Null terminate the file for good measure */
257 while(progress < size) {
258 result = fread(buf + progress, 1, size - progress, file);
260 if ((errno == EINTR) || (errno == EAGAIN))
262 die("read on %s of %ld bytes failed: %s\n",
263 filename, (size - progress)+ 0UL, strerror(errno));
271 /* Types on the destination platform */
272 #if DEBUG_ROMCC_WARNINGS
273 #warning "FIXME this assumes 32bit x86 is the destination"
275 typedef int8_t schar_t;
276 typedef uint8_t uchar_t;
277 typedef int8_t char_t;
278 typedef int16_t short_t;
279 typedef uint16_t ushort_t;
280 typedef int32_t int_t;
281 typedef uint32_t uint_t;
282 typedef int32_t long_t;
283 #define ulong_t uint32_t
285 #define SCHAR_T_MIN (-128)
286 #define SCHAR_T_MAX 127
287 #define UCHAR_T_MAX 255
288 #define CHAR_T_MIN SCHAR_T_MIN
289 #define CHAR_T_MAX SCHAR_T_MAX
290 #define SHRT_T_MIN (-32768)
291 #define SHRT_T_MAX 32767
292 #define USHRT_T_MAX 65535
293 #define INT_T_MIN (-LONG_T_MAX - 1)
294 #define INT_T_MAX 2147483647
295 #define UINT_T_MAX 4294967295U
296 #define LONG_T_MIN (-LONG_T_MAX - 1)
297 #define LONG_T_MAX 2147483647
298 #define ULONG_T_MAX 4294967295U
301 #define SIZEOF_I16 16
302 #define SIZEOF_I32 32
303 #define SIZEOF_I64 64
305 #define SIZEOF_CHAR 8
306 #define SIZEOF_SHORT 16
307 #define SIZEOF_INT 32
308 #define SIZEOF_LONG (sizeof(long_t)*SIZEOF_CHAR)
311 #define ALIGNOF_CHAR 8
312 #define ALIGNOF_SHORT 16
313 #define ALIGNOF_INT 32
314 #define ALIGNOF_LONG (sizeof(long_t)*SIZEOF_CHAR)
316 #define REG_SIZEOF_REG 32
317 #define REG_SIZEOF_CHAR REG_SIZEOF_REG
318 #define REG_SIZEOF_SHORT REG_SIZEOF_REG
319 #define REG_SIZEOF_INT REG_SIZEOF_REG
320 #define REG_SIZEOF_LONG REG_SIZEOF_REG
322 #define REG_ALIGNOF_REG REG_SIZEOF_REG
323 #define REG_ALIGNOF_CHAR REG_SIZEOF_REG
324 #define REG_ALIGNOF_SHORT REG_SIZEOF_REG
325 #define REG_ALIGNOF_INT REG_SIZEOF_REG
326 #define REG_ALIGNOF_LONG REG_SIZEOF_REG
328 /* Additional definitions for clarity.
329 * I currently assume a long is the largest native
330 * machine word and that a pointer fits into it.
332 #define SIZEOF_WORD SIZEOF_LONG
333 #define SIZEOF_POINTER SIZEOF_LONG
334 #define ALIGNOF_WORD ALIGNOF_LONG
335 #define ALIGNOF_POINTER ALIGNOF_LONG
336 #define REG_SIZEOF_POINTER REG_SIZEOF_LONG
337 #define REG_ALIGNOF_POINTER REG_ALIGNOF_LONG
340 struct file_state *prev;
341 const char *basename;
347 const char *line_start;
349 const char *report_name;
350 const char *report_dir;
358 struct hash_entry *ident;
368 /* I have two classes of types:
370 * Logical types. (The type the C standard says the operation is of)
372 * The operational types are:
387 * No memory is useable by the compiler.
388 * There is no floating point support.
389 * All operations take place in general purpose registers.
390 * There is one type of general purpose register.
391 * Unsigned longs are stored in that general purpose register.
394 /* Operations on general purpose registers.
413 #define OP_POS 16 /* Dummy positive operator don't use it */
423 #define OP_SLESSEQ 26
424 #define OP_ULESSEQ 27
425 #define OP_SMOREEQ 28
426 #define OP_UMOREEQ 29
428 #define OP_LFALSE 30 /* Test if the expression is logically false */
429 #define OP_LTRUE 31 /* Test if the expression is logcially true */
433 /* For OP_STORE ->type holds the type
434 * RHS(0) holds the destination address
435 * RHS(1) holds the value to store.
438 #define OP_UEXTRACT 34
439 /* OP_UEXTRACT extracts an unsigned bitfield from a pseudo register
440 * RHS(0) holds the psuedo register to extract from
441 * ->type holds the size of the bitfield.
442 * ->u.bitfield.size holds the size of the bitfield.
443 * ->u.bitfield.offset holds the offset to extract from
445 #define OP_SEXTRACT 35
446 /* OP_SEXTRACT extracts a signed bitfield from a pseudo register
447 * RHS(0) holds the psuedo register to extract from
448 * ->type holds the size of the bitfield.
449 * ->u.bitfield.size holds the size of the bitfield.
450 * ->u.bitfield.offset holds the offset to extract from
452 #define OP_DEPOSIT 36
453 /* OP_DEPOSIT replaces a bitfield with a new value.
454 * RHS(0) holds the value to replace a bitifield in.
455 * RHS(1) holds the replacement value
456 * ->u.bitfield.size holds the size of the bitfield.
457 * ->u.bitfield.offset holds the deposit into
462 #define OP_MIN_CONST 50
463 #define OP_MAX_CONST 58
464 #define IS_CONST_OP(X) (((X) >= OP_MIN_CONST) && ((X) <= OP_MAX_CONST))
465 #define OP_INTCONST 50
466 /* For OP_INTCONST ->type holds the type.
467 * ->u.cval holds the constant value.
469 #define OP_BLOBCONST 51
470 /* For OP_BLOBCONST ->type holds the layout and size
471 * information. u.blob holds a pointer to the raw binary
472 * data for the constant initializer.
474 #define OP_ADDRCONST 52
475 /* For OP_ADDRCONST ->type holds the type.
476 * MISC(0) holds the reference to the static variable.
477 * ->u.cval holds an offset from that value.
479 #define OP_UNKNOWNVAL 59
480 /* For OP_UNKNOWNAL ->type holds the type.
481 * For some reason we don't know what value this type has.
482 * This allows for variables that have don't have values
483 * assigned yet, or variables whose value we simply do not know.
487 /* OP_WRITE moves one pseudo register to another.
488 * MISC(0) holds the destination pseudo register, which must be an OP_DECL.
489 * RHS(0) holds the psuedo to move.
493 /* OP_READ reads the value of a variable and makes
494 * it available for the pseudo operation.
495 * Useful for things like def-use chains.
496 * RHS(0) holds points to the triple to read from.
499 /* OP_COPY makes a copy of the pseudo register or constant in RHS(0).
501 #define OP_CONVERT 63
502 /* OP_CONVERT makes a copy of the pseudo register or constant in RHS(0).
503 * And then the type is converted appropriately.
506 /* OP_PIECE returns one piece of a instruction that returns a structure.
507 * MISC(0) is the instruction
508 * u.cval is the LHS piece of the instruction to return.
511 /* OP_ASM holds a sequence of assembly instructions, the result
512 * of a C asm directive.
513 * RHS(x) holds input value x to the assembly sequence.
514 * LHS(x) holds the output value x from the assembly sequence.
515 * u.blob holds the string of assembly instructions.
519 /* OP_DEREF generates an lvalue from a pointer.
520 * RHS(0) holds the pointer value.
521 * OP_DEREF serves as a place holder to indicate all necessary
522 * checks have been done to indicate a value is an lvalue.
525 /* OP_DOT references a submember of a structure lvalue.
526 * MISC(0) holds the lvalue.
527 * ->u.field holds the name of the field we want.
529 * Not seen after structures are flattened.
532 /* OP_INDEX references a submember of a tuple or array lvalue.
533 * MISC(0) holds the lvalue.
534 * ->u.cval holds the index into the lvalue.
536 * Not seen after structures are flattened.
539 /* OP_VAL returns the value of a subexpression of the current expression.
540 * Useful for operators that have side effects.
541 * RHS(0) holds the expression.
542 * MISC(0) holds the subexpression of RHS(0) that is the
543 * value of the expression.
545 * Not seen outside of expressions.
549 /* OP_TUPLE is an array of triples that are either variable
550 * or values for a structure or an array. It is used as
551 * a place holder when flattening compound types.
552 * The value represented by an OP_TUPLE is held in N registers.
553 * LHS(0..N-1) refer to those registers.
554 * ->use is a list of statements that use the value.
556 * Although OP_TUPLE always has register sized pieces they are not
557 * used until structures are flattened/decomposed into their register
559 * ???? registers ????
563 /* OP_BITREF describes a bitfield as an lvalue.
564 * RHS(0) holds the register value.
565 * ->type holds the type of the bitfield.
566 * ->u.bitfield.size holds the size of the bitfield.
567 * ->u.bitfield.offset holds the offset of the bitfield in the register
572 /* OP_FCALL performs a procedure call.
573 * MISC(0) holds a pointer to the OP_LIST of a function
574 * RHS(x) holds argument x of a function
576 * Currently not seen outside of expressions.
579 /* OP_PROG is an expression that holds a list of statements, or
580 * expressions. The final expression is the value of the expression.
581 * RHS(0) holds the start of the list.
586 /* OP_LIST Holds a list of statements that compose a function, and a result value.
587 * RHS(0) holds the list of statements.
588 * A list of all functions is maintained.
591 #define OP_BRANCH 81 /* an unconditional branch */
592 /* For branch instructions
593 * TARG(0) holds the branch target.
594 * ->next holds where to branch to if the branch is not taken.
595 * The branch target can only be a label
598 #define OP_CBRANCH 82 /* a conditional branch */
599 /* For conditional branch instructions
600 * RHS(0) holds the branch condition.
601 * TARG(0) holds the branch target.
602 * ->next holds where to branch to if the branch is not taken.
603 * The branch target can only be a label
606 #define OP_CALL 83 /* an uncontional branch that will return */
607 /* For call instructions
608 * MISC(0) holds the OP_RET that returns from the branch
609 * TARG(0) holds the branch target.
610 * ->next holds where to branch to if the branch is not taken.
611 * The branch target can only be a label
614 #define OP_RET 84 /* an uncontinonal branch through a variable back to an OP_CALL */
615 /* For call instructions
616 * RHS(0) holds the variable with the return address
617 * The branch target can only be a label
621 /* OP_LABEL is a triple that establishes an target for branches.
622 * ->use is the list of all branches that use this label.
626 /* OP_ADECL is a triple that establishes an lvalue for assignments.
627 * A variable takes N registers to contain.
628 * LHS(0..N-1) refer to an OP_PIECE triple that represents
629 * the Xth register that the variable is stored in.
630 * ->use is a list of statements that use the variable.
632 * Although OP_ADECL always has register sized pieces they are not
633 * used until structures are flattened/decomposed into their register
638 /* OP_SDECL is a triple that establishes a variable of static
640 * ->use is a list of statements that use the variable.
641 * MISC(0) holds the initializer expression.
646 /* OP_PHI is a triple used in SSA form code.
647 * It is used when multiple code paths merge and a variable needs
648 * a single assignment from any of those code paths.
649 * The operation is a cross between OP_DECL and OP_WRITE, which
650 * is what OP_PHI is generated from.
652 * RHS(x) points to the value from code path x
653 * The number of RHS entries is the number of control paths into the block
654 * in which OP_PHI resides. The elements of the array point to point
655 * to the variables OP_PHI is derived from.
657 * MISC(0) holds a pointer to the orginal OP_DECL node.
661 /* continuation helpers
663 #define OP_CPS_BRANCH 90 /* an unconditional branch */
664 /* OP_CPS_BRANCH calls a continuation
665 * RHS(x) holds argument x of the function
666 * TARG(0) holds OP_CPS_START target
668 #define OP_CPS_CBRANCH 91 /* a conditional branch */
669 /* OP_CPS_CBRANCH conditionally calls one of two continuations
670 * RHS(0) holds the branch condition
671 * RHS(x + 1) holds argument x of the function
672 * TARG(0) holds the OP_CPS_START to jump to when true
673 * ->next holds the OP_CPS_START to jump to when false
675 #define OP_CPS_CALL 92 /* an uncontional branch that will return */
676 /* For OP_CPS_CALL instructions
677 * RHS(x) holds argument x of the function
678 * MISC(0) holds the OP_CPS_RET that returns from the branch
679 * TARG(0) holds the branch target.
680 * ->next holds where the OP_CPS_RET will return to.
682 #define OP_CPS_RET 93
683 /* OP_CPS_RET conditionally calls one of two continuations
684 * RHS(0) holds the variable with the return function address
685 * RHS(x + 1) holds argument x of the function
686 * The branch target may be any OP_CPS_START
688 #define OP_CPS_END 94
689 /* OP_CPS_END is the triple at the end of the program.
690 * For most practical purposes it is a branch.
692 #define OP_CPS_START 95
693 /* OP_CPS_START is a triple at the start of a continuation
694 * The arguments variables takes N registers to contain.
695 * LHS(0..N-1) refer to an OP_PIECE triple that represents
696 * the Xth register that the arguments are stored in.
700 /* Architecture specific instructions */
703 #define OP_SET_EQ 102
704 #define OP_SET_NOTEQ 103
705 #define OP_SET_SLESS 104
706 #define OP_SET_ULESS 105
707 #define OP_SET_SMORE 106
708 #define OP_SET_UMORE 107
709 #define OP_SET_SLESSEQ 108
710 #define OP_SET_ULESSEQ 109
711 #define OP_SET_SMOREEQ 110
712 #define OP_SET_UMOREEQ 111
715 #define OP_JMP_EQ 113
716 #define OP_JMP_NOTEQ 114
717 #define OP_JMP_SLESS 115
718 #define OP_JMP_ULESS 116
719 #define OP_JMP_SMORE 117
720 #define OP_JMP_UMORE 118
721 #define OP_JMP_SLESSEQ 119
722 #define OP_JMP_ULESSEQ 120
723 #define OP_JMP_SMOREEQ 121
724 #define OP_JMP_UMOREEQ 122
726 /* Builtin operators that it is just simpler to use the compiler for */
742 #define PURE 0x001 /* Triple has no side effects */
743 #define IMPURE 0x002 /* Triple has side effects */
744 #define PURE_BITS(FLAGS) ((FLAGS) & 0x3)
745 #define DEF 0x004 /* Triple is a variable definition */
746 #define BLOCK 0x008 /* Triple stores the current block */
747 #define STRUCTURAL 0x010 /* Triple does not generate a machine instruction */
748 #define BRANCH_BITS(FLAGS) ((FLAGS) & 0xe0 )
749 #define UBRANCH 0x020 /* Triple is an unconditional branch instruction */
750 #define CBRANCH 0x040 /* Triple is a conditional branch instruction */
751 #define RETBRANCH 0x060 /* Triple is a return instruction */
752 #define CALLBRANCH 0x080 /* Triple is a call instruction */
753 #define ENDBRANCH 0x0a0 /* Triple is an end instruction */
754 #define PART 0x100 /* Triple is really part of another triple */
755 #define BITFIELD 0x200 /* Triple manipulates a bitfield */
756 signed char lhs, rhs, misc, targ;
759 #define OP(LHS, RHS, MISC, TARG, FLAGS, NAME) { \
767 static const struct op_info table_ops[] = {
768 [OP_SDIVT ] = OP( 2, 2, 0, 0, PURE | BLOCK , "sdivt"),
769 [OP_UDIVT ] = OP( 2, 2, 0, 0, PURE | BLOCK , "udivt"),
770 [OP_SMUL ] = OP( 0, 2, 0, 0, PURE | DEF | BLOCK , "smul"),
771 [OP_UMUL ] = OP( 0, 2, 0, 0, PURE | DEF | BLOCK , "umul"),
772 [OP_SDIV ] = OP( 0, 2, 0, 0, PURE | DEF | BLOCK , "sdiv"),
773 [OP_UDIV ] = OP( 0, 2, 0, 0, PURE | DEF | BLOCK , "udiv"),
774 [OP_SMOD ] = OP( 0, 2, 0, 0, PURE | DEF | BLOCK , "smod"),
775 [OP_UMOD ] = OP( 0, 2, 0, 0, PURE | DEF | BLOCK , "umod"),
776 [OP_ADD ] = OP( 0, 2, 0, 0, PURE | DEF | BLOCK , "add"),
777 [OP_SUB ] = OP( 0, 2, 0, 0, PURE | DEF | BLOCK , "sub"),
778 [OP_SL ] = OP( 0, 2, 0, 0, PURE | DEF | BLOCK , "sl"),
779 [OP_USR ] = OP( 0, 2, 0, 0, PURE | DEF | BLOCK , "usr"),
780 [OP_SSR ] = OP( 0, 2, 0, 0, PURE | DEF | BLOCK , "ssr"),
781 [OP_AND ] = OP( 0, 2, 0, 0, PURE | DEF | BLOCK , "and"),
782 [OP_XOR ] = OP( 0, 2, 0, 0, PURE | DEF | BLOCK , "xor"),
783 [OP_OR ] = OP( 0, 2, 0, 0, PURE | DEF | BLOCK , "or"),
784 [OP_POS ] = OP( 0, 1, 0, 0, PURE | DEF | BLOCK , "pos"),
785 [OP_NEG ] = OP( 0, 1, 0, 0, PURE | DEF | BLOCK , "neg"),
786 [OP_INVERT ] = OP( 0, 1, 0, 0, PURE | DEF | BLOCK , "invert"),
788 [OP_EQ ] = OP( 0, 2, 0, 0, PURE | DEF | BLOCK , "eq"),
789 [OP_NOTEQ ] = OP( 0, 2, 0, 0, PURE | DEF | BLOCK , "noteq"),
790 [OP_SLESS ] = OP( 0, 2, 0, 0, PURE | DEF | BLOCK , "sless"),
791 [OP_ULESS ] = OP( 0, 2, 0, 0, PURE | DEF | BLOCK , "uless"),
792 [OP_SMORE ] = OP( 0, 2, 0, 0, PURE | DEF | BLOCK , "smore"),
793 [OP_UMORE ] = OP( 0, 2, 0, 0, PURE | DEF | BLOCK , "umore"),
794 [OP_SLESSEQ ] = OP( 0, 2, 0, 0, PURE | DEF | BLOCK , "slesseq"),
795 [OP_ULESSEQ ] = OP( 0, 2, 0, 0, PURE | DEF | BLOCK , "ulesseq"),
796 [OP_SMOREEQ ] = OP( 0, 2, 0, 0, PURE | DEF | BLOCK , "smoreeq"),
797 [OP_UMOREEQ ] = OP( 0, 2, 0, 0, PURE | DEF | BLOCK , "umoreeq"),
798 [OP_LFALSE ] = OP( 0, 1, 0, 0, PURE | DEF | BLOCK , "lfalse"),
799 [OP_LTRUE ] = OP( 0, 1, 0, 0, PURE | DEF | BLOCK , "ltrue"),
801 [OP_LOAD ] = OP( 0, 1, 0, 0, PURE | DEF | BLOCK, "load"),
802 [OP_STORE ] = OP( 0, 2, 0, 0, PURE | BLOCK , "store"),
804 [OP_UEXTRACT ] = OP( 0, 1, 0, 0, PURE | DEF | BITFIELD, "uextract"),
805 [OP_SEXTRACT ] = OP( 0, 1, 0, 0, PURE | DEF | BITFIELD, "sextract"),
806 [OP_DEPOSIT ] = OP( 0, 2, 0, 0, PURE | DEF | BITFIELD, "deposit"),
808 [OP_NOOP ] = OP( 0, 0, 0, 0, PURE | BLOCK | STRUCTURAL, "noop"),
810 [OP_INTCONST ] = OP( 0, 0, 0, 0, PURE | DEF, "intconst"),
811 [OP_BLOBCONST ] = OP( 0, 0, 0, 0, PURE , "blobconst"),
812 [OP_ADDRCONST ] = OP( 0, 0, 1, 0, PURE | DEF, "addrconst"),
813 [OP_UNKNOWNVAL ] = OP( 0, 0, 0, 0, PURE | DEF, "unknown"),
815 #if DEBUG_ROMCC_WARNINGS
816 #warning "FIXME is it correct for OP_WRITE to be a def? I currently use it as one..."
818 [OP_WRITE ] = OP( 0, 1, 1, 0, PURE | DEF | BLOCK, "write"),
819 [OP_READ ] = OP( 0, 1, 0, 0, PURE | DEF | BLOCK, "read"),
820 [OP_COPY ] = OP( 0, 1, 0, 0, PURE | DEF | BLOCK, "copy"),
821 [OP_CONVERT ] = OP( 0, 1, 0, 0, PURE | DEF | BLOCK, "convert"),
822 [OP_PIECE ] = OP( 0, 0, 1, 0, PURE | DEF | STRUCTURAL | PART, "piece"),
823 [OP_ASM ] = OP(-1, -1, 0, 0, PURE, "asm"),
824 [OP_DEREF ] = OP( 0, 1, 0, 0, 0 | DEF | BLOCK, "deref"),
825 [OP_DOT ] = OP( 0, 0, 1, 0, PURE | DEF | PART, "dot"),
826 [OP_INDEX ] = OP( 0, 0, 1, 0, PURE | DEF | PART, "index"),
828 [OP_VAL ] = OP( 0, 1, 1, 0, 0 | DEF | BLOCK, "val"),
829 [OP_TUPLE ] = OP(-1, 0, 0, 0, 0 | PURE | BLOCK | STRUCTURAL, "tuple"),
830 [OP_BITREF ] = OP( 0, 1, 0, 0, 0 | DEF | PURE | STRUCTURAL | BITFIELD, "bitref"),
831 /* Call is special most it can stand in for anything so it depends on context */
832 [OP_FCALL ] = OP( 0, -1, 1, 0, 0 | BLOCK | CALLBRANCH, "fcall"),
833 [OP_PROG ] = OP( 0, 1, 0, 0, 0 | IMPURE | BLOCK | STRUCTURAL, "prog"),
834 /* The sizes of OP_FCALL depends upon context */
836 [OP_LIST ] = OP( 0, 1, 1, 0, 0 | DEF | STRUCTURAL, "list"),
837 [OP_BRANCH ] = OP( 0, 0, 0, 1, PURE | BLOCK | UBRANCH, "branch"),
838 [OP_CBRANCH ] = OP( 0, 1, 0, 1, PURE | BLOCK | CBRANCH, "cbranch"),
839 [OP_CALL ] = OP( 0, 0, 1, 1, PURE | BLOCK | CALLBRANCH, "call"),
840 [OP_RET ] = OP( 0, 1, 0, 0, PURE | BLOCK | RETBRANCH, "ret"),
841 [OP_LABEL ] = OP( 0, 0, 0, 0, PURE | BLOCK | STRUCTURAL, "label"),
842 [OP_ADECL ] = OP( 0, 0, 0, 0, PURE | BLOCK | STRUCTURAL, "adecl"),
843 [OP_SDECL ] = OP( 0, 0, 1, 0, PURE | BLOCK | STRUCTURAL, "sdecl"),
844 /* The number of RHS elements of OP_PHI depend upon context */
845 [OP_PHI ] = OP( 0, -1, 1, 0, PURE | DEF | BLOCK, "phi"),
848 [OP_CPS_BRANCH ] = OP( 0, -1, 0, 1, PURE | BLOCK | UBRANCH, "cps_branch"),
849 [OP_CPS_CBRANCH] = OP( 0, -1, 0, 1, PURE | BLOCK | CBRANCH, "cps_cbranch"),
850 [OP_CPS_CALL ] = OP( 0, -1, 1, 1, PURE | BLOCK | CALLBRANCH, "cps_call"),
851 [OP_CPS_RET ] = OP( 0, -1, 0, 0, PURE | BLOCK | RETBRANCH, "cps_ret"),
852 [OP_CPS_END ] = OP( 0, -1, 0, 0, IMPURE | BLOCK | ENDBRANCH, "cps_end"),
853 [OP_CPS_START ] = OP( -1, 0, 0, 0, PURE | BLOCK | STRUCTURAL, "cps_start"),
856 [OP_CMP ] = OP( 0, 2, 0, 0, PURE | DEF | BLOCK, "cmp"),
857 [OP_TEST ] = OP( 0, 1, 0, 0, PURE | DEF | BLOCK, "test"),
858 [OP_SET_EQ ] = OP( 0, 1, 0, 0, PURE | DEF | BLOCK, "set_eq"),
859 [OP_SET_NOTEQ ] = OP( 0, 1, 0, 0, PURE | DEF | BLOCK, "set_noteq"),
860 [OP_SET_SLESS ] = OP( 0, 1, 0, 0, PURE | DEF | BLOCK, "set_sless"),
861 [OP_SET_ULESS ] = OP( 0, 1, 0, 0, PURE | DEF | BLOCK, "set_uless"),
862 [OP_SET_SMORE ] = OP( 0, 1, 0, 0, PURE | DEF | BLOCK, "set_smore"),
863 [OP_SET_UMORE ] = OP( 0, 1, 0, 0, PURE | DEF | BLOCK, "set_umore"),
864 [OP_SET_SLESSEQ] = OP( 0, 1, 0, 0, PURE | DEF | BLOCK, "set_slesseq"),
865 [OP_SET_ULESSEQ] = OP( 0, 1, 0, 0, PURE | DEF | BLOCK, "set_ulesseq"),
866 [OP_SET_SMOREEQ] = OP( 0, 1, 0, 0, PURE | DEF | BLOCK, "set_smoreq"),
867 [OP_SET_UMOREEQ] = OP( 0, 1, 0, 0, PURE | DEF | BLOCK, "set_umoreq"),
868 [OP_JMP ] = OP( 0, 0, 0, 1, PURE | BLOCK | UBRANCH, "jmp"),
869 [OP_JMP_EQ ] = OP( 0, 1, 0, 1, PURE | BLOCK | CBRANCH, "jmp_eq"),
870 [OP_JMP_NOTEQ ] = OP( 0, 1, 0, 1, PURE | BLOCK | CBRANCH, "jmp_noteq"),
871 [OP_JMP_SLESS ] = OP( 0, 1, 0, 1, PURE | BLOCK | CBRANCH, "jmp_sless"),
872 [OP_JMP_ULESS ] = OP( 0, 1, 0, 1, PURE | BLOCK | CBRANCH, "jmp_uless"),
873 [OP_JMP_SMORE ] = OP( 0, 1, 0, 1, PURE | BLOCK | CBRANCH, "jmp_smore"),
874 [OP_JMP_UMORE ] = OP( 0, 1, 0, 1, PURE | BLOCK | CBRANCH, "jmp_umore"),
875 [OP_JMP_SLESSEQ] = OP( 0, 1, 0, 1, PURE | BLOCK | CBRANCH, "jmp_slesseq"),
876 [OP_JMP_ULESSEQ] = OP( 0, 1, 0, 1, PURE | BLOCK | CBRANCH, "jmp_ulesseq"),
877 [OP_JMP_SMOREEQ] = OP( 0, 1, 0, 1, PURE | BLOCK | CBRANCH, "jmp_smoreq"),
878 [OP_JMP_UMOREEQ] = OP( 0, 1, 0, 1, PURE | BLOCK | CBRANCH, "jmp_umoreq"),
880 [OP_INB ] = OP( 0, 1, 0, 0, IMPURE | DEF | BLOCK, "__inb"),
881 [OP_INW ] = OP( 0, 1, 0, 0, IMPURE | DEF | BLOCK, "__inw"),
882 [OP_INL ] = OP( 0, 1, 0, 0, IMPURE | DEF | BLOCK, "__inl"),
883 [OP_OUTB ] = OP( 0, 2, 0, 0, IMPURE| BLOCK, "__outb"),
884 [OP_OUTW ] = OP( 0, 2, 0, 0, IMPURE| BLOCK, "__outw"),
885 [OP_OUTL ] = OP( 0, 2, 0, 0, IMPURE| BLOCK, "__outl"),
886 [OP_BSF ] = OP( 0, 1, 0, 0, PURE | DEF | BLOCK, "__bsf"),
887 [OP_BSR ] = OP( 0, 1, 0, 0, PURE | DEF | BLOCK, "__bsr"),
888 [OP_RDMSR ] = OP( 2, 1, 0, 0, IMPURE | BLOCK, "__rdmsr"),
889 [OP_WRMSR ] = OP( 0, 3, 0, 0, IMPURE | BLOCK, "__wrmsr"),
890 [OP_HLT ] = OP( 0, 0, 0, 0, IMPURE | BLOCK, "__hlt"),
893 #define OP_MAX (sizeof(table_ops)/sizeof(table_ops[0]))
895 static const char *tops(int index)
897 static const char unknown[] = "unknown op";
901 if (index > OP_MAX) {
904 return table_ops[index].name;
911 struct triple_set *next;
912 struct triple *member;
922 const char *filename;
923 const char *function;
926 struct occurance *parent;
933 struct triple *next, *prev;
934 struct triple_set *use;
937 unsigned int template_id : 7;
938 unsigned int lhs : 6;
939 unsigned int rhs : 7;
940 unsigned int misc : 2;
941 unsigned int targ : 1;
942 #define TRIPLE_SIZE(TRIPLE) \
943 ((TRIPLE)->lhs + (TRIPLE)->rhs + (TRIPLE)->misc + (TRIPLE)->targ)
944 #define TRIPLE_LHS_OFF(PTR) (0)
945 #define TRIPLE_RHS_OFF(PTR) (TRIPLE_LHS_OFF(PTR) + (PTR)->lhs)
946 #define TRIPLE_MISC_OFF(PTR) (TRIPLE_RHS_OFF(PTR) + (PTR)->rhs)
947 #define TRIPLE_TARG_OFF(PTR) (TRIPLE_MISC_OFF(PTR) + (PTR)->misc)
948 #define LHS(PTR,INDEX) ((PTR)->param[TRIPLE_LHS_OFF(PTR) + (INDEX)])
949 #define RHS(PTR,INDEX) ((PTR)->param[TRIPLE_RHS_OFF(PTR) + (INDEX)])
950 #define TARG(PTR,INDEX) ((PTR)->param[TRIPLE_TARG_OFF(PTR) + (INDEX)])
951 #define MISC(PTR,INDEX) ((PTR)->param[TRIPLE_MISC_OFF(PTR) + (INDEX)])
952 unsigned id; /* A scratch value and finally the register */
953 #define TRIPLE_FLAG_FLATTENED (1 << 31)
954 #define TRIPLE_FLAG_PRE_SPLIT (1 << 30)
955 #define TRIPLE_FLAG_POST_SPLIT (1 << 29)
956 #define TRIPLE_FLAG_VOLATILE (1 << 28)
957 #define TRIPLE_FLAG_INLINE (1 << 27) /* ???? */
958 #define TRIPLE_FLAG_LOCAL (1 << 26)
960 #define TRIPLE_FLAG_COPY TRIPLE_FLAG_VOLATILE
961 struct occurance *occurance;
964 struct bitfield bitfield;
967 struct hash_entry *field;
968 struct asm_info *ainfo;
970 struct symbol *symbol;
972 struct triple *param[2];
979 struct ins_template {
980 struct reg_info lhs[MAX_LHS + 1], rhs[MAX_RHS + 1];
984 struct ins_template tmpl;
989 struct block_set *next;
990 struct block *member;
993 struct block *work_next;
994 struct triple *first, *last;
996 struct block_set *edges;
998 struct block_set *use;
999 struct block_set *idominates;
1000 struct block_set *domfrontier;
1002 struct block_set *ipdominates;
1003 struct block_set *ipdomfrontier;
1004 struct block *ipdom;
1010 struct symbol *next;
1011 struct hash_entry *ident;
1018 struct macro_arg *next;
1019 struct hash_entry *ident;
1022 struct hash_entry *ident;
1025 struct macro_arg *args;
1030 struct hash_entry *next;
1034 struct macro *sym_define;
1035 struct symbol *sym_label;
1036 struct symbol *sym_tag;
1037 struct symbol *sym_ident;
1040 #define HASH_TABLE_SIZE 2048
1042 struct compiler_state {
1043 const char *label_prefix;
1044 const char *ofilename;
1045 unsigned long flags;
1046 unsigned long debug;
1047 unsigned long max_allocation_passes;
1049 size_t include_path_count;
1050 const char **include_paths;
1052 size_t define_count;
1053 const char **defines;
1056 const char **undefs;
1059 unsigned long features;
1061 struct basic_blocks {
1062 struct triple *func;
1063 struct triple *first;
1064 struct block *first_block, *last_block;
1067 #define MAX_PP_IF_DEPTH 63
1068 struct compile_state {
1069 struct compiler_state *compiler;
1070 struct arch_state *arch;
1074 struct file_state *file;
1075 struct occurance *last_occurance;
1076 const char *function;
1078 struct token token[6];
1079 struct hash_entry *hash_table[HASH_TABLE_SIZE];
1080 struct hash_entry *i_switch;
1081 struct hash_entry *i_case;
1082 struct hash_entry *i_continue;
1083 struct hash_entry *i_break;
1084 struct hash_entry *i_default;
1085 struct hash_entry *i_return;
1086 struct hash_entry *i_noreturn;
1087 /* Additional hash entries for predefined macros */
1088 struct hash_entry *i_defined;
1089 struct hash_entry *i___VA_ARGS__;
1090 struct hash_entry *i___FILE__;
1091 struct hash_entry *i___LINE__;
1092 /* Additional hash entries for predefined identifiers */
1093 struct hash_entry *i___func__;
1094 /* Additional hash entries for attributes */
1095 struct hash_entry *i_noinline;
1096 struct hash_entry *i_always_inline;
1098 unsigned char if_bytes[(MAX_PP_IF_DEPTH + CHAR_BIT -1)/CHAR_BIT];
1100 int eat_depth, eat_targ;
1101 struct file_state *macro_file;
1102 struct triple *functions;
1103 struct triple *main_function;
1104 struct triple *first;
1105 struct triple *global_pool;
1106 struct basic_blocks bb;
1107 int functions_joined;
1110 /* visibility global/local */
1111 /* static/auto duration */
1112 /* typedef, register, inline */
1113 #define STOR_SHIFT 0
1114 #define STOR_MASK 0x001f
1116 #define STOR_GLOBAL 0x0001
1118 #define STOR_PERM 0x0002
1119 /* Definition locality */
1120 #define STOR_NONLOCAL 0x0004 /* The definition is not in this translation unit */
1121 /* Storage specifiers */
1122 #define STOR_AUTO 0x0000
1123 #define STOR_STATIC 0x0002
1124 #define STOR_LOCAL 0x0003
1125 #define STOR_EXTERN 0x0007
1126 #define STOR_INLINE 0x0008
1127 #define STOR_REGISTER 0x0010
1128 #define STOR_TYPEDEF 0x0018
1130 #define QUAL_SHIFT 5
1131 #define QUAL_MASK 0x00e0
1132 #define QUAL_NONE 0x0000
1133 #define QUAL_CONST 0x0020
1134 #define QUAL_VOLATILE 0x0040
1135 #define QUAL_RESTRICT 0x0080
1137 #define TYPE_SHIFT 8
1138 #define TYPE_MASK 0x1f00
1139 #define TYPE_INTEGER(TYPE) ((((TYPE) >= TYPE_CHAR) && ((TYPE) <= TYPE_ULLONG)) || ((TYPE) == TYPE_ENUM) || ((TYPE) == TYPE_BITFIELD))
1140 #define TYPE_ARITHMETIC(TYPE) ((((TYPE) >= TYPE_CHAR) && ((TYPE) <= TYPE_LDOUBLE)) || ((TYPE) == TYPE_ENUM) || ((TYPE) == TYPE_BITFIELD))
1141 #define TYPE_UNSIGNED(TYPE) ((TYPE) & 0x0100)
1142 #define TYPE_SIGNED(TYPE) (!TYPE_UNSIGNED(TYPE))
1143 #define TYPE_MKUNSIGNED(TYPE) (((TYPE) & ~0xF000) | 0x0100)
1144 #define TYPE_RANK(TYPE) ((TYPE) & ~0xF1FF)
1145 #define TYPE_PTR(TYPE) (((TYPE) & TYPE_MASK) == TYPE_POINTER)
1146 #define TYPE_DEFAULT 0x0000
1147 #define TYPE_VOID 0x0100
1148 #define TYPE_CHAR 0x0200
1149 #define TYPE_UCHAR 0x0300
1150 #define TYPE_SHORT 0x0400
1151 #define TYPE_USHORT 0x0500
1152 #define TYPE_INT 0x0600
1153 #define TYPE_UINT 0x0700
1154 #define TYPE_LONG 0x0800
1155 #define TYPE_ULONG 0x0900
1156 #define TYPE_LLONG 0x0a00 /* long long */
1157 #define TYPE_ULLONG 0x0b00
1158 #define TYPE_FLOAT 0x0c00
1159 #define TYPE_DOUBLE 0x0d00
1160 #define TYPE_LDOUBLE 0x0e00 /* long double */
1162 /* Note: TYPE_ENUM is chosen very carefully so TYPE_RANK works */
1163 #define TYPE_ENUM 0x1600
1164 #define TYPE_LIST 0x1700
1165 /* TYPE_LIST is a basic building block when defining enumerations
1166 * type->field_ident holds the name of this enumeration entry.
1167 * type->right holds the entry in the list.
1170 #define TYPE_STRUCT 0x1000
1172 * type->left holds the link list of TYPE_PRODUCT entries that
1173 * make up the structure.
1174 * type->elements hold the length of the linked list
1176 #define TYPE_UNION 0x1100
1178 * type->left holds the link list of TYPE_OVERLAP entries that
1179 * make up the union.
1180 * type->elements hold the length of the linked list
1182 #define TYPE_POINTER 0x1200
1183 /* For TYPE_POINTER:
1184 * type->left holds the type pointed to.
1186 #define TYPE_FUNCTION 0x1300
1187 /* For TYPE_FUNCTION:
1188 * type->left holds the return type.
1189 * type->right holds the type of the arguments
1190 * type->elements holds the count of the arguments
1192 #define TYPE_PRODUCT 0x1400
1193 /* TYPE_PRODUCT is a basic building block when defining structures
1194 * type->left holds the type that appears first in memory.
1195 * type->right holds the type that appears next in memory.
1197 #define TYPE_OVERLAP 0x1500
1198 /* TYPE_OVERLAP is a basic building block when defining unions
1199 * type->left and type->right holds to types that overlap
1200 * each other in memory.
1202 #define TYPE_ARRAY 0x1800
1203 /* TYPE_ARRAY is a basic building block when definitng arrays.
1204 * type->left holds the type we are an array of.
1205 * type->elements holds the number of elements.
1207 #define TYPE_TUPLE 0x1900
1208 /* TYPE_TUPLE is a basic building block when defining
1209 * positionally reference type conglomerations. (i.e. closures)
1210 * In essence it is a wrapper for TYPE_PRODUCT, like TYPE_STRUCT
1211 * except it has no field names.
1212 * type->left holds the liked list of TYPE_PRODUCT entries that
1213 * make up the closure type.
1214 * type->elements hold the number of elements in the closure.
1216 #define TYPE_JOIN 0x1a00
1217 /* TYPE_JOIN is a basic building block when defining
1218 * positionally reference type conglomerations. (i.e. closures)
1219 * In essence it is a wrapper for TYPE_OVERLAP, like TYPE_UNION
1220 * except it has no field names.
1221 * type->left holds the liked list of TYPE_OVERLAP entries that
1222 * make up the closure type.
1223 * type->elements hold the number of elements in the closure.
1225 #define TYPE_BITFIELD 0x1b00
1226 /* TYPE_BITFIED is the type of a bitfield.
1227 * type->left holds the type basic type TYPE_BITFIELD is derived from.
1228 * type->elements holds the number of bits in the bitfield.
1230 #define TYPE_UNKNOWN 0x1c00
1231 /* TYPE_UNKNOWN is the type of an unknown value.
1232 * Used on unknown consts and other places where I don't know the type.
1235 #define ATTRIB_SHIFT 16
1236 #define ATTRIB_MASK 0xffff0000
1237 #define ATTRIB_NOINLINE 0x00010000
1238 #define ATTRIB_ALWAYS_INLINE 0x00020000
1240 #define ELEMENT_COUNT_UNSPECIFIED ULONG_T_MAX
1244 struct type *left, *right;
1246 struct hash_entry *field_ident;
1247 struct hash_entry *type_ident;
1250 #define TEMPLATE_BITS 7
1251 #define MAX_TEMPLATES (1<<TEMPLATE_BITS)
1252 #define MAX_REG_EQUIVS 16
1254 #define MAX_REGISTERS 75
1255 #define REGISTER_BITS 7
1256 #define MAX_VIRT_REGISTERS (1<<REGISTER_BITS)
1259 #define REG_UNNEEDED 2
1260 #define REG_VIRT0 (MAX_REGISTERS + 0)
1261 #define REG_VIRT1 (MAX_REGISTERS + 1)
1262 #define REG_VIRT2 (MAX_REGISTERS + 2)
1263 #define REG_VIRT3 (MAX_REGISTERS + 3)
1264 #define REG_VIRT4 (MAX_REGISTERS + 4)
1265 #define REG_VIRT5 (MAX_REGISTERS + 5)
1266 #define REG_VIRT6 (MAX_REGISTERS + 6)
1267 #define REG_VIRT7 (MAX_REGISTERS + 7)
1268 #define REG_VIRT8 (MAX_REGISTERS + 8)
1269 #define REG_VIRT9 (MAX_REGISTERS + 9)
1271 #if (MAX_REGISTERS + 9) > MAX_VIRT_REGISTERS
1272 #error "MAX_VIRT_REGISTERS to small"
1274 #if (MAX_REGC + REGISTER_BITS) >= 26
1275 #error "Too many id bits used"
1278 /* Provision for 8 register classes */
1280 #define REGC_SHIFT REGISTER_BITS
1281 #define REGC_MASK (((1 << MAX_REGC) - 1) << REGISTER_BITS)
1282 #define REG_MASK (MAX_VIRT_REGISTERS -1)
1283 #define ID_REG(ID) ((ID) & REG_MASK)
1284 #define SET_REG(ID, REG) ((ID) = (((ID) & ~REG_MASK) | ((REG) & REG_MASK)))
1285 #define ID_REGCM(ID) (((ID) & REGC_MASK) >> REGC_SHIFT)
1286 #define SET_REGCM(ID, REGCM) ((ID) = (((ID) & ~REGC_MASK) | (((REGCM) << REGC_SHIFT) & REGC_MASK)))
1287 #define SET_INFO(ID, INFO) ((ID) = (((ID) & ~(REG_MASK | REGC_MASK)) | \
1288 (((INFO).reg) & REG_MASK) | ((((INFO).regcm) << REGC_SHIFT) & REGC_MASK)))
1290 #define ARCH_INPUT_REGS 4
1291 #define ARCH_OUTPUT_REGS 4
1293 static const struct reg_info arch_input_regs[ARCH_INPUT_REGS];
1294 static const struct reg_info arch_output_regs[ARCH_OUTPUT_REGS];
1295 static unsigned arch_reg_regcm(struct compile_state *state, int reg);
1296 static unsigned arch_regcm_normalize(struct compile_state *state, unsigned regcm);
1297 static unsigned arch_regcm_reg_normalize(struct compile_state *state, unsigned regcm);
1298 static void arch_reg_equivs(
1299 struct compile_state *state, unsigned *equiv, int reg);
1300 static int arch_select_free_register(
1301 struct compile_state *state, char *used, int classes);
1302 static unsigned arch_regc_size(struct compile_state *state, int class);
1303 static int arch_regcm_intersect(unsigned regcm1, unsigned regcm2);
1304 static unsigned arch_type_to_regcm(struct compile_state *state, struct type *type);
1305 static const char *arch_reg_str(int reg);
1306 static struct reg_info arch_reg_constraint(
1307 struct compile_state *state, struct type *type, const char *constraint);
1308 static struct reg_info arch_reg_clobber(
1309 struct compile_state *state, const char *clobber);
1310 static struct reg_info arch_reg_lhs(struct compile_state *state,
1311 struct triple *ins, int index);
1312 static struct reg_info arch_reg_rhs(struct compile_state *state,
1313 struct triple *ins, int index);
1314 static int arch_reg_size(int reg);
1315 static struct triple *transform_to_arch_instruction(
1316 struct compile_state *state, struct triple *ins);
1317 static struct triple *flatten(
1318 struct compile_state *state, struct triple *first, struct triple *ptr);
1319 static void print_dominators(struct compile_state *state,
1320 FILE *fp, struct basic_blocks *bb);
1321 static void print_dominance_frontiers(struct compile_state *state,
1322 FILE *fp, struct basic_blocks *bb);
1326 #define DEBUG_ABORT_ON_ERROR 0x00000001
1327 #define DEBUG_BASIC_BLOCKS 0x00000002
1328 #define DEBUG_FDOMINATORS 0x00000004
1329 #define DEBUG_RDOMINATORS 0x00000008
1330 #define DEBUG_TRIPLES 0x00000010
1331 #define DEBUG_INTERFERENCE 0x00000020
1332 #define DEBUG_SCC_TRANSFORM 0x00000040
1333 #define DEBUG_SCC_TRANSFORM2 0x00000080
1334 #define DEBUG_REBUILD_SSA_FORM 0x00000100
1335 #define DEBUG_INLINE 0x00000200
1336 #define DEBUG_RANGE_CONFLICTS 0x00000400
1337 #define DEBUG_RANGE_CONFLICTS2 0x00000800
1338 #define DEBUG_COLOR_GRAPH 0x00001000
1339 #define DEBUG_COLOR_GRAPH2 0x00002000
1340 #define DEBUG_COALESCING 0x00004000
1341 #define DEBUG_COALESCING2 0x00008000
1342 #define DEBUG_VERIFICATION 0x00010000
1343 #define DEBUG_CALLS 0x00020000
1344 #define DEBUG_CALLS2 0x00040000
1345 #define DEBUG_TOKENS 0x80000000
1347 #define DEBUG_DEFAULT ( \
1348 DEBUG_ABORT_ON_ERROR | \
1349 DEBUG_BASIC_BLOCKS | \
1350 DEBUG_FDOMINATORS | \
1351 DEBUG_RDOMINATORS | \
1355 #define DEBUG_ALL ( \
1356 DEBUG_ABORT_ON_ERROR | \
1357 DEBUG_BASIC_BLOCKS | \
1358 DEBUG_FDOMINATORS | \
1359 DEBUG_RDOMINATORS | \
1361 DEBUG_INTERFERENCE | \
1362 DEBUG_SCC_TRANSFORM | \
1363 DEBUG_SCC_TRANSFORM2 | \
1364 DEBUG_REBUILD_SSA_FORM | \
1366 DEBUG_RANGE_CONFLICTS | \
1367 DEBUG_RANGE_CONFLICTS2 | \
1368 DEBUG_COLOR_GRAPH | \
1369 DEBUG_COLOR_GRAPH2 | \
1370 DEBUG_COALESCING | \
1371 DEBUG_COALESCING2 | \
1372 DEBUG_VERIFICATION | \
1378 #define COMPILER_INLINE_MASK 0x00000007
1379 #define COMPILER_INLINE_ALWAYS 0x00000000
1380 #define COMPILER_INLINE_NEVER 0x00000001
1381 #define COMPILER_INLINE_DEFAULTON 0x00000002
1382 #define COMPILER_INLINE_DEFAULTOFF 0x00000003
1383 #define COMPILER_INLINE_NOPENALTY 0x00000004
1384 #define COMPILER_ELIMINATE_INEFECTUAL_CODE 0x00000008
1385 #define COMPILER_SIMPLIFY 0x00000010
1386 #define COMPILER_SCC_TRANSFORM 0x00000020
1387 #define COMPILER_SIMPLIFY_OP 0x00000040
1388 #define COMPILER_SIMPLIFY_PHI 0x00000080
1389 #define COMPILER_SIMPLIFY_LABEL 0x00000100
1390 #define COMPILER_SIMPLIFY_BRANCH 0x00000200
1391 #define COMPILER_SIMPLIFY_COPY 0x00000400
1392 #define COMPILER_SIMPLIFY_ARITH 0x00000800
1393 #define COMPILER_SIMPLIFY_SHIFT 0x00001000
1394 #define COMPILER_SIMPLIFY_BITWISE 0x00002000
1395 #define COMPILER_SIMPLIFY_LOGICAL 0x00004000
1396 #define COMPILER_SIMPLIFY_BITFIELD 0x00008000
1398 #define COMPILER_TRIGRAPHS 0x40000000
1399 #define COMPILER_PP_ONLY 0x80000000
1401 #define COMPILER_DEFAULT_FLAGS ( \
1402 COMPILER_TRIGRAPHS | \
1403 COMPILER_ELIMINATE_INEFECTUAL_CODE | \
1404 COMPILER_INLINE_DEFAULTON | \
1405 COMPILER_SIMPLIFY_OP | \
1406 COMPILER_SIMPLIFY_PHI | \
1407 COMPILER_SIMPLIFY_LABEL | \
1408 COMPILER_SIMPLIFY_BRANCH | \
1409 COMPILER_SIMPLIFY_COPY | \
1410 COMPILER_SIMPLIFY_ARITH | \
1411 COMPILER_SIMPLIFY_SHIFT | \
1412 COMPILER_SIMPLIFY_BITWISE | \
1413 COMPILER_SIMPLIFY_LOGICAL | \
1414 COMPILER_SIMPLIFY_BITFIELD | \
1417 #define GLOBAL_SCOPE_DEPTH 1
1418 #define FUNCTION_SCOPE_DEPTH (GLOBAL_SCOPE_DEPTH + 1)
1420 static void compile_file(struct compile_state *old_state, const char *filename, int local);
1424 static void init_compiler_state(struct compiler_state *compiler)
1426 memset(compiler, 0, sizeof(*compiler));
1427 compiler->label_prefix = "";
1428 compiler->ofilename = "auto.inc";
1429 compiler->flags = COMPILER_DEFAULT_FLAGS;
1430 compiler->debug = 0;
1431 compiler->max_allocation_passes = MAX_ALLOCATION_PASSES;
1432 compiler->include_path_count = 1;
1433 compiler->include_paths = xcmalloc(sizeof(char *), "include_paths");
1434 compiler->define_count = 1;
1435 compiler->defines = xcmalloc(sizeof(char *), "defines");
1436 compiler->undef_count = 1;
1437 compiler->undefs = xcmalloc(sizeof(char *), "undefs");
1440 struct compiler_flag {
1445 struct compiler_arg {
1448 struct compiler_flag flags[16];
1451 static int set_flag(
1452 const struct compiler_flag *ptr, unsigned long *flags,
1453 int act, const char *flag)
1456 for(; ptr->name; ptr++) {
1457 if (strcmp(ptr->name, flag) == 0) {
1463 *flags &= ~(ptr->flag);
1465 *flags |= ptr->flag;
1472 const struct compiler_arg *ptr, unsigned long *flags, const char *arg)
1477 val = strchr(arg, '=');
1481 for(; ptr->name; ptr++) {
1482 if (strncmp(ptr->name, arg, len) == 0) {
1487 *flags &= ~ptr->mask;
1488 result = set_flag(&ptr->flags[0], flags, 1, val);
1495 static void flag_usage(FILE *fp, const struct compiler_flag *ptr,
1496 const char *prefix, const char *invert_prefix)
1498 for(;ptr->name; ptr++) {
1499 fprintf(fp, "%s%s\n", prefix, ptr->name);
1500 if (invert_prefix) {
1501 fprintf(fp, "%s%s\n", invert_prefix, ptr->name);
1506 static void arg_usage(FILE *fp, const struct compiler_arg *ptr,
1509 for(;ptr->name; ptr++) {
1510 const struct compiler_flag *flag;
1511 for(flag = &ptr->flags[0]; flag->name; flag++) {
1512 fprintf(fp, "%s%s=%s\n",
1513 prefix, ptr->name, flag->name);
1518 static int append_string(size_t *max, const char ***vec, const char *str,
1523 *vec = xrealloc(*vec, sizeof(char *)*count, "name");
1524 (*vec)[count -1] = 0;
1525 (*vec)[count -2] = str;
1529 static void arg_error(char *fmt, ...);
1530 static const char *identifier(const char *str, const char *end);
1532 static int append_include_path(struct compiler_state *compiler, const char *str)
1535 if (!exists(str, ".")) {
1536 arg_error("Nonexistent include path: `%s'\n",
1539 result = append_string(&compiler->include_path_count,
1540 &compiler->include_paths, str, "include_paths");
1544 static int append_define(struct compiler_state *compiler, const char *str)
1546 const char *end, *rest;
1549 end = strchr(str, '=');
1551 end = str + strlen(str);
1553 rest = identifier(str, end);
1555 int len = end - str - 1;
1556 arg_error("Invalid name cannot define macro: `%*.*s'\n",
1559 result = append_string(&compiler->define_count,
1560 &compiler->defines, str, "defines");
1564 static int append_undef(struct compiler_state *compiler, const char *str)
1566 const char *end, *rest;
1569 end = str + strlen(str);
1570 rest = identifier(str, end);
1572 int len = end - str - 1;
1573 arg_error("Invalid name cannot undefine macro: `%*.*s'\n",
1576 result = append_string(&compiler->undef_count,
1577 &compiler->undefs, str, "undefs");
1581 static const struct compiler_flag romcc_flags[] = {
1582 { "trigraphs", COMPILER_TRIGRAPHS },
1583 { "pp-only", COMPILER_PP_ONLY },
1584 { "eliminate-inefectual-code", COMPILER_ELIMINATE_INEFECTUAL_CODE },
1585 { "simplify", COMPILER_SIMPLIFY },
1586 { "scc-transform", COMPILER_SCC_TRANSFORM },
1587 { "simplify-op", COMPILER_SIMPLIFY_OP },
1588 { "simplify-phi", COMPILER_SIMPLIFY_PHI },
1589 { "simplify-label", COMPILER_SIMPLIFY_LABEL },
1590 { "simplify-branch", COMPILER_SIMPLIFY_BRANCH },
1591 { "simplify-copy", COMPILER_SIMPLIFY_COPY },
1592 { "simplify-arith", COMPILER_SIMPLIFY_ARITH },
1593 { "simplify-shift", COMPILER_SIMPLIFY_SHIFT },
1594 { "simplify-bitwise", COMPILER_SIMPLIFY_BITWISE },
1595 { "simplify-logical", COMPILER_SIMPLIFY_LOGICAL },
1596 { "simplify-bitfield", COMPILER_SIMPLIFY_BITFIELD },
1599 static const struct compiler_arg romcc_args[] = {
1600 { "inline-policy", COMPILER_INLINE_MASK,
1602 { "always", COMPILER_INLINE_ALWAYS, },
1603 { "never", COMPILER_INLINE_NEVER, },
1604 { "defaulton", COMPILER_INLINE_DEFAULTON, },
1605 { "defaultoff", COMPILER_INLINE_DEFAULTOFF, },
1606 { "nopenalty", COMPILER_INLINE_NOPENALTY, },
1612 static const struct compiler_flag romcc_opt_flags[] = {
1613 { "-O", COMPILER_SIMPLIFY },
1614 { "-O2", COMPILER_SIMPLIFY | COMPILER_SCC_TRANSFORM },
1615 { "-E", COMPILER_PP_ONLY },
1618 static const struct compiler_flag romcc_debug_flags[] = {
1619 { "all", DEBUG_ALL },
1620 { "abort-on-error", DEBUG_ABORT_ON_ERROR },
1621 { "basic-blocks", DEBUG_BASIC_BLOCKS },
1622 { "fdominators", DEBUG_FDOMINATORS },
1623 { "rdominators", DEBUG_RDOMINATORS },
1624 { "triples", DEBUG_TRIPLES },
1625 { "interference", DEBUG_INTERFERENCE },
1626 { "scc-transform", DEBUG_SCC_TRANSFORM },
1627 { "scc-transform2", DEBUG_SCC_TRANSFORM2 },
1628 { "rebuild-ssa-form", DEBUG_REBUILD_SSA_FORM },
1629 { "inline", DEBUG_INLINE },
1630 { "live-range-conflicts", DEBUG_RANGE_CONFLICTS },
1631 { "live-range-conflicts2", DEBUG_RANGE_CONFLICTS2 },
1632 { "color-graph", DEBUG_COLOR_GRAPH },
1633 { "color-graph2", DEBUG_COLOR_GRAPH2 },
1634 { "coalescing", DEBUG_COALESCING },
1635 { "coalescing2", DEBUG_COALESCING2 },
1636 { "verification", DEBUG_VERIFICATION },
1637 { "calls", DEBUG_CALLS },
1638 { "calls2", DEBUG_CALLS2 },
1639 { "tokens", DEBUG_TOKENS },
1643 static int compiler_encode_flag(
1644 struct compiler_state *compiler, const char *flag)
1651 if (strncmp(flag, "no-", 3) == 0) {
1655 if (strncmp(flag, "-O", 2) == 0) {
1656 result = set_flag(romcc_opt_flags, &compiler->flags, act, flag);
1658 else if (strncmp(flag, "-E", 2) == 0) {
1659 result = set_flag(romcc_opt_flags, &compiler->flags, act, flag);
1661 else if (strncmp(flag, "-I", 2) == 0) {
1662 result = append_include_path(compiler, flag + 2);
1664 else if (strncmp(flag, "-D", 2) == 0) {
1665 result = append_define(compiler, flag + 2);
1667 else if (strncmp(flag, "-U", 2) == 0) {
1668 result = append_undef(compiler, flag + 2);
1670 else if (act && strncmp(flag, "label-prefix=", 13) == 0) {
1672 compiler->label_prefix = flag + 13;
1674 else if (act && strncmp(flag, "max-allocation-passes=", 22) == 0) {
1675 unsigned long max_passes;
1677 max_passes = strtoul(flag + 22, &end, 10);
1678 if (end[0] == '\0') {
1680 compiler->max_allocation_passes = max_passes;
1683 else if (act && strcmp(flag, "debug") == 0) {
1685 compiler->debug |= DEBUG_DEFAULT;
1687 else if (strncmp(flag, "debug-", 6) == 0) {
1689 result = set_flag(romcc_debug_flags, &compiler->debug, act, flag);
1692 result = set_flag(romcc_flags, &compiler->flags, act, flag);
1694 result = set_arg(romcc_args, &compiler->flags, flag);
1700 static void compiler_usage(FILE *fp)
1702 flag_usage(fp, romcc_opt_flags, "", 0);
1703 flag_usage(fp, romcc_flags, "-f", "-fno-");
1704 arg_usage(fp, romcc_args, "-f");
1705 flag_usage(fp, romcc_debug_flags, "-fdebug-", "-fno-debug-");
1706 fprintf(fp, "-flabel-prefix=<prefix for assembly language labels>\n");
1707 fprintf(fp, "--label-prefix=<prefix for assembly language labels>\n");
1708 fprintf(fp, "-I<include path>\n");
1709 fprintf(fp, "-D<macro>[=defn]\n");
1710 fprintf(fp, "-U<macro>\n");
1713 static void do_cleanup(struct compile_state *state)
1715 if (state->output) {
1716 fclose(state->output);
1717 unlink(state->compiler->ofilename);
1720 if (state->dbgout) {
1721 fflush(state->dbgout);
1723 if (state->errout) {
1724 fflush(state->errout);
1728 static struct compile_state *exit_state;
1729 static void exit_cleanup(void)
1732 do_cleanup(exit_state);
1736 static int get_col(struct file_state *file)
1739 const char *ptr, *end;
1740 ptr = file->line_start;
1742 for(col = 0; ptr < end; ptr++) {
1747 col = (col & ~7) + 8;
1753 static void loc(FILE *fp, struct compile_state *state, struct triple *triple)
1756 if (triple && triple->occurance) {
1757 struct occurance *spot;
1758 for(spot = triple->occurance; spot; spot = spot->parent) {
1759 fprintf(fp, "%s:%d.%d: ",
1760 spot->filename, spot->line, spot->col);
1767 col = get_col(state->file);
1768 fprintf(fp, "%s:%d.%d: ",
1769 state->file->report_name, state->file->report_line, col);
1772 static void __attribute__ ((noreturn)) internal_error(struct compile_state *state, struct triple *ptr,
1773 const char *fmt, ...)
1775 FILE *fp = state->errout;
1777 va_start(args, fmt);
1778 loc(fp, state, ptr);
1781 fprintf(fp, "%p %-10s ", ptr, tops(ptr->op));
1783 fprintf(fp, "Internal compiler error: ");
1784 vfprintf(fp, fmt, args);
1792 static void internal_warning(struct compile_state *state, struct triple *ptr,
1793 const char *fmt, ...)
1795 FILE *fp = state->errout;
1797 va_start(args, fmt);
1798 loc(fp, state, ptr);
1800 fprintf(fp, "%p %-10s ", ptr, tops(ptr->op));
1802 fprintf(fp, "Internal compiler warning: ");
1803 vfprintf(fp, fmt, args);
1810 static void __attribute__ ((noreturn)) error(struct compile_state *state, struct triple *ptr,
1811 const char *fmt, ...)
1813 FILE *fp = state->errout;
1815 va_start(args, fmt);
1816 loc(fp, state, ptr);
1818 if (ptr && (state->compiler->debug & DEBUG_ABORT_ON_ERROR)) {
1819 fprintf(fp, "%p %-10s ", ptr, tops(ptr->op));
1821 vfprintf(fp, fmt, args);
1825 if (state->compiler->debug & DEBUG_ABORT_ON_ERROR) {
1831 static void warning(struct compile_state *state, struct triple *ptr,
1832 const char *fmt, ...)
1834 FILE *fp = state->errout;
1836 va_start(args, fmt);
1837 loc(fp, state, ptr);
1838 fprintf(fp, "warning: ");
1839 if (ptr && (state->compiler->debug & DEBUG_ABORT_ON_ERROR)) {
1840 fprintf(fp, "%p %-10s ", ptr, tops(ptr->op));
1842 vfprintf(fp, fmt, args);
1847 #define FINISHME() warning(state, 0, "FINISHME @ %s.%s:%d", __FILE__, __func__, __LINE__)
1849 static void valid_op(struct compile_state *state, int op)
1851 char *fmt = "invalid op: %d";
1853 internal_error(state, 0, fmt, op);
1856 internal_error(state, 0, fmt, op);
1860 static void valid_ins(struct compile_state *state, struct triple *ptr)
1862 valid_op(state, ptr->op);
1865 #if DEBUG_ROMCC_WARNING
1866 static void valid_param_count(struct compile_state *state, struct triple *ins)
1868 int lhs, rhs, misc, targ;
1869 valid_ins(state, ins);
1870 lhs = table_ops[ins->op].lhs;
1871 rhs = table_ops[ins->op].rhs;
1872 misc = table_ops[ins->op].misc;
1873 targ = table_ops[ins->op].targ;
1875 if ((lhs >= 0) && (ins->lhs != lhs)) {
1876 internal_error(state, ins, "Bad lhs count");
1878 if ((rhs >= 0) && (ins->rhs != rhs)) {
1879 internal_error(state, ins, "Bad rhs count");
1881 if ((misc >= 0) && (ins->misc != misc)) {
1882 internal_error(state, ins, "Bad misc count");
1884 if ((targ >= 0) && (ins->targ != targ)) {
1885 internal_error(state, ins, "Bad targ count");
1890 static struct type void_type;
1891 static struct type unknown_type;
1892 static void use_triple(struct triple *used, struct triple *user)
1894 struct triple_set **ptr, *new;
1901 if ((*ptr)->member == user) {
1904 ptr = &(*ptr)->next;
1906 /* Append new to the head of the list,
1907 * copy_func and rename_block_variables
1910 new = xcmalloc(sizeof(*new), "triple_set");
1912 new->next = used->use;
1916 static void unuse_triple(struct triple *used, struct triple *unuser)
1918 struct triple_set *use, **ptr;
1925 if (use->member == unuser) {
1935 static void put_occurance(struct occurance *occurance)
1938 occurance->count -= 1;
1939 if (occurance->count <= 0) {
1940 if (occurance->parent) {
1941 put_occurance(occurance->parent);
1948 static void get_occurance(struct occurance *occurance)
1951 occurance->count += 1;
1956 static struct occurance *new_occurance(struct compile_state *state)
1958 struct occurance *result, *last;
1959 const char *filename;
1960 const char *function;
1968 filename = state->file->report_name;
1969 line = state->file->report_line;
1970 col = get_col(state->file);
1972 if (state->function) {
1973 function = state->function;
1975 last = state->last_occurance;
1977 (last->col == col) &&
1978 (last->line == line) &&
1979 (last->function == function) &&
1980 ((last->filename == filename) ||
1981 (strcmp(last->filename, filename) == 0)))
1983 get_occurance(last);
1987 state->last_occurance = 0;
1988 put_occurance(last);
1990 result = xmalloc(sizeof(*result), "occurance");
1992 result->filename = filename;
1993 result->function = function;
1994 result->line = line;
1997 state->last_occurance = result;
2001 static struct occurance *inline_occurance(struct compile_state *state,
2002 struct occurance *base, struct occurance *top)
2004 struct occurance *result, *last;
2006 internal_error(state, 0, "inlining an already inlined function?");
2008 /* If I have a null base treat it that way */
2009 if ((base->parent == 0) &&
2011 (base->line == 0) &&
2012 (base->function[0] == '\0') &&
2013 (base->filename[0] == '\0')) {
2016 /* See if I can reuse the last occurance I had */
2017 last = state->last_occurance;
2019 (last->parent == base) &&
2020 (last->col == top->col) &&
2021 (last->line == top->line) &&
2022 (last->function == top->function) &&
2023 (last->filename == top->filename)) {
2024 get_occurance(last);
2027 /* I can't reuse the last occurance so free it */
2029 state->last_occurance = 0;
2030 put_occurance(last);
2032 /* Generate a new occurance structure */
2033 get_occurance(base);
2034 result = xmalloc(sizeof(*result), "occurance");
2036 result->filename = top->filename;
2037 result->function = top->function;
2038 result->line = top->line;
2039 result->col = top->col;
2040 result->parent = base;
2041 state->last_occurance = result;
2045 static struct occurance dummy_occurance = {
2047 .filename = __FILE__,
2054 /* The undef triple is used as a place holder when we are removing pointers
2055 * from a triple. Having allows certain sanity checks to pass even
2056 * when the original triple that was pointed to is gone.
2058 static struct triple unknown_triple = {
2059 .next = &unknown_triple,
2060 .prev = &unknown_triple,
2062 .op = OP_UNKNOWNVAL,
2067 .type = &unknown_type,
2068 .id = -1, /* An invalid id */
2069 .u = { .cval = 0, },
2070 .occurance = &dummy_occurance,
2071 .param = { [0] = 0, [1] = 0, },
2075 static size_t registers_of(struct compile_state *state, struct type *type);
2077 static struct triple *alloc_triple(struct compile_state *state,
2078 int op, struct type *type, int lhs_wanted, int rhs_wanted,
2079 struct occurance *occurance)
2081 size_t size, extra_count, min_count;
2082 int lhs, rhs, misc, targ;
2083 struct triple *ret, dummy;
2085 dummy.occurance = occurance;
2086 valid_op(state, op);
2087 lhs = table_ops[op].lhs;
2088 rhs = table_ops[op].rhs;
2089 misc = table_ops[op].misc;
2090 targ = table_ops[op].targ;
2100 lhs = registers_of(state, type);
2103 lhs = registers_of(state, type);
2110 if ((rhs < 0) || (rhs > MAX_RHS)) {
2111 internal_error(state, &dummy, "bad rhs count %d", rhs);
2113 if ((lhs < 0) || (lhs > MAX_LHS)) {
2114 internal_error(state, &dummy, "bad lhs count %d", lhs);
2116 if ((misc < 0) || (misc > MAX_MISC)) {
2117 internal_error(state, &dummy, "bad misc count %d", misc);
2119 if ((targ < 0) || (targ > MAX_TARG)) {
2120 internal_error(state, &dummy, "bad targs count %d", targ);
2123 min_count = sizeof(ret->param)/sizeof(ret->param[0]);
2124 extra_count = lhs + rhs + misc + targ;
2125 extra_count = (extra_count < min_count)? 0 : extra_count - min_count;
2127 size = sizeof(*ret) + sizeof(ret->param[0]) * extra_count;
2128 ret = xcmalloc(size, "tripple");
2137 ret->occurance = occurance;
2138 /* A simple sanity check */
2139 if ((ret->op != op) ||
2140 (ret->lhs != lhs) ||
2141 (ret->rhs != rhs) ||
2142 (ret->misc != misc) ||
2143 (ret->targ != targ) ||
2144 (ret->type != type) ||
2145 (ret->next != ret) ||
2146 (ret->prev != ret) ||
2147 (ret->occurance != occurance)) {
2148 internal_error(state, ret, "huh?");
2153 struct triple *dup_triple(struct compile_state *state, struct triple *src)
2156 int src_lhs, src_rhs, src_size;
2159 src_size = TRIPLE_SIZE(src);
2160 get_occurance(src->occurance);
2161 dup = alloc_triple(state, src->op, src->type, src_lhs, src_rhs,
2163 memcpy(dup, src, sizeof(*src));
2164 memcpy(dup->param, src->param, src_size * sizeof(src->param[0]));
2168 static struct triple *copy_triple(struct compile_state *state, struct triple *src)
2170 struct triple *copy;
2171 copy = dup_triple(state, src);
2173 copy->next = copy->prev = copy;
2177 static struct triple *new_triple(struct compile_state *state,
2178 int op, struct type *type, int lhs, int rhs)
2181 struct occurance *occurance;
2182 occurance = new_occurance(state);
2183 ret = alloc_triple(state, op, type, lhs, rhs, occurance);
2187 static struct triple *build_triple(struct compile_state *state,
2188 int op, struct type *type, struct triple *left, struct triple *right,
2189 struct occurance *occurance)
2193 ret = alloc_triple(state, op, type, -1, -1, occurance);
2194 count = TRIPLE_SIZE(ret);
2196 ret->param[0] = left;
2199 ret->param[1] = right;
2204 static struct triple *triple(struct compile_state *state,
2205 int op, struct type *type, struct triple *left, struct triple *right)
2209 ret = new_triple(state, op, type, -1, -1);
2210 count = TRIPLE_SIZE(ret);
2212 ret->param[0] = left;
2215 ret->param[1] = right;
2220 static struct triple *branch(struct compile_state *state,
2221 struct triple *targ, struct triple *test)
2225 ret = new_triple(state, OP_CBRANCH, &void_type, -1, 1);
2228 ret = new_triple(state, OP_BRANCH, &void_type, -1, 0);
2230 TARG(ret, 0) = targ;
2231 /* record the branch target was used */
2232 if (!targ || (targ->op != OP_LABEL)) {
2233 internal_error(state, 0, "branch not to label");
2238 static int triple_is_label(struct compile_state *state, struct triple *ins);
2239 static int triple_is_call(struct compile_state *state, struct triple *ins);
2240 static int triple_is_cbranch(struct compile_state *state, struct triple *ins);
2241 static void insert_triple(struct compile_state *state,
2242 struct triple *first, struct triple *ptr)
2245 if ((ptr->id & TRIPLE_FLAG_FLATTENED) || (ptr->next != ptr)) {
2246 internal_error(state, ptr, "expression already used");
2249 ptr->prev = first->prev;
2250 ptr->prev->next = ptr;
2251 ptr->next->prev = ptr;
2253 if (triple_is_cbranch(state, ptr->prev) ||
2254 triple_is_call(state, ptr->prev)) {
2255 unuse_triple(first, ptr->prev);
2256 use_triple(ptr, ptr->prev);
2261 static int triple_stores_block(struct compile_state *state, struct triple *ins)
2263 /* This function is used to determine if u.block
2264 * is utilized to store the current block number.
2267 valid_ins(state, ins);
2268 stores_block = (table_ops[ins->op].flags & BLOCK) == BLOCK;
2269 return stores_block;
2272 static int triple_is_branch(struct compile_state *state, struct triple *ins);
2273 static struct block *block_of_triple(struct compile_state *state,
2276 struct triple *first;
2277 if (!ins || ins == &unknown_triple) {
2280 first = state->first;
2281 while(ins != first && !triple_is_branch(state, ins->prev) &&
2282 !triple_stores_block(state, ins))
2284 if (ins == ins->prev) {
2285 internal_error(state, ins, "ins == ins->prev?");
2289 return triple_stores_block(state, ins)? ins->u.block: 0;
2292 static void generate_lhs_pieces(struct compile_state *state, struct triple *ins);
2293 static struct triple *pre_triple(struct compile_state *state,
2294 struct triple *base,
2295 int op, struct type *type, struct triple *left, struct triple *right)
2297 struct block *block;
2300 /* If I am an OP_PIECE jump to the real instruction */
2301 if (base->op == OP_PIECE) {
2302 base = MISC(base, 0);
2304 block = block_of_triple(state, base);
2305 get_occurance(base->occurance);
2306 ret = build_triple(state, op, type, left, right, base->occurance);
2307 generate_lhs_pieces(state, ret);
2308 if (triple_stores_block(state, ret)) {
2309 ret->u.block = block;
2311 insert_triple(state, base, ret);
2312 for(i = 0; i < ret->lhs; i++) {
2313 struct triple *piece;
2314 piece = LHS(ret, i);
2315 insert_triple(state, base, piece);
2316 use_triple(ret, piece);
2317 use_triple(piece, ret);
2319 if (block && (block->first == base)) {
2325 static struct triple *post_triple(struct compile_state *state,
2326 struct triple *base,
2327 int op, struct type *type, struct triple *left, struct triple *right)
2329 struct block *block;
2330 struct triple *ret, *next;
2332 /* If I am an OP_PIECE jump to the real instruction */
2333 if (base->op == OP_PIECE) {
2334 base = MISC(base, 0);
2336 /* If I have a left hand side skip over it */
2339 base = LHS(base, zlhs - 1);
2342 block = block_of_triple(state, base);
2343 get_occurance(base->occurance);
2344 ret = build_triple(state, op, type, left, right, base->occurance);
2345 generate_lhs_pieces(state, ret);
2346 if (triple_stores_block(state, ret)) {
2347 ret->u.block = block;
2350 insert_triple(state, next, ret);
2352 for(i = 0; i < zlhs; i++) {
2353 struct triple *piece;
2354 piece = LHS(ret, i);
2355 insert_triple(state, next, piece);
2356 use_triple(ret, piece);
2357 use_triple(piece, ret);
2359 if (block && (block->last == base)) {
2362 block->last = LHS(ret, zlhs - 1);
2368 static struct type *reg_type(
2369 struct compile_state *state, struct type *type, int reg);
2371 static void generate_lhs_piece(
2372 struct compile_state *state, struct triple *ins, int index)
2374 struct type *piece_type;
2375 struct triple *piece;
2376 get_occurance(ins->occurance);
2377 piece_type = reg_type(state, ins->type, index * REG_SIZEOF_REG);
2379 if ((piece_type->type & TYPE_MASK) == TYPE_BITFIELD) {
2380 piece_type = piece_type->left;
2384 static void name_of(FILE *fp, struct type *type);
2385 FILE * fp = state->errout;
2386 fprintf(fp, "piece_type(%d): ", index);
2387 name_of(fp, piece_type);
2391 piece = alloc_triple(state, OP_PIECE, piece_type, -1, -1, ins->occurance);
2392 piece->u.cval = index;
2393 LHS(ins, piece->u.cval) = piece;
2394 MISC(piece, 0) = ins;
2397 static void generate_lhs_pieces(struct compile_state *state, struct triple *ins)
2401 for(i = 0; i < zlhs; i++) {
2402 generate_lhs_piece(state, ins, i);
2406 static struct triple *label(struct compile_state *state)
2408 /* Labels don't get a type */
2409 struct triple *result;
2410 result = triple(state, OP_LABEL, &void_type, 0, 0);
2414 static struct triple *mkprog(struct compile_state *state, ...)
2416 struct triple *prog, *head, *arg;
2420 head = label(state);
2421 prog = new_triple(state, OP_PROG, &void_type, -1, -1);
2422 RHS(prog, 0) = head;
2423 va_start(args, state);
2425 while((arg = va_arg(args, struct triple *)) != 0) {
2427 internal_error(state, 0, "too many arguments to mkprog");
2429 flatten(state, head, arg);
2432 prog->type = head->prev->type;
2435 static void name_of(FILE *fp, struct type *type);
2436 static void display_triple(FILE *fp, struct triple *ins)
2438 struct occurance *ptr;
2440 char pre, post, vol;
2441 pre = post = vol = ' ';
2443 if (ins->id & TRIPLE_FLAG_PRE_SPLIT) {
2446 if (ins->id & TRIPLE_FLAG_POST_SPLIT) {
2449 if (ins->id & TRIPLE_FLAG_VOLATILE) {
2452 reg = arch_reg_str(ID_REG(ins->id));
2455 fprintf(fp, "(%p) <nothing> ", ins);
2457 else if (ins->op == OP_INTCONST) {
2458 fprintf(fp, "(%p) %c%c%c %-7s %-2d %-10s <0x%08lx> ",
2459 ins, pre, post, vol, reg, ins->template_id, tops(ins->op),
2460 (unsigned long)(ins->u.cval));
2462 else if (ins->op == OP_ADDRCONST) {
2463 fprintf(fp, "(%p) %c%c%c %-7s %-2d %-10s %-10p <0x%08lx>",
2464 ins, pre, post, vol, reg, ins->template_id, tops(ins->op),
2465 MISC(ins, 0), (unsigned long)(ins->u.cval));
2467 else if (ins->op == OP_INDEX) {
2468 fprintf(fp, "(%p) %c%c%c %-7s %-2d %-10s %-10p <0x%08lx>",
2469 ins, pre, post, vol, reg, ins->template_id, tops(ins->op),
2470 RHS(ins, 0), (unsigned long)(ins->u.cval));
2472 else if (ins->op == OP_PIECE) {
2473 fprintf(fp, "(%p) %c%c%c %-7s %-2d %-10s %-10p <0x%08lx>",
2474 ins, pre, post, vol, reg, ins->template_id, tops(ins->op),
2475 MISC(ins, 0), (unsigned long)(ins->u.cval));
2479 fprintf(fp, "(%p) %c%c%c %-7s %-2d %-10s",
2480 ins, pre, post, vol, reg, ins->template_id, tops(ins->op));
2481 if (table_ops[ins->op].flags & BITFIELD) {
2482 fprintf(fp, " <%2d-%2d:%2d>",
2483 ins->u.bitfield.offset,
2484 ins->u.bitfield.offset + ins->u.bitfield.size,
2485 ins->u.bitfield.size);
2487 count = TRIPLE_SIZE(ins);
2488 for(i = 0; i < count; i++) {
2489 fprintf(fp, " %-10p", ins->param[i]);
2496 struct triple_set *user;
2497 #if DEBUG_DISPLAY_TYPES
2499 name_of(fp, ins->type);
2502 #if DEBUG_DISPLAY_USES
2504 for(user = ins->use; user; user = user->next) {
2505 fprintf(fp, " %-10p", user->member);
2510 for(ptr = ins->occurance; ptr; ptr = ptr->parent) {
2511 fprintf(fp, " %s,%s:%d.%d",
2517 if (ins->op == OP_ASM) {
2518 fprintf(fp, "\n\t%s", ins->u.ainfo->str);
2525 static int equiv_types(struct type *left, struct type *right);
2526 static void display_triple_changes(
2527 FILE *fp, const struct triple *new, const struct triple *orig)
2530 int new_count, orig_count;
2531 new_count = TRIPLE_SIZE(new);
2532 orig_count = TRIPLE_SIZE(orig);
2533 if ((new->op != orig->op) ||
2534 (new_count != orig_count) ||
2535 (memcmp(orig->param, new->param,
2536 orig_count * sizeof(orig->param[0])) != 0) ||
2537 (memcmp(&orig->u, &new->u, sizeof(orig->u)) != 0))
2539 struct occurance *ptr;
2540 int i, min_count, indent;
2541 fprintf(fp, "(%p %p)", new, orig);
2542 if (orig->op == new->op) {
2543 fprintf(fp, " %-11s", tops(orig->op));
2545 fprintf(fp, " [%-10s %-10s]",
2546 tops(new->op), tops(orig->op));
2548 min_count = new_count;
2549 if (min_count > orig_count) {
2550 min_count = orig_count;
2552 for(indent = i = 0; i < min_count; i++) {
2553 if (orig->param[i] == new->param[i]) {
2554 fprintf(fp, " %-11p",
2558 fprintf(fp, " [%-10p %-10p]",
2564 for(; i < orig_count; i++) {
2565 fprintf(fp, " [%-9p]", orig->param[i]);
2568 for(; i < new_count; i++) {
2569 fprintf(fp, " [%-9p]", new->param[i]);
2572 if ((new->op == OP_INTCONST)||
2573 (new->op == OP_ADDRCONST)) {
2574 fprintf(fp, " <0x%08lx>",
2575 (unsigned long)(new->u.cval));
2578 for(;indent < 36; indent++) {
2582 #if DEBUG_DISPLAY_TYPES
2584 name_of(fp, new->type);
2585 if (!equiv_types(new->type, orig->type)) {
2586 fprintf(fp, " -- ");
2587 name_of(fp, orig->type);
2593 for(ptr = orig->occurance; ptr; ptr = ptr->parent) {
2594 fprintf(fp, " %s,%s:%d.%d",
2606 static int triple_is_pure(struct compile_state *state, struct triple *ins, unsigned id)
2608 /* Does the triple have no side effects.
2609 * I.e. Rexecuting the triple with the same arguments
2610 * gives the same value.
2613 valid_ins(state, ins);
2614 pure = PURE_BITS(table_ops[ins->op].flags);
2615 if ((pure != PURE) && (pure != IMPURE)) {
2616 internal_error(state, 0, "Purity of %s not known",
2619 return (pure == PURE) && !(id & TRIPLE_FLAG_VOLATILE);
2622 static int triple_is_branch_type(struct compile_state *state,
2623 struct triple *ins, unsigned type)
2625 /* Is this one of the passed branch types? */
2626 valid_ins(state, ins);
2627 return (BRANCH_BITS(table_ops[ins->op].flags) == type);
2630 static int triple_is_branch(struct compile_state *state, struct triple *ins)
2632 /* Is this triple a branch instruction? */
2633 valid_ins(state, ins);
2634 return (BRANCH_BITS(table_ops[ins->op].flags) != 0);
2637 static int triple_is_cbranch(struct compile_state *state, struct triple *ins)
2639 /* Is this triple a conditional branch instruction? */
2640 return triple_is_branch_type(state, ins, CBRANCH);
2643 static int triple_is_ubranch(struct compile_state *state, struct triple *ins)
2645 /* Is this triple a unconditional branch instruction? */
2647 valid_ins(state, ins);
2648 type = BRANCH_BITS(table_ops[ins->op].flags);
2649 return (type != 0) && (type != CBRANCH);
2652 static int triple_is_call(struct compile_state *state, struct triple *ins)
2654 /* Is this triple a call instruction? */
2655 return triple_is_branch_type(state, ins, CALLBRANCH);
2658 static int triple_is_ret(struct compile_state *state, struct triple *ins)
2660 /* Is this triple a return instruction? */
2661 return triple_is_branch_type(state, ins, RETBRANCH);
2664 #if DEBUG_ROMCC_WARNING
2665 static int triple_is_simple_ubranch(struct compile_state *state, struct triple *ins)
2667 /* Is this triple an unconditional branch and not a call or a
2669 return triple_is_branch_type(state, ins, UBRANCH);
2673 static int triple_is_end(struct compile_state *state, struct triple *ins)
2675 return triple_is_branch_type(state, ins, ENDBRANCH);
2678 static int triple_is_label(struct compile_state *state, struct triple *ins)
2680 valid_ins(state, ins);
2681 return (ins->op == OP_LABEL);
2684 static struct triple *triple_to_block_start(
2685 struct compile_state *state, struct triple *start)
2687 while(!triple_is_branch(state, start->prev) &&
2688 (!triple_is_label(state, start) || !start->use)) {
2689 start = start->prev;
2694 static int triple_is_def(struct compile_state *state, struct triple *ins)
2696 /* This function is used to determine which triples need
2700 valid_ins(state, ins);
2701 is_def = (table_ops[ins->op].flags & DEF) == DEF;
2702 if (ins->lhs >= 1) {
2708 static int triple_is_structural(struct compile_state *state, struct triple *ins)
2711 valid_ins(state, ins);
2712 is_structural = (table_ops[ins->op].flags & STRUCTURAL) == STRUCTURAL;
2713 return is_structural;
2716 static int triple_is_part(struct compile_state *state, struct triple *ins)
2719 valid_ins(state, ins);
2720 is_part = (table_ops[ins->op].flags & PART) == PART;
2724 static int triple_is_auto_var(struct compile_state *state, struct triple *ins)
2726 return (ins->op == OP_PIECE) && (MISC(ins, 0)->op == OP_ADECL);
2729 static struct triple **triple_iter(struct compile_state *state,
2730 size_t count, struct triple **vector,
2731 struct triple *ins, struct triple **last)
2733 struct triple **ret;
2739 else if ((last >= vector) && (last < (vector + count - 1))) {
2747 static struct triple **triple_lhs(struct compile_state *state,
2748 struct triple *ins, struct triple **last)
2750 return triple_iter(state, ins->lhs, &LHS(ins,0),
2754 static struct triple **triple_rhs(struct compile_state *state,
2755 struct triple *ins, struct triple **last)
2757 return triple_iter(state, ins->rhs, &RHS(ins,0),
2761 static struct triple **triple_misc(struct compile_state *state,
2762 struct triple *ins, struct triple **last)
2764 return triple_iter(state, ins->misc, &MISC(ins,0),
2768 static struct triple **do_triple_targ(struct compile_state *state,
2769 struct triple *ins, struct triple **last, int call_edges, int next_edges)
2772 struct triple **ret, **vector;
2777 if (triple_is_cbranch(state, ins)) {
2780 if (!call_edges && triple_is_call(state, ins)) {
2783 if (next_edges && triple_is_call(state, ins)) {
2786 vector = &TARG(ins, 0);
2787 if (!ret && next_is_targ) {
2790 } else if (last == &ins->next) {
2794 if (!ret && count) {
2798 else if ((last >= vector) && (last < (vector + count - 1))) {
2801 else if (last == vector + count - 1) {
2805 if (!ret && triple_is_ret(state, ins) && call_edges) {
2806 struct triple_set *use;
2807 for(use = ins->use; use; use = use->next) {
2808 if (!triple_is_call(state, use->member)) {
2812 ret = &use->member->next;
2815 else if (last == &use->member->next) {
2823 static struct triple **triple_targ(struct compile_state *state,
2824 struct triple *ins, struct triple **last)
2826 return do_triple_targ(state, ins, last, 1, 1);
2829 static struct triple **triple_edge_targ(struct compile_state *state,
2830 struct triple *ins, struct triple **last)
2832 return do_triple_targ(state, ins, last,
2833 state->functions_joined, !state->functions_joined);
2836 static struct triple *after_lhs(struct compile_state *state, struct triple *ins)
2838 struct triple *next;
2842 for(i = 0; i < lhs; i++) {
2843 struct triple *piece;
2844 piece = LHS(ins, i);
2845 if (next != piece) {
2846 internal_error(state, ins, "malformed lhs on %s",
2849 if (next->op != OP_PIECE) {
2850 internal_error(state, ins, "bad lhs op %s at %d on %s",
2851 tops(next->op), i, tops(ins->op));
2853 if (next->u.cval != i) {
2854 internal_error(state, ins, "bad u.cval of %d %d expected",
2862 /* Function piece accessor functions */
2863 static struct triple *do_farg(struct compile_state *state,
2864 struct triple *func, unsigned index)
2867 struct triple *first, *arg;
2871 if((index < 0) || (index >= (ftype->elements + 2))) {
2872 internal_error(state, func, "bad argument index: %d", index);
2874 first = RHS(func, 0);
2876 for(i = 0; i < index; i++, arg = after_lhs(state, arg)) {
2879 if (arg->op != OP_ADECL) {
2880 internal_error(state, 0, "arg not adecl?");
2884 static struct triple *fresult(struct compile_state *state, struct triple *func)
2886 return do_farg(state, func, 0);
2888 static struct triple *fretaddr(struct compile_state *state, struct triple *func)
2890 return do_farg(state, func, 1);
2892 static struct triple *farg(struct compile_state *state,
2893 struct triple *func, unsigned index)
2895 return do_farg(state, func, index + 2);
2899 static void display_func(struct compile_state *state, FILE *fp, struct triple *func)
2901 struct triple *first, *ins;
2902 fprintf(fp, "display_func %s\n", func->type->type_ident->name);
2903 first = ins = RHS(func, 0);
2905 if (triple_is_label(state, ins) && ins->use) {
2906 fprintf(fp, "%p:\n", ins);
2908 display_triple(fp, ins);
2910 if (triple_is_branch(state, ins)) {
2913 if (ins->next->prev != ins) {
2914 internal_error(state, ins->next, "bad prev");
2917 } while(ins != first);
2920 static void verify_use(struct compile_state *state,
2921 struct triple *user, struct triple *used)
2924 size = TRIPLE_SIZE(user);
2925 for(i = 0; i < size; i++) {
2926 if (user->param[i] == used) {
2930 if (triple_is_branch(state, user)) {
2931 if (user->next == used) {
2936 internal_error(state, user, "%s(%p) does not use %s(%p)",
2937 tops(user->op), user, tops(used->op), used);
2941 static int find_rhs_use(struct compile_state *state,
2942 struct triple *user, struct triple *used)
2944 struct triple **param;
2946 verify_use(state, user, used);
2948 #if DEBUG_ROMCC_WARNINGS
2949 #warning "AUDIT ME ->rhs"
2952 param = &RHS(user, 0);
2953 for(i = 0; i < size; i++) {
2954 if (param[i] == used) {
2961 static void free_triple(struct compile_state *state, struct triple *ptr)
2964 size = sizeof(*ptr) - sizeof(ptr->param) +
2965 (sizeof(ptr->param[0])*TRIPLE_SIZE(ptr));
2966 ptr->prev->next = ptr->next;
2967 ptr->next->prev = ptr->prev;
2969 internal_error(state, ptr, "ptr->use != 0");
2971 put_occurance(ptr->occurance);
2972 memset(ptr, -1, size);
2976 static void release_triple(struct compile_state *state, struct triple *ptr)
2978 struct triple_set *set, *next;
2979 struct triple **expr;
2980 struct block *block;
2981 if (ptr == &unknown_triple) {
2984 valid_ins(state, ptr);
2985 /* Make certain the we are not the first or last element of a block */
2986 block = block_of_triple(state, ptr);
2988 if ((block->last == ptr) && (block->first == ptr)) {
2989 block->last = block->first = 0;
2991 else if (block->last == ptr) {
2992 block->last = ptr->prev;
2994 else if (block->first == ptr) {
2995 block->first = ptr->next;
2998 /* Remove ptr from use chains where it is the user */
2999 expr = triple_rhs(state, ptr, 0);
3000 for(; expr; expr = triple_rhs(state, ptr, expr)) {
3002 unuse_triple(*expr, ptr);
3005 expr = triple_lhs(state, ptr, 0);
3006 for(; expr; expr = triple_lhs(state, ptr, expr)) {
3008 unuse_triple(*expr, ptr);
3011 expr = triple_misc(state, ptr, 0);
3012 for(; expr; expr = triple_misc(state, ptr, expr)) {
3014 unuse_triple(*expr, ptr);
3017 expr = triple_targ(state, ptr, 0);
3018 for(; expr; expr = triple_targ(state, ptr, expr)) {
3020 unuse_triple(*expr, ptr);
3023 /* Reomve ptr from use chains where it is used */
3024 for(set = ptr->use; set; set = next) {
3026 valid_ins(state, set->member);
3027 expr = triple_rhs(state, set->member, 0);
3028 for(; expr; expr = triple_rhs(state, set->member, expr)) {
3030 *expr = &unknown_triple;
3033 expr = triple_lhs(state, set->member, 0);
3034 for(; expr; expr = triple_lhs(state, set->member, expr)) {
3036 *expr = &unknown_triple;
3039 expr = triple_misc(state, set->member, 0);
3040 for(; expr; expr = triple_misc(state, set->member, expr)) {
3042 *expr = &unknown_triple;
3045 expr = triple_targ(state, set->member, 0);
3046 for(; expr; expr = triple_targ(state, set->member, expr)) {
3048 *expr = &unknown_triple;
3051 unuse_triple(ptr, set->member);
3053 free_triple(state, ptr);
3056 static void print_triples(struct compile_state *state);
3057 static void print_blocks(struct compile_state *state, const char *func, FILE *fp);
3059 #define TOK_UNKNOWN 0
3062 #define TOK_LBRACE 3
3063 #define TOK_RBRACE 4
3067 #define TOK_LBRACKET 8
3068 #define TOK_RBRACKET 9
3069 #define TOK_LPAREN 10
3070 #define TOK_RPAREN 11
3075 #define TOK_TIMESEQ 16
3076 #define TOK_DIVEQ 17
3077 #define TOK_MODEQ 18
3078 #define TOK_PLUSEQ 19
3079 #define TOK_MINUSEQ 20
3082 #define TOK_ANDEQ 23
3083 #define TOK_XOREQ 24
3086 #define TOK_NOTEQ 27
3087 #define TOK_QUEST 28
3088 #define TOK_LOGOR 29
3089 #define TOK_LOGAND 30
3093 #define TOK_LESSEQ 34
3094 #define TOK_MOREEQ 35
3098 #define TOK_MINUS 39
3101 #define TOK_PLUSPLUS 42
3102 #define TOK_MINUSMINUS 43
3104 #define TOK_ARROW 45
3106 #define TOK_TILDE 47
3107 #define TOK_LIT_STRING 48
3108 #define TOK_LIT_CHAR 49
3109 #define TOK_LIT_INT 50
3110 #define TOK_LIT_FLOAT 51
3111 #define TOK_MACRO 52
3112 #define TOK_CONCATENATE 53
3114 #define TOK_IDENT 54
3115 #define TOK_STRUCT_NAME 55
3116 #define TOK_ENUM_CONST 56
3117 #define TOK_TYPE_NAME 57
3120 #define TOK_BREAK 59
3123 #define TOK_CONST 62
3124 #define TOK_CONTINUE 63
3125 #define TOK_DEFAULT 64
3127 #define TOK_DOUBLE 66
3130 #define TOK_EXTERN 69
3131 #define TOK_FLOAT 70
3135 #define TOK_INLINE 74
3138 #define TOK_REGISTER 77
3139 #define TOK_RESTRICT 78
3140 #define TOK_RETURN 79
3141 #define TOK_SHORT 80
3142 #define TOK_SIGNED 81
3143 #define TOK_SIZEOF 82
3144 #define TOK_STATIC 83
3145 #define TOK_STRUCT 84
3146 #define TOK_SWITCH 85
3147 #define TOK_TYPEDEF 86
3148 #define TOK_UNION 87
3149 #define TOK_UNSIGNED 88
3151 #define TOK_VOLATILE 90
3152 #define TOK_WHILE 91
3154 #define TOK_ATTRIBUTE 93
3155 #define TOK_ALIGNOF 94
3156 #define TOK_FIRST_KEYWORD TOK_AUTO
3157 #define TOK_LAST_KEYWORD TOK_ALIGNOF
3159 #define TOK_MDEFINE 100
3160 #define TOK_MDEFINED 101
3161 #define TOK_MUNDEF 102
3162 #define TOK_MINCLUDE 103
3163 #define TOK_MLINE 104
3164 #define TOK_MERROR 105
3165 #define TOK_MWARNING 106
3166 #define TOK_MPRAGMA 107
3167 #define TOK_MIFDEF 108
3168 #define TOK_MIFNDEF 109
3169 #define TOK_MELIF 110
3170 #define TOK_MENDIF 111
3172 #define TOK_FIRST_MACRO TOK_MDEFINE
3173 #define TOK_LAST_MACRO TOK_MENDIF
3176 #define TOK_MELSE 113
3177 #define TOK_MIDENT 114
3182 static const char *tokens[] = {
3183 [TOK_UNKNOWN ] = ":unknown:",
3184 [TOK_SPACE ] = ":space:",
3186 [TOK_LBRACE ] = "{",
3187 [TOK_RBRACE ] = "}",
3191 [TOK_LBRACKET ] = "[",
3192 [TOK_RBRACKET ] = "]",
3193 [TOK_LPAREN ] = "(",
3194 [TOK_RPAREN ] = ")",
3196 [TOK_DOTS ] = "...",
3199 [TOK_TIMESEQ ] = "*=",
3200 [TOK_DIVEQ ] = "/=",
3201 [TOK_MODEQ ] = "%=",
3202 [TOK_PLUSEQ ] = "+=",
3203 [TOK_MINUSEQ ] = "-=",
3204 [TOK_SLEQ ] = "<<=",
3205 [TOK_SREQ ] = ">>=",
3206 [TOK_ANDEQ ] = "&=",
3207 [TOK_XOREQ ] = "^=",
3210 [TOK_NOTEQ ] = "!=",
3212 [TOK_LOGOR ] = "||",
3213 [TOK_LOGAND ] = "&&",
3217 [TOK_LESSEQ ] = "<=",
3218 [TOK_MOREEQ ] = ">=",
3225 [TOK_PLUSPLUS ] = "++",
3226 [TOK_MINUSMINUS ] = "--",
3228 [TOK_ARROW ] = "->",
3231 [TOK_LIT_STRING ] = ":string:",
3232 [TOK_IDENT ] = ":ident:",
3233 [TOK_TYPE_NAME ] = ":typename:",
3234 [TOK_LIT_CHAR ] = ":char:",
3235 [TOK_LIT_INT ] = ":integer:",
3236 [TOK_LIT_FLOAT ] = ":float:",
3238 [TOK_CONCATENATE ] = "##",
3240 [TOK_AUTO ] = "auto",
3241 [TOK_BREAK ] = "break",
3242 [TOK_CASE ] = "case",
3243 [TOK_CHAR ] = "char",
3244 [TOK_CONST ] = "const",
3245 [TOK_CONTINUE ] = "continue",
3246 [TOK_DEFAULT ] = "default",
3248 [TOK_DOUBLE ] = "double",
3249 [TOK_ELSE ] = "else",
3250 [TOK_ENUM ] = "enum",
3251 [TOK_EXTERN ] = "extern",
3252 [TOK_FLOAT ] = "float",
3254 [TOK_GOTO ] = "goto",
3256 [TOK_INLINE ] = "inline",
3258 [TOK_LONG ] = "long",
3259 [TOK_REGISTER ] = "register",
3260 [TOK_RESTRICT ] = "restrict",
3261 [TOK_RETURN ] = "return",
3262 [TOK_SHORT ] = "short",
3263 [TOK_SIGNED ] = "signed",
3264 [TOK_SIZEOF ] = "sizeof",
3265 [TOK_STATIC ] = "static",
3266 [TOK_STRUCT ] = "struct",
3267 [TOK_SWITCH ] = "switch",
3268 [TOK_TYPEDEF ] = "typedef",
3269 [TOK_UNION ] = "union",
3270 [TOK_UNSIGNED ] = "unsigned",
3271 [TOK_VOID ] = "void",
3272 [TOK_VOLATILE ] = "volatile",
3273 [TOK_WHILE ] = "while",
3275 [TOK_ATTRIBUTE ] = "__attribute__",
3276 [TOK_ALIGNOF ] = "__alignof__",
3278 [TOK_MDEFINE ] = "#define",
3279 [TOK_MDEFINED ] = "#defined",
3280 [TOK_MUNDEF ] = "#undef",
3281 [TOK_MINCLUDE ] = "#include",
3282 [TOK_MLINE ] = "#line",
3283 [TOK_MERROR ] = "#error",
3284 [TOK_MWARNING ] = "#warning",
3285 [TOK_MPRAGMA ] = "#pragma",
3286 [TOK_MIFDEF ] = "#ifdef",
3287 [TOK_MIFNDEF ] = "#ifndef",
3288 [TOK_MELIF ] = "#elif",
3289 [TOK_MENDIF ] = "#endif",
3292 [TOK_MELSE ] = "#else",
3293 [TOK_MIDENT ] = "#:ident:",
3298 static unsigned int hash(const char *str, int str_len)
3302 end = str + str_len;
3304 for(; str < end; str++) {
3305 hash = (hash *263) + *str;
3307 hash = hash & (HASH_TABLE_SIZE -1);
3311 static struct hash_entry *lookup(
3312 struct compile_state *state, const char *name, int name_len)
3314 struct hash_entry *entry;
3316 index = hash(name, name_len);
3317 entry = state->hash_table[index];
3319 ((entry->name_len != name_len) ||
3320 (memcmp(entry->name, name, name_len) != 0))) {
3321 entry = entry->next;
3325 /* Get a private copy of the name */
3326 new_name = xmalloc(name_len + 1, "hash_name");
3327 memcpy(new_name, name, name_len);
3328 new_name[name_len] = '\0';
3330 /* Create a new hash entry */
3331 entry = xcmalloc(sizeof(*entry), "hash_entry");
3332 entry->next = state->hash_table[index];
3333 entry->name = new_name;
3334 entry->name_len = name_len;
3336 /* Place the new entry in the hash table */
3337 state->hash_table[index] = entry;
3342 static void ident_to_keyword(struct compile_state *state, struct token *tk)
3344 struct hash_entry *entry;
3346 if (entry && ((entry->tok == TOK_TYPE_NAME) ||
3347 (entry->tok == TOK_ENUM_CONST) ||
3348 ((entry->tok >= TOK_FIRST_KEYWORD) &&
3349 (entry->tok <= TOK_LAST_KEYWORD)))) {
3350 tk->tok = entry->tok;
3354 static void ident_to_macro(struct compile_state *state, struct token *tk)
3356 struct hash_entry *entry;
3360 if ((entry->tok >= TOK_FIRST_MACRO) && (entry->tok <= TOK_LAST_MACRO)) {
3361 tk->tok = entry->tok;
3363 else if (entry->tok == TOK_IF) {
3366 else if (entry->tok == TOK_ELSE) {
3367 tk->tok = TOK_MELSE;
3370 tk->tok = TOK_MIDENT;
3374 static void hash_keyword(
3375 struct compile_state *state, const char *keyword, int tok)
3377 struct hash_entry *entry;
3378 entry = lookup(state, keyword, strlen(keyword));
3379 if (entry && entry->tok != TOK_UNKNOWN) {
3380 die("keyword %s already hashed", keyword);
3385 static void romcc_symbol(
3386 struct compile_state *state, struct hash_entry *ident,
3387 struct symbol **chain, struct triple *def, struct type *type, int depth)
3390 if (*chain && ((*chain)->scope_depth >= depth)) {
3391 error(state, 0, "%s already defined", ident->name);
3393 sym = xcmalloc(sizeof(*sym), "symbol");
3397 sym->scope_depth = depth;
3403 struct compile_state *state, struct hash_entry *ident,
3404 struct symbol **chain, struct triple *def, struct type *type)
3406 romcc_symbol(state, ident, chain, def, type, state->scope_depth);
3409 static void var_symbol(struct compile_state *state,
3410 struct hash_entry *ident, struct triple *def)
3412 if ((def->type->type & TYPE_MASK) == TYPE_PRODUCT) {
3413 internal_error(state, 0, "bad var type");
3415 symbol(state, ident, &ident->sym_ident, def, def->type);
3418 static void label_symbol(struct compile_state *state,
3419 struct hash_entry *ident, struct triple *label, int depth)
3421 romcc_symbol(state, ident, &ident->sym_label, label, &void_type, depth);
3424 static void start_scope(struct compile_state *state)
3426 state->scope_depth++;
3429 static void end_scope_syms(struct compile_state *state,
3430 struct symbol **chain, int depth)
3432 struct symbol *sym, *next;
3434 while(sym && (sym->scope_depth == depth)) {
3442 static void end_scope(struct compile_state *state)
3446 /* Walk through the hash table and remove all symbols
3447 * in the current scope.
3449 depth = state->scope_depth;
3450 for(i = 0; i < HASH_TABLE_SIZE; i++) {
3451 struct hash_entry *entry;
3452 entry = state->hash_table[i];
3454 end_scope_syms(state, &entry->sym_label, depth);
3455 end_scope_syms(state, &entry->sym_tag, depth);
3456 end_scope_syms(state, &entry->sym_ident, depth);
3457 entry = entry->next;
3460 state->scope_depth = depth - 1;
3463 static void register_keywords(struct compile_state *state)
3465 hash_keyword(state, "auto", TOK_AUTO);
3466 hash_keyword(state, "break", TOK_BREAK);
3467 hash_keyword(state, "case", TOK_CASE);
3468 hash_keyword(state, "char", TOK_CHAR);
3469 hash_keyword(state, "const", TOK_CONST);
3470 hash_keyword(state, "continue", TOK_CONTINUE);
3471 hash_keyword(state, "default", TOK_DEFAULT);
3472 hash_keyword(state, "do", TOK_DO);
3473 hash_keyword(state, "double", TOK_DOUBLE);
3474 hash_keyword(state, "else", TOK_ELSE);
3475 hash_keyword(state, "enum", TOK_ENUM);
3476 hash_keyword(state, "extern", TOK_EXTERN);
3477 hash_keyword(state, "float", TOK_FLOAT);
3478 hash_keyword(state, "for", TOK_FOR);
3479 hash_keyword(state, "goto", TOK_GOTO);
3480 hash_keyword(state, "if", TOK_IF);
3481 hash_keyword(state, "inline", TOK_INLINE);
3482 hash_keyword(state, "int", TOK_INT);
3483 hash_keyword(state, "long", TOK_LONG);
3484 hash_keyword(state, "register", TOK_REGISTER);
3485 hash_keyword(state, "restrict", TOK_RESTRICT);
3486 hash_keyword(state, "return", TOK_RETURN);
3487 hash_keyword(state, "short", TOK_SHORT);
3488 hash_keyword(state, "signed", TOK_SIGNED);
3489 hash_keyword(state, "sizeof", TOK_SIZEOF);
3490 hash_keyword(state, "static", TOK_STATIC);
3491 hash_keyword(state, "struct", TOK_STRUCT);
3492 hash_keyword(state, "switch", TOK_SWITCH);
3493 hash_keyword(state, "typedef", TOK_TYPEDEF);
3494 hash_keyword(state, "union", TOK_UNION);
3495 hash_keyword(state, "unsigned", TOK_UNSIGNED);
3496 hash_keyword(state, "void", TOK_VOID);
3497 hash_keyword(state, "volatile", TOK_VOLATILE);
3498 hash_keyword(state, "__volatile__", TOK_VOLATILE);
3499 hash_keyword(state, "while", TOK_WHILE);
3500 hash_keyword(state, "asm", TOK_ASM);
3501 hash_keyword(state, "__asm__", TOK_ASM);
3502 hash_keyword(state, "__attribute__", TOK_ATTRIBUTE);
3503 hash_keyword(state, "__alignof__", TOK_ALIGNOF);
3506 static void register_macro_keywords(struct compile_state *state)
3508 hash_keyword(state, "define", TOK_MDEFINE);
3509 hash_keyword(state, "defined", TOK_MDEFINED);
3510 hash_keyword(state, "undef", TOK_MUNDEF);
3511 hash_keyword(state, "include", TOK_MINCLUDE);
3512 hash_keyword(state, "line", TOK_MLINE);
3513 hash_keyword(state, "error", TOK_MERROR);
3514 hash_keyword(state, "warning", TOK_MWARNING);
3515 hash_keyword(state, "pragma", TOK_MPRAGMA);
3516 hash_keyword(state, "ifdef", TOK_MIFDEF);
3517 hash_keyword(state, "ifndef", TOK_MIFNDEF);
3518 hash_keyword(state, "elif", TOK_MELIF);
3519 hash_keyword(state, "endif", TOK_MENDIF);
3523 static void undef_macro(struct compile_state *state, struct hash_entry *ident)
3525 if (ident->sym_define != 0) {
3526 struct macro *macro;
3527 struct macro_arg *arg, *anext;
3528 macro = ident->sym_define;
3529 ident->sym_define = 0;
3531 /* Free the macro arguments... */
3532 anext = macro->args;
3539 /* Free the macro buffer */
3542 /* Now free the macro itself */
3547 static void do_define_macro(struct compile_state *state,
3548 struct hash_entry *ident, const char *body,
3549 int argc, struct macro_arg *args)
3551 struct macro *macro;
3552 struct macro_arg *arg;
3555 /* Find the length of the body */
3556 body_len = strlen(body);
3557 macro = ident->sym_define;
3559 int identical_bodies, identical_args;
3560 struct macro_arg *oarg;
3561 /* Explicitly allow identical redfinitions of the same macro */
3563 (macro->buf_len == body_len) &&
3564 (memcmp(macro->buf, body, body_len) == 0);
3565 identical_args = macro->argc == argc;
3568 while(identical_args && arg) {
3569 identical_args = oarg->ident == arg->ident;
3573 if (identical_bodies && identical_args) {
3577 error(state, 0, "macro %s already defined\n", ident->name);
3580 fprintf(state->errout, "#define %s: `%*.*s'\n",
3581 ident->name, body_len, body_len, body);
3583 macro = xmalloc(sizeof(*macro), "macro");
3584 macro->ident = ident;
3586 macro->buf_len = body_len;
3590 ident->sym_define = macro;
3593 static void define_macro(
3594 struct compile_state *state,
3595 struct hash_entry *ident,
3596 const char *body, int body_len,
3597 int argc, struct macro_arg *args)
3600 buf = xmalloc(body_len + 1, "macro buf");
3601 memcpy(buf, body, body_len);
3602 buf[body_len] = '\0';
3603 do_define_macro(state, ident, buf, argc, args);
3606 static void register_builtin_macro(struct compile_state *state,
3607 const char *name, const char *value)
3609 struct hash_entry *ident;
3611 if (value[0] == '(') {
3612 internal_error(state, 0, "Builtin macros with arguments not supported");
3614 ident = lookup(state, name, strlen(name));
3615 define_macro(state, ident, value, strlen(value), -1, 0);
3618 static void register_builtin_macros(struct compile_state *state)
3625 tm = localtime(&now);
3627 register_builtin_macro(state, "__ROMCC__", VERSION_MAJOR);
3628 register_builtin_macro(state, "__ROMCC_MINOR__", VERSION_MINOR);
3629 register_builtin_macro(state, "__FILE__", "\"This should be the filename\"");
3630 register_builtin_macro(state, "__LINE__", "54321");
3632 strftime(scratch, sizeof(scratch), "%b %e %Y", tm);
3633 sprintf(buf, "\"%s\"", scratch);
3634 register_builtin_macro(state, "__DATE__", buf);
3636 strftime(scratch, sizeof(scratch), "%H:%M:%S", tm);
3637 sprintf(buf, "\"%s\"", scratch);
3638 register_builtin_macro(state, "__TIME__", buf);
3640 /* I can't be a conforming implementation of C :( */
3641 register_builtin_macro(state, "__STDC__", "0");
3642 /* In particular I don't conform to C99 */
3643 register_builtin_macro(state, "__STDC_VERSION__", "199901L");
3647 static void process_cmdline_macros(struct compile_state *state)
3649 const char **macro, *name;
3650 struct hash_entry *ident;
3651 for(macro = state->compiler->defines; (name = *macro); macro++) {
3655 name_len = strlen(name);
3656 body = strchr(name, '=');
3660 name_len = body - name;
3663 ident = lookup(state, name, name_len);
3664 define_macro(state, ident, body, strlen(body), -1, 0);
3666 for(macro = state->compiler->undefs; (name = *macro); macro++) {
3667 ident = lookup(state, name, strlen(name));
3668 undef_macro(state, ident);
3672 static int spacep(int c)
3687 static int digitp(int c)
3691 case '0': case '1': case '2': case '3': case '4':
3692 case '5': case '6': case '7': case '8': case '9':
3698 static int digval(int c)
3701 if ((c >= '0') && (c <= '9')) {
3707 static int hexdigitp(int c)
3711 case '0': case '1': case '2': case '3': case '4':
3712 case '5': case '6': case '7': case '8': case '9':
3713 case 'A': case 'B': case 'C': case 'D': case 'E': case 'F':
3714 case 'a': case 'b': case 'c': case 'd': case 'e': case 'f':
3720 static int hexdigval(int c)
3723 if ((c >= '0') && (c <= '9')) {
3726 else if ((c >= 'A') && (c <= 'F')) {
3727 val = 10 + (c - 'A');
3729 else if ((c >= 'a') && (c <= 'f')) {
3730 val = 10 + (c - 'a');
3735 static int octdigitp(int c)
3739 case '0': case '1': case '2': case '3':
3740 case '4': case '5': case '6': case '7':
3746 static int octdigval(int c)
3749 if ((c >= '0') && (c <= '7')) {
3755 static int letterp(int c)
3759 case 'a': case 'b': case 'c': case 'd': case 'e':
3760 case 'f': case 'g': case 'h': case 'i': case 'j':
3761 case 'k': case 'l': case 'm': case 'n': case 'o':
3762 case 'p': case 'q': case 'r': case 's': case 't':
3763 case 'u': case 'v': case 'w': case 'x': case 'y':
3765 case 'A': case 'B': case 'C': case 'D': case 'E':
3766 case 'F': case 'G': case 'H': case 'I': case 'J':
3767 case 'K': case 'L': case 'M': case 'N': case 'O':
3768 case 'P': case 'Q': case 'R': case 'S': case 'T':
3769 case 'U': case 'V': case 'W': case 'X': case 'Y':
3778 static const char *identifier(const char *str, const char *end)
3780 if (letterp(*str)) {
3781 for(; str < end; str++) {
3784 if (!letterp(c) && !digitp(c)) {
3792 static int char_value(struct compile_state *state,
3793 const signed char **strp, const signed char *end)
3795 const signed char *str;
3799 if ((c == '\\') && (str < end)) {
3801 case 'n': c = '\n'; str++; break;
3802 case 't': c = '\t'; str++; break;
3803 case 'v': c = '\v'; str++; break;
3804 case 'b': c = '\b'; str++; break;
3805 case 'r': c = '\r'; str++; break;
3806 case 'f': c = '\f'; str++; break;
3807 case 'a': c = '\a'; str++; break;
3808 case '\\': c = '\\'; str++; break;
3809 case '?': c = '?'; str++; break;
3810 case '\'': c = '\''; str++; break;
3811 case '"': c = '"'; str++; break;
3815 while((str < end) && hexdigitp(*str)) {
3817 c += hexdigval(*str);
3821 case '0': case '1': case '2': case '3':
3822 case '4': case '5': case '6': case '7':
3824 while((str < end) && octdigitp(*str)) {
3826 c += octdigval(*str);
3831 error(state, 0, "Invalid character constant");
3839 static const char *next_char(struct file_state *file, const char *pos, int index)
3841 const char *end = file->buf + file->size;
3843 /* Lookup the character */
3846 /* Is this a trigraph? */
3847 if (file->trigraphs &&
3848 (c == '?') && ((end - pos) >= 3) && (pos[1] == '?'))
3851 case '=': c = '#'; break;
3852 case '/': c = '\\'; break;
3853 case '\'': c = '^'; break;
3854 case '(': c = '['; break;
3855 case ')': c = ']'; break;
3856 case '!': c = '!'; break;
3857 case '<': c = '{'; break;
3858 case '>': c = '}'; break;
3859 case '-': c = '~'; break;
3865 /* Is this an escaped newline? */
3866 if (file->join_lines &&
3867 (c == '\\') && (pos + size < end) && ((pos[1] == '\n') || ((pos[1] == '\r') && (pos[2] == '\n'))))
3869 int cr_offset = ((pos[1] == '\r') && (pos[2] == '\n'))?1:0;
3870 /* At the start of a line just eat it */
3871 if (pos == file->pos) {
3873 file->report_line++;
3874 file->line_start = pos + size + 1 + cr_offset;
3876 pos += size + 1 + cr_offset;
3878 /* Do I need to ga any farther? */
3879 else if (index == 0) {
3882 /* Process a normal character */
3891 static int get_char(struct file_state *file, const char *pos)
3893 const char *end = file->buf + file->size;
3896 pos = next_char(file, pos, 0);
3898 /* Lookup the character */
3900 /* If it is a trigraph get the trigraph value */
3901 if (file->trigraphs &&
3902 (c == '?') && ((end - pos) >= 3) && (pos[1] == '?'))
3905 case '=': c = '#'; break;
3906 case '/': c = '\\'; break;
3907 case '\'': c = '^'; break;
3908 case '(': c = '['; break;
3909 case ')': c = ']'; break;
3910 case '!': c = '!'; break;
3911 case '<': c = '{'; break;
3912 case '>': c = '}'; break;
3913 case '-': c = '~'; break;
3920 static void eat_chars(struct file_state *file, const char *targ)
3922 const char *pos = file->pos;
3924 /* Do we have a newline? */
3925 if (pos[0] == '\n') {
3927 file->report_line++;
3928 file->line_start = pos + 1;
3936 static size_t char_strlen(struct file_state *file, const char *src, const char *end)
3941 src = next_char(file, src, 1);
3947 static void char_strcpy(char *dest,
3948 struct file_state *file, const char *src, const char *end)
3952 c = get_char(file, src);
3953 src = next_char(file, src, 1);
3958 static char *char_strdup(struct file_state *file,
3959 const char *start, const char *end, const char *id)
3963 str_len = char_strlen(file, start, end);
3964 str = xcmalloc(str_len + 1, id);
3965 char_strcpy(str, file, start, end);
3966 str[str_len] = '\0';
3970 static const char *after_digits(struct file_state *file, const char *ptr)
3972 while(digitp(get_char(file, ptr))) {
3973 ptr = next_char(file, ptr, 1);
3978 static const char *after_octdigits(struct file_state *file, const char *ptr)
3980 while(octdigitp(get_char(file, ptr))) {
3981 ptr = next_char(file, ptr, 1);
3986 static const char *after_hexdigits(struct file_state *file, const char *ptr)
3988 while(hexdigitp(get_char(file, ptr))) {
3989 ptr = next_char(file, ptr, 1);
3994 static const char *after_alnums(struct file_state *file, const char *ptr)
3997 c = get_char(file, ptr);
3998 while(letterp(c) || digitp(c)) {
3999 ptr = next_char(file, ptr, 1);
4000 c = get_char(file, ptr);
4005 static void save_string(struct file_state *file,
4006 struct token *tk, const char *start, const char *end, const char *id)
4010 /* Create a private copy of the string */
4011 str = char_strdup(file, start, end, id);
4013 /* Store the copy in the token */
4015 tk->str_len = strlen(str);
4018 static void raw_next_token(struct compile_state *state,
4019 struct file_state *file, struct token *tk)
4029 token = tokp = next_char(file, file->pos, 0);
4031 c = get_char(file, tokp);
4032 tokp = next_char(file, tokp, 1);
4034 c1 = get_char(file, tokp);
4035 c2 = get_char(file, next_char(file, tokp, 1));
4036 c3 = get_char(file, next_char(file, tokp, 2));
4038 /* The end of the file */
4043 else if (spacep(c)) {
4045 while (spacep(get_char(file, tokp))) {
4046 tokp = next_char(file, tokp, 1);
4050 else if ((c == '/') && (c1 == '/')) {
4052 tokp = next_char(file, tokp, 1);
4053 while((c = get_char(file, tokp)) != -1) {
4054 /* Advance to the next character only after we verify
4055 * the current character is not a newline.
4056 * EOL is special to the preprocessor so we don't
4057 * want to loose any.
4062 tokp = next_char(file, tokp, 1);
4066 else if ((c == '/') && (c1 == '*')) {
4067 tokp = next_char(file, tokp, 2);
4069 while((c1 = get_char(file, tokp)) != -1) {
4070 tokp = next_char(file, tokp, 1);
4071 if ((c == '*') && (c1 == '/')) {
4077 if (tok == TOK_UNKNOWN) {
4078 error(state, 0, "unterminated comment");
4081 /* string constants */
4082 else if ((c == '"') || ((c == 'L') && (c1 == '"'))) {
4087 tokp = next_char(file, tokp, 1);
4089 while((c = get_char(file, tokp)) != -1) {
4090 tokp = next_char(file, tokp, 1);
4094 else if (c == '\\') {
4095 tokp = next_char(file, tokp, 1);
4097 else if (c == '"') {
4098 tok = TOK_LIT_STRING;
4102 if (tok == TOK_UNKNOWN) {
4103 error(state, 0, "unterminated string constant");
4106 warning(state, 0, "multiline string constant");
4109 /* Save the string value */
4110 save_string(file, tk, token, tokp, "literal string");
4112 /* character constants */
4113 else if ((c == '\'') || ((c == 'L') && (c1 == '\''))) {
4118 tokp = next_char(file, tokp, 1);
4120 while((c = get_char(file, tokp)) != -1) {
4121 tokp = next_char(file, tokp, 1);
4125 else if (c == '\\') {
4126 tokp = next_char(file, tokp, 1);
4128 else if (c == '\'') {
4133 if (tok == TOK_UNKNOWN) {
4134 error(state, 0, "unterminated character constant");
4137 warning(state, 0, "multiline character constant");
4140 /* Save the character value */
4141 save_string(file, tk, token, tokp, "literal character");
4143 /* integer and floating constants
4149 * Floating constants
4150 * {digits}.{digits}[Ee][+-]?{digits}
4152 * {digits}[Ee][+-]?{digits}
4153 * .{digits}[Ee][+-]?{digits}
4156 else if (digitp(c) || ((c == '.') && (digitp(c1)))) {
4162 next = after_digits(file, tokp);
4167 cn = get_char(file, next);
4169 next = next_char(file, next, 1);
4170 next = after_digits(file, next);
4173 cn = get_char(file, next);
4174 if ((cn == 'e') || (cn == 'E')) {
4176 next = next_char(file, next, 1);
4177 cn = get_char(file, next);
4178 if ((cn == '+') || (cn == '-')) {
4179 next = next_char(file, next, 1);
4181 new = after_digits(file, next);
4182 is_float |= (new != next);
4186 tok = TOK_LIT_FLOAT;
4187 cn = get_char(file, next);
4188 if ((cn == 'f') || (cn == 'F') || (cn == 'l') || (cn == 'L')) {
4189 next = next_char(file, next, 1);
4192 if (!is_float && digitp(c)) {
4194 if ((c == '0') && ((c1 == 'x') || (c1 == 'X'))) {
4195 next = next_char(file, tokp, 1);
4196 next = after_hexdigits(file, next);
4198 else if (c == '0') {
4199 next = after_octdigits(file, tokp);
4202 next = after_digits(file, tokp);
4204 /* crazy integer suffixes */
4205 cn = get_char(file, next);
4206 if ((cn == 'u') || (cn == 'U')) {
4207 next = next_char(file, next, 1);
4208 cn = get_char(file, next);
4209 if ((cn == 'l') || (cn == 'L')) {
4210 next = next_char(file, next, 1);
4211 cn = get_char(file, next);
4213 if ((cn == 'l') || (cn == 'L')) {
4214 next = next_char(file, next, 1);
4217 else if ((cn == 'l') || (cn == 'L')) {
4218 next = next_char(file, next, 1);
4219 cn = get_char(file, next);
4220 if ((cn == 'l') || (cn == 'L')) {
4221 next = next_char(file, next, 1);
4222 cn = get_char(file, next);
4224 if ((cn == 'u') || (cn == 'U')) {
4225 next = next_char(file, next, 1);
4231 /* Save the integer/floating point value */
4232 save_string(file, tk, token, tokp, "literal number");
4235 else if (letterp(c)) {
4238 /* Find and save the identifier string */
4239 tokp = after_alnums(file, tokp);
4240 save_string(file, tk, token, tokp, "identifier");
4242 /* Look up to see which identifier it is */
4243 tk->ident = lookup(state, tk->val.str, tk->str_len);
4245 /* Free the identifier string */
4249 /* See if this identifier can be macro expanded */
4250 tk->val.notmacro = 0;
4251 c = get_char(file, tokp);
4253 tokp = next_char(file, tokp, 1);
4254 tk->val.notmacro = 1;
4257 /* C99 alternate macro characters */
4258 else if ((c == '%') && (c1 == ':') && (c2 == '%') && (c3 == ':')) {
4260 tok = TOK_CONCATENATE;
4262 else if ((c == '.') && (c1 == '.') && (c2 == '.')) { eat += 2; tok = TOK_DOTS; }
4263 else if ((c == '<') && (c1 == '<') && (c2 == '=')) { eat += 2; tok = TOK_SLEQ; }
4264 else if ((c == '>') && (c1 == '>') && (c2 == '=')) { eat += 2; tok = TOK_SREQ; }
4265 else if ((c == '*') && (c1 == '=')) { eat += 1; tok = TOK_TIMESEQ; }
4266 else if ((c == '/') && (c1 == '=')) { eat += 1; tok = TOK_DIVEQ; }
4267 else if ((c == '%') && (c1 == '=')) { eat += 1; tok = TOK_MODEQ; }
4268 else if ((c == '+') && (c1 == '=')) { eat += 1; tok = TOK_PLUSEQ; }
4269 else if ((c == '-') && (c1 == '=')) { eat += 1; tok = TOK_MINUSEQ; }
4270 else if ((c == '&') && (c1 == '=')) { eat += 1; tok = TOK_ANDEQ; }
4271 else if ((c == '^') && (c1 == '=')) { eat += 1; tok = TOK_XOREQ; }
4272 else if ((c == '|') && (c1 == '=')) { eat += 1; tok = TOK_OREQ; }
4273 else if ((c == '=') && (c1 == '=')) { eat += 1; tok = TOK_EQEQ; }
4274 else if ((c == '!') && (c1 == '=')) { eat += 1; tok = TOK_NOTEQ; }
4275 else if ((c == '|') && (c1 == '|')) { eat += 1; tok = TOK_LOGOR; }
4276 else if ((c == '&') && (c1 == '&')) { eat += 1; tok = TOK_LOGAND; }
4277 else if ((c == '<') && (c1 == '=')) { eat += 1; tok = TOK_LESSEQ; }
4278 else if ((c == '>') && (c1 == '=')) { eat += 1; tok = TOK_MOREEQ; }
4279 else if ((c == '<') && (c1 == '<')) { eat += 1; tok = TOK_SL; }
4280 else if ((c == '>') && (c1 == '>')) { eat += 1; tok = TOK_SR; }
4281 else if ((c == '+') && (c1 == '+')) { eat += 1; tok = TOK_PLUSPLUS; }
4282 else if ((c == '-') && (c1 == '-')) { eat += 1; tok = TOK_MINUSMINUS; }
4283 else if ((c == '-') && (c1 == '>')) { eat += 1; tok = TOK_ARROW; }
4284 else if ((c == '<') && (c1 == ':')) { eat += 1; tok = TOK_LBRACKET; }
4285 else if ((c == ':') && (c1 == '>')) { eat += 1; tok = TOK_RBRACKET; }
4286 else if ((c == '<') && (c1 == '%')) { eat += 1; tok = TOK_LBRACE; }
4287 else if ((c == '%') && (c1 == '>')) { eat += 1; tok = TOK_RBRACE; }
4288 else if ((c == '%') && (c1 == ':')) { eat += 1; tok = TOK_MACRO; }
4289 else if ((c == '#') && (c1 == '#')) { eat += 1; tok = TOK_CONCATENATE; }
4290 else if (c == ';') { tok = TOK_SEMI; }
4291 else if (c == '{') { tok = TOK_LBRACE; }
4292 else if (c == '}') { tok = TOK_RBRACE; }
4293 else if (c == ',') { tok = TOK_COMMA; }
4294 else if (c == '=') { tok = TOK_EQ; }
4295 else if (c == ':') { tok = TOK_COLON; }
4296 else if (c == '[') { tok = TOK_LBRACKET; }
4297 else if (c == ']') { tok = TOK_RBRACKET; }
4298 else if (c == '(') { tok = TOK_LPAREN; }
4299 else if (c == ')') { tok = TOK_RPAREN; }
4300 else if (c == '*') { tok = TOK_STAR; }
4301 else if (c == '>') { tok = TOK_MORE; }
4302 else if (c == '<') { tok = TOK_LESS; }
4303 else if (c == '?') { tok = TOK_QUEST; }
4304 else if (c == '|') { tok = TOK_OR; }
4305 else if (c == '&') { tok = TOK_AND; }
4306 else if (c == '^') { tok = TOK_XOR; }
4307 else if (c == '+') { tok = TOK_PLUS; }
4308 else if (c == '-') { tok = TOK_MINUS; }
4309 else if (c == '/') { tok = TOK_DIV; }
4310 else if (c == '%') { tok = TOK_MOD; }
4311 else if (c == '!') { tok = TOK_BANG; }
4312 else if (c == '.') { tok = TOK_DOT; }
4313 else if (c == '~') { tok = TOK_TILDE; }
4314 else if (c == '#') { tok = TOK_MACRO; }
4315 else if (c == '\n') { tok = TOK_EOL; }
4317 tokp = next_char(file, tokp, eat);
4318 eat_chars(file, tokp);
4323 static void check_tok(struct compile_state *state, struct token *tk, int tok)
4325 if (tk->tok != tok) {
4326 const char *name1, *name2;
4327 name1 = tokens[tk->tok];
4329 if ((tk->tok == TOK_IDENT) || (tk->tok == TOK_MIDENT)) {
4330 name2 = tk->ident->name;
4332 error(state, 0, "\tfound %s %s expected %s",
4333 name1, name2, tokens[tok]);
4337 struct macro_arg_value {
4338 struct hash_entry *ident;
4342 static struct macro_arg_value *read_macro_args(
4343 struct compile_state *state, struct macro *macro,
4344 struct file_state *file, struct token *tk)
4346 struct macro_arg_value *argv;
4347 struct macro_arg *arg;
4351 if (macro->argc == 0) {
4353 raw_next_token(state, file, tk);
4354 } while(tk->tok == TOK_SPACE);
4357 argv = xcmalloc(sizeof(*argv) * macro->argc, "macro args");
4358 for(i = 0, arg = macro->args; arg; arg = arg->next, i++) {
4361 argv[i].ident = arg->ident;
4370 raw_next_token(state, file, tk);
4372 if (!paren_depth && (tk->tok == TOK_COMMA) &&
4373 (argv[i].ident != state->i___VA_ARGS__))
4376 if (i >= macro->argc) {
4377 error(state, 0, "too many args to %s\n",
4378 macro->ident->name);
4383 if (tk->tok == TOK_LPAREN) {
4387 if (tk->tok == TOK_RPAREN) {
4388 if (paren_depth == 0) {
4393 if (tk->tok == TOK_EOF) {
4394 error(state, 0, "End of file encountered while parsing macro arguments");
4397 len = char_strlen(file, start, file->pos);
4398 argv[i].value = xrealloc(
4399 argv[i].value, argv[i].len + len, "macro args");
4400 char_strcpy((char *)argv[i].value + argv[i].len, file, start, file->pos);
4403 if (i != macro->argc -1) {
4404 error(state, 0, "missing %s arg %d\n",
4405 macro->ident->name, i +2);
4411 static void free_macro_args(struct macro *macro, struct macro_arg_value *argv)
4414 for(i = 0; i < macro->argc; i++) {
4415 xfree(argv[i].value);
4425 static void grow_macro_buf(struct compile_state *state,
4426 const char *id, struct macro_buf *buf,
4429 if ((buf->pos + grow) >= buf->len) {
4430 buf->str = xrealloc(buf->str, buf->len + grow, id);
4435 static void append_macro_text(struct compile_state *state,
4436 const char *id, struct macro_buf *buf,
4437 const char *fstart, size_t flen)
4439 grow_macro_buf(state, id, buf, flen);
4440 memcpy(buf->str + buf->pos, fstart, flen);
4442 fprintf(state->errout, "append: `%*.*s' `%*.*s'\n",
4443 buf->pos, buf->pos, buf->str,
4444 flen, flen, buf->str + buf->pos);
4450 static void append_macro_chars(struct compile_state *state,
4451 const char *id, struct macro_buf *buf,
4452 struct file_state *file, const char *start, const char *end)
4455 flen = char_strlen(file, start, end);
4456 grow_macro_buf(state, id, buf, flen);
4457 char_strcpy(buf->str + buf->pos, file, start, end);
4459 fprintf(state->errout, "append: `%*.*s' `%*.*s'\n",
4460 buf->pos, buf->pos, buf->str,
4461 flen, flen, buf->str + buf->pos);
4466 static int compile_macro(struct compile_state *state,
4467 struct file_state **filep, struct token *tk);
4469 static void macro_expand_args(struct compile_state *state,
4470 struct macro *macro, struct macro_arg_value *argv, struct token *tk)
4474 for(i = 0; i < macro->argc; i++) {
4475 struct file_state fmacro, *file;
4476 struct macro_buf buf;
4479 fmacro.basename = argv[i].ident->name;
4480 fmacro.dirname = "";
4481 fmacro.buf = (char *)argv[i].value;
4482 fmacro.size = argv[i].len;
4483 fmacro.pos = fmacro.buf;
4485 fmacro.line_start = fmacro.buf;
4486 fmacro.report_line = 1;
4487 fmacro.report_name = fmacro.basename;
4488 fmacro.report_dir = fmacro.dirname;
4490 fmacro.trigraphs = 0;
4491 fmacro.join_lines = 0;
4493 buf.len = argv[i].len;
4494 buf.str = xmalloc(buf.len, argv[i].ident->name);
4499 raw_next_token(state, file, tk);
4501 /* If we have recursed into another macro body
4504 if (tk->tok == TOK_EOF) {
4505 struct file_state *old;
4511 /* old->basename is used keep it */
4512 xfree(old->dirname);
4517 else if (tk->ident && tk->ident->sym_define) {
4518 if (compile_macro(state, &file, tk)) {
4523 append_macro_chars(state, macro->ident->name, &buf,
4524 file, tk->pos, file->pos);
4527 xfree(argv[i].value);
4528 argv[i].value = buf.str;
4529 argv[i].len = buf.pos;
4534 static void expand_macro(struct compile_state *state,
4535 struct macro *macro, struct macro_buf *buf,
4536 struct macro_arg_value *argv, struct token *tk)
4538 struct file_state fmacro;
4539 const char space[] = " ";
4544 /* Place the macro body in a dummy file */
4546 fmacro.basename = macro->ident->name;
4547 fmacro.dirname = "";
4548 fmacro.buf = macro->buf;
4549 fmacro.size = macro->buf_len;
4550 fmacro.pos = fmacro.buf;
4552 fmacro.line_start = fmacro.buf;
4553 fmacro.report_line = 1;
4554 fmacro.report_name = fmacro.basename;
4555 fmacro.report_dir = fmacro.dirname;
4557 fmacro.trigraphs = 0;
4558 fmacro.join_lines = 0;
4560 /* Allocate a buffer to hold the macro expansion */
4561 buf->len = macro->buf_len + 3;
4562 buf->str = xmalloc(buf->len, macro->ident->name);
4565 fstart = fmacro.pos;
4566 raw_next_token(state, &fmacro, tk);
4567 while(tk->tok != TOK_EOF) {
4568 flen = fmacro.pos - fstart;
4571 for(i = 0; i < macro->argc; i++) {
4572 if (argv[i].ident == tk->ident) {
4576 if (i >= macro->argc) {
4579 /* Substitute macro parameter */
4580 fstart = argv[i].value;
4584 if (macro->argc < 0) {
4588 raw_next_token(state, &fmacro, tk);
4589 } while(tk->tok == TOK_SPACE);
4590 check_tok(state, tk, TOK_IDENT);
4591 for(i = 0; i < macro->argc; i++) {
4592 if (argv[i].ident == tk->ident) {
4596 if (i >= macro->argc) {
4597 error(state, 0, "parameter `%s' not found",
4600 /* Stringize token */
4601 append_macro_text(state, macro->ident->name, buf, "\"", 1);
4602 for(j = 0; j < argv[i].len; j++) {
4603 char *str = argv[i].value + j;
4609 else if (*str == '"') {
4613 append_macro_text(state, macro->ident->name, buf, str, len);
4615 append_macro_text(state, macro->ident->name, buf, "\"", 1);
4619 case TOK_CONCATENATE:
4620 /* Concatenate tokens */
4621 /* Delete the previous whitespace token */
4622 if (buf->str[buf->pos - 1] == ' ') {
4625 /* Skip the next sequence of whitspace tokens */
4627 fstart = fmacro.pos;
4628 raw_next_token(state, &fmacro, tk);
4629 } while(tk->tok == TOK_SPACE);
4630 /* Restart at the top of the loop.
4631 * I need to process the non white space token.
4636 /* Collapse multiple spaces into one */
4637 if (buf->str[buf->pos - 1] != ' ') {
4649 append_macro_text(state, macro->ident->name, buf, fstart, flen);
4651 fstart = fmacro.pos;
4652 raw_next_token(state, &fmacro, tk);
4656 static void tag_macro_name(struct compile_state *state,
4657 struct macro *macro, struct macro_buf *buf,
4660 /* Guard all instances of the macro name in the replacement
4661 * text from further macro expansion.
4663 struct file_state fmacro;
4667 /* Put the old macro expansion buffer in a file */
4669 fmacro.basename = macro->ident->name;
4670 fmacro.dirname = "";
4671 fmacro.buf = buf->str;
4672 fmacro.size = buf->pos;
4673 fmacro.pos = fmacro.buf;
4675 fmacro.line_start = fmacro.buf;
4676 fmacro.report_line = 1;
4677 fmacro.report_name = fmacro.basename;
4678 fmacro.report_dir = fmacro.dirname;
4680 fmacro.trigraphs = 0;
4681 fmacro.join_lines = 0;
4683 /* Allocate a new macro expansion buffer */
4684 buf->len = macro->buf_len + 3;
4685 buf->str = xmalloc(buf->len, macro->ident->name);
4688 fstart = fmacro.pos;
4689 raw_next_token(state, &fmacro, tk);
4690 while(tk->tok != TOK_EOF) {
4691 flen = fmacro.pos - fstart;
4692 if ((tk->tok == TOK_IDENT) &&
4693 (tk->ident == macro->ident) &&
4694 (tk->val.notmacro == 0))
4696 append_macro_text(state, macro->ident->name, buf, fstart, flen);
4701 append_macro_text(state, macro->ident->name, buf, fstart, flen);
4703 fstart = fmacro.pos;
4704 raw_next_token(state, &fmacro, tk);
4709 static int compile_macro(struct compile_state *state,
4710 struct file_state **filep, struct token *tk)
4712 struct file_state *file;
4713 struct hash_entry *ident;
4714 struct macro *macro;
4715 struct macro_arg_value *argv;
4716 struct macro_buf buf;
4719 fprintf(state->errout, "macro: %s\n", tk->ident->name);
4722 macro = ident->sym_define;
4724 /* If this token comes from a macro expansion ignore it */
4725 if (tk->val.notmacro) {
4728 /* If I am a function like macro and the identifier is not followed
4729 * by a left parenthesis, do nothing.
4731 if ((macro->argc >= 0) && (get_char(*filep, (*filep)->pos) != '(')) {
4735 /* Read in the macro arguments */
4737 if (macro->argc >= 0) {
4738 raw_next_token(state, *filep, tk);
4739 check_tok(state, tk, TOK_LPAREN);
4741 argv = read_macro_args(state, macro, *filep, tk);
4743 check_tok(state, tk, TOK_RPAREN);
4745 /* Macro expand the macro arguments */
4746 macro_expand_args(state, macro, argv, tk);
4751 if (ident == state->i___FILE__) {
4752 buf.len = strlen(state->file->basename) + 1 + 2 + 3;
4753 buf.str = xmalloc(buf.len, ident->name);
4754 sprintf(buf.str, "\"%s\"", state->file->basename);
4755 buf.pos = strlen(buf.str);
4757 else if (ident == state->i___LINE__) {
4759 buf.str = xmalloc(buf.len, ident->name);
4760 sprintf(buf.str, "%d", state->file->line);
4761 buf.pos = strlen(buf.str);
4764 expand_macro(state, macro, &buf, argv, tk);
4766 /* Tag the macro name with a $ so it will no longer
4767 * be regonized as a canidate for macro expansion.
4769 tag_macro_name(state, macro, &buf, tk);
4772 fprintf(state->errout, "%s: %d -> `%*.*s'\n",
4773 ident->name, buf.pos, buf.pos, (int)(buf.pos), buf.str);
4776 free_macro_args(macro, argv);
4778 file = xmalloc(sizeof(*file), "file_state");
4779 file->prev = *filep;
4780 file->basename = xstrdup(ident->name);
4781 file->dirname = xstrdup("");
4782 file->buf = buf.str;
4783 file->size = buf.pos;
4784 file->pos = file->buf;
4786 file->line_start = file->pos;
4787 file->report_line = 1;
4788 file->report_name = file->basename;
4789 file->report_dir = file->dirname;
4791 file->trigraphs = 0;
4792 file->join_lines = 0;
4797 static void eat_tokens(struct compile_state *state, int targ_tok)
4799 if (state->eat_depth > 0) {
4800 internal_error(state, 0, "Already eating...");
4802 state->eat_depth = state->if_depth;
4803 state->eat_targ = targ_tok;
4805 static int if_eat(struct compile_state *state)
4807 return state->eat_depth > 0;
4809 static int if_value(struct compile_state *state)
4812 index = state->if_depth / CHAR_BIT;
4813 offset = state->if_depth % CHAR_BIT;
4814 return !!(state->if_bytes[index] & (1 << (offset)));
4816 static void set_if_value(struct compile_state *state, int value)
4819 index = state->if_depth / CHAR_BIT;
4820 offset = state->if_depth % CHAR_BIT;
4822 state->if_bytes[index] &= ~(1 << offset);
4824 state->if_bytes[index] |= (1 << offset);
4827 static void in_if(struct compile_state *state, const char *name)
4829 if (state->if_depth <= 0) {
4830 error(state, 0, "%s without #if", name);
4833 static void enter_if(struct compile_state *state)
4835 state->if_depth += 1;
4836 if (state->if_depth > MAX_PP_IF_DEPTH) {
4837 error(state, 0, "#if depth too great");
4840 static void reenter_if(struct compile_state *state, const char *name)
4843 if ((state->eat_depth == state->if_depth) &&
4844 (state->eat_targ == TOK_MELSE)) {
4845 state->eat_depth = 0;
4846 state->eat_targ = 0;
4849 static void enter_else(struct compile_state *state, const char *name)
4852 if ((state->eat_depth == state->if_depth) &&
4853 (state->eat_targ == TOK_MELSE)) {
4854 state->eat_depth = 0;
4855 state->eat_targ = 0;
4858 static void exit_if(struct compile_state *state, const char *name)
4861 if (state->eat_depth == state->if_depth) {
4862 state->eat_depth = 0;
4863 state->eat_targ = 0;
4865 state->if_depth -= 1;
4868 static void raw_token(struct compile_state *state, struct token *tk)
4870 struct file_state *file;
4874 raw_next_token(state, file, tk);
4878 /* Exit out of an include directive or macro call */
4879 if ((tk->tok == TOK_EOF) &&
4880 (file != state->macro_file) && file->prev)
4882 state->file = file->prev;
4883 /* file->basename is used keep it */
4884 xfree(file->dirname);
4888 raw_next_token(state, state->file, tk);
4894 static void pp_token(struct compile_state *state, struct token *tk)
4898 raw_token(state, tk);
4901 if (tk->tok == TOK_SPACE) {
4902 raw_token(state, tk);
4905 else if (tk->tok == TOK_IDENT) {
4906 if (state->token_base == 0) {
4907 ident_to_keyword(state, tk);
4909 ident_to_macro(state, tk);
4915 static void preprocess(struct compile_state *state, struct token *tk);
4917 static void token(struct compile_state *state, struct token *tk)
4920 pp_token(state, tk);
4923 /* Process a macro directive */
4924 if (tk->tok == TOK_MACRO) {
4925 /* Only match preprocessor directives at the start of a line */
4927 ptr = state->file->line_start;
4928 while((ptr < tk->pos)
4929 && spacep(get_char(state->file, ptr)))
4931 ptr = next_char(state->file, ptr, 1);
4933 if (ptr == tk->pos) {
4934 preprocess(state, tk);
4938 /* Expand a macro call */
4939 else if (tk->ident && tk->ident->sym_define) {
4940 rescan = compile_macro(state, &state->file, tk);
4942 pp_token(state, tk);
4945 /* Eat tokens disabled by the preprocessor
4946 * (Unless we are parsing a preprocessor directive
4948 else if (if_eat(state) && (state->token_base == 0)) {
4949 pp_token(state, tk);
4952 /* Make certain EOL only shows up in preprocessor directives */
4953 else if ((tk->tok == TOK_EOL) && (state->token_base == 0)) {
4954 pp_token(state, tk);
4957 /* Error on unknown tokens */
4958 else if (tk->tok == TOK_UNKNOWN) {
4959 error(state, 0, "unknown token");
4965 static inline struct token *get_token(struct compile_state *state, int offset)
4968 index = state->token_base + offset;
4969 if (index >= sizeof(state->token)/sizeof(state->token[0])) {
4970 internal_error(state, 0, "token array to small");
4972 return &state->token[index];
4975 static struct token *do_eat_token(struct compile_state *state, int tok)
4979 check_tok(state, get_token(state, 1), tok);
4981 /* Free the old token value */
4982 tk = get_token(state, 0);
4984 memset((void *)tk->val.str, -1, tk->str_len);
4987 /* Overwrite the old token with newer tokens */
4988 for(i = state->token_base; i < sizeof(state->token)/sizeof(state->token[0]) - 1; i++) {
4989 state->token[i] = state->token[i + 1];
4991 /* Clear the last token */
4992 memset(&state->token[i], 0, sizeof(state->token[i]));
4993 state->token[i].tok = -1;
4995 /* Return the token */
4999 static int raw_peek(struct compile_state *state)
5002 tk1 = get_token(state, 1);
5003 if (tk1->tok == -1) {
5004 raw_token(state, tk1);
5009 static struct token *raw_eat(struct compile_state *state, int tok)
5012 return do_eat_token(state, tok);
5015 static int pp_peek(struct compile_state *state)
5018 tk1 = get_token(state, 1);
5019 if (tk1->tok == -1) {
5020 pp_token(state, tk1);
5025 static struct token *pp_eat(struct compile_state *state, int tok)
5028 return do_eat_token(state, tok);
5031 static int peek(struct compile_state *state)
5034 tk1 = get_token(state, 1);
5035 if (tk1->tok == -1) {
5041 static int peek2(struct compile_state *state)
5043 struct token *tk1, *tk2;
5044 tk1 = get_token(state, 1);
5045 tk2 = get_token(state, 2);
5046 if (tk1->tok == -1) {
5049 if (tk2->tok == -1) {
5055 static struct token *eat(struct compile_state *state, int tok)
5058 return do_eat_token(state, tok);
5061 static void compile_file(struct compile_state *state, const char *filename, int local)
5063 char cwd[MAX_CWD_SIZE];
5064 const char *subdir, *base;
5066 struct file_state *file;
5068 file = xmalloc(sizeof(*file), "file_state");
5070 base = strrchr(filename, '/');
5073 subdir_len = base - filename;
5080 basename = xmalloc(strlen(base) +1, "basename");
5081 strcpy(basename, base);
5082 file->basename = basename;
5084 if (getcwd(cwd, sizeof(cwd)) == 0) {
5085 die("cwd buffer to small");
5087 if ((subdir[0] == '/') || ((subdir[1] == ':') && ((subdir[2] == '/') || (subdir[2] == '\\')))) {
5088 file->dirname = xmalloc(subdir_len + 1, "dirname");
5089 memcpy(file->dirname, subdir, subdir_len);
5090 file->dirname[subdir_len] = '\0';
5096 /* Find the appropriate directory... */
5098 if (!state->file && exists(cwd, filename)) {
5101 if (local && state->file && exists(state->file->dirname, filename)) {
5102 dir = state->file->dirname;
5104 for(path = state->compiler->include_paths; !dir && *path; path++) {
5105 if (exists(*path, filename)) {
5110 error(state, 0, "Cannot open `%s'\n", filename);
5112 dirlen = strlen(dir);
5113 file->dirname = xmalloc(dirlen + 1 + subdir_len + 1, "dirname");
5114 memcpy(file->dirname, dir, dirlen);
5115 file->dirname[dirlen] = '/';
5116 memcpy(file->dirname + dirlen + 1, subdir, subdir_len);
5117 file->dirname[dirlen + 1 + subdir_len] = '\0';
5119 file->buf = slurp_file(file->dirname, file->basename, &file->size);
5121 file->pos = file->buf;
5122 file->line_start = file->pos;
5125 file->report_line = 1;
5126 file->report_name = file->basename;
5127 file->report_dir = file->dirname;
5129 file->trigraphs = (state->compiler->flags & COMPILER_TRIGRAPHS)? 1: 0;
5130 file->join_lines = 1;
5132 file->prev = state->file;
5136 static struct triple *constant_expr(struct compile_state *state);
5137 static void integral(struct compile_state *state, struct triple *def);
5139 static int mcexpr(struct compile_state *state)
5141 struct triple *cvalue;
5142 cvalue = constant_expr(state);
5143 integral(state, cvalue);
5144 if (cvalue->op != OP_INTCONST) {
5145 error(state, 0, "integer constant expected");
5147 return cvalue->u.cval != 0;
5150 static void preprocess(struct compile_state *state, struct token *current_token)
5152 /* Doing much more with the preprocessor would require
5153 * a parser and a major restructuring.
5154 * Postpone that for later.
5159 state->macro_file = state->file;
5161 old_token_base = state->token_base;
5162 state->token_base = current_token - state->token;
5164 tok = pp_peek(state);
5170 tk = pp_eat(state, TOK_LIT_INT);
5171 override_line = strtoul(tk->val.str, 0, 10);
5172 /* I have a preprocessor line marker parse it */
5173 if (pp_peek(state) == TOK_LIT_STRING) {
5174 const char *token, *base;
5176 int name_len, dir_len;
5177 tk = pp_eat(state, TOK_LIT_STRING);
5178 name = xmalloc(tk->str_len, "report_name");
5179 token = tk->val.str + 1;
5180 base = strrchr(token, '/');
5181 name_len = tk->str_len -2;
5183 dir_len = base - token;
5185 name_len -= base - token;
5190 memcpy(name, base, name_len);
5191 name[name_len] = '\0';
5192 dir = xmalloc(dir_len + 1, "report_dir");
5193 memcpy(dir, token, dir_len);
5194 dir[dir_len] = '\0';
5195 state->file->report_line = override_line - 1;
5196 state->file->report_name = name;
5197 state->file->report_dir = dir;
5198 state->file->macro = 0;
5205 pp_eat(state, TOK_MLINE);
5206 tk = eat(state, TOK_LIT_INT);
5207 state->file->report_line = strtoul(tk->val.str, 0, 10) -1;
5208 if (pp_peek(state) == TOK_LIT_STRING) {
5209 const char *token, *base;
5211 int name_len, dir_len;
5212 tk = pp_eat(state, TOK_LIT_STRING);
5213 name = xmalloc(tk->str_len, "report_name");
5214 token = tk->val.str + 1;
5215 base = strrchr(token, '/');
5216 name_len = tk->str_len - 2;
5218 dir_len = base - token;
5220 name_len -= base - token;
5225 memcpy(name, base, name_len);
5226 name[name_len] = '\0';
5227 dir = xmalloc(dir_len + 1, "report_dir");
5228 memcpy(dir, token, dir_len);
5229 dir[dir_len] = '\0';
5230 state->file->report_name = name;
5231 state->file->report_dir = dir;
5232 state->file->macro = 0;
5238 struct hash_entry *ident;
5239 pp_eat(state, TOK_MUNDEF);
5240 if (if_eat(state)) /* quit early when #if'd out */
5243 ident = pp_eat(state, TOK_MIDENT)->ident;
5245 undef_macro(state, ident);
5249 pp_eat(state, TOK_MPRAGMA);
5250 if (if_eat(state)) /* quit early when #if'd out */
5252 warning(state, 0, "Ignoring pragma");
5255 pp_eat(state, TOK_MELIF);
5256 reenter_if(state, "#elif");
5257 if (if_eat(state)) /* quit early when #if'd out */
5259 /* If the #if was taken the #elif just disables the following code */
5260 if (if_value(state)) {
5261 eat_tokens(state, TOK_MENDIF);
5263 /* If the previous #if was not taken see if the #elif enables the
5267 set_if_value(state, mcexpr(state));
5268 if (!if_value(state)) {
5269 eat_tokens(state, TOK_MELSE);
5274 pp_eat(state, TOK_MIF);
5276 if (if_eat(state)) /* quit early when #if'd out */
5278 set_if_value(state, mcexpr(state));
5279 if (!if_value(state)) {
5280 eat_tokens(state, TOK_MELSE);
5285 struct hash_entry *ident;
5287 pp_eat(state, TOK_MIFNDEF);
5289 if (if_eat(state)) /* quit early when #if'd out */
5291 ident = pp_eat(state, TOK_MIDENT)->ident;
5292 set_if_value(state, ident->sym_define == 0);
5293 if (!if_value(state)) {
5294 eat_tokens(state, TOK_MELSE);
5300 struct hash_entry *ident;
5301 pp_eat(state, TOK_MIFDEF);
5303 if (if_eat(state)) /* quit early when #if'd out */
5305 ident = pp_eat(state, TOK_MIDENT)->ident;
5306 set_if_value(state, ident->sym_define != 0);
5307 if (!if_value(state)) {
5308 eat_tokens(state, TOK_MELSE);
5313 pp_eat(state, TOK_MELSE);
5314 enter_else(state, "#else");
5315 if (!if_eat(state) && if_value(state)) {
5316 eat_tokens(state, TOK_MENDIF);
5320 pp_eat(state, TOK_MENDIF);
5321 exit_if(state, "#endif");
5325 struct hash_entry *ident;
5326 struct macro_arg *args, **larg;
5327 const char *mstart, *mend;
5330 pp_eat(state, TOK_MDEFINE);
5331 if (if_eat(state)) /* quit early when #if'd out */
5333 ident = pp_eat(state, TOK_MIDENT)->ident;
5338 /* Parse macro parameters */
5339 if (raw_peek(state) == TOK_LPAREN) {
5340 raw_eat(state, TOK_LPAREN);
5344 struct macro_arg *narg, *arg;
5345 struct hash_entry *aident;
5348 tok = pp_peek(state);
5349 if (!args && (tok == TOK_RPAREN)) {
5352 else if (tok == TOK_DOTS) {
5353 pp_eat(state, TOK_DOTS);
5354 aident = state->i___VA_ARGS__;
5357 aident = pp_eat(state, TOK_MIDENT)->ident;
5360 narg = xcmalloc(sizeof(*arg), "macro arg");
5361 narg->ident = aident;
5363 /* Verify I don't have a duplicate identifier */
5364 for(arg = args; arg; arg = arg->next) {
5365 if (arg->ident == narg->ident) {
5366 error(state, 0, "Duplicate macro arg `%s'",
5370 /* Add the new argument to the end of the list */
5375 if ((aident == state->i___VA_ARGS__) ||
5376 (pp_peek(state) != TOK_COMMA)) {
5379 pp_eat(state, TOK_COMMA);
5381 pp_eat(state, TOK_RPAREN);
5383 /* Remove leading whitespace */
5384 while(raw_peek(state) == TOK_SPACE) {
5385 raw_eat(state, TOK_SPACE);
5388 /* Remember the start of the macro body */
5389 tok = raw_peek(state);
5390 mend = mstart = get_token(state, 1)->pos;
5392 /* Find the end of the macro */
5393 for(tok = raw_peek(state); tok != TOK_EOL; tok = raw_peek(state)) {
5394 raw_eat(state, tok);
5395 /* Remember the end of the last non space token */
5397 if (tok != TOK_SPACE) {
5398 mend = get_token(state, 1)->pos;
5402 /* Now that I have found the body defined the token */
5403 do_define_macro(state, ident,
5404 char_strdup(state->file, mstart, mend, "macro buf"),
5410 const char *start, *end;
5413 pp_eat(state, TOK_MERROR);
5414 /* Find the start of the line */
5416 start = get_token(state, 1)->pos;
5418 /* Find the end of the line */
5419 while((tok = raw_peek(state)) != TOK_EOL) {
5420 raw_eat(state, tok);
5422 end = get_token(state, 1)->pos;
5424 if (!if_eat(state)) {
5425 error(state, 0, "%*.*s", len, len, start);
5431 const char *start, *end;
5434 pp_eat(state, TOK_MWARNING);
5436 /* Find the start of the line */
5438 start = get_token(state, 1)->pos;
5440 /* Find the end of the line */
5441 while((tok = raw_peek(state)) != TOK_EOL) {
5442 raw_eat(state, tok);
5444 end = get_token(state, 1)->pos;
5446 if (!if_eat(state)) {
5447 warning(state, 0, "%*.*s", len, len, start);
5458 pp_eat(state, TOK_MINCLUDE);
5459 if (if_eat(state)) {
5460 /* Find the end of the line */
5461 while((tok = raw_peek(state)) != TOK_EOL) {
5462 raw_eat(state, tok);
5467 if (tok == TOK_LIT_STRING) {
5471 tk = eat(state, TOK_LIT_STRING);
5472 name = xmalloc(tk->str_len, "include");
5473 token = tk->val.str +1;
5474 name_len = tk->str_len -2;
5475 if (*token == '"') {
5479 memcpy(name, token, name_len);
5480 name[name_len] = '\0';
5483 else if (tok == TOK_LESS) {
5484 struct macro_buf buf;
5485 eat(state, TOK_LESS);
5488 buf.str = xmalloc(buf.len, "include");
5492 while((tok != TOK_MORE) &&
5493 (tok != TOK_EOL) && (tok != TOK_EOF))
5496 tk = eat(state, tok);
5497 append_macro_chars(state, "include", &buf,
5498 state->file, tk->pos, state->file->pos);
5501 append_macro_text(state, "include", &buf, "\0", 1);
5502 if (peek(state) != TOK_MORE) {
5503 error(state, 0, "Unterminated include directive");
5505 eat(state, TOK_MORE);
5510 error(state, 0, "Invalid include directive");
5512 /* Error if there are any tokens after the include */
5513 if (pp_peek(state) != TOK_EOL) {
5514 error(state, 0, "garbage after include directive");
5516 if (!if_eat(state)) {
5517 compile_file(state, name, local);
5523 /* Ignore # without a follwing ident */
5527 const char *name1, *name2;
5528 name1 = tokens[tok];
5530 if (tok == TOK_MIDENT) {
5531 name2 = get_token(state, 1)->ident->name;
5533 error(state, 0, "Invalid preprocessor directive: %s %s",
5538 /* Consume the rest of the macro line */
5540 tok = pp_peek(state);
5542 } while((tok != TOK_EOF) && (tok != TOK_EOL));
5543 state->token_base = old_token_base;
5544 state->macro_file = NULL;
5548 /* Type helper functions */
5550 static struct type *new_type(
5551 unsigned int type, struct type *left, struct type *right)
5553 struct type *result;
5554 result = xmalloc(sizeof(*result), "type");
5555 result->type = type;
5556 result->left = left;
5557 result->right = right;
5558 result->field_ident = 0;
5559 result->type_ident = 0;
5560 result->elements = 0;
5564 static struct type *clone_type(unsigned int specifiers, struct type *old)
5566 struct type *result;
5567 result = xmalloc(sizeof(*result), "type");
5568 memcpy(result, old, sizeof(*result));
5569 result->type &= TYPE_MASK;
5570 result->type |= specifiers;
5574 static struct type *dup_type(struct compile_state *state, struct type *orig)
5577 new = xcmalloc(sizeof(*new), "type");
5578 new->type = orig->type;
5579 new->field_ident = orig->field_ident;
5580 new->type_ident = orig->type_ident;
5581 new->elements = orig->elements;
5583 new->left = dup_type(state, orig->left);
5586 new->right = dup_type(state, orig->right);
5592 static struct type *invalid_type(struct compile_state *state, struct type *type)
5594 struct type *invalid, *member;
5597 internal_error(state, 0, "type missing?");
5599 switch(type->type & TYPE_MASK) {
5601 case TYPE_CHAR: case TYPE_UCHAR:
5602 case TYPE_SHORT: case TYPE_USHORT:
5603 case TYPE_INT: case TYPE_UINT:
5604 case TYPE_LONG: case TYPE_ULONG:
5605 case TYPE_LLONG: case TYPE_ULLONG:
5610 invalid = invalid_type(state, type->left);
5613 invalid = invalid_type(state, type->left);
5617 member = type->left;
5618 while(member && (invalid == 0) &&
5619 ((member->type & TYPE_MASK) == TYPE_PRODUCT)) {
5620 invalid = invalid_type(state, member->left);
5621 member = member->right;
5624 invalid = invalid_type(state, member);
5629 member = type->left;
5630 while(member && (invalid == 0) &&
5631 ((member->type & TYPE_MASK) == TYPE_OVERLAP)) {
5632 invalid = invalid_type(state, member->left);
5633 member = member->right;
5636 invalid = invalid_type(state, member);
5647 #define MASK_UCHAR(X) ((X) & ((ulong_t)0xff))
5648 #define MASK_USHORT(X) ((X) & (((ulong_t)1 << (SIZEOF_SHORT)) - 1))
5649 static inline ulong_t mask_uint(ulong_t x)
5651 if (SIZEOF_INT < SIZEOF_LONG) {
5652 ulong_t mask = (1ULL << ((ulong_t)(SIZEOF_INT))) -1;
5657 #define MASK_UINT(X) (mask_uint(X))
5658 #define MASK_ULONG(X) (X)
5660 static struct type void_type = { .type = TYPE_VOID };
5661 static struct type char_type = { .type = TYPE_CHAR };
5662 static struct type uchar_type = { .type = TYPE_UCHAR };
5663 #if DEBUG_ROMCC_WARNING
5664 static struct type short_type = { .type = TYPE_SHORT };
5666 static struct type ushort_type = { .type = TYPE_USHORT };
5667 static struct type int_type = { .type = TYPE_INT };
5668 static struct type uint_type = { .type = TYPE_UINT };
5669 static struct type long_type = { .type = TYPE_LONG };
5670 static struct type ulong_type = { .type = TYPE_ULONG };
5671 static struct type unknown_type = { .type = TYPE_UNKNOWN };
5673 static struct type void_ptr_type = {
5674 .type = TYPE_POINTER,
5678 #if DEBUG_ROMCC_WARNING
5679 static struct type void_func_type = {
5680 .type = TYPE_FUNCTION,
5682 .right = &void_type,
5686 static size_t bits_to_bytes(size_t size)
5688 return (size + SIZEOF_CHAR - 1)/SIZEOF_CHAR;
5691 static struct triple *variable(struct compile_state *state, struct type *type)
5693 struct triple *result;
5694 if ((type->type & STOR_MASK) != STOR_PERM) {
5695 result = triple(state, OP_ADECL, type, 0, 0);
5696 generate_lhs_pieces(state, result);
5699 result = triple(state, OP_SDECL, type, 0, 0);
5704 static void stor_of(FILE *fp, struct type *type)
5706 switch(type->type & STOR_MASK) {
5708 fprintf(fp, "auto ");
5711 fprintf(fp, "static ");
5714 fprintf(fp, "local ");
5717 fprintf(fp, "extern ");
5720 fprintf(fp, "register ");
5723 fprintf(fp, "typedef ");
5725 case STOR_INLINE | STOR_LOCAL:
5726 fprintf(fp, "inline ");
5728 case STOR_INLINE | STOR_STATIC:
5729 fprintf(fp, "static inline");
5731 case STOR_INLINE | STOR_EXTERN:
5732 fprintf(fp, "extern inline");
5735 fprintf(fp, "stor:%x", type->type & STOR_MASK);
5739 static void qual_of(FILE *fp, struct type *type)
5741 if (type->type & QUAL_CONST) {
5742 fprintf(fp, " const");
5744 if (type->type & QUAL_VOLATILE) {
5745 fprintf(fp, " volatile");
5747 if (type->type & QUAL_RESTRICT) {
5748 fprintf(fp, " restrict");
5752 static void name_of(FILE *fp, struct type *type)
5754 unsigned int base_type;
5755 base_type = type->type & TYPE_MASK;
5756 if ((base_type != TYPE_PRODUCT) && (base_type != TYPE_OVERLAP)) {
5761 fprintf(fp, "void");
5765 fprintf(fp, "signed char");
5769 fprintf(fp, "unsigned char");
5773 fprintf(fp, "signed short");
5777 fprintf(fp, "unsigned short");
5781 fprintf(fp, "signed int");
5785 fprintf(fp, "unsigned int");
5789 fprintf(fp, "signed long");
5793 fprintf(fp, "unsigned long");
5797 name_of(fp, type->left);
5802 name_of(fp, type->left);
5804 name_of(fp, type->right);
5807 name_of(fp, type->left);
5809 name_of(fp, type->right);
5812 fprintf(fp, "enum %s",
5813 (type->type_ident)? type->type_ident->name : "");
5817 fprintf(fp, "struct %s { ",
5818 (type->type_ident)? type->type_ident->name : "");
5819 name_of(fp, type->left);
5824 fprintf(fp, "union %s { ",
5825 (type->type_ident)? type->type_ident->name : "");
5826 name_of(fp, type->left);
5831 name_of(fp, type->left);
5832 fprintf(fp, " (*)(");
5833 name_of(fp, type->right);
5837 name_of(fp, type->left);
5838 fprintf(fp, " [%ld]", (long)(type->elements));
5841 fprintf(fp, "tuple { ");
5842 name_of(fp, type->left);
5847 fprintf(fp, "join { ");
5848 name_of(fp, type->left);
5853 name_of(fp, type->left);
5854 fprintf(fp, " : %d ", type->elements);
5858 fprintf(fp, "unknown_t");
5861 fprintf(fp, "????: %x", base_type);
5864 if (type->field_ident && type->field_ident->name) {
5865 fprintf(fp, " .%s", type->field_ident->name);
5869 static size_t align_of(struct compile_state *state, struct type *type)
5873 switch(type->type & TYPE_MASK) {
5882 align = ALIGNOF_CHAR;
5886 align = ALIGNOF_SHORT;
5891 align = ALIGNOF_INT;
5895 align = ALIGNOF_LONG;
5898 align = ALIGNOF_POINTER;
5903 size_t left_align, right_align;
5904 left_align = align_of(state, type->left);
5905 right_align = align_of(state, type->right);
5906 align = (left_align >= right_align) ? left_align : right_align;
5910 align = align_of(state, type->left);
5916 align = align_of(state, type->left);
5919 error(state, 0, "alignof not yet defined for type\n");
5925 static size_t reg_align_of(struct compile_state *state, struct type *type)
5929 switch(type->type & TYPE_MASK) {
5938 align = REG_ALIGNOF_CHAR;
5942 align = REG_ALIGNOF_SHORT;
5947 align = REG_ALIGNOF_INT;
5951 align = REG_ALIGNOF_LONG;
5954 align = REG_ALIGNOF_POINTER;
5959 size_t left_align, right_align;
5960 left_align = reg_align_of(state, type->left);
5961 right_align = reg_align_of(state, type->right);
5962 align = (left_align >= right_align) ? left_align : right_align;
5966 align = reg_align_of(state, type->left);
5972 align = reg_align_of(state, type->left);
5975 error(state, 0, "alignof not yet defined for type\n");
5981 static size_t align_of_in_bytes(struct compile_state *state, struct type *type)
5983 return bits_to_bytes(align_of(state, type));
5985 static size_t size_of(struct compile_state *state, struct type *type);
5986 static size_t reg_size_of(struct compile_state *state, struct type *type);
5988 static size_t needed_padding(struct compile_state *state,
5989 struct type *type, size_t offset)
5991 size_t padding, align;
5992 align = align_of(state, type);
5993 /* Align to the next machine word if the bitfield does completely
5994 * fit into the current word.
5996 if ((type->type & TYPE_MASK) == TYPE_BITFIELD) {
5998 size = size_of(state, type);
5999 if ((offset + type->elements)/size != offset/size) {
6004 if (offset % align) {
6005 padding = align - (offset % align);
6010 static size_t reg_needed_padding(struct compile_state *state,
6011 struct type *type, size_t offset)
6013 size_t padding, align;
6014 align = reg_align_of(state, type);
6015 /* Align to the next register word if the bitfield does completely
6016 * fit into the current register.
6018 if (((type->type & TYPE_MASK) == TYPE_BITFIELD) &&
6019 (((offset + type->elements)/REG_SIZEOF_REG) != (offset/REG_SIZEOF_REG)))
6021 align = REG_SIZEOF_REG;
6024 if (offset % align) {
6025 padding = align - (offset % align);
6030 static size_t size_of(struct compile_state *state, struct type *type)
6034 switch(type->type & TYPE_MASK) {
6039 size = type->elements;
6047 size = SIZEOF_SHORT;
6059 size = SIZEOF_POINTER;
6065 while((type->type & TYPE_MASK) == TYPE_PRODUCT) {
6066 pad = needed_padding(state, type->left, size);
6067 size = size + pad + size_of(state, type->left);
6070 pad = needed_padding(state, type, size);
6071 size = size + pad + size_of(state, type);
6076 size_t size_left, size_right;
6077 size_left = size_of(state, type->left);
6078 size_right = size_of(state, type->right);
6079 size = (size_left >= size_right)? size_left : size_right;
6083 if (type->elements == ELEMENT_COUNT_UNSPECIFIED) {
6084 internal_error(state, 0, "Invalid array type");
6086 size = size_of(state, type->left) * type->elements;
6093 size = size_of(state, type->left);
6094 /* Pad structures so their size is a multiples of their alignment */
6095 pad = needed_padding(state, type, size);
6103 size = size_of(state, type->left);
6104 /* Pad unions so their size is a multiple of their alignment */
6105 pad = needed_padding(state, type, size);
6110 internal_error(state, 0, "sizeof not yet defined for type");
6116 static size_t reg_size_of(struct compile_state *state, struct type *type)
6120 switch(type->type & TYPE_MASK) {
6125 size = type->elements;
6129 size = REG_SIZEOF_CHAR;
6133 size = REG_SIZEOF_SHORT;
6138 size = REG_SIZEOF_INT;
6142 size = REG_SIZEOF_LONG;
6145 size = REG_SIZEOF_POINTER;
6151 while((type->type & TYPE_MASK) == TYPE_PRODUCT) {
6152 pad = reg_needed_padding(state, type->left, size);
6153 size = size + pad + reg_size_of(state, type->left);
6156 pad = reg_needed_padding(state, type, size);
6157 size = size + pad + reg_size_of(state, type);
6162 size_t size_left, size_right;
6163 size_left = reg_size_of(state, type->left);
6164 size_right = reg_size_of(state, type->right);
6165 size = (size_left >= size_right)? size_left : size_right;
6169 if (type->elements == ELEMENT_COUNT_UNSPECIFIED) {
6170 internal_error(state, 0, "Invalid array type");
6172 size = reg_size_of(state, type->left) * type->elements;
6179 size = reg_size_of(state, type->left);
6180 /* Pad structures so their size is a multiples of their alignment */
6181 pad = reg_needed_padding(state, type, size);
6189 size = reg_size_of(state, type->left);
6190 /* Pad unions so their size is a multiple of their alignment */
6191 pad = reg_needed_padding(state, type, size);
6196 internal_error(state, 0, "sizeof not yet defined for type");
6202 static size_t registers_of(struct compile_state *state, struct type *type)
6205 registers = reg_size_of(state, type);
6206 registers += REG_SIZEOF_REG - 1;
6207 registers /= REG_SIZEOF_REG;
6211 static size_t size_of_in_bytes(struct compile_state *state, struct type *type)
6213 return bits_to_bytes(size_of(state, type));
6216 static size_t field_offset(struct compile_state *state,
6217 struct type *type, struct hash_entry *field)
6219 struct type *member;
6224 if ((type->type & TYPE_MASK) == TYPE_STRUCT) {
6225 member = type->left;
6226 while(member && ((member->type & TYPE_MASK) == TYPE_PRODUCT)) {
6227 size += needed_padding(state, member->left, size);
6228 if (member->left->field_ident == field) {
6229 member = member->left;
6232 size += size_of(state, member->left);
6233 member = member->right;
6235 size += needed_padding(state, member, size);
6237 else if ((type->type & TYPE_MASK) == TYPE_UNION) {
6238 member = type->left;
6239 while(member && ((member->type & TYPE_MASK) == TYPE_OVERLAP)) {
6240 if (member->left->field_ident == field) {
6241 member = member->left;
6244 member = member->right;
6248 internal_error(state, 0, "field_offset only works on structures and unions");
6251 if (!member || (member->field_ident != field)) {
6252 error(state, 0, "member %s not present", field->name);
6257 static size_t field_reg_offset(struct compile_state *state,
6258 struct type *type, struct hash_entry *field)
6260 struct type *member;
6265 if ((type->type & TYPE_MASK) == TYPE_STRUCT) {
6266 member = type->left;
6267 while(member && ((member->type & TYPE_MASK) == TYPE_PRODUCT)) {
6268 size += reg_needed_padding(state, member->left, size);
6269 if (member->left->field_ident == field) {
6270 member = member->left;
6273 size += reg_size_of(state, member->left);
6274 member = member->right;
6277 else if ((type->type & TYPE_MASK) == TYPE_UNION) {
6278 member = type->left;
6279 while(member && ((member->type & TYPE_MASK) == TYPE_OVERLAP)) {
6280 if (member->left->field_ident == field) {
6281 member = member->left;
6284 member = member->right;
6288 internal_error(state, 0, "field_reg_offset only works on structures and unions");
6291 size += reg_needed_padding(state, member, size);
6292 if (!member || (member->field_ident != field)) {
6293 error(state, 0, "member %s not present", field->name);
6298 static struct type *field_type(struct compile_state *state,
6299 struct type *type, struct hash_entry *field)
6301 struct type *member;
6304 if ((type->type & TYPE_MASK) == TYPE_STRUCT) {
6305 member = type->left;
6306 while(member && ((member->type & TYPE_MASK) == TYPE_PRODUCT)) {
6307 if (member->left->field_ident == field) {
6308 member = member->left;
6311 member = member->right;
6314 else if ((type->type & TYPE_MASK) == TYPE_UNION) {
6315 member = type->left;
6316 while(member && ((member->type & TYPE_MASK) == TYPE_OVERLAP)) {
6317 if (member->left->field_ident == field) {
6318 member = member->left;
6321 member = member->right;
6325 internal_error(state, 0, "field_type only works on structures and unions");
6328 if (!member || (member->field_ident != field)) {
6329 error(state, 0, "member %s not present", field->name);
6334 static size_t index_offset(struct compile_state *state,
6335 struct type *type, ulong_t index)
6337 struct type *member;
6340 if ((type->type & TYPE_MASK) == TYPE_ARRAY) {
6341 size = size_of(state, type->left) * index;
6343 else if ((type->type & TYPE_MASK) == TYPE_TUPLE) {
6345 member = type->left;
6347 while(member && ((member->type & TYPE_MASK) == TYPE_PRODUCT)) {
6348 size += needed_padding(state, member->left, size);
6350 member = member->left;
6353 size += size_of(state, member->left);
6355 member = member->right;
6357 size += needed_padding(state, member, size);
6359 internal_error(state, 0, "Missing member index: %u", index);
6362 else if ((type->type & TYPE_MASK) == TYPE_JOIN) {
6365 member = type->left;
6367 while(member && ((member->type & TYPE_MASK) == TYPE_OVERLAP)) {
6369 member = member->left;
6373 member = member->right;
6376 internal_error(state, 0, "Missing member index: %u", index);
6380 internal_error(state, 0,
6381 "request for index %u in something not an array, tuple or join",
6387 static size_t index_reg_offset(struct compile_state *state,
6388 struct type *type, ulong_t index)
6390 struct type *member;
6393 if ((type->type & TYPE_MASK) == TYPE_ARRAY) {
6394 size = reg_size_of(state, type->left) * index;
6396 else if ((type->type & TYPE_MASK) == TYPE_TUPLE) {
6398 member = type->left;
6400 while(member && ((member->type & TYPE_MASK) == TYPE_PRODUCT)) {
6401 size += reg_needed_padding(state, member->left, size);
6403 member = member->left;
6406 size += reg_size_of(state, member->left);
6408 member = member->right;
6410 size += reg_needed_padding(state, member, size);
6412 internal_error(state, 0, "Missing member index: %u", index);
6416 else if ((type->type & TYPE_MASK) == TYPE_JOIN) {
6419 member = type->left;
6421 while(member && ((member->type & TYPE_MASK) == TYPE_OVERLAP)) {
6423 member = member->left;
6427 member = member->right;
6430 internal_error(state, 0, "Missing member index: %u", index);
6434 internal_error(state, 0,
6435 "request for index %u in something not an array, tuple or join",
6441 static struct type *index_type(struct compile_state *state,
6442 struct type *type, ulong_t index)
6444 struct type *member;
6445 if (index >= type->elements) {
6446 internal_error(state, 0, "Invalid element %u requested", index);
6448 if ((type->type & TYPE_MASK) == TYPE_ARRAY) {
6449 member = type->left;
6451 else if ((type->type & TYPE_MASK) == TYPE_TUPLE) {
6453 member = type->left;
6455 while(member && ((member->type & TYPE_MASK) == TYPE_PRODUCT)) {
6457 member = member->left;
6461 member = member->right;
6464 internal_error(state, 0, "Missing member index: %u", index);
6467 else if ((type->type & TYPE_MASK) == TYPE_JOIN) {
6469 member = type->left;
6471 while(member && ((member->type & TYPE_MASK) == TYPE_OVERLAP)) {
6473 member = member->left;
6477 member = member->right;
6480 internal_error(state, 0, "Missing member index: %u", index);
6485 internal_error(state, 0,
6486 "request for index %u in something not an array, tuple or join",
6492 static struct type *unpack_type(struct compile_state *state, struct type *type)
6494 /* If I have a single register compound type not a bit-field
6495 * find the real type.
6497 struct type *start_type;
6499 /* Get out early if I need multiple registers for this type */
6500 size = reg_size_of(state, type);
6501 if (size > REG_SIZEOF_REG) {
6504 /* Get out early if I don't need any registers for this type */
6508 /* Loop until I have no more layers I can remove */
6511 switch(type->type & TYPE_MASK) {
6513 /* If I have a single element the unpacked type
6516 if (type->elements == 1) {
6522 /* If I have a single element the unpacked type
6525 if (type->elements == 1) {
6528 /* If I have multiple elements the unpacked
6529 * type is the non-void element.
6532 struct type *next, *member;
6533 struct type *sub_type;
6539 if ((member->type & TYPE_MASK) == TYPE_PRODUCT) {
6540 next = member->right;
6541 member = member->left;
6543 if (reg_size_of(state, member) > 0) {
6545 internal_error(state, 0, "true compound type in a register");
6558 /* If I have a single element the unpacked type
6561 if (type->elements == 1) {
6564 /* I can't in general unpack union types */
6567 /* If I'm not a compound type I can't unpack it */
6570 } while(start_type != type);
6571 switch(type->type & TYPE_MASK) {
6575 internal_error(state, 0, "irredicible type?");
6581 static int equiv_types(struct type *left, struct type *right);
6582 static int is_compound_type(struct type *type);
6584 static struct type *reg_type(
6585 struct compile_state *state, struct type *type, int reg_offset)
6587 struct type *member;
6590 struct type *invalid;
6591 invalid = invalid_type(state, type);
6593 fprintf(state->errout, "type: ");
6594 name_of(state->errout, type);
6595 fprintf(state->errout, "\n");
6596 fprintf(state->errout, "invalid: ");
6597 name_of(state->errout, invalid);
6598 fprintf(state->errout, "\n");
6599 internal_error(state, 0, "bad input type?");
6603 size = reg_size_of(state, type);
6604 if (reg_offset > size) {
6606 fprintf(state->errout, "type: ");
6607 name_of(state->errout, type);
6608 fprintf(state->errout, "\n");
6609 internal_error(state, 0, "offset outside of type");
6612 switch(type->type & TYPE_MASK) {
6613 /* Don't do anything with the basic types */
6615 case TYPE_CHAR: case TYPE_UCHAR:
6616 case TYPE_SHORT: case TYPE_USHORT:
6617 case TYPE_INT: case TYPE_UINT:
6618 case TYPE_LONG: case TYPE_ULONG:
6619 case TYPE_LLONG: case TYPE_ULLONG:
6620 case TYPE_FLOAT: case TYPE_DOUBLE:
6628 member = type->left;
6629 size = reg_size_of(state, member);
6630 if (size > REG_SIZEOF_REG) {
6631 member = reg_type(state, member, reg_offset % size);
6639 member = type->left;
6640 while(member && ((member->type & TYPE_MASK) == TYPE_PRODUCT)) {
6641 size = reg_size_of(state, member->left);
6642 offset += reg_needed_padding(state, member->left, offset);
6643 if ((offset + size) > reg_offset) {
6644 member = member->left;
6648 member = member->right;
6650 offset += reg_needed_padding(state, member, offset);
6651 member = reg_type(state, member, reg_offset - offset);
6657 struct type *join, **jnext, *mnext;
6658 join = new_type(TYPE_JOIN, 0, 0);
6659 jnext = &join->left;
6665 if ((member->type & TYPE_MASK) == TYPE_OVERLAP) {
6666 mnext = member->right;
6667 member = member->left;
6669 size = reg_size_of(state, member);
6670 if (size > reg_offset) {
6671 struct type *part, *hunt;
6672 part = reg_type(state, member, reg_offset);
6673 /* See if this type is already in the union */
6676 struct type *test = hunt;
6678 if ((test->type & TYPE_MASK) == TYPE_OVERLAP) {
6682 if (equiv_types(part, test)) {
6690 *jnext = new_type(TYPE_OVERLAP, *jnext, part);
6691 jnext = &(*jnext)->right;
6698 if (join->elements == 0) {
6699 internal_error(state, 0, "No elements?");
6706 fprintf(state->errout, "type: ");
6707 name_of(state->errout, type);
6708 fprintf(state->errout, "\n");
6709 internal_error(state, 0, "reg_type not yet defined for type");
6713 /* If I have a single register compound type not a bit-field
6714 * find the real type.
6716 member = unpack_type(state, member);
6718 size = reg_size_of(state, member);
6719 if (size > REG_SIZEOF_REG) {
6720 internal_error(state, 0, "Cannot find type of single register");
6723 invalid = invalid_type(state, member);
6725 fprintf(state->errout, "type: ");
6726 name_of(state->errout, member);
6727 fprintf(state->errout, "\n");
6728 fprintf(state->errout, "invalid: ");
6729 name_of(state->errout, invalid);
6730 fprintf(state->errout, "\n");
6731 internal_error(state, 0, "returning bad type?");
6737 static struct type *next_field(struct compile_state *state,
6738 struct type *type, struct type *prev_member)
6740 struct type *member;
6741 if ((type->type & TYPE_MASK) != TYPE_STRUCT) {
6742 internal_error(state, 0, "next_field only works on structures");
6744 member = type->left;
6745 while((member->type & TYPE_MASK) == TYPE_PRODUCT) {
6747 member = member->left;
6750 if (member->left == prev_member) {
6753 member = member->right;
6755 if (member == prev_member) {
6759 internal_error(state, 0, "prev_member %s not present",
6760 prev_member->field_ident->name);
6765 typedef void (*walk_type_fields_cb_t)(struct compile_state *state, struct type *type,
6766 size_t ret_offset, size_t mem_offset, void *arg);
6768 static void walk_type_fields(struct compile_state *state,
6769 struct type *type, size_t reg_offset, size_t mem_offset,
6770 walk_type_fields_cb_t cb, void *arg);
6772 static void walk_struct_fields(struct compile_state *state,
6773 struct type *type, size_t reg_offset, size_t mem_offset,
6774 walk_type_fields_cb_t cb, void *arg)
6778 if ((type->type & TYPE_MASK) != TYPE_STRUCT) {
6779 internal_error(state, 0, "walk_struct_fields only works on structures");
6782 for(i = 0; i < type->elements; i++) {
6785 if ((mtype->type & TYPE_MASK) == TYPE_PRODUCT) {
6786 mtype = mtype->left;
6788 walk_type_fields(state, mtype,
6790 field_reg_offset(state, type, mtype->field_ident),
6792 field_offset(state, type, mtype->field_ident),
6799 static void walk_type_fields(struct compile_state *state,
6800 struct type *type, size_t reg_offset, size_t mem_offset,
6801 walk_type_fields_cb_t cb, void *arg)
6803 switch(type->type & TYPE_MASK) {
6805 walk_struct_fields(state, type, reg_offset, mem_offset, cb, arg);
6815 cb(state, type, reg_offset, mem_offset, arg);
6820 internal_error(state, 0, "walk_type_fields not yet implemented for type");
6824 static void arrays_complete(struct compile_state *state, struct type *type)
6826 if ((type->type & TYPE_MASK) == TYPE_ARRAY) {
6827 if (type->elements == ELEMENT_COUNT_UNSPECIFIED) {
6828 error(state, 0, "array size not specified");
6830 arrays_complete(state, type->left);
6834 static unsigned int get_basic_type(struct type *type)
6837 basic = type->type & TYPE_MASK;
6838 /* Convert enums to ints */
6839 if (basic == TYPE_ENUM) {
6842 /* Convert bitfields to standard types */
6843 else if (basic == TYPE_BITFIELD) {
6844 if (type->elements <= SIZEOF_CHAR) {
6847 else if (type->elements <= SIZEOF_SHORT) {
6850 else if (type->elements <= SIZEOF_INT) {
6853 else if (type->elements <= SIZEOF_LONG) {
6856 if (!TYPE_SIGNED(type->left->type)) {
6863 static unsigned int do_integral_promotion(unsigned int type)
6865 if (TYPE_INTEGER(type) && (TYPE_RANK(type) < TYPE_RANK(TYPE_INT))) {
6871 static unsigned int do_arithmetic_conversion(
6872 unsigned int left, unsigned int right)
6874 if ((left == TYPE_LDOUBLE) || (right == TYPE_LDOUBLE)) {
6875 return TYPE_LDOUBLE;
6877 else if ((left == TYPE_DOUBLE) || (right == TYPE_DOUBLE)) {
6880 else if ((left == TYPE_FLOAT) || (right == TYPE_FLOAT)) {
6883 left = do_integral_promotion(left);
6884 right = do_integral_promotion(right);
6885 /* If both operands have the same size done */
6886 if (left == right) {
6889 /* If both operands have the same signedness pick the larger */
6890 else if (!!TYPE_UNSIGNED(left) == !!TYPE_UNSIGNED(right)) {
6891 return (TYPE_RANK(left) >= TYPE_RANK(right)) ? left : right;
6893 /* If the signed type can hold everything use it */
6894 else if (TYPE_SIGNED(left) && (TYPE_RANK(left) > TYPE_RANK(right))) {
6897 else if (TYPE_SIGNED(right) && (TYPE_RANK(right) > TYPE_RANK(left))) {
6900 /* Convert to the unsigned type with the same rank as the signed type */
6901 else if (TYPE_SIGNED(left)) {
6902 return TYPE_MKUNSIGNED(left);
6905 return TYPE_MKUNSIGNED(right);
6909 /* see if two types are the same except for qualifiers */
6910 static int equiv_types(struct type *left, struct type *right)
6913 /* Error if the basic types do not match */
6914 if ((left->type & TYPE_MASK) != (right->type & TYPE_MASK)) {
6917 type = left->type & TYPE_MASK;
6918 /* If the basic types match and it is a void type we are done */
6919 if (type == TYPE_VOID) {
6922 /* For bitfields we need to compare the sizes */
6923 else if (type == TYPE_BITFIELD) {
6924 return (left->elements == right->elements) &&
6925 (TYPE_SIGNED(left->left->type) == TYPE_SIGNED(right->left->type));
6927 /* if the basic types match and it is an arithmetic type we are done */
6928 else if (TYPE_ARITHMETIC(type)) {
6931 /* If it is a pointer type recurse and keep testing */
6932 else if (type == TYPE_POINTER) {
6933 return equiv_types(left->left, right->left);
6935 else if (type == TYPE_ARRAY) {
6936 return (left->elements == right->elements) &&
6937 equiv_types(left->left, right->left);
6939 /* test for struct equality */
6940 else if (type == TYPE_STRUCT) {
6941 return left->type_ident == right->type_ident;
6943 /* test for union equality */
6944 else if (type == TYPE_UNION) {
6945 return left->type_ident == right->type_ident;
6947 /* Test for equivalent functions */
6948 else if (type == TYPE_FUNCTION) {
6949 return equiv_types(left->left, right->left) &&
6950 equiv_types(left->right, right->right);
6952 /* We only see TYPE_PRODUCT as part of function equivalence matching */
6953 /* We also see TYPE_PRODUCT as part of of tuple equivalence matchin */
6954 else if (type == TYPE_PRODUCT) {
6955 return equiv_types(left->left, right->left) &&
6956 equiv_types(left->right, right->right);
6958 /* We should see TYPE_OVERLAP when comparing joins */
6959 else if (type == TYPE_OVERLAP) {
6960 return equiv_types(left->left, right->left) &&
6961 equiv_types(left->right, right->right);
6963 /* Test for equivalence of tuples */
6964 else if (type == TYPE_TUPLE) {
6965 return (left->elements == right->elements) &&
6966 equiv_types(left->left, right->left);
6968 /* Test for equivalence of joins */
6969 else if (type == TYPE_JOIN) {
6970 return (left->elements == right->elements) &&
6971 equiv_types(left->left, right->left);
6978 static int equiv_ptrs(struct type *left, struct type *right)
6980 if (((left->type & TYPE_MASK) != TYPE_POINTER) ||
6981 ((right->type & TYPE_MASK) != TYPE_POINTER)) {
6984 return equiv_types(left->left, right->left);
6987 static struct type *compatible_types(struct type *left, struct type *right)
6989 struct type *result;
6990 unsigned int type, qual_type;
6991 /* Error if the basic types do not match */
6992 if ((left->type & TYPE_MASK) != (right->type & TYPE_MASK)) {
6995 type = left->type & TYPE_MASK;
6996 qual_type = (left->type & ~STOR_MASK) | (right->type & ~STOR_MASK);
6998 /* if the basic types match and it is an arithmetic type we are done */
6999 if (TYPE_ARITHMETIC(type)) {
7000 result = new_type(qual_type, 0, 0);
7002 /* If it is a pointer type recurse and keep testing */
7003 else if (type == TYPE_POINTER) {
7004 result = compatible_types(left->left, right->left);
7006 result = new_type(qual_type, result, 0);
7009 /* test for struct equality */
7010 else if (type == TYPE_STRUCT) {
7011 if (left->type_ident == right->type_ident) {
7015 /* test for union equality */
7016 else if (type == TYPE_UNION) {
7017 if (left->type_ident == right->type_ident) {
7021 /* Test for equivalent functions */
7022 else if (type == TYPE_FUNCTION) {
7023 struct type *lf, *rf;
7024 lf = compatible_types(left->left, right->left);
7025 rf = compatible_types(left->right, right->right);
7027 result = new_type(qual_type, lf, rf);
7030 /* We only see TYPE_PRODUCT as part of function equivalence matching */
7031 else if (type == TYPE_PRODUCT) {
7032 struct type *lf, *rf;
7033 lf = compatible_types(left->left, right->left);
7034 rf = compatible_types(left->right, right->right);
7036 result = new_type(qual_type, lf, rf);
7040 /* Nothing else is compatible */
7045 /* See if left is a equivalent to right or right is a union member of left */
7046 static int is_subset_type(struct type *left, struct type *right)
7048 if (equiv_types(left, right)) {
7051 if ((left->type & TYPE_MASK) == TYPE_JOIN) {
7052 struct type *member, *mnext;
7057 if ((member->type & TYPE_MASK) == TYPE_OVERLAP) {
7058 mnext = member->right;
7059 member = member->left;
7061 if (is_subset_type( member, right)) {
7069 static struct type *compatible_ptrs(struct type *left, struct type *right)
7071 struct type *result;
7072 if (((left->type & TYPE_MASK) != TYPE_POINTER) ||
7073 ((right->type & TYPE_MASK) != TYPE_POINTER)) {
7076 result = compatible_types(left->left, right->left);
7078 unsigned int qual_type;
7079 qual_type = (left->type & ~STOR_MASK) | (right->type & ~STOR_MASK);
7080 result = new_type(qual_type, result, 0);
7085 static struct triple *integral_promotion(
7086 struct compile_state *state, struct triple *def)
7090 /* As all operations are carried out in registers
7091 * the values are converted on load I just convert
7092 * logical type of the operand.
7094 if (TYPE_INTEGER(type->type)) {
7095 unsigned int int_type;
7096 int_type = type->type & ~TYPE_MASK;
7097 int_type |= do_integral_promotion(get_basic_type(type));
7098 if (int_type != type->type) {
7099 if (def->op != OP_LOAD) {
7100 def->type = new_type(int_type, 0, 0);
7103 def = triple(state, OP_CONVERT,
7104 new_type(int_type, 0, 0), def, 0);
7112 static void arithmetic(struct compile_state *state, struct triple *def)
7114 if (!TYPE_ARITHMETIC(def->type->type)) {
7115 error(state, 0, "arithmetic type expexted");
7119 static void ptr_arithmetic(struct compile_state *state, struct triple *def)
7121 if (!TYPE_PTR(def->type->type) && !TYPE_ARITHMETIC(def->type->type)) {
7122 error(state, def, "pointer or arithmetic type expected");
7126 static int is_integral(struct triple *ins)
7128 return TYPE_INTEGER(ins->type->type);
7131 static void integral(struct compile_state *state, struct triple *def)
7133 if (!is_integral(def)) {
7134 error(state, 0, "integral type expected");
7139 static void bool(struct compile_state *state, struct triple *def)
7141 if (!TYPE_ARITHMETIC(def->type->type) &&
7142 ((def->type->type & TYPE_MASK) != TYPE_POINTER)) {
7143 error(state, 0, "arithmetic or pointer type expected");
7147 static int is_signed(struct type *type)
7149 if ((type->type & TYPE_MASK) == TYPE_BITFIELD) {
7152 return !!TYPE_SIGNED(type->type);
7154 static int is_compound_type(struct type *type)
7157 switch((type->type & TYPE_MASK)) {
7172 /* Is this value located in a register otherwise it must be in memory */
7173 static int is_in_reg(struct compile_state *state, struct triple *def)
7176 if (def->op == OP_ADECL) {
7179 else if ((def->op == OP_SDECL) || (def->op == OP_DEREF)) {
7182 else if (triple_is_part(state, def)) {
7183 in_reg = is_in_reg(state, MISC(def, 0));
7186 internal_error(state, def, "unknown expr storage location");
7192 /* Is this an auto or static variable location? Something that can
7193 * be assigned to. Otherwise it must must be a pure value, a temporary.
7195 static int is_lvalue(struct compile_state *state, struct triple *def)
7202 if ((def->op == OP_ADECL) ||
7203 (def->op == OP_SDECL) ||
7204 (def->op == OP_DEREF) ||
7205 (def->op == OP_BLOBCONST) ||
7206 (def->op == OP_LIST)) {
7209 else if (triple_is_part(state, def)) {
7210 ret = is_lvalue(state, MISC(def, 0));
7215 static void clvalue(struct compile_state *state, struct triple *def)
7218 internal_error(state, def, "nothing where lvalue expected?");
7220 if (!is_lvalue(state, def)) {
7221 error(state, def, "lvalue expected");
7224 static void lvalue(struct compile_state *state, struct triple *def)
7226 clvalue(state, def);
7227 if (def->type->type & QUAL_CONST) {
7228 error(state, def, "modifable lvalue expected");
7232 static int is_pointer(struct triple *def)
7234 return (def->type->type & TYPE_MASK) == TYPE_POINTER;
7237 static void pointer(struct compile_state *state, struct triple *def)
7239 if (!is_pointer(def)) {
7240 error(state, def, "pointer expected");
7244 static struct triple *int_const(
7245 struct compile_state *state, struct type *type, ulong_t value)
7247 struct triple *result;
7248 switch(type->type & TYPE_MASK) {
7250 case TYPE_INT: case TYPE_UINT:
7251 case TYPE_LONG: case TYPE_ULONG:
7254 internal_error(state, 0, "constant for unknown type");
7256 result = triple(state, OP_INTCONST, type, 0, 0);
7257 result->u.cval = value;
7262 static struct triple *read_expr(struct compile_state *state, struct triple *def);
7264 static struct triple *do_mk_addr_expr(struct compile_state *state,
7265 struct triple *expr, struct type *type, ulong_t offset)
7267 struct triple *result;
7268 struct type *ptr_type;
7269 clvalue(state, expr);
7271 ptr_type = new_type(TYPE_POINTER | (type->type & QUAL_MASK), type, 0);
7275 if (expr->op == OP_ADECL) {
7276 error(state, expr, "address of auto variables not supported");
7278 else if (expr->op == OP_SDECL) {
7279 result = triple(state, OP_ADDRCONST, ptr_type, 0, 0);
7280 MISC(result, 0) = expr;
7281 result->u.cval = offset;
7283 else if (expr->op == OP_DEREF) {
7284 result = triple(state, OP_ADD, ptr_type,
7286 int_const(state, &ulong_type, offset));
7288 else if (expr->op == OP_BLOBCONST) {
7290 internal_error(state, expr, "not yet implemented");
7292 else if (expr->op == OP_LIST) {
7293 error(state, 0, "Function addresses not supported");
7295 else if (triple_is_part(state, expr)) {
7296 struct triple *part;
7298 expr = MISC(expr, 0);
7299 if (part->op == OP_DOT) {
7300 offset += bits_to_bytes(
7301 field_offset(state, expr->type, part->u.field));
7303 else if (part->op == OP_INDEX) {
7304 offset += bits_to_bytes(
7305 index_offset(state, expr->type, part->u.cval));
7308 internal_error(state, part, "unhandled part type");
7310 result = do_mk_addr_expr(state, expr, type, offset);
7313 internal_error(state, expr, "cannot take address of expression");
7318 static struct triple *mk_addr_expr(
7319 struct compile_state *state, struct triple *expr, ulong_t offset)
7321 return do_mk_addr_expr(state, expr, expr->type, offset);
7324 static struct triple *mk_deref_expr(
7325 struct compile_state *state, struct triple *expr)
7327 struct type *base_type;
7328 pointer(state, expr);
7329 base_type = expr->type->left;
7330 return triple(state, OP_DEREF, base_type, expr, 0);
7333 /* lvalue conversions always apply except when certain operators
7334 * are applied. So I apply apply it when I know no more
7335 * operators will be applied.
7337 static struct triple *lvalue_conversion(struct compile_state *state, struct triple *def)
7339 /* Tranform an array to a pointer to the first element */
7340 if ((def->type->type & TYPE_MASK) == TYPE_ARRAY) {
7343 TYPE_POINTER | (def->type->type & QUAL_MASK),
7344 def->type->left, 0);
7345 if ((def->op == OP_SDECL) || IS_CONST_OP(def->op)) {
7346 struct triple *addrconst;
7347 if ((def->op != OP_SDECL) && (def->op != OP_BLOBCONST)) {
7348 internal_error(state, def, "bad array constant");
7350 addrconst = triple(state, OP_ADDRCONST, type, 0, 0);
7351 MISC(addrconst, 0) = def;
7355 def = triple(state, OP_CONVERT, type, def, 0);
7358 /* Transform a function to a pointer to it */
7359 else if ((def->type->type & TYPE_MASK) == TYPE_FUNCTION) {
7360 def = mk_addr_expr(state, def, 0);
7365 static struct triple *deref_field(
7366 struct compile_state *state, struct triple *expr, struct hash_entry *field)
7368 struct triple *result;
7369 struct type *type, *member;
7372 internal_error(state, 0, "No field passed to deref_field");
7376 if (((type->type & TYPE_MASK) != TYPE_STRUCT) &&
7377 ((type->type & TYPE_MASK) != TYPE_UNION)) {
7378 error(state, 0, "request for member %s in something not a struct or union",
7381 member = field_type(state, type, field);
7382 if ((type->type & STOR_MASK) == STOR_PERM) {
7383 /* Do the pointer arithmetic to get a deref the field */
7384 offset = bits_to_bytes(field_offset(state, type, field));
7385 result = do_mk_addr_expr(state, expr, member, offset);
7386 result = mk_deref_expr(state, result);
7389 /* Find the variable for the field I want. */
7390 result = triple(state, OP_DOT, member, expr, 0);
7391 result->u.field = field;
7396 static struct triple *deref_index(
7397 struct compile_state *state, struct triple *expr, size_t index)
7399 struct triple *result;
7400 struct type *type, *member;
7405 member = index_type(state, type, index);
7407 if ((type->type & STOR_MASK) == STOR_PERM) {
7408 offset = bits_to_bytes(index_offset(state, type, index));
7409 result = do_mk_addr_expr(state, expr, member, offset);
7410 result = mk_deref_expr(state, result);
7413 result = triple(state, OP_INDEX, member, expr, 0);
7414 result->u.cval = index;
7419 static struct triple *read_expr(struct compile_state *state, struct triple *def)
7425 #if DEBUG_ROMCC_WARNINGS
7426 #warning "CHECK_ME is this the only place I need to do lvalue conversions?"
7428 /* Transform lvalues into something we can read */
7429 def = lvalue_conversion(state, def);
7430 if (!is_lvalue(state, def)) {
7433 if (is_in_reg(state, def)) {
7436 if (def->op == OP_SDECL) {
7437 def = mk_addr_expr(state, def, 0);
7438 def = mk_deref_expr(state, def);
7442 def = triple(state, op, def->type, def, 0);
7443 if (def->type->type & QUAL_VOLATILE) {
7444 def->id |= TRIPLE_FLAG_VOLATILE;
7449 int is_write_compatible(struct compile_state *state,
7450 struct type *dest, struct type *rval)
7453 /* Both operands have arithmetic type */
7454 if (TYPE_ARITHMETIC(dest->type) && TYPE_ARITHMETIC(rval->type)) {
7457 /* One operand is a pointer and the other is a pointer to void */
7458 else if (((dest->type & TYPE_MASK) == TYPE_POINTER) &&
7459 ((rval->type & TYPE_MASK) == TYPE_POINTER) &&
7460 (((dest->left->type & TYPE_MASK) == TYPE_VOID) ||
7461 ((rval->left->type & TYPE_MASK) == TYPE_VOID))) {
7464 /* If both types are the same without qualifiers we are good */
7465 else if (equiv_ptrs(dest, rval)) {
7468 /* test for struct/union equality */
7469 else if (equiv_types(dest, rval)) {
7475 static void write_compatible(struct compile_state *state,
7476 struct type *dest, struct type *rval)
7478 if (!is_write_compatible(state, dest, rval)) {
7479 FILE *fp = state->errout;
7480 fprintf(fp, "dest: ");
7482 fprintf(fp,"\nrval: ");
7485 error(state, 0, "Incompatible types in assignment");
7489 static int is_init_compatible(struct compile_state *state,
7490 struct type *dest, struct type *rval)
7493 if (is_write_compatible(state, dest, rval)) {
7496 else if (equiv_types(dest, rval)) {
7502 static struct triple *write_expr(
7503 struct compile_state *state, struct triple *dest, struct triple *rval)
7509 internal_error(state, 0, "missing rval");
7512 if (rval->op == OP_LIST) {
7513 internal_error(state, 0, "expression of type OP_LIST?");
7515 if (!is_lvalue(state, dest)) {
7516 internal_error(state, 0, "writing to a non lvalue?");
7518 if (dest->type->type & QUAL_CONST) {
7519 internal_error(state, 0, "modifable lvalue expexted");
7522 write_compatible(state, dest->type, rval->type);
7523 if (!equiv_types(dest->type, rval->type)) {
7524 rval = triple(state, OP_CONVERT, dest->type, rval, 0);
7527 /* Now figure out which assignment operator to use */
7528 if (is_in_reg(state, dest)) {
7529 def = triple(state, OP_WRITE, dest->type, rval, dest);
7530 if (MISC(def, 0) != dest) {
7531 internal_error(state, def, "huh?");
7533 if (RHS(def, 0) != rval) {
7534 internal_error(state, def, "huh?");
7537 def = triple(state, OP_STORE, dest->type, dest, rval);
7539 if (def->type->type & QUAL_VOLATILE) {
7540 def->id |= TRIPLE_FLAG_VOLATILE;
7545 static struct triple *init_expr(
7546 struct compile_state *state, struct triple *dest, struct triple *rval)
7552 internal_error(state, 0, "missing rval");
7554 if ((dest->type->type & STOR_MASK) != STOR_PERM) {
7555 rval = read_expr(state, rval);
7556 def = write_expr(state, dest, rval);
7559 /* Fill in the array size if necessary */
7560 if (((dest->type->type & TYPE_MASK) == TYPE_ARRAY) &&
7561 ((rval->type->type & TYPE_MASK) == TYPE_ARRAY)) {
7562 if (dest->type->elements == ELEMENT_COUNT_UNSPECIFIED) {
7563 dest->type->elements = rval->type->elements;
7566 if (!equiv_types(dest->type, rval->type)) {
7567 error(state, 0, "Incompatible types in inializer");
7569 MISC(dest, 0) = rval;
7570 insert_triple(state, dest, rval);
7571 rval->id |= TRIPLE_FLAG_FLATTENED;
7572 use_triple(MISC(dest, 0), dest);
7577 struct type *arithmetic_result(
7578 struct compile_state *state, struct triple *left, struct triple *right)
7581 /* Sanity checks to ensure I am working with arithmetic types */
7582 arithmetic(state, left);
7583 arithmetic(state, right);
7585 do_arithmetic_conversion(
7586 get_basic_type(left->type),
7587 get_basic_type(right->type)),
7592 struct type *ptr_arithmetic_result(
7593 struct compile_state *state, struct triple *left, struct triple *right)
7596 /* Sanity checks to ensure I am working with the proper types */
7597 ptr_arithmetic(state, left);
7598 arithmetic(state, right);
7599 if (TYPE_ARITHMETIC(left->type->type) &&
7600 TYPE_ARITHMETIC(right->type->type)) {
7601 type = arithmetic_result(state, left, right);
7603 else if (TYPE_PTR(left->type->type)) {
7607 internal_error(state, 0, "huh?");
7613 /* boolean helper function */
7615 static struct triple *ltrue_expr(struct compile_state *state,
7616 struct triple *expr)
7619 case OP_LTRUE: case OP_LFALSE: case OP_EQ: case OP_NOTEQ:
7620 case OP_SLESS: case OP_ULESS: case OP_SMORE: case OP_UMORE:
7621 case OP_SLESSEQ: case OP_ULESSEQ: case OP_SMOREEQ: case OP_UMOREEQ:
7622 /* If the expression is already boolean do nothing */
7625 expr = triple(state, OP_LTRUE, &int_type, expr, 0);
7631 static struct triple *lfalse_expr(struct compile_state *state,
7632 struct triple *expr)
7634 return triple(state, OP_LFALSE, &int_type, expr, 0);
7637 static struct triple *mkland_expr(
7638 struct compile_state *state,
7639 struct triple *left, struct triple *right)
7641 struct triple *def, *val, *var, *jmp, *mid, *end;
7642 struct triple *lstore, *rstore;
7644 /* Generate some intermediate triples */
7646 var = variable(state, &int_type);
7648 /* Store the left hand side value */
7649 lstore = write_expr(state, var, left);
7651 /* Jump if the value is false */
7652 jmp = branch(state, end,
7653 lfalse_expr(state, read_expr(state, var)));
7656 /* Store the right hand side value */
7657 rstore = write_expr(state, var, right);
7659 /* An expression for the computed value */
7660 val = read_expr(state, var);
7662 /* Generate the prog for a logical and */
7663 def = mkprog(state, var, lstore, jmp, mid, rstore, end, val, 0UL);
7668 static struct triple *mklor_expr(
7669 struct compile_state *state,
7670 struct triple *left, struct triple *right)
7672 struct triple *def, *val, *var, *jmp, *mid, *end;
7674 /* Generate some intermediate triples */
7676 var = variable(state, &int_type);
7678 /* Store the left hand side value */
7679 left = write_expr(state, var, left);
7681 /* Jump if the value is true */
7682 jmp = branch(state, end, read_expr(state, var));
7685 /* Store the right hand side value */
7686 right = write_expr(state, var, right);
7688 /* An expression for the computed value*/
7689 val = read_expr(state, var);
7691 /* Generate the prog for a logical or */
7692 def = mkprog(state, var, left, jmp, mid, right, end, val, 0UL);
7697 static struct triple *mkcond_expr(
7698 struct compile_state *state,
7699 struct triple *test, struct triple *left, struct triple *right)
7701 struct triple *def, *val, *var, *jmp1, *jmp2, *top, *mid, *end;
7702 struct type *result_type;
7703 unsigned int left_type, right_type;
7705 left_type = left->type->type;
7706 right_type = right->type->type;
7708 /* Both operands have arithmetic type */
7709 if (TYPE_ARITHMETIC(left_type) && TYPE_ARITHMETIC(right_type)) {
7710 result_type = arithmetic_result(state, left, right);
7712 /* Both operands have void type */
7713 else if (((left_type & TYPE_MASK) == TYPE_VOID) &&
7714 ((right_type & TYPE_MASK) == TYPE_VOID)) {
7715 result_type = &void_type;
7717 /* pointers to the same type... */
7718 else if ((result_type = compatible_ptrs(left->type, right->type))) {
7721 /* Both operands are pointers and left is a pointer to void */
7722 else if (((left_type & TYPE_MASK) == TYPE_POINTER) &&
7723 ((right_type & TYPE_MASK) == TYPE_POINTER) &&
7724 ((left->type->left->type & TYPE_MASK) == TYPE_VOID)) {
7725 result_type = right->type;
7727 /* Both operands are pointers and right is a pointer to void */
7728 else if (((left_type & TYPE_MASK) == TYPE_POINTER) &&
7729 ((right_type & TYPE_MASK) == TYPE_POINTER) &&
7730 ((right->type->left->type & TYPE_MASK) == TYPE_VOID)) {
7731 result_type = left->type;
7734 error(state, 0, "Incompatible types in conditional expression");
7736 /* Generate some intermediate triples */
7739 var = variable(state, result_type);
7741 /* Branch if the test is false */
7742 jmp1 = branch(state, mid, lfalse_expr(state, read_expr(state, test)));
7745 /* Store the left hand side value */
7746 left = write_expr(state, var, left);
7748 /* Branch to the end */
7749 jmp2 = branch(state, end, 0);
7751 /* Store the right hand side value */
7752 right = write_expr(state, var, right);
7754 /* An expression for the computed value */
7755 val = read_expr(state, var);
7757 /* Generate the prog for a conditional expression */
7758 def = mkprog(state, var, jmp1, top, left, jmp2, mid, right, end, val, 0UL);
7764 static int expr_depth(struct compile_state *state, struct triple *ins)
7766 #if DEBUG_ROMCC_WARNINGS
7767 #warning "FIXME move optimal ordering of subexpressions into the optimizer"
7771 if (!ins || (ins->id & TRIPLE_FLAG_FLATTENED)) {
7774 else if (ins->op == OP_DEREF) {
7775 count = expr_depth(state, RHS(ins, 0)) - 1;
7777 else if (ins->op == OP_VAL) {
7778 count = expr_depth(state, RHS(ins, 0)) - 1;
7780 else if (ins->op == OP_FCALL) {
7781 /* Don't figure the depth of a call just guess it is huge */
7785 struct triple **expr;
7786 expr = triple_rhs(state, ins, 0);
7787 for(;expr; expr = triple_rhs(state, ins, expr)) {
7790 depth = expr_depth(state, *expr);
7791 if (depth > count) {
7800 static struct triple *flatten_generic(
7801 struct compile_state *state, struct triple *first, struct triple *ptr,
7806 struct triple **ins;
7809 /* Only operations with just a rhs and a lhs should come here */
7812 if (TRIPLE_SIZE(ptr) != lhs + rhs + ignored) {
7813 internal_error(state, ptr, "unexpected args for: %d %s",
7814 ptr->op, tops(ptr->op));
7816 /* Find the depth of the rhs elements */
7817 for(i = 0; i < rhs; i++) {
7818 vector[i].ins = &RHS(ptr, i);
7819 vector[i].depth = expr_depth(state, *vector[i].ins);
7821 /* Selection sort the rhs */
7822 for(i = 0; i < rhs; i++) {
7824 for(j = i + 1; j < rhs; j++ ) {
7825 if (vector[j].depth > vector[max].depth) {
7830 struct rhs_vector tmp;
7832 vector[i] = vector[max];
7836 /* Now flatten the rhs elements */
7837 for(i = 0; i < rhs; i++) {
7838 *vector[i].ins = flatten(state, first, *vector[i].ins);
7839 use_triple(*vector[i].ins, ptr);
7842 insert_triple(state, first, ptr);
7843 ptr->id |= TRIPLE_FLAG_FLATTENED;
7844 ptr->id &= ~TRIPLE_FLAG_LOCAL;
7846 /* Now flatten the lhs elements */
7847 for(i = 0; i < lhs; i++) {
7848 struct triple **ins = &LHS(ptr, i);
7849 *ins = flatten(state, first, *ins);
7850 use_triple(*ins, ptr);
7856 static struct triple *flatten_prog(
7857 struct compile_state *state, struct triple *first, struct triple *ptr)
7859 struct triple *head, *body, *val;
7864 release_triple(state, head);
7865 release_triple(state, ptr);
7867 body->prev = first->prev;
7868 body->prev->next = body;
7869 val->next->prev = val;
7871 if (triple_is_cbranch(state, body->prev) ||
7872 triple_is_call(state, body->prev)) {
7873 unuse_triple(first, body->prev);
7874 use_triple(body, body->prev);
7877 if (!(val->id & TRIPLE_FLAG_FLATTENED)) {
7878 internal_error(state, val, "val not flattened?");
7885 static struct triple *flatten_part(
7886 struct compile_state *state, struct triple *first, struct triple *ptr)
7888 if (!triple_is_part(state, ptr)) {
7889 internal_error(state, ptr, "not a part");
7891 if (ptr->rhs || ptr->lhs || ptr->targ || (ptr->misc != 1)) {
7892 internal_error(state, ptr, "unexpected args for: %d %s",
7893 ptr->op, tops(ptr->op));
7895 MISC(ptr, 0) = flatten(state, first, MISC(ptr, 0));
7896 use_triple(MISC(ptr, 0), ptr);
7897 return flatten_generic(state, first, ptr, 1);
7900 static struct triple *flatten(
7901 struct compile_state *state, struct triple *first, struct triple *ptr)
7903 struct triple *orig_ptr;
7908 /* Only flatten triples once */
7909 if (ptr->id & TRIPLE_FLAG_FLATTENED) {
7914 RHS(ptr, 0) = flatten(state, first, RHS(ptr, 0));
7915 return MISC(ptr, 0);
7918 ptr = flatten_prog(state, first, ptr);
7921 ptr = flatten_generic(state, first, ptr, 1);
7922 insert_triple(state, first, ptr);
7923 ptr->id |= TRIPLE_FLAG_FLATTENED;
7924 ptr->id &= ~TRIPLE_FLAG_LOCAL;
7925 if (ptr->next != ptr) {
7926 use_triple(ptr->next, ptr);
7931 RHS(ptr, 0) = flatten(state, first, RHS(ptr, 0));
7932 use_triple(RHS(ptr, 0), ptr);
7935 ptr = flatten_generic(state, first, ptr, 1);
7936 MISC(ptr, 0) = flatten(state, first, MISC(ptr, 0));
7937 use_triple(MISC(ptr, 0), ptr);
7940 use_triple(TARG(ptr, 0), ptr);
7943 RHS(ptr, 0) = flatten(state, first, RHS(ptr, 0));
7944 use_triple(RHS(ptr, 0), ptr);
7945 use_triple(TARG(ptr, 0), ptr);
7946 insert_triple(state, first, ptr);
7947 ptr->id |= TRIPLE_FLAG_FLATTENED;
7948 ptr->id &= ~TRIPLE_FLAG_LOCAL;
7949 if (ptr->next != ptr) {
7950 use_triple(ptr->next, ptr);
7954 MISC(ptr, 0) = flatten(state, first, MISC(ptr, 0));
7955 use_triple(MISC(ptr, 0), ptr);
7956 use_triple(TARG(ptr, 0), ptr);
7957 insert_triple(state, first, ptr);
7958 ptr->id |= TRIPLE_FLAG_FLATTENED;
7959 ptr->id &= ~TRIPLE_FLAG_LOCAL;
7960 if (ptr->next != ptr) {
7961 use_triple(ptr->next, ptr);
7965 RHS(ptr, 0) = flatten(state, first, RHS(ptr, 0));
7966 use_triple(RHS(ptr, 0), ptr);
7969 insert_triple(state, state->global_pool, ptr);
7970 ptr->id |= TRIPLE_FLAG_FLATTENED;
7971 ptr->id &= ~TRIPLE_FLAG_LOCAL;
7972 ptr = triple(state, OP_SDECL, ptr->type, ptr, 0);
7973 use_triple(MISC(ptr, 0), ptr);
7976 /* Since OP_DEREF is just a marker delete it when I flatten it */
7978 RHS(orig_ptr, 0) = 0;
7979 free_triple(state, orig_ptr);
7982 if (RHS(ptr, 0)->op == OP_DEREF) {
7983 struct triple *base, *left;
7985 base = MISC(ptr, 0);
7986 offset = bits_to_bytes(field_offset(state, base->type, ptr->u.field));
7987 left = RHS(base, 0);
7988 ptr = triple(state, OP_ADD, left->type,
7989 read_expr(state, left),
7990 int_const(state, &ulong_type, offset));
7991 free_triple(state, base);
7994 ptr = flatten_part(state, first, ptr);
7998 if (RHS(ptr, 0)->op == OP_DEREF) {
7999 struct triple *base, *left;
8001 base = MISC(ptr, 0);
8002 offset = bits_to_bytes(index_offset(state, base->type, ptr->u.cval));
8003 left = RHS(base, 0);
8004 ptr = triple(state, OP_ADD, left->type,
8005 read_expr(state, left),
8006 int_const(state, &long_type, offset));
8007 free_triple(state, base);
8010 ptr = flatten_part(state, first, ptr);
8014 ptr = flatten_part(state, first, ptr);
8015 use_triple(ptr, MISC(ptr, 0));
8018 MISC(ptr, 0) = flatten(state, first, MISC(ptr, 0));
8019 use_triple(MISC(ptr, 0), ptr);
8022 first = state->global_pool;
8023 MISC(ptr, 0) = flatten(state, first, MISC(ptr, 0));
8024 use_triple(MISC(ptr, 0), ptr);
8025 insert_triple(state, first, ptr);
8026 ptr->id |= TRIPLE_FLAG_FLATTENED;
8027 ptr->id &= ~TRIPLE_FLAG_LOCAL;
8030 ptr = flatten_generic(state, first, ptr, 0);
8033 /* Flatten the easy cases we don't override */
8034 ptr = flatten_generic(state, first, ptr, 0);
8037 } while(ptr && (ptr != orig_ptr));
8038 if (ptr && !(ptr->id & TRIPLE_FLAG_FLATTENED)) {
8039 insert_triple(state, first, ptr);
8040 ptr->id |= TRIPLE_FLAG_FLATTENED;
8041 ptr->id &= ~TRIPLE_FLAG_LOCAL;
8046 static void release_expr(struct compile_state *state, struct triple *expr)
8048 struct triple *head;
8049 head = label(state);
8050 flatten(state, head, expr);
8051 while(head->next != head) {
8052 release_triple(state, head->next);
8054 free_triple(state, head);
8057 static int replace_rhs_use(struct compile_state *state,
8058 struct triple *orig, struct triple *new, struct triple *use)
8060 struct triple **expr;
8063 expr = triple_rhs(state, use, 0);
8064 for(;expr; expr = triple_rhs(state, use, expr)) {
8065 if (*expr == orig) {
8071 unuse_triple(orig, use);
8072 use_triple(new, use);
8077 static int replace_lhs_use(struct compile_state *state,
8078 struct triple *orig, struct triple *new, struct triple *use)
8080 struct triple **expr;
8083 expr = triple_lhs(state, use, 0);
8084 for(;expr; expr = triple_lhs(state, use, expr)) {
8085 if (*expr == orig) {
8091 unuse_triple(orig, use);
8092 use_triple(new, use);
8097 static int replace_misc_use(struct compile_state *state,
8098 struct triple *orig, struct triple *new, struct triple *use)
8100 struct triple **expr;
8103 expr = triple_misc(state, use, 0);
8104 for(;expr; expr = triple_misc(state, use, expr)) {
8105 if (*expr == orig) {
8111 unuse_triple(orig, use);
8112 use_triple(new, use);
8117 static int replace_targ_use(struct compile_state *state,
8118 struct triple *orig, struct triple *new, struct triple *use)
8120 struct triple **expr;
8123 expr = triple_targ(state, use, 0);
8124 for(;expr; expr = triple_targ(state, use, expr)) {
8125 if (*expr == orig) {
8131 unuse_triple(orig, use);
8132 use_triple(new, use);
8137 static void replace_use(struct compile_state *state,
8138 struct triple *orig, struct triple *new, struct triple *use)
8142 found |= replace_rhs_use(state, orig, new, use);
8143 found |= replace_lhs_use(state, orig, new, use);
8144 found |= replace_misc_use(state, orig, new, use);
8145 found |= replace_targ_use(state, orig, new, use);
8147 internal_error(state, use, "use without use");
8151 static void propogate_use(struct compile_state *state,
8152 struct triple *orig, struct triple *new)
8154 struct triple_set *user, *next;
8155 for(user = orig->use; user; user = next) {
8156 /* Careful replace_use modifies the use chain and
8157 * removes use. So we must get a copy of the next
8161 replace_use(state, orig, new, user->member);
8164 internal_error(state, orig, "used after propogate_use");
8170 * ===========================
8173 static struct triple *mk_cast_expr(
8174 struct compile_state *state, struct type *type, struct triple *expr)
8177 def = read_expr(state, expr);
8178 def = triple(state, OP_CONVERT, type, def, 0);
8182 static struct triple *mk_add_expr(
8183 struct compile_state *state, struct triple *left, struct triple *right)
8185 struct type *result_type;
8186 /* Put pointer operands on the left */
8187 if (is_pointer(right)) {
8193 left = read_expr(state, left);
8194 right = read_expr(state, right);
8195 result_type = ptr_arithmetic_result(state, left, right);
8196 if (is_pointer(left)) {
8197 struct type *ptr_math;
8199 if (is_signed(right->type)) {
8200 ptr_math = &long_type;
8203 ptr_math = &ulong_type;
8206 if (!equiv_types(right->type, ptr_math)) {
8207 right = mk_cast_expr(state, ptr_math, right);
8209 right = triple(state, op, ptr_math, right,
8210 int_const(state, ptr_math,
8211 size_of_in_bytes(state, left->type->left)));
8213 return triple(state, OP_ADD, result_type, left, right);
8216 static struct triple *mk_sub_expr(
8217 struct compile_state *state, struct triple *left, struct triple *right)
8219 struct type *result_type;
8220 result_type = ptr_arithmetic_result(state, left, right);
8221 left = read_expr(state, left);
8222 right = read_expr(state, right);
8223 if (is_pointer(left)) {
8224 struct type *ptr_math;
8226 if (is_signed(right->type)) {
8227 ptr_math = &long_type;
8230 ptr_math = &ulong_type;
8233 if (!equiv_types(right->type, ptr_math)) {
8234 right = mk_cast_expr(state, ptr_math, right);
8236 right = triple(state, op, ptr_math, right,
8237 int_const(state, ptr_math,
8238 size_of_in_bytes(state, left->type->left)));
8240 return triple(state, OP_SUB, result_type, left, right);
8243 static struct triple *mk_pre_inc_expr(
8244 struct compile_state *state, struct triple *def)
8248 val = mk_add_expr(state, def, int_const(state, &int_type, 1));
8249 return triple(state, OP_VAL, def->type,
8250 write_expr(state, def, val),
8254 static struct triple *mk_pre_dec_expr(
8255 struct compile_state *state, struct triple *def)
8259 val = mk_sub_expr(state, def, int_const(state, &int_type, 1));
8260 return triple(state, OP_VAL, def->type,
8261 write_expr(state, def, val),
8265 static struct triple *mk_post_inc_expr(
8266 struct compile_state *state, struct triple *def)
8270 val = read_expr(state, def);
8271 return triple(state, OP_VAL, def->type,
8272 write_expr(state, def,
8273 mk_add_expr(state, val, int_const(state, &int_type, 1)))
8277 static struct triple *mk_post_dec_expr(
8278 struct compile_state *state, struct triple *def)
8282 val = read_expr(state, def);
8283 return triple(state, OP_VAL, def->type,
8284 write_expr(state, def,
8285 mk_sub_expr(state, val, int_const(state, &int_type, 1)))
8289 static struct triple *mk_subscript_expr(
8290 struct compile_state *state, struct triple *left, struct triple *right)
8292 left = read_expr(state, left);
8293 right = read_expr(state, right);
8294 if (!is_pointer(left) && !is_pointer(right)) {
8295 error(state, left, "subscripted value is not a pointer");
8297 return mk_deref_expr(state, mk_add_expr(state, left, right));
8302 * Compile time evaluation
8303 * ===========================
8305 static int is_const(struct triple *ins)
8307 return IS_CONST_OP(ins->op);
8310 static int is_simple_const(struct triple *ins)
8312 /* Is this a constant that u.cval has the value.
8313 * Or equivalently is this a constant that read_const
8315 * So far only OP_INTCONST qualifies.
8317 return (ins->op == OP_INTCONST);
8320 static int constants_equal(struct compile_state *state,
8321 struct triple *left, struct triple *right)
8324 if ((left->op == OP_UNKNOWNVAL) || (right->op == OP_UNKNOWNVAL)) {
8327 else if (!is_const(left) || !is_const(right)) {
8330 else if (left->op != right->op) {
8333 else if (!equiv_types(left->type, right->type)) {
8340 if (left->u.cval == right->u.cval) {
8346 size_t lsize, rsize, bytes;
8347 lsize = size_of(state, left->type);
8348 rsize = size_of(state, right->type);
8349 if (lsize != rsize) {
8352 bytes = bits_to_bytes(lsize);
8353 if (memcmp(left->u.blob, right->u.blob, bytes) == 0) {
8359 if ((MISC(left, 0) == MISC(right, 0)) &&
8360 (left->u.cval == right->u.cval)) {
8365 internal_error(state, left, "uknown constant type");
8372 static int is_zero(struct triple *ins)
8374 return is_simple_const(ins) && (ins->u.cval == 0);
8377 static int is_one(struct triple *ins)
8379 return is_simple_const(ins) && (ins->u.cval == 1);
8382 #if DEBUG_ROMCC_WARNING
8383 static long_t bit_count(ulong_t value)
8388 for(i = (sizeof(ulong_t)*8) -1; i >= 0; i--) {
8401 static long_t bsr(ulong_t value)
8404 for(i = (sizeof(ulong_t)*8) -1; i >= 0; i--) {
8415 static long_t bsf(ulong_t value)
8418 for(i = 0; i < (sizeof(ulong_t)*8); i++) {
8429 static long_t ilog2(ulong_t value)
8434 static long_t tlog2(struct triple *ins)
8436 return ilog2(ins->u.cval);
8439 static int is_pow2(struct triple *ins)
8441 ulong_t value, mask;
8443 if (!is_const(ins)) {
8446 value = ins->u.cval;
8453 return ((value & mask) == value);
8456 static ulong_t read_const(struct compile_state *state,
8457 struct triple *ins, struct triple *rhs)
8459 switch(rhs->type->type &TYPE_MASK) {
8472 fprintf(state->errout, "type: ");
8473 name_of(state->errout, rhs->type);
8474 fprintf(state->errout, "\n");
8475 internal_warning(state, rhs, "bad type to read_const");
8478 if (!is_simple_const(rhs)) {
8479 internal_error(state, rhs, "bad op to read_const");
8484 static long_t read_sconst(struct compile_state *state,
8485 struct triple *ins, struct triple *rhs)
8487 return (long_t)(rhs->u.cval);
8490 int const_ltrue(struct compile_state *state, struct triple *ins, struct triple *rhs)
8492 if (!is_const(rhs)) {
8493 internal_error(state, 0, "non const passed to const_true");
8495 return !is_zero(rhs);
8498 int const_eq(struct compile_state *state, struct triple *ins,
8499 struct triple *left, struct triple *right)
8502 if (!is_const(left) || !is_const(right)) {
8503 internal_warning(state, ins, "non const passed to const_eq");
8506 else if (left == right) {
8509 else if (is_simple_const(left) && is_simple_const(right)) {
8511 lval = read_const(state, ins, left);
8512 rval = read_const(state, ins, right);
8513 result = (lval == rval);
8515 else if ((left->op == OP_ADDRCONST) &&
8516 (right->op == OP_ADDRCONST)) {
8517 result = (MISC(left, 0) == MISC(right, 0)) &&
8518 (left->u.cval == right->u.cval);
8521 internal_warning(state, ins, "incomparable constants passed to const_eq");
8528 int const_ucmp(struct compile_state *state, struct triple *ins,
8529 struct triple *left, struct triple *right)
8532 if (!is_const(left) || !is_const(right)) {
8533 internal_warning(state, ins, "non const past to const_ucmp");
8536 else if (left == right) {
8539 else if (is_simple_const(left) && is_simple_const(right)) {
8541 lval = read_const(state, ins, left);
8542 rval = read_const(state, ins, right);
8546 } else if (rval > lval) {
8550 else if ((left->op == OP_ADDRCONST) &&
8551 (right->op == OP_ADDRCONST) &&
8552 (MISC(left, 0) == MISC(right, 0))) {
8554 if (left->u.cval > right->u.cval) {
8556 } else if (left->u.cval < right->u.cval) {
8561 internal_warning(state, ins, "incomparable constants passed to const_ucmp");
8567 int const_scmp(struct compile_state *state, struct triple *ins,
8568 struct triple *left, struct triple *right)
8571 if (!is_const(left) || !is_const(right)) {
8572 internal_warning(state, ins, "non const past to ucmp_const");
8575 else if (left == right) {
8578 else if (is_simple_const(left) && is_simple_const(right)) {
8580 lval = read_sconst(state, ins, left);
8581 rval = read_sconst(state, ins, right);
8585 } else if (rval > lval) {
8590 internal_warning(state, ins, "incomparable constants passed to const_scmp");
8596 static void unuse_rhs(struct compile_state *state, struct triple *ins)
8598 struct triple **expr;
8599 expr = triple_rhs(state, ins, 0);
8600 for(;expr;expr = triple_rhs(state, ins, expr)) {
8602 unuse_triple(*expr, ins);
8608 static void unuse_lhs(struct compile_state *state, struct triple *ins)
8610 struct triple **expr;
8611 expr = triple_lhs(state, ins, 0);
8612 for(;expr;expr = triple_lhs(state, ins, expr)) {
8613 unuse_triple(*expr, ins);
8618 #if DEBUG_ROMCC_WARNING
8619 static void unuse_misc(struct compile_state *state, struct triple *ins)
8621 struct triple **expr;
8622 expr = triple_misc(state, ins, 0);
8623 for(;expr;expr = triple_misc(state, ins, expr)) {
8624 unuse_triple(*expr, ins);
8629 static void unuse_targ(struct compile_state *state, struct triple *ins)
8632 struct triple **slot;
8633 slot = &TARG(ins, 0);
8634 for(i = 0; i < ins->targ; i++) {
8635 unuse_triple(slot[i], ins);
8640 static void check_lhs(struct compile_state *state, struct triple *ins)
8642 struct triple **expr;
8643 expr = triple_lhs(state, ins, 0);
8644 for(;expr;expr = triple_lhs(state, ins, expr)) {
8645 internal_error(state, ins, "unexpected lhs");
8651 static void check_misc(struct compile_state *state, struct triple *ins)
8653 struct triple **expr;
8654 expr = triple_misc(state, ins, 0);
8655 for(;expr;expr = triple_misc(state, ins, expr)) {
8657 internal_error(state, ins, "unexpected misc");
8662 static void check_targ(struct compile_state *state, struct triple *ins)
8664 struct triple **expr;
8665 expr = triple_targ(state, ins, 0);
8666 for(;expr;expr = triple_targ(state, ins, expr)) {
8667 internal_error(state, ins, "unexpected targ");
8671 static void wipe_ins(struct compile_state *state, struct triple *ins)
8673 /* Becareful which instructions you replace the wiped
8674 * instruction with, as there are not enough slots
8675 * in all instructions to hold all others.
8677 check_targ(state, ins);
8678 check_misc(state, ins);
8679 unuse_rhs(state, ins);
8680 unuse_lhs(state, ins);
8687 #if DEBUG_ROMCC_WARNING
8688 static void wipe_branch(struct compile_state *state, struct triple *ins)
8690 /* Becareful which instructions you replace the wiped
8691 * instruction with, as there are not enough slots
8692 * in all instructions to hold all others.
8694 unuse_rhs(state, ins);
8695 unuse_lhs(state, ins);
8696 unuse_misc(state, ins);
8697 unuse_targ(state, ins);
8705 static void mkcopy(struct compile_state *state,
8706 struct triple *ins, struct triple *rhs)
8708 struct block *block;
8709 if (!equiv_types(ins->type, rhs->type)) {
8710 FILE *fp = state->errout;
8711 fprintf(fp, "src type: ");
8712 name_of(fp, rhs->type);
8713 fprintf(fp, "\ndst type: ");
8714 name_of(fp, ins->type);
8716 internal_error(state, ins, "mkcopy type mismatch");
8718 block = block_of_triple(state, ins);
8719 wipe_ins(state, ins);
8722 ins->u.block = block;
8724 use_triple(RHS(ins, 0), ins);
8727 static void mkconst(struct compile_state *state,
8728 struct triple *ins, ulong_t value)
8730 if (!is_integral(ins) && !is_pointer(ins)) {
8731 fprintf(state->errout, "type: ");
8732 name_of(state->errout, ins->type);
8733 fprintf(state->errout, "\n");
8734 internal_error(state, ins, "unknown type to make constant value: %ld",
8737 wipe_ins(state, ins);
8738 ins->op = OP_INTCONST;
8739 ins->u.cval = value;
8742 static void mkaddr_const(struct compile_state *state,
8743 struct triple *ins, struct triple *sdecl, ulong_t value)
8745 if ((sdecl->op != OP_SDECL) && (sdecl->op != OP_LABEL)) {
8746 internal_error(state, ins, "bad base for addrconst");
8748 wipe_ins(state, ins);
8749 ins->op = OP_ADDRCONST;
8751 MISC(ins, 0) = sdecl;
8752 ins->u.cval = value;
8753 use_triple(sdecl, ins);
8756 #if DEBUG_DECOMPOSE_PRINT_TUPLES
8757 static void print_tuple(struct compile_state *state,
8758 struct triple *ins, struct triple *tuple)
8760 FILE *fp = state->dbgout;
8761 fprintf(fp, "%5s %p tuple: %p ", tops(ins->op), ins, tuple);
8762 name_of(fp, tuple->type);
8763 if (tuple->lhs > 0) {
8764 fprintf(fp, " lhs: ");
8765 name_of(fp, LHS(tuple, 0)->type);
8772 static struct triple *decompose_with_tuple(struct compile_state *state,
8773 struct triple *ins, struct triple *tuple)
8775 struct triple *next;
8777 flatten(state, next, tuple);
8778 #if DEBUG_DECOMPOSE_PRINT_TUPLES
8779 print_tuple(state, ins, tuple);
8782 if (!is_compound_type(tuple->type) && (tuple->lhs > 0)) {
8784 if (tuple->lhs != 1) {
8785 internal_error(state, tuple, "plain type in multiple registers?");
8787 tmp = LHS(tuple, 0);
8788 release_triple(state, tuple);
8792 propogate_use(state, ins, tuple);
8793 release_triple(state, ins);
8798 static struct triple *decompose_unknownval(struct compile_state *state,
8801 struct triple *tuple;
8804 #if DEBUG_DECOMPOSE_HIRES
8805 FILE *fp = state->dbgout;
8806 fprintf(fp, "unknown type: ");
8807 name_of(fp, ins->type);
8811 get_occurance(ins->occurance);
8812 tuple = alloc_triple(state, OP_TUPLE, ins->type, -1, -1,
8815 for(i = 0; i < tuple->lhs; i++) {
8816 struct type *piece_type;
8817 struct triple *unknown;
8819 piece_type = reg_type(state, ins->type, i * REG_SIZEOF_REG);
8820 get_occurance(tuple->occurance);
8821 unknown = alloc_triple(state, OP_UNKNOWNVAL, piece_type, 0, 0,
8823 LHS(tuple, i) = unknown;
8825 return decompose_with_tuple(state, ins, tuple);
8829 static struct triple *decompose_read(struct compile_state *state,
8832 struct triple *tuple, *lval;
8837 if (lval->op == OP_PIECE) {
8840 get_occurance(ins->occurance);
8841 tuple = alloc_triple(state, OP_TUPLE, lval->type, -1, -1,
8844 if ((tuple->lhs != lval->lhs) &&
8845 (!triple_is_def(state, lval) || (tuple->lhs != 1)))
8847 internal_error(state, ins, "lhs size inconsistency?");
8849 for(i = 0; i < tuple->lhs; i++) {
8850 struct triple *piece, *read, *bitref;
8851 if ((i != 0) || !triple_is_def(state, lval)) {
8852 piece = LHS(lval, i);
8857 /* See if the piece is really a bitref */
8859 if (piece->op == OP_BITREF) {
8861 piece = RHS(bitref, 0);
8864 get_occurance(tuple->occurance);
8865 read = alloc_triple(state, OP_READ, piece->type, -1, -1,
8867 RHS(read, 0) = piece;
8870 struct triple *extract;
8872 if (is_signed(bitref->type->left)) {
8877 get_occurance(tuple->occurance);
8878 extract = alloc_triple(state, op, bitref->type, -1, -1,
8880 RHS(extract, 0) = read;
8881 extract->u.bitfield.size = bitref->u.bitfield.size;
8882 extract->u.bitfield.offset = bitref->u.bitfield.offset;
8887 LHS(tuple, i) = read;
8889 return decompose_with_tuple(state, ins, tuple);
8892 static struct triple *decompose_write(struct compile_state *state,
8895 struct triple *tuple, *lval, *val;
8898 lval = MISC(ins, 0);
8900 get_occurance(ins->occurance);
8901 tuple = alloc_triple(state, OP_TUPLE, ins->type, -1, -1,
8904 if ((tuple->lhs != lval->lhs) &&
8905 (!triple_is_def(state, lval) || tuple->lhs != 1))
8907 internal_error(state, ins, "lhs size inconsistency?");
8909 for(i = 0; i < tuple->lhs; i++) {
8910 struct triple *piece, *write, *pval, *bitref;
8911 if ((i != 0) || !triple_is_def(state, lval)) {
8912 piece = LHS(lval, i);
8916 if ((i == 0) && (tuple->lhs == 1) && (val->lhs == 0)) {
8921 internal_error(state, ins, "lhs size inconsistency?");
8926 /* See if the piece is really a bitref */
8928 if (piece->op == OP_BITREF) {
8929 struct triple *read, *deposit;
8931 piece = RHS(bitref, 0);
8933 /* Read the destination register */
8934 get_occurance(tuple->occurance);
8935 read = alloc_triple(state, OP_READ, piece->type, -1, -1,
8937 RHS(read, 0) = piece;
8939 /* Deposit the new bitfield value */
8940 get_occurance(tuple->occurance);
8941 deposit = alloc_triple(state, OP_DEPOSIT, piece->type, -1, -1,
8943 RHS(deposit, 0) = read;
8944 RHS(deposit, 1) = pval;
8945 deposit->u.bitfield.size = bitref->u.bitfield.size;
8946 deposit->u.bitfield.offset = bitref->u.bitfield.offset;
8948 /* Now write the newly generated value */
8952 get_occurance(tuple->occurance);
8953 write = alloc_triple(state, OP_WRITE, piece->type, -1, -1,
8955 MISC(write, 0) = piece;
8956 RHS(write, 0) = pval;
8957 LHS(tuple, i) = write;
8959 return decompose_with_tuple(state, ins, tuple);
8962 struct decompose_load_info {
8963 struct occurance *occurance;
8964 struct triple *lval;
8965 struct triple *tuple;
8967 static void decompose_load_cb(struct compile_state *state,
8968 struct type *type, size_t reg_offset, size_t mem_offset, void *arg)
8970 struct decompose_load_info *info = arg;
8971 struct triple *load;
8973 if (reg_offset > info->tuple->lhs) {
8974 internal_error(state, info->tuple, "lhs to small?");
8976 get_occurance(info->occurance);
8977 load = alloc_triple(state, OP_LOAD, type, -1, -1, info->occurance);
8978 RHS(load, 0) = mk_addr_expr(state, info->lval, mem_offset);
8979 LHS(info->tuple, reg_offset/REG_SIZEOF_REG) = load;
8982 static struct triple *decompose_load(struct compile_state *state,
8985 struct triple *tuple;
8986 struct decompose_load_info info;
8988 if (!is_compound_type(ins->type)) {
8991 get_occurance(ins->occurance);
8992 tuple = alloc_triple(state, OP_TUPLE, ins->type, -1, -1,
8995 info.occurance = ins->occurance;
8996 info.lval = RHS(ins, 0);
8998 walk_type_fields(state, ins->type, 0, 0, decompose_load_cb, &info);
9000 return decompose_with_tuple(state, ins, tuple);
9004 struct decompose_store_info {
9005 struct occurance *occurance;
9006 struct triple *lval;
9008 struct triple *tuple;
9010 static void decompose_store_cb(struct compile_state *state,
9011 struct type *type, size_t reg_offset, size_t mem_offset, void *arg)
9013 struct decompose_store_info *info = arg;
9014 struct triple *store;
9016 if (reg_offset > info->tuple->lhs) {
9017 internal_error(state, info->tuple, "lhs to small?");
9019 get_occurance(info->occurance);
9020 store = alloc_triple(state, OP_STORE, type, -1, -1, info->occurance);
9021 RHS(store, 0) = mk_addr_expr(state, info->lval, mem_offset);
9022 RHS(store, 1) = LHS(info->val, reg_offset);
9023 LHS(info->tuple, reg_offset/REG_SIZEOF_REG) = store;
9026 static struct triple *decompose_store(struct compile_state *state,
9029 struct triple *tuple;
9030 struct decompose_store_info info;
9032 if (!is_compound_type(ins->type)) {
9035 get_occurance(ins->occurance);
9036 tuple = alloc_triple(state, OP_TUPLE, ins->type, -1, -1,
9039 info.occurance = ins->occurance;
9040 info.lval = RHS(ins, 0);
9041 info.val = RHS(ins, 1);
9043 walk_type_fields(state, ins->type, 0, 0, decompose_store_cb, &info);
9045 return decompose_with_tuple(state, ins, tuple);
9048 static struct triple *decompose_dot(struct compile_state *state,
9051 struct triple *tuple, *lval;
9056 lval = MISC(ins, 0);
9057 reg_offset = field_reg_offset(state, lval->type, ins->u.field);
9058 idx = reg_offset/REG_SIZEOF_REG;
9059 type = field_type(state, lval->type, ins->u.field);
9060 #if DEBUG_DECOMPOSE_HIRES
9062 FILE *fp = state->dbgout;
9063 fprintf(fp, "field type: ");
9069 get_occurance(ins->occurance);
9070 tuple = alloc_triple(state, OP_TUPLE, type, -1, -1,
9073 if (((ins->type->type & TYPE_MASK) == TYPE_BITFIELD) &&
9076 internal_error(state, ins, "multi register bitfield?");
9079 for(i = 0; i < tuple->lhs; i++, idx++) {
9080 struct triple *piece;
9081 if (!triple_is_def(state, lval)) {
9082 if (idx > lval->lhs) {
9083 internal_error(state, ins, "inconsistent lhs count");
9085 piece = LHS(lval, idx);
9088 internal_error(state, ins, "bad reg_offset into def");
9091 internal_error(state, ins, "bad reg count from def");
9096 /* Remember the offset of the bitfield */
9097 if ((type->type & TYPE_MASK) == TYPE_BITFIELD) {
9098 get_occurance(ins->occurance);
9099 piece = build_triple(state, OP_BITREF, type, piece, 0,
9101 piece->u.bitfield.size = size_of(state, type);
9102 piece->u.bitfield.offset = reg_offset % REG_SIZEOF_REG;
9104 else if ((reg_offset % REG_SIZEOF_REG) != 0) {
9105 internal_error(state, ins,
9106 "request for a nonbitfield sub register?");
9109 LHS(tuple, i) = piece;
9112 return decompose_with_tuple(state, ins, tuple);
9115 static struct triple *decompose_index(struct compile_state *state,
9118 struct triple *tuple, *lval;
9122 lval = MISC(ins, 0);
9123 idx = index_reg_offset(state, lval->type, ins->u.cval)/REG_SIZEOF_REG;
9124 type = index_type(state, lval->type, ins->u.cval);
9125 #if DEBUG_DECOMPOSE_HIRES
9127 FILE *fp = state->dbgout;
9128 fprintf(fp, "index type: ");
9134 get_occurance(ins->occurance);
9135 tuple = alloc_triple(state, OP_TUPLE, type, -1, -1,
9138 for(i = 0; i < tuple->lhs; i++, idx++) {
9139 struct triple *piece;
9140 if (!triple_is_def(state, lval)) {
9141 if (idx > lval->lhs) {
9142 internal_error(state, ins, "inconsistent lhs count");
9144 piece = LHS(lval, idx);
9147 internal_error(state, ins, "bad reg_offset into def");
9150 internal_error(state, ins, "bad reg count from def");
9154 LHS(tuple, i) = piece;
9157 return decompose_with_tuple(state, ins, tuple);
9160 static void decompose_compound_types(struct compile_state *state)
9162 struct triple *ins, *next, *first;
9163 first = state->first;
9166 /* Pass one expand compound values into pseudo registers.
9174 next = decompose_unknownval(state, ins);
9178 next = decompose_read(state, ins);
9182 next = decompose_write(state, ins);
9186 /* Be very careful with the load/store logic. These
9187 * operations must convert from the in register layout
9188 * to the in memory layout, which is nontrivial.
9191 next = decompose_load(state, ins);
9194 next = decompose_store(state, ins);
9198 next = decompose_dot(state, ins);
9201 next = decompose_index(state, ins);
9205 #if DEBUG_DECOMPOSE_HIRES
9206 fprintf(fp, "decompose next: %p \n", next);
9208 fprintf(fp, "next->op: %d %s\n",
9209 next->op, tops(next->op));
9210 /* High resolution debugging mode */
9211 print_triples(state);
9213 } while (next != first);
9215 /* Pass two remove the tuples.
9220 if (ins->op == OP_TUPLE) {
9222 internal_error(state, ins, "tuple used");
9225 release_triple(state, ins);
9229 } while(ins != first);
9233 if (ins->op == OP_BITREF) {
9235 internal_error(state, ins, "bitref used");
9238 release_triple(state, ins);
9242 } while(ins != first);
9244 /* Pass three verify the state and set ->id to 0.
9250 ins->id &= ~TRIPLE_FLAG_FLATTENED;
9251 if (triple_stores_block(state, ins)) {
9254 if (triple_is_def(state, ins)) {
9255 if (reg_size_of(state, ins->type) > REG_SIZEOF_REG) {
9256 internal_error(state, ins, "multi register value remains?");
9259 if (ins->op == OP_DOT) {
9260 internal_error(state, ins, "OP_DOT remains?");
9262 if (ins->op == OP_INDEX) {
9263 internal_error(state, ins, "OP_INDEX remains?");
9265 if (ins->op == OP_BITREF) {
9266 internal_error(state, ins, "OP_BITREF remains?");
9268 if (ins->op == OP_TUPLE) {
9269 internal_error(state, ins, "OP_TUPLE remains?");
9271 } while(next != first);
9274 /* For those operations that cannot be simplified */
9275 static void simplify_noop(struct compile_state *state, struct triple *ins)
9280 static void simplify_smul(struct compile_state *state, struct triple *ins)
9282 if (is_const(RHS(ins, 0)) && !is_const(RHS(ins, 1))) {
9285 RHS(ins, 0) = RHS(ins, 1);
9288 if (is_const(RHS(ins, 0)) && is_const(RHS(ins, 1))) {
9290 left = read_sconst(state, ins, RHS(ins, 0));
9291 right = read_sconst(state, ins, RHS(ins, 1));
9292 mkconst(state, ins, left * right);
9294 else if (is_zero(RHS(ins, 1))) {
9295 mkconst(state, ins, 0);
9297 else if (is_one(RHS(ins, 1))) {
9298 mkcopy(state, ins, RHS(ins, 0));
9300 else if (is_pow2(RHS(ins, 1))) {
9302 val = int_const(state, ins->type, tlog2(RHS(ins, 1)));
9304 insert_triple(state, state->global_pool, val);
9305 unuse_triple(RHS(ins, 1), ins);
9306 use_triple(val, ins);
9311 static void simplify_umul(struct compile_state *state, struct triple *ins)
9313 if (is_const(RHS(ins, 0)) && !is_const(RHS(ins, 1))) {
9316 RHS(ins, 0) = RHS(ins, 1);
9319 if (is_simple_const(RHS(ins, 0)) && is_simple_const(RHS(ins, 1))) {
9320 ulong_t left, right;
9321 left = read_const(state, ins, RHS(ins, 0));
9322 right = read_const(state, ins, RHS(ins, 1));
9323 mkconst(state, ins, left * right);
9325 else if (is_zero(RHS(ins, 1))) {
9326 mkconst(state, ins, 0);
9328 else if (is_one(RHS(ins, 1))) {
9329 mkcopy(state, ins, RHS(ins, 0));
9331 else if (is_pow2(RHS(ins, 1))) {
9333 val = int_const(state, ins->type, tlog2(RHS(ins, 1)));
9335 insert_triple(state, state->global_pool, val);
9336 unuse_triple(RHS(ins, 1), ins);
9337 use_triple(val, ins);
9342 static void simplify_sdiv(struct compile_state *state, struct triple *ins)
9344 if (is_const(RHS(ins, 0)) && is_const(RHS(ins, 1))) {
9346 left = read_sconst(state, ins, RHS(ins, 0));
9347 right = read_sconst(state, ins, RHS(ins, 1));
9348 mkconst(state, ins, left / right);
9350 else if (is_zero(RHS(ins, 0))) {
9351 mkconst(state, ins, 0);
9353 else if (is_zero(RHS(ins, 1))) {
9354 error(state, ins, "division by zero");
9356 else if (is_one(RHS(ins, 1))) {
9357 mkcopy(state, ins, RHS(ins, 0));
9359 else if (is_pow2(RHS(ins, 1))) {
9361 val = int_const(state, ins->type, tlog2(RHS(ins, 1)));
9363 insert_triple(state, state->global_pool, val);
9364 unuse_triple(RHS(ins, 1), ins);
9365 use_triple(val, ins);
9370 static void simplify_udiv(struct compile_state *state, struct triple *ins)
9372 if (is_simple_const(RHS(ins, 0)) && is_simple_const(RHS(ins, 1))) {
9373 ulong_t left, right;
9374 left = read_const(state, ins, RHS(ins, 0));
9375 right = read_const(state, ins, RHS(ins, 1));
9376 mkconst(state, ins, left / right);
9378 else if (is_zero(RHS(ins, 0))) {
9379 mkconst(state, ins, 0);
9381 else if (is_zero(RHS(ins, 1))) {
9382 error(state, ins, "division by zero");
9384 else if (is_one(RHS(ins, 1))) {
9385 mkcopy(state, ins, RHS(ins, 0));
9387 else if (is_pow2(RHS(ins, 1))) {
9389 val = int_const(state, ins->type, tlog2(RHS(ins, 1)));
9391 insert_triple(state, state->global_pool, val);
9392 unuse_triple(RHS(ins, 1), ins);
9393 use_triple(val, ins);
9398 static void simplify_smod(struct compile_state *state, struct triple *ins)
9400 if (is_simple_const(RHS(ins, 0)) && is_simple_const(RHS(ins, 1))) {
9402 left = read_const(state, ins, RHS(ins, 0));
9403 right = read_const(state, ins, RHS(ins, 1));
9404 mkconst(state, ins, left % right);
9406 else if (is_zero(RHS(ins, 0))) {
9407 mkconst(state, ins, 0);
9409 else if (is_zero(RHS(ins, 1))) {
9410 error(state, ins, "division by zero");
9412 else if (is_one(RHS(ins, 1))) {
9413 mkconst(state, ins, 0);
9415 else if (is_pow2(RHS(ins, 1))) {
9417 val = int_const(state, ins->type, RHS(ins, 1)->u.cval - 1);
9419 insert_triple(state, state->global_pool, val);
9420 unuse_triple(RHS(ins, 1), ins);
9421 use_triple(val, ins);
9426 static void simplify_umod(struct compile_state *state, struct triple *ins)
9428 if (is_simple_const(RHS(ins, 0)) && is_simple_const(RHS(ins, 1))) {
9429 ulong_t left, right;
9430 left = read_const(state, ins, RHS(ins, 0));
9431 right = read_const(state, ins, RHS(ins, 1));
9432 mkconst(state, ins, left % right);
9434 else if (is_zero(RHS(ins, 0))) {
9435 mkconst(state, ins, 0);
9437 else if (is_zero(RHS(ins, 1))) {
9438 error(state, ins, "division by zero");
9440 else if (is_one(RHS(ins, 1))) {
9441 mkconst(state, ins, 0);
9443 else if (is_pow2(RHS(ins, 1))) {
9445 val = int_const(state, ins->type, RHS(ins, 1)->u.cval - 1);
9447 insert_triple(state, state->global_pool, val);
9448 unuse_triple(RHS(ins, 1), ins);
9449 use_triple(val, ins);
9454 static void simplify_add(struct compile_state *state, struct triple *ins)
9456 /* start with the pointer on the left */
9457 if (is_pointer(RHS(ins, 1))) {
9460 RHS(ins, 0) = RHS(ins, 1);
9463 if (is_const(RHS(ins, 0)) && is_simple_const(RHS(ins, 1))) {
9464 if (RHS(ins, 0)->op == OP_INTCONST) {
9465 ulong_t left, right;
9466 left = read_const(state, ins, RHS(ins, 0));
9467 right = read_const(state, ins, RHS(ins, 1));
9468 mkconst(state, ins, left + right);
9470 else if (RHS(ins, 0)->op == OP_ADDRCONST) {
9471 struct triple *sdecl;
9472 ulong_t left, right;
9473 sdecl = MISC(RHS(ins, 0), 0);
9474 left = RHS(ins, 0)->u.cval;
9475 right = RHS(ins, 1)->u.cval;
9476 mkaddr_const(state, ins, sdecl, left + right);
9479 internal_warning(state, ins, "Optimize me!");
9482 else if (is_const(RHS(ins, 0)) && !is_const(RHS(ins, 1))) {
9485 RHS(ins, 1) = RHS(ins, 0);
9490 static void simplify_sub(struct compile_state *state, struct triple *ins)
9492 if (is_const(RHS(ins, 0)) && is_simple_const(RHS(ins, 1))) {
9493 if (RHS(ins, 0)->op == OP_INTCONST) {
9494 ulong_t left, right;
9495 left = read_const(state, ins, RHS(ins, 0));
9496 right = read_const(state, ins, RHS(ins, 1));
9497 mkconst(state, ins, left - right);
9499 else if (RHS(ins, 0)->op == OP_ADDRCONST) {
9500 struct triple *sdecl;
9501 ulong_t left, right;
9502 sdecl = MISC(RHS(ins, 0), 0);
9503 left = RHS(ins, 0)->u.cval;
9504 right = RHS(ins, 1)->u.cval;
9505 mkaddr_const(state, ins, sdecl, left - right);
9508 internal_warning(state, ins, "Optimize me!");
9513 static void simplify_sl(struct compile_state *state, struct triple *ins)
9515 if (is_simple_const(RHS(ins, 1))) {
9517 right = read_const(state, ins, RHS(ins, 1));
9518 if (right >= (size_of(state, ins->type))) {
9519 warning(state, ins, "left shift count >= width of type");
9522 if (is_simple_const(RHS(ins, 0)) && is_simple_const(RHS(ins, 1))) {
9523 ulong_t left, right;
9524 left = read_const(state, ins, RHS(ins, 0));
9525 right = read_const(state, ins, RHS(ins, 1));
9526 mkconst(state, ins, left << right);
9530 static void simplify_usr(struct compile_state *state, struct triple *ins)
9532 if (is_simple_const(RHS(ins, 1))) {
9534 right = read_const(state, ins, RHS(ins, 1));
9535 if (right >= (size_of(state, ins->type))) {
9536 warning(state, ins, "right shift count >= width of type");
9539 if (is_simple_const(RHS(ins, 0)) && is_simple_const(RHS(ins, 1))) {
9540 ulong_t left, right;
9541 left = read_const(state, ins, RHS(ins, 0));
9542 right = read_const(state, ins, RHS(ins, 1));
9543 mkconst(state, ins, left >> right);
9547 static void simplify_ssr(struct compile_state *state, struct triple *ins)
9549 if (is_simple_const(RHS(ins, 1))) {
9551 right = read_const(state, ins, RHS(ins, 1));
9552 if (right >= (size_of(state, ins->type))) {
9553 warning(state, ins, "right shift count >= width of type");
9556 if (is_simple_const(RHS(ins, 0)) && is_simple_const(RHS(ins, 1))) {
9558 left = read_sconst(state, ins, RHS(ins, 0));
9559 right = read_sconst(state, ins, RHS(ins, 1));
9560 mkconst(state, ins, left >> right);
9564 static void simplify_and(struct compile_state *state, struct triple *ins)
9566 struct triple *left, *right;
9568 right = RHS(ins, 1);
9570 if (is_simple_const(left) && is_simple_const(right)) {
9572 lval = read_const(state, ins, left);
9573 rval = read_const(state, ins, right);
9574 mkconst(state, ins, lval & rval);
9576 else if (is_zero(right) || is_zero(left)) {
9577 mkconst(state, ins, 0);
9581 static void simplify_or(struct compile_state *state, struct triple *ins)
9583 struct triple *left, *right;
9585 right = RHS(ins, 1);
9587 if (is_simple_const(left) && is_simple_const(right)) {
9589 lval = read_const(state, ins, left);
9590 rval = read_const(state, ins, right);
9591 mkconst(state, ins, lval | rval);
9593 #if 0 /* I need to handle type mismatches here... */
9594 else if (is_zero(right)) {
9595 mkcopy(state, ins, left);
9597 else if (is_zero(left)) {
9598 mkcopy(state, ins, right);
9603 static void simplify_xor(struct compile_state *state, struct triple *ins)
9605 if (is_simple_const(RHS(ins, 0)) && is_simple_const(RHS(ins, 1))) {
9606 ulong_t left, right;
9607 left = read_const(state, ins, RHS(ins, 0));
9608 right = read_const(state, ins, RHS(ins, 1));
9609 mkconst(state, ins, left ^ right);
9613 static void simplify_pos(struct compile_state *state, struct triple *ins)
9615 if (is_const(RHS(ins, 0))) {
9616 mkconst(state, ins, RHS(ins, 0)->u.cval);
9619 mkcopy(state, ins, RHS(ins, 0));
9623 static void simplify_neg(struct compile_state *state, struct triple *ins)
9625 if (is_simple_const(RHS(ins, 0))) {
9627 left = read_const(state, ins, RHS(ins, 0));
9628 mkconst(state, ins, -left);
9630 else if (RHS(ins, 0)->op == OP_NEG) {
9631 mkcopy(state, ins, RHS(RHS(ins, 0), 0));
9635 static void simplify_invert(struct compile_state *state, struct triple *ins)
9637 if (is_simple_const(RHS(ins, 0))) {
9639 left = read_const(state, ins, RHS(ins, 0));
9640 mkconst(state, ins, ~left);
9644 static void simplify_eq(struct compile_state *state, struct triple *ins)
9646 struct triple *left, *right;
9648 right = RHS(ins, 1);
9650 if (is_const(left) && is_const(right)) {
9652 val = const_eq(state, ins, left, right);
9654 mkconst(state, ins, val == 1);
9657 else if (left == right) {
9658 mkconst(state, ins, 1);
9662 static void simplify_noteq(struct compile_state *state, struct triple *ins)
9664 struct triple *left, *right;
9666 right = RHS(ins, 1);
9668 if (is_const(left) && is_const(right)) {
9670 val = const_eq(state, ins, left, right);
9672 mkconst(state, ins, val != 1);
9675 if (left == right) {
9676 mkconst(state, ins, 0);
9680 static void simplify_sless(struct compile_state *state, struct triple *ins)
9682 struct triple *left, *right;
9684 right = RHS(ins, 1);
9686 if (is_const(left) && is_const(right)) {
9688 val = const_scmp(state, ins, left, right);
9689 if ((val >= -1) && (val <= 1)) {
9690 mkconst(state, ins, val < 0);
9693 else if (left == right) {
9694 mkconst(state, ins, 0);
9698 static void simplify_uless(struct compile_state *state, struct triple *ins)
9700 struct triple *left, *right;
9702 right = RHS(ins, 1);
9704 if (is_const(left) && is_const(right)) {
9706 val = const_ucmp(state, ins, left, right);
9707 if ((val >= -1) && (val <= 1)) {
9708 mkconst(state, ins, val < 0);
9711 else if (is_zero(right)) {
9712 mkconst(state, ins, 0);
9714 else if (left == right) {
9715 mkconst(state, ins, 0);
9719 static void simplify_smore(struct compile_state *state, struct triple *ins)
9721 struct triple *left, *right;
9723 right = RHS(ins, 1);
9725 if (is_const(left) && is_const(right)) {
9727 val = const_scmp(state, ins, left, right);
9728 if ((val >= -1) && (val <= 1)) {
9729 mkconst(state, ins, val > 0);
9732 else if (left == right) {
9733 mkconst(state, ins, 0);
9737 static void simplify_umore(struct compile_state *state, struct triple *ins)
9739 struct triple *left, *right;
9741 right = RHS(ins, 1);
9743 if (is_const(left) && is_const(right)) {
9745 val = const_ucmp(state, ins, left, right);
9746 if ((val >= -1) && (val <= 1)) {
9747 mkconst(state, ins, val > 0);
9750 else if (is_zero(left)) {
9751 mkconst(state, ins, 0);
9753 else if (left == right) {
9754 mkconst(state, ins, 0);
9759 static void simplify_slesseq(struct compile_state *state, struct triple *ins)
9761 struct triple *left, *right;
9763 right = RHS(ins, 1);
9765 if (is_const(left) && is_const(right)) {
9767 val = const_scmp(state, ins, left, right);
9768 if ((val >= -1) && (val <= 1)) {
9769 mkconst(state, ins, val <= 0);
9772 else if (left == right) {
9773 mkconst(state, ins, 1);
9777 static void simplify_ulesseq(struct compile_state *state, struct triple *ins)
9779 struct triple *left, *right;
9781 right = RHS(ins, 1);
9783 if (is_const(left) && is_const(right)) {
9785 val = const_ucmp(state, ins, left, right);
9786 if ((val >= -1) && (val <= 1)) {
9787 mkconst(state, ins, val <= 0);
9790 else if (is_zero(left)) {
9791 mkconst(state, ins, 1);
9793 else if (left == right) {
9794 mkconst(state, ins, 1);
9798 static void simplify_smoreeq(struct compile_state *state, struct triple *ins)
9800 struct triple *left, *right;
9802 right = RHS(ins, 1);
9804 if (is_const(left) && is_const(right)) {
9806 val = const_scmp(state, ins, left, right);
9807 if ((val >= -1) && (val <= 1)) {
9808 mkconst(state, ins, val >= 0);
9811 else if (left == right) {
9812 mkconst(state, ins, 1);
9816 static void simplify_umoreeq(struct compile_state *state, struct triple *ins)
9818 struct triple *left, *right;
9820 right = RHS(ins, 1);
9822 if (is_const(left) && is_const(right)) {
9824 val = const_ucmp(state, ins, left, right);
9825 if ((val >= -1) && (val <= 1)) {
9826 mkconst(state, ins, val >= 0);
9829 else if (is_zero(right)) {
9830 mkconst(state, ins, 1);
9832 else if (left == right) {
9833 mkconst(state, ins, 1);
9837 static void simplify_lfalse(struct compile_state *state, struct triple *ins)
9842 if (is_const(rhs)) {
9843 mkconst(state, ins, !const_ltrue(state, ins, rhs));
9845 /* Otherwise if I am the only user... */
9846 else if ((rhs->use) &&
9847 (rhs->use->member == ins) && (rhs->use->next == 0)) {
9849 /* Invert a boolean operation */
9851 case OP_LTRUE: rhs->op = OP_LFALSE; break;
9852 case OP_LFALSE: rhs->op = OP_LTRUE; break;
9853 case OP_EQ: rhs->op = OP_NOTEQ; break;
9854 case OP_NOTEQ: rhs->op = OP_EQ; break;
9855 case OP_SLESS: rhs->op = OP_SMOREEQ; break;
9856 case OP_ULESS: rhs->op = OP_UMOREEQ; break;
9857 case OP_SMORE: rhs->op = OP_SLESSEQ; break;
9858 case OP_UMORE: rhs->op = OP_ULESSEQ; break;
9859 case OP_SLESSEQ: rhs->op = OP_SMORE; break;
9860 case OP_ULESSEQ: rhs->op = OP_UMORE; break;
9861 case OP_SMOREEQ: rhs->op = OP_SLESS; break;
9862 case OP_UMOREEQ: rhs->op = OP_ULESS; break;
9868 mkcopy(state, ins, rhs);
9873 static void simplify_ltrue (struct compile_state *state, struct triple *ins)
9878 if (is_const(rhs)) {
9879 mkconst(state, ins, const_ltrue(state, ins, rhs));
9881 else switch(rhs->op) {
9882 case OP_LTRUE: case OP_LFALSE: case OP_EQ: case OP_NOTEQ:
9883 case OP_SLESS: case OP_ULESS: case OP_SMORE: case OP_UMORE:
9884 case OP_SLESSEQ: case OP_ULESSEQ: case OP_SMOREEQ: case OP_UMOREEQ:
9885 mkcopy(state, ins, rhs);
9890 static void simplify_load(struct compile_state *state, struct triple *ins)
9892 struct triple *addr, *sdecl, *blob;
9894 /* If I am doing a load with a constant pointer from a constant
9895 * table get the value.
9898 if ((addr->op == OP_ADDRCONST) && (sdecl = MISC(addr, 0)) &&
9899 (sdecl->op == OP_SDECL) && (blob = MISC(sdecl, 0)) &&
9900 (blob->op == OP_BLOBCONST)) {
9901 unsigned char buffer[SIZEOF_WORD];
9902 size_t reg_size, mem_size;
9903 const char *src, *end;
9905 reg_size = reg_size_of(state, ins->type);
9906 if (reg_size > REG_SIZEOF_REG) {
9907 internal_error(state, ins, "load size greater than register");
9909 mem_size = size_of(state, ins->type);
9911 end += bits_to_bytes(size_of(state, sdecl->type));
9913 src += addr->u.cval;
9916 error(state, ins, "Load address out of bounds");
9919 memset(buffer, 0, sizeof(buffer));
9920 memcpy(buffer, src, bits_to_bytes(mem_size));
9923 case SIZEOF_I8: val = *((uint8_t *) buffer); break;
9924 case SIZEOF_I16: val = *((uint16_t *)buffer); break;
9925 case SIZEOF_I32: val = *((uint32_t *)buffer); break;
9926 case SIZEOF_I64: val = *((uint64_t *)buffer); break;
9928 internal_error(state, ins, "mem_size: %d not handled",
9933 mkconst(state, ins, val);
9937 static void simplify_uextract(struct compile_state *state, struct triple *ins)
9939 if (is_simple_const(RHS(ins, 0))) {
9942 val = read_const(state, ins, RHS(ins, 0));
9944 mask <<= ins->u.bitfield.size;
9946 val >>= ins->u.bitfield.offset;
9948 mkconst(state, ins, val);
9952 static void simplify_sextract(struct compile_state *state, struct triple *ins)
9954 if (is_simple_const(RHS(ins, 0))) {
9958 val = read_const(state, ins, RHS(ins, 0));
9960 mask <<= ins->u.bitfield.size;
9962 val >>= ins->u.bitfield.offset;
9964 val <<= (SIZEOF_LONG - ins->u.bitfield.size);
9966 sval >>= (SIZEOF_LONG - ins->u.bitfield.size);
9967 mkconst(state, ins, sval);
9971 static void simplify_deposit(struct compile_state *state, struct triple *ins)
9973 if (is_simple_const(RHS(ins, 0)) && is_simple_const(RHS(ins, 1))) {
9976 targ = read_const(state, ins, RHS(ins, 0));
9977 val = read_const(state, ins, RHS(ins, 1));
9979 mask <<= ins->u.bitfield.size;
9981 mask <<= ins->u.bitfield.offset;
9983 val <<= ins->u.bitfield.offset;
9986 mkconst(state, ins, targ);
9990 static void simplify_copy(struct compile_state *state, struct triple *ins)
9992 struct triple *right;
9993 right = RHS(ins, 0);
9994 if (is_subset_type(ins->type, right->type)) {
9995 ins->type = right->type;
9997 if (equiv_types(ins->type, right->type)) {
9998 ins->op = OP_COPY;/* I don't need to convert if the types match */
10000 if (ins->op == OP_COPY) {
10001 internal_error(state, ins, "type mismatch on copy");
10004 if (is_const(right) && (right->op == OP_ADDRCONST) && is_pointer(ins)) {
10005 struct triple *sdecl;
10007 sdecl = MISC(right, 0);
10008 offset = right->u.cval;
10009 mkaddr_const(state, ins, sdecl, offset);
10011 else if (is_const(right) && is_write_compatible(state, ins->type, right->type)) {
10012 switch(right->op) {
10016 left = read_const(state, ins, right);
10017 /* Ensure I have not overflowed the destination. */
10018 if (size_of(state, right->type) > size_of(state, ins->type)) {
10021 mask <<= size_of(state, ins->type);
10025 /* Ensure I am properly sign extended */
10026 if (size_of(state, right->type) < size_of(state, ins->type) &&
10027 is_signed(right->type)) {
10030 shift = SIZEOF_LONG - size_of(state, right->type);
10036 mkconst(state, ins, left);
10040 internal_error(state, ins, "uknown constant");
10046 static int phi_present(struct block *block)
10048 struct triple *ptr;
10052 ptr = block->first;
10054 if (ptr->op == OP_PHI) {
10058 } while(ptr != block->last);
10062 static int phi_dependency(struct block *block)
10064 /* A block has a phi dependency if a phi function
10065 * depends on that block to exist, and makes a block
10066 * that is otherwise useless unsafe to remove.
10069 struct block_set *edge;
10070 for(edge = block->edges; edge; edge = edge->next) {
10071 if (phi_present(edge->member)) {
10079 static struct triple *branch_target(struct compile_state *state, struct triple *ins)
10081 struct triple *targ;
10082 targ = TARG(ins, 0);
10083 /* During scc_transform temporary triples are allocated that
10084 * loop back onto themselves. If I see one don't advance the
10087 while(triple_is_structural(state, targ) &&
10088 (targ->next != targ) && (targ->next != state->first)) {
10095 static void simplify_branch(struct compile_state *state, struct triple *ins)
10097 int simplified, loops;
10098 if ((ins->op != OP_BRANCH) && (ins->op != OP_CBRANCH)) {
10099 internal_error(state, ins, "not branch");
10101 if (ins->use != 0) {
10102 internal_error(state, ins, "branch use");
10104 /* The challenge here with simplify branch is that I need to
10105 * make modifications to the control flow graph as well
10106 * as to the branch instruction itself. That is handled
10107 * by rebuilding the basic blocks after simplify all is called.
10110 /* If we have a branch to an unconditional branch update
10111 * our target. But watch out for dependencies from phi
10113 * Also only do this a limited number of times so
10114 * we don't get into an infinite loop.
10118 struct triple *targ;
10120 targ = branch_target(state, ins);
10121 if ((targ != ins) && (targ->op == OP_BRANCH) &&
10122 !phi_dependency(targ->u.block))
10124 unuse_triple(TARG(ins, 0), ins);
10125 TARG(ins, 0) = TARG(targ, 0);
10126 use_triple(TARG(ins, 0), ins);
10129 } while(simplified && (++loops < 20));
10131 /* If we have a conditional branch with a constant condition
10132 * make it an unconditional branch.
10134 if ((ins->op == OP_CBRANCH) && is_simple_const(RHS(ins, 0))) {
10135 struct triple *targ;
10137 value = read_const(state, ins, RHS(ins, 0));
10138 unuse_triple(RHS(ins, 0), ins);
10139 targ = TARG(ins, 0);
10142 ins->op = OP_BRANCH;
10144 unuse_triple(ins->next, ins);
10145 TARG(ins, 0) = targ;
10148 unuse_triple(targ, ins);
10149 TARG(ins, 0) = ins->next;
10153 /* If we have a branch to the next instruction,
10156 if (TARG(ins, 0) == ins->next) {
10157 unuse_triple(TARG(ins, 0), ins);
10158 if (ins->op == OP_CBRANCH) {
10159 unuse_triple(RHS(ins, 0), ins);
10160 unuse_triple(ins->next, ins);
10168 internal_error(state, ins, "noop use != 0");
10173 static void simplify_label(struct compile_state *state, struct triple *ins)
10175 /* Ignore volatile labels */
10176 if (!triple_is_pure(state, ins, ins->id)) {
10179 if (ins->use == 0) {
10182 else if (ins->prev->op == OP_LABEL) {
10183 /* In general it is not safe to merge one label that
10184 * imediately follows another. The problem is that the empty
10185 * looking block may have phi functions that depend on it.
10187 if (!phi_dependency(ins->prev->u.block)) {
10188 struct triple_set *user, *next;
10190 for(user = ins->use; user; user = next) {
10191 struct triple *use, **expr;
10193 use = user->member;
10194 expr = triple_targ(state, use, 0);
10195 for(;expr; expr = triple_targ(state, use, expr)) {
10196 if (*expr == ins) {
10198 unuse_triple(ins, use);
10199 use_triple(ins->prev, use);
10205 internal_error(state, ins, "noop use != 0");
10211 static void simplify_phi(struct compile_state *state, struct triple *ins)
10213 struct triple **slot;
10214 struct triple *value;
10217 slot = &RHS(ins, 0);
10222 /* See if all of the rhs members of a phi have the same value */
10223 if (slot[0] && is_simple_const(slot[0])) {
10224 cvalue = read_const(state, ins, slot[0]);
10225 for(i = 1; i < zrhs; i++) {
10227 !is_simple_const(slot[i]) ||
10228 !equiv_types(slot[0]->type, slot[i]->type) ||
10229 (cvalue != read_const(state, ins, slot[i]))) {
10234 mkconst(state, ins, cvalue);
10239 /* See if all of rhs members of a phi are the same */
10241 for(i = 1; i < zrhs; i++) {
10242 if (slot[i] != value) {
10247 /* If the phi has a single value just copy it */
10248 if (!is_subset_type(ins->type, value->type)) {
10249 internal_error(state, ins, "bad input type to phi");
10251 /* Make the types match */
10252 if (!equiv_types(ins->type, value->type)) {
10253 ins->type = value->type;
10255 /* Now make the actual copy */
10256 mkcopy(state, ins, value);
10262 static void simplify_bsf(struct compile_state *state, struct triple *ins)
10264 if (is_simple_const(RHS(ins, 0))) {
10266 left = read_const(state, ins, RHS(ins, 0));
10267 mkconst(state, ins, bsf(left));
10271 static void simplify_bsr(struct compile_state *state, struct triple *ins)
10273 if (is_simple_const(RHS(ins, 0))) {
10275 left = read_const(state, ins, RHS(ins, 0));
10276 mkconst(state, ins, bsr(left));
10281 typedef void (*simplify_t)(struct compile_state *state, struct triple *ins);
10282 static const struct simplify_table {
10284 unsigned long flag;
10285 } table_simplify[] = {
10286 #define simplify_sdivt simplify_noop
10287 #define simplify_udivt simplify_noop
10288 #define simplify_piece simplify_noop
10290 [OP_SDIVT ] = { simplify_sdivt, COMPILER_SIMPLIFY_ARITH },
10291 [OP_UDIVT ] = { simplify_udivt, COMPILER_SIMPLIFY_ARITH },
10292 [OP_SMUL ] = { simplify_smul, COMPILER_SIMPLIFY_ARITH },
10293 [OP_UMUL ] = { simplify_umul, COMPILER_SIMPLIFY_ARITH },
10294 [OP_SDIV ] = { simplify_sdiv, COMPILER_SIMPLIFY_ARITH },
10295 [OP_UDIV ] = { simplify_udiv, COMPILER_SIMPLIFY_ARITH },
10296 [OP_SMOD ] = { simplify_smod, COMPILER_SIMPLIFY_ARITH },
10297 [OP_UMOD ] = { simplify_umod, COMPILER_SIMPLIFY_ARITH },
10298 [OP_ADD ] = { simplify_add, COMPILER_SIMPLIFY_ARITH },
10299 [OP_SUB ] = { simplify_sub, COMPILER_SIMPLIFY_ARITH },
10300 [OP_SL ] = { simplify_sl, COMPILER_SIMPLIFY_SHIFT },
10301 [OP_USR ] = { simplify_usr, COMPILER_SIMPLIFY_SHIFT },
10302 [OP_SSR ] = { simplify_ssr, COMPILER_SIMPLIFY_SHIFT },
10303 [OP_AND ] = { simplify_and, COMPILER_SIMPLIFY_BITWISE },
10304 [OP_XOR ] = { simplify_xor, COMPILER_SIMPLIFY_BITWISE },
10305 [OP_OR ] = { simplify_or, COMPILER_SIMPLIFY_BITWISE },
10306 [OP_POS ] = { simplify_pos, COMPILER_SIMPLIFY_ARITH },
10307 [OP_NEG ] = { simplify_neg, COMPILER_SIMPLIFY_ARITH },
10308 [OP_INVERT ] = { simplify_invert, COMPILER_SIMPLIFY_BITWISE },
10310 [OP_EQ ] = { simplify_eq, COMPILER_SIMPLIFY_LOGICAL },
10311 [OP_NOTEQ ] = { simplify_noteq, COMPILER_SIMPLIFY_LOGICAL },
10312 [OP_SLESS ] = { simplify_sless, COMPILER_SIMPLIFY_LOGICAL },
10313 [OP_ULESS ] = { simplify_uless, COMPILER_SIMPLIFY_LOGICAL },
10314 [OP_SMORE ] = { simplify_smore, COMPILER_SIMPLIFY_LOGICAL },
10315 [OP_UMORE ] = { simplify_umore, COMPILER_SIMPLIFY_LOGICAL },
10316 [OP_SLESSEQ ] = { simplify_slesseq, COMPILER_SIMPLIFY_LOGICAL },
10317 [OP_ULESSEQ ] = { simplify_ulesseq, COMPILER_SIMPLIFY_LOGICAL },
10318 [OP_SMOREEQ ] = { simplify_smoreeq, COMPILER_SIMPLIFY_LOGICAL },
10319 [OP_UMOREEQ ] = { simplify_umoreeq, COMPILER_SIMPLIFY_LOGICAL },
10320 [OP_LFALSE ] = { simplify_lfalse, COMPILER_SIMPLIFY_LOGICAL },
10321 [OP_LTRUE ] = { simplify_ltrue, COMPILER_SIMPLIFY_LOGICAL },
10323 [OP_LOAD ] = { simplify_load, COMPILER_SIMPLIFY_OP },
10324 [OP_STORE ] = { simplify_noop, COMPILER_SIMPLIFY_OP },
10326 [OP_UEXTRACT ] = { simplify_uextract, COMPILER_SIMPLIFY_BITFIELD },
10327 [OP_SEXTRACT ] = { simplify_sextract, COMPILER_SIMPLIFY_BITFIELD },
10328 [OP_DEPOSIT ] = { simplify_deposit, COMPILER_SIMPLIFY_BITFIELD },
10330 [OP_NOOP ] = { simplify_noop, COMPILER_SIMPLIFY_OP },
10332 [OP_INTCONST ] = { simplify_noop, COMPILER_SIMPLIFY_OP },
10333 [OP_BLOBCONST ] = { simplify_noop, COMPILER_SIMPLIFY_OP },
10334 [OP_ADDRCONST ] = { simplify_noop, COMPILER_SIMPLIFY_OP },
10335 [OP_UNKNOWNVAL ] = { simplify_noop, COMPILER_SIMPLIFY_OP },
10337 [OP_WRITE ] = { simplify_noop, COMPILER_SIMPLIFY_OP },
10338 [OP_READ ] = { simplify_noop, COMPILER_SIMPLIFY_OP },
10339 [OP_COPY ] = { simplify_copy, COMPILER_SIMPLIFY_COPY },
10340 [OP_CONVERT ] = { simplify_copy, COMPILER_SIMPLIFY_COPY },
10341 [OP_PIECE ] = { simplify_piece, COMPILER_SIMPLIFY_OP },
10342 [OP_ASM ] = { simplify_noop, COMPILER_SIMPLIFY_OP },
10344 [OP_DOT ] = { simplify_noop, COMPILER_SIMPLIFY_OP },
10345 [OP_INDEX ] = { simplify_noop, COMPILER_SIMPLIFY_OP },
10347 [OP_LIST ] = { simplify_noop, COMPILER_SIMPLIFY_OP },
10348 [OP_BRANCH ] = { simplify_branch, COMPILER_SIMPLIFY_BRANCH },
10349 [OP_CBRANCH ] = { simplify_branch, COMPILER_SIMPLIFY_BRANCH },
10350 [OP_CALL ] = { simplify_noop, COMPILER_SIMPLIFY_BRANCH },
10351 [OP_RET ] = { simplify_noop, COMPILER_SIMPLIFY_BRANCH },
10352 [OP_LABEL ] = { simplify_label, COMPILER_SIMPLIFY_LABEL },
10353 [OP_ADECL ] = { simplify_noop, COMPILER_SIMPLIFY_OP },
10354 [OP_SDECL ] = { simplify_noop, COMPILER_SIMPLIFY_OP },
10355 [OP_PHI ] = { simplify_phi, COMPILER_SIMPLIFY_PHI },
10357 [OP_INB ] = { simplify_noop, COMPILER_SIMPLIFY_OP },
10358 [OP_INW ] = { simplify_noop, COMPILER_SIMPLIFY_OP },
10359 [OP_INL ] = { simplify_noop, COMPILER_SIMPLIFY_OP },
10360 [OP_OUTB ] = { simplify_noop, COMPILER_SIMPLIFY_OP },
10361 [OP_OUTW ] = { simplify_noop, COMPILER_SIMPLIFY_OP },
10362 [OP_OUTL ] = { simplify_noop, COMPILER_SIMPLIFY_OP },
10363 [OP_BSF ] = { simplify_bsf, COMPILER_SIMPLIFY_OP },
10364 [OP_BSR ] = { simplify_bsr, COMPILER_SIMPLIFY_OP },
10365 [OP_RDMSR ] = { simplify_noop, COMPILER_SIMPLIFY_OP },
10366 [OP_WRMSR ] = { simplify_noop, COMPILER_SIMPLIFY_OP },
10367 [OP_HLT ] = { simplify_noop, COMPILER_SIMPLIFY_OP },
10370 static inline void debug_simplify(struct compile_state *state,
10371 simplify_t do_simplify, struct triple *ins)
10373 #if DEBUG_SIMPLIFY_HIRES
10374 if (state->functions_joined && (do_simplify != simplify_noop)) {
10375 /* High resolution debugging mode */
10376 fprintf(state->dbgout, "simplifing: ");
10377 display_triple(state->dbgout, ins);
10380 do_simplify(state, ins);
10381 #if DEBUG_SIMPLIFY_HIRES
10382 if (state->functions_joined && (do_simplify != simplify_noop)) {
10383 /* High resolution debugging mode */
10384 fprintf(state->dbgout, "simplified: ");
10385 display_triple(state->dbgout, ins);
10389 static void simplify(struct compile_state *state, struct triple *ins)
10392 simplify_t do_simplify;
10393 if (ins == &unknown_triple) {
10394 internal_error(state, ins, "simplifying the unknown triple?");
10399 if ((op < 0) || (op > sizeof(table_simplify)/sizeof(table_simplify[0]))) {
10403 do_simplify = table_simplify[op].func;
10406 !(state->compiler->flags & table_simplify[op].flag)) {
10407 do_simplify = simplify_noop;
10409 if (do_simplify && (ins->id & TRIPLE_FLAG_VOLATILE)) {
10410 do_simplify = simplify_noop;
10413 if (!do_simplify) {
10414 internal_error(state, ins, "cannot simplify op: %d %s",
10418 debug_simplify(state, do_simplify, ins);
10419 } while(ins->op != op);
10422 static void rebuild_ssa_form(struct compile_state *state);
10424 static void simplify_all(struct compile_state *state)
10426 struct triple *ins, *first;
10427 if (!(state->compiler->flags & COMPILER_SIMPLIFY)) {
10430 first = state->first;
10433 simplify(state, ins);
10435 } while(ins != first->prev);
10438 simplify(state, ins);
10440 }while(ins != first);
10441 rebuild_ssa_form(state);
10443 print_blocks(state, __func__, state->dbgout);
10448 * ============================
10451 static void register_builtin_function(struct compile_state *state,
10452 const char *name, int op, struct type *rtype, ...)
10454 struct type *ftype, *atype, *ctype, *crtype, *param, **next;
10455 struct triple *def, *result, *work, *first, *retvar, *ret;
10456 struct hash_entry *ident;
10457 struct file_state file;
10463 /* Dummy file state to get debug handling right */
10464 memset(&file, 0, sizeof(file));
10465 file.basename = "<built-in>";
10467 file.report_line = 1;
10468 file.report_name = file.basename;
10469 file.prev = state->file;
10470 state->file = &file;
10471 state->function = name;
10473 /* Find the Parameter count */
10474 valid_op(state, op);
10475 parameters = table_ops[op].rhs;
10476 if (parameters < 0 ) {
10477 internal_error(state, 0, "Invalid builtin parameter count");
10480 /* Find the function type */
10481 ftype = new_type(TYPE_FUNCTION | STOR_INLINE | STOR_STATIC, rtype, 0);
10482 ftype->elements = parameters;
10483 next = &ftype->right;
10484 va_start(args, rtype);
10485 for(i = 0; i < parameters; i++) {
10486 atype = va_arg(args, struct type *);
10490 *next = new_type(TYPE_PRODUCT, *next, atype);
10491 next = &((*next)->right);
10495 *next = &void_type;
10499 /* Get the initial closure type */
10500 ctype = new_type(TYPE_JOIN, &void_type, 0);
10501 ctype->elements = 1;
10503 /* Get the return type */
10504 crtype = new_type(TYPE_TUPLE, new_type(TYPE_PRODUCT, ctype, rtype), 0);
10505 crtype->elements = 2;
10507 /* Generate the needed triples */
10508 def = triple(state, OP_LIST, ftype, 0, 0);
10509 first = label(state);
10510 RHS(def, 0) = first;
10511 result = flatten(state, first, variable(state, crtype));
10512 retvar = flatten(state, first, variable(state, &void_ptr_type));
10513 ret = triple(state, OP_RET, &void_type, read_expr(state, retvar), 0);
10515 /* Now string them together */
10516 param = ftype->right;
10517 for(i = 0; i < parameters; i++) {
10518 if ((param->type & TYPE_MASK) == TYPE_PRODUCT) {
10519 atype = param->left;
10523 flatten(state, first, variable(state, atype));
10524 param = param->right;
10526 work = new_triple(state, op, rtype, -1, parameters);
10527 generate_lhs_pieces(state, work);
10528 for(i = 0; i < parameters; i++) {
10529 RHS(work, i) = read_expr(state, farg(state, def, i));
10531 if ((rtype->type & TYPE_MASK) != TYPE_VOID) {
10532 work = write_expr(state, deref_index(state, result, 1), work);
10534 work = flatten(state, first, work);
10535 flatten(state, first, label(state));
10536 ret = flatten(state, first, ret);
10537 name_len = strlen(name);
10538 ident = lookup(state, name, name_len);
10539 ftype->type_ident = ident;
10540 symbol(state, ident, &ident->sym_ident, def, ftype);
10542 state->file = file.prev;
10543 state->function = 0;
10544 state->main_function = 0;
10546 if (!state->functions) {
10547 state->functions = def;
10549 insert_triple(state, state->functions, def);
10551 if (state->compiler->debug & DEBUG_INLINE) {
10552 FILE *fp = state->dbgout;
10555 fprintf(fp, "\n__________ %s _________\n", __FUNCTION__);
10556 display_func(state, fp, def);
10557 fprintf(fp, "__________ %s _________ done\n\n", __FUNCTION__);
10561 static struct type *partial_struct(struct compile_state *state,
10562 const char *field_name, struct type *type, struct type *rest)
10564 struct hash_entry *field_ident;
10565 struct type *result;
10566 int field_name_len;
10568 field_name_len = strlen(field_name);
10569 field_ident = lookup(state, field_name, field_name_len);
10571 result = clone_type(0, type);
10572 result->field_ident = field_ident;
10575 result = new_type(TYPE_PRODUCT, result, rest);
10580 static struct type *register_builtin_type(struct compile_state *state,
10581 const char *name, struct type *type)
10583 struct hash_entry *ident;
10586 name_len = strlen(name);
10587 ident = lookup(state, name, name_len);
10589 if ((type->type & TYPE_MASK) == TYPE_PRODUCT) {
10590 ulong_t elements = 0;
10591 struct type *field;
10592 type = new_type(TYPE_STRUCT, type, 0);
10593 field = type->left;
10594 while((field->type & TYPE_MASK) == TYPE_PRODUCT) {
10596 field = field->right;
10599 symbol(state, ident, &ident->sym_tag, 0, type);
10600 type->type_ident = ident;
10601 type->elements = elements;
10603 symbol(state, ident, &ident->sym_ident, 0, type);
10604 ident->tok = TOK_TYPE_NAME;
10609 static void register_builtins(struct compile_state *state)
10611 struct type *div_type, *ldiv_type;
10612 struct type *udiv_type, *uldiv_type;
10613 struct type *msr_type;
10615 div_type = register_builtin_type(state, "__builtin_div_t",
10616 partial_struct(state, "quot", &int_type,
10617 partial_struct(state, "rem", &int_type, 0)));
10618 ldiv_type = register_builtin_type(state, "__builtin_ldiv_t",
10619 partial_struct(state, "quot", &long_type,
10620 partial_struct(state, "rem", &long_type, 0)));
10621 udiv_type = register_builtin_type(state, "__builtin_udiv_t",
10622 partial_struct(state, "quot", &uint_type,
10623 partial_struct(state, "rem", &uint_type, 0)));
10624 uldiv_type = register_builtin_type(state, "__builtin_uldiv_t",
10625 partial_struct(state, "quot", &ulong_type,
10626 partial_struct(state, "rem", &ulong_type, 0)));
10628 register_builtin_function(state, "__builtin_div", OP_SDIVT, div_type,
10629 &int_type, &int_type);
10630 register_builtin_function(state, "__builtin_ldiv", OP_SDIVT, ldiv_type,
10631 &long_type, &long_type);
10632 register_builtin_function(state, "__builtin_udiv", OP_UDIVT, udiv_type,
10633 &uint_type, &uint_type);
10634 register_builtin_function(state, "__builtin_uldiv", OP_UDIVT, uldiv_type,
10635 &ulong_type, &ulong_type);
10637 register_builtin_function(state, "__builtin_inb", OP_INB, &uchar_type,
10639 register_builtin_function(state, "__builtin_inw", OP_INW, &ushort_type,
10641 register_builtin_function(state, "__builtin_inl", OP_INL, &uint_type,
10644 register_builtin_function(state, "__builtin_outb", OP_OUTB, &void_type,
10645 &uchar_type, &ushort_type);
10646 register_builtin_function(state, "__builtin_outw", OP_OUTW, &void_type,
10647 &ushort_type, &ushort_type);
10648 register_builtin_function(state, "__builtin_outl", OP_OUTL, &void_type,
10649 &uint_type, &ushort_type);
10651 register_builtin_function(state, "__builtin_bsf", OP_BSF, &int_type,
10653 register_builtin_function(state, "__builtin_bsr", OP_BSR, &int_type,
10656 msr_type = register_builtin_type(state, "__builtin_msr_t",
10657 partial_struct(state, "lo", &ulong_type,
10658 partial_struct(state, "hi", &ulong_type, 0)));
10660 register_builtin_function(state, "__builtin_rdmsr", OP_RDMSR, msr_type,
10662 register_builtin_function(state, "__builtin_wrmsr", OP_WRMSR, &void_type,
10663 &ulong_type, &ulong_type, &ulong_type);
10665 register_builtin_function(state, "__builtin_hlt", OP_HLT, &void_type,
10669 static struct type *declarator(
10670 struct compile_state *state, struct type *type,
10671 struct hash_entry **ident, int need_ident);
10672 static void decl(struct compile_state *state, struct triple *first);
10673 static struct type *specifier_qualifier_list(struct compile_state *state);
10674 #if DEBUG_ROMCC_WARNING
10675 static int isdecl_specifier(int tok);
10677 static struct type *decl_specifiers(struct compile_state *state);
10678 static int istype(int tok);
10679 static struct triple *expr(struct compile_state *state);
10680 static struct triple *assignment_expr(struct compile_state *state);
10681 static struct type *type_name(struct compile_state *state);
10682 static void statement(struct compile_state *state, struct triple *first);
10684 static struct triple *call_expr(
10685 struct compile_state *state, struct triple *func)
10687 struct triple *def;
10688 struct type *param, *type;
10689 ulong_t pvals, index;
10691 if ((func->type->type & TYPE_MASK) != TYPE_FUNCTION) {
10692 error(state, 0, "Called object is not a function");
10694 if (func->op != OP_LIST) {
10695 internal_error(state, 0, "improper function");
10697 eat(state, TOK_LPAREN);
10698 /* Find the return type without any specifiers */
10699 type = clone_type(0, func->type->left);
10700 /* Count the number of rhs entries for OP_FCALL */
10701 param = func->type->right;
10703 while((param->type & TYPE_MASK) == TYPE_PRODUCT) {
10705 param = param->right;
10707 if ((param->type & TYPE_MASK) != TYPE_VOID) {
10710 def = new_triple(state, OP_FCALL, type, -1, pvals);
10711 MISC(def, 0) = func;
10713 param = func->type->right;
10714 for(index = 0; index < pvals; index++) {
10715 struct triple *val;
10716 struct type *arg_type;
10717 val = read_expr(state, assignment_expr(state));
10719 if ((param->type & TYPE_MASK) == TYPE_PRODUCT) {
10720 arg_type = param->left;
10722 write_compatible(state, arg_type, val->type);
10723 RHS(def, index) = val;
10724 if (index != (pvals - 1)) {
10725 eat(state, TOK_COMMA);
10726 param = param->right;
10729 eat(state, TOK_RPAREN);
10734 static struct triple *character_constant(struct compile_state *state)
10736 struct triple *def;
10738 const signed char *str, *end;
10741 tk = eat(state, TOK_LIT_CHAR);
10742 str = (signed char *)tk->val.str + 1;
10743 str_len = tk->str_len - 2;
10744 if (str_len <= 0) {
10745 error(state, 0, "empty character constant");
10747 end = str + str_len;
10748 c = char_value(state, &str, end);
10750 error(state, 0, "multibyte character constant not supported");
10752 def = int_const(state, &char_type, (ulong_t)((long_t)c));
10756 static struct triple *string_constant(struct compile_state *state)
10758 struct triple *def;
10761 const signed char *str, *end;
10762 signed char *buf, *ptr;
10766 type = new_type(TYPE_ARRAY, &char_type, 0);
10767 type->elements = 0;
10768 /* The while loop handles string concatenation */
10770 tk = eat(state, TOK_LIT_STRING);
10771 str = (signed char *)tk->val.str + 1;
10772 str_len = tk->str_len - 2;
10774 error(state, 0, "negative string constant length");
10776 /* ignore empty string tokens */
10777 if ('"' == *str && 0 == str[1])
10779 end = str + str_len;
10781 buf = xmalloc(type->elements + str_len + 1, "string_constant");
10782 memcpy(buf, ptr, type->elements);
10783 ptr = buf + type->elements;
10785 *ptr++ = char_value(state, &str, end);
10786 } while(str < end);
10787 type->elements = ptr - buf;
10788 } while(peek(state) == TOK_LIT_STRING);
10790 type->elements += 1;
10791 def = triple(state, OP_BLOBCONST, type, 0, 0);
10798 static struct triple *integer_constant(struct compile_state *state)
10800 struct triple *def;
10807 tk = eat(state, TOK_LIT_INT);
10809 decimal = (tk->val.str[0] != '0');
10810 val = strtoul(tk->val.str, &end, 0);
10811 if ((val > ULONG_T_MAX) || ((val == ULONG_MAX) && (errno == ERANGE))) {
10812 error(state, 0, "Integer constant to large");
10815 if ((*end == 'u') || (*end == 'U')) {
10819 if ((*end == 'l') || (*end == 'L')) {
10823 if ((*end == 'u') || (*end == 'U')) {
10828 error(state, 0, "Junk at end of integer constant");
10831 type = &ulong_type;
10835 if (!decimal && (val > LONG_T_MAX)) {
10836 type = &ulong_type;
10841 if (val > UINT_T_MAX) {
10842 type = &ulong_type;
10847 if (!decimal && (val > INT_T_MAX) && (val <= UINT_T_MAX)) {
10850 else if (!decimal && (val > LONG_T_MAX)) {
10851 type = &ulong_type;
10853 else if (val > INT_T_MAX) {
10857 def = int_const(state, type, val);
10861 static struct triple *primary_expr(struct compile_state *state)
10863 struct triple *def;
10869 struct hash_entry *ident;
10870 /* Here ident is either:
10874 ident = eat(state, TOK_IDENT)->ident;
10875 if (!ident->sym_ident) {
10876 error(state, 0, "%s undeclared", ident->name);
10878 def = ident->sym_ident->def;
10881 case TOK_ENUM_CONST:
10883 struct hash_entry *ident;
10884 /* Here ident is an enumeration constant */
10885 ident = eat(state, TOK_ENUM_CONST)->ident;
10886 if (!ident->sym_ident) {
10887 error(state, 0, "%s undeclared", ident->name);
10889 def = ident->sym_ident->def;
10894 struct hash_entry *ident;
10895 ident = eat(state, TOK_MIDENT)->ident;
10896 warning(state, 0, "Replacing undefined macro: %s with 0",
10898 def = int_const(state, &int_type, 0);
10902 eat(state, TOK_LPAREN);
10904 eat(state, TOK_RPAREN);
10907 def = integer_constant(state);
10909 case TOK_LIT_FLOAT:
10910 eat(state, TOK_LIT_FLOAT);
10911 error(state, 0, "Floating point constants not supported");
10916 def = character_constant(state);
10918 case TOK_LIT_STRING:
10919 def = string_constant(state);
10923 error(state, 0, "Unexpected token: %s\n", tokens[tok]);
10928 static struct triple *postfix_expr(struct compile_state *state)
10930 struct triple *def;
10932 def = primary_expr(state);
10934 struct triple *left;
10938 switch((tok = peek(state))) {
10940 eat(state, TOK_LBRACKET);
10941 def = mk_subscript_expr(state, left, expr(state));
10942 eat(state, TOK_RBRACKET);
10945 def = call_expr(state, def);
10949 struct hash_entry *field;
10950 eat(state, TOK_DOT);
10951 field = eat(state, TOK_IDENT)->ident;
10952 def = deref_field(state, def, field);
10957 struct hash_entry *field;
10958 eat(state, TOK_ARROW);
10959 field = eat(state, TOK_IDENT)->ident;
10960 def = mk_deref_expr(state, read_expr(state, def));
10961 def = deref_field(state, def, field);
10965 eat(state, TOK_PLUSPLUS);
10966 def = mk_post_inc_expr(state, left);
10968 case TOK_MINUSMINUS:
10969 eat(state, TOK_MINUSMINUS);
10970 def = mk_post_dec_expr(state, left);
10980 static struct triple *cast_expr(struct compile_state *state);
10982 static struct triple *unary_expr(struct compile_state *state)
10984 struct triple *def, *right;
10986 switch((tok = peek(state))) {
10988 eat(state, TOK_PLUSPLUS);
10989 def = mk_pre_inc_expr(state, unary_expr(state));
10991 case TOK_MINUSMINUS:
10992 eat(state, TOK_MINUSMINUS);
10993 def = mk_pre_dec_expr(state, unary_expr(state));
10996 eat(state, TOK_AND);
10997 def = mk_addr_expr(state, cast_expr(state), 0);
11000 eat(state, TOK_STAR);
11001 def = mk_deref_expr(state, read_expr(state, cast_expr(state)));
11004 eat(state, TOK_PLUS);
11005 right = read_expr(state, cast_expr(state));
11006 arithmetic(state, right);
11007 def = integral_promotion(state, right);
11010 eat(state, TOK_MINUS);
11011 right = read_expr(state, cast_expr(state));
11012 arithmetic(state, right);
11013 def = integral_promotion(state, right);
11014 def = triple(state, OP_NEG, def->type, def, 0);
11017 eat(state, TOK_TILDE);
11018 right = read_expr(state, cast_expr(state));
11019 integral(state, right);
11020 def = integral_promotion(state, right);
11021 def = triple(state, OP_INVERT, def->type, def, 0);
11024 eat(state, TOK_BANG);
11025 right = read_expr(state, cast_expr(state));
11026 bool(state, right);
11027 def = lfalse_expr(state, right);
11033 eat(state, TOK_SIZEOF);
11034 tok1 = peek(state);
11035 tok2 = peek2(state);
11036 if ((tok1 == TOK_LPAREN) && istype(tok2)) {
11037 eat(state, TOK_LPAREN);
11038 type = type_name(state);
11039 eat(state, TOK_RPAREN);
11042 struct triple *expr;
11043 expr = unary_expr(state);
11045 release_expr(state, expr);
11047 def = int_const(state, &ulong_type, size_of_in_bytes(state, type));
11054 eat(state, TOK_ALIGNOF);
11055 tok1 = peek(state);
11056 tok2 = peek2(state);
11057 if ((tok1 == TOK_LPAREN) && istype(tok2)) {
11058 eat(state, TOK_LPAREN);
11059 type = type_name(state);
11060 eat(state, TOK_RPAREN);
11063 struct triple *expr;
11064 expr = unary_expr(state);
11066 release_expr(state, expr);
11068 def = int_const(state, &ulong_type, align_of_in_bytes(state, type));
11073 /* We only come here if we are called from the preprocessor */
11074 struct hash_entry *ident;
11076 eat(state, TOK_MDEFINED);
11078 if (pp_peek(state) == TOK_LPAREN) {
11079 pp_eat(state, TOK_LPAREN);
11082 ident = pp_eat(state, TOK_MIDENT)->ident;
11084 eat(state, TOK_RPAREN);
11086 def = int_const(state, &int_type, ident->sym_define != 0);
11090 def = postfix_expr(state);
11096 static struct triple *cast_expr(struct compile_state *state)
11098 struct triple *def;
11100 tok1 = peek(state);
11101 tok2 = peek2(state);
11102 if ((tok1 == TOK_LPAREN) && istype(tok2)) {
11104 eat(state, TOK_LPAREN);
11105 type = type_name(state);
11106 eat(state, TOK_RPAREN);
11107 def = mk_cast_expr(state, type, cast_expr(state));
11110 def = unary_expr(state);
11115 static struct triple *mult_expr(struct compile_state *state)
11117 struct triple *def;
11119 def = cast_expr(state);
11121 struct triple *left, *right;
11122 struct type *result_type;
11130 left = read_expr(state, def);
11131 arithmetic(state, left);
11135 right = read_expr(state, cast_expr(state));
11136 arithmetic(state, right);
11138 result_type = arithmetic_result(state, left, right);
11139 sign = is_signed(result_type);
11142 case TOK_STAR: op = sign? OP_SMUL : OP_UMUL; break;
11143 case TOK_DIV: op = sign? OP_SDIV : OP_UDIV; break;
11144 case TOK_MOD: op = sign? OP_SMOD : OP_UMOD; break;
11146 def = triple(state, op, result_type, left, right);
11156 static struct triple *add_expr(struct compile_state *state)
11158 struct triple *def;
11160 def = mult_expr(state);
11163 switch( peek(state)) {
11165 eat(state, TOK_PLUS);
11166 def = mk_add_expr(state, def, mult_expr(state));
11169 eat(state, TOK_MINUS);
11170 def = mk_sub_expr(state, def, mult_expr(state));
11180 static struct triple *shift_expr(struct compile_state *state)
11182 struct triple *def;
11184 def = add_expr(state);
11186 struct triple *left, *right;
11189 switch((tok = peek(state))) {
11192 left = read_expr(state, def);
11193 integral(state, left);
11194 left = integral_promotion(state, left);
11198 right = read_expr(state, add_expr(state));
11199 integral(state, right);
11200 right = integral_promotion(state, right);
11202 op = (tok == TOK_SL)? OP_SL :
11203 is_signed(left->type)? OP_SSR: OP_USR;
11205 def = triple(state, op, left->type, left, right);
11215 static struct triple *relational_expr(struct compile_state *state)
11217 #if DEBUG_ROMCC_WARNINGS
11218 #warning "Extend relational exprs to work on more than arithmetic types"
11220 struct triple *def;
11222 def = shift_expr(state);
11224 struct triple *left, *right;
11225 struct type *arg_type;
11228 switch((tok = peek(state))) {
11233 left = read_expr(state, def);
11234 arithmetic(state, left);
11238 right = read_expr(state, shift_expr(state));
11239 arithmetic(state, right);
11241 arg_type = arithmetic_result(state, left, right);
11242 sign = is_signed(arg_type);
11245 case TOK_LESS: op = sign? OP_SLESS : OP_ULESS; break;
11246 case TOK_MORE: op = sign? OP_SMORE : OP_UMORE; break;
11247 case TOK_LESSEQ: op = sign? OP_SLESSEQ : OP_ULESSEQ; break;
11248 case TOK_MOREEQ: op = sign? OP_SMOREEQ : OP_UMOREEQ; break;
11250 def = triple(state, op, &int_type, left, right);
11260 static struct triple *equality_expr(struct compile_state *state)
11262 #if DEBUG_ROMCC_WARNINGS
11263 #warning "Extend equality exprs to work on more than arithmetic types"
11265 struct triple *def;
11267 def = relational_expr(state);
11269 struct triple *left, *right;
11272 switch((tok = peek(state))) {
11275 left = read_expr(state, def);
11276 arithmetic(state, left);
11278 right = read_expr(state, relational_expr(state));
11279 arithmetic(state, right);
11280 op = (tok == TOK_EQEQ) ? OP_EQ: OP_NOTEQ;
11281 def = triple(state, op, &int_type, left, right);
11291 static struct triple *and_expr(struct compile_state *state)
11293 struct triple *def;
11294 def = equality_expr(state);
11295 while(peek(state) == TOK_AND) {
11296 struct triple *left, *right;
11297 struct type *result_type;
11298 left = read_expr(state, def);
11299 integral(state, left);
11300 eat(state, TOK_AND);
11301 right = read_expr(state, equality_expr(state));
11302 integral(state, right);
11303 result_type = arithmetic_result(state, left, right);
11304 def = triple(state, OP_AND, result_type, left, right);
11309 static struct triple *xor_expr(struct compile_state *state)
11311 struct triple *def;
11312 def = and_expr(state);
11313 while(peek(state) == TOK_XOR) {
11314 struct triple *left, *right;
11315 struct type *result_type;
11316 left = read_expr(state, def);
11317 integral(state, left);
11318 eat(state, TOK_XOR);
11319 right = read_expr(state, and_expr(state));
11320 integral(state, right);
11321 result_type = arithmetic_result(state, left, right);
11322 def = triple(state, OP_XOR, result_type, left, right);
11327 static struct triple *or_expr(struct compile_state *state)
11329 struct triple *def;
11330 def = xor_expr(state);
11331 while(peek(state) == TOK_OR) {
11332 struct triple *left, *right;
11333 struct type *result_type;
11334 left = read_expr(state, def);
11335 integral(state, left);
11336 eat(state, TOK_OR);
11337 right = read_expr(state, xor_expr(state));
11338 integral(state, right);
11339 result_type = arithmetic_result(state, left, right);
11340 def = triple(state, OP_OR, result_type, left, right);
11345 static struct triple *land_expr(struct compile_state *state)
11347 struct triple *def;
11348 def = or_expr(state);
11349 while(peek(state) == TOK_LOGAND) {
11350 struct triple *left, *right;
11351 left = read_expr(state, def);
11353 eat(state, TOK_LOGAND);
11354 right = read_expr(state, or_expr(state));
11355 bool(state, right);
11357 def = mkland_expr(state,
11358 ltrue_expr(state, left),
11359 ltrue_expr(state, right));
11364 static struct triple *lor_expr(struct compile_state *state)
11366 struct triple *def;
11367 def = land_expr(state);
11368 while(peek(state) == TOK_LOGOR) {
11369 struct triple *left, *right;
11370 left = read_expr(state, def);
11372 eat(state, TOK_LOGOR);
11373 right = read_expr(state, land_expr(state));
11374 bool(state, right);
11376 def = mklor_expr(state,
11377 ltrue_expr(state, left),
11378 ltrue_expr(state, right));
11383 static struct triple *conditional_expr(struct compile_state *state)
11385 struct triple *def;
11386 def = lor_expr(state);
11387 if (peek(state) == TOK_QUEST) {
11388 struct triple *test, *left, *right;
11390 test = ltrue_expr(state, read_expr(state, def));
11391 eat(state, TOK_QUEST);
11392 left = read_expr(state, expr(state));
11393 eat(state, TOK_COLON);
11394 right = read_expr(state, conditional_expr(state));
11396 def = mkcond_expr(state, test, left, right);
11402 struct triple *val;
11406 static void set_cv(struct compile_state *state, struct cv_triple *cv,
11407 struct triple *dest, struct triple *val)
11409 if (cv[dest->id].val) {
11410 free_triple(state, cv[dest->id].val);
11412 cv[dest->id].val = val;
11414 static struct triple *get_cv(struct compile_state *state, struct cv_triple *cv,
11415 struct triple *src)
11417 return cv[src->id].val;
11420 static struct triple *eval_const_expr(
11421 struct compile_state *state, struct triple *expr)
11423 struct triple *def;
11424 if (is_const(expr)) {
11428 /* If we don't start out as a constant simplify into one */
11429 struct triple *head, *ptr;
11430 struct cv_triple *cv;
11432 head = label(state); /* dummy initial triple */
11433 flatten(state, head, expr);
11435 for(ptr = head->next; ptr != head; ptr = ptr->next) {
11438 cv = xcmalloc(sizeof(struct cv_triple)*count, "const value vector");
11440 for(ptr = head->next; ptr != head; ptr = ptr->next) {
11442 cv[i].id = ptr->id;
11448 valid_ins(state, ptr);
11449 if ((ptr->op == OP_PHI) || (ptr->op == OP_LIST)) {
11450 internal_error(state, ptr,
11451 "unexpected %s in constant expression",
11454 else if (ptr->op == OP_LIST) {
11456 else if (triple_is_structural(state, ptr)) {
11459 else if (triple_is_ubranch(state, ptr)) {
11460 ptr = TARG(ptr, 0);
11462 else if (triple_is_cbranch(state, ptr)) {
11463 struct triple *cond_val;
11464 cond_val = get_cv(state, cv, RHS(ptr, 0));
11465 if (!cond_val || !is_const(cond_val) ||
11466 (cond_val->op != OP_INTCONST))
11468 internal_error(state, ptr, "bad branch condition");
11470 if (cond_val->u.cval == 0) {
11473 ptr = TARG(ptr, 0);
11476 else if (triple_is_branch(state, ptr)) {
11477 error(state, ptr, "bad branch type in constant expression");
11479 else if (ptr->op == OP_WRITE) {
11480 struct triple *val;
11481 val = get_cv(state, cv, RHS(ptr, 0));
11483 set_cv(state, cv, MISC(ptr, 0),
11484 copy_triple(state, val));
11485 set_cv(state, cv, ptr,
11486 copy_triple(state, val));
11489 else if (ptr->op == OP_READ) {
11490 set_cv(state, cv, ptr,
11492 get_cv(state, cv, RHS(ptr, 0))));
11495 else if (triple_is_pure(state, ptr, cv[ptr->id].id)) {
11496 struct triple *val, **rhs;
11497 val = copy_triple(state, ptr);
11498 rhs = triple_rhs(state, val, 0);
11499 for(; rhs; rhs = triple_rhs(state, val, rhs)) {
11501 internal_error(state, ptr, "Missing rhs");
11503 *rhs = get_cv(state, cv, *rhs);
11505 simplify(state, val);
11506 set_cv(state, cv, ptr, val);
11510 error(state, ptr, "impure operation in constant expression");
11513 } while(ptr != head);
11515 /* Get the result value */
11516 def = get_cv(state, cv, head->prev);
11517 cv[head->prev->id].val = 0;
11519 /* Free the temporary values */
11520 for(i = 0; i < count; i++) {
11522 free_triple(state, cv[i].val);
11527 /* Free the intermediate expressions */
11528 while(head->next != head) {
11529 release_triple(state, head->next);
11531 free_triple(state, head);
11533 if (!is_const(def)) {
11534 error(state, expr, "Not a constant expression");
11539 static struct triple *constant_expr(struct compile_state *state)
11541 return eval_const_expr(state, conditional_expr(state));
11544 static struct triple *assignment_expr(struct compile_state *state)
11546 struct triple *def, *left, *right;
11548 /* The C grammer in K&R shows assignment expressions
11549 * only taking unary expressions as input on their
11550 * left hand side. But specifies the precedence of
11551 * assignemnt as the lowest operator except for comma.
11553 * Allowing conditional expressions on the left hand side
11554 * of an assignement results in a grammar that accepts
11555 * a larger set of statements than standard C. As long
11556 * as the subset of the grammar that is standard C behaves
11557 * correctly this should cause no problems.
11559 * For the extra token strings accepted by the grammar
11560 * none of them should produce a valid lvalue, so they
11561 * should not produce functioning programs.
11563 * GCC has this bug as well, so surprises should be minimal.
11565 def = conditional_expr(state);
11567 switch((tok = peek(state))) {
11569 lvalue(state, left);
11570 eat(state, TOK_EQ);
11571 def = write_expr(state, left,
11572 read_expr(state, assignment_expr(state)));
11577 lvalue(state, left);
11578 arithmetic(state, left);
11580 right = read_expr(state, assignment_expr(state));
11581 arithmetic(state, right);
11583 sign = is_signed(left->type);
11586 case TOK_TIMESEQ: op = sign? OP_SMUL : OP_UMUL; break;
11587 case TOK_DIVEQ: op = sign? OP_SDIV : OP_UDIV; break;
11588 case TOK_MODEQ: op = sign? OP_SMOD : OP_UMOD; break;
11590 def = write_expr(state, left,
11591 triple(state, op, left->type,
11592 read_expr(state, left), right));
11595 lvalue(state, left);
11596 eat(state, TOK_PLUSEQ);
11597 def = write_expr(state, left,
11598 mk_add_expr(state, left, assignment_expr(state)));
11601 lvalue(state, left);
11602 eat(state, TOK_MINUSEQ);
11603 def = write_expr(state, left,
11604 mk_sub_expr(state, left, assignment_expr(state)));
11611 lvalue(state, left);
11612 integral(state, left);
11614 right = read_expr(state, assignment_expr(state));
11615 integral(state, right);
11616 right = integral_promotion(state, right);
11617 sign = is_signed(left->type);
11620 case TOK_SLEQ: op = OP_SL; break;
11621 case TOK_SREQ: op = sign? OP_SSR: OP_USR; break;
11622 case TOK_ANDEQ: op = OP_AND; break;
11623 case TOK_XOREQ: op = OP_XOR; break;
11624 case TOK_OREQ: op = OP_OR; break;
11626 def = write_expr(state, left,
11627 triple(state, op, left->type,
11628 read_expr(state, left), right));
11634 static struct triple *expr(struct compile_state *state)
11636 struct triple *def;
11637 def = assignment_expr(state);
11638 while(peek(state) == TOK_COMMA) {
11639 eat(state, TOK_COMMA);
11640 def = mkprog(state, def, assignment_expr(state), 0UL);
11645 static void expr_statement(struct compile_state *state, struct triple *first)
11647 if (peek(state) != TOK_SEMI) {
11648 /* lvalue conversions always apply except when certian operators
11649 * are applied. I apply the lvalue conversions here
11650 * as I know no more operators will be applied.
11652 flatten(state, first, lvalue_conversion(state, expr(state)));
11654 eat(state, TOK_SEMI);
11657 static void if_statement(struct compile_state *state, struct triple *first)
11659 struct triple *test, *jmp1, *jmp2, *middle, *end;
11661 jmp1 = jmp2 = middle = 0;
11662 eat(state, TOK_IF);
11663 eat(state, TOK_LPAREN);
11664 test = expr(state);
11666 /* Cleanup and invert the test */
11667 test = lfalse_expr(state, read_expr(state, test));
11668 eat(state, TOK_RPAREN);
11669 /* Generate the needed pieces */
11670 middle = label(state);
11671 jmp1 = branch(state, middle, test);
11672 /* Thread the pieces together */
11673 flatten(state, first, test);
11674 flatten(state, first, jmp1);
11675 flatten(state, first, label(state));
11676 statement(state, first);
11677 if (peek(state) == TOK_ELSE) {
11678 eat(state, TOK_ELSE);
11679 /* Generate the rest of the pieces */
11680 end = label(state);
11681 jmp2 = branch(state, end, 0);
11682 /* Thread them together */
11683 flatten(state, first, jmp2);
11684 flatten(state, first, middle);
11685 statement(state, first);
11686 flatten(state, first, end);
11689 flatten(state, first, middle);
11693 static void for_statement(struct compile_state *state, struct triple *first)
11695 struct triple *head, *test, *tail, *jmp1, *jmp2, *end;
11696 struct triple *label1, *label2, *label3;
11697 struct hash_entry *ident;
11699 eat(state, TOK_FOR);
11700 eat(state, TOK_LPAREN);
11701 head = test = tail = jmp1 = jmp2 = 0;
11702 if (peek(state) != TOK_SEMI) {
11703 head = expr(state);
11705 eat(state, TOK_SEMI);
11706 if (peek(state) != TOK_SEMI) {
11707 test = expr(state);
11709 test = ltrue_expr(state, read_expr(state, test));
11711 eat(state, TOK_SEMI);
11712 if (peek(state) != TOK_RPAREN) {
11713 tail = expr(state);
11715 eat(state, TOK_RPAREN);
11716 /* Generate the needed pieces */
11717 label1 = label(state);
11718 label2 = label(state);
11719 label3 = label(state);
11721 jmp1 = branch(state, label3, 0);
11722 jmp2 = branch(state, label1, test);
11725 jmp2 = branch(state, label1, 0);
11727 end = label(state);
11728 /* Remember where break and continue go */
11729 start_scope(state);
11730 ident = state->i_break;
11731 symbol(state, ident, &ident->sym_ident, end, end->type);
11732 ident = state->i_continue;
11733 symbol(state, ident, &ident->sym_ident, label2, label2->type);
11734 /* Now include the body */
11735 flatten(state, first, head);
11736 flatten(state, first, jmp1);
11737 flatten(state, first, label1);
11738 statement(state, first);
11739 flatten(state, first, label2);
11740 flatten(state, first, tail);
11741 flatten(state, first, label3);
11742 flatten(state, first, test);
11743 flatten(state, first, jmp2);
11744 flatten(state, first, end);
11745 /* Cleanup the break/continue scope */
11749 static void while_statement(struct compile_state *state, struct triple *first)
11751 struct triple *label1, *test, *label2, *jmp1, *jmp2, *end;
11752 struct hash_entry *ident;
11753 eat(state, TOK_WHILE);
11754 eat(state, TOK_LPAREN);
11755 test = expr(state);
11757 test = ltrue_expr(state, read_expr(state, test));
11758 eat(state, TOK_RPAREN);
11759 /* Generate the needed pieces */
11760 label1 = label(state);
11761 label2 = label(state);
11762 jmp1 = branch(state, label2, 0);
11763 jmp2 = branch(state, label1, test);
11764 end = label(state);
11765 /* Remember where break and continue go */
11766 start_scope(state);
11767 ident = state->i_break;
11768 symbol(state, ident, &ident->sym_ident, end, end->type);
11769 ident = state->i_continue;
11770 symbol(state, ident, &ident->sym_ident, label2, label2->type);
11771 /* Thread them together */
11772 flatten(state, first, jmp1);
11773 flatten(state, first, label1);
11774 statement(state, first);
11775 flatten(state, first, label2);
11776 flatten(state, first, test);
11777 flatten(state, first, jmp2);
11778 flatten(state, first, end);
11779 /* Cleanup the break/continue scope */
11783 static void do_statement(struct compile_state *state, struct triple *first)
11785 struct triple *label1, *label2, *test, *end;
11786 struct hash_entry *ident;
11787 eat(state, TOK_DO);
11788 /* Generate the needed pieces */
11789 label1 = label(state);
11790 label2 = label(state);
11791 end = label(state);
11792 /* Remember where break and continue go */
11793 start_scope(state);
11794 ident = state->i_break;
11795 symbol(state, ident, &ident->sym_ident, end, end->type);
11796 ident = state->i_continue;
11797 symbol(state, ident, &ident->sym_ident, label2, label2->type);
11798 /* Now include the body */
11799 flatten(state, first, label1);
11800 statement(state, first);
11801 /* Cleanup the break/continue scope */
11803 /* Eat the rest of the loop */
11804 eat(state, TOK_WHILE);
11805 eat(state, TOK_LPAREN);
11806 test = read_expr(state, expr(state));
11808 eat(state, TOK_RPAREN);
11809 eat(state, TOK_SEMI);
11810 /* Thread the pieces together */
11811 test = ltrue_expr(state, test);
11812 flatten(state, first, label2);
11813 flatten(state, first, test);
11814 flatten(state, first, branch(state, label1, test));
11815 flatten(state, first, end);
11819 static void return_statement(struct compile_state *state, struct triple *first)
11821 struct triple *jmp, *mv, *dest, *var, *val;
11823 eat(state, TOK_RETURN);
11825 #if DEBUG_ROMCC_WARNINGS
11826 #warning "FIXME implement a more general excess branch elimination"
11829 /* If we have a return value do some more work */
11830 if (peek(state) != TOK_SEMI) {
11831 val = read_expr(state, expr(state));
11833 eat(state, TOK_SEMI);
11835 /* See if this last statement in a function */
11836 last = ((peek(state) == TOK_RBRACE) &&
11837 (state->scope_depth == GLOBAL_SCOPE_DEPTH +2));
11839 /* Find the return variable */
11840 var = fresult(state, state->main_function);
11842 /* Find the return destination */
11843 dest = state->i_return->sym_ident->def;
11845 /* If needed generate a jump instruction */
11847 jmp = branch(state, dest, 0);
11849 /* If needed generate an assignment instruction */
11851 mv = write_expr(state, deref_index(state, var, 1), val);
11853 /* Now put the code together */
11855 flatten(state, first, mv);
11856 flatten(state, first, jmp);
11859 flatten(state, first, jmp);
11863 static void break_statement(struct compile_state *state, struct triple *first)
11865 struct triple *dest;
11866 eat(state, TOK_BREAK);
11867 eat(state, TOK_SEMI);
11868 if (!state->i_break->sym_ident) {
11869 error(state, 0, "break statement not within loop or switch");
11871 dest = state->i_break->sym_ident->def;
11872 flatten(state, first, branch(state, dest, 0));
11875 static void continue_statement(struct compile_state *state, struct triple *first)
11877 struct triple *dest;
11878 eat(state, TOK_CONTINUE);
11879 eat(state, TOK_SEMI);
11880 if (!state->i_continue->sym_ident) {
11881 error(state, 0, "continue statement outside of a loop");
11883 dest = state->i_continue->sym_ident->def;
11884 flatten(state, first, branch(state, dest, 0));
11887 static void goto_statement(struct compile_state *state, struct triple *first)
11889 struct hash_entry *ident;
11890 eat(state, TOK_GOTO);
11891 ident = eat(state, TOK_IDENT)->ident;
11892 if (!ident->sym_label) {
11893 /* If this is a forward branch allocate the label now,
11894 * it will be flattend in the appropriate location later.
11896 struct triple *ins;
11897 ins = label(state);
11898 label_symbol(state, ident, ins, FUNCTION_SCOPE_DEPTH);
11900 eat(state, TOK_SEMI);
11902 flatten(state, first, branch(state, ident->sym_label->def, 0));
11905 static void labeled_statement(struct compile_state *state, struct triple *first)
11907 struct triple *ins;
11908 struct hash_entry *ident;
11910 ident = eat(state, TOK_IDENT)->ident;
11911 if (ident->sym_label && ident->sym_label->def) {
11912 ins = ident->sym_label->def;
11913 put_occurance(ins->occurance);
11914 ins->occurance = new_occurance(state);
11917 ins = label(state);
11918 label_symbol(state, ident, ins, FUNCTION_SCOPE_DEPTH);
11920 if (ins->id & TRIPLE_FLAG_FLATTENED) {
11921 error(state, 0, "label %s already defined", ident->name);
11923 flatten(state, first, ins);
11925 eat(state, TOK_COLON);
11926 statement(state, first);
11929 static void switch_statement(struct compile_state *state, struct triple *first)
11931 struct triple *value, *top, *end, *dbranch;
11932 struct hash_entry *ident;
11934 /* See if we have a valid switch statement */
11935 eat(state, TOK_SWITCH);
11936 eat(state, TOK_LPAREN);
11937 value = expr(state);
11938 integral(state, value);
11939 value = read_expr(state, value);
11940 eat(state, TOK_RPAREN);
11941 /* Generate the needed pieces */
11942 top = label(state);
11943 end = label(state);
11944 dbranch = branch(state, end, 0);
11945 /* Remember where case branches and break goes */
11946 start_scope(state);
11947 ident = state->i_switch;
11948 symbol(state, ident, &ident->sym_ident, value, value->type);
11949 ident = state->i_case;
11950 symbol(state, ident, &ident->sym_ident, top, top->type);
11951 ident = state->i_break;
11952 symbol(state, ident, &ident->sym_ident, end, end->type);
11953 ident = state->i_default;
11954 symbol(state, ident, &ident->sym_ident, dbranch, dbranch->type);
11955 /* Thread them together */
11956 flatten(state, first, value);
11957 flatten(state, first, top);
11958 flatten(state, first, dbranch);
11959 statement(state, first);
11960 flatten(state, first, end);
11961 /* Cleanup the switch scope */
11965 static void case_statement(struct compile_state *state, struct triple *first)
11967 struct triple *cvalue, *dest, *test, *jmp;
11968 struct triple *ptr, *value, *top, *dbranch;
11970 /* See if w have a valid case statement */
11971 eat(state, TOK_CASE);
11972 cvalue = constant_expr(state);
11973 integral(state, cvalue);
11974 if (cvalue->op != OP_INTCONST) {
11975 error(state, 0, "integer constant expected");
11977 eat(state, TOK_COLON);
11978 if (!state->i_case->sym_ident) {
11979 error(state, 0, "case statement not within a switch");
11982 /* Lookup the interesting pieces */
11983 top = state->i_case->sym_ident->def;
11984 value = state->i_switch->sym_ident->def;
11985 dbranch = state->i_default->sym_ident->def;
11987 /* See if this case label has already been used */
11988 for(ptr = top; ptr != dbranch; ptr = ptr->next) {
11989 if (ptr->op != OP_EQ) {
11992 if (RHS(ptr, 1)->u.cval == cvalue->u.cval) {
11993 error(state, 0, "duplicate case %d statement",
11997 /* Generate the needed pieces */
11998 dest = label(state);
11999 test = triple(state, OP_EQ, &int_type, value, cvalue);
12000 jmp = branch(state, dest, test);
12001 /* Thread the pieces together */
12002 flatten(state, dbranch, test);
12003 flatten(state, dbranch, jmp);
12004 flatten(state, dbranch, label(state));
12005 flatten(state, first, dest);
12006 statement(state, first);
12009 static void default_statement(struct compile_state *state, struct triple *first)
12011 struct triple *dest;
12012 struct triple *dbranch, *end;
12014 /* See if we have a valid default statement */
12015 eat(state, TOK_DEFAULT);
12016 eat(state, TOK_COLON);
12018 if (!state->i_case->sym_ident) {
12019 error(state, 0, "default statement not within a switch");
12022 /* Lookup the interesting pieces */
12023 dbranch = state->i_default->sym_ident->def;
12024 end = state->i_break->sym_ident->def;
12026 /* See if a default statement has already happened */
12027 if (TARG(dbranch, 0) != end) {
12028 error(state, 0, "duplicate default statement");
12031 /* Generate the needed pieces */
12032 dest = label(state);
12034 /* Blame the branch on the default statement */
12035 put_occurance(dbranch->occurance);
12036 dbranch->occurance = new_occurance(state);
12038 /* Thread the pieces together */
12039 TARG(dbranch, 0) = dest;
12040 use_triple(dest, dbranch);
12041 flatten(state, first, dest);
12042 statement(state, first);
12045 static void asm_statement(struct compile_state *state, struct triple *first)
12047 struct asm_info *info;
12049 struct triple *constraint;
12050 struct triple *expr;
12051 } out_param[MAX_LHS], in_param[MAX_RHS], clob_param[MAX_LHS];
12052 struct triple *def, *asm_str;
12053 int out, in, clobbers, more, colons, i;
12057 eat(state, TOK_ASM);
12058 /* For now ignore the qualifiers */
12059 switch(peek(state)) {
12061 eat(state, TOK_CONST);
12064 eat(state, TOK_VOLATILE);
12065 flags |= TRIPLE_FLAG_VOLATILE;
12068 eat(state, TOK_LPAREN);
12069 asm_str = string_constant(state);
12072 out = in = clobbers = 0;
12074 if ((colons == 0) && (peek(state) == TOK_COLON)) {
12075 eat(state, TOK_COLON);
12077 more = (peek(state) == TOK_LIT_STRING);
12079 struct triple *var;
12080 struct triple *constraint;
12083 if (out > MAX_LHS) {
12084 error(state, 0, "Maximum output count exceeded.");
12086 constraint = string_constant(state);
12087 str = constraint->u.blob;
12088 if (str[0] != '=') {
12089 error(state, 0, "Output constraint does not start with =");
12091 constraint->u.blob = str + 1;
12092 eat(state, TOK_LPAREN);
12093 var = conditional_expr(state);
12094 eat(state, TOK_RPAREN);
12096 lvalue(state, var);
12097 out_param[out].constraint = constraint;
12098 out_param[out].expr = var;
12099 if (peek(state) == TOK_COMMA) {
12100 eat(state, TOK_COMMA);
12107 if ((colons == 1) && (peek(state) == TOK_COLON)) {
12108 eat(state, TOK_COLON);
12110 more = (peek(state) == TOK_LIT_STRING);
12112 struct triple *val;
12113 struct triple *constraint;
12116 if (in > MAX_RHS) {
12117 error(state, 0, "Maximum input count exceeded.");
12119 constraint = string_constant(state);
12120 str = constraint->u.blob;
12121 if (digitp(str[0] && str[1] == '\0')) {
12123 val = digval(str[0]);
12124 if ((val < 0) || (val >= out)) {
12125 error(state, 0, "Invalid input constraint %d", val);
12128 eat(state, TOK_LPAREN);
12129 val = conditional_expr(state);
12130 eat(state, TOK_RPAREN);
12132 in_param[in].constraint = constraint;
12133 in_param[in].expr = val;
12134 if (peek(state) == TOK_COMMA) {
12135 eat(state, TOK_COMMA);
12143 if ((colons == 2) && (peek(state) == TOK_COLON)) {
12144 eat(state, TOK_COLON);
12146 more = (peek(state) == TOK_LIT_STRING);
12148 struct triple *clobber;
12150 if ((clobbers + out) > MAX_LHS) {
12151 error(state, 0, "Maximum clobber limit exceeded.");
12153 clobber = string_constant(state);
12155 clob_param[clobbers].constraint = clobber;
12156 if (peek(state) == TOK_COMMA) {
12157 eat(state, TOK_COMMA);
12163 eat(state, TOK_RPAREN);
12164 eat(state, TOK_SEMI);
12167 info = xcmalloc(sizeof(*info), "asm_info");
12168 info->str = asm_str->u.blob;
12169 free_triple(state, asm_str);
12171 def = new_triple(state, OP_ASM, &void_type, clobbers + out, in);
12172 def->u.ainfo = info;
12175 /* Find the register constraints */
12176 for(i = 0; i < out; i++) {
12177 struct triple *constraint;
12178 constraint = out_param[i].constraint;
12179 info->tmpl.lhs[i] = arch_reg_constraint(state,
12180 out_param[i].expr->type, constraint->u.blob);
12181 free_triple(state, constraint);
12183 for(; i - out < clobbers; i++) {
12184 struct triple *constraint;
12185 constraint = clob_param[i - out].constraint;
12186 info->tmpl.lhs[i] = arch_reg_clobber(state, constraint->u.blob);
12187 free_triple(state, constraint);
12189 for(i = 0; i < in; i++) {
12190 struct triple *constraint;
12192 constraint = in_param[i].constraint;
12193 str = constraint->u.blob;
12194 if (digitp(str[0]) && str[1] == '\0') {
12195 struct reg_info cinfo;
12197 val = digval(str[0]);
12198 cinfo.reg = info->tmpl.lhs[val].reg;
12199 cinfo.regcm = arch_type_to_regcm(state, in_param[i].expr->type);
12200 cinfo.regcm &= info->tmpl.lhs[val].regcm;
12201 if (cinfo.reg == REG_UNSET) {
12202 cinfo.reg = REG_VIRT0 + val;
12204 if (cinfo.regcm == 0) {
12205 error(state, 0, "No registers for %d", val);
12207 info->tmpl.lhs[val] = cinfo;
12208 info->tmpl.rhs[i] = cinfo;
12211 info->tmpl.rhs[i] = arch_reg_constraint(state,
12212 in_param[i].expr->type, str);
12214 free_triple(state, constraint);
12217 /* Now build the helper expressions */
12218 for(i = 0; i < in; i++) {
12219 RHS(def, i) = read_expr(state, in_param[i].expr);
12221 flatten(state, first, def);
12222 for(i = 0; i < (out + clobbers); i++) {
12224 struct triple *piece;
12226 type = out_param[i].expr->type;
12228 size_t size = arch_reg_size(info->tmpl.lhs[i].reg);
12229 if (size >= SIZEOF_LONG) {
12230 type = &ulong_type;
12232 else if (size >= SIZEOF_INT) {
12235 else if (size >= SIZEOF_SHORT) {
12236 type = &ushort_type;
12239 type = &uchar_type;
12242 piece = triple(state, OP_PIECE, type, def, 0);
12244 LHS(def, i) = piece;
12245 flatten(state, first, piece);
12247 /* And write the helpers to their destinations */
12248 for(i = 0; i < out; i++) {
12249 struct triple *piece;
12250 piece = LHS(def, i);
12251 flatten(state, first,
12252 write_expr(state, out_param[i].expr, piece));
12257 static int isdecl(int tok)
12280 case TOK_TYPE_NAME: /* typedef name */
12287 static void compound_statement(struct compile_state *state, struct triple *first)
12289 eat(state, TOK_LBRACE);
12290 start_scope(state);
12292 /* statement-list opt */
12293 while (peek(state) != TOK_RBRACE) {
12294 statement(state, first);
12297 eat(state, TOK_RBRACE);
12300 static void statement(struct compile_state *state, struct triple *first)
12304 if (tok == TOK_LBRACE) {
12305 compound_statement(state, first);
12307 else if (tok == TOK_IF) {
12308 if_statement(state, first);
12310 else if (tok == TOK_FOR) {
12311 for_statement(state, first);
12313 else if (tok == TOK_WHILE) {
12314 while_statement(state, first);
12316 else if (tok == TOK_DO) {
12317 do_statement(state, first);
12319 else if (tok == TOK_RETURN) {
12320 return_statement(state, first);
12322 else if (tok == TOK_BREAK) {
12323 break_statement(state, first);
12325 else if (tok == TOK_CONTINUE) {
12326 continue_statement(state, first);
12328 else if (tok == TOK_GOTO) {
12329 goto_statement(state, first);
12331 else if (tok == TOK_SWITCH) {
12332 switch_statement(state, first);
12334 else if (tok == TOK_ASM) {
12335 asm_statement(state, first);
12337 else if ((tok == TOK_IDENT) && (peek2(state) == TOK_COLON)) {
12338 labeled_statement(state, first);
12340 else if (tok == TOK_CASE) {
12341 case_statement(state, first);
12343 else if (tok == TOK_DEFAULT) {
12344 default_statement(state, first);
12346 else if (isdecl(tok)) {
12347 /* This handles C99 intermixing of statements and decls */
12348 decl(state, first);
12351 expr_statement(state, first);
12355 static struct type *param_decl(struct compile_state *state)
12358 struct hash_entry *ident;
12359 /* Cheat so the declarator will know we are not global */
12360 start_scope(state);
12362 type = decl_specifiers(state);
12363 type = declarator(state, type, &ident, 0);
12364 type->field_ident = ident;
12369 static struct type *param_type_list(struct compile_state *state, struct type *type)
12371 struct type *ftype, **next;
12372 ftype = new_type(TYPE_FUNCTION | (type->type & STOR_MASK), type, param_decl(state));
12373 next = &ftype->right;
12374 ftype->elements = 1;
12375 while(peek(state) == TOK_COMMA) {
12376 eat(state, TOK_COMMA);
12377 if (peek(state) == TOK_DOTS) {
12378 eat(state, TOK_DOTS);
12379 error(state, 0, "variadic functions not supported");
12382 *next = new_type(TYPE_PRODUCT, *next, param_decl(state));
12383 next = &((*next)->right);
12390 static struct type *type_name(struct compile_state *state)
12393 type = specifier_qualifier_list(state);
12394 /* abstract-declarator (may consume no tokens) */
12395 type = declarator(state, type, 0, 0);
12399 static struct type *direct_declarator(
12400 struct compile_state *state, struct type *type,
12401 struct hash_entry **pident, int need_ident)
12403 struct hash_entry *ident;
12404 struct type *outer;
12407 arrays_complete(state, type);
12408 switch(peek(state)) {
12410 ident = eat(state, TOK_IDENT)->ident;
12412 error(state, 0, "Unexpected identifier found");
12414 /* The name of what we are declaring */
12418 eat(state, TOK_LPAREN);
12419 outer = declarator(state, type, pident, need_ident);
12420 eat(state, TOK_RPAREN);
12424 error(state, 0, "Identifier expected");
12430 arrays_complete(state, type);
12431 switch(peek(state)) {
12433 eat(state, TOK_LPAREN);
12434 type = param_type_list(state, type);
12435 eat(state, TOK_RPAREN);
12439 unsigned int qualifiers;
12440 struct triple *value;
12442 eat(state, TOK_LBRACKET);
12443 if (peek(state) != TOK_RBRACKET) {
12444 value = constant_expr(state);
12445 integral(state, value);
12447 eat(state, TOK_RBRACKET);
12449 qualifiers = type->type & (QUAL_MASK | STOR_MASK);
12450 type = new_type(TYPE_ARRAY | qualifiers, type, 0);
12452 type->elements = value->u.cval;
12453 free_triple(state, value);
12455 type->elements = ELEMENT_COUNT_UNSPECIFIED;
12466 struct type *inner;
12467 arrays_complete(state, type);
12469 for(inner = outer; inner->left; inner = inner->left)
12471 inner->left = type;
12477 static struct type *declarator(
12478 struct compile_state *state, struct type *type,
12479 struct hash_entry **pident, int need_ident)
12481 while(peek(state) == TOK_STAR) {
12482 eat(state, TOK_STAR);
12483 type = new_type(TYPE_POINTER | (type->type & STOR_MASK), type, 0);
12485 type = direct_declarator(state, type, pident, need_ident);
12489 static struct type *typedef_name(
12490 struct compile_state *state, unsigned int specifiers)
12492 struct hash_entry *ident;
12494 ident = eat(state, TOK_TYPE_NAME)->ident;
12495 type = ident->sym_ident->type;
12496 specifiers |= type->type & QUAL_MASK;
12497 if ((specifiers & (STOR_MASK | QUAL_MASK)) !=
12498 (type->type & (STOR_MASK | QUAL_MASK))) {
12499 type = clone_type(specifiers, type);
12504 static struct type *enum_specifier(
12505 struct compile_state *state, unsigned int spec)
12507 struct hash_entry *ident;
12510 struct type *enum_type;
12513 eat(state, TOK_ENUM);
12515 if ((tok == TOK_IDENT) || (tok == TOK_ENUM_CONST) || (tok == TOK_TYPE_NAME)) {
12516 ident = eat(state, tok)->ident;
12519 if (!ident || (peek(state) == TOK_LBRACE)) {
12520 struct type **next;
12521 eat(state, TOK_LBRACE);
12522 enum_type = new_type(TYPE_ENUM | spec, 0, 0);
12523 enum_type->type_ident = ident;
12524 next = &enum_type->right;
12526 struct hash_entry *eident;
12527 struct triple *value;
12528 struct type *entry;
12529 eident = eat(state, TOK_IDENT)->ident;
12530 if (eident->sym_ident) {
12531 error(state, 0, "%s already declared",
12534 eident->tok = TOK_ENUM_CONST;
12535 if (peek(state) == TOK_EQ) {
12536 struct triple *val;
12537 eat(state, TOK_EQ);
12538 val = constant_expr(state);
12539 integral(state, val);
12540 base = val->u.cval;
12542 value = int_const(state, &int_type, base);
12543 symbol(state, eident, &eident->sym_ident, value, &int_type);
12544 entry = new_type(TYPE_LIST, 0, 0);
12545 entry->field_ident = eident;
12547 next = &entry->right;
12549 if (peek(state) == TOK_COMMA) {
12550 eat(state, TOK_COMMA);
12552 } while(peek(state) != TOK_RBRACE);
12553 eat(state, TOK_RBRACE);
12555 symbol(state, ident, &ident->sym_tag, 0, enum_type);
12558 if (ident && ident->sym_tag &&
12559 ident->sym_tag->type &&
12560 ((ident->sym_tag->type->type & TYPE_MASK) == TYPE_ENUM)) {
12561 enum_type = clone_type(spec, ident->sym_tag->type);
12563 else if (ident && !enum_type) {
12564 error(state, 0, "enum %s undeclared", ident->name);
12569 static struct type *struct_declarator(
12570 struct compile_state *state, struct type *type, struct hash_entry **ident)
12572 if (peek(state) != TOK_COLON) {
12573 type = declarator(state, type, ident, 1);
12575 if (peek(state) == TOK_COLON) {
12576 struct triple *value;
12577 eat(state, TOK_COLON);
12578 value = constant_expr(state);
12579 if (value->op != OP_INTCONST) {
12580 error(state, 0, "Invalid constant expression");
12582 if (value->u.cval > size_of(state, type)) {
12583 error(state, 0, "bitfield larger than base type");
12585 if (!TYPE_INTEGER(type->type) || ((type->type & TYPE_MASK) == TYPE_BITFIELD)) {
12586 error(state, 0, "bitfield base not an integer type");
12588 type = new_type(TYPE_BITFIELD, type, 0);
12589 type->elements = value->u.cval;
12594 static struct type *struct_or_union_specifier(
12595 struct compile_state *state, unsigned int spec)
12597 struct type *struct_type;
12598 struct hash_entry *ident;
12599 unsigned int type_main;
12600 unsigned int type_join;
12604 switch(peek(state)) {
12606 eat(state, TOK_STRUCT);
12607 type_main = TYPE_STRUCT;
12608 type_join = TYPE_PRODUCT;
12611 eat(state, TOK_UNION);
12612 type_main = TYPE_UNION;
12613 type_join = TYPE_OVERLAP;
12616 eat(state, TOK_STRUCT);
12617 type_main = TYPE_STRUCT;
12618 type_join = TYPE_PRODUCT;
12622 if ((tok == TOK_IDENT) || (tok == TOK_ENUM_CONST) || (tok == TOK_TYPE_NAME)) {
12623 ident = eat(state, tok)->ident;
12625 if (!ident || (peek(state) == TOK_LBRACE)) {
12627 struct type **next;
12629 eat(state, TOK_LBRACE);
12630 next = &struct_type;
12632 struct type *base_type;
12634 base_type = specifier_qualifier_list(state);
12637 struct hash_entry *fident;
12639 type = struct_declarator(state, base_type, &fident);
12641 if (peek(state) == TOK_COMMA) {
12643 eat(state, TOK_COMMA);
12645 type = clone_type(0, type);
12646 type->field_ident = fident;
12648 *next = new_type(type_join, *next, type);
12649 next = &((*next)->right);
12654 eat(state, TOK_SEMI);
12655 } while(peek(state) != TOK_RBRACE);
12656 eat(state, TOK_RBRACE);
12657 struct_type = new_type(type_main | spec, struct_type, 0);
12658 struct_type->type_ident = ident;
12659 struct_type->elements = elements;
12661 symbol(state, ident, &ident->sym_tag, 0, struct_type);
12664 if (ident && ident->sym_tag &&
12665 ident->sym_tag->type &&
12666 ((ident->sym_tag->type->type & TYPE_MASK) == type_main)) {
12667 struct_type = clone_type(spec, ident->sym_tag->type);
12669 else if (ident && !struct_type) {
12670 error(state, 0, "%s %s undeclared",
12671 (type_main == TYPE_STRUCT)?"struct" : "union",
12674 return struct_type;
12677 static unsigned int storage_class_specifier_opt(struct compile_state *state)
12679 unsigned int specifiers;
12680 switch(peek(state)) {
12682 eat(state, TOK_AUTO);
12683 specifiers = STOR_AUTO;
12686 eat(state, TOK_REGISTER);
12687 specifiers = STOR_REGISTER;
12690 eat(state, TOK_STATIC);
12691 specifiers = STOR_STATIC;
12694 eat(state, TOK_EXTERN);
12695 specifiers = STOR_EXTERN;
12698 eat(state, TOK_TYPEDEF);
12699 specifiers = STOR_TYPEDEF;
12702 if (state->scope_depth <= GLOBAL_SCOPE_DEPTH) {
12703 specifiers = STOR_LOCAL;
12706 specifiers = STOR_AUTO;
12712 static unsigned int function_specifier_opt(struct compile_state *state)
12714 /* Ignore the inline keyword */
12715 unsigned int specifiers;
12717 switch(peek(state)) {
12719 eat(state, TOK_INLINE);
12720 specifiers = STOR_INLINE;
12725 static unsigned int attrib(struct compile_state *state, unsigned int attributes)
12727 int tok = peek(state);
12731 /* The empty attribute ignore it */
12734 case TOK_ENUM_CONST:
12735 case TOK_TYPE_NAME:
12737 struct hash_entry *ident;
12738 ident = eat(state, TOK_IDENT)->ident;
12740 if (ident == state->i_noinline) {
12741 if (attributes & ATTRIB_ALWAYS_INLINE) {
12742 error(state, 0, "both always_inline and noinline attribtes");
12744 attributes |= ATTRIB_NOINLINE;
12746 else if (ident == state->i_always_inline) {
12747 if (attributes & ATTRIB_NOINLINE) {
12748 error(state, 0, "both noinline and always_inline attribtes");
12750 attributes |= ATTRIB_ALWAYS_INLINE;
12752 else if (ident == state->i_noreturn) {
12753 // attribute((noreturn)) does nothing (yet?)
12756 error(state, 0, "Unknown attribute:%s", ident->name);
12761 error(state, 0, "Unexpected token: %s\n", tokens[tok]);
12767 static unsigned int attribute_list(struct compile_state *state, unsigned type)
12769 type = attrib(state, type);
12770 while(peek(state) == TOK_COMMA) {
12771 eat(state, TOK_COMMA);
12772 type = attrib(state, type);
12777 static unsigned int attributes_opt(struct compile_state *state, unsigned type)
12779 if (peek(state) == TOK_ATTRIBUTE) {
12780 eat(state, TOK_ATTRIBUTE);
12781 eat(state, TOK_LPAREN);
12782 eat(state, TOK_LPAREN);
12783 type = attribute_list(state, type);
12784 eat(state, TOK_RPAREN);
12785 eat(state, TOK_RPAREN);
12790 static unsigned int type_qualifiers(struct compile_state *state)
12792 unsigned int specifiers;
12795 specifiers = QUAL_NONE;
12797 switch(peek(state)) {
12799 eat(state, TOK_CONST);
12800 specifiers |= QUAL_CONST;
12803 eat(state, TOK_VOLATILE);
12804 specifiers |= QUAL_VOLATILE;
12807 eat(state, TOK_RESTRICT);
12808 specifiers |= QUAL_RESTRICT;
12818 static struct type *type_specifier(
12819 struct compile_state *state, unsigned int spec)
12824 switch((tok = peek(state))) {
12826 eat(state, TOK_VOID);
12827 type = new_type(TYPE_VOID | spec, 0, 0);
12830 eat(state, TOK_CHAR);
12831 type = new_type(TYPE_CHAR | spec, 0, 0);
12834 eat(state, TOK_SHORT);
12835 if (peek(state) == TOK_INT) {
12836 eat(state, TOK_INT);
12838 type = new_type(TYPE_SHORT | spec, 0, 0);
12841 eat(state, TOK_INT);
12842 type = new_type(TYPE_INT | spec, 0, 0);
12845 eat(state, TOK_LONG);
12846 switch(peek(state)) {
12848 eat(state, TOK_LONG);
12849 error(state, 0, "long long not supported");
12852 eat(state, TOK_DOUBLE);
12853 error(state, 0, "long double not supported");
12856 eat(state, TOK_INT);
12857 type = new_type(TYPE_LONG | spec, 0, 0);
12860 type = new_type(TYPE_LONG | spec, 0, 0);
12865 eat(state, TOK_FLOAT);
12866 error(state, 0, "type float not supported");
12869 eat(state, TOK_DOUBLE);
12870 error(state, 0, "type double not supported");
12873 eat(state, TOK_SIGNED);
12874 switch(peek(state)) {
12876 eat(state, TOK_LONG);
12877 switch(peek(state)) {
12879 eat(state, TOK_LONG);
12880 error(state, 0, "type long long not supported");
12883 eat(state, TOK_INT);
12884 type = new_type(TYPE_LONG | spec, 0, 0);
12887 type = new_type(TYPE_LONG | spec, 0, 0);
12892 eat(state, TOK_INT);
12893 type = new_type(TYPE_INT | spec, 0, 0);
12896 eat(state, TOK_SHORT);
12897 type = new_type(TYPE_SHORT | spec, 0, 0);
12900 eat(state, TOK_CHAR);
12901 type = new_type(TYPE_CHAR | spec, 0, 0);
12904 type = new_type(TYPE_INT | spec, 0, 0);
12909 eat(state, TOK_UNSIGNED);
12910 switch(peek(state)) {
12912 eat(state, TOK_LONG);
12913 switch(peek(state)) {
12915 eat(state, TOK_LONG);
12916 error(state, 0, "unsigned long long not supported");
12919 eat(state, TOK_INT);
12920 type = new_type(TYPE_ULONG | spec, 0, 0);
12923 type = new_type(TYPE_ULONG | spec, 0, 0);
12928 eat(state, TOK_INT);
12929 type = new_type(TYPE_UINT | spec, 0, 0);
12932 eat(state, TOK_SHORT);
12933 type = new_type(TYPE_USHORT | spec, 0, 0);
12936 eat(state, TOK_CHAR);
12937 type = new_type(TYPE_UCHAR | spec, 0, 0);
12940 type = new_type(TYPE_UINT | spec, 0, 0);
12944 /* struct or union specifier */
12947 type = struct_or_union_specifier(state, spec);
12949 /* enum-spefifier */
12951 type = enum_specifier(state, spec);
12954 case TOK_TYPE_NAME:
12955 type = typedef_name(state, spec);
12958 error(state, 0, "bad type specifier %s",
12965 static int istype(int tok)
12983 case TOK_TYPE_NAME:
12991 static struct type *specifier_qualifier_list(struct compile_state *state)
12994 unsigned int specifiers = 0;
12996 /* type qualifiers */
12997 specifiers |= type_qualifiers(state);
12999 /* type specifier */
13000 type = type_specifier(state, specifiers);
13005 #if DEBUG_ROMCC_WARNING
13006 static int isdecl_specifier(int tok)
13009 /* storage class specifier */
13015 /* type qualifier */
13019 /* type specifiers */
13029 /* struct or union specifier */
13032 /* enum-spefifier */
13035 case TOK_TYPE_NAME:
13036 /* function specifiers */
13045 static struct type *decl_specifiers(struct compile_state *state)
13048 unsigned int specifiers;
13049 /* I am overly restrictive in the arragement of specifiers supported.
13050 * C is overly flexible in this department it makes interpreting
13051 * the parse tree difficult.
13055 /* storage class specifier */
13056 specifiers |= storage_class_specifier_opt(state);
13058 /* function-specifier */
13059 specifiers |= function_specifier_opt(state);
13062 specifiers |= attributes_opt(state, 0);
13064 /* type qualifier */
13065 specifiers |= type_qualifiers(state);
13067 /* type specifier */
13068 type = type_specifier(state, specifiers);
13072 struct field_info {
13077 static struct field_info designator(struct compile_state *state, struct type *type)
13080 struct field_info info;
13084 switch(peek(state)) {
13087 struct triple *value;
13088 if ((type->type & TYPE_MASK) != TYPE_ARRAY) {
13089 error(state, 0, "Array designator not in array initializer");
13091 eat(state, TOK_LBRACKET);
13092 value = constant_expr(state);
13093 eat(state, TOK_RBRACKET);
13095 info.type = type->left;
13096 info.offset = value->u.cval * size_of(state, info.type);
13101 struct hash_entry *field;
13102 if (((type->type & TYPE_MASK) != TYPE_STRUCT) &&
13103 ((type->type & TYPE_MASK) != TYPE_UNION))
13105 error(state, 0, "Struct designator not in struct initializer");
13107 eat(state, TOK_DOT);
13108 field = eat(state, TOK_IDENT)->ident;
13109 info.offset = field_offset(state, type, field);
13110 info.type = field_type(state, type, field);
13114 error(state, 0, "Invalid designator");
13117 } while((tok == TOK_LBRACKET) || (tok == TOK_DOT));
13118 eat(state, TOK_EQ);
13122 static struct triple *initializer(
13123 struct compile_state *state, struct type *type)
13125 struct triple *result;
13126 #if DEBUG_ROMCC_WARNINGS
13127 #warning "FIXME more consistent initializer handling (where should eval_const_expr go?"
13129 if (peek(state) != TOK_LBRACE) {
13130 result = assignment_expr(state);
13131 if (((type->type & TYPE_MASK) == TYPE_ARRAY) &&
13132 (type->elements == ELEMENT_COUNT_UNSPECIFIED) &&
13133 ((result->type->type & TYPE_MASK) == TYPE_ARRAY) &&
13134 (result->type->elements != ELEMENT_COUNT_UNSPECIFIED) &&
13135 (equiv_types(type->left, result->type->left))) {
13136 type->elements = result->type->elements;
13138 if (is_lvalue(state, result) &&
13139 ((result->type->type & TYPE_MASK) == TYPE_ARRAY) &&
13140 (type->type & TYPE_MASK) != TYPE_ARRAY)
13142 result = lvalue_conversion(state, result);
13144 if (!is_init_compatible(state, type, result->type)) {
13145 error(state, 0, "Incompatible types in initializer");
13147 if (!equiv_types(type, result->type)) {
13148 result = mk_cast_expr(state, type, result);
13154 struct field_info info;
13156 if (((type->type & TYPE_MASK) != TYPE_ARRAY) &&
13157 ((type->type & TYPE_MASK) != TYPE_STRUCT)) {
13158 internal_error(state, 0, "unknown initializer type");
13161 info.type = type->left;
13162 if ((type->type & TYPE_MASK) == TYPE_STRUCT) {
13163 info.type = next_field(state, type, 0);
13165 if (type->elements == ELEMENT_COUNT_UNSPECIFIED) {
13168 max_offset = size_of(state, type);
13170 buf = xcmalloc(bits_to_bytes(max_offset), "initializer");
13171 eat(state, TOK_LBRACE);
13173 struct triple *value;
13174 struct type *value_type;
13180 if ((tok == TOK_LBRACKET) || (tok == TOK_DOT)) {
13181 info = designator(state, type);
13183 if ((type->elements != ELEMENT_COUNT_UNSPECIFIED) &&
13184 (info.offset >= max_offset)) {
13185 error(state, 0, "element beyond bounds");
13187 value_type = info.type;
13188 value = eval_const_expr(state, initializer(state, value_type));
13189 value_size = size_of(state, value_type);
13190 if (((type->type & TYPE_MASK) == TYPE_ARRAY) &&
13191 (type->elements == ELEMENT_COUNT_UNSPECIFIED) &&
13192 (max_offset <= info.offset)) {
13196 old_size = max_offset;
13197 max_offset = info.offset + value_size;
13198 buf = xmalloc(bits_to_bytes(max_offset), "initializer");
13199 memcpy(buf, old_buf, bits_to_bytes(old_size));
13202 dest = ((char *)buf) + bits_to_bytes(info.offset);
13203 #if DEBUG_INITIALIZER
13204 fprintf(state->errout, "dest = buf + %d max_offset: %d value_size: %d op: %d\n",
13206 bits_to_bytes(max_offset),
13207 bits_to_bytes(value_size),
13210 if (value->op == OP_BLOBCONST) {
13211 memcpy(dest, value->u.blob, bits_to_bytes(value_size));
13213 else if ((value->op == OP_INTCONST) && (value_size == SIZEOF_I8)) {
13214 #if DEBUG_INITIALIZER
13215 fprintf(state->errout, "byte: %02x\n", value->u.cval & 0xff);
13217 *((uint8_t *)dest) = value->u.cval & 0xff;
13219 else if ((value->op == OP_INTCONST) && (value_size == SIZEOF_I16)) {
13220 *((uint16_t *)dest) = value->u.cval & 0xffff;
13222 else if ((value->op == OP_INTCONST) && (value_size == SIZEOF_I32)) {
13223 *((uint32_t *)dest) = value->u.cval & 0xffffffff;
13226 internal_error(state, 0, "unhandled constant initializer");
13228 free_triple(state, value);
13229 if (peek(state) == TOK_COMMA) {
13230 eat(state, TOK_COMMA);
13233 info.offset += value_size;
13234 if ((type->type & TYPE_MASK) == TYPE_STRUCT) {
13235 info.type = next_field(state, type, info.type);
13236 info.offset = field_offset(state, type,
13237 info.type->field_ident);
13239 } while(comma && (peek(state) != TOK_RBRACE));
13240 if ((type->elements == ELEMENT_COUNT_UNSPECIFIED) &&
13241 ((type->type & TYPE_MASK) == TYPE_ARRAY)) {
13242 type->elements = max_offset / size_of(state, type->left);
13244 eat(state, TOK_RBRACE);
13245 result = triple(state, OP_BLOBCONST, type, 0, 0);
13246 result->u.blob = buf;
13251 static void resolve_branches(struct compile_state *state, struct triple *first)
13253 /* Make a second pass and finish anything outstanding
13254 * with respect to branches. The only outstanding item
13255 * is to see if there are goto to labels that have not
13256 * been defined and to error about them.
13259 struct triple *ins;
13260 /* Also error on branches that do not use their targets */
13263 if (!triple_is_ret(state, ins)) {
13264 struct triple **expr ;
13265 struct triple_set *set;
13266 expr = triple_targ(state, ins, 0);
13267 for(; expr; expr = triple_targ(state, ins, expr)) {
13268 struct triple *targ;
13270 for(set = targ?targ->use:0; set; set = set->next) {
13271 if (set->member == ins) {
13276 internal_error(state, ins, "targ not used");
13281 } while(ins != first);
13282 /* See if there are goto to labels that have not been defined */
13283 for(i = 0; i < HASH_TABLE_SIZE; i++) {
13284 struct hash_entry *entry;
13285 for(entry = state->hash_table[i]; entry; entry = entry->next) {
13286 struct triple *ins;
13287 if (!entry->sym_label) {
13290 ins = entry->sym_label->def;
13291 if (!(ins->id & TRIPLE_FLAG_FLATTENED)) {
13292 error(state, ins, "label `%s' used but not defined",
13299 static struct triple *function_definition(
13300 struct compile_state *state, struct type *type)
13302 struct triple *def, *tmp, *first, *end, *retvar, *ret;
13303 struct triple *fname;
13304 struct type *fname_type;
13305 struct hash_entry *ident;
13306 struct type *param, *crtype, *ctype;
13308 if ((type->type &TYPE_MASK) != TYPE_FUNCTION) {
13309 error(state, 0, "Invalid function header");
13312 /* Verify the function type */
13313 if (((type->right->type & TYPE_MASK) != TYPE_VOID) &&
13314 ((type->right->type & TYPE_MASK) != TYPE_PRODUCT) &&
13315 (type->right->field_ident == 0)) {
13316 error(state, 0, "Invalid function parameters");
13318 param = type->right;
13320 while((param->type & TYPE_MASK) == TYPE_PRODUCT) {
13322 if (!param->left->field_ident) {
13323 error(state, 0, "No identifier for parameter %d\n", i);
13325 param = param->right;
13328 if (((param->type & TYPE_MASK) != TYPE_VOID) && !param->field_ident) {
13329 error(state, 0, "No identifier for paramter %d\n", i);
13332 /* Get a list of statements for this function. */
13333 def = triple(state, OP_LIST, type, 0, 0);
13335 /* Start a new scope for the passed parameters */
13336 start_scope(state);
13338 /* Put a label at the very start of a function */
13339 first = label(state);
13340 RHS(def, 0) = first;
13342 /* Put a label at the very end of a function */
13343 end = label(state);
13344 flatten(state, first, end);
13345 /* Remember where return goes */
13346 ident = state->i_return;
13347 symbol(state, ident, &ident->sym_ident, end, end->type);
13349 /* Get the initial closure type */
13350 ctype = new_type(TYPE_JOIN, &void_type, 0);
13351 ctype->elements = 1;
13353 /* Add a variable for the return value */
13354 crtype = new_type(TYPE_TUPLE,
13355 /* Remove all type qualifiers from the return type */
13356 new_type(TYPE_PRODUCT, ctype, clone_type(0, type->left)), 0);
13357 crtype->elements = 2;
13358 flatten(state, end, variable(state, crtype));
13360 /* Allocate a variable for the return address */
13361 retvar = flatten(state, end, variable(state, &void_ptr_type));
13363 /* Add in the return instruction */
13364 ret = triple(state, OP_RET, &void_type, read_expr(state, retvar), 0);
13365 ret = flatten(state, first, ret);
13367 /* Walk through the parameters and create symbol table entries
13370 param = type->right;
13371 while((param->type & TYPE_MASK) == TYPE_PRODUCT) {
13372 ident = param->left->field_ident;
13373 tmp = variable(state, param->left);
13374 var_symbol(state, ident, tmp);
13375 flatten(state, end, tmp);
13376 param = param->right;
13378 if ((param->type & TYPE_MASK) != TYPE_VOID) {
13379 /* And don't forget the last parameter */
13380 ident = param->field_ident;
13381 tmp = variable(state, param);
13382 symbol(state, ident, &ident->sym_ident, tmp, tmp->type);
13383 flatten(state, end, tmp);
13386 /* Add the declaration static const char __func__ [] = "func-name" */
13387 fname_type = new_type(TYPE_ARRAY,
13388 clone_type(QUAL_CONST | STOR_STATIC, &char_type), 0);
13389 fname_type->type |= QUAL_CONST | STOR_STATIC;
13390 fname_type->elements = strlen(state->function) + 1;
13392 fname = triple(state, OP_BLOBCONST, fname_type, 0, 0);
13393 fname->u.blob = (void *)state->function;
13394 fname = flatten(state, end, fname);
13396 ident = state->i___func__;
13397 symbol(state, ident, &ident->sym_ident, fname, fname_type);
13399 /* Remember which function I am compiling.
13400 * Also assume the last defined function is the main function.
13402 state->main_function = def;
13404 /* Now get the actual function definition */
13405 compound_statement(state, end);
13407 /* Finish anything unfinished with branches */
13408 resolve_branches(state, first);
13410 /* Remove the parameter scope */
13414 /* Remember I have defined a function */
13415 if (!state->functions) {
13416 state->functions = def;
13418 insert_triple(state, state->functions, def);
13420 if (state->compiler->debug & DEBUG_INLINE) {
13421 FILE *fp = state->dbgout;
13424 fprintf(fp, "\n__________ %s _________\n", __FUNCTION__);
13425 display_func(state, fp, def);
13426 fprintf(fp, "__________ %s _________ done\n\n", __FUNCTION__);
13432 static struct triple *do_decl(struct compile_state *state,
13433 struct type *type, struct hash_entry *ident)
13435 struct triple *def;
13437 /* Clean up the storage types used */
13438 switch (type->type & STOR_MASK) {
13441 /* These are the good types I am aiming for */
13443 case STOR_REGISTER:
13444 type->type &= ~STOR_MASK;
13445 type->type |= STOR_AUTO;
13449 type->type &= ~STOR_MASK;
13450 type->type |= STOR_STATIC;
13454 error(state, 0, "typedef without name");
13456 symbol(state, ident, &ident->sym_ident, 0, type);
13457 ident->tok = TOK_TYPE_NAME;
13461 internal_error(state, 0, "Undefined storage class");
13463 if ((type->type & TYPE_MASK) == TYPE_FUNCTION) {
13464 error(state, 0, "Function prototypes not supported");
13467 ((type->type & TYPE_MASK) == TYPE_ARRAY) &&
13468 ((type->type & STOR_MASK) != STOR_STATIC))
13469 error(state, 0, "non static arrays not supported");
13471 ((type->type & STOR_MASK) == STOR_STATIC) &&
13472 ((type->type & QUAL_CONST) == 0)) {
13473 error(state, 0, "non const static variables not supported");
13476 def = variable(state, type);
13477 var_symbol(state, ident, def);
13482 static void decl(struct compile_state *state, struct triple *first)
13484 struct type *base_type, *type;
13485 struct hash_entry *ident;
13486 struct triple *def;
13488 global = (state->scope_depth <= GLOBAL_SCOPE_DEPTH);
13489 base_type = decl_specifiers(state);
13491 type = declarator(state, base_type, &ident, 0);
13492 type->type = attributes_opt(state, type->type);
13493 if (global && ident && (peek(state) == TOK_LBRACE)) {
13495 type->type_ident = ident;
13496 state->function = ident->name;
13497 def = function_definition(state, type);
13498 symbol(state, ident, &ident->sym_ident, def, type);
13499 state->function = 0;
13503 flatten(state, first, do_decl(state, type, ident));
13504 /* type or variable definition */
13507 if (peek(state) == TOK_EQ) {
13509 error(state, 0, "cannot assign to a type");
13511 eat(state, TOK_EQ);
13512 flatten(state, first,
13514 ident->sym_ident->def,
13515 initializer(state, type)));
13517 arrays_complete(state, type);
13518 if (peek(state) == TOK_COMMA) {
13519 eat(state, TOK_COMMA);
13521 type = declarator(state, base_type, &ident, 0);
13522 flatten(state, first, do_decl(state, type, ident));
13526 eat(state, TOK_SEMI);
13530 static void decls(struct compile_state *state)
13532 struct triple *list;
13534 list = label(state);
13537 if (tok == TOK_EOF) {
13540 if (tok == TOK_SPACE) {
13541 eat(state, TOK_SPACE);
13544 if (list->next != list) {
13545 error(state, 0, "global variables not supported");
13551 * Function inlining
13553 struct triple_reg_set {
13554 struct triple_reg_set *next;
13555 struct triple *member;
13556 struct triple *new;
13559 struct block *block;
13560 struct triple_reg_set *in;
13561 struct triple_reg_set *out;
13564 static void setup_basic_blocks(struct compile_state *, struct basic_blocks *bb);
13565 static void analyze_basic_blocks(struct compile_state *state, struct basic_blocks *bb);
13566 static void free_basic_blocks(struct compile_state *, struct basic_blocks *bb);
13567 static int tdominates(struct compile_state *state, struct triple *dom, struct triple *sub);
13568 static void walk_blocks(struct compile_state *state, struct basic_blocks *bb,
13569 void (*cb)(struct compile_state *state, struct block *block, void *arg),
13571 static void print_block(
13572 struct compile_state *state, struct block *block, void *arg);
13573 static int do_triple_set(struct triple_reg_set **head,
13574 struct triple *member, struct triple *new_member);
13575 static void do_triple_unset(struct triple_reg_set **head, struct triple *member);
13576 static struct reg_block *compute_variable_lifetimes(
13577 struct compile_state *state, struct basic_blocks *bb);
13578 static void free_variable_lifetimes(struct compile_state *state,
13579 struct basic_blocks *bb, struct reg_block *blocks);
13580 #if DEBUG_EXPLICIT_CLOSURES
13581 static void print_live_variables(struct compile_state *state,
13582 struct basic_blocks *bb, struct reg_block *rb, FILE *fp);
13586 static struct triple *call(struct compile_state *state,
13587 struct triple *retvar, struct triple *ret_addr,
13588 struct triple *targ, struct triple *ret)
13590 struct triple *call;
13592 if (!retvar || !is_lvalue(state, retvar)) {
13593 internal_error(state, 0, "writing to a non lvalue?");
13595 write_compatible(state, retvar->type, &void_ptr_type);
13597 call = new_triple(state, OP_CALL, &void_type, 1, 0);
13598 TARG(call, 0) = targ;
13599 MISC(call, 0) = ret;
13600 if (!targ || (targ->op != OP_LABEL)) {
13601 internal_error(state, 0, "call not to a label");
13603 if (!ret || (ret->op != OP_RET)) {
13604 internal_error(state, 0, "call not matched with return");
13609 static void walk_functions(struct compile_state *state,
13610 void (*cb)(struct compile_state *state, struct triple *func, void *arg),
13613 struct triple *func, *first;
13614 func = first = state->functions;
13616 cb(state, func, arg);
13618 } while(func != first);
13621 static void reverse_walk_functions(struct compile_state *state,
13622 void (*cb)(struct compile_state *state, struct triple *func, void *arg),
13625 struct triple *func, *first;
13626 func = first = state->functions;
13629 cb(state, func, arg);
13630 } while(func != first);
13634 static void mark_live(struct compile_state *state, struct triple *func, void *arg)
13636 struct triple *ptr, *first;
13637 if (func->u.cval == 0) {
13640 ptr = first = RHS(func, 0);
13642 if (ptr->op == OP_FCALL) {
13643 struct triple *called_func;
13644 called_func = MISC(ptr, 0);
13645 /* Mark the called function as used */
13646 if (!(func->id & TRIPLE_FLAG_FLATTENED)) {
13647 called_func->u.cval++;
13649 /* Remove the called function from the list */
13650 called_func->prev->next = called_func->next;
13651 called_func->next->prev = called_func->prev;
13653 /* Place the called function before me on the list */
13654 called_func->next = func;
13655 called_func->prev = func->prev;
13656 called_func->prev->next = called_func;
13657 called_func->next->prev = called_func;
13660 } while(ptr != first);
13661 func->id |= TRIPLE_FLAG_FLATTENED;
13664 static void mark_live_functions(struct compile_state *state)
13666 /* Ensure state->main_function is the last function in
13667 * the list of functions.
13669 if ((state->main_function->next != state->functions) ||
13670 (state->functions->prev != state->main_function)) {
13671 internal_error(state, 0,
13672 "state->main_function is not at the end of the function list ");
13674 state->main_function->u.cval = 1;
13675 reverse_walk_functions(state, mark_live, 0);
13678 static int local_triple(struct compile_state *state,
13679 struct triple *func, struct triple *ins)
13681 int local = (ins->id & TRIPLE_FLAG_LOCAL);
13684 FILE *fp = state->errout;
13685 fprintf(fp, "global: ");
13686 display_triple(fp, ins);
13692 struct triple *copy_func(struct compile_state *state, struct triple *ofunc,
13693 struct occurance *base_occurance)
13695 struct triple *nfunc;
13696 struct triple *nfirst, *ofirst;
13697 struct triple *new, *old;
13699 if (state->compiler->debug & DEBUG_INLINE) {
13700 FILE *fp = state->dbgout;
13703 fprintf(fp, "\n__________ %s _________\n", __FUNCTION__);
13704 display_func(state, fp, ofunc);
13705 fprintf(fp, "__________ %s _________ done\n\n", __FUNCTION__);
13708 /* Make a new copy of the old function */
13709 nfunc = triple(state, OP_LIST, ofunc->type, 0, 0);
13711 ofirst = old = RHS(ofunc, 0);
13713 struct triple *new;
13714 struct occurance *occurance;
13715 int old_lhs, old_rhs;
13716 old_lhs = old->lhs;
13717 old_rhs = old->rhs;
13718 occurance = inline_occurance(state, base_occurance, old->occurance);
13719 if (ofunc->u.cval && (old->op == OP_FCALL)) {
13720 MISC(old, 0)->u.cval += 1;
13722 new = alloc_triple(state, old->op, old->type, old_lhs, old_rhs,
13724 if (!triple_stores_block(state, new)) {
13725 memcpy(&new->u, &old->u, sizeof(new->u));
13728 RHS(nfunc, 0) = nfirst = new;
13731 insert_triple(state, nfirst, new);
13733 new->id |= TRIPLE_FLAG_FLATTENED;
13734 new->id |= old->id & TRIPLE_FLAG_COPY;
13736 /* During the copy remember new as user of old */
13737 use_triple(old, new);
13739 /* Remember which instructions are local */
13740 old->id |= TRIPLE_FLAG_LOCAL;
13742 } while(old != ofirst);
13744 /* Make a second pass to fix up any unresolved references */
13748 struct triple **oexpr, **nexpr;
13750 /* Lookup where the copy is, to join pointers */
13751 count = TRIPLE_SIZE(old);
13752 for(i = 0; i < count; i++) {
13753 oexpr = &old->param[i];
13754 nexpr = &new->param[i];
13755 if (*oexpr && !*nexpr) {
13756 if (!local_triple(state, ofunc, *oexpr)) {
13759 else if ((*oexpr)->use) {
13760 *nexpr = (*oexpr)->use->member;
13762 if (*nexpr == old) {
13763 internal_error(state, 0, "new == old?");
13765 use_triple(*nexpr, new);
13767 if (!*nexpr && *oexpr) {
13768 internal_error(state, 0, "Could not copy %d", i);
13773 } while((old != ofirst) && (new != nfirst));
13775 /* Make a third pass to cleanup the extra useses */
13779 unuse_triple(old, new);
13780 /* Forget which instructions are local */
13781 old->id &= ~TRIPLE_FLAG_LOCAL;
13784 } while ((old != ofirst) && (new != nfirst));
13788 static void expand_inline_call(
13789 struct compile_state *state, struct triple *me, struct triple *fcall)
13791 /* Inline the function call */
13792 struct type *ptype;
13793 struct triple *ofunc, *nfunc, *nfirst, *result, *retvar, *ins;
13794 struct triple *end, *nend;
13797 /* Find the triples */
13798 ofunc = MISC(fcall, 0);
13799 if (ofunc->op != OP_LIST) {
13800 internal_error(state, 0, "improper function");
13802 nfunc = copy_func(state, ofunc, fcall->occurance);
13803 /* Prepend the parameter reading into the new function list */
13804 ptype = nfunc->type->right;
13805 pvals = fcall->rhs;
13806 for(i = 0; i < pvals; i++) {
13807 struct type *atype;
13808 struct triple *arg, *param;
13810 if ((ptype->type & TYPE_MASK) == TYPE_PRODUCT) {
13811 atype = ptype->left;
13813 param = farg(state, nfunc, i);
13814 if ((param->type->type & TYPE_MASK) != (atype->type & TYPE_MASK)) {
13815 internal_error(state, fcall, "param %d type mismatch", i);
13817 arg = RHS(fcall, i);
13818 flatten(state, fcall, write_expr(state, param, arg));
13819 ptype = ptype->right;
13822 if ((nfunc->type->left->type & TYPE_MASK) != TYPE_VOID) {
13823 result = read_expr(state,
13824 deref_index(state, fresult(state, nfunc), 1));
13826 if (state->compiler->debug & DEBUG_INLINE) {
13827 FILE *fp = state->dbgout;
13830 fprintf(fp, "\n__________ %s _________\n", __FUNCTION__);
13831 display_func(state, fp, nfunc);
13832 fprintf(fp, "__________ %s _________ done\n\n", __FUNCTION__);
13836 * Get rid of the extra triples
13838 /* Remove the read of the return address */
13839 ins = RHS(nfunc, 0)->prev->prev;
13840 if ((ins->op != OP_READ) || (RHS(ins, 0) != fretaddr(state, nfunc))) {
13841 internal_error(state, ins, "Not return addres read?");
13843 release_triple(state, ins);
13844 /* Remove the return instruction */
13845 ins = RHS(nfunc, 0)->prev;
13846 if (ins->op != OP_RET) {
13847 internal_error(state, ins, "Not return?");
13849 release_triple(state, ins);
13850 /* Remove the retaddres variable */
13851 retvar = fretaddr(state, nfunc);
13852 if ((retvar->lhs != 1) ||
13853 (retvar->op != OP_ADECL) ||
13854 (retvar->next->op != OP_PIECE) ||
13855 (MISC(retvar->next, 0) != retvar)) {
13856 internal_error(state, retvar, "Not the return address?");
13858 release_triple(state, retvar->next);
13859 release_triple(state, retvar);
13861 /* Remove the label at the start of the function */
13862 ins = RHS(nfunc, 0);
13863 if (ins->op != OP_LABEL) {
13864 internal_error(state, ins, "Not label?");
13866 nfirst = ins->next;
13867 free_triple(state, ins);
13868 /* Release the new function header */
13870 free_triple(state, nfunc);
13872 /* Append the new function list onto the return list */
13874 nend = nfirst->prev;
13875 end->next = nfirst;
13876 nfirst->prev = end;
13877 nend->next = fcall;
13878 fcall->prev = nend;
13880 /* Now the result reading code */
13882 result = flatten(state, fcall, result);
13883 propogate_use(state, fcall, result);
13886 /* Release the original fcall instruction */
13887 release_triple(state, fcall);
13894 * Type of the result variable.
13898 * +----------+------------+
13900 * union of closures result_type
13902 * +------------------+---------------+
13904 * closure1 ... closuerN
13906 * +----+--+-+--------+-----+ +----+----+---+-----+
13907 * | | | | | | | | |
13908 * var1 var2 var3 ... varN result var1 var2 ... varN result
13910 * +--------+---------+
13912 * union of closures result_type
13914 * +-----+-------------------+
13916 * closure1 ... closureN
13918 * +-----+---+----+----+ +----+---+----+-----+
13920 * var1 var2 ... varN result var1 var2 ... varN result
13923 static int add_closure_type(struct compile_state *state,
13924 struct triple *func, struct type *closure_type)
13926 struct type *type, *ctype, **next;
13927 struct triple *var, *new_var;
13931 FILE *fp = state->errout;
13932 fprintf(fp, "original_type: ");
13933 name_of(fp, fresult(state, func)->type);
13936 /* find the original type */
13937 var = fresult(state, func);
13939 if (type->elements != 2) {
13940 internal_error(state, var, "bad return type");
13943 /* Find the complete closure type and update it */
13944 ctype = type->left->left;
13945 next = &ctype->left;
13946 while(((*next)->type & TYPE_MASK) == TYPE_OVERLAP) {
13947 next = &(*next)->right;
13949 *next = new_type(TYPE_OVERLAP, *next, dup_type(state, closure_type));
13950 ctype->elements += 1;
13953 fprintf(fp, "new_type: ");
13956 fprintf(fp, "ctype: %p %d bits: %d ",
13957 ctype, ctype->elements, reg_size_of(state, ctype));
13958 name_of(fp, ctype);
13962 /* Regenerate the variable with the new type definition */
13963 new_var = pre_triple(state, var, OP_ADECL, type, 0, 0);
13964 new_var->id |= TRIPLE_FLAG_FLATTENED;
13965 for(i = 0; i < new_var->lhs; i++) {
13966 LHS(new_var, i)->id |= TRIPLE_FLAG_FLATTENED;
13969 /* Point everyone at the new variable */
13970 propogate_use(state, var, new_var);
13972 /* Release the original variable */
13973 for(i = 0; i < var->lhs; i++) {
13974 release_triple(state, LHS(var, i));
13976 release_triple(state, var);
13978 /* Return the index of the added closure type */
13979 return ctype->elements - 1;
13982 static struct triple *closure_expr(struct compile_state *state,
13983 struct triple *func, int closure_idx, int var_idx)
13985 return deref_index(state,
13987 deref_index(state, fresult(state, func), 0),
13993 static void insert_triple_set(
13994 struct triple_reg_set **head, struct triple *member)
13996 struct triple_reg_set *new;
13997 new = xcmalloc(sizeof(*new), "triple_set");
13998 new->member = member;
14004 static int ordered_triple_set(
14005 struct triple_reg_set **head, struct triple *member)
14007 struct triple_reg_set **ptr;
14012 if (member == (*ptr)->member) {
14015 /* keep the list ordered */
14016 if (member->id < (*ptr)->member->id) {
14019 ptr = &(*ptr)->next;
14021 insert_triple_set(ptr, member);
14026 static void free_closure_variables(struct compile_state *state,
14027 struct triple_reg_set **enclose)
14029 struct triple_reg_set *entry, *next;
14030 for(entry = *enclose; entry; entry = next) {
14031 next = entry->next;
14032 do_triple_unset(enclose, entry->member);
14036 static int lookup_closure_index(struct compile_state *state,
14037 struct triple *me, struct triple *val)
14039 struct triple *first, *ins, *next;
14040 first = RHS(me, 0);
14041 ins = next = first;
14043 struct triple *result;
14044 struct triple *index0, *index1, *index2, *read, *write;
14047 if (ins->op != OP_CALL) {
14050 /* I am at a previous call point examine it closely */
14051 if (ins->next->op != OP_LABEL) {
14052 internal_error(state, ins, "call not followed by label");
14054 /* Does this call does not enclose any variables? */
14055 if ((ins->next->next->op != OP_INDEX) ||
14056 (ins->next->next->u.cval != 0) ||
14057 (result = MISC(ins->next->next, 0)) ||
14058 (result->id & TRIPLE_FLAG_LOCAL)) {
14061 index0 = ins->next->next;
14063 * 0 index result < 0 >
14069 for(index0 = ins->next->next;
14070 (index0->op == OP_INDEX) &&
14071 (MISC(index0, 0) == result) &&
14072 (index0->u.cval == 0) ;
14073 index0 = write->next)
14075 index1 = index0->next;
14076 index2 = index1->next;
14077 read = index2->next;
14078 write = read->next;
14079 if ((index0->op != OP_INDEX) ||
14080 (index1->op != OP_INDEX) ||
14081 (index2->op != OP_INDEX) ||
14082 (read->op != OP_READ) ||
14083 (write->op != OP_WRITE) ||
14084 (MISC(index1, 0) != index0) ||
14085 (MISC(index2, 0) != index1) ||
14086 (RHS(read, 0) != index2) ||
14087 (RHS(write, 0) != read)) {
14088 internal_error(state, index0, "bad var read");
14090 if (MISC(write, 0) == val) {
14091 return index2->u.cval;
14094 } while(next != first);
14098 static inline int enclose_triple(struct triple *ins)
14100 return (ins && ((ins->type->type & TYPE_MASK) != TYPE_VOID));
14103 static void compute_closure_variables(struct compile_state *state,
14104 struct triple *me, struct triple *fcall, struct triple_reg_set **enclose)
14106 struct triple_reg_set *set, *vars, **last_var;
14107 struct basic_blocks bb;
14108 struct reg_block *rb;
14109 struct block *block;
14110 struct triple *old_result, *first, *ins;
14112 unsigned long used_indicies;
14114 #define MAX_INDICIES (sizeof(used_indicies)*CHAR_BIT)
14115 #define ID_BITS(X) ((X) & (TRIPLE_FLAG_LOCAL -1))
14122 /* Find the basic blocks of this function */
14124 bb.first = RHS(me, 0);
14126 if (!triple_is_ret(state, bb.first->prev)) {
14129 old_result = fresult(state, me);
14131 analyze_basic_blocks(state, &bb);
14133 /* Find which variables are currently alive in a given block */
14134 rb = compute_variable_lifetimes(state, &bb);
14136 /* Find the variables that are currently alive */
14137 block = block_of_triple(state, fcall);
14138 if (!block || (block->vertex <= 0) || (block->vertex > bb.last_vertex)) {
14139 internal_error(state, fcall, "No reg block? block: %p", block);
14142 #if DEBUG_EXPLICIT_CLOSURES
14143 print_live_variables(state, &bb, rb, state->dbgout);
14144 fflush(state->dbgout);
14147 /* Count the number of triples in the function */
14148 first = RHS(me, 0);
14154 } while(ins != first);
14156 /* Allocate some memory to temorary hold the id info */
14157 info = xcmalloc(sizeof(*info) * (count +1), "info");
14159 /* Mark the local function */
14160 first = RHS(me, 0);
14164 info[idx].id = ins->id;
14165 ins->id = TRIPLE_FLAG_LOCAL | idx;
14168 } while(ins != first);
14171 * Build the list of variables to enclose.
14173 * A target it to put the same variable in the
14174 * same slot for ever call of a given function.
14175 * After coloring this removes all of the variable
14176 * manipulation code.
14178 * The list of variables to enclose is built ordered
14179 * program order because except in corner cases this
14180 * gives me the stability of assignment I need.
14182 * To gurantee that stability I lookup the variables
14183 * to see where they have been used before and
14184 * I build my final list with the assigned indicies.
14187 if (enclose_triple(old_result)) {
14188 ordered_triple_set(&vars, old_result);
14190 for(set = rb[block->vertex].out; set; set = set->next) {
14191 if (!enclose_triple(set->member)) {
14194 if ((set->member == fcall) || (set->member == old_result)) {
14197 if (!local_triple(state, me, set->member)) {
14198 internal_error(state, set->member, "not local?");
14200 ordered_triple_set(&vars, set->member);
14203 /* Lookup the current indicies of the live varialbe */
14206 for(set = vars; set ; set = set->next) {
14207 struct triple *ins;
14210 index = lookup_closure_index(state, me, ins);
14211 info[ID_BITS(ins->id)].index = index;
14215 if (index >= MAX_INDICIES) {
14216 internal_error(state, ins, "index unexpectedly large");
14218 if (used_indicies & (1 << index)) {
14219 internal_error(state, ins, "index previously used?");
14221 /* Remember which indicies have been used */
14222 used_indicies |= (1 << index);
14223 if (index > max_index) {
14228 /* Walk through the live variables and make certain
14229 * everything is assigned an index.
14231 for(set = vars; set; set = set->next) {
14232 struct triple *ins;
14235 index = info[ID_BITS(ins->id)].index;
14239 /* Find the lowest unused index value */
14240 for(index = 0; index < MAX_INDICIES; index++) {
14241 if (!(used_indicies & (1 << index))) {
14245 if (index == MAX_INDICIES) {
14246 internal_error(state, ins, "no free indicies?");
14248 info[ID_BITS(ins->id)].index = index;
14249 /* Remember which indicies have been used */
14250 used_indicies |= (1 << index);
14251 if (index > max_index) {
14256 /* Build the return list of variables with positions matching
14260 last_var = enclose;
14261 for(i = 0; i <= max_index; i++) {
14262 struct triple *var;
14264 if (used_indicies & (1 << i)) {
14265 for(set = vars; set; set = set->next) {
14267 index = info[ID_BITS(set->member->id)].index;
14274 internal_error(state, me, "missing variable");
14277 insert_triple_set(last_var, var);
14278 last_var = &(*last_var)->next;
14281 #if DEBUG_EXPLICIT_CLOSURES
14282 /* Print out the variables to be enclosed */
14283 loc(state->dbgout, state, fcall);
14284 fprintf(state->dbgout, "Alive: \n");
14285 for(set = *enclose; set; set = set->next) {
14286 display_triple(state->dbgout, set->member);
14288 fflush(state->dbgout);
14291 /* Clear the marks */
14294 ins->id = info[ID_BITS(ins->id)].id;
14296 } while(ins != first);
14298 /* Release the ordered list of live variables */
14299 free_closure_variables(state, &vars);
14301 /* Release the storage of the old ids */
14304 /* Release the variable lifetime information */
14305 free_variable_lifetimes(state, &bb, rb);
14307 /* Release the basic blocks of this function */
14308 free_basic_blocks(state, &bb);
14311 static void expand_function_call(
14312 struct compile_state *state, struct triple *me, struct triple *fcall)
14314 /* Generate an ordinary function call */
14315 struct type *closure_type, **closure_next;
14316 struct triple *func, *func_first, *func_last, *retvar;
14317 struct triple *first;
14318 struct type *ptype, *rtype;
14319 struct triple *ret_addr, *ret_loc;
14320 struct triple_reg_set *enclose, *set;
14321 int closure_idx, pvals, i;
14323 #if DEBUG_EXPLICIT_CLOSURES
14324 FILE *fp = state->dbgout;
14325 fprintf(fp, "\ndisplay_func(me) ptr: %p\n", fcall);
14326 display_func(state, fp, MISC(fcall, 0));
14327 display_func(state, fp, me);
14328 fprintf(fp, "__________ %s _________ done\n\n", __FUNCTION__);
14331 /* Find the triples */
14332 func = MISC(fcall, 0);
14333 func_first = RHS(func, 0);
14334 retvar = fretaddr(state, func);
14335 func_last = func_first->prev;
14336 first = fcall->next;
14338 /* Find what I need to enclose */
14339 compute_closure_variables(state, me, fcall, &enclose);
14341 /* Compute the closure type */
14342 closure_type = new_type(TYPE_TUPLE, 0, 0);
14343 closure_type->elements = 0;
14344 closure_next = &closure_type->left;
14345 for(set = enclose; set ; set = set->next) {
14349 type = set->member->type;
14351 if (!*closure_next) {
14352 *closure_next = type;
14354 *closure_next = new_type(TYPE_PRODUCT, *closure_next,
14356 closure_next = &(*closure_next)->right;
14358 closure_type->elements += 1;
14360 if (closure_type->elements == 0) {
14361 closure_type->type = TYPE_VOID;
14365 #if DEBUG_EXPLICIT_CLOSURES
14366 fprintf(state->dbgout, "closure type: ");
14367 name_of(state->dbgout, closure_type);
14368 fprintf(state->dbgout, "\n");
14371 /* Update the called functions closure variable */
14372 closure_idx = add_closure_type(state, func, closure_type);
14374 /* Generate some needed triples */
14375 ret_loc = label(state);
14376 ret_addr = triple(state, OP_ADDRCONST, &void_ptr_type, ret_loc, 0);
14378 /* Pass the parameters to the new function */
14379 ptype = func->type->right;
14380 pvals = fcall->rhs;
14381 for(i = 0; i < pvals; i++) {
14382 struct type *atype;
14383 struct triple *arg, *param;
14385 if ((ptype->type & TYPE_MASK) == TYPE_PRODUCT) {
14386 atype = ptype->left;
14388 param = farg(state, func, i);
14389 if ((param->type->type & TYPE_MASK) != (atype->type & TYPE_MASK)) {
14390 internal_error(state, fcall, "param type mismatch");
14392 arg = RHS(fcall, i);
14393 flatten(state, first, write_expr(state, param, arg));
14394 ptype = ptype->right;
14396 rtype = func->type->left;
14398 /* Thread the triples together */
14399 ret_loc = flatten(state, first, ret_loc);
14401 /* Save the active variables in the result variable */
14402 for(i = 0, set = enclose; set ; set = set->next, i++) {
14403 if (!set->member) {
14406 flatten(state, ret_loc,
14408 closure_expr(state, func, closure_idx, i),
14409 read_expr(state, set->member)));
14412 /* Initialize the return value */
14413 if ((rtype->type & TYPE_MASK) != TYPE_VOID) {
14414 flatten(state, ret_loc,
14416 deref_index(state, fresult(state, func), 1),
14417 new_triple(state, OP_UNKNOWNVAL, rtype, 0, 0)));
14420 ret_addr = flatten(state, ret_loc, ret_addr);
14421 flatten(state, ret_loc, write_expr(state, retvar, ret_addr));
14422 flatten(state, ret_loc,
14423 call(state, retvar, ret_addr, func_first, func_last));
14425 /* Find the result */
14426 if ((rtype->type & TYPE_MASK) != TYPE_VOID) {
14427 struct triple * result;
14428 result = flatten(state, first,
14430 deref_index(state, fresult(state, func), 1)));
14432 propogate_use(state, fcall, result);
14435 /* Release the original fcall instruction */
14436 release_triple(state, fcall);
14438 /* Restore the active variables from the result variable */
14439 for(i = 0, set = enclose; set ; set = set->next, i++) {
14440 struct triple_set *use, *next;
14441 struct triple *new;
14442 struct basic_blocks bb;
14443 if (!set->member || (set->member == fcall)) {
14446 /* Generate an expression for the value */
14447 new = flatten(state, first,
14449 closure_expr(state, func, closure_idx, i)));
14452 /* If the original is an lvalue restore the preserved value */
14453 if (is_lvalue(state, set->member)) {
14454 flatten(state, first,
14455 write_expr(state, set->member, new));
14459 * If the original is a value update the dominated uses.
14462 /* Analyze the basic blocks so I can see who dominates whom */
14464 bb.first = RHS(me, 0);
14465 if (!triple_is_ret(state, bb.first->prev)) {
14468 analyze_basic_blocks(state, &bb);
14471 #if DEBUG_EXPLICIT_CLOSURES
14472 fprintf(state->errout, "Updating domindated uses: %p -> %p\n",
14475 /* If fcall dominates the use update the expression */
14476 for(use = set->member->use; use; use = next) {
14477 /* Replace use modifies the use chain and
14478 * removes use, so I must take a copy of the
14479 * next entry early.
14482 if (!tdominates(state, fcall, use->member)) {
14485 replace_use(state, set->member, new, use->member);
14488 /* Release the basic blocks, the instructions will be
14489 * different next time, and flatten/insert_triple does
14490 * not update the block values so I can't cache the analysis.
14492 free_basic_blocks(state, &bb);
14495 /* Release the closure variable list */
14496 free_closure_variables(state, &enclose);
14498 if (state->compiler->debug & DEBUG_INLINE) {
14499 FILE *fp = state->dbgout;
14502 fprintf(fp, "\n__________ %s _________\n", __FUNCTION__);
14503 display_func(state, fp, func);
14504 display_func(state, fp, me);
14505 fprintf(fp, "__________ %s _________ done\n\n", __FUNCTION__);
14511 static int do_inline(struct compile_state *state, struct triple *func)
14516 policy = state->compiler->flags & COMPILER_INLINE_MASK;
14518 case COMPILER_INLINE_ALWAYS:
14520 if (func->type->type & ATTRIB_NOINLINE) {
14521 error(state, func, "noinline with always_inline compiler option");
14524 case COMPILER_INLINE_NEVER:
14526 if (func->type->type & ATTRIB_ALWAYS_INLINE) {
14527 error(state, func, "always_inline with noinline compiler option");
14530 case COMPILER_INLINE_DEFAULTON:
14531 switch(func->type->type & STOR_MASK) {
14532 case STOR_STATIC | STOR_INLINE:
14533 case STOR_LOCAL | STOR_INLINE:
14534 case STOR_EXTERN | STOR_INLINE:
14542 case COMPILER_INLINE_DEFAULTOFF:
14543 switch(func->type->type & STOR_MASK) {
14544 case STOR_STATIC | STOR_INLINE:
14545 case STOR_LOCAL | STOR_INLINE:
14546 case STOR_EXTERN | STOR_INLINE:
14554 case COMPILER_INLINE_NOPENALTY:
14555 switch(func->type->type & STOR_MASK) {
14556 case STOR_STATIC | STOR_INLINE:
14557 case STOR_LOCAL | STOR_INLINE:
14558 case STOR_EXTERN | STOR_INLINE:
14562 do_inline = (func->u.cval == 1);
14568 internal_error(state, 0, "Unimplemented inline policy");
14571 /* Force inlining */
14572 if (func->type->type & ATTRIB_NOINLINE) {
14575 if (func->type->type & ATTRIB_ALWAYS_INLINE) {
14581 static void inline_function(struct compile_state *state, struct triple *me, void *arg)
14583 struct triple *first, *ptr, *next;
14584 /* If the function is not used don't bother */
14585 if (me->u.cval <= 0) {
14588 if (state->compiler->debug & DEBUG_CALLS2) {
14589 FILE *fp = state->dbgout;
14590 fprintf(fp, "in: %s\n",
14591 me->type->type_ident->name);
14594 first = RHS(me, 0);
14595 ptr = next = first;
14597 struct triple *func, *prev;
14601 if (ptr->op != OP_FCALL) {
14604 func = MISC(ptr, 0);
14605 /* See if the function should be inlined */
14606 if (!do_inline(state, func)) {
14607 /* Put a label after the fcall */
14608 post_triple(state, ptr, OP_LABEL, &void_type, 0, 0);
14611 if (state->compiler->debug & DEBUG_CALLS) {
14612 FILE *fp = state->dbgout;
14613 if (state->compiler->debug & DEBUG_CALLS2) {
14614 loc(fp, state, ptr);
14616 fprintf(fp, "inlining %s\n",
14617 func->type->type_ident->name);
14621 /* Update the function use counts */
14624 /* Replace the fcall with the called function */
14625 expand_inline_call(state, me, ptr);
14628 } while (next != first);
14630 ptr = next = first;
14632 struct triple *prev, *func;
14636 if (ptr->op != OP_FCALL) {
14639 func = MISC(ptr, 0);
14640 if (state->compiler->debug & DEBUG_CALLS) {
14641 FILE *fp = state->dbgout;
14642 if (state->compiler->debug & DEBUG_CALLS2) {
14643 loc(fp, state, ptr);
14645 fprintf(fp, "calling %s\n",
14646 func->type->type_ident->name);
14649 /* Replace the fcall with the instruction sequence
14650 * needed to make the call.
14652 expand_function_call(state, me, ptr);
14654 } while(next != first);
14657 static void inline_functions(struct compile_state *state, struct triple *func)
14659 inline_function(state, func, 0);
14660 reverse_walk_functions(state, inline_function, 0);
14663 static void insert_function(struct compile_state *state,
14664 struct triple *func, void *arg)
14666 struct triple *first, *end, *ffirst, *fend;
14668 if (state->compiler->debug & DEBUG_INLINE) {
14669 FILE *fp = state->errout;
14670 fprintf(fp, "%s func count: %d\n",
14671 func->type->type_ident->name, func->u.cval);
14673 if (func->u.cval == 0) {
14677 /* Find the end points of the lists */
14680 ffirst = RHS(func, 0);
14681 fend = ffirst->prev;
14683 /* splice the lists together */
14684 end->next = ffirst;
14685 ffirst->prev = end;
14686 fend->next = first;
14687 first->prev = fend;
14690 struct triple *input_asm(struct compile_state *state)
14692 struct asm_info *info;
14693 struct triple *def;
14696 info = xcmalloc(sizeof(*info), "asm_info");
14699 out = sizeof(arch_input_regs)/sizeof(arch_input_regs[0]);
14700 memcpy(&info->tmpl.lhs, arch_input_regs, sizeof(arch_input_regs));
14702 def = new_triple(state, OP_ASM, &void_type, out, 0);
14703 def->u.ainfo = info;
14704 def->id |= TRIPLE_FLAG_VOLATILE;
14706 for(i = 0; i < out; i++) {
14707 struct triple *piece;
14708 piece = triple(state, OP_PIECE, &int_type, def, 0);
14710 LHS(def, i) = piece;
14716 struct triple *output_asm(struct compile_state *state)
14718 struct asm_info *info;
14719 struct triple *def;
14722 info = xcmalloc(sizeof(*info), "asm_info");
14725 in = sizeof(arch_output_regs)/sizeof(arch_output_regs[0]);
14726 memcpy(&info->tmpl.rhs, arch_output_regs, sizeof(arch_output_regs));
14728 def = new_triple(state, OP_ASM, &void_type, 0, in);
14729 def->u.ainfo = info;
14730 def->id |= TRIPLE_FLAG_VOLATILE;
14735 static void join_functions(struct compile_state *state)
14737 struct triple *start, *end, *call, *in, *out, *func;
14738 struct file_state file;
14739 struct type *pnext, *param;
14740 struct type *result_type, *args_type;
14743 /* Be clear the functions have not been joined yet */
14744 state->functions_joined = 0;
14746 /* Dummy file state to get debug handing right */
14747 memset(&file, 0, sizeof(file));
14748 file.basename = "";
14750 file.report_line = 0;
14751 file.report_name = file.basename;
14752 file.prev = state->file;
14753 state->file = &file;
14754 state->function = "";
14756 if (!state->main_function) {
14757 error(state, 0, "No functions to compile\n");
14760 /* The type of arguments */
14761 args_type = state->main_function->type->right;
14762 /* The return type without any specifiers */
14763 result_type = clone_type(0, state->main_function->type->left);
14766 /* Verify the external arguments */
14767 if (registers_of(state, args_type) > ARCH_INPUT_REGS) {
14768 error(state, state->main_function,
14769 "Too many external input arguments");
14771 if (registers_of(state, result_type) > ARCH_OUTPUT_REGS) {
14772 error(state, state->main_function,
14773 "Too many external output arguments");
14776 /* Lay down the basic program structure */
14777 end = label(state);
14778 start = label(state);
14779 start = flatten(state, state->first, start);
14780 end = flatten(state, state->first, end);
14781 in = input_asm(state);
14782 out = output_asm(state);
14783 call = new_triple(state, OP_FCALL, result_type, -1, registers_of(state, args_type));
14784 MISC(call, 0) = state->main_function;
14785 in = flatten(state, state->first, in);
14786 call = flatten(state, state->first, call);
14787 out = flatten(state, state->first, out);
14790 /* Read the external input arguments */
14793 while(pnext && ((pnext->type & TYPE_MASK) != TYPE_VOID)) {
14794 struct triple *expr;
14797 if ((param->type & TYPE_MASK) == TYPE_PRODUCT) {
14798 pnext = param->right;
14799 param = param->left;
14801 if (registers_of(state, param) != 1) {
14802 error(state, state->main_function,
14803 "Arg: %d %s requires multiple registers",
14804 idx + 1, param->field_ident->name);
14806 expr = read_expr(state, LHS(in, idx));
14807 RHS(call, idx) = expr;
14808 expr = flatten(state, call, expr);
14809 use_triple(expr, call);
14815 /* Write the external output arguments */
14816 pnext = result_type;
14817 if ((pnext->type & TYPE_MASK) == TYPE_STRUCT) {
14818 pnext = result_type->left;
14820 for(idx = 0; idx < out->rhs; idx++) {
14821 struct triple *expr;
14824 if (param && ((param->type & TYPE_MASK) == TYPE_PRODUCT)) {
14825 pnext = param->right;
14826 param = param->left;
14828 if (param && ((param->type & TYPE_MASK) == TYPE_VOID)) {
14832 if (registers_of(state, param) != 1) {
14833 error(state, state->main_function,
14834 "Result: %d %s requires multiple registers",
14835 idx, param->field_ident->name);
14837 expr = read_expr(state, call);
14838 if ((result_type->type & TYPE_MASK) == TYPE_STRUCT) {
14839 expr = deref_field(state, expr, param->field_ident);
14842 expr = triple(state, OP_UNKNOWNVAL, &int_type, 0, 0);
14844 flatten(state, out, expr);
14845 RHS(out, idx) = expr;
14846 use_triple(expr, out);
14849 /* Allocate a dummy containing function */
14850 func = triple(state, OP_LIST,
14851 new_type(TYPE_FUNCTION, &void_type, &void_type), 0, 0);
14852 func->type->type_ident = lookup(state, "", 0);
14853 RHS(func, 0) = state->first;
14856 /* See which functions are called, and how often */
14857 mark_live_functions(state);
14858 inline_functions(state, func);
14859 walk_functions(state, insert_function, end);
14861 if (start->next != end) {
14862 flatten(state, start, branch(state, end, 0));
14865 /* OK now the functions have been joined. */
14866 state->functions_joined = 1;
14868 /* Done now cleanup */
14869 state->file = file.prev;
14870 state->function = 0;
14874 * Data structurs for optimation.
14878 static int do_use_block(
14879 struct block *used, struct block_set **head, struct block *user,
14882 struct block_set **ptr, *new;
14889 if ((*ptr)->member == user) {
14892 ptr = &(*ptr)->next;
14894 new = xcmalloc(sizeof(*new), "block_set");
14895 new->member = user;
14906 static int do_unuse_block(
14907 struct block *used, struct block_set **head, struct block *unuser)
14909 struct block_set *use, **ptr;
14915 if (use->member == unuser) {
14917 memset(use, -1, sizeof(*use));
14928 static void use_block(struct block *used, struct block *user)
14931 /* Append new to the head of the list, print_block
14934 count = do_use_block(used, &used->use, user, 1);
14935 used->users += count;
14937 static void unuse_block(struct block *used, struct block *unuser)
14940 count = do_unuse_block(used, &used->use, unuser);
14941 used->users -= count;
14944 static void add_block_edge(struct block *block, struct block *edge, int front)
14947 count = do_use_block(block, &block->edges, edge, front);
14948 block->edge_count += count;
14951 static void remove_block_edge(struct block *block, struct block *edge)
14954 count = do_unuse_block(block, &block->edges, edge);
14955 block->edge_count -= count;
14958 static void idom_block(struct block *idom, struct block *user)
14960 do_use_block(idom, &idom->idominates, user, 0);
14963 static void unidom_block(struct block *idom, struct block *unuser)
14965 do_unuse_block(idom, &idom->idominates, unuser);
14968 static void domf_block(struct block *block, struct block *domf)
14970 do_use_block(block, &block->domfrontier, domf, 0);
14973 static void undomf_block(struct block *block, struct block *undomf)
14975 do_unuse_block(block, &block->domfrontier, undomf);
14978 static void ipdom_block(struct block *ipdom, struct block *user)
14980 do_use_block(ipdom, &ipdom->ipdominates, user, 0);
14983 static void unipdom_block(struct block *ipdom, struct block *unuser)
14985 do_unuse_block(ipdom, &ipdom->ipdominates, unuser);
14988 static void ipdomf_block(struct block *block, struct block *ipdomf)
14990 do_use_block(block, &block->ipdomfrontier, ipdomf, 0);
14993 static void unipdomf_block(struct block *block, struct block *unipdomf)
14995 do_unuse_block(block, &block->ipdomfrontier, unipdomf);
14998 static int walk_triples(
14999 struct compile_state *state,
15000 int (*cb)(struct compile_state *state, struct triple *ptr, void *arg),
15003 struct triple *ptr;
15005 ptr = state->first;
15007 result = cb(state, ptr, arg);
15008 if (ptr->next->prev != ptr) {
15009 internal_error(state, ptr->next, "bad prev");
15012 } while((result == 0) && (ptr != state->first));
15016 #define PRINT_LIST 1
15017 static int do_print_triple(struct compile_state *state, struct triple *ins, void *arg)
15022 if (op == OP_LIST) {
15027 if ((op == OP_LABEL) && (ins->use)) {
15028 fprintf(fp, "\n%p:\n", ins);
15030 display_triple(fp, ins);
15032 if (triple_is_branch(state, ins) && ins->use &&
15033 (ins->op != OP_RET) && (ins->op != OP_FCALL)) {
15034 internal_error(state, ins, "branch used?");
15036 if (triple_is_branch(state, ins)) {
15042 static void print_triples(struct compile_state *state)
15044 if (state->compiler->debug & DEBUG_TRIPLES) {
15045 FILE *fp = state->dbgout;
15046 fprintf(fp, "--------------- triples ---------------\n");
15047 walk_triples(state, do_print_triple, fp);
15053 struct block *block;
15055 static void find_cf_blocks(struct cf_block *cf, struct block *block)
15057 struct block_set *edge;
15058 if (!block || (cf[block->vertex].block == block)) {
15061 cf[block->vertex].block = block;
15062 for(edge = block->edges; edge; edge = edge->next) {
15063 find_cf_blocks(cf, edge->member);
15067 static void print_control_flow(struct compile_state *state,
15068 FILE *fp, struct basic_blocks *bb)
15070 struct cf_block *cf;
15072 fprintf(fp, "\ncontrol flow\n");
15073 cf = xcmalloc(sizeof(*cf) * (bb->last_vertex + 1), "cf_block");
15074 find_cf_blocks(cf, bb->first_block);
15076 for(i = 1; i <= bb->last_vertex; i++) {
15077 struct block *block;
15078 struct block_set *edge;
15079 block = cf[i].block;
15082 fprintf(fp, "(%p) %d:", block, block->vertex);
15083 for(edge = block->edges; edge; edge = edge->next) {
15084 fprintf(fp, " %d", edge->member->vertex);
15092 static void free_basic_block(struct compile_state *state, struct block *block)
15094 struct block_set *edge, *entry;
15095 struct block *child;
15099 if (block->vertex == -1) {
15102 block->vertex = -1;
15103 for(edge = block->edges; edge; edge = edge->next) {
15104 if (edge->member) {
15105 unuse_block(edge->member, block);
15109 unidom_block(block->idom, block);
15112 if (block->ipdom) {
15113 unipdom_block(block->ipdom, block);
15116 while((entry = block->use)) {
15117 child = entry->member;
15118 unuse_block(block, child);
15119 if (child && (child->vertex != -1)) {
15120 for(edge = child->edges; edge; edge = edge->next) {
15125 while((entry = block->idominates)) {
15126 child = entry->member;
15127 unidom_block(block, child);
15128 if (child && (child->vertex != -1)) {
15132 while((entry = block->domfrontier)) {
15133 child = entry->member;
15134 undomf_block(block, child);
15136 while((entry = block->ipdominates)) {
15137 child = entry->member;
15138 unipdom_block(block, child);
15139 if (child && (child->vertex != -1)) {
15143 while((entry = block->ipdomfrontier)) {
15144 child = entry->member;
15145 unipdomf_block(block, child);
15147 if (block->users != 0) {
15148 internal_error(state, 0, "block still has users");
15150 while((edge = block->edges)) {
15151 child = edge->member;
15152 remove_block_edge(block, child);
15154 if (child && (child->vertex != -1)) {
15155 free_basic_block(state, child);
15158 memset(block, -1, sizeof(*block));
15164 static void free_basic_blocks(struct compile_state *state,
15165 struct basic_blocks *bb)
15167 struct triple *first, *ins;
15168 free_basic_block(state, bb->first_block);
15169 bb->last_vertex = 0;
15170 bb->first_block = bb->last_block = 0;
15174 if (triple_stores_block(state, ins)) {
15178 } while(ins != first);
15182 static struct block *basic_block(struct compile_state *state,
15183 struct basic_blocks *bb, struct triple *first)
15185 struct block *block;
15186 struct triple *ptr;
15187 if (!triple_is_label(state, first)) {
15188 internal_error(state, first, "block does not start with a label");
15190 /* See if this basic block has already been setup */
15191 if (first->u.block != 0) {
15192 return first->u.block;
15194 /* Allocate another basic block structure */
15195 bb->last_vertex += 1;
15196 block = xcmalloc(sizeof(*block), "block");
15197 block->first = block->last = first;
15198 block->vertex = bb->last_vertex;
15201 if ((ptr != first) && triple_is_label(state, ptr) && (ptr->use)) {
15205 /* If ptr->u is not used remember where the baic block is */
15206 if (triple_stores_block(state, ptr)) {
15207 ptr->u.block = block;
15209 if (triple_is_branch(state, ptr)) {
15213 } while (ptr != bb->first);
15214 if ((ptr == bb->first) ||
15215 ((ptr->next == bb->first) && (
15216 triple_is_end(state, ptr) ||
15217 triple_is_ret(state, ptr))))
15219 /* The block has no outflowing edges */
15221 else if (triple_is_label(state, ptr)) {
15222 struct block *next;
15223 next = basic_block(state, bb, ptr);
15224 add_block_edge(block, next, 0);
15225 use_block(next, block);
15227 else if (triple_is_branch(state, ptr)) {
15228 struct triple **expr, *first;
15229 struct block *child;
15230 /* Find the branch targets.
15231 * I special case the first branch as that magically
15232 * avoids some difficult cases for the register allocator.
15234 expr = triple_edge_targ(state, ptr, 0);
15236 internal_error(state, ptr, "branch without targets");
15239 expr = triple_edge_targ(state, ptr, expr);
15240 for(; expr; expr = triple_edge_targ(state, ptr, expr)) {
15241 if (!*expr) continue;
15242 child = basic_block(state, bb, *expr);
15243 use_block(child, block);
15244 add_block_edge(block, child, 0);
15247 child = basic_block(state, bb, first);
15248 use_block(child, block);
15249 add_block_edge(block, child, 1);
15251 /* Be certain the return block of a call is
15252 * in a basic block. When it is not find
15253 * start of the block, insert a label if
15254 * necessary and build the basic block.
15255 * Then add a fake edge from the start block
15256 * to the return block of the function.
15258 if (state->functions_joined && triple_is_call(state, ptr)
15259 && !block_of_triple(state, MISC(ptr, 0))) {
15260 struct block *tail;
15261 struct triple *start;
15262 start = triple_to_block_start(state, MISC(ptr, 0));
15263 if (!triple_is_label(state, start)) {
15264 start = pre_triple(state,
15265 start, OP_LABEL, &void_type, 0, 0);
15267 tail = basic_block(state, bb, start);
15268 add_block_edge(child, tail, 0);
15269 use_block(tail, child);
15274 internal_error(state, 0, "Bad basic block split");
15278 struct block_set *edge;
15279 FILE *fp = state->errout;
15280 fprintf(fp, "basic_block: %10p [%2d] ( %10p - %10p )",
15281 block, block->vertex,
15282 block->first, block->last);
15283 for(edge = block->edges; edge; edge = edge->next) {
15284 fprintf(fp, " %10p [%2d]",
15285 edge->member ? edge->member->first : 0,
15286 edge->member ? edge->member->vertex : -1);
15295 static void walk_blocks(struct compile_state *state, struct basic_blocks *bb,
15296 void (*cb)(struct compile_state *state, struct block *block, void *arg),
15299 struct triple *ptr, *first;
15300 struct block *last_block;
15305 if (triple_stores_block(state, ptr)) {
15306 struct block *block;
15307 block = ptr->u.block;
15308 if (block && (block != last_block)) {
15309 cb(state, block, arg);
15311 last_block = block;
15314 } while(ptr != first);
15317 static void print_block(
15318 struct compile_state *state, struct block *block, void *arg)
15320 struct block_set *user, *edge;
15321 struct triple *ptr;
15324 fprintf(fp, "\nblock: %p (%d) ",
15328 for(edge = block->edges; edge; edge = edge->next) {
15329 fprintf(fp, " %p<-%p",
15331 (edge->member && edge->member->use)?
15332 edge->member->use->member : 0);
15335 if (block->first->op == OP_LABEL) {
15336 fprintf(fp, "%p:\n", block->first);
15338 for(ptr = block->first; ; ) {
15339 display_triple(fp, ptr);
15340 if (ptr == block->last)
15343 if (ptr == block->first) {
15344 internal_error(state, 0, "missing block last?");
15347 fprintf(fp, "users %d: ", block->users);
15348 for(user = block->use; user; user = user->next) {
15349 fprintf(fp, "%p (%d) ",
15351 user->member->vertex);
15353 fprintf(fp,"\n\n");
15357 static void romcc_print_blocks(struct compile_state *state, FILE *fp)
15359 fprintf(fp, "--------------- blocks ---------------\n");
15360 walk_blocks(state, &state->bb, print_block, fp);
15362 static void print_blocks(struct compile_state *state, const char *func, FILE *fp)
15364 if (state->compiler->debug & DEBUG_BASIC_BLOCKS) {
15365 fprintf(fp, "After %s\n", func);
15366 romcc_print_blocks(state, fp);
15367 if (state->compiler->debug & DEBUG_FDOMINATORS) {
15368 print_dominators(state, fp, &state->bb);
15369 print_dominance_frontiers(state, fp, &state->bb);
15371 print_control_flow(state, fp, &state->bb);
15375 static void prune_nonblock_triples(struct compile_state *state,
15376 struct basic_blocks *bb)
15378 struct block *block;
15379 struct triple *first, *ins, *next;
15380 /* Delete the triples not in a basic block */
15386 if (ins->op == OP_LABEL) {
15387 block = ins->u.block;
15390 struct triple_set *use;
15391 for(use = ins->use; use; use = use->next) {
15392 struct block *block;
15393 block = block_of_triple(state, use->member);
15395 internal_error(state, ins, "pruning used ins?");
15398 release_triple(state, ins);
15400 if (block && block->last == ins) {
15404 } while(ins != first);
15407 static void setup_basic_blocks(struct compile_state *state,
15408 struct basic_blocks *bb)
15410 if (!triple_stores_block(state, bb->first)) {
15411 internal_error(state, 0, "ins will not store block?");
15413 /* Initialize the state */
15414 bb->first_block = bb->last_block = 0;
15415 bb->last_vertex = 0;
15416 free_basic_blocks(state, bb);
15418 /* Find the basic blocks */
15419 bb->first_block = basic_block(state, bb, bb->first);
15421 /* Be certain the last instruction of a function, or the
15422 * entire program is in a basic block. When it is not find
15423 * the start of the block, insert a label if necessary and build
15424 * basic block. Then add a fake edge from the start block
15425 * to the final block.
15427 if (!block_of_triple(state, bb->first->prev)) {
15428 struct triple *start;
15429 struct block *tail;
15430 start = triple_to_block_start(state, bb->first->prev);
15431 if (!triple_is_label(state, start)) {
15432 start = pre_triple(state,
15433 start, OP_LABEL, &void_type, 0, 0);
15435 tail = basic_block(state, bb, start);
15436 add_block_edge(bb->first_block, tail, 0);
15437 use_block(tail, bb->first_block);
15440 /* Find the last basic block.
15442 bb->last_block = block_of_triple(state, bb->first->prev);
15444 /* Delete the triples not in a basic block */
15445 prune_nonblock_triples(state, bb);
15448 /* If we are debugging print what I have just done */
15449 if (state->compiler->debug & DEBUG_BASIC_BLOCKS) {
15450 print_blocks(state, state->dbgout);
15451 print_control_flow(state, bb);
15457 struct sdom_block {
15458 struct block *block;
15459 struct sdom_block *sdominates;
15460 struct sdom_block *sdom_next;
15461 struct sdom_block *sdom;
15462 struct sdom_block *label;
15463 struct sdom_block *parent;
15464 struct sdom_block *ancestor;
15469 static void unsdom_block(struct sdom_block *block)
15471 struct sdom_block **ptr;
15472 if (!block->sdom_next) {
15475 ptr = &block->sdom->sdominates;
15477 if ((*ptr) == block) {
15478 *ptr = block->sdom_next;
15481 ptr = &(*ptr)->sdom_next;
15485 static void sdom_block(struct sdom_block *sdom, struct sdom_block *block)
15487 unsdom_block(block);
15488 block->sdom = sdom;
15489 block->sdom_next = sdom->sdominates;
15490 sdom->sdominates = block;
15495 static int initialize_sdblock(struct sdom_block *sd,
15496 struct block *parent, struct block *block, int vertex)
15498 struct block_set *edge;
15499 if (!block || (sd[block->vertex].block == block)) {
15503 /* Renumber the blocks in a convinient fashion */
15504 block->vertex = vertex;
15505 sd[vertex].block = block;
15506 sd[vertex].sdom = &sd[vertex];
15507 sd[vertex].label = &sd[vertex];
15508 sd[vertex].parent = parent? &sd[parent->vertex] : 0;
15509 sd[vertex].ancestor = 0;
15510 sd[vertex].vertex = vertex;
15511 for(edge = block->edges; edge; edge = edge->next) {
15512 vertex = initialize_sdblock(sd, block, edge->member, vertex);
15517 static int initialize_spdblock(
15518 struct compile_state *state, struct sdom_block *sd,
15519 struct block *parent, struct block *block, int vertex)
15521 struct block_set *user;
15522 if (!block || (sd[block->vertex].block == block)) {
15526 /* Renumber the blocks in a convinient fashion */
15527 block->vertex = vertex;
15528 sd[vertex].block = block;
15529 sd[vertex].sdom = &sd[vertex];
15530 sd[vertex].label = &sd[vertex];
15531 sd[vertex].parent = parent? &sd[parent->vertex] : 0;
15532 sd[vertex].ancestor = 0;
15533 sd[vertex].vertex = vertex;
15534 for(user = block->use; user; user = user->next) {
15535 vertex = initialize_spdblock(state, sd, block, user->member, vertex);
15540 static int setup_spdblocks(struct compile_state *state,
15541 struct basic_blocks *bb, struct sdom_block *sd)
15543 struct block *block;
15545 /* Setup as many sdpblocks as possible without using fake edges */
15546 vertex = initialize_spdblock(state, sd, 0, bb->last_block, 0);
15548 /* Walk through the graph and find unconnected blocks. Add a
15549 * fake edge from the unconnected blocks to the end of the
15552 block = bb->first_block->last->next->u.block;
15553 for(; block && block != bb->first_block; block = block->last->next->u.block) {
15554 if (sd[block->vertex].block == block) {
15557 #if DEBUG_SDP_BLOCKS
15559 FILE *fp = state->errout;
15560 fprintf(fp, "Adding %d\n", vertex +1);
15563 add_block_edge(block, bb->last_block, 0);
15564 use_block(bb->last_block, block);
15566 vertex = initialize_spdblock(state, sd, bb->last_block, block, vertex);
15571 static void compress_ancestors(struct sdom_block *v)
15573 /* This procedure assumes ancestor(v) != 0 */
15574 /* if (ancestor(ancestor(v)) != 0) {
15575 * compress(ancestor(ancestor(v)));
15576 * if (semi(label(ancestor(v))) < semi(label(v))) {
15577 * label(v) = label(ancestor(v));
15579 * ancestor(v) = ancestor(ancestor(v));
15582 if (!v->ancestor) {
15585 if (v->ancestor->ancestor) {
15586 compress_ancestors(v->ancestor->ancestor);
15587 if (v->ancestor->label->sdom->vertex < v->label->sdom->vertex) {
15588 v->label = v->ancestor->label;
15590 v->ancestor = v->ancestor->ancestor;
15594 static void compute_sdom(struct compile_state *state,
15595 struct basic_blocks *bb, struct sdom_block *sd)
15599 * for each v <= pred(w) {
15601 * if (semi[u] < semi[w] {
15602 * semi[w] = semi[u];
15605 * add w to bucket(vertex(semi[w]));
15606 * LINK(parent(w), w);
15609 * for each v <= bucket(parent(w)) {
15610 * delete v from bucket(parent(w));
15612 * dom(v) = (semi[u] < semi[v]) ? u : parent(w);
15615 for(i = bb->last_vertex; i >= 2; i--) {
15616 struct sdom_block *v, *parent, *next;
15617 struct block_set *user;
15618 struct block *block;
15619 block = sd[i].block;
15620 parent = sd[i].parent;
15622 for(user = block->use; user; user = user->next) {
15623 struct sdom_block *v, *u;
15624 v = &sd[user->member->vertex];
15625 u = !(v->ancestor)? v : (compress_ancestors(v), v->label);
15626 if (u->sdom->vertex < sd[i].sdom->vertex) {
15627 sd[i].sdom = u->sdom;
15630 sdom_block(sd[i].sdom, &sd[i]);
15631 sd[i].ancestor = parent;
15633 for(v = parent->sdominates; v; v = next) {
15634 struct sdom_block *u;
15635 next = v->sdom_next;
15637 u = (!v->ancestor) ? v : (compress_ancestors(v), v->label);
15638 v->block->idom = (u->sdom->vertex < v->sdom->vertex)?
15639 u->block : parent->block;
15644 static void compute_spdom(struct compile_state *state,
15645 struct basic_blocks *bb, struct sdom_block *sd)
15649 * for each v <= pred(w) {
15651 * if (semi[u] < semi[w] {
15652 * semi[w] = semi[u];
15655 * add w to bucket(vertex(semi[w]));
15656 * LINK(parent(w), w);
15659 * for each v <= bucket(parent(w)) {
15660 * delete v from bucket(parent(w));
15662 * dom(v) = (semi[u] < semi[v]) ? u : parent(w);
15665 for(i = bb->last_vertex; i >= 2; i--) {
15666 struct sdom_block *u, *v, *parent, *next;
15667 struct block_set *edge;
15668 struct block *block;
15669 block = sd[i].block;
15670 parent = sd[i].parent;
15672 for(edge = block->edges; edge; edge = edge->next) {
15673 v = &sd[edge->member->vertex];
15674 u = !(v->ancestor)? v : (compress_ancestors(v), v->label);
15675 if (u->sdom->vertex < sd[i].sdom->vertex) {
15676 sd[i].sdom = u->sdom;
15679 sdom_block(sd[i].sdom, &sd[i]);
15680 sd[i].ancestor = parent;
15682 for(v = parent->sdominates; v; v = next) {
15683 struct sdom_block *u;
15684 next = v->sdom_next;
15686 u = (!v->ancestor) ? v : (compress_ancestors(v), v->label);
15687 v->block->ipdom = (u->sdom->vertex < v->sdom->vertex)?
15688 u->block : parent->block;
15693 static void compute_idom(struct compile_state *state,
15694 struct basic_blocks *bb, struct sdom_block *sd)
15697 for(i = 2; i <= bb->last_vertex; i++) {
15698 struct block *block;
15699 block = sd[i].block;
15700 if (block->idom->vertex != sd[i].sdom->vertex) {
15701 block->idom = block->idom->idom;
15703 idom_block(block->idom, block);
15705 sd[1].block->idom = 0;
15708 static void compute_ipdom(struct compile_state *state,
15709 struct basic_blocks *bb, struct sdom_block *sd)
15712 for(i = 2; i <= bb->last_vertex; i++) {
15713 struct block *block;
15714 block = sd[i].block;
15715 if (block->ipdom->vertex != sd[i].sdom->vertex) {
15716 block->ipdom = block->ipdom->ipdom;
15718 ipdom_block(block->ipdom, block);
15720 sd[1].block->ipdom = 0;
15724 * Every vertex of a flowgraph G = (V, E, r) except r has
15725 * a unique immediate dominator.
15726 * The edges {(idom(w), w) |w <= V - {r}} form a directed tree
15727 * rooted at r, called the dominator tree of G, such that
15728 * v dominates w if and only if v is a proper ancestor of w in
15729 * the dominator tree.
15732 * If v and w are vertices of G such that v <= w,
15733 * than any path from v to w must contain a common ancestor
15736 /* Lemma 2: For any vertex w != r, idom(w) -> w */
15737 /* Lemma 3: For any vertex w != r, sdom(w) -> w */
15738 /* Lemma 4: For any vertex w != r, idom(w) -> sdom(w) */
15740 * Let w != r. Suppose every u for which sdom(w) -> u -> w satisfies
15741 * sdom(u) >= sdom(w). Then idom(w) = sdom(w).
15744 * Let w != r and let u be a vertex for which sdom(u) is
15745 * minimum amoung vertices u satisfying sdom(w) -> u -> w.
15746 * Then sdom(u) <= sdom(w) and idom(u) = idom(w).
15748 /* Lemma 5: Let vertices v,w satisfy v -> w.
15749 * Then v -> idom(w) or idom(w) -> idom(v)
15752 static void find_immediate_dominators(struct compile_state *state,
15753 struct basic_blocks *bb)
15755 struct sdom_block *sd;
15756 /* w->sdom = min{v| there is a path v = v0,v1,...,vk = w such that:
15757 * vi > w for (1 <= i <= k - 1}
15760 * For any vertex w != r.
15762 * {v|(v,w) <= E and v < w } U
15763 * {sdom(u) | u > w and there is an edge (v, w) such that u -> v})
15766 * Let w != r and let u be a vertex for which sdom(u) is
15767 * minimum amoung vertices u satisfying sdom(w) -> u -> w.
15769 * { sdom(w) if sdom(w) = sdom(u),
15771 * { idom(u) otherwise
15773 /* The algorithm consists of the following 4 steps.
15774 * Step 1. Carry out a depth-first search of the problem graph.
15775 * Number the vertices from 1 to N as they are reached during
15776 * the search. Initialize the variables used in succeeding steps.
15777 * Step 2. Compute the semidominators of all vertices by applying
15778 * theorem 4. Carry out the computation vertex by vertex in
15779 * decreasing order by number.
15780 * Step 3. Implicitly define the immediate dominator of each vertex
15781 * by applying Corollary 1.
15782 * Step 4. Explicitly define the immediate dominator of each vertex,
15783 * carrying out the computation vertex by vertex in increasing order
15786 /* Step 1 initialize the basic block information */
15787 sd = xcmalloc(sizeof(*sd) * (bb->last_vertex + 1), "sdom_state");
15788 initialize_sdblock(sd, 0, bb->first_block, 0);
15794 /* Step 2 compute the semidominators */
15795 /* Step 3 implicitly define the immediate dominator of each vertex */
15796 compute_sdom(state, bb, sd);
15797 /* Step 4 explicitly define the immediate dominator of each vertex */
15798 compute_idom(state, bb, sd);
15802 static void find_post_dominators(struct compile_state *state,
15803 struct basic_blocks *bb)
15805 struct sdom_block *sd;
15807 /* Step 1 initialize the basic block information */
15808 sd = xcmalloc(sizeof(*sd) * (bb->last_vertex + 1), "sdom_state");
15810 vertex = setup_spdblocks(state, bb, sd);
15811 if (vertex != bb->last_vertex) {
15812 internal_error(state, 0, "missing %d blocks",
15813 bb->last_vertex - vertex);
15816 /* Step 2 compute the semidominators */
15817 /* Step 3 implicitly define the immediate dominator of each vertex */
15818 compute_spdom(state, bb, sd);
15819 /* Step 4 explicitly define the immediate dominator of each vertex */
15820 compute_ipdom(state, bb, sd);
15826 static void find_block_domf(struct compile_state *state, struct block *block)
15828 struct block *child;
15829 struct block_set *user, *edge;
15830 if (block->domfrontier != 0) {
15831 internal_error(state, block->first, "domfrontier present?");
15833 for(user = block->idominates; user; user = user->next) {
15834 child = user->member;
15835 if (child->idom != block) {
15836 internal_error(state, block->first, "bad idom");
15838 find_block_domf(state, child);
15840 for(edge = block->edges; edge; edge = edge->next) {
15841 if (edge->member->idom != block) {
15842 domf_block(block, edge->member);
15845 for(user = block->idominates; user; user = user->next) {
15846 struct block_set *frontier;
15847 child = user->member;
15848 for(frontier = child->domfrontier; frontier; frontier = frontier->next) {
15849 if (frontier->member->idom != block) {
15850 domf_block(block, frontier->member);
15856 static void find_block_ipdomf(struct compile_state *state, struct block *block)
15858 struct block *child;
15859 struct block_set *user;
15860 if (block->ipdomfrontier != 0) {
15861 internal_error(state, block->first, "ipdomfrontier present?");
15863 for(user = block->ipdominates; user; user = user->next) {
15864 child = user->member;
15865 if (child->ipdom != block) {
15866 internal_error(state, block->first, "bad ipdom");
15868 find_block_ipdomf(state, child);
15870 for(user = block->use; user; user = user->next) {
15871 if (user->member->ipdom != block) {
15872 ipdomf_block(block, user->member);
15875 for(user = block->ipdominates; user; user = user->next) {
15876 struct block_set *frontier;
15877 child = user->member;
15878 for(frontier = child->ipdomfrontier; frontier; frontier = frontier->next) {
15879 if (frontier->member->ipdom != block) {
15880 ipdomf_block(block, frontier->member);
15886 static void print_dominated(
15887 struct compile_state *state, struct block *block, void *arg)
15889 struct block_set *user;
15892 fprintf(fp, "%d:", block->vertex);
15893 for(user = block->idominates; user; user = user->next) {
15894 fprintf(fp, " %d", user->member->vertex);
15895 if (user->member->idom != block) {
15896 internal_error(state, user->member->first, "bad idom");
15902 static void print_dominated2(
15903 struct compile_state *state, FILE *fp, int depth, struct block *block)
15905 struct block_set *user;
15906 struct triple *ins;
15907 struct occurance *ptr, *ptr2;
15908 const char *filename1, *filename2;
15909 int equal_filenames;
15911 for(i = 0; i < depth; i++) {
15914 fprintf(fp, "%3d: %p (%p - %p) @",
15915 block->vertex, block, block->first, block->last);
15916 ins = block->first;
15917 while(ins != block->last && (ins->occurance->line == 0)) {
15920 ptr = ins->occurance;
15921 ptr2 = block->last->occurance;
15922 filename1 = ptr->filename? ptr->filename : "";
15923 filename2 = ptr2->filename? ptr2->filename : "";
15924 equal_filenames = (strcmp(filename1, filename2) == 0);
15925 if ((ptr == ptr2) || (equal_filenames && ptr->line == ptr2->line)) {
15926 fprintf(fp, " %s:%d", ptr->filename, ptr->line);
15927 } else if (equal_filenames) {
15928 fprintf(fp, " %s:(%d - %d)",
15929 ptr->filename, ptr->line, ptr2->line);
15931 fprintf(fp, " (%s:%d - %s:%d)",
15932 ptr->filename, ptr->line,
15933 ptr2->filename, ptr2->line);
15936 for(user = block->idominates; user; user = user->next) {
15937 print_dominated2(state, fp, depth + 1, user->member);
15941 static void print_dominators(struct compile_state *state, FILE *fp, struct basic_blocks *bb)
15943 fprintf(fp, "\ndominates\n");
15944 walk_blocks(state, bb, print_dominated, fp);
15945 fprintf(fp, "dominates\n");
15946 print_dominated2(state, fp, 0, bb->first_block);
15950 static int print_frontiers(
15951 struct compile_state *state, FILE *fp, struct block *block, int vertex)
15953 struct block_set *user, *edge;
15955 if (!block || (block->vertex != vertex + 1)) {
15960 fprintf(fp, "%d:", block->vertex);
15961 for(user = block->domfrontier; user; user = user->next) {
15962 fprintf(fp, " %d", user->member->vertex);
15966 for(edge = block->edges; edge; edge = edge->next) {
15967 vertex = print_frontiers(state, fp, edge->member, vertex);
15971 static void print_dominance_frontiers(struct compile_state *state,
15972 FILE *fp, struct basic_blocks *bb)
15974 fprintf(fp, "\ndominance frontiers\n");
15975 print_frontiers(state, fp, bb->first_block, 0);
15979 static void analyze_idominators(struct compile_state *state, struct basic_blocks *bb)
15981 /* Find the immediate dominators */
15982 find_immediate_dominators(state, bb);
15983 /* Find the dominance frontiers */
15984 find_block_domf(state, bb->first_block);
15985 /* If debuging print the print what I have just found */
15986 if (state->compiler->debug & DEBUG_FDOMINATORS) {
15987 print_dominators(state, state->dbgout, bb);
15988 print_dominance_frontiers(state, state->dbgout, bb);
15989 print_control_flow(state, state->dbgout, bb);
15994 static void print_ipdominated(
15995 struct compile_state *state, struct block *block, void *arg)
15997 struct block_set *user;
16000 fprintf(fp, "%d:", block->vertex);
16001 for(user = block->ipdominates; user; user = user->next) {
16002 fprintf(fp, " %d", user->member->vertex);
16003 if (user->member->ipdom != block) {
16004 internal_error(state, user->member->first, "bad ipdom");
16010 static void print_ipdominators(struct compile_state *state, FILE *fp,
16011 struct basic_blocks *bb)
16013 fprintf(fp, "\nipdominates\n");
16014 walk_blocks(state, bb, print_ipdominated, fp);
16017 static int print_pfrontiers(
16018 struct compile_state *state, FILE *fp, struct block *block, int vertex)
16020 struct block_set *user;
16022 if (!block || (block->vertex != vertex + 1)) {
16027 fprintf(fp, "%d:", block->vertex);
16028 for(user = block->ipdomfrontier; user; user = user->next) {
16029 fprintf(fp, " %d", user->member->vertex);
16032 for(user = block->use; user; user = user->next) {
16033 vertex = print_pfrontiers(state, fp, user->member, vertex);
16037 static void print_ipdominance_frontiers(struct compile_state *state,
16038 FILE *fp, struct basic_blocks *bb)
16040 fprintf(fp, "\nipdominance frontiers\n");
16041 print_pfrontiers(state, fp, bb->last_block, 0);
16045 static void analyze_ipdominators(struct compile_state *state,
16046 struct basic_blocks *bb)
16048 /* Find the post dominators */
16049 find_post_dominators(state, bb);
16050 /* Find the control dependencies (post dominance frontiers) */
16051 find_block_ipdomf(state, bb->last_block);
16052 /* If debuging print the print what I have just found */
16053 if (state->compiler->debug & DEBUG_RDOMINATORS) {
16054 print_ipdominators(state, state->dbgout, bb);
16055 print_ipdominance_frontiers(state, state->dbgout, bb);
16056 print_control_flow(state, state->dbgout, bb);
16060 static int bdominates(struct compile_state *state,
16061 struct block *dom, struct block *sub)
16063 while(sub && (sub != dom)) {
16069 static int tdominates(struct compile_state *state,
16070 struct triple *dom, struct triple *sub)
16072 struct block *bdom, *bsub;
16074 bdom = block_of_triple(state, dom);
16075 bsub = block_of_triple(state, sub);
16076 if (bdom != bsub) {
16077 result = bdominates(state, bdom, bsub);
16080 struct triple *ins;
16081 if (!bdom || !bsub) {
16082 internal_error(state, dom, "huh?");
16085 while((ins != bsub->first) && (ins != dom)) {
16088 result = (ins == dom);
16093 static void analyze_basic_blocks(
16094 struct compile_state *state, struct basic_blocks *bb)
16096 setup_basic_blocks(state, bb);
16097 analyze_idominators(state, bb);
16098 analyze_ipdominators(state, bb);
16101 static void insert_phi_operations(struct compile_state *state)
16104 struct triple *first;
16105 int *has_already, *work;
16106 struct block *work_list, **work_list_tail;
16108 struct triple *var, *vnext;
16110 size = sizeof(int) * (state->bb.last_vertex + 1);
16111 has_already = xcmalloc(size, "has_already");
16112 work = xcmalloc(size, "work");
16115 first = state->first;
16116 for(var = first->next; var != first ; var = vnext) {
16117 struct block *block;
16118 struct triple_set *user, *unext;
16121 if (!triple_is_auto_var(state, var) || !var->use) {
16127 work_list_tail = &work_list;
16128 for(user = var->use; user; user = unext) {
16129 unext = user->next;
16130 if (MISC(var, 0) == user->member) {
16133 if (user->member->op == OP_READ) {
16136 if (user->member->op != OP_WRITE) {
16137 internal_error(state, user->member,
16138 "bad variable access");
16140 block = user->member->u.block;
16142 warning(state, user->member, "dead code");
16143 release_triple(state, user->member);
16146 if (work[block->vertex] >= iter) {
16149 work[block->vertex] = iter;
16150 *work_list_tail = block;
16151 block->work_next = 0;
16152 work_list_tail = &block->work_next;
16154 for(block = work_list; block; block = block->work_next) {
16155 struct block_set *df;
16156 for(df = block->domfrontier; df; df = df->next) {
16157 struct triple *phi;
16158 struct block *front;
16160 front = df->member;
16162 if (has_already[front->vertex] >= iter) {
16165 /* Count how many edges flow into this block */
16166 in_edges = front->users;
16167 /* Insert a phi function for this variable */
16168 get_occurance(var->occurance);
16169 phi = alloc_triple(
16170 state, OP_PHI, var->type, -1, in_edges,
16172 phi->u.block = front;
16173 MISC(phi, 0) = var;
16174 use_triple(var, phi);
16176 if (phi->rhs != in_edges) {
16177 internal_error(state, phi, "phi->rhs: %d != in_edges: %d",
16178 phi->rhs, in_edges);
16181 /* Insert the phi functions immediately after the label */
16182 insert_triple(state, front->first->next, phi);
16183 if (front->first == front->last) {
16184 front->last = front->first->next;
16186 has_already[front->vertex] = iter;
16187 transform_to_arch_instruction(state, phi);
16189 /* If necessary plan to visit the basic block */
16190 if (work[front->vertex] >= iter) {
16193 work[front->vertex] = iter;
16194 *work_list_tail = front;
16195 front->work_next = 0;
16196 work_list_tail = &front->work_next;
16200 xfree(has_already);
16206 struct triple_set *top;
16210 static int count_auto_vars(struct compile_state *state)
16212 struct triple *first, *ins;
16214 first = state->first;
16217 if (triple_is_auto_var(state, ins)) {
16221 } while(ins != first);
16225 static void number_auto_vars(struct compile_state *state, struct stack *stacks)
16227 struct triple *first, *ins;
16229 first = state->first;
16232 if (triple_is_auto_var(state, ins)) {
16234 stacks[auto_vars].orig_id = ins->id;
16235 ins->id = auto_vars;
16238 } while(ins != first);
16241 static void restore_auto_vars(struct compile_state *state, struct stack *stacks)
16243 struct triple *first, *ins;
16244 first = state->first;
16247 if (triple_is_auto_var(state, ins)) {
16248 ins->id = stacks[ins->id].orig_id;
16251 } while(ins != first);
16254 static struct triple *peek_triple(struct stack *stacks, struct triple *var)
16256 struct triple_set *head;
16257 struct triple *top_val;
16259 head = stacks[var->id].top;
16261 top_val = head->member;
16266 static void push_triple(struct stack *stacks, struct triple *var, struct triple *val)
16268 struct triple_set *new;
16269 /* Append new to the head of the list,
16270 * it's the only sensible behavoir for a stack.
16272 new = xcmalloc(sizeof(*new), "triple_set");
16274 new->next = stacks[var->id].top;
16275 stacks[var->id].top = new;
16278 static void pop_triple(struct stack *stacks, struct triple *var, struct triple *oldval)
16280 struct triple_set *set, **ptr;
16281 ptr = &stacks[var->id].top;
16284 if (set->member == oldval) {
16287 /* Only free one occurance from the stack */
16300 static void fixup_block_phi_variables(
16301 struct compile_state *state, struct stack *stacks, struct block *parent, struct block *block)
16303 struct block_set *set;
16304 struct triple *ptr;
16306 if (!parent || !block)
16308 /* Find the edge I am coming in on */
16310 for(set = block->use; set; set = set->next, edge++) {
16311 if (set->member == parent) {
16316 internal_error(state, 0, "phi input is not on a control predecessor");
16318 for(ptr = block->first; ; ptr = ptr->next) {
16319 if (ptr->op == OP_PHI) {
16320 struct triple *var, *val, **slot;
16321 var = MISC(ptr, 0);
16323 internal_error(state, ptr, "no var???");
16325 /* Find the current value of the variable */
16326 val = peek_triple(stacks, var);
16327 if (val && ((val->op == OP_WRITE) || (val->op == OP_READ))) {
16328 internal_error(state, val, "bad value in phi");
16330 if (edge >= ptr->rhs) {
16331 internal_error(state, ptr, "edges > phi rhs");
16333 slot = &RHS(ptr, edge);
16334 if ((*slot != 0) && (*slot != val)) {
16335 internal_error(state, ptr, "phi already bound on this edge");
16338 use_triple(val, ptr);
16340 if (ptr == block->last) {
16347 static void rename_block_variables(
16348 struct compile_state *state, struct stack *stacks, struct block *block)
16350 struct block_set *user, *edge;
16351 struct triple *ptr, *next, *last;
16355 last = block->first;
16357 for(ptr = block->first; !done; ptr = next) {
16359 if (ptr == block->last) {
16363 if (ptr->op == OP_READ) {
16364 struct triple *var, *val;
16366 if (!triple_is_auto_var(state, var)) {
16367 internal_error(state, ptr, "read of non auto var!");
16369 unuse_triple(var, ptr);
16370 /* Find the current value of the variable */
16371 val = peek_triple(stacks, var);
16373 /* Let the optimizer at variables that are not initially
16374 * set. But give it a bogus value so things seem to
16375 * work by accident. This is useful for bitfields because
16376 * setting them always involves a read-modify-write.
16378 if (TYPE_ARITHMETIC(ptr->type->type)) {
16379 val = pre_triple(state, ptr, OP_INTCONST, ptr->type, 0, 0);
16380 val->u.cval = 0xdeadbeaf;
16382 val = pre_triple(state, ptr, OP_UNKNOWNVAL, ptr->type, 0, 0);
16386 error(state, ptr, "variable used without being set");
16388 if ((val->op == OP_WRITE) || (val->op == OP_READ)) {
16389 internal_error(state, val, "bad value in read");
16391 propogate_use(state, ptr, val);
16392 release_triple(state, ptr);
16396 if (ptr->op == OP_WRITE) {
16397 struct triple *var, *val, *tval;
16398 var = MISC(ptr, 0);
16399 if (!triple_is_auto_var(state, var)) {
16400 internal_error(state, ptr, "write to non auto var!");
16402 tval = val = RHS(ptr, 0);
16403 if ((val->op == OP_WRITE) || (val->op == OP_READ) ||
16404 triple_is_auto_var(state, val)) {
16405 internal_error(state, ptr, "bad value in write");
16407 /* Insert a cast if the types differ */
16408 if (!is_subset_type(ptr->type, val->type)) {
16409 if (val->op == OP_INTCONST) {
16410 tval = pre_triple(state, ptr, OP_INTCONST, ptr->type, 0, 0);
16411 tval->u.cval = val->u.cval;
16414 tval = pre_triple(state, ptr, OP_CONVERT, ptr->type, val, 0);
16415 use_triple(val, tval);
16417 transform_to_arch_instruction(state, tval);
16418 unuse_triple(val, ptr);
16419 RHS(ptr, 0) = tval;
16420 use_triple(tval, ptr);
16422 propogate_use(state, ptr, tval);
16423 unuse_triple(var, ptr);
16424 /* Push OP_WRITE ptr->right onto a stack of variable uses */
16425 push_triple(stacks, var, tval);
16427 if (ptr->op == OP_PHI) {
16428 struct triple *var;
16429 var = MISC(ptr, 0);
16430 if (!triple_is_auto_var(state, var)) {
16431 internal_error(state, ptr, "phi references non auto var!");
16433 /* Push OP_PHI onto a stack of variable uses */
16434 push_triple(stacks, var, ptr);
16438 block->last = last;
16440 /* Fixup PHI functions in the cf successors */
16441 for(edge = block->edges; edge; edge = edge->next) {
16442 fixup_block_phi_variables(state, stacks, block, edge->member);
16444 /* rename variables in the dominated nodes */
16445 for(user = block->idominates; user; user = user->next) {
16446 rename_block_variables(state, stacks, user->member);
16448 /* pop the renamed variable stack */
16449 last = block->first;
16451 for(ptr = block->first; !done ; ptr = next) {
16453 if (ptr == block->last) {
16456 if (ptr->op == OP_WRITE) {
16457 struct triple *var;
16458 var = MISC(ptr, 0);
16459 /* Pop OP_WRITE ptr->right from the stack of variable uses */
16460 pop_triple(stacks, var, RHS(ptr, 0));
16461 release_triple(state, ptr);
16464 if (ptr->op == OP_PHI) {
16465 struct triple *var;
16466 var = MISC(ptr, 0);
16467 /* Pop OP_WRITE ptr->right from the stack of variable uses */
16468 pop_triple(stacks, var, ptr);
16472 block->last = last;
16475 static void rename_variables(struct compile_state *state)
16477 struct stack *stacks;
16480 /* Allocate stacks for the Variables */
16481 auto_vars = count_auto_vars(state);
16482 stacks = xcmalloc(sizeof(stacks[0])*(auto_vars + 1), "auto var stacks");
16484 /* Give each auto_var a stack */
16485 number_auto_vars(state, stacks);
16487 /* Rename the variables */
16488 rename_block_variables(state, stacks, state->bb.first_block);
16490 /* Remove the stacks from the auto_vars */
16491 restore_auto_vars(state, stacks);
16495 static void prune_block_variables(struct compile_state *state,
16496 struct block *block)
16498 struct block_set *user;
16499 struct triple *next, *ptr;
16503 for(ptr = block->first; !done; ptr = next) {
16504 /* Be extremely careful I am deleting the list
16505 * as I walk trhough it.
16508 if (ptr == block->last) {
16511 if (triple_is_auto_var(state, ptr)) {
16512 struct triple_set *user, *next;
16513 for(user = ptr->use; user; user = next) {
16514 struct triple *use;
16516 use = user->member;
16517 if (MISC(ptr, 0) == user->member) {
16520 if (use->op != OP_PHI) {
16521 internal_error(state, use, "decl still used");
16523 if (MISC(use, 0) != ptr) {
16524 internal_error(state, use, "bad phi use of decl");
16526 unuse_triple(ptr, use);
16529 if ((ptr->u.cval == 0) && (MISC(ptr, 0)->lhs == 1)) {
16530 /* Delete the adecl */
16531 release_triple(state, MISC(ptr, 0));
16532 /* And the piece */
16533 release_triple(state, ptr);
16538 for(user = block->idominates; user; user = user->next) {
16539 prune_block_variables(state, user->member);
16543 struct phi_triple {
16544 struct triple *phi;
16549 static void keep_phi(struct compile_state *state, struct phi_triple *live, struct triple *phi)
16551 struct triple **slot;
16553 if (live[phi->id].alive) {
16556 live[phi->id].alive = 1;
16558 slot = &RHS(phi, 0);
16559 for(i = 0; i < zrhs; i++) {
16560 struct triple *used;
16562 if (used && (used->op == OP_PHI)) {
16563 keep_phi(state, live, used);
16568 static void prune_unused_phis(struct compile_state *state)
16570 struct triple *first, *phi;
16571 struct phi_triple *live;
16574 /* Find the first instruction */
16575 first = state->first;
16577 /* Count how many phi functions I need to process */
16579 for(phi = first->next; phi != first; phi = phi->next) {
16580 if (phi->op == OP_PHI) {
16585 /* Mark them all dead */
16586 live = xcmalloc(sizeof(*live) * (phis + 1), "phi_triple");
16588 for(phi = first->next; phi != first; phi = phi->next) {
16589 if (phi->op != OP_PHI) {
16592 live[phis].alive = 0;
16593 live[phis].orig_id = phi->id;
16594 live[phis].phi = phi;
16599 /* Mark phis alive that are used by non phis */
16600 for(i = 0; i < phis; i++) {
16601 struct triple_set *set;
16602 for(set = live[i].phi->use; !live[i].alive && set; set = set->next) {
16603 if (set->member->op != OP_PHI) {
16604 keep_phi(state, live, live[i].phi);
16610 /* Delete the extraneous phis */
16611 for(i = 0; i < phis; i++) {
16612 struct triple **slot;
16614 if (!live[i].alive) {
16615 release_triple(state, live[i].phi);
16619 slot = &RHS(phi, 0);
16621 for(j = 0; j < zrhs; j++) {
16623 struct triple *unknown;
16624 get_occurance(phi->occurance);
16625 unknown = flatten(state, state->global_pool,
16626 alloc_triple(state, OP_UNKNOWNVAL,
16627 phi->type, 0, 0, phi->occurance));
16629 use_triple(unknown, phi);
16630 transform_to_arch_instruction(state, unknown);
16632 warning(state, phi, "variable not set at index %d on all paths to use", j);
16640 static void transform_to_ssa_form(struct compile_state *state)
16642 insert_phi_operations(state);
16643 rename_variables(state);
16645 prune_block_variables(state, state->bb.first_block);
16646 prune_unused_phis(state);
16648 print_blocks(state, __func__, state->dbgout);
16652 static void clear_vertex(
16653 struct compile_state *state, struct block *block, void *arg)
16655 /* Clear the current blocks vertex and the vertex of all
16656 * of the current blocks neighbors in case there are malformed
16657 * blocks with now instructions at this point.
16659 struct block_set *user, *edge;
16661 for(edge = block->edges; edge; edge = edge->next) {
16662 edge->member->vertex = 0;
16664 for(user = block->use; user; user = user->next) {
16665 user->member->vertex = 0;
16669 static void mark_live_block(
16670 struct compile_state *state, struct block *block, int *next_vertex)
16672 /* See if this is a block that has not been marked */
16673 if (block->vertex != 0) {
16676 block->vertex = *next_vertex;
16678 if (triple_is_branch(state, block->last)) {
16679 struct triple **targ;
16680 targ = triple_edge_targ(state, block->last, 0);
16681 for(; targ; targ = triple_edge_targ(state, block->last, targ)) {
16685 if (!triple_stores_block(state, *targ)) {
16686 internal_error(state, 0, "bad targ");
16688 mark_live_block(state, (*targ)->u.block, next_vertex);
16690 /* Ensure the last block of a function remains alive */
16691 if (triple_is_call(state, block->last)) {
16692 mark_live_block(state, MISC(block->last, 0)->u.block, next_vertex);
16695 else if (block->last->next != state->first) {
16696 struct triple *ins;
16697 ins = block->last->next;
16698 if (!triple_stores_block(state, ins)) {
16699 internal_error(state, 0, "bad block start");
16701 mark_live_block(state, ins->u.block, next_vertex);
16705 static void transform_from_ssa_form(struct compile_state *state)
16707 /* To get out of ssa form we insert moves on the incoming
16708 * edges to blocks containting phi functions.
16710 struct triple *first;
16711 struct triple *phi, *var, *next;
16714 /* Walk the control flow to see which blocks remain alive */
16715 walk_blocks(state, &state->bb, clear_vertex, 0);
16717 mark_live_block(state, state->bb.first_block, &next_vertex);
16719 /* Walk all of the operations to find the phi functions */
16720 first = state->first;
16721 for(phi = first->next; phi != first ; phi = next) {
16722 struct block_set *set;
16723 struct block *block;
16724 struct triple **slot;
16725 struct triple *var;
16726 struct triple_set *use, *use_next;
16727 int edge, writers, readers;
16729 if (phi->op != OP_PHI) {
16733 block = phi->u.block;
16734 slot = &RHS(phi, 0);
16736 /* If this phi is in a dead block just forget it */
16737 if (block->vertex == 0) {
16738 release_triple(state, phi);
16742 /* Forget uses from code in dead blocks */
16743 for(use = phi->use; use; use = use_next) {
16744 struct block *ublock;
16745 struct triple **expr;
16746 use_next = use->next;
16747 ublock = block_of_triple(state, use->member);
16748 if ((use->member == phi) || (ublock->vertex != 0)) {
16751 expr = triple_rhs(state, use->member, 0);
16752 for(; expr; expr = triple_rhs(state, use->member, expr)) {
16753 if (*expr == phi) {
16757 unuse_triple(phi, use->member);
16759 /* A variable to replace the phi function */
16760 if (registers_of(state, phi->type) != 1) {
16761 internal_error(state, phi, "phi->type does not fit in a single register!");
16763 var = post_triple(state, phi, OP_ADECL, phi->type, 0, 0);
16764 var = var->next; /* point at the var */
16766 /* Replaces use of phi with var */
16767 propogate_use(state, phi, var);
16769 /* Count the readers */
16771 for(use = var->use; use; use = use->next) {
16772 if (use->member != MISC(var, 0)) {
16777 /* Walk all of the incoming edges/blocks and insert moves.
16780 for(edge = 0, set = block->use; set; set = set->next, edge++) {
16781 struct block *eblock, *vblock;
16782 struct triple *move;
16783 struct triple *val, *base;
16784 eblock = set->member;
16787 unuse_triple(val, phi);
16788 vblock = block_of_triple(state, val);
16790 /* If we don't have a value that belongs in an OP_WRITE
16793 if (!val || (val == &unknown_triple) || (val == phi)
16794 || (vblock && (vblock->vertex == 0))) {
16797 /* If the value should never occur error */
16799 internal_error(state, val, "no vblock?");
16803 /* If the value occurs in a dead block see if a replacement
16804 * block can be found.
16806 while(eblock && (eblock->vertex == 0)) {
16807 eblock = eblock->idom;
16809 /* If not continue on with the next value. */
16810 if (!eblock || (eblock->vertex == 0)) {
16814 /* If we have an empty incoming block ignore it. */
16815 if (!eblock->first) {
16816 internal_error(state, 0, "empty block?");
16819 /* Make certain the write is placed in the edge block... */
16820 /* Walk through the edge block backwards to find an
16821 * appropriate location for the OP_WRITE.
16823 for(base = eblock->last; base != eblock->first; base = base->prev) {
16824 struct triple **expr;
16825 if (base->op == OP_PIECE) {
16826 base = MISC(base, 0);
16828 if ((base == var) || (base == val)) {
16831 expr = triple_lhs(state, base, 0);
16832 for(; expr; expr = triple_lhs(state, base, expr)) {
16833 if ((*expr) == val) {
16837 expr = triple_rhs(state, base, 0);
16838 for(; expr; expr = triple_rhs(state, base, expr)) {
16839 if ((*expr) == var) {
16845 if (triple_is_branch(state, base)) {
16846 internal_error(state, base,
16847 "Could not insert write to phi");
16849 move = post_triple(state, base, OP_WRITE, var->type, val, var);
16850 use_triple(val, move);
16851 use_triple(var, move);
16854 if (!writers && readers) {
16855 internal_error(state, var, "no value written to in use phi?");
16857 /* If var is not used free it */
16859 release_triple(state, MISC(var, 0));
16860 release_triple(state, var);
16862 /* Release the phi function */
16863 release_triple(state, phi);
16866 /* Walk all of the operations to find the adecls */
16867 for(var = first->next; var != first ; var = var->next) {
16868 struct triple_set *use, *use_next;
16869 if (!triple_is_auto_var(state, var)) {
16873 /* Walk through all of the rhs uses of var and
16874 * replace them with read of var.
16876 for(use = var->use; use; use = use_next) {
16877 struct triple *read, *user;
16878 struct triple **slot;
16880 use_next = use->next;
16881 user = use->member;
16883 /* Generate a read of var */
16884 read = pre_triple(state, user, OP_READ, var->type, var, 0);
16885 use_triple(var, read);
16887 /* Find the rhs uses and see if they need to be replaced */
16890 slot = &RHS(user, 0);
16891 for(i = 0; i < zrhs; i++) {
16892 if (slot[i] == var) {
16897 /* If we did use it cleanup the uses */
16899 unuse_triple(var, user);
16900 use_triple(read, user);
16902 /* If we didn't use it release the extra triple */
16904 release_triple(state, read);
16910 #define HI() if (state->compiler->debug & DEBUG_REBUILD_SSA_FORM) { \
16911 FILE *fp = state->dbgout; \
16912 fprintf(fp, "@ %s:%d\n", __FILE__, __LINE__); romcc_print_blocks(state, fp); \
16915 static void rebuild_ssa_form(struct compile_state *state)
16918 transform_from_ssa_form(state);
16920 state->bb.first = state->first;
16921 free_basic_blocks(state, &state->bb);
16922 analyze_basic_blocks(state, &state->bb);
16924 insert_phi_operations(state);
16926 rename_variables(state);
16929 prune_block_variables(state, state->bb.first_block);
16931 prune_unused_phis(state);
16937 * Register conflict resolution
16938 * =========================================================
16941 static struct reg_info find_def_color(
16942 struct compile_state *state, struct triple *def)
16944 struct triple_set *set;
16945 struct reg_info info;
16946 info.reg = REG_UNSET;
16948 if (!triple_is_def(state, def)) {
16951 info = arch_reg_lhs(state, def, 0);
16952 if (info.reg >= MAX_REGISTERS) {
16953 info.reg = REG_UNSET;
16955 for(set = def->use; set; set = set->next) {
16956 struct reg_info tinfo;
16958 i = find_rhs_use(state, set->member, def);
16962 tinfo = arch_reg_rhs(state, set->member, i);
16963 if (tinfo.reg >= MAX_REGISTERS) {
16964 tinfo.reg = REG_UNSET;
16966 if ((tinfo.reg != REG_UNSET) &&
16967 (info.reg != REG_UNSET) &&
16968 (tinfo.reg != info.reg)) {
16969 internal_error(state, def, "register conflict");
16971 if ((info.regcm & tinfo.regcm) == 0) {
16972 internal_error(state, def, "regcm conflict %x & %x == 0",
16973 info.regcm, tinfo.regcm);
16975 if (info.reg == REG_UNSET) {
16976 info.reg = tinfo.reg;
16978 info.regcm &= tinfo.regcm;
16980 if (info.reg >= MAX_REGISTERS) {
16981 internal_error(state, def, "register out of range");
16986 static struct reg_info find_lhs_pre_color(
16987 struct compile_state *state, struct triple *ins, int index)
16989 struct reg_info info;
16993 if (!zlhs && triple_is_def(state, ins)) {
16996 if (index >= zlhs) {
16997 internal_error(state, ins, "Bad lhs %d", index);
16999 info = arch_reg_lhs(state, ins, index);
17000 for(i = 0; i < zrhs; i++) {
17001 struct reg_info rinfo;
17002 rinfo = arch_reg_rhs(state, ins, i);
17003 if ((info.reg == rinfo.reg) &&
17004 (rinfo.reg >= MAX_REGISTERS)) {
17005 struct reg_info tinfo;
17006 tinfo = find_lhs_pre_color(state, RHS(ins, index), 0);
17007 info.reg = tinfo.reg;
17008 info.regcm &= tinfo.regcm;
17012 if (info.reg >= MAX_REGISTERS) {
17013 info.reg = REG_UNSET;
17018 static struct reg_info find_rhs_post_color(
17019 struct compile_state *state, struct triple *ins, int index);
17021 static struct reg_info find_lhs_post_color(
17022 struct compile_state *state, struct triple *ins, int index)
17024 struct triple_set *set;
17025 struct reg_info info;
17026 struct triple *lhs;
17027 #if DEBUG_TRIPLE_COLOR
17028 fprintf(state->errout, "find_lhs_post_color(%p, %d)\n",
17031 if ((index == 0) && triple_is_def(state, ins)) {
17034 else if (index < ins->lhs) {
17035 lhs = LHS(ins, index);
17038 internal_error(state, ins, "Bad lhs %d", index);
17041 info = arch_reg_lhs(state, ins, index);
17042 if (info.reg >= MAX_REGISTERS) {
17043 info.reg = REG_UNSET;
17045 for(set = lhs->use; set; set = set->next) {
17046 struct reg_info rinfo;
17047 struct triple *user;
17049 user = set->member;
17051 for(i = 0; i < zrhs; i++) {
17052 if (RHS(user, i) != lhs) {
17055 rinfo = find_rhs_post_color(state, user, i);
17056 if ((info.reg != REG_UNSET) &&
17057 (rinfo.reg != REG_UNSET) &&
17058 (info.reg != rinfo.reg)) {
17059 internal_error(state, ins, "register conflict");
17061 if ((info.regcm & rinfo.regcm) == 0) {
17062 internal_error(state, ins, "regcm conflict %x & %x == 0",
17063 info.regcm, rinfo.regcm);
17065 if (info.reg == REG_UNSET) {
17066 info.reg = rinfo.reg;
17068 info.regcm &= rinfo.regcm;
17071 #if DEBUG_TRIPLE_COLOR
17072 fprintf(state->errout, "find_lhs_post_color(%p, %d) -> ( %d, %x)\n",
17073 ins, index, info.reg, info.regcm);
17078 static struct reg_info find_rhs_post_color(
17079 struct compile_state *state, struct triple *ins, int index)
17081 struct reg_info info, rinfo;
17083 #if DEBUG_TRIPLE_COLOR
17084 fprintf(state->errout, "find_rhs_post_color(%p, %d)\n",
17087 rinfo = arch_reg_rhs(state, ins, index);
17089 if (!zlhs && triple_is_def(state, ins)) {
17093 if (info.reg >= MAX_REGISTERS) {
17094 info.reg = REG_UNSET;
17096 for(i = 0; i < zlhs; i++) {
17097 struct reg_info linfo;
17098 linfo = arch_reg_lhs(state, ins, i);
17099 if ((linfo.reg == rinfo.reg) &&
17100 (linfo.reg >= MAX_REGISTERS)) {
17101 struct reg_info tinfo;
17102 tinfo = find_lhs_post_color(state, ins, i);
17103 if (tinfo.reg >= MAX_REGISTERS) {
17104 tinfo.reg = REG_UNSET;
17106 info.regcm &= linfo.regcm;
17107 info.regcm &= tinfo.regcm;
17108 if (info.reg != REG_UNSET) {
17109 internal_error(state, ins, "register conflict");
17111 if (info.regcm == 0) {
17112 internal_error(state, ins, "regcm conflict");
17114 info.reg = tinfo.reg;
17117 #if DEBUG_TRIPLE_COLOR
17118 fprintf(state->errout, "find_rhs_post_color(%p, %d) -> ( %d, %x)\n",
17119 ins, index, info.reg, info.regcm);
17124 static struct reg_info find_lhs_color(
17125 struct compile_state *state, struct triple *ins, int index)
17127 struct reg_info pre, post, info;
17128 #if DEBUG_TRIPLE_COLOR
17129 fprintf(state->errout, "find_lhs_color(%p, %d)\n",
17132 pre = find_lhs_pre_color(state, ins, index);
17133 post = find_lhs_post_color(state, ins, index);
17134 if ((pre.reg != post.reg) &&
17135 (pre.reg != REG_UNSET) &&
17136 (post.reg != REG_UNSET)) {
17137 internal_error(state, ins, "register conflict");
17139 info.regcm = pre.regcm & post.regcm;
17140 info.reg = pre.reg;
17141 if (info.reg == REG_UNSET) {
17142 info.reg = post.reg;
17144 #if DEBUG_TRIPLE_COLOR
17145 fprintf(state->errout, "find_lhs_color(%p, %d) -> ( %d, %x) ... (%d, %x) (%d, %x)\n",
17146 ins, index, info.reg, info.regcm,
17147 pre.reg, pre.regcm, post.reg, post.regcm);
17152 static struct triple *post_copy(struct compile_state *state, struct triple *ins)
17154 struct triple_set *entry, *next;
17155 struct triple *out;
17156 struct reg_info info, rinfo;
17158 info = arch_reg_lhs(state, ins, 0);
17159 out = post_triple(state, ins, OP_COPY, ins->type, ins, 0);
17160 use_triple(RHS(out, 0), out);
17161 /* Get the users of ins to use out instead */
17162 for(entry = ins->use; entry; entry = next) {
17164 next = entry->next;
17165 if (entry->member == out) {
17168 i = find_rhs_use(state, entry->member, ins);
17172 rinfo = arch_reg_rhs(state, entry->member, i);
17173 if ((info.reg == REG_UNNEEDED) && (rinfo.reg == REG_UNNEEDED)) {
17176 replace_rhs_use(state, ins, out, entry->member);
17178 transform_to_arch_instruction(state, out);
17182 static struct triple *typed_pre_copy(
17183 struct compile_state *state, struct type *type, struct triple *ins, int index)
17185 /* Carefully insert enough operations so that I can
17186 * enter any operation with a GPR32.
17189 struct triple **expr;
17191 struct reg_info info;
17193 if (ins->op == OP_PHI) {
17194 internal_error(state, ins, "pre_copy on a phi?");
17196 classes = arch_type_to_regcm(state, type);
17197 info = arch_reg_rhs(state, ins, index);
17198 expr = &RHS(ins, index);
17199 if ((info.regcm & classes) == 0) {
17200 FILE *fp = state->errout;
17201 fprintf(fp, "src_type: ");
17202 name_of(fp, ins->type);
17203 fprintf(fp, "\ndst_type: ");
17206 internal_error(state, ins, "pre_copy with no register classes");
17209 if (!equiv_types(type, (*expr)->type)) {
17212 in = pre_triple(state, ins, op, type, *expr, 0);
17213 unuse_triple(*expr, ins);
17215 use_triple(RHS(in, 0), in);
17216 use_triple(in, ins);
17217 transform_to_arch_instruction(state, in);
17221 static struct triple *pre_copy(
17222 struct compile_state *state, struct triple *ins, int index)
17224 return typed_pre_copy(state, RHS(ins, index)->type, ins, index);
17228 static void insert_copies_to_phi(struct compile_state *state)
17230 /* To get out of ssa form we insert moves on the incoming
17231 * edges to blocks containting phi functions.
17233 struct triple *first;
17234 struct triple *phi;
17236 /* Walk all of the operations to find the phi functions */
17237 first = state->first;
17238 for(phi = first->next; phi != first ; phi = phi->next) {
17239 struct block_set *set;
17240 struct block *block;
17241 struct triple **slot, *copy;
17243 if (phi->op != OP_PHI) {
17246 phi->id |= TRIPLE_FLAG_POST_SPLIT;
17247 block = phi->u.block;
17248 slot = &RHS(phi, 0);
17249 /* Phi's that feed into mandatory live range joins
17250 * cause nasty complications. Insert a copy of
17251 * the phi value so I never have to deal with
17252 * that in the rest of the code.
17254 copy = post_copy(state, phi);
17255 copy->id |= TRIPLE_FLAG_PRE_SPLIT;
17256 /* Walk all of the incoming edges/blocks and insert moves.
17258 for(edge = 0, set = block->use; set; set = set->next, edge++) {
17259 struct block *eblock;
17260 struct triple *move;
17261 struct triple *val;
17262 struct triple *ptr;
17263 eblock = set->member;
17270 get_occurance(val->occurance);
17271 move = build_triple(state, OP_COPY, val->type, val, 0,
17273 move->u.block = eblock;
17274 move->id |= TRIPLE_FLAG_PRE_SPLIT;
17275 use_triple(val, move);
17278 unuse_triple(val, phi);
17279 use_triple(move, phi);
17281 /* Walk up the dominator tree until I have found the appropriate block */
17282 while(eblock && !tdominates(state, val, eblock->last)) {
17283 eblock = eblock->idom;
17286 internal_error(state, phi, "Cannot find block dominated by %p",
17290 /* Walk through the block backwards to find
17291 * an appropriate location for the OP_COPY.
17293 for(ptr = eblock->last; ptr != eblock->first; ptr = ptr->prev) {
17294 struct triple **expr;
17295 if (ptr->op == OP_PIECE) {
17296 ptr = MISC(ptr, 0);
17298 if ((ptr == phi) || (ptr == val)) {
17301 expr = triple_lhs(state, ptr, 0);
17302 for(;expr; expr = triple_lhs(state, ptr, expr)) {
17303 if ((*expr) == val) {
17307 expr = triple_rhs(state, ptr, 0);
17308 for(;expr; expr = triple_rhs(state, ptr, expr)) {
17309 if ((*expr) == phi) {
17315 if (triple_is_branch(state, ptr)) {
17316 internal_error(state, ptr,
17317 "Could not insert write to phi");
17319 insert_triple(state, after_lhs(state, ptr), move);
17320 if (eblock->last == after_lhs(state, ptr)->prev) {
17321 eblock->last = move;
17323 transform_to_arch_instruction(state, move);
17326 print_blocks(state, __func__, state->dbgout);
17329 struct triple_reg_set;
17333 static int do_triple_set(struct triple_reg_set **head,
17334 struct triple *member, struct triple *new_member)
17336 struct triple_reg_set **ptr, *new;
17341 if ((*ptr)->member == member) {
17344 ptr = &(*ptr)->next;
17346 new = xcmalloc(sizeof(*new), "triple_set");
17347 new->member = member;
17348 new->new = new_member;
17354 static void do_triple_unset(struct triple_reg_set **head, struct triple *member)
17356 struct triple_reg_set *entry, **ptr;
17360 if (entry->member == member) {
17361 *ptr = entry->next;
17366 ptr = &entry->next;
17371 static int in_triple(struct reg_block *rb, struct triple *in)
17373 return do_triple_set(&rb->in, in, 0);
17376 #if DEBUG_ROMCC_WARNING
17377 static void unin_triple(struct reg_block *rb, struct triple *unin)
17379 do_triple_unset(&rb->in, unin);
17383 static int out_triple(struct reg_block *rb, struct triple *out)
17385 return do_triple_set(&rb->out, out, 0);
17387 #if DEBUG_ROMCC_WARNING
17388 static void unout_triple(struct reg_block *rb, struct triple *unout)
17390 do_triple_unset(&rb->out, unout);
17394 static int initialize_regblock(struct reg_block *blocks,
17395 struct block *block, int vertex)
17397 struct block_set *user;
17398 if (!block || (blocks[block->vertex].block == block)) {
17402 /* Renumber the blocks in a convinient fashion */
17403 block->vertex = vertex;
17404 blocks[vertex].block = block;
17405 blocks[vertex].vertex = vertex;
17406 for(user = block->use; user; user = user->next) {
17407 vertex = initialize_regblock(blocks, user->member, vertex);
17412 static struct triple *part_to_piece(struct compile_state *state, struct triple *ins)
17414 /* Part to piece is a best attempt and it cannot be correct all by
17415 * itself. If various values are read as different sizes in different
17416 * parts of the code this function cannot work. Or rather it cannot
17417 * work in conjunction with compute_variable_liftimes. As the
17418 * analysis will get confused.
17420 struct triple *base;
17422 if (!is_lvalue(state, ins)) {
17427 while(ins && triple_is_part(state, ins) && (ins->op != OP_PIECE)) {
17428 base = MISC(ins, 0);
17431 reg += index_reg_offset(state, base->type, ins->u.cval)/REG_SIZEOF_REG;
17434 reg += field_reg_offset(state, base->type, ins->u.field)/REG_SIZEOF_REG;
17437 internal_error(state, ins, "unhandled part");
17443 if (reg > base->lhs) {
17444 internal_error(state, base, "part out of range?");
17446 ins = LHS(base, reg);
17451 static int this_def(struct compile_state *state,
17452 struct triple *ins, struct triple *other)
17454 if (ins == other) {
17457 if (ins->op == OP_WRITE) {
17458 ins = part_to_piece(state, MISC(ins, 0));
17460 return ins == other;
17463 static int phi_in(struct compile_state *state, struct reg_block *blocks,
17464 struct reg_block *rb, struct block *suc)
17466 /* Read the conditional input set of a successor block
17467 * (i.e. the input to the phi nodes) and place it in the
17468 * current blocks output set.
17470 struct block_set *set;
17471 struct triple *ptr;
17475 /* Find the edge I am coming in on */
17476 for(edge = 0, set = suc->use; set; set = set->next, edge++) {
17477 if (set->member == rb->block) {
17482 internal_error(state, 0, "Not coming on a control edge?");
17484 for(done = 0, ptr = suc->first; !done; ptr = ptr->next) {
17485 struct triple **slot, *expr, *ptr2;
17486 int out_change, done2;
17487 done = (ptr == suc->last);
17488 if (ptr->op != OP_PHI) {
17491 slot = &RHS(ptr, 0);
17493 out_change = out_triple(rb, expr);
17497 /* If we don't define the variable also plast it
17498 * in the current blocks input set.
17500 ptr2 = rb->block->first;
17501 for(done2 = 0; !done2; ptr2 = ptr2->next) {
17502 if (this_def(state, ptr2, expr)) {
17505 done2 = (ptr2 == rb->block->last);
17510 change |= in_triple(rb, expr);
17515 static int reg_in(struct compile_state *state, struct reg_block *blocks,
17516 struct reg_block *rb, struct block *suc)
17518 struct triple_reg_set *in_set;
17521 /* Read the input set of a successor block
17522 * and place it in the current blocks output set.
17524 in_set = blocks[suc->vertex].in;
17525 for(; in_set; in_set = in_set->next) {
17526 int out_change, done;
17527 struct triple *first, *last, *ptr;
17528 out_change = out_triple(rb, in_set->member);
17532 /* If we don't define the variable also place it
17533 * in the current blocks input set.
17535 first = rb->block->first;
17536 last = rb->block->last;
17538 for(ptr = first; !done; ptr = ptr->next) {
17539 if (this_def(state, ptr, in_set->member)) {
17542 done = (ptr == last);
17547 change |= in_triple(rb, in_set->member);
17549 change |= phi_in(state, blocks, rb, suc);
17553 static int use_in(struct compile_state *state, struct reg_block *rb)
17555 /* Find the variables we use but don't define and add
17556 * it to the current blocks input set.
17558 #if DEBUG_ROMCC_WARNINGS
17559 #warning "FIXME is this O(N^2) algorithm bad?"
17561 struct block *block;
17562 struct triple *ptr;
17567 for(done = 0, ptr = block->last; !done; ptr = ptr->prev) {
17568 struct triple **expr;
17569 done = (ptr == block->first);
17570 /* The variable a phi function uses depends on the
17571 * control flow, and is handled in phi_in, not
17574 if (ptr->op == OP_PHI) {
17577 expr = triple_rhs(state, ptr, 0);
17578 for(;expr; expr = triple_rhs(state, ptr, expr)) {
17579 struct triple *rhs, *test;
17581 rhs = part_to_piece(state, *expr);
17586 /* See if rhs is defined in this block.
17587 * A write counts as a definition.
17589 for(tdone = 0, test = ptr; !tdone; test = test->prev) {
17590 tdone = (test == block->first);
17591 if (this_def(state, test, rhs)) {
17596 /* If I still have a valid rhs add it to in */
17597 change |= in_triple(rb, rhs);
17603 static struct reg_block *compute_variable_lifetimes(
17604 struct compile_state *state, struct basic_blocks *bb)
17606 struct reg_block *blocks;
17609 sizeof(*blocks)*(bb->last_vertex + 1), "reg_block");
17610 initialize_regblock(blocks, bb->last_block, 0);
17614 for(i = 1; i <= bb->last_vertex; i++) {
17615 struct block_set *edge;
17616 struct reg_block *rb;
17618 /* Add the all successor's input set to in */
17619 for(edge = rb->block->edges; edge; edge = edge->next) {
17620 change |= reg_in(state, blocks, rb, edge->member);
17622 /* Add use to in... */
17623 change |= use_in(state, rb);
17629 static void free_variable_lifetimes(struct compile_state *state,
17630 struct basic_blocks *bb, struct reg_block *blocks)
17633 /* free in_set && out_set on each block */
17634 for(i = 1; i <= bb->last_vertex; i++) {
17635 struct triple_reg_set *entry, *next;
17636 struct reg_block *rb;
17638 for(entry = rb->in; entry ; entry = next) {
17639 next = entry->next;
17640 do_triple_unset(&rb->in, entry->member);
17642 for(entry = rb->out; entry; entry = next) {
17643 next = entry->next;
17644 do_triple_unset(&rb->out, entry->member);
17651 typedef void (*wvl_cb_t)(
17652 struct compile_state *state,
17653 struct reg_block *blocks, struct triple_reg_set *live,
17654 struct reg_block *rb, struct triple *ins, void *arg);
17656 static void walk_variable_lifetimes(struct compile_state *state,
17657 struct basic_blocks *bb, struct reg_block *blocks,
17658 wvl_cb_t cb, void *arg)
17662 for(i = 1; i <= state->bb.last_vertex; i++) {
17663 struct triple_reg_set *live;
17664 struct triple_reg_set *entry, *next;
17665 struct triple *ptr, *prev;
17666 struct reg_block *rb;
17667 struct block *block;
17670 /* Get the blocks */
17674 /* Copy out into live */
17676 for(entry = rb->out; entry; entry = next) {
17677 next = entry->next;
17678 do_triple_set(&live, entry->member, entry->new);
17680 /* Walk through the basic block calculating live */
17681 for(done = 0, ptr = block->last; !done; ptr = prev) {
17682 struct triple **expr;
17685 done = (ptr == block->first);
17687 /* Ensure the current definition is in live */
17688 if (triple_is_def(state, ptr)) {
17689 do_triple_set(&live, ptr, 0);
17692 /* Inform the callback function of what is
17695 cb(state, blocks, live, rb, ptr, arg);
17697 /* Remove the current definition from live */
17698 do_triple_unset(&live, ptr);
17700 /* Add the current uses to live.
17702 * It is safe to skip phi functions because they do
17703 * not have any block local uses, and the block
17704 * output sets already properly account for what
17705 * control flow depedent uses phi functions do have.
17707 if (ptr->op == OP_PHI) {
17710 expr = triple_rhs(state, ptr, 0);
17711 for(;expr; expr = triple_rhs(state, ptr, expr)) {
17712 /* If the triple is not a definition skip it. */
17713 if (!*expr || !triple_is_def(state, *expr)) {
17716 do_triple_set(&live, *expr, 0);
17720 for(entry = live; entry; entry = next) {
17721 next = entry->next;
17722 do_triple_unset(&live, entry->member);
17727 struct print_live_variable_info {
17728 struct reg_block *rb;
17731 #if DEBUG_EXPLICIT_CLOSURES
17732 static void print_live_variables_block(
17733 struct compile_state *state, struct block *block, void *arg)
17736 struct print_live_variable_info *info = arg;
17737 struct block_set *edge;
17738 FILE *fp = info->fp;
17739 struct reg_block *rb;
17740 struct triple *ptr;
17743 rb = &info->rb[block->vertex];
17745 fprintf(fp, "\nblock: %p (%d),",
17746 block, block->vertex);
17747 for(edge = block->edges; edge; edge = edge->next) {
17748 fprintf(fp, " %p<-%p",
17750 edge->member && edge->member->use?edge->member->use->member : 0);
17754 struct triple_reg_set *in_set;
17755 fprintf(fp, " in:");
17756 for(in_set = rb->in; in_set; in_set = in_set->next) {
17757 fprintf(fp, " %-10p", in_set->member);
17762 for(done = 0, ptr = block->first; !done; ptr = ptr->next) {
17763 done = (ptr == block->last);
17764 if (ptr->op == OP_PHI) {
17771 for(edge = 0; edge < block->users; edge++) {
17772 fprintf(fp, " in(%d):", edge);
17773 for(done = 0, ptr = block->first; !done; ptr = ptr->next) {
17774 struct triple **slot;
17775 done = (ptr == block->last);
17776 if (ptr->op != OP_PHI) {
17779 slot = &RHS(ptr, 0);
17780 fprintf(fp, " %-10p", slot[edge]);
17785 if (block->first->op == OP_LABEL) {
17786 fprintf(fp, "%p:\n", block->first);
17788 for(done = 0, ptr = block->first; !done; ptr = ptr->next) {
17789 done = (ptr == block->last);
17790 display_triple(fp, ptr);
17793 struct triple_reg_set *out_set;
17794 fprintf(fp, " out:");
17795 for(out_set = rb->out; out_set; out_set = out_set->next) {
17796 fprintf(fp, " %-10p", out_set->member);
17803 static void print_live_variables(struct compile_state *state,
17804 struct basic_blocks *bb, struct reg_block *rb, FILE *fp)
17806 struct print_live_variable_info info;
17809 fprintf(fp, "\nlive variables by block\n");
17810 walk_blocks(state, bb, print_live_variables_block, &info);
17815 static int count_triples(struct compile_state *state)
17817 struct triple *first, *ins;
17819 first = state->first;
17824 } while (ins != first);
17829 struct dead_triple {
17830 struct triple *triple;
17831 struct dead_triple *work_next;
17832 struct block *block;
17835 #define TRIPLE_FLAG_ALIVE 1
17836 #define TRIPLE_FLAG_FREE 1
17839 static void print_dead_triples(struct compile_state *state,
17840 struct dead_triple *dtriple)
17842 struct triple *first, *ins;
17843 struct dead_triple *dt;
17845 if (!(state->compiler->debug & DEBUG_TRIPLES)) {
17848 fp = state->dbgout;
17849 fprintf(fp, "--------------- dtriples ---------------\n");
17850 first = state->first;
17853 dt = &dtriple[ins->id];
17854 if ((ins->op == OP_LABEL) && (ins->use)) {
17855 fprintf(fp, "\n%p:\n", ins);
17858 (dt->flags & TRIPLE_FLAG_ALIVE)?' ': '-');
17859 display_triple(fp, ins);
17860 if (triple_is_branch(state, ins)) {
17864 } while(ins != first);
17869 static void awaken(
17870 struct compile_state *state,
17871 struct dead_triple *dtriple, struct triple **expr,
17872 struct dead_triple ***work_list_tail)
17874 struct triple *triple;
17875 struct dead_triple *dt;
17883 if (triple->id <= 0) {
17884 internal_error(state, triple, "bad triple id: %d",
17887 if (triple->op == OP_NOOP) {
17888 internal_error(state, triple, "awakening noop?");
17891 dt = &dtriple[triple->id];
17892 if (!(dt->flags & TRIPLE_FLAG_ALIVE)) {
17893 dt->flags |= TRIPLE_FLAG_ALIVE;
17894 if (!dt->work_next) {
17895 **work_list_tail = dt;
17896 *work_list_tail = &dt->work_next;
17901 static void eliminate_inefectual_code(struct compile_state *state)
17903 struct dead_triple *dtriple, *work_list, **work_list_tail, *dt;
17905 struct triple *first, *ins;
17907 if (!(state->compiler->flags & COMPILER_ELIMINATE_INEFECTUAL_CODE)) {
17911 /* Setup the work list */
17913 work_list_tail = &work_list;
17915 first = state->first;
17917 /* Count how many triples I have */
17918 triples = count_triples(state);
17920 /* Now put then in an array and mark all of the triples dead */
17921 dtriple = xcmalloc(sizeof(*dtriple) * (triples + 1), "dtriples");
17926 dtriple[i].triple = ins;
17927 dtriple[i].block = block_of_triple(state, ins);
17928 dtriple[i].flags = 0;
17929 dtriple[i].old_id = ins->id;
17931 /* See if it is an operation we always keep */
17932 if (!triple_is_pure(state, ins, dtriple[i].old_id)) {
17933 awaken(state, dtriple, &ins, &work_list_tail);
17937 } while(ins != first);
17939 struct block *block;
17940 struct dead_triple *dt;
17941 struct block_set *user;
17942 struct triple **expr;
17944 work_list = dt->work_next;
17946 work_list_tail = &work_list;
17948 /* Make certain the block the current instruction is in lives */
17949 block = block_of_triple(state, dt->triple);
17950 awaken(state, dtriple, &block->first, &work_list_tail);
17951 if (triple_is_branch(state, block->last)) {
17952 awaken(state, dtriple, &block->last, &work_list_tail);
17954 awaken(state, dtriple, &block->last->next, &work_list_tail);
17957 /* Wake up the data depencencies of this triple */
17960 expr = triple_rhs(state, dt->triple, expr);
17961 awaken(state, dtriple, expr, &work_list_tail);
17964 expr = triple_lhs(state, dt->triple, expr);
17965 awaken(state, dtriple, expr, &work_list_tail);
17968 expr = triple_misc(state, dt->triple, expr);
17969 awaken(state, dtriple, expr, &work_list_tail);
17971 /* Wake up the forward control dependencies */
17973 expr = triple_targ(state, dt->triple, expr);
17974 awaken(state, dtriple, expr, &work_list_tail);
17976 /* Wake up the reverse control dependencies of this triple */
17977 for(user = dt->block->ipdomfrontier; user; user = user->next) {
17978 struct triple *last;
17979 last = user->member->last;
17980 while((last->op == OP_NOOP) && (last != user->member->first)) {
17981 #if DEBUG_ROMCC_WARNINGS
17982 #warning "Should we bring the awakening noops back?"
17984 // internal_warning(state, last, "awakening noop?");
17987 awaken(state, dtriple, &last, &work_list_tail);
17990 print_dead_triples(state, dtriple);
17991 for(dt = &dtriple[1]; dt <= &dtriple[triples]; dt++) {
17992 if ((dt->triple->op == OP_NOOP) &&
17993 (dt->flags & TRIPLE_FLAG_ALIVE)) {
17994 internal_error(state, dt->triple, "noop effective?");
17996 dt->triple->id = dt->old_id; /* Restore the color */
17997 if (!(dt->flags & TRIPLE_FLAG_ALIVE)) {
17998 release_triple(state, dt->triple);
18003 rebuild_ssa_form(state);
18005 print_blocks(state, __func__, state->dbgout);
18009 static void insert_mandatory_copies(struct compile_state *state)
18011 struct triple *ins, *first;
18013 /* The object is with a minimum of inserted copies,
18014 * to resolve in fundamental register conflicts between
18015 * register value producers and consumers.
18016 * Theoretically we may be greater than minimal when we
18017 * are inserting copies before instructions but that
18018 * case should be rare.
18020 first = state->first;
18023 struct triple_set *entry, *next;
18024 struct triple *tmp;
18025 struct reg_info info;
18026 unsigned reg, regcm;
18027 int do_post_copy, do_pre_copy;
18029 if (!triple_is_def(state, ins)) {
18032 /* Find the architecture specific color information */
18033 info = find_lhs_pre_color(state, ins, 0);
18034 if (info.reg >= MAX_REGISTERS) {
18035 info.reg = REG_UNSET;
18039 regcm = arch_type_to_regcm(state, ins->type);
18040 do_post_copy = do_pre_copy = 0;
18042 /* Walk through the uses of ins and check for conflicts */
18043 for(entry = ins->use; entry; entry = next) {
18044 struct reg_info rinfo;
18046 next = entry->next;
18047 i = find_rhs_use(state, entry->member, ins);
18052 /* Find the users color requirements */
18053 rinfo = arch_reg_rhs(state, entry->member, i);
18054 if (rinfo.reg >= MAX_REGISTERS) {
18055 rinfo.reg = REG_UNSET;
18058 /* See if I need a pre_copy */
18059 if (rinfo.reg != REG_UNSET) {
18060 if ((reg != REG_UNSET) && (reg != rinfo.reg)) {
18065 regcm &= rinfo.regcm;
18066 regcm = arch_regcm_normalize(state, regcm);
18070 /* Always use pre_copies for constants.
18071 * They do not take up any registers until a
18072 * copy places them in one.
18074 if ((info.reg == REG_UNNEEDED) &&
18075 (rinfo.reg != REG_UNNEEDED)) {
18081 (((info.reg != REG_UNSET) &&
18082 (reg != REG_UNSET) &&
18083 (info.reg != reg)) ||
18084 ((info.regcm & regcm) == 0));
18087 regcm = info.regcm;
18088 /* Walk through the uses of ins and do a pre_copy or see if a post_copy is warranted */
18089 for(entry = ins->use; entry; entry = next) {
18090 struct reg_info rinfo;
18092 next = entry->next;
18093 i = find_rhs_use(state, entry->member, ins);
18098 /* Find the users color requirements */
18099 rinfo = arch_reg_rhs(state, entry->member, i);
18100 if (rinfo.reg >= MAX_REGISTERS) {
18101 rinfo.reg = REG_UNSET;
18104 /* Now see if it is time to do the pre_copy */
18105 if (rinfo.reg != REG_UNSET) {
18106 if (((reg != REG_UNSET) && (reg != rinfo.reg)) ||
18107 ((regcm & rinfo.regcm) == 0) ||
18108 /* Don't let a mandatory coalesce sneak
18109 * into a operation that is marked to prevent
18112 ((reg != REG_UNNEEDED) &&
18113 ((ins->id & TRIPLE_FLAG_POST_SPLIT) ||
18114 (entry->member->id & TRIPLE_FLAG_PRE_SPLIT)))
18117 struct triple *user;
18118 user = entry->member;
18119 if (RHS(user, i) != ins) {
18120 internal_error(state, user, "bad rhs");
18122 tmp = pre_copy(state, user, i);
18123 tmp->id |= TRIPLE_FLAG_PRE_SPLIT;
18131 if ((regcm & rinfo.regcm) == 0) {
18133 struct triple *user;
18134 user = entry->member;
18135 if (RHS(user, i) != ins) {
18136 internal_error(state, user, "bad rhs");
18138 tmp = pre_copy(state, user, i);
18139 tmp->id |= TRIPLE_FLAG_PRE_SPLIT;
18145 regcm &= rinfo.regcm;
18148 if (do_post_copy) {
18149 struct reg_info pre, post;
18150 tmp = post_copy(state, ins);
18151 tmp->id |= TRIPLE_FLAG_PRE_SPLIT;
18152 pre = arch_reg_lhs(state, ins, 0);
18153 post = arch_reg_lhs(state, tmp, 0);
18154 if ((pre.reg == post.reg) && (pre.regcm == post.regcm)) {
18155 internal_error(state, tmp, "useless copy");
18160 } while(ins != first);
18162 print_blocks(state, __func__, state->dbgout);
18166 struct live_range_edge;
18167 struct live_range_def;
18168 struct live_range {
18169 struct live_range_edge *edges;
18170 struct live_range_def *defs;
18171 /* Note. The list pointed to by defs is kept in order.
18172 * That is baring splits in the flow control
18173 * defs dominates defs->next wich dominates defs->next->next
18180 struct live_range *group_next, **group_prev;
18183 struct live_range_edge {
18184 struct live_range_edge *next;
18185 struct live_range *node;
18188 struct live_range_def {
18189 struct live_range_def *next;
18190 struct live_range_def *prev;
18191 struct live_range *lr;
18192 struct triple *def;
18196 #define LRE_HASH_SIZE 2048
18198 struct lre_hash *next;
18199 struct live_range *left;
18200 struct live_range *right;
18205 struct lre_hash *hash[LRE_HASH_SIZE];
18206 struct reg_block *blocks;
18207 struct live_range_def *lrd;
18208 struct live_range *lr;
18209 struct live_range *low, **low_tail;
18210 struct live_range *high, **high_tail;
18213 int passes, max_passes;
18217 struct print_interference_block_info {
18218 struct reg_state *rstate;
18222 static void print_interference_block(
18223 struct compile_state *state, struct block *block, void *arg)
18226 struct print_interference_block_info *info = arg;
18227 struct reg_state *rstate = info->rstate;
18228 struct block_set *edge;
18229 FILE *fp = info->fp;
18230 struct reg_block *rb;
18231 struct triple *ptr;
18234 rb = &rstate->blocks[block->vertex];
18236 fprintf(fp, "\nblock: %p (%d),",
18237 block, block->vertex);
18238 for(edge = block->edges; edge; edge = edge->next) {
18239 fprintf(fp, " %p<-%p",
18241 edge->member && edge->member->use?edge->member->use->member : 0);
18245 struct triple_reg_set *in_set;
18246 fprintf(fp, " in:");
18247 for(in_set = rb->in; in_set; in_set = in_set->next) {
18248 fprintf(fp, " %-10p", in_set->member);
18253 for(done = 0, ptr = block->first; !done; ptr = ptr->next) {
18254 done = (ptr == block->last);
18255 if (ptr->op == OP_PHI) {
18262 for(edge = 0; edge < block->users; edge++) {
18263 fprintf(fp, " in(%d):", edge);
18264 for(done = 0, ptr = block->first; !done; ptr = ptr->next) {
18265 struct triple **slot;
18266 done = (ptr == block->last);
18267 if (ptr->op != OP_PHI) {
18270 slot = &RHS(ptr, 0);
18271 fprintf(fp, " %-10p", slot[edge]);
18276 if (block->first->op == OP_LABEL) {
18277 fprintf(fp, "%p:\n", block->first);
18279 for(done = 0, ptr = block->first; !done; ptr = ptr->next) {
18280 struct live_range *lr;
18282 done = (ptr == block->last);
18283 lr = rstate->lrd[ptr->id].lr;
18286 ptr->id = rstate->lrd[id].orig_id;
18287 SET_REG(ptr->id, lr->color);
18288 display_triple(fp, ptr);
18291 if (triple_is_def(state, ptr) && (lr->defs == 0)) {
18292 internal_error(state, ptr, "lr has no defs!");
18294 if (info->need_edges) {
18296 struct live_range_def *lrd;
18297 fprintf(fp, " range:");
18300 fprintf(fp, " %-10p", lrd->def);
18302 } while(lrd != lr->defs);
18305 if (lr->edges > 0) {
18306 struct live_range_edge *edge;
18307 fprintf(fp, " edges:");
18308 for(edge = lr->edges; edge; edge = edge->next) {
18309 struct live_range_def *lrd;
18310 lrd = edge->node->defs;
18312 fprintf(fp, " %-10p", lrd->def);
18314 } while(lrd != edge->node->defs);
18320 /* Do a bunch of sanity checks */
18321 valid_ins(state, ptr);
18322 if ((ptr->id < 0) || (ptr->id > rstate->defs)) {
18323 internal_error(state, ptr, "Invalid triple id: %d",
18328 struct triple_reg_set *out_set;
18329 fprintf(fp, " out:");
18330 for(out_set = rb->out; out_set; out_set = out_set->next) {
18331 fprintf(fp, " %-10p", out_set->member);
18338 static void print_interference_blocks(
18339 struct compile_state *state, struct reg_state *rstate, FILE *fp, int need_edges)
18341 struct print_interference_block_info info;
18342 info.rstate = rstate;
18344 info.need_edges = need_edges;
18345 fprintf(fp, "\nlive variables by block\n");
18346 walk_blocks(state, &state->bb, print_interference_block, &info);
18350 static unsigned regc_max_size(struct compile_state *state, int classes)
18355 for(i = 0; i < MAX_REGC; i++) {
18356 if (classes & (1 << i)) {
18358 size = arch_regc_size(state, i);
18359 if (size > max_size) {
18367 static int reg_is_reg(struct compile_state *state, int reg1, int reg2)
18369 unsigned equivs[MAX_REG_EQUIVS];
18371 if ((reg1 < 0) || (reg1 >= MAX_REGISTERS)) {
18372 internal_error(state, 0, "invalid register");
18374 if ((reg2 < 0) || (reg2 >= MAX_REGISTERS)) {
18375 internal_error(state, 0, "invalid register");
18377 arch_reg_equivs(state, equivs, reg1);
18378 for(i = 0; (i < MAX_REG_EQUIVS) && equivs[i] != REG_UNSET; i++) {
18379 if (equivs[i] == reg2) {
18386 static void reg_fill_used(struct compile_state *state, char *used, int reg)
18388 unsigned equivs[MAX_REG_EQUIVS];
18390 if (reg == REG_UNNEEDED) {
18393 arch_reg_equivs(state, equivs, reg);
18394 for(i = 0; (i < MAX_REG_EQUIVS) && equivs[i] != REG_UNSET; i++) {
18395 used[equivs[i]] = 1;
18400 static void reg_inc_used(struct compile_state *state, char *used, int reg)
18402 unsigned equivs[MAX_REG_EQUIVS];
18404 if (reg == REG_UNNEEDED) {
18407 arch_reg_equivs(state, equivs, reg);
18408 for(i = 0; (i < MAX_REG_EQUIVS) && equivs[i] != REG_UNSET; i++) {
18409 used[equivs[i]] += 1;
18414 static unsigned int hash_live_edge(
18415 struct live_range *left, struct live_range *right)
18417 unsigned int hash, val;
18418 unsigned long lval, rval;
18419 lval = ((unsigned long)left)/sizeof(struct live_range);
18420 rval = ((unsigned long)right)/sizeof(struct live_range);
18425 hash = (hash *263) + val;
18430 hash = (hash *263) + val;
18432 hash = hash & (LRE_HASH_SIZE - 1);
18436 static struct lre_hash **lre_probe(struct reg_state *rstate,
18437 struct live_range *left, struct live_range *right)
18439 struct lre_hash **ptr;
18440 unsigned int index;
18441 /* Ensure left <= right */
18442 if (left > right) {
18443 struct live_range *tmp;
18448 index = hash_live_edge(left, right);
18450 ptr = &rstate->hash[index];
18452 if (((*ptr)->left == left) && ((*ptr)->right == right)) {
18455 ptr = &(*ptr)->next;
18460 static int interfere(struct reg_state *rstate,
18461 struct live_range *left, struct live_range *right)
18463 struct lre_hash **ptr;
18464 ptr = lre_probe(rstate, left, right);
18465 return ptr && *ptr;
18468 static void add_live_edge(struct reg_state *rstate,
18469 struct live_range *left, struct live_range *right)
18471 /* FIXME the memory allocation overhead is noticeable here... */
18472 struct lre_hash **ptr, *new_hash;
18473 struct live_range_edge *edge;
18475 if (left == right) {
18478 if ((left == &rstate->lr[0]) || (right == &rstate->lr[0])) {
18481 /* Ensure left <= right */
18482 if (left > right) {
18483 struct live_range *tmp;
18488 ptr = lre_probe(rstate, left, right);
18493 fprintf(state->errout, "new_live_edge(%p, %p)\n",
18496 new_hash = xmalloc(sizeof(*new_hash), "lre_hash");
18497 new_hash->next = *ptr;
18498 new_hash->left = left;
18499 new_hash->right = right;
18502 edge = xmalloc(sizeof(*edge), "live_range_edge");
18503 edge->next = left->edges;
18504 edge->node = right;
18505 left->edges = edge;
18508 edge = xmalloc(sizeof(*edge), "live_range_edge");
18509 edge->next = right->edges;
18511 right->edges = edge;
18512 right->degree += 1;
18515 static void remove_live_edge(struct reg_state *rstate,
18516 struct live_range *left, struct live_range *right)
18518 struct live_range_edge *edge, **ptr;
18519 struct lre_hash **hptr, *entry;
18520 hptr = lre_probe(rstate, left, right);
18521 if (!hptr || !*hptr) {
18525 *hptr = entry->next;
18528 for(ptr = &left->edges; *ptr; ptr = &(*ptr)->next) {
18530 if (edge->node == right) {
18532 memset(edge, 0, sizeof(*edge));
18538 for(ptr = &right->edges; *ptr; ptr = &(*ptr)->next) {
18540 if (edge->node == left) {
18542 memset(edge, 0, sizeof(*edge));
18550 static void remove_live_edges(struct reg_state *rstate, struct live_range *range)
18552 struct live_range_edge *edge, *next;
18553 for(edge = range->edges; edge; edge = next) {
18555 remove_live_edge(rstate, range, edge->node);
18559 static void transfer_live_edges(struct reg_state *rstate,
18560 struct live_range *dest, struct live_range *src)
18562 struct live_range_edge *edge, *next;
18563 for(edge = src->edges; edge; edge = next) {
18564 struct live_range *other;
18566 other = edge->node;
18567 remove_live_edge(rstate, src, other);
18568 add_live_edge(rstate, dest, other);
18573 /* Interference graph...
18575 * new(n) --- Return a graph with n nodes but no edges.
18576 * add(g,x,y) --- Return a graph including g with an between x and y
18577 * interfere(g, x, y) --- Return true if there exists an edge between the nodes
18578 * x and y in the graph g
18579 * degree(g, x) --- Return the degree of the node x in the graph g
18580 * neighbors(g, x, f) --- Apply function f to each neighbor of node x in the graph g
18582 * Implement with a hash table && a set of adjcency vectors.
18583 * The hash table supports constant time implementations of add and interfere.
18584 * The adjacency vectors support an efficient implementation of neighbors.
18588 * +---------------------------------------------------+
18589 * | +--------------+ |
18591 * renumber -> build graph -> colalesce -> spill_costs -> simplify -> select
18593 * -- In simplify implment optimistic coloring... (No backtracking)
18594 * -- Implement Rematerialization it is the only form of spilling we can perform
18595 * Essentially this means dropping a constant from a register because
18596 * we can regenerate it later.
18598 * --- Very conservative colalescing (don't colalesce just mark the opportunities)
18599 * coalesce at phi points...
18600 * --- Bias coloring if at all possible do the coalesing a compile time.
18605 #if DEBUG_ROMCC_WARNING
18606 static void different_colored(
18607 struct compile_state *state, struct reg_state *rstate,
18608 struct triple *parent, struct triple *ins)
18610 struct live_range *lr;
18611 struct triple **expr;
18612 lr = rstate->lrd[ins->id].lr;
18613 expr = triple_rhs(state, ins, 0);
18614 for(;expr; expr = triple_rhs(state, ins, expr)) {
18615 struct live_range *lr2;
18616 if (!*expr || (*expr == parent) || (*expr == ins)) {
18619 lr2 = rstate->lrd[(*expr)->id].lr;
18620 if (lr->color == lr2->color) {
18621 internal_error(state, ins, "live range too big");
18627 static struct live_range *coalesce_ranges(
18628 struct compile_state *state, struct reg_state *rstate,
18629 struct live_range *lr1, struct live_range *lr2)
18631 struct live_range_def *head, *mid1, *mid2, *end, *lrd;
18637 if (!lr1->defs || !lr2->defs) {
18638 internal_error(state, 0,
18639 "cannot coalese dead live ranges");
18641 if ((lr1->color == REG_UNNEEDED) ||
18642 (lr2->color == REG_UNNEEDED)) {
18643 internal_error(state, 0,
18644 "cannot coalesce live ranges without a possible color");
18646 if ((lr1->color != lr2->color) &&
18647 (lr1->color != REG_UNSET) &&
18648 (lr2->color != REG_UNSET)) {
18649 internal_error(state, lr1->defs->def,
18650 "cannot coalesce live ranges of different colors");
18652 color = lr1->color;
18653 if (color == REG_UNSET) {
18654 color = lr2->color;
18656 classes = lr1->classes & lr2->classes;
18658 internal_error(state, lr1->defs->def,
18659 "cannot coalesce live ranges with dissimilar register classes");
18661 if (state->compiler->debug & DEBUG_COALESCING) {
18662 FILE *fp = state->errout;
18663 fprintf(fp, "coalescing:");
18666 fprintf(fp, " %p", lrd->def);
18668 } while(lrd != lr1->defs);
18672 fprintf(fp, " %p", lrd->def);
18674 } while(lrd != lr2->defs);
18677 /* If there is a clear dominate live range put it in lr1,
18678 * For purposes of this test phi functions are
18679 * considered dominated by the definitions that feed into
18682 if ((lr1->defs->prev->def->op == OP_PHI) ||
18683 ((lr2->defs->prev->def->op != OP_PHI) &&
18684 tdominates(state, lr2->defs->def, lr1->defs->def))) {
18685 struct live_range *tmp;
18691 if (lr1->defs->orig_id & TRIPLE_FLAG_POST_SPLIT) {
18692 fprintf(state->errout, "lr1 post\n");
18694 if (lr1->defs->orig_id & TRIPLE_FLAG_PRE_SPLIT) {
18695 fprintf(state->errout, "lr1 pre\n");
18697 if (lr2->defs->orig_id & TRIPLE_FLAG_POST_SPLIT) {
18698 fprintf(state->errout, "lr2 post\n");
18700 if (lr2->defs->orig_id & TRIPLE_FLAG_PRE_SPLIT) {
18701 fprintf(state->errout, "lr2 pre\n");
18705 fprintf(state->errout, "coalesce color1(%p): %3d color2(%p) %3d\n",
18712 /* Append lr2 onto lr1 */
18713 #if DEBUG_ROMCC_WARNINGS
18714 #warning "FIXME should this be a merge instead of a splice?"
18716 /* This FIXME item applies to the correctness of live_range_end
18717 * and to the necessity of making multiple passes of coalesce_live_ranges.
18718 * A failure to find some coalesce opportunities in coaleace_live_ranges
18719 * does not impact the correct of the compiler just the efficiency with
18720 * which registers are allocated.
18723 mid1 = lr1->defs->prev;
18725 end = lr2->defs->prev;
18733 /* Fixup the live range in the added live range defs */
18738 } while(lrd != head);
18740 /* Mark lr2 as free. */
18742 lr2->color = REG_UNNEEDED;
18746 internal_error(state, 0, "lr1->defs == 0 ?");
18749 lr1->color = color;
18750 lr1->classes = classes;
18752 /* Keep the graph in sync by transfering the edges from lr2 to lr1 */
18753 transfer_live_edges(rstate, lr1, lr2);
18758 static struct live_range_def *live_range_head(
18759 struct compile_state *state, struct live_range *lr,
18760 struct live_range_def *last)
18762 struct live_range_def *result;
18767 else if (!tdominates(state, lr->defs->def, last->next->def)) {
18768 result = last->next;
18773 static struct live_range_def *live_range_end(
18774 struct compile_state *state, struct live_range *lr,
18775 struct live_range_def *last)
18777 struct live_range_def *result;
18780 result = lr->defs->prev;
18782 else if (!tdominates(state, last->prev->def, lr->defs->prev->def)) {
18783 result = last->prev;
18789 static void initialize_live_ranges(
18790 struct compile_state *state, struct reg_state *rstate)
18792 struct triple *ins, *first;
18793 size_t count, size;
18796 first = state->first;
18797 /* First count how many instructions I have.
18799 count = count_triples(state);
18800 /* Potentially I need one live range definitions for each
18803 rstate->defs = count;
18804 /* Potentially I need one live range for each instruction
18805 * plus an extra for the dummy live range.
18807 rstate->ranges = count + 1;
18808 size = sizeof(rstate->lrd[0]) * rstate->defs;
18809 rstate->lrd = xcmalloc(size, "live_range_def");
18810 size = sizeof(rstate->lr[0]) * rstate->ranges;
18811 rstate->lr = xcmalloc(size, "live_range");
18813 /* Setup the dummy live range */
18814 rstate->lr[0].classes = 0;
18815 rstate->lr[0].color = REG_UNSET;
18816 rstate->lr[0].defs = 0;
18820 /* If the triple is a variable give it a live range */
18821 if (triple_is_def(state, ins)) {
18822 struct reg_info info;
18823 /* Find the architecture specific color information */
18824 info = find_def_color(state, ins);
18826 rstate->lr[i].defs = &rstate->lrd[j];
18827 rstate->lr[i].color = info.reg;
18828 rstate->lr[i].classes = info.regcm;
18829 rstate->lr[i].degree = 0;
18830 rstate->lrd[j].lr = &rstate->lr[i];
18832 /* Otherwise give the triple the dummy live range. */
18834 rstate->lrd[j].lr = &rstate->lr[0];
18837 /* Initalize the live_range_def */
18838 rstate->lrd[j].next = &rstate->lrd[j];
18839 rstate->lrd[j].prev = &rstate->lrd[j];
18840 rstate->lrd[j].def = ins;
18841 rstate->lrd[j].orig_id = ins->id;
18846 } while(ins != first);
18847 rstate->ranges = i;
18849 /* Make a second pass to handle achitecture specific register
18854 int zlhs, zrhs, i, j;
18855 if (ins->id > rstate->defs) {
18856 internal_error(state, ins, "bad id");
18859 /* Walk through the template of ins and coalesce live ranges */
18861 if ((zlhs == 0) && triple_is_def(state, ins)) {
18866 if (state->compiler->debug & DEBUG_COALESCING2) {
18867 fprintf(state->errout, "mandatory coalesce: %p %d %d\n",
18871 for(i = 0; i < zlhs; i++) {
18872 struct reg_info linfo;
18873 struct live_range_def *lhs;
18874 linfo = arch_reg_lhs(state, ins, i);
18875 if (linfo.reg < MAX_REGISTERS) {
18878 if (triple_is_def(state, ins)) {
18879 lhs = &rstate->lrd[ins->id];
18881 lhs = &rstate->lrd[LHS(ins, i)->id];
18884 if (state->compiler->debug & DEBUG_COALESCING2) {
18885 fprintf(state->errout, "coalesce lhs(%d): %p %d\n",
18886 i, lhs, linfo.reg);
18889 for(j = 0; j < zrhs; j++) {
18890 struct reg_info rinfo;
18891 struct live_range_def *rhs;
18892 rinfo = arch_reg_rhs(state, ins, j);
18893 if (rinfo.reg < MAX_REGISTERS) {
18896 rhs = &rstate->lrd[RHS(ins, j)->id];
18898 if (state->compiler->debug & DEBUG_COALESCING2) {
18899 fprintf(state->errout, "coalesce rhs(%d): %p %d\n",
18900 j, rhs, rinfo.reg);
18903 if (rinfo.reg == linfo.reg) {
18904 coalesce_ranges(state, rstate,
18910 } while(ins != first);
18913 static void graph_ins(
18914 struct compile_state *state,
18915 struct reg_block *blocks, struct triple_reg_set *live,
18916 struct reg_block *rb, struct triple *ins, void *arg)
18918 struct reg_state *rstate = arg;
18919 struct live_range *def;
18920 struct triple_reg_set *entry;
18922 /* If the triple is not a definition
18923 * we do not have a definition to add to
18924 * the interference graph.
18926 if (!triple_is_def(state, ins)) {
18929 def = rstate->lrd[ins->id].lr;
18931 /* Create an edge between ins and everything that is
18932 * alive, unless the live_range cannot share
18933 * a physical register with ins.
18935 for(entry = live; entry; entry = entry->next) {
18936 struct live_range *lr;
18937 if ((entry->member->id < 0) || (entry->member->id > rstate->defs)) {
18938 internal_error(state, 0, "bad entry?");
18940 lr = rstate->lrd[entry->member->id].lr;
18944 if (!arch_regcm_intersect(def->classes, lr->classes)) {
18947 add_live_edge(rstate, def, lr);
18952 #if DEBUG_CONSISTENCY > 1
18953 static struct live_range *get_verify_live_range(
18954 struct compile_state *state, struct reg_state *rstate, struct triple *ins)
18956 struct live_range *lr;
18957 struct live_range_def *lrd;
18959 if ((ins->id < 0) || (ins->id > rstate->defs)) {
18960 internal_error(state, ins, "bad ins?");
18962 lr = rstate->lrd[ins->id].lr;
18966 if (lrd->def == ins) {
18970 } while(lrd != lr->defs);
18972 internal_error(state, ins, "ins not in live range");
18977 static void verify_graph_ins(
18978 struct compile_state *state,
18979 struct reg_block *blocks, struct triple_reg_set *live,
18980 struct reg_block *rb, struct triple *ins, void *arg)
18982 struct reg_state *rstate = arg;
18983 struct triple_reg_set *entry1, *entry2;
18986 /* Compare live against edges and make certain the code is working */
18987 for(entry1 = live; entry1; entry1 = entry1->next) {
18988 struct live_range *lr1;
18989 lr1 = get_verify_live_range(state, rstate, entry1->member);
18990 for(entry2 = live; entry2; entry2 = entry2->next) {
18991 struct live_range *lr2;
18992 struct live_range_edge *edge2;
18995 if (entry2 == entry1) {
18998 lr2 = get_verify_live_range(state, rstate, entry2->member);
19000 internal_error(state, entry2->member,
19001 "live range with 2 values simultaneously alive");
19003 if (!arch_regcm_intersect(lr1->classes, lr2->classes)) {
19006 if (!interfere(rstate, lr1, lr2)) {
19007 internal_error(state, entry2->member,
19008 "edges don't interfere?");
19013 for(edge2 = lr2->edges; edge2; edge2 = edge2->next) {
19015 if (edge2->node == lr1) {
19019 if (lr2_degree != lr2->degree) {
19020 internal_error(state, entry2->member,
19021 "computed degree: %d does not match reported degree: %d\n",
19022 lr2_degree, lr2->degree);
19025 internal_error(state, entry2->member, "missing edge");
19033 static void print_interference_ins(
19034 struct compile_state *state,
19035 struct reg_block *blocks, struct triple_reg_set *live,
19036 struct reg_block *rb, struct triple *ins, void *arg)
19038 struct reg_state *rstate = arg;
19039 struct live_range *lr;
19041 FILE *fp = state->dbgout;
19043 lr = rstate->lrd[ins->id].lr;
19045 ins->id = rstate->lrd[id].orig_id;
19046 SET_REG(ins->id, lr->color);
19047 display_triple(state->dbgout, ins);
19051 struct live_range_def *lrd;
19052 fprintf(fp, " range:");
19055 fprintf(fp, " %-10p", lrd->def);
19057 } while(lrd != lr->defs);
19061 struct triple_reg_set *entry;
19062 fprintf(fp, " live:");
19063 for(entry = live; entry; entry = entry->next) {
19064 fprintf(fp, " %-10p", entry->member);
19069 struct live_range_edge *entry;
19070 fprintf(fp, " edges:");
19071 for(entry = lr->edges; entry; entry = entry->next) {
19072 struct live_range_def *lrd;
19073 lrd = entry->node->defs;
19075 fprintf(fp, " %-10p", lrd->def);
19077 } while(lrd != entry->node->defs);
19082 if (triple_is_branch(state, ins)) {
19088 static int coalesce_live_ranges(
19089 struct compile_state *state, struct reg_state *rstate)
19091 /* At the point where a value is moved from one
19092 * register to another that value requires two
19093 * registers, thus increasing register pressure.
19094 * Live range coaleescing reduces the register
19095 * pressure by keeping a value in one register
19098 * In the case of a phi function all paths leading
19099 * into it must be allocated to the same register
19100 * otherwise the phi function may not be removed.
19102 * Forcing a value to stay in a single register
19103 * for an extended period of time does have
19104 * limitations when applied to non homogenous
19107 * The two cases I have identified are:
19108 * 1) Two forced register assignments may
19110 * 2) Registers may go unused because they
19111 * are only good for storing the value
19112 * and not manipulating it.
19114 * Because of this I need to split live ranges,
19115 * even outside of the context of coalesced live
19116 * ranges. The need to split live ranges does
19117 * impose some constraints on live range coalescing.
19119 * - Live ranges may not be coalesced across phi
19120 * functions. This creates a 2 headed live
19121 * range that cannot be sanely split.
19123 * - phi functions (coalesced in initialize_live_ranges)
19124 * are handled as pre split live ranges so we will
19125 * never attempt to split them.
19131 for(i = 0; i <= rstate->ranges; i++) {
19132 struct live_range *lr1;
19133 struct live_range_def *lrd1;
19134 lr1 = &rstate->lr[i];
19138 lrd1 = live_range_end(state, lr1, 0);
19139 for(; lrd1; lrd1 = live_range_end(state, lr1, lrd1)) {
19140 struct triple_set *set;
19141 if (lrd1->def->op != OP_COPY) {
19144 /* Skip copies that are the result of a live range split. */
19145 if (lrd1->orig_id & TRIPLE_FLAG_POST_SPLIT) {
19148 for(set = lrd1->def->use; set; set = set->next) {
19149 struct live_range_def *lrd2;
19150 struct live_range *lr2, *res;
19152 lrd2 = &rstate->lrd[set->member->id];
19154 /* Don't coalesce with instructions
19155 * that are the result of a live range
19158 if (lrd2->orig_id & TRIPLE_FLAG_PRE_SPLIT) {
19161 lr2 = rstate->lrd[set->member->id].lr;
19165 if ((lr1->color != lr2->color) &&
19166 (lr1->color != REG_UNSET) &&
19167 (lr2->color != REG_UNSET)) {
19170 if ((lr1->classes & lr2->classes) == 0) {
19174 if (interfere(rstate, lr1, lr2)) {
19178 res = coalesce_ranges(state, rstate, lr1, lr2);
19192 static void fix_coalesce_conflicts(struct compile_state *state,
19193 struct reg_block *blocks, struct triple_reg_set *live,
19194 struct reg_block *rb, struct triple *ins, void *arg)
19196 int *conflicts = arg;
19197 int zlhs, zrhs, i, j;
19199 /* See if we have a mandatory coalesce operation between
19200 * a lhs and a rhs value. If so and the rhs value is also
19201 * alive then this triple needs to be pre copied. Otherwise
19202 * we would have two definitions in the same live range simultaneously
19206 if ((zlhs == 0) && triple_is_def(state, ins)) {
19210 for(i = 0; i < zlhs; i++) {
19211 struct reg_info linfo;
19212 linfo = arch_reg_lhs(state, ins, i);
19213 if (linfo.reg < MAX_REGISTERS) {
19216 for(j = 0; j < zrhs; j++) {
19217 struct reg_info rinfo;
19218 struct triple *rhs;
19219 struct triple_reg_set *set;
19222 rinfo = arch_reg_rhs(state, ins, j);
19223 if (rinfo.reg != linfo.reg) {
19227 for(set = live; set && !found; set = set->next) {
19228 if (set->member == rhs) {
19233 struct triple *copy;
19234 copy = pre_copy(state, ins, j);
19235 copy->id |= TRIPLE_FLAG_PRE_SPLIT;
19243 static int correct_coalesce_conflicts(
19244 struct compile_state *state, struct reg_block *blocks)
19248 walk_variable_lifetimes(state, &state->bb, blocks,
19249 fix_coalesce_conflicts, &conflicts);
19253 static void replace_set_use(struct compile_state *state,
19254 struct triple_reg_set *head, struct triple *orig, struct triple *new)
19256 struct triple_reg_set *set;
19257 for(set = head; set; set = set->next) {
19258 if (set->member == orig) {
19264 static void replace_block_use(struct compile_state *state,
19265 struct reg_block *blocks, struct triple *orig, struct triple *new)
19268 #if DEBUG_ROMCC_WARNINGS
19269 #warning "WISHLIST visit just those blocks that need it *"
19271 for(i = 1; i <= state->bb.last_vertex; i++) {
19272 struct reg_block *rb;
19274 replace_set_use(state, rb->in, orig, new);
19275 replace_set_use(state, rb->out, orig, new);
19279 static void color_instructions(struct compile_state *state)
19281 struct triple *ins, *first;
19282 first = state->first;
19285 if (triple_is_def(state, ins)) {
19286 struct reg_info info;
19287 info = find_lhs_color(state, ins, 0);
19288 if (info.reg >= MAX_REGISTERS) {
19289 info.reg = REG_UNSET;
19291 SET_INFO(ins->id, info);
19294 } while(ins != first);
19297 static struct reg_info read_lhs_color(
19298 struct compile_state *state, struct triple *ins, int index)
19300 struct reg_info info;
19301 if ((index == 0) && triple_is_def(state, ins)) {
19302 info.reg = ID_REG(ins->id);
19303 info.regcm = ID_REGCM(ins->id);
19305 else if (index < ins->lhs) {
19306 info = read_lhs_color(state, LHS(ins, index), 0);
19309 internal_error(state, ins, "Bad lhs %d", index);
19310 info.reg = REG_UNSET;
19316 static struct triple *resolve_tangle(
19317 struct compile_state *state, struct triple *tangle)
19319 struct reg_info info, uinfo;
19320 struct triple_set *set, *next;
19321 struct triple *copy;
19323 #if DEBUG_ROMCC_WARNINGS
19324 #warning "WISHLIST recalculate all affected instructions colors"
19326 info = find_lhs_color(state, tangle, 0);
19327 for(set = tangle->use; set; set = next) {
19328 struct triple *user;
19331 user = set->member;
19333 for(i = 0; i < zrhs; i++) {
19334 if (RHS(user, i) != tangle) {
19337 uinfo = find_rhs_post_color(state, user, i);
19338 if (uinfo.reg == info.reg) {
19339 copy = pre_copy(state, user, i);
19340 copy->id |= TRIPLE_FLAG_PRE_SPLIT;
19341 SET_INFO(copy->id, uinfo);
19346 uinfo = find_lhs_pre_color(state, tangle, 0);
19347 if (uinfo.reg == info.reg) {
19348 struct reg_info linfo;
19349 copy = post_copy(state, tangle);
19350 copy->id |= TRIPLE_FLAG_PRE_SPLIT;
19351 linfo = find_lhs_color(state, copy, 0);
19352 SET_INFO(copy->id, linfo);
19354 info = find_lhs_color(state, tangle, 0);
19355 SET_INFO(tangle->id, info);
19361 static void fix_tangles(struct compile_state *state,
19362 struct reg_block *blocks, struct triple_reg_set *live,
19363 struct reg_block *rb, struct triple *ins, void *arg)
19365 int *tangles = arg;
19366 struct triple *tangle;
19368 char used[MAX_REGISTERS];
19369 struct triple_reg_set *set;
19372 /* Find out which registers have multiple uses at this point */
19373 memset(used, 0, sizeof(used));
19374 for(set = live; set; set = set->next) {
19375 struct reg_info info;
19376 info = read_lhs_color(state, set->member, 0);
19377 if (info.reg == REG_UNSET) {
19380 reg_inc_used(state, used, info.reg);
19383 /* Now find the least dominated definition of a register in
19384 * conflict I have seen so far.
19386 for(set = live; set; set = set->next) {
19387 struct reg_info info;
19388 info = read_lhs_color(state, set->member, 0);
19389 if (used[info.reg] < 2) {
19392 /* Changing copies that feed into phi functions
19395 if (set->member->use &&
19396 (set->member->use->member->op == OP_PHI)) {
19399 if (!tangle || tdominates(state, set->member, tangle)) {
19400 tangle = set->member;
19403 /* If I have found a tangle resolve it */
19405 struct triple *post_copy;
19407 post_copy = resolve_tangle(state, tangle);
19409 replace_block_use(state, blocks, tangle, post_copy);
19411 if (post_copy && (tangle != ins)) {
19412 replace_set_use(state, live, tangle, post_copy);
19419 static int correct_tangles(
19420 struct compile_state *state, struct reg_block *blocks)
19424 color_instructions(state);
19425 walk_variable_lifetimes(state, &state->bb, blocks,
19426 fix_tangles, &tangles);
19431 static void ids_from_rstate(struct compile_state *state, struct reg_state *rstate);
19432 static void cleanup_rstate(struct compile_state *state, struct reg_state *rstate);
19434 struct triple *find_constrained_def(
19435 struct compile_state *state, struct live_range *range, struct triple *constrained)
19437 struct live_range_def *lrd, *lrd_next;
19438 lrd_next = range->defs;
19440 struct reg_info info;
19444 lrd_next = lrd->next;
19446 regcm = arch_type_to_regcm(state, lrd->def->type);
19447 info = find_lhs_color(state, lrd->def, 0);
19448 regcm = arch_regcm_reg_normalize(state, regcm);
19449 info.regcm = arch_regcm_reg_normalize(state, info.regcm);
19450 /* If the 2 register class masks are equal then
19451 * the current register class is not constrained.
19453 if (regcm == info.regcm) {
19457 /* If there is just one use.
19458 * That use cannot accept a larger register class.
19459 * There are no intervening definitions except
19460 * definitions that feed into that use.
19461 * Then a triple is not constrained.
19462 * FIXME handle this case!
19464 #if DEBUG_ROMCC_WARNINGS
19465 #warning "FIXME ignore cases that cannot be fixed (a definition followed by a use)"
19469 /* Of the constrained live ranges deal with the
19470 * least dominated one first.
19472 if (state->compiler->debug & DEBUG_RANGE_CONFLICTS) {
19473 fprintf(state->errout, "canidate: %p %-8s regcm: %x %x\n",
19474 lrd->def, tops(lrd->def->op), regcm, info.regcm);
19476 if (!constrained ||
19477 tdominates(state, lrd->def, constrained))
19479 constrained = lrd->def;
19481 } while(lrd_next != range->defs);
19482 return constrained;
19485 static int split_constrained_ranges(
19486 struct compile_state *state, struct reg_state *rstate,
19487 struct live_range *range)
19489 /* Walk through the edges in conflict and our current live
19490 * range, and find definitions that are more severly constrained
19491 * than they type of data they contain require.
19493 * Then pick one of those ranges and relax the constraints.
19495 struct live_range_edge *edge;
19496 struct triple *constrained;
19499 for(edge = range->edges; edge; edge = edge->next) {
19500 constrained = find_constrained_def(state, edge->node, constrained);
19502 #if DEBUG_ROMCC_WARNINGS
19503 #warning "FIXME should I call find_constrained_def here only if no previous constrained def was found?"
19505 if (!constrained) {
19506 constrained = find_constrained_def(state, range, constrained);
19509 if (state->compiler->debug & DEBUG_RANGE_CONFLICTS) {
19510 fprintf(state->errout, "constrained: ");
19511 display_triple(state->errout, constrained);
19514 ids_from_rstate(state, rstate);
19515 cleanup_rstate(state, rstate);
19516 resolve_tangle(state, constrained);
19518 return !!constrained;
19521 static int split_ranges(
19522 struct compile_state *state, struct reg_state *rstate,
19523 char *used, struct live_range *range)
19526 if (state->compiler->debug & DEBUG_RANGE_CONFLICTS) {
19527 fprintf(state->errout, "split_ranges %d %s %p\n",
19528 rstate->passes, tops(range->defs->def->op), range->defs->def);
19530 if ((range->color == REG_UNNEEDED) ||
19531 (rstate->passes >= rstate->max_passes)) {
19534 split = split_constrained_ranges(state, rstate, range);
19536 /* Ideally I would split the live range that will not be used
19537 * for the longest period of time in hopes that this will
19538 * (a) allow me to spill a register or
19539 * (b) allow me to place a value in another register.
19541 * So far I don't have a test case for this, the resolving
19542 * of mandatory constraints has solved all of my
19543 * know issues. So I have choosen not to write any
19544 * code until I cat get a better feel for cases where
19545 * it would be useful to have.
19548 #if DEBUG_ROMCC_WARNINGS
19549 #warning "WISHLIST implement live range splitting..."
19552 if (!split && (state->compiler->debug & DEBUG_RANGE_CONFLICTS2)) {
19553 FILE *fp = state->errout;
19554 print_interference_blocks(state, rstate, fp, 0);
19555 print_dominators(state, fp, &state->bb);
19560 static FILE *cgdebug_fp(struct compile_state *state)
19564 if (!fp && (state->compiler->debug & DEBUG_COLOR_GRAPH2)) {
19565 fp = state->errout;
19567 if (!fp && (state->compiler->debug & DEBUG_COLOR_GRAPH)) {
19568 fp = state->dbgout;
19573 static void cgdebug_printf(struct compile_state *state, const char *fmt, ...)
19576 fp = cgdebug_fp(state);
19579 va_start(args, fmt);
19580 vfprintf(fp, fmt, args);
19585 static void cgdebug_flush(struct compile_state *state)
19588 fp = cgdebug_fp(state);
19594 static void cgdebug_loc(struct compile_state *state, struct triple *ins)
19597 fp = cgdebug_fp(state);
19599 loc(fp, state, ins);
19603 static int select_free_color(struct compile_state *state,
19604 struct reg_state *rstate, struct live_range *range)
19606 struct triple_set *entry;
19607 struct live_range_def *lrd;
19608 struct live_range_def *phi;
19609 struct live_range_edge *edge;
19610 char used[MAX_REGISTERS];
19611 struct triple **expr;
19613 /* Instead of doing just the trivial color select here I try
19614 * a few extra things because a good color selection will help reduce
19618 /* Find the registers currently in use */
19619 memset(used, 0, sizeof(used));
19620 for(edge = range->edges; edge; edge = edge->next) {
19621 if (edge->node->color == REG_UNSET) {
19624 reg_fill_used(state, used, edge->node->color);
19627 if (state->compiler->debug & DEBUG_COLOR_GRAPH2) {
19630 for(edge = range->edges; edge; edge = edge->next) {
19633 cgdebug_printf(state, "\n%s edges: %d",
19634 tops(range->defs->def->op), i);
19635 cgdebug_loc(state, range->defs->def);
19636 cgdebug_printf(state, "\n");
19637 for(i = 0; i < MAX_REGISTERS; i++) {
19639 cgdebug_printf(state, "used: %s\n",
19645 /* If a color is already assigned see if it will work */
19646 if (range->color != REG_UNSET) {
19647 struct live_range_def *lrd;
19648 if (!used[range->color]) {
19651 for(edge = range->edges; edge; edge = edge->next) {
19652 if (edge->node->color != range->color) {
19655 warning(state, edge->node->defs->def, "edge: ");
19656 lrd = edge->node->defs;
19658 warning(state, lrd->def, " %p %s",
19659 lrd->def, tops(lrd->def->op));
19661 } while(lrd != edge->node->defs);
19664 warning(state, range->defs->def, "def: ");
19666 warning(state, lrd->def, " %p %s",
19667 lrd->def, tops(lrd->def->op));
19669 } while(lrd != range->defs);
19670 internal_error(state, range->defs->def,
19671 "live range with already used color %s",
19672 arch_reg_str(range->color));
19675 /* If I feed into an expression reuse it's color.
19676 * This should help remove copies in the case of 2 register instructions
19677 * and phi functions.
19680 lrd = live_range_end(state, range, 0);
19681 for(; (range->color == REG_UNSET) && lrd ; lrd = live_range_end(state, range, lrd)) {
19682 entry = lrd->def->use;
19683 for(;(range->color == REG_UNSET) && entry; entry = entry->next) {
19684 struct live_range_def *insd;
19686 insd = &rstate->lrd[entry->member->id];
19687 if (insd->lr->defs == 0) {
19690 if (!phi && (insd->def->op == OP_PHI) &&
19691 !interfere(rstate, range, insd->lr)) {
19694 if (insd->lr->color == REG_UNSET) {
19697 regcm = insd->lr->classes;
19698 if (((regcm & range->classes) == 0) ||
19699 (used[insd->lr->color])) {
19702 if (interfere(rstate, range, insd->lr)) {
19705 range->color = insd->lr->color;
19708 /* If I feed into a phi function reuse it's color or the color
19709 * of something else that feeds into the phi function.
19712 if (phi->lr->color != REG_UNSET) {
19713 if (used[phi->lr->color]) {
19714 range->color = phi->lr->color;
19718 expr = triple_rhs(state, phi->def, 0);
19719 for(; expr; expr = triple_rhs(state, phi->def, expr)) {
19720 struct live_range *lr;
19725 lr = rstate->lrd[(*expr)->id].lr;
19726 if (lr->color == REG_UNSET) {
19729 regcm = lr->classes;
19730 if (((regcm & range->classes) == 0) ||
19731 (used[lr->color])) {
19734 if (interfere(rstate, range, lr)) {
19737 range->color = lr->color;
19741 /* If I don't interfere with a rhs node reuse it's color */
19742 lrd = live_range_head(state, range, 0);
19743 for(; (range->color == REG_UNSET) && lrd ; lrd = live_range_head(state, range, lrd)) {
19744 expr = triple_rhs(state, lrd->def, 0);
19745 for(; expr; expr = triple_rhs(state, lrd->def, expr)) {
19746 struct live_range *lr;
19751 lr = rstate->lrd[(*expr)->id].lr;
19752 if (lr->color == REG_UNSET) {
19755 regcm = lr->classes;
19756 if (((regcm & range->classes) == 0) ||
19757 (used[lr->color])) {
19760 if (interfere(rstate, range, lr)) {
19763 range->color = lr->color;
19767 /* If I have not opportunitically picked a useful color
19768 * pick the first color that is free.
19770 if (range->color == REG_UNSET) {
19772 arch_select_free_register(state, used, range->classes);
19774 if (range->color == REG_UNSET) {
19775 struct live_range_def *lrd;
19777 if (split_ranges(state, rstate, used, range)) {
19780 for(edge = range->edges; edge; edge = edge->next) {
19781 warning(state, edge->node->defs->def, "edge reg %s",
19782 arch_reg_str(edge->node->color));
19783 lrd = edge->node->defs;
19785 warning(state, lrd->def, " %s %p",
19786 tops(lrd->def->op), lrd->def);
19788 } while(lrd != edge->node->defs);
19790 warning(state, range->defs->def, "range: ");
19793 warning(state, lrd->def, " %s %p",
19794 tops(lrd->def->op), lrd->def);
19796 } while(lrd != range->defs);
19798 warning(state, range->defs->def, "classes: %x",
19800 for(i = 0; i < MAX_REGISTERS; i++) {
19802 warning(state, range->defs->def, "used: %s",
19806 error(state, range->defs->def, "too few registers");
19808 range->classes &= arch_reg_regcm(state, range->color);
19809 if ((range->color == REG_UNSET) || (range->classes == 0)) {
19810 internal_error(state, range->defs->def, "select_free_color did not?");
19815 static int color_graph(struct compile_state *state, struct reg_state *rstate)
19818 struct live_range_edge *edge;
19819 struct live_range *range;
19821 cgdebug_printf(state, "Lo: ");
19822 range = rstate->low;
19823 if (*range->group_prev != range) {
19824 internal_error(state, 0, "lo: *prev != range?");
19826 *range->group_prev = range->group_next;
19827 if (range->group_next) {
19828 range->group_next->group_prev = range->group_prev;
19830 if (&range->group_next == rstate->low_tail) {
19831 rstate->low_tail = range->group_prev;
19833 if (rstate->low == range) {
19834 internal_error(state, 0, "low: next != prev?");
19837 else if (rstate->high) {
19838 cgdebug_printf(state, "Hi: ");
19839 range = rstate->high;
19840 if (*range->group_prev != range) {
19841 internal_error(state, 0, "hi: *prev != range?");
19843 *range->group_prev = range->group_next;
19844 if (range->group_next) {
19845 range->group_next->group_prev = range->group_prev;
19847 if (&range->group_next == rstate->high_tail) {
19848 rstate->high_tail = range->group_prev;
19850 if (rstate->high == range) {
19851 internal_error(state, 0, "high: next != prev?");
19857 cgdebug_printf(state, " %d\n", range - rstate->lr);
19858 range->group_prev = 0;
19859 for(edge = range->edges; edge; edge = edge->next) {
19860 struct live_range *node;
19862 /* Move nodes from the high to the low list */
19863 if (node->group_prev && (node->color == REG_UNSET) &&
19864 (node->degree == regc_max_size(state, node->classes))) {
19865 if (*node->group_prev != node) {
19866 internal_error(state, 0, "move: *prev != node?");
19868 *node->group_prev = node->group_next;
19869 if (node->group_next) {
19870 node->group_next->group_prev = node->group_prev;
19872 if (&node->group_next == rstate->high_tail) {
19873 rstate->high_tail = node->group_prev;
19875 cgdebug_printf(state, "Moving...%d to low\n", node - rstate->lr);
19876 node->group_prev = rstate->low_tail;
19877 node->group_next = 0;
19878 *rstate->low_tail = node;
19879 rstate->low_tail = &node->group_next;
19880 if (*node->group_prev != node) {
19881 internal_error(state, 0, "move2: *prev != node?");
19886 colored = color_graph(state, rstate);
19888 cgdebug_printf(state, "Coloring %d @", range - rstate->lr);
19889 cgdebug_loc(state, range->defs->def);
19890 cgdebug_flush(state);
19891 colored = select_free_color(state, rstate, range);
19893 cgdebug_printf(state, " %s\n", arch_reg_str(range->color));
19899 static void verify_colors(struct compile_state *state, struct reg_state *rstate)
19901 struct live_range *lr;
19902 struct live_range_edge *edge;
19903 struct triple *ins, *first;
19904 char used[MAX_REGISTERS];
19905 first = state->first;
19908 if (triple_is_def(state, ins)) {
19909 if ((ins->id < 0) || (ins->id > rstate->defs)) {
19910 internal_error(state, ins,
19911 "triple without a live range def");
19913 lr = rstate->lrd[ins->id].lr;
19914 if (lr->color == REG_UNSET) {
19915 internal_error(state, ins,
19916 "triple without a color");
19918 /* Find the registers used by the edges */
19919 memset(used, 0, sizeof(used));
19920 for(edge = lr->edges; edge; edge = edge->next) {
19921 if (edge->node->color == REG_UNSET) {
19922 internal_error(state, 0,
19923 "live range without a color");
19925 reg_fill_used(state, used, edge->node->color);
19927 if (used[lr->color]) {
19928 internal_error(state, ins,
19929 "triple with already used color");
19933 } while(ins != first);
19936 static void color_triples(struct compile_state *state, struct reg_state *rstate)
19938 struct live_range_def *lrd;
19939 struct live_range *lr;
19940 struct triple *first, *ins;
19941 first = state->first;
19944 if ((ins->id < 0) || (ins->id > rstate->defs)) {
19945 internal_error(state, ins,
19946 "triple without a live range");
19948 lrd = &rstate->lrd[ins->id];
19950 ins->id = lrd->orig_id;
19951 SET_REG(ins->id, lr->color);
19953 } while (ins != first);
19956 static struct live_range *merge_sort_lr(
19957 struct live_range *first, struct live_range *last)
19959 struct live_range *mid, *join, **join_tail, *pick;
19961 size = (last - first) + 1;
19963 mid = first + size/2;
19964 first = merge_sort_lr(first, mid -1);
19965 mid = merge_sort_lr(mid, last);
19969 /* merge the two lists */
19970 while(first && mid) {
19971 if ((first->degree < mid->degree) ||
19972 ((first->degree == mid->degree) &&
19973 (first->length < mid->length))) {
19975 first = first->group_next;
19977 first->group_prev = 0;
19982 mid = mid->group_next;
19984 mid->group_prev = 0;
19987 pick->group_next = 0;
19988 pick->group_prev = join_tail;
19990 join_tail = &pick->group_next;
19992 /* Splice the remaining list */
19993 pick = (first)? first : mid;
19996 pick->group_prev = join_tail;
20000 if (!first->defs) {
20008 static void ids_from_rstate(struct compile_state *state,
20009 struct reg_state *rstate)
20011 struct triple *ins, *first;
20012 if (!rstate->defs) {
20015 /* Display the graph if desired */
20016 if (state->compiler->debug & DEBUG_INTERFERENCE) {
20017 FILE *fp = state->dbgout;
20018 print_interference_blocks(state, rstate, fp, 0);
20019 print_control_flow(state, fp, &state->bb);
20022 first = state->first;
20026 struct live_range_def *lrd;
20027 lrd = &rstate->lrd[ins->id];
20028 ins->id = lrd->orig_id;
20031 } while(ins != first);
20034 static void cleanup_live_edges(struct reg_state *rstate)
20037 /* Free the edges on each node */
20038 for(i = 1; i <= rstate->ranges; i++) {
20039 remove_live_edges(rstate, &rstate->lr[i]);
20043 static void cleanup_rstate(struct compile_state *state, struct reg_state *rstate)
20045 cleanup_live_edges(rstate);
20046 xfree(rstate->lrd);
20049 /* Free the variable lifetime information */
20050 if (rstate->blocks) {
20051 free_variable_lifetimes(state, &state->bb, rstate->blocks);
20054 rstate->ranges = 0;
20057 rstate->blocks = 0;
20060 static void verify_consistency(struct compile_state *state);
20061 static void allocate_registers(struct compile_state *state)
20063 struct reg_state rstate;
20066 /* Clear out the reg_state */
20067 memset(&rstate, 0, sizeof(rstate));
20068 rstate.max_passes = state->compiler->max_allocation_passes;
20071 struct live_range **point, **next;
20075 if (state->compiler->debug & DEBUG_RANGE_CONFLICTS) {
20076 FILE *fp = state->errout;
20077 fprintf(fp, "pass: %d\n", rstate.passes);
20082 ids_from_rstate(state, &rstate);
20084 /* Cleanup the temporary data structures */
20085 cleanup_rstate(state, &rstate);
20087 /* Compute the variable lifetimes */
20088 rstate.blocks = compute_variable_lifetimes(state, &state->bb);
20090 /* Fix invalid mandatory live range coalesce conflicts */
20091 correct_coalesce_conflicts(state, rstate.blocks);
20093 /* Fix two simultaneous uses of the same register.
20094 * In a few pathlogical cases a partial untangle moves
20095 * the tangle to a part of the graph we won't revisit.
20096 * So we keep looping until we have no more tangle fixes
20100 tangles = correct_tangles(state, rstate.blocks);
20104 print_blocks(state, "resolve_tangles", state->dbgout);
20105 verify_consistency(state);
20107 /* Allocate and initialize the live ranges */
20108 initialize_live_ranges(state, &rstate);
20110 /* Note currently doing coalescing in a loop appears to
20111 * buys me nothing. The code is left this way in case
20112 * there is some value in it. Or if a future bugfix
20113 * yields some benefit.
20116 if (state->compiler->debug & DEBUG_COALESCING) {
20117 fprintf(state->errout, "coalescing\n");
20120 /* Remove any previous live edge calculations */
20121 cleanup_live_edges(&rstate);
20123 /* Compute the interference graph */
20124 walk_variable_lifetimes(
20125 state, &state->bb, rstate.blocks,
20126 graph_ins, &rstate);
20128 /* Display the interference graph if desired */
20129 if (state->compiler->debug & DEBUG_INTERFERENCE) {
20130 print_interference_blocks(state, &rstate, state->dbgout, 1);
20131 fprintf(state->dbgout, "\nlive variables by instruction\n");
20132 walk_variable_lifetimes(
20133 state, &state->bb, rstate.blocks,
20134 print_interference_ins, &rstate);
20137 coalesced = coalesce_live_ranges(state, &rstate);
20139 if (state->compiler->debug & DEBUG_COALESCING) {
20140 fprintf(state->errout, "coalesced: %d\n", coalesced);
20142 } while(coalesced);
20144 #if DEBUG_CONSISTENCY > 1
20146 fprintf(state->errout, "verify_graph_ins...\n");
20148 /* Verify the interference graph */
20149 walk_variable_lifetimes(
20150 state, &state->bb, rstate.blocks,
20151 verify_graph_ins, &rstate);
20153 fprintf(state->errout, "verify_graph_ins done\n");
20157 /* Build the groups low and high. But with the nodes
20158 * first sorted by degree order.
20160 rstate.low_tail = &rstate.low;
20161 rstate.high_tail = &rstate.high;
20162 rstate.high = merge_sort_lr(&rstate.lr[1], &rstate.lr[rstate.ranges]);
20164 rstate.high->group_prev = &rstate.high;
20166 for(point = &rstate.high; *point; point = &(*point)->group_next)
20168 rstate.high_tail = point;
20169 /* Walk through the high list and move everything that needs
20172 for(point = &rstate.high; *point; point = next) {
20173 struct live_range *range;
20174 next = &(*point)->group_next;
20177 /* If it has a low degree or it already has a color
20178 * place the node in low.
20180 if ((range->degree < regc_max_size(state, range->classes)) ||
20181 (range->color != REG_UNSET)) {
20182 cgdebug_printf(state, "Lo: %5d degree %5d%s\n",
20183 range - rstate.lr, range->degree,
20184 (range->color != REG_UNSET) ? " (colored)": "");
20185 *range->group_prev = range->group_next;
20186 if (range->group_next) {
20187 range->group_next->group_prev = range->group_prev;
20189 if (&range->group_next == rstate.high_tail) {
20190 rstate.high_tail = range->group_prev;
20192 range->group_prev = rstate.low_tail;
20193 range->group_next = 0;
20194 *rstate.low_tail = range;
20195 rstate.low_tail = &range->group_next;
20199 cgdebug_printf(state, "hi: %5d degree %5d%s\n",
20200 range - rstate.lr, range->degree,
20201 (range->color != REG_UNSET) ? " (colored)": "");
20204 /* Color the live_ranges */
20205 colored = color_graph(state, &rstate);
20207 } while (!colored);
20209 /* Verify the graph was properly colored */
20210 verify_colors(state, &rstate);
20212 /* Move the colors from the graph to the triples */
20213 color_triples(state, &rstate);
20215 /* Cleanup the temporary data structures */
20216 cleanup_rstate(state, &rstate);
20218 /* Display the new graph */
20219 print_blocks(state, __func__, state->dbgout);
20222 /* Sparce Conditional Constant Propogation
20223 * =========================================
20227 struct lattice_node {
20229 struct triple *def;
20230 struct ssa_edge *out;
20231 struct flow_block *fblock;
20232 struct triple *val;
20233 /* lattice high val == def
20234 * lattice const is_const(val)
20235 * lattice low other
20239 struct lattice_node *src;
20240 struct lattice_node *dst;
20241 struct ssa_edge *work_next;
20242 struct ssa_edge *work_prev;
20243 struct ssa_edge *out_next;
20246 struct flow_block *src;
20247 struct flow_block *dst;
20248 struct flow_edge *work_next;
20249 struct flow_edge *work_prev;
20250 struct flow_edge *in_next;
20251 struct flow_edge *out_next;
20254 #define MAX_FLOW_BLOCK_EDGES 3
20255 struct flow_block {
20256 struct block *block;
20257 struct flow_edge *in;
20258 struct flow_edge *out;
20259 struct flow_edge *edges;
20264 struct lattice_node *lattice;
20265 struct ssa_edge *ssa_edges;
20266 struct flow_block *flow_blocks;
20267 struct flow_edge *flow_work_list;
20268 struct ssa_edge *ssa_work_list;
20272 static int is_scc_const(struct compile_state *state, struct triple *ins)
20274 return ins && (triple_is_ubranch(state, ins) || is_const(ins));
20277 static int is_lattice_hi(struct compile_state *state, struct lattice_node *lnode)
20279 return !is_scc_const(state, lnode->val) && (lnode->val == lnode->def);
20282 static int is_lattice_const(struct compile_state *state, struct lattice_node *lnode)
20284 return is_scc_const(state, lnode->val);
20287 static int is_lattice_lo(struct compile_state *state, struct lattice_node *lnode)
20289 return (lnode->val != lnode->def) && !is_scc_const(state, lnode->val);
20292 static void scc_add_fedge(struct compile_state *state, struct scc_state *scc,
20293 struct flow_edge *fedge)
20295 if (state->compiler->debug & DEBUG_SCC_TRANSFORM2) {
20296 fprintf(state->errout, "adding fedge: %p (%4d -> %5d)\n",
20298 fedge->src->block?fedge->src->block->last->id: 0,
20299 fedge->dst->block?fedge->dst->block->first->id: 0);
20301 if ((fedge == scc->flow_work_list) ||
20302 (fedge->work_next != fedge) ||
20303 (fedge->work_prev != fedge)) {
20305 if (state->compiler->debug & DEBUG_SCC_TRANSFORM2) {
20306 fprintf(state->errout, "dupped fedge: %p\n",
20311 if (!scc->flow_work_list) {
20312 scc->flow_work_list = fedge;
20313 fedge->work_next = fedge->work_prev = fedge;
20316 struct flow_edge *ftail;
20317 ftail = scc->flow_work_list->work_prev;
20318 fedge->work_next = ftail->work_next;
20319 fedge->work_prev = ftail;
20320 fedge->work_next->work_prev = fedge;
20321 fedge->work_prev->work_next = fedge;
20325 static struct flow_edge *scc_next_fedge(
20326 struct compile_state *state, struct scc_state *scc)
20328 struct flow_edge *fedge;
20329 fedge = scc->flow_work_list;
20331 fedge->work_next->work_prev = fedge->work_prev;
20332 fedge->work_prev->work_next = fedge->work_next;
20333 if (fedge->work_next != fedge) {
20334 scc->flow_work_list = fedge->work_next;
20336 scc->flow_work_list = 0;
20338 fedge->work_next = fedge->work_prev = fedge;
20343 static void scc_add_sedge(struct compile_state *state, struct scc_state *scc,
20344 struct ssa_edge *sedge)
20346 if (state->compiler->debug & DEBUG_SCC_TRANSFORM2) {
20347 fprintf(state->errout, "adding sedge: %5ld (%4d -> %5d)\n",
20348 (long)(sedge - scc->ssa_edges),
20349 sedge->src->def->id,
20350 sedge->dst->def->id);
20352 if ((sedge == scc->ssa_work_list) ||
20353 (sedge->work_next != sedge) ||
20354 (sedge->work_prev != sedge)) {
20356 if (state->compiler->debug & DEBUG_SCC_TRANSFORM2) {
20357 fprintf(state->errout, "dupped sedge: %5ld\n",
20358 (long)(sedge - scc->ssa_edges));
20362 if (!scc->ssa_work_list) {
20363 scc->ssa_work_list = sedge;
20364 sedge->work_next = sedge->work_prev = sedge;
20367 struct ssa_edge *stail;
20368 stail = scc->ssa_work_list->work_prev;
20369 sedge->work_next = stail->work_next;
20370 sedge->work_prev = stail;
20371 sedge->work_next->work_prev = sedge;
20372 sedge->work_prev->work_next = sedge;
20376 static struct ssa_edge *scc_next_sedge(
20377 struct compile_state *state, struct scc_state *scc)
20379 struct ssa_edge *sedge;
20380 sedge = scc->ssa_work_list;
20382 sedge->work_next->work_prev = sedge->work_prev;
20383 sedge->work_prev->work_next = sedge->work_next;
20384 if (sedge->work_next != sedge) {
20385 scc->ssa_work_list = sedge->work_next;
20387 scc->ssa_work_list = 0;
20389 sedge->work_next = sedge->work_prev = sedge;
20394 static void initialize_scc_state(
20395 struct compile_state *state, struct scc_state *scc)
20397 int ins_count, ssa_edge_count;
20398 int ins_index, ssa_edge_index, fblock_index;
20399 struct triple *first, *ins;
20400 struct block *block;
20401 struct flow_block *fblock;
20403 memset(scc, 0, sizeof(*scc));
20405 /* Inialize pass zero find out how much memory we need */
20406 first = state->first;
20408 ins_count = ssa_edge_count = 0;
20410 struct triple_set *edge;
20412 for(edge = ins->use; edge; edge = edge->next) {
20416 } while(ins != first);
20417 if (state->compiler->debug & DEBUG_SCC_TRANSFORM) {
20418 fprintf(state->errout, "ins_count: %d ssa_edge_count: %d vertex_count: %d\n",
20419 ins_count, ssa_edge_count, state->bb.last_vertex);
20421 scc->ins_count = ins_count;
20423 xcmalloc(sizeof(*scc->lattice)*(ins_count + 1), "lattice");
20425 xcmalloc(sizeof(*scc->ssa_edges)*(ssa_edge_count + 1), "ssa_edges");
20427 xcmalloc(sizeof(*scc->flow_blocks)*(state->bb.last_vertex + 1),
20430 /* Initialize pass one collect up the nodes */
20433 ins_index = ssa_edge_index = fblock_index = 0;
20436 if ((ins->op == OP_LABEL) && (block != ins->u.block)) {
20437 block = ins->u.block;
20439 internal_error(state, ins, "label without block");
20442 block->vertex = fblock_index;
20443 fblock = &scc->flow_blocks[fblock_index];
20444 fblock->block = block;
20445 fblock->edges = xcmalloc(sizeof(*fblock->edges)*block->edge_count,
20449 struct lattice_node *lnode;
20451 lnode = &scc->lattice[ins_index];
20454 lnode->fblock = fblock;
20455 lnode->val = ins; /* LATTICE HIGH */
20456 if (lnode->val->op == OP_UNKNOWNVAL) {
20457 lnode->val = 0; /* LATTICE LOW by definition */
20459 lnode->old_id = ins->id;
20460 ins->id = ins_index;
20463 } while(ins != first);
20464 /* Initialize pass two collect up the edges */
20470 struct triple_set *edge;
20471 struct ssa_edge **stail;
20472 struct lattice_node *lnode;
20473 lnode = &scc->lattice[ins->id];
20475 stail = &lnode->out;
20476 for(edge = ins->use; edge; edge = edge->next) {
20477 struct ssa_edge *sedge;
20478 ssa_edge_index += 1;
20479 sedge = &scc->ssa_edges[ssa_edge_index];
20481 stail = &sedge->out_next;
20482 sedge->src = lnode;
20483 sedge->dst = &scc->lattice[edge->member->id];
20484 sedge->work_next = sedge->work_prev = sedge;
20485 sedge->out_next = 0;
20488 if ((ins->op == OP_LABEL) && (block != ins->u.block)) {
20489 struct flow_edge *fedge, **ftail;
20490 struct block_set *bedge;
20491 block = ins->u.block;
20492 fblock = &scc->flow_blocks[block->vertex];
20495 ftail = &fblock->out;
20497 fedge = fblock->edges;
20498 bedge = block->edges;
20499 for(; bedge; bedge = bedge->next, fedge++) {
20500 fedge->dst = &scc->flow_blocks[bedge->member->vertex];
20501 if (fedge->dst->block != bedge->member) {
20502 internal_error(state, 0, "block mismatch");
20505 ftail = &fedge->out_next;
20506 fedge->out_next = 0;
20508 for(fedge = fblock->out; fedge; fedge = fedge->out_next) {
20509 fedge->src = fblock;
20510 fedge->work_next = fedge->work_prev = fedge;
20511 fedge->executable = 0;
20515 } while (ins != first);
20520 if ((ins->op == OP_LABEL) && (block != ins->u.block)) {
20521 struct flow_edge **ftail;
20522 struct block_set *bedge;
20523 block = ins->u.block;
20524 fblock = &scc->flow_blocks[block->vertex];
20525 ftail = &fblock->in;
20526 for(bedge = block->use; bedge; bedge = bedge->next) {
20527 struct block *src_block;
20528 struct flow_block *sfblock;
20529 struct flow_edge *sfedge;
20530 src_block = bedge->member;
20531 sfblock = &scc->flow_blocks[src_block->vertex];
20532 for(sfedge = sfblock->out; sfedge; sfedge = sfedge->out_next) {
20533 if (sfedge->dst == fblock) {
20538 internal_error(state, 0, "edge mismatch");
20541 ftail = &sfedge->in_next;
20542 sfedge->in_next = 0;
20546 } while(ins != first);
20547 /* Setup a dummy block 0 as a node above the start node */
20549 struct flow_block *fblock, *dst;
20550 struct flow_edge *fedge;
20551 fblock = &scc->flow_blocks[0];
20553 fblock->edges = xcmalloc(sizeof(*fblock->edges)*1, "flow_edges");
20555 fblock->out = fblock->edges;
20556 dst = &scc->flow_blocks[state->bb.first_block->vertex];
20557 fedge = fblock->edges;
20558 fedge->src = fblock;
20560 fedge->work_next = fedge;
20561 fedge->work_prev = fedge;
20562 fedge->in_next = fedge->dst->in;
20563 fedge->out_next = 0;
20564 fedge->executable = 0;
20565 fedge->dst->in = fedge;
20567 /* Initialize the work lists */
20568 scc->flow_work_list = 0;
20569 scc->ssa_work_list = 0;
20570 scc_add_fedge(state, scc, fedge);
20572 if (state->compiler->debug & DEBUG_SCC_TRANSFORM) {
20573 fprintf(state->errout, "ins_index: %d ssa_edge_index: %d fblock_index: %d\n",
20574 ins_index, ssa_edge_index, fblock_index);
20579 static void free_scc_state(
20580 struct compile_state *state, struct scc_state *scc)
20583 for(i = 0; i < state->bb.last_vertex + 1; i++) {
20584 struct flow_block *fblock;
20585 fblock = &scc->flow_blocks[i];
20586 if (fblock->edges) {
20587 xfree(fblock->edges);
20591 xfree(scc->flow_blocks);
20592 xfree(scc->ssa_edges);
20593 xfree(scc->lattice);
20597 static struct lattice_node *triple_to_lattice(
20598 struct compile_state *state, struct scc_state *scc, struct triple *ins)
20600 if (ins->id <= 0) {
20601 internal_error(state, ins, "bad id");
20603 return &scc->lattice[ins->id];
20606 static struct triple *preserve_lval(
20607 struct compile_state *state, struct lattice_node *lnode)
20609 struct triple *old;
20610 /* Preserve the original value */
20612 old = dup_triple(state, lnode->val);
20613 if (lnode->val != lnode->def) {
20623 static int lval_changed(struct compile_state *state,
20624 struct triple *old, struct lattice_node *lnode)
20627 /* See if the lattice value has changed */
20629 if (!old && !lnode->val) {
20633 lnode->val && old &&
20634 (memcmp(lnode->val->param, old->param,
20635 TRIPLE_SIZE(lnode->val) * sizeof(lnode->val->param[0])) == 0) &&
20636 (memcmp(&lnode->val->u, &old->u, sizeof(old->u)) == 0)) {
20646 static void scc_debug_lnode(
20647 struct compile_state *state, struct scc_state *scc,
20648 struct lattice_node *lnode, int changed)
20650 if ((state->compiler->debug & DEBUG_SCC_TRANSFORM2) && lnode->val) {
20651 display_triple_changes(state->errout, lnode->val, lnode->def);
20653 if (state->compiler->debug & DEBUG_SCC_TRANSFORM) {
20654 FILE *fp = state->errout;
20655 struct triple *val, **expr;
20656 val = lnode->val? lnode->val : lnode->def;
20657 fprintf(fp, "%p %s %3d %10s (",
20659 ((lnode->def->op == OP_PHI)? "phi: ": "expr:"),
20661 tops(lnode->def->op));
20662 expr = triple_rhs(state, lnode->def, 0);
20663 for(;expr;expr = triple_rhs(state, lnode->def, expr)) {
20665 fprintf(fp, " %d", (*expr)->id);
20668 if (val->op == OP_INTCONST) {
20669 fprintf(fp, " <0x%08lx>", (unsigned long)(val->u.cval));
20671 fprintf(fp, " ) -> %s %s\n",
20672 (is_lattice_hi(state, lnode)? "hi":
20673 is_lattice_const(state, lnode)? "const" : "lo"),
20674 changed? "changed" : ""
20679 static int compute_lnode_val(struct compile_state *state, struct scc_state *scc,
20680 struct lattice_node *lnode)
20683 struct triple *old, *scratch;
20684 struct triple **dexpr, **vexpr;
20687 /* Store the original value */
20688 old = preserve_lval(state, lnode);
20690 /* Reinitialize the value */
20691 lnode->val = scratch = dup_triple(state, lnode->def);
20692 scratch->id = lnode->old_id;
20693 scratch->next = scratch;
20694 scratch->prev = scratch;
20697 count = TRIPLE_SIZE(scratch);
20698 for(i = 0; i < count; i++) {
20699 dexpr = &lnode->def->param[i];
20700 vexpr = &scratch->param[i];
20702 if (((i < TRIPLE_MISC_OFF(scratch)) ||
20703 (i >= TRIPLE_TARG_OFF(scratch))) &&
20705 struct lattice_node *tmp;
20706 tmp = triple_to_lattice(state, scc, *dexpr);
20707 *vexpr = (tmp->val)? tmp->val : tmp->def;
20710 if (triple_is_branch(state, scratch)) {
20711 scratch->next = lnode->def->next;
20713 /* Recompute the value */
20714 #if DEBUG_ROMCC_WARNINGS
20715 #warning "FIXME see if simplify does anything bad"
20717 /* So far it looks like only the strength reduction
20718 * optimization are things I need to worry about.
20720 simplify(state, scratch);
20721 /* Cleanup my value */
20722 if (scratch->use) {
20723 internal_error(state, lnode->def, "scratch used?");
20725 if ((scratch->prev != scratch) ||
20726 ((scratch->next != scratch) &&
20727 (!triple_is_branch(state, lnode->def) ||
20728 (scratch->next != lnode->def->next)))) {
20729 internal_error(state, lnode->def, "scratch in list?");
20731 /* undo any uses... */
20732 count = TRIPLE_SIZE(scratch);
20733 for(i = 0; i < count; i++) {
20734 vexpr = &scratch->param[i];
20736 unuse_triple(*vexpr, scratch);
20739 if (lnode->val->op == OP_UNKNOWNVAL) {
20740 lnode->val = 0; /* Lattice low by definition */
20742 /* Find the case when I am lattice high */
20744 (lnode->val->op == lnode->def->op) &&
20745 (memcmp(lnode->val->param, lnode->def->param,
20746 count * sizeof(lnode->val->param[0])) == 0) &&
20747 (memcmp(&lnode->val->u, &lnode->def->u, sizeof(lnode->def->u)) == 0)) {
20748 lnode->val = lnode->def;
20750 /* Only allow lattice high when all of my inputs
20751 * are also lattice high. Occassionally I can
20752 * have constants with a lattice low input, so
20753 * I do not need to check that case.
20755 if (is_lattice_hi(state, lnode)) {
20756 struct lattice_node *tmp;
20758 rhs = lnode->val->rhs;
20759 for(i = 0; i < rhs; i++) {
20760 tmp = triple_to_lattice(state, scc, RHS(lnode->val, i));
20761 if (!is_lattice_hi(state, tmp)) {
20767 /* Find the cases that are always lattice lo */
20769 triple_is_def(state, lnode->val) &&
20770 !triple_is_pure(state, lnode->val, lnode->old_id)) {
20773 /* See if the lattice value has changed */
20774 changed = lval_changed(state, old, lnode);
20775 /* See if this value should not change */
20776 if ((lnode->val != lnode->def) &&
20777 (( !triple_is_def(state, lnode->def) &&
20778 !triple_is_cbranch(state, lnode->def)) ||
20779 (lnode->def->op == OP_PIECE))) {
20780 #if DEBUG_ROMCC_WARNINGS
20781 #warning "FIXME constant propogate through expressions with multiple left hand sides"
20784 internal_warning(state, lnode->def, "non def changes value?");
20789 /* See if we need to free the scratch value */
20790 if (lnode->val != scratch) {
20798 static void scc_visit_cbranch(struct compile_state *state, struct scc_state *scc,
20799 struct lattice_node *lnode)
20801 struct lattice_node *cond;
20802 struct flow_edge *left, *right;
20805 /* Update the branch value */
20806 changed = compute_lnode_val(state, scc, lnode);
20807 scc_debug_lnode(state, scc, lnode, changed);
20809 /* This only applies to conditional branches */
20810 if (!triple_is_cbranch(state, lnode->def)) {
20811 internal_error(state, lnode->def, "not a conditional branch");
20814 if (state->compiler->debug & DEBUG_SCC_TRANSFORM) {
20815 struct flow_edge *fedge;
20816 FILE *fp = state->errout;
20817 fprintf(fp, "%s: %d (",
20818 tops(lnode->def->op),
20821 for(fedge = lnode->fblock->out; fedge; fedge = fedge->out_next) {
20822 fprintf(fp, " %d", fedge->dst->block->vertex);
20825 if (lnode->def->rhs > 0) {
20826 fprintf(fp, " <- %d",
20827 RHS(lnode->def, 0)->id);
20831 cond = triple_to_lattice(state, scc, RHS(lnode->def,0));
20832 for(left = cond->fblock->out; left; left = left->out_next) {
20833 if (left->dst->block->first == lnode->def->next) {
20838 internal_error(state, lnode->def, "Cannot find left branch edge");
20840 for(right = cond->fblock->out; right; right = right->out_next) {
20841 if (right->dst->block->first == TARG(lnode->def, 0)) {
20846 internal_error(state, lnode->def, "Cannot find right branch edge");
20848 /* I should only come here if the controlling expressions value
20849 * has changed, which means it must be either a constant or lo.
20851 if (is_lattice_hi(state, cond)) {
20852 internal_error(state, cond->def, "condition high?");
20855 if (is_lattice_lo(state, cond)) {
20856 scc_add_fedge(state, scc, left);
20857 scc_add_fedge(state, scc, right);
20859 else if (cond->val->u.cval) {
20860 scc_add_fedge(state, scc, right);
20862 scc_add_fedge(state, scc, left);
20868 static void scc_add_sedge_dst(struct compile_state *state,
20869 struct scc_state *scc, struct ssa_edge *sedge)
20871 if (triple_is_cbranch(state, sedge->dst->def)) {
20872 scc_visit_cbranch(state, scc, sedge->dst);
20874 else if (triple_is_def(state, sedge->dst->def)) {
20875 scc_add_sedge(state, scc, sedge);
20879 static void scc_visit_phi(struct compile_state *state, struct scc_state *scc,
20880 struct lattice_node *lnode)
20882 struct lattice_node *tmp;
20883 struct triple **slot, *old;
20884 struct flow_edge *fedge;
20887 if (lnode->def->op != OP_PHI) {
20888 internal_error(state, lnode->def, "not phi");
20890 /* Store the original value */
20891 old = preserve_lval(state, lnode);
20893 /* default to lattice high */
20894 lnode->val = lnode->def;
20895 slot = &RHS(lnode->def, 0);
20897 for(fedge = lnode->fblock->in; fedge; index++, fedge = fedge->in_next) {
20898 if (state->compiler->debug & DEBUG_SCC_TRANSFORM) {
20899 fprintf(state->errout, "Examining edge: %d vertex: %d executable: %d\n",
20901 fedge->dst->block->vertex,
20905 if (!fedge->executable) {
20908 if (!slot[index]) {
20909 internal_error(state, lnode->def, "no phi value");
20911 tmp = triple_to_lattice(state, scc, slot[index]);
20912 /* meet(X, lattice low) = lattice low */
20913 if (is_lattice_lo(state, tmp)) {
20916 /* meet(X, lattice high) = X */
20917 else if (is_lattice_hi(state, tmp)) {
20918 lnode->val = lnode->val;
20920 /* meet(lattice high, X) = X */
20921 else if (is_lattice_hi(state, lnode)) {
20922 lnode->val = dup_triple(state, tmp->val);
20923 /* Only change the type if necessary */
20924 if (!is_subset_type(lnode->def->type, tmp->val->type)) {
20925 lnode->val->type = lnode->def->type;
20928 /* meet(const, const) = const or lattice low */
20929 else if (!constants_equal(state, lnode->val, tmp->val)) {
20933 /* meet(lattice low, X) = lattice low */
20934 if (is_lattice_lo(state, lnode)) {
20939 changed = lval_changed(state, old, lnode);
20940 scc_debug_lnode(state, scc, lnode, changed);
20942 /* If the lattice value has changed update the work lists. */
20944 struct ssa_edge *sedge;
20945 for(sedge = lnode->out; sedge; sedge = sedge->out_next) {
20946 scc_add_sedge_dst(state, scc, sedge);
20952 static void scc_visit_expr(struct compile_state *state, struct scc_state *scc,
20953 struct lattice_node *lnode)
20957 if (!triple_is_def(state, lnode->def)) {
20958 internal_warning(state, lnode->def, "not visiting an expression?");
20960 changed = compute_lnode_val(state, scc, lnode);
20961 scc_debug_lnode(state, scc, lnode, changed);
20964 struct ssa_edge *sedge;
20965 for(sedge = lnode->out; sedge; sedge = sedge->out_next) {
20966 scc_add_sedge_dst(state, scc, sedge);
20971 static void scc_writeback_values(
20972 struct compile_state *state, struct scc_state *scc)
20974 struct triple *first, *ins;
20975 first = state->first;
20978 struct lattice_node *lnode;
20979 lnode = triple_to_lattice(state, scc, ins);
20980 if (state->compiler->debug & DEBUG_SCC_TRANSFORM) {
20981 if (is_lattice_hi(state, lnode) &&
20982 (lnode->val->op != OP_NOOP))
20984 struct flow_edge *fedge;
20987 for(fedge = lnode->fblock->in;
20988 !executable && fedge; fedge = fedge->in_next) {
20989 executable |= fedge->executable;
20992 internal_warning(state, lnode->def,
20993 "lattice node %d %s->%s still high?",
20995 tops(lnode->def->op),
20996 tops(lnode->val->op));
21002 ins->id = lnode->old_id;
21003 if (lnode->val && (lnode->val != ins)) {
21004 /* See if it something I know how to write back */
21005 switch(lnode->val->op) {
21007 mkconst(state, ins, lnode->val->u.cval);
21010 mkaddr_const(state, ins,
21011 MISC(lnode->val, 0), lnode->val->u.cval);
21014 /* By default don't copy the changes,
21015 * recompute them in place instead.
21017 simplify(state, ins);
21020 if (is_const(lnode->val) &&
21021 !constants_equal(state, lnode->val, ins)) {
21022 internal_error(state, 0, "constants not equal");
21024 /* Free the lattice nodes */
21029 } while(ins != first);
21032 static void scc_transform(struct compile_state *state)
21034 struct scc_state scc;
21035 if (!(state->compiler->flags & COMPILER_SCC_TRANSFORM)) {
21039 initialize_scc_state(state, &scc);
21041 while(scc.flow_work_list || scc.ssa_work_list) {
21042 struct flow_edge *fedge;
21043 struct ssa_edge *sedge;
21044 struct flow_edge *fptr;
21045 while((fedge = scc_next_fedge(state, &scc))) {
21046 struct block *block;
21047 struct triple *ptr;
21048 struct flow_block *fblock;
21051 if (fedge->executable) {
21055 internal_error(state, 0, "fedge without dst");
21058 internal_error(state, 0, "fedge without src");
21060 fedge->executable = 1;
21061 fblock = fedge->dst;
21062 block = fblock->block;
21064 for(fptr = fblock->in; fptr; fptr = fptr->in_next) {
21065 if (fptr->executable) {
21070 if (state->compiler->debug & DEBUG_SCC_TRANSFORM) {
21071 fprintf(state->errout, "vertex: %d reps: %d\n",
21072 block->vertex, reps);
21076 for(ptr = block->first; !done; ptr = ptr->next) {
21077 struct lattice_node *lnode;
21078 done = (ptr == block->last);
21079 lnode = &scc.lattice[ptr->id];
21080 if (ptr->op == OP_PHI) {
21081 scc_visit_phi(state, &scc, lnode);
21083 else if ((reps == 1) && triple_is_def(state, ptr))
21085 scc_visit_expr(state, &scc, lnode);
21088 /* Add unconditional branch edges */
21089 if (!triple_is_cbranch(state, fblock->block->last)) {
21090 struct flow_edge *out;
21091 for(out = fblock->out; out; out = out->out_next) {
21092 scc_add_fedge(state, &scc, out);
21096 while((sedge = scc_next_sedge(state, &scc))) {
21097 struct lattice_node *lnode;
21098 struct flow_block *fblock;
21099 lnode = sedge->dst;
21100 fblock = lnode->fblock;
21102 if (state->compiler->debug & DEBUG_SCC_TRANSFORM) {
21103 fprintf(state->errout, "sedge: %5ld (%5d -> %5d)\n",
21104 (unsigned long)sedge - (unsigned long)scc.ssa_edges,
21105 sedge->src->def->id,
21106 sedge->dst->def->id);
21109 if (lnode->def->op == OP_PHI) {
21110 scc_visit_phi(state, &scc, lnode);
21113 for(fptr = fblock->in; fptr; fptr = fptr->in_next) {
21114 if (fptr->executable) {
21119 scc_visit_expr(state, &scc, lnode);
21125 scc_writeback_values(state, &scc);
21126 free_scc_state(state, &scc);
21127 rebuild_ssa_form(state);
21129 print_blocks(state, __func__, state->dbgout);
21133 static void transform_to_arch_instructions(struct compile_state *state)
21135 struct triple *ins, *first;
21136 first = state->first;
21139 ins = transform_to_arch_instruction(state, ins);
21140 } while(ins != first);
21142 print_blocks(state, __func__, state->dbgout);
21145 #if DEBUG_CONSISTENCY
21146 static void verify_uses(struct compile_state *state)
21148 struct triple *first, *ins;
21149 struct triple_set *set;
21150 first = state->first;
21153 struct triple **expr;
21154 expr = triple_rhs(state, ins, 0);
21155 for(; expr; expr = triple_rhs(state, ins, expr)) {
21156 struct triple *rhs;
21158 for(set = rhs?rhs->use:0; set; set = set->next) {
21159 if (set->member == ins) {
21164 internal_error(state, ins, "rhs not used");
21167 expr = triple_lhs(state, ins, 0);
21168 for(; expr; expr = triple_lhs(state, ins, expr)) {
21169 struct triple *lhs;
21171 for(set = lhs?lhs->use:0; set; set = set->next) {
21172 if (set->member == ins) {
21177 internal_error(state, ins, "lhs not used");
21180 expr = triple_misc(state, ins, 0);
21181 if (ins->op != OP_PHI) {
21182 for(; expr; expr = triple_targ(state, ins, expr)) {
21183 struct triple *misc;
21185 for(set = misc?misc->use:0; set; set = set->next) {
21186 if (set->member == ins) {
21191 internal_error(state, ins, "misc not used");
21195 if (!triple_is_ret(state, ins)) {
21196 expr = triple_targ(state, ins, 0);
21197 for(; expr; expr = triple_targ(state, ins, expr)) {
21198 struct triple *targ;
21200 for(set = targ?targ->use:0; set; set = set->next) {
21201 if (set->member == ins) {
21206 internal_error(state, ins, "targ not used");
21211 } while(ins != first);
21214 static void verify_blocks_present(struct compile_state *state)
21216 struct triple *first, *ins;
21217 if (!state->bb.first_block) {
21220 first = state->first;
21223 valid_ins(state, ins);
21224 if (triple_stores_block(state, ins)) {
21225 if (!ins->u.block) {
21226 internal_error(state, ins,
21227 "%p not in a block?", ins);
21231 } while(ins != first);
21236 static int edge_present(struct compile_state *state, struct block *block, struct triple *edge)
21238 struct block_set *bedge;
21239 struct block *targ;
21240 targ = block_of_triple(state, edge);
21241 for(bedge = block->edges; bedge; bedge = bedge->next) {
21242 if (bedge->member == targ) {
21249 static void verify_blocks(struct compile_state *state)
21251 struct triple *ins;
21252 struct block *block;
21254 block = state->bb.first_block;
21261 struct block_set *user, *edge;
21263 for(ins = block->first; ins != block->last->next; ins = ins->next) {
21264 if (triple_stores_block(state, ins) && (ins->u.block != block)) {
21265 internal_error(state, ins, "inconsitent block specified");
21267 valid_ins(state, ins);
21270 for(user = block->use; user; user = user->next) {
21272 if (!user->member->first) {
21273 internal_error(state, block->first, "user is empty");
21275 if ((block == state->bb.last_block) &&
21276 (user->member == state->bb.first_block)) {
21279 for(edge = user->member->edges; edge; edge = edge->next) {
21280 if (edge->member == block) {
21285 internal_error(state, user->member->first,
21286 "user does not use block");
21289 if (triple_is_branch(state, block->last)) {
21290 struct triple **expr;
21291 expr = triple_edge_targ(state, block->last, 0);
21292 for(;expr; expr = triple_edge_targ(state, block->last, expr)) {
21293 if (*expr && !edge_present(state, block, *expr)) {
21294 internal_error(state, block->last, "no edge to targ");
21298 if (!triple_is_ubranch(state, block->last) &&
21299 (block != state->bb.last_block) &&
21300 !edge_present(state, block, block->last->next)) {
21301 internal_error(state, block->last, "no edge to block->last->next");
21303 for(edge = block->edges; edge; edge = edge->next) {
21304 for(user = edge->member->use; user; user = user->next) {
21305 if (user->member == block) {
21309 if (!user || user->member != block) {
21310 internal_error(state, block->first,
21311 "block does not use edge");
21313 if (!edge->member->first) {
21314 internal_error(state, block->first, "edge block is empty");
21317 if (block->users != users) {
21318 internal_error(state, block->first,
21319 "computed users %d != stored users %d",
21320 users, block->users);
21322 if (!triple_stores_block(state, block->last->next)) {
21323 internal_error(state, block->last->next,
21324 "cannot find next block");
21326 block = block->last->next->u.block;
21328 internal_error(state, block->last->next,
21331 } while(block != state->bb.first_block);
21332 if (blocks != state->bb.last_vertex) {
21333 internal_error(state, 0, "computed blocks: %d != stored blocks %d",
21334 blocks, state->bb.last_vertex);
21338 static void verify_domination(struct compile_state *state)
21340 struct triple *first, *ins;
21341 struct triple_set *set;
21342 if (!state->bb.first_block) {
21346 first = state->first;
21349 for(set = ins->use; set; set = set->next) {
21350 struct triple **slot;
21351 struct triple *use_point;
21354 zrhs = set->member->rhs;
21355 slot = &RHS(set->member, 0);
21356 /* See if the use is on the right hand side */
21357 for(i = 0; i < zrhs; i++) {
21358 if (slot[i] == ins) {
21363 use_point = set->member;
21364 if (set->member->op == OP_PHI) {
21365 struct block_set *bset;
21367 bset = set->member->u.block->use;
21368 for(edge = 0; bset && (edge < i); edge++) {
21372 internal_error(state, set->member,
21373 "no edge for phi rhs %d", i);
21375 use_point = bset->member->last;
21379 !tdominates(state, ins, use_point)) {
21380 if (is_const(ins)) {
21381 internal_warning(state, ins,
21382 "non dominated rhs use point %p?", use_point);
21385 internal_error(state, ins,
21386 "non dominated rhs use point %p?", use_point);
21391 } while(ins != first);
21394 static void verify_rhs(struct compile_state *state)
21396 struct triple *first, *ins;
21397 first = state->first;
21400 struct triple **slot;
21403 slot = &RHS(ins, 0);
21404 for(i = 0; i < zrhs; i++) {
21405 if (slot[i] == 0) {
21406 internal_error(state, ins,
21407 "missing rhs %d on %s",
21410 if ((ins->op != OP_PHI) && (slot[i] == ins)) {
21411 internal_error(state, ins,
21412 "ins == rhs[%d] on %s",
21417 } while(ins != first);
21420 static void verify_piece(struct compile_state *state)
21422 struct triple *first, *ins;
21423 first = state->first;
21426 struct triple *ptr;
21429 for(ptr = ins->next, i = 0; i < lhs; i++, ptr = ptr->next) {
21430 if (ptr != LHS(ins, i)) {
21431 internal_error(state, ins, "malformed lhs on %s",
21434 if (ptr->op != OP_PIECE) {
21435 internal_error(state, ins, "bad lhs op %s at %d on %s",
21436 tops(ptr->op), i, tops(ins->op));
21438 if (ptr->u.cval != i) {
21439 internal_error(state, ins, "bad u.cval of %d %d expected",
21444 } while(ins != first);
21447 static void verify_ins_colors(struct compile_state *state)
21449 struct triple *first, *ins;
21451 first = state->first;
21455 } while(ins != first);
21458 static void verify_unknown(struct compile_state *state)
21460 struct triple *first, *ins;
21461 if ( (unknown_triple.next != &unknown_triple) ||
21462 (unknown_triple.prev != &unknown_triple) ||
21464 (unknown_triple.use != 0) ||
21466 (unknown_triple.op != OP_UNKNOWNVAL) ||
21467 (unknown_triple.lhs != 0) ||
21468 (unknown_triple.rhs != 0) ||
21469 (unknown_triple.misc != 0) ||
21470 (unknown_triple.targ != 0) ||
21471 (unknown_triple.template_id != 0) ||
21472 (unknown_triple.id != -1) ||
21473 (unknown_triple.type != &unknown_type) ||
21474 (unknown_triple.occurance != &dummy_occurance) ||
21475 (unknown_triple.param[0] != 0) ||
21476 (unknown_triple.param[1] != 0)) {
21477 internal_error(state, &unknown_triple, "unknown_triple corrupted!");
21479 if ( (dummy_occurance.count != 2) ||
21480 (strcmp(dummy_occurance.filename, __FILE__) != 0) ||
21481 (strcmp(dummy_occurance.function, "") != 0) ||
21482 (dummy_occurance.col != 0) ||
21483 (dummy_occurance.parent != 0)) {
21484 internal_error(state, &unknown_triple, "dummy_occurance corrupted!");
21486 if ( (unknown_type.type != TYPE_UNKNOWN)) {
21487 internal_error(state, &unknown_triple, "unknown_type corrupted!");
21489 first = state->first;
21493 if (ins == &unknown_triple) {
21494 internal_error(state, ins, "unknown triple in list");
21496 params = TRIPLE_SIZE(ins);
21497 for(i = 0; i < params; i++) {
21498 if (ins->param[i] == &unknown_triple) {
21499 internal_error(state, ins, "unknown triple used!");
21503 } while(ins != first);
21506 static void verify_types(struct compile_state *state)
21508 struct triple *first, *ins;
21509 first = state->first;
21512 struct type *invalid;
21513 invalid = invalid_type(state, ins->type);
21515 FILE *fp = state->errout;
21516 fprintf(fp, "type: ");
21517 name_of(fp, ins->type);
21519 fprintf(fp, "invalid type: ");
21520 name_of(fp, invalid);
21522 internal_error(state, ins, "invalid ins type");
21524 } while(ins != first);
21527 static void verify_copy(struct compile_state *state)
21529 struct triple *first, *ins, *next;
21530 first = state->first;
21531 next = ins = first;
21535 if (ins->op != OP_COPY) {
21538 if (!equiv_types(ins->type, RHS(ins, 0)->type)) {
21539 FILE *fp = state->errout;
21540 fprintf(fp, "src type: ");
21541 name_of(fp, RHS(ins, 0)->type);
21543 fprintf(fp, "dst type: ");
21544 name_of(fp, ins->type);
21546 internal_error(state, ins, "type mismatch in copy");
21548 } while(next != first);
21551 static void verify_consistency(struct compile_state *state)
21553 verify_unknown(state);
21554 verify_uses(state);
21555 verify_blocks_present(state);
21556 verify_blocks(state);
21557 verify_domination(state);
21559 verify_piece(state);
21560 verify_ins_colors(state);
21561 verify_types(state);
21562 verify_copy(state);
21563 if (state->compiler->debug & DEBUG_VERIFICATION) {
21564 fprintf(state->dbgout, "consistency verified\n");
21568 static void verify_consistency(struct compile_state *state) {}
21569 #endif /* DEBUG_CONSISTENCY */
21571 static void optimize(struct compile_state *state)
21573 /* Join all of the functions into one giant function */
21574 join_functions(state);
21576 /* Dump what the instruction graph intially looks like */
21577 print_triples(state);
21579 /* Replace structures with simpler data types */
21580 decompose_compound_types(state);
21581 print_triples(state);
21583 verify_consistency(state);
21584 /* Analyze the intermediate code */
21585 state->bb.first = state->first;
21586 analyze_basic_blocks(state, &state->bb);
21588 /* Transform the code to ssa form. */
21590 * The transformation to ssa form puts a phi function
21591 * on each of edge of a dominance frontier where that
21592 * phi function might be needed. At -O2 if we don't
21593 * eleminate the excess phi functions we can get an
21594 * exponential code size growth. So I kill the extra
21595 * phi functions early and I kill them often.
21597 transform_to_ssa_form(state);
21598 verify_consistency(state);
21600 /* Remove dead code */
21601 eliminate_inefectual_code(state);
21602 verify_consistency(state);
21604 /* Do strength reduction and simple constant optimizations */
21605 simplify_all(state);
21606 verify_consistency(state);
21607 /* Propogate constants throughout the code */
21608 scc_transform(state);
21609 verify_consistency(state);
21610 #if DEBUG_ROMCC_WARNINGS
21611 #warning "WISHLIST implement single use constants (least possible register pressure)"
21612 #warning "WISHLIST implement induction variable elimination"
21614 /* Select architecture instructions and an initial partial
21615 * coloring based on architecture constraints.
21617 transform_to_arch_instructions(state);
21618 verify_consistency(state);
21620 /* Remove dead code */
21621 eliminate_inefectual_code(state);
21622 verify_consistency(state);
21624 /* Color all of the variables to see if they will fit in registers */
21625 insert_copies_to_phi(state);
21626 verify_consistency(state);
21628 insert_mandatory_copies(state);
21629 verify_consistency(state);
21631 allocate_registers(state);
21632 verify_consistency(state);
21634 /* Remove the optimization information.
21635 * This is more to check for memory consistency than to free memory.
21637 free_basic_blocks(state, &state->bb);
21640 static void print_op_asm(struct compile_state *state,
21641 struct triple *ins, FILE *fp)
21643 struct asm_info *info;
21645 unsigned lhs, rhs, i;
21646 info = ins->u.ainfo;
21649 /* Don't count the clobbers in lhs */
21650 for(i = 0; i < lhs; i++) {
21651 if (LHS(ins, i)->type == &void_type) {
21656 fprintf(fp, "#ASM\n");
21658 for(ptr = info->str; *ptr; ptr++) {
21660 unsigned long param;
21661 struct triple *piece;
21671 param = strtoul(ptr, &next, 10);
21673 error(state, ins, "Invalid asm template");
21675 if (param >= (lhs + rhs)) {
21676 error(state, ins, "Invalid param %%%u in asm template",
21679 piece = (param < lhs)? LHS(ins, param) : RHS(ins, param - lhs);
21681 arch_reg_str(ID_REG(piece->id)));
21684 fprintf(fp, "\n#NOT ASM\n");
21688 /* Only use the low x86 byte registers. This allows me
21689 * allocate the entire register when a byte register is used.
21691 #define X86_4_8BIT_GPRS 1
21694 #define X86_MMX_REGS (1<<0)
21695 #define X86_XMM_REGS (1<<1)
21696 #define X86_NOOP_COPY (1<<2)
21698 /* The x86 register classes */
21699 #define REGC_FLAGS 0
21700 #define REGC_GPR8 1
21701 #define REGC_GPR16 2
21702 #define REGC_GPR32 3
21703 #define REGC_DIVIDEND64 4
21704 #define REGC_DIVIDEND32 5
21707 #define REGC_GPR32_8 8
21708 #define REGC_GPR16_8 9
21709 #define REGC_GPR8_LO 10
21710 #define REGC_IMM32 11
21711 #define REGC_IMM16 12
21712 #define REGC_IMM8 13
21713 #define LAST_REGC REGC_IMM8
21714 #if LAST_REGC >= MAX_REGC
21715 #error "MAX_REGC is to low"
21718 /* Register class masks */
21719 #define REGCM_FLAGS (1 << REGC_FLAGS)
21720 #define REGCM_GPR8 (1 << REGC_GPR8)
21721 #define REGCM_GPR16 (1 << REGC_GPR16)
21722 #define REGCM_GPR32 (1 << REGC_GPR32)
21723 #define REGCM_DIVIDEND64 (1 << REGC_DIVIDEND64)
21724 #define REGCM_DIVIDEND32 (1 << REGC_DIVIDEND32)
21725 #define REGCM_MMX (1 << REGC_MMX)
21726 #define REGCM_XMM (1 << REGC_XMM)
21727 #define REGCM_GPR32_8 (1 << REGC_GPR32_8)
21728 #define REGCM_GPR16_8 (1 << REGC_GPR16_8)
21729 #define REGCM_GPR8_LO (1 << REGC_GPR8_LO)
21730 #define REGCM_IMM32 (1 << REGC_IMM32)
21731 #define REGCM_IMM16 (1 << REGC_IMM16)
21732 #define REGCM_IMM8 (1 << REGC_IMM8)
21733 #define REGCM_ALL ((1 << (LAST_REGC + 1)) - 1)
21734 #define REGCM_IMMALL (REGCM_IMM32 | REGCM_IMM16 | REGCM_IMM8)
21736 /* The x86 registers */
21737 #define REG_EFLAGS 2
21738 #define REGC_FLAGS_FIRST REG_EFLAGS
21739 #define REGC_FLAGS_LAST REG_EFLAGS
21748 #define REGC_GPR8_LO_FIRST REG_AL
21749 #define REGC_GPR8_LO_LAST REG_DL
21750 #define REGC_GPR8_FIRST REG_AL
21751 #define REGC_GPR8_LAST REG_DH
21760 #define REGC_GPR16_FIRST REG_AX
21761 #define REGC_GPR16_LAST REG_SP
21770 #define REGC_GPR32_FIRST REG_EAX
21771 #define REGC_GPR32_LAST REG_ESP
21772 #define REG_EDXEAX 27
21773 #define REGC_DIVIDEND64_FIRST REG_EDXEAX
21774 #define REGC_DIVIDEND64_LAST REG_EDXEAX
21775 #define REG_DXAX 28
21776 #define REGC_DIVIDEND32_FIRST REG_DXAX
21777 #define REGC_DIVIDEND32_LAST REG_DXAX
21778 #define REG_MMX0 29
21779 #define REG_MMX1 30
21780 #define REG_MMX2 31
21781 #define REG_MMX3 32
21782 #define REG_MMX4 33
21783 #define REG_MMX5 34
21784 #define REG_MMX6 35
21785 #define REG_MMX7 36
21786 #define REGC_MMX_FIRST REG_MMX0
21787 #define REGC_MMX_LAST REG_MMX7
21788 #define REG_XMM0 37
21789 #define REG_XMM1 38
21790 #define REG_XMM2 39
21791 #define REG_XMM3 40
21792 #define REG_XMM4 41
21793 #define REG_XMM5 42
21794 #define REG_XMM6 43
21795 #define REG_XMM7 44
21796 #define REGC_XMM_FIRST REG_XMM0
21797 #define REGC_XMM_LAST REG_XMM7
21799 #if DEBUG_ROMCC_WARNINGS
21800 #warning "WISHLIST figure out how to use pinsrw and pextrw to better use extended regs"
21803 #define LAST_REG REG_XMM7
21805 #define REGC_GPR32_8_FIRST REG_EAX
21806 #define REGC_GPR32_8_LAST REG_EDX
21807 #define REGC_GPR16_8_FIRST REG_AX
21808 #define REGC_GPR16_8_LAST REG_DX
21810 #define REGC_IMM8_FIRST -1
21811 #define REGC_IMM8_LAST -1
21812 #define REGC_IMM16_FIRST -2
21813 #define REGC_IMM16_LAST -1
21814 #define REGC_IMM32_FIRST -4
21815 #define REGC_IMM32_LAST -1
21817 #if LAST_REG >= MAX_REGISTERS
21818 #error "MAX_REGISTERS to low"
21822 static unsigned regc_size[LAST_REGC +1] = {
21823 [REGC_FLAGS] = REGC_FLAGS_LAST - REGC_FLAGS_FIRST + 1,
21824 [REGC_GPR8] = REGC_GPR8_LAST - REGC_GPR8_FIRST + 1,
21825 [REGC_GPR16] = REGC_GPR16_LAST - REGC_GPR16_FIRST + 1,
21826 [REGC_GPR32] = REGC_GPR32_LAST - REGC_GPR32_FIRST + 1,
21827 [REGC_DIVIDEND64] = REGC_DIVIDEND64_LAST - REGC_DIVIDEND64_FIRST + 1,
21828 [REGC_DIVIDEND32] = REGC_DIVIDEND32_LAST - REGC_DIVIDEND32_FIRST + 1,
21829 [REGC_MMX] = REGC_MMX_LAST - REGC_MMX_FIRST + 1,
21830 [REGC_XMM] = REGC_XMM_LAST - REGC_XMM_FIRST + 1,
21831 [REGC_GPR32_8] = REGC_GPR32_8_LAST - REGC_GPR32_8_FIRST + 1,
21832 [REGC_GPR16_8] = REGC_GPR16_8_LAST - REGC_GPR16_8_FIRST + 1,
21833 [REGC_GPR8_LO] = REGC_GPR8_LO_LAST - REGC_GPR8_LO_FIRST + 1,
21839 static const struct {
21841 } regcm_bound[LAST_REGC + 1] = {
21842 [REGC_FLAGS] = { REGC_FLAGS_FIRST, REGC_FLAGS_LAST },
21843 [REGC_GPR8] = { REGC_GPR8_FIRST, REGC_GPR8_LAST },
21844 [REGC_GPR16] = { REGC_GPR16_FIRST, REGC_GPR16_LAST },
21845 [REGC_GPR32] = { REGC_GPR32_FIRST, REGC_GPR32_LAST },
21846 [REGC_DIVIDEND64] = { REGC_DIVIDEND64_FIRST, REGC_DIVIDEND64_LAST },
21847 [REGC_DIVIDEND32] = { REGC_DIVIDEND32_FIRST, REGC_DIVIDEND32_LAST },
21848 [REGC_MMX] = { REGC_MMX_FIRST, REGC_MMX_LAST },
21849 [REGC_XMM] = { REGC_XMM_FIRST, REGC_XMM_LAST },
21850 [REGC_GPR32_8] = { REGC_GPR32_8_FIRST, REGC_GPR32_8_LAST },
21851 [REGC_GPR16_8] = { REGC_GPR16_8_FIRST, REGC_GPR16_8_LAST },
21852 [REGC_GPR8_LO] = { REGC_GPR8_LO_FIRST, REGC_GPR8_LO_LAST },
21853 [REGC_IMM32] = { REGC_IMM32_FIRST, REGC_IMM32_LAST },
21854 [REGC_IMM16] = { REGC_IMM16_FIRST, REGC_IMM16_LAST },
21855 [REGC_IMM8] = { REGC_IMM8_FIRST, REGC_IMM8_LAST },
21858 #if ARCH_INPUT_REGS != 4
21859 #error ARCH_INPUT_REGS size mismatch
21861 static const struct reg_info arch_input_regs[ARCH_INPUT_REGS] = {
21862 { .reg = REG_EAX, .regcm = REGCM_GPR32 },
21863 { .reg = REG_EBX, .regcm = REGCM_GPR32 },
21864 { .reg = REG_ECX, .regcm = REGCM_GPR32 },
21865 { .reg = REG_EDX, .regcm = REGCM_GPR32 },
21868 #if ARCH_OUTPUT_REGS != 4
21869 #error ARCH_INPUT_REGS size mismatch
21871 static const struct reg_info arch_output_regs[ARCH_OUTPUT_REGS] = {
21872 { .reg = REG_EAX, .regcm = REGCM_GPR32 },
21873 { .reg = REG_EBX, .regcm = REGCM_GPR32 },
21874 { .reg = REG_ECX, .regcm = REGCM_GPR32 },
21875 { .reg = REG_EDX, .regcm = REGCM_GPR32 },
21878 static void init_arch_state(struct arch_state *arch)
21880 memset(arch, 0, sizeof(*arch));
21881 arch->features = 0;
21884 static const struct compiler_flag arch_flags[] = {
21885 { "mmx", X86_MMX_REGS },
21886 { "sse", X86_XMM_REGS },
21887 { "noop-copy", X86_NOOP_COPY },
21890 static const struct compiler_flag arch_cpus[] = {
21892 { "p2", X86_MMX_REGS },
21893 { "p3", X86_MMX_REGS | X86_XMM_REGS },
21894 { "p4", X86_MMX_REGS | X86_XMM_REGS },
21895 { "k7", X86_MMX_REGS },
21896 { "k8", X86_MMX_REGS | X86_XMM_REGS },
21897 { "c3", X86_MMX_REGS },
21898 { "c3-2", X86_MMX_REGS | X86_XMM_REGS }, /* Nehemiah */
21901 static int arch_encode_flag(struct arch_state *arch, const char *flag)
21908 if (strncmp(flag, "no-", 3) == 0) {
21912 if (act && strncmp(flag, "cpu=", 4) == 0) {
21914 result = set_flag(arch_cpus, &arch->features, 1, flag);
21917 result = set_flag(arch_flags, &arch->features, act, flag);
21922 static void arch_usage(FILE *fp)
21924 flag_usage(fp, arch_flags, "-m", "-mno-");
21925 flag_usage(fp, arch_cpus, "-mcpu=", 0);
21928 static unsigned arch_regc_size(struct compile_state *state, int class)
21930 if ((class < 0) || (class > LAST_REGC)) {
21933 return regc_size[class];
21936 static int arch_regcm_intersect(unsigned regcm1, unsigned regcm2)
21938 /* See if two register classes may have overlapping registers */
21939 unsigned gpr_mask = REGCM_GPR8 | REGCM_GPR8_LO | REGCM_GPR16_8 | REGCM_GPR16 |
21940 REGCM_GPR32_8 | REGCM_GPR32 |
21941 REGCM_DIVIDEND32 | REGCM_DIVIDEND64;
21943 /* Special case for the immediates */
21944 if ((regcm1 & (REGCM_IMM32 | REGCM_IMM16 | REGCM_IMM8)) &&
21945 ((regcm1 & ~(REGCM_IMM32 | REGCM_IMM16 | REGCM_IMM8)) == 0) &&
21946 (regcm2 & (REGCM_IMM32 | REGCM_IMM16 | REGCM_IMM8)) &&
21947 ((regcm2 & ~(REGCM_IMM32 | REGCM_IMM16 | REGCM_IMM8)) == 0)) {
21950 return (regcm1 & regcm2) ||
21951 ((regcm1 & gpr_mask) && (regcm2 & gpr_mask));
21954 static void arch_reg_equivs(
21955 struct compile_state *state, unsigned *equiv, int reg)
21957 if ((reg < 0) || (reg > LAST_REG)) {
21958 internal_error(state, 0, "invalid register");
21963 #if X86_4_8BIT_GPRS
21967 *equiv++ = REG_EAX;
21968 *equiv++ = REG_DXAX;
21969 *equiv++ = REG_EDXEAX;
21972 #if X86_4_8BIT_GPRS
21976 *equiv++ = REG_EAX;
21977 *equiv++ = REG_DXAX;
21978 *equiv++ = REG_EDXEAX;
21981 #if X86_4_8BIT_GPRS
21985 *equiv++ = REG_EBX;
21989 #if X86_4_8BIT_GPRS
21993 *equiv++ = REG_EBX;
21996 #if X86_4_8BIT_GPRS
22000 *equiv++ = REG_ECX;
22004 #if X86_4_8BIT_GPRS
22008 *equiv++ = REG_ECX;
22011 #if X86_4_8BIT_GPRS
22015 *equiv++ = REG_EDX;
22016 *equiv++ = REG_DXAX;
22017 *equiv++ = REG_EDXEAX;
22020 #if X86_4_8BIT_GPRS
22024 *equiv++ = REG_EDX;
22025 *equiv++ = REG_DXAX;
22026 *equiv++ = REG_EDXEAX;
22031 *equiv++ = REG_EAX;
22032 *equiv++ = REG_DXAX;
22033 *equiv++ = REG_EDXEAX;
22038 *equiv++ = REG_EBX;
22043 *equiv++ = REG_ECX;
22048 *equiv++ = REG_EDX;
22049 *equiv++ = REG_DXAX;
22050 *equiv++ = REG_EDXEAX;
22053 *equiv++ = REG_ESI;
22056 *equiv++ = REG_EDI;
22059 *equiv++ = REG_EBP;
22062 *equiv++ = REG_ESP;
22068 *equiv++ = REG_DXAX;
22069 *equiv++ = REG_EDXEAX;
22085 *equiv++ = REG_DXAX;
22086 *equiv++ = REG_EDXEAX;
22107 *equiv++ = REG_EAX;
22108 *equiv++ = REG_EDX;
22109 *equiv++ = REG_EDXEAX;
22118 *equiv++ = REG_EAX;
22119 *equiv++ = REG_EDX;
22120 *equiv++ = REG_DXAX;
22123 *equiv++ = REG_UNSET;
22126 static unsigned arch_avail_mask(struct compile_state *state)
22128 unsigned avail_mask;
22129 /* REGCM_GPR8 is not available */
22130 avail_mask = REGCM_GPR8_LO | REGCM_GPR16_8 | REGCM_GPR16 |
22131 REGCM_GPR32 | REGCM_GPR32_8 |
22132 REGCM_DIVIDEND32 | REGCM_DIVIDEND64 |
22133 REGCM_IMM32 | REGCM_IMM16 | REGCM_IMM8 | REGCM_FLAGS;
22134 if (state->arch->features & X86_MMX_REGS) {
22135 avail_mask |= REGCM_MMX;
22137 if (state->arch->features & X86_XMM_REGS) {
22138 avail_mask |= REGCM_XMM;
22143 static unsigned arch_regcm_normalize(struct compile_state *state, unsigned regcm)
22145 unsigned mask, result;
22149 for(class = 0, mask = 1; mask; mask <<= 1, class++) {
22150 if ((result & mask) == 0) {
22153 if (class > LAST_REGC) {
22156 for(class2 = 0; class2 <= LAST_REGC; class2++) {
22157 if ((regcm_bound[class2].first >= regcm_bound[class].first) &&
22158 (regcm_bound[class2].last <= regcm_bound[class].last)) {
22159 result |= (1 << class2);
22163 result &= arch_avail_mask(state);
22167 static unsigned arch_regcm_reg_normalize(struct compile_state *state, unsigned regcm)
22169 /* Like arch_regcm_normalize except immediate register classes are excluded */
22170 regcm = arch_regcm_normalize(state, regcm);
22171 /* Remove the immediate register classes */
22172 regcm &= ~(REGCM_IMM32 | REGCM_IMM16 | REGCM_IMM8);
22177 static unsigned arch_reg_regcm(struct compile_state *state, int reg)
22182 for(class = 0; class <= LAST_REGC; class++) {
22183 if ((reg >= regcm_bound[class].first) &&
22184 (reg <= regcm_bound[class].last)) {
22185 mask |= (1 << class);
22189 internal_error(state, 0, "reg %d not in any class", reg);
22194 static struct reg_info arch_reg_constraint(
22195 struct compile_state *state, struct type *type, const char *constraint)
22197 static const struct {
22201 } constraints[] = {
22202 { 'r', REGCM_GPR32, REG_UNSET },
22203 { 'g', REGCM_GPR32, REG_UNSET },
22204 { 'p', REGCM_GPR32, REG_UNSET },
22205 { 'q', REGCM_GPR8_LO, REG_UNSET },
22206 { 'Q', REGCM_GPR32_8, REG_UNSET },
22207 { 'x', REGCM_XMM, REG_UNSET },
22208 { 'y', REGCM_MMX, REG_UNSET },
22209 { 'a', REGCM_GPR32, REG_EAX },
22210 { 'b', REGCM_GPR32, REG_EBX },
22211 { 'c', REGCM_GPR32, REG_ECX },
22212 { 'd', REGCM_GPR32, REG_EDX },
22213 { 'D', REGCM_GPR32, REG_EDI },
22214 { 'S', REGCM_GPR32, REG_ESI },
22215 { '\0', 0, REG_UNSET },
22217 unsigned int regcm;
22218 unsigned int mask, reg;
22219 struct reg_info result;
22221 regcm = arch_type_to_regcm(state, type);
22224 for(ptr = constraint; *ptr; ptr++) {
22229 for(i = 0; constraints[i].class != '\0'; i++) {
22230 if (constraints[i].class == *ptr) {
22234 if (constraints[i].class == '\0') {
22235 error(state, 0, "invalid register constraint ``%c''", *ptr);
22238 if ((constraints[i].mask & regcm) == 0) {
22239 error(state, 0, "invalid register class %c specified",
22242 mask |= constraints[i].mask;
22243 if (constraints[i].reg != REG_UNSET) {
22244 if ((reg != REG_UNSET) && (reg != constraints[i].reg)) {
22245 error(state, 0, "Only one register may be specified");
22247 reg = constraints[i].reg;
22251 result.regcm = mask;
22255 static struct reg_info arch_reg_clobber(
22256 struct compile_state *state, const char *clobber)
22258 struct reg_info result;
22259 if (strcmp(clobber, "memory") == 0) {
22260 result.reg = REG_UNSET;
22263 else if (strcmp(clobber, "eax") == 0) {
22264 result.reg = REG_EAX;
22265 result.regcm = REGCM_GPR32;
22267 else if (strcmp(clobber, "ebx") == 0) {
22268 result.reg = REG_EBX;
22269 result.regcm = REGCM_GPR32;
22271 else if (strcmp(clobber, "ecx") == 0) {
22272 result.reg = REG_ECX;
22273 result.regcm = REGCM_GPR32;
22275 else if (strcmp(clobber, "edx") == 0) {
22276 result.reg = REG_EDX;
22277 result.regcm = REGCM_GPR32;
22279 else if (strcmp(clobber, "esi") == 0) {
22280 result.reg = REG_ESI;
22281 result.regcm = REGCM_GPR32;
22283 else if (strcmp(clobber, "edi") == 0) {
22284 result.reg = REG_EDI;
22285 result.regcm = REGCM_GPR32;
22287 else if (strcmp(clobber, "ebp") == 0) {
22288 result.reg = REG_EBP;
22289 result.regcm = REGCM_GPR32;
22291 else if (strcmp(clobber, "esp") == 0) {
22292 result.reg = REG_ESP;
22293 result.regcm = REGCM_GPR32;
22295 else if (strcmp(clobber, "cc") == 0) {
22296 result.reg = REG_EFLAGS;
22297 result.regcm = REGCM_FLAGS;
22299 else if ((strncmp(clobber, "xmm", 3) == 0) &&
22300 octdigitp(clobber[3]) && (clobber[4] == '\0')) {
22301 result.reg = REG_XMM0 + octdigval(clobber[3]);
22302 result.regcm = REGCM_XMM;
22304 else if ((strncmp(clobber, "mm", 2) == 0) &&
22305 octdigitp(clobber[3]) && (clobber[4] == '\0')) {
22306 result.reg = REG_MMX0 + octdigval(clobber[3]);
22307 result.regcm = REGCM_MMX;
22310 error(state, 0, "unknown register name `%s' in asm",
22312 result.reg = REG_UNSET;
22318 static int do_select_reg(struct compile_state *state,
22319 char *used, int reg, unsigned classes)
22325 mask = arch_reg_regcm(state, reg);
22326 return (classes & mask) ? reg : REG_UNSET;
22329 static int arch_select_free_register(
22330 struct compile_state *state, char *used, int classes)
22332 /* Live ranges with the most neighbors are colored first.
22334 * Generally it does not matter which colors are given
22335 * as the register allocator attempts to color live ranges
22336 * in an order where you are guaranteed not to run out of colors.
22338 * Occasionally the register allocator cannot find an order
22339 * of register selection that will find a free color. To
22340 * increase the odds the register allocator will work when
22341 * it guesses first give out registers from register classes
22342 * least likely to run out of registers.
22347 for(i = REGC_XMM_FIRST; (reg == REG_UNSET) && (i <= REGC_XMM_LAST); i++) {
22348 reg = do_select_reg(state, used, i, classes);
22350 for(i = REGC_MMX_FIRST; (reg == REG_UNSET) && (i <= REGC_MMX_LAST); i++) {
22351 reg = do_select_reg(state, used, i, classes);
22353 for(i = REGC_GPR32_LAST; (reg == REG_UNSET) && (i >= REGC_GPR32_FIRST); i--) {
22354 reg = do_select_reg(state, used, i, classes);
22356 for(i = REGC_GPR16_FIRST; (reg == REG_UNSET) && (i <= REGC_GPR16_LAST); i++) {
22357 reg = do_select_reg(state, used, i, classes);
22359 for(i = REGC_GPR8_FIRST; (reg == REG_UNSET) && (i <= REGC_GPR8_LAST); i++) {
22360 reg = do_select_reg(state, used, i, classes);
22362 for(i = REGC_GPR8_LO_FIRST; (reg == REG_UNSET) && (i <= REGC_GPR8_LO_LAST); i++) {
22363 reg = do_select_reg(state, used, i, classes);
22365 for(i = REGC_DIVIDEND32_FIRST; (reg == REG_UNSET) && (i <= REGC_DIVIDEND32_LAST); i++) {
22366 reg = do_select_reg(state, used, i, classes);
22368 for(i = REGC_DIVIDEND64_FIRST; (reg == REG_UNSET) && (i <= REGC_DIVIDEND64_LAST); i++) {
22369 reg = do_select_reg(state, used, i, classes);
22371 for(i = REGC_FLAGS_FIRST; (reg == REG_UNSET) && (i <= REGC_FLAGS_LAST); i++) {
22372 reg = do_select_reg(state, used, i, classes);
22378 static unsigned arch_type_to_regcm(struct compile_state *state, struct type *type)
22381 #if DEBUG_ROMCC_WARNINGS
22382 #warning "FIXME force types smaller (if legal) before I get here"
22386 switch(type->type & TYPE_MASK) {
22393 mask = REGCM_GPR8 | REGCM_GPR8_LO |
22394 REGCM_GPR16 | REGCM_GPR16_8 |
22395 REGCM_GPR32 | REGCM_GPR32_8 |
22396 REGCM_DIVIDEND32 | REGCM_DIVIDEND64 |
22397 REGCM_MMX | REGCM_XMM |
22398 REGCM_IMM32 | REGCM_IMM16 | REGCM_IMM8;
22402 mask = REGCM_GPR16 | REGCM_GPR16_8 |
22403 REGCM_GPR32 | REGCM_GPR32_8 |
22404 REGCM_DIVIDEND32 | REGCM_DIVIDEND64 |
22405 REGCM_MMX | REGCM_XMM |
22406 REGCM_IMM32 | REGCM_IMM16;
22414 mask = REGCM_GPR32 | REGCM_GPR32_8 |
22415 REGCM_DIVIDEND32 | REGCM_DIVIDEND64 |
22416 REGCM_MMX | REGCM_XMM |
22421 mask = arch_type_to_regcm(state, type->left);
22424 mask = arch_type_to_regcm(state, type->left) &
22425 arch_type_to_regcm(state, type->right);
22427 case TYPE_BITFIELD:
22428 mask = arch_type_to_regcm(state, type->left);
22431 fprintf(state->errout, "type: ");
22432 name_of(state->errout, type);
22433 fprintf(state->errout, "\n");
22434 internal_error(state, 0, "no register class for type");
22437 mask = arch_regcm_normalize(state, mask);
22441 static int is_imm32(struct triple *imm)
22443 // second condition commented out to prevent compiler warning:
22444 // imm->u.cval is always 32bit unsigned, so the comparison is
22446 return ((imm->op == OP_INTCONST) /* && (imm->u.cval <= 0xffffffffUL) */ ) ||
22447 (imm->op == OP_ADDRCONST);
22450 static int is_imm16(struct triple *imm)
22452 return ((imm->op == OP_INTCONST) && (imm->u.cval <= 0xffff));
22454 static int is_imm8(struct triple *imm)
22456 return ((imm->op == OP_INTCONST) && (imm->u.cval <= 0xff));
22459 static int get_imm32(struct triple *ins, struct triple **expr)
22461 struct triple *imm;
22463 while(imm->op == OP_COPY) {
22466 if (!is_imm32(imm)) {
22469 unuse_triple(*expr, ins);
22470 use_triple(imm, ins);
22475 static int get_imm8(struct triple *ins, struct triple **expr)
22477 struct triple *imm;
22479 while(imm->op == OP_COPY) {
22482 if (!is_imm8(imm)) {
22485 unuse_triple(*expr, ins);
22486 use_triple(imm, ins);
22491 #define TEMPLATE_NOP 0
22492 #define TEMPLATE_INTCONST8 1
22493 #define TEMPLATE_INTCONST32 2
22494 #define TEMPLATE_UNKNOWNVAL 3
22495 #define TEMPLATE_COPY8_REG 5
22496 #define TEMPLATE_COPY16_REG 6
22497 #define TEMPLATE_COPY32_REG 7
22498 #define TEMPLATE_COPY_IMM8 8
22499 #define TEMPLATE_COPY_IMM16 9
22500 #define TEMPLATE_COPY_IMM32 10
22501 #define TEMPLATE_PHI8 11
22502 #define TEMPLATE_PHI16 12
22503 #define TEMPLATE_PHI32 13
22504 #define TEMPLATE_STORE8 14
22505 #define TEMPLATE_STORE16 15
22506 #define TEMPLATE_STORE32 16
22507 #define TEMPLATE_LOAD8 17
22508 #define TEMPLATE_LOAD16 18
22509 #define TEMPLATE_LOAD32 19
22510 #define TEMPLATE_BINARY8_REG 20
22511 #define TEMPLATE_BINARY16_REG 21
22512 #define TEMPLATE_BINARY32_REG 22
22513 #define TEMPLATE_BINARY8_IMM 23
22514 #define TEMPLATE_BINARY16_IMM 24
22515 #define TEMPLATE_BINARY32_IMM 25
22516 #define TEMPLATE_SL8_CL 26
22517 #define TEMPLATE_SL16_CL 27
22518 #define TEMPLATE_SL32_CL 28
22519 #define TEMPLATE_SL8_IMM 29
22520 #define TEMPLATE_SL16_IMM 30
22521 #define TEMPLATE_SL32_IMM 31
22522 #define TEMPLATE_UNARY8 32
22523 #define TEMPLATE_UNARY16 33
22524 #define TEMPLATE_UNARY32 34
22525 #define TEMPLATE_CMP8_REG 35
22526 #define TEMPLATE_CMP16_REG 36
22527 #define TEMPLATE_CMP32_REG 37
22528 #define TEMPLATE_CMP8_IMM 38
22529 #define TEMPLATE_CMP16_IMM 39
22530 #define TEMPLATE_CMP32_IMM 40
22531 #define TEMPLATE_TEST8 41
22532 #define TEMPLATE_TEST16 42
22533 #define TEMPLATE_TEST32 43
22534 #define TEMPLATE_SET 44
22535 #define TEMPLATE_JMP 45
22536 #define TEMPLATE_RET 46
22537 #define TEMPLATE_INB_DX 47
22538 #define TEMPLATE_INB_IMM 48
22539 #define TEMPLATE_INW_DX 49
22540 #define TEMPLATE_INW_IMM 50
22541 #define TEMPLATE_INL_DX 51
22542 #define TEMPLATE_INL_IMM 52
22543 #define TEMPLATE_OUTB_DX 53
22544 #define TEMPLATE_OUTB_IMM 54
22545 #define TEMPLATE_OUTW_DX 55
22546 #define TEMPLATE_OUTW_IMM 56
22547 #define TEMPLATE_OUTL_DX 57
22548 #define TEMPLATE_OUTL_IMM 58
22549 #define TEMPLATE_BSF 59
22550 #define TEMPLATE_RDMSR 60
22551 #define TEMPLATE_WRMSR 61
22552 #define TEMPLATE_UMUL8 62
22553 #define TEMPLATE_UMUL16 63
22554 #define TEMPLATE_UMUL32 64
22555 #define TEMPLATE_DIV8 65
22556 #define TEMPLATE_DIV16 66
22557 #define TEMPLATE_DIV32 67
22558 #define LAST_TEMPLATE TEMPLATE_DIV32
22559 #if LAST_TEMPLATE >= MAX_TEMPLATES
22560 #error "MAX_TEMPLATES to low"
22563 #define COPY8_REGCM (REGCM_DIVIDEND64 | REGCM_DIVIDEND32 | REGCM_GPR32 | REGCM_GPR16 | REGCM_GPR8_LO | REGCM_MMX | REGCM_XMM)
22564 #define COPY16_REGCM (REGCM_DIVIDEND64 | REGCM_DIVIDEND32 | REGCM_GPR32 | REGCM_GPR16 | REGCM_MMX | REGCM_XMM)
22565 #define COPY32_REGCM (REGCM_DIVIDEND64 | REGCM_DIVIDEND32 | REGCM_GPR32 | REGCM_MMX | REGCM_XMM)
22568 static struct ins_template templates[] = {
22571 [ 0] = { REG_UNNEEDED, REGCM_IMMALL },
22572 [ 1] = { REG_UNNEEDED, REGCM_IMMALL },
22573 [ 2] = { REG_UNNEEDED, REGCM_IMMALL },
22574 [ 3] = { REG_UNNEEDED, REGCM_IMMALL },
22575 [ 4] = { REG_UNNEEDED, REGCM_IMMALL },
22576 [ 5] = { REG_UNNEEDED, REGCM_IMMALL },
22577 [ 6] = { REG_UNNEEDED, REGCM_IMMALL },
22578 [ 7] = { REG_UNNEEDED, REGCM_IMMALL },
22579 [ 8] = { REG_UNNEEDED, REGCM_IMMALL },
22580 [ 9] = { REG_UNNEEDED, REGCM_IMMALL },
22581 [10] = { REG_UNNEEDED, REGCM_IMMALL },
22582 [11] = { REG_UNNEEDED, REGCM_IMMALL },
22583 [12] = { REG_UNNEEDED, REGCM_IMMALL },
22584 [13] = { REG_UNNEEDED, REGCM_IMMALL },
22585 [14] = { REG_UNNEEDED, REGCM_IMMALL },
22586 [15] = { REG_UNNEEDED, REGCM_IMMALL },
22587 [16] = { REG_UNNEEDED, REGCM_IMMALL },
22588 [17] = { REG_UNNEEDED, REGCM_IMMALL },
22589 [18] = { REG_UNNEEDED, REGCM_IMMALL },
22590 [19] = { REG_UNNEEDED, REGCM_IMMALL },
22591 [20] = { REG_UNNEEDED, REGCM_IMMALL },
22592 [21] = { REG_UNNEEDED, REGCM_IMMALL },
22593 [22] = { REG_UNNEEDED, REGCM_IMMALL },
22594 [23] = { REG_UNNEEDED, REGCM_IMMALL },
22595 [24] = { REG_UNNEEDED, REGCM_IMMALL },
22596 [25] = { REG_UNNEEDED, REGCM_IMMALL },
22597 [26] = { REG_UNNEEDED, REGCM_IMMALL },
22598 [27] = { REG_UNNEEDED, REGCM_IMMALL },
22599 [28] = { REG_UNNEEDED, REGCM_IMMALL },
22600 [29] = { REG_UNNEEDED, REGCM_IMMALL },
22601 [30] = { REG_UNNEEDED, REGCM_IMMALL },
22602 [31] = { REG_UNNEEDED, REGCM_IMMALL },
22603 [32] = { REG_UNNEEDED, REGCM_IMMALL },
22604 [33] = { REG_UNNEEDED, REGCM_IMMALL },
22605 [34] = { REG_UNNEEDED, REGCM_IMMALL },
22606 [35] = { REG_UNNEEDED, REGCM_IMMALL },
22607 [36] = { REG_UNNEEDED, REGCM_IMMALL },
22608 [37] = { REG_UNNEEDED, REGCM_IMMALL },
22609 [38] = { REG_UNNEEDED, REGCM_IMMALL },
22610 [39] = { REG_UNNEEDED, REGCM_IMMALL },
22611 [40] = { REG_UNNEEDED, REGCM_IMMALL },
22612 [41] = { REG_UNNEEDED, REGCM_IMMALL },
22613 [42] = { REG_UNNEEDED, REGCM_IMMALL },
22614 [43] = { REG_UNNEEDED, REGCM_IMMALL },
22615 [44] = { REG_UNNEEDED, REGCM_IMMALL },
22616 [45] = { REG_UNNEEDED, REGCM_IMMALL },
22617 [46] = { REG_UNNEEDED, REGCM_IMMALL },
22618 [47] = { REG_UNNEEDED, REGCM_IMMALL },
22619 [48] = { REG_UNNEEDED, REGCM_IMMALL },
22620 [49] = { REG_UNNEEDED, REGCM_IMMALL },
22621 [50] = { REG_UNNEEDED, REGCM_IMMALL },
22622 [51] = { REG_UNNEEDED, REGCM_IMMALL },
22623 [52] = { REG_UNNEEDED, REGCM_IMMALL },
22624 [53] = { REG_UNNEEDED, REGCM_IMMALL },
22625 [54] = { REG_UNNEEDED, REGCM_IMMALL },
22626 [55] = { REG_UNNEEDED, REGCM_IMMALL },
22627 [56] = { REG_UNNEEDED, REGCM_IMMALL },
22628 [57] = { REG_UNNEEDED, REGCM_IMMALL },
22629 [58] = { REG_UNNEEDED, REGCM_IMMALL },
22630 [59] = { REG_UNNEEDED, REGCM_IMMALL },
22631 [60] = { REG_UNNEEDED, REGCM_IMMALL },
22632 [61] = { REG_UNNEEDED, REGCM_IMMALL },
22633 [62] = { REG_UNNEEDED, REGCM_IMMALL },
22634 [63] = { REG_UNNEEDED, REGCM_IMMALL },
22637 [TEMPLATE_INTCONST8] = {
22638 .lhs = { [0] = { REG_UNNEEDED, REGCM_IMM8 } },
22640 [TEMPLATE_INTCONST32] = {
22641 .lhs = { [0] = { REG_UNNEEDED, REGCM_IMM32 } },
22643 [TEMPLATE_UNKNOWNVAL] = {
22644 .lhs = { [0] = { REG_UNSET, COPY32_REGCM } },
22646 [TEMPLATE_COPY8_REG] = {
22647 .lhs = { [0] = { REG_UNSET, COPY8_REGCM } },
22648 .rhs = { [0] = { REG_UNSET, COPY8_REGCM } },
22650 [TEMPLATE_COPY16_REG] = {
22651 .lhs = { [0] = { REG_UNSET, COPY16_REGCM } },
22652 .rhs = { [0] = { REG_UNSET, COPY16_REGCM } },
22654 [TEMPLATE_COPY32_REG] = {
22655 .lhs = { [0] = { REG_UNSET, COPY32_REGCM } },
22656 .rhs = { [0] = { REG_UNSET, COPY32_REGCM } },
22658 [TEMPLATE_COPY_IMM8] = {
22659 .lhs = { [0] = { REG_UNSET, COPY8_REGCM } },
22660 .rhs = { [0] = { REG_UNNEEDED, REGCM_IMM8 } },
22662 [TEMPLATE_COPY_IMM16] = {
22663 .lhs = { [0] = { REG_UNSET, COPY16_REGCM } },
22664 .rhs = { [0] = { REG_UNNEEDED, REGCM_IMM16 | REGCM_IMM8 } },
22666 [TEMPLATE_COPY_IMM32] = {
22667 .lhs = { [0] = { REG_UNSET, COPY32_REGCM } },
22668 .rhs = { [0] = { REG_UNNEEDED, REGCM_IMM32 | REGCM_IMM16 | REGCM_IMM8 } },
22670 [TEMPLATE_PHI8] = {
22671 .lhs = { [0] = { REG_VIRT0, COPY8_REGCM } },
22672 .rhs = { [0] = { REG_VIRT0, COPY8_REGCM } },
22674 [TEMPLATE_PHI16] = {
22675 .lhs = { [0] = { REG_VIRT0, COPY16_REGCM } },
22676 .rhs = { [0] = { REG_VIRT0, COPY16_REGCM } },
22678 [TEMPLATE_PHI32] = {
22679 .lhs = { [0] = { REG_VIRT0, COPY32_REGCM } },
22680 .rhs = { [0] = { REG_VIRT0, COPY32_REGCM } },
22682 [TEMPLATE_STORE8] = {
22684 [0] = { REG_UNSET, REGCM_GPR32 },
22685 [1] = { REG_UNSET, REGCM_GPR8_LO },
22688 [TEMPLATE_STORE16] = {
22690 [0] = { REG_UNSET, REGCM_GPR32 },
22691 [1] = { REG_UNSET, REGCM_GPR16 },
22694 [TEMPLATE_STORE32] = {
22696 [0] = { REG_UNSET, REGCM_GPR32 },
22697 [1] = { REG_UNSET, REGCM_GPR32 },
22700 [TEMPLATE_LOAD8] = {
22701 .lhs = { [0] = { REG_UNSET, REGCM_GPR8_LO } },
22702 .rhs = { [0] = { REG_UNSET, REGCM_GPR32 } },
22704 [TEMPLATE_LOAD16] = {
22705 .lhs = { [0] = { REG_UNSET, REGCM_GPR16 } },
22706 .rhs = { [0] = { REG_UNSET, REGCM_GPR32 } },
22708 [TEMPLATE_LOAD32] = {
22709 .lhs = { [0] = { REG_UNSET, REGCM_GPR32 } },
22710 .rhs = { [0] = { REG_UNSET, REGCM_GPR32 } },
22712 [TEMPLATE_BINARY8_REG] = {
22713 .lhs = { [0] = { REG_VIRT0, REGCM_GPR8_LO } },
22715 [0] = { REG_VIRT0, REGCM_GPR8_LO },
22716 [1] = { REG_UNSET, REGCM_GPR8_LO },
22719 [TEMPLATE_BINARY16_REG] = {
22720 .lhs = { [0] = { REG_VIRT0, REGCM_GPR16 } },
22722 [0] = { REG_VIRT0, REGCM_GPR16 },
22723 [1] = { REG_UNSET, REGCM_GPR16 },
22726 [TEMPLATE_BINARY32_REG] = {
22727 .lhs = { [0] = { REG_VIRT0, REGCM_GPR32 } },
22729 [0] = { REG_VIRT0, REGCM_GPR32 },
22730 [1] = { REG_UNSET, REGCM_GPR32 },
22733 [TEMPLATE_BINARY8_IMM] = {
22734 .lhs = { [0] = { REG_VIRT0, REGCM_GPR8_LO } },
22736 [0] = { REG_VIRT0, REGCM_GPR8_LO },
22737 [1] = { REG_UNNEEDED, REGCM_IMM8 },
22740 [TEMPLATE_BINARY16_IMM] = {
22741 .lhs = { [0] = { REG_VIRT0, REGCM_GPR16 } },
22743 [0] = { REG_VIRT0, REGCM_GPR16 },
22744 [1] = { REG_UNNEEDED, REGCM_IMM16 },
22747 [TEMPLATE_BINARY32_IMM] = {
22748 .lhs = { [0] = { REG_VIRT0, REGCM_GPR32 } },
22750 [0] = { REG_VIRT0, REGCM_GPR32 },
22751 [1] = { REG_UNNEEDED, REGCM_IMM32 },
22754 [TEMPLATE_SL8_CL] = {
22755 .lhs = { [0] = { REG_VIRT0, REGCM_GPR8_LO } },
22757 [0] = { REG_VIRT0, REGCM_GPR8_LO },
22758 [1] = { REG_CL, REGCM_GPR8_LO },
22761 [TEMPLATE_SL16_CL] = {
22762 .lhs = { [0] = { REG_VIRT0, REGCM_GPR16 } },
22764 [0] = { REG_VIRT0, REGCM_GPR16 },
22765 [1] = { REG_CL, REGCM_GPR8_LO },
22768 [TEMPLATE_SL32_CL] = {
22769 .lhs = { [0] = { REG_VIRT0, REGCM_GPR32 } },
22771 [0] = { REG_VIRT0, REGCM_GPR32 },
22772 [1] = { REG_CL, REGCM_GPR8_LO },
22775 [TEMPLATE_SL8_IMM] = {
22776 .lhs = { [0] = { REG_VIRT0, REGCM_GPR8_LO } },
22778 [0] = { REG_VIRT0, REGCM_GPR8_LO },
22779 [1] = { REG_UNNEEDED, REGCM_IMM8 },
22782 [TEMPLATE_SL16_IMM] = {
22783 .lhs = { [0] = { REG_VIRT0, REGCM_GPR16 } },
22785 [0] = { REG_VIRT0, REGCM_GPR16 },
22786 [1] = { REG_UNNEEDED, REGCM_IMM8 },
22789 [TEMPLATE_SL32_IMM] = {
22790 .lhs = { [0] = { REG_VIRT0, REGCM_GPR32 } },
22792 [0] = { REG_VIRT0, REGCM_GPR32 },
22793 [1] = { REG_UNNEEDED, REGCM_IMM8 },
22796 [TEMPLATE_UNARY8] = {
22797 .lhs = { [0] = { REG_VIRT0, REGCM_GPR8_LO } },
22798 .rhs = { [0] = { REG_VIRT0, REGCM_GPR8_LO } },
22800 [TEMPLATE_UNARY16] = {
22801 .lhs = { [0] = { REG_VIRT0, REGCM_GPR16 } },
22802 .rhs = { [0] = { REG_VIRT0, REGCM_GPR16 } },
22804 [TEMPLATE_UNARY32] = {
22805 .lhs = { [0] = { REG_VIRT0, REGCM_GPR32 } },
22806 .rhs = { [0] = { REG_VIRT0, REGCM_GPR32 } },
22808 [TEMPLATE_CMP8_REG] = {
22809 .lhs = { [0] = { REG_EFLAGS, REGCM_FLAGS } },
22811 [0] = { REG_UNSET, REGCM_GPR8_LO },
22812 [1] = { REG_UNSET, REGCM_GPR8_LO },
22815 [TEMPLATE_CMP16_REG] = {
22816 .lhs = { [0] = { REG_EFLAGS, REGCM_FLAGS } },
22818 [0] = { REG_UNSET, REGCM_GPR16 },
22819 [1] = { REG_UNSET, REGCM_GPR16 },
22822 [TEMPLATE_CMP32_REG] = {
22823 .lhs = { [0] = { REG_EFLAGS, REGCM_FLAGS } },
22825 [0] = { REG_UNSET, REGCM_GPR32 },
22826 [1] = { REG_UNSET, REGCM_GPR32 },
22829 [TEMPLATE_CMP8_IMM] = {
22830 .lhs = { [0] = { REG_EFLAGS, REGCM_FLAGS } },
22832 [0] = { REG_UNSET, REGCM_GPR8_LO },
22833 [1] = { REG_UNNEEDED, REGCM_IMM8 },
22836 [TEMPLATE_CMP16_IMM] = {
22837 .lhs = { [0] = { REG_EFLAGS, REGCM_FLAGS } },
22839 [0] = { REG_UNSET, REGCM_GPR16 },
22840 [1] = { REG_UNNEEDED, REGCM_IMM16 },
22843 [TEMPLATE_CMP32_IMM] = {
22844 .lhs = { [0] = { REG_EFLAGS, REGCM_FLAGS } },
22846 [0] = { REG_UNSET, REGCM_GPR32 },
22847 [1] = { REG_UNNEEDED, REGCM_IMM32 },
22850 [TEMPLATE_TEST8] = {
22851 .lhs = { [0] = { REG_EFLAGS, REGCM_FLAGS } },
22852 .rhs = { [0] = { REG_UNSET, REGCM_GPR8_LO } },
22854 [TEMPLATE_TEST16] = {
22855 .lhs = { [0] = { REG_EFLAGS, REGCM_FLAGS } },
22856 .rhs = { [0] = { REG_UNSET, REGCM_GPR16 } },
22858 [TEMPLATE_TEST32] = {
22859 .lhs = { [0] = { REG_EFLAGS, REGCM_FLAGS } },
22860 .rhs = { [0] = { REG_UNSET, REGCM_GPR32 } },
22863 .lhs = { [0] = { REG_UNSET, REGCM_GPR8_LO } },
22864 .rhs = { [0] = { REG_EFLAGS, REGCM_FLAGS } },
22867 .rhs = { [0] = { REG_EFLAGS, REGCM_FLAGS } },
22870 .rhs = { [0] = { REG_UNSET, REGCM_GPR32 } },
22872 [TEMPLATE_INB_DX] = {
22873 .lhs = { [0] = { REG_AL, REGCM_GPR8_LO } },
22874 .rhs = { [0] = { REG_DX, REGCM_GPR16 } },
22876 [TEMPLATE_INB_IMM] = {
22877 .lhs = { [0] = { REG_AL, REGCM_GPR8_LO } },
22878 .rhs = { [0] = { REG_UNNEEDED, REGCM_IMM8 } },
22880 [TEMPLATE_INW_DX] = {
22881 .lhs = { [0] = { REG_AX, REGCM_GPR16 } },
22882 .rhs = { [0] = { REG_DX, REGCM_GPR16 } },
22884 [TEMPLATE_INW_IMM] = {
22885 .lhs = { [0] = { REG_AX, REGCM_GPR16 } },
22886 .rhs = { [0] = { REG_UNNEEDED, REGCM_IMM8 } },
22888 [TEMPLATE_INL_DX] = {
22889 .lhs = { [0] = { REG_EAX, REGCM_GPR32 } },
22890 .rhs = { [0] = { REG_DX, REGCM_GPR16 } },
22892 [TEMPLATE_INL_IMM] = {
22893 .lhs = { [0] = { REG_EAX, REGCM_GPR32 } },
22894 .rhs = { [0] = { REG_UNNEEDED, REGCM_IMM8 } },
22896 [TEMPLATE_OUTB_DX] = {
22898 [0] = { REG_AL, REGCM_GPR8_LO },
22899 [1] = { REG_DX, REGCM_GPR16 },
22902 [TEMPLATE_OUTB_IMM] = {
22904 [0] = { REG_AL, REGCM_GPR8_LO },
22905 [1] = { REG_UNNEEDED, REGCM_IMM8 },
22908 [TEMPLATE_OUTW_DX] = {
22910 [0] = { REG_AX, REGCM_GPR16 },
22911 [1] = { REG_DX, REGCM_GPR16 },
22914 [TEMPLATE_OUTW_IMM] = {
22916 [0] = { REG_AX, REGCM_GPR16 },
22917 [1] = { REG_UNNEEDED, REGCM_IMM8 },
22920 [TEMPLATE_OUTL_DX] = {
22922 [0] = { REG_EAX, REGCM_GPR32 },
22923 [1] = { REG_DX, REGCM_GPR16 },
22926 [TEMPLATE_OUTL_IMM] = {
22928 [0] = { REG_EAX, REGCM_GPR32 },
22929 [1] = { REG_UNNEEDED, REGCM_IMM8 },
22933 .lhs = { [0] = { REG_UNSET, REGCM_GPR32 } },
22934 .rhs = { [0] = { REG_UNSET, REGCM_GPR32 } },
22936 [TEMPLATE_RDMSR] = {
22938 [0] = { REG_EAX, REGCM_GPR32 },
22939 [1] = { REG_EDX, REGCM_GPR32 },
22941 .rhs = { [0] = { REG_ECX, REGCM_GPR32 } },
22943 [TEMPLATE_WRMSR] = {
22945 [0] = { REG_ECX, REGCM_GPR32 },
22946 [1] = { REG_EAX, REGCM_GPR32 },
22947 [2] = { REG_EDX, REGCM_GPR32 },
22950 [TEMPLATE_UMUL8] = {
22951 .lhs = { [0] = { REG_AX, REGCM_GPR16 } },
22953 [0] = { REG_AL, REGCM_GPR8_LO },
22954 [1] = { REG_UNSET, REGCM_GPR8_LO },
22957 [TEMPLATE_UMUL16] = {
22958 .lhs = { [0] = { REG_DXAX, REGCM_DIVIDEND32 } },
22960 [0] = { REG_AX, REGCM_GPR16 },
22961 [1] = { REG_UNSET, REGCM_GPR16 },
22964 [TEMPLATE_UMUL32] = {
22965 .lhs = { [0] = { REG_EDXEAX, REGCM_DIVIDEND64 } },
22967 [0] = { REG_EAX, REGCM_GPR32 },
22968 [1] = { REG_UNSET, REGCM_GPR32 },
22971 [TEMPLATE_DIV8] = {
22973 [0] = { REG_AL, REGCM_GPR8_LO },
22974 [1] = { REG_AH, REGCM_GPR8 },
22977 [0] = { REG_AX, REGCM_GPR16 },
22978 [1] = { REG_UNSET, REGCM_GPR8_LO },
22981 [TEMPLATE_DIV16] = {
22983 [0] = { REG_AX, REGCM_GPR16 },
22984 [1] = { REG_DX, REGCM_GPR16 },
22987 [0] = { REG_DXAX, REGCM_DIVIDEND32 },
22988 [1] = { REG_UNSET, REGCM_GPR16 },
22991 [TEMPLATE_DIV32] = {
22993 [0] = { REG_EAX, REGCM_GPR32 },
22994 [1] = { REG_EDX, REGCM_GPR32 },
22997 [0] = { REG_EDXEAX, REGCM_DIVIDEND64 },
22998 [1] = { REG_UNSET, REGCM_GPR32 },
23003 static void fixup_branch(struct compile_state *state,
23004 struct triple *branch, int jmp_op, int cmp_op, struct type *cmp_type,
23005 struct triple *left, struct triple *right)
23007 struct triple *test;
23009 internal_error(state, branch, "no branch test?");
23011 test = pre_triple(state, branch,
23012 cmp_op, cmp_type, left, right);
23013 test->template_id = TEMPLATE_TEST32;
23014 if (cmp_op == OP_CMP) {
23015 test->template_id = TEMPLATE_CMP32_REG;
23016 if (get_imm32(test, &RHS(test, 1))) {
23017 test->template_id = TEMPLATE_CMP32_IMM;
23020 use_triple(RHS(test, 0), test);
23021 use_triple(RHS(test, 1), test);
23022 unuse_triple(RHS(branch, 0), branch);
23023 RHS(branch, 0) = test;
23024 branch->op = jmp_op;
23025 branch->template_id = TEMPLATE_JMP;
23026 use_triple(RHS(branch, 0), branch);
23029 static void fixup_branches(struct compile_state *state,
23030 struct triple *cmp, struct triple *use, int jmp_op)
23032 struct triple_set *entry, *next;
23033 for(entry = use->use; entry; entry = next) {
23034 next = entry->next;
23035 if (entry->member->op == OP_COPY) {
23036 fixup_branches(state, cmp, entry->member, jmp_op);
23038 else if (entry->member->op == OP_CBRANCH) {
23039 struct triple *branch;
23040 struct triple *left, *right;
23042 left = RHS(cmp, 0);
23043 if (cmp->rhs > 1) {
23044 right = RHS(cmp, 1);
23046 branch = entry->member;
23047 fixup_branch(state, branch, jmp_op,
23048 cmp->op, cmp->type, left, right);
23053 static void bool_cmp(struct compile_state *state,
23054 struct triple *ins, int cmp_op, int jmp_op, int set_op)
23056 struct triple_set *entry, *next;
23057 struct triple *set, *convert;
23059 /* Put a barrier up before the cmp which preceeds the
23060 * copy instruction. If a set actually occurs this gives
23061 * us a chance to move variables in registers out of the way.
23064 /* Modify the comparison operator */
23066 ins->template_id = TEMPLATE_TEST32;
23067 if (cmp_op == OP_CMP) {
23068 ins->template_id = TEMPLATE_CMP32_REG;
23069 if (get_imm32(ins, &RHS(ins, 1))) {
23070 ins->template_id = TEMPLATE_CMP32_IMM;
23073 /* Generate the instruction sequence that will transform the
23074 * result of the comparison into a logical value.
23076 set = post_triple(state, ins, set_op, &uchar_type, ins, 0);
23077 use_triple(ins, set);
23078 set->template_id = TEMPLATE_SET;
23081 if (!equiv_types(ins->type, set->type)) {
23082 convert = post_triple(state, set, OP_CONVERT, ins->type, set, 0);
23083 use_triple(set, convert);
23084 convert->template_id = TEMPLATE_COPY32_REG;
23087 for(entry = ins->use; entry; entry = next) {
23088 next = entry->next;
23089 if (entry->member == set) {
23092 replace_rhs_use(state, ins, convert, entry->member);
23094 fixup_branches(state, ins, convert, jmp_op);
23097 struct reg_info arch_reg_lhs(struct compile_state *state, struct triple *ins, int index)
23099 struct ins_template *template;
23100 struct reg_info result;
23102 if (ins->op == OP_PIECE) {
23103 index = ins->u.cval;
23104 ins = MISC(ins, 0);
23107 if (triple_is_def(state, ins)) {
23110 if (index >= zlhs) {
23111 internal_error(state, ins, "index %d out of range for %s",
23112 index, tops(ins->op));
23116 template = &ins->u.ainfo->tmpl;
23119 if (ins->template_id > LAST_TEMPLATE) {
23120 internal_error(state, ins, "bad template number %d",
23123 template = &templates[ins->template_id];
23126 result = template->lhs[index];
23127 result.regcm = arch_regcm_normalize(state, result.regcm);
23128 if (result.reg != REG_UNNEEDED) {
23129 result.regcm &= ~(REGCM_IMM32 | REGCM_IMM16 | REGCM_IMM8);
23131 if (result.regcm == 0) {
23132 internal_error(state, ins, "lhs %d regcm == 0", index);
23137 struct reg_info arch_reg_rhs(struct compile_state *state, struct triple *ins, int index)
23139 struct reg_info result;
23140 struct ins_template *template;
23141 if ((index > ins->rhs) ||
23142 (ins->op == OP_PIECE)) {
23143 internal_error(state, ins, "index %d out of range for %s\n",
23144 index, tops(ins->op));
23148 template = &ins->u.ainfo->tmpl;
23154 if (ins->template_id > LAST_TEMPLATE) {
23155 internal_error(state, ins, "bad template number %d",
23158 template = &templates[ins->template_id];
23161 result = template->rhs[index];
23162 result.regcm = arch_regcm_normalize(state, result.regcm);
23163 if (result.regcm == 0) {
23164 internal_error(state, ins, "rhs %d regcm == 0", index);
23169 static struct triple *mod_div(struct compile_state *state,
23170 struct triple *ins, int div_op, int index)
23172 struct triple *div, *piece1;
23174 /* Generate the appropriate division instruction */
23175 div = post_triple(state, ins, div_op, ins->type, 0, 0);
23176 RHS(div, 0) = RHS(ins, 0);
23177 RHS(div, 1) = RHS(ins, 1);
23178 piece1 = LHS(div, 1);
23179 div->template_id = TEMPLATE_DIV32;
23180 use_triple(RHS(div, 0), div);
23181 use_triple(RHS(div, 1), div);
23182 use_triple(LHS(div, 0), div);
23183 use_triple(LHS(div, 1), div);
23185 /* Replate uses of ins with the appropriate piece of the div */
23186 propogate_use(state, ins, LHS(div, index));
23187 release_triple(state, ins);
23189 /* Return the address of the next instruction */
23190 return piece1->next;
23193 static int noop_adecl(struct triple *adecl)
23195 struct triple_set *use;
23196 /* It's a noop if it doesn't specify stoorage */
23197 if (adecl->lhs == 0) {
23200 /* Is the adecl used? If not it's a noop */
23201 for(use = adecl->use; use ; use = use->next) {
23202 if ((use->member->op != OP_PIECE) ||
23203 (MISC(use->member, 0) != adecl)) {
23210 static struct triple *x86_deposit(struct compile_state *state, struct triple *ins)
23212 struct triple *mask, *nmask, *shift;
23213 struct triple *val, *val_mask, *val_shift;
23214 struct triple *targ, *targ_mask;
23215 struct triple *new;
23216 ulong_t the_mask, the_nmask;
23218 targ = RHS(ins, 0);
23221 /* Get constant for the mask value */
23223 the_mask <<= ins->u.bitfield.size;
23225 the_mask <<= ins->u.bitfield.offset;
23226 mask = pre_triple(state, ins, OP_INTCONST, &uint_type, 0, 0);
23227 mask->u.cval = the_mask;
23229 /* Get the inverted mask value */
23230 the_nmask = ~the_mask;
23231 nmask = pre_triple(state, ins, OP_INTCONST, &uint_type, 0, 0);
23232 nmask->u.cval = the_nmask;
23234 /* Get constant for the shift value */
23235 shift = pre_triple(state, ins, OP_INTCONST, &uint_type, 0, 0);
23236 shift->u.cval = ins->u.bitfield.offset;
23238 /* Shift and mask the source value */
23240 if (shift->u.cval != 0) {
23241 val_shift = pre_triple(state, ins, OP_SL, val->type, val, shift);
23242 use_triple(val, val_shift);
23243 use_triple(shift, val_shift);
23245 val_mask = val_shift;
23246 if (is_signed(val->type)) {
23247 val_mask = pre_triple(state, ins, OP_AND, val->type, val_shift, mask);
23248 use_triple(val_shift, val_mask);
23249 use_triple(mask, val_mask);
23252 /* Mask the target value */
23253 targ_mask = pre_triple(state, ins, OP_AND, targ->type, targ, nmask);
23254 use_triple(targ, targ_mask);
23255 use_triple(nmask, targ_mask);
23257 /* Now combined them together */
23258 new = pre_triple(state, ins, OP_OR, targ->type, targ_mask, val_mask);
23259 use_triple(targ_mask, new);
23260 use_triple(val_mask, new);
23262 /* Move all of the users over to the new expression */
23263 propogate_use(state, ins, new);
23265 /* Delete the original triple */
23266 release_triple(state, ins);
23268 /* Restart the transformation at mask */
23272 static struct triple *x86_extract(struct compile_state *state, struct triple *ins)
23274 struct triple *mask, *shift;
23275 struct triple *val, *val_mask, *val_shift;
23280 /* Get constant for the mask value */
23282 the_mask <<= ins->u.bitfield.size;
23284 mask = pre_triple(state, ins, OP_INTCONST, &int_type, 0, 0);
23285 mask->u.cval = the_mask;
23287 /* Get constant for the right shift value */
23288 shift = pre_triple(state, ins, OP_INTCONST, &int_type, 0, 0);
23289 shift->u.cval = ins->u.bitfield.offset;
23291 /* Shift arithmetic right, to correct the sign */
23293 if (shift->u.cval != 0) {
23295 if (ins->op == OP_SEXTRACT) {
23300 val_shift = pre_triple(state, ins, op, val->type, val, shift);
23301 use_triple(val, val_shift);
23302 use_triple(shift, val_shift);
23305 /* Finally mask the value */
23306 val_mask = pre_triple(state, ins, OP_AND, ins->type, val_shift, mask);
23307 use_triple(val_shift, val_mask);
23308 use_triple(mask, val_mask);
23310 /* Move all of the users over to the new expression */
23311 propogate_use(state, ins, val_mask);
23313 /* Release the original instruction */
23314 release_triple(state, ins);
23320 static struct triple *transform_to_arch_instruction(
23321 struct compile_state *state, struct triple *ins)
23323 /* Transform from generic 3 address instructions
23324 * to archtecture specific instructions.
23325 * And apply architecture specific constraints to instructions.
23326 * Copies are inserted to preserve the register flexibility
23327 * of 3 address instructions.
23329 struct triple *next, *value;
23334 ins->template_id = TEMPLATE_INTCONST32;
23335 if (ins->u.cval < 256) {
23336 ins->template_id = TEMPLATE_INTCONST8;
23340 ins->template_id = TEMPLATE_INTCONST32;
23342 case OP_UNKNOWNVAL:
23343 ins->template_id = TEMPLATE_UNKNOWNVAL;
23349 ins->template_id = TEMPLATE_NOP;
23353 size = size_of(state, ins->type);
23354 value = RHS(ins, 0);
23355 if (is_imm8(value) && (size <= SIZEOF_I8)) {
23356 ins->template_id = TEMPLATE_COPY_IMM8;
23358 else if (is_imm16(value) && (size <= SIZEOF_I16)) {
23359 ins->template_id = TEMPLATE_COPY_IMM16;
23361 else if (is_imm32(value) && (size <= SIZEOF_I32)) {
23362 ins->template_id = TEMPLATE_COPY_IMM32;
23364 else if (is_const(value)) {
23365 internal_error(state, ins, "bad constant passed to copy");
23367 else if (size <= SIZEOF_I8) {
23368 ins->template_id = TEMPLATE_COPY8_REG;
23370 else if (size <= SIZEOF_I16) {
23371 ins->template_id = TEMPLATE_COPY16_REG;
23373 else if (size <= SIZEOF_I32) {
23374 ins->template_id = TEMPLATE_COPY32_REG;
23377 internal_error(state, ins, "bad type passed to copy");
23381 size = size_of(state, ins->type);
23382 if (size <= SIZEOF_I8) {
23383 ins->template_id = TEMPLATE_PHI8;
23385 else if (size <= SIZEOF_I16) {
23386 ins->template_id = TEMPLATE_PHI16;
23388 else if (size <= SIZEOF_I32) {
23389 ins->template_id = TEMPLATE_PHI32;
23392 internal_error(state, ins, "bad type passed to phi");
23396 /* Adecls should always be treated as dead code and
23397 * removed. If we are not optimizing they may linger.
23399 if (!noop_adecl(ins)) {
23400 internal_error(state, ins, "adecl remains?");
23402 ins->template_id = TEMPLATE_NOP;
23403 next = after_lhs(state, ins);
23406 switch(ins->type->type & TYPE_MASK) {
23407 case TYPE_CHAR: case TYPE_UCHAR:
23408 ins->template_id = TEMPLATE_STORE8;
23410 case TYPE_SHORT: case TYPE_USHORT:
23411 ins->template_id = TEMPLATE_STORE16;
23413 case TYPE_INT: case TYPE_UINT:
23414 case TYPE_LONG: case TYPE_ULONG:
23416 ins->template_id = TEMPLATE_STORE32;
23419 internal_error(state, ins, "unknown type in store");
23424 switch(ins->type->type & TYPE_MASK) {
23425 case TYPE_CHAR: case TYPE_UCHAR:
23426 case TYPE_SHORT: case TYPE_USHORT:
23427 case TYPE_INT: case TYPE_UINT:
23428 case TYPE_LONG: case TYPE_ULONG:
23432 internal_error(state, ins, "unknown type in load");
23435 ins->template_id = TEMPLATE_LOAD32;
23443 ins->template_id = TEMPLATE_BINARY32_REG;
23444 if (get_imm32(ins, &RHS(ins, 1))) {
23445 ins->template_id = TEMPLATE_BINARY32_IMM;
23450 ins->template_id = TEMPLATE_DIV32;
23451 next = after_lhs(state, ins);
23454 ins->template_id = TEMPLATE_UMUL32;
23457 next = mod_div(state, ins, OP_UDIVT, 0);
23460 next = mod_div(state, ins, OP_SDIVT, 0);
23463 next = mod_div(state, ins, OP_UDIVT, 1);
23466 next = mod_div(state, ins, OP_SDIVT, 1);
23471 ins->template_id = TEMPLATE_SL32_CL;
23472 if (get_imm8(ins, &RHS(ins, 1))) {
23473 ins->template_id = TEMPLATE_SL32_IMM;
23474 } else if (size_of(state, RHS(ins, 1)->type) > SIZEOF_CHAR) {
23475 typed_pre_copy(state, &uchar_type, ins, 1);
23480 ins->template_id = TEMPLATE_UNARY32;
23483 bool_cmp(state, ins, OP_CMP, OP_JMP_EQ, OP_SET_EQ);
23486 bool_cmp(state, ins, OP_CMP, OP_JMP_NOTEQ, OP_SET_NOTEQ);
23489 bool_cmp(state, ins, OP_CMP, OP_JMP_SLESS, OP_SET_SLESS);
23492 bool_cmp(state, ins, OP_CMP, OP_JMP_ULESS, OP_SET_ULESS);
23495 bool_cmp(state, ins, OP_CMP, OP_JMP_SMORE, OP_SET_SMORE);
23498 bool_cmp(state, ins, OP_CMP, OP_JMP_UMORE, OP_SET_UMORE);
23501 bool_cmp(state, ins, OP_CMP, OP_JMP_SLESSEQ, OP_SET_SLESSEQ);
23504 bool_cmp(state, ins, OP_CMP, OP_JMP_ULESSEQ, OP_SET_ULESSEQ);
23507 bool_cmp(state, ins, OP_CMP, OP_JMP_SMOREEQ, OP_SET_SMOREEQ);
23510 bool_cmp(state, ins, OP_CMP, OP_JMP_UMOREEQ, OP_SET_UMOREEQ);
23513 bool_cmp(state, ins, OP_TEST, OP_JMP_NOTEQ, OP_SET_NOTEQ);
23516 bool_cmp(state, ins, OP_TEST, OP_JMP_EQ, OP_SET_EQ);
23520 ins->template_id = TEMPLATE_NOP;
23523 fixup_branch(state, ins, OP_JMP_NOTEQ, OP_TEST,
23524 RHS(ins, 0)->type, RHS(ins, 0), 0);
23527 ins->template_id = TEMPLATE_NOP;
23530 ins->template_id = TEMPLATE_RET;
23536 case OP_INB: ins->template_id = TEMPLATE_INB_DX; break;
23537 case OP_INW: ins->template_id = TEMPLATE_INW_DX; break;
23538 case OP_INL: ins->template_id = TEMPLATE_INL_DX; break;
23540 if (get_imm8(ins, &RHS(ins, 0))) {
23541 ins->template_id += 1;
23548 case OP_OUTB: ins->template_id = TEMPLATE_OUTB_DX; break;
23549 case OP_OUTW: ins->template_id = TEMPLATE_OUTW_DX; break;
23550 case OP_OUTL: ins->template_id = TEMPLATE_OUTL_DX; break;
23552 if (get_imm8(ins, &RHS(ins, 1))) {
23553 ins->template_id += 1;
23558 ins->template_id = TEMPLATE_BSF;
23561 ins->template_id = TEMPLATE_RDMSR;
23562 next = after_lhs(state, ins);
23565 ins->template_id = TEMPLATE_WRMSR;
23568 ins->template_id = TEMPLATE_NOP;
23571 ins->template_id = TEMPLATE_NOP;
23572 next = after_lhs(state, ins);
23574 /* Already transformed instructions */
23576 ins->template_id = TEMPLATE_TEST32;
23579 ins->template_id = TEMPLATE_CMP32_REG;
23580 if (get_imm32(ins, &RHS(ins, 1))) {
23581 ins->template_id = TEMPLATE_CMP32_IMM;
23585 ins->template_id = TEMPLATE_NOP;
23587 case OP_JMP_EQ: case OP_JMP_NOTEQ:
23588 case OP_JMP_SLESS: case OP_JMP_ULESS:
23589 case OP_JMP_SMORE: case OP_JMP_UMORE:
23590 case OP_JMP_SLESSEQ: case OP_JMP_ULESSEQ:
23591 case OP_JMP_SMOREEQ: case OP_JMP_UMOREEQ:
23592 ins->template_id = TEMPLATE_JMP;
23594 case OP_SET_EQ: case OP_SET_NOTEQ:
23595 case OP_SET_SLESS: case OP_SET_ULESS:
23596 case OP_SET_SMORE: case OP_SET_UMORE:
23597 case OP_SET_SLESSEQ: case OP_SET_ULESSEQ:
23598 case OP_SET_SMOREEQ: case OP_SET_UMOREEQ:
23599 ins->template_id = TEMPLATE_SET;
23602 next = x86_deposit(state, ins);
23606 next = x86_extract(state, ins);
23608 /* Unhandled instructions */
23611 internal_error(state, ins, "unhandled ins: %d %s",
23612 ins->op, tops(ins->op));
23618 static long next_label(struct compile_state *state)
23620 static long label_counter = 1000;
23621 return ++label_counter;
23623 static void generate_local_labels(struct compile_state *state)
23625 struct triple *first, *label;
23626 first = state->first;
23629 if ((label->op == OP_LABEL) ||
23630 (label->op == OP_SDECL)) {
23632 label->u.cval = next_label(state);
23638 label = label->next;
23639 } while(label != first);
23642 static int check_reg(struct compile_state *state,
23643 struct triple *triple, int classes)
23647 reg = ID_REG(triple->id);
23648 if (reg == REG_UNSET) {
23649 internal_error(state, triple, "register not set");
23651 mask = arch_reg_regcm(state, reg);
23652 if (!(classes & mask)) {
23653 internal_error(state, triple, "reg %d in wrong class",
23661 #error "Registers have renumberd fix arch_reg_str"
23663 static const char *arch_regs[] = {
23667 "%al", "%bl", "%cl", "%dl", "%ah", "%bh", "%ch", "%dh",
23668 "%ax", "%bx", "%cx", "%dx", "%si", "%di", "%bp", "%sp",
23669 "%eax", "%ebx", "%ecx", "%edx", "%esi", "%edi", "%ebp", "%esp",
23672 "%mm0", "%mm1", "%mm2", "%mm3", "%mm4", "%mm5", "%mm6", "%mm7",
23673 "%xmm0", "%xmm1", "%xmm2", "%xmm3",
23674 "%xmm4", "%xmm5", "%xmm6", "%xmm7",
23676 static const char *arch_reg_str(int reg)
23678 if (!((reg >= REG_EFLAGS) && (reg <= REG_XMM7))) {
23681 return arch_regs[reg];
23684 static const char *reg(struct compile_state *state, struct triple *triple,
23688 reg = check_reg(state, triple, classes);
23689 return arch_reg_str(reg);
23692 static int arch_reg_size(int reg)
23696 if (reg == REG_EFLAGS) {
23699 else if ((reg >= REG_AL) && (reg <= REG_DH)) {
23702 else if ((reg >= REG_AX) && (reg <= REG_SP)) {
23705 else if ((reg >= REG_EAX) && (reg <= REG_ESP)) {
23708 else if (reg == REG_EDXEAX) {
23711 else if (reg == REG_DXAX) {
23714 else if ((reg >= REG_MMX0) && (reg <= REG_MMX7)) {
23717 else if ((reg >= REG_XMM0) && (reg <= REG_XMM7)) {
23723 static int reg_size(struct compile_state *state, struct triple *ins)
23726 reg = ID_REG(ins->id);
23727 if (reg == REG_UNSET) {
23728 internal_error(state, ins, "register not set");
23730 return arch_reg_size(reg);
23735 const char *type_suffix(struct compile_state *state, struct type *type)
23737 const char *suffix;
23738 switch(size_of(state, type)) {
23739 case SIZEOF_I8: suffix = "b"; break;
23740 case SIZEOF_I16: suffix = "w"; break;
23741 case SIZEOF_I32: suffix = "l"; break;
23743 internal_error(state, 0, "unknown suffix");
23750 static void print_const_val(
23751 struct compile_state *state, struct triple *ins, FILE *fp)
23755 fprintf(fp, " $%ld ",
23756 (long)(ins->u.cval));
23759 if ((MISC(ins, 0)->op != OP_SDECL) &&
23760 (MISC(ins, 0)->op != OP_LABEL))
23762 internal_error(state, ins, "bad base for addrconst");
23764 if (MISC(ins, 0)->u.cval <= 0) {
23765 internal_error(state, ins, "unlabeled constant");
23767 fprintf(fp, " $L%s%lu+%lu ",
23768 state->compiler->label_prefix,
23769 (unsigned long)(MISC(ins, 0)->u.cval),
23770 (unsigned long)(ins->u.cval));
23773 internal_error(state, ins, "unknown constant type");
23778 static void print_const(struct compile_state *state,
23779 struct triple *ins, FILE *fp)
23783 switch(ins->type->type & TYPE_MASK) {
23786 fprintf(fp, ".byte 0x%02lx\n",
23787 (unsigned long)(ins->u.cval));
23791 fprintf(fp, ".short 0x%04lx\n",
23792 (unsigned long)(ins->u.cval));
23799 fprintf(fp, ".int %lu\n",
23800 (unsigned long)(ins->u.cval));
23803 fprintf(state->errout, "type: ");
23804 name_of(state->errout, ins->type);
23805 fprintf(state->errout, "\n");
23806 internal_error(state, ins, "Unknown constant type. Val: %lu",
23807 (unsigned long)(ins->u.cval));
23812 if ((MISC(ins, 0)->op != OP_SDECL) &&
23813 (MISC(ins, 0)->op != OP_LABEL)) {
23814 internal_error(state, ins, "bad base for addrconst");
23816 if (MISC(ins, 0)->u.cval <= 0) {
23817 internal_error(state, ins, "unlabeled constant");
23819 fprintf(fp, ".int L%s%lu+%lu\n",
23820 state->compiler->label_prefix,
23821 (unsigned long)(MISC(ins, 0)->u.cval),
23822 (unsigned long)(ins->u.cval));
23826 unsigned char *blob;
23828 size = size_of_in_bytes(state, ins->type);
23829 blob = ins->u.blob;
23830 for(i = 0; i < size; i++) {
23831 fprintf(fp, ".byte 0x%02x\n",
23837 internal_error(state, ins, "Unknown constant type");
23842 #define TEXT_SECTION ".rom.text"
23843 #define DATA_SECTION ".rom.data"
23845 static long get_const_pool_ref(
23846 struct compile_state *state, struct triple *ins, size_t size, FILE *fp)
23850 ref = next_label(state);
23851 fprintf(fp, ".section \"" DATA_SECTION "\"\n");
23852 fprintf(fp, ".balign %ld\n", (long int)align_of_in_bytes(state, ins->type));
23853 fprintf(fp, "L%s%lu:\n", state->compiler->label_prefix, ref);
23854 print_const(state, ins, fp);
23855 fill_bytes = bits_to_bytes(size - size_of(state, ins->type));
23857 fprintf(fp, ".fill %ld, 1, 0\n", (long int)fill_bytes);
23859 fprintf(fp, ".section \"" TEXT_SECTION "\"\n");
23863 static long get_mask_pool_ref(
23864 struct compile_state *state, struct triple *ins, unsigned long mask, FILE *fp)
23867 if (mask == 0xff) {
23870 else if (mask == 0xffff) {
23875 internal_error(state, ins, "unhandled mask value");
23880 static void print_binary_op(struct compile_state *state,
23881 const char *op, struct triple *ins, FILE *fp)
23884 mask = REGCM_GPR32 | REGCM_GPR16 | REGCM_GPR8_LO;
23885 if (ID_REG(RHS(ins, 0)->id) != ID_REG(ins->id)) {
23886 internal_error(state, ins, "invalid register assignment");
23888 if (is_const(RHS(ins, 1))) {
23889 fprintf(fp, "\t%s ", op);
23890 print_const_val(state, RHS(ins, 1), fp);
23891 fprintf(fp, ", %s\n",
23892 reg(state, RHS(ins, 0), mask));
23895 unsigned lmask, rmask;
23897 lreg = check_reg(state, RHS(ins, 0), mask);
23898 rreg = check_reg(state, RHS(ins, 1), mask);
23899 lmask = arch_reg_regcm(state, lreg);
23900 rmask = arch_reg_regcm(state, rreg);
23901 mask = lmask & rmask;
23902 fprintf(fp, "\t%s %s, %s\n",
23904 reg(state, RHS(ins, 1), mask),
23905 reg(state, RHS(ins, 0), mask));
23908 static void print_unary_op(struct compile_state *state,
23909 const char *op, struct triple *ins, FILE *fp)
23912 mask = REGCM_GPR32 | REGCM_GPR16 | REGCM_GPR8_LO;
23913 fprintf(fp, "\t%s %s\n",
23915 reg(state, RHS(ins, 0), mask));
23918 static void print_op_shift(struct compile_state *state,
23919 const char *op, struct triple *ins, FILE *fp)
23922 mask = REGCM_GPR32 | REGCM_GPR16 | REGCM_GPR8_LO;
23923 if (ID_REG(RHS(ins, 0)->id) != ID_REG(ins->id)) {
23924 internal_error(state, ins, "invalid register assignment");
23926 if (is_const(RHS(ins, 1))) {
23927 fprintf(fp, "\t%s ", op);
23928 print_const_val(state, RHS(ins, 1), fp);
23929 fprintf(fp, ", %s\n",
23930 reg(state, RHS(ins, 0), mask));
23933 fprintf(fp, "\t%s %s, %s\n",
23935 reg(state, RHS(ins, 1), REGCM_GPR8_LO),
23936 reg(state, RHS(ins, 0), mask));
23940 static void print_op_in(struct compile_state *state, struct triple *ins, FILE *fp)
23947 case OP_INB: op = "inb", mask = REGCM_GPR8_LO; break;
23948 case OP_INW: op = "inw", mask = REGCM_GPR16; break;
23949 case OP_INL: op = "inl", mask = REGCM_GPR32; break;
23951 internal_error(state, ins, "not an in operation");
23955 dreg = check_reg(state, ins, mask);
23956 if (!reg_is_reg(state, dreg, REG_EAX)) {
23957 internal_error(state, ins, "dst != %%eax");
23959 if (is_const(RHS(ins, 0))) {
23960 fprintf(fp, "\t%s ", op);
23961 print_const_val(state, RHS(ins, 0), fp);
23962 fprintf(fp, ", %s\n",
23963 reg(state, ins, mask));
23967 addr_reg = check_reg(state, RHS(ins, 0), REGCM_GPR16);
23968 if (!reg_is_reg(state, addr_reg, REG_DX)) {
23969 internal_error(state, ins, "src != %%dx");
23971 fprintf(fp, "\t%s %s, %s\n",
23973 reg(state, RHS(ins, 0), REGCM_GPR16),
23974 reg(state, ins, mask));
23978 static void print_op_out(struct compile_state *state, struct triple *ins, FILE *fp)
23985 case OP_OUTB: op = "outb", mask = REGCM_GPR8_LO; break;
23986 case OP_OUTW: op = "outw", mask = REGCM_GPR16; break;
23987 case OP_OUTL: op = "outl", mask = REGCM_GPR32; break;
23989 internal_error(state, ins, "not an out operation");
23993 lreg = check_reg(state, RHS(ins, 0), mask);
23994 if (!reg_is_reg(state, lreg, REG_EAX)) {
23995 internal_error(state, ins, "src != %%eax");
23997 if (is_const(RHS(ins, 1))) {
23998 fprintf(fp, "\t%s %s,",
23999 op, reg(state, RHS(ins, 0), mask));
24000 print_const_val(state, RHS(ins, 1), fp);
24005 addr_reg = check_reg(state, RHS(ins, 1), REGCM_GPR16);
24006 if (!reg_is_reg(state, addr_reg, REG_DX)) {
24007 internal_error(state, ins, "dst != %%dx");
24009 fprintf(fp, "\t%s %s, %s\n",
24011 reg(state, RHS(ins, 0), mask),
24012 reg(state, RHS(ins, 1), REGCM_GPR16));
24016 static void print_op_move(struct compile_state *state,
24017 struct triple *ins, FILE *fp)
24019 /* op_move is complex because there are many types
24020 * of registers we can move between.
24021 * Because OP_COPY will be introduced in arbitrary locations
24022 * OP_COPY must not affect flags.
24023 * OP_CONVERT can change the flags and it is the only operation
24024 * where it is expected the types in the registers can change.
24026 int omit_copy = 1; /* Is it o.k. to omit a noop copy? */
24027 struct triple *dst, *src;
24028 if (state->arch->features & X86_NOOP_COPY) {
24031 if ((ins->op == OP_COPY) || (ins->op == OP_CONVERT)) {
24036 internal_error(state, ins, "unknown move operation");
24039 if (reg_size(state, dst) < size_of(state, dst->type)) {
24040 internal_error(state, ins, "Invalid destination register");
24042 if (!equiv_types(src->type, dst->type) && (dst->op == OP_COPY)) {
24043 fprintf(state->errout, "src type: ");
24044 name_of(state->errout, src->type);
24045 fprintf(state->errout, "\n");
24046 fprintf(state->errout, "dst type: ");
24047 name_of(state->errout, dst->type);
24048 fprintf(state->errout, "\n");
24049 internal_error(state, ins, "Type mismatch for OP_COPY");
24052 if (!is_const(src)) {
24053 int src_reg, dst_reg;
24054 int src_regcm, dst_regcm;
24055 src_reg = ID_REG(src->id);
24056 dst_reg = ID_REG(dst->id);
24057 src_regcm = arch_reg_regcm(state, src_reg);
24058 dst_regcm = arch_reg_regcm(state, dst_reg);
24059 /* If the class is the same just move the register */
24060 if (src_regcm & dst_regcm &
24061 (REGCM_GPR8_LO | REGCM_GPR16 | REGCM_GPR32)) {
24062 if ((src_reg != dst_reg) || !omit_copy) {
24063 fprintf(fp, "\tmov %s, %s\n",
24064 reg(state, src, src_regcm),
24065 reg(state, dst, dst_regcm));
24068 /* Move 32bit to 16bit */
24069 else if ((src_regcm & REGCM_GPR32) &&
24070 (dst_regcm & REGCM_GPR16)) {
24071 src_reg = (src_reg - REGC_GPR32_FIRST) + REGC_GPR16_FIRST;
24072 if ((src_reg != dst_reg) || !omit_copy) {
24073 fprintf(fp, "\tmovw %s, %s\n",
24074 arch_reg_str(src_reg),
24075 arch_reg_str(dst_reg));
24078 /* Move from 32bit gprs to 16bit gprs */
24079 else if ((src_regcm & REGCM_GPR32) &&
24080 (dst_regcm & REGCM_GPR16)) {
24081 dst_reg = (dst_reg - REGC_GPR16_FIRST) + REGC_GPR32_FIRST;
24082 if ((src_reg != dst_reg) || !omit_copy) {
24083 fprintf(fp, "\tmov %s, %s\n",
24084 arch_reg_str(src_reg),
24085 arch_reg_str(dst_reg));
24088 /* Move 32bit to 8bit */
24089 else if ((src_regcm & REGCM_GPR32_8) &&
24090 (dst_regcm & REGCM_GPR8_LO))
24092 src_reg = (src_reg - REGC_GPR32_8_FIRST) + REGC_GPR8_FIRST;
24093 if ((src_reg != dst_reg) || !omit_copy) {
24094 fprintf(fp, "\tmovb %s, %s\n",
24095 arch_reg_str(src_reg),
24096 arch_reg_str(dst_reg));
24099 /* Move 16bit to 8bit */
24100 else if ((src_regcm & REGCM_GPR16_8) &&
24101 (dst_regcm & REGCM_GPR8_LO))
24103 src_reg = (src_reg - REGC_GPR16_8_FIRST) + REGC_GPR8_FIRST;
24104 if ((src_reg != dst_reg) || !omit_copy) {
24105 fprintf(fp, "\tmovb %s, %s\n",
24106 arch_reg_str(src_reg),
24107 arch_reg_str(dst_reg));
24110 /* Move 8/16bit to 16/32bit */
24111 else if ((src_regcm & (REGCM_GPR8_LO | REGCM_GPR16)) &&
24112 (dst_regcm & (REGCM_GPR16 | REGCM_GPR32))) {
24114 op = is_signed(src->type)? "movsx": "movzx";
24115 fprintf(fp, "\t%s %s, %s\n",
24117 reg(state, src, src_regcm),
24118 reg(state, dst, dst_regcm));
24120 /* Move between sse registers */
24121 else if ((src_regcm & dst_regcm & REGCM_XMM)) {
24122 if ((src_reg != dst_reg) || !omit_copy) {
24123 fprintf(fp, "\tmovdqa %s, %s\n",
24124 reg(state, src, src_regcm),
24125 reg(state, dst, dst_regcm));
24128 /* Move between mmx registers */
24129 else if ((src_regcm & dst_regcm & REGCM_MMX)) {
24130 if ((src_reg != dst_reg) || !omit_copy) {
24131 fprintf(fp, "\tmovq %s, %s\n",
24132 reg(state, src, src_regcm),
24133 reg(state, dst, dst_regcm));
24136 /* Move from sse to mmx registers */
24137 else if ((src_regcm & REGCM_XMM) && (dst_regcm & REGCM_MMX)) {
24138 fprintf(fp, "\tmovdq2q %s, %s\n",
24139 reg(state, src, src_regcm),
24140 reg(state, dst, dst_regcm));
24142 /* Move from mmx to sse registers */
24143 else if ((src_regcm & REGCM_MMX) && (dst_regcm & REGCM_XMM)) {
24144 fprintf(fp, "\tmovq2dq %s, %s\n",
24145 reg(state, src, src_regcm),
24146 reg(state, dst, dst_regcm));
24148 /* Move between 32bit gprs & mmx/sse registers */
24149 else if ((src_regcm & (REGCM_GPR32 | REGCM_MMX | REGCM_XMM)) &&
24150 (dst_regcm & (REGCM_GPR32 | REGCM_MMX | REGCM_XMM))) {
24151 fprintf(fp, "\tmovd %s, %s\n",
24152 reg(state, src, src_regcm),
24153 reg(state, dst, dst_regcm));
24155 /* Move from 16bit gprs & mmx/sse registers */
24156 else if ((src_regcm & REGCM_GPR16) &&
24157 (dst_regcm & (REGCM_MMX | REGCM_XMM))) {
24160 op = is_signed(src->type)? "movsx":"movzx";
24161 mid_reg = (src_reg - REGC_GPR16_FIRST) + REGC_GPR32_FIRST;
24162 fprintf(fp, "\t%s %s, %s\n\tmovd %s, %s\n",
24164 arch_reg_str(src_reg),
24165 arch_reg_str(mid_reg),
24166 arch_reg_str(mid_reg),
24167 arch_reg_str(dst_reg));
24169 /* Move from mmx/sse registers to 16bit gprs */
24170 else if ((src_regcm & (REGCM_MMX | REGCM_XMM)) &&
24171 (dst_regcm & REGCM_GPR16)) {
24172 dst_reg = (dst_reg - REGC_GPR16_FIRST) + REGC_GPR32_FIRST;
24173 fprintf(fp, "\tmovd %s, %s\n",
24174 arch_reg_str(src_reg),
24175 arch_reg_str(dst_reg));
24177 /* Move from gpr to 64bit dividend */
24178 else if ((src_regcm & (REGCM_GPR32 | REGCM_GPR16 | REGCM_GPR8_LO)) &&
24179 (dst_regcm & REGCM_DIVIDEND64)) {
24180 const char *extend;
24181 extend = is_signed(src->type)? "cltd":"movl $0, %edx";
24182 fprintf(fp, "\tmov %s, %%eax\n\t%s\n",
24183 arch_reg_str(src_reg),
24186 /* Move from 64bit gpr to gpr */
24187 else if ((src_regcm & REGCM_DIVIDEND64) &&
24188 (dst_regcm & (REGCM_GPR32 | REGCM_GPR16 | REGCM_GPR8_LO))) {
24189 if (dst_regcm & REGCM_GPR32) {
24192 else if (dst_regcm & REGCM_GPR16) {
24195 else if (dst_regcm & REGCM_GPR8_LO) {
24198 fprintf(fp, "\tmov %s, %s\n",
24199 arch_reg_str(src_reg),
24200 arch_reg_str(dst_reg));
24202 /* Move from mmx/sse registers to 64bit gpr */
24203 else if ((src_regcm & (REGCM_MMX | REGCM_XMM)) &&
24204 (dst_regcm & REGCM_DIVIDEND64)) {
24205 const char *extend;
24206 extend = is_signed(src->type)? "cltd": "movl $0, %edx";
24207 fprintf(fp, "\tmovd %s, %%eax\n\t%s\n",
24208 arch_reg_str(src_reg),
24211 /* Move from 64bit gpr to mmx/sse register */
24212 else if ((src_regcm & REGCM_DIVIDEND64) &&
24213 (dst_regcm & (REGCM_XMM | REGCM_MMX))) {
24214 fprintf(fp, "\tmovd %%eax, %s\n",
24215 arch_reg_str(dst_reg));
24217 #if X86_4_8BIT_GPRS
24218 /* Move from 8bit gprs to mmx/sse registers */
24219 else if ((src_regcm & REGCM_GPR8_LO) && (src_reg <= REG_DL) &&
24220 (dst_regcm & (REGCM_MMX | REGCM_XMM))) {
24223 op = is_signed(src->type)? "movsx":"movzx";
24224 mid_reg = (src_reg - REGC_GPR8_FIRST) + REGC_GPR32_FIRST;
24225 fprintf(fp, "\t%s %s, %s\n\tmovd %s, %s\n",
24227 reg(state, src, src_regcm),
24228 arch_reg_str(mid_reg),
24229 arch_reg_str(mid_reg),
24230 reg(state, dst, dst_regcm));
24232 /* Move from mmx/sse registers and 8bit gprs */
24233 else if ((src_regcm & (REGCM_MMX | REGCM_XMM)) &&
24234 (dst_regcm & REGCM_GPR8_LO) && (dst_reg <= REG_DL)) {
24236 mid_reg = (dst_reg - REGC_GPR8_FIRST) + REGC_GPR32_FIRST;
24237 fprintf(fp, "\tmovd %s, %s\n",
24238 reg(state, src, src_regcm),
24239 arch_reg_str(mid_reg));
24241 /* Move from 32bit gprs to 8bit gprs */
24242 else if ((src_regcm & REGCM_GPR32) &&
24243 (dst_regcm & REGCM_GPR8_LO)) {
24244 dst_reg = (dst_reg - REGC_GPR8_FIRST) + REGC_GPR32_FIRST;
24245 if ((src_reg != dst_reg) || !omit_copy) {
24246 fprintf(fp, "\tmov %s, %s\n",
24247 arch_reg_str(src_reg),
24248 arch_reg_str(dst_reg));
24251 /* Move from 16bit gprs to 8bit gprs */
24252 else if ((src_regcm & REGCM_GPR16) &&
24253 (dst_regcm & REGCM_GPR8_LO)) {
24254 dst_reg = (dst_reg - REGC_GPR8_FIRST) + REGC_GPR16_FIRST;
24255 if ((src_reg != dst_reg) || !omit_copy) {
24256 fprintf(fp, "\tmov %s, %s\n",
24257 arch_reg_str(src_reg),
24258 arch_reg_str(dst_reg));
24261 #endif /* X86_4_8BIT_GPRS */
24262 /* Move from %eax:%edx to %eax:%edx */
24263 else if ((src_regcm & REGCM_DIVIDEND64) &&
24264 (dst_regcm & REGCM_DIVIDEND64) &&
24265 (src_reg == dst_reg)) {
24267 fprintf(fp, "\t/*mov %s, %s*/\n",
24268 arch_reg_str(src_reg),
24269 arch_reg_str(dst_reg));
24273 if ((src_regcm & ~REGCM_FLAGS) == 0) {
24274 internal_error(state, ins, "attempt to copy from %%eflags!");
24276 internal_error(state, ins, "unknown copy type");
24283 dst_size = size_of(state, dst->type);
24284 dst_reg = ID_REG(dst->id);
24285 dst_regcm = arch_reg_regcm(state, dst_reg);
24286 if (dst_regcm & (REGCM_GPR32 | REGCM_GPR16 | REGCM_GPR8_LO)) {
24287 fprintf(fp, "\tmov ");
24288 print_const_val(state, src, fp);
24289 fprintf(fp, ", %s\n",
24290 reg(state, dst, REGCM_GPR32 | REGCM_GPR16 | REGCM_GPR8_LO));
24292 else if (dst_regcm & REGCM_DIVIDEND64) {
24293 if (dst_size > SIZEOF_I32) {
24294 internal_error(state, ins, "%dbit constant...", dst_size);
24296 fprintf(fp, "\tmov $0, %%edx\n");
24297 fprintf(fp, "\tmov ");
24298 print_const_val(state, src, fp);
24299 fprintf(fp, ", %%eax\n");
24301 else if (dst_regcm & REGCM_DIVIDEND32) {
24302 if (dst_size > SIZEOF_I16) {
24303 internal_error(state, ins, "%dbit constant...", dst_size);
24305 fprintf(fp, "\tmov $0, %%dx\n");
24306 fprintf(fp, "\tmov ");
24307 print_const_val(state, src, fp);
24308 fprintf(fp, ", %%ax");
24310 else if (dst_regcm & (REGCM_XMM | REGCM_MMX)) {
24312 if (dst_size > SIZEOF_I32) {
24313 internal_error(state, ins, "%d bit constant...", dst_size);
24315 ref = get_const_pool_ref(state, src, SIZEOF_I32, fp);
24316 fprintf(fp, "\tmovd L%s%lu, %s\n",
24317 state->compiler->label_prefix, ref,
24318 reg(state, dst, (REGCM_XMM | REGCM_MMX)));
24321 internal_error(state, ins, "unknown copy immediate type");
24324 /* Leave now if this is not a type conversion */
24325 if (ins->op != OP_CONVERT) {
24328 /* Now make certain I have not logically overflowed the destination */
24329 if ((size_of(state, src->type) > size_of(state, dst->type)) &&
24330 (size_of(state, dst->type) < reg_size(state, dst)))
24332 unsigned long mask;
24335 if (size_of(state, dst->type) >= 32) {
24336 fprintf(state->errout, "dst type: ");
24337 name_of(state->errout, dst->type);
24338 fprintf(state->errout, "\n");
24339 internal_error(state, dst, "unhandled dst type size");
24342 mask <<= size_of(state, dst->type);
24345 dst_reg = ID_REG(dst->id);
24346 dst_regcm = arch_reg_regcm(state, dst_reg);
24348 if (dst_regcm & (REGCM_GPR32 | REGCM_GPR16 | REGCM_GPR8_LO)) {
24349 fprintf(fp, "\tand $0x%lx, %s\n",
24350 mask, reg(state, dst, REGCM_GPR32 | REGCM_GPR16 | REGCM_GPR8_LO));
24352 else if (dst_regcm & REGCM_MMX) {
24354 ref = get_mask_pool_ref(state, dst, mask, fp);
24355 fprintf(fp, "\tpand L%s%lu, %s\n",
24356 state->compiler->label_prefix, ref,
24357 reg(state, dst, REGCM_MMX));
24359 else if (dst_regcm & REGCM_XMM) {
24361 ref = get_mask_pool_ref(state, dst, mask, fp);
24362 fprintf(fp, "\tpand L%s%lu, %s\n",
24363 state->compiler->label_prefix, ref,
24364 reg(state, dst, REGCM_XMM));
24367 fprintf(state->errout, "dst type: ");
24368 name_of(state->errout, dst->type);
24369 fprintf(state->errout, "\n");
24370 fprintf(state->errout, "dst: %s\n", reg(state, dst, REGCM_ALL));
24371 internal_error(state, dst, "failed to trunc value: mask %lx", mask);
24374 /* Make certain I am properly sign extended */
24375 if ((size_of(state, src->type) < size_of(state, dst->type)) &&
24376 (is_signed(src->type)))
24378 int reg_bits, shift_bits;
24382 reg_bits = reg_size(state, dst);
24383 if (reg_bits > 32) {
24386 shift_bits = reg_bits - size_of(state, src->type);
24387 dst_reg = ID_REG(dst->id);
24388 dst_regcm = arch_reg_regcm(state, dst_reg);
24390 if (shift_bits < 0) {
24391 internal_error(state, dst, "negative shift?");
24394 if (dst_regcm & (REGCM_GPR32 | REGCM_GPR16 | REGCM_GPR8_LO)) {
24395 fprintf(fp, "\tshl $%d, %s\n",
24397 reg(state, dst, REGCM_GPR32 | REGCM_GPR16 | REGCM_GPR8_LO));
24398 fprintf(fp, "\tsar $%d, %s\n",
24400 reg(state, dst, REGCM_GPR32 | REGCM_GPR16 | REGCM_GPR8_LO));
24402 else if (dst_regcm & (REGCM_MMX | REGCM_XMM)) {
24403 fprintf(fp, "\tpslld $%d, %s\n",
24405 reg(state, dst, REGCM_MMX | REGCM_XMM));
24406 fprintf(fp, "\tpsrad $%d, %s\n",
24408 reg(state, dst, REGCM_MMX | REGCM_XMM));
24411 fprintf(state->errout, "dst type: ");
24412 name_of(state->errout, dst->type);
24413 fprintf(state->errout, "\n");
24414 fprintf(state->errout, "dst: %s\n", reg(state, dst, REGCM_ALL));
24415 internal_error(state, dst, "failed to signed extend value");
24420 static void print_op_load(struct compile_state *state,
24421 struct triple *ins, FILE *fp)
24423 struct triple *dst, *src;
24427 if (is_const(src) || is_const(dst)) {
24428 internal_error(state, ins, "unknown load operation");
24430 switch(ins->type->type & TYPE_MASK) {
24431 case TYPE_CHAR: op = "movsbl"; break;
24432 case TYPE_UCHAR: op = "movzbl"; break;
24433 case TYPE_SHORT: op = "movswl"; break;
24434 case TYPE_USHORT: op = "movzwl"; break;
24435 case TYPE_INT: case TYPE_UINT:
24436 case TYPE_LONG: case TYPE_ULONG:
24441 internal_error(state, ins, "unknown type in load");
24442 op = "<invalid opcode>";
24445 fprintf(fp, "\t%s (%s), %s\n",
24447 reg(state, src, REGCM_GPR32),
24448 reg(state, dst, REGCM_GPR32));
24452 static void print_op_store(struct compile_state *state,
24453 struct triple *ins, FILE *fp)
24455 struct triple *dst, *src;
24458 if (is_const(src) && (src->op == OP_INTCONST)) {
24460 value = (long_t)(src->u.cval);
24461 fprintf(fp, "\tmov%s $%ld, (%s)\n",
24462 type_suffix(state, src->type),
24464 reg(state, dst, REGCM_GPR32));
24466 else if (is_const(dst) && (dst->op == OP_INTCONST)) {
24467 fprintf(fp, "\tmov%s %s, 0x%08lx\n",
24468 type_suffix(state, src->type),
24469 reg(state, src, REGCM_GPR8_LO | REGCM_GPR16 | REGCM_GPR32),
24470 (unsigned long)(dst->u.cval));
24473 if (is_const(src) || is_const(dst)) {
24474 internal_error(state, ins, "unknown store operation");
24476 fprintf(fp, "\tmov%s %s, (%s)\n",
24477 type_suffix(state, src->type),
24478 reg(state, src, REGCM_GPR8_LO | REGCM_GPR16 | REGCM_GPR32),
24479 reg(state, dst, REGCM_GPR32));
24485 static void print_op_smul(struct compile_state *state,
24486 struct triple *ins, FILE *fp)
24488 if (!is_const(RHS(ins, 1))) {
24489 fprintf(fp, "\timul %s, %s\n",
24490 reg(state, RHS(ins, 1), REGCM_GPR32),
24491 reg(state, RHS(ins, 0), REGCM_GPR32));
24494 fprintf(fp, "\timul ");
24495 print_const_val(state, RHS(ins, 1), fp);
24496 fprintf(fp, ", %s\n", reg(state, RHS(ins, 0), REGCM_GPR32));
24500 static void print_op_cmp(struct compile_state *state,
24501 struct triple *ins, FILE *fp)
24505 mask = REGCM_GPR32 | REGCM_GPR16 | REGCM_GPR8_LO;
24506 dreg = check_reg(state, ins, REGCM_FLAGS);
24507 if (!reg_is_reg(state, dreg, REG_EFLAGS)) {
24508 internal_error(state, ins, "bad dest register for cmp");
24510 if (is_const(RHS(ins, 1))) {
24511 fprintf(fp, "\tcmp ");
24512 print_const_val(state, RHS(ins, 1), fp);
24513 fprintf(fp, ", %s\n", reg(state, RHS(ins, 0), mask));
24516 unsigned lmask, rmask;
24518 lreg = check_reg(state, RHS(ins, 0), mask);
24519 rreg = check_reg(state, RHS(ins, 1), mask);
24520 lmask = arch_reg_regcm(state, lreg);
24521 rmask = arch_reg_regcm(state, rreg);
24522 mask = lmask & rmask;
24523 fprintf(fp, "\tcmp %s, %s\n",
24524 reg(state, RHS(ins, 1), mask),
24525 reg(state, RHS(ins, 0), mask));
24529 static void print_op_test(struct compile_state *state,
24530 struct triple *ins, FILE *fp)
24533 mask = REGCM_GPR32 | REGCM_GPR16 | REGCM_GPR8_LO;
24534 fprintf(fp, "\ttest %s, %s\n",
24535 reg(state, RHS(ins, 0), mask),
24536 reg(state, RHS(ins, 0), mask));
24539 static void print_op_branch(struct compile_state *state,
24540 struct triple *branch, FILE *fp)
24542 const char *bop = "j";
24543 if ((branch->op == OP_JMP) || (branch->op == OP_CALL)) {
24544 if (branch->rhs != 0) {
24545 internal_error(state, branch, "jmp with condition?");
24550 struct triple *ptr;
24551 if (branch->rhs != 1) {
24552 internal_error(state, branch, "jmpcc without condition?");
24554 check_reg(state, RHS(branch, 0), REGCM_FLAGS);
24555 if ((RHS(branch, 0)->op != OP_CMP) &&
24556 (RHS(branch, 0)->op != OP_TEST)) {
24557 internal_error(state, branch, "bad branch test");
24559 #if DEBUG_ROMCC_WARNINGS
24560 #warning "FIXME I have observed instructions between the test and branch instructions"
24562 ptr = RHS(branch, 0);
24563 for(ptr = RHS(branch, 0)->next; ptr != branch; ptr = ptr->next) {
24564 if (ptr->op != OP_COPY) {
24565 internal_error(state, branch, "branch does not follow test");
24568 switch(branch->op) {
24569 case OP_JMP_EQ: bop = "jz"; break;
24570 case OP_JMP_NOTEQ: bop = "jnz"; break;
24571 case OP_JMP_SLESS: bop = "jl"; break;
24572 case OP_JMP_ULESS: bop = "jb"; break;
24573 case OP_JMP_SMORE: bop = "jg"; break;
24574 case OP_JMP_UMORE: bop = "ja"; break;
24575 case OP_JMP_SLESSEQ: bop = "jle"; break;
24576 case OP_JMP_ULESSEQ: bop = "jbe"; break;
24577 case OP_JMP_SMOREEQ: bop = "jge"; break;
24578 case OP_JMP_UMOREEQ: bop = "jae"; break;
24580 internal_error(state, branch, "Invalid branch op");
24586 if (branch->op == OP_CALL) {
24587 fprintf(fp, "\t/* call */\n");
24590 fprintf(fp, "\t%s L%s%lu\n",
24592 state->compiler->label_prefix,
24593 (unsigned long)(TARG(branch, 0)->u.cval));
24596 static void print_op_ret(struct compile_state *state,
24597 struct triple *branch, FILE *fp)
24599 fprintf(fp, "\tjmp *%s\n",
24600 reg(state, RHS(branch, 0), REGCM_GPR32));
24603 static void print_op_set(struct compile_state *state,
24604 struct triple *set, FILE *fp)
24606 const char *sop = "set";
24607 if (set->rhs != 1) {
24608 internal_error(state, set, "setcc without condition?");
24610 check_reg(state, RHS(set, 0), REGCM_FLAGS);
24611 if ((RHS(set, 0)->op != OP_CMP) &&
24612 (RHS(set, 0)->op != OP_TEST)) {
24613 internal_error(state, set, "bad set test");
24615 if (RHS(set, 0)->next != set) {
24616 internal_error(state, set, "set does not follow test");
24619 case OP_SET_EQ: sop = "setz"; break;
24620 case OP_SET_NOTEQ: sop = "setnz"; break;
24621 case OP_SET_SLESS: sop = "setl"; break;
24622 case OP_SET_ULESS: sop = "setb"; break;
24623 case OP_SET_SMORE: sop = "setg"; break;
24624 case OP_SET_UMORE: sop = "seta"; break;
24625 case OP_SET_SLESSEQ: sop = "setle"; break;
24626 case OP_SET_ULESSEQ: sop = "setbe"; break;
24627 case OP_SET_SMOREEQ: sop = "setge"; break;
24628 case OP_SET_UMOREEQ: sop = "setae"; break;
24630 internal_error(state, set, "Invalid set op");
24633 fprintf(fp, "\t%s %s\n",
24634 sop, reg(state, set, REGCM_GPR8_LO));
24637 static void print_op_bit_scan(struct compile_state *state,
24638 struct triple *ins, FILE *fp)
24642 case OP_BSF: op = "bsf"; break;
24643 case OP_BSR: op = "bsr"; break;
24645 internal_error(state, ins, "unknown bit scan");
24655 reg(state, RHS(ins, 0), REGCM_GPR32),
24656 reg(state, ins, REGCM_GPR32),
24657 reg(state, ins, REGCM_GPR32));
24661 static void print_sdecl(struct compile_state *state,
24662 struct triple *ins, FILE *fp)
24664 fprintf(fp, ".section \"" DATA_SECTION "\"\n");
24665 fprintf(fp, ".balign %ld\n", (long int)align_of_in_bytes(state, ins->type));
24666 fprintf(fp, "L%s%lu:\n",
24667 state->compiler->label_prefix, (unsigned long)(ins->u.cval));
24668 print_const(state, MISC(ins, 0), fp);
24669 fprintf(fp, ".section \"" TEXT_SECTION "\"\n");
24673 static void print_instruction(struct compile_state *state,
24674 struct triple *ins, FILE *fp)
24676 /* Assumption: after I have exted the register allocator
24677 * everything is in a valid register.
24681 print_op_asm(state, ins, fp);
24683 case OP_ADD: print_binary_op(state, "add", ins, fp); break;
24684 case OP_SUB: print_binary_op(state, "sub", ins, fp); break;
24685 case OP_AND: print_binary_op(state, "and", ins, fp); break;
24686 case OP_XOR: print_binary_op(state, "xor", ins, fp); break;
24687 case OP_OR: print_binary_op(state, "or", ins, fp); break;
24688 case OP_SL: print_op_shift(state, "shl", ins, fp); break;
24689 case OP_USR: print_op_shift(state, "shr", ins, fp); break;
24690 case OP_SSR: print_op_shift(state, "sar", ins, fp); break;
24691 case OP_POS: break;
24692 case OP_NEG: print_unary_op(state, "neg", ins, fp); break;
24693 case OP_INVERT: print_unary_op(state, "not", ins, fp); break;
24698 /* Don't generate anything here for constants */
24700 /* Don't generate anything for variable declarations. */
24702 case OP_UNKNOWNVAL:
24703 fprintf(fp, " /* unknown %s */\n",
24704 reg(state, ins, REGCM_ALL));
24707 print_sdecl(state, ins, fp);
24711 print_op_move(state, ins, fp);
24714 print_op_load(state, ins, fp);
24717 print_op_store(state, ins, fp);
24720 print_op_smul(state, ins, fp);
24722 case OP_CMP: print_op_cmp(state, ins, fp); break;
24723 case OP_TEST: print_op_test(state, ins, fp); break;
24725 case OP_JMP_EQ: case OP_JMP_NOTEQ:
24726 case OP_JMP_SLESS: case OP_JMP_ULESS:
24727 case OP_JMP_SMORE: case OP_JMP_UMORE:
24728 case OP_JMP_SLESSEQ: case OP_JMP_ULESSEQ:
24729 case OP_JMP_SMOREEQ: case OP_JMP_UMOREEQ:
24731 print_op_branch(state, ins, fp);
24734 print_op_ret(state, ins, fp);
24736 case OP_SET_EQ: case OP_SET_NOTEQ:
24737 case OP_SET_SLESS: case OP_SET_ULESS:
24738 case OP_SET_SMORE: case OP_SET_UMORE:
24739 case OP_SET_SLESSEQ: case OP_SET_ULESSEQ:
24740 case OP_SET_SMOREEQ: case OP_SET_UMOREEQ:
24741 print_op_set(state, ins, fp);
24743 case OP_INB: case OP_INW: case OP_INL:
24744 print_op_in(state, ins, fp);
24746 case OP_OUTB: case OP_OUTW: case OP_OUTL:
24747 print_op_out(state, ins, fp);
24751 print_op_bit_scan(state, ins, fp);
24754 after_lhs(state, ins);
24755 fprintf(fp, "\trdmsr\n");
24758 fprintf(fp, "\twrmsr\n");
24761 fprintf(fp, "\thlt\n");
24764 fprintf(fp, "\tidiv %s\n", reg(state, RHS(ins, 1), REGCM_GPR32));
24767 fprintf(fp, "\tdiv %s\n", reg(state, RHS(ins, 1), REGCM_GPR32));
24770 fprintf(fp, "\tmul %s\n", reg(state, RHS(ins, 1), REGCM_GPR32));
24776 fprintf(fp, "L%s%lu:\n",
24777 state->compiler->label_prefix, (unsigned long)(ins->u.cval));
24780 /* Ignore adecls with no registers error otherwise */
24781 if (!noop_adecl(ins)) {
24782 internal_error(state, ins, "adecl remains?");
24785 /* Ignore OP_PIECE */
24788 /* Operations that should never get here */
24789 case OP_SDIV: case OP_UDIV:
24790 case OP_SMOD: case OP_UMOD:
24791 case OP_LTRUE: case OP_LFALSE: case OP_EQ: case OP_NOTEQ:
24792 case OP_SLESS: case OP_ULESS: case OP_SMORE: case OP_UMORE:
24793 case OP_SLESSEQ: case OP_ULESSEQ: case OP_SMOREEQ: case OP_UMOREEQ:
24795 internal_error(state, ins, "unknown op: %d %s",
24796 ins->op, tops(ins->op));
24801 static void print_instructions(struct compile_state *state)
24803 struct triple *first, *ins;
24804 int print_location;
24805 struct occurance *last_occurance;
24807 int max_inline_depth;
24808 max_inline_depth = 0;
24809 print_location = 1;
24810 last_occurance = 0;
24811 fp = state->output;
24812 /* Masks for common sizes */
24813 fprintf(fp, ".section \"" DATA_SECTION "\"\n");
24814 fprintf(fp, ".balign 16\n");
24815 fprintf(fp, "L%s1:\n", state->compiler->label_prefix);
24816 fprintf(fp, ".int 0xff, 0, 0, 0\n");
24817 fprintf(fp, "L%s2:\n", state->compiler->label_prefix);
24818 fprintf(fp, ".int 0xffff, 0, 0, 0\n");
24819 fprintf(fp, ".section \"" TEXT_SECTION "\"\n");
24820 first = state->first;
24823 if (print_location &&
24824 last_occurance != ins->occurance) {
24825 if (!ins->occurance->parent) {
24826 fprintf(fp, "\t/* %s,%s:%d.%d */\n",
24827 ins->occurance->function?ins->occurance->function:"(null)",
24828 ins->occurance->filename?ins->occurance->filename:"(null)",
24829 ins->occurance->line,
24830 ins->occurance->col);
24833 struct occurance *ptr;
24835 fprintf(fp, "\t/*\n");
24837 for(ptr = ins->occurance; ptr; ptr = ptr->parent) {
24839 fprintf(fp, "\t * %s,%s:%d.%d\n",
24845 fprintf(fp, "\t */\n");
24846 if (inline_depth > max_inline_depth) {
24847 max_inline_depth = inline_depth;
24850 if (last_occurance) {
24851 put_occurance(last_occurance);
24853 get_occurance(ins->occurance);
24854 last_occurance = ins->occurance;
24857 print_instruction(state, ins, fp);
24859 } while(ins != first);
24860 if (print_location) {
24861 fprintf(fp, "/* max inline depth %d */\n",
24866 static void generate_code(struct compile_state *state)
24868 generate_local_labels(state);
24869 print_instructions(state);
24873 static void print_preprocessed_tokens(struct compile_state *state)
24878 const char *filename;
24879 fp = state->output;
24883 struct file_state *file;
24885 const char *token_str;
24887 if (tok == TOK_EOF) {
24890 tk = eat(state, tok);
24892 tk->ident ? tk->ident->name :
24893 tk->str_len ? tk->val.str :
24896 file = state->file;
24897 while(file->macro && file->prev) {
24900 if (!file->macro &&
24901 ((file->line != line) || (file->basename != filename)))
24904 if ((file->basename == filename) &&
24905 (line < file->line)) {
24906 while(line < file->line) {
24912 fprintf(fp, "\n#line %d \"%s\"\n",
24913 file->line, file->basename);
24916 filename = file->basename;
24917 col = get_col(file) - strlen(token_str);
24918 for(i = 0; i < col; i++) {
24923 fprintf(fp, "%s ", token_str);
24925 if (state->compiler->debug & DEBUG_TOKENS) {
24926 loc(state->dbgout, state, 0);
24927 fprintf(state->dbgout, "%s <- `%s'\n",
24928 tokens[tok], token_str);
24933 static void compile(const char *filename,
24934 struct compiler_state *compiler, struct arch_state *arch)
24937 struct compile_state state;
24938 struct triple *ptr;
24939 struct filelist *includes = include_filelist;
24940 memset(&state, 0, sizeof(state));
24941 state.compiler = compiler;
24944 for(i = 0; i < sizeof(state.token)/sizeof(state.token[0]); i++) {
24945 memset(&state.token[i], 0, sizeof(state.token[i]));
24946 state.token[i].tok = -1;
24948 /* Remember the output descriptors */
24949 state.errout = stderr;
24950 state.dbgout = stdout;
24951 /* Remember the output filename */
24952 if ((state.compiler->flags & COMPILER_PP_ONLY) && (strcmp("auto.inc",state.compiler->ofilename) == 0)) {
24953 state.output = stdout;
24955 state.output = fopen(state.compiler->ofilename, "w");
24956 if (!state.output) {
24957 error(&state, 0, "Cannot open output file %s\n",
24958 state.compiler->ofilename);
24961 /* Make certain a good cleanup happens */
24962 exit_state = &state;
24963 atexit(exit_cleanup);
24965 /* Prep the preprocessor */
24966 state.if_depth = 0;
24967 memset(state.if_bytes, 0, sizeof(state.if_bytes));
24968 /* register the C keywords */
24969 register_keywords(&state);
24970 /* register the keywords the macro preprocessor knows */
24971 register_macro_keywords(&state);
24972 /* generate some builtin macros */
24973 register_builtin_macros(&state);
24974 /* Memorize where some special keywords are. */
24975 state.i_switch = lookup(&state, "switch", 6);
24976 state.i_case = lookup(&state, "case", 4);
24977 state.i_continue = lookup(&state, "continue", 8);
24978 state.i_break = lookup(&state, "break", 5);
24979 state.i_default = lookup(&state, "default", 7);
24980 state.i_return = lookup(&state, "return", 6);
24981 /* Memorize where predefined macros are. */
24982 state.i___VA_ARGS__ = lookup(&state, "__VA_ARGS__", 11);
24983 state.i___FILE__ = lookup(&state, "__FILE__", 8);
24984 state.i___LINE__ = lookup(&state, "__LINE__", 8);
24985 /* Memorize where predefined identifiers are. */
24986 state.i___func__ = lookup(&state, "__func__", 8);
24987 /* Memorize where some attribute keywords are. */
24988 state.i_noinline = lookup(&state, "noinline", 8);
24989 state.i_always_inline = lookup(&state, "always_inline", 13);
24990 state.i_noreturn = lookup(&state, "noreturn", 8);
24992 /* Process the command line macros */
24993 process_cmdline_macros(&state);
24995 /* Allocate beginning bounding labels for the function list */
24996 state.first = label(&state);
24997 state.first->id |= TRIPLE_FLAG_VOLATILE;
24998 use_triple(state.first, state.first);
24999 ptr = label(&state);
25000 ptr->id |= TRIPLE_FLAG_VOLATILE;
25001 use_triple(ptr, ptr);
25002 flatten(&state, state.first, ptr);
25004 /* Allocate a label for the pool of global variables */
25005 state.global_pool = label(&state);
25006 state.global_pool->id |= TRIPLE_FLAG_VOLATILE;
25007 flatten(&state, state.first, state.global_pool);
25009 /* Enter the globl definition scope */
25010 start_scope(&state);
25011 register_builtins(&state);
25013 compile_file(&state, filename, 1);
25016 compile_file(&state, includes->filename, 1);
25017 includes=includes->next;
25020 /* Stop if all we want is preprocessor output */
25021 if (state.compiler->flags & COMPILER_PP_ONLY) {
25022 print_preprocessed_tokens(&state);
25028 /* Exit the global definition scope */
25031 /* Now that basic compilation has happened
25032 * optimize the intermediate code
25036 generate_code(&state);
25037 if (state.compiler->debug) {
25038 fprintf(state.errout, "done\n");
25043 static void version(FILE *fp)
25045 fprintf(fp, "romcc " VERSION " released " RELEASE_DATE "\n");
25048 static void usage(void)
25053 "\nUsage: romcc [options] <source>.c\n"
25054 "Compile a C source file generating a binary that does not implicilty use RAM\n"
25056 "-o <output file name>\n"
25057 "-f<option> Specify a generic compiler option\n"
25058 "-m<option> Specify a arch dependent option\n"
25059 "-- Specify this is the last option\n"
25060 "\nGeneric compiler options:\n"
25062 compiler_usage(fp);
25064 "\nArchitecture compiler options:\n"
25072 static void arg_error(char *fmt, ...)
25075 va_start(args, fmt);
25076 vfprintf(stderr, fmt, args);
25082 int main(int argc, char **argv)
25084 const char *filename;
25085 struct compiler_state compiler;
25086 struct arch_state arch;
25090 /* I don't want any surprises */
25091 setlocale(LC_ALL, "C");
25093 init_compiler_state(&compiler);
25094 init_arch_state(&arch);
25098 if (!all_opts && (strcmp(argv[1], "-o") == 0) && (argc > 2)) {
25099 compiler.ofilename = argv[2];
25103 else if (!all_opts && argv[1][0] == '-') {
25106 if (strcmp(argv[1], "--") == 0) {
25110 else if (strncmp(argv[1], "-E", 2) == 0) {
25111 result = compiler_encode_flag(&compiler, argv[1]);
25113 else if (strncmp(argv[1], "-O", 2) == 0) {
25114 result = compiler_encode_flag(&compiler, argv[1]);
25116 else if (strncmp(argv[1], "-I", 2) == 0) {
25117 result = compiler_encode_flag(&compiler, argv[1]);
25119 else if (strncmp(argv[1], "-D", 2) == 0) {
25120 result = compiler_encode_flag(&compiler, argv[1]);
25122 else if (strncmp(argv[1], "-U", 2) == 0) {
25123 result = compiler_encode_flag(&compiler, argv[1]);
25125 else if (strncmp(argv[1], "--label-prefix=", 15) == 0) {
25126 result = compiler_encode_flag(&compiler, argv[1]+2);
25128 else if (strncmp(argv[1], "-f", 2) == 0) {
25129 result = compiler_encode_flag(&compiler, argv[1]+2);
25131 else if (strncmp(argv[1], "-m", 2) == 0) {
25132 result = arch_encode_flag(&arch, argv[1]+2);
25134 else if (strncmp(argv[1], "-c", 2) == 0) {
25137 else if (strncmp(argv[1], "-S", 2) == 0) {
25140 else if (strncmp(argv[1], "-include", 10) == 0) {
25141 struct filelist *old_head = include_filelist;
25142 include_filelist = malloc(sizeof(struct filelist));
25143 if (!include_filelist) {
25144 die("Out of memory.\n");
25148 include_filelist->filename = strdup(argv[1]);
25149 include_filelist->next = old_head;
25153 arg_error("Invalid option specified: %s\n",
25161 arg_error("Only one filename may be specified\n");
25163 filename = argv[1];
25169 arg_error("No filename specified\n");
25171 compile(filename, &compiler, &arch);