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 validate_insn_operands PARAMS ((struct data *));
186 static void gen_insn PARAMS ((rtx, int));
187 static void gen_peephole PARAMS ((rtx, int));
188 static void gen_expand PARAMS ((rtx, int));
189 static void gen_split PARAMS ((rtx, int));
192 get_insn_name (index)
195 static char buf[100];
197 struct data *i, *last_named = NULL;
198 for (i = idata; i ; i = i->next)
200 if (i->index_number == index)
207 sprintf(buf, "%s+%d", last_named->name, index - last_named->index_number);
209 sprintf(buf, "insn %d", index);
217 printf ("/* Generated automatically by the program `genoutput'\n\
218 from the machine description file `md'. */\n\n");
220 printf ("#include \"config.h\"\n");
221 printf ("#include \"system.h\"\n");
222 printf ("#include \"flags.h\"\n");
223 printf ("#include \"ggc.h\"\n");
224 printf ("#include \"rtl.h\"\n");
225 printf ("#include \"tm_p.h\"\n");
226 printf ("#include \"function.h\"\n");
227 printf ("#include \"regs.h\"\n");
228 printf ("#include \"hard-reg-set.h\"\n");
229 printf ("#include \"real.h\"\n");
230 printf ("#include \"insn-config.h\"\n\n");
231 printf ("#include \"conditions.h\"\n");
232 printf ("#include \"insn-attr.h\"\n\n");
233 printf ("#include \"recog.h\"\n\n");
234 printf ("#include \"toplev.h\"\n");
235 printf ("#include \"output.h\"\n");
239 /* We need to define all predicates used. Keep a list of those we
240 have defined so far. There normally aren't very many predicates
241 used, so a linked list should be fast enough. */
242 struct predicate { const char *name; struct predicate *next; };
245 output_predicate_decls ()
247 struct predicate *predicates = 0;
248 register struct operand_data *d;
249 struct predicate *p, *next;
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 *) xmalloc (sizeof (struct predicate));
263 p->name = d->predicate;
264 p->next = predicates;
270 for (p = predicates; p; p = next)
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:
361 const char *p = d->template;
367 if (*p == '\n' && prev != '\\')
377 case INSN_OUTPUT_FORMAT_MULTI:
378 case INSN_OUTPUT_FORMAT_FUNCTION:
379 printf (" (const PTR) output_%d,\n", d->code_number);
385 if (d->name && d->name[0] != '*')
386 printf (" (insn_gen_fn) gen_%s,\n", d->name);
390 printf (" &operand_data[%d],\n", d->operand_number);
391 printf (" %d,\n", d->n_operands);
392 printf (" %d,\n", d->n_dups);
393 printf (" %d,\n", d->n_alternatives);
394 printf (" %d\n", d->output_format);
402 output_get_insn_name ()
404 printf ("const char *\n");
405 printf ("get_insn_name (code)\n");
406 printf (" int code;\n");
408 printf (" return insn_data[code].name;\n");
413 /* Stores in max_opno the largest operand number present in `part', if
414 that is larger than the previous value of max_opno, and the rest of
415 the operand data into `d->operand[i]'.
417 THIS_ADDRESS_P is nonzero if the containing rtx was an ADDRESS.
418 THIS_STRICT_LOW is nonzero if the containing rtx was a STRICT_LOW_PART. */
424 scan_operands (d, part, this_address_p, this_strict_low)
431 register const char *format_ptr;
437 switch (GET_CODE (part))
440 opno = XINT (part, 0);
443 if (max_opno >= MAX_MAX_OPERANDS)
445 message_with_line (d->lineno,
446 "maximum number of operands exceeded");
450 if (d->operand[opno].seen)
452 message_with_line (d->lineno,
453 "repeated operand number %d\n", opno);
457 d->operand[opno].seen = 1;
458 d->operand[opno].mode = GET_MODE (part);
459 d->operand[opno].strict_low = this_strict_low;
460 d->operand[opno].predicate = XSTR (part, 1);
461 d->operand[opno].constraint = strip_whitespace (XSTR (part, 2));
462 d->operand[opno].n_alternatives
463 = n_occurrences (',', d->operand[opno].constraint) + 1;
464 d->operand[opno].address_p = this_address_p;
465 d->operand[opno].eliminable = 1;
469 opno = XINT (part, 0);
472 if (max_opno >= MAX_MAX_OPERANDS)
474 message_with_line (d->lineno,
475 "maximum number of operands exceeded");
479 if (d->operand[opno].seen)
481 message_with_line (d->lineno,
482 "repeated operand number %d\n", opno);
486 d->operand[opno].seen = 1;
487 d->operand[opno].mode = GET_MODE (part);
488 d->operand[opno].strict_low = 0;
489 d->operand[opno].predicate = "scratch_operand";
490 d->operand[opno].constraint = strip_whitespace (XSTR (part, 1));
491 d->operand[opno].n_alternatives
492 = n_occurrences (',', d->operand[opno].constraint) + 1;
493 d->operand[opno].address_p = 0;
494 d->operand[opno].eliminable = 0;
499 opno = XINT (part, 0);
502 if (max_opno >= MAX_MAX_OPERANDS)
504 message_with_line (d->lineno,
505 "maximum number of operands exceeded");
509 if (d->operand[opno].seen)
511 message_with_line (d->lineno,
512 "repeated operand number %d\n", opno);
516 d->operand[opno].seen = 1;
517 d->operand[opno].mode = GET_MODE (part);
518 d->operand[opno].strict_low = 0;
519 d->operand[opno].predicate = XSTR (part, 1);
520 d->operand[opno].constraint = 0;
521 d->operand[opno].address_p = 0;
522 d->operand[opno].eliminable = 0;
523 for (i = 0; i < XVECLEN (part, 2); i++)
524 scan_operands (d, XVECEXP (part, 2, i), 0, 0);
534 scan_operands (d, XEXP (part, 0), 1, 0);
537 case STRICT_LOW_PART:
538 scan_operands (d, XEXP (part, 0), 0, 1);
545 format_ptr = GET_RTX_FORMAT (GET_CODE (part));
547 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (part)); i++)
548 switch (*format_ptr++)
552 scan_operands (d, XEXP (part, i), 0, 0);
555 if (XVEC (part, i) != NULL)
556 for (j = 0; j < XVECLEN (part, i); j++)
557 scan_operands (d, XVECEXP (part, i, j), 0, 0);
562 /* Compare two operands for content equality. */
565 compare_operands (d0, d1)
566 struct operand_data *d0, *d1;
576 if (strcmp (p0, p1) != 0)
585 if (strcmp (p0, p1) != 0)
588 if (d0->mode != d1->mode)
591 if (d0->strict_low != d1->strict_low)
594 if (d0->eliminable != d1->eliminable)
600 /* Scan the list of operands we've already committed to output and either
601 find a subsequence that is the same, or allocate a new one at the end. */
607 struct operand_data *od, *od2;
610 if (d->n_operands == 0)
612 d->operand_number = 0;
616 /* Brute force substring search. */
617 for (od = odata, i = 0; od; od = od->next, i = 0)
618 if (compare_operands (od, &d->operand[0]))
624 if (i == d->n_operands)
628 if (! compare_operands (od2, &d->operand[i]))
630 ++i, od2 = od2->next;
634 /* Either partial match at the end of the list, or no match. In either
635 case, we tack on what operands are remaining to the end of the list. */
637 d->operand_number = next_operand_number - i;
638 for (; i < d->n_operands; ++i)
640 od2 = &d->operand[i];
642 odata_end = &od2->next;
643 od2->index = next_operand_number++;
649 d->operand_number = od->index;
654 /* Process an assembler template from a define_insn or a define_peephole.
655 It is either the assembler code template, a list of assembler code
656 templates, or C code to generate the assembler code template. */
659 process_template (d, template)
661 const char *template;
663 register const char *cp;
666 /* Templates starting with * contain straight code to be run. */
667 if (template[0] == '*')
670 d->output_format = INSN_OUTPUT_FORMAT_FUNCTION;
672 printf ("\nstatic const char *output_%d PARAMS ((rtx *, rtx));\n",
674 puts ("\nstatic const char *");
675 printf ("output_%d (operands, insn)\n", d->code_number);
676 puts (" rtx *operands ATTRIBUTE_UNUSED;");
677 puts (" rtx insn ATTRIBUTE_UNUSED;");
684 /* If the assembler code template starts with a @ it is a newline-separated
685 list of assembler code templates, one for each alternative. */
686 else if (template[0] == '@')
689 d->output_format = INSN_OUTPUT_FORMAT_MULTI;
691 printf ("\nstatic const char * const output_%d[] = {\n", d->code_number);
693 for (i = 0, cp = &template[1]; *cp; )
695 while (*cp == '\n' || *cp == ' ' || *cp== '\t')
699 while (*cp != '\n' && *cp != '\0')
709 message_with_line (d->lineno,
710 "'@' is redundant for output template with single alternative");
711 if (i != d->n_alternatives)
713 message_with_line (d->lineno,
714 "Wrong number of alternatives in the output template");
722 d->template = template;
723 d->output_format = INSN_OUTPUT_FORMAT_SINGLE;
727 /* Check insn D for consistency in number of constraint alternatives. */
730 validate_insn_alternatives (d)
733 register int n = 0, start;
735 /* Make sure all the operands have the same number of alternatives
736 in their constraints. Let N be that number. */
737 for (start = 0; start < d->n_operands; start++)
738 if (d->operand[start].n_alternatives > 0)
741 n = d->operand[start].n_alternatives;
742 else if (n != d->operand[start].n_alternatives)
744 message_with_line (d->lineno,
745 "wrong number of alternatives in operand %d",
751 /* Record the insn's overall number of alternatives. */
752 d->n_alternatives = n;
755 /* Verify that there are no gaps in operand numbers for INSNs. */
758 validate_insn_operands (d)
763 for (i = 0; i < d->n_operands; ++i)
764 if (d->operand[i].seen == 0)
766 message_with_line (d->lineno, "missing operand %d", i);
771 /* Look at a define_insn just read. Assign its code number. Record
772 on idata the template and the number of arguments. If the insn has
773 a hairy output action, output a function for now. */
776 gen_insn (insn, lineno)
780 register struct data *d = (struct data *) xmalloc (sizeof (struct data));
783 d->code_number = next_code_number;
784 d->index_number = next_index_number;
786 if (XSTR (insn, 0)[0])
787 d->name = XSTR (insn, 0);
791 /* Build up the list in the same order as the insns are seen
792 in the machine description. */
795 idata_end = &d->next;
799 memset (d->operand, 0, sizeof (d->operand));
801 for (i = 0; i < XVECLEN (insn, 1); i++)
802 scan_operands (d, XVECEXP (insn, 1, i), 0, 0);
804 d->n_operands = max_opno + 1;
805 d->n_dups = num_dups;
807 validate_insn_operands (d);
808 validate_insn_alternatives (d);
810 process_template (d, XSTR (insn, 3));
813 /* Look at a define_peephole just read. Assign its code number.
814 Record on idata the template and the number of arguments.
815 If the insn has a hairy output action, output it now. */
818 gen_peephole (peep, lineno)
822 register struct data *d = (struct data *) xmalloc (sizeof (struct data));
825 d->code_number = next_code_number;
826 d->index_number = next_index_number;
830 /* Build up the list in the same order as the insns are seen
831 in the machine description. */
834 idata_end = &d->next;
838 memset (d->operand, 0, sizeof (d->operand));
840 /* Get the number of operands by scanning all the patterns of the
841 peephole optimizer. But ignore all the rest of the information
843 for (i = 0; i < XVECLEN (peep, 0); i++)
844 scan_operands (d, XVECEXP (peep, 0, i), 0, 0);
846 d->n_operands = max_opno + 1;
849 validate_insn_alternatives (d);
851 process_template (d, XSTR (peep, 2));
854 /* Process a define_expand just read. Assign its code number,
855 only for the purposes of `insn_gen_function'. */
858 gen_expand (insn, lineno)
862 register struct data *d = (struct data *) xmalloc (sizeof (struct data));
865 d->code_number = next_code_number;
866 d->index_number = next_index_number;
868 if (XSTR (insn, 0)[0])
869 d->name = XSTR (insn, 0);
873 /* Build up the list in the same order as the insns are seen
874 in the machine description. */
877 idata_end = &d->next;
881 memset (d->operand, 0, sizeof (d->operand));
883 /* Scan the operands to get the specified predicates and modes,
884 since expand_binop needs to know them. */
887 for (i = 0; i < XVECLEN (insn, 1); i++)
888 scan_operands (d, XVECEXP (insn, 1, i), 0, 0);
890 d->n_operands = max_opno + 1;
891 d->n_dups = num_dups;
893 d->output_format = INSN_OUTPUT_FORMAT_NONE;
895 validate_insn_alternatives (d);
899 /* Process a define_split just read. Assign its code number,
900 only for reasons of consistency and to simplify genrecog. */
903 gen_split (split, lineno)
907 register struct data *d = (struct data *) xmalloc (sizeof (struct data));
910 d->code_number = next_code_number;
911 d->index_number = next_index_number;
915 /* Build up the list in the same order as the insns are seen
916 in the machine description. */
919 idata_end = &d->next;
923 memset (d->operand, 0, sizeof (d->operand));
925 /* Get the number of operands by scanning all the patterns of the
926 split patterns. But ignore all the rest of the information thus
928 for (i = 0; i < XVECLEN (split, 0); i++)
929 scan_operands (d, XVECEXP (split, 0, i), 0, 0);
931 d->n_operands = max_opno + 1;
933 d->n_alternatives = 0;
935 d->output_format = INSN_OUTPUT_FORMAT_NONE;
940 extern int main PARAMS ((int, char **));
949 progname = "genoutput";
952 fatal ("No input file name.");
954 if (init_md_reader (argv[1]) != SUCCESS_EXIT_CODE)
955 return (FATAL_EXIT_CODE);
958 next_code_number = 0;
959 next_index_number = 0;
961 /* Read the machine description. */
967 desc = read_md_rtx (&line_no, &next_code_number);
971 if (GET_CODE (desc) == DEFINE_INSN)
972 gen_insn (desc, line_no);
973 if (GET_CODE (desc) == DEFINE_PEEPHOLE)
974 gen_peephole (desc, line_no);
975 if (GET_CODE (desc) == DEFINE_EXPAND)
976 gen_expand (desc, line_no);
977 if (GET_CODE (desc) == DEFINE_SPLIT
978 || GET_CODE (desc) == DEFINE_PEEPHOLE2)
979 gen_split (desc, line_no);
984 output_predicate_decls ();
985 output_operand_data ();
987 output_get_insn_name ();
990 return (ferror (stdout) != 0 || have_error
991 ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE);
994 /* Return the number of occurrences of character C in string S or
995 -1 if S is the null string. */
1004 if (s == 0 || *s == '\0')
1013 /* Remove whitespace in `s' by moving up characters until the end.
1014 Return a new string. */
1017 strip_whitespace (s)
1026 p = q = xmalloc (strlen (s) + 1);
1027 while ((ch = *s++) != '\0')