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 *));
108 /* insns in the machine description are assigned sequential code numbers
109 that are used by insn-recog.c (produced by genrecog) to communicate
110 to insn-output.c (produced by this program). */
112 static int next_code_number;
114 /* This counts all definitions in the md file,
115 for the sake of error messages. */
117 static int next_index_number;
119 /* This counts all operands used in the md file. The first is null. */
121 static int next_operand_number = 1;
123 /* Record in this chain all information about the operands we will output. */
127 struct operand_data *next;
129 const char *predicate;
130 const char *constraint;
131 enum machine_mode mode;
132 unsigned char n_alternatives;
139 /* Begin with a null operand at index 0. */
141 static struct operand_data null_operand =
143 0, 0, "", "", VOIDmode, 0, 0, 0, 0, 0
146 static struct operand_data *odata = &null_operand;
147 static struct operand_data **odata_end = &null_operand.next;
149 /* Must match the constants in recog.h. */
151 #define INSN_OUTPUT_FORMAT_NONE 0 /* abort */
152 #define INSN_OUTPUT_FORMAT_SINGLE 1 /* const char * */
153 #define INSN_OUTPUT_FORMAT_MULTI 2 /* const char * const * */
154 #define INSN_OUTPUT_FORMAT_FUNCTION 3 /* const char * (*)(...) */
156 /* Record in this chain all information that we will output,
157 associated with the code number of the insn. */
163 const char *template;
166 int n_operands; /* Number of operands this insn recognizes */
167 int n_dups; /* Number times match_dup appears in pattern */
168 int n_alternatives; /* Number of alternatives in each constraint */
169 int operand_number; /* Operand index in the big array. */
170 int output_format; /* INSN_OUTPUT_FORMAT_*. */
171 struct operand_data operand[MAX_MAX_OPERANDS];
174 /* This variable points to the first link in the insn chain. */
176 static struct data *idata, **idata_end = &idata;
178 static void output_prologue PARAMS ((void));
179 static void output_predicate_decls PARAMS ((void));
180 static void output_operand_data PARAMS ((void));
181 static void output_insn_data PARAMS ((void));
182 static void output_get_insn_name PARAMS ((void));
183 static void scan_operands PARAMS ((struct data *, rtx, int, int));
184 static int compare_operands PARAMS ((struct operand_data *,
185 struct operand_data *));
186 static void place_operands PARAMS ((struct data *));
187 static void process_template PARAMS ((struct data *, char *));
188 static void validate_insn_alternatives PARAMS ((struct data *));
189 static void gen_insn PARAMS ((rtx));
190 static void gen_peephole PARAMS ((rtx));
191 static void gen_expand PARAMS ((rtx));
192 static void gen_split PARAMS ((rtx));
193 static int n_occurrences PARAMS ((int, char *));
196 get_insn_name (index)
199 static char buf[100];
201 struct data *i, *last_named = NULL;
202 for (i = idata; i ; i = i->next)
204 if (i->index_number == index)
211 sprintf(buf, "%s+%d", last_named->name, index - last_named->index_number);
213 sprintf(buf, "insn %d", index);
221 printf ("/* Generated automatically by the program `genoutput'\n\
222 from the machine description file `md'. */\n\n");
224 printf ("#define NO_MD_PROTOTYPES\n");
225 printf ("#include \"config.h\"\n");
226 printf ("#include \"system.h\"\n");
227 printf ("#include \"flags.h\"\n");
228 printf ("#include \"rtl.h\"\n");
229 printf ("#include \"tm_p.h\"\n");
230 printf ("#include \"function.h\"\n");
231 printf ("#include \"regs.h\"\n");
232 printf ("#include \"hard-reg-set.h\"\n");
233 printf ("#include \"real.h\"\n");
234 printf ("#include \"insn-config.h\"\n\n");
235 printf ("#include \"conditions.h\"\n");
236 printf ("#include \"insn-flags.h\"\n");
237 printf ("#include \"insn-attr.h\"\n\n");
238 printf ("#include \"insn-codes.h\"\n\n");
239 printf ("#include \"recog.h\"\n\n");
240 printf ("#include \"toplev.h\"\n");
241 printf ("#include \"output.h\"\n");
245 /* We need to define all predicates used. Keep a list of those we
246 have defined so far. There normally aren't very many predicates
247 used, so a linked list should be fast enough. */
250 output_predicate_decls ()
252 struct predicate { const char *name; struct predicate *next; } *predicates = 0;
253 register struct operand_data *d;
256 for (d = odata; d; d = d->next)
257 if (d->predicate && d->predicate[0])
259 for (p = predicates; p; p = p->next)
260 if (strcmp (p->name, d->predicate) == 0)
265 printf ("extern int %s PARAMS ((rtx, enum machine_mode));\n",
267 p = (struct predicate *) alloca (sizeof (struct predicate));
268 p->name = d->predicate;
269 p->next = predicates;
278 output_operand_data ()
280 register struct operand_data *d;
282 printf ("\nstatic const struct insn_operand_data operand_data[] = \n{\n");
284 for (d = odata; d; d = d->next)
289 d->predicate && d->predicate[0] ? d->predicate : "0");
291 printf (" \"%s\",\n", d->constraint ? d->constraint : "");
293 printf (" %smode,\n", GET_MODE_NAME (d->mode));
295 printf (" %d,\n", d->strict_low);
297 printf (" %d\n", d->eliminable);
307 register struct data *d;
309 int next_name_offset;
310 const char * last_name = 0;
311 const char * next_name = 0;
312 register struct data *n;
314 for (n = idata, next_name_offset = 1; n; n = n->next, next_name_offset++)
321 printf ("\nconst struct insn_data insn_data[] = \n{\n");
323 for (d = idata; d; d = d->next)
329 printf (" \"%s\",\n", d->name);
333 for (n = d->next, next_name_offset = 1; n;
334 n = n->next, next_name_offset++)
346 if (next_name && (last_name == 0
347 || name_offset > next_name_offset / 2))
348 printf (" \"%s-%d\",\n", next_name,
349 next_name_offset - name_offset);
351 printf (" \"%s+%d\",\n", last_name, name_offset);
354 switch (d->output_format)
356 case INSN_OUTPUT_FORMAT_NONE:
359 case INSN_OUTPUT_FORMAT_SINGLE:
360 printf (" \"%s\",\n", d->template);
362 case INSN_OUTPUT_FORMAT_MULTI:
363 case INSN_OUTPUT_FORMAT_FUNCTION:
364 printf (" (const PTR) output_%d,\n", d->code_number);
370 if (d->name && d->name[0] != '*')
371 printf (" gen_%s,\n", d->name);
375 printf (" &operand_data[%d],\n", d->operand_number);
376 printf (" %d,\n", d->n_operands);
377 printf (" %d,\n", d->n_dups);
378 printf (" %d,\n", d->n_alternatives);
379 printf (" %d\n", d->output_format);
387 output_get_insn_name ()
389 printf ("const char *\n");
390 printf ("get_insn_name (code)\n");
391 printf (" int code;\n");
393 printf (" return insn_data[code].name;\n");
398 /* Stores in max_opno the largest operand number present in `part', if
399 that is larger than the previous value of max_opno, and the rest of
400 the operand data into `d->operand[i]'.
402 THIS_ADDRESS_P is nonzero if the containing rtx was an ADDRESS.
403 THIS_STRICT_LOW is nonzero if the containing rtx was a STRICT_LOW_PART. */
409 scan_operands (d, part, this_address_p, this_strict_low)
416 register const char *format_ptr;
422 switch (GET_CODE (part))
425 opno = XINT (part, 0);
428 if (max_opno >= MAX_MAX_OPERANDS)
430 error ("Too many operands (%d) in definition %s.\n",
431 max_opno + 1, get_insn_name (next_index_number));
434 if (d->operand[opno].seen)
435 error ("Definition %s specified operand number %d more than once.\n",
436 get_insn_name (next_index_number), opno);
437 d->operand[opno].seen = 1;
438 d->operand[opno].mode = GET_MODE (part);
439 d->operand[opno].strict_low = this_strict_low;
440 d->operand[opno].predicate = XSTR (part, 1);
441 d->operand[opno].constraint = XSTR (part, 2);
442 if (XSTR (part, 2) != 0 && *XSTR (part, 2) != 0)
443 d->operand[opno].n_alternatives
444 = n_occurrences (',', XSTR (part, 2)) + 1;
445 d->operand[opno].address_p = this_address_p;
446 d->operand[opno].eliminable = 1;
450 opno = XINT (part, 0);
453 if (max_opno >= MAX_MAX_OPERANDS)
455 error ("Too many operands (%d) in definition %s.\n",
456 max_opno + 1, get_insn_name (next_index_number));
459 if (d->operand[opno].seen)
460 error ("Definition %s specified operand number %d more than once.\n",
461 get_insn_name (next_index_number), opno);
462 d->operand[opno].seen = 1;
463 d->operand[opno].mode = GET_MODE (part);
464 d->operand[opno].strict_low = 0;
465 d->operand[opno].predicate = "scratch_operand";
466 d->operand[opno].constraint = XSTR (part, 1);
467 if (XSTR (part, 1) != 0 && *XSTR (part, 1) != 0)
468 d->operand[opno].n_alternatives
469 = n_occurrences (',', XSTR (part, 1)) + 1;
470 d->operand[opno].address_p = 0;
471 d->operand[opno].eliminable = 0;
476 opno = XINT (part, 0);
479 if (max_opno >= MAX_MAX_OPERANDS)
481 error ("Too many operands (%d) in definition %s.\n",
482 max_opno + 1, get_insn_name (next_index_number));
485 if (d->operand[opno].seen)
486 error ("Definition %s specified operand number %d more than once.\n",
487 get_insn_name (next_index_number), opno);
488 d->operand[opno].seen = 1;
489 d->operand[opno].mode = GET_MODE (part);
490 d->operand[opno].strict_low = 0;
491 d->operand[opno].predicate = XSTR (part, 1);
492 d->operand[opno].constraint = 0;
493 d->operand[opno].address_p = 0;
494 d->operand[opno].eliminable = 0;
495 for (i = 0; i < XVECLEN (part, 2); i++)
496 scan_operands (d, XVECEXP (part, 2, i), 0, 0);
506 scan_operands (d, XEXP (part, 0), 1, 0);
509 case STRICT_LOW_PART:
510 scan_operands (d, XEXP (part, 0), 0, 1);
517 format_ptr = GET_RTX_FORMAT (GET_CODE (part));
519 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (part)); i++)
520 switch (*format_ptr++)
524 scan_operands (d, XEXP (part, i), 0, 0);
527 if (XVEC (part, i) != NULL)
528 for (j = 0; j < XVECLEN (part, i); j++)
529 scan_operands (d, XVECEXP (part, i, j), 0, 0);
534 /* Compare two operands for content equality. */
537 compare_operands (d0, d1)
538 struct operand_data *d0, *d1;
548 if (strcmp (p0, p1) != 0)
557 if (strcmp (p0, p1) != 0)
560 if (d0->mode != d1->mode)
563 if (d0->strict_low != d1->strict_low)
566 if (d0->eliminable != d1->eliminable)
572 /* Scan the list of operands we've already committed to output and either
573 find a subsequence that is the same, or allocate a new one at the end. */
579 struct operand_data *od, *od2;
582 if (d->n_operands == 0)
584 d->operand_number = 0;
588 /* Brute force substring search. */
589 for (od = odata, i = 0; od; od = od->next, i = 0)
590 if (compare_operands (od, &d->operand[0]))
596 if (i == d->n_operands)
600 if (! compare_operands (od2, &d->operand[i]))
602 ++i, od2 = od2->next;
606 /* Either partial match at the end of the list, or no match. In either
607 case, we tack on what operands are remaining to the end of the list. */
609 d->operand_number = next_operand_number - i;
610 for (; i < d->n_operands; ++i)
612 od2 = &d->operand[i];
614 odata_end = &od2->next;
615 od2->index = next_operand_number++;
621 d->operand_number = od->index;
626 /* Process an assembler template from a define_insn or a define_peephole.
627 It is either the assembler code template, a list of assembler code
628 templates, or C code to generate the assembler code template. */
631 process_template (d, template)
638 /* Templates starting with * contain straight code to be run. */
639 if (template[0] == '*')
642 d->output_format = INSN_OUTPUT_FORMAT_FUNCTION;
644 printf ("\nstatic const char *output_%d PARAMS ((rtx *, rtx));\n",
646 puts ("\nstatic const char *");
647 printf ("output_%d (operands, insn)\n", d->code_number);
648 puts (" rtx *operands ATTRIBUTE_UNUSED;");
649 puts (" rtx insn ATTRIBUTE_UNUSED;");
656 /* If the assembler code template starts with a @ it is a newline-separated
657 list of assembler code templates, one for each alternative. */
658 else if (template[0] == '@')
661 d->output_format = INSN_OUTPUT_FORMAT_MULTI;
663 printf ("\nstatic const char * const output_%d[] = {\n", d->code_number);
665 for (i = 0, cp = &template[1]; *cp; )
667 while (*cp == '\n' || *cp == ' ' || *cp== '\t')
671 while (*cp != '\n' && *cp != '\0')
685 d->template = template;
686 d->output_format = INSN_OUTPUT_FORMAT_SINGLE;
690 /* Check insn D for consistency in number of constraint alternatives. */
693 validate_insn_alternatives (d)
696 register int n = 0, start;
698 /* Make sure all the operands have the same number of alternatives
699 in their constraints. Let N be that number. */
700 for (start = 0; start < d->n_operands; start++)
701 if (d->operand[start].n_alternatives > 0)
704 n = d->operand[start].n_alternatives;
705 else if (n != d->operand[start].n_alternatives)
706 error ("wrong number of alternatives in operand %d of insn %s",
707 start, get_insn_name (d->index_number));
710 /* Record the insn's overall number of alternatives. */
711 d->n_alternatives = n;
714 /* Look at a define_insn just read. Assign its code number. Record
715 on idata the template and the number of arguments. If the insn has
716 a hairy output action, output a function for now. */
722 register struct data *d = (struct data *) xmalloc (sizeof (struct data));
725 d->code_number = next_code_number++;
726 d->index_number = next_index_number;
727 if (XSTR (insn, 0)[0])
728 d->name = XSTR (insn, 0);
732 /* Build up the list in the same order as the insns are seen
733 in the machine description. */
736 idata_end = &d->next;
740 memset (d->operand, 0, sizeof (d->operand));
742 for (i = 0; i < XVECLEN (insn, 1); i++)
743 scan_operands (d, XVECEXP (insn, 1, i), 0, 0);
745 d->n_operands = max_opno + 1;
746 d->n_dups = num_dups;
748 validate_insn_alternatives (d);
750 process_template (d, XSTR (insn, 3));
753 /* Look at a define_peephole just read. Assign its code number.
754 Record on idata the template and the number of arguments.
755 If the insn has a hairy output action, output it now. */
761 register struct data *d = (struct data *) xmalloc (sizeof (struct data));
764 d->code_number = next_code_number++;
765 d->index_number = next_index_number;
768 /* Build up the list in the same order as the insns are seen
769 in the machine description. */
772 idata_end = &d->next;
776 memset (d->operand, 0, sizeof (d->operand));
778 /* Get the number of operands by scanning all the patterns of the
779 peephole optimizer. But ignore all the rest of the information
781 for (i = 0; i < XVECLEN (peep, 0); i++)
782 scan_operands (d, XVECEXP (peep, 0, i), 0, 0);
784 d->n_operands = max_opno + 1;
787 validate_insn_alternatives (d);
789 process_template (d, XSTR (peep, 2));
792 /* Process a define_expand just read. Assign its code number,
793 only for the purposes of `insn_gen_function'. */
799 register struct data *d = (struct data *) xmalloc (sizeof (struct data));
802 d->code_number = next_code_number++;
803 d->index_number = next_index_number;
804 if (XSTR (insn, 0)[0])
805 d->name = XSTR (insn, 0);
809 /* Build up the list in the same order as the insns are seen
810 in the machine description. */
813 idata_end = &d->next;
817 memset (d->operand, 0, sizeof (d->operand));
819 /* Scan the operands to get the specified predicates and modes,
820 since expand_binop needs to know them. */
823 for (i = 0; i < XVECLEN (insn, 1); i++)
824 scan_operands (d, XVECEXP (insn, 1, i), 0, 0);
826 d->n_operands = max_opno + 1;
827 d->n_dups = num_dups;
829 d->output_format = INSN_OUTPUT_FORMAT_NONE;
831 validate_insn_alternatives (d);
835 /* Process a define_split just read. Assign its code number,
836 only for reasons of consistency and to simplify genrecog. */
842 register struct data *d = (struct data *) xmalloc (sizeof (struct data));
845 d->code_number = next_code_number++;
846 d->index_number = next_index_number;
849 /* Build up the list in the same order as the insns are seen
850 in the machine description. */
853 idata_end = &d->next;
857 memset (d->operand, 0, sizeof (d->operand));
859 /* Get the number of operands by scanning all the patterns of the
860 split patterns. But ignore all the rest of the information thus
862 for (i = 0; i < XVECLEN (split, 0); i++)
863 scan_operands (d, XVECEXP (split, 0, i), 0, 0);
865 d->n_operands = max_opno + 1;
867 d->n_alternatives = 0;
869 d->output_format = INSN_OUTPUT_FORMAT_NONE;
878 register PTR val = (PTR) malloc (size);
881 fatal ("virtual memory exhausted");
892 ptr = (PTR) realloc (old, size);
894 ptr = (PTR) malloc (size);
896 fatal ("virtual memory exhausted");
900 extern int main PARAMS ((int, char **));
911 progname = "genoutput";
912 obstack_init (rtl_obstack);
915 fatal ("No input file name.");
917 infile = fopen (argv[1], "r");
921 return (FATAL_EXIT_CODE);
923 read_rtx_filename = argv[1];
926 next_code_number = 0;
927 next_index_number = 0;
929 /* Read the machine description. */
933 c = read_skip_spaces (infile);
938 desc = read_rtx (infile);
939 if (GET_CODE (desc) == DEFINE_INSN)
941 if (GET_CODE (desc) == DEFINE_PEEPHOLE)
943 if (GET_CODE (desc) == DEFINE_EXPAND)
945 if (GET_CODE (desc) == DEFINE_SPLIT
946 || GET_CODE (desc) == DEFINE_PEEPHOLE2)
952 output_predicate_decls ();
953 output_operand_data ();
955 output_get_insn_name ();
958 return (ferror (stdout) != 0 || have_error
959 ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE);