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
;
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. */
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 /* Nonzero if any match_operand has a constraint string; implies that
174 REGISTER_CONSTRAINTS will be defined for this machine description. */
176 static int have_constraints
;
179 static void output_prologue
PROTO((void));
180 static void output_predicate_decls
PROTO((void));
181 static void output_operand_data
PROTO((void));
182 static void output_insn_data
PROTO((void));
183 static void output_get_insn_name
PROTO((void));
184 static void scan_operands
PROTO((struct data
*, rtx
, int, int));
185 static int compare_operands
PROTO((struct operand_data
*,
186 struct operand_data
*));
187 static void place_operands
PROTO((struct data
*));
188 static void process_template
PROTO((struct data
*, char *));
189 static void validate_insn_alternatives
PROTO((struct data
*));
190 static void gen_insn
PROTO((rtx
));
191 static void gen_peephole
PROTO((rtx
));
192 static void gen_expand
PROTO((rtx
));
193 static void gen_split
PROTO((rtx
));
194 static int n_occurrences
PROTO((int, char *));
197 get_insn_name (index
)
200 static char buf
[100];
202 struct data
*i
, *last_named
= NULL
;
203 for (i
= idata
; i
; i
= i
->next
)
205 if (i
->index_number
== index
)
212 sprintf(buf
, "%s+%d", last_named
->name
, index
- last_named
->index_number
);
214 sprintf(buf
, "insn %d", index
);
222 printf ("/* Generated automatically by the program `genoutput'\n\
223 from the machine description file `md'. */\n\n");
225 printf ("#define NO_MD_PROTOTYPES\n");
226 printf ("#include \"config.h\"\n");
227 printf ("#include \"system.h\"\n");
228 printf ("#include \"flags.h\"\n");
229 printf ("#include \"rtl.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");
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
{ 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 PROTO ((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 if (have_constraints
)
293 printf (" \"%s\",\n",
294 d
->constraint
? d
->constraint
: "");
297 printf (" %smode,\n", GET_MODE_NAME (d
->mode
));
299 if (! have_constraints
)
300 printf (" %d,\n", d
->address_p
);
302 printf (" %d\n", d
->strict_low
);
312 register struct data
*d
;
314 int next_name_offset
;
315 const char * last_name
= 0;
316 const char * next_name
= 0;
317 register struct data
*n
;
319 for (n
= idata
, next_name_offset
= 1; n
; n
= n
->next
, next_name_offset
++)
326 printf ("\nconst struct insn_data insn_data[] = \n{\n");
328 for (d
= idata
; d
; d
= d
->next
)
334 printf (" \"%s\",\n", d
->name
);
338 for (n
= d
->next
, next_name_offset
= 1; n
;
339 n
= n
->next
, next_name_offset
++)
351 if (next_name
&& (last_name
== 0
352 || name_offset
> next_name_offset
/ 2))
353 printf (" \"%s-%d\",\n", next_name
,
354 next_name_offset
- name_offset
);
356 printf (" \"%s+%d\",\n", last_name
, name_offset
);
359 switch (d
->output_format
)
361 case INSN_OUTPUT_FORMAT_NONE
:
364 case INSN_OUTPUT_FORMAT_SINGLE
:
365 printf (" \"%s\",\n", d
->template);
367 case INSN_OUTPUT_FORMAT_MULTI
:
368 case INSN_OUTPUT_FORMAT_FUNCTION
:
369 printf (" output_%d,\n", d
->code_number
);
375 if (d
->name
&& d
->name
[0] != '*')
376 printf (" gen_%s,\n", d
->name
);
380 printf (" &operand_data[%d],\n", d
->operand_number
);
381 printf (" %d,\n", d
->n_operands
);
382 printf (" %d,\n", d
->n_dups
);
383 printf (" %d,\n", d
->n_alternatives
);
384 printf (" %d\n", d
->output_format
);
392 output_get_insn_name ()
394 printf ("const char *\n");
395 printf ("get_insn_name (code)\n");
396 printf (" int code;\n");
398 printf (" return insn_data[code].name;\n");
403 /* Stores in max_opno the largest operand number present in `part', if
404 that is larger than the previous value of max_opno, and the rest of
405 the operand data into `d->operand[i]'.
407 THIS_ADDRESS_P is nonzero if the containing rtx was an ADDRESS.
408 THIS_STRICT_LOW is nonzero if the containing rtx was a STRICT_LOW_PART. */
414 scan_operands (d
, part
, this_address_p
, this_strict_low
)
421 register const char *format_ptr
;
427 switch (GET_CODE (part
))
430 opno
= XINT (part
, 0);
433 if (max_opno
>= MAX_MAX_OPERANDS
)
435 error ("Too many operands (%d) in definition %s.\n",
436 max_opno
+ 1, get_insn_name (next_index_number
));
439 if (d
->operand
[opno
].seen
)
440 error ("Definition %s specified operand number %d more than once.\n",
441 get_insn_name (next_index_number
), opno
);
442 d
->operand
[opno
].seen
= 1;
443 d
->operand
[opno
].mode
= GET_MODE (part
);
444 d
->operand
[opno
].strict_low
= this_strict_low
;
445 d
->operand
[opno
].predicate
= XSTR (part
, 1);
446 d
->operand
[opno
].constraint
= XSTR (part
, 2);
447 if (XSTR (part
, 2) != 0 && *XSTR (part
, 2) != 0)
449 d
->operand
[opno
].n_alternatives
450 = n_occurrences (',', XSTR (part
, 2)) + 1;
451 have_constraints
= 1;
453 d
->operand
[opno
].address_p
= this_address_p
;
457 opno
= XINT (part
, 0);
460 if (max_opno
>= MAX_MAX_OPERANDS
)
462 error ("Too many operands (%d) in definition %s.\n",
463 max_opno
+ 1, get_insn_name (next_index_number
));
466 if (d
->operand
[opno
].seen
)
467 error ("Definition %s specified operand number %d more than once.\n",
468 get_insn_name (next_index_number
), opno
);
469 d
->operand
[opno
].seen
= 1;
470 d
->operand
[opno
].mode
= GET_MODE (part
);
471 d
->operand
[opno
].strict_low
= 0;
472 d
->operand
[opno
].predicate
= "scratch_operand";
473 d
->operand
[opno
].constraint
= XSTR (part
, 1);
474 if (XSTR (part
, 1) != 0 && *XSTR (part
, 1) != 0)
476 d
->operand
[opno
].n_alternatives
477 = n_occurrences (',', XSTR (part
, 1)) + 1;
478 have_constraints
= 1;
480 d
->operand
[opno
].address_p
= 0;
485 opno
= XINT (part
, 0);
488 if (max_opno
>= MAX_MAX_OPERANDS
)
490 error ("Too many operands (%d) in definition %s.\n",
491 max_opno
+ 1, get_insn_name (next_index_number
));
494 if (d
->operand
[opno
].seen
)
495 error ("Definition %s specified operand number %d more than once.\n",
496 get_insn_name (next_index_number
), opno
);
497 d
->operand
[opno
].seen
= 1;
498 d
->operand
[opno
].mode
= GET_MODE (part
);
499 d
->operand
[opno
].strict_low
= 0;
500 d
->operand
[opno
].predicate
= XSTR (part
, 1);
501 d
->operand
[opno
].constraint
= 0;
502 d
->operand
[opno
].address_p
= 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)
559 if (have_constraints
)
567 if (strcmp (p0
, p1
) != 0)
571 if (d0
->mode
!= d1
->mode
)
574 if (!have_constraints
)
575 if (d0
->address_p
!= d1
->address_p
)
578 if (d0
->strict_low
!= d1
->strict_low
)
584 /* Scan the list of operands we've already committed to output and either
585 find a subsequence that is the same, or allocate a new one at the end. */
591 struct operand_data
*od
, *od2
;
594 if (d
->n_operands
== 0)
596 d
->operand_number
= 0;
600 /* Brute force substring search. */
601 for (od
= odata
, i
= 0; od
; od
= od
->next
, i
= 0)
602 if (compare_operands (od
, &d
->operand
[0]))
608 if (i
== d
->n_operands
)
612 if (! compare_operands (od2
, &d
->operand
[i
]))
614 ++i
, od2
= od2
->next
;
618 /* Either partial match at the end of the list, or no match. In either
619 case, we tack on what operands are remaining to the end of the list. */
621 d
->operand_number
= next_operand_number
- i
;
622 for (; i
< d
->n_operands
; ++i
)
624 od2
= &d
->operand
[i
];
626 odata_end
= &od2
->next
;
627 od2
->index
= next_operand_number
++;
633 d
->operand_number
= od
->index
;
638 /* Process an assembler template from a define_insn or a define_peephole.
639 It is either the assembler code template, a list of assembler code
640 templates, or C code to generate the assembler code template. */
643 process_template (d
, template)
650 /* Templates starting with * contain straight code to be run. */
651 if (template[0] == '*')
654 d
->output_format
= INSN_OUTPUT_FORMAT_FUNCTION
;
656 printf ("\nstatic const char *output_%d PROTO ((rtx *, rtx));\n",
658 puts ("\nstatic const char *");
659 printf ("output_%d (operands, insn)\n", d
->code_number
);
660 puts (" rtx *operands ATTRIBUTE_UNUSED;");
661 puts (" rtx insn ATTRIBUTE_UNUSED;");
668 /* If the assembler code template starts with a @ it is a newline-separated
669 list of assembler code templates, one for each alternative. */
670 else if (template[0] == '@')
673 d
->output_format
= INSN_OUTPUT_FORMAT_MULTI
;
675 printf ("\nstatic const char * const output_%d[] = {\n", d
->code_number
);
677 for (i
= 0, cp
= &template[1]; *cp
; )
679 while (*cp
== '\n' || *cp
== ' ' || *cp
== '\t')
683 while (*cp
!= '\n' && *cp
!= '\0')
697 d
->template = template;
698 d
->output_format
= INSN_OUTPUT_FORMAT_SINGLE
;
702 /* Check insn D for consistency in number of constraint alternatives. */
705 validate_insn_alternatives (d
)
708 register int n
= 0, start
;
710 /* Make sure all the operands have the same number of alternatives
711 in their constraints. Let N be that number. */
712 for (start
= 0; start
< d
->n_operands
; start
++)
713 if (d
->operand
[start
].n_alternatives
> 0)
716 n
= d
->operand
[start
].n_alternatives
;
717 else if (n
!= d
->operand
[start
].n_alternatives
)
718 error ("wrong number of alternatives in operand %d of insn %s",
719 start
, get_insn_name (d
->index_number
));
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. */
734 register struct data
*d
= (struct data
*) xmalloc (sizeof (struct data
));
737 d
->code_number
= next_code_number
++;
738 d
->index_number
= next_index_number
;
739 if (XSTR (insn
, 0)[0])
740 d
->name
= XSTR (insn
, 0);
744 /* Build up the list in the same order as the insns are seen
745 in the machine description. */
748 idata_end
= &d
->next
;
752 memset (d
->operand
, 0, sizeof (d
->operand
));
754 for (i
= 0; i
< XVECLEN (insn
, 1); i
++)
755 scan_operands (d
, XVECEXP (insn
, 1, i
), 0, 0);
757 d
->n_operands
= max_opno
+ 1;
758 d
->n_dups
= num_dups
;
760 validate_insn_alternatives (d
);
762 process_template (d
, XSTR (insn
, 3));
765 /* Look at a define_peephole just read. Assign its code number.
766 Record on idata the template and the number of arguments.
767 If the insn has a hairy output action, output it now. */
773 register struct data
*d
= (struct data
*) xmalloc (sizeof (struct data
));
776 d
->code_number
= next_code_number
++;
777 d
->index_number
= next_index_number
;
780 /* Build up the list in the same order as the insns are seen
781 in the machine description. */
784 idata_end
= &d
->next
;
788 memset (d
->operand
, 0, sizeof (d
->operand
));
790 /* Get the number of operands by scanning all the patterns of the
791 peephole optimizer. But ignore all the rest of the information
793 for (i
= 0; i
< XVECLEN (peep
, 0); i
++)
794 scan_operands (d
, XVECEXP (peep
, 0, i
), 0, 0);
796 d
->n_operands
= max_opno
+ 1;
799 validate_insn_alternatives (d
);
801 process_template (d
, XSTR (peep
, 2));
804 /* Process a define_expand just read. Assign its code number,
805 only for the purposes of `insn_gen_function'. */
811 register struct data
*d
= (struct data
*) xmalloc (sizeof (struct data
));
814 d
->code_number
= next_code_number
++;
815 d
->index_number
= next_index_number
;
816 if (XSTR (insn
, 0)[0])
817 d
->name
= XSTR (insn
, 0);
821 /* Build up the list in the same order as the insns are seen
822 in the machine description. */
825 idata_end
= &d
->next
;
829 memset (d
->operand
, 0, sizeof (d
->operand
));
831 /* Scan the operands to get the specified predicates and modes,
832 since expand_binop needs to know them. */
835 for (i
= 0; i
< XVECLEN (insn
, 1); i
++)
836 scan_operands (d
, XVECEXP (insn
, 1, i
), 0, 0);
838 d
->n_operands
= max_opno
+ 1;
839 d
->n_dups
= num_dups
;
841 d
->output_format
= INSN_OUTPUT_FORMAT_NONE
;
843 validate_insn_alternatives (d
);
847 /* Process a define_split just read. Assign its code number,
848 only for reasons of consistency and to simplify genrecog. */
854 register struct data
*d
= (struct data
*) xmalloc (sizeof (struct data
));
857 d
->code_number
= next_code_number
++;
858 d
->index_number
= next_index_number
;
861 /* Build up the list in the same order as the insns are seen
862 in the machine description. */
865 idata_end
= &d
->next
;
869 memset (d
->operand
, 0, sizeof (d
->operand
));
871 /* Get the number of operands by scanning all the patterns of the
872 split patterns. But ignore all the rest of the information thus
874 for (i
= 0; i
< XVECLEN (split
, 0); i
++)
875 scan_operands (d
, XVECEXP (split
, 0, i
), 0, 0);
877 d
->n_operands
= max_opno
+ 1;
879 d
->n_alternatives
= 0;
881 d
->output_format
= INSN_OUTPUT_FORMAT_NONE
;
890 register PTR val
= (PTR
) malloc (size
);
893 fatal ("virtual memory exhausted");
904 ptr
= (PTR
) realloc (old
, size
);
906 ptr
= (PTR
) malloc (size
);
908 fatal ("virtual memory exhausted");
921 progname
= "genoutput";
922 obstack_init (rtl_obstack
);
925 fatal ("No input file name.");
927 infile
= fopen (argv
[1], "r");
931 exit (FATAL_EXIT_CODE
);
935 next_code_number
= 0;
936 next_index_number
= 0;
937 have_constraints
= 0;
939 /* Read the machine description. */
943 c
= read_skip_spaces (infile
);
948 desc
= read_rtx (infile
);
949 if (GET_CODE (desc
) == DEFINE_INSN
)
951 if (GET_CODE (desc
) == DEFINE_PEEPHOLE
)
953 if (GET_CODE (desc
) == DEFINE_EXPAND
)
955 if (GET_CODE (desc
) == DEFINE_SPLIT
956 || GET_CODE (desc
) == DEFINE_PEEPHOLE2
)
962 output_predicate_decls ();
963 output_operand_data ();
965 output_get_insn_name ();
968 exit (ferror (stdout
) != 0 || have_error
969 ? FATAL_EXIT_CODE
: SUCCESS_EXIT_CODE
);