1 /* Generate code from to output assembler insns as recognized from rtl.
2 Copyright (C) 1987, 88, 92, 94-95, 97-98, 1999
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 The code number of an insn is simply its position in the machine
69 description; code numbers are assigned sequentially to entries in
70 the description, starting with code number 0.
72 Thus, the following entry in the machine description
75 [(set (match_operand:DF 0 "general_operand" "")
80 assuming it is the 25th entry present, would cause
81 insn_data[24].template to be "clrd %0", and
82 insn_data[24].n_operands to be 1. */
90 /* No instruction can have more operands than this. Sorry for this
91 arbitrary limit, but what machine will have an instruction with
92 this many operands? */
94 #define MAX_MAX_OPERANDS 40
96 static struct obstack obstack;
97 struct obstack *rtl_obstack = &obstack;
99 #define obstack_chunk_alloc xmalloc
100 #define obstack_chunk_free free
102 static int n_occurrences PROTO((int, char *));
104 /* insns in the machine description are assigned sequential code numbers
105 that are used by insn-recog.c (produced by genrecog) to communicate
106 to insn-output.c (produced by this program). */
108 static int next_code_number;
110 /* This counts all definitions in the md file,
111 for the sake of error messages. */
113 static int next_index_number;
115 /* This counts all operands used in the md file. The first is null. */
117 static int next_operand_number = 1;
119 /* Record in this chain all information about the operands we will output. */
123 struct operand_data *next;
125 const char *predicate;
126 const char *constraint;
127 enum machine_mode mode;
128 unsigned char n_alternatives;
134 /* Begin with a null operand at index 0. */
136 static struct operand_data null_operand =
138 0, 0, "", "", VOIDmode, 0, 0, 0, 0
141 static struct operand_data *odata = &null_operand;
142 static struct operand_data **odata_end = &null_operand.next;
144 /* Must match the constants in recog.h. */
146 #define INSN_OUTPUT_FORMAT_NONE 0 /* abort */
147 #define INSN_OUTPUT_FORMAT_SINGLE 1 /* const char * */
148 #define INSN_OUTPUT_FORMAT_MULTI 2 /* const char * const * */
149 #define INSN_OUTPUT_FORMAT_FUNCTION 3 /* const char * (*)(...) */
151 /* Record in this chain all information that we will output,
152 associated with the code number of the insn. */
158 const char *template;
161 int n_operands; /* Number of operands this insn recognizes */
162 int n_dups; /* Number times match_dup appears in pattern */
163 int n_alternatives; /* Number of alternatives in each constraint */
164 int operand_number; /* Operand index in the big array. */
165 int output_format; /* INSN_OUTPUT_FORMAT_*. */
166 struct operand_data operand[MAX_MAX_OPERANDS];
169 /* This variable points to the first link in the insn chain. */
171 static struct data *idata, **idata_end = &idata;
173 static void output_prologue PROTO((void));
174 static void output_predicate_decls PROTO((void));
175 static void output_operand_data PROTO((void));
176 static void output_insn_data PROTO((void));
177 static void output_get_insn_name PROTO((void));
178 static void scan_operands PROTO((struct data *, rtx, int, int));
179 static int compare_operands PROTO((struct operand_data *,
180 struct operand_data *));
181 static void place_operands PROTO((struct data *));
182 static void process_template PROTO((struct data *, char *));
183 static void validate_insn_alternatives PROTO((struct data *));
184 static void gen_insn PROTO((rtx));
185 static void gen_peephole PROTO((rtx));
186 static void gen_expand PROTO((rtx));
187 static void gen_split PROTO((rtx));
188 static int n_occurrences PROTO((int, char *));
191 get_insn_name (index)
194 static char buf[100];
196 struct data *i, *last_named = NULL;
197 for (i = idata; i ; i = i->next)
199 if (i->index_number == index)
206 sprintf(buf, "%s+%d", last_named->name, index - last_named->index_number);
208 sprintf(buf, "insn %d", index);
216 printf ("/* Generated automatically by the program `genoutput'\n\
217 from the machine description file `md'. */\n\n");
219 printf ("#define NO_MD_PROTOTYPES\n");
220 printf ("#include \"config.h\"\n");
221 printf ("#include \"system.h\"\n");
222 printf ("#include \"flags.h\"\n");
223 printf ("#include \"rtl.h\"\n");
224 printf ("#include \"tm_p.h\"\n");
225 printf ("#include \"function.h\"\n");
226 printf ("#include \"regs.h\"\n");
227 printf ("#include \"hard-reg-set.h\"\n");
228 printf ("#include \"real.h\"\n");
229 printf ("#include \"insn-config.h\"\n\n");
230 printf ("#include \"conditions.h\"\n");
231 printf ("#include \"insn-flags.h\"\n");
232 printf ("#include \"insn-attr.h\"\n\n");
233 printf ("#include \"insn-codes.h\"\n\n");
234 printf ("#include \"recog.h\"\n\n");
235 printf ("#include \"toplev.h\"\n");
236 printf ("#include \"output.h\"\n");
240 /* We need to define all predicates used. Keep a list of those we
241 have defined so far. There normally aren't very many predicates
242 used, so a linked list should be fast enough. */
245 output_predicate_decls ()
247 struct predicate { const char *name; struct predicate *next; } *predicates = 0;
248 register struct operand_data *d;
251 for (d = odata; d; d = d->next)
252 if (d->predicate && d->predicate[0])
254 for (p = predicates; p; p = p->next)
255 if (strcmp (p->name, d->predicate) == 0)
260 printf ("extern int %s PROTO ((rtx, enum machine_mode));\n",
262 p = (struct predicate *) alloca (sizeof (struct predicate));
263 p->name = d->predicate;
264 p->next = predicates;
273 output_operand_data ()
275 register struct operand_data *d;
277 printf ("\nstatic const struct insn_operand_data operand_data[] = \n{\n");
279 for (d = odata; d; d = d->next)
284 d->predicate && d->predicate[0] ? d->predicate : "0");
286 printf (" \"%s\",\n", d->constraint ? d->constraint : "");
288 printf (" %smode,\n", GET_MODE_NAME (d->mode));
290 printf (" %d\n", d->strict_low);
300 register struct data *d;
302 int next_name_offset;
303 const char * last_name = 0;
304 const char * next_name = 0;
305 register struct data *n;
307 for (n = idata, next_name_offset = 1; n; n = n->next, next_name_offset++)
314 printf ("\nconst struct insn_data insn_data[] = \n{\n");
316 for (d = idata; d; d = d->next)
322 printf (" \"%s\",\n", d->name);
326 for (n = d->next, next_name_offset = 1; n;
327 n = n->next, next_name_offset++)
339 if (next_name && (last_name == 0
340 || name_offset > next_name_offset / 2))
341 printf (" \"%s-%d\",\n", next_name,
342 next_name_offset - name_offset);
344 printf (" \"%s+%d\",\n", last_name, name_offset);
347 switch (d->output_format)
349 case INSN_OUTPUT_FORMAT_NONE:
352 case INSN_OUTPUT_FORMAT_SINGLE:
353 printf (" \"%s\",\n", d->template);
355 case INSN_OUTPUT_FORMAT_MULTI:
356 case INSN_OUTPUT_FORMAT_FUNCTION:
357 printf (" output_%d,\n", d->code_number);
363 if (d->name && d->name[0] != '*')
364 printf (" gen_%s,\n", d->name);
368 printf (" &operand_data[%d],\n", d->operand_number);
369 printf (" %d,\n", d->n_operands);
370 printf (" %d,\n", d->n_dups);
371 printf (" %d,\n", d->n_alternatives);
372 printf (" %d\n", d->output_format);
380 output_get_insn_name ()
382 printf ("const char *\n");
383 printf ("get_insn_name (code)\n");
384 printf (" int code;\n");
386 printf (" return insn_data[code].name;\n");
391 /* Stores in max_opno the largest operand number present in `part', if
392 that is larger than the previous value of max_opno, and the rest of
393 the operand data into `d->operand[i]'.
395 THIS_ADDRESS_P is nonzero if the containing rtx was an ADDRESS.
396 THIS_STRICT_LOW is nonzero if the containing rtx was a STRICT_LOW_PART. */
402 scan_operands (d, part, this_address_p, this_strict_low)
409 register const char *format_ptr;
415 switch (GET_CODE (part))
418 opno = XINT (part, 0);
421 if (max_opno >= MAX_MAX_OPERANDS)
423 error ("Too many operands (%d) in definition %s.\n",
424 max_opno + 1, get_insn_name (next_index_number));
427 if (d->operand[opno].seen)
428 error ("Definition %s specified operand number %d more than once.\n",
429 get_insn_name (next_index_number), opno);
430 d->operand[opno].seen = 1;
431 d->operand[opno].mode = GET_MODE (part);
432 d->operand[opno].strict_low = this_strict_low;
433 d->operand[opno].predicate = XSTR (part, 1);
434 d->operand[opno].constraint = XSTR (part, 2);
435 if (XSTR (part, 2) != 0 && *XSTR (part, 2) != 0)
436 d->operand[opno].n_alternatives
437 = n_occurrences (',', XSTR (part, 2)) + 1;
438 d->operand[opno].address_p = this_address_p;
442 opno = XINT (part, 0);
445 if (max_opno >= MAX_MAX_OPERANDS)
447 error ("Too many operands (%d) in definition %s.\n",
448 max_opno + 1, get_insn_name (next_index_number));
451 if (d->operand[opno].seen)
452 error ("Definition %s specified operand number %d more than once.\n",
453 get_insn_name (next_index_number), opno);
454 d->operand[opno].seen = 1;
455 d->operand[opno].mode = GET_MODE (part);
456 d->operand[opno].strict_low = 0;
457 d->operand[opno].predicate = "scratch_operand";
458 d->operand[opno].constraint = XSTR (part, 1);
459 if (XSTR (part, 1) != 0 && *XSTR (part, 1) != 0)
460 d->operand[opno].n_alternatives
461 = n_occurrences (',', XSTR (part, 1)) + 1;
462 d->operand[opno].address_p = 0;
467 opno = XINT (part, 0);
470 if (max_opno >= MAX_MAX_OPERANDS)
472 error ("Too many operands (%d) in definition %s.\n",
473 max_opno + 1, get_insn_name (next_index_number));
476 if (d->operand[opno].seen)
477 error ("Definition %s specified operand number %d more than once.\n",
478 get_insn_name (next_index_number), opno);
479 d->operand[opno].seen = 1;
480 d->operand[opno].mode = GET_MODE (part);
481 d->operand[opno].strict_low = 0;
482 d->operand[opno].predicate = XSTR (part, 1);
483 d->operand[opno].constraint = 0;
484 d->operand[opno].address_p = 0;
485 for (i = 0; i < XVECLEN (part, 2); i++)
486 scan_operands (d, XVECEXP (part, 2, i), 0, 0);
496 scan_operands (d, XEXP (part, 0), 1, 0);
499 case STRICT_LOW_PART:
500 scan_operands (d, XEXP (part, 0), 0, 1);
507 format_ptr = GET_RTX_FORMAT (GET_CODE (part));
509 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (part)); i++)
510 switch (*format_ptr++)
514 scan_operands (d, XEXP (part, i), 0, 0);
517 if (XVEC (part, i) != NULL)
518 for (j = 0; j < XVECLEN (part, i); j++)
519 scan_operands (d, XVECEXP (part, i, j), 0, 0);
524 /* Compare two operands for content equality. */
527 compare_operands (d0, d1)
528 struct operand_data *d0, *d1;
538 if (strcmp (p0, p1) != 0)
547 if (strcmp (p0, p1) != 0)
550 if (d0->mode != d1->mode)
553 if (d0->strict_low != d1->strict_low)
559 /* Scan the list of operands we've already committed to output and either
560 find a subsequence that is the same, or allocate a new one at the end. */
566 struct operand_data *od, *od2;
569 if (d->n_operands == 0)
571 d->operand_number = 0;
575 /* Brute force substring search. */
576 for (od = odata, i = 0; od; od = od->next, i = 0)
577 if (compare_operands (od, &d->operand[0]))
583 if (i == d->n_operands)
587 if (! compare_operands (od2, &d->operand[i]))
589 ++i, od2 = od2->next;
593 /* Either partial match at the end of the list, or no match. In either
594 case, we tack on what operands are remaining to the end of the list. */
596 d->operand_number = next_operand_number - i;
597 for (; i < d->n_operands; ++i)
599 od2 = &d->operand[i];
601 odata_end = &od2->next;
602 od2->index = next_operand_number++;
608 d->operand_number = od->index;
613 /* Process an assembler template from a define_insn or a define_peephole.
614 It is either the assembler code template, a list of assembler code
615 templates, or C code to generate the assembler code template. */
618 process_template (d, template)
625 /* Templates starting with * contain straight code to be run. */
626 if (template[0] == '*')
629 d->output_format = INSN_OUTPUT_FORMAT_FUNCTION;
631 printf ("\nstatic const char *output_%d PROTO ((rtx *, rtx));\n",
633 puts ("\nstatic const char *");
634 printf ("output_%d (operands, insn)\n", d->code_number);
635 puts (" rtx *operands ATTRIBUTE_UNUSED;");
636 puts (" rtx insn ATTRIBUTE_UNUSED;");
643 /* If the assembler code template starts with a @ it is a newline-separated
644 list of assembler code templates, one for each alternative. */
645 else if (template[0] == '@')
648 d->output_format = INSN_OUTPUT_FORMAT_MULTI;
650 printf ("\nstatic const char * const output_%d[] = {\n", d->code_number);
652 for (i = 0, cp = &template[1]; *cp; )
654 while (*cp == '\n' || *cp == ' ' || *cp== '\t')
658 while (*cp != '\n' && *cp != '\0')
672 d->template = template;
673 d->output_format = INSN_OUTPUT_FORMAT_SINGLE;
677 /* Check insn D for consistency in number of constraint alternatives. */
680 validate_insn_alternatives (d)
683 register int n = 0, start;
685 /* Make sure all the operands have the same number of alternatives
686 in their constraints. Let N be that number. */
687 for (start = 0; start < d->n_operands; start++)
688 if (d->operand[start].n_alternatives > 0)
691 n = d->operand[start].n_alternatives;
692 else if (n != d->operand[start].n_alternatives)
693 error ("wrong number of alternatives in operand %d of insn %s",
694 start, get_insn_name (d->index_number));
697 /* Record the insn's overall number of alternatives. */
698 d->n_alternatives = n;
701 /* Look at a define_insn just read. Assign its code number. Record
702 on idata the template and the number of arguments. If the insn has
703 a hairy output action, output a function for now. */
709 register struct data *d = (struct data *) xmalloc (sizeof (struct data));
712 d->code_number = next_code_number++;
713 d->index_number = next_index_number;
714 if (XSTR (insn, 0)[0])
715 d->name = XSTR (insn, 0);
719 /* Build up the list in the same order as the insns are seen
720 in the machine description. */
723 idata_end = &d->next;
727 memset (d->operand, 0, sizeof (d->operand));
729 for (i = 0; i < XVECLEN (insn, 1); i++)
730 scan_operands (d, XVECEXP (insn, 1, i), 0, 0);
732 d->n_operands = max_opno + 1;
733 d->n_dups = num_dups;
735 validate_insn_alternatives (d);
737 process_template (d, XSTR (insn, 3));
740 /* Look at a define_peephole just read. Assign its code number.
741 Record on idata the template and the number of arguments.
742 If the insn has a hairy output action, output it now. */
748 register struct data *d = (struct data *) xmalloc (sizeof (struct data));
751 d->code_number = next_code_number++;
752 d->index_number = next_index_number;
755 /* Build up the list in the same order as the insns are seen
756 in the machine description. */
759 idata_end = &d->next;
763 memset (d->operand, 0, sizeof (d->operand));
765 /* Get the number of operands by scanning all the patterns of the
766 peephole optimizer. But ignore all the rest of the information
768 for (i = 0; i < XVECLEN (peep, 0); i++)
769 scan_operands (d, XVECEXP (peep, 0, i), 0, 0);
771 d->n_operands = max_opno + 1;
774 validate_insn_alternatives (d);
776 process_template (d, XSTR (peep, 2));
779 /* Process a define_expand just read. Assign its code number,
780 only for the purposes of `insn_gen_function'. */
786 register struct data *d = (struct data *) xmalloc (sizeof (struct data));
789 d->code_number = next_code_number++;
790 d->index_number = next_index_number;
791 if (XSTR (insn, 0)[0])
792 d->name = XSTR (insn, 0);
796 /* Build up the list in the same order as the insns are seen
797 in the machine description. */
800 idata_end = &d->next;
804 memset (d->operand, 0, sizeof (d->operand));
806 /* Scan the operands to get the specified predicates and modes,
807 since expand_binop needs to know them. */
810 for (i = 0; i < XVECLEN (insn, 1); i++)
811 scan_operands (d, XVECEXP (insn, 1, i), 0, 0);
813 d->n_operands = max_opno + 1;
814 d->n_dups = num_dups;
816 d->output_format = INSN_OUTPUT_FORMAT_NONE;
818 validate_insn_alternatives (d);
822 /* Process a define_split just read. Assign its code number,
823 only for reasons of consistency and to simplify genrecog. */
829 register struct data *d = (struct data *) xmalloc (sizeof (struct data));
832 d->code_number = next_code_number++;
833 d->index_number = next_index_number;
836 /* Build up the list in the same order as the insns are seen
837 in the machine description. */
840 idata_end = &d->next;
844 memset (d->operand, 0, sizeof (d->operand));
846 /* Get the number of operands by scanning all the patterns of the
847 split patterns. But ignore all the rest of the information thus
849 for (i = 0; i < XVECLEN (split, 0); i++)
850 scan_operands (d, XVECEXP (split, 0, i), 0, 0);
852 d->n_operands = max_opno + 1;
854 d->n_alternatives = 0;
856 d->output_format = INSN_OUTPUT_FORMAT_NONE;
865 register PTR val = (PTR) malloc (size);
868 fatal ("virtual memory exhausted");
879 ptr = (PTR) realloc (old, size);
881 ptr = (PTR) malloc (size);
883 fatal ("virtual memory exhausted");
887 extern int main PROTO ((int, char **));
898 progname = "genoutput";
899 obstack_init (rtl_obstack);
902 fatal ("No input file name.");
904 infile = fopen (argv[1], "r");
908 return (FATAL_EXIT_CODE);
910 read_rtx_filename = argv[1];
913 next_code_number = 0;
914 next_index_number = 0;
916 /* Read the machine description. */
920 c = read_skip_spaces (infile);
925 desc = read_rtx (infile);
926 if (GET_CODE (desc) == DEFINE_INSN)
928 if (GET_CODE (desc) == DEFINE_PEEPHOLE)
930 if (GET_CODE (desc) == DEFINE_EXPAND)
932 if (GET_CODE (desc) == DEFINE_SPLIT
933 || GET_CODE (desc) == DEFINE_PEEPHOLE2)
939 output_predicate_decls ();
940 output_operand_data ();
942 output_get_insn_name ();
945 return (ferror (stdout) != 0 || have_error
946 ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE);