1 /* Allocate and read RTL for GNU C Compiler.
2 Copyright (C) 1987, 1988, 1991, 1994, 1997, 1998, 1999
3 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
30 #define obstack_chunk_alloc xmalloc
31 #define obstack_chunk_free free
34 #define DIR_SEPARATOR '/'
37 /* Obstack used for allocating RTL objects.
38 Between functions, this is the permanent_obstack.
39 While parsing and expanding a function, this is maybepermanent_obstack
40 so we can save it if it is an inline function.
41 During optimization and output, this is function_obstack. */
43 extern struct obstack *rtl_obstack;
45 /* Calculate the format for CONST_DOUBLE. This depends on the relative
46 widths of HOST_WIDE_INT and REAL_VALUE_TYPE.
48 We need to go out to e0wwwww, since REAL_ARITHMETIC assumes 16-bits
49 per element in REAL_VALUE_TYPE.
51 This is duplicated in gengenrtl.c.
53 A number of places assume that there are always at least two 'w'
54 slots in a CONST_DOUBLE, so we provide them even if one would suffice. */
56 #ifdef REAL_ARITHMETIC
57 #if LONG_DOUBLE_TYPE_SIZE == 96
58 #define REAL_WIDTH (11*8 + HOST_BITS_PER_WIDE_INT)/HOST_BITS_PER_WIDE_INT
59 #elif LONG_DOUBLE_TYPE_SIZE == 128
60 #define REAL_WIDTH (19*8 + HOST_BITS_PER_WIDE_INT)/HOST_BITS_PER_WIDE_INT
61 #elif HOST_FLOAT_FORMAT != TARGET_FLOAT_FORMAT
62 #define REAL_WIDTH (7*8 + HOST_BITS_PER_WIDE_INT)/HOST_BITS_PER_WIDE_INT
64 #endif /* REAL_ARITHMETIC */
67 #if HOST_BITS_PER_WIDE_INT*2 >= LONG_DOUBLE_TYPE_SIZE
69 #elif HOST_BITS_PER_WIDE_INT*3 >= LONG_DOUBLE_TYPE_SIZE
71 #elif HOST_BITS_PER_WIDE_INT*4 >= LONG_DOUBLE_TYPE_SIZE
74 #endif /* REAL_WIDTH */
77 #define CONST_DOUBLE_FORMAT "e0ww"
79 #define CONST_DOUBLE_FORMAT "e0ww"
81 #define CONST_DOUBLE_FORMAT "e0www"
83 #define CONST_DOUBLE_FORMAT "e0wwww"
85 #define CONST_DOUBLE_FORMAT "e0wwwww"
87 #define CONST_DOUBLE_FORMAT /* nothing - will cause syntax error */
90 /* Indexed by rtx code, gives number of operands for an rtx with that code.
91 Does NOT include rtx header data (code and links). */
93 #define DEF_RTL_EXPR(ENUM, NAME, FORMAT, CLASS) sizeof FORMAT - 1 ,
95 const int rtx_length[NUM_RTX_CODE + 1] = {
101 /* Indexed by rtx code, gives the name of that kind of rtx, as a C string. */
103 #define DEF_RTL_EXPR(ENUM, NAME, FORMAT, CLASS) NAME ,
105 const char * const rtx_name[] = {
106 #include "rtl.def" /* rtl expressions are documented here */
111 /* Indexed by machine mode, gives the name of that machine mode.
112 This name does not include the letters "mode". */
114 #define DEF_MACHMODE(SYM, NAME, CLASS, SIZE, UNIT, WIDER) NAME,
116 const char * const mode_name[(int) MAX_MACHINE_MODE + 1] = {
117 #include "machmode.def"
118 /* Add an extra field to avoid a core dump if someone tries to convert
119 MAX_MACHINE_MODE to a string. */
125 /* Indexed by machine mode, gives the length of the mode, in bytes.
126 GET_MODE_CLASS uses this. */
128 #define DEF_MACHMODE(SYM, NAME, CLASS, SIZE, UNIT, WIDER) CLASS,
130 const enum mode_class mode_class[(int) MAX_MACHINE_MODE] = {
131 #include "machmode.def"
136 /* Indexed by machine mode, gives the length of the mode, in bytes.
137 GET_MODE_SIZE uses this. */
139 #define DEF_MACHMODE(SYM, NAME, CLASS, SIZE, UNIT, WIDER) SIZE,
141 const int mode_size[(int) MAX_MACHINE_MODE] = {
142 #include "machmode.def"
147 /* Indexed by machine mode, gives the length of the mode's subunit.
148 GET_MODE_UNIT_SIZE uses this. */
150 #define DEF_MACHMODE(SYM, NAME, CLASS, SIZE, UNIT, WIDER) UNIT,
152 const int mode_unit_size[(int) MAX_MACHINE_MODE] = {
153 #include "machmode.def" /* machine modes are documented here */
158 /* Indexed by machine mode, gives next wider natural mode
159 (QI -> HI -> SI -> DI, etc.) Widening multiply instructions
162 #define DEF_MACHMODE(SYM, NAME, CLASS, SIZE, UNIT, WIDER) \
163 (unsigned char) WIDER,
165 const unsigned char mode_wider_mode[(int) MAX_MACHINE_MODE] = {
166 #include "machmode.def" /* machine modes are documented here */
171 #define DEF_MACHMODE(SYM, NAME, CLASS, SIZE, UNIT, WIDER) \
172 ((SIZE) * BITS_PER_UNIT >= HOST_BITS_PER_WIDE_INT) ? ~(unsigned HOST_WIDE_INT)0 : ((unsigned HOST_WIDE_INT) 1 << (SIZE) * BITS_PER_UNIT) - 1,
174 /* Indexed by machine mode, gives mask of significant bits in mode. */
176 const unsigned HOST_WIDE_INT mode_mask_array[(int) MAX_MACHINE_MODE] = {
177 #include "machmode.def"
180 /* Indexed by mode class, gives the narrowest mode for each class.
181 The Q modes are always of width 1 (2 for complex) - it is impossible
182 for any mode to be narrower. */
184 const enum machine_mode class_narrowest_mode[(int) MAX_MODE_CLASS] = {
185 /* MODE_RANDOM */ VOIDmode,
186 /* MODE_INT */ QImode,
187 /* MODE_FLOAT */ QFmode,
188 /* MODE_PARTIAL_INT */ PQImode,
189 /* MODE_CC */ CCmode,
190 /* MODE_COMPLEX_INT */ CQImode,
191 /* MODE_COMPLEX_FLOAT */ QCmode
195 /* Indexed by rtx code, gives a sequence of operand-types for
196 rtx's of that code. The sequence is a C string in which
197 each character describes one operand. */
199 const char * const rtx_format[] = {
201 can cause a warning message
202 "0" field is unused (or used in a phase-dependent manner)
206 "n" like "i", but prints entries from `note_insn_name'
207 "w" an integer of width HOST_BITS_PER_WIDE_INT
209 "s" a pointer to a string
211 "S" like "s", but optional:
212 the containing rtx may end before this operand
213 "e" a pointer to an rtl expression
214 prints the expression
215 "E" a pointer to a vector that points to a number of rtl expressions
216 prints a list of the rtl expressions
217 "V" like "E", but optional:
218 the containing rtx may end before this operand
219 "u" a pointer to another insn
220 prints the uid of the insn.
221 "b" is a pointer to a bitmap header.
222 "t" is a tree pointer. */
224 #define DEF_RTL_EXPR(ENUM, NAME, FORMAT, CLASS) FORMAT ,
225 #include "rtl.def" /* rtl expressions are defined here */
229 /* Indexed by rtx code, gives a character representing the "class" of
230 that rtx code. See rtl.def for documentation on the defined classes. */
232 const char rtx_class[] = {
233 #define DEF_RTL_EXPR(ENUM, NAME, FORMAT, CLASS) CLASS,
234 #include "rtl.def" /* rtl expressions are defined here */
238 /* Names for kinds of NOTEs and REG_NOTEs. */
240 const char * const note_insn_name[] = { 0 , "NOTE_INSN_DELETED",
241 "NOTE_INSN_BLOCK_BEG", "NOTE_INSN_BLOCK_END",
242 "NOTE_INSN_LOOP_BEG", "NOTE_INSN_LOOP_END",
243 "NOTE_INSN_FUNCTION_END", "NOTE_INSN_SETJMP",
244 "NOTE_INSN_LOOP_CONT", "NOTE_INSN_LOOP_VTOP",
245 "NOTE_INSN_PROLOGUE_END", "NOTE_INSN_EPILOGUE_BEG",
246 "NOTE_INSN_DELETED_LABEL", "NOTE_INSN_FUNCTION_BEG",
247 "NOTE_INSN_EH_REGION_BEG", "NOTE_INSN_EH_REGION_END",
248 "NOTE_REPEATED_LINE_NUMBER", "NOTE_INSN_RANGE_START",
249 "NOTE_INSN_RANGE_END", "NOTE_INSN_LIVE",
250 "NOTE_INSN_BASIC_BLOCK" };
252 const char * const reg_note_name[] = { "", "REG_DEAD", "REG_INC", "REG_EQUIV", "REG_WAS_0",
253 "REG_EQUAL", "REG_RETVAL", "REG_LIBCALL",
254 "REG_NONNEG", "REG_NO_CONFLICT", "REG_UNUSED",
255 "REG_CC_SETTER", "REG_CC_USER", "REG_LABEL",
256 "REG_DEP_ANTI", "REG_DEP_OUTPUT", "REG_BR_PROB",
257 "REG_EXEC_COUNT", "REG_NOALIAS", "REG_SAVE_AREA",
258 "REG_BR_PRED", "REG_EH_CONTEXT",
259 "REG_FRAME_RELATED_EXPR", "REG_EH_REGION",
260 "REG_EH_RETHROW", "REG_SAVE_NOTE" };
262 static void fatal_with_file_and_line PVPROTO((FILE *, const char *, ...))
264 static void fatal_expected_char PROTO((FILE *, int, int)) ATTRIBUTE_NORETURN;
265 static void read_name PROTO((char *, FILE *));
266 static const char *trim_filename PROTO((const char *));
268 /* Allocate an rtx vector of N elements.
269 Store the length, and initialize all elements to zero. */
278 rt = ggc_alloc_rtvec (n);
283 rt = (rtvec) obstack_alloc (rtl_obstack,
284 sizeof (struct rtvec_def)
285 + (( n - 1) * sizeof (rtx)));
287 /* clear out the vector */
288 for (i = 0; i < n; i++)
292 PUT_NUM_ELEM (rt, n);
296 /* Allocate an rtx of code CODE. The CODE is stored in the rtx;
297 all the rest is initialized to zero. */
306 rt = ggc_alloc_rtx (GET_RTX_LENGTH (code));
309 register struct obstack *ob = rtl_obstack;
310 register int nelts = GET_RTX_LENGTH (code);
311 register int length = sizeof (struct rtx_def)
312 + (nelts - 1) * sizeof (rtunion);
314 /* This function is called more than any other in GCC, so we
315 manipulate the obstack directly.
317 Even though rtx objects are word aligned, we may be sharing
318 an obstack with tree nodes, which may have to be double-word
319 aligned. So align our length to the alignment mask in the
322 length = (length + ob->alignment_mask) & ~ ob->alignment_mask;
324 if (ob->chunk_limit - ob->next_free < length)
325 _obstack_newchunk (ob, length);
326 rt = (rtx)ob->object_base;
327 ob->next_free += length;
328 ob->object_base = ob->next_free;
330 /* We want to clear everything up to the FLD array. Normally,
331 this is one int, but we don't want to assume that and it
332 isn't very portable anyway; this is. */
334 memset (rt, 0, sizeof (struct rtx_def) - sizeof (rtunion));
341 /* Free the rtx X and all RTL allocated since X. */
348 obstack_free (rtl_obstack, x);
351 /* Create a new copy of an rtx.
352 Recursively copies the operands of the rtx,
353 except for those few rtx codes that are sharable. */
361 register RTX_CODE code;
362 register const char *format_ptr;
364 code = GET_CODE (orig);
377 /* SCRATCH must be shared because they represent distinct values. */
382 /* CONST can be shared if it contains a SYMBOL_REF. If it contains
383 a LABEL_REF, it isn't sharable. */
384 if (GET_CODE (XEXP (orig, 0)) == PLUS
385 && GET_CODE (XEXP (XEXP (orig, 0), 0)) == SYMBOL_REF
386 && GET_CODE (XEXP (XEXP (orig, 0), 1)) == CONST_INT)
390 /* A MEM with a constant address is not sharable. The problem is that
391 the constant address may need to be reloaded. If the mem is shared,
392 then reloading one copy of this mem will cause all copies to appear
393 to have been reloaded. */
399 copy = rtx_alloc (code);
401 /* Copy the various flags, and other information. We assume that
402 all fields need copying, and then clear the fields that should
403 not be copied. That is the sensible default behavior, and forces
404 us to explicitly document why we are *not* copying a flag. */
405 memcpy (copy, orig, sizeof (struct rtx_def) - sizeof (rtunion));
407 /* We do not copy the USED flag, which is used as a mark bit during
408 walks over the RTL. */
411 /* We do not copy JUMP, CALL, or FRAME_RELATED for INSNs. */
412 if (GET_RTX_CLASS (code) == 'i')
416 copy->frame_related = 0;
419 format_ptr = GET_RTX_FORMAT (GET_CODE (copy));
421 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (copy)); i++)
423 copy->fld[i] = orig->fld[i];
424 switch (*format_ptr++)
427 if (XEXP (orig, i) != NULL)
428 XEXP (copy, i) = copy_rtx (XEXP (orig, i));
433 if (XVEC (orig, i) != NULL)
435 XVEC (copy, i) = rtvec_alloc (XVECLEN (orig, i));
436 for (j = 0; j < XVECLEN (copy, i); j++)
437 XVECEXP (copy, i, j) = copy_rtx (XVECEXP (orig, i, j));
443 bitmap new_bits = BITMAP_OBSTACK_ALLOC (rtl_obstack);
444 bitmap_copy (new_bits, XBITMAP (orig, i));
445 XBITMAP (copy, i) = new_bits;
456 /* These are left unchanged. */
466 /* Similar to `copy_rtx' except that if MAY_SHARE is present, it is
467 placed in the result directly, rather than being copied. */
470 copy_most_rtx (orig, may_share)
472 register rtx may_share;
476 register RTX_CODE code;
477 register const char *format_ptr;
479 if (orig == may_share)
482 code = GET_CODE (orig);
499 copy = rtx_alloc (code);
500 PUT_MODE (copy, GET_MODE (orig));
501 copy->in_struct = orig->in_struct;
502 copy->volatil = orig->volatil;
503 copy->unchanging = orig->unchanging;
504 copy->integrated = orig->integrated;
506 format_ptr = GET_RTX_FORMAT (GET_CODE (copy));
508 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (copy)); i++)
510 switch (*format_ptr++)
513 XEXP (copy, i) = XEXP (orig, i);
514 if (XEXP (orig, i) != NULL && XEXP (orig, i) != may_share)
515 XEXP (copy, i) = copy_most_rtx (XEXP (orig, i), may_share);
519 XEXP (copy, i) = XEXP (orig, i);
524 XVEC (copy, i) = XVEC (orig, i);
525 if (XVEC (orig, i) != NULL)
527 XVEC (copy, i) = rtvec_alloc (XVECLEN (orig, i));
528 for (j = 0; j < XVECLEN (copy, i); j++)
530 = copy_most_rtx (XVECEXP (orig, i, j), may_share);
535 XWINT (copy, i) = XWINT (orig, i);
540 XINT (copy, i) = XINT (orig, i);
544 XTREE (copy, i) = XTREE (orig, i);
549 XSTR (copy, i) = XSTR (orig, i);
553 /* Copy this through the wide int field; that's safest. */
554 X0WINT (copy, i) = X0WINT (orig, i);
564 /* Create a new copy of an rtx. Only copy just one level. */
566 shallow_copy_rtx (orig)
570 register RTX_CODE code = GET_CODE (orig);
571 register rtx copy = rtx_alloc (code);
573 PUT_MODE (copy, GET_MODE (orig));
574 copy->in_struct = orig->in_struct;
575 copy->volatil = orig->volatil;
576 copy->unchanging = orig->unchanging;
577 copy->integrated = orig->integrated;
579 for (i = 0; i < GET_RTX_LENGTH (code); i++)
580 copy->fld[i] = orig->fld[i];
585 /* This is 1 until after the rtl generation pass. */
586 int rtx_equal_function_value_matters;
588 /* Return 1 if X and Y are identical-looking rtx's.
589 This is the Lisp function EQUAL for rtx arguments. */
597 register enum rtx_code code;
598 register const char *fmt;
602 if (x == 0 || y == 0)
606 /* Rtx's of different codes cannot be equal. */
607 if (code != GET_CODE (y))
610 /* (MULT:SI x y) and (MULT:HI x y) are NOT equivalent.
611 (REG:SI x) and (REG:HI x) are NOT equivalent. */
613 if (GET_MODE (x) != GET_MODE (y))
616 /* REG, LABEL_REF, and SYMBOL_REF can be compared nonrecursively. */
619 /* Until rtl generation is complete, don't consider a reference to the
620 return register of the current function the same as the return from a
621 called function. This eases the job of function integration. Once the
622 distinction is no longer needed, they can be considered equivalent. */
623 return (REGNO (x) == REGNO (y)
624 && (! rtx_equal_function_value_matters
625 || REG_FUNCTION_VALUE_P (x) == REG_FUNCTION_VALUE_P (y)));
626 else if (code == LABEL_REF)
627 return XEXP (x, 0) == XEXP (y, 0);
628 else if (code == SYMBOL_REF)
629 return XSTR (x, 0) == XSTR (y, 0);
630 else if (code == SCRATCH || code == CONST_DOUBLE)
633 /* Compare the elements. If any pair of corresponding elements
634 fail to match, return 0 for the whole things. */
636 fmt = GET_RTX_FORMAT (code);
637 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
642 if (XWINT (x, i) != XWINT (y, i))
648 if (XINT (x, i) != XINT (y, i))
654 /* Two vectors must have the same length. */
655 if (XVECLEN (x, i) != XVECLEN (y, i))
658 /* And the corresponding elements must match. */
659 for (j = 0; j < XVECLEN (x, i); j++)
660 if (rtx_equal_p (XVECEXP (x, i, j), XVECEXP (y, i, j)) == 0)
665 if (rtx_equal_p (XEXP (x, i), XEXP (y, i)) == 0)
671 if (strcmp (XSTR (x, i), XSTR (y, i)))
676 /* These are just backpointers, so they don't matter. */
683 /* It is believed that rtx's at this level will never
684 contain anything but integers and other rtx's,
685 except for within LABEL_REFs and SYMBOL_REFs. */
693 /* Subroutines of read_rtx. */
695 /* The current line number for the file. */
696 int read_rtx_lineno = 1;
698 /* The filename for aborting with file and line. */
699 const char *read_rtx_filename = "<unknown>";
702 fatal_with_file_and_line VPROTO((FILE *infile, const char *msg, ...))
704 #ifndef ANSI_PROTOTYPES
715 #ifndef ANSI_PROTOTYPES
716 infile = va_arg (ap, FILE *);
717 msg = va_arg (ap, const char *);
720 fprintf (stderr, "%s:%d: ", read_rtx_filename, read_rtx_lineno);
721 vfprintf (stderr, msg, ap);
724 /* Gather some following context. */
725 for (i = 0; i < sizeof(context)-1; ++i)
730 if (c == '\r' || c == '\n')
736 fprintf (stderr, "%s:%d: following context is `%s'\n",
737 read_rtx_filename, read_rtx_lineno, context);
743 /* Dump code after printing a message. Used when read_rtx finds
747 fatal_expected_char (infile, expected_c, actual_c)
749 int expected_c, actual_c;
751 fatal_with_file_and_line (infile, "expected character `%c', found `%c'",
752 expected_c, actual_c);
755 /* Read chars from INFILE until a non-whitespace char
756 and return that. Comments, both Lisp style and C style,
757 are treated as whitespace.
758 Tools such as genflags use this function. */
761 read_skip_spaces (infile)
774 case ' ': case '\t': case '\f': case '\r':
780 while (c != '\n' && c != EOF);
789 fatal_expected_char (infile, '*', c);
792 while ((c = getc (infile)) && c != EOF)
796 else if (prevc == '*' && c == '/')
809 /* Read an rtx code name into the buffer STR[].
810 It is terminated by any of the punctuation chars of rtx printed syntax. */
813 read_name (str, infile)
820 c = read_skip_spaces(infile);
825 if (c == ' ' || c == '\n' || c == '\t' || c == '\f')
827 if (c == ':' || c == ')' || c == ']' || c == '"' || c == '/'
828 || c == '(' || c == '[')
837 fatal_with_file_and_line (infile, "missing name or number");
844 /* Provide a version of a function to read a long long if the system does
846 #if HOST_BITS_PER_WIDE_INT > HOST_BITS_PER_LONG && !defined(HAVE_ATOLL) && !defined(HAVE_ATOQ)
852 HOST_WIDE_INT tmp_wide;
864 HOST_WIDE_INT new_wide = tmp_wide*10 + (*p - '0');
865 if (new_wide < tmp_wide)
867 /* Return INT_MAX equiv on overflow. */
868 tmp_wide = (~(unsigned HOST_WIDE_INT)0) >> 1;
876 tmp_wide = -tmp_wide;
881 /* Read an rtx in printed representation from INFILE
882 and return an actual rtx in core constructed accordingly.
883 read_rtx is not used in the compiler proper, but rather in
884 the utilities gen*.c that construct C code from machine descriptions. */
890 register int i, j, list_counter;
892 register const char *format_ptr;
893 /* tmp_char is a buffer used for reading decimal integers
894 and names of rtx types and machine modes.
895 Therefore, 256 must be enough. */
900 HOST_WIDE_INT tmp_wide;
902 /* Linked list structure for making RTXs: */
905 struct rtx_list *next;
906 rtx value; /* Value of this node. */
909 c = read_skip_spaces (infile); /* Should be open paren. */
911 fatal_expected_char (infile, '(', c);
913 read_name (tmp_char, infile);
917 for (i = 0; i < NUM_RTX_CODE; i++)
918 if (! strcmp (tmp_char, GET_RTX_NAME (i)))
920 tmp_code = (RTX_CODE) i; /* get value for name */
924 if (tmp_code == UNKNOWN)
925 fatal ("Unknown rtx read in rtl.read_rtx(). Code name was %s .", tmp_char);
927 /* (NIL) stands for an expression that isn't there. */
930 /* Discard the closeparen. */
931 while ((c = getc (infile)) && c != ')')
937 /* If we end up with an insn expression then we free this space below. */
938 return_rtx = rtx_alloc (tmp_code);
939 format_ptr = GET_RTX_FORMAT (GET_CODE (return_rtx));
941 /* If what follows is `: mode ', read it and
942 store the mode in the rtx. */
944 i = read_skip_spaces (infile);
947 read_name (tmp_char, infile);
948 for (j = 0; j < NUM_MACHINE_MODES; j++)
949 if (! strcmp (GET_MODE_NAME (j), tmp_char))
952 if (j == MAX_MACHINE_MODE)
953 fatal ("Unknown mode read in rtl.read_rtx(). Mode name was %s.",
956 PUT_MODE (return_rtx, (enum machine_mode) j);
961 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (return_rtx)); i++)
962 switch (*format_ptr++)
964 /* 0 means a field for internal use only.
965 Don't expect it to be present in the input. */
971 XEXP (return_rtx, i) = read_rtx (infile);
975 /* 'V' is an optional vector: if a closeparen follows,
976 just store NULL for this element. */
977 c = read_skip_spaces (infile);
981 XVEC (return_rtx, i) = 0;
984 /* Now process the vector. */
988 register struct rtx_list *next_rtx, *rtx_list_link;
989 struct rtx_list *list_rtx = NULL;
991 c = read_skip_spaces (infile);
993 fatal_expected_char (infile, '[', c);
995 /* add expressions to a list, while keeping a count */
998 while ((c = read_skip_spaces (infile)) && c != ']')
1002 rtx_list_link = (struct rtx_list *)
1003 alloca (sizeof (struct rtx_list));
1004 rtx_list_link->value = read_rtx (infile);
1006 list_rtx = rtx_list_link;
1008 next_rtx->next = rtx_list_link;
1009 next_rtx = rtx_list_link;
1010 rtx_list_link->next = 0;
1012 /* get vector length and allocate it */
1013 XVEC (return_rtx, i) = (list_counter
1014 ? rtvec_alloc (list_counter) : NULL_RTVEC);
1015 if (list_counter > 0)
1017 next_rtx = list_rtx;
1018 for (j = 0; j < list_counter; j++,
1019 next_rtx = next_rtx->next)
1020 XVECEXP (return_rtx, i, j) = next_rtx->value;
1022 /* close bracket gotten */
1027 /* 'S' is an optional string: if a closeparen follows,
1028 just store NULL for this element. */
1029 c = read_skip_spaces (infile);
1033 XSTR (return_rtx, i) = 0;
1040 register char *stringbuf;
1042 c = read_skip_spaces (infile);
1046 c = read_skip_spaces (infile);
1049 fatal_expected_char (infile, '"', c);
1053 c = getc (infile); /* Read the string */
1058 c = getc (infile); /* Read the string */
1059 /* \; makes stuff for a C string constant containing
1063 obstack_grow (rtl_obstack, "\\n\\t", 4);
1072 obstack_1grow (rtl_obstack, c);
1075 obstack_1grow (rtl_obstack, 0);
1076 stringbuf = (char *) obstack_finish (rtl_obstack);
1080 c = read_skip_spaces (infile);
1082 fatal_expected_char (infile, ')', c);
1084 XSTR (return_rtx, i) = stringbuf;
1089 read_name (tmp_char, infile);
1090 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_INT
1091 tmp_wide = atoi (tmp_char);
1093 #if HOST_BITS_PER_WIDE_INT == HOST_BITS_PER_LONG
1094 tmp_wide = atol (tmp_char);
1096 /* Prefer atoll over atoq, since the former is in the ISO C9X draft.
1097 But prefer not to use our hand-rolled function above either. */
1098 #if defined(HAVE_ATOLL) || !defined(HAVE_ATOQ)
1099 tmp_wide = atoll (tmp_char);
1101 tmp_wide = atoq (tmp_char);
1105 XWINT (return_rtx, i) = tmp_wide;
1110 read_name (tmp_char, infile);
1111 tmp_int = atoi (tmp_char);
1112 XINT (return_rtx, i) = tmp_int;
1117 "switch format wrong in rtl.read_rtx(). format was: %c.\n",
1119 fprintf (stderr, "\tfile position: %ld\n", ftell (infile));
1123 c = read_skip_spaces (infile);
1125 fatal_expected_char (infile, ')', c);
1130 #if defined ENABLE_CHECKING && HAVE_GCC_VERSION(2,7)
1132 rtl_check_failed_bounds (r, n, file, line, func)
1139 error ("RTL check: access of elt %d of `%s' with last elt %d",
1140 n, GET_RTX_NAME (GET_CODE (r)), GET_RTX_LENGTH (GET_CODE (r))-1);
1141 fancy_abort (file, line, func);
1145 rtl_check_failed_type1 (r, n, c1, file, line, func)
1153 error ("RTL check: expected elt %d type '%c', have '%c' (rtx %s)",
1154 n, c1, GET_RTX_FORMAT (GET_CODE (r))[n], GET_RTX_NAME (GET_CODE (r)));
1155 fancy_abort (file, line, func);
1159 rtl_check_failed_type2 (r, n, c1, c2, file, line, func)
1168 error ("RTL check: expected elt %d type '%c' or '%c', have '%c' (rtx %s)",
1170 GET_RTX_FORMAT (GET_CODE (r))[n], GET_RTX_NAME (GET_CODE(r)));
1171 fancy_abort (file, line, func);
1175 rtl_check_failed_code1 (r, code, file, line, func)
1182 error ("RTL check: expected code `%s', have `%s'",
1183 GET_RTX_NAME (code), GET_RTX_NAME (GET_CODE (r)));
1184 fancy_abort (file, line, func);
1188 rtl_check_failed_code2 (r, code1, code2, file, line, func)
1190 enum rtx_code code1, code2;
1195 error ("RTL check: expected code `%s' or `%s', have `%s'",
1196 GET_RTX_NAME (code1), GET_RTX_NAME (code2),
1197 GET_RTX_NAME (GET_CODE (r)));
1198 fancy_abort (file, line, func);
1201 /* XXX Maybe print the vector? */
1203 rtvec_check_failed_bounds (r, n, file, line, func)
1210 error ("RTL check: access of elt %d of vector with last elt %d",
1211 n, GET_NUM_ELEM (r)-1);
1212 fancy_abort (file, line, func);
1214 #endif /* ENABLE_CHECKING */
1216 /* These are utility functions used by fatal-error functions all over the
1217 code. rtl.c happens to be linked by all the programs that need them,
1218 so these are here. In the future we want to break out all error handling
1219 to its own module. */
1221 /* Given a partial pathname as input, return another pathname that
1222 shares no directory elements with the pathname of __FILE__. This
1223 is used by fancy_abort() to print `Internal compiler error in expr.c'
1224 instead of `Internal compiler error in ../../egcs/gcc/expr.c'. */
1226 trim_filename (name)
1229 static const char this_file[] = __FILE__;
1230 const char *p = name, *q = this_file;
1232 while (*p == *q && *p != 0 && *q != 0) p++, q++;
1233 while (p > name && p[-1] != DIR_SEPARATOR
1234 #ifdef DIR_SEPARATOR_2
1235 && p[-1] != DIR_SEPARATOR_2
1243 /* Report an internal compiler error in a friendly manner and without
1246 extern void fatal PVPROTO ((const char *, ...))
1247 ATTRIBUTE_PRINTF_1 ATTRIBUTE_NORETURN;
1250 fancy_abort (file, line, function)
1253 const char *function;
1255 if (function == NULL)
1258 "Internal compiler error in `%s', at %s:%d\n\
1259 Please submit a full bug report.\n\
1260 See <URL:http://www.gnu.org/software/gcc/faq.html#bugreport> \
1262 function, trim_filename (file), line);