1 /* Generate code from to output assembler insns as recognized from rtl.
2 Copyright (C) 1987-2014 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 char general_mem
[] = { TARGET_MEM_CONSTRAINT
, 0 };
103 static int n_occurrences (int, const char *);
104 static const char *strip_whitespace (const char *);
106 /* insns in the machine description are assigned sequential code numbers
107 that are used by insn-recog.c (produced by genrecog) to communicate
108 to insn-output.c (produced by this program). */
110 static int next_code_number
;
112 /* This counts all definitions in the md file,
113 for the sake of error messages. */
115 static int next_index_number
;
117 /* This counts all operands used in the md file. The first is null. */
119 static int next_operand_number
= 1;
121 /* Record in this chain all information about the operands we will output. */
125 struct operand_data
*next
;
127 const char *predicate
;
128 const char *constraint
;
129 enum machine_mode mode
;
130 unsigned char n_alternatives
;
137 /* Begin with a null operand at index 0. */
139 static struct operand_data null_operand
=
141 0, 0, "", "", VOIDmode
, 0, 0, 0, 0, 0
144 static struct operand_data
*odata
= &null_operand
;
145 static struct operand_data
**odata_end
= &null_operand
.next
;
147 /* Must match the constants in recog.h. */
149 #define INSN_OUTPUT_FORMAT_NONE 0 /* abort */
150 #define INSN_OUTPUT_FORMAT_SINGLE 1 /* const char * */
151 #define INSN_OUTPUT_FORMAT_MULTI 2 /* const char * const * */
152 #define INSN_OUTPUT_FORMAT_FUNCTION 3 /* const char * (*)(...) */
154 /* Record in this chain all information that we will output,
155 associated with the code number of the insn. */
161 const char *template_code
;
164 const char *filename
;
166 int n_generator_args
; /* Number of arguments passed to generator */
167 int n_operands
; /* Number of operands this insn recognizes */
168 int n_dups
; /* Number times match_dup appears in pattern */
169 int n_alternatives
; /* Number of alternatives in each constraint */
170 int operand_number
; /* Operand index in the big array. */
171 int output_format
; /* INSN_OUTPUT_FORMAT_*. */
172 struct operand_data operand
[MAX_MAX_OPERANDS
];
175 /* A dummy insn, for CODE_FOR_nothing. */
176 static struct data nothing
;
178 /* This variable points to the first link in the insn chain. */
179 static struct data
*idata
= ¬hing
;
181 /* This variable points to the end of the insn chain. This is where
182 everything relevant from the machien description is appended to. */
183 static struct data
**idata_end
= ¬hing
.next
;
186 static void output_prologue (void);
187 static void output_operand_data (void);
188 static void output_insn_data (void);
189 static void output_get_insn_name (void);
190 static void scan_operands (struct data
*, rtx
, int, int);
191 static int compare_operands (struct operand_data
*,
192 struct operand_data
*);
193 static void place_operands (struct data
*);
194 static void process_template (struct data
*, const char *);
195 static void validate_insn_alternatives (struct data
*);
196 static void validate_insn_operands (struct data
*);
197 static void gen_insn (rtx
, int);
198 static void gen_peephole (rtx
, int);
199 static void gen_expand (rtx
, int);
200 static void gen_split (rtx
, int);
202 struct constraint_data
204 struct constraint_data
*next_this_letter
;
206 unsigned int namelen
;
210 /* All machine-independent constraint characters (except digits) that
211 are handled outside the define*_constraint mechanism. */
212 static const char indep_constraints
[] = ",=+%*?!#&g";
214 static struct constraint_data
*
215 constraints_by_letter_table
[1 << CHAR_BIT
];
217 static int mdep_constraint_len (const char *, int, int);
218 static void note_constraint (rtx
, int);
221 output_prologue (void)
223 printf ("/* Generated automatically by the program `genoutput'\n\
224 from the machine description file `md'. */\n\n");
226 printf ("#include \"config.h\"\n");
227 printf ("#include \"system.h\"\n");
228 printf ("#include \"coretypes.h\"\n");
229 printf ("#include \"tm.h\"\n");
230 printf ("#include \"flags.h\"\n");
231 printf ("#include \"ggc.h\"\n");
232 printf ("#include \"tree.h\"\n");
233 printf ("#include \"varasm.h\"\n");
234 printf ("#include \"stor-layout.h\"\n");
235 printf ("#include \"calls.h\"\n");
236 printf ("#include \"rtl.h\"\n");
237 printf ("#include \"expr.h\"\n");
238 printf ("#include \"insn-codes.h\"\n");
239 printf ("#include \"tm_p.h\"\n");
240 printf ("#include \"function.h\"\n");
241 printf ("#include \"regs.h\"\n");
242 printf ("#include \"hard-reg-set.h\"\n");
243 printf ("#include \"insn-config.h\"\n\n");
244 printf ("#include \"conditions.h\"\n");
245 printf ("#include \"insn-attr.h\"\n\n");
246 printf ("#include \"recog.h\"\n\n");
247 printf ("#include \"diagnostic-core.h\"\n");
248 printf ("#include \"output.h\"\n");
249 printf ("#include \"target.h\"\n");
250 printf ("#include \"tm-constrs.h\"\n");
254 output_operand_data (void)
256 struct operand_data
*d
;
258 printf ("\nstatic const struct insn_operand_data operand_data[] = \n{\n");
260 for (d
= odata
; d
; d
= d
->next
)
262 struct pred_data
*pred
;
267 d
->predicate
&& d
->predicate
[0] ? d
->predicate
: "0");
269 printf (" \"%s\",\n", d
->constraint
? d
->constraint
: "");
271 printf (" %smode,\n", GET_MODE_NAME (d
->mode
));
273 printf (" %d,\n", d
->strict_low
);
275 printf (" %d,\n", d
->constraint
== NULL
? 1 : 0);
277 printf (" %d,\n", d
->eliminable
);
281 pred
= lookup_predicate (d
->predicate
);
282 printf (" %d\n", pred
&& pred
->codes
[MEM
]);
290 output_insn_data (void)
294 int next_name_offset
;
295 const char * last_name
= 0;
296 const char * next_name
= 0;
299 for (n
= idata
, next_name_offset
= 1; n
; n
= n
->next
, next_name_offset
++)
306 printf ("#if GCC_VERSION >= 2007\n__extension__\n#endif\n");
307 printf ("\nconst struct insn_data_d insn_data[] = \n{\n");
309 for (d
= idata
; d
; d
= d
->next
)
311 printf (" /* %s:%d */\n", d
->filename
, d
->lineno
);
316 printf (" \"%s\",\n", d
->name
);
320 for (n
= d
->next
, next_name_offset
= 1; n
;
321 n
= n
->next
, next_name_offset
++)
333 if (next_name
&& (last_name
== 0
334 || name_offset
> next_name_offset
/ 2))
335 printf (" \"%s-%d\",\n", next_name
,
336 next_name_offset
- name_offset
);
338 printf (" \"%s+%d\",\n", last_name
, name_offset
);
341 switch (d
->output_format
)
343 case INSN_OUTPUT_FORMAT_NONE
:
344 printf ("#if HAVE_DESIGNATED_UNION_INITIALIZERS\n");
345 printf (" { 0 },\n");
347 printf (" { 0, 0, 0 },\n");
350 case INSN_OUTPUT_FORMAT_SINGLE
:
352 const char *p
= d
->template_code
;
355 printf ("#if HAVE_DESIGNATED_UNION_INITIALIZERS\n");
356 printf (" { .single =\n");
363 if (IS_VSPACE (*p
) && prev
!= '\\')
365 /* Preserve two consecutive \n's or \r's, but treat \r\n
366 as a single newline. */
367 if (*p
== '\n' && prev
!= '\r')
376 printf ("#if HAVE_DESIGNATED_UNION_INITIALIZERS\n");
379 printf (" 0, 0 },\n");
383 case INSN_OUTPUT_FORMAT_MULTI
:
384 printf ("#if HAVE_DESIGNATED_UNION_INITIALIZERS\n");
385 printf (" { .multi = output_%d },\n", d
->code_number
);
387 printf (" { 0, output_%d, 0 },\n", d
->code_number
);
390 case INSN_OUTPUT_FORMAT_FUNCTION
:
391 printf ("#if HAVE_DESIGNATED_UNION_INITIALIZERS\n");
392 printf (" { .function = output_%d },\n", d
->code_number
);
394 printf (" { 0, 0, output_%d },\n", d
->code_number
);
401 if (d
->name
&& d
->name
[0] != '*')
402 printf (" { (insn_gen_fn::stored_funcptr) gen_%s },\n", d
->name
);
404 printf (" { 0 },\n");
406 printf (" &operand_data[%d],\n", d
->operand_number
);
407 printf (" %d,\n", d
->n_generator_args
);
408 printf (" %d,\n", d
->n_operands
);
409 printf (" %d,\n", d
->n_dups
);
410 printf (" %d,\n", d
->n_alternatives
);
411 printf (" %d\n", d
->output_format
);
419 output_get_insn_name (void)
421 printf ("const char *\n");
422 printf ("get_insn_name (int code)\n");
424 printf (" if (code == NOOP_MOVE_INSN_CODE)\n");
425 printf (" return \"NOOP_MOVE\";\n");
427 printf (" return insn_data[code].name;\n");
432 /* Stores the operand data into `d->operand[i]'.
434 THIS_ADDRESS_P is nonzero if the containing rtx was an ADDRESS.
435 THIS_STRICT_LOW is nonzero if the containing rtx was a STRICT_LOW_PART. */
438 scan_operands (struct data
*d
, rtx part
, int this_address_p
,
442 const char *format_ptr
;
448 switch (GET_CODE (part
))
451 opno
= XINT (part
, 0);
452 if (opno
>= MAX_MAX_OPERANDS
)
454 error_with_line (d
->lineno
, "maximum number of operands exceeded");
457 if (d
->operand
[opno
].seen
)
458 error_with_line (d
->lineno
, "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);
473 if (opno
>= MAX_MAX_OPERANDS
)
475 error_with_line (d
->lineno
, "maximum number of operands exceeded");
478 if (d
->operand
[opno
].seen
)
479 error_with_line (d
->lineno
, "repeated operand number %d\n", opno
);
481 d
->operand
[opno
].seen
= 1;
482 d
->operand
[opno
].mode
= GET_MODE (part
);
483 d
->operand
[opno
].strict_low
= 0;
484 d
->operand
[opno
].predicate
= "scratch_operand";
485 d
->operand
[opno
].constraint
= strip_whitespace (XSTR (part
, 1));
486 d
->operand
[opno
].n_alternatives
487 = n_occurrences (',', d
->operand
[opno
].constraint
) + 1;
488 d
->operand
[opno
].address_p
= 0;
489 d
->operand
[opno
].eliminable
= 0;
494 opno
= XINT (part
, 0);
495 if (opno
>= MAX_MAX_OPERANDS
)
497 error_with_line (d
->lineno
, "maximum number of operands exceeded");
500 if (d
->operand
[opno
].seen
)
501 error_with_line (d
->lineno
, "repeated operand number %d\n", opno
);
503 d
->operand
[opno
].seen
= 1;
504 d
->operand
[opno
].mode
= GET_MODE (part
);
505 d
->operand
[opno
].strict_low
= 0;
506 d
->operand
[opno
].predicate
= XSTR (part
, 1);
507 d
->operand
[opno
].constraint
= 0;
508 d
->operand
[opno
].address_p
= 0;
509 d
->operand
[opno
].eliminable
= 0;
510 for (i
= 0; i
< XVECLEN (part
, 2); i
++)
511 scan_operands (d
, XVECEXP (part
, 2, i
), 0, 0);
514 case STRICT_LOW_PART
:
515 scan_operands (d
, XEXP (part
, 0), 0, 1);
522 format_ptr
= GET_RTX_FORMAT (GET_CODE (part
));
524 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (part
)); i
++)
525 switch (*format_ptr
++)
529 scan_operands (d
, XEXP (part
, i
), 0, 0);
532 if (XVEC (part
, i
) != NULL
)
533 for (j
= 0; j
< XVECLEN (part
, i
); j
++)
534 scan_operands (d
, XVECEXP (part
, i
, j
), 0, 0);
539 /* Compare two operands for content equality. */
542 compare_operands (struct operand_data
*d0
, struct operand_data
*d1
)
552 if (strcmp (p0
, p1
) != 0)
561 if (strcmp (p0
, p1
) != 0)
564 if (d0
->mode
!= d1
->mode
)
567 if (d0
->strict_low
!= d1
->strict_low
)
570 if (d0
->eliminable
!= d1
->eliminable
)
576 /* Scan the list of operands we've already committed to output and either
577 find a subsequence that is the same, or allocate a new one at the end. */
580 place_operands (struct data
*d
)
582 struct operand_data
*od
, *od2
;
585 if (d
->n_operands
== 0)
587 d
->operand_number
= 0;
591 /* Brute force substring search. */
592 for (od
= odata
, i
= 0; od
; od
= od
->next
, i
= 0)
593 if (compare_operands (od
, &d
->operand
[0]))
599 if (i
== d
->n_operands
)
603 if (! compare_operands (od2
, &d
->operand
[i
]))
605 ++i
, od2
= od2
->next
;
609 /* Either partial match at the end of the list, or no match. In either
610 case, we tack on what operands are remaining to the end of the list. */
612 d
->operand_number
= next_operand_number
- i
;
613 for (; i
< d
->n_operands
; ++i
)
615 od2
= &d
->operand
[i
];
617 odata_end
= &od2
->next
;
618 od2
->index
= next_operand_number
++;
624 d
->operand_number
= od
->index
;
629 /* Process an assembler template from a define_insn or a define_peephole.
630 It is either the assembler code template, a list of assembler code
631 templates, or C code to generate the assembler code template. */
634 process_template (struct data
*d
, const char *template_code
)
639 /* Templates starting with * contain straight code to be run. */
640 if (template_code
[0] == '*')
642 d
->template_code
= 0;
643 d
->output_format
= INSN_OUTPUT_FORMAT_FUNCTION
;
645 puts ("\nstatic const char *");
646 printf ("output_%d (rtx *operands ATTRIBUTE_UNUSED, rtx_insn *insn ATTRIBUTE_UNUSED)\n",
649 print_md_ptr_loc (template_code
);
650 puts (template_code
+ 1);
654 /* If the assembler code template starts with a @ it is a newline-separated
655 list of assembler code templates, one for each alternative. */
656 else if (template_code
[0] == '@')
660 for (cp
= &template_code
[1]; *cp
; )
662 while (ISSPACE (*cp
))
666 while (!IS_VSPACE (*cp
) && *cp
!= '\0')
669 d
->template_code
= 0;
672 d
->output_format
= INSN_OUTPUT_FORMAT_FUNCTION
;
673 puts ("\nstatic const char *");
674 printf ("output_%d (rtx *operands ATTRIBUTE_UNUSED, "
675 "rtx_insn *insn ATTRIBUTE_UNUSED)\n", d
->code_number
);
677 puts (" switch (which_alternative)\n {");
681 d
->output_format
= INSN_OUTPUT_FORMAT_MULTI
;
682 printf ("\nstatic const char * const output_%d[] = {\n",
686 for (i
= 0, cp
= &template_code
[1]; *cp
; )
688 const char *ep
, *sp
, *bp
;
690 while (ISSPACE (*cp
))
696 printf (" case %d:", i
);
703 printf (" return \"");
708 for (ep
= sp
= cp
; !IS_VSPACE (*ep
) && *ep
!= '\0'; ++ep
)
713 message_with_line (d
->lineno
,
714 "trailing whitespace in output template");
728 /* The usual action will end with a return.
729 If there is neither break or return at the end, this is
730 assumed to be intentional; this allows to have multiple
731 consecutive alternatives share some code. */
737 message_with_line (d
->lineno
,
738 "'@' is redundant for output template with single alternative");
739 if (i
!= d
->n_alternatives
)
740 error_with_line (d
->lineno
,
741 "wrong number of alternatives in the output template");
744 puts (" default: gcc_unreachable ();\n }\n}");
750 d
->template_code
= template_code
;
751 d
->output_format
= INSN_OUTPUT_FORMAT_SINGLE
;
755 /* Check insn D for consistency in number of constraint alternatives. */
758 validate_insn_alternatives (struct data
*d
)
762 /* Make sure all the operands have the same number of alternatives
763 in their constraints. Let N be that number. */
764 for (start
= 0; start
< d
->n_operands
; start
++)
765 if (d
->operand
[start
].n_alternatives
> 0)
770 int which_alternative
= 0;
771 int alternative_count_unsure
= 0;
772 bool seen_write
= false;
774 for (p
= d
->operand
[start
].constraint
; (c
= *p
); p
+= len
)
776 if ((c
== '%' || c
== '=' || c
== '+')
777 && p
!= d
->operand
[start
].constraint
)
778 error_with_line (d
->lineno
,
779 "character '%c' can only be used at the"
780 " beginning of a constraint string", c
);
782 if (c
== '=' || c
== '+')
785 /* Earlyclobber operands must always be marked write-only
787 if (!seen_write
&& c
== '&')
788 error_with_line (d
->lineno
,
789 "earlyclobber operands may not be"
790 " read-only in alternative %d",
793 if (ISSPACE (c
) || strchr (indep_constraints
, c
))
795 else if (ISDIGIT (c
))
800 while (ISDIGIT (*q
));
804 len
= mdep_constraint_len (p
, d
->lineno
, start
);
812 for (i
= 1; i
< len
; i
++)
815 error_with_line (d
->lineno
,
816 "NUL in alternative %d of operand %d",
817 which_alternative
, start
);
818 alternative_count_unsure
= 1;
821 else if (strchr (",#*", p
[i
]))
823 error_with_line (d
->lineno
,
824 "'%c' in alternative %d of operand %d",
825 p
[i
], which_alternative
, start
);
826 alternative_count_unsure
= 1;
829 if (!alternative_count_unsure
)
832 n
= d
->operand
[start
].n_alternatives
;
833 else if (n
!= d
->operand
[start
].n_alternatives
)
834 error_with_line (d
->lineno
,
835 "wrong number of alternatives in operand %d",
840 /* Record the insn's overall number of alternatives. */
841 d
->n_alternatives
= n
;
844 /* Verify that there are no gaps in operand numbers for INSNs. */
847 validate_insn_operands (struct data
*d
)
851 for (i
= 0; i
< d
->n_operands
; ++i
)
852 if (d
->operand
[i
].seen
== 0)
853 error_with_line (d
->lineno
, "missing operand %d", i
);
857 validate_optab_operands (struct data
*d
)
859 if (!d
->name
|| d
->name
[0] == '\0' || d
->name
[0] == '*')
862 /* Miscellaneous tests. */
863 if (strncmp (d
->name
, "cstore", 6) == 0
864 && d
->name
[strlen (d
->name
) - 1] == '4'
865 && d
->operand
[0].mode
== VOIDmode
)
867 message_with_line (d
->lineno
, "missing mode for operand 0 of cstore");
872 /* Look at a define_insn just read. Assign its code number. Record
873 on idata the template and the number of arguments. If the insn has
874 a hairy output action, output a function for now. */
877 gen_insn (rtx insn
, int lineno
)
879 struct pattern_stats stats
;
880 struct data
*d
= XNEW (struct data
);
883 d
->code_number
= next_code_number
;
884 d
->index_number
= next_index_number
;
885 d
->filename
= read_md_filename
;
887 if (XSTR (insn
, 0)[0])
888 d
->name
= XSTR (insn
, 0);
892 /* Build up the list in the same order as the insns are seen
893 in the machine description. */
896 idata_end
= &d
->next
;
898 memset (d
->operand
, 0, sizeof (d
->operand
));
900 for (i
= 0; i
< XVECLEN (insn
, 1); i
++)
901 scan_operands (d
, XVECEXP (insn
, 1, i
), 0, 0);
903 get_pattern_stats (&stats
, XVEC (insn
, 1));
904 d
->n_generator_args
= stats
.num_generator_args
;
905 d
->n_operands
= stats
.num_insn_operands
;
906 d
->n_dups
= stats
.num_dups
;
908 validate_insn_operands (d
);
909 validate_insn_alternatives (d
);
910 validate_optab_operands (d
);
912 process_template (d
, XTMPL (insn
, 3));
915 /* Look at a define_peephole just read. Assign its code number.
916 Record on idata the template and the number of arguments.
917 If the insn has a hairy output action, output it now. */
920 gen_peephole (rtx peep
, int lineno
)
922 struct pattern_stats stats
;
923 struct data
*d
= XNEW (struct data
);
926 d
->code_number
= next_code_number
;
927 d
->index_number
= next_index_number
;
928 d
->filename
= read_md_filename
;
932 /* Build up the list in the same order as the insns are seen
933 in the machine description. */
936 idata_end
= &d
->next
;
938 memset (d
->operand
, 0, sizeof (d
->operand
));
940 /* Get the number of operands by scanning all the patterns of the
941 peephole optimizer. But ignore all the rest of the information
943 for (i
= 0; i
< XVECLEN (peep
, 0); i
++)
944 scan_operands (d
, XVECEXP (peep
, 0, i
), 0, 0);
946 get_pattern_stats (&stats
, XVEC (peep
, 0));
947 d
->n_generator_args
= 0;
948 d
->n_operands
= stats
.num_insn_operands
;
951 validate_insn_alternatives (d
);
953 process_template (d
, XTMPL (peep
, 2));
956 /* Process a define_expand just read. Assign its code number,
957 only for the purposes of `insn_gen_function'. */
960 gen_expand (rtx insn
, int lineno
)
962 struct pattern_stats stats
;
963 struct data
*d
= XNEW (struct data
);
966 d
->code_number
= next_code_number
;
967 d
->index_number
= next_index_number
;
968 d
->filename
= read_md_filename
;
970 if (XSTR (insn
, 0)[0])
971 d
->name
= XSTR (insn
, 0);
975 /* Build up the list in the same order as the insns are seen
976 in the machine description. */
979 idata_end
= &d
->next
;
981 memset (d
->operand
, 0, sizeof (d
->operand
));
983 /* Scan the operands to get the specified predicates and modes,
984 since expand_binop needs to know them. */
987 for (i
= 0; i
< XVECLEN (insn
, 1); i
++)
988 scan_operands (d
, XVECEXP (insn
, 1, i
), 0, 0);
990 get_pattern_stats (&stats
, XVEC (insn
, 1));
991 d
->n_generator_args
= stats
.num_generator_args
;
992 d
->n_operands
= stats
.num_insn_operands
;
993 d
->n_dups
= stats
.num_dups
;
994 d
->template_code
= 0;
995 d
->output_format
= INSN_OUTPUT_FORMAT_NONE
;
997 validate_insn_alternatives (d
);
998 validate_optab_operands (d
);
1002 /* Process a define_split just read. Assign its code number,
1003 only for reasons of consistency and to simplify genrecog. */
1006 gen_split (rtx split
, int lineno
)
1008 struct pattern_stats stats
;
1009 struct data
*d
= XNEW (struct data
);
1012 d
->code_number
= next_code_number
;
1013 d
->index_number
= next_index_number
;
1014 d
->filename
= read_md_filename
;
1018 /* Build up the list in the same order as the insns are seen
1019 in the machine description. */
1022 idata_end
= &d
->next
;
1024 memset (d
->operand
, 0, sizeof (d
->operand
));
1026 /* Get the number of operands by scanning all the patterns of the
1027 split patterns. But ignore all the rest of the information thus
1029 for (i
= 0; i
< XVECLEN (split
, 0); i
++)
1030 scan_operands (d
, XVECEXP (split
, 0, i
), 0, 0);
1032 get_pattern_stats (&stats
, XVEC (split
, 0));
1033 d
->n_generator_args
= 0;
1034 d
->n_operands
= stats
.num_insn_operands
;
1036 d
->n_alternatives
= 0;
1037 d
->template_code
= 0;
1038 d
->output_format
= INSN_OUTPUT_FORMAT_NONE
;
1044 init_insn_for_nothing (void)
1046 memset (¬hing
, 0, sizeof (nothing
));
1047 nothing
.name
= "*placeholder_for_nothing";
1048 nothing
.filename
= "<internal>";
1051 extern int main (int, char **);
1054 main (int argc
, char **argv
)
1058 progname
= "genoutput";
1060 init_insn_for_nothing ();
1062 if (!init_rtx_reader_args (argc
, argv
))
1063 return (FATAL_EXIT_CODE
);
1066 next_index_number
= 0;
1068 /* Read the machine description. */
1074 desc
= read_md_rtx (&line_no
, &next_code_number
);
1078 switch (GET_CODE (desc
))
1081 gen_insn (desc
, line_no
);
1084 case DEFINE_PEEPHOLE
:
1085 gen_peephole (desc
, line_no
);
1089 gen_expand (desc
, line_no
);
1093 case DEFINE_PEEPHOLE2
:
1094 gen_split (desc
, line_no
);
1097 case DEFINE_CONSTRAINT
:
1098 case DEFINE_REGISTER_CONSTRAINT
:
1099 case DEFINE_ADDRESS_CONSTRAINT
:
1100 case DEFINE_MEMORY_CONSTRAINT
:
1101 note_constraint (desc
, line_no
);
1107 next_index_number
++;
1111 output_operand_data ();
1112 output_insn_data ();
1113 output_get_insn_name ();
1116 return (ferror (stdout
) != 0 || have_error
1117 ? FATAL_EXIT_CODE
: SUCCESS_EXIT_CODE
);
1120 /* Return the number of occurrences of character C in string S or
1121 -1 if S is the null string. */
1124 n_occurrences (int c
, const char *s
)
1128 if (s
== 0 || *s
== '\0')
1137 /* Remove whitespace in `s' by moving up characters until the end.
1138 Return a new string. */
1141 strip_whitespace (const char *s
)
1149 p
= q
= XNEWVEC (char, strlen (s
) + 1);
1150 while ((ch
= *s
++) != '\0')
1158 /* Record just enough information about a constraint to allow checking
1159 of operand constraint strings above, in validate_insn_alternatives.
1160 Does not validate most properties of the constraint itself; does
1161 enforce no duplicate names, no overlap with MI constraints, and no
1162 prefixes. EXP is the define_*constraint form, LINENO the line number
1163 reported by the reader. */
1165 note_constraint (rtx exp
, int lineno
)
1167 const char *name
= XSTR (exp
, 0);
1168 struct constraint_data
**iter
, **slot
, *new_cdata
;
1170 if (strcmp (name
, "TARGET_MEM_CONSTRAINT") == 0)
1172 unsigned int namelen
= strlen (name
);
1174 if (strchr (indep_constraints
, name
[0]))
1176 if (name
[1] == '\0')
1177 error_with_line (lineno
, "constraint letter '%s' cannot be "
1178 "redefined by the machine description", name
);
1180 error_with_line (lineno
, "constraint name '%s' cannot be defined by "
1181 "the machine description, as it begins with '%c'",
1186 slot
= &constraints_by_letter_table
[(unsigned int)name
[0]];
1187 for (iter
= slot
; *iter
; iter
= &(*iter
)->next_this_letter
)
1189 /* This causes slot to end up pointing to the
1190 next_this_letter field of the last constraint with a name
1191 of equal or greater length than the new constraint; hence
1192 the new constraint will be inserted after all previous
1193 constraints with names of the same length. */
1194 if ((*iter
)->namelen
>= namelen
)
1197 if (!strcmp ((*iter
)->name
, name
))
1199 error_with_line (lineno
, "redefinition of constraint '%s'", name
);
1200 message_with_line ((*iter
)->lineno
, "previous definition is here");
1203 else if (!strncmp ((*iter
)->name
, name
, (*iter
)->namelen
))
1205 error_with_line (lineno
, "defining constraint '%s' here", name
);
1206 message_with_line ((*iter
)->lineno
, "renders constraint '%s' "
1207 "(defined here) a prefix", (*iter
)->name
);
1210 else if (!strncmp ((*iter
)->name
, name
, namelen
))
1212 error_with_line (lineno
, "constraint '%s' is a prefix", name
);
1213 message_with_line ((*iter
)->lineno
, "of constraint '%s' "
1214 "(defined here)", (*iter
)->name
);
1218 new_cdata
= XNEWVAR (struct constraint_data
, sizeof (struct constraint_data
) + namelen
);
1219 strcpy (CONST_CAST (char *, new_cdata
->name
), name
);
1220 new_cdata
->namelen
= namelen
;
1221 new_cdata
->lineno
= lineno
;
1222 new_cdata
->next_this_letter
= *slot
;
1226 /* Return the length of the constraint name beginning at position S
1227 of an operand constraint string, or issue an error message if there
1228 is no such constraint. Does not expect to be called for generic
1231 mdep_constraint_len (const char *s
, int lineno
, int opno
)
1233 struct constraint_data
*p
;
1235 p
= constraints_by_letter_table
[(unsigned int)s
[0]];
1238 for (; p
; p
= p
->next_this_letter
)
1239 if (!strncmp (s
, p
->name
, p
->namelen
))
1242 error_with_line (lineno
,
1243 "error: undefined machine-specific constraint "
1244 "at this point: \"%s\"", s
);
1245 message_with_line (lineno
, "note: in operand %d", opno
);
1246 return 1; /* safe */