1 /* Generate code from to output assembler insns as recognized from rtl.
2 Copyright (C) 1987-2013 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
21 /* This program reads the machine description for the compiler target machine
22 and produces a file containing these things:
24 1. An array of `struct insn_data_d', which is indexed by insn code number,
27 a. `name' is the name for that pattern. Nameless patterns are
30 b. `output' hold either the output template, an array of output
31 templates, or an output function.
33 c. `genfun' is the function to generate a body for that pattern,
34 given operands as arguments.
36 d. `n_operands' is the number of distinct operands in the pattern
39 e. `n_dups' is the number of match_dup's that appear in the insn's
40 pattern. This says how many elements of `recog_data.dup_loc' are
41 significant after an insn has been recognized.
43 f. `n_alternatives' is the number of alternatives in the constraints
46 g. `output_format' tells what type of thing `output' is.
48 h. `operand' is the base of an array of operand data for the insn.
50 2. An array of `struct insn_operand data', used by `operand' above.
52 a. `predicate', an int-valued function, is the match_operand predicate
55 b. `constraint' is the constraint for this operand.
57 c. `address_p' indicates that the operand appears within ADDRESS
60 d. `mode' is the machine mode that that operand is supposed to have.
62 e. `strict_low', is nonzero for operands contained in a STRICT_LOW_PART.
64 f. `eliminable', is nonzero for operands that are matched normally by
65 MATCH_OPERAND; it is zero for operands that should not be changed during
66 register elimination such as MATCH_OPERATORs.
68 g. `allows_mem', is true for operands that accept MEM rtxes.
70 The code number of an insn is simply its position in the machine
71 description; code numbers are assigned sequentially to entries in
72 the description, starting with code number 0.
74 Thus, the following entry in the machine description
77 [(set (match_operand:DF 0 "general_operand" "")
82 assuming it is the 25th entry present, would cause
83 insn_data[24].template to be "clrd %0", and
84 insn_data[24].n_operands to be 1. */
88 #include "coretypes.h"
93 #include "gensupport.h"
95 /* No instruction can have more operands than this. Sorry for this
96 arbitrary limit, but what machine will have an instruction with
97 this many operands? */
99 #define MAX_MAX_OPERANDS 40
101 static int n_occurrences (int, const char *);
102 static const char *strip_whitespace (const char *);
104 /* insns in the machine description are assigned sequential code numbers
105 that are used by insn-recog.c (produced by genrecog) to communicate
106 to insn-output.c (produced by this program). */
108 static int next_code_number
;
110 /* This counts all definitions in the md file,
111 for the sake of error messages. */
113 static int next_index_number
;
115 /* This counts all operands used in the md file. The first is null. */
117 static int next_operand_number
= 1;
119 /* Record in this chain all information about the operands we will output. */
123 struct operand_data
*next
;
125 const char *predicate
;
126 const char *constraint
;
127 enum machine_mode mode
;
128 unsigned char n_alternatives
;
135 /* Begin with a null operand at index 0. */
137 static struct operand_data null_operand
=
139 0, 0, "", "", VOIDmode
, 0, 0, 0, 0, 0
142 static struct operand_data
*odata
= &null_operand
;
143 static struct operand_data
**odata_end
= &null_operand
.next
;
145 /* Must match the constants in recog.h. */
147 #define INSN_OUTPUT_FORMAT_NONE 0 /* abort */
148 #define INSN_OUTPUT_FORMAT_SINGLE 1 /* const char * */
149 #define INSN_OUTPUT_FORMAT_MULTI 2 /* const char * const * */
150 #define INSN_OUTPUT_FORMAT_FUNCTION 3 /* const char * (*)(...) */
152 /* Record in this chain all information that we will output,
153 associated with the code number of the insn. */
159 const char *template_code
;
162 const char *filename
;
164 int n_generator_args
; /* Number of arguments passed to generator */
165 int n_operands
; /* Number of operands this insn recognizes */
166 int n_dups
; /* Number times match_dup appears in pattern */
167 int n_alternatives
; /* Number of alternatives in each constraint */
168 int operand_number
; /* Operand index in the big array. */
169 int output_format
; /* INSN_OUTPUT_FORMAT_*. */
170 struct operand_data operand
[MAX_MAX_OPERANDS
];
173 /* A dummy insn, for CODE_FOR_nothing. */
174 static struct data nothing
;
176 /* This variable points to the first link in the insn chain. */
177 static struct data
*idata
= ¬hing
;
179 /* This variable points to the end of the insn chain. This is where
180 everything relevant from the machien description is appended to. */
181 static struct data
**idata_end
= ¬hing
.next
;
184 static void output_prologue (void);
185 static void output_operand_data (void);
186 static void output_insn_data (void);
187 static void output_get_insn_name (void);
188 static void scan_operands (struct data
*, rtx
, int, int);
189 static int compare_operands (struct operand_data
*,
190 struct operand_data
*);
191 static void place_operands (struct data
*);
192 static void process_template (struct data
*, const char *);
193 static void validate_insn_alternatives (struct data
*);
194 static void validate_insn_operands (struct data
*);
195 static void gen_insn (rtx
, int);
196 static void gen_peephole (rtx
, int);
197 static void gen_expand (rtx
, int);
198 static void gen_split (rtx
, int);
200 #ifdef USE_MD_CONSTRAINTS
202 struct constraint_data
204 struct constraint_data
*next_this_letter
;
206 unsigned int namelen
;
210 /* This is a complete list (unlike the one in genpreds.c) of constraint
211 letters and modifiers with machine-independent meaning. The only
212 omission is digits, as these are handled specially. */
213 static const char indep_constraints
[] = ",=+%*?!#&<>EFVXgimnoprs";
215 static struct constraint_data
*
216 constraints_by_letter_table
[1 << CHAR_BIT
];
218 static int mdep_constraint_len (const char *, int, int);
219 static void note_constraint (rtx
, int);
221 #else /* !USE_MD_CONSTRAINTS */
223 static void check_constraint_len (void);
224 static int constraint_len (const char *, int);
226 #endif /* !USE_MD_CONSTRAINTS */
230 output_prologue (void)
232 printf ("/* Generated automatically by the program `genoutput'\n\
233 from the machine description file `md'. */\n\n");
235 printf ("#include \"config.h\"\n");
236 printf ("#include \"system.h\"\n");
237 printf ("#include \"coretypes.h\"\n");
238 printf ("#include \"tm.h\"\n");
239 printf ("#include \"flags.h\"\n");
240 printf ("#include \"ggc.h\"\n");
241 printf ("#include \"tree.h\"\n");
242 printf ("#include \"rtl.h\"\n");
243 printf ("#include \"expr.h\"\n");
244 printf ("#include \"insn-codes.h\"\n");
245 printf ("#include \"tm_p.h\"\n");
246 printf ("#include \"function.h\"\n");
247 printf ("#include \"regs.h\"\n");
248 printf ("#include \"hard-reg-set.h\"\n");
249 printf ("#include \"insn-config.h\"\n\n");
250 printf ("#include \"conditions.h\"\n");
251 printf ("#include \"insn-attr.h\"\n\n");
252 printf ("#include \"recog.h\"\n\n");
253 printf ("#include \"diagnostic-core.h\"\n");
254 printf ("#include \"output.h\"\n");
255 printf ("#include \"target.h\"\n");
256 printf ("#include \"tm-constrs.h\"\n");
260 output_operand_data (void)
262 struct operand_data
*d
;
264 printf ("\nstatic const struct insn_operand_data operand_data[] = \n{\n");
266 for (d
= odata
; d
; d
= d
->next
)
268 struct pred_data
*pred
;
273 d
->predicate
&& d
->predicate
[0] ? d
->predicate
: "0");
275 printf (" \"%s\",\n", d
->constraint
? d
->constraint
: "");
277 printf (" %smode,\n", GET_MODE_NAME (d
->mode
));
279 printf (" %d,\n", d
->strict_low
);
281 printf (" %d,\n", d
->constraint
== NULL
? 1 : 0);
283 printf (" %d,\n", d
->eliminable
);
287 pred
= lookup_predicate (d
->predicate
);
288 printf (" %d\n", pred
&& pred
->codes
[MEM
]);
296 output_insn_data (void)
300 int next_name_offset
;
301 const char * last_name
= 0;
302 const char * next_name
= 0;
305 for (n
= idata
, next_name_offset
= 1; n
; n
= n
->next
, next_name_offset
++)
312 printf ("#if GCC_VERSION >= 2007\n__extension__\n#endif\n");
313 printf ("\nconst struct insn_data_d insn_data[] = \n{\n");
315 for (d
= idata
; d
; d
= d
->next
)
317 printf (" /* %s:%d */\n", d
->filename
, d
->lineno
);
322 printf (" \"%s\",\n", d
->name
);
326 for (n
= d
->next
, next_name_offset
= 1; n
;
327 n
= n
->next
, next_name_offset
++)
339 if (next_name
&& (last_name
== 0
340 || name_offset
> next_name_offset
/ 2))
341 printf (" \"%s-%d\",\n", next_name
,
342 next_name_offset
- name_offset
);
344 printf (" \"%s+%d\",\n", last_name
, name_offset
);
347 switch (d
->output_format
)
349 case INSN_OUTPUT_FORMAT_NONE
:
350 printf ("#if HAVE_DESIGNATED_UNION_INITIALIZERS\n");
351 printf (" { 0 },\n");
353 printf (" { 0, 0, 0 },\n");
356 case INSN_OUTPUT_FORMAT_SINGLE
:
358 const char *p
= d
->template_code
;
361 printf ("#if HAVE_DESIGNATED_UNION_INITIALIZERS\n");
362 printf (" { .single =\n");
369 if (IS_VSPACE (*p
) && prev
!= '\\')
371 /* Preserve two consecutive \n's or \r's, but treat \r\n
372 as a single newline. */
373 if (*p
== '\n' && prev
!= '\r')
382 printf ("#if HAVE_DESIGNATED_UNION_INITIALIZERS\n");
385 printf (" 0, 0 },\n");
389 case INSN_OUTPUT_FORMAT_MULTI
:
390 printf ("#if HAVE_DESIGNATED_UNION_INITIALIZERS\n");
391 printf (" { .multi = output_%d },\n", d
->code_number
);
393 printf (" { 0, output_%d, 0 },\n", d
->code_number
);
396 case INSN_OUTPUT_FORMAT_FUNCTION
:
397 printf ("#if HAVE_DESIGNATED_UNION_INITIALIZERS\n");
398 printf (" { .function = output_%d },\n", d
->code_number
);
400 printf (" { 0, 0, output_%d },\n", d
->code_number
);
407 if (d
->name
&& d
->name
[0] != '*')
408 printf (" { (insn_gen_fn::stored_funcptr) gen_%s },\n", d
->name
);
410 printf (" { 0 },\n");
412 printf (" &operand_data[%d],\n", d
->operand_number
);
413 printf (" %d,\n", d
->n_generator_args
);
414 printf (" %d,\n", d
->n_operands
);
415 printf (" %d,\n", d
->n_dups
);
416 printf (" %d,\n", d
->n_alternatives
);
417 printf (" %d\n", d
->output_format
);
425 output_get_insn_name (void)
427 printf ("const char *\n");
428 printf ("get_insn_name (int code)\n");
430 printf (" if (code == NOOP_MOVE_INSN_CODE)\n");
431 printf (" return \"NOOP_MOVE\";\n");
433 printf (" return insn_data[code].name;\n");
438 /* Stores the operand data into `d->operand[i]'.
440 THIS_ADDRESS_P is nonzero if the containing rtx was an ADDRESS.
441 THIS_STRICT_LOW is nonzero if the containing rtx was a STRICT_LOW_PART. */
444 scan_operands (struct data
*d
, rtx part
, int this_address_p
,
448 const char *format_ptr
;
454 switch (GET_CODE (part
))
457 opno
= XINT (part
, 0);
458 if (opno
>= MAX_MAX_OPERANDS
)
460 error_with_line (d
->lineno
, "maximum number of operands exceeded");
463 if (d
->operand
[opno
].seen
)
464 error_with_line (d
->lineno
, "repeated operand number %d\n", opno
);
466 d
->operand
[opno
].seen
= 1;
467 d
->operand
[opno
].mode
= GET_MODE (part
);
468 d
->operand
[opno
].strict_low
= this_strict_low
;
469 d
->operand
[opno
].predicate
= XSTR (part
, 1);
470 d
->operand
[opno
].constraint
= strip_whitespace (XSTR (part
, 2));
471 d
->operand
[opno
].n_alternatives
472 = n_occurrences (',', d
->operand
[opno
].constraint
) + 1;
473 d
->operand
[opno
].address_p
= this_address_p
;
474 d
->operand
[opno
].eliminable
= 1;
478 opno
= XINT (part
, 0);
479 if (opno
>= MAX_MAX_OPERANDS
)
481 error_with_line (d
->lineno
, "maximum number of operands exceeded");
484 if (d
->operand
[opno
].seen
)
485 error_with_line (d
->lineno
, "repeated operand number %d\n", opno
);
487 d
->operand
[opno
].seen
= 1;
488 d
->operand
[opno
].mode
= GET_MODE (part
);
489 d
->operand
[opno
].strict_low
= 0;
490 d
->operand
[opno
].predicate
= "scratch_operand";
491 d
->operand
[opno
].constraint
= strip_whitespace (XSTR (part
, 1));
492 d
->operand
[opno
].n_alternatives
493 = n_occurrences (',', d
->operand
[opno
].constraint
) + 1;
494 d
->operand
[opno
].address_p
= 0;
495 d
->operand
[opno
].eliminable
= 0;
500 opno
= XINT (part
, 0);
501 if (opno
>= MAX_MAX_OPERANDS
)
503 error_with_line (d
->lineno
, "maximum number of operands exceeded");
506 if (d
->operand
[opno
].seen
)
507 error_with_line (d
->lineno
, "repeated operand number %d\n", opno
);
509 d
->operand
[opno
].seen
= 1;
510 d
->operand
[opno
].mode
= GET_MODE (part
);
511 d
->operand
[opno
].strict_low
= 0;
512 d
->operand
[opno
].predicate
= XSTR (part
, 1);
513 d
->operand
[opno
].constraint
= 0;
514 d
->operand
[opno
].address_p
= 0;
515 d
->operand
[opno
].eliminable
= 0;
516 for (i
= 0; i
< XVECLEN (part
, 2); i
++)
517 scan_operands (d
, XVECEXP (part
, 2, i
), 0, 0);
520 case STRICT_LOW_PART
:
521 scan_operands (d
, XEXP (part
, 0), 0, 1);
528 format_ptr
= GET_RTX_FORMAT (GET_CODE (part
));
530 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (part
)); i
++)
531 switch (*format_ptr
++)
535 scan_operands (d
, XEXP (part
, i
), 0, 0);
538 if (XVEC (part
, i
) != NULL
)
539 for (j
= 0; j
< XVECLEN (part
, i
); j
++)
540 scan_operands (d
, XVECEXP (part
, i
, j
), 0, 0);
545 /* Compare two operands for content equality. */
548 compare_operands (struct operand_data
*d0
, struct operand_data
*d1
)
558 if (strcmp (p0
, p1
) != 0)
567 if (strcmp (p0
, p1
) != 0)
570 if (d0
->mode
!= d1
->mode
)
573 if (d0
->strict_low
!= d1
->strict_low
)
576 if (d0
->eliminable
!= d1
->eliminable
)
582 /* Scan the list of operands we've already committed to output and either
583 find a subsequence that is the same, or allocate a new one at the end. */
586 place_operands (struct data
*d
)
588 struct operand_data
*od
, *od2
;
591 if (d
->n_operands
== 0)
593 d
->operand_number
= 0;
597 /* Brute force substring search. */
598 for (od
= odata
, i
= 0; od
; od
= od
->next
, i
= 0)
599 if (compare_operands (od
, &d
->operand
[0]))
605 if (i
== d
->n_operands
)
609 if (! compare_operands (od2
, &d
->operand
[i
]))
611 ++i
, od2
= od2
->next
;
615 /* Either partial match at the end of the list, or no match. In either
616 case, we tack on what operands are remaining to the end of the list. */
618 d
->operand_number
= next_operand_number
- i
;
619 for (; i
< d
->n_operands
; ++i
)
621 od2
= &d
->operand
[i
];
623 odata_end
= &od2
->next
;
624 od2
->index
= next_operand_number
++;
630 d
->operand_number
= od
->index
;
635 /* Process an assembler template from a define_insn or a define_peephole.
636 It is either the assembler code template, a list of assembler code
637 templates, or C code to generate the assembler code template. */
640 process_template (struct data
*d
, const char *template_code
)
645 /* Templates starting with * contain straight code to be run. */
646 if (template_code
[0] == '*')
648 d
->template_code
= 0;
649 d
->output_format
= INSN_OUTPUT_FORMAT_FUNCTION
;
651 puts ("\nstatic const char *");
652 printf ("output_%d (rtx *operands ATTRIBUTE_UNUSED, rtx insn ATTRIBUTE_UNUSED)\n",
655 print_md_ptr_loc (template_code
);
656 puts (template_code
+ 1);
660 /* If the assembler code template starts with a @ it is a newline-separated
661 list of assembler code templates, one for each alternative. */
662 else if (template_code
[0] == '@')
666 for (cp
= &template_code
[1]; *cp
; )
668 while (ISSPACE (*cp
))
672 while (!IS_VSPACE (*cp
) && *cp
!= '\0')
675 d
->template_code
= 0;
678 d
->output_format
= INSN_OUTPUT_FORMAT_FUNCTION
;
679 puts ("\nstatic const char *");
680 printf ("output_%d (rtx *operands ATTRIBUTE_UNUSED, "
681 "rtx insn ATTRIBUTE_UNUSED)\n", d
->code_number
);
683 puts (" switch (which_alternative)\n {");
687 d
->output_format
= INSN_OUTPUT_FORMAT_MULTI
;
688 printf ("\nstatic const char * const output_%d[] = {\n",
692 for (i
= 0, cp
= &template_code
[1]; *cp
; )
694 const char *ep
, *sp
, *bp
;
696 while (ISSPACE (*cp
))
702 printf (" case %d:", i
);
709 printf (" return \"");
714 for (ep
= sp
= cp
; !IS_VSPACE (*ep
) && *ep
!= '\0'; ++ep
)
719 message_with_line (d
->lineno
,
720 "trailing whitespace in output template");
734 /* The usual action will end with a return.
735 If there is neither break or return at the end, this is
736 assumed to be intentional; this allows to have multiple
737 consecutive alternatives share some code. */
743 message_with_line (d
->lineno
,
744 "'@' is redundant for output template with single alternative");
745 if (i
!= d
->n_alternatives
)
746 error_with_line (d
->lineno
,
747 "wrong number of alternatives in the output template");
750 puts (" default: gcc_unreachable ();\n }\n}");
756 d
->template_code
= template_code
;
757 d
->output_format
= INSN_OUTPUT_FORMAT_SINGLE
;
761 /* Check insn D for consistency in number of constraint alternatives. */
764 validate_insn_alternatives (struct data
*d
)
768 /* Make sure all the operands have the same number of alternatives
769 in their constraints. Let N be that number. */
770 for (start
= 0; start
< d
->n_operands
; start
++)
771 if (d
->operand
[start
].n_alternatives
> 0)
776 int which_alternative
= 0;
777 int alternative_count_unsure
= 0;
779 for (p
= d
->operand
[start
].constraint
; (c
= *p
); p
+= len
)
781 #ifdef USE_MD_CONSTRAINTS
782 if (ISSPACE (c
) || strchr (indep_constraints
, c
))
784 else if (ISDIGIT (c
))
789 while (ISDIGIT (*q
));
793 len
= mdep_constraint_len (p
, d
->lineno
, start
);
795 len
= CONSTRAINT_LEN (c
, p
);
797 if (len
< 1 || (len
> 1 && strchr (",#*+=&%!0123456789", c
)))
799 error_with_line (d
->lineno
,
800 "invalid length %d for char '%c' in"
801 " alternative %d of operand %d",
802 len
, c
, which_alternative
, start
);
813 for (i
= 1; i
< len
; i
++)
816 error_with_line (d
->lineno
,
817 "NUL in alternative %d of operand %d",
818 which_alternative
, start
);
819 alternative_count_unsure
= 1;
822 else if (strchr (",#*", p
[i
]))
824 error_with_line (d
->lineno
,
825 "'%c' in alternative %d of operand %d",
826 p
[i
], which_alternative
, start
);
827 alternative_count_unsure
= 1;
830 if (!alternative_count_unsure
)
833 n
= d
->operand
[start
].n_alternatives
;
834 else if (n
!= d
->operand
[start
].n_alternatives
)
835 error_with_line (d
->lineno
,
836 "wrong number of alternatives in operand %d",
841 /* Record the insn's overall number of alternatives. */
842 d
->n_alternatives
= n
;
845 /* Verify that there are no gaps in operand numbers for INSNs. */
848 validate_insn_operands (struct data
*d
)
852 for (i
= 0; i
< d
->n_operands
; ++i
)
853 if (d
->operand
[i
].seen
== 0)
854 error_with_line (d
->lineno
, "missing operand %d", i
);
858 validate_optab_operands (struct data
*d
)
860 if (!d
->name
|| d
->name
[0] == '\0' || d
->name
[0] == '*')
863 /* Miscellaneous tests. */
864 if (strncmp (d
->name
, "cstore", 6) == 0
865 && d
->name
[strlen (d
->name
) - 1] == '4'
866 && d
->operand
[0].mode
== VOIDmode
)
868 message_with_line (d
->lineno
, "missing mode for operand 0 of cstore");
873 /* Look at a define_insn just read. Assign its code number. Record
874 on idata the template and the number of arguments. If the insn has
875 a hairy output action, output a function for now. */
878 gen_insn (rtx insn
, int lineno
)
880 struct pattern_stats stats
;
881 struct data
*d
= XNEW (struct data
);
884 d
->code_number
= next_code_number
;
885 d
->index_number
= next_index_number
;
886 d
->filename
= read_md_filename
;
888 if (XSTR (insn
, 0)[0])
889 d
->name
= XSTR (insn
, 0);
893 /* Build up the list in the same order as the insns are seen
894 in the machine description. */
897 idata_end
= &d
->next
;
899 memset (d
->operand
, 0, sizeof (d
->operand
));
901 for (i
= 0; i
< XVECLEN (insn
, 1); i
++)
902 scan_operands (d
, XVECEXP (insn
, 1, i
), 0, 0);
904 get_pattern_stats (&stats
, XVEC (insn
, 1));
905 d
->n_generator_args
= stats
.num_generator_args
;
906 d
->n_operands
= stats
.num_insn_operands
;
907 d
->n_dups
= stats
.num_dups
;
909 #ifndef USE_MD_CONSTRAINTS
910 check_constraint_len ();
912 validate_insn_operands (d
);
913 validate_insn_alternatives (d
);
914 validate_optab_operands (d
);
916 process_template (d
, XTMPL (insn
, 3));
919 /* Look at a define_peephole just read. Assign its code number.
920 Record on idata the template and the number of arguments.
921 If the insn has a hairy output action, output it now. */
924 gen_peephole (rtx peep
, int lineno
)
926 struct pattern_stats stats
;
927 struct data
*d
= XNEW (struct data
);
930 d
->code_number
= next_code_number
;
931 d
->index_number
= next_index_number
;
932 d
->filename
= read_md_filename
;
936 /* Build up the list in the same order as the insns are seen
937 in the machine description. */
940 idata_end
= &d
->next
;
942 memset (d
->operand
, 0, sizeof (d
->operand
));
944 /* Get the number of operands by scanning all the patterns of the
945 peephole optimizer. But ignore all the rest of the information
947 for (i
= 0; i
< XVECLEN (peep
, 0); i
++)
948 scan_operands (d
, XVECEXP (peep
, 0, i
), 0, 0);
950 get_pattern_stats (&stats
, XVEC (peep
, 0));
951 d
->n_generator_args
= 0;
952 d
->n_operands
= stats
.num_insn_operands
;
955 validate_insn_alternatives (d
);
957 process_template (d
, XTMPL (peep
, 2));
960 /* Process a define_expand just read. Assign its code number,
961 only for the purposes of `insn_gen_function'. */
964 gen_expand (rtx insn
, int lineno
)
966 struct pattern_stats stats
;
967 struct data
*d
= XNEW (struct data
);
970 d
->code_number
= next_code_number
;
971 d
->index_number
= next_index_number
;
972 d
->filename
= read_md_filename
;
974 if (XSTR (insn
, 0)[0])
975 d
->name
= XSTR (insn
, 0);
979 /* Build up the list in the same order as the insns are seen
980 in the machine description. */
983 idata_end
= &d
->next
;
985 memset (d
->operand
, 0, sizeof (d
->operand
));
987 /* Scan the operands to get the specified predicates and modes,
988 since expand_binop needs to know them. */
991 for (i
= 0; i
< XVECLEN (insn
, 1); i
++)
992 scan_operands (d
, XVECEXP (insn
, 1, i
), 0, 0);
994 get_pattern_stats (&stats
, XVEC (insn
, 1));
995 d
->n_generator_args
= stats
.num_generator_args
;
996 d
->n_operands
= stats
.num_insn_operands
;
997 d
->n_dups
= stats
.num_dups
;
998 d
->template_code
= 0;
999 d
->output_format
= INSN_OUTPUT_FORMAT_NONE
;
1001 validate_insn_alternatives (d
);
1002 validate_optab_operands (d
);
1006 /* Process a define_split just read. Assign its code number,
1007 only for reasons of consistency and to simplify genrecog. */
1010 gen_split (rtx split
, int lineno
)
1012 struct pattern_stats stats
;
1013 struct data
*d
= XNEW (struct data
);
1016 d
->code_number
= next_code_number
;
1017 d
->index_number
= next_index_number
;
1018 d
->filename
= read_md_filename
;
1022 /* Build up the list in the same order as the insns are seen
1023 in the machine description. */
1026 idata_end
= &d
->next
;
1028 memset (d
->operand
, 0, sizeof (d
->operand
));
1030 /* Get the number of operands by scanning all the patterns of the
1031 split patterns. But ignore all the rest of the information thus
1033 for (i
= 0; i
< XVECLEN (split
, 0); i
++)
1034 scan_operands (d
, XVECEXP (split
, 0, i
), 0, 0);
1036 get_pattern_stats (&stats
, XVEC (split
, 0));
1037 d
->n_generator_args
= 0;
1038 d
->n_operands
= stats
.num_insn_operands
;
1040 d
->n_alternatives
= 0;
1041 d
->template_code
= 0;
1042 d
->output_format
= INSN_OUTPUT_FORMAT_NONE
;
1048 init_insn_for_nothing (void)
1050 memset (¬hing
, 0, sizeof (nothing
));
1051 nothing
.name
= "*placeholder_for_nothing";
1052 nothing
.filename
= "<internal>";
1055 extern int main (int, char **);
1058 main (int argc
, char **argv
)
1062 progname
= "genoutput";
1064 init_insn_for_nothing ();
1066 if (!init_rtx_reader_args (argc
, argv
))
1067 return (FATAL_EXIT_CODE
);
1070 next_index_number
= 0;
1072 /* Read the machine description. */
1078 desc
= read_md_rtx (&line_no
, &next_code_number
);
1082 switch (GET_CODE (desc
))
1085 gen_insn (desc
, line_no
);
1088 case DEFINE_PEEPHOLE
:
1089 gen_peephole (desc
, line_no
);
1093 gen_expand (desc
, line_no
);
1097 case DEFINE_PEEPHOLE2
:
1098 gen_split (desc
, line_no
);
1101 #ifdef USE_MD_CONSTRAINTS
1102 case DEFINE_CONSTRAINT
:
1103 case DEFINE_REGISTER_CONSTRAINT
:
1104 case DEFINE_ADDRESS_CONSTRAINT
:
1105 case DEFINE_MEMORY_CONSTRAINT
:
1106 note_constraint (desc
, line_no
);
1113 next_index_number
++;
1117 output_operand_data ();
1118 output_insn_data ();
1119 output_get_insn_name ();
1122 return (ferror (stdout
) != 0 || have_error
1123 ? FATAL_EXIT_CODE
: SUCCESS_EXIT_CODE
);
1126 /* Return the number of occurrences of character C in string S or
1127 -1 if S is the null string. */
1130 n_occurrences (int c
, const char *s
)
1134 if (s
== 0 || *s
== '\0')
1143 /* Remove whitespace in `s' by moving up characters until the end.
1144 Return a new string. */
1147 strip_whitespace (const char *s
)
1155 p
= q
= XNEWVEC (char, strlen (s
) + 1);
1156 while ((ch
= *s
++) != '\0')
1164 #ifdef USE_MD_CONSTRAINTS
1166 /* Record just enough information about a constraint to allow checking
1167 of operand constraint strings above, in validate_insn_alternatives.
1168 Does not validate most properties of the constraint itself; does
1169 enforce no duplicate names, no overlap with MI constraints, and no
1170 prefixes. EXP is the define_*constraint form, LINENO the line number
1171 reported by the reader. */
1173 note_constraint (rtx exp
, int lineno
)
1175 const char *name
= XSTR (exp
, 0);
1176 unsigned int namelen
= strlen (name
);
1177 struct constraint_data
**iter
, **slot
, *new_cdata
;
1179 /* The 'm' constraint is special here since that constraint letter
1180 can be overridden by the back end by defining the
1181 TARGET_MEM_CONSTRAINT macro. */
1182 if (strchr (indep_constraints
, name
[0]) && name
[0] != 'm')
1184 if (name
[1] == '\0')
1185 error_with_line (lineno
, "constraint letter '%s' cannot be "
1186 "redefined by the machine description", name
);
1188 error_with_line (lineno
, "constraint name '%s' cannot be defined by "
1189 "the machine description, as it begins with '%c'",
1194 slot
= &constraints_by_letter_table
[(unsigned int)name
[0]];
1195 for (iter
= slot
; *iter
; iter
= &(*iter
)->next_this_letter
)
1197 /* This causes slot to end up pointing to the
1198 next_this_letter field of the last constraint with a name
1199 of equal or greater length than the new constraint; hence
1200 the new constraint will be inserted after all previous
1201 constraints with names of the same length. */
1202 if ((*iter
)->namelen
>= namelen
)
1205 if (!strcmp ((*iter
)->name
, name
))
1207 error_with_line (lineno
, "redefinition of constraint '%s'", name
);
1208 message_with_line ((*iter
)->lineno
, "previous definition is here");
1211 else if (!strncmp ((*iter
)->name
, name
, (*iter
)->namelen
))
1213 error_with_line (lineno
, "defining constraint '%s' here", name
);
1214 message_with_line ((*iter
)->lineno
, "renders constraint '%s' "
1215 "(defined here) a prefix", (*iter
)->name
);
1218 else if (!strncmp ((*iter
)->name
, name
, namelen
))
1220 error_with_line (lineno
, "constraint '%s' is a prefix", name
);
1221 message_with_line ((*iter
)->lineno
, "of constraint '%s' "
1222 "(defined here)", (*iter
)->name
);
1226 new_cdata
= XNEWVAR (struct constraint_data
, sizeof (struct constraint_data
) + namelen
);
1227 strcpy (CONST_CAST (char *, new_cdata
->name
), name
);
1228 new_cdata
->namelen
= namelen
;
1229 new_cdata
->lineno
= lineno
;
1230 new_cdata
->next_this_letter
= *slot
;
1234 /* Return the length of the constraint name beginning at position S
1235 of an operand constraint string, or issue an error message if there
1236 is no such constraint. Does not expect to be called for generic
1239 mdep_constraint_len (const char *s
, int lineno
, int opno
)
1241 struct constraint_data
*p
;
1243 p
= constraints_by_letter_table
[(unsigned int)s
[0]];
1246 for (; p
; p
= p
->next_this_letter
)
1247 if (!strncmp (s
, p
->name
, p
->namelen
))
1250 error_with_line (lineno
,
1251 "error: undefined machine-specific constraint "
1252 "at this point: \"%s\"", s
);
1253 message_with_line (lineno
, "note: in operand %d", opno
);
1254 return 1; /* safe */
1258 /* Verify that DEFAULT_CONSTRAINT_LEN is used properly and not
1259 tampered with. This isn't bullet-proof, but it should catch
1260 most genuine mistakes. */
1262 check_constraint_len (void)
1267 for (p
= ",#*+=&%!1234567890"; *p
; p
++)
1268 for (d
= -9; d
< 9; d
++)
1269 gcc_assert (constraint_len (p
, d
) == d
);
1273 constraint_len (const char *p
, int genoutput_default_constraint_len
)
1275 /* Check that we still match defaults.h . First we do a generation-time
1276 check that fails if the value is not the expected one... */
1277 gcc_assert (DEFAULT_CONSTRAINT_LEN (*p
, p
) == 1);
1278 /* And now a compile-time check that should give a diagnostic if the
1279 definition doesn't exactly match. */
1280 #define DEFAULT_CONSTRAINT_LEN(C,STR) 1
1281 /* Now re-define DEFAULT_CONSTRAINT_LEN so that we can verify it is
1283 #undef DEFAULT_CONSTRAINT_LEN
1284 #define DEFAULT_CONSTRAINT_LEN(C,STR) \
1285 ((C) != *p || STR != p ? -1 : genoutput_default_constraint_len)
1286 return CONSTRAINT_LEN (*p
, p
);
1287 /* And set it back. */
1288 #undef DEFAULT_CONSTRAINT_LEN
1289 #define DEFAULT_CONSTRAINT_LEN(C,STR) 1