1 /* Support routines for the various generation passes.
2 Copyright (C) 2000, 2001, 2002, 2003, 2004, 2005
3 Free Software Foundation, Inc.
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it
8 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 GCC is distributed in the hope that it will be useful, but WITHOUT
13 ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
14 or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
15 License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
24 #include "coretypes.h"
30 #include "gensupport.h"
33 /* In case some macros used by files we include need it, define this here. */
40 /* This callback will be invoked whenever an rtl include directive is
41 processed. To be used for creation of the dependency file. */
42 void (*include_callback) (const char *);
44 static struct obstack obstack;
45 struct obstack *rtl_obstack = &obstack;
47 static int sequence_num;
50 static int predicable_default;
51 static const char *predicable_true;
52 static const char *predicable_false;
54 static htab_t condition_table;
56 static char *base_dir = NULL;
58 /* We initially queue all patterns, process the define_insn and
59 define_cond_exec patterns, then return them one at a time. */
66 struct queue_elem *next;
67 /* In a DEFINE_INSN that came from a DEFINE_INSN_AND_SPLIT, SPLIT
68 points to the generated DEFINE_SPLIT. */
69 struct queue_elem *split;
72 static struct queue_elem *define_attr_queue;
73 static struct queue_elem **define_attr_tail = &define_attr_queue;
74 static struct queue_elem *define_pred_queue;
75 static struct queue_elem **define_pred_tail = &define_pred_queue;
76 static struct queue_elem *define_insn_queue;
77 static struct queue_elem **define_insn_tail = &define_insn_queue;
78 static struct queue_elem *define_cond_exec_queue;
79 static struct queue_elem **define_cond_exec_tail = &define_cond_exec_queue;
80 static struct queue_elem *other_queue;
81 static struct queue_elem **other_tail = &other_queue;
83 static struct queue_elem *queue_pattern (rtx, struct queue_elem ***,
86 /* Current maximum length of directory names in the search path
87 for include files. (Altered as we get more of them.) */
89 size_t max_include_len;
93 struct file_name_list *next;
97 struct file_name_list *first_dir_md_include = 0; /* First dir to search */
98 /* First dir to search for <file> */
99 struct file_name_list *first_bracket_include = 0;
100 struct file_name_list *last_dir_md_include = 0; /* Last in chain */
102 static void remove_constraints (rtx);
103 static void process_rtx (rtx, int);
105 static int is_predicable (struct queue_elem *);
106 static void identify_predicable_attribute (void);
107 static int n_alternatives (const char *);
108 static void collect_insn_data (rtx, int *, int *);
109 static rtx alter_predicate_for_insn (rtx, int, int, int);
110 static const char *alter_test_for_insn (struct queue_elem *,
111 struct queue_elem *);
112 static char *shift_output_template (char *, const char *, int);
113 static const char *alter_output_for_insn (struct queue_elem *,
116 static void process_one_cond_exec (struct queue_elem *);
117 static void process_define_cond_exec (void);
118 static void process_include (rtx, int);
119 static char *save_string (const char *, int);
120 static void init_predicate_table (void);
121 static void record_insn_name (int, const char *);
124 message_with_line (int lineno, const char *msg, ...)
130 fprintf (stderr, "%s:%d: ", read_rtx_filename, lineno);
131 vfprintf (stderr, msg, ap);
132 fputc ('\n', stderr);
137 /* Make a version of gen_rtx_CONST_INT so that GEN_INT can be used in
138 the gensupport programs. */
141 gen_rtx_CONST_INT (enum machine_mode ARG_UNUSED (mode),
144 rtx rt = rtx_alloc (CONST_INT);
150 /* Queue PATTERN on LIST_TAIL. Return the address of the new queue
153 static struct queue_elem *
154 queue_pattern (rtx pattern, struct queue_elem ***list_tail,
155 const char *filename, int lineno)
157 struct queue_elem *e = XNEW(struct queue_elem);
159 e->filename = filename;
164 *list_tail = &e->next;
168 /* Recursively remove constraints from an rtx. */
171 remove_constraints (rtx part)
174 const char *format_ptr;
179 if (GET_CODE (part) == MATCH_OPERAND)
181 else if (GET_CODE (part) == MATCH_SCRATCH)
184 format_ptr = GET_RTX_FORMAT (GET_CODE (part));
186 for (i = 0; i < GET_RTX_LENGTH (GET_CODE (part)); i++)
187 switch (*format_ptr++)
191 remove_constraints (XEXP (part, i));
194 if (XVEC (part, i) != NULL)
195 for (j = 0; j < XVECLEN (part, i); j++)
196 remove_constraints (XVECEXP (part, i, j));
201 /* Process an include file assuming that it lives in gcc/config/{target}/
202 if the include looks like (include "file"). */
205 process_include (rtx desc, int lineno)
207 const char *filename = XSTR (desc, 0);
208 const char *old_filename;
213 /* If specified file name is absolute, skip the include stack. */
214 if (! IS_ABSOLUTE_PATH (filename))
216 struct file_name_list *stackp;
218 /* Search directory path, trying to open the file. */
219 for (stackp = first_dir_md_include; stackp; stackp = stackp->next)
221 static const char sep[2] = { DIR_SEPARATOR, '\0' };
223 pathname = concat (stackp->fname, sep, filename, NULL);
224 input_file = fopen (pathname, "r");
225 if (input_file != NULL)
232 pathname = concat (base_dir, filename, NULL);
234 pathname = xstrdup (filename);
235 input_file = fopen (pathname, "r");
236 if (input_file == NULL)
239 message_with_line (lineno, "include file `%s' not found", filename);
245 /* Save old cursor; setup new for the new file. Note that "lineno" the
246 argument to this function is the beginning of the include statement,
247 while read_rtx_lineno has already been advanced. */
248 old_filename = read_rtx_filename;
249 old_lineno = read_rtx_lineno;
250 read_rtx_filename = pathname;
253 if (include_callback)
254 include_callback (pathname);
256 /* Read the entire file. */
257 while (read_rtx (input_file, &desc, &lineno))
258 process_rtx (desc, lineno);
260 /* Do not free pathname. It is attached to the various rtx queue
263 read_rtx_filename = old_filename;
264 read_rtx_lineno = old_lineno;
269 /* Process a top level rtx in some way, queuing as appropriate. */
272 process_rtx (rtx desc, int lineno)
274 switch (GET_CODE (desc))
277 queue_pattern (desc, &define_insn_tail, read_rtx_filename, lineno);
280 case DEFINE_COND_EXEC:
281 queue_pattern (desc, &define_cond_exec_tail, read_rtx_filename, lineno);
285 queue_pattern (desc, &define_attr_tail, read_rtx_filename, lineno);
288 case DEFINE_PREDICATE:
289 case DEFINE_SPECIAL_PREDICATE:
290 case DEFINE_CONSTRAINT:
291 case DEFINE_REGISTER_CONSTRAINT:
292 case DEFINE_MEMORY_CONSTRAINT:
293 case DEFINE_ADDRESS_CONSTRAINT:
294 queue_pattern (desc, &define_pred_tail, read_rtx_filename, lineno);
298 process_include (desc, lineno);
301 case DEFINE_INSN_AND_SPLIT:
303 const char *split_cond;
307 struct queue_elem *insn_elem;
308 struct queue_elem *split_elem;
310 /* Create a split with values from the insn_and_split. */
311 split = rtx_alloc (DEFINE_SPLIT);
313 i = XVECLEN (desc, 1);
314 XVEC (split, 0) = rtvec_alloc (i);
317 XVECEXP (split, 0, i) = copy_rtx (XVECEXP (desc, 1, i));
318 remove_constraints (XVECEXP (split, 0, i));
321 /* If the split condition starts with "&&", append it to the
322 insn condition to create the new split condition. */
323 split_cond = XSTR (desc, 4);
324 if (split_cond[0] == '&' && split_cond[1] == '&')
326 copy_rtx_ptr_loc (split_cond + 2, split_cond);
327 split_cond = join_c_conditions (XSTR (desc, 2), split_cond + 2);
329 XSTR (split, 1) = split_cond;
330 XVEC (split, 2) = XVEC (desc, 5);
331 XSTR (split, 3) = XSTR (desc, 6);
333 /* Fix up the DEFINE_INSN. */
334 attr = XVEC (desc, 7);
335 PUT_CODE (desc, DEFINE_INSN);
336 XVEC (desc, 4) = attr;
340 = queue_pattern (desc, &define_insn_tail, read_rtx_filename,
343 = queue_pattern (split, &other_tail, read_rtx_filename, lineno);
344 insn_elem->split = split_elem;
349 queue_pattern (desc, &other_tail, read_rtx_filename, lineno);
354 /* Return true if attribute PREDICABLE is true for ELEM, which holds
358 is_predicable (struct queue_elem *elem)
360 rtvec vec = XVEC (elem->data, 4);
365 return predicable_default;
367 for (i = GET_NUM_ELEM (vec) - 1; i >= 0; --i)
369 rtx sub = RTVEC_ELT (vec, i);
370 switch (GET_CODE (sub))
373 if (strcmp (XSTR (sub, 0), "predicable") == 0)
375 value = XSTR (sub, 1);
380 case SET_ATTR_ALTERNATIVE:
381 if (strcmp (XSTR (sub, 0), "predicable") == 0)
383 message_with_line (elem->lineno,
384 "multiple alternatives for `predicable'");
391 if (GET_CODE (SET_DEST (sub)) != ATTR
392 || strcmp (XSTR (SET_DEST (sub), 0), "predicable") != 0)
395 if (GET_CODE (sub) == CONST_STRING)
397 value = XSTR (sub, 0);
401 /* ??? It would be possible to handle this if we really tried.
402 It's not easy though, and I'm not going to bother until it
403 really proves necessary. */
404 message_with_line (elem->lineno,
405 "non-constant value for `predicable'");
414 return predicable_default;
417 /* Verify that predicability does not vary on the alternative. */
418 /* ??? It should be possible to handle this by simply eliminating
419 the non-predicable alternatives from the insn. FRV would like
420 to do this. Delay this until we've got the basics solid. */
421 if (strchr (value, ',') != NULL)
423 message_with_line (elem->lineno,
424 "multiple alternatives for `predicable'");
429 /* Find out which value we're looking at. */
430 if (strcmp (value, predicable_true) == 0)
432 if (strcmp (value, predicable_false) == 0)
435 message_with_line (elem->lineno,
436 "unknown value `%s' for `predicable' attribute",
442 /* Examine the attribute "predicable"; discover its boolean values
446 identify_predicable_attribute (void)
448 struct queue_elem *elem;
449 char *p_true, *p_false;
452 /* Look for the DEFINE_ATTR for `predicable', which must exist. */
453 for (elem = define_attr_queue; elem ; elem = elem->next)
454 if (strcmp (XSTR (elem->data, 0), "predicable") == 0)
457 message_with_line (define_cond_exec_queue->lineno,
458 "attribute `predicable' not defined");
463 value = XSTR (elem->data, 1);
464 p_false = xstrdup (value);
465 p_true = strchr (p_false, ',');
466 if (p_true == NULL || strchr (++p_true, ',') != NULL)
468 message_with_line (elem->lineno,
469 "attribute `predicable' is not a boolean");
475 predicable_true = p_true;
476 predicable_false = p_false;
478 switch (GET_CODE (XEXP (elem->data, 2)))
481 value = XSTR (XEXP (elem->data, 2), 0);
485 message_with_line (elem->lineno,
486 "attribute `predicable' cannot be const");
491 message_with_line (elem->lineno,
492 "attribute `predicable' must have a constant default");
497 if (strcmp (value, p_true) == 0)
498 predicable_default = 1;
499 else if (strcmp (value, p_false) == 0)
500 predicable_default = 0;
503 message_with_line (elem->lineno,
504 "unknown value `%s' for `predicable' attribute",
510 /* Return the number of alternatives in constraint S. */
513 n_alternatives (const char *s)
524 /* Determine how many alternatives there are in INSN, and how many
528 collect_insn_data (rtx pattern, int *palt, int *pmax)
534 code = GET_CODE (pattern);
538 i = n_alternatives (XSTR (pattern, 2));
539 *palt = (i > *palt ? i : *palt);
545 i = XINT (pattern, 0);
554 fmt = GET_RTX_FORMAT (code);
555 len = GET_RTX_LENGTH (code);
556 for (i = 0; i < len; i++)
561 collect_insn_data (XEXP (pattern, i), palt, pmax);
565 if (XVEC (pattern, i) == NULL)
569 for (j = XVECLEN (pattern, i) - 1; j >= 0; --j)
570 collect_insn_data (XVECEXP (pattern, i, j), palt, pmax);
573 case 'i': case 'w': case '0': case 's': case 'S': case 'T':
583 alter_predicate_for_insn (rtx pattern, int alt, int max_op, int lineno)
589 code = GET_CODE (pattern);
594 const char *c = XSTR (pattern, 2);
596 if (n_alternatives (c) != 1)
598 message_with_line (lineno,
599 "too many alternatives for operand %d",
605 /* Replicate C as needed to fill out ALT alternatives. */
606 if (c && *c && alt > 1)
608 size_t c_len = strlen (c);
609 size_t len = alt * (c_len + 1);
610 char *new_c = XNEWVEC(char, len);
612 memcpy (new_c, c, c_len);
613 for (i = 1; i < alt; ++i)
615 new_c[i * (c_len + 1) - 1] = ',';
616 memcpy (&new_c[i * (c_len + 1)], c, c_len);
618 new_c[len - 1] = '\0';
619 XSTR (pattern, 2) = new_c;
627 XINT (pattern, 0) += max_op;
634 fmt = GET_RTX_FORMAT (code);
635 len = GET_RTX_LENGTH (code);
636 for (i = 0; i < len; i++)
643 r = alter_predicate_for_insn (XEXP (pattern, i), alt,
650 for (j = XVECLEN (pattern, i) - 1; j >= 0; --j)
652 r = alter_predicate_for_insn (XVECEXP (pattern, i, j),
653 alt, max_op, lineno);
659 case 'i': case 'w': case '0': case 's':
671 alter_test_for_insn (struct queue_elem *ce_elem,
672 struct queue_elem *insn_elem)
674 return join_c_conditions (XSTR (ce_elem->data, 1),
675 XSTR (insn_elem->data, 2));
678 /* Adjust all of the operand numbers in SRC to match the shift they'll
679 get from an operand displacement of DISP. Return a pointer after the
683 shift_output_template (char *dest, const char *src, int disp)
692 if (ISDIGIT ((unsigned char) c))
694 else if (ISALPHA (c))
707 alter_output_for_insn (struct queue_elem *ce_elem,
708 struct queue_elem *insn_elem,
711 const char *ce_out, *insn_out;
713 size_t len, ce_len, insn_len;
715 /* ??? Could coordinate with genoutput to not duplicate code here. */
717 ce_out = XSTR (ce_elem->data, 2);
718 insn_out = XTMPL (insn_elem->data, 3);
719 if (!ce_out || *ce_out == '\0')
722 ce_len = strlen (ce_out);
723 insn_len = strlen (insn_out);
725 if (*insn_out == '*')
726 /* You must take care of the predicate yourself. */
729 if (*insn_out == '@')
731 len = (ce_len + 1) * alt + insn_len + 1;
732 p = result = XNEWVEC(char, len);
738 while (ISSPACE ((unsigned char) *insn_out));
740 if (*insn_out != '#')
742 p = shift_output_template (p, ce_out, max_op);
748 while (*insn_out && *insn_out != '\n');
755 len = ce_len + 1 + insn_len + 1;
756 result = XNEWVEC (char, len);
758 p = shift_output_template (result, ce_out, max_op);
760 memcpy (p, insn_out, insn_len + 1);
766 /* Replicate insns as appropriate for the given DEFINE_COND_EXEC. */
769 process_one_cond_exec (struct queue_elem *ce_elem)
771 struct queue_elem *insn_elem;
772 for (insn_elem = define_insn_queue; insn_elem ; insn_elem = insn_elem->next)
774 int alternatives, max_operand;
775 rtx pred, insn, pattern, split;
778 if (! is_predicable (insn_elem))
783 collect_insn_data (insn_elem->data, &alternatives, &max_operand);
786 if (XVECLEN (ce_elem->data, 0) != 1)
788 message_with_line (ce_elem->lineno,
789 "too many patterns in predicate");
794 pred = copy_rtx (XVECEXP (ce_elem->data, 0, 0));
795 pred = alter_predicate_for_insn (pred, alternatives, max_operand,
800 /* Construct a new pattern for the new insn. */
801 insn = copy_rtx (insn_elem->data);
803 pattern = rtx_alloc (COND_EXEC);
804 XEXP (pattern, 0) = pred;
805 if (XVECLEN (insn, 1) == 1)
807 XEXP (pattern, 1) = XVECEXP (insn, 1, 0);
808 XVECEXP (insn, 1, 0) = pattern;
809 PUT_NUM_ELEM (XVEC (insn, 1), 1);
813 XEXP (pattern, 1) = rtx_alloc (PARALLEL);
814 XVEC (XEXP (pattern, 1), 0) = XVEC (insn, 1);
815 XVEC (insn, 1) = rtvec_alloc (1);
816 XVECEXP (insn, 1, 0) = pattern;
819 XSTR (insn, 2) = alter_test_for_insn (ce_elem, insn_elem);
820 XTMPL (insn, 3) = alter_output_for_insn (ce_elem, insn_elem,
821 alternatives, max_operand);
823 /* ??? Set `predicable' to false. Not crucial since it's really
824 only used here, and we won't reprocess this new pattern. */
826 /* Put the new pattern on the `other' list so that it
827 (a) is not reprocessed by other define_cond_exec patterns
828 (b) appears after all normal define_insn patterns.
830 ??? B is debatable. If one has normal insns that match
831 cond_exec patterns, they will be preferred over these
832 generated patterns. Whether this matters in practice, or if
833 it's a good thing, or whether we should thread these new
834 patterns into the define_insn chain just after their generator
835 is something we'll have to experiment with. */
837 queue_pattern (insn, &other_tail, insn_elem->filename,
840 if (!insn_elem->split)
843 /* If the original insn came from a define_insn_and_split,
844 generate a new split to handle the predicated insn. */
845 split = copy_rtx (insn_elem->split->data);
846 /* Predicate the pattern matched by the split. */
847 pattern = rtx_alloc (COND_EXEC);
848 XEXP (pattern, 0) = pred;
849 if (XVECLEN (split, 0) == 1)
851 XEXP (pattern, 1) = XVECEXP (split, 0, 0);
852 XVECEXP (split, 0, 0) = pattern;
853 PUT_NUM_ELEM (XVEC (split, 0), 1);
857 XEXP (pattern, 1) = rtx_alloc (PARALLEL);
858 XVEC (XEXP (pattern, 1), 0) = XVEC (split, 0);
859 XVEC (split, 0) = rtvec_alloc (1);
860 XVECEXP (split, 0, 0) = pattern;
862 /* Predicate all of the insns generated by the split. */
863 for (i = 0; i < XVECLEN (split, 2); i++)
865 pattern = rtx_alloc (COND_EXEC);
866 XEXP (pattern, 0) = pred;
867 XEXP (pattern, 1) = XVECEXP (split, 2, i);
868 XVECEXP (split, 2, i) = pattern;
870 /* Add the new split to the queue. */
871 queue_pattern (split, &other_tail, read_rtx_filename,
872 insn_elem->split->lineno);
876 /* If we have any DEFINE_COND_EXEC patterns, expand the DEFINE_INSN
877 patterns appropriately. */
880 process_define_cond_exec (void)
882 struct queue_elem *elem;
884 identify_predicable_attribute ();
888 for (elem = define_cond_exec_queue; elem ; elem = elem->next)
889 process_one_cond_exec (elem);
893 save_string (const char *s, int len)
895 char *result = XNEWVEC (char, len + 1);
897 memcpy (result, s, len);
903 /* The entry point for initializing the reader. */
906 init_md_reader_args_cb (int argc, char **argv, bool (*parse_opt)(const char *))
912 bool no_more_options;
913 bool already_read_stdin;
915 /* Unlock the stdio streams. */
916 unlock_std_streams ();
918 /* First we loop over all the options. */
919 for (i = 1; i < argc; i++)
921 if (argv[i][0] != '-')
927 case 'I': /* Add directory to path for includes. */
929 struct file_name_list *dirtmp;
931 dirtmp = XNEW (struct file_name_list);
932 dirtmp->next = 0; /* New one goes on the end */
933 if (first_dir_md_include == 0)
934 first_dir_md_include = dirtmp;
936 last_dir_md_include->next = dirtmp;
937 last_dir_md_include = dirtmp; /* Tail follows the last one */
938 if (argv[i][1] == 'I' && argv[i][2] != 0)
939 dirtmp->fname = argv[i] + 2;
940 else if (i + 1 == argc)
941 fatal ("directory name missing after -I option");
943 dirtmp->fname = argv[++i];
944 if (strlen (dirtmp->fname) > max_include_len)
945 max_include_len = strlen (dirtmp->fname);
950 /* An argument consisting of exactly one dash is a request to
951 read stdin. This will be handled in the second loop. */
955 /* An argument consisting of just two dashes causes option
957 if (argv[i][2] == '\0')
958 goto stop_parsing_options;
961 /* The program may have provided a callback so it can
962 accept its own options. */
963 if (parse_opt && parse_opt (argv[i]))
966 fatal ("invalid option `%s'", argv[i]);
970 stop_parsing_options:
972 /* Prepare to read input. */
973 condition_table = htab_create (500, hash_c_test, cmp_c_test, NULL);
974 init_predicate_table ();
975 obstack_init (rtl_obstack);
978 no_more_options = false;
979 already_read_stdin = false;
982 /* Now loop over all input files. */
983 for (i = 1; i < argc; i++)
985 if (argv[i][0] == '-')
987 if (argv[i][1] == '\0')
990 if (already_read_stdin)
991 fatal ("cannot read standard input twice");
994 read_rtx_filename = in_fname = "<stdin>";
997 already_read_stdin = true;
999 while (read_rtx (input_file, &desc, &lineno))
1000 process_rtx (desc, lineno);
1001 fclose (input_file);
1004 else if (argv[i][1] == '-' && argv[i][2] == '\0')
1006 /* No further arguments are to be treated as options. */
1007 no_more_options = true;
1010 else if (!no_more_options)
1014 /* If we get here we are looking at a non-option argument, i.e.
1015 a file to be processed. */
1018 lastsl = strrchr (in_fname, '/');
1020 base_dir = save_string (in_fname, lastsl - in_fname + 1 );
1024 read_rtx_filename = in_fname;
1025 read_rtx_lineno = 1;
1026 input_file = fopen (in_fname, "r");
1027 if (input_file == 0)
1030 return FATAL_EXIT_CODE;
1033 while (read_rtx (input_file, &desc, &lineno))
1034 process_rtx (desc, lineno);
1035 fclose (input_file);
1038 /* If we get to this point without having seen any files to process,
1039 read standard input now. */
1043 read_rtx_filename = in_fname = "<stdin>";
1044 read_rtx_lineno = 1;
1047 while (read_rtx (input_file, &desc, &lineno))
1048 process_rtx (desc, lineno);
1049 fclose (input_file);
1052 /* Process define_cond_exec patterns. */
1053 if (define_cond_exec_queue != NULL)
1054 process_define_cond_exec ();
1056 return errors ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE;
1059 /* Programs that don't have their own options can use this entry point
1062 init_md_reader_args (int argc, char **argv)
1064 return init_md_reader_args_cb (argc, argv, 0);
1067 /* The entry point for reading a single rtx from an md file. */
1070 read_md_rtx (int *lineno, int *seqnr)
1072 struct queue_elem **queue, *elem;
1077 /* Read all patterns from a given queue before moving on to the next. */
1078 if (define_attr_queue != NULL)
1079 queue = &define_attr_queue;
1080 else if (define_pred_queue != NULL)
1081 queue = &define_pred_queue;
1082 else if (define_insn_queue != NULL)
1083 queue = &define_insn_queue;
1084 else if (other_queue != NULL)
1085 queue = &other_queue;
1090 *queue = elem->next;
1092 read_rtx_filename = elem->filename;
1093 *lineno = elem->lineno;
1094 *seqnr = sequence_num;
1098 /* Discard insn patterns which we know can never match (because
1099 their C test is provably always false). If insn_elision is
1100 false, our caller needs to see all the patterns. Note that the
1101 elided patterns are never counted by the sequence numbering; it
1102 it is the caller's responsibility, when insn_elision is false, not
1103 to use elided pattern numbers for anything. */
1104 switch (GET_CODE (desc))
1108 if (maybe_eval_c_test (XSTR (desc, 2)) != 0)
1110 else if (insn_elision)
1113 /* *seqnr is used here so the name table will match caller's
1114 idea of insn numbering, whether or not elision is active. */
1115 record_insn_name (*seqnr, XSTR (desc, 0));
1119 case DEFINE_PEEPHOLE:
1120 case DEFINE_PEEPHOLE2:
1121 if (maybe_eval_c_test (XSTR (desc, 1)) != 0)
1123 else if (insn_elision)
1134 /* Helper functions for insn elision. */
1136 /* Compute a hash function of a c_test structure, which is keyed
1137 by its ->expr field. */
1139 hash_c_test (const void *x)
1141 const struct c_test *a = (const struct c_test *) x;
1142 const unsigned char *base, *s = (const unsigned char *) a->expr;
1150 while ((c = *s++) != '\0')
1152 hash += c + (c << 17);
1157 hash += len + (len << 17);
1163 /* Compare two c_test expression structures. */
1165 cmp_c_test (const void *x, const void *y)
1167 const struct c_test *a = (const struct c_test *) x;
1168 const struct c_test *b = (const struct c_test *) y;
1170 return !strcmp (a->expr, b->expr);
1173 /* Given a string representing a C test expression, look it up in the
1174 condition_table and report whether or not its value is known
1175 at compile time. Returns a tristate: 1 for known true, 0 for
1176 known false, -1 for unknown. */
1178 maybe_eval_c_test (const char *expr)
1180 const struct c_test *test;
1181 struct c_test dummy;
1187 test = (const struct c_test *)htab_find (condition_table, &dummy);
1193 /* Record the C test expression EXPR in the condition_table, with
1194 value VAL. Duplicates clobber previous entries. */
1197 add_c_test (const char *expr, int value)
1199 struct c_test *test;
1204 test = XNEW (struct c_test);
1206 test->value = value;
1208 *(htab_find_slot (condition_table, test, INSERT)) = test;
1211 /* For every C test, call CALLBACK with two arguments: a pointer to
1212 the condition structure and INFO. Stops when CALLBACK returns zero. */
1214 traverse_c_tests (htab_trav callback, void *info)
1216 if (condition_table)
1217 htab_traverse (condition_table, callback, info);
1221 /* Given a string, return the number of comma-separated elements in it.
1222 Return 0 for the null string. */
1224 n_comma_elts (const char *s)
1231 for (n = 1; *s; s++)
1238 /* Given a pointer to a (char *), return a pointer to the beginning of the
1239 next comma-separated element in the string. Advance the pointer given
1240 to the end of that element. Return NULL if at end of string. Caller
1241 is responsible for copying the string if necessary. White space between
1242 a comma and an element is ignored. */
1245 scan_comma_elt (const char **pstr)
1248 const char *p = *pstr;
1260 while (*p != ',' && *p != '\0')
1267 /* Helper functions for define_predicate and define_special_predicate
1268 processing. Shared between genrecog.c and genpreds.c. */
1270 static htab_t predicate_table;
1271 struct pred_data *first_predicate;
1272 static struct pred_data **last_predicate = &first_predicate;
1275 hash_struct_pred_data (const void *ptr)
1277 return htab_hash_string (((const struct pred_data *)ptr)->name);
1281 eq_struct_pred_data (const void *a, const void *b)
1283 return !strcmp (((const struct pred_data *)a)->name,
1284 ((const struct pred_data *)b)->name);
1288 lookup_predicate (const char *name)
1290 struct pred_data key;
1292 return (struct pred_data *) htab_find (predicate_table, &key);
1296 add_predicate (struct pred_data *pred)
1298 void **slot = htab_find_slot (predicate_table, pred, INSERT);
1301 error ("duplicate predicate definition for '%s'", pred->name);
1305 *last_predicate = pred;
1306 last_predicate = &pred->next;
1309 /* This array gives the initial content of the predicate table. It
1310 has entries for all predicates defined in recog.c. */
1312 struct std_pred_table
1316 RTX_CODE codes[NUM_RTX_CODE];
1319 static const struct std_pred_table std_preds[] = {
1320 {"general_operand", false, {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
1321 LABEL_REF, SUBREG, REG, MEM }},
1322 {"address_operand", true, {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
1323 LABEL_REF, SUBREG, REG, MEM,
1324 PLUS, MINUS, MULT}},
1325 {"register_operand", false, {SUBREG, REG}},
1326 {"pmode_register_operand", true, {SUBREG, REG}},
1327 {"scratch_operand", false, {SCRATCH, REG}},
1328 {"immediate_operand", false, {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
1330 {"const_int_operand", false, {CONST_INT}},
1331 {"const_double_operand", false, {CONST_INT, CONST_DOUBLE}},
1332 {"nonimmediate_operand", false, {SUBREG, REG, MEM}},
1333 {"nonmemory_operand", false, {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
1334 LABEL_REF, SUBREG, REG}},
1335 {"push_operand", false, {MEM}},
1336 {"pop_operand", false, {MEM}},
1337 {"memory_operand", false, {SUBREG, MEM}},
1338 {"indirect_operand", false, {SUBREG, MEM}},
1339 {"comparison_operator", false, {EQ, NE, LE, LT, GE, GT, LEU, LTU, GEU, GTU,
1340 UNORDERED, ORDERED, UNEQ, UNGE, UNGT, UNLE,
1343 #define NUM_KNOWN_STD_PREDS ARRAY_SIZE (std_preds)
1345 /* Initialize the table of predicate definitions, starting with
1346 the information we have on generic predicates. */
1349 init_predicate_table (void)
1352 struct pred_data *pred;
1354 predicate_table = htab_create_alloc (37, hash_struct_pred_data,
1355 eq_struct_pred_data, 0,
1358 for (i = 0; i < NUM_KNOWN_STD_PREDS; i++)
1360 pred = XCNEW (struct pred_data);
1361 pred->name = std_preds[i].name;
1362 pred->special = std_preds[i].special;
1364 for (j = 0; std_preds[i].codes[j] != 0; j++)
1366 enum rtx_code code = std_preds[i].codes[j];
1368 pred->codes[code] = true;
1369 if (GET_RTX_CLASS (code) != RTX_CONST_OBJ)
1370 pred->allows_non_const = true;
1376 && code != STRICT_LOW_PART)
1377 pred->allows_non_lvalue = true;
1380 pred->singleton = std_preds[i].codes[0];
1382 add_predicate (pred);
1386 /* These functions allow linkage with print-rtl.c. Also, some generators
1387 like to annotate their output with insn names. */
1389 /* Holds an array of names indexed by insn_code_number. */
1390 static char **insn_name_ptr = 0;
1391 static int insn_name_ptr_size = 0;
1394 get_insn_name (int code)
1396 if (code < insn_name_ptr_size)
1397 return insn_name_ptr[code];
1403 record_insn_name (int code, const char *name)
1405 static const char *last_real_name = "insn";
1406 static int last_real_code = 0;
1409 if (insn_name_ptr_size <= code)
1412 new_size = (insn_name_ptr_size ? insn_name_ptr_size * 2 : 512);
1413 insn_name_ptr = xrealloc (insn_name_ptr, sizeof(char *) * new_size);
1414 memset (insn_name_ptr + insn_name_ptr_size, 0,
1415 sizeof(char *) * (new_size - insn_name_ptr_size));
1416 insn_name_ptr_size = new_size;
1419 if (!name || name[0] == '\0')
1421 new = xmalloc (strlen (last_real_name) + 10);
1422 sprintf (new, "%s+%d", last_real_name, code - last_real_code);
1426 last_real_name = new = xstrdup (name);
1427 last_real_code = code;
1430 insn_name_ptr[code] = new;