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 {"pmode_register_operand", {SUBREG, REG}},
201 {"scratch_operand", {SCRATCH, REG}},
202 {"immediate_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
204 {"const_int_operand", {CONST_INT}},
205 {"const_double_operand", {CONST_INT, CONST_DOUBLE}},
206 {"nonimmediate_operand", {SUBREG, REG, MEM}},
207 {"nonmemory_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
208 LABEL_REF, SUBREG, REG}},
209 {"push_operand", {MEM}},
210 {"pop_operand", {MEM}},
211 {"memory_operand", {SUBREG, MEM}},
212 {"indirect_operand", {SUBREG, MEM}},
213 {"comparison_operator", {EQ, NE, LE, LT, GE, GT, LEU, LTU, GEU, GTU}},
214 {"mode_independent_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
215 LABEL_REF, SUBREG, REG, MEM}}
218 #define NUM_KNOWN_PREDS (sizeof preds / sizeof preds[0])
220 static const char * special_mode_pred_table[] = {
221 #ifdef SPECIAL_MODE_PREDICATES
222 SPECIAL_MODE_PREDICATES
224 "pmode_register_operand"
227 #define NUM_SPECIAL_MODE_PREDS \
228 (sizeof (special_mode_pred_table) / sizeof (special_mode_pred_table[0]))
230 static void message_with_line
231 PVPROTO ((int, const char *, ...)) ATTRIBUTE_PRINTF_2;
233 static struct decision *new_decision
234 PROTO((const char *, struct decision_head *));
235 static struct decision_test *new_decision_test
236 PROTO((enum decision_type, struct decision_test ***));
237 static rtx find_operand
239 static void validate_pattern
240 PROTO((rtx, rtx, rtx));
241 static struct decision *add_to_sequence
242 PROTO((rtx, struct decision_head *, const char *, enum routine_type, int));
244 static int maybe_both_true_2
245 PROTO((struct decision_test *, struct decision_test *));
246 static int maybe_both_true_1
247 PROTO((struct decision_test *, struct decision_test *));
248 static int maybe_both_true
249 PROTO((struct decision *, struct decision *, int));
251 static int nodes_identical_1
252 PROTO((struct decision_test *, struct decision_test *));
253 static int nodes_identical
254 PROTO((struct decision *, struct decision *));
255 static void merge_accept_insn
256 PROTO((struct decision *, struct decision *));
257 static void merge_trees
258 PROTO((struct decision_head *, struct decision_head *));
260 static void factor_tests
261 PROTO((struct decision_head *));
262 static void simplify_tests
263 PROTO((struct decision_head *));
264 static int break_out_subroutines
265 PROTO((struct decision_head *, int));
266 static void find_afterward
267 PROTO((struct decision_head *, struct decision *));
269 static void change_state
270 PROTO((const char *, const char *, struct decision *, const char *));
271 static void print_code
272 PROTO((enum rtx_code));
273 static void write_afterward
274 PROTO((struct decision *, struct decision *, const char *));
275 static struct decision *write_switch
276 PROTO((struct decision *, int));
277 static void write_cond
278 PROTO((struct decision_test *, int, enum routine_type));
279 static void write_action
280 PROTO((struct decision_test *, int, int, struct decision *,
282 static int is_unconditional
283 PROTO((struct decision_test *, enum routine_type));
284 static int write_node
285 PROTO((struct decision *, int, enum routine_type));
286 static void write_tree_1
287 PROTO((struct decision_head *, int, enum routine_type));
288 static void write_tree
289 PROTO((struct decision_head *, const char *, enum routine_type, int));
290 static void write_subroutine
291 PROTO((struct decision_head *, enum routine_type));
292 static void write_subroutines
293 PROTO((struct decision_head *, enum routine_type));
294 static void write_header
297 static struct decision_head make_insn_sequence
298 PROTO((rtx, enum routine_type));
299 static void process_tree
300 PROTO((struct decision_head *, enum routine_type));
302 static void record_insn_name
303 PROTO((int, const char *));
305 static void debug_decision_1
306 PROTO((struct decision *, int));
307 static void debug_decision_2
308 PROTO((struct decision_test *));
309 extern void debug_decision
310 PROTO((struct decision *));
313 message_with_line VPROTO ((int lineno, const char *msg, ...))
315 #ifndef ANSI_PROTOTYPES
323 #ifndef ANSI_PROTOTYPES
324 lineno = va_arg (ap, int);
325 msg = va_arg (ap, const char *);
328 fprintf (stderr, "%s:%d: ", read_rtx_filename, lineno);
329 vfprintf (stderr, msg, ap);
330 fputc ('\n', stderr);
335 /* Create a new node in sequence after LAST. */
337 static struct decision *
338 new_decision (position, last)
339 const char *position;
340 struct decision_head *last;
342 register struct decision *new
343 = (struct decision *) xmalloc (sizeof (struct decision));
345 memset (new, 0, sizeof (*new));
346 new->success = *last;
347 new->position = xstrdup (position);
348 new->number = next_number++;
350 last->first = last->last = new;
354 /* Create a new test and link it in at PLACE. */
356 static struct decision_test *
357 new_decision_test (type, pplace)
358 enum decision_type type;
359 struct decision_test ***pplace;
361 struct decision_test **place = *pplace;
362 struct decision_test *test;
364 test = (struct decision_test *) xmalloc (sizeof (*test));
375 /* Search for and return operand N. */
378 find_operand (pattern, n)
387 code = GET_CODE (pattern);
388 if ((code == MATCH_SCRATCH
389 || code == MATCH_INSN
390 || code == MATCH_OPERAND
391 || code == MATCH_OPERATOR
392 || code == MATCH_PARALLEL)
393 && XINT (pattern, 0) == n)
396 fmt = GET_RTX_FORMAT (code);
397 len = GET_RTX_LENGTH (code);
398 for (i = 0; i < len; i++)
403 if ((r = find_operand (XEXP (pattern, i), n)) != NULL_RTX)
408 for (j = 0; j < XVECLEN (pattern, i); j++)
409 if ((r = find_operand (XVECEXP (pattern, i, j), n)) != NULL_RTX)
413 case 'i': case 'w': case '0': case 's':
424 /* Check for various errors in patterns. SET is nonnull for a destination,
425 and is the complete set pattern. */
428 validate_pattern (pattern, insn, set)
438 code = GET_CODE (pattern);
448 const char *pred_name = XSTR (pattern, 1);
449 int allows_non_lvalue = 1, allows_non_const = 1;
450 int special_mode_pred = 0;
453 if (GET_CODE (insn) == DEFINE_INSN)
454 c_test = XSTR (insn, 2);
456 c_test = XSTR (insn, 1);
458 if (pred_name[0] != 0)
460 for (i = 0; i < NUM_KNOWN_PREDS; i++)
461 if (! strcmp (preds[i].name, pred_name))
464 if (i < NUM_KNOWN_PREDS)
468 allows_non_lvalue = allows_non_const = 0;
469 for (j = 0; preds[i].codes[j] != 0; j++)
471 RTX_CODE c = preds[i].codes[j];
478 && c != CONSTANT_P_RTX)
479 allows_non_const = 1;
486 && c != STRICT_LOW_PART)
487 allows_non_lvalue = 1;
492 #ifdef PREDICATE_CODES
493 /* If the port has a list of the predicates it uses but
495 message_with_line (pattern_lineno,
496 "warning: `%s' not in PREDICATE_CODES",
501 for (i = 0; i < NUM_SPECIAL_MODE_PREDS; ++i)
502 if (strcmp (pred_name, special_mode_pred_table[i]) == 0)
504 special_mode_pred = 1;
509 /* A MATCH_OPERAND that is a SET should have an output reload. */
511 && code == MATCH_OPERAND
512 && XSTR (pattern, 2)[0] != '\0'
513 && XSTR (pattern, 2)[0] != '='
514 && XSTR (pattern, 2)[0] != '+')
516 message_with_line (pattern_lineno,
517 "operand %d missing output reload",
522 /* Allowing non-lvalues in destinations -- particularly CONST_INT --
523 while not likely to occur at runtime, results in less efficient
524 code from insn-recog.c. */
526 && pred_name[0] != '\0'
527 && allows_non_lvalue)
529 message_with_line (pattern_lineno,
530 "warning: destination operand %d allows non-lvalue",
534 /* A modeless MATCH_OPERAND can be handy when we can
535 check for multiple modes in the c_test. In most other cases,
536 it is a mistake. Only DEFINE_INSN is eligible, since SPLIT
537 and PEEP2 can FAIL within the output pattern. Exclude
538 address_operand, since its mode is related to the mode of
539 the memory not the operand. Exclude the SET_DEST of a call
540 instruction, as that is a common idiom. */
542 if (GET_MODE (pattern) == VOIDmode
543 && code == MATCH_OPERAND
544 && GET_CODE (insn) == DEFINE_INSN
546 && ! special_mode_pred
547 && pred_name[0] != '\0'
548 && strcmp (pred_name, "address_operand") != 0
549 && strstr (c_test, "operands") == NULL
551 && GET_CODE (set) == SET
552 && GET_CODE (SET_SRC (set)) == CALL))
554 message_with_line (pattern_lineno,
555 "warning: operand %d missing mode?",
563 enum machine_mode dmode, smode;
566 dest = SET_DEST (pattern);
567 src = SET_SRC (pattern);
569 /* Find the referant for a DUP. */
571 if (GET_CODE (dest) == MATCH_DUP
572 || GET_CODE (dest) == MATCH_OP_DUP
573 || GET_CODE (dest) == MATCH_PAR_DUP)
574 dest = find_operand (insn, XINT (dest, 0));
576 if (GET_CODE (src) == MATCH_DUP
577 || GET_CODE (src) == MATCH_OP_DUP
578 || GET_CODE (src) == MATCH_PAR_DUP)
579 src = find_operand (insn, XINT (src, 0));
581 /* STRICT_LOW_PART is a wrapper. Its argument is the real
582 destination, and it's mode should match the source. */
583 if (GET_CODE (dest) == STRICT_LOW_PART)
584 dest = XEXP (dest, 0);
586 dmode = GET_MODE (dest);
587 smode = GET_MODE (src);
589 /* The mode of an ADDRESS_OPERAND is the mode of the memory
590 reference, not the mode of the address. */
591 if (GET_CODE (src) == MATCH_OPERAND
592 && ! strcmp (XSTR (src, 1), "address_operand"))
595 /* The operands of a SET must have the same mode unless one
597 else if (dmode != VOIDmode && smode != VOIDmode && dmode != smode)
599 message_with_line (pattern_lineno,
600 "mode mismatch in set: %smode vs %smode",
601 GET_MODE_NAME (dmode), GET_MODE_NAME (smode));
605 /* If only one of the operands is VOIDmode, and PC or CC0 is
606 not involved, it's probably a mistake. */
607 else if (dmode != smode
608 && GET_CODE (dest) != PC
609 && GET_CODE (dest) != CC0
610 && GET_CODE (src) != PC
611 && GET_CODE (src) != CC0
612 && GET_CODE (src) != CONST_INT)
615 which = (dmode == VOIDmode ? "destination" : "source");
616 message_with_line (pattern_lineno,
617 "warning: %s missing a mode?", which);
620 if (dest != SET_DEST (pattern))
621 validate_pattern (dest, insn, pattern);
622 validate_pattern (SET_DEST (pattern), insn, pattern);
623 validate_pattern (SET_SRC (pattern), insn, NULL_RTX);
628 validate_pattern (SET_DEST (pattern), insn, pattern);
632 if (GET_MODE (XEXP (pattern, 0)) != VOIDmode)
634 message_with_line (pattern_lineno,
635 "operand to label_ref %smode not VOIDmode",
636 GET_MODE_NAME (GET_MODE (XEXP (pattern, 0))));
645 fmt = GET_RTX_FORMAT (code);
646 len = GET_RTX_LENGTH (code);
647 for (i = 0; i < len; i++)
652 validate_pattern (XEXP (pattern, i), insn, NULL_RTX);
656 for (j = 0; j < XVECLEN (pattern, i); j++)
657 validate_pattern (XVECEXP (pattern, i, j), insn, NULL_RTX);
660 case 'i': case 'w': case '0': case 's':
669 /* Create a chain of nodes to verify that an rtl expression matches
672 LAST is a pointer to the listhead in the previous node in the chain (or
673 in the calling function, for the first node).
675 POSITION is the string representing the current position in the insn.
677 INSN_TYPE is the type of insn for which we are emitting code.
679 A pointer to the final node in the chain is returned. */
681 static struct decision *
682 add_to_sequence (pattern, last, position, insn_type, top)
684 struct decision_head *last;
685 const char *position;
686 enum routine_type insn_type;
690 struct decision *this, *sub;
691 struct decision_test *test;
692 struct decision_test **place;
695 register const char *fmt;
696 int depth = strlen (position);
698 enum machine_mode mode;
700 if (depth > max_depth)
703 subpos = (char *) alloca (depth + 2);
704 strcpy (subpos, position);
705 subpos[depth + 1] = 0;
707 sub = this = new_decision (position, last);
708 place = &this->tests;
711 mode = GET_MODE (pattern);
712 code = GET_CODE (pattern);
717 /* Toplevel peephole pattern. */
718 if (insn_type == PEEPHOLE2 && top)
720 /* We don't need the node we just created -- unlink it. */
721 last->first = last->last = NULL;
723 for (i = 0; i < (size_t) XVECLEN (pattern, 0); i++)
725 /* Which insn we're looking at is represented by A-Z. We don't
726 ever use 'A', however; it is always implied. */
728 subpos[depth] = (i > 0 ? 'A' + i : 0);
729 sub = add_to_sequence (XVECEXP (pattern, 0, i),
730 last, subpos, insn_type, 0);
731 last = &sub->success;
736 /* Else nothing special. */
745 const char *pred_name;
746 RTX_CODE was_code = code;
747 int allows_const_int = 1;
749 if (code == MATCH_SCRATCH)
751 pred_name = "scratch_operand";
756 pred_name = XSTR (pattern, 1);
757 if (code == MATCH_PARALLEL)
763 /* We know exactly what const_int_operand matches -- any CONST_INT. */
764 if (strcmp ("const_int_operand", pred_name) == 0)
769 else if (pred_name[0] != 0)
771 test = new_decision_test (DT_pred, &place);
772 test->u.pred.name = pred_name;
773 test->u.pred.mode = mode;
775 /* See if we know about this predicate and save its number. If
776 we do, and it only accepts one code, note that fact. The
777 predicate `const_int_operand' only tests for a CONST_INT, so
778 if we do so we can avoid calling it at all.
780 Finally, if we know that the predicate does not allow
781 CONST_INT, we know that the only way the predicate can match
782 is if the modes match (here we use the kludge of relying on
783 the fact that "address_operand" accepts CONST_INT; otherwise,
784 it would have to be a special case), so we can test the mode
785 (but we need not). This fact should considerably simplify the
788 for (i = 0; i < NUM_KNOWN_PREDS; i++)
789 if (! strcmp (preds[i].name, pred_name))
792 if (i < NUM_KNOWN_PREDS)
796 test->u.pred.index = i;
798 if (preds[i].codes[1] == 0 && code == UNKNOWN)
799 code = preds[i].codes[0];
801 allows_const_int = 0;
802 for (j = 0; preds[i].codes[j] != 0; j++)
803 if (preds[i].codes[j] == CONST_INT)
805 allows_const_int = 1;
810 test->u.pred.index = -1;
813 /* Can't enforce a mode if we allow const_int. */
814 if (allows_const_int)
817 /* Accept the operand, ie. record it in `operands'. */
818 test = new_decision_test (DT_accept_op, &place);
819 test->u.opno = XINT (pattern, 0);
821 if (was_code == MATCH_OPERATOR || was_code == MATCH_PARALLEL)
823 char base = (was_code == MATCH_OPERATOR ? '0' : 'a');
824 for (i = 0; i < (size_t) XVECLEN (pattern, 2); i++)
826 subpos[depth] = i + base;
827 sub = add_to_sequence (XVECEXP (pattern, 2, i),
828 &sub->success, subpos, insn_type, 0);
837 test = new_decision_test (DT_dup, &place);
838 test->u.dup = XINT (pattern, 0);
840 test = new_decision_test (DT_accept_op, &place);
841 test->u.opno = XINT (pattern, 0);
843 for (i = 0; i < (size_t) XVECLEN (pattern, 1); i++)
845 subpos[depth] = i + '0';
846 sub = add_to_sequence (XVECEXP (pattern, 1, i),
847 &sub->success, subpos, insn_type, 0);
855 test = new_decision_test (DT_dup, &place);
856 test->u.dup = XINT (pattern, 0);
860 pattern = XEXP (pattern, 0);
867 fmt = GET_RTX_FORMAT (code);
868 len = GET_RTX_LENGTH (code);
870 /* Do tests against the current node first. */
871 for (i = 0; i < (size_t) len; i++)
877 test = new_decision_test (DT_elt_zero_int, &place);
878 test->u.intval = XINT (pattern, i);
882 test = new_decision_test (DT_elt_one_int, &place);
883 test->u.intval = XINT (pattern, i);
888 else if (fmt[i] == 'w')
893 test = new_decision_test (DT_elt_zero_wide, &place);
894 test->u.intval = XWINT (pattern, i);
896 else if (fmt[i] == 'E')
901 test = new_decision_test (DT_veclen, &place);
902 test->u.veclen = XVECLEN (pattern, i);
906 /* Now test our sub-patterns. */
907 for (i = 0; i < (size_t) len; i++)
912 subpos[depth] = '0' + i;
913 sub = add_to_sequence (XEXP (pattern, i), &sub->success,
914 subpos, insn_type, 0);
920 for (j = 0; j < XVECLEN (pattern, i); j++)
922 subpos[depth] = 'a' + j;
923 sub = add_to_sequence (XVECEXP (pattern, i, j),
924 &sub->success, subpos, insn_type, 0);
941 /* Insert nodes testing mode and code, if they're still relevant,
942 before any of the nodes we may have added above. */
945 place = &this->tests;
946 test = new_decision_test (DT_code, &place);
950 if (mode != VOIDmode)
952 place = &this->tests;
953 test = new_decision_test (DT_mode, &place);
957 /* If we didn't insert any tests or accept nodes, hork. */
958 if (this->tests == NULL)
964 /* A subroutine of maybe_both_true; examines only one test.
965 Returns > 0 for "definitely both true" and < 0 for "maybe both true". */
968 maybe_both_true_2 (d1, d2)
969 struct decision_test *d1, *d2;
971 if (d1->type == d2->type)
976 return d1->u.mode == d2->u.mode;
979 return d1->u.code == d2->u.code;
982 return d1->u.veclen == d2->u.veclen;
984 case DT_elt_zero_int:
986 case DT_elt_zero_wide:
987 return d1->u.intval == d2->u.intval;
994 /* If either has a predicate that we know something about, set
995 things up so that D1 is the one that always has a known
996 predicate. Then see if they have any codes in common. */
998 if (d1->type == DT_pred || d2->type == DT_pred)
1000 if (d2->type == DT_pred)
1002 struct decision_test *tmp;
1003 tmp = d1, d1 = d2, d2 = tmp;
1006 /* If D2 tests a mode, see if it matches D1. */
1007 if (d1->u.pred.mode != VOIDmode)
1009 if (d2->type == DT_mode)
1011 if (d1->u.pred.mode != d2->u.mode)
1014 /* Don't check two predicate modes here, because if both predicates
1015 accept CONST_INT, then both can still be true even if the modes
1016 are different. If they don't accept CONST_INT, there will be a
1017 separate DT_mode that will make maybe_both_true_1 return 0. */
1020 if (d1->u.pred.index >= 0)
1022 /* If D2 tests a code, see if it is in the list of valid
1023 codes for D1's predicate. */
1024 if (d2->type == DT_code)
1026 const RTX_CODE *c = &preds[d1->u.pred.index].codes[0];
1029 if (*c == d2->u.code)
1037 /* Otherwise see if the predicates have any codes in common. */
1038 else if (d2->type == DT_pred && d2->u.pred.index >= 0)
1040 const RTX_CODE *c1 = &preds[d1->u.pred.index].codes[0];
1043 while (*c1 != 0 && !common)
1045 const RTX_CODE *c2 = &preds[d2->u.pred.index].codes[0];
1046 while (*c2 != 0 && !common)
1048 common = (*c1 == *c2);
1063 /* A subroutine of maybe_both_true; examines all the tests for a given node.
1064 Returns > 0 for "definitely both true" and < 0 for "maybe both true". */
1067 maybe_both_true_1 (d1, d2)
1068 struct decision_test *d1, *d2;
1070 struct decision_test *t1, *t2;
1072 /* A match_operand with no predicate can match anything. Recognize
1073 this by the existance of a lone DT_accept_op test. */
1074 if (d1->type == DT_accept_op || d2->type == DT_accept_op)
1077 /* Eliminate pairs of tests while they can exactly match. */
1078 while (d1 && d2 && d1->type == d2->type)
1080 if (maybe_both_true_2 (d1, d2) == 0)
1082 d1 = d1->next, d2 = d2->next;
1085 /* After that, consider all pairs. */
1086 for (t1 = d1; t1 ; t1 = t1->next)
1087 for (t2 = d2; t2 ; t2 = t2->next)
1088 if (maybe_both_true_2 (t1, t2) == 0)
1094 /* Return 0 if we can prove that there is no RTL that can match both
1095 D1 and D2. Otherwise, return 1 (it may be that there is an RTL that
1096 can match both or just that we couldn't prove there wasn't such an RTL).
1098 TOPLEVEL is non-zero if we are to only look at the top level and not
1099 recursively descend. */
1102 maybe_both_true (d1, d2, toplevel)
1103 struct decision *d1, *d2;
1106 struct decision *p1, *p2;
1109 /* Don't compare strings on the different positions in insn. Doing so
1110 is incorrect and results in false matches from constructs like
1112 [(set (subreg:HI (match_operand:SI "register_operand" "r") 0)
1113 (subreg:HI (match_operand:SI "register_operand" "r") 0))]
1115 [(set (match_operand:HI "register_operand" "r")
1116 (match_operand:HI "register_operand" "r"))]
1118 If we are presented with such, we are recursing through the remainder
1119 of a node's success nodes (from the loop at the end of this function).
1120 Skip forward until we come to a position that matches.
1122 Due to the way position strings are constructed, we know that iterating
1123 forward from the lexically lower position (e.g. "00") will run into
1124 the lexically higher position (e.g. "1") and not the other way around.
1125 This saves a bit of effort. */
1127 cmp = strcmp (d1->position, d2->position);
1133 /* If the d2->position was lexically lower, swap. */
1135 p1 = d1, d1 = d2, d2 = p1;
1137 if (d1->success.first == 0)
1139 for (p1 = d1->success.first; p1; p1 = p1->next)
1140 if (maybe_both_true (p1, d2, 0))
1146 /* Test the current level. */
1147 cmp = maybe_both_true_1 (d1->tests, d2->tests);
1151 /* We can't prove that D1 and D2 cannot both be true. If we are only
1152 to check the top level, return 1. Otherwise, see if we can prove
1153 that all choices in both successors are mutually exclusive. If
1154 either does not have any successors, we can't prove they can't both
1157 if (toplevel || d1->success.first == 0 || d2->success.first == 0)
1160 for (p1 = d1->success.first; p1; p1 = p1->next)
1161 for (p2 = d2->success.first; p2; p2 = p2->next)
1162 if (maybe_both_true (p1, p2, 0))
1168 /* A subroutine of nodes_identical. Examine two tests for equivalence. */
1171 nodes_identical_1 (d1, d2)
1172 struct decision_test *d1, *d2;
1177 return d1->u.mode == d2->u.mode;
1180 return d1->u.code == d2->u.code;
1183 return (d1->u.pred.mode == d2->u.pred.mode
1184 && strcmp (d1->u.pred.name, d2->u.pred.name) == 0);
1187 return strcmp (d1->u.c_test, d2->u.c_test) == 0;
1190 return d1->u.veclen == d2->u.veclen;
1193 return d1->u.dup == d2->u.dup;
1195 case DT_elt_zero_int:
1196 case DT_elt_one_int:
1197 case DT_elt_zero_wide:
1198 return d1->u.intval == d2->u.intval;
1201 return d1->u.opno == d2->u.opno;
1203 case DT_accept_insn:
1204 /* Differences will be handled in merge_accept_insn. */
1212 /* True iff the two nodes are identical (on one level only). Due
1213 to the way these lists are constructed, we shouldn't have to
1214 consider different orderings on the tests. */
1217 nodes_identical (d1, d2)
1218 struct decision *d1, *d2;
1220 struct decision_test *t1, *t2;
1222 for (t1 = d1->tests, t2 = d2->tests; t1 && t2; t1 = t1->next, t2 = t2->next)
1224 if (t1->type != t2->type)
1226 if (! nodes_identical_1 (t1, t2))
1230 /* For success, they should now both be null. */
1234 /* Check that their subnodes are at the same position, as any one set
1235 of sibling decisions must be at the same position. */
1236 if (d1->success.first
1237 && d2->success.first
1238 && strcmp (d1->success.first->position, d2->success.first->position))
1244 /* A subroutine of merge_trees; given two nodes that have been declared
1245 identical, cope with two insn accept states. If they differ in the
1246 number of clobbers, then the conflict was created by make_insn_sequence
1247 and we can drop the with-clobbers version on the floor. If both
1248 nodes have no additional clobbers, we have found an ambiguity in the
1249 source machine description. */
1252 merge_accept_insn (oldd, addd)
1253 struct decision *oldd, *addd;
1255 struct decision_test *old, *add;
1257 for (old = oldd->tests; old; old = old->next)
1258 if (old->type == DT_accept_insn)
1263 for (add = addd->tests; add; add = add->next)
1264 if (add->type == DT_accept_insn)
1269 /* If one node is for a normal insn and the second is for the base
1270 insn with clobbers stripped off, the second node should be ignored. */
1272 if (old->u.insn.num_clobbers_to_add == 0
1273 && add->u.insn.num_clobbers_to_add > 0)
1275 /* Nothing to do here. */
1277 else if (old->u.insn.num_clobbers_to_add > 0
1278 && add->u.insn.num_clobbers_to_add == 0)
1280 /* In this case, replace OLD with ADD. */
1281 old->u.insn = add->u.insn;
1285 message_with_line (add->u.insn.lineno, "`%s' matches `%s'",
1286 get_insn_name (add->u.insn.code_number),
1287 get_insn_name (old->u.insn.code_number));
1288 message_with_line (old->u.insn.lineno, "previous definition of `%s'",
1289 get_insn_name (old->u.insn.code_number));
1294 /* Merge two decision trees OLDH and ADDH, modifying OLDH destructively. */
1297 merge_trees (oldh, addh)
1298 struct decision_head *oldh, *addh;
1300 struct decision *next, *add;
1302 if (addh->first == 0)
1304 if (oldh->first == 0)
1310 /* Trying to merge bits at different positions isn't possible. */
1311 if (strcmp (oldh->first->position, addh->first->position))
1314 for (add = addh->first; add ; add = next)
1316 struct decision *old, *insert_before = NULL;
1320 /* The semantics of pattern matching state that the tests are
1321 done in the order given in the MD file so that if an insn
1322 matches two patterns, the first one will be used. However,
1323 in practice, most, if not all, patterns are unambiguous so
1324 that their order is independent. In that case, we can merge
1325 identical tests and group all similar modes and codes together.
1327 Scan starting from the end of OLDH until we reach a point
1328 where we reach the head of the list or where we pass a
1329 pattern that could also be true if NEW is true. If we find
1330 an identical pattern, we can merge them. Also, record the
1331 last node that tests the same code and mode and the last one
1332 that tests just the same mode.
1334 If we have no match, place NEW after the closest match we found. */
1336 for (old = oldh->last; old; old = old->prev)
1338 if (nodes_identical (old, add))
1340 merge_accept_insn (old, add);
1341 merge_trees (&old->success, &add->success);
1345 if (maybe_both_true (old, add, 0))
1348 /* Insert the nodes in DT test type order, which is roughly
1349 how expensive/important the test is. Given that the tests
1350 are also ordered within the list, examining the first is
1352 if (add->tests->type < old->tests->type)
1353 insert_before = old;
1356 if (insert_before == NULL)
1359 add->prev = oldh->last;
1360 oldh->last->next = add;
1365 if ((add->prev = insert_before->prev) != NULL)
1366 add->prev->next = add;
1369 add->next = insert_before;
1370 insert_before->prev = add;
1377 /* Walk the tree looking for sub-nodes that perform common tests.
1378 Factor out the common test into a new node. This enables us
1379 (depending on the test type) to emit switch statements later. */
1383 struct decision_head *head;
1385 struct decision *first, *next;
1387 for (first = head->first; first && first->next; first = next)
1389 enum decision_type type;
1390 struct decision *new, *old_last;
1392 type = first->tests->type;
1395 /* Want at least two compatible sequential nodes. */
1396 if (next->tests->type != type)
1399 /* Don't want all node types, just those we can turn into
1400 switch statements. */
1403 && type != DT_veclen
1404 && type != DT_elt_zero_int
1405 && type != DT_elt_one_int
1406 && type != DT_elt_zero_wide)
1409 /* If we'd been performing more than one test, create a new node
1410 below our first test. */
1411 if (first->tests->next != NULL)
1413 new = new_decision (first->position, &first->success);
1414 new->tests = first->tests->next;
1415 first->tests->next = NULL;
1418 /* Crop the node tree off after our first test. */
1420 old_last = head->last;
1423 /* For each compatible test, adjust to perform only one test in
1424 the top level node, then merge the node back into the tree. */
1427 struct decision_head h;
1429 if (next->tests->next != NULL)
1431 new = new_decision (next->position, &next->success);
1432 new->tests = next->tests->next;
1433 next->tests->next = NULL;
1438 h.first = h.last = new;
1440 merge_trees (head, &h);
1442 while (next && next->tests->type == type);
1444 /* After we run out of compatible tests, graft the remaining nodes
1445 back onto the tree. */
1448 next->prev = head->last;
1449 head->last->next = next;
1450 head->last = old_last;
1455 for (first = head->first; first; first = first->next)
1456 factor_tests (&first->success);
1459 /* After factoring, try to simplify the tests on any one node.
1460 Tests that are useful for switch statements are recognizable
1461 by having only a single test on a node -- we'll be manipulating
1462 nodes with multiple tests:
1464 If we have mode tests or code tests that are redundant with
1465 predicates, remove them. */
1468 simplify_tests (head)
1469 struct decision_head *head;
1471 struct decision *tree;
1473 for (tree = head->first; tree; tree = tree->next)
1475 struct decision_test *a, *b;
1482 /* Find a predicate node. */
1483 while (b && b->type != DT_pred)
1487 /* Due to how these tests are constructed, we don't even need
1488 to check that the mode and code are compatible -- they were
1489 generated from the predicate in the first place. */
1490 while (a->type == DT_mode || a->type == DT_code)
1497 for (tree = head->first; tree; tree = tree->next)
1498 simplify_tests (&tree->success);
1501 /* Count the number of subnodes of HEAD. If the number is high enough,
1502 make the first node in HEAD start a separate subroutine in the C code
1503 that is generated. */
1506 break_out_subroutines (head, initial)
1507 struct decision_head *head;
1511 struct decision *sub;
1513 for (sub = head->first; sub; sub = sub->next)
1514 size += 1 + break_out_subroutines (&sub->success, 0);
1516 if (size > SUBROUTINE_THRESHOLD && ! initial)
1518 head->first->subroutine_number = ++next_subroutine_number;
1524 /* For each node p, find the next alternative that might be true
1528 find_afterward (head, real_afterward)
1529 struct decision_head *head;
1530 struct decision *real_afterward;
1532 struct decision *p, *q, *afterward;
1534 /* We can't propogate alternatives across subroutine boundaries.
1535 This is not incorrect, merely a minor optimization loss. */
1538 afterward = (p->subroutine_number > 0 ? NULL : real_afterward);
1540 for ( ; p ; p = p->next)
1542 /* Find the next node that might be true if this one fails. */
1543 for (q = p->next; q ; q = q->next)
1544 if (maybe_both_true (p, q, 1))
1547 /* If we reached the end of the list without finding one,
1548 use the incoming afterward position. */
1557 for (p = head->first; p ; p = p->next)
1558 if (p->success.first)
1559 find_afterward (&p->success, p->afterward);
1561 /* When we are generating a subroutine, record the real afterward
1562 position in the first node where write_tree can find it, and we
1563 can do the right thing at the subroutine call site. */
1565 if (p->subroutine_number > 0)
1566 p->afterward = real_afterward;
1569 /* Assuming that the state of argument is denoted by OLDPOS, take whatever
1570 actions are necessary to move to NEWPOS. If we fail to move to the
1571 new state, branch to node AFTERWARD if non-zero, otherwise return.
1573 Failure to move to the new state can only occur if we are trying to
1574 match multiple insns and we try to step past the end of the stream. */
1577 change_state (oldpos, newpos, afterward, indent)
1580 struct decision *afterward;
1583 int odepth = strlen (oldpos);
1584 int ndepth = strlen (newpos);
1586 int old_has_insn, new_has_insn;
1588 /* Pop up as many levels as necessary. */
1589 for (depth = odepth; strncmp (oldpos, newpos, depth) != 0; --depth)
1592 /* Hunt for the last [A-Z] in both strings. */
1593 for (old_has_insn = odepth - 1; old_has_insn >= 0; --old_has_insn)
1594 if (oldpos[old_has_insn] >= 'A' && oldpos[old_has_insn] <= 'Z')
1596 for (new_has_insn = odepth - 1; new_has_insn >= 0; --new_has_insn)
1597 if (newpos[new_has_insn] >= 'A' && newpos[new_has_insn] <= 'Z')
1600 /* Make sure to reset the _last_insn pointer when popping back up. */
1601 if (old_has_insn >= 0 && new_has_insn < 0)
1602 printf ("%s_last_insn = insn;\n", indent);
1604 /* Go down to desired level. */
1605 while (depth < ndepth)
1607 /* It's a different insn from the first one. */
1608 if (newpos[depth] >= 'A' && newpos[depth] <= 'Z')
1610 /* We can only fail if we're moving down the tree. */
1611 if (old_has_insn >= 0 && oldpos[old_has_insn] >= newpos[depth])
1613 printf ("%s_last_insn = recog_next_insn (insn, %d);\n",
1614 indent, newpos[depth] - 'A');
1618 printf ("%stem = recog_next_insn (insn, %d);\n",
1619 indent, newpos[depth] - 'A');
1620 printf ("%sif (tem == NULL_RTX)\n", indent);
1622 printf ("%s goto L%d;\n", indent, afterward->number);
1624 printf ("%s goto ret0;\n", indent);
1625 printf ("%s_last_insn = tem;\n", indent);
1627 printf ("%sx%d = PATTERN (_last_insn);\n", indent, depth + 1);
1629 else if (newpos[depth] >= 'a' && newpos[depth] <= 'z')
1630 printf ("%sx%d = XVECEXP (x%d, 0, %d);\n",
1631 indent, depth + 1, depth, newpos[depth] - 'a');
1633 printf ("%sx%d = XEXP (x%d, %c);\n",
1634 indent, depth + 1, depth, newpos[depth]);
1639 /* Print the enumerator constant for CODE -- the upcase version of
1646 register const char *p;
1647 for (p = GET_RTX_NAME (code); *p; p++)
1648 putchar (TOUPPER (*p));
1651 /* Emit code to cross an afterward link -- change state and branch. */
1654 write_afterward (start, afterward, indent)
1655 struct decision *start;
1656 struct decision *afterward;
1659 if (!afterward || start->subroutine_number > 0)
1660 printf("%sgoto ret0;\n", indent);
1663 change_state (start->position, afterward->position, NULL, indent);
1664 printf ("%sgoto L%d;\n", indent, afterward->number);
1668 /* Emit a switch statement, if possible, for an initial sequence of
1669 nodes at START. Return the first node yet untested. */
1671 static struct decision *
1672 write_switch (start, depth)
1673 struct decision *start;
1676 struct decision *p = start;
1677 enum decision_type type = p->tests->type;
1679 /* If we have two or more nodes in sequence that test the same one
1680 thing, we may be able to use a switch statement. */
1684 || p->next->tests->type != type
1685 || p->next->tests->next)
1688 /* DT_code is special in that we can do interesting things with
1689 known predicates at the same time. */
1690 if (type == DT_code)
1692 char codemap[NUM_RTX_CODE];
1693 struct decision *ret;
1695 memset (codemap, 0, sizeof(codemap));
1697 printf (" switch (GET_CODE (x%d))\n {\n", depth);
1700 RTX_CODE code = p->tests->u.code;
1703 printf (":\n goto L%d;\n", p->success.first->number);
1704 p->success.first->need_label = 1;
1709 while (p && p->tests->type == DT_code && !p->tests->next);
1711 /* If P is testing a predicate that we know about and we haven't
1712 seen any of the codes that are valid for the predicate, we can
1713 write a series of "case" statement, one for each possible code.
1714 Since we are already in a switch, these redundant tests are very
1715 cheap and will reduce the number of predicates called. */
1717 /* Note that while we write out cases for these predicates here,
1718 we don't actually write the test here, as it gets kinda messy.
1719 It is trivial to leave this to later by telling our caller that
1720 we only processed the CODE tests. */
1723 while (p && p->tests->type == DT_pred
1724 && p->tests->u.pred.index >= 0)
1728 for (c = &preds[p->tests->u.pred.index].codes[0]; *c ; ++c)
1729 if (codemap[(int) *c] != 0)
1732 for (c = &preds[p->tests->u.pred.index].codes[0]; *c ; ++c)
1737 codemap[(int) *c] = 1;
1740 printf (" goto L%d;\n", p->number);
1746 /* Make the default case skip the predicates we managed to match. */
1748 printf (" default:\n");
1753 printf (" goto L%d;\n", p->number);
1757 write_afterward (start, start->afterward, " ");
1760 printf (" break;\n");
1765 else if (type == DT_mode
1766 || type == DT_veclen
1767 || type == DT_elt_zero_int
1768 || type == DT_elt_one_int
1769 || type == DT_elt_zero_wide)
1773 printf (" switch (");
1777 str = "GET_MODE (x%d)";
1780 str = "XVECLEN (x%d, 0)";
1782 case DT_elt_zero_int:
1783 str = "XINT (x%d, 0)";
1785 case DT_elt_one_int:
1786 str = "XINT (x%d, 1)";
1788 case DT_elt_zero_wide:
1789 str = "XWINT (x%d, 0)";
1794 printf (str, depth);
1803 printf ("%smode", GET_MODE_NAME (p->tests->u.mode));
1806 printf ("%d", p->tests->u.veclen);
1808 case DT_elt_zero_int:
1809 case DT_elt_one_int:
1810 case DT_elt_zero_wide:
1811 printf (HOST_WIDE_INT_PRINT_DEC, p->tests->u.intval);
1816 printf (":\n goto L%d;\n", p->success.first->number);
1817 p->success.first->need_label = 1;
1821 while (p && p->tests->type == type && !p->tests->next);
1823 printf (" default:\n break;\n }\n");
1829 /* None of the other tests are ameanable. */
1834 /* Emit code for one test. */
1837 write_cond (p, depth, subroutine_type)
1838 struct decision_test *p;
1840 enum routine_type subroutine_type;
1845 printf ("GET_MODE (x%d) == %smode", depth, GET_MODE_NAME (p->u.mode));
1849 printf ("GET_CODE (x%d) == ", depth);
1850 print_code (p->u.code);
1854 printf ("XVECLEN (x%d, 0) == %d", depth, p->u.veclen);
1857 case DT_elt_zero_int:
1858 printf ("XINT (x%d, 0) == %d", depth, (int) p->u.intval);
1861 case DT_elt_one_int:
1862 printf ("XINT (x%d, 1) == %d", depth, (int) p->u.intval);
1865 case DT_elt_zero_wide:
1866 printf ("XWINT (x%d, 0) == ", depth);
1867 printf (HOST_WIDE_INT_PRINT_DEC, p->u.intval);
1871 printf ("rtx_equal_p (x%d, operands[%d])", depth, p->u.dup);
1875 printf ("%s (x%d, %smode)", p->u.pred.name, depth,
1876 GET_MODE_NAME (p->u.pred.mode));
1880 printf ("(%s)", p->u.c_test);
1883 case DT_accept_insn:
1884 switch (subroutine_type)
1887 if (p->u.insn.num_clobbers_to_add == 0)
1889 printf ("pnum_clobbers != NULL");
1902 /* Emit code for one action. The previous tests have succeeded;
1903 TEST is the last of the chain. In the normal case we simply
1904 perform a state change. For the `accept' tests we must do more work. */
1907 write_action (test, depth, uncond, success, subroutine_type)
1908 struct decision_test *test;
1910 struct decision *success;
1911 enum routine_type subroutine_type;
1918 else if (test->type == DT_accept_op || test->type == DT_accept_insn)
1920 fputs (" {\n", stdout);
1927 if (test->type == DT_accept_op)
1929 printf("%soperands[%d] = x%d;\n", indent, test->u.opno, depth);
1931 /* Only allow DT_accept_insn to follow. */
1935 if (test->type != DT_accept_insn)
1940 /* Sanity check that we're now at the end of the list of tests. */
1944 if (test->type == DT_accept_insn)
1946 switch (subroutine_type)
1949 if (test->u.insn.num_clobbers_to_add != 0)
1950 printf ("%s*pnum_clobbers = %d;\n",
1951 indent, test->u.insn.num_clobbers_to_add);
1952 printf ("%sreturn %d;\n", indent, test->u.insn.code_number);
1956 printf ("%sreturn gen_split_%d (operands);\n",
1957 indent, test->u.insn.code_number);
1961 printf ("%stem = gen_peephole2_%d (insn, operands);\n",
1962 indent, test->u.insn.code_number);
1963 printf ("%sif (tem != 0)\n%s goto ret1;\n", indent, indent);
1972 printf("%sgoto L%d;\n", indent, success->number);
1973 success->need_label = 1;
1977 fputs (" }\n", stdout);
1980 /* Return 1 if the test is always true and has no fallthru path. Return -1
1981 if the test does have a fallthru path, but requires that the condition be
1982 terminated. Otherwise return 0 for a normal test. */
1983 /* ??? is_unconditional is a stupid name for a tri-state function. */
1986 is_unconditional (t, subroutine_type)
1987 struct decision_test *t;
1988 enum routine_type subroutine_type;
1990 if (t->type == DT_accept_op)
1993 if (t->type == DT_accept_insn)
1995 switch (subroutine_type)
1998 return (t->u.insn.num_clobbers_to_add == 0);
2011 /* Emit code for one node -- the conditional and the accompanying action.
2012 Return true if there is no fallthru path. */
2015 write_node (p, depth, subroutine_type)
2018 enum routine_type subroutine_type;
2020 struct decision_test *test, *last_test;
2023 last_test = test = p->tests;
2024 uncond = is_unconditional (test, subroutine_type);
2028 write_cond (test, depth, subroutine_type);
2030 while ((test = test->next) != NULL)
2035 uncond2 = is_unconditional (test, subroutine_type);
2040 write_cond (test, depth, subroutine_type);
2046 write_action (last_test, depth, uncond, p->success.first, subroutine_type);
2051 /* Emit code for all of the sibling nodes of HEAD. */
2054 write_tree_1 (head, depth, subroutine_type)
2055 struct decision_head *head;
2057 enum routine_type subroutine_type;
2059 struct decision *p, *next;
2062 for (p = head->first; p ; p = next)
2064 /* The label for the first element was printed in write_tree. */
2065 if (p != head->first && p->need_label)
2066 OUTPUT_LABEL (" ", p->number);
2068 /* Attempt to write a switch statement for a whole sequence. */
2069 next = write_switch (p, depth);
2074 /* Failed -- fall back and write one node. */
2075 uncond = write_node (p, depth, subroutine_type);
2080 /* Finished with this chain. Close a fallthru path by branching
2081 to the afterward node. */
2083 write_afterward (head->last, head->last->afterward, " ");
2086 /* Write out the decision tree starting at HEAD. PREVPOS is the
2087 position at the node that branched to this node. */
2090 write_tree (head, prevpos, type, initial)
2091 struct decision_head *head;
2092 const char *prevpos;
2093 enum routine_type type;
2096 register struct decision *p = head->first;
2100 OUTPUT_LABEL (" ", p->number);
2102 if (! initial && p->subroutine_number > 0)
2104 static const char * const name_prefix[] = {
2105 "recog", "split", "peephole2"
2108 static const char * const call_suffix[] = {
2109 ", pnum_clobbers", "", ", _plast_insn"
2112 /* This node has been broken out into a separate subroutine.
2113 Call it, test the result, and branch accordingly. */
2117 printf (" tem = %s_%d (x0, insn%s);\n",
2118 name_prefix[type], p->subroutine_number, call_suffix[type]);
2119 if (IS_SPLIT (type))
2120 printf (" if (tem != 0)\n return tem;\n");
2122 printf (" if (tem >= 0)\n return tem;\n");
2124 change_state (p->position, p->afterward->position, NULL, " ");
2125 printf (" goto L%d;\n", p->afterward->number);
2129 printf (" return %s_%d (x0, insn%s);\n",
2130 name_prefix[type], p->subroutine_number, call_suffix[type]);
2135 int depth = strlen (p->position);
2137 change_state (prevpos, p->position, head->last->afterward, " ");
2138 write_tree_1 (head, depth, type);
2140 for (p = head->first; p; p = p->next)
2141 if (p->success.first)
2142 write_tree (&p->success, p->position, type, 0);
2146 /* Write out a subroutine of type TYPE to do comparisons starting at
2150 write_subroutine (head, type)
2151 struct decision_head *head;
2152 enum routine_type type;
2154 static const char * const proto_pattern[] = {
2155 "%sint recog%s PROTO ((rtx, rtx, int *));\n",
2156 "%srtx split%s PROTO ((rtx, rtx));\n",
2157 "%srtx peephole2%s PROTO ((rtx, rtx, rtx *));\n"
2160 static const char * const decl_pattern[] = {
2162 recog%s (x0, insn, pnum_clobbers)\n\
2164 rtx insn ATTRIBUTE_UNUSED;\n\
2165 int *pnum_clobbers ATTRIBUTE_UNUSED;\n",
2168 split%s (x0, insn)\n\
2170 rtx insn ATTRIBUTE_UNUSED;\n",
2173 peephole2%s (x0, insn, _plast_insn)\n\
2175 rtx insn ATTRIBUTE_UNUSED;\n\
2176 rtx *_plast_insn ATTRIBUTE_UNUSED;\n"
2179 int subfunction = head->first ? head->first->subroutine_number : 0;
2184 s_or_e = subfunction ? "static " : "";
2187 sprintf (extension, "_%d", subfunction);
2188 else if (type == RECOG)
2189 extension[0] = '\0';
2191 strcpy (extension, "_insns");
2193 printf (proto_pattern[type], s_or_e, extension);
2194 printf (decl_pattern[type], s_or_e, extension);
2196 printf ("{\n register rtx * const operands = &recog_data.operand[0];\n");
2197 for (i = 1; i <= max_depth; i++)
2198 printf (" register rtx x%d ATTRIBUTE_UNUSED;\n", i);
2200 if (type == PEEPHOLE2)
2201 printf (" register rtx _last_insn = insn;\n");
2202 printf (" %s tem ATTRIBUTE_UNUSED;\n", IS_SPLIT (type) ? "rtx" : "int");
2205 write_tree (head, "", type, 1);
2207 printf (" goto ret0;\n");
2209 if (type == PEEPHOLE2)
2210 printf (" ret1:\n *_plast_insn = _last_insn;\n return tem;\n");
2211 printf (" ret0:\n return %d;\n}\n\n", IS_SPLIT (type) ? 0 : -1);
2214 /* In break_out_subroutines, we discovered the boundaries for the
2215 subroutines, but did not write them out. Do so now. */
2218 write_subroutines (head, type)
2219 struct decision_head *head;
2220 enum routine_type type;
2224 for (p = head->first; p ; p = p->next)
2225 if (p->success.first)
2226 write_subroutines (&p->success, type);
2228 if (head->first->subroutine_number > 0)
2229 write_subroutine (head, type);
2232 /* Begin the output file. */
2238 /* Generated automatically by the program `genrecog' from the target\n\
2239 machine description file. */\n\
2241 #include \"config.h\"\n\
2242 #include \"system.h\"\n\
2243 #include \"rtl.h\"\n\
2244 #include \"tm_p.h\"\n\
2245 #include \"function.h\"\n\
2246 #include \"insn-config.h\"\n\
2247 #include \"recog.h\"\n\
2248 #include \"real.h\"\n\
2249 #include \"output.h\"\n\
2250 #include \"flags.h\"\n\
2251 #include \"hard-reg-set.h\"\n\
2252 #include \"resource.h\"\n\
2256 /* `recog' contains a decision tree that recognizes whether the rtx\n\
2257 X0 is a valid instruction.\n\
2259 recog returns -1 if the rtx is not valid. If the rtx is valid, recog\n\
2260 returns a nonnegative number which is the insn code number for the\n\
2261 pattern that matched. This is the same as the order in the machine\n\
2262 description of the entry that matched. This number can be used as an\n\
2263 index into `insn_data' and other tables.\n\
2265 The third argument to recog is an optional pointer to an int. If\n\
2266 present, recog will accept a pattern if it matches except for missing\n\
2267 CLOBBER expressions at the end. In that case, the value pointed to by\n\
2268 the optional pointer will be set to the number of CLOBBERs that need\n\
2269 to be added (it should be initialized to zero by the caller). If it\n\
2270 is set nonzero, the caller should allocate a PARALLEL of the\n\
2271 appropriate size, copy the initial entries, and call add_clobbers\n\
2272 (found in insn-emit.c) to fill in the CLOBBERs.\n\
2276 The function split_insns returns 0 if the rtl could not\n\
2277 be split or the split rtl in a SEQUENCE if it can be.\n\
2279 The function peephole2_insns returns 0 if the rtl could not\n\
2280 be matched. If there was a match, the new rtl is returned in a SEQUENCE,\n\
2281 and LAST_INSN will point to the last recognized insn in the old sequence.\n\
2286 /* Construct and return a sequence of decisions
2287 that will recognize INSN.
2289 TYPE says what type of routine we are recognizing (RECOG or SPLIT). */
2291 static struct decision_head
2292 make_insn_sequence (insn, type)
2294 enum routine_type type;
2297 const char *c_test = XSTR (insn, type == RECOG ? 2 : 1);
2298 struct decision *last;
2299 struct decision_test *test, **place;
2300 struct decision_head head;
2302 record_insn_name (next_insn_code, (type == RECOG ? XSTR (insn, 0) : NULL));
2304 if (type == PEEPHOLE2)
2308 /* peephole2 gets special treatment:
2309 - X always gets an outer parallel even if it's only one entry
2310 - we remove all traces of outer-level match_scratch and match_dup
2311 expressions here. */
2312 x = rtx_alloc (PARALLEL);
2313 PUT_MODE (x, VOIDmode);
2314 XVEC (x, 0) = rtvec_alloc (XVECLEN (insn, 0));
2315 for (i = j = 0; i < XVECLEN (insn, 0); i++)
2317 rtx tmp = XVECEXP (insn, 0, i);
2318 if (GET_CODE (tmp) != MATCH_SCRATCH && GET_CODE (tmp) != MATCH_DUP)
2320 XVECEXP (x, 0, j) = tmp;
2326 else if (XVECLEN (insn, type == RECOG) == 1)
2327 x = XVECEXP (insn, type == RECOG, 0);
2330 x = rtx_alloc (PARALLEL);
2331 XVEC (x, 0) = XVEC (insn, type == RECOG);
2332 PUT_MODE (x, VOIDmode);
2335 validate_pattern (x, insn, NULL_RTX);
2337 memset(&head, 0, sizeof(head));
2338 last = add_to_sequence (x, &head, "", type, 1);
2340 /* Find the end of the test chain on the last node. */
2341 for (test = last->tests; test->next; test = test->next)
2343 place = &test->next;
2347 /* Need a new node if we have another test to add. */
2348 if (test->type == DT_accept_op)
2350 last = new_decision ("", &last->success);
2351 place = &last->tests;
2353 test = new_decision_test (DT_c_test, &place);
2354 test->u.c_test = c_test;
2357 test = new_decision_test (DT_accept_insn, &place);
2358 test->u.insn.code_number = next_insn_code;
2359 test->u.insn.lineno = pattern_lineno;
2360 test->u.insn.num_clobbers_to_add = 0;
2365 /* If this is an DEFINE_INSN and X is a PARALLEL, see if it ends
2366 with a group of CLOBBERs of (hard) registers or MATCH_SCRATCHes.
2367 If so, set up to recognize the pattern without these CLOBBERs. */
2369 if (GET_CODE (x) == PARALLEL)
2373 /* Find the last non-clobber in the parallel. */
2374 for (i = XVECLEN (x, 0); i > 0; i--)
2376 rtx y = XVECEXP (x, 0, i - 1);
2377 if (GET_CODE (y) != CLOBBER
2378 || (GET_CODE (XEXP (y, 0)) != REG
2379 && GET_CODE (XEXP (y, 0)) != MATCH_SCRATCH))
2383 if (i != XVECLEN (x, 0))
2386 struct decision_head clobber_head;
2388 /* Build a similar insn without the clobbers. */
2390 new = XVECEXP (x, 0, 0);
2395 new = rtx_alloc (PARALLEL);
2396 XVEC (new, 0) = rtvec_alloc (i);
2397 for (j = i - 1; j >= 0; j--)
2398 XVECEXP (new, 0, j) = XVECEXP (x, 0, j);
2402 memset (&clobber_head, 0, sizeof(clobber_head));
2403 last = add_to_sequence (new, &clobber_head, "", type, 1);
2405 /* Find the end of the test chain on the last node. */
2406 for (test = last->tests; test->next; test = test->next)
2409 /* We definitely have a new test to add -- create a new
2411 place = &test->next;
2412 if (test->type == DT_accept_op)
2414 last = new_decision ("", &last->success);
2415 place = &last->tests;
2420 test = new_decision_test (DT_c_test, &place);
2421 test->u.c_test = c_test;
2424 test = new_decision_test (DT_accept_insn, &place);
2425 test->u.insn.code_number = next_insn_code;
2426 test->u.insn.lineno = pattern_lineno;
2427 test->u.insn.num_clobbers_to_add = XVECLEN (x, 0) - i;
2429 merge_trees (&head, &clobber_head);
2435 /* Define the subroutine we will call below and emit in genemit. */
2436 printf ("extern rtx gen_split_%d PROTO ((rtx *));\n", next_insn_code);
2440 /* Define the subroutine we will call below and emit in genemit. */
2441 printf ("extern rtx gen_peephole2_%d PROTO ((rtx, rtx *));\n",
2451 process_tree (head, subroutine_type)
2452 struct decision_head *head;
2453 enum routine_type subroutine_type;
2455 if (head->first == NULL)
2457 /* We can elide peephole2_insns, but not recog or split_insns. */
2458 if (subroutine_type == PEEPHOLE2)
2463 factor_tests (head);
2465 next_subroutine_number = 0;
2466 break_out_subroutines (head, 1);
2467 find_afterward (head, NULL);
2469 /* We run this after find_afterward, because find_afterward needs
2470 the redundant DT_mode tests on predicates to determine whether
2471 two tests can both be true or not. */
2472 simplify_tests(head);
2474 write_subroutines (head, subroutine_type);
2477 write_subroutine (head, subroutine_type);
2486 struct decision_head recog_tree, split_tree, peephole2_tree, h;
2490 progname = "genrecog";
2491 obstack_init (rtl_obstack);
2493 memset (&recog_tree, 0, sizeof recog_tree);
2494 memset (&split_tree, 0, sizeof split_tree);
2495 memset (&peephole2_tree, 0, sizeof peephole2_tree);
2498 fatal ("No input file name.");
2500 infile = fopen (argv[1], "r");
2504 return FATAL_EXIT_CODE;
2506 read_rtx_filename = argv[1];
2513 /* Read the machine description. */
2517 c = read_skip_spaces (infile);
2521 pattern_lineno = read_rtx_lineno;
2523 desc = read_rtx (infile);
2524 if (GET_CODE (desc) == DEFINE_INSN)
2526 h = make_insn_sequence (desc, RECOG);
2527 merge_trees (&recog_tree, &h);
2529 else if (GET_CODE (desc) == DEFINE_SPLIT)
2531 h = make_insn_sequence (desc, SPLIT);
2532 merge_trees (&split_tree, &h);
2534 else if (GET_CODE (desc) == DEFINE_PEEPHOLE2)
2536 h = make_insn_sequence (desc, PEEPHOLE2);
2537 merge_trees (&peephole2_tree, &h);
2540 if (GET_CODE (desc) == DEFINE_PEEPHOLE
2541 || GET_CODE (desc) == DEFINE_EXPAND)
2547 return FATAL_EXIT_CODE;
2551 process_tree (&recog_tree, RECOG);
2552 process_tree (&split_tree, SPLIT);
2553 process_tree (&peephole2_tree, PEEPHOLE2);
2556 return (ferror (stdout) != 0 ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE);
2559 /* Define this so we can link with print-rtl.o to get debug_rtx function. */
2561 get_insn_name (code)
2564 if (code < insn_name_ptr_size)
2565 return insn_name_ptr[code];
2571 record_insn_name (code, name)
2575 static const char *last_real_name = "insn";
2576 static int last_real_code = 0;
2579 if (insn_name_ptr_size <= code)
2582 new_size = (insn_name_ptr_size ? insn_name_ptr_size * 2 : 512);
2584 (char **) xrealloc (insn_name_ptr, sizeof(char *) * new_size);
2585 memset (insn_name_ptr + insn_name_ptr_size, 0,
2586 sizeof(char *) * (new_size - insn_name_ptr_size));
2587 insn_name_ptr_size = new_size;
2590 if (!name || name[0] == '\0')
2592 new = xmalloc (strlen (last_real_name) + 10);
2593 sprintf (new, "%s+%d", last_real_name, code - last_real_code);
2597 last_real_name = new = xstrdup (name);
2598 last_real_code = code;
2601 insn_name_ptr[code] = new;
2608 register size_t len = strlen (input) + 1;
2609 register char *output = xmalloc (len);
2610 memcpy (output, input, len);
2615 xrealloc (old, size)
2621 ptr = (PTR) realloc (old, size);
2623 ptr = (PTR) malloc (size);
2625 fatal ("virtual memory exhausted");
2633 register PTR val = (PTR) malloc (size);
2636 fatal ("virtual memory exhausted");
2641 debug_decision_2 (test)
2642 struct decision_test *test;
2647 fprintf (stderr, "mode=%s", GET_MODE_NAME (test->u.mode));
2650 fprintf (stderr, "code=%s", GET_RTX_NAME (test->u.code));
2653 fprintf (stderr, "veclen=%d", test->u.veclen);
2655 case DT_elt_zero_int:
2656 fprintf (stderr, "elt0_i=%d", (int) test->u.intval);
2658 case DT_elt_one_int:
2659 fprintf (stderr, "elt1_i=%d", (int) test->u.intval);
2661 case DT_elt_zero_wide:
2662 fprintf (stderr, "elt0_w=");
2663 fprintf (stderr, HOST_WIDE_INT_PRINT_DEC, test->u.intval);
2666 fprintf (stderr, "dup=%d", test->u.dup);
2669 fprintf (stderr, "pred=(%s,%s)",
2670 test->u.pred.name, GET_MODE_NAME(test->u.pred.mode));
2675 strncpy (sub, test->u.c_test, sizeof(sub));
2676 memcpy (sub+16, "...", 4);
2677 fprintf (stderr, "c_test=\"%s\"", sub);
2681 fprintf (stderr, "A_op=%d", test->u.opno);
2683 case DT_accept_insn:
2684 fprintf (stderr, "A_insn=(%d,%d)",
2685 test->u.insn.code_number, test->u.insn.num_clobbers_to_add);
2694 debug_decision_1 (d, indent)
2699 struct decision_test *test;
2703 for (i = 0; i < indent; ++i)
2705 fputs ("(nil)\n", stderr);
2709 for (i = 0; i < indent; ++i)
2716 debug_decision_2 (test);
2717 while ((test = test->next) != NULL)
2719 fputs (" + ", stderr);
2720 debug_decision_2 (test);
2723 fprintf (stderr, "} %d n %d a %d\n", d->number,
2724 (d->next ? d->next->number : -1),
2725 (d->afterward ? d->afterward->number : -1));
2729 debug_decision_0 (d, indent, maxdepth)
2731 int indent, maxdepth;
2740 for (i = 0; i < indent; ++i)
2742 fputs ("(nil)\n", stderr);
2746 debug_decision_1 (d, indent);
2747 for (n = d->success.first; n ; n = n->next)
2748 debug_decision_0 (n, indent + 2, maxdepth - 1);
2755 debug_decision_0 (d, 0, 1000000);
2759 debug_decision_list (d)
2764 debug_decision_0 (d, 0, 0);