1 /* Generate code from to output assembler insns as recognized from rtl.
2 Copyright (C) 1987, 1988, 1992, 1994, 1995, 1997, 1998, 1999, 2000, 2002,
3 2003, 2004, 2005, 2007, 2008, 2009, 2010 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 3, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
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 `struct insn_data_d', which is indexed by insn code number,
28 a. `name' is the name for that pattern. Nameless patterns are
31 b. `output' hold either the output template, an array of output
32 templates, or an output function.
34 c. `genfun' is the function to generate a body for that pattern,
35 given operands as arguments.
37 d. `n_operands' is the number of distinct operands in the pattern
40 e. `n_dups' is the number of match_dup's that appear in the insn's
41 pattern. This says how many elements of `recog_data.dup_loc' are
42 significant after an insn has been recognized.
44 f. `n_alternatives' is the number of alternatives in the constraints
47 g. `output_format' tells what type of thing `output' is.
49 h. `operand' is the base of an array of operand data for the insn.
51 2. An array of `struct insn_operand data', used by `operand' above.
53 a. `predicate', an int-valued function, is the match_operand predicate
56 b. `constraint' is the constraint for this operand.
58 c. `address_p' indicates that the operand appears within ADDRESS
61 d. `mode' is the machine mode that that operand is supposed to have.
63 e. `strict_low', is nonzero for operands contained in a STRICT_LOW_PART.
65 f. `eliminable', is nonzero for operands that are matched normally by
66 MATCH_OPERAND; it is zero for operands that should not be changed during
67 register elimination such as MATCH_OPERATORs.
69 The code number of an insn is simply its position in the machine
70 description; code numbers are assigned sequentially to entries in
71 the description, starting with code number 0.
73 Thus, the following entry in the machine description
76 [(set (match_operand:DF 0 "general_operand" "")
81 assuming it is the 25th entry present, would cause
82 insn_data[24].template to be "clrd %0", and
83 insn_data[24].n_operands to be 1. */
87 #include "coretypes.h"
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 (int, const char *);
101 static const char *strip_whitespace (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_code
;
161 const char *filename
;
163 int n_generator_args
; /* Number of arguments passed to generator */
164 int n_operands
; /* Number of operands this insn recognizes */
165 int n_dups
; /* Number times match_dup appears in pattern */
166 int n_alternatives
; /* Number of alternatives in each constraint */
167 int operand_number
; /* Operand index in the big array. */
168 int output_format
; /* INSN_OUTPUT_FORMAT_*. */
169 struct operand_data operand
[MAX_MAX_OPERANDS
];
172 /* This variable points to the first link in the insn chain. */
174 static struct data
*idata
, **idata_end
= &idata
;
176 static void output_prologue (void);
177 static void output_operand_data (void);
178 static void output_insn_data (void);
179 static void output_get_insn_name (void);
180 static void scan_operands (struct data
*, rtx
, int, int);
181 static int compare_operands (struct operand_data
*,
182 struct operand_data
*);
183 static void place_operands (struct data
*);
184 static void process_template (struct data
*, const char *);
185 static void validate_insn_alternatives (struct data
*);
186 static void validate_insn_operands (struct data
*);
187 static void gen_insn (rtx
, int);
188 static void gen_peephole (rtx
, int);
189 static void gen_expand (rtx
, int);
190 static void gen_split (rtx
, int);
192 #ifdef USE_MD_CONSTRAINTS
194 struct constraint_data
196 struct constraint_data
*next_this_letter
;
198 unsigned int namelen
;
202 /* This is a complete list (unlike the one in genpreds.c) of constraint
203 letters and modifiers with machine-independent meaning. The only
204 omission is digits, as these are handled specially. */
205 static const char indep_constraints
[] = ",=+%*?!#&<>EFVXgimnoprs";
207 static struct constraint_data
*
208 constraints_by_letter_table
[1 << CHAR_BIT
];
210 static int mdep_constraint_len (const char *, int, int);
211 static void note_constraint (rtx
, int);
213 #else /* !USE_MD_CONSTRAINTS */
215 static void check_constraint_len (void);
216 static int constraint_len (const char *, int);
218 #endif /* !USE_MD_CONSTRAINTS */
222 output_prologue (void)
224 printf ("/* Generated automatically by the program `genoutput'\n\
225 from the machine description file `md'. */\n\n");
227 printf ("#include \"config.h\"\n");
228 printf ("#include \"system.h\"\n");
229 printf ("#include \"coretypes.h\"\n");
230 printf ("#include \"tm.h\"\n");
231 printf ("#include \"flags.h\"\n");
232 printf ("#include \"ggc.h\"\n");
233 printf ("#include \"rtl.h\"\n");
234 printf ("#include \"expr.h\"\n");
235 printf ("#include \"insn-codes.h\"\n");
236 printf ("#include \"tm_p.h\"\n");
237 printf ("#include \"function.h\"\n");
238 printf ("#include \"regs.h\"\n");
239 printf ("#include \"hard-reg-set.h\"\n");
240 printf ("#include \"insn-config.h\"\n\n");
241 printf ("#include \"conditions.h\"\n");
242 printf ("#include \"insn-attr.h\"\n\n");
243 printf ("#include \"recog.h\"\n\n");
244 printf ("#include \"diagnostic-core.h\"\n");
245 printf ("#include \"output.h\"\n");
246 printf ("#include \"target.h\"\n");
247 printf ("#include \"tm-constrs.h\"\n");
251 output_operand_data (void)
253 struct operand_data
*d
;
255 printf ("\nstatic const struct insn_operand_data operand_data[] = \n{\n");
257 for (d
= odata
; d
; d
= d
->next
)
262 d
->predicate
&& d
->predicate
[0] ? d
->predicate
: "0");
264 printf (" \"%s\",\n", d
->constraint
? d
->constraint
: "");
266 printf (" %smode,\n", GET_MODE_NAME (d
->mode
));
268 printf (" %d,\n", d
->strict_low
);
270 printf (" %d,\n", d
->constraint
== NULL
? 1 : 0);
272 printf (" %d\n", d
->eliminable
);
280 output_insn_data (void)
284 int next_name_offset
;
285 const char * last_name
= 0;
286 const char * next_name
= 0;
289 for (n
= idata
, next_name_offset
= 1; n
; n
= n
->next
, next_name_offset
++)
296 printf ("#if GCC_VERSION >= 2007\n__extension__\n#endif\n");
297 printf ("\nconst struct insn_data_d insn_data[] = \n{\n");
299 for (d
= idata
; d
; d
= d
->next
)
301 printf (" /* %s:%d */\n", d
->filename
, d
->lineno
);
306 printf (" \"%s\",\n", d
->name
);
310 for (n
= d
->next
, next_name_offset
= 1; n
;
311 n
= n
->next
, next_name_offset
++)
323 if (next_name
&& (last_name
== 0
324 || name_offset
> next_name_offset
/ 2))
325 printf (" \"%s-%d\",\n", next_name
,
326 next_name_offset
- name_offset
);
328 printf (" \"%s+%d\",\n", last_name
, name_offset
);
331 switch (d
->output_format
)
333 case INSN_OUTPUT_FORMAT_NONE
:
334 printf ("#if HAVE_DESIGNATED_INITIALIZERS\n");
335 printf (" { 0 },\n");
337 printf (" { 0, 0, 0 },\n");
340 case INSN_OUTPUT_FORMAT_SINGLE
:
342 const char *p
= d
->template_code
;
345 printf ("#if HAVE_DESIGNATED_INITIALIZERS\n");
346 printf (" { .single =\n");
353 if (IS_VSPACE (*p
) && prev
!= '\\')
355 /* Preserve two consecutive \n's or \r's, but treat \r\n
356 as a single newline. */
357 if (*p
== '\n' && prev
!= '\r')
366 printf ("#if HAVE_DESIGNATED_INITIALIZERS\n");
369 printf (" 0, 0 },\n");
373 case INSN_OUTPUT_FORMAT_MULTI
:
374 printf ("#if HAVE_DESIGNATED_INITIALIZERS\n");
375 printf (" { .multi = output_%d },\n", d
->code_number
);
377 printf (" { 0, output_%d, 0 },\n", d
->code_number
);
380 case INSN_OUTPUT_FORMAT_FUNCTION
:
381 printf ("#if HAVE_DESIGNATED_INITIALIZERS\n");
382 printf (" { .function = output_%d },\n", d
->code_number
);
384 printf (" { 0, 0, output_%d },\n", d
->code_number
);
391 if (d
->name
&& d
->name
[0] != '*')
392 printf (" (insn_gen_fn) gen_%s,\n", d
->name
);
396 printf (" &operand_data[%d],\n", d
->operand_number
);
397 printf (" %d,\n", d
->n_generator_args
);
398 printf (" %d,\n", d
->n_operands
);
399 printf (" %d,\n", d
->n_dups
);
400 printf (" %d,\n", d
->n_alternatives
);
401 printf (" %d\n", d
->output_format
);
409 output_get_insn_name (void)
411 printf ("const char *\n");
412 printf ("get_insn_name (int code)\n");
414 printf (" if (code == NOOP_MOVE_INSN_CODE)\n");
415 printf (" return \"NOOP_MOVE\";\n");
417 printf (" return insn_data[code].name;\n");
422 /* Stores the operand data into `d->operand[i]'.
424 THIS_ADDRESS_P is nonzero if the containing rtx was an ADDRESS.
425 THIS_STRICT_LOW is nonzero if the containing rtx was a STRICT_LOW_PART. */
428 scan_operands (struct data
*d
, rtx part
, int this_address_p
,
432 const char *format_ptr
;
438 switch (GET_CODE (part
))
441 opno
= XINT (part
, 0);
442 if (opno
>= MAX_MAX_OPERANDS
)
444 error_with_line (d
->lineno
, "maximum number of operands exceeded");
447 if (d
->operand
[opno
].seen
)
448 error_with_line (d
->lineno
, "repeated operand number %d\n", opno
);
450 d
->operand
[opno
].seen
= 1;
451 d
->operand
[opno
].mode
= GET_MODE (part
);
452 d
->operand
[opno
].strict_low
= this_strict_low
;
453 d
->operand
[opno
].predicate
= XSTR (part
, 1);
454 d
->operand
[opno
].constraint
= strip_whitespace (XSTR (part
, 2));
455 d
->operand
[opno
].n_alternatives
456 = n_occurrences (',', d
->operand
[opno
].constraint
) + 1;
457 d
->operand
[opno
].address_p
= this_address_p
;
458 d
->operand
[opno
].eliminable
= 1;
462 opno
= XINT (part
, 0);
463 if (opno
>= MAX_MAX_OPERANDS
)
465 error_with_line (d
->lineno
, "maximum number of operands exceeded");
468 if (d
->operand
[opno
].seen
)
469 error_with_line (d
->lineno
, "repeated operand number %d\n", opno
);
471 d
->operand
[opno
].seen
= 1;
472 d
->operand
[opno
].mode
= GET_MODE (part
);
473 d
->operand
[opno
].strict_low
= 0;
474 d
->operand
[opno
].predicate
= "scratch_operand";
475 d
->operand
[opno
].constraint
= strip_whitespace (XSTR (part
, 1));
476 d
->operand
[opno
].n_alternatives
477 = n_occurrences (',', d
->operand
[opno
].constraint
) + 1;
478 d
->operand
[opno
].address_p
= 0;
479 d
->operand
[opno
].eliminable
= 0;
484 opno
= XINT (part
, 0);
485 if (opno
>= MAX_MAX_OPERANDS
)
487 error_with_line (d
->lineno
, "maximum number of operands exceeded");
490 if (d
->operand
[opno
].seen
)
491 error_with_line (d
->lineno
, "repeated operand number %d\n", opno
);
493 d
->operand
[opno
].seen
= 1;
494 d
->operand
[opno
].mode
= GET_MODE (part
);
495 d
->operand
[opno
].strict_low
= 0;
496 d
->operand
[opno
].predicate
= XSTR (part
, 1);
497 d
->operand
[opno
].constraint
= 0;
498 d
->operand
[opno
].address_p
= 0;
499 d
->operand
[opno
].eliminable
= 0;
500 for (i
= 0; i
< XVECLEN (part
, 2); i
++)
501 scan_operands (d
, XVECEXP (part
, 2, i
), 0, 0);
505 scan_operands (d
, XEXP (part
, 0), 1, 0);
508 case STRICT_LOW_PART
:
509 scan_operands (d
, XEXP (part
, 0), 0, 1);
516 format_ptr
= GET_RTX_FORMAT (GET_CODE (part
));
518 for (i
= 0; i
< GET_RTX_LENGTH (GET_CODE (part
)); i
++)
519 switch (*format_ptr
++)
523 scan_operands (d
, XEXP (part
, i
), 0, 0);
526 if (XVEC (part
, i
) != NULL
)
527 for (j
= 0; j
< XVECLEN (part
, i
); j
++)
528 scan_operands (d
, XVECEXP (part
, i
, j
), 0, 0);
533 /* Compare two operands for content equality. */
536 compare_operands (struct operand_data
*d0
, struct operand_data
*d1
)
546 if (strcmp (p0
, p1
) != 0)
555 if (strcmp (p0
, p1
) != 0)
558 if (d0
->mode
!= d1
->mode
)
561 if (d0
->strict_low
!= d1
->strict_low
)
564 if (d0
->eliminable
!= d1
->eliminable
)
570 /* Scan the list of operands we've already committed to output and either
571 find a subsequence that is the same, or allocate a new one at the end. */
574 place_operands (struct data
*d
)
576 struct operand_data
*od
, *od2
;
579 if (d
->n_operands
== 0)
581 d
->operand_number
= 0;
585 /* Brute force substring search. */
586 for (od
= odata
, i
= 0; od
; od
= od
->next
, i
= 0)
587 if (compare_operands (od
, &d
->operand
[0]))
593 if (i
== d
->n_operands
)
597 if (! compare_operands (od2
, &d
->operand
[i
]))
599 ++i
, od2
= od2
->next
;
603 /* Either partial match at the end of the list, or no match. In either
604 case, we tack on what operands are remaining to the end of the list. */
606 d
->operand_number
= next_operand_number
- i
;
607 for (; i
< d
->n_operands
; ++i
)
609 od2
= &d
->operand
[i
];
611 odata_end
= &od2
->next
;
612 od2
->index
= next_operand_number
++;
618 d
->operand_number
= od
->index
;
623 /* Process an assembler template from a define_insn or a define_peephole.
624 It is either the assembler code template, a list of assembler code
625 templates, or C code to generate the assembler code template. */
628 process_template (struct data
*d
, const char *template_code
)
633 /* Templates starting with * contain straight code to be run. */
634 if (template_code
[0] == '*')
636 d
->template_code
= 0;
637 d
->output_format
= INSN_OUTPUT_FORMAT_FUNCTION
;
639 puts ("\nstatic const char *");
640 printf ("output_%d (rtx *operands ATTRIBUTE_UNUSED, rtx insn ATTRIBUTE_UNUSED)\n",
643 print_md_ptr_loc (template_code
);
644 puts (template_code
+ 1);
648 /* If the assembler code template starts with a @ it is a newline-separated
649 list of assembler code templates, one for each alternative. */
650 else if (template_code
[0] == '@')
652 d
->template_code
= 0;
653 d
->output_format
= INSN_OUTPUT_FORMAT_MULTI
;
655 printf ("\nstatic const char * const output_%d[] = {\n", d
->code_number
);
657 for (i
= 0, cp
= &template_code
[1]; *cp
; )
661 while (ISSPACE (*cp
))
666 for (ep
= sp
= cp
; !IS_VSPACE (*ep
) && *ep
!= '\0'; ++ep
)
671 message_with_line (d
->lineno
,
672 "trailing whitespace in output template");
684 message_with_line (d
->lineno
,
685 "'@' is redundant for output template with single alternative");
686 if (i
!= d
->n_alternatives
)
687 error_with_line (d
->lineno
,
688 "wrong number of alternatives in the output template");
694 d
->template_code
= template_code
;
695 d
->output_format
= INSN_OUTPUT_FORMAT_SINGLE
;
699 /* Check insn D for consistency in number of constraint alternatives. */
702 validate_insn_alternatives (struct data
*d
)
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)
714 int which_alternative
= 0;
715 int alternative_count_unsure
= 0;
717 for (p
= d
->operand
[start
].constraint
; (c
= *p
); p
+= len
)
719 #ifdef USE_MD_CONSTRAINTS
720 if (ISSPACE (c
) || strchr (indep_constraints
, c
))
722 else if (ISDIGIT (c
))
727 while (ISDIGIT (*q
));
731 len
= mdep_constraint_len (p
, d
->lineno
, start
);
733 len
= CONSTRAINT_LEN (c
, p
);
735 if (len
< 1 || (len
> 1 && strchr (",#*+=&%!0123456789", c
)))
737 error_with_line (d
->lineno
,
738 "invalid length %d for char '%c' in"
739 " alternative %d of operand %d",
740 len
, c
, which_alternative
, start
);
751 for (i
= 1; i
< len
; i
++)
754 error_with_line (d
->lineno
,
755 "NUL in alternative %d of operand %d",
756 which_alternative
, start
);
757 alternative_count_unsure
= 1;
760 else if (strchr (",#*", p
[i
]))
762 error_with_line (d
->lineno
,
763 "'%c' in alternative %d of operand %d",
764 p
[i
], which_alternative
, start
);
765 alternative_count_unsure
= 1;
768 if (!alternative_count_unsure
)
771 n
= d
->operand
[start
].n_alternatives
;
772 else if (n
!= d
->operand
[start
].n_alternatives
)
773 error_with_line (d
->lineno
,
774 "wrong number of alternatives in operand %d",
779 /* Record the insn's overall number of alternatives. */
780 d
->n_alternatives
= n
;
783 /* Verify that there are no gaps in operand numbers for INSNs. */
786 validate_insn_operands (struct data
*d
)
790 for (i
= 0; i
< d
->n_operands
; ++i
)
791 if (d
->operand
[i
].seen
== 0)
792 error_with_line (d
->lineno
, "missing operand %d", i
);
796 validate_optab_operands (struct data
*d
)
798 if (!d
->name
|| d
->name
[0] == '\0' || d
->name
[0] == '*')
801 /* Miscellaneous tests. */
802 if (strncmp (d
->name
, "cstore", 6) == 0
803 && d
->name
[strlen (d
->name
) - 1] == '4'
804 && d
->operand
[0].mode
== VOIDmode
)
806 message_with_line (d
->lineno
, "missing mode for operand 0 of cstore");
811 /* Look at a define_insn just read. Assign its code number. Record
812 on idata the template and the number of arguments. If the insn has
813 a hairy output action, output a function for now. */
816 gen_insn (rtx insn
, int lineno
)
818 struct pattern_stats stats
;
819 struct data
*d
= XNEW (struct data
);
822 d
->code_number
= next_code_number
;
823 d
->index_number
= next_index_number
;
824 d
->filename
= read_md_filename
;
826 if (XSTR (insn
, 0)[0])
827 d
->name
= XSTR (insn
, 0);
831 /* Build up the list in the same order as the insns are seen
832 in the machine description. */
835 idata_end
= &d
->next
;
837 memset (d
->operand
, 0, sizeof (d
->operand
));
839 for (i
= 0; i
< XVECLEN (insn
, 1); i
++)
840 scan_operands (d
, XVECEXP (insn
, 1, i
), 0, 0);
842 get_pattern_stats (&stats
, XVEC (insn
, 1));
843 d
->n_generator_args
= stats
.num_generator_args
;
844 d
->n_operands
= stats
.num_insn_operands
;
845 d
->n_dups
= stats
.num_dups
;
847 #ifndef USE_MD_CONSTRAINTS
848 check_constraint_len ();
850 validate_insn_operands (d
);
851 validate_insn_alternatives (d
);
852 validate_optab_operands (d
);
854 process_template (d
, XTMPL (insn
, 3));
857 /* Look at a define_peephole just read. Assign its code number.
858 Record on idata the template and the number of arguments.
859 If the insn has a hairy output action, output it now. */
862 gen_peephole (rtx peep
, int lineno
)
864 struct pattern_stats stats
;
865 struct data
*d
= XNEW (struct data
);
868 d
->code_number
= next_code_number
;
869 d
->index_number
= next_index_number
;
870 d
->filename
= read_md_filename
;
874 /* Build up the list in the same order as the insns are seen
875 in the machine description. */
878 idata_end
= &d
->next
;
880 memset (d
->operand
, 0, sizeof (d
->operand
));
882 /* Get the number of operands by scanning all the patterns of the
883 peephole optimizer. But ignore all the rest of the information
885 for (i
= 0; i
< XVECLEN (peep
, 0); i
++)
886 scan_operands (d
, XVECEXP (peep
, 0, i
), 0, 0);
888 get_pattern_stats (&stats
, XVEC (peep
, 0));
889 d
->n_generator_args
= 0;
890 d
->n_operands
= stats
.num_insn_operands
;
893 validate_insn_alternatives (d
);
895 process_template (d
, XTMPL (peep
, 2));
898 /* Process a define_expand just read. Assign its code number,
899 only for the purposes of `insn_gen_function'. */
902 gen_expand (rtx insn
, int lineno
)
904 struct pattern_stats stats
;
905 struct data
*d
= XNEW (struct data
);
908 d
->code_number
= next_code_number
;
909 d
->index_number
= next_index_number
;
910 d
->filename
= read_md_filename
;
912 if (XSTR (insn
, 0)[0])
913 d
->name
= XSTR (insn
, 0);
917 /* Build up the list in the same order as the insns are seen
918 in the machine description. */
921 idata_end
= &d
->next
;
923 memset (d
->operand
, 0, sizeof (d
->operand
));
925 /* Scan the operands to get the specified predicates and modes,
926 since expand_binop needs to know them. */
929 for (i
= 0; i
< XVECLEN (insn
, 1); i
++)
930 scan_operands (d
, XVECEXP (insn
, 1, i
), 0, 0);
932 get_pattern_stats (&stats
, XVEC (insn
, 1));
933 d
->n_generator_args
= stats
.num_generator_args
;
934 d
->n_operands
= stats
.num_insn_operands
;
935 d
->n_dups
= stats
.num_dups
;
936 d
->template_code
= 0;
937 d
->output_format
= INSN_OUTPUT_FORMAT_NONE
;
939 validate_insn_alternatives (d
);
940 validate_optab_operands (d
);
944 /* Process a define_split just read. Assign its code number,
945 only for reasons of consistency and to simplify genrecog. */
948 gen_split (rtx split
, int lineno
)
950 struct pattern_stats stats
;
951 struct data
*d
= XNEW (struct data
);
954 d
->code_number
= next_code_number
;
955 d
->index_number
= next_index_number
;
956 d
->filename
= read_md_filename
;
960 /* Build up the list in the same order as the insns are seen
961 in the machine description. */
964 idata_end
= &d
->next
;
966 memset (d
->operand
, 0, sizeof (d
->operand
));
968 /* Get the number of operands by scanning all the patterns of the
969 split patterns. But ignore all the rest of the information thus
971 for (i
= 0; i
< XVECLEN (split
, 0); i
++)
972 scan_operands (d
, XVECEXP (split
, 0, i
), 0, 0);
974 get_pattern_stats (&stats
, XVEC (split
, 0));
975 d
->n_generator_args
= 0;
976 d
->n_operands
= stats
.num_insn_operands
;
978 d
->n_alternatives
= 0;
979 d
->template_code
= 0;
980 d
->output_format
= INSN_OUTPUT_FORMAT_NONE
;
985 extern int main (int, char **);
988 main (int argc
, char **argv
)
992 progname
= "genoutput";
994 if (!init_rtx_reader_args (argc
, argv
))
995 return (FATAL_EXIT_CODE
);
998 next_code_number
= 0;
999 next_index_number
= 0;
1001 /* Read the machine description. */
1007 desc
= read_md_rtx (&line_no
, &next_code_number
);
1011 switch (GET_CODE (desc
))
1014 gen_insn (desc
, line_no
);
1017 case DEFINE_PEEPHOLE
:
1018 gen_peephole (desc
, line_no
);
1022 gen_expand (desc
, line_no
);
1026 case DEFINE_PEEPHOLE2
:
1027 gen_split (desc
, line_no
);
1030 #ifdef USE_MD_CONSTRAINTS
1031 case DEFINE_CONSTRAINT
:
1032 case DEFINE_REGISTER_CONSTRAINT
:
1033 case DEFINE_ADDRESS_CONSTRAINT
:
1034 case DEFINE_MEMORY_CONSTRAINT
:
1035 note_constraint (desc
, line_no
);
1042 next_index_number
++;
1046 output_operand_data ();
1047 output_insn_data ();
1048 output_get_insn_name ();
1051 return (ferror (stdout
) != 0 || have_error
1052 ? FATAL_EXIT_CODE
: SUCCESS_EXIT_CODE
);
1055 /* Return the number of occurrences of character C in string S or
1056 -1 if S is the null string. */
1059 n_occurrences (int c
, const char *s
)
1063 if (s
== 0 || *s
== '\0')
1072 /* Remove whitespace in `s' by moving up characters until the end.
1073 Return a new string. */
1076 strip_whitespace (const char *s
)
1084 p
= q
= XNEWVEC (char, strlen (s
) + 1);
1085 while ((ch
= *s
++) != '\0')
1093 #ifdef USE_MD_CONSTRAINTS
1095 /* Record just enough information about a constraint to allow checking
1096 of operand constraint strings above, in validate_insn_alternatives.
1097 Does not validate most properties of the constraint itself; does
1098 enforce no duplicate names, no overlap with MI constraints, and no
1099 prefixes. EXP is the define_*constraint form, LINENO the line number
1100 reported by the reader. */
1102 note_constraint (rtx exp
, int lineno
)
1104 const char *name
= XSTR (exp
, 0);
1105 unsigned int namelen
= strlen (name
);
1106 struct constraint_data
**iter
, **slot
, *new_cdata
;
1108 /* The 'm' constraint is special here since that constraint letter
1109 can be overridden by the back end by defining the
1110 TARGET_MEM_CONSTRAINT macro. */
1111 if (strchr (indep_constraints
, name
[0]) && name
[0] != 'm')
1113 if (name
[1] == '\0')
1114 error_with_line (lineno
, "constraint letter '%s' cannot be "
1115 "redefined by the machine description", name
);
1117 error_with_line (lineno
, "constraint name '%s' cannot be defined by "
1118 "the machine description, as it begins with '%c'",
1123 slot
= &constraints_by_letter_table
[(unsigned int)name
[0]];
1124 for (iter
= slot
; *iter
; iter
= &(*iter
)->next_this_letter
)
1126 /* This causes slot to end up pointing to the
1127 next_this_letter field of the last constraint with a name
1128 of equal or greater length than the new constraint; hence
1129 the new constraint will be inserted after all previous
1130 constraints with names of the same length. */
1131 if ((*iter
)->namelen
>= namelen
)
1134 if (!strcmp ((*iter
)->name
, name
))
1136 error_with_line (lineno
, "redefinition of constraint '%s'", name
);
1137 message_with_line ((*iter
)->lineno
, "previous definition is here");
1140 else if (!strncmp ((*iter
)->name
, name
, (*iter
)->namelen
))
1142 error_with_line (lineno
, "defining constraint '%s' here", name
);
1143 message_with_line ((*iter
)->lineno
, "renders constraint '%s' "
1144 "(defined here) a prefix", (*iter
)->name
);
1147 else if (!strncmp ((*iter
)->name
, name
, namelen
))
1149 error_with_line (lineno
, "constraint '%s' is a prefix", name
);
1150 message_with_line ((*iter
)->lineno
, "of constraint '%s' "
1151 "(defined here)", (*iter
)->name
);
1155 new_cdata
= XNEWVAR (struct constraint_data
, sizeof (struct constraint_data
) + namelen
);
1156 strcpy ((char *)new_cdata
+ offsetof(struct constraint_data
, name
), name
);
1157 new_cdata
->namelen
= namelen
;
1158 new_cdata
->lineno
= lineno
;
1159 new_cdata
->next_this_letter
= *slot
;
1163 /* Return the length of the constraint name beginning at position S
1164 of an operand constraint string, or issue an error message if there
1165 is no such constraint. Does not expect to be called for generic
1168 mdep_constraint_len (const char *s
, int lineno
, int opno
)
1170 struct constraint_data
*p
;
1172 p
= constraints_by_letter_table
[(unsigned int)s
[0]];
1175 for (; p
; p
= p
->next_this_letter
)
1176 if (!strncmp (s
, p
->name
, p
->namelen
))
1179 error_with_line (lineno
,
1180 "error: undefined machine-specific constraint "
1181 "at this point: \"%s\"", s
);
1182 message_with_line (lineno
, "note: in operand %d", opno
);
1183 return 1; /* safe */
1187 /* Verify that DEFAULT_CONSTRAINT_LEN is used properly and not
1188 tampered with. This isn't bullet-proof, but it should catch
1189 most genuine mistakes. */
1191 check_constraint_len (void)
1196 for (p
= ",#*+=&%!1234567890"; *p
; p
++)
1197 for (d
= -9; d
< 9; d
++)
1198 gcc_assert (constraint_len (p
, d
) == d
);
1202 constraint_len (const char *p
, int genoutput_default_constraint_len
)
1204 /* Check that we still match defaults.h . First we do a generation-time
1205 check that fails if the value is not the expected one... */
1206 gcc_assert (DEFAULT_CONSTRAINT_LEN (*p
, p
) == 1);
1207 /* And now a compile-time check that should give a diagnostic if the
1208 definition doesn't exactly match. */
1209 #define DEFAULT_CONSTRAINT_LEN(C,STR) 1
1210 /* Now re-define DEFAULT_CONSTRAINT_LEN so that we can verify it is
1212 #undef DEFAULT_CONSTRAINT_LEN
1213 #define DEFAULT_CONSTRAINT_LEN(C,STR) \
1214 ((C) != *p || STR != p ? -1 : genoutput_default_constraint_len)
1215 return CONSTRAINT_LEN (*p
, p
);
1216 /* And set it back. */
1217 #undef DEFAULT_CONSTRAINT_LEN
1218 #define DEFAULT_CONSTRAINT_LEN(C,STR) 1