1 /* Generate code from machine description to recognize rtl as insns.
2 Copyright (C) 1987, 88, 92-95, 97-98, 1999 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
22 /* This program is used to produce insn-recog.c, which contains a
23 function called `recog' plus its subroutines. These functions
24 contain a decision tree that recognizes whether an rtx, the
25 argument given to recog, is a valid instruction.
27 recog returns -1 if the rtx is not valid. If the rtx is valid,
28 recog returns a nonnegative number which is the insn code number
29 for the pattern that matched. This is the same as the order in the
30 machine description of the entry that matched. This number can be
31 used as an index into various insn_* tables, such as insn_template,
32 insn_outfun, and insn_n_operands (found in insn-output.c).
34 The third argument to recog is an optional pointer to an int. If
35 present, recog will accept a pattern if it matches except for
36 missing CLOBBER expressions at the end. In that case, the value
37 pointed to by the optional pointer will be set to the number of
38 CLOBBERs that need to be added (it should be initialized to zero by
39 the caller). If it is set nonzero, the caller should allocate a
40 PARALLEL of the appropriate size, copy the initial entries, and
41 call add_clobbers (found in insn-emit.c) to fill in the CLOBBERs.
43 This program also generates the function `split_insns', which
44 returns 0 if the rtl could not be split, or it returns the split
47 This program also generates the function `peephole2_insns', which
48 returns 0 if the rtl could not be matched. If there was a match,
49 the new rtl is returned in a SEQUENCE, and LAST_INSN will point
50 to the last recognized insn in the old sequence. */
58 #define OUTPUT_LABEL(INDENT_STRING, LABEL_NUMBER) \
59 printf("%sL%d: ATTRIBUTE_UNUSED_LABEL\n", (INDENT_STRING), (LABEL_NUMBER))
61 static struct obstack obstack;
62 struct obstack *rtl_obstack = &obstack;
64 #define obstack_chunk_alloc xmalloc
65 #define obstack_chunk_free free
67 /* Holds an array of names indexed by insn_code_number. */
68 static char **insn_name_ptr = 0;
69 static int insn_name_ptr_size = 0;
71 /* A listhead of decision trees. The alternatives to a node are kept
72 in a doublely-linked list so we can easily add nodes to the proper
73 place when merging. */
77 struct decision *first;
78 struct decision *last;
81 /* A single test. The two accept types aren't tests per-se, but
82 their equality (or lack thereof) does affect tree merging so
83 it is convenient to keep them here. */
87 /* A linked list through the tests attached to a node. */
88 struct decision_test *next;
90 /* These types are roughly in the order in which we'd like to test them. */
92 DT_mode, DT_code, DT_veclen,
93 DT_elt_zero_int, DT_elt_one_int, DT_elt_zero_wide,
94 DT_dup, DT_pred, DT_c_test,
95 DT_accept_op, DT_accept_insn
100 enum machine_mode mode; /* Machine mode of node. */
101 RTX_CODE code; /* Code to test. */
105 const char *name; /* Predicate to call. */
106 int index; /* Index into `preds' or -1. */
107 enum machine_mode mode; /* Machine mode for node. */
110 const char *c_test; /* Additional test to perform. */
111 int veclen; /* Length of vector. */
112 int dup; /* Number of operand to compare against. */
113 HOST_WIDE_INT intval; /* Value for XINT for XWINT. */
114 int opno; /* Operand number matched. */
117 int code_number; /* Insn number matched. */
118 int lineno; /* Line number of the insn. */
119 int num_clobbers_to_add; /* Number of CLOBBERs to be added. */
124 /* Data structure for decision tree for recognizing legitimate insns. */
128 struct decision_head success; /* Nodes to test on success. */
129 struct decision *next; /* Node to test on failure. */
130 struct decision *prev; /* Node whose failure tests us. */
131 struct decision *afterward; /* Node to test on success,
132 but failure of successor nodes. */
134 const char *position; /* String denoting position in pattern. */
136 struct decision_test *tests; /* The tests for this node. */
138 int number; /* Node number, used for labels */
139 int subroutine_number; /* Number of subroutine this node starts */
140 int need_label; /* Label needs to be output. */
143 #define SUBROUTINE_THRESHOLD 100
145 static int next_subroutine_number;
147 /* We can write three types of subroutines: One for insn recognition,
148 one to split insns, and one for peephole-type optimizations. This
149 defines which type is being written. */
152 RECOG, SPLIT, PEEPHOLE2
155 #define IS_SPLIT(X) ((X) != RECOG)
157 /* Next available node number for tree nodes. */
159 static int next_number;
161 /* Next number to use as an insn_code. */
163 static int next_insn_code;
165 /* Similar, but counts all expressions in the MD file; used for
168 static int next_index;
170 /* Record the highest depth we ever have so we know how many variables to
171 allocate in each subroutine we make. */
173 static int max_depth;
175 /* The line number of the start of the pattern currently being processed. */
176 static int pattern_lineno;
178 /* Count of errors. */
179 static int error_count;
181 /* This table contains a list of the rtl codes that can possibly match a
182 predicate defined in recog.c. The function `maybe_both_true' uses it to
183 deduce that there are no expressions that can be matches by certain pairs
184 of tree nodes. Also, if a predicate can match only one code, we can
185 hardwire that code into the node testing the predicate. */
187 static struct pred_table
190 RTX_CODE codes[NUM_RTX_CODE];
192 {"general_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
193 LABEL_REF, SUBREG, REG, MEM}},
194 #ifdef PREDICATE_CODES
197 {"address_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
198 LABEL_REF, SUBREG, REG, MEM, PLUS, MINUS, MULT}},
199 {"register_operand", {SUBREG, REG}},
200 {"scratch_operand", {SCRATCH, REG}},
201 {"immediate_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
203 {"const_int_operand", {CONST_INT}},
204 {"const_double_operand", {CONST_INT, CONST_DOUBLE}},
205 {"nonimmediate_operand", {SUBREG, REG, MEM}},
206 {"nonmemory_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
207 LABEL_REF, SUBREG, REG}},
208 {"push_operand", {MEM}},
209 {"pop_operand", {MEM}},
210 {"memory_operand", {SUBREG, MEM}},
211 {"indirect_operand", {SUBREG, MEM}},
212 {"comparison_operator", {EQ, NE, LE, LT, GE, GT, LEU, LTU, GEU, GTU}},
213 {"mode_independent_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
214 LABEL_REF, SUBREG, REG, MEM}}
217 #define NUM_KNOWN_PREDS (sizeof preds / sizeof preds[0])
219 static const char * special_mode_pred_table[] = {
220 #ifdef SPECIAL_MODE_PREDICATES
221 SPECIAL_MODE_PREDICATES
226 #define NUM_SPECIAL_MODE_PREDS \
227 (sizeof (special_mode_pred_table) / sizeof (const char *) - 1)
229 static struct decision *new_decision
230 PROTO((const char *, struct decision_head *));
231 static struct decision_test *new_decision_test
232 PROTO((enum decision_type, struct decision_test ***));
233 static rtx find_operand
235 static void validate_pattern
236 PROTO((rtx, rtx, int));
237 static struct decision *add_to_sequence
238 PROTO((rtx, struct decision_head *, const char *, enum routine_type, int));
240 static int maybe_both_true_2
241 PROTO((struct decision_test *, struct decision_test *));
242 static int maybe_both_true_1
243 PROTO((struct decision_test *, struct decision_test *));
244 static int maybe_both_true
245 PROTO((struct decision *, struct decision *, int));
247 static int nodes_identical_1
248 PROTO((struct decision_test *, struct decision_test *));
249 static int nodes_identical
250 PROTO((struct decision *, struct decision *));
251 static void merge_accept_insn
252 PROTO((struct decision *, struct decision *));
253 static void merge_trees
254 PROTO((struct decision_head *, struct decision_head *));
256 static void factor_tests
257 PROTO((struct decision_head *));
258 static void simplify_tests
259 PROTO((struct decision_head *));
260 static int break_out_subroutines
261 PROTO((struct decision_head *, int));
262 static void find_afterward
263 PROTO((struct decision_head *, struct decision *));
265 static void change_state
266 PROTO((const char *, const char *, struct decision *, const char *));
267 static void print_code
268 PROTO((enum rtx_code));
269 static void write_afterward
270 PROTO((struct decision *, struct decision *, const char *));
271 static struct decision *write_switch
272 PROTO((struct decision *, int));
273 static void write_cond
274 PROTO((struct decision_test *, int, enum routine_type));
275 static void write_action
276 PROTO((struct decision_test *, int, int, struct decision *,
278 static int is_unconditional
279 PROTO((struct decision_test *, enum routine_type));
280 static int write_node
281 PROTO((struct decision *, int, enum routine_type));
282 static void write_tree_1
283 PROTO((struct decision_head *, int, enum routine_type));
284 static void write_tree
285 PROTO((struct decision_head *, const char *, enum routine_type, int));
286 static void write_subroutine
287 PROTO((struct decision_head *, enum routine_type));
288 static void write_subroutines
289 PROTO((struct decision_head *, enum routine_type));
290 static void write_header
293 static struct decision_head make_insn_sequence
294 PROTO((rtx, enum routine_type));
295 static void process_tree
296 PROTO((struct decision_head *, enum routine_type));
298 static void record_insn_name
299 PROTO((int, const char *));
301 static void debug_decision_1
302 PROTO((struct decision *, int));
303 static void debug_decision_2
304 PROTO((struct decision_test *));
305 extern void debug_decision
306 PROTO((struct decision *));
309 message_with_line VPROTO ((int lineno, const char *msg, ...))
311 #ifndef ANSI_PROTOTYPES
319 #ifndef ANSI_PROTOTYPES
320 lineno = va_arg (ap, int);
321 msg = va_arg (ap, const char *);
324 fprintf (stderr, "%s:%d: ", read_rtx_filename, lineno);
325 vfprintf (stderr, msg, ap);
326 fputc ('\n', stderr);
331 /* Create a new node in sequence after LAST. */
333 static struct decision *
334 new_decision (position, last)
335 const char *position;
336 struct decision_head *last;
338 register struct decision *new
339 = (struct decision *) xmalloc (sizeof (struct decision));
341 memset (new, 0, sizeof (*new));
342 new->success = *last;
343 new->position = xstrdup (position);
344 new->number = next_number++;
346 last->first = last->last = new;
350 /* Create a new test and link it in at PLACE. */
352 static struct decision_test *
353 new_decision_test (type, pplace)
354 enum decision_type type;
355 struct decision_test ***pplace;
357 struct decision_test **place = *pplace;
358 struct decision_test *test;
360 test = (struct decision_test *) xmalloc (sizeof (*test));
371 /* Search for and return operand N. */
374 find_operand (pattern, n)
383 code = GET_CODE (pattern);
384 if ((code == MATCH_SCRATCH
385 || code == MATCH_INSN
386 || code == MATCH_OPERAND
387 || code == MATCH_OPERATOR
388 || code == MATCH_PARALLEL)
389 && XINT (pattern, 0) == n)
392 fmt = GET_RTX_FORMAT (code);
393 len = GET_RTX_LENGTH (code);
394 for (i = 0; i < len; i++)
399 if ((r = find_operand (XEXP (pattern, i), n)) != NULL_RTX)
404 for (j = 0; j < XVECLEN (pattern, i); j++)
405 if ((r = find_operand (XVECEXP (pattern, i, j), n)) != NULL_RTX)
409 case 'i': case 'w': case '0': case 's':
420 /* Check for various errors in patterns. */
423 validate_pattern (pattern, insn, set_dest)
433 code = GET_CODE (pattern);
443 const char *pred_name = XSTR (pattern, 1);
444 int allows_non_lvalue = 1, allows_non_const = 1;
445 int special_mode_pred = 0;
448 if (GET_CODE (insn) == DEFINE_INSN)
449 c_test = XSTR (insn, 2);
451 c_test = XSTR (insn, 1);
453 if (pred_name[0] != 0)
455 for (i = 0; i < NUM_KNOWN_PREDS; i++)
456 if (! strcmp (preds[i].name, pred_name))
459 if (i < NUM_KNOWN_PREDS)
463 allows_non_lvalue = allows_non_const = 0;
464 for (j = 0; preds[i].codes[j] != 0; j++)
466 RTX_CODE c = preds[i].codes[j];
473 && c != CONSTANT_P_RTX)
474 allows_non_const = 1;
481 && c != STRICT_LOW_PART)
482 allows_non_lvalue = 1;
487 #ifdef PREDICATE_CODES
488 /* If the port has a list of the predicates it uses but
490 message_with_line (pattern_lineno,
491 "warning: `%s' not in PREDICATE_CODES",
496 for (i = 0; i < NUM_SPECIAL_MODE_PREDS; ++i)
497 if (strcmp (pred_name, special_mode_pred_table[i]) == 0)
499 special_mode_pred = 1;
504 /* Allowing non-lvalues in destinations -- particularly CONST_INT --
505 while not likely to occur at runtime, results in less efficient
506 code from insn-recog.c. */
508 && pred_name[0] != '\0'
509 && allows_non_lvalue)
511 message_with_line (pattern_lineno,
512 "warning: destination operand 0 allows non-lvalue",
516 /* A modeless MATCH_OPERAND can be handy when we can
517 check for multiple modes in the c_test. In most other cases,
518 it is a mistake. Only DEFINE_INSN is eligible, since SPLIT
519 and PEEP2 can FAIL within the output pattern. */
521 if (GET_MODE (pattern) == VOIDmode
522 && code == MATCH_OPERAND
523 && pred_name[0] != '\0'
525 && ! special_mode_pred
526 && strstr (c_test, "operands") == NULL
527 && GET_CODE (insn) == DEFINE_INSN)
529 message_with_line (pattern_lineno,
530 "warning: operand %d missing mode?",
534 /* A MATCH_OPERAND that is a SET should have an output reload. */
536 && code == MATCH_OPERAND
537 && XSTR (pattern, 2)[0] != '\0'
538 && XSTR (pattern, 2)[0] != '='
539 && XSTR (pattern, 2)[0] != '+')
541 message_with_line (pattern_lineno,
542 "operand %d missing output reload",
552 enum machine_mode dmode, smode;
555 dest = SET_DEST (pattern);
556 src = SET_SRC (pattern);
558 /* Find the referant for a DUP. */
560 if (GET_CODE (dest) == MATCH_DUP
561 || GET_CODE (dest) == MATCH_OP_DUP
562 || GET_CODE (dest) == MATCH_PAR_DUP)
563 dest = find_operand (insn, XINT (dest, 0));
565 if (GET_CODE (src) == MATCH_DUP
566 || GET_CODE (src) == MATCH_OP_DUP
567 || GET_CODE (src) == MATCH_PAR_DUP)
568 src = find_operand (insn, XINT (src, 0));
570 /* STRICT_LOW_PART is a wrapper. Its argument is the real
571 destination, and it's mode should match the source. */
572 if (GET_CODE (dest) == STRICT_LOW_PART)
573 dest = XEXP (dest, 0);
575 dmode = GET_MODE (dest);
576 smode = GET_MODE (src);
578 /* The mode of an ADDRESS_OPERAND is the mode of the memory
579 reference, not the mode of the address. */
580 if (GET_CODE (src) == MATCH_OPERAND
581 && ! strcmp (XSTR (src, 1), "address_operand"))
584 /* The operands of a SET must have the same mode unless one
586 else if (dmode != VOIDmode && smode != VOIDmode && dmode != smode)
588 message_with_line (pattern_lineno,
589 "mode mismatch in set: %smode vs %smode",
590 GET_MODE_NAME (dmode), GET_MODE_NAME (smode));
594 /* If only one of the operands is VOIDmode, and PC or CC0 is
595 not involved, it's probably a mistake. */
596 else if (dmode != smode
597 && GET_CODE (dest) != PC
598 && GET_CODE (dest) != CC0
599 && GET_CODE (src) != CONST_INT)
602 which = (dmode == VOIDmode ? "destination" : "source");
603 message_with_line (pattern_lineno,
604 "warning: %s missing a mode?", which);
607 if (dest != SET_DEST (pattern))
608 validate_pattern (dest, insn, 1);
609 validate_pattern (SET_DEST (pattern), insn, 1);
610 validate_pattern (SET_SRC (pattern), insn, 0);
615 validate_pattern (SET_DEST (pattern), insn, 1);
619 if (GET_MODE (XEXP (pattern, 0)) != VOIDmode)
621 message_with_line (pattern_lineno,
622 "operand to label_ref %smode not VOIDmode",
623 GET_MODE_NAME (GET_MODE (XEXP (pattern, 0))));
632 fmt = GET_RTX_FORMAT (code);
633 len = GET_RTX_LENGTH (code);
634 for (i = 0; i < len; i++)
639 validate_pattern (XEXP (pattern, i), insn, 0);
643 for (j = 0; j < XVECLEN (pattern, i); j++)
644 validate_pattern (XVECEXP (pattern, i, j), insn, 0);
647 case 'i': case 'w': case '0': case 's':
656 /* Create a chain of nodes to verify that an rtl expression matches
659 LAST is a pointer to the listhead in the previous node in the chain (or
660 in the calling function, for the first node).
662 POSITION is the string representing the current position in the insn.
664 INSN_TYPE is the type of insn for which we are emitting code.
666 A pointer to the final node in the chain is returned. */
668 static struct decision *
669 add_to_sequence (pattern, last, position, insn_type, top)
671 struct decision_head *last;
672 const char *position;
673 enum routine_type insn_type;
677 struct decision *this, *sub;
678 struct decision_test *test;
679 struct decision_test **place;
682 register const char *fmt;
683 int depth = strlen (position);
685 enum machine_mode mode;
687 if (depth > max_depth)
690 subpos = (char *) alloca (depth + 2);
691 strcpy (subpos, position);
692 subpos[depth + 1] = 0;
694 sub = this = new_decision (position, last);
695 place = &this->tests;
698 mode = GET_MODE (pattern);
699 code = GET_CODE (pattern);
704 /* Toplevel peephole pattern. */
705 if (insn_type == PEEPHOLE2 && top)
707 /* We don't need the node we just created -- unlink it. */
708 last->first = last->last = NULL;
710 for (i = 0; i < (size_t) XVECLEN (pattern, 0); i++)
712 /* Which insn we're looking at is represented by A-Z. We don't
713 ever use 'A', however; it is always implied. */
715 subpos[depth] = (i > 0 ? 'A' + i : 0);
716 sub = add_to_sequence (XVECEXP (pattern, 0, i),
717 last, subpos, insn_type, 0);
718 last = &sub->success;
723 /* Else nothing special. */
732 const char *pred_name;
733 RTX_CODE was_code = code;
734 int allows_const_int = 1;
736 if (code == MATCH_SCRATCH)
738 pred_name = "scratch_operand";
743 pred_name = XSTR (pattern, 1);
744 if (code == MATCH_PARALLEL)
750 /* We know exactly what const_int_operand matches -- any CONST_INT. */
751 if (strcmp ("const_int_operand", pred_name) == 0)
756 else if (pred_name[0] != 0)
758 test = new_decision_test (DT_pred, &place);
759 test->u.pred.name = pred_name;
760 test->u.pred.mode = mode;
762 /* See if we know about this predicate and save its number. If
763 we do, and it only accepts one code, note that fact. The
764 predicate `const_int_operand' only tests for a CONST_INT, so
765 if we do so we can avoid calling it at all.
767 Finally, if we know that the predicate does not allow
768 CONST_INT, we know that the only way the predicate can match
769 is if the modes match (here we use the kludge of relying on
770 the fact that "address_operand" accepts CONST_INT; otherwise,
771 it would have to be a special case), so we can test the mode
772 (but we need not). This fact should considerably simplify the
775 for (i = 0; i < NUM_KNOWN_PREDS; i++)
776 if (! strcmp (preds[i].name, pred_name))
779 if (i < NUM_KNOWN_PREDS)
783 test->u.pred.index = i;
785 if (preds[i].codes[1] == 0 && code == UNKNOWN)
786 code = preds[i].codes[0];
788 allows_const_int = 0;
789 for (j = 0; preds[i].codes[j] != 0; j++)
790 if (preds[i].codes[j] == CONST_INT)
792 allows_const_int = 1;
797 test->u.pred.index = -1;
800 /* Can't enforce a mode if we allow const_int. */
801 if (allows_const_int)
804 /* Accept the operand, ie. record it in `operands'. */
805 test = new_decision_test (DT_accept_op, &place);
806 test->u.opno = XINT (pattern, 0);
808 if (was_code == MATCH_OPERATOR || was_code == MATCH_PARALLEL)
810 char base = (was_code == MATCH_OPERATOR ? '0' : 'a');
811 for (i = 0; i < (size_t) XVECLEN (pattern, 2); i++)
813 subpos[depth] = i + base;
814 sub = add_to_sequence (XVECEXP (pattern, 2, i),
815 &sub->success, subpos, insn_type, 0);
824 test = new_decision_test (DT_dup, &place);
825 test->u.dup = XINT (pattern, 0);
827 test = new_decision_test (DT_accept_op, &place);
828 test->u.opno = XINT (pattern, 0);
830 for (i = 0; i < (size_t) XVECLEN (pattern, 1); i++)
832 subpos[depth] = i + '0';
833 sub = add_to_sequence (XVECEXP (pattern, 1, i),
834 &sub->success, subpos, insn_type, 0);
842 test = new_decision_test (DT_dup, &place);
843 test->u.dup = XINT (pattern, 0);
847 pattern = XEXP (pattern, 0);
854 fmt = GET_RTX_FORMAT (code);
855 len = GET_RTX_LENGTH (code);
857 /* Do tests against the current node first. */
858 for (i = 0; i < (size_t) len; i++)
864 test = new_decision_test (DT_elt_zero_int, &place);
865 test->u.intval = XINT (pattern, i);
869 test = new_decision_test (DT_elt_one_int, &place);
870 test->u.intval = XINT (pattern, i);
875 else if (fmt[i] == 'w')
880 test = new_decision_test (DT_elt_zero_wide, &place);
881 test->u.intval = XWINT (pattern, i);
883 else if (fmt[i] == 'E')
888 test = new_decision_test (DT_veclen, &place);
889 test->u.veclen = XVECLEN (pattern, i);
893 /* Now test our sub-patterns. */
894 for (i = 0; i < (size_t) len; i++)
899 subpos[depth] = '0' + i;
900 sub = add_to_sequence (XEXP (pattern, i), &sub->success,
901 subpos, insn_type, 0);
907 for (j = 0; j < XVECLEN (pattern, i); j++)
909 subpos[depth] = 'a' + j;
910 sub = add_to_sequence (XVECEXP (pattern, i, j),
911 &sub->success, subpos, insn_type, 0);
928 /* Insert nodes testing mode and code, if they're still relevant,
929 before any of the nodes we may have added above. */
932 place = &this->tests;
933 test = new_decision_test (DT_code, &place);
937 if (mode != VOIDmode)
939 place = &this->tests;
940 test = new_decision_test (DT_mode, &place);
944 /* If we didn't insert any tests or accept nodes, hork. */
945 if (this->tests == NULL)
951 /* A subroutine of maybe_both_true; examines only one test.
952 Returns > 0 for "definitely both true" and < 0 for "maybe both true". */
955 maybe_both_true_2 (d1, d2)
956 struct decision_test *d1, *d2;
958 if (d1->type == d2->type)
963 return d1->u.mode == d2->u.mode;
966 return d1->u.code == d2->u.code;
969 return d1->u.veclen == d2->u.veclen;
971 case DT_elt_zero_int:
973 case DT_elt_zero_wide:
974 return d1->u.intval == d2->u.intval;
981 /* If either has a predicate that we know something about, set
982 things up so that D1 is the one that always has a known
983 predicate. Then see if they have any codes in common. */
985 if (d1->type == DT_pred || d2->type == DT_pred)
987 if (d2->type == DT_pred)
989 struct decision_test *tmp;
990 tmp = d1, d1 = d2, d2 = tmp;
993 /* If D2 tests a mode, see if it matches D1. */
994 if (d1->u.pred.mode != VOIDmode)
996 if (d2->type == DT_mode)
998 if (d1->u.pred.mode != d2->u.mode)
1001 /* Don't check two predicate modes here, because if both predicates
1002 accept CONST_INT, then both can still be true even if the modes
1003 are different. If they don't accept CONST_INT, there will be a
1004 separate DT_mode that will make maybe_both_true_1 return 0. */
1007 if (d1->u.pred.index >= 0)
1009 /* If D2 tests a code, see if it is in the list of valid
1010 codes for D1's predicate. */
1011 if (d2->type == DT_code)
1013 const RTX_CODE *c = &preds[d1->u.pred.index].codes[0];
1016 if (*c == d2->u.code)
1024 /* Otherwise see if the predicates have any codes in common. */
1025 else if (d2->type == DT_pred && d2->u.pred.index >= 0)
1027 const RTX_CODE *c1 = &preds[d1->u.pred.index].codes[0];
1030 while (*c1 != 0 && !common)
1032 const RTX_CODE *c2 = &preds[d2->u.pred.index].codes[0];
1033 while (*c2 != 0 && !common)
1035 common = (*c1 == *c2);
1050 /* A subroutine of maybe_both_true; examines all the tests for a given node.
1051 Returns > 0 for "definitely both true" and < 0 for "maybe both true". */
1054 maybe_both_true_1 (d1, d2)
1055 struct decision_test *d1, *d2;
1057 struct decision_test *t1, *t2;
1059 /* A match_operand with no predicate can match anything. Recognize
1060 this by the existance of a lone DT_accept_op test. */
1061 if (d1->type == DT_accept_op || d2->type == DT_accept_op)
1064 /* Eliminate pairs of tests while they can exactly match. */
1065 while (d1 && d2 && d1->type == d2->type)
1067 if (maybe_both_true_2 (d1, d2) == 0)
1069 d1 = d1->next, d2 = d2->next;
1072 /* After that, consider all pairs. */
1073 for (t1 = d1; t1 ; t1 = t1->next)
1074 for (t2 = d2; t2 ; t2 = t2->next)
1075 if (maybe_both_true_2 (t1, t2) == 0)
1081 /* Return 0 if we can prove that there is no RTL that can match both
1082 D1 and D2. Otherwise, return 1 (it may be that there is an RTL that
1083 can match both or just that we couldn't prove there wasn't such an RTL).
1085 TOPLEVEL is non-zero if we are to only look at the top level and not
1086 recursively descend. */
1089 maybe_both_true (d1, d2, toplevel)
1090 struct decision *d1, *d2;
1093 struct decision *p1, *p2;
1096 /* Don't compare strings on the different positions in insn. Doing so
1097 is incorrect and results in false matches from constructs like
1099 [(set (subreg:HI (match_operand:SI "register_operand" "r") 0)
1100 (subreg:HI (match_operand:SI "register_operand" "r") 0))]
1102 [(set (match_operand:HI "register_operand" "r")
1103 (match_operand:HI "register_operand" "r"))]
1105 If we are presented with such, we are recursing through the remainder
1106 of a node's success nodes (from the loop at the end of this function).
1107 Skip forward until we come to a position that matches.
1109 Due to the way position strings are constructed, we know that iterating
1110 forward from the lexically lower position (e.g. "00") will run into
1111 the lexically higher position (e.g. "1") and not the other way around.
1112 This saves a bit of effort. */
1114 cmp = strcmp (d1->position, d2->position);
1120 /* If the d2->position was lexically lower, swap. */
1122 p1 = d1, d1 = d2, d2 = p1;
1124 if (d1->success.first == 0)
1126 for (p1 = d1->success.first; p1; p1 = p1->next)
1127 if (maybe_both_true (p1, d2, 0))
1133 /* Test the current level. */
1134 cmp = maybe_both_true_1 (d1->tests, d2->tests);
1138 /* We can't prove that D1 and D2 cannot both be true. If we are only
1139 to check the top level, return 1. Otherwise, see if we can prove
1140 that all choices in both successors are mutually exclusive. If
1141 either does not have any successors, we can't prove they can't both
1144 if (toplevel || d1->success.first == 0 || d2->success.first == 0)
1147 for (p1 = d1->success.first; p1; p1 = p1->next)
1148 for (p2 = d2->success.first; p2; p2 = p2->next)
1149 if (maybe_both_true (p1, p2, 0))
1155 /* A subroutine of nodes_identical. Examine two tests for equivalence. */
1158 nodes_identical_1 (d1, d2)
1159 struct decision_test *d1, *d2;
1164 return d1->u.mode == d2->u.mode;
1167 return d1->u.code == d2->u.code;
1170 return (d1->u.pred.mode == d2->u.pred.mode
1171 && strcmp (d1->u.pred.name, d2->u.pred.name) == 0);
1174 return strcmp (d1->u.c_test, d2->u.c_test) == 0;
1177 return d1->u.veclen == d2->u.veclen;
1180 return d1->u.dup == d2->u.dup;
1182 case DT_elt_zero_int:
1183 case DT_elt_one_int:
1184 case DT_elt_zero_wide:
1185 return d1->u.intval == d2->u.intval;
1188 return d1->u.opno == d2->u.opno;
1190 case DT_accept_insn:
1191 /* Differences will be handled in merge_accept_insn. */
1199 /* True iff the two nodes are identical (on one level only). Due
1200 to the way these lists are constructed, we shouldn't have to
1201 consider different orderings on the tests. */
1204 nodes_identical (d1, d2)
1205 struct decision *d1, *d2;
1207 struct decision_test *t1, *t2;
1209 for (t1 = d1->tests, t2 = d2->tests; t1 && t2; t1 = t1->next, t2 = t2->next)
1211 if (t1->type != t2->type)
1213 if (! nodes_identical_1 (t1, t2))
1217 /* For success, they should now both be null. */
1221 /* A subroutine of merge_trees; given two nodes that have been declared
1222 identical, cope with two insn accept states. If they differ in the
1223 number of clobbers, then the conflict was created by make_insn_sequence
1224 and we can drop the with-clobbers version on the floor. If both
1225 nodes have no additional clobbers, we have found an ambiguity in the
1226 source machine description. */
1229 merge_accept_insn (oldd, addd)
1230 struct decision *oldd, *addd;
1232 struct decision_test *old, *add;
1234 for (old = oldd->tests; old; old = old->next)
1235 if (old->type == DT_accept_insn)
1240 for (add = addd->tests; add; add = add->next)
1241 if (add->type == DT_accept_insn)
1246 /* If one node is for a normal insn and the second is for the base
1247 insn with clobbers stripped off, the second node should be ignored. */
1249 if (old->u.insn.num_clobbers_to_add == 0
1250 && add->u.insn.num_clobbers_to_add > 0)
1252 /* Nothing to do here. */
1254 else if (old->u.insn.num_clobbers_to_add > 0
1255 && add->u.insn.num_clobbers_to_add == 0)
1257 /* In this case, replace OLD with ADD. */
1258 old->u.insn = add->u.insn;
1262 message_with_line (add->u.insn.lineno, "`%s' matches `%s'",
1263 get_insn_name (add->u.insn.code_number),
1264 get_insn_name (old->u.insn.code_number));
1265 message_with_line (old->u.insn.lineno, "previous definition of `%s'",
1266 get_insn_name (old->u.insn.code_number));
1271 /* Merge two decision trees OLDH and ADDH, modifying OLDH destructively. */
1274 merge_trees (oldh, addh)
1275 struct decision_head *oldh, *addh;
1277 struct decision *next, *add;
1279 if (addh->first == 0)
1281 if (oldh->first == 0)
1287 /* Trying to merge bits at different positions isn't possible. */
1288 if (strcmp (oldh->first->position, addh->first->position))
1291 for (add = addh->first; add ; add = next)
1293 struct decision *old, *insert_before = NULL;
1297 /* The semantics of pattern matching state that the tests are
1298 done in the order given in the MD file so that if an insn
1299 matches two patterns, the first one will be used. However,
1300 in practice, most, if not all, patterns are unambiguous so
1301 that their order is independent. In that case, we can merge
1302 identical tests and group all similar modes and codes together.
1304 Scan starting from the end of OLDH until we reach a point
1305 where we reach the head of the list or where we pass a
1306 pattern that could also be true if NEW is true. If we find
1307 an identical pattern, we can merge them. Also, record the
1308 last node that tests the same code and mode and the last one
1309 that tests just the same mode.
1311 If we have no match, place NEW after the closest match we found. */
1313 for (old = oldh->last; old; old = old->prev)
1315 if (nodes_identical (old, add))
1317 merge_accept_insn (old, add);
1318 merge_trees (&old->success, &add->success);
1322 if (maybe_both_true (old, add, 0))
1325 /* Insert the nodes in DT test type order, which is roughly
1326 how expensive/important the test is. Given that the tests
1327 are also ordered within the list, examining the first is
1329 if (add->tests->type < old->tests->type)
1330 insert_before = old;
1333 if (insert_before == NULL)
1336 add->prev = oldh->last;
1337 oldh->last->next = add;
1342 if ((add->prev = insert_before->prev) != NULL)
1343 add->prev->next = add;
1346 add->next = insert_before;
1347 insert_before->prev = add;
1354 /* Walk the tree looking for sub-nodes that perform common tests.
1355 Factor out the common test into a new node. This enables us
1356 (depending on the test type) to emit switch statements later. */
1360 struct decision_head *head;
1362 struct decision *first, *next;
1364 for (first = head->first; first && first->next; first = next)
1366 enum decision_type type;
1367 struct decision *new, *old_last;
1369 type = first->tests->type;
1372 /* Want at least two compatible sequential nodes. */
1373 if (next->tests->type != type)
1376 /* Don't want all node types, just those we can turn into
1377 switch statements. */
1380 && type != DT_veclen
1381 && type != DT_elt_zero_int
1382 && type != DT_elt_one_int
1383 && type != DT_elt_zero_wide)
1386 /* If we'd been performing more than one test, create a new node
1387 below our first test. */
1388 if (first->tests->next != NULL)
1390 new = new_decision (first->position, &first->success);
1391 new->tests = first->tests->next;
1392 first->tests->next = NULL;
1395 /* Crop the node tree off after our first test. */
1397 old_last = head->last;
1400 /* For each compatible test, adjust to perform only one test in
1401 the top level node, then merge the node back into the tree. */
1404 struct decision_head h;
1406 if (next->tests->next != NULL)
1408 new = new_decision (next->position, &next->success);
1409 new->tests = next->tests->next;
1410 next->tests->next = NULL;
1415 h.first = h.last = new;
1417 merge_trees (head, &h);
1419 while (next && next->tests->type == type);
1421 /* After we run out of compatible tests, graft the remaining nodes
1422 back onto the tree. */
1425 next->prev = head->last;
1426 head->last->next = next;
1427 head->last = old_last;
1432 for (first = head->first; first; first = first->next)
1433 factor_tests (&first->success);
1436 /* After factoring, try to simplify the tests on any one node.
1437 Tests that are useful for switch statements are recognizable
1438 by having only a single test on a node -- we'll be manipulating
1439 nodes with multiple tests:
1441 If we have mode tests or code tests that are redundant with
1442 predicates, remove them. */
1445 simplify_tests (head)
1446 struct decision_head *head;
1448 struct decision *tree;
1450 for (tree = head->first; tree; tree = tree->next)
1452 struct decision_test *a, *b;
1459 /* Find a predicate node. */
1460 while (b && b->type != DT_pred)
1464 /* Due to how these tests are constructed, we don't even need
1465 to check that the mode and code are compatible -- they were
1466 generated from the predicate in the first place. */
1467 while (a->type == DT_mode || a->type == DT_code)
1474 for (tree = head->first; tree; tree = tree->next)
1475 simplify_tests (&tree->success);
1478 /* Count the number of subnodes of HEAD. If the number is high enough,
1479 make the first node in HEAD start a separate subroutine in the C code
1480 that is generated. */
1483 break_out_subroutines (head, initial)
1484 struct decision_head *head;
1488 struct decision *sub;
1490 for (sub = head->first; sub; sub = sub->next)
1491 size += 1 + break_out_subroutines (&sub->success, 0);
1493 if (size > SUBROUTINE_THRESHOLD && ! initial)
1495 head->first->subroutine_number = ++next_subroutine_number;
1501 /* For each node p, find the next alternative that might be true
1505 find_afterward (head, real_afterward)
1506 struct decision_head *head;
1507 struct decision *real_afterward;
1509 struct decision *p, *q, *afterward;
1511 /* We can't propogate alternatives across subroutine boundaries.
1512 This is not incorrect, merely a minor optimization loss. */
1515 afterward = (p->subroutine_number > 0 ? NULL : real_afterward);
1517 for ( ; p ; p = p->next)
1519 /* Find the next node that might be true if this one fails. */
1520 for (q = p->next; q ; q = q->next)
1521 if (maybe_both_true (p, q, 1))
1524 /* If we reached the end of the list without finding one,
1525 use the incoming afterward position. */
1534 for (p = head->first; p ; p = p->next)
1535 if (p->success.first)
1536 find_afterward (&p->success, p->afterward);
1538 /* When we are generating a subroutine, record the real afterward
1539 position in the first node where write_tree can find it, and we
1540 can do the right thing at the subroutine call site. */
1542 if (p->subroutine_number > 0)
1543 p->afterward = real_afterward;
1546 /* Assuming that the state of argument is denoted by OLDPOS, take whatever
1547 actions are necessary to move to NEWPOS. If we fail to move to the
1548 new state, branch to node AFTERWARD if non-zero, otherwise return.
1550 Failure to move to the new state can only occur if we are trying to
1551 match multiple insns and we try to step past the end of the stream. */
1554 change_state (oldpos, newpos, afterward, indent)
1557 struct decision *afterward;
1560 int odepth = strlen (oldpos);
1561 int ndepth = strlen (newpos);
1563 int old_has_insn, new_has_insn;
1565 /* Pop up as many levels as necessary. */
1566 for (depth = odepth; strncmp (oldpos, newpos, depth) != 0; --depth)
1569 /* Hunt for the last [A-Z] in both strings. */
1570 for (old_has_insn = odepth - 1; old_has_insn >= 0; --old_has_insn)
1571 if (oldpos[old_has_insn] >= 'A' && oldpos[old_has_insn] <= 'Z')
1573 for (new_has_insn = odepth - 1; new_has_insn >= 0; --new_has_insn)
1574 if (newpos[new_has_insn] >= 'A' && newpos[new_has_insn] <= 'Z')
1577 /* Make sure to reset the _last_insn pointer when popping back up. */
1578 if (old_has_insn >= 0 && new_has_insn < 0)
1579 printf ("%s_last_insn = insn;\n", indent);
1581 /* Go down to desired level. */
1582 while (depth < ndepth)
1584 /* It's a different insn from the first one. */
1585 if (newpos[depth] >= 'A' && newpos[depth] <= 'Z')
1587 /* We can only fail if we're moving down the tree. */
1588 if (old_has_insn >= 0 && oldpos[old_has_insn] >= newpos[depth])
1590 printf ("%s_last_insn = recog_next_insn (insn, %d);\n",
1591 indent, newpos[depth] - 'A');
1595 printf ("%stem = recog_next_insn (insn, %d);\n",
1596 indent, newpos[depth] - 'A');
1597 printf ("%sif (tem == NULL_RTX)\n", indent);
1599 printf ("%s goto L%d;\n", indent, afterward->number);
1601 printf ("%s goto ret0;\n", indent);
1602 printf ("%s_last_insn = tem;\n", indent);
1604 printf ("%sx%d = PATTERN (_last_insn);\n", indent, depth + 1);
1606 else if (newpos[depth] >= 'a' && newpos[depth] <= 'z')
1607 printf ("%sx%d = XVECEXP (x%d, 0, %d);\n",
1608 indent, depth + 1, depth, newpos[depth] - 'a');
1610 printf ("%sx%d = XEXP (x%d, %c);\n",
1611 indent, depth + 1, depth, newpos[depth]);
1616 /* Print the enumerator constant for CODE -- the upcase version of
1623 register const char *p;
1624 for (p = GET_RTX_NAME (code); *p; p++)
1625 putchar (TOUPPER (*p));
1628 /* Emit code to cross an afterward link -- change state and branch. */
1631 write_afterward (start, afterward, indent)
1632 struct decision *start;
1633 struct decision *afterward;
1636 if (!afterward || start->subroutine_number > 0)
1637 printf("%sgoto ret0;\n", indent);
1640 change_state (start->position, afterward->position, NULL, indent);
1641 printf ("%sgoto L%d;\n", indent, afterward->number);
1645 /* Emit a switch statement, if possible, for an initial sequence of
1646 nodes at START. Return the first node yet untested. */
1648 static struct decision *
1649 write_switch (start, depth)
1650 struct decision *start;
1653 struct decision *p = start;
1654 enum decision_type type = p->tests->type;
1656 /* If we have two or more nodes in sequence that test the same one
1657 thing, we may be able to use a switch statement. */
1661 || p->next->tests->type != type
1662 || p->next->tests->next)
1665 /* DT_code is special in that we can do interesting things with
1666 known predicates at the same time. */
1667 if (type == DT_code)
1669 char codemap[NUM_RTX_CODE];
1670 struct decision *ret;
1672 memset (codemap, 0, sizeof(codemap));
1674 printf (" switch (GET_CODE (x%d))\n {\n", depth);
1677 RTX_CODE code = p->tests->u.code;
1680 printf (":\n goto L%d;\n", p->success.first->number);
1681 p->success.first->need_label = 1;
1686 while (p && p->tests->type == DT_code && !p->tests->next);
1688 /* If P is testing a predicate that we know about and we haven't
1689 seen any of the codes that are valid for the predicate, we can
1690 write a series of "case" statement, one for each possible code.
1691 Since we are already in a switch, these redundant tests are very
1692 cheap and will reduce the number of predicates called. */
1694 /* Note that while we write out cases for these predicates here,
1695 we don't actually write the test here, as it gets kinda messy.
1696 It is trivial to leave this to later by telling our caller that
1697 we only processed the CODE tests. */
1700 while (p && p->tests->type == DT_pred
1701 && p->tests->u.pred.index >= 0)
1705 for (c = &preds[p->tests->u.pred.index].codes[0]; *c ; ++c)
1706 if (codemap[(int) *c] != 0)
1709 for (c = &preds[p->tests->u.pred.index].codes[0]; *c ; ++c)
1714 codemap[(int) *c] = 1;
1717 printf (" goto L%d;\n", p->number);
1723 /* Make the default case skip the predicates we managed to match. */
1725 printf (" default:\n");
1730 printf (" goto L%d;\n", p->number);
1734 write_afterward (start, start->afterward, " ");
1737 printf (" break;\n");
1742 else if (type == DT_mode
1743 || type == DT_veclen
1744 || type == DT_elt_zero_int
1745 || type == DT_elt_one_int
1746 || type == DT_elt_zero_wide)
1750 printf (" switch (");
1754 str = "GET_MODE (x%d)";
1757 str = "XVECLEN (x%d, 0)";
1759 case DT_elt_zero_int:
1760 str = "XINT (x%d, 0)";
1762 case DT_elt_one_int:
1763 str = "XINT (x%d, 1)";
1765 case DT_elt_zero_wide:
1766 str = "XWINT (x%d, 0)";
1771 printf (str, depth);
1780 printf ("%smode", GET_MODE_NAME (p->tests->u.mode));
1783 printf ("%d", p->tests->u.veclen);
1785 case DT_elt_zero_int:
1786 case DT_elt_one_int:
1787 case DT_elt_zero_wide:
1788 printf (HOST_WIDE_INT_PRINT_DEC, p->tests->u.intval);
1793 printf (":\n goto L%d;\n", p->success.first->number);
1794 p->success.first->need_label = 1;
1798 while (p && p->tests->type == type && !p->tests->next);
1800 printf (" default:\n break;\n }\n");
1806 /* None of the other tests are ameanable. */
1811 /* Emit code for one test. */
1814 write_cond (p, depth, subroutine_type)
1815 struct decision_test *p;
1817 enum routine_type subroutine_type;
1822 printf ("GET_MODE (x%d) == %smode", depth, GET_MODE_NAME (p->u.mode));
1826 printf ("GET_CODE (x%d) == ", depth);
1827 print_code (p->u.code);
1831 printf ("XVECLEN (x%d, 0) == %d", depth, p->u.veclen);
1834 case DT_elt_zero_int:
1835 printf ("XINT (x%d, 0) == %d", depth, (int) p->u.intval);
1838 case DT_elt_one_int:
1839 printf ("XINT (x%d, 1) == %d", depth, (int) p->u.intval);
1842 case DT_elt_zero_wide:
1843 printf ("XWINT (x%d, 0) == ", depth);
1844 printf (HOST_WIDE_INT_PRINT_DEC, p->u.intval);
1848 printf ("rtx_equal_p (x%d, operands[%d])", depth, p->u.dup);
1852 printf ("%s (x%d, %smode)", p->u.pred.name, depth,
1853 GET_MODE_NAME (p->u.pred.mode));
1857 printf ("(%s)", p->u.c_test);
1860 case DT_accept_insn:
1861 switch (subroutine_type)
1864 if (p->u.insn.num_clobbers_to_add == 0)
1866 printf ("pnum_clobbers != NULL");
1879 /* Emit code for one action. The previous tests have succeeded;
1880 TEST is the last of the chain. In the normal case we simply
1881 perform a state change. For the `accept' tests we must do more work. */
1884 write_action (test, depth, uncond, success, subroutine_type)
1885 struct decision_test *test;
1887 struct decision *success;
1888 enum routine_type subroutine_type;
1895 else if (test->type == DT_accept_op || test->type == DT_accept_insn)
1897 fputs (" {\n", stdout);
1904 if (test->type == DT_accept_op)
1906 printf("%soperands[%d] = x%d;\n", indent, test->u.opno, depth);
1908 /* Only allow DT_accept_insn to follow. */
1912 if (test->type != DT_accept_insn)
1917 /* Sanity check that we're now at the end of the list of tests. */
1921 if (test->type == DT_accept_insn)
1923 switch (subroutine_type)
1926 if (test->u.insn.num_clobbers_to_add != 0)
1927 printf ("%s*pnum_clobbers = %d;\n",
1928 indent, test->u.insn.num_clobbers_to_add);
1929 printf ("%sreturn %d;\n", indent, test->u.insn.code_number);
1933 printf ("%sreturn gen_split_%d (operands);\n",
1934 indent, test->u.insn.code_number);
1938 printf ("%stem = gen_peephole2_%d (insn, operands);\n",
1939 indent, test->u.insn.code_number);
1940 printf ("%sif (tem != 0)\n%s goto ret1;\n", indent, indent);
1949 printf("%sgoto L%d;\n", indent, success->number);
1950 success->need_label = 1;
1954 fputs (" }\n", stdout);
1957 /* Return 1 if the test is always true and has no fallthru path. Return -1
1958 if the test does have a fallthru path, but requires that the condition be
1959 terminated. Otherwise return 0 for a normal test. */
1960 /* ??? is_unconditional is a stupid name for a tri-state function. */
1963 is_unconditional (t, subroutine_type)
1964 struct decision_test *t;
1965 enum routine_type subroutine_type;
1967 if (t->type == DT_accept_op)
1970 if (t->type == DT_accept_insn)
1972 switch (subroutine_type)
1975 return (t->u.insn.num_clobbers_to_add == 0);
1988 /* Emit code for one node -- the conditional and the accompanying action.
1989 Return true if there is no fallthru path. */
1992 write_node (p, depth, subroutine_type)
1995 enum routine_type subroutine_type;
1997 struct decision_test *test, *last_test;
2000 last_test = test = p->tests;
2001 uncond = is_unconditional (test, subroutine_type);
2005 write_cond (test, depth, subroutine_type);
2007 while ((test = test->next) != NULL)
2012 uncond2 = is_unconditional (test, subroutine_type);
2017 write_cond (test, depth, subroutine_type);
2023 write_action (last_test, depth, uncond, p->success.first, subroutine_type);
2028 /* Emit code for all of the sibling nodes of HEAD. */
2031 write_tree_1 (head, depth, subroutine_type)
2032 struct decision_head *head;
2034 enum routine_type subroutine_type;
2036 struct decision *p, *next;
2039 for (p = head->first; p ; p = next)
2041 /* The label for the first element was printed in write_tree. */
2042 if (p != head->first && p->need_label)
2043 OUTPUT_LABEL (" ", p->number);
2045 /* Attempt to write a switch statement for a whole sequence. */
2046 next = write_switch (p, depth);
2051 /* Failed -- fall back and write one node. */
2052 uncond = write_node (p, depth, subroutine_type);
2057 /* Finished with this chain. Close a fallthru path by branching
2058 to the afterward node. */
2060 write_afterward (head->last, head->last->afterward, " ");
2063 /* Write out the decision tree starting at HEAD. PREVPOS is the
2064 position at the node that branched to this node. */
2067 write_tree (head, prevpos, type, initial)
2068 struct decision_head *head;
2069 const char *prevpos;
2070 enum routine_type type;
2073 register struct decision *p = head->first;
2077 OUTPUT_LABEL (" ", p->number);
2079 if (! initial && p->subroutine_number > 0)
2081 static const char * const name_prefix[] = {
2082 "recog", "split", "peephole2"
2085 static const char * const call_suffix[] = {
2086 ", pnum_clobbers", "", ", _plast_insn"
2089 /* This node has been broken out into a separate subroutine.
2090 Call it, test the result, and branch accordingly. */
2094 printf (" tem = %s_%d (x0, insn%s);\n",
2095 name_prefix[type], p->subroutine_number, call_suffix[type]);
2096 if (IS_SPLIT (type))
2097 printf (" if (tem != 0)\n return tem;\n");
2099 printf (" if (tem >= 0)\n return tem;\n");
2101 change_state (p->position, p->afterward->position, NULL, " ");
2102 printf (" goto L%d;\n", p->afterward->number);
2106 printf (" return %s_%d (x0, insn%s);\n",
2107 name_prefix[type], p->subroutine_number, call_suffix[type]);
2112 int depth = strlen (p->position);
2114 change_state (prevpos, p->position, head->last->afterward, " ");
2115 write_tree_1 (head, depth, type);
2117 for (p = head->first; p; p = p->next)
2118 if (p->success.first)
2119 write_tree (&p->success, p->position, type, 0);
2123 /* Write out a subroutine of type TYPE to do comparisons starting at
2127 write_subroutine (head, type)
2128 struct decision_head *head;
2129 enum routine_type type;
2131 static const char * const proto_pattern[] = {
2132 "%sint recog%s PROTO ((rtx, rtx, int *));\n",
2133 "%srtx split%s PROTO ((rtx, rtx));\n",
2134 "%srtx peephole2%s PROTO ((rtx, rtx, rtx *));\n"
2137 static const char * const decl_pattern[] = {
2139 recog%s (x0, insn, pnum_clobbers)\n\
2141 rtx insn ATTRIBUTE_UNUSED;\n\
2142 int *pnum_clobbers ATTRIBUTE_UNUSED;\n",
2145 split%s (x0, insn)\n\
2147 rtx insn ATTRIBUTE_UNUSED;\n",
2150 peephole2%s (x0, insn, _plast_insn)\n\
2152 rtx insn ATTRIBUTE_UNUSED;\n\
2153 rtx *_plast_insn ATTRIBUTE_UNUSED;\n"
2156 int subfunction = head->first ? head->first->subroutine_number : 0;
2161 s_or_e = subfunction ? "static " : "";
2164 sprintf (extension, "_%d", subfunction);
2165 else if (type == RECOG)
2166 extension[0] = '\0';
2168 strcpy (extension, "_insns");
2170 printf (proto_pattern[type], s_or_e, extension);
2171 printf (decl_pattern[type], s_or_e, extension);
2173 printf ("{\n register rtx * const operands = &recog_data.operand[0];\n");
2174 for (i = 1; i <= max_depth; i++)
2175 printf (" register rtx x%d ATTRIBUTE_UNUSED;\n", i);
2177 if (type == PEEPHOLE2)
2178 printf (" register rtx _last_insn = insn;\n");
2179 printf (" %s tem ATTRIBUTE_UNUSED;\n", IS_SPLIT (type) ? "rtx" : "int");
2182 write_tree (head, "", type, 1);
2184 printf (" goto ret0;\n");
2186 if (type == PEEPHOLE2)
2187 printf (" ret1:\n *_plast_insn = _last_insn;\n return tem;\n");
2188 printf (" ret0:\n return %d;\n}\n\n", IS_SPLIT (type) ? 0 : -1);
2191 /* In break_out_subroutines, we discovered the boundaries for the
2192 subroutines, but did not write them out. Do so now. */
2195 write_subroutines (head, type)
2196 struct decision_head *head;
2197 enum routine_type type;
2201 for (p = head->first; p ; p = p->next)
2202 if (p->success.first)
2203 write_subroutines (&p->success, type);
2205 if (head->first->subroutine_number > 0)
2206 write_subroutine (head, type);
2209 /* Begin the output file. */
2215 /* Generated automatically by the program `genrecog' from the target\n\
2216 machine description file. */\n\
2218 #include \"config.h\"\n\
2219 #include \"system.h\"\n\
2220 #include \"rtl.h\"\n\
2221 #include \"tm_p.h\"\n\
2222 #include \"function.h\"\n\
2223 #include \"insn-config.h\"\n\
2224 #include \"recog.h\"\n\
2225 #include \"real.h\"\n\
2226 #include \"output.h\"\n\
2227 #include \"flags.h\"\n\
2228 #include \"hard-reg-set.h\"\n\
2229 #include \"resource.h\"\n\
2233 /* `recog' contains a decision tree that recognizes whether the rtx\n\
2234 X0 is a valid instruction.\n\
2236 recog returns -1 if the rtx is not valid. If the rtx is valid, recog\n\
2237 returns a nonnegative number which is the insn code number for the\n\
2238 pattern that matched. This is the same as the order in the machine\n\
2239 description of the entry that matched. This number can be used as an\n\
2240 index into `insn_data' and other tables.\n\
2242 The third argument to recog is an optional pointer to an int. If\n\
2243 present, recog will accept a pattern if it matches except for missing\n\
2244 CLOBBER expressions at the end. In that case, the value pointed to by\n\
2245 the optional pointer will be set to the number of CLOBBERs that need\n\
2246 to be added (it should be initialized to zero by the caller). If it\n\
2247 is set nonzero, the caller should allocate a PARALLEL of the\n\
2248 appropriate size, copy the initial entries, and call add_clobbers\n\
2249 (found in insn-emit.c) to fill in the CLOBBERs.\n\
2253 The function split_insns returns 0 if the rtl could not\n\
2254 be split or the split rtl in a SEQUENCE if it can be.\n\
2256 The function peephole2_insns returns 0 if the rtl could not\n\
2257 be matched. If there was a match, the new rtl is returned in a SEQUENCE,\n\
2258 and LAST_INSN will point to the last recognized insn in the old sequence.\n\
2263 /* Construct and return a sequence of decisions
2264 that will recognize INSN.
2266 TYPE says what type of routine we are recognizing (RECOG or SPLIT). */
2268 static struct decision_head
2269 make_insn_sequence (insn, type)
2271 enum routine_type type;
2274 const char *c_test = XSTR (insn, type == RECOG ? 2 : 1);
2275 struct decision *last;
2276 struct decision_test *test, **place;
2277 struct decision_head head;
2279 record_insn_name (next_insn_code, (type == RECOG ? XSTR (insn, 0) : NULL));
2281 if (type == PEEPHOLE2)
2285 /* peephole2 gets special treatment:
2286 - X always gets an outer parallel even if it's only one entry
2287 - we remove all traces of outer-level match_scratch and match_dup
2288 expressions here. */
2289 x = rtx_alloc (PARALLEL);
2290 PUT_MODE (x, VOIDmode);
2291 XVEC (x, 0) = rtvec_alloc (XVECLEN (insn, 0));
2292 for (i = j = 0; i < XVECLEN (insn, 0); i++)
2294 rtx tmp = XVECEXP (insn, 0, i);
2295 if (GET_CODE (tmp) != MATCH_SCRATCH && GET_CODE (tmp) != MATCH_DUP)
2297 XVECEXP (x, 0, j) = tmp;
2303 else if (XVECLEN (insn, type == RECOG) == 1)
2304 x = XVECEXP (insn, type == RECOG, 0);
2307 x = rtx_alloc (PARALLEL);
2308 XVEC (x, 0) = XVEC (insn, type == RECOG);
2309 PUT_MODE (x, VOIDmode);
2312 validate_pattern (x, insn, 0);
2314 memset(&head, 0, sizeof(head));
2315 last = add_to_sequence (x, &head, "", type, 1);
2317 /* Find the end of the test chain on the last node. */
2318 for (test = last->tests; test->next; test = test->next)
2320 place = &test->next;
2324 /* Need a new node if we have another test to add. */
2325 if (test->type == DT_accept_op)
2327 last = new_decision ("", &last->success);
2328 place = &last->tests;
2330 test = new_decision_test (DT_c_test, &place);
2331 test->u.c_test = c_test;
2334 test = new_decision_test (DT_accept_insn, &place);
2335 test->u.insn.code_number = next_insn_code;
2336 test->u.insn.lineno = pattern_lineno;
2337 test->u.insn.num_clobbers_to_add = 0;
2342 /* If this is an DEFINE_INSN and X is a PARALLEL, see if it ends
2343 with a group of CLOBBERs of (hard) registers or MATCH_SCRATCHes.
2344 If so, set up to recognize the pattern without these CLOBBERs. */
2346 if (GET_CODE (x) == PARALLEL)
2350 /* Find the last non-clobber in the parallel. */
2351 for (i = XVECLEN (x, 0); i > 0; i--)
2353 rtx y = XVECEXP (x, 0, i - 1);
2354 if (GET_CODE (y) != CLOBBER
2355 || (GET_CODE (XEXP (y, 0)) != REG
2356 && GET_CODE (XEXP (y, 0)) != MATCH_SCRATCH))
2360 if (i != XVECLEN (x, 0))
2363 struct decision_head clobber_head;
2365 /* Build a similar insn without the clobbers. */
2367 new = XVECEXP (x, 0, 0);
2372 new = rtx_alloc (PARALLEL);
2373 XVEC (new, 0) = rtvec_alloc (i);
2374 for (j = i - 1; j >= 0; j--)
2375 XVECEXP (new, 0, j) = XVECEXP (x, 0, j);
2379 memset (&clobber_head, 0, sizeof(clobber_head));
2380 last = add_to_sequence (new, &clobber_head, "", type, 1);
2382 /* Find the end of the test chain on the last node. */
2383 for (test = last->tests; test->next; test = test->next)
2386 /* We definitely have a new test to add -- create a new
2388 place = &test->next;
2389 if (test->type == DT_accept_op)
2391 last = new_decision ("", &last->success);
2392 place = &last->tests;
2397 test = new_decision_test (DT_c_test, &place);
2398 test->u.c_test = c_test;
2401 test = new_decision_test (DT_accept_insn, &place);
2402 test->u.insn.code_number = next_insn_code;
2403 test->u.insn.lineno = pattern_lineno;
2404 test->u.insn.num_clobbers_to_add = XVECLEN (x, 0) - i;
2406 merge_trees (&head, &clobber_head);
2412 /* Define the subroutine we will call below and emit in genemit. */
2413 printf ("extern rtx gen_split_%d PROTO ((rtx *));\n", next_insn_code);
2417 /* Define the subroutine we will call below and emit in genemit. */
2418 printf ("extern rtx gen_peephole2_%d PROTO ((rtx, rtx *));\n",
2428 process_tree (head, subroutine_type)
2429 struct decision_head *head;
2430 enum routine_type subroutine_type;
2432 if (head->first == NULL)
2434 /* We can elide peephole2_insns, but not recog or split_insns. */
2435 if (subroutine_type == PEEPHOLE2)
2440 factor_tests (head);
2442 next_subroutine_number = 0;
2443 break_out_subroutines (head, 1);
2444 find_afterward (head, NULL);
2446 /* We run this after find_afterward, because find_afterward needs
2447 the redundant DT_mode tests on predicates to determine whether
2448 two tests can both be true or not. */
2449 simplify_tests(head);
2451 write_subroutines (head, subroutine_type);
2454 write_subroutine (head, subroutine_type);
2463 struct decision_head recog_tree, split_tree, peephole2_tree, h;
2467 progname = "genrecog";
2468 obstack_init (rtl_obstack);
2470 memset (&recog_tree, 0, sizeof recog_tree);
2471 memset (&split_tree, 0, sizeof split_tree);
2472 memset (&peephole2_tree, 0, sizeof peephole2_tree);
2475 fatal ("No input file name.");
2477 infile = fopen (argv[1], "r");
2481 return FATAL_EXIT_CODE;
2483 read_rtx_filename = argv[1];
2490 /* Read the machine description. */
2494 c = read_skip_spaces (infile);
2498 pattern_lineno = read_rtx_lineno;
2500 desc = read_rtx (infile);
2501 if (GET_CODE (desc) == DEFINE_INSN)
2503 h = make_insn_sequence (desc, RECOG);
2504 merge_trees (&recog_tree, &h);
2506 else if (GET_CODE (desc) == DEFINE_SPLIT)
2508 h = make_insn_sequence (desc, SPLIT);
2509 merge_trees (&split_tree, &h);
2511 else if (GET_CODE (desc) == DEFINE_PEEPHOLE2)
2513 h = make_insn_sequence (desc, PEEPHOLE2);
2514 merge_trees (&peephole2_tree, &h);
2517 if (GET_CODE (desc) == DEFINE_PEEPHOLE
2518 || GET_CODE (desc) == DEFINE_EXPAND)
2524 return FATAL_EXIT_CODE;
2528 process_tree (&recog_tree, RECOG);
2529 process_tree (&split_tree, SPLIT);
2530 process_tree (&peephole2_tree, PEEPHOLE2);
2533 return (ferror (stdout) != 0 ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE);
2536 /* Define this so we can link with print-rtl.o to get debug_rtx function. */
2538 get_insn_name (code)
2541 if (code < insn_name_ptr_size)
2542 return insn_name_ptr[code];
2548 record_insn_name (code, name)
2552 static const char *last_real_name = "insn";
2553 static int last_real_code = 0;
2556 if (insn_name_ptr_size <= code)
2559 new_size = (insn_name_ptr_size ? insn_name_ptr_size * 2 : 512);
2561 (char **) xrealloc (insn_name_ptr, sizeof(char *) * new_size);
2562 memset (insn_name_ptr + insn_name_ptr_size, 0,
2563 sizeof(char *) * (new_size - insn_name_ptr_size));
2564 insn_name_ptr_size = new_size;
2567 if (!name || name[0] == '\0')
2569 new = xmalloc (strlen (last_real_name) + 10);
2570 sprintf (new, "%s+%d", last_real_name, code - last_real_code);
2574 last_real_name = new = xstrdup (name);
2575 last_real_code = code;
2578 insn_name_ptr[code] = new;
2585 register size_t len = strlen (input) + 1;
2586 register char *output = xmalloc (len);
2587 memcpy (output, input, len);
2592 xrealloc (old, size)
2598 ptr = (PTR) realloc (old, size);
2600 ptr = (PTR) malloc (size);
2602 fatal ("virtual memory exhausted");
2610 register PTR val = (PTR) malloc (size);
2613 fatal ("virtual memory exhausted");
2618 debug_decision_2 (test)
2619 struct decision_test *test;
2624 fprintf (stderr, "mode=%s", GET_MODE_NAME (test->u.mode));
2627 fprintf (stderr, "code=%s", GET_RTX_NAME (test->u.code));
2630 fprintf (stderr, "veclen=%d", test->u.veclen);
2632 case DT_elt_zero_int:
2633 fprintf (stderr, "elt0_i=%d", (int) test->u.intval);
2635 case DT_elt_one_int:
2636 fprintf (stderr, "elt1_i=%d", (int) test->u.intval);
2638 case DT_elt_zero_wide:
2639 fprintf (stderr, "elt0_w=");
2640 fprintf (stderr, HOST_WIDE_INT_PRINT_DEC, test->u.intval);
2643 fprintf (stderr, "dup=%d", test->u.dup);
2646 fprintf (stderr, "pred=(%s,%s)",
2647 test->u.pred.name, GET_MODE_NAME(test->u.pred.mode));
2652 strncpy (sub, test->u.c_test, sizeof(sub));
2653 memcpy (sub+16, "...", 4);
2654 fprintf (stderr, "c_test=\"%s\"", sub);
2658 fprintf (stderr, "A_op=%d", test->u.opno);
2660 case DT_accept_insn:
2661 fprintf (stderr, "A_insn=(%d,%d)",
2662 test->u.insn.code_number, test->u.insn.num_clobbers_to_add);
2671 debug_decision_1 (d, indent)
2676 struct decision_test *test;
2680 for (i = 0; i < indent; ++i)
2682 fputs ("(nil)\n", stderr);
2686 for (i = 0; i < indent; ++i)
2693 debug_decision_2 (test);
2694 while ((test = test->next) != NULL)
2696 fputs (" + ", stderr);
2697 debug_decision_2 (test);
2700 fprintf (stderr, "} %d n %d a %d\n", d->number,
2701 (d->next ? d->next->number : -1),
2702 (d->afterward ? d->afterward->number : -1));
2706 debug_decision_0 (d, indent, maxdepth)
2708 int indent, maxdepth;
2717 for (i = 0; i < indent; ++i)
2719 fputs ("(nil)\n", stderr);
2723 debug_decision_1 (d, indent);
2724 for (n = d->success.first; n ; n = n->next)
2725 debug_decision_0 (n, indent + 2, maxdepth - 1);
2732 debug_decision_0 (d, 0, 1000000);
2736 debug_decision_list (d)
2741 debug_decision_0 (d, 0, 0);