1 /* Generate code from to output assembler insns as recognized from rtl.
2 Copyright (C) 1987, 88, 92, 94-95, 97-99, 2000
3 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
23 /* This program reads the machine description for the compiler target machine
24 and produces a file containing these things:
26 1. An array of `struct insn_data', which is indexed by insn code number,
29 a. `name' is the name for that pattern. Nameless patterns are
32 b. `output' hold either the output template, an array of output
33 templates, or an output function.
35 c. `genfun' is the function to generate a body for that pattern,
36 given operands as arguments.
38 d. `n_operands' is the number of distinct operands in the pattern
41 e. `n_dups' is the number of match_dup's that appear in the insn's
42 pattern. This says how many elements of `recog_data.dup_loc' are
43 significant after an insn has been recognized.
45 f. `n_alternatives' is the number of alternatives in the constraints
48 g. `output_format' tells what type of thing `output' is.
50 h. `operand' is the base of an array of operand data for the insn.
52 2. An array of `struct insn_operand data', used by `operand' above.
54 a. `predicate', an int-valued function, is the match_operand predicate
57 b. `constraint' is the constraint for this operand. This exists
58 only if register constraints appear in match_operand rtx's.
60 c. `address_p' indicates that the operand appears within ADDRESS
61 rtx's. This exists only if there are *no* register constraints
62 in the match_operand rtx's.
64 d. `mode' is the machine mode that that operand is supposed to have.
66 e. `strict_low', is nonzero for operands contained in a STRICT_LOW_PART.
68 f. `eliminable', is nonzero for operands that are matched normally by
69 MATCH_OPERAND; it is zero for operands that should not be changed during
70 register elimination such as MATCH_OPERATORs.
72 The code number of an insn is simply its position in the machine
73 description; code numbers are assigned sequentially to entries in
74 the description, starting with code number 0.
76 Thus, the following entry in the machine description
79 [(set (match_operand:DF 0 "general_operand" "")
84 assuming it is the 25th entry present, would cause
85 insn_data[24].template to be "clrd %0", and
86 insn_data[24].n_operands to be 1. */
94 /* No instruction can have more operands than this. Sorry for this
95 arbitrary limit, but what machine will have an instruction with
96 this many operands? */
98 #define MAX_MAX_OPERANDS 40
100 static struct obstack obstack;
101 struct obstack *rtl_obstack = &obstack;
103 #define obstack_chunk_alloc xmalloc
104 #define obstack_chunk_free free
106 static int n_occurrences PARAMS ((int, char *));
107 static void strip_whitespace PARAMS ((char *));
109 /* insns in the machine description are assigned sequential code numbers
110 that are used by insn-recog.c (produced by genrecog) to communicate
111 to insn-output.c (produced by this program). */
113 static int next_code_number;
115 /* This counts all definitions in the md file,
116 for the sake of error messages. */
118 static int next_index_number;
120 /* This counts all operands used in the md file. The first is null. */
122 static int next_operand_number = 1;
124 /* Record in this chain all information about the operands we will output. */
128 struct operand_data *next;
130 const char *predicate;
131 const char *constraint;
132 enum machine_mode mode;
133 unsigned char n_alternatives;
140 /* Begin with a null operand at index 0. */
142 static struct operand_data null_operand =
144 0, 0, "", "", VOIDmode, 0, 0, 0, 0, 0
147 static struct operand_data *odata = &null_operand;
148 static struct operand_data **odata_end = &null_operand.next;
150 /* Must match the constants in recog.h. */
152 #define INSN_OUTPUT_FORMAT_NONE 0 /* abort */
153 #define INSN_OUTPUT_FORMAT_SINGLE 1 /* const char * */
154 #define INSN_OUTPUT_FORMAT_MULTI 2 /* const char * const * */
155 #define INSN_OUTPUT_FORMAT_FUNCTION 3 /* const char * (*)(...) */
157 /* Record in this chain all information that we will output,
158 associated with the code number of the insn. */
164 const char *template;
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 /* This variable points to the first link in the insn chain. */
177 static struct data *idata, **idata_end = &idata;
179 static void output_prologue PARAMS ((void));
180 static void output_predicate_decls PARAMS ((void));
181 static void output_operand_data PARAMS ((void));
182 static void output_insn_data PARAMS ((void));
183 static void output_get_insn_name PARAMS ((void));
184 static void scan_operands PARAMS ((struct data *, rtx, int, int));
185 static int compare_operands PARAMS ((struct operand_data *,
186 struct operand_data *));
187 static void place_operands PARAMS ((struct data *));
188 static void process_template PARAMS ((struct data *, char *));
189 static void validate_insn_alternatives PARAMS ((struct data *));
190 static void gen_insn PARAMS ((rtx));
191 static void gen_peephole PARAMS ((rtx));
192 static void gen_expand PARAMS ((rtx));
193 static void gen_split PARAMS ((rtx));
194 static int n_occurrences PARAMS ((int, char *));
197 get_insn_name (index)
200 static char buf[100];
202 struct data *i, *last_named = NULL;
203 for (i = idata; i ; i = i->next)
205 if (i->index_number == index)
212 sprintf(buf, "%s+%d", last_named->name, index - last_named->index_number);
214 sprintf(buf, "insn %d", index);
222 printf ("/* Generated automatically by the program `genoutput'\n\
223 from the machine description file `md'. */\n\n");
225 printf ("#include \"config.h\"\n");
226 printf ("#include \"system.h\"\n");
227 printf ("#include \"flags.h\"\n");
228 printf ("#include \"ggc.h\"\n");
229 printf ("#include \"rtl.h\"\n");
230 printf ("#include \"tm_p.h\"\n");
231 printf ("#include \"function.h\"\n");
232 printf ("#include \"regs.h\"\n");
233 printf ("#include \"hard-reg-set.h\"\n");
234 printf ("#include \"real.h\"\n");
235 printf ("#include \"insn-config.h\"\n\n");
236 printf ("#include \"conditions.h\"\n");
237 printf ("#include \"insn-flags.h\"\n");
238 printf ("#include \"insn-attr.h\"\n\n");
239 printf ("#include \"insn-codes.h\"\n\n");
240 printf ("#include \"recog.h\"\n\n");
241 printf ("#include \"toplev.h\"\n");
242 printf ("#include \"output.h\"\n");
246 /* We need to define all predicates used. Keep a list of those we
247 have defined so far. There normally aren't very many predicates
248 used, so a linked list should be fast enough. */
251 output_predicate_decls ()
253 struct predicate { const char *name; struct predicate *next; } *predicates = 0;
254 register struct operand_data *d;
257 for (d = odata; d; d = d->next)
258 if (d->predicate && d->predicate[0])
260 for (p = predicates; p; p = p->next)
261 if (strcmp (p->name, d->predicate) == 0)
266 printf ("extern int %s PARAMS ((rtx, enum machine_mode));\n",
268 p = (struct predicate *) alloca (sizeof (struct predicate));
269 p->name = d->predicate;
270 p->next = predicates;
279 output_operand_data ()
281 register struct operand_data *d;
283 printf ("\nstatic const struct insn_operand_data operand_data[] = \n{\n");
285 for (d = odata; d; d = d->next)
290 d->predicate && d->predicate[0] ? d->predicate : "0");
292 printf (" \"%s\",\n", d->constraint ? d->constraint : "");
294 printf (" %smode,\n", GET_MODE_NAME (d->mode));
296 printf (" %d,\n", d->strict_low);
298 printf (" %d\n", d->eliminable);
308 register struct data *d;
310 int next_name_offset;
311 const char * last_name = 0;
312 const char * next_name = 0;
313 register struct data *n;
315 for (n = idata, next_name_offset = 1; n; n = n->next, next_name_offset++)
322 printf ("\nconst struct insn_data insn_data[] = \n{\n");
324 for (d = idata; d; d = d->next)
330 printf (" \"%s\",\n", d->name);
334 for (n = d->next, next_name_offset = 1; n;
335 n = n->next, next_name_offset++)
347 if (next_name && (last_name == 0
348 || name_offset > next_name_offset / 2))
349 printf (" \"%s-%d\",\n", next_name,
350 next_name_offset - name_offset);
352 printf (" \"%s+%d\",\n", last_name, name_offset);
355 switch (d->output_format)
357 case INSN_OUTPUT_FORMAT_NONE:
360 case INSN_OUTPUT_FORMAT_SINGLE:
361 printf (" \"%s\",\n", d->template);
363 case INSN_OUTPUT_FORMAT_MULTI:
364 case INSN_OUTPUT_FORMAT_FUNCTION:
365 printf (" (const PTR) output_%d,\n", d->code_number);
371 if (d->name && d->name[0] != '*')
372 printf (" (insn_gen_fn) gen_%s,\n", d->name);
376 printf (" &operand_data[%d],\n", d->operand_number);
377 printf (" %d,\n", d->n_operands);
378 printf (" %d,\n", d->n_dups);
379 printf (" %d,\n", d->n_alternatives);
380 printf (" %d\n", d->output_format);
388 output_get_insn_name ()
390 printf ("const char *\n");
391 printf ("get_insn_name (code)\n");
392 printf (" int code;\n");
394 printf (" return insn_data[code].name;\n");
399 /* Stores in max_opno the largest operand number present in `part', if
400 that is larger than the previous value of max_opno, and the rest of
401 the operand data into `d->operand[i]'.
403 THIS_ADDRESS_P is nonzero if the containing rtx was an ADDRESS.
404 THIS_STRICT_LOW is nonzero if the containing rtx was a STRICT_LOW_PART. */
410 scan_operands (d, part, this_address_p, this_strict_low)
417 register const char *format_ptr;
423 switch (GET_CODE (part))
426 opno = XINT (part, 0);
429 if (max_opno >= MAX_MAX_OPERANDS)
431 error ("Too many operands (%d) in definition %s.\n",
432 max_opno + 1, get_insn_name (next_index_number));
435 if (d->operand[opno].seen)
436 error ("Definition %s specified operand number %d more than once.\n",
437 get_insn_name (next_index_number), opno);
438 d->operand[opno].seen = 1;
439 d->operand[opno].mode = GET_MODE (part);
440 d->operand[opno].strict_low = this_strict_low;
441 d->operand[opno].predicate = XSTR (part, 1);
442 d->operand[opno].constraint = XSTR (part, 2);
443 if (XSTR (part, 2) != NULL && *XSTR (part, 2) != 0)
445 strip_whitespace (XSTR (part, 2));
446 d->operand[opno].n_alternatives
447 = n_occurrences (',', XSTR (part, 2)) + 1;
449 d->operand[opno].address_p = this_address_p;
450 d->operand[opno].eliminable = 1;
454 opno = XINT (part, 0);
457 if (max_opno >= MAX_MAX_OPERANDS)
459 error ("Too many operands (%d) in definition %s.\n",
460 max_opno + 1, get_insn_name (next_index_number));
463 if (d->operand[opno].seen)
464 error ("Definition %s specified operand number %d more than once.\n",
465 get_insn_name (next_index_number), opno);
466 d->operand[opno].seen = 1;
467 d->operand[opno].mode = GET_MODE (part);
468 d->operand[opno].strict_low = 0;
469 d->operand[opno].predicate = "scratch_operand";
470 d->operand[opno].constraint = XSTR (part, 1);
471 if (XSTR (part, 1) != NULL && *XSTR (part, 1) != 0)
473 strip_whitespace (XSTR (part, 1));
474 d->operand[opno].n_alternatives
475 = n_occurrences (',', XSTR (part, 1)) + 1;
477 d->operand[opno].address_p = 0;
478 d->operand[opno].eliminable = 0;
483 opno = XINT (part, 0);
486 if (max_opno >= MAX_MAX_OPERANDS)
488 error ("Too many operands (%d) in definition %s.\n",
489 max_opno + 1, get_insn_name (next_index_number));
492 if (d->operand[opno].seen)
493 error ("Definition %s specified operand number %d more than once.\n",
494 get_insn_name (next_index_number), opno);
495 d->operand[opno].seen = 1;
496 d->operand[opno].mode = GET_MODE (part);
497 d->operand[opno].strict_low = 0;
498 d->operand[opno].predicate = XSTR (part, 1);
499 d->operand[opno].constraint = 0;
500 d->operand[opno].address_p = 0;
501 d->operand[opno].eliminable = 0;
502 for (i = 0; i < XVECLEN (part, 2); i++)
503 scan_operands (d, XVECEXP (part, 2, i), 0, 0);
513 scan_operands (d, XEXP (part, 0), 1, 0);
516 case STRICT_LOW_PART:
517 scan_operands (d, XEXP (part, 0), 0, 1);
524 format_ptr = GET_RTX_FORMAT (GET_CODE (part));
526 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (part)); i++)
527 switch (*format_ptr++)
531 scan_operands (d, XEXP (part, i), 0, 0);
534 if (XVEC (part, i) != NULL)
535 for (j = 0; j < XVECLEN (part, i); j++)
536 scan_operands (d, XVECEXP (part, i, j), 0, 0);
541 /* Compare two operands for content equality. */
544 compare_operands (d0, d1)
545 struct operand_data *d0, *d1;
555 if (strcmp (p0, p1) != 0)
564 if (strcmp (p0, p1) != 0)
567 if (d0->mode != d1->mode)
570 if (d0->strict_low != d1->strict_low)
573 if (d0->eliminable != d1->eliminable)
579 /* Scan the list of operands we've already committed to output and either
580 find a subsequence that is the same, or allocate a new one at the end. */
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 (d, template)
645 /* Templates starting with * contain straight code to be run. */
646 if (template[0] == '*')
649 d->output_format = INSN_OUTPUT_FORMAT_FUNCTION;
651 printf ("\nstatic const char *output_%d PARAMS ((rtx *, rtx));\n",
653 puts ("\nstatic const char *");
654 printf ("output_%d (operands, insn)\n", d->code_number);
655 puts (" rtx *operands ATTRIBUTE_UNUSED;");
656 puts (" rtx insn ATTRIBUTE_UNUSED;");
663 /* If the assembler code template starts with a @ it is a newline-separated
664 list of assembler code templates, one for each alternative. */
665 else if (template[0] == '@')
668 d->output_format = INSN_OUTPUT_FORMAT_MULTI;
670 printf ("\nstatic const char * const output_%d[] = {\n", d->code_number);
672 for (i = 0, cp = &template[1]; *cp; )
674 while (*cp == '\n' || *cp == ' ' || *cp== '\t')
678 while (*cp != '\n' && *cp != '\0')
692 d->template = template;
693 d->output_format = INSN_OUTPUT_FORMAT_SINGLE;
697 /* Check insn D for consistency in number of constraint alternatives. */
700 validate_insn_alternatives (d)
703 register int n = 0, start;
705 /* Make sure all the operands have the same number of alternatives
706 in their constraints. Let N be that number. */
707 for (start = 0; start < d->n_operands; start++)
708 if (d->operand[start].n_alternatives > 0)
711 n = d->operand[start].n_alternatives;
712 else if (n != d->operand[start].n_alternatives)
713 error ("wrong number of alternatives in operand %d of insn %s",
714 start, get_insn_name (d->index_number));
717 /* Record the insn's overall number of alternatives. */
718 d->n_alternatives = n;
721 /* Look at a define_insn just read. Assign its code number. Record
722 on idata the template and the number of arguments. If the insn has
723 a hairy output action, output a function for now. */
729 register struct data *d = (struct data *) xmalloc (sizeof (struct data));
732 d->code_number = next_code_number++;
733 d->index_number = next_index_number;
734 if (XSTR (insn, 0)[0])
735 d->name = XSTR (insn, 0);
739 /* Build up the list in the same order as the insns are seen
740 in the machine description. */
743 idata_end = &d->next;
747 memset (d->operand, 0, sizeof (d->operand));
749 for (i = 0; i < XVECLEN (insn, 1); i++)
750 scan_operands (d, XVECEXP (insn, 1, i), 0, 0);
752 d->n_operands = max_opno + 1;
753 d->n_dups = num_dups;
755 validate_insn_alternatives (d);
757 process_template (d, XSTR (insn, 3));
760 /* Look at a define_peephole just read. Assign its code number.
761 Record on idata the template and the number of arguments.
762 If the insn has a hairy output action, output it now. */
768 register struct data *d = (struct data *) xmalloc (sizeof (struct data));
771 d->code_number = next_code_number++;
772 d->index_number = next_index_number;
775 /* Build up the list in the same order as the insns are seen
776 in the machine description. */
779 idata_end = &d->next;
783 memset (d->operand, 0, sizeof (d->operand));
785 /* Get the number of operands by scanning all the patterns of the
786 peephole optimizer. But ignore all the rest of the information
788 for (i = 0; i < XVECLEN (peep, 0); i++)
789 scan_operands (d, XVECEXP (peep, 0, i), 0, 0);
791 d->n_operands = max_opno + 1;
794 validate_insn_alternatives (d);
796 process_template (d, XSTR (peep, 2));
799 /* Process a define_expand just read. Assign its code number,
800 only for the purposes of `insn_gen_function'. */
806 register struct data *d = (struct data *) xmalloc (sizeof (struct data));
809 d->code_number = next_code_number++;
810 d->index_number = next_index_number;
811 if (XSTR (insn, 0)[0])
812 d->name = XSTR (insn, 0);
816 /* Build up the list in the same order as the insns are seen
817 in the machine description. */
820 idata_end = &d->next;
824 memset (d->operand, 0, sizeof (d->operand));
826 /* Scan the operands to get the specified predicates and modes,
827 since expand_binop needs to know them. */
830 for (i = 0; i < XVECLEN (insn, 1); i++)
831 scan_operands (d, XVECEXP (insn, 1, i), 0, 0);
833 d->n_operands = max_opno + 1;
834 d->n_dups = num_dups;
836 d->output_format = INSN_OUTPUT_FORMAT_NONE;
838 validate_insn_alternatives (d);
842 /* Process a define_split just read. Assign its code number,
843 only for reasons of consistency and to simplify genrecog. */
849 register struct data *d = (struct data *) xmalloc (sizeof (struct data));
852 d->code_number = next_code_number++;
853 d->index_number = next_index_number;
856 /* Build up the list in the same order as the insns are seen
857 in the machine description. */
860 idata_end = &d->next;
864 memset (d->operand, 0, sizeof (d->operand));
866 /* Get the number of operands by scanning all the patterns of the
867 split patterns. But ignore all the rest of the information thus
869 for (i = 0; i < XVECLEN (split, 0); i++)
870 scan_operands (d, XVECEXP (split, 0, i), 0, 0);
872 d->n_operands = max_opno + 1;
874 d->n_alternatives = 0;
876 d->output_format = INSN_OUTPUT_FORMAT_NONE;
885 register PTR val = (PTR) malloc (size);
888 fatal ("virtual memory exhausted");
899 ptr = (PTR) realloc (old, size);
901 ptr = (PTR) malloc (size);
903 fatal ("virtual memory exhausted");
907 extern int main PARAMS ((int, char **));
918 progname = "genoutput";
919 obstack_init (rtl_obstack);
922 fatal ("No input file name.");
924 infile = fopen (argv[1], "r");
928 return (FATAL_EXIT_CODE);
930 read_rtx_filename = argv[1];
933 next_code_number = 0;
934 next_index_number = 0;
936 /* Read the machine description. */
940 c = read_skip_spaces (infile);
945 desc = read_rtx (infile);
946 if (GET_CODE (desc) == DEFINE_INSN)
948 if (GET_CODE (desc) == DEFINE_PEEPHOLE)
950 if (GET_CODE (desc) == DEFINE_EXPAND)
952 if (GET_CODE (desc) == DEFINE_SPLIT
953 || GET_CODE (desc) == DEFINE_PEEPHOLE2)
959 output_predicate_decls ();
960 output_operand_data ();
962 output_get_insn_name ();
965 return (ferror (stdout) != 0 || have_error
966 ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE);
980 /* Remove whitespace in `s' by moving up characters until the end. */
988 while ((ch = *s++) != '\0')