1 /* Generate code from to output assembler insns as recognized from rtl.
2 Copyright (C) 1987, 1988, 1992, 1994, 1995, 1997, 1998, 1999, 2000, 2002,
3 2003, 2004, 2005, 2007 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 3, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
22 /* This program reads the machine description for the compiler target machine
23 and produces a file containing these things:
25 1. An array of `struct insn_data', which is indexed by insn code number,
28 a. `name' is the name for that pattern. Nameless patterns are
31 b. `output' hold either the output template, an array of output
32 templates, or an output function.
34 c. `genfun' is the function to generate a body for that pattern,
35 given operands as arguments.
37 d. `n_operands' is the number of distinct operands in the pattern
40 e. `n_dups' is the number of match_dup's that appear in the insn's
41 pattern. This says how many elements of `recog_data.dup_loc' are
42 significant after an insn has been recognized.
44 f. `n_alternatives' is the number of alternatives in the constraints
47 g. `output_format' tells what type of thing `output' is.
49 h. `operand' is the base of an array of operand data for the insn.
51 2. An array of `struct insn_operand data', used by `operand' above.
53 a. `predicate', an int-valued function, is the match_operand predicate
56 b. `constraint' is the constraint for this operand.
58 c. `address_p' indicates that the operand appears within ADDRESS
61 d. `mode' is the machine mode that that operand is supposed to have.
63 e. `strict_low', is nonzero for operands contained in a STRICT_LOW_PART.
65 f. `eliminable', is nonzero for operands that are matched normally by
66 MATCH_OPERAND; it is zero for operands that should not be changed during
67 register elimination such as MATCH_OPERATORs.
69 The code number of an insn is simply its position in the machine
70 description; code numbers are assigned sequentially to entries in
71 the description, starting with code number 0.
73 Thus, the following entry in the machine description
76 [(set (match_operand:DF 0 "general_operand" "")
81 assuming it is the 25th entry present, would cause
82 insn_data[24].template to be "clrd %0", and
83 insn_data[24].n_operands to be 1. */
87 #include "coretypes.h"
91 #include "gensupport.h"
93 /* No instruction can have more operands than this. Sorry for this
94 arbitrary limit, but what machine will have an instruction with
95 this many operands? */
97 #define MAX_MAX_OPERANDS 40
99 static int n_occurrences (int, const char *);
100 static const char *strip_whitespace (const char *);
102 /* insns in the machine description are assigned sequential code numbers
103 that are used by insn-recog.c (produced by genrecog) to communicate
104 to insn-output.c (produced by this program). */
106 static int next_code_number
;
108 /* This counts all definitions in the md file,
109 for the sake of error messages. */
111 static int next_index_number
;
113 /* This counts all operands used in the md file. The first is null. */
115 static int next_operand_number
= 1;
117 /* Record in this chain all information about the operands we will output. */
121 struct operand_data
*next
;
123 const char *predicate
;
124 const char *constraint
;
125 enum machine_mode mode
;
126 unsigned char n_alternatives
;
133 /* Begin with a null operand at index 0. */
135 static struct operand_data null_operand
=
137 0, 0, "", "", VOIDmode
, 0, 0, 0, 0, 0
140 static struct operand_data
*odata
= &null_operand
;
141 static struct operand_data
**odata_end
= &null_operand
.next
;
143 /* Must match the constants in recog.h. */
145 #define INSN_OUTPUT_FORMAT_NONE 0 /* abort */
146 #define INSN_OUTPUT_FORMAT_SINGLE 1 /* const char * */
147 #define INSN_OUTPUT_FORMAT_MULTI 2 /* const char * const * */
148 #define INSN_OUTPUT_FORMAT_FUNCTION 3 /* const char * (*)(...) */
150 /* Record in this chain all information that we will output,
151 associated with the code number of the insn. */
157 const char *template;
160 const char *filename
;
162 int n_operands
; /* Number of operands this insn recognizes */
163 int n_dups
; /* Number times match_dup appears in pattern */
164 int n_alternatives
; /* Number of alternatives in each constraint */
165 int operand_number
; /* Operand index in the big array. */
166 int output_format
; /* INSN_OUTPUT_FORMAT_*. */
167 struct operand_data operand
[MAX_MAX_OPERANDS
];
170 /* This variable points to the first link in the insn chain. */
172 static struct data
*idata
, **idata_end
= &idata
;
174 static void output_prologue (void);
175 static void output_operand_data (void);
176 static void output_insn_data (void);
177 static void output_get_insn_name (void);
178 static void scan_operands (struct data
*, rtx
, int, int);
179 static int compare_operands (struct operand_data
*,
180 struct operand_data
*);
181 static void place_operands (struct data
*);
182 static void process_template (struct data
*, const char *);
183 static void validate_insn_alternatives (struct data
*);
184 static void validate_insn_operands (struct data
*);
185 static void gen_insn (rtx
, int);
186 static void gen_peephole (rtx
, int);
187 static void gen_expand (rtx
, int);
188 static void gen_split (rtx
, int);
190 #ifdef USE_MD_CONSTRAINTS
192 struct constraint_data
194 struct constraint_data
*next_this_letter
;
196 unsigned int namelen
;
200 /* This is a complete list (unlike the one in genpreds.c) of constraint
201 letters and modifiers with machine-independent meaning. The only
202 omission is digits, as these are handled specially. */
203 static const char indep_constraints
[] = ",=+%*?!#&<>EFVXgimnoprs";
205 static struct constraint_data
*
206 constraints_by_letter_table
[1 << CHAR_BIT
];
208 static int mdep_constraint_len (const char *, int, int);
209 static void note_constraint (rtx
, int);
211 #else /* !USE_MD_CONSTRAINTS */
213 static void check_constraint_len (void);
214 static int constraint_len (const char *, int);
216 #endif /* !USE_MD_CONSTRAINTS */
220 output_prologue (void)
222 printf ("/* Generated automatically by the program `genoutput'\n\
223 from the machine description file `md'. */\n\n");
225 printf ("#include \"config.h\"\n");
226 printf ("#include \"system.h\"\n");
227 printf ("#include \"coretypes.h\"\n");
228 printf ("#include \"tm.h\"\n");
229 printf ("#include \"flags.h\"\n");
230 printf ("#include \"ggc.h\"\n");
231 printf ("#include \"rtl.h\"\n");
232 printf ("#include \"expr.h\"\n");
233 printf ("#include \"insn-codes.h\"\n");
234 printf ("#include \"tm_p.h\"\n");
235 printf ("#include \"function.h\"\n");
236 printf ("#include \"regs.h\"\n");
237 printf ("#include \"hard-reg-set.h\"\n");
238 printf ("#include \"real.h\"\n");
239 printf ("#include \"insn-config.h\"\n\n");
240 printf ("#include \"conditions.h\"\n");
241 printf ("#include \"insn-attr.h\"\n\n");
242 printf ("#include \"recog.h\"\n\n");
243 printf ("#include \"toplev.h\"\n");
244 printf ("#include \"output.h\"\n");
245 printf ("#include \"target.h\"\n");
246 printf ("#include \"tm-constrs.h\"\n");
250 output_operand_data (void)
252 struct operand_data
*d
;
254 printf ("\nstatic const struct insn_operand_data operand_data[] = \n{\n");
256 for (d
= odata
; d
; d
= d
->next
)
261 d
->predicate
&& d
->predicate
[0] ? d
->predicate
: "0");
263 printf (" \"%s\",\n", d
->constraint
? d
->constraint
: "");
265 printf (" %smode,\n", GET_MODE_NAME (d
->mode
));
267 printf (" %d,\n", d
->strict_low
);
269 printf (" %d\n", d
->eliminable
);
277 output_insn_data (void)
281 int next_name_offset
;
282 const char * last_name
= 0;
283 const char * next_name
= 0;
286 for (n
= idata
, next_name_offset
= 1; n
; n
= n
->next
, next_name_offset
++)
293 printf ("#if GCC_VERSION >= 2007\n__extension__\n#endif\n");
294 printf ("\nconst struct insn_data insn_data[] = \n{\n");
296 for (d
= idata
; d
; d
= d
->next
)
298 printf (" /* %s:%d */\n", d
->filename
, d
->lineno
);
303 printf (" \"%s\",\n", d
->name
);
307 for (n
= d
->next
, next_name_offset
= 1; n
;
308 n
= n
->next
, next_name_offset
++)
320 if (next_name
&& (last_name
== 0
321 || name_offset
> next_name_offset
/ 2))
322 printf (" \"%s-%d\",\n", next_name
,
323 next_name_offset
- name_offset
);
325 printf (" \"%s+%d\",\n", last_name
, name_offset
);
328 switch (d
->output_format
)
330 case INSN_OUTPUT_FORMAT_NONE
:
331 printf ("#if HAVE_DESIGNATED_INITIALIZERS\n");
332 printf (" { 0 },\n");
334 printf (" { 0, 0, 0 },\n");
337 case INSN_OUTPUT_FORMAT_SINGLE
:
339 const char *p
= d
->template;
342 printf ("#if HAVE_DESIGNATED_INITIALIZERS\n");
343 printf (" { .single =\n");
350 if (IS_VSPACE (*p
) && prev
!= '\\')
352 /* Preserve two consecutive \n's or \r's, but treat \r\n
353 as a single newline. */
354 if (*p
== '\n' && prev
!= '\r')
363 printf ("#if HAVE_DESIGNATED_INITIALIZERS\n");
366 printf (" 0, 0 },\n");
370 case INSN_OUTPUT_FORMAT_MULTI
:
371 printf ("#if HAVE_DESIGNATED_INITIALIZERS\n");
372 printf (" { .multi = output_%d },\n", d
->code_number
);
374 printf (" { 0, output_%d, 0 },\n", d
->code_number
);
377 case INSN_OUTPUT_FORMAT_FUNCTION
:
378 printf ("#if HAVE_DESIGNATED_INITIALIZERS\n");
379 printf (" { .function = output_%d },\n", d
->code_number
);
381 printf (" { 0, 0, output_%d },\n", d
->code_number
);
388 if (d
->name
&& d
->name
[0] != '*')
389 printf (" (insn_gen_fn) gen_%s,\n", d
->name
);
393 printf (" &operand_data[%d],\n", d
->operand_number
);
394 printf (" %d,\n", d
->n_operands
);
395 printf (" %d,\n", d
->n_dups
);
396 printf (" %d,\n", d
->n_alternatives
);
397 printf (" %d\n", d
->output_format
);
405 output_get_insn_name (void)
407 printf ("const char *\n");
408 printf ("get_insn_name (int code)\n");
410 printf (" if (code == NOOP_MOVE_INSN_CODE)\n");
411 printf (" return \"NOOP_MOVE\";\n");
413 printf (" return insn_data[code].name;\n");
418 /* Stores in max_opno the largest operand number present in `part', if
419 that is larger than the previous value of max_opno, and the rest of
420 the operand data into `d->operand[i]'.
422 THIS_ADDRESS_P is nonzero if the containing rtx was an ADDRESS.
423 THIS_STRICT_LOW is nonzero if the containing rtx was a STRICT_LOW_PART. */
429 scan_operands (struct data
*d
, rtx part
, int this_address_p
,
433 const char *format_ptr
;
439 switch (GET_CODE (part
))
442 opno
= XINT (part
, 0);
445 if (max_opno
>= MAX_MAX_OPERANDS
)
447 message_with_line (d
->lineno
,
448 "maximum number of operands exceeded");
452 if (d
->operand
[opno
].seen
)
454 message_with_line (d
->lineno
,
455 "repeated operand number %d\n", opno
);
459 d
->operand
[opno
].seen
= 1;
460 d
->operand
[opno
].mode
= GET_MODE (part
);
461 d
->operand
[opno
].strict_low
= this_strict_low
;
462 d
->operand
[opno
].predicate
= XSTR (part
, 1);
463 d
->operand
[opno
].constraint
= strip_whitespace (XSTR (part
, 2));
464 d
->operand
[opno
].n_alternatives
465 = n_occurrences (',', d
->operand
[opno
].constraint
) + 1;
466 d
->operand
[opno
].address_p
= this_address_p
;
467 d
->operand
[opno
].eliminable
= 1;
471 opno
= XINT (part
, 0);
474 if (max_opno
>= MAX_MAX_OPERANDS
)
476 message_with_line (d
->lineno
,
477 "maximum number of operands exceeded");
481 if (d
->operand
[opno
].seen
)
483 message_with_line (d
->lineno
,
484 "repeated operand number %d\n", opno
);
488 d
->operand
[opno
].seen
= 1;
489 d
->operand
[opno
].mode
= GET_MODE (part
);
490 d
->operand
[opno
].strict_low
= 0;
491 d
->operand
[opno
].predicate
= "scratch_operand";
492 d
->operand
[opno
].constraint
= strip_whitespace (XSTR (part
, 1));
493 d
->operand
[opno
].n_alternatives
494 = n_occurrences (',', d
->operand
[opno
].constraint
) + 1;
495 d
->operand
[opno
].address_p
= 0;
496 d
->operand
[opno
].eliminable
= 0;
501 opno
= XINT (part
, 0);
504 if (max_opno
>= MAX_MAX_OPERANDS
)
506 message_with_line (d
->lineno
,
507 "maximum number of operands exceeded");
511 if (d
->operand
[opno
].seen
)
513 message_with_line (d
->lineno
,
514 "repeated operand number %d\n", opno
);
518 d
->operand
[opno
].seen
= 1;
519 d
->operand
[opno
].mode
= GET_MODE (part
);
520 d
->operand
[opno
].strict_low
= 0;
521 d
->operand
[opno
].predicate
= XSTR (part
, 1);
522 d
->operand
[opno
].constraint
= 0;
523 d
->operand
[opno
].address_p
= 0;
524 d
->operand
[opno
].eliminable
= 0;
525 for (i
= 0; i
< XVECLEN (part
, 2); i
++)
526 scan_operands (d
, XVECEXP (part
, 2, i
), 0, 0);
536 scan_operands (d
, XEXP (part
, 0), 1, 0);
539 case STRICT_LOW_PART
:
540 scan_operands (d
, XEXP (part
, 0), 0, 1);
547 format_ptr
= GET_RTX_FORMAT (GET_CODE (part
));
549 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (part
)); i
++)
550 switch (*format_ptr
++)
554 scan_operands (d
, XEXP (part
, i
), 0, 0);
557 if (XVEC (part
, i
) != NULL
)
558 for (j
= 0; j
< XVECLEN (part
, i
); j
++)
559 scan_operands (d
, XVECEXP (part
, i
, j
), 0, 0);
564 /* Compare two operands for content equality. */
567 compare_operands (struct operand_data
*d0
, struct operand_data
*d1
)
577 if (strcmp (p0
, p1
) != 0)
586 if (strcmp (p0
, p1
) != 0)
589 if (d0
->mode
!= d1
->mode
)
592 if (d0
->strict_low
!= d1
->strict_low
)
595 if (d0
->eliminable
!= d1
->eliminable
)
601 /* Scan the list of operands we've already committed to output and either
602 find a subsequence that is the same, or allocate a new one at the end. */
605 place_operands (struct data
*d
)
607 struct operand_data
*od
, *od2
;
610 if (d
->n_operands
== 0)
612 d
->operand_number
= 0;
616 /* Brute force substring search. */
617 for (od
= odata
, i
= 0; od
; od
= od
->next
, i
= 0)
618 if (compare_operands (od
, &d
->operand
[0]))
624 if (i
== d
->n_operands
)
628 if (! compare_operands (od2
, &d
->operand
[i
]))
630 ++i
, od2
= od2
->next
;
634 /* Either partial match at the end of the list, or no match. In either
635 case, we tack on what operands are remaining to the end of the list. */
637 d
->operand_number
= next_operand_number
- i
;
638 for (; i
< d
->n_operands
; ++i
)
640 od2
= &d
->operand
[i
];
642 odata_end
= &od2
->next
;
643 od2
->index
= next_operand_number
++;
649 d
->operand_number
= od
->index
;
654 /* Process an assembler template from a define_insn or a define_peephole.
655 It is either the assembler code template, a list of assembler code
656 templates, or C code to generate the assembler code template. */
659 process_template (struct data
*d
, const char *template)
664 /* Templates starting with * contain straight code to be run. */
665 if (template[0] == '*')
668 d
->output_format
= INSN_OUTPUT_FORMAT_FUNCTION
;
670 puts ("\nstatic const char *");
671 printf ("output_%d (rtx *operands ATTRIBUTE_UNUSED, rtx insn ATTRIBUTE_UNUSED)\n",
674 print_rtx_ptr_loc (template);
679 /* If the assembler code template starts with a @ it is a newline-separated
680 list of assembler code templates, one for each alternative. */
681 else if (template[0] == '@')
684 d
->output_format
= INSN_OUTPUT_FORMAT_MULTI
;
686 printf ("\nstatic const char * const output_%d[] = {\n", d
->code_number
);
688 for (i
= 0, cp
= &template[1]; *cp
; )
692 while (ISSPACE (*cp
))
697 for (ep
= sp
= cp
; !IS_VSPACE (*ep
) && *ep
!= '\0'; ++ep
)
702 message_with_line (d
->lineno
,
703 "trailing whitespace in output template");
715 message_with_line (d
->lineno
,
716 "'@' is redundant for output template with single alternative");
717 if (i
!= d
->n_alternatives
)
719 message_with_line (d
->lineno
,
720 "wrong number of alternatives in the output template");
728 d
->template = template;
729 d
->output_format
= INSN_OUTPUT_FORMAT_SINGLE
;
733 /* Check insn D for consistency in number of constraint alternatives. */
736 validate_insn_alternatives (struct data
*d
)
740 /* Make sure all the operands have the same number of alternatives
741 in their constraints. Let N be that number. */
742 for (start
= 0; start
< d
->n_operands
; start
++)
743 if (d
->operand
[start
].n_alternatives
> 0)
748 int which_alternative
= 0;
749 int alternative_count_unsure
= 0;
751 for (p
= d
->operand
[start
].constraint
; (c
= *p
); p
+= len
)
753 #ifdef USE_MD_CONSTRAINTS
754 if (ISSPACE (c
) || strchr (indep_constraints
, c
))
756 else if (ISDIGIT (c
))
761 while (ISDIGIT (*q
));
765 len
= mdep_constraint_len (p
, d
->lineno
, start
);
767 len
= CONSTRAINT_LEN (c
, p
);
769 if (len
< 1 || (len
> 1 && strchr (",#*+=&%!0123456789", c
)))
771 message_with_line (d
->lineno
,
772 "invalid length %d for char '%c' in alternative %d of operand %d",
773 len
, c
, which_alternative
, start
);
785 for (i
= 1; i
< len
; i
++)
788 message_with_line (d
->lineno
,
789 "NUL in alternative %d of operand %d",
790 which_alternative
, start
);
791 alternative_count_unsure
= 1;
794 else if (strchr (",#*", p
[i
]))
796 message_with_line (d
->lineno
,
797 "'%c' in alternative %d of operand %d",
798 p
[i
], which_alternative
, start
);
799 alternative_count_unsure
= 1;
802 if (alternative_count_unsure
)
805 n
= d
->operand
[start
].n_alternatives
;
806 else if (n
!= d
->operand
[start
].n_alternatives
)
808 message_with_line (d
->lineno
,
809 "wrong number of alternatives in operand %d",
815 /* Record the insn's overall number of alternatives. */
816 d
->n_alternatives
= n
;
819 /* Verify that there are no gaps in operand numbers for INSNs. */
822 validate_insn_operands (struct data
*d
)
826 for (i
= 0; i
< d
->n_operands
; ++i
)
827 if (d
->operand
[i
].seen
== 0)
829 message_with_line (d
->lineno
, "missing operand %d", i
);
834 /* Look at a define_insn just read. Assign its code number. Record
835 on idata the template and the number of arguments. If the insn has
836 a hairy output action, output a function for now. */
839 gen_insn (rtx insn
, int lineno
)
841 struct data
*d
= XNEW (struct data
);
844 d
->code_number
= next_code_number
;
845 d
->index_number
= next_index_number
;
846 d
->filename
= read_rtx_filename
;
848 if (XSTR (insn
, 0)[0])
849 d
->name
= XSTR (insn
, 0);
853 /* Build up the list in the same order as the insns are seen
854 in the machine description. */
857 idata_end
= &d
->next
;
861 memset (d
->operand
, 0, sizeof (d
->operand
));
863 for (i
= 0; i
< XVECLEN (insn
, 1); i
++)
864 scan_operands (d
, XVECEXP (insn
, 1, i
), 0, 0);
866 d
->n_operands
= max_opno
+ 1;
867 d
->n_dups
= num_dups
;
869 #ifndef USE_MD_CONSTRAINTS
870 check_constraint_len ();
872 validate_insn_operands (d
);
873 validate_insn_alternatives (d
);
875 process_template (d
, XTMPL (insn
, 3));
878 /* Look at a define_peephole just read. Assign its code number.
879 Record on idata the template and the number of arguments.
880 If the insn has a hairy output action, output it now. */
883 gen_peephole (rtx peep
, int lineno
)
885 struct data
*d
= XNEW (struct data
);
888 d
->code_number
= next_code_number
;
889 d
->index_number
= next_index_number
;
890 d
->filename
= read_rtx_filename
;
894 /* Build up the list in the same order as the insns are seen
895 in the machine description. */
898 idata_end
= &d
->next
;
902 memset (d
->operand
, 0, sizeof (d
->operand
));
904 /* Get the number of operands by scanning all the patterns of the
905 peephole optimizer. But ignore all the rest of the information
907 for (i
= 0; i
< XVECLEN (peep
, 0); i
++)
908 scan_operands (d
, XVECEXP (peep
, 0, i
), 0, 0);
910 d
->n_operands
= max_opno
+ 1;
913 validate_insn_alternatives (d
);
915 process_template (d
, XTMPL (peep
, 2));
918 /* Process a define_expand just read. Assign its code number,
919 only for the purposes of `insn_gen_function'. */
922 gen_expand (rtx insn
, int lineno
)
924 struct data
*d
= XNEW (struct data
);
927 d
->code_number
= next_code_number
;
928 d
->index_number
= next_index_number
;
929 d
->filename
= read_rtx_filename
;
931 if (XSTR (insn
, 0)[0])
932 d
->name
= XSTR (insn
, 0);
936 /* Build up the list in the same order as the insns are seen
937 in the machine description. */
940 idata_end
= &d
->next
;
944 memset (d
->operand
, 0, sizeof (d
->operand
));
946 /* Scan the operands to get the specified predicates and modes,
947 since expand_binop needs to know them. */
950 for (i
= 0; i
< XVECLEN (insn
, 1); i
++)
951 scan_operands (d
, XVECEXP (insn
, 1, i
), 0, 0);
953 d
->n_operands
= max_opno
+ 1;
954 d
->n_dups
= num_dups
;
956 d
->output_format
= INSN_OUTPUT_FORMAT_NONE
;
958 validate_insn_alternatives (d
);
962 /* Process a define_split just read. Assign its code number,
963 only for reasons of consistency and to simplify genrecog. */
966 gen_split (rtx split
, int lineno
)
968 struct data
*d
= XNEW (struct data
);
971 d
->code_number
= next_code_number
;
972 d
->index_number
= next_index_number
;
973 d
->filename
= read_rtx_filename
;
977 /* Build up the list in the same order as the insns are seen
978 in the machine description. */
981 idata_end
= &d
->next
;
985 memset (d
->operand
, 0, sizeof (d
->operand
));
987 /* Get the number of operands by scanning all the patterns of the
988 split patterns. But ignore all the rest of the information thus
990 for (i
= 0; i
< XVECLEN (split
, 0); i
++)
991 scan_operands (d
, XVECEXP (split
, 0, i
), 0, 0);
993 d
->n_operands
= max_opno
+ 1;
995 d
->n_alternatives
= 0;
997 d
->output_format
= INSN_OUTPUT_FORMAT_NONE
;
1002 extern int main (int, char **);
1005 main (int argc
, char **argv
)
1009 progname
= "genoutput";
1011 if (init_md_reader_args (argc
, argv
) != SUCCESS_EXIT_CODE
)
1012 return (FATAL_EXIT_CODE
);
1015 next_code_number
= 0;
1016 next_index_number
= 0;
1018 /* Read the machine description. */
1024 desc
= read_md_rtx (&line_no
, &next_code_number
);
1028 switch (GET_CODE (desc
))
1031 gen_insn (desc
, line_no
);
1034 case DEFINE_PEEPHOLE
:
1035 gen_peephole (desc
, line_no
);
1039 gen_expand (desc
, line_no
);
1043 case DEFINE_PEEPHOLE2
:
1044 gen_split (desc
, line_no
);
1047 #ifdef USE_MD_CONSTRAINTS
1048 case DEFINE_CONSTRAINT
:
1049 case DEFINE_REGISTER_CONSTRAINT
:
1050 case DEFINE_ADDRESS_CONSTRAINT
:
1051 case DEFINE_MEMORY_CONSTRAINT
:
1052 note_constraint (desc
, line_no
);
1059 next_index_number
++;
1063 output_operand_data ();
1064 output_insn_data ();
1065 output_get_insn_name ();
1068 return (ferror (stdout
) != 0 || have_error
1069 ? FATAL_EXIT_CODE
: SUCCESS_EXIT_CODE
);
1072 /* Return the number of occurrences of character C in string S or
1073 -1 if S is the null string. */
1076 n_occurrences (int c
, const char *s
)
1080 if (s
== 0 || *s
== '\0')
1089 /* Remove whitespace in `s' by moving up characters until the end.
1090 Return a new string. */
1093 strip_whitespace (const char *s
)
1101 p
= q
= XNEWVEC (char, strlen (s
) + 1);
1102 while ((ch
= *s
++) != '\0')
1110 #ifdef USE_MD_CONSTRAINTS
1112 /* Record just enough information about a constraint to allow checking
1113 of operand constraint strings above, in validate_insn_alternatives.
1114 Does not validate most properties of the constraint itself; does
1115 enforce no duplicate names, no overlap with MI constraints, and no
1116 prefixes. EXP is the define_*constraint form, LINENO the line number
1117 reported by the reader. */
1119 note_constraint (rtx exp
, int lineno
)
1121 const char *name
= XSTR (exp
, 0);
1122 unsigned int namelen
= strlen (name
);
1123 struct constraint_data
**iter
, **slot
, *new;
1125 /* The 'm' constraint is special here since that constraint letter
1126 can be overridden by the back end by defining the
1127 TARGET_MEM_CONSTRAINT macro. */
1128 if (strchr (indep_constraints
, name
[0]) && name
[0] != 'm')
1130 if (name
[1] == '\0')
1131 message_with_line (lineno
, "constraint letter '%s' cannot be "
1132 "redefined by the machine description", name
);
1134 message_with_line (lineno
, "constraint name '%s' cannot be defined by "
1135 "the machine description, as it begins with '%c'",
1141 slot
= &constraints_by_letter_table
[(unsigned int)name
[0]];
1142 for (iter
= slot
; *iter
; iter
= &(*iter
)->next_this_letter
)
1144 /* This causes slot to end up pointing to the
1145 next_this_letter field of the last constraint with a name
1146 of equal or greater length than the new constraint; hence
1147 the new constraint will be inserted after all previous
1148 constraints with names of the same length. */
1149 if ((*iter
)->namelen
>= namelen
)
1152 if (!strcmp ((*iter
)->name
, name
))
1154 message_with_line (lineno
, "redefinition of constraint '%s'", name
);
1155 message_with_line ((*iter
)->lineno
, "previous definition is here");
1159 else if (!strncmp ((*iter
)->name
, name
, (*iter
)->namelen
))
1161 message_with_line (lineno
, "defining constraint '%s' here", name
);
1162 message_with_line ((*iter
)->lineno
, "renders constraint '%s' "
1163 "(defined here) a prefix", (*iter
)->name
);
1167 else if (!strncmp ((*iter
)->name
, name
, namelen
))
1169 message_with_line (lineno
, "constraint '%s' is a prefix", name
);
1170 message_with_line ((*iter
)->lineno
, "of constraint '%s' "
1171 "(defined here)", (*iter
)->name
);
1176 new = XNEWVAR (struct constraint_data
, sizeof (struct constraint_data
) + namelen
);
1177 strcpy ((char *)new + offsetof(struct constraint_data
, name
), name
);
1178 new->namelen
= namelen
;
1179 new->lineno
= lineno
;
1180 new->next_this_letter
= *slot
;
1184 /* Return the length of the constraint name beginning at position S
1185 of an operand constraint string, or issue an error message if there
1186 is no such constraint. Does not expect to be called for generic
1189 mdep_constraint_len (const char *s
, int lineno
, int opno
)
1191 struct constraint_data
*p
;
1193 p
= constraints_by_letter_table
[(unsigned int)s
[0]];
1196 for (; p
; p
= p
->next_this_letter
)
1197 if (!strncmp (s
, p
->name
, p
->namelen
))
1200 message_with_line (lineno
,
1201 "error: undefined machine-specific constraint "
1202 "at this point: \"%s\"", s
);
1203 message_with_line (lineno
, "note: in operand %d", opno
);
1205 return 1; /* safe */
1209 /* Verify that DEFAULT_CONSTRAINT_LEN is used properly and not
1210 tampered with. This isn't bullet-proof, but it should catch
1211 most genuine mistakes. */
1213 check_constraint_len (void)
1218 for (p
= ",#*+=&%!1234567890"; *p
; p
++)
1219 for (d
= -9; d
< 9; d
++)
1220 gcc_assert (constraint_len (p
, d
) == d
);
1224 constraint_len (const char *p
, int genoutput_default_constraint_len
)
1226 /* Check that we still match defaults.h . First we do a generation-time
1227 check that fails if the value is not the expected one... */
1228 gcc_assert (DEFAULT_CONSTRAINT_LEN (*p
, p
) == 1);
1229 /* And now a compile-time check that should give a diagnostic if the
1230 definition doesn't exactly match. */
1231 #define DEFAULT_CONSTRAINT_LEN(C,STR) 1
1232 /* Now re-define DEFAULT_CONSTRAINT_LEN so that we can verify it is
1234 #undef DEFAULT_CONSTRAINT_LEN
1235 #define DEFAULT_CONSTRAINT_LEN(C,STR) \
1236 ((C) != *p || STR != p ? -1 : genoutput_default_constraint_len)
1237 return CONSTRAINT_LEN (*p
, p
);
1238 /* And set it back. */
1239 #undef DEFAULT_CONSTRAINT_LEN
1240 #define DEFAULT_CONSTRAINT_LEN(C,STR) 1