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 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', 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_operands; /* Number of operands this insn recognizes */
164 int n_dups; /* Number times match_dup appears in pattern */
165 int n_alternatives; /* Number of alternatives in each constraint */
166 int operand_number; /* Operand index in the big array. */
167 int output_format; /* INSN_OUTPUT_FORMAT_*. */
168 struct operand_data operand[MAX_MAX_OPERANDS];
171 /* This variable points to the first link in the insn chain. */
173 static struct data *idata, **idata_end = &idata;
175 static void output_prologue (void);
176 static void output_operand_data (void);
177 static void output_insn_data (void);
178 static void output_get_insn_name (void);
179 static void scan_operands (struct data *, rtx, int, int);
180 static int compare_operands (struct operand_data *,
181 struct operand_data *);
182 static void place_operands (struct data *);
183 static void process_template (struct data *, const char *);
184 static void validate_insn_alternatives (struct data *);
185 static void validate_insn_operands (struct data *);
186 static void gen_insn (rtx, int);
187 static void gen_peephole (rtx, int);
188 static void gen_expand (rtx, int);
189 static void gen_split (rtx, int);
191 #ifdef USE_MD_CONSTRAINTS
193 struct constraint_data
195 struct constraint_data *next_this_letter;
197 unsigned int namelen;
201 /* This is a complete list (unlike the one in genpreds.c) of constraint
202 letters and modifiers with machine-independent meaning. The only
203 omission is digits, as these are handled specially. */
204 static const char indep_constraints[] = ",=+%*?!#&<>EFVXgimnoprs";
206 static struct constraint_data *
207 constraints_by_letter_table[1 << CHAR_BIT];
209 static int mdep_constraint_len (const char *, int, int);
210 static void note_constraint (rtx, int);
212 #else /* !USE_MD_CONSTRAINTS */
214 static void check_constraint_len (void);
215 static int constraint_len (const char *, int);
217 #endif /* !USE_MD_CONSTRAINTS */
221 output_prologue (void)
223 printf ("/* Generated automatically by the program `genoutput'\n\
224 from the machine description file `md'. */\n\n");
226 printf ("#include \"config.h\"\n");
227 printf ("#include \"system.h\"\n");
228 printf ("#include \"coretypes.h\"\n");
229 printf ("#include \"tm.h\"\n");
230 printf ("#include \"flags.h\"\n");
231 printf ("#include \"ggc.h\"\n");
232 printf ("#include \"rtl.h\"\n");
233 printf ("#include \"expr.h\"\n");
234 printf ("#include \"insn-codes.h\"\n");
235 printf ("#include \"tm_p.h\"\n");
236 printf ("#include \"function.h\"\n");
237 printf ("#include \"regs.h\"\n");
238 printf ("#include \"hard-reg-set.h\"\n");
239 printf ("#include \"insn-config.h\"\n\n");
240 printf ("#include \"conditions.h\"\n");
241 printf ("#include \"insn-attr.h\"\n\n");
242 printf ("#include \"recog.h\"\n\n");
243 printf ("#include \"toplev.h\"\n");
244 printf ("#include \"output.h\"\n");
245 printf ("#include \"target.h\"\n");
246 printf ("#include \"tm-constrs.h\"\n");
250 output_operand_data (void)
252 struct operand_data *d;
254 printf ("\nstatic const struct insn_operand_data operand_data[] = \n{\n");
256 for (d = odata; d; d = d->next)
261 d->predicate && d->predicate[0] ? d->predicate : "0");
263 printf (" \"%s\",\n", d->constraint ? d->constraint : "");
265 printf (" %smode,\n", GET_MODE_NAME (d->mode));
267 printf (" %d,\n", d->strict_low);
269 printf (" %d,\n", d->constraint == NULL ? 1 : 0);
271 printf (" %d\n", d->eliminable);
279 output_insn_data (void)
283 int next_name_offset;
284 const char * last_name = 0;
285 const char * next_name = 0;
288 for (n = idata, next_name_offset = 1; n; n = n->next, next_name_offset++)
295 printf ("#if GCC_VERSION >= 2007\n__extension__\n#endif\n");
296 printf ("\nconst struct insn_data insn_data[] = \n{\n");
298 for (d = idata; d; d = d->next)
300 printf (" /* %s:%d */\n", d->filename, d->lineno);
305 printf (" \"%s\",\n", d->name);
309 for (n = d->next, next_name_offset = 1; n;
310 n = n->next, next_name_offset++)
322 if (next_name && (last_name == 0
323 || name_offset > next_name_offset / 2))
324 printf (" \"%s-%d\",\n", next_name,
325 next_name_offset - name_offset);
327 printf (" \"%s+%d\",\n", last_name, name_offset);
330 switch (d->output_format)
332 case INSN_OUTPUT_FORMAT_NONE:
333 printf ("#if HAVE_DESIGNATED_INITIALIZERS\n");
334 printf (" { 0 },\n");
336 printf (" { 0, 0, 0 },\n");
339 case INSN_OUTPUT_FORMAT_SINGLE:
341 const char *p = d->template_code;
344 printf ("#if HAVE_DESIGNATED_INITIALIZERS\n");
345 printf (" { .single =\n");
352 if (IS_VSPACE (*p) && prev != '\\')
354 /* Preserve two consecutive \n's or \r's, but treat \r\n
355 as a single newline. */
356 if (*p == '\n' && prev != '\r')
365 printf ("#if HAVE_DESIGNATED_INITIALIZERS\n");
368 printf (" 0, 0 },\n");
372 case INSN_OUTPUT_FORMAT_MULTI:
373 printf ("#if HAVE_DESIGNATED_INITIALIZERS\n");
374 printf (" { .multi = output_%d },\n", d->code_number);
376 printf (" { 0, output_%d, 0 },\n", d->code_number);
379 case INSN_OUTPUT_FORMAT_FUNCTION:
380 printf ("#if HAVE_DESIGNATED_INITIALIZERS\n");
381 printf (" { .function = output_%d },\n", d->code_number);
383 printf (" { 0, 0, output_%d },\n", d->code_number);
390 if (d->name && d->name[0] != '*')
391 printf (" (insn_gen_fn) gen_%s,\n", d->name);
395 printf (" &operand_data[%d],\n", d->operand_number);
396 printf (" %d,\n", d->n_operands);
397 printf (" %d,\n", d->n_dups);
398 printf (" %d,\n", d->n_alternatives);
399 printf (" %d\n", d->output_format);
407 output_get_insn_name (void)
409 printf ("const char *\n");
410 printf ("get_insn_name (int code)\n");
412 printf (" if (code == NOOP_MOVE_INSN_CODE)\n");
413 printf (" return \"NOOP_MOVE\";\n");
415 printf (" return insn_data[code].name;\n");
420 /* Stores in max_opno the largest operand number present in `part', if
421 that is larger than the previous value of max_opno, and the rest of
422 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. */
431 scan_operands (struct data *d, rtx part, int this_address_p,
435 const char *format_ptr;
441 switch (GET_CODE (part))
444 opno = XINT (part, 0);
447 if (max_opno >= MAX_MAX_OPERANDS)
449 message_with_line (d->lineno,
450 "maximum number of operands exceeded");
454 if (d->operand[opno].seen)
456 message_with_line (d->lineno,
457 "repeated operand number %d\n", opno);
461 d->operand[opno].seen = 1;
462 d->operand[opno].mode = GET_MODE (part);
463 d->operand[opno].strict_low = this_strict_low;
464 d->operand[opno].predicate = XSTR (part, 1);
465 d->operand[opno].constraint = strip_whitespace (XSTR (part, 2));
466 d->operand[opno].n_alternatives
467 = n_occurrences (',', d->operand[opno].constraint) + 1;
468 d->operand[opno].address_p = this_address_p;
469 d->operand[opno].eliminable = 1;
473 opno = XINT (part, 0);
476 if (max_opno >= MAX_MAX_OPERANDS)
478 message_with_line (d->lineno,
479 "maximum number of operands exceeded");
483 if (d->operand[opno].seen)
485 message_with_line (d->lineno,
486 "repeated operand number %d\n", opno);
490 d->operand[opno].seen = 1;
491 d->operand[opno].mode = GET_MODE (part);
492 d->operand[opno].strict_low = 0;
493 d->operand[opno].predicate = "scratch_operand";
494 d->operand[opno].constraint = strip_whitespace (XSTR (part, 1));
495 d->operand[opno].n_alternatives
496 = n_occurrences (',', d->operand[opno].constraint) + 1;
497 d->operand[opno].address_p = 0;
498 d->operand[opno].eliminable = 0;
503 opno = XINT (part, 0);
506 if (max_opno >= MAX_MAX_OPERANDS)
508 message_with_line (d->lineno,
509 "maximum number of operands exceeded");
513 if (d->operand[opno].seen)
515 message_with_line (d->lineno,
516 "repeated operand number %d\n", opno);
520 d->operand[opno].seen = 1;
521 d->operand[opno].mode = GET_MODE (part);
522 d->operand[opno].strict_low = 0;
523 d->operand[opno].predicate = XSTR (part, 1);
524 d->operand[opno].constraint = 0;
525 d->operand[opno].address_p = 0;
526 d->operand[opno].eliminable = 0;
527 for (i = 0; i < XVECLEN (part, 2); i++)
528 scan_operands (d, XVECEXP (part, 2, i), 0, 0);
538 scan_operands (d, XEXP (part, 0), 1, 0);
541 case STRICT_LOW_PART:
542 scan_operands (d, XEXP (part, 0), 0, 1);
549 format_ptr = GET_RTX_FORMAT (GET_CODE (part));
551 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (part)); i++)
552 switch (*format_ptr++)
556 scan_operands (d, XEXP (part, i), 0, 0);
559 if (XVEC (part, i) != NULL)
560 for (j = 0; j < XVECLEN (part, i); j++)
561 scan_operands (d, XVECEXP (part, i, j), 0, 0);
566 /* Compare two operands for content equality. */
569 compare_operands (struct operand_data *d0, struct operand_data *d1)
579 if (strcmp (p0, p1) != 0)
588 if (strcmp (p0, p1) != 0)
591 if (d0->mode != d1->mode)
594 if (d0->strict_low != d1->strict_low)
597 if (d0->eliminable != d1->eliminable)
603 /* Scan the list of operands we've already committed to output and either
604 find a subsequence that is the same, or allocate a new one at the end. */
607 place_operands (struct data *d)
609 struct operand_data *od, *od2;
612 if (d->n_operands == 0)
614 d->operand_number = 0;
618 /* Brute force substring search. */
619 for (od = odata, i = 0; od; od = od->next, i = 0)
620 if (compare_operands (od, &d->operand[0]))
626 if (i == d->n_operands)
630 if (! compare_operands (od2, &d->operand[i]))
632 ++i, od2 = od2->next;
636 /* Either partial match at the end of the list, or no match. In either
637 case, we tack on what operands are remaining to the end of the list. */
639 d->operand_number = next_operand_number - i;
640 for (; i < d->n_operands; ++i)
642 od2 = &d->operand[i];
644 odata_end = &od2->next;
645 od2->index = next_operand_number++;
651 d->operand_number = od->index;
656 /* Process an assembler template from a define_insn or a define_peephole.
657 It is either the assembler code template, a list of assembler code
658 templates, or C code to generate the assembler code template. */
661 process_template (struct data *d, const char *template_code)
666 /* Templates starting with * contain straight code to be run. */
667 if (template_code[0] == '*')
669 d->template_code = 0;
670 d->output_format = INSN_OUTPUT_FORMAT_FUNCTION;
672 puts ("\nstatic const char *");
673 printf ("output_%d (rtx *operands ATTRIBUTE_UNUSED, rtx insn ATTRIBUTE_UNUSED)\n",
676 print_md_ptr_loc (template_code);
677 puts (template_code + 1);
681 /* If the assembler code template starts with a @ it is a newline-separated
682 list of assembler code templates, one for each alternative. */
683 else if (template_code[0] == '@')
685 d->template_code = 0;
686 d->output_format = INSN_OUTPUT_FORMAT_MULTI;
688 printf ("\nstatic const char * const output_%d[] = {\n", d->code_number);
690 for (i = 0, cp = &template_code[1]; *cp; )
694 while (ISSPACE (*cp))
699 for (ep = sp = cp; !IS_VSPACE (*ep) && *ep != '\0'; ++ep)
704 message_with_line (d->lineno,
705 "trailing whitespace in output template");
717 message_with_line (d->lineno,
718 "'@' is redundant for output template with single alternative");
719 if (i != d->n_alternatives)
721 message_with_line (d->lineno,
722 "wrong number of alternatives in the output template");
730 d->template_code = template_code;
731 d->output_format = INSN_OUTPUT_FORMAT_SINGLE;
735 /* Check insn D for consistency in number of constraint alternatives. */
738 validate_insn_alternatives (struct data *d)
742 /* Make sure all the operands have the same number of alternatives
743 in their constraints. Let N be that number. */
744 for (start = 0; start < d->n_operands; start++)
745 if (d->operand[start].n_alternatives > 0)
750 int which_alternative = 0;
751 int alternative_count_unsure = 0;
753 for (p = d->operand[start].constraint; (c = *p); p += len)
755 #ifdef USE_MD_CONSTRAINTS
756 if (ISSPACE (c) || strchr (indep_constraints, c))
758 else if (ISDIGIT (c))
763 while (ISDIGIT (*q));
767 len = mdep_constraint_len (p, d->lineno, start);
769 len = CONSTRAINT_LEN (c, p);
771 if (len < 1 || (len > 1 && strchr (",#*+=&%!0123456789", c)))
773 message_with_line (d->lineno,
774 "invalid length %d for char '%c' in alternative %d of operand %d",
775 len, c, which_alternative, start);
787 for (i = 1; i < len; i++)
790 message_with_line (d->lineno,
791 "NUL in alternative %d of operand %d",
792 which_alternative, start);
793 alternative_count_unsure = 1;
796 else if (strchr (",#*", p[i]))
798 message_with_line (d->lineno,
799 "'%c' in alternative %d of operand %d",
800 p[i], which_alternative, start);
801 alternative_count_unsure = 1;
804 if (alternative_count_unsure)
807 n = d->operand[start].n_alternatives;
808 else if (n != d->operand[start].n_alternatives)
810 message_with_line (d->lineno,
811 "wrong number of alternatives in operand %d",
817 /* Record the insn's overall number of alternatives. */
818 d->n_alternatives = n;
821 /* Verify that there are no gaps in operand numbers for INSNs. */
824 validate_insn_operands (struct data *d)
828 for (i = 0; i < d->n_operands; ++i)
829 if (d->operand[i].seen == 0)
831 message_with_line (d->lineno, "missing operand %d", i);
837 validate_optab_operands (struct data *d)
839 if (!d->name || d->name[0] == '\0' || d->name[0] == '*')
842 /* Miscellaneous tests. */
843 if (strncmp (d->name, "cstore", 6) == 0
844 && d->name[strlen (d->name) - 1] == '4'
845 && d->operand[0].mode == VOIDmode)
847 message_with_line (d->lineno, "missing mode for operand 0 of cstore");
852 /* Look at a define_insn just read. Assign its code number. Record
853 on idata the template and the number of arguments. If the insn has
854 a hairy output action, output a function for now. */
857 gen_insn (rtx insn, int lineno)
859 struct data *d = XNEW (struct data);
862 d->code_number = next_code_number;
863 d->index_number = next_index_number;
864 d->filename = read_md_filename;
866 if (XSTR (insn, 0)[0])
867 d->name = XSTR (insn, 0);
871 /* Build up the list in the same order as the insns are seen
872 in the machine description. */
875 idata_end = &d->next;
879 memset (d->operand, 0, sizeof (d->operand));
881 for (i = 0; i < XVECLEN (insn, 1); i++)
882 scan_operands (d, XVECEXP (insn, 1, i), 0, 0);
884 d->n_operands = max_opno + 1;
885 d->n_dups = num_dups;
887 #ifndef USE_MD_CONSTRAINTS
888 check_constraint_len ();
890 validate_insn_operands (d);
891 validate_insn_alternatives (d);
892 validate_optab_operands (d);
894 process_template (d, XTMPL (insn, 3));
897 /* Look at a define_peephole just read. Assign its code number.
898 Record on idata the template and the number of arguments.
899 If the insn has a hairy output action, output it now. */
902 gen_peephole (rtx peep, int lineno)
904 struct data *d = XNEW (struct data);
907 d->code_number = next_code_number;
908 d->index_number = next_index_number;
909 d->filename = read_md_filename;
913 /* Build up the list in the same order as the insns are seen
914 in the machine description. */
917 idata_end = &d->next;
921 memset (d->operand, 0, sizeof (d->operand));
923 /* Get the number of operands by scanning all the patterns of the
924 peephole optimizer. But ignore all the rest of the information
926 for (i = 0; i < XVECLEN (peep, 0); i++)
927 scan_operands (d, XVECEXP (peep, 0, i), 0, 0);
929 d->n_operands = max_opno + 1;
932 validate_insn_alternatives (d);
934 process_template (d, XTMPL (peep, 2));
937 /* Process a define_expand just read. Assign its code number,
938 only for the purposes of `insn_gen_function'. */
941 gen_expand (rtx insn, int lineno)
943 struct data *d = XNEW (struct data);
946 d->code_number = next_code_number;
947 d->index_number = next_index_number;
948 d->filename = read_md_filename;
950 if (XSTR (insn, 0)[0])
951 d->name = XSTR (insn, 0);
955 /* Build up the list in the same order as the insns are seen
956 in the machine description. */
959 idata_end = &d->next;
963 memset (d->operand, 0, sizeof (d->operand));
965 /* Scan the operands to get the specified predicates and modes,
966 since expand_binop needs to know them. */
969 for (i = 0; i < XVECLEN (insn, 1); i++)
970 scan_operands (d, XVECEXP (insn, 1, i), 0, 0);
972 d->n_operands = max_opno + 1;
973 d->n_dups = num_dups;
974 d->template_code = 0;
975 d->output_format = INSN_OUTPUT_FORMAT_NONE;
977 validate_insn_alternatives (d);
978 validate_optab_operands (d);
982 /* Process a define_split just read. Assign its code number,
983 only for reasons of consistency and to simplify genrecog. */
986 gen_split (rtx split, int lineno)
988 struct data *d = XNEW (struct data);
991 d->code_number = next_code_number;
992 d->index_number = next_index_number;
993 d->filename = read_md_filename;
997 /* Build up the list in the same order as the insns are seen
998 in the machine description. */
1001 idata_end = &d->next;
1005 memset (d->operand, 0, sizeof (d->operand));
1007 /* Get the number of operands by scanning all the patterns of the
1008 split patterns. But ignore all the rest of the information thus
1010 for (i = 0; i < XVECLEN (split, 0); i++)
1011 scan_operands (d, XVECEXP (split, 0, i), 0, 0);
1013 d->n_operands = max_opno + 1;
1015 d->n_alternatives = 0;
1016 d->template_code = 0;
1017 d->output_format = INSN_OUTPUT_FORMAT_NONE;
1022 extern int main (int, char **);
1025 main (int argc, char **argv)
1029 progname = "genoutput";
1031 if (init_md_reader_args (argc, argv) != SUCCESS_EXIT_CODE)
1032 return (FATAL_EXIT_CODE);
1035 next_code_number = 0;
1036 next_index_number = 0;
1038 /* Read the machine description. */
1044 desc = read_md_rtx (&line_no, &next_code_number);
1048 switch (GET_CODE (desc))
1051 gen_insn (desc, line_no);
1054 case DEFINE_PEEPHOLE:
1055 gen_peephole (desc, line_no);
1059 gen_expand (desc, line_no);
1063 case DEFINE_PEEPHOLE2:
1064 gen_split (desc, line_no);
1067 #ifdef USE_MD_CONSTRAINTS
1068 case DEFINE_CONSTRAINT:
1069 case DEFINE_REGISTER_CONSTRAINT:
1070 case DEFINE_ADDRESS_CONSTRAINT:
1071 case DEFINE_MEMORY_CONSTRAINT:
1072 note_constraint (desc, line_no);
1079 next_index_number++;
1083 output_operand_data ();
1084 output_insn_data ();
1085 output_get_insn_name ();
1088 return (ferror (stdout) != 0 || have_error
1089 ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE);
1092 /* Return the number of occurrences of character C in string S or
1093 -1 if S is the null string. */
1096 n_occurrences (int c, const char *s)
1100 if (s == 0 || *s == '\0')
1109 /* Remove whitespace in `s' by moving up characters until the end.
1110 Return a new string. */
1113 strip_whitespace (const char *s)
1121 p = q = XNEWVEC (char, strlen (s) + 1);
1122 while ((ch = *s++) != '\0')
1130 #ifdef USE_MD_CONSTRAINTS
1132 /* Record just enough information about a constraint to allow checking
1133 of operand constraint strings above, in validate_insn_alternatives.
1134 Does not validate most properties of the constraint itself; does
1135 enforce no duplicate names, no overlap with MI constraints, and no
1136 prefixes. EXP is the define_*constraint form, LINENO the line number
1137 reported by the reader. */
1139 note_constraint (rtx exp, int lineno)
1141 const char *name = XSTR (exp, 0);
1142 unsigned int namelen = strlen (name);
1143 struct constraint_data **iter, **slot, *new_cdata;
1145 /* The 'm' constraint is special here since that constraint letter
1146 can be overridden by the back end by defining the
1147 TARGET_MEM_CONSTRAINT macro. */
1148 if (strchr (indep_constraints, name[0]) && name[0] != 'm')
1150 if (name[1] == '\0')
1151 message_with_line (lineno, "constraint letter '%s' cannot be "
1152 "redefined by the machine description", name);
1154 message_with_line (lineno, "constraint name '%s' cannot be defined by "
1155 "the machine description, as it begins with '%c'",
1161 slot = &constraints_by_letter_table[(unsigned int)name[0]];
1162 for (iter = slot; *iter; iter = &(*iter)->next_this_letter)
1164 /* This causes slot to end up pointing to the
1165 next_this_letter field of the last constraint with a name
1166 of equal or greater length than the new constraint; hence
1167 the new constraint will be inserted after all previous
1168 constraints with names of the same length. */
1169 if ((*iter)->namelen >= namelen)
1172 if (!strcmp ((*iter)->name, name))
1174 message_with_line (lineno, "redefinition of constraint '%s'", name);
1175 message_with_line ((*iter)->lineno, "previous definition is here");
1179 else if (!strncmp ((*iter)->name, name, (*iter)->namelen))
1181 message_with_line (lineno, "defining constraint '%s' here", name);
1182 message_with_line ((*iter)->lineno, "renders constraint '%s' "
1183 "(defined here) a prefix", (*iter)->name);
1187 else if (!strncmp ((*iter)->name, name, namelen))
1189 message_with_line (lineno, "constraint '%s' is a prefix", name);
1190 message_with_line ((*iter)->lineno, "of constraint '%s' "
1191 "(defined here)", (*iter)->name);
1196 new_cdata = XNEWVAR (struct constraint_data, sizeof (struct constraint_data) + namelen);
1197 strcpy ((char *)new_cdata + offsetof(struct constraint_data, name), name);
1198 new_cdata->namelen = namelen;
1199 new_cdata->lineno = lineno;
1200 new_cdata->next_this_letter = *slot;
1204 /* Return the length of the constraint name beginning at position S
1205 of an operand constraint string, or issue an error message if there
1206 is no such constraint. Does not expect to be called for generic
1209 mdep_constraint_len (const char *s, int lineno, int opno)
1211 struct constraint_data *p;
1213 p = constraints_by_letter_table[(unsigned int)s[0]];
1216 for (; p; p = p->next_this_letter)
1217 if (!strncmp (s, p->name, p->namelen))
1220 message_with_line (lineno,
1221 "error: undefined machine-specific constraint "
1222 "at this point: \"%s\"", s);
1223 message_with_line (lineno, "note: in operand %d", opno);
1225 return 1; /* safe */
1229 /* Verify that DEFAULT_CONSTRAINT_LEN is used properly and not
1230 tampered with. This isn't bullet-proof, but it should catch
1231 most genuine mistakes. */
1233 check_constraint_len (void)
1238 for (p = ",#*+=&%!1234567890"; *p; p++)
1239 for (d = -9; d < 9; d++)
1240 gcc_assert (constraint_len (p, d) == d);
1244 constraint_len (const char *p, int genoutput_default_constraint_len)
1246 /* Check that we still match defaults.h . First we do a generation-time
1247 check that fails if the value is not the expected one... */
1248 gcc_assert (DEFAULT_CONSTRAINT_LEN (*p, p) == 1);
1249 /* And now a compile-time check that should give a diagnostic if the
1250 definition doesn't exactly match. */
1251 #define DEFAULT_CONSTRAINT_LEN(C,STR) 1
1252 /* Now re-define DEFAULT_CONSTRAINT_LEN so that we can verify it is
1254 #undef DEFAULT_CONSTRAINT_LEN
1255 #define DEFAULT_CONSTRAINT_LEN(C,STR) \
1256 ((C) != *p || STR != p ? -1 : genoutput_default_constraint_len)
1257 return CONSTRAINT_LEN (*p, p);
1258 /* And set it back. */
1259 #undef DEFAULT_CONSTRAINT_LEN
1260 #define DEFAULT_CONSTRAINT_LEN(C,STR) 1