1 /* Generate code from to output assembler insns as recognized from rtl.
2 Copyright (C) 1987, 1988, 1992, 1994, 1995, 1997, 1998, 1999, 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. */
92 #include "gensupport.h"
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 int n_occurrences PARAMS ((int, const char *));
101 static const char *strip_whitespace PARAMS ((const char *));
103 /* insns in the machine description are assigned sequential code numbers
104 that are used by insn-recog.c (produced by genrecog) to communicate
105 to insn-output.c (produced by this program). */
107 static int next_code_number;
109 /* This counts all definitions in the md file,
110 for the sake of error messages. */
112 static int next_index_number;
114 /* This counts all operands used in the md file. The first is null. */
116 static int next_operand_number = 1;
118 /* Record in this chain all information about the operands we will output. */
122 struct operand_data *next;
124 const char *predicate;
125 const char *constraint;
126 enum machine_mode mode;
127 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, 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;
162 int n_operands; /* Number of operands this insn recognizes */
163 int n_dups; /* Number times match_dup appears in pattern */
164 int n_alternatives; /* Number of alternatives in each constraint */
165 int operand_number; /* Operand index in the big array. */
166 int output_format; /* INSN_OUTPUT_FORMAT_*. */
167 struct operand_data operand[MAX_MAX_OPERANDS];
170 /* This variable points to the first link in the insn chain. */
172 static struct data *idata, **idata_end = &idata;
174 static void output_prologue PARAMS ((void));
175 static void output_predicate_decls PARAMS ((void));
176 static void output_operand_data PARAMS ((void));
177 static void output_insn_data PARAMS ((void));
178 static void output_get_insn_name PARAMS ((void));
179 static void scan_operands PARAMS ((struct data *, rtx, int, int));
180 static int compare_operands PARAMS ((struct operand_data *,
181 struct operand_data *));
182 static void place_operands PARAMS ((struct data *));
183 static void process_template PARAMS ((struct data *, const char *));
184 static void validate_insn_alternatives PARAMS ((struct data *));
185 static void gen_insn PARAMS ((rtx, int));
186 static void gen_peephole PARAMS ((rtx, int));
187 static void gen_expand PARAMS ((rtx, int));
188 static void gen_split PARAMS ((rtx, int));
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 ("#include \"config.h\"\n");
220 printf ("#include \"system.h\"\n");
221 printf ("#include \"flags.h\"\n");
222 printf ("#include \"ggc.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 PARAMS ((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);
292 printf (" %d\n", d->eliminable);
302 register struct data *d;
304 int next_name_offset;
305 const char * last_name = 0;
306 const char * next_name = 0;
307 register struct data *n;
309 for (n = idata, next_name_offset = 1; n; n = n->next, next_name_offset++)
316 printf ("\nconst struct insn_data insn_data[] = \n{\n");
318 for (d = idata; d; d = d->next)
324 printf (" \"%s\",\n", d->name);
328 for (n = d->next, next_name_offset = 1; n;
329 n = n->next, next_name_offset++)
341 if (next_name && (last_name == 0
342 || name_offset > next_name_offset / 2))
343 printf (" \"%s-%d\",\n", next_name,
344 next_name_offset - name_offset);
346 printf (" \"%s+%d\",\n", last_name, name_offset);
349 switch (d->output_format)
351 case INSN_OUTPUT_FORMAT_NONE:
354 case INSN_OUTPUT_FORMAT_SINGLE:
355 printf (" \"%s\",\n", d->template);
357 case INSN_OUTPUT_FORMAT_MULTI:
358 case INSN_OUTPUT_FORMAT_FUNCTION:
359 printf (" (const PTR) output_%d,\n", d->code_number);
365 if (d->name && d->name[0] != '*')
366 printf (" (insn_gen_fn) gen_%s,\n", d->name);
370 printf (" &operand_data[%d],\n", d->operand_number);
371 printf (" %d,\n", d->n_operands);
372 printf (" %d,\n", d->n_dups);
373 printf (" %d,\n", d->n_alternatives);
374 printf (" %d\n", d->output_format);
382 output_get_insn_name ()
384 printf ("const char *\n");
385 printf ("get_insn_name (code)\n");
386 printf (" int code;\n");
388 printf (" return insn_data[code].name;\n");
393 /* Stores in max_opno the largest operand number present in `part', if
394 that is larger than the previous value of max_opno, and the rest of
395 the operand data into `d->operand[i]'.
397 THIS_ADDRESS_P is nonzero if the containing rtx was an ADDRESS.
398 THIS_STRICT_LOW is nonzero if the containing rtx was a STRICT_LOW_PART. */
404 scan_operands (d, part, this_address_p, this_strict_low)
411 register const char *format_ptr;
417 switch (GET_CODE (part))
420 opno = XINT (part, 0);
423 if (max_opno >= MAX_MAX_OPERANDS)
425 message_with_line (d->lineno,
426 "maximum number of operands exceeded");
430 if (d->operand[opno].seen)
432 message_with_line (d->lineno,
433 "repeated operand number %d\n", 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 = strip_whitespace (XSTR (part, 2));
442 d->operand[opno].n_alternatives
443 = n_occurrences (',', d->operand[opno].constraint) + 1;
444 d->operand[opno].address_p = this_address_p;
445 d->operand[opno].eliminable = 1;
449 opno = XINT (part, 0);
452 if (max_opno >= MAX_MAX_OPERANDS)
454 message_with_line (d->lineno,
455 "maximum number of operands exceeded");
459 if (d->operand[opno].seen)
461 message_with_line (d->lineno,
462 "repeated operand number %d\n", 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 = strip_whitespace (XSTR (part, 1));
471 d->operand[opno].n_alternatives
472 = n_occurrences (',', d->operand[opno].constraint) + 1;
473 d->operand[opno].address_p = 0;
474 d->operand[opno].eliminable = 0;
479 opno = XINT (part, 0);
482 if (max_opno >= MAX_MAX_OPERANDS)
484 message_with_line (d->lineno,
485 "maximum number of operands exceeded");
489 if (d->operand[opno].seen)
491 message_with_line (d->lineno,
492 "repeated operand number %d\n", opno);
496 d->operand[opno].seen = 1;
497 d->operand[opno].mode = GET_MODE (part);
498 d->operand[opno].strict_low = 0;
499 d->operand[opno].predicate = XSTR (part, 1);
500 d->operand[opno].constraint = 0;
501 d->operand[opno].address_p = 0;
502 d->operand[opno].eliminable = 0;
503 for (i = 0; i < XVECLEN (part, 2); i++)
504 scan_operands (d, XVECEXP (part, 2, i), 0, 0);
514 scan_operands (d, XEXP (part, 0), 1, 0);
517 case STRICT_LOW_PART:
518 scan_operands (d, XEXP (part, 0), 0, 1);
525 format_ptr = GET_RTX_FORMAT (GET_CODE (part));
527 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (part)); i++)
528 switch (*format_ptr++)
532 scan_operands (d, XEXP (part, i), 0, 0);
535 if (XVEC (part, i) != NULL)
536 for (j = 0; j < XVECLEN (part, i); j++)
537 scan_operands (d, XVECEXP (part, i, j), 0, 0);
542 /* Compare two operands for content equality. */
545 compare_operands (d0, d1)
546 struct operand_data *d0, *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. */
587 struct operand_data *od, *od2;
590 if (d->n_operands == 0)
592 d->operand_number = 0;
596 /* Brute force substring search. */
597 for (od = odata, i = 0; od; od = od->next, i = 0)
598 if (compare_operands (od, &d->operand[0]))
604 if (i == d->n_operands)
608 if (! compare_operands (od2, &d->operand[i]))
610 ++i, od2 = od2->next;
614 /* Either partial match at the end of the list, or no match. In either
615 case, we tack on what operands are remaining to the end of the list. */
617 d->operand_number = next_operand_number - i;
618 for (; i < d->n_operands; ++i)
620 od2 = &d->operand[i];
622 odata_end = &od2->next;
623 od2->index = next_operand_number++;
629 d->operand_number = od->index;
634 /* Process an assembler template from a define_insn or a define_peephole.
635 It is either the assembler code template, a list of assembler code
636 templates, or C code to generate the assembler code template. */
639 process_template (d, template)
641 const char *template;
643 register const char *cp;
646 /* Templates starting with * contain straight code to be run. */
647 if (template[0] == '*')
650 d->output_format = INSN_OUTPUT_FORMAT_FUNCTION;
652 printf ("\nstatic const char *output_%d PARAMS ((rtx *, rtx));\n",
654 puts ("\nstatic const char *");
655 printf ("output_%d (operands, insn)\n", d->code_number);
656 puts (" rtx *operands ATTRIBUTE_UNUSED;");
657 puts (" rtx insn ATTRIBUTE_UNUSED;");
664 /* If the assembler code template starts with a @ it is a newline-separated
665 list of assembler code templates, one for each alternative. */
666 else if (template[0] == '@')
669 d->output_format = INSN_OUTPUT_FORMAT_MULTI;
671 printf ("\nstatic const char * const output_%d[] = {\n", d->code_number);
673 for (i = 0, cp = &template[1]; *cp; )
675 while (*cp == '\n' || *cp == ' ' || *cp== '\t')
679 while (*cp != '\n' && *cp != '\0')
693 d->template = template;
694 d->output_format = INSN_OUTPUT_FORMAT_SINGLE;
698 /* Check insn D for consistency in number of constraint alternatives. */
701 validate_insn_alternatives (d)
704 register int n = 0, start;
706 /* Make sure all the operands have the same number of alternatives
707 in their constraints. Let N be that number. */
708 for (start = 0; start < d->n_operands; start++)
709 if (d->operand[start].n_alternatives > 0)
712 n = d->operand[start].n_alternatives;
713 else if (n != d->operand[start].n_alternatives)
715 message_with_line (d->lineno,
716 "wrong number of alternatives in operand %d",
722 /* Record the insn's overall number of alternatives. */
723 d->n_alternatives = n;
726 /* Look at a define_insn just read. Assign its code number. Record
727 on idata the template and the number of arguments. If the insn has
728 a hairy output action, output a function for now. */
731 gen_insn (insn, lineno)
735 register struct data *d = (struct data *) xmalloc (sizeof (struct data));
738 d->code_number = next_code_number;
739 d->index_number = next_index_number;
741 if (XSTR (insn, 0)[0])
742 d->name = XSTR (insn, 0);
746 /* Build up the list in the same order as the insns are seen
747 in the machine description. */
750 idata_end = &d->next;
754 memset (d->operand, 0, sizeof (d->operand));
756 for (i = 0; i < XVECLEN (insn, 1); i++)
757 scan_operands (d, XVECEXP (insn, 1, i), 0, 0);
759 d->n_operands = max_opno + 1;
760 d->n_dups = num_dups;
762 validate_insn_alternatives (d);
764 process_template (d, XSTR (insn, 3));
767 /* Look at a define_peephole just read. Assign its code number.
768 Record on idata the template and the number of arguments.
769 If the insn has a hairy output action, output it now. */
772 gen_peephole (peep, lineno)
776 register struct data *d = (struct data *) xmalloc (sizeof (struct data));
779 d->code_number = next_code_number;
780 d->index_number = next_index_number;
784 /* Build up the list in the same order as the insns are seen
785 in the machine description. */
788 idata_end = &d->next;
792 memset (d->operand, 0, sizeof (d->operand));
794 /* Get the number of operands by scanning all the patterns of the
795 peephole optimizer. But ignore all the rest of the information
797 for (i = 0; i < XVECLEN (peep, 0); i++)
798 scan_operands (d, XVECEXP (peep, 0, i), 0, 0);
800 d->n_operands = max_opno + 1;
803 validate_insn_alternatives (d);
805 process_template (d, XSTR (peep, 2));
808 /* Process a define_expand just read. Assign its code number,
809 only for the purposes of `insn_gen_function'. */
812 gen_expand (insn, lineno)
816 register struct data *d = (struct data *) xmalloc (sizeof (struct data));
819 d->code_number = next_code_number;
820 d->index_number = next_index_number;
822 if (XSTR (insn, 0)[0])
823 d->name = XSTR (insn, 0);
827 /* Build up the list in the same order as the insns are seen
828 in the machine description. */
831 idata_end = &d->next;
835 memset (d->operand, 0, sizeof (d->operand));
837 /* Scan the operands to get the specified predicates and modes,
838 since expand_binop needs to know them. */
841 for (i = 0; i < XVECLEN (insn, 1); i++)
842 scan_operands (d, XVECEXP (insn, 1, i), 0, 0);
844 d->n_operands = max_opno + 1;
845 d->n_dups = num_dups;
847 d->output_format = INSN_OUTPUT_FORMAT_NONE;
849 validate_insn_alternatives (d);
853 /* Process a define_split just read. Assign its code number,
854 only for reasons of consistency and to simplify genrecog. */
857 gen_split (split, lineno)
861 register struct data *d = (struct data *) xmalloc (sizeof (struct data));
864 d->code_number = next_code_number;
865 d->index_number = next_index_number;
869 /* Build up the list in the same order as the insns are seen
870 in the machine description. */
873 idata_end = &d->next;
877 memset (d->operand, 0, sizeof (d->operand));
879 /* Get the number of operands by scanning all the patterns of the
880 split patterns. But ignore all the rest of the information thus
882 for (i = 0; i < XVECLEN (split, 0); i++)
883 scan_operands (d, XVECEXP (split, 0, i), 0, 0);
885 d->n_operands = max_opno + 1;
887 d->n_alternatives = 0;
889 d->output_format = INSN_OUTPUT_FORMAT_NONE;
894 extern int main PARAMS ((int, char **));
903 progname = "genoutput";
906 fatal ("No input file name.");
908 if (init_md_reader (argv[1]) != SUCCESS_EXIT_CODE)
909 return (FATAL_EXIT_CODE);
912 next_code_number = 0;
913 next_index_number = 0;
915 /* Read the machine description. */
921 desc = read_md_rtx (&line_no, &next_code_number);
925 if (GET_CODE (desc) == DEFINE_INSN)
926 gen_insn (desc, line_no);
927 if (GET_CODE (desc) == DEFINE_PEEPHOLE)
928 gen_peephole (desc, line_no);
929 if (GET_CODE (desc) == DEFINE_EXPAND)
930 gen_expand (desc, line_no);
931 if (GET_CODE (desc) == DEFINE_SPLIT
932 || GET_CODE (desc) == DEFINE_PEEPHOLE2)
933 gen_split (desc, line_no);
938 output_predicate_decls ();
939 output_operand_data ();
941 output_get_insn_name ();
944 return (ferror (stdout) != 0 || have_error
945 ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE);
948 /* Return the number of occurrences of character C in string S or
949 -1 if S is the null string. */
958 if (s == 0 || *s == '\0')
967 /* Remove whitespace in `s' by moving up characters until the end.
968 Return a new string. */
980 p = q = xmalloc (strlen (s) + 1);
981 while ((ch = *s++) != '\0')