1 /* Generate code from to output assembler insns as recognized from rtl.
2 Copyright (C) 1987, 88, 92, 94, 95, 1997 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
22 /* This program reads the machine description for the compiler target machine
23 and produces a file containing these things:
25 1. An array of strings `insn_template' which is indexed by insn code number
26 and contains the template for output of that insn,
28 2. An array of functions `insn_outfun' which, indexed by the insn code
29 number, gives the function that returns a template to use for output of
30 that insn. This is used only in the cases where the template is not
31 constant. These cases are specified by a * or @ at the beginning of the
32 template string in the machine description. They are identified for the
33 sake of other parts of the compiler by a zero element in `insn_template'.
35 3. An array of functions `insn_gen_function' which, indexed
36 by insn code number, gives the function to generate a body
37 for that pattern, given operands as arguments.
39 4. An array of strings `insn_name' which, indexed by insn code number,
40 gives the name for that pattern. Nameless patterns are given a name.
42 5. An array of ints `insn_n_operands' which is indexed by insn code number
43 and contains the number of distinct operands in the pattern for that insn,
45 6. An array of ints `insn_n_dups' which is indexed by insn code number
46 and contains the number of match_dup's that appear in the insn's pattern.
47 This says how many elements of `recog_dup_loc' are significant
48 after an insn has been recognized.
50 7. An array of arrays of operand constraint strings,
51 `insn_operand_constraint',
52 indexed first by insn code number and second by operand number,
53 containing the constraint for that operand.
55 This array is generated only if register constraints appear in
58 8. An array of arrays of chars which indicate which operands of
59 which insn patterns appear within ADDRESS rtx's. This array is
60 called `insn_operand_address_p' and is generated only if there
61 are *no* register constraints in the match_operand rtx's.
63 9. An array of arrays of machine modes, `insn_operand_mode',
64 indexed first by insn code number and second by operand number,
65 containing the machine mode that that operand is supposed to have.
66 Also `insn_operand_strict_low', which is nonzero for operands
67 contained in a STRICT_LOW_PART.
69 10. An array of arrays of int-valued functions, `insn_operand_predicate',
70 indexed first by insn code number and second by operand number,
71 containing the match_operand predicate for this operand.
73 11. An array of ints, `insn_n_alternatives', that gives the number
74 of alternatives in the constraints of each pattern.
76 The code number of an insn is simply its position in the machine description;
77 code numbers are assigned sequentially to entries in the description,
78 starting with code number 0.
80 Thus, the following entry in the machine description
83 [(set (match_operand:DF 0 "general_operand" "")
88 assuming it is the 25th entry present, would cause
89 insn_template[24] to be "clrd %0", and insn_n_operands[24] to be 1.
90 It would not make an case in output_insn_hairy because the template
91 given in the entry is a constant (it does not start with `*'). */
98 /* No instruction can have more operands than this.
99 Sorry for this arbitrary limit, but what machine will
100 have an instruction with this many operands? */
102 #define MAX_MAX_OPERANDS 40
104 static struct obstack obstack;
105 struct obstack *rtl_obstack = &obstack;
107 #define obstack_chunk_alloc xmalloc
108 #define obstack_chunk_free free
111 extern rtx read_rtx ();
114 static void fatal ();
116 static void error ();
117 static void mybcopy ();
118 static void mybzero ();
119 static int n_occurrences ();
121 /* insns in the machine description are assigned sequential code numbers
122 that are used by insn-recog.c (produced by genrecog) to communicate
123 to insn-output.c (produced by this program). */
125 static int next_code_number;
127 /* This counts all definitions in the md file,
128 for the sake of error messages. */
130 static int next_index_number;
132 /* Record in this chain all information that we will output,
133 associated with the code number of the insn. */
140 char *template; /* string such as "movl %1,%0" */
141 int n_operands; /* Number of operands this insn recognizes */
142 int n_dups; /* Number times match_dup appears in pattern */
143 int n_alternatives; /* Number of alternatives in each constraint */
145 char *constraints[MAX_MAX_OPERANDS];
146 /* Number of alternatives in constraints of operand N. */
147 int op_n_alternatives[MAX_MAX_OPERANDS];
148 char *predicates[MAX_MAX_OPERANDS];
149 char address_p[MAX_MAX_OPERANDS];
150 enum machine_mode modes[MAX_MAX_OPERANDS];
151 char strict_low[MAX_MAX_OPERANDS];
152 char outfun; /* Nonzero means this has an output function */
155 /* This variable points to the first link in the chain. */
157 struct data *insn_data;
159 /* Pointer to the last link in the chain, so new elements
160 can be added at the end. */
162 struct data *end_of_insn_data;
164 /* Nonzero if any match_operand has a constraint string;
165 implies that REGISTER_CONSTRAINTS will be defined
166 for this machine description. */
168 int have_constraints;
170 /* Nonzero if some error has occurred. We will make all errors fatal, but
171 might as well continue until we see all of them. */
173 static int have_error;
179 printf ("/* Generated automatically by the program `genoutput'\n\
180 from the machine description file `md'. */\n\n");
182 printf ("#include \"config.h\"\n");
183 printf ("#include \"rtl.h\"\n");
184 printf ("#include \"regs.h\"\n");
185 printf ("#include \"hard-reg-set.h\"\n");
186 printf ("#include \"real.h\"\n");
187 printf ("#include \"insn-config.h\"\n\n");
188 printf ("#include \"conditions.h\"\n");
189 printf ("#include \"insn-flags.h\"\n");
190 printf ("#include \"insn-attr.h\"\n\n");
191 printf ("#include \"insn-codes.h\"\n\n");
192 printf ("#include \"recog.h\"\n\n");
194 printf ("#include <stdio.h>\n");
195 printf ("#include \"output.h\"\n");
201 register struct data *d;
203 printf ("\nchar * const insn_template[] =\n {\n");
204 for (d = insn_data; d; d = d->next)
207 printf (" \"%s\",\n", d->template);
213 printf ("\nchar *(*const insn_outfun[])() =\n {\n");
214 for (d = insn_data; d; d = d->next)
217 printf (" output_%d,\n", d->code_number);
223 printf ("\nrtx (*const insn_gen_function[]) () =\n {\n");
224 for (d = insn_data; d; d = d->next)
226 if (d->name && d->name[0] != '*')
227 printf (" gen_%s,\n", d->name);
233 printf ("\nchar *insn_name[] =\n {\n");
237 char * last_name = 0;
239 register struct data *n;
241 for (n = insn_data, next = 1; n; n = n->next, next++)
248 for (d = insn_data; d; d = d->next)
252 printf (" \"%s\",\n", d->name);
256 for (n = d->next, next = 1; n; n = n->next, next++)
266 if (next_name && (last_name == 0 || offset > next / 2))
267 printf (" \"%s-%d\",\n", next_name, next - offset);
269 printf (" \"%s+%d\",\n", last_name, offset);
274 printf ("char **insn_name_ptr = insn_name;\n");
276 printf ("\nconst int insn_n_operands[] =\n {\n");
277 for (d = insn_data; d; d = d->next)
278 printf (" %d,\n", d->n_operands);
281 printf ("\nconst int insn_n_dups[] =\n {\n");
282 for (d = insn_data; d; d = d->next)
283 printf (" %d,\n", d->n_dups);
286 if (have_constraints)
288 printf ("\nchar *const insn_operand_constraint[][MAX_RECOG_OPERANDS] =\n {\n");
289 for (d = insn_data; d; d = d->next)
293 for (i = 0; i < d->n_operands; i++)
295 if (d->constraints[i] == 0)
298 printf (" \"%s\",", d->constraints[i]);
300 if (d->n_operands == 0)
308 printf ("\nconst char insn_operand_address_p[][MAX_RECOG_OPERANDS] =\n {\n");
309 for (d = insn_data; d; d = d->next)
313 for (i = 0; i < d->n_operands; i++)
314 printf (" %d,", d->address_p[i]);
315 if (d->n_operands == 0)
322 printf ("\nconst enum machine_mode insn_operand_mode[][MAX_RECOG_OPERANDS] =\n {\n");
323 for (d = insn_data; d; d = d->next)
327 for (i = 0; i < d->n_operands; i++)
328 printf (" %smode,", GET_MODE_NAME (d->modes[i]));
329 if (d->n_operands == 0)
330 printf (" VOIDmode");
335 printf ("\nconst char insn_operand_strict_low[][MAX_RECOG_OPERANDS] =\n {\n");
336 for (d = insn_data; d; d = d->next)
340 for (i = 0; i < d->n_operands; i++)
341 printf (" %d,", d->strict_low[i]);
342 if (d->n_operands == 0)
349 /* We need to define all predicates used. Keep a list of those we
350 have defined so far. There normally aren't very many predicates used,
351 so a linked list should be fast enough. */
352 struct predicate { char *name; struct predicate *next; } *predicates = 0;
357 for (d = insn_data; d; d = d->next)
358 for (i = 0; i < d->n_operands; i++)
359 if (d->predicates[i] && d->predicates[i][0])
361 for (p = predicates; p; p = p->next)
362 if (! strcmp (p->name, d->predicates[i]))
367 printf ("extern int %s ();\n", d->predicates[i]);
368 p = (struct predicate *) alloca (sizeof (struct predicate));
369 p->name = d->predicates[i];
370 p->next = predicates;
375 printf ("\nint (*const insn_operand_predicate[][MAX_RECOG_OPERANDS])() =\n {\n");
376 for (d = insn_data; d; d = d->next)
379 for (i = 0; i < d->n_operands; i++)
380 printf (" %s,", ((d->predicates[i] && d->predicates[i][0])
381 ? d->predicates[i] : "0"));
382 if (d->n_operands == 0)
389 printf ("\nconst int insn_n_alternatives[] =\n {\n");
390 for (d = insn_data; d; d = d->next)
391 printf (" %d,\n", d->n_alternatives);
395 /* scan_operands (X) stores in max_opno the largest operand
396 number present in X, if that is larger than the previous
397 value of max_opno. It stores all the constraints in `constraints'
398 and all the machine modes in `modes'.
400 THIS_ADDRESS_P is nonzero if the containing rtx was an ADDRESS.
401 THIS_STRICT_LOW is nonzero if the containing rtx was a STRICT_LOW_PART. */
405 static char *constraints[MAX_MAX_OPERANDS];
406 static int op_n_alternatives[MAX_MAX_OPERANDS];
407 static char *predicates[MAX_MAX_OPERANDS];
408 static char address_p[MAX_MAX_OPERANDS];
409 static enum machine_mode modes[MAX_MAX_OPERANDS];
410 static char strict_low[MAX_MAX_OPERANDS];
411 static char seen[MAX_MAX_OPERANDS];
414 scan_operands (part, this_address_p, this_strict_low)
420 register char *format_ptr;
426 switch (GET_CODE (part))
429 opno = XINT (part, 0);
432 if (max_opno >= MAX_MAX_OPERANDS)
434 error ("Too many operands (%d) in definition %d.\n",
435 max_opno + 1, next_index_number);
439 error ("Definition %d specified operand number %d more than once.\n",
440 next_index_number, opno);
442 modes[opno] = GET_MODE (part);
443 strict_low[opno] = this_strict_low;
444 predicates[opno] = XSTR (part, 1);
445 constraints[opno] = XSTR (part, 2);
446 if (XSTR (part, 2) != 0 && *XSTR (part, 2) != 0)
448 op_n_alternatives[opno] = n_occurrences (',', XSTR (part, 2)) + 1;
449 have_constraints = 1;
451 address_p[opno] = this_address_p;
455 opno = XINT (part, 0);
458 if (max_opno >= MAX_MAX_OPERANDS)
460 error ("Too many operands (%d) in definition %d.\n",
461 max_opno + 1, next_index_number);
465 error ("Definition %d specified operand number %d more than once.\n",
466 next_index_number, opno);
468 modes[opno] = GET_MODE (part);
469 strict_low[opno] = 0;
470 predicates[opno] = "scratch_operand";
471 constraints[opno] = XSTR (part, 1);
472 if (XSTR (part, 1) != 0 && *XSTR (part, 1) != 0)
474 op_n_alternatives[opno] = n_occurrences (',', XSTR (part, 1)) + 1;
475 have_constraints = 1;
482 opno = XINT (part, 0);
485 if (max_opno >= MAX_MAX_OPERANDS)
487 error ("Too many operands (%d) in definition %d.\n",
488 max_opno + 1, next_index_number);
492 error ("Definition %d specified operand number %d more than once.\n",
493 next_index_number, opno);
495 modes[opno] = GET_MODE (part);
496 strict_low[opno] = 0;
497 predicates[opno] = XSTR (part, 1);
498 constraints[opno] = 0;
500 for (i = 0; i < XVECLEN (part, 2); i++)
501 scan_operands (XVECEXP (part, 2, i), 0, 0);
511 scan_operands (XEXP (part, 0), 1, 0);
514 case STRICT_LOW_PART:
515 scan_operands (XEXP (part, 0), 0, 1);
519 format_ptr = GET_RTX_FORMAT (GET_CODE (part));
521 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (part)); i++)
522 switch (*format_ptr++)
525 scan_operands (XEXP (part, i), 0, 0);
528 if (XVEC (part, i) != NULL)
529 for (j = 0; j < XVECLEN (part, i); j++)
530 scan_operands (XVECEXP (part, i, j), 0, 0);
535 /* Process an assembler template from a define_insn or a define_peephole.
536 It is either the assembler code template, a list of assembler code
537 templates, or C code to generate the assembler code template. */
540 process_template (d, template)
547 /* We need to consider only the instructions whose assembler code template
548 starts with a * or @. These are the ones where C code is run to decide
549 on a template to use. So for all others just return now. */
551 if (template[0] != '*' && template[0] != '@')
553 d->template = template;
561 printf ("\nstatic char *\n");
562 printf ("output_%d (operands, insn)\n", d->code_number);
563 printf (" rtx *operands;\n");
564 printf (" rtx insn;\n");
567 /* If the assembler code template starts with a @ it is a newline-separated
568 list of assembler code templates, one for each alternative. So produce
569 a routine to select the correct one. */
571 if (template[0] == '@')
574 printf (" static /*const*/ char *const strings_%d[] = {\n",
577 for (i = 0, cp = &template[1]; *cp; )
579 while (*cp == '\n' || *cp == ' ' || *cp== '\t')
583 while (*cp != '\n' && *cp != '\0')
594 printf (" return strings_%d[which_alternative];\n", d->code_number);
596 if (i != d->n_alternatives)
597 fatal ("Insn pattern %d has %d alternatives but %d assembler choices",
598 d->index_number, d->n_alternatives, i);
603 /* The following is done in a funny way to get around problems in
604 VAX-11 "C" on VMS. It is the equivalent of:
605 printf ("%s\n", &template[1])); */
618 /* Check insn D for consistency in number of constraint alternatives. */
621 validate_insn_alternatives (d)
624 register int n = 0, start;
625 /* Make sure all the operands have the same number of
626 alternatives in their constraints.
627 Let N be that number. */
628 for (start = 0; start < d->n_operands; start++)
629 if (d->op_n_alternatives[start] > 0)
632 n = d->op_n_alternatives[start];
633 else if (n != d->op_n_alternatives[start])
634 error ("wrong number of alternatives in operand %d of insn number %d",
635 start, d->index_number);
637 /* Record the insn's overall number of alternatives. */
638 d->n_alternatives = n;
641 /* Look at a define_insn just read. Assign its code number.
642 Record on insn_data the template and the number of arguments.
643 If the insn has a hairy output action, output a function for now. */
649 register struct data *d = (struct data *) xmalloc (sizeof (struct data));
652 d->code_number = next_code_number++;
653 d->index_number = next_index_number;
654 if (XSTR (insn, 0)[0])
655 d->name = XSTR (insn, 0);
659 /* Build up the list in the same order as the insns are seen
660 in the machine description. */
662 if (end_of_insn_data)
663 end_of_insn_data->next = d;
667 end_of_insn_data = d;
672 mybzero (constraints, sizeof constraints);
673 mybzero (op_n_alternatives, sizeof op_n_alternatives);
674 mybzero (predicates, sizeof predicates);
675 mybzero (address_p, sizeof address_p);
676 mybzero (modes, sizeof modes);
677 mybzero (strict_low, sizeof strict_low);
678 mybzero (seen, sizeof seen);
680 for (i = 0; i < XVECLEN (insn, 1); i++)
681 scan_operands (XVECEXP (insn, 1, i), 0, 0);
683 d->n_operands = max_opno + 1;
684 d->n_dups = num_dups;
686 mybcopy (constraints, d->constraints, sizeof constraints);
687 mybcopy (op_n_alternatives, d->op_n_alternatives, sizeof op_n_alternatives);
688 mybcopy (predicates, d->predicates, sizeof predicates);
689 mybcopy (address_p, d->address_p, sizeof address_p);
690 mybcopy (modes, d->modes, sizeof modes);
691 mybcopy (strict_low, d->strict_low, sizeof strict_low);
693 validate_insn_alternatives (d);
694 process_template (d, XSTR (insn, 3));
697 /* Look at a define_peephole just read. Assign its code number.
698 Record on insn_data the template and the number of arguments.
699 If the insn has a hairy output action, output it now. */
705 register struct data *d = (struct data *) xmalloc (sizeof (struct data));
708 d->code_number = next_code_number++;
709 d->index_number = next_index_number;
712 /* Build up the list in the same order as the insns are seen
713 in the machine description. */
715 if (end_of_insn_data)
716 end_of_insn_data->next = d;
720 end_of_insn_data = d;
723 mybzero (constraints, sizeof constraints);
724 mybzero (op_n_alternatives, sizeof op_n_alternatives);
725 mybzero (predicates, sizeof predicates);
726 mybzero (address_p, sizeof address_p);
727 mybzero (modes, sizeof modes);
728 mybzero (strict_low, sizeof strict_low);
729 mybzero (seen, sizeof seen);
731 /* Get the number of operands by scanning all the
732 patterns of the peephole optimizer.
733 But ignore all the rest of the information thus obtained. */
734 for (i = 0; i < XVECLEN (peep, 0); i++)
735 scan_operands (XVECEXP (peep, 0, i), 0, 0);
737 d->n_operands = max_opno + 1;
740 mybcopy (constraints, d->constraints, sizeof constraints);
741 mybcopy (op_n_alternatives, d->op_n_alternatives, sizeof op_n_alternatives);
742 mybzero (d->predicates, sizeof predicates);
743 mybzero (d->address_p, sizeof address_p);
744 mybzero (d->modes, sizeof modes);
745 mybzero (d->strict_low, sizeof strict_low);
747 validate_insn_alternatives (d);
748 process_template (d, XSTR (peep, 2));
751 /* Process a define_expand just read. Assign its code number,
752 only for the purposes of `insn_gen_function'. */
758 register struct data *d = (struct data *) xmalloc (sizeof (struct data));
761 d->code_number = next_code_number++;
762 d->index_number = next_index_number;
763 if (XSTR (insn, 0)[0])
764 d->name = XSTR (insn, 0);
768 /* Build up the list in the same order as the insns are seen
769 in the machine description. */
771 if (end_of_insn_data)
772 end_of_insn_data->next = d;
776 end_of_insn_data = d;
781 /* Scan the operands to get the specified predicates and modes,
782 since expand_binop needs to know them. */
784 mybzero (constraints, sizeof constraints);
785 mybzero (op_n_alternatives, sizeof op_n_alternatives);
786 mybzero (predicates, sizeof predicates);
787 mybzero (address_p, sizeof address_p);
788 mybzero (modes, sizeof modes);
789 mybzero (strict_low, sizeof strict_low);
790 mybzero (seen, sizeof seen);
793 for (i = 0; i < XVECLEN (insn, 1); i++)
794 scan_operands (XVECEXP (insn, 1, i), 0, 0);
796 d->n_operands = max_opno + 1;
797 d->n_dups = num_dups;
799 mybcopy (constraints, d->constraints, sizeof constraints);
800 mybcopy (op_n_alternatives, d->op_n_alternatives, sizeof op_n_alternatives);
801 mybcopy (predicates, d->predicates, sizeof predicates);
802 mybcopy (address_p, d->address_p, sizeof address_p);
803 mybcopy (modes, d->modes, sizeof modes);
804 mybcopy (strict_low, d->strict_low, sizeof strict_low);
808 validate_insn_alternatives (d);
811 /* Process a define_split just read. Assign its code number,
812 only for reasons of consistency and to simplify genrecog. */
819 register struct data *d = (struct data *) xmalloc (sizeof (struct data));
822 d->code_number = next_code_number++;
823 d->index_number = next_index_number;
826 /* Build up the list in the same order as the insns are seen
827 in the machine description. */
829 if (end_of_insn_data)
830 end_of_insn_data->next = d;
834 end_of_insn_data = d;
839 mybzero (constraints, sizeof constraints);
840 mybzero (op_n_alternatives, sizeof op_n_alternatives);
841 mybzero (predicates, sizeof predicates);
842 mybzero (address_p, sizeof address_p);
843 mybzero (modes, sizeof modes);
844 mybzero (strict_low, sizeof strict_low);
845 mybzero (seen, sizeof seen);
847 /* Get the number of operands by scanning all the
848 patterns of the split patterns.
849 But ignore all the rest of the information thus obtained. */
850 for (i = 0; i < XVECLEN (split, 0); i++)
851 scan_operands (XVECEXP (split, 0, i), 0, 0);
853 d->n_operands = max_opno + 1;
855 mybzero (d->constraints, sizeof constraints);
856 mybzero (d->op_n_alternatives, sizeof op_n_alternatives);
857 mybzero (d->predicates, sizeof predicates);
858 mybzero (d->address_p, sizeof address_p);
859 mybzero (d->modes, sizeof modes);
860 mybzero (d->strict_low, sizeof strict_low);
863 d->n_alternatives = 0;
872 register char *val = (char *) malloc (size);
875 fatal ("virtual memory exhausted");
884 char *result = (char *) realloc (ptr, size);
886 fatal ("virtual memory exhausted");
893 register unsigned length;
900 mybcopy (b1, b2, length)
903 register unsigned length;
910 fatal (s, a1, a2, a3, a4)
913 fprintf (stderr, "genoutput: ");
914 fprintf (stderr, s, a1, a2, a3, a4);
915 fprintf (stderr, "\n");
916 exit (FATAL_EXIT_CODE);
919 /* More 'friendly' abort that prints the line and file.
920 config.h can #define abort fancy_abort if you like that sort of thing. */
925 fatal ("Internal gcc abort.");
932 fprintf (stderr, "genoutput: ");
933 fprintf (stderr, s, a1, a2);
934 fprintf (stderr, "\n");
948 obstack_init (rtl_obstack);
951 fatal ("No input file name.");
953 infile = fopen (argv[1], "r");
957 exit (FATAL_EXIT_CODE);
963 next_code_number = 0;
964 next_index_number = 0;
965 have_constraints = 0;
967 /* Read the machine description. */
971 c = read_skip_spaces (infile);
976 desc = read_rtx (infile);
977 if (GET_CODE (desc) == DEFINE_INSN)
979 if (GET_CODE (desc) == DEFINE_PEEPHOLE)
981 if (GET_CODE (desc) == DEFINE_EXPAND)
983 if (GET_CODE (desc) == DEFINE_SPLIT)
991 exit (ferror (stdout) != 0 || have_error
992 ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE);