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, 2008 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_code
;
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 \"insn-config.h\"\n\n");
239 printf ("#include \"conditions.h\"\n");
240 printf ("#include \"insn-attr.h\"\n\n");
241 printf ("#include \"recog.h\"\n\n");
242 printf ("#include \"toplev.h\"\n");
243 printf ("#include \"output.h\"\n");
244 printf ("#include \"target.h\"\n");
245 printf ("#include \"tm-constrs.h\"\n");
249 output_operand_data (void)
251 struct operand_data
*d
;
253 printf ("\nstatic const struct insn_operand_data operand_data[] = \n{\n");
255 for (d
= odata
; d
; d
= d
->next
)
260 d
->predicate
&& d
->predicate
[0] ? d
->predicate
: "0");
262 printf (" \"%s\",\n", d
->constraint
? d
->constraint
: "");
264 printf (" %smode,\n", GET_MODE_NAME (d
->mode
));
266 printf (" %d,\n", d
->strict_low
);
268 printf (" %d,\n", d
->constraint
== NULL
? 1 : 0);
270 printf (" %d\n", d
->eliminable
);
278 output_insn_data (void)
282 int next_name_offset
;
283 const char * last_name
= 0;
284 const char * next_name
= 0;
287 for (n
= idata
, next_name_offset
= 1; n
; n
= n
->next
, next_name_offset
++)
294 printf ("#if GCC_VERSION >= 2007\n__extension__\n#endif\n");
295 printf ("\nconst struct insn_data insn_data[] = \n{\n");
297 for (d
= idata
; d
; d
= d
->next
)
299 printf (" /* %s:%d */\n", d
->filename
, d
->lineno
);
304 printf (" \"%s\",\n", d
->name
);
308 for (n
= d
->next
, next_name_offset
= 1; n
;
309 n
= n
->next
, next_name_offset
++)
321 if (next_name
&& (last_name
== 0
322 || name_offset
> next_name_offset
/ 2))
323 printf (" \"%s-%d\",\n", next_name
,
324 next_name_offset
- name_offset
);
326 printf (" \"%s+%d\",\n", last_name
, name_offset
);
329 switch (d
->output_format
)
331 case INSN_OUTPUT_FORMAT_NONE
:
332 printf ("#if HAVE_DESIGNATED_INITIALIZERS\n");
333 printf (" { 0 },\n");
335 printf (" { 0, 0, 0 },\n");
338 case INSN_OUTPUT_FORMAT_SINGLE
:
340 const char *p
= d
->template_code
;
343 printf ("#if HAVE_DESIGNATED_INITIALIZERS\n");
344 printf (" { .single =\n");
351 if (IS_VSPACE (*p
) && prev
!= '\\')
353 /* Preserve two consecutive \n's or \r's, but treat \r\n
354 as a single newline. */
355 if (*p
== '\n' && prev
!= '\r')
364 printf ("#if HAVE_DESIGNATED_INITIALIZERS\n");
367 printf (" 0, 0 },\n");
371 case INSN_OUTPUT_FORMAT_MULTI
:
372 printf ("#if HAVE_DESIGNATED_INITIALIZERS\n");
373 printf (" { .multi = output_%d },\n", d
->code_number
);
375 printf (" { 0, output_%d, 0 },\n", d
->code_number
);
378 case INSN_OUTPUT_FORMAT_FUNCTION
:
379 printf ("#if HAVE_DESIGNATED_INITIALIZERS\n");
380 printf (" { .function = output_%d },\n", d
->code_number
);
382 printf (" { 0, 0, output_%d },\n", d
->code_number
);
389 if (d
->name
&& d
->name
[0] != '*')
390 printf (" (insn_gen_fn) gen_%s,\n", d
->name
);
394 printf (" &operand_data[%d],\n", d
->operand_number
);
395 printf (" %d,\n", d
->n_operands
);
396 printf (" %d,\n", d
->n_dups
);
397 printf (" %d,\n", d
->n_alternatives
);
398 printf (" %d\n", d
->output_format
);
406 output_get_insn_name (void)
408 printf ("const char *\n");
409 printf ("get_insn_name (int code)\n");
411 printf (" if (code == NOOP_MOVE_INSN_CODE)\n");
412 printf (" return \"NOOP_MOVE\";\n");
414 printf (" return insn_data[code].name;\n");
419 /* Stores in max_opno the largest operand number present in `part', if
420 that is larger than the previous value of max_opno, and the rest of
421 the operand data into `d->operand[i]'.
423 THIS_ADDRESS_P is nonzero if the containing rtx was an ADDRESS.
424 THIS_STRICT_LOW is nonzero if the containing rtx was a STRICT_LOW_PART. */
430 scan_operands (struct data
*d
, rtx part
, int this_address_p
,
434 const char *format_ptr
;
440 switch (GET_CODE (part
))
443 opno
= XINT (part
, 0);
446 if (max_opno
>= MAX_MAX_OPERANDS
)
448 message_with_line (d
->lineno
,
449 "maximum number of operands exceeded");
453 if (d
->operand
[opno
].seen
)
455 message_with_line (d
->lineno
,
456 "repeated operand number %d\n", opno
);
460 d
->operand
[opno
].seen
= 1;
461 d
->operand
[opno
].mode
= GET_MODE (part
);
462 d
->operand
[opno
].strict_low
= this_strict_low
;
463 d
->operand
[opno
].predicate
= XSTR (part
, 1);
464 d
->operand
[opno
].constraint
= strip_whitespace (XSTR (part
, 2));
465 d
->operand
[opno
].n_alternatives
466 = n_occurrences (',', d
->operand
[opno
].constraint
) + 1;
467 d
->operand
[opno
].address_p
= this_address_p
;
468 d
->operand
[opno
].eliminable
= 1;
472 opno
= XINT (part
, 0);
475 if (max_opno
>= MAX_MAX_OPERANDS
)
477 message_with_line (d
->lineno
,
478 "maximum number of operands exceeded");
482 if (d
->operand
[opno
].seen
)
484 message_with_line (d
->lineno
,
485 "repeated operand number %d\n", opno
);
489 d
->operand
[opno
].seen
= 1;
490 d
->operand
[opno
].mode
= GET_MODE (part
);
491 d
->operand
[opno
].strict_low
= 0;
492 d
->operand
[opno
].predicate
= "scratch_operand";
493 d
->operand
[opno
].constraint
= strip_whitespace (XSTR (part
, 1));
494 d
->operand
[opno
].n_alternatives
495 = n_occurrences (',', d
->operand
[opno
].constraint
) + 1;
496 d
->operand
[opno
].address_p
= 0;
497 d
->operand
[opno
].eliminable
= 0;
502 opno
= XINT (part
, 0);
505 if (max_opno
>= MAX_MAX_OPERANDS
)
507 message_with_line (d
->lineno
,
508 "maximum number of operands exceeded");
512 if (d
->operand
[opno
].seen
)
514 message_with_line (d
->lineno
,
515 "repeated operand number %d\n", opno
);
519 d
->operand
[opno
].seen
= 1;
520 d
->operand
[opno
].mode
= GET_MODE (part
);
521 d
->operand
[opno
].strict_low
= 0;
522 d
->operand
[opno
].predicate
= XSTR (part
, 1);
523 d
->operand
[opno
].constraint
= 0;
524 d
->operand
[opno
].address_p
= 0;
525 d
->operand
[opno
].eliminable
= 0;
526 for (i
= 0; i
< XVECLEN (part
, 2); i
++)
527 scan_operands (d
, XVECEXP (part
, 2, i
), 0, 0);
537 scan_operands (d
, XEXP (part
, 0), 1, 0);
540 case STRICT_LOW_PART
:
541 scan_operands (d
, XEXP (part
, 0), 0, 1);
548 format_ptr
= GET_RTX_FORMAT (GET_CODE (part
));
550 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (part
)); i
++)
551 switch (*format_ptr
++)
555 scan_operands (d
, XEXP (part
, i
), 0, 0);
558 if (XVEC (part
, i
) != NULL
)
559 for (j
= 0; j
< XVECLEN (part
, i
); j
++)
560 scan_operands (d
, XVECEXP (part
, i
, j
), 0, 0);
565 /* Compare two operands for content equality. */
568 compare_operands (struct operand_data
*d0
, struct operand_data
*d1
)
578 if (strcmp (p0
, p1
) != 0)
587 if (strcmp (p0
, p1
) != 0)
590 if (d0
->mode
!= d1
->mode
)
593 if (d0
->strict_low
!= d1
->strict_low
)
596 if (d0
->eliminable
!= d1
->eliminable
)
602 /* Scan the list of operands we've already committed to output and either
603 find a subsequence that is the same, or allocate a new one at the end. */
606 place_operands (struct data
*d
)
608 struct operand_data
*od
, *od2
;
611 if (d
->n_operands
== 0)
613 d
->operand_number
= 0;
617 /* Brute force substring search. */
618 for (od
= odata
, i
= 0; od
; od
= od
->next
, i
= 0)
619 if (compare_operands (od
, &d
->operand
[0]))
625 if (i
== d
->n_operands
)
629 if (! compare_operands (od2
, &d
->operand
[i
]))
631 ++i
, od2
= od2
->next
;
635 /* Either partial match at the end of the list, or no match. In either
636 case, we tack on what operands are remaining to the end of the list. */
638 d
->operand_number
= next_operand_number
- i
;
639 for (; i
< d
->n_operands
; ++i
)
641 od2
= &d
->operand
[i
];
643 odata_end
= &od2
->next
;
644 od2
->index
= next_operand_number
++;
650 d
->operand_number
= od
->index
;
655 /* Process an assembler template from a define_insn or a define_peephole.
656 It is either the assembler code template, a list of assembler code
657 templates, or C code to generate the assembler code template. */
660 process_template (struct data
*d
, const char *template_code
)
665 /* Templates starting with * contain straight code to be run. */
666 if (template_code
[0] == '*')
668 d
->template_code
= 0;
669 d
->output_format
= INSN_OUTPUT_FORMAT_FUNCTION
;
671 puts ("\nstatic const char *");
672 printf ("output_%d (rtx *operands ATTRIBUTE_UNUSED, rtx insn ATTRIBUTE_UNUSED)\n",
675 print_rtx_ptr_loc (template_code
);
676 puts (template_code
+ 1);
680 /* If the assembler code template starts with a @ it is a newline-separated
681 list of assembler code templates, one for each alternative. */
682 else if (template_code
[0] == '@')
684 d
->template_code
= 0;
685 d
->output_format
= INSN_OUTPUT_FORMAT_MULTI
;
687 printf ("\nstatic const char * const output_%d[] = {\n", d
->code_number
);
689 for (i
= 0, cp
= &template_code
[1]; *cp
; )
693 while (ISSPACE (*cp
))
698 for (ep
= sp
= cp
; !IS_VSPACE (*ep
) && *ep
!= '\0'; ++ep
)
703 message_with_line (d
->lineno
,
704 "trailing whitespace in output template");
716 message_with_line (d
->lineno
,
717 "'@' is redundant for output template with single alternative");
718 if (i
!= d
->n_alternatives
)
720 message_with_line (d
->lineno
,
721 "wrong number of alternatives in the output template");
729 d
->template_code
= template_code
;
730 d
->output_format
= INSN_OUTPUT_FORMAT_SINGLE
;
734 /* Check insn D for consistency in number of constraint alternatives. */
737 validate_insn_alternatives (struct data
*d
)
741 /* Make sure all the operands have the same number of alternatives
742 in their constraints. Let N be that number. */
743 for (start
= 0; start
< d
->n_operands
; start
++)
744 if (d
->operand
[start
].n_alternatives
> 0)
749 int which_alternative
= 0;
750 int alternative_count_unsure
= 0;
752 for (p
= d
->operand
[start
].constraint
; (c
= *p
); p
+= len
)
754 #ifdef USE_MD_CONSTRAINTS
755 if (ISSPACE (c
) || strchr (indep_constraints
, c
))
757 else if (ISDIGIT (c
))
762 while (ISDIGIT (*q
));
766 len
= mdep_constraint_len (p
, d
->lineno
, start
);
768 len
= CONSTRAINT_LEN (c
, p
);
770 if (len
< 1 || (len
> 1 && strchr (",#*+=&%!0123456789", c
)))
772 message_with_line (d
->lineno
,
773 "invalid length %d for char '%c' in alternative %d of operand %d",
774 len
, c
, which_alternative
, start
);
786 for (i
= 1; i
< len
; i
++)
789 message_with_line (d
->lineno
,
790 "NUL in alternative %d of operand %d",
791 which_alternative
, start
);
792 alternative_count_unsure
= 1;
795 else if (strchr (",#*", p
[i
]))
797 message_with_line (d
->lineno
,
798 "'%c' in alternative %d of operand %d",
799 p
[i
], which_alternative
, start
);
800 alternative_count_unsure
= 1;
803 if (alternative_count_unsure
)
806 n
= d
->operand
[start
].n_alternatives
;
807 else if (n
!= d
->operand
[start
].n_alternatives
)
809 message_with_line (d
->lineno
,
810 "wrong number of alternatives in operand %d",
816 /* Record the insn's overall number of alternatives. */
817 d
->n_alternatives
= n
;
820 /* Verify that there are no gaps in operand numbers for INSNs. */
823 validate_insn_operands (struct data
*d
)
827 for (i
= 0; i
< d
->n_operands
; ++i
)
828 if (d
->operand
[i
].seen
== 0)
830 message_with_line (d
->lineno
, "missing operand %d", i
);
836 validate_optab_operands (struct data
*d
)
838 if (!d
->name
|| d
->name
[0] == '\0' || d
->name
[0] == '*')
841 /* Miscellaneous tests. */
842 if (strncmp (d
->name
, "cstore", 6) == 0
843 && d
->name
[strlen (d
->name
) - 1] == '4'
844 && d
->operand
[0].mode
== VOIDmode
)
846 message_with_line (d
->lineno
, "missing mode for operand 0 of cstore");
851 /* Look at a define_insn just read. Assign its code number. Record
852 on idata the template and the number of arguments. If the insn has
853 a hairy output action, output a function for now. */
856 gen_insn (rtx insn
, int lineno
)
858 struct data
*d
= XNEW (struct data
);
861 d
->code_number
= next_code_number
;
862 d
->index_number
= next_index_number
;
863 d
->filename
= read_rtx_filename
;
865 if (XSTR (insn
, 0)[0])
866 d
->name
= XSTR (insn
, 0);
870 /* Build up the list in the same order as the insns are seen
871 in the machine description. */
874 idata_end
= &d
->next
;
878 memset (d
->operand
, 0, sizeof (d
->operand
));
880 for (i
= 0; i
< XVECLEN (insn
, 1); i
++)
881 scan_operands (d
, XVECEXP (insn
, 1, i
), 0, 0);
883 d
->n_operands
= max_opno
+ 1;
884 d
->n_dups
= num_dups
;
886 #ifndef USE_MD_CONSTRAINTS
887 check_constraint_len ();
889 validate_insn_operands (d
);
890 validate_insn_alternatives (d
);
891 validate_optab_operands (d
);
893 process_template (d
, XTMPL (insn
, 3));
896 /* Look at a define_peephole just read. Assign its code number.
897 Record on idata the template and the number of arguments.
898 If the insn has a hairy output action, output it now. */
901 gen_peephole (rtx peep
, int lineno
)
903 struct data
*d
= XNEW (struct data
);
906 d
->code_number
= next_code_number
;
907 d
->index_number
= next_index_number
;
908 d
->filename
= read_rtx_filename
;
912 /* Build up the list in the same order as the insns are seen
913 in the machine description. */
916 idata_end
= &d
->next
;
920 memset (d
->operand
, 0, sizeof (d
->operand
));
922 /* Get the number of operands by scanning all the patterns of the
923 peephole optimizer. But ignore all the rest of the information
925 for (i
= 0; i
< XVECLEN (peep
, 0); i
++)
926 scan_operands (d
, XVECEXP (peep
, 0, i
), 0, 0);
928 d
->n_operands
= max_opno
+ 1;
931 validate_insn_alternatives (d
);
933 process_template (d
, XTMPL (peep
, 2));
936 /* Process a define_expand just read. Assign its code number,
937 only for the purposes of `insn_gen_function'. */
940 gen_expand (rtx insn
, int lineno
)
942 struct data
*d
= XNEW (struct data
);
945 d
->code_number
= next_code_number
;
946 d
->index_number
= next_index_number
;
947 d
->filename
= read_rtx_filename
;
949 if (XSTR (insn
, 0)[0])
950 d
->name
= XSTR (insn
, 0);
954 /* Build up the list in the same order as the insns are seen
955 in the machine description. */
958 idata_end
= &d
->next
;
962 memset (d
->operand
, 0, sizeof (d
->operand
));
964 /* Scan the operands to get the specified predicates and modes,
965 since expand_binop needs to know them. */
968 for (i
= 0; i
< XVECLEN (insn
, 1); i
++)
969 scan_operands (d
, XVECEXP (insn
, 1, i
), 0, 0);
971 d
->n_operands
= max_opno
+ 1;
972 d
->n_dups
= num_dups
;
973 d
->template_code
= 0;
974 d
->output_format
= INSN_OUTPUT_FORMAT_NONE
;
976 validate_insn_alternatives (d
);
977 validate_optab_operands (d
);
981 /* Process a define_split just read. Assign its code number,
982 only for reasons of consistency and to simplify genrecog. */
985 gen_split (rtx split
, int lineno
)
987 struct data
*d
= XNEW (struct data
);
990 d
->code_number
= next_code_number
;
991 d
->index_number
= next_index_number
;
992 d
->filename
= read_rtx_filename
;
996 /* Build up the list in the same order as the insns are seen
997 in the machine description. */
1000 idata_end
= &d
->next
;
1004 memset (d
->operand
, 0, sizeof (d
->operand
));
1006 /* Get the number of operands by scanning all the patterns of the
1007 split patterns. But ignore all the rest of the information thus
1009 for (i
= 0; i
< XVECLEN (split
, 0); i
++)
1010 scan_operands (d
, XVECEXP (split
, 0, i
), 0, 0);
1012 d
->n_operands
= max_opno
+ 1;
1014 d
->n_alternatives
= 0;
1015 d
->template_code
= 0;
1016 d
->output_format
= INSN_OUTPUT_FORMAT_NONE
;
1021 extern int main (int, char **);
1024 main (int argc
, char **argv
)
1028 progname
= "genoutput";
1030 if (init_md_reader_args (argc
, argv
) != SUCCESS_EXIT_CODE
)
1031 return (FATAL_EXIT_CODE
);
1034 next_code_number
= 0;
1035 next_index_number
= 0;
1037 /* Read the machine description. */
1043 desc
= read_md_rtx (&line_no
, &next_code_number
);
1047 switch (GET_CODE (desc
))
1050 gen_insn (desc
, line_no
);
1053 case DEFINE_PEEPHOLE
:
1054 gen_peephole (desc
, line_no
);
1058 gen_expand (desc
, line_no
);
1062 case DEFINE_PEEPHOLE2
:
1063 gen_split (desc
, line_no
);
1066 #ifdef USE_MD_CONSTRAINTS
1067 case DEFINE_CONSTRAINT
:
1068 case DEFINE_REGISTER_CONSTRAINT
:
1069 case DEFINE_ADDRESS_CONSTRAINT
:
1070 case DEFINE_MEMORY_CONSTRAINT
:
1071 note_constraint (desc
, line_no
);
1078 next_index_number
++;
1082 output_operand_data ();
1083 output_insn_data ();
1084 output_get_insn_name ();
1087 return (ferror (stdout
) != 0 || have_error
1088 ? FATAL_EXIT_CODE
: SUCCESS_EXIT_CODE
);
1091 /* Return the number of occurrences of character C in string S or
1092 -1 if S is the null string. */
1095 n_occurrences (int c
, const char *s
)
1099 if (s
== 0 || *s
== '\0')
1108 /* Remove whitespace in `s' by moving up characters until the end.
1109 Return a new string. */
1112 strip_whitespace (const char *s
)
1120 p
= q
= XNEWVEC (char, strlen (s
) + 1);
1121 while ((ch
= *s
++) != '\0')
1129 #ifdef USE_MD_CONSTRAINTS
1131 /* Record just enough information about a constraint to allow checking
1132 of operand constraint strings above, in validate_insn_alternatives.
1133 Does not validate most properties of the constraint itself; does
1134 enforce no duplicate names, no overlap with MI constraints, and no
1135 prefixes. EXP is the define_*constraint form, LINENO the line number
1136 reported by the reader. */
1138 note_constraint (rtx exp
, int lineno
)
1140 const char *name
= XSTR (exp
, 0);
1141 unsigned int namelen
= strlen (name
);
1142 struct constraint_data
**iter
, **slot
, *new_cdata
;
1144 /* The 'm' constraint is special here since that constraint letter
1145 can be overridden by the back end by defining the
1146 TARGET_MEM_CONSTRAINT macro. */
1147 if (strchr (indep_constraints
, name
[0]) && name
[0] != 'm')
1149 if (name
[1] == '\0')
1150 message_with_line (lineno
, "constraint letter '%s' cannot be "
1151 "redefined by the machine description", name
);
1153 message_with_line (lineno
, "constraint name '%s' cannot be defined by "
1154 "the machine description, as it begins with '%c'",
1160 slot
= &constraints_by_letter_table
[(unsigned int)name
[0]];
1161 for (iter
= slot
; *iter
; iter
= &(*iter
)->next_this_letter
)
1163 /* This causes slot to end up pointing to the
1164 next_this_letter field of the last constraint with a name
1165 of equal or greater length than the new constraint; hence
1166 the new constraint will be inserted after all previous
1167 constraints with names of the same length. */
1168 if ((*iter
)->namelen
>= namelen
)
1171 if (!strcmp ((*iter
)->name
, name
))
1173 message_with_line (lineno
, "redefinition of constraint '%s'", name
);
1174 message_with_line ((*iter
)->lineno
, "previous definition is here");
1178 else if (!strncmp ((*iter
)->name
, name
, (*iter
)->namelen
))
1180 message_with_line (lineno
, "defining constraint '%s' here", name
);
1181 message_with_line ((*iter
)->lineno
, "renders constraint '%s' "
1182 "(defined here) a prefix", (*iter
)->name
);
1186 else if (!strncmp ((*iter
)->name
, name
, namelen
))
1188 message_with_line (lineno
, "constraint '%s' is a prefix", name
);
1189 message_with_line ((*iter
)->lineno
, "of constraint '%s' "
1190 "(defined here)", (*iter
)->name
);
1195 new_cdata
= XNEWVAR (struct constraint_data
, sizeof (struct constraint_data
) + namelen
);
1196 strcpy ((char *)new_cdata
+ offsetof(struct constraint_data
, name
), name
);
1197 new_cdata
->namelen
= namelen
;
1198 new_cdata
->lineno
= lineno
;
1199 new_cdata
->next_this_letter
= *slot
;
1203 /* Return the length of the constraint name beginning at position S
1204 of an operand constraint string, or issue an error message if there
1205 is no such constraint. Does not expect to be called for generic
1208 mdep_constraint_len (const char *s
, int lineno
, int opno
)
1210 struct constraint_data
*p
;
1212 p
= constraints_by_letter_table
[(unsigned int)s
[0]];
1215 for (; p
; p
= p
->next_this_letter
)
1216 if (!strncmp (s
, p
->name
, p
->namelen
))
1219 message_with_line (lineno
,
1220 "error: undefined machine-specific constraint "
1221 "at this point: \"%s\"", s
);
1222 message_with_line (lineno
, "note: in operand %d", opno
);
1224 return 1; /* safe */
1228 /* Verify that DEFAULT_CONSTRAINT_LEN is used properly and not
1229 tampered with. This isn't bullet-proof, but it should catch
1230 most genuine mistakes. */
1232 check_constraint_len (void)
1237 for (p
= ",#*+=&%!1234567890"; *p
; p
++)
1238 for (d
= -9; d
< 9; d
++)
1239 gcc_assert (constraint_len (p
, d
) == d
);
1243 constraint_len (const char *p
, int genoutput_default_constraint_len
)
1245 /* Check that we still match defaults.h . First we do a generation-time
1246 check that fails if the value is not the expected one... */
1247 gcc_assert (DEFAULT_CONSTRAINT_LEN (*p
, p
) == 1);
1248 /* And now a compile-time check that should give a diagnostic if the
1249 definition doesn't exactly match. */
1250 #define DEFAULT_CONSTRAINT_LEN(C,STR) 1
1251 /* Now re-define DEFAULT_CONSTRAINT_LEN so that we can verify it is
1253 #undef DEFAULT_CONSTRAINT_LEN
1254 #define DEFAULT_CONSTRAINT_LEN(C,STR) \
1255 ((C) != *p || STR != p ? -1 : genoutput_default_constraint_len)
1256 return CONSTRAINT_LEN (*p
, p
);
1257 /* And set it back. */
1258 #undef DEFAULT_CONSTRAINT_LEN
1259 #define DEFAULT_CONSTRAINT_LEN(C,STR) 1