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 \"tm.h\"\n");
230 printf ("#include \"flags.h\"\n");
231 printf ("#include \"ggc.h\"\n");
232 printf ("#include \"hash-set.h\"\n");
233 printf ("#include \"machmode.h\"\n");
234 printf ("#include \"vec.h\"\n");
235 printf ("#include \"double-int.h\"\n");
236 printf ("#include \"input.h\"\n");
237 printf ("#include \"alias.h\"\n");
238 printf ("#include \"symtab.h\"\n");
239 printf ("#include \"wide-int.h\"\n");
240 printf ("#include \"inchash.h\"\n");
241 printf ("#include \"tree.h\"\n");
242 printf ("#include \"varasm.h\"\n");
243 printf ("#include \"stor-layout.h\"\n");
244 printf ("#include \"calls.h\"\n");
245 printf ("#include \"rtl.h\"\n");
246 printf ("#include \"hashtab.h\"\n");
247 printf ("#include \"hard-reg-set.h\"\n");
248 printf ("#include \"function.h\"\n");
249 printf ("#include \"statistics.h\"\n");
250 printf ("#include \"real.h\"\n");
251 printf ("#include \"fixed-value.h\"\n");
252 printf ("#include \"insn-config.h\"\n");
253 printf ("#include \"expmed.h\"\n");
254 printf ("#include \"dojump.h\"\n");
255 printf ("#include \"explow.h\"\n");
256 printf ("#include \"emit-rtl.h\"\n");
257 printf ("#include \"stmt.h\"\n");
258 printf ("#include \"expr.h\"\n");
259 printf ("#include \"insn-codes.h\"\n");
260 printf ("#include \"tm_p.h\"\n");
261 printf ("#include \"regs.h\"\n");
262 printf ("#include \"conditions.h\"\n");
263 printf ("#include \"insn-attr.h\"\n\n");
264 printf ("#include \"recog.h\"\n\n");
265 printf ("#include \"diagnostic-core.h\"\n");
266 printf ("#include \"output.h\"\n");
267 printf ("#include \"target.h\"\n");
268 printf ("#include \"tm-constrs.h\"\n");
269 printf ("#include \"predict.h\"\n");
273 output_operand_data (void)
275 struct operand_data *d;
277 printf ("\nstatic const struct insn_operand_data operand_data[] = \n{\n");
279 for (d = odata; d; d = d->next)
281 struct pred_data *pred;
286 d->predicate && d->predicate[0] ? d->predicate : "0");
288 printf (" \"%s\",\n", d->constraint ? d->constraint : "");
290 printf (" %smode,\n", GET_MODE_NAME (d->mode));
292 printf (" %d,\n", d->strict_low);
294 printf (" %d,\n", d->constraint == NULL ? 1 : 0);
296 printf (" %d,\n", d->eliminable);
300 pred = lookup_predicate (d->predicate);
301 printf (" %d\n", pred && pred->codes[MEM]);
309 output_insn_data (void)
313 int next_name_offset;
314 const char * last_name = 0;
315 const char * next_name = 0;
318 for (n = idata, next_name_offset = 1; n; n = n->next, next_name_offset++)
325 printf ("#if GCC_VERSION >= 2007\n__extension__\n#endif\n");
326 printf ("\nconst struct insn_data_d insn_data[] = \n{\n");
328 for (d = idata; d; d = d->next)
330 printf (" /* %s:%d */\n", d->filename, d->lineno);
335 printf (" \"%s\",\n", d->name);
339 for (n = d->next, next_name_offset = 1; n;
340 n = n->next, next_name_offset++)
352 if (next_name && (last_name == 0
353 || name_offset > next_name_offset / 2))
354 printf (" \"%s-%d\",\n", next_name,
355 next_name_offset - name_offset);
357 printf (" \"%s+%d\",\n", last_name, name_offset);
360 switch (d->output_format)
362 case INSN_OUTPUT_FORMAT_NONE:
363 printf ("#if HAVE_DESIGNATED_UNION_INITIALIZERS\n");
364 printf (" { 0 },\n");
366 printf (" { 0, 0, 0 },\n");
369 case INSN_OUTPUT_FORMAT_SINGLE:
371 const char *p = d->template_code;
374 printf ("#if HAVE_DESIGNATED_UNION_INITIALIZERS\n");
375 printf (" { .single =\n");
382 if (IS_VSPACE (*p) && prev != '\\')
384 /* Preserve two consecutive \n's or \r's, but treat \r\n
385 as a single newline. */
386 if (*p == '\n' && prev != '\r')
395 printf ("#if HAVE_DESIGNATED_UNION_INITIALIZERS\n");
398 printf (" 0, 0 },\n");
402 case INSN_OUTPUT_FORMAT_MULTI:
403 printf ("#if HAVE_DESIGNATED_UNION_INITIALIZERS\n");
404 printf (" { .multi = output_%d },\n", d->code_number);
406 printf (" { 0, output_%d, 0 },\n", d->code_number);
409 case INSN_OUTPUT_FORMAT_FUNCTION:
410 printf ("#if HAVE_DESIGNATED_UNION_INITIALIZERS\n");
411 printf (" { .function = output_%d },\n", d->code_number);
413 printf (" { 0, 0, output_%d },\n", d->code_number);
420 if (d->name && d->name[0] != '*')
421 printf (" { (insn_gen_fn::stored_funcptr) gen_%s },\n", d->name);
423 printf (" { 0 },\n");
425 printf (" &operand_data[%d],\n", d->operand_number);
426 printf (" %d,\n", d->n_generator_args);
427 printf (" %d,\n", d->n_operands);
428 printf (" %d,\n", d->n_dups);
429 printf (" %d,\n", d->n_alternatives);
430 printf (" %d\n", d->output_format);
438 output_get_insn_name (void)
440 printf ("const char *\n");
441 printf ("get_insn_name (int code)\n");
443 printf (" if (code == NOOP_MOVE_INSN_CODE)\n");
444 printf (" return \"NOOP_MOVE\";\n");
446 printf (" return insn_data[code].name;\n");
451 /* Stores the operand data into `d->operand[i]'.
453 THIS_ADDRESS_P is nonzero if the containing rtx was an ADDRESS.
454 THIS_STRICT_LOW is nonzero if the containing rtx was a STRICT_LOW_PART. */
457 scan_operands (struct data *d, rtx part, int this_address_p,
461 const char *format_ptr;
467 switch (GET_CODE (part))
470 opno = XINT (part, 0);
471 if (opno >= MAX_MAX_OPERANDS)
473 error_with_line (d->lineno, "maximum number of operands exceeded");
476 if (d->operand[opno].seen)
477 error_with_line (d->lineno, "repeated operand number %d\n", opno);
479 d->operand[opno].seen = 1;
480 d->operand[opno].mode = GET_MODE (part);
481 d->operand[opno].strict_low = this_strict_low;
482 d->operand[opno].predicate = XSTR (part, 1);
483 d->operand[opno].constraint = strip_whitespace (XSTR (part, 2));
484 d->operand[opno].n_alternatives
485 = n_occurrences (',', d->operand[opno].constraint) + 1;
486 d->operand[opno].address_p = this_address_p;
487 d->operand[opno].eliminable = 1;
491 opno = XINT (part, 0);
492 if (opno >= MAX_MAX_OPERANDS)
494 error_with_line (d->lineno, "maximum number of operands exceeded");
497 if (d->operand[opno].seen)
498 error_with_line (d->lineno, "repeated operand number %d\n", opno);
500 d->operand[opno].seen = 1;
501 d->operand[opno].mode = GET_MODE (part);
502 d->operand[opno].strict_low = 0;
503 d->operand[opno].predicate = "scratch_operand";
504 d->operand[opno].constraint = strip_whitespace (XSTR (part, 1));
505 d->operand[opno].n_alternatives
506 = n_occurrences (',', d->operand[opno].constraint) + 1;
507 d->operand[opno].address_p = 0;
508 d->operand[opno].eliminable = 0;
513 opno = XINT (part, 0);
514 if (opno >= MAX_MAX_OPERANDS)
516 error_with_line (d->lineno, "maximum number of operands exceeded");
519 if (d->operand[opno].seen)
520 error_with_line (d->lineno, "repeated operand number %d\n", opno);
522 d->operand[opno].seen = 1;
523 d->operand[opno].mode = GET_MODE (part);
524 d->operand[opno].strict_low = 0;
525 d->operand[opno].predicate = XSTR (part, 1);
526 d->operand[opno].constraint = 0;
527 d->operand[opno].address_p = 0;
528 d->operand[opno].eliminable = 0;
529 for (i = 0; i < XVECLEN (part, 2); i++)
530 scan_operands (d, XVECEXP (part, 2, i), 0, 0);
533 case STRICT_LOW_PART:
534 scan_operands (d, XEXP (part, 0), 0, 1);
541 format_ptr = GET_RTX_FORMAT (GET_CODE (part));
543 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (part)); i++)
544 switch (*format_ptr++)
548 scan_operands (d, XEXP (part, i), 0, 0);
551 if (XVEC (part, i) != NULL)
552 for (j = 0; j < XVECLEN (part, i); j++)
553 scan_operands (d, XVECEXP (part, i, j), 0, 0);
558 /* Compare two operands for content equality. */
561 compare_operands (struct operand_data *d0, struct operand_data *d1)
571 if (strcmp (p0, p1) != 0)
580 if (strcmp (p0, p1) != 0)
583 if (d0->mode != d1->mode)
586 if (d0->strict_low != d1->strict_low)
589 if (d0->eliminable != d1->eliminable)
595 /* Scan the list of operands we've already committed to output and either
596 find a subsequence that is the same, or allocate a new one at the end. */
599 place_operands (struct data *d)
601 struct operand_data *od, *od2;
604 if (d->n_operands == 0)
606 d->operand_number = 0;
610 /* Brute force substring search. */
611 for (od = odata, i = 0; od; od = od->next, i = 0)
612 if (compare_operands (od, &d->operand[0]))
618 if (i == d->n_operands)
622 if (! compare_operands (od2, &d->operand[i]))
624 ++i, od2 = od2->next;
628 /* Either partial match at the end of the list, or no match. In either
629 case, we tack on what operands are remaining to the end of the list. */
631 d->operand_number = next_operand_number - i;
632 for (; i < d->n_operands; ++i)
634 od2 = &d->operand[i];
636 odata_end = &od2->next;
637 od2->index = next_operand_number++;
643 d->operand_number = od->index;
648 /* Process an assembler template from a define_insn or a define_peephole.
649 It is either the assembler code template, a list of assembler code
650 templates, or C code to generate the assembler code template. */
653 process_template (struct data *d, const char *template_code)
658 /* Templates starting with * contain straight code to be run. */
659 if (template_code[0] == '*')
661 d->template_code = 0;
662 d->output_format = INSN_OUTPUT_FORMAT_FUNCTION;
664 puts ("\nstatic const char *");
665 printf ("output_%d (rtx *operands ATTRIBUTE_UNUSED, rtx_insn *insn ATTRIBUTE_UNUSED)\n",
668 print_md_ptr_loc (template_code);
669 puts (template_code + 1);
673 /* If the assembler code template starts with a @ it is a newline-separated
674 list of assembler code templates, one for each alternative. */
675 else if (template_code[0] == '@')
679 for (cp = &template_code[1]; *cp; )
681 while (ISSPACE (*cp))
685 while (!IS_VSPACE (*cp) && *cp != '\0')
688 d->template_code = 0;
691 d->output_format = INSN_OUTPUT_FORMAT_FUNCTION;
692 puts ("\nstatic const char *");
693 printf ("output_%d (rtx *operands ATTRIBUTE_UNUSED, "
694 "rtx_insn *insn ATTRIBUTE_UNUSED)\n", d->code_number);
696 puts (" switch (which_alternative)\n {");
700 d->output_format = INSN_OUTPUT_FORMAT_MULTI;
701 printf ("\nstatic const char * const output_%d[] = {\n",
705 for (i = 0, cp = &template_code[1]; *cp; )
707 const char *ep, *sp, *bp;
709 while (ISSPACE (*cp))
715 printf (" case %d:", i);
722 printf (" return \"");
727 for (ep = sp = cp; !IS_VSPACE (*ep) && *ep != '\0'; ++ep)
732 message_with_line (d->lineno,
733 "trailing whitespace in output template");
747 /* The usual action will end with a return.
748 If there is neither break or return at the end, this is
749 assumed to be intentional; this allows to have multiple
750 consecutive alternatives share some code. */
756 message_with_line (d->lineno,
757 "'@' is redundant for output template with single alternative");
758 if (i != d->n_alternatives)
759 error_with_line (d->lineno,
760 "wrong number of alternatives in the output template");
763 puts (" default: gcc_unreachable ();\n }\n}");
769 d->template_code = template_code;
770 d->output_format = INSN_OUTPUT_FORMAT_SINGLE;
774 /* Check insn D for consistency in number of constraint alternatives. */
777 validate_insn_alternatives (struct data *d)
781 /* Make sure all the operands have the same number of alternatives
782 in their constraints. Let N be that number. */
783 for (start = 0; start < d->n_operands; start++)
784 if (d->operand[start].n_alternatives > 0)
789 int which_alternative = 0;
790 int alternative_count_unsure = 0;
791 bool seen_write = false;
793 for (p = d->operand[start].constraint; (c = *p); p += len)
795 if ((c == '%' || c == '=' || c == '+')
796 && p != d->operand[start].constraint)
797 error_with_line (d->lineno,
798 "character '%c' can only be used at the"
799 " beginning of a constraint string", c);
801 if (c == '=' || c == '+')
804 /* Earlyclobber operands must always be marked write-only
806 if (!seen_write && c == '&')
807 error_with_line (d->lineno,
808 "earlyclobber operands may not be"
809 " read-only in alternative %d",
812 if (ISSPACE (c) || strchr (indep_constraints, c))
814 else if (ISDIGIT (c))
819 while (ISDIGIT (*q));
823 len = mdep_constraint_len (p, d->lineno, start);
831 for (i = 1; i < len; i++)
834 error_with_line (d->lineno,
835 "NUL in alternative %d of operand %d",
836 which_alternative, start);
837 alternative_count_unsure = 1;
840 else if (strchr (",#*", p[i]))
842 error_with_line (d->lineno,
843 "'%c' in alternative %d of operand %d",
844 p[i], which_alternative, start);
845 alternative_count_unsure = 1;
848 if (!alternative_count_unsure)
851 n = d->operand[start].n_alternatives;
852 else if (n != d->operand[start].n_alternatives)
853 error_with_line (d->lineno,
854 "wrong number of alternatives in operand %d",
859 /* Record the insn's overall number of alternatives. */
860 d->n_alternatives = n;
863 /* Verify that there are no gaps in operand numbers for INSNs. */
866 validate_insn_operands (struct data *d)
870 for (i = 0; i < d->n_operands; ++i)
871 if (d->operand[i].seen == 0)
872 error_with_line (d->lineno, "missing operand %d", i);
876 validate_optab_operands (struct data *d)
878 if (!d->name || d->name[0] == '\0' || d->name[0] == '*')
881 /* Miscellaneous tests. */
882 if (strncmp (d->name, "cstore", 6) == 0
883 && d->name[strlen (d->name) - 1] == '4'
884 && d->operand[0].mode == VOIDmode)
886 message_with_line (d->lineno, "missing mode for operand 0 of cstore");
891 /* Look at a define_insn just read. Assign its code number. Record
892 on idata the template and the number of arguments. If the insn has
893 a hairy output action, output a function for now. */
896 gen_insn (rtx insn, int lineno)
898 struct pattern_stats stats;
899 struct data *d = XNEW (struct data);
902 d->code_number = next_code_number;
903 d->index_number = next_index_number;
904 d->filename = read_md_filename;
906 if (XSTR (insn, 0)[0])
907 d->name = XSTR (insn, 0);
911 /* Build up the list in the same order as the insns are seen
912 in the machine description. */
915 idata_end = &d->next;
917 memset (d->operand, 0, sizeof (d->operand));
919 for (i = 0; i < XVECLEN (insn, 1); i++)
920 scan_operands (d, XVECEXP (insn, 1, i), 0, 0);
922 get_pattern_stats (&stats, XVEC (insn, 1));
923 d->n_generator_args = stats.num_generator_args;
924 d->n_operands = stats.num_insn_operands;
925 d->n_dups = stats.num_dups;
927 validate_insn_operands (d);
928 validate_insn_alternatives (d);
929 validate_optab_operands (d);
931 process_template (d, XTMPL (insn, 3));
934 /* Look at a define_peephole just read. Assign its code number.
935 Record on idata the template and the number of arguments.
936 If the insn has a hairy output action, output it now. */
939 gen_peephole (rtx peep, int lineno)
941 struct pattern_stats stats;
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_md_filename;
951 /* Build up the list in the same order as the insns are seen
952 in the machine description. */
955 idata_end = &d->next;
957 memset (d->operand, 0, sizeof (d->operand));
959 /* Get the number of operands by scanning all the patterns of the
960 peephole optimizer. But ignore all the rest of the information
962 for (i = 0; i < XVECLEN (peep, 0); i++)
963 scan_operands (d, XVECEXP (peep, 0, i), 0, 0);
965 get_pattern_stats (&stats, XVEC (peep, 0));
966 d->n_generator_args = 0;
967 d->n_operands = stats.num_insn_operands;
970 validate_insn_alternatives (d);
972 process_template (d, XTMPL (peep, 2));
975 /* Process a define_expand just read. Assign its code number,
976 only for the purposes of `insn_gen_function'. */
979 gen_expand (rtx insn, int lineno)
981 struct pattern_stats stats;
982 struct data *d = XNEW (struct data);
985 d->code_number = next_code_number;
986 d->index_number = next_index_number;
987 d->filename = read_md_filename;
989 if (XSTR (insn, 0)[0])
990 d->name = XSTR (insn, 0);
994 /* Build up the list in the same order as the insns are seen
995 in the machine description. */
998 idata_end = &d->next;
1000 memset (d->operand, 0, sizeof (d->operand));
1002 /* Scan the operands to get the specified predicates and modes,
1003 since expand_binop needs to know them. */
1006 for (i = 0; i < XVECLEN (insn, 1); i++)
1007 scan_operands (d, XVECEXP (insn, 1, i), 0, 0);
1009 get_pattern_stats (&stats, XVEC (insn, 1));
1010 d->n_generator_args = stats.num_generator_args;
1011 d->n_operands = stats.num_insn_operands;
1012 d->n_dups = stats.num_dups;
1013 d->template_code = 0;
1014 d->output_format = INSN_OUTPUT_FORMAT_NONE;
1016 validate_insn_alternatives (d);
1017 validate_optab_operands (d);
1021 /* Process a define_split just read. Assign its code number,
1022 only for reasons of consistency and to simplify genrecog. */
1025 gen_split (rtx split, int lineno)
1027 struct pattern_stats stats;
1028 struct data *d = XNEW (struct data);
1031 d->code_number = next_code_number;
1032 d->index_number = next_index_number;
1033 d->filename = read_md_filename;
1037 /* Build up the list in the same order as the insns are seen
1038 in the machine description. */
1041 idata_end = &d->next;
1043 memset (d->operand, 0, sizeof (d->operand));
1045 /* Get the number of operands by scanning all the patterns of the
1046 split patterns. But ignore all the rest of the information thus
1048 for (i = 0; i < XVECLEN (split, 0); i++)
1049 scan_operands (d, XVECEXP (split, 0, i), 0, 0);
1051 get_pattern_stats (&stats, XVEC (split, 0));
1052 d->n_generator_args = 0;
1053 d->n_operands = stats.num_insn_operands;
1055 d->n_alternatives = 0;
1056 d->template_code = 0;
1057 d->output_format = INSN_OUTPUT_FORMAT_NONE;
1063 init_insn_for_nothing (void)
1065 memset (¬hing, 0, sizeof (nothing));
1066 nothing.name = "*placeholder_for_nothing";
1067 nothing.filename = "<internal>";
1070 extern int main (int, char **);
1073 main (int argc, char **argv)
1077 progname = "genoutput";
1079 init_insn_for_nothing ();
1081 if (!init_rtx_reader_args (argc, argv))
1082 return (FATAL_EXIT_CODE);
1085 next_index_number = 0;
1087 /* Read the machine description. */
1093 desc = read_md_rtx (&line_no, &next_code_number);
1097 switch (GET_CODE (desc))
1100 gen_insn (desc, line_no);
1103 case DEFINE_PEEPHOLE:
1104 gen_peephole (desc, line_no);
1108 gen_expand (desc, line_no);
1112 case DEFINE_PEEPHOLE2:
1113 gen_split (desc, line_no);
1116 case DEFINE_CONSTRAINT:
1117 case DEFINE_REGISTER_CONSTRAINT:
1118 case DEFINE_ADDRESS_CONSTRAINT:
1119 case DEFINE_MEMORY_CONSTRAINT:
1120 note_constraint (desc, line_no);
1126 next_index_number++;
1130 output_operand_data ();
1131 output_insn_data ();
1132 output_get_insn_name ();
1135 return (ferror (stdout) != 0 || have_error
1136 ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE);
1139 /* Return the number of occurrences of character C in string S or
1140 -1 if S is the null string. */
1143 n_occurrences (int c, const char *s)
1147 if (s == 0 || *s == '\0')
1156 /* Remove whitespace in `s' by moving up characters until the end.
1157 Return a new string. */
1160 strip_whitespace (const char *s)
1168 p = q = XNEWVEC (char, strlen (s) + 1);
1169 while ((ch = *s++) != '\0')
1177 /* Record just enough information about a constraint to allow checking
1178 of operand constraint strings above, in validate_insn_alternatives.
1179 Does not validate most properties of the constraint itself; does
1180 enforce no duplicate names, no overlap with MI constraints, and no
1181 prefixes. EXP is the define_*constraint form, LINENO the line number
1182 reported by the reader. */
1184 note_constraint (rtx exp, int lineno)
1186 const char *name = XSTR (exp, 0);
1187 struct constraint_data **iter, **slot, *new_cdata;
1189 if (strcmp (name, "TARGET_MEM_CONSTRAINT") == 0)
1191 unsigned int namelen = strlen (name);
1193 if (strchr (indep_constraints, name[0]))
1195 if (name[1] == '\0')
1196 error_with_line (lineno, "constraint letter '%s' cannot be "
1197 "redefined by the machine description", name);
1199 error_with_line (lineno, "constraint name '%s' cannot be defined by "
1200 "the machine description, as it begins with '%c'",
1205 slot = &constraints_by_letter_table[(unsigned int)name[0]];
1206 for (iter = slot; *iter; iter = &(*iter)->next_this_letter)
1208 /* This causes slot to end up pointing to the
1209 next_this_letter field of the last constraint with a name
1210 of equal or greater length than the new constraint; hence
1211 the new constraint will be inserted after all previous
1212 constraints with names of the same length. */
1213 if ((*iter)->namelen >= namelen)
1216 if (!strcmp ((*iter)->name, name))
1218 error_with_line (lineno, "redefinition of constraint '%s'", name);
1219 message_with_line ((*iter)->lineno, "previous definition is here");
1222 else if (!strncmp ((*iter)->name, name, (*iter)->namelen))
1224 error_with_line (lineno, "defining constraint '%s' here", name);
1225 message_with_line ((*iter)->lineno, "renders constraint '%s' "
1226 "(defined here) a prefix", (*iter)->name);
1229 else if (!strncmp ((*iter)->name, name, namelen))
1231 error_with_line (lineno, "constraint '%s' is a prefix", name);
1232 message_with_line ((*iter)->lineno, "of constraint '%s' "
1233 "(defined here)", (*iter)->name);
1237 new_cdata = XNEWVAR (struct constraint_data, sizeof (struct constraint_data) + namelen);
1238 strcpy (CONST_CAST (char *, new_cdata->name), name);
1239 new_cdata->namelen = namelen;
1240 new_cdata->lineno = lineno;
1241 new_cdata->next_this_letter = *slot;
1245 /* Return the length of the constraint name beginning at position S
1246 of an operand constraint string, or issue an error message if there
1247 is no such constraint. Does not expect to be called for generic
1250 mdep_constraint_len (const char *s, int lineno, int opno)
1252 struct constraint_data *p;
1254 p = constraints_by_letter_table[(unsigned int)s[0]];
1257 for (; p; p = p->next_this_letter)
1258 if (!strncmp (s, p->name, p->namelen))
1261 error_with_line (lineno,
1262 "error: undefined machine-specific constraint "
1263 "at this point: \"%s\"", s);
1264 message_with_line (lineno, "note: in operand %d", opno);
1265 return 1; /* safe */