1 /* Generate code from to output assembler insns as recognized from rtl.
2 Copyright (C) 1987-2015 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
;
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 \"backend.h\"\n");
230 printf ("#include \"predict.h\"\n");
231 printf ("#include \"tree.h\"\n");
232 printf ("#include \"rtl.h\"\n");
233 printf ("#include \"flags.h\"\n");
234 printf ("#include \"alias.h\"\n");
235 printf ("#include \"varasm.h\"\n");
236 printf ("#include \"stor-layout.h\"\n");
237 printf ("#include \"calls.h\"\n");
238 printf ("#include \"insn-config.h\"\n");
239 printf ("#include \"expmed.h\"\n");
240 printf ("#include \"dojump.h\"\n");
241 printf ("#include \"explow.h\"\n");
242 printf ("#include \"emit-rtl.h\"\n");
243 printf ("#include \"stmt.h\"\n");
244 printf ("#include \"expr.h\"\n");
245 printf ("#include \"insn-codes.h\"\n");
246 printf ("#include \"tm_p.h\"\n");
247 printf ("#include \"regs.h\"\n");
248 printf ("#include \"conditions.h\"\n");
249 printf ("#include \"insn-attr.h\"\n\n");
250 printf ("#include \"recog.h\"\n\n");
251 printf ("#include \"diagnostic-core.h\"\n");
252 printf ("#include \"output.h\"\n");
253 printf ("#include \"target.h\"\n");
254 printf ("#include \"tm-constrs.h\"\n");
258 output_operand_data (void)
260 struct operand_data
*d
;
262 printf ("\nstatic const struct insn_operand_data operand_data[] = \n{\n");
264 for (d
= odata
; d
; d
= d
->next
)
266 struct pred_data
*pred
;
271 d
->predicate
&& d
->predicate
[0] ? d
->predicate
: "0");
273 printf (" \"%s\",\n", d
->constraint
? d
->constraint
: "");
275 printf (" %smode,\n", GET_MODE_NAME (d
->mode
));
277 printf (" %d,\n", d
->strict_low
);
279 printf (" %d,\n", d
->constraint
== NULL
? 1 : 0);
281 printf (" %d,\n", d
->eliminable
);
285 pred
= lookup_predicate (d
->predicate
);
286 printf (" %d\n", pred
&& pred
->codes
[MEM
]);
294 output_insn_data (void)
298 int next_name_offset
;
299 const char * last_name
= 0;
300 const char * next_name
= 0;
303 for (n
= idata
, next_name_offset
= 1; n
; n
= n
->next
, next_name_offset
++)
310 printf ("#if GCC_VERSION >= 2007\n__extension__\n#endif\n");
311 printf ("\nconst struct insn_data_d insn_data[] = \n{\n");
313 for (d
= idata
; d
; d
= d
->next
)
315 printf (" /* %s:%d */\n", d
->filename
, d
->lineno
);
320 printf (" \"%s\",\n", d
->name
);
324 for (n
= d
->next
, next_name_offset
= 1; n
;
325 n
= n
->next
, next_name_offset
++)
337 if (next_name
&& (last_name
== 0
338 || name_offset
> next_name_offset
/ 2))
339 printf (" \"%s-%d\",\n", next_name
,
340 next_name_offset
- name_offset
);
342 printf (" \"%s+%d\",\n", last_name
, name_offset
);
345 switch (d
->output_format
)
347 case INSN_OUTPUT_FORMAT_NONE
:
348 printf ("#if HAVE_DESIGNATED_UNION_INITIALIZERS\n");
349 printf (" { 0 },\n");
351 printf (" { 0, 0, 0 },\n");
354 case INSN_OUTPUT_FORMAT_SINGLE
:
356 const char *p
= d
->template_code
;
359 printf ("#if HAVE_DESIGNATED_UNION_INITIALIZERS\n");
360 printf (" { .single =\n");
367 if (IS_VSPACE (*p
) && prev
!= '\\')
369 /* Preserve two consecutive \n's or \r's, but treat \r\n
370 as a single newline. */
371 if (*p
== '\n' && prev
!= '\r')
380 printf ("#if HAVE_DESIGNATED_UNION_INITIALIZERS\n");
383 printf (" 0, 0 },\n");
387 case INSN_OUTPUT_FORMAT_MULTI
:
388 printf ("#if HAVE_DESIGNATED_UNION_INITIALIZERS\n");
389 printf (" { .multi = output_%d },\n", d
->code_number
);
391 printf (" { 0, output_%d, 0 },\n", d
->code_number
);
394 case INSN_OUTPUT_FORMAT_FUNCTION
:
395 printf ("#if HAVE_DESIGNATED_UNION_INITIALIZERS\n");
396 printf (" { .function = output_%d },\n", d
->code_number
);
398 printf (" { 0, 0, output_%d },\n", d
->code_number
);
405 if (d
->name
&& d
->name
[0] != '*')
406 printf (" { (insn_gen_fn::stored_funcptr) gen_%s },\n", d
->name
);
408 printf (" { 0 },\n");
410 printf (" &operand_data[%d],\n", d
->operand_number
);
411 printf (" %d,\n", d
->n_generator_args
);
412 printf (" %d,\n", d
->n_operands
);
413 printf (" %d,\n", d
->n_dups
);
414 printf (" %d,\n", d
->n_alternatives
);
415 printf (" %d\n", d
->output_format
);
423 output_get_insn_name (void)
425 printf ("const char *\n");
426 printf ("get_insn_name (int code)\n");
428 printf (" if (code == NOOP_MOVE_INSN_CODE)\n");
429 printf (" return \"NOOP_MOVE\";\n");
431 printf (" return insn_data[code].name;\n");
436 /* Stores the operand data into `d->operand[i]'.
438 THIS_ADDRESS_P is nonzero if the containing rtx was an ADDRESS.
439 THIS_STRICT_LOW is nonzero if the containing rtx was a STRICT_LOW_PART. */
442 scan_operands (struct data
*d
, rtx part
, int this_address_p
,
446 const char *format_ptr
;
452 switch (GET_CODE (part
))
455 opno
= XINT (part
, 0);
456 if (opno
>= MAX_MAX_OPERANDS
)
458 error_with_line (d
->lineno
, "maximum number of operands exceeded");
461 if (d
->operand
[opno
].seen
)
462 error_with_line (d
->lineno
, "repeated operand number %d\n", opno
);
464 d
->operand
[opno
].seen
= 1;
465 d
->operand
[opno
].mode
= GET_MODE (part
);
466 d
->operand
[opno
].strict_low
= this_strict_low
;
467 d
->operand
[opno
].predicate
= XSTR (part
, 1);
468 d
->operand
[opno
].constraint
= strip_whitespace (XSTR (part
, 2));
469 d
->operand
[opno
].n_alternatives
470 = n_occurrences (',', d
->operand
[opno
].constraint
) + 1;
471 d
->operand
[opno
].address_p
= this_address_p
;
472 d
->operand
[opno
].eliminable
= 1;
476 opno
= XINT (part
, 0);
477 if (opno
>= MAX_MAX_OPERANDS
)
479 error_with_line (d
->lineno
, "maximum number of operands exceeded");
482 if (d
->operand
[opno
].seen
)
483 error_with_line (d
->lineno
, "repeated operand number %d\n", opno
);
485 d
->operand
[opno
].seen
= 1;
486 d
->operand
[opno
].mode
= GET_MODE (part
);
487 d
->operand
[opno
].strict_low
= 0;
488 d
->operand
[opno
].predicate
= "scratch_operand";
489 d
->operand
[opno
].constraint
= strip_whitespace (XSTR (part
, 1));
490 d
->operand
[opno
].n_alternatives
491 = n_occurrences (',', d
->operand
[opno
].constraint
) + 1;
492 d
->operand
[opno
].address_p
= 0;
493 d
->operand
[opno
].eliminable
= 0;
498 opno
= XINT (part
, 0);
499 if (opno
>= MAX_MAX_OPERANDS
)
501 error_with_line (d
->lineno
, "maximum number of operands exceeded");
504 if (d
->operand
[opno
].seen
)
505 error_with_line (d
->lineno
, "repeated operand number %d\n", opno
);
507 d
->operand
[opno
].seen
= 1;
508 d
->operand
[opno
].mode
= GET_MODE (part
);
509 d
->operand
[opno
].strict_low
= 0;
510 d
->operand
[opno
].predicate
= XSTR (part
, 1);
511 d
->operand
[opno
].constraint
= 0;
512 d
->operand
[opno
].address_p
= 0;
513 d
->operand
[opno
].eliminable
= 0;
514 for (i
= 0; i
< XVECLEN (part
, 2); i
++)
515 scan_operands (d
, XVECEXP (part
, 2, i
), 0, 0);
518 case STRICT_LOW_PART
:
519 scan_operands (d
, XEXP (part
, 0), 0, 1);
526 format_ptr
= GET_RTX_FORMAT (GET_CODE (part
));
528 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (part
)); i
++)
529 switch (*format_ptr
++)
533 scan_operands (d
, XEXP (part
, i
), 0, 0);
536 if (XVEC (part
, i
) != NULL
)
537 for (j
= 0; j
< XVECLEN (part
, i
); j
++)
538 scan_operands (d
, XVECEXP (part
, i
, j
), 0, 0);
543 /* Compare two operands for content equality. */
546 compare_operands (struct operand_data
*d0
, struct operand_data
*d1
)
556 if (strcmp (p0
, p1
) != 0)
565 if (strcmp (p0
, p1
) != 0)
568 if (d0
->mode
!= d1
->mode
)
571 if (d0
->strict_low
!= d1
->strict_low
)
574 if (d0
->eliminable
!= d1
->eliminable
)
580 /* Scan the list of operands we've already committed to output and either
581 find a subsequence that is the same, or allocate a new one at the end. */
584 place_operands (struct data
*d
)
586 struct operand_data
*od
, *od2
;
589 if (d
->n_operands
== 0)
591 d
->operand_number
= 0;
595 /* Brute force substring search. */
596 for (od
= odata
, i
= 0; od
; od
= od
->next
, i
= 0)
597 if (compare_operands (od
, &d
->operand
[0]))
603 if (i
== d
->n_operands
)
607 if (! compare_operands (od2
, &d
->operand
[i
]))
609 ++i
, od2
= od2
->next
;
613 /* Either partial match at the end of the list, or no match. In either
614 case, we tack on what operands are remaining to the end of the list. */
616 d
->operand_number
= next_operand_number
- i
;
617 for (; i
< d
->n_operands
; ++i
)
619 od2
= &d
->operand
[i
];
621 odata_end
= &od2
->next
;
622 od2
->index
= next_operand_number
++;
628 d
->operand_number
= od
->index
;
633 /* Process an assembler template from a define_insn or a define_peephole.
634 It is either the assembler code template, a list of assembler code
635 templates, or C code to generate the assembler code template. */
638 process_template (struct data
*d
, const char *template_code
)
643 /* Templates starting with * contain straight code to be run. */
644 if (template_code
[0] == '*')
646 d
->template_code
= 0;
647 d
->output_format
= INSN_OUTPUT_FORMAT_FUNCTION
;
649 puts ("\nstatic const char *");
650 printf ("output_%d (rtx *operands ATTRIBUTE_UNUSED, rtx_insn *insn ATTRIBUTE_UNUSED)\n",
653 print_md_ptr_loc (template_code
);
654 puts (template_code
+ 1);
658 /* If the assembler code template starts with a @ it is a newline-separated
659 list of assembler code templates, one for each alternative. */
660 else if (template_code
[0] == '@')
664 for (cp
= &template_code
[1]; *cp
; )
666 while (ISSPACE (*cp
))
670 while (!IS_VSPACE (*cp
) && *cp
!= '\0')
673 d
->template_code
= 0;
676 d
->output_format
= INSN_OUTPUT_FORMAT_FUNCTION
;
677 puts ("\nstatic const char *");
678 printf ("output_%d (rtx *operands ATTRIBUTE_UNUSED, "
679 "rtx_insn *insn ATTRIBUTE_UNUSED)\n", d
->code_number
);
681 puts (" switch (which_alternative)\n {");
685 d
->output_format
= INSN_OUTPUT_FORMAT_MULTI
;
686 printf ("\nstatic const char * const output_%d[] = {\n",
690 for (i
= 0, cp
= &template_code
[1]; *cp
; )
692 const char *ep
, *sp
, *bp
;
694 while (ISSPACE (*cp
))
700 printf (" case %d:", i
);
707 printf (" return \"");
712 for (ep
= sp
= cp
; !IS_VSPACE (*ep
) && *ep
!= '\0'; ++ep
)
717 message_with_line (d
->lineno
,
718 "trailing whitespace in output template");
732 /* The usual action will end with a return.
733 If there is neither break or return at the end, this is
734 assumed to be intentional; this allows to have multiple
735 consecutive alternatives share some code. */
741 message_with_line (d
->lineno
,
742 "'@' is redundant for output template with single alternative");
743 if (i
!= d
->n_alternatives
)
744 error_with_line (d
->lineno
,
745 "wrong number of alternatives in the output template");
748 puts (" default: gcc_unreachable ();\n }\n}");
754 d
->template_code
= template_code
;
755 d
->output_format
= INSN_OUTPUT_FORMAT_SINGLE
;
759 /* Check insn D for consistency in number of constraint alternatives. */
762 validate_insn_alternatives (struct data
*d
)
766 /* Make sure all the operands have the same number of alternatives
767 in their constraints. Let N be that number. */
768 for (start
= 0; start
< d
->n_operands
; start
++)
769 if (d
->operand
[start
].n_alternatives
> 0)
774 int which_alternative
= 0;
775 int alternative_count_unsure
= 0;
776 bool seen_write
= false;
778 for (p
= d
->operand
[start
].constraint
; (c
= *p
); p
+= len
)
780 if ((c
== '%' || c
== '=' || c
== '+')
781 && p
!= d
->operand
[start
].constraint
)
782 error_with_line (d
->lineno
,
783 "character '%c' can only be used at the"
784 " beginning of a constraint string", c
);
786 if (c
== '=' || c
== '+')
789 /* Earlyclobber operands must always be marked write-only
791 if (!seen_write
&& c
== '&')
792 error_with_line (d
->lineno
,
793 "earlyclobber operands may not be"
794 " read-only in alternative %d",
797 if (ISSPACE (c
) || strchr (indep_constraints
, c
))
799 else if (ISDIGIT (c
))
804 while (ISDIGIT (*q
));
808 len
= mdep_constraint_len (p
, d
->lineno
, start
);
816 for (i
= 1; i
< len
; i
++)
819 error_with_line (d
->lineno
,
820 "NUL in alternative %d of operand %d",
821 which_alternative
, start
);
822 alternative_count_unsure
= 1;
825 else if (strchr (",#*", p
[i
]))
827 error_with_line (d
->lineno
,
828 "'%c' in alternative %d of operand %d",
829 p
[i
], which_alternative
, start
);
830 alternative_count_unsure
= 1;
833 if (!alternative_count_unsure
)
836 n
= d
->operand
[start
].n_alternatives
;
837 else if (n
!= d
->operand
[start
].n_alternatives
)
838 error_with_line (d
->lineno
,
839 "wrong number of alternatives in operand %d",
844 /* Record the insn's overall number of alternatives. */
845 d
->n_alternatives
= n
;
848 /* Verify that there are no gaps in operand numbers for INSNs. */
851 validate_insn_operands (struct data
*d
)
855 for (i
= 0; i
< d
->n_operands
; ++i
)
856 if (d
->operand
[i
].seen
== 0)
857 error_with_line (d
->lineno
, "missing operand %d", i
);
861 validate_optab_operands (struct data
*d
)
863 if (!d
->name
|| d
->name
[0] == '\0' || d
->name
[0] == '*')
866 /* Miscellaneous tests. */
867 if (strncmp (d
->name
, "cstore", 6) == 0
868 && d
->name
[strlen (d
->name
) - 1] == '4'
869 && d
->operand
[0].mode
== VOIDmode
)
871 message_with_line (d
->lineno
, "missing mode for operand 0 of cstore");
876 /* Look at a define_insn just read. Assign its code number. Record
877 on idata the template and the number of arguments. If the insn has
878 a hairy output action, output a function for now. */
881 gen_insn (rtx insn
, int lineno
)
883 struct pattern_stats stats
;
884 struct data
*d
= XNEW (struct data
);
887 d
->code_number
= next_code_number
;
888 d
->index_number
= next_index_number
;
889 d
->filename
= read_md_filename
;
891 if (XSTR (insn
, 0)[0])
892 d
->name
= XSTR (insn
, 0);
896 /* Build up the list in the same order as the insns are seen
897 in the machine description. */
900 idata_end
= &d
->next
;
902 memset (d
->operand
, 0, sizeof (d
->operand
));
904 for (i
= 0; i
< XVECLEN (insn
, 1); i
++)
905 scan_operands (d
, XVECEXP (insn
, 1, i
), 0, 0);
907 get_pattern_stats (&stats
, XVEC (insn
, 1));
908 d
->n_generator_args
= stats
.num_generator_args
;
909 d
->n_operands
= stats
.num_insn_operands
;
910 d
->n_dups
= stats
.num_dups
;
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 case DEFINE_CONSTRAINT
:
1102 case DEFINE_REGISTER_CONSTRAINT
:
1103 case DEFINE_ADDRESS_CONSTRAINT
:
1104 case DEFINE_MEMORY_CONSTRAINT
:
1105 note_constraint (desc
, line_no
);
1111 next_index_number
++;
1115 output_operand_data ();
1116 output_insn_data ();
1117 output_get_insn_name ();
1120 return (ferror (stdout
) != 0 || have_error
1121 ? FATAL_EXIT_CODE
: SUCCESS_EXIT_CODE
);
1124 /* Return the number of occurrences of character C in string S or
1125 -1 if S is the null string. */
1128 n_occurrences (int c
, const char *s
)
1132 if (s
== 0 || *s
== '\0')
1141 /* Remove whitespace in `s' by moving up characters until the end.
1142 Return a new string. */
1145 strip_whitespace (const char *s
)
1153 p
= q
= XNEWVEC (char, strlen (s
) + 1);
1154 while ((ch
= *s
++) != '\0')
1162 /* Record just enough information about a constraint to allow checking
1163 of operand constraint strings above, in validate_insn_alternatives.
1164 Does not validate most properties of the constraint itself; does
1165 enforce no duplicate names, no overlap with MI constraints, and no
1166 prefixes. EXP is the define_*constraint form, LINENO the line number
1167 reported by the reader. */
1169 note_constraint (rtx exp
, int lineno
)
1171 const char *name
= XSTR (exp
, 0);
1172 struct constraint_data
**iter
, **slot
, *new_cdata
;
1174 if (strcmp (name
, "TARGET_MEM_CONSTRAINT") == 0)
1176 unsigned int namelen
= strlen (name
);
1178 if (strchr (indep_constraints
, name
[0]))
1180 if (name
[1] == '\0')
1181 error_with_line (lineno
, "constraint letter '%s' cannot be "
1182 "redefined by the machine description", name
);
1184 error_with_line (lineno
, "constraint name '%s' cannot be defined by "
1185 "the machine description, as it begins with '%c'",
1190 slot
= &constraints_by_letter_table
[(unsigned int)name
[0]];
1191 for (iter
= slot
; *iter
; iter
= &(*iter
)->next_this_letter
)
1193 /* This causes slot to end up pointing to the
1194 next_this_letter field of the last constraint with a name
1195 of equal or greater length than the new constraint; hence
1196 the new constraint will be inserted after all previous
1197 constraints with names of the same length. */
1198 if ((*iter
)->namelen
>= namelen
)
1201 if (!strcmp ((*iter
)->name
, name
))
1203 error_with_line (lineno
, "redefinition of constraint '%s'", name
);
1204 message_with_line ((*iter
)->lineno
, "previous definition is here");
1207 else if (!strncmp ((*iter
)->name
, name
, (*iter
)->namelen
))
1209 error_with_line (lineno
, "defining constraint '%s' here", name
);
1210 message_with_line ((*iter
)->lineno
, "renders constraint '%s' "
1211 "(defined here) a prefix", (*iter
)->name
);
1214 else if (!strncmp ((*iter
)->name
, name
, namelen
))
1216 error_with_line (lineno
, "constraint '%s' is a prefix", name
);
1217 message_with_line ((*iter
)->lineno
, "of constraint '%s' "
1218 "(defined here)", (*iter
)->name
);
1222 new_cdata
= XNEWVAR (struct constraint_data
, sizeof (struct constraint_data
) + namelen
);
1223 strcpy (CONST_CAST (char *, new_cdata
->name
), name
);
1224 new_cdata
->namelen
= namelen
;
1225 new_cdata
->lineno
= lineno
;
1226 new_cdata
->next_this_letter
= *slot
;
1230 /* Return the length of the constraint name beginning at position S
1231 of an operand constraint string, or issue an error message if there
1232 is no such constraint. Does not expect to be called for generic
1235 mdep_constraint_len (const char *s
, int lineno
, int opno
)
1237 struct constraint_data
*p
;
1239 p
= constraints_by_letter_table
[(unsigned int)s
[0]];
1242 for (; p
; p
= p
->next_this_letter
)
1243 if (!strncmp (s
, p
->name
, p
->namelen
))
1246 error_with_line (lineno
,
1247 "error: undefined machine-specific constraint "
1248 "at this point: \"%s\"", s
);
1249 message_with_line (lineno
, "note: in operand %d", opno
);
1250 return 1; /* safe */