1 /* Generate code from machine description to recognize rtl as insns.
2 Copyright (C) 1987, 1988, 1992, 1993, 1994, 1995, 1997, 1998,
3 1999, 2000 Free Software Foundation, Inc.
5 This file is part of GNU CC.
7 GNU CC is free software; you can redistribute it and/or modify
8 it under the terms of the GNU General Public License as published by
9 the Free Software Foundation; either version 2, or (at your option)
12 GNU CC is distributed in the hope that it will be useful,
13 but WITHOUT ANY WARRANTY; without even the implied warranty of
14 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
15 GNU General Public License for more details.
17 You should have received a copy of the GNU General Public License
18 along with GNU CC; see the file COPYING. If not, write to
19 the Free Software Foundation, 59 Temple Place - Suite 330,
20 Boston, MA 02111-1307, USA. */
23 /* This program is used to produce insn-recog.c, which contains a
24 function called `recog' plus its subroutines. These functions
25 contain a decision tree that recognizes whether an rtx, the
26 argument given to recog, is a valid instruction.
28 recog returns -1 if the rtx is not valid. If the rtx is valid,
29 recog returns a nonnegative number which is the insn code number
30 for the pattern that matched. This is the same as the order in the
31 machine description of the entry that matched. This number can be
32 used as an index into various insn_* tables, such as insn_template,
33 insn_outfun, and insn_n_operands (found in insn-output.c).
35 The third argument to recog is an optional pointer to an int. If
36 present, recog will accept a pattern if it matches except for
37 missing CLOBBER expressions at the end. In that case, the value
38 pointed to by the optional pointer will be set to the number of
39 CLOBBERs that need to be added (it should be initialized to zero by
40 the caller). If it is set nonzero, the caller should allocate a
41 PARALLEL of the appropriate size, copy the initial entries, and
42 call add_clobbers (found in insn-emit.c) to fill in the CLOBBERs.
44 This program also generates the function `split_insns', which
45 returns 0 if the rtl could not be split, or it returns the split
48 This program also generates the function `peephole2_insns', which
49 returns 0 if the rtl could not be matched. If there was a match,
50 the new rtl is returned in a SEQUENCE, and LAST_INSN will point
51 to the last recognized insn in the old sequence. */
57 #include "gensupport.h"
60 #define OUTPUT_LABEL(INDENT_STRING, LABEL_NUMBER) \
61 printf("%sL%d: ATTRIBUTE_UNUSED_LABEL\n", (INDENT_STRING), (LABEL_NUMBER))
63 /* Holds an array of names indexed by insn_code_number. */
64 static char **insn_name_ptr = 0;
65 static int insn_name_ptr_size = 0;
67 /* A listhead of decision trees. The alternatives to a node are kept
68 in a doublely-linked list so we can easily add nodes to the proper
69 place when merging. */
73 struct decision *first;
74 struct decision *last;
77 /* A single test. The two accept types aren't tests per-se, but
78 their equality (or lack thereof) does affect tree merging so
79 it is convenient to keep them here. */
83 /* A linked list through the tests attached to a node. */
84 struct decision_test *next;
86 /* These types are roughly in the order in which we'd like to test them. */
88 DT_mode, DT_code, DT_veclen,
89 DT_elt_zero_int, DT_elt_one_int, DT_elt_zero_wide,
90 DT_dup, DT_pred, DT_c_test,
91 DT_accept_op, DT_accept_insn
96 enum machine_mode mode; /* Machine mode of node. */
97 RTX_CODE code; /* Code to test. */
101 const char *name; /* Predicate to call. */
102 int index; /* Index into `preds' or -1. */
103 enum machine_mode mode; /* Machine mode for node. */
106 const char *c_test; /* Additional test to perform. */
107 int veclen; /* Length of vector. */
108 int dup; /* Number of operand to compare against. */
109 HOST_WIDE_INT intval; /* Value for XINT for XWINT. */
110 int opno; /* Operand number matched. */
113 int code_number; /* Insn number matched. */
114 int lineno; /* Line number of the insn. */
115 int num_clobbers_to_add; /* Number of CLOBBERs to be added. */
120 /* Data structure for decision tree for recognizing legitimate insns. */
124 struct decision_head success; /* Nodes to test on success. */
125 struct decision *next; /* Node to test on failure. */
126 struct decision *prev; /* Node whose failure tests us. */
127 struct decision *afterward; /* Node to test on success,
128 but failure of successor nodes. */
130 const char *position; /* String denoting position in pattern. */
132 struct decision_test *tests; /* The tests for this node. */
134 int number; /* Node number, used for labels */
135 int subroutine_number; /* Number of subroutine this node starts */
136 int need_label; /* Label needs to be output. */
139 #define SUBROUTINE_THRESHOLD 100
141 static int next_subroutine_number;
143 /* We can write three types of subroutines: One for insn recognition,
144 one to split insns, and one for peephole-type optimizations. This
145 defines which type is being written. */
148 RECOG, SPLIT, PEEPHOLE2
151 #define IS_SPLIT(X) ((X) != RECOG)
153 /* Next available node number for tree nodes. */
155 static int next_number;
157 /* Next number to use as an insn_code. */
159 static int next_insn_code;
161 /* Similar, but counts all expressions in the MD file; used for
164 static int next_index;
166 /* Record the highest depth we ever have so we know how many variables to
167 allocate in each subroutine we make. */
169 static int max_depth;
171 /* The line number of the start of the pattern currently being processed. */
172 static int pattern_lineno;
174 /* Count of errors. */
175 static int error_count;
177 /* This table contains a list of the rtl codes that can possibly match a
178 predicate defined in recog.c. The function `maybe_both_true' uses it to
179 deduce that there are no expressions that can be matches by certain pairs
180 of tree nodes. Also, if a predicate can match only one code, we can
181 hardwire that code into the node testing the predicate. */
183 static struct pred_table
186 RTX_CODE codes[NUM_RTX_CODE];
188 {"general_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
189 LABEL_REF, SUBREG, REG, MEM}},
190 #ifdef PREDICATE_CODES
193 {"address_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
194 LABEL_REF, SUBREG, REG, MEM, PLUS, MINUS, MULT}},
195 {"register_operand", {SUBREG, REG}},
196 {"pmode_register_operand", {SUBREG, REG}},
197 {"scratch_operand", {SCRATCH, REG}},
198 {"immediate_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
200 {"const_int_operand", {CONST_INT}},
201 {"const_double_operand", {CONST_INT, CONST_DOUBLE}},
202 {"nonimmediate_operand", {SUBREG, REG, MEM}},
203 {"nonmemory_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
204 LABEL_REF, SUBREG, REG}},
205 {"push_operand", {MEM}},
206 {"pop_operand", {MEM}},
207 {"memory_operand", {SUBREG, MEM}},
208 {"indirect_operand", {SUBREG, MEM}},
209 {"comparison_operator", {EQ, NE, LE, LT, GE, GT, LEU, LTU, GEU, GTU,
210 UNORDERED, ORDERED, UNEQ, UNGE, UNGT, UNLE,
212 {"mode_independent_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
213 LABEL_REF, SUBREG, REG, MEM}}
216 #define NUM_KNOWN_PREDS ARRAY_SIZE (preds)
218 static const char * special_mode_pred_table[] = {
219 #ifdef SPECIAL_MODE_PREDICATES
220 SPECIAL_MODE_PREDICATES
222 "pmode_register_operand"
225 #define NUM_SPECIAL_MODE_PREDS ARRAY_SIZE (special_mode_pred_table)
227 static struct decision *new_decision
228 PARAMS ((const char *, struct decision_head *));
229 static struct decision_test *new_decision_test
230 PARAMS ((enum decision_type, struct decision_test ***));
231 static rtx find_operand
233 static void validate_pattern
234 PARAMS ((rtx, rtx, rtx, int));
235 static struct decision *add_to_sequence
236 PARAMS ((rtx, struct decision_head *, const char *, enum routine_type, int));
238 static int maybe_both_true_2
239 PARAMS ((struct decision_test *, struct decision_test *));
240 static int maybe_both_true_1
241 PARAMS ((struct decision_test *, struct decision_test *));
242 static int maybe_both_true
243 PARAMS ((struct decision *, struct decision *, int));
245 static int nodes_identical_1
246 PARAMS ((struct decision_test *, struct decision_test *));
247 static int nodes_identical
248 PARAMS ((struct decision *, struct decision *));
249 static void merge_accept_insn
250 PARAMS ((struct decision *, struct decision *));
251 static void merge_trees
252 PARAMS ((struct decision_head *, struct decision_head *));
254 static void factor_tests
255 PARAMS ((struct decision_head *));
256 static void simplify_tests
257 PARAMS ((struct decision_head *));
258 static int break_out_subroutines
259 PARAMS ((struct decision_head *, int));
260 static void find_afterward
261 PARAMS ((struct decision_head *, struct decision *));
263 static void change_state
264 PARAMS ((const char *, const char *, struct decision *, const char *));
265 static void print_code
266 PARAMS ((enum rtx_code));
267 static void write_afterward
268 PARAMS ((struct decision *, struct decision *, const char *));
269 static struct decision *write_switch
270 PARAMS ((struct decision *, int));
271 static void write_cond
272 PARAMS ((struct decision_test *, int, enum routine_type));
273 static void write_action
274 PARAMS ((struct decision *, struct decision_test *, int, int,
275 struct decision *, enum routine_type));
276 static int is_unconditional
277 PARAMS ((struct decision_test *, enum routine_type));
278 static int write_node
279 PARAMS ((struct decision *, int, enum routine_type));
280 static void write_tree_1
281 PARAMS ((struct decision_head *, int, enum routine_type));
282 static void write_tree
283 PARAMS ((struct decision_head *, const char *, enum routine_type, int));
284 static void write_subroutine
285 PARAMS ((struct decision_head *, enum routine_type));
286 static void write_subroutines
287 PARAMS ((struct decision_head *, enum routine_type));
288 static void write_header
291 static struct decision_head make_insn_sequence
292 PARAMS ((rtx, enum routine_type));
293 static void process_tree
294 PARAMS ((struct decision_head *, enum routine_type));
296 static void record_insn_name
297 PARAMS ((int, const char *));
299 static void debug_decision_0
300 PARAMS ((struct decision *, int, int));
301 static void debug_decision_1
302 PARAMS ((struct decision *, int));
303 static void debug_decision_2
304 PARAMS ((struct decision_test *));
305 extern void debug_decision
306 PARAMS ((struct decision *));
307 extern void debug_decision_list
308 PARAMS ((struct decision *));
310 /* Create a new node in sequence after LAST. */
312 static struct decision *
313 new_decision (position, last)
314 const char *position;
315 struct decision_head *last;
317 register struct decision *new
318 = (struct decision *) xmalloc (sizeof (struct decision));
320 memset (new, 0, sizeof (*new));
321 new->success = *last;
322 new->position = xstrdup (position);
323 new->number = next_number++;
325 last->first = last->last = new;
329 /* Create a new test and link it in at PLACE. */
331 static struct decision_test *
332 new_decision_test (type, pplace)
333 enum decision_type type;
334 struct decision_test ***pplace;
336 struct decision_test **place = *pplace;
337 struct decision_test *test;
339 test = (struct decision_test *) xmalloc (sizeof (*test));
350 /* Search for and return operand N. */
353 find_operand (pattern, n)
362 code = GET_CODE (pattern);
363 if ((code == MATCH_SCRATCH
364 || code == MATCH_INSN
365 || code == MATCH_OPERAND
366 || code == MATCH_OPERATOR
367 || code == MATCH_PARALLEL)
368 && XINT (pattern, 0) == n)
371 fmt = GET_RTX_FORMAT (code);
372 len = GET_RTX_LENGTH (code);
373 for (i = 0; i < len; i++)
378 if ((r = find_operand (XEXP (pattern, i), n)) != NULL_RTX)
383 for (j = 0; j < XVECLEN (pattern, i); j++)
384 if ((r = find_operand (XVECEXP (pattern, i, j), n)) != NULL_RTX)
388 case 'i': case 'w': case '0': case 's':
399 /* Check for various errors in patterns. SET is nonnull for a destination,
400 and is the complete set pattern. SET_CODE is '=' for normal sets, and
401 '+' within a context that requires in-out constraints. */
404 validate_pattern (pattern, insn, set, set_code)
415 code = GET_CODE (pattern);
425 const char *pred_name = XSTR (pattern, 1);
426 int allows_non_lvalue = 1, allows_non_const = 1;
427 int special_mode_pred = 0;
430 if (GET_CODE (insn) == DEFINE_INSN)
431 c_test = XSTR (insn, 2);
433 c_test = XSTR (insn, 1);
435 if (pred_name[0] != 0)
437 for (i = 0; i < NUM_KNOWN_PREDS; i++)
438 if (! strcmp (preds[i].name, pred_name))
441 if (i < NUM_KNOWN_PREDS)
445 allows_non_lvalue = allows_non_const = 0;
446 for (j = 0; preds[i].codes[j] != 0; j++)
448 RTX_CODE c = preds[i].codes[j];
455 && c != CONSTANT_P_RTX)
456 allows_non_const = 1;
463 && c != STRICT_LOW_PART)
464 allows_non_lvalue = 1;
469 #ifdef PREDICATE_CODES
470 /* If the port has a list of the predicates it uses but
472 message_with_line (pattern_lineno,
473 "warning: `%s' not in PREDICATE_CODES",
478 for (i = 0; i < NUM_SPECIAL_MODE_PREDS; ++i)
479 if (strcmp (pred_name, special_mode_pred_table[i]) == 0)
481 special_mode_pred = 1;
486 /* A MATCH_OPERAND that is a SET should have an output reload. */
487 if (set && code == MATCH_OPERAND)
490 && XSTR (pattern, 2)[0] != '\0'
491 && XSTR (pattern, 2)[0] != '+')
493 message_with_line (pattern_lineno,
494 "operand %d missing in-out reload",
498 else if (XSTR (pattern, 2)[0] != '\0'
499 && XSTR (pattern, 2)[0] != '='
500 && XSTR (pattern, 2)[0] != '+')
502 message_with_line (pattern_lineno,
503 "operand %d missing output reload",
509 /* Allowing non-lvalues in destinations -- particularly CONST_INT --
510 while not likely to occur at runtime, results in less efficient
511 code from insn-recog.c. */
513 && pred_name[0] != '\0'
514 && allows_non_lvalue)
516 message_with_line (pattern_lineno,
517 "warning: destination operand %d allows non-lvalue",
521 /* A modeless MATCH_OPERAND can be handy when we can
522 check for multiple modes in the c_test. In most other cases,
523 it is a mistake. Only DEFINE_INSN is eligible, since SPLIT
524 and PEEP2 can FAIL within the output pattern. Exclude
525 address_operand, since its mode is related to the mode of
526 the memory not the operand. Exclude the SET_DEST of a call
527 instruction, as that is a common idiom. */
529 if (GET_MODE (pattern) == VOIDmode
530 && code == MATCH_OPERAND
531 && GET_CODE (insn) == DEFINE_INSN
533 && ! special_mode_pred
534 && pred_name[0] != '\0'
535 && strcmp (pred_name, "address_operand") != 0
536 && strstr (c_test, "operands") == NULL
538 && GET_CODE (set) == SET
539 && GET_CODE (SET_SRC (set)) == CALL))
541 message_with_line (pattern_lineno,
542 "warning: operand %d missing mode?",
550 enum machine_mode dmode, smode;
553 dest = SET_DEST (pattern);
554 src = SET_SRC (pattern);
556 /* Find the referant for a DUP. */
558 if (GET_CODE (dest) == MATCH_DUP
559 || GET_CODE (dest) == MATCH_OP_DUP
560 || GET_CODE (dest) == MATCH_PAR_DUP)
561 dest = find_operand (insn, XINT (dest, 0));
563 if (GET_CODE (src) == MATCH_DUP
564 || GET_CODE (src) == MATCH_OP_DUP
565 || GET_CODE (src) == MATCH_PAR_DUP)
566 src = find_operand (insn, XINT (src, 0));
568 /* STRICT_LOW_PART is a wrapper. Its argument is the real
569 destination, and it's mode should match the source. */
570 if (GET_CODE (dest) == STRICT_LOW_PART)
571 dest = XEXP (dest, 0);
573 dmode = GET_MODE (dest);
574 smode = GET_MODE (src);
576 /* The mode of an ADDRESS_OPERAND is the mode of the memory
577 reference, not the mode of the address. */
578 if (GET_CODE (src) == MATCH_OPERAND
579 && ! strcmp (XSTR (src, 1), "address_operand"))
582 /* The operands of a SET must have the same mode unless one
584 else if (dmode != VOIDmode && smode != VOIDmode && dmode != smode)
586 message_with_line (pattern_lineno,
587 "mode mismatch in set: %smode vs %smode",
588 GET_MODE_NAME (dmode), GET_MODE_NAME (smode));
592 /* If only one of the operands is VOIDmode, and PC or CC0 is
593 not involved, it's probably a mistake. */
594 else if (dmode != smode
595 && GET_CODE (dest) != PC
596 && GET_CODE (dest) != CC0
597 && GET_CODE (src) != PC
598 && GET_CODE (src) != 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, pattern, '=');
609 validate_pattern (SET_DEST (pattern), insn, pattern, '=');
610 validate_pattern (SET_SRC (pattern), insn, NULL_RTX, 0);
615 validate_pattern (SET_DEST (pattern), insn, pattern, '=');
619 validate_pattern (XEXP (pattern, 0), insn, set, set ? '+' : 0);
620 validate_pattern (XEXP (pattern, 1), insn, NULL_RTX, 0);
621 validate_pattern (XEXP (pattern, 2), insn, NULL_RTX, 0);
624 case STRICT_LOW_PART:
625 validate_pattern (XEXP (pattern, 0), insn, set, set ? '+' : 0);
629 if (GET_MODE (XEXP (pattern, 0)) != VOIDmode)
631 message_with_line (pattern_lineno,
632 "operand to label_ref %smode not VOIDmode",
633 GET_MODE_NAME (GET_MODE (XEXP (pattern, 0))));
642 fmt = GET_RTX_FORMAT (code);
643 len = GET_RTX_LENGTH (code);
644 for (i = 0; i < len; i++)
649 validate_pattern (XEXP (pattern, i), insn, NULL_RTX, 0);
653 for (j = 0; j < XVECLEN (pattern, i); j++)
654 validate_pattern (XVECEXP (pattern, i, j), insn, NULL_RTX, 0);
657 case 'i': case 'w': case '0': case 's':
666 /* Create a chain of nodes to verify that an rtl expression matches
669 LAST is a pointer to the listhead in the previous node in the chain (or
670 in the calling function, for the first node).
672 POSITION is the string representing the current position in the insn.
674 INSN_TYPE is the type of insn for which we are emitting code.
676 A pointer to the final node in the chain is returned. */
678 static struct decision *
679 add_to_sequence (pattern, last, position, insn_type, top)
681 struct decision_head *last;
682 const char *position;
683 enum routine_type insn_type;
687 struct decision *this, *sub;
688 struct decision_test *test;
689 struct decision_test **place;
692 register const char *fmt;
693 int depth = strlen (position);
695 enum machine_mode mode;
697 if (depth > max_depth)
700 subpos = (char *) alloca (depth + 2);
701 strcpy (subpos, position);
702 subpos[depth + 1] = 0;
704 sub = this = new_decision (position, last);
705 place = &this->tests;
708 mode = GET_MODE (pattern);
709 code = GET_CODE (pattern);
714 /* Toplevel peephole pattern. */
715 if (insn_type == PEEPHOLE2 && top)
717 /* We don't need the node we just created -- unlink it. */
718 last->first = last->last = NULL;
720 for (i = 0; i < (size_t) XVECLEN (pattern, 0); i++)
722 /* Which insn we're looking at is represented by A-Z. We don't
723 ever use 'A', however; it is always implied. */
725 subpos[depth] = (i > 0 ? 'A' + i : 0);
726 sub = add_to_sequence (XVECEXP (pattern, 0, i),
727 last, subpos, insn_type, 0);
728 last = &sub->success;
733 /* Else nothing special. */
742 const char *pred_name;
743 RTX_CODE was_code = code;
744 int allows_const_int = 1;
746 if (code == MATCH_SCRATCH)
748 pred_name = "scratch_operand";
753 pred_name = XSTR (pattern, 1);
754 if (code == MATCH_PARALLEL)
760 /* We know exactly what const_int_operand matches -- any CONST_INT. */
761 if (strcmp ("const_int_operand", pred_name) == 0)
766 else if (pred_name[0] != 0)
768 test = new_decision_test (DT_pred, &place);
769 test->u.pred.name = pred_name;
770 test->u.pred.mode = mode;
772 /* See if we know about this predicate and save its number. If
773 we do, and it only accepts one code, note that fact. The
774 predicate `const_int_operand' only tests for a CONST_INT, so
775 if we do so we can avoid calling it at all.
777 Finally, if we know that the predicate does not allow
778 CONST_INT, we know that the only way the predicate can match
779 is if the modes match (here we use the kludge of relying on
780 the fact that "address_operand" accepts CONST_INT; otherwise,
781 it would have to be a special case), so we can test the mode
782 (but we need not). This fact should considerably simplify the
785 for (i = 0; i < NUM_KNOWN_PREDS; i++)
786 if (! strcmp (preds[i].name, pred_name))
789 if (i < NUM_KNOWN_PREDS)
793 test->u.pred.index = i;
795 if (preds[i].codes[1] == 0 && code == UNKNOWN)
796 code = preds[i].codes[0];
798 allows_const_int = 0;
799 for (j = 0; preds[i].codes[j] != 0; j++)
800 if (preds[i].codes[j] == CONST_INT)
802 allows_const_int = 1;
807 test->u.pred.index = -1;
810 /* Can't enforce a mode if we allow const_int. */
811 if (allows_const_int)
814 /* Accept the operand, ie. record it in `operands'. */
815 test = new_decision_test (DT_accept_op, &place);
816 test->u.opno = XINT (pattern, 0);
818 if (was_code == MATCH_OPERATOR || was_code == MATCH_PARALLEL)
820 char base = (was_code == MATCH_OPERATOR ? '0' : 'a');
821 for (i = 0; i < (size_t) XVECLEN (pattern, 2); i++)
823 subpos[depth] = i + base;
824 sub = add_to_sequence (XVECEXP (pattern, 2, i),
825 &sub->success, subpos, insn_type, 0);
834 test = new_decision_test (DT_dup, &place);
835 test->u.dup = XINT (pattern, 0);
837 test = new_decision_test (DT_accept_op, &place);
838 test->u.opno = XINT (pattern, 0);
840 for (i = 0; i < (size_t) XVECLEN (pattern, 1); i++)
842 subpos[depth] = i + '0';
843 sub = add_to_sequence (XVECEXP (pattern, 1, i),
844 &sub->success, subpos, insn_type, 0);
852 test = new_decision_test (DT_dup, &place);
853 test->u.dup = XINT (pattern, 0);
857 pattern = XEXP (pattern, 0);
864 fmt = GET_RTX_FORMAT (code);
865 len = GET_RTX_LENGTH (code);
867 /* Do tests against the current node first. */
868 for (i = 0; i < (size_t) len; i++)
874 test = new_decision_test (DT_elt_zero_int, &place);
875 test->u.intval = XINT (pattern, i);
879 test = new_decision_test (DT_elt_one_int, &place);
880 test->u.intval = XINT (pattern, i);
885 else if (fmt[i] == 'w')
890 test = new_decision_test (DT_elt_zero_wide, &place);
891 test->u.intval = XWINT (pattern, i);
893 else if (fmt[i] == 'E')
898 test = new_decision_test (DT_veclen, &place);
899 test->u.veclen = XVECLEN (pattern, i);
903 /* Now test our sub-patterns. */
904 for (i = 0; i < (size_t) len; i++)
909 subpos[depth] = '0' + i;
910 sub = add_to_sequence (XEXP (pattern, i), &sub->success,
911 subpos, insn_type, 0);
917 for (j = 0; j < XVECLEN (pattern, i); j++)
919 subpos[depth] = 'a' + j;
920 sub = add_to_sequence (XVECEXP (pattern, i, j),
921 &sub->success, subpos, insn_type, 0);
938 /* Insert nodes testing mode and code, if they're still relevant,
939 before any of the nodes we may have added above. */
942 place = &this->tests;
943 test = new_decision_test (DT_code, &place);
947 if (mode != VOIDmode)
949 place = &this->tests;
950 test = new_decision_test (DT_mode, &place);
954 /* If we didn't insert any tests or accept nodes, hork. */
955 if (this->tests == NULL)
961 /* A subroutine of maybe_both_true; examines only one test.
962 Returns > 0 for "definitely both true" and < 0 for "maybe both true". */
965 maybe_both_true_2 (d1, d2)
966 struct decision_test *d1, *d2;
968 if (d1->type == d2->type)
973 return d1->u.mode == d2->u.mode;
976 return d1->u.code == d2->u.code;
979 return d1->u.veclen == d2->u.veclen;
981 case DT_elt_zero_int:
983 case DT_elt_zero_wide:
984 return d1->u.intval == d2->u.intval;
991 /* If either has a predicate that we know something about, set
992 things up so that D1 is the one that always has a known
993 predicate. Then see if they have any codes in common. */
995 if (d1->type == DT_pred || d2->type == DT_pred)
997 if (d2->type == DT_pred)
999 struct decision_test *tmp;
1000 tmp = d1, d1 = d2, d2 = tmp;
1003 /* If D2 tests a mode, see if it matches D1. */
1004 if (d1->u.pred.mode != VOIDmode)
1006 if (d2->type == DT_mode)
1008 if (d1->u.pred.mode != d2->u.mode
1009 /* The mode of an address_operand predicate is the
1010 mode of the memory, not the operand. It can only
1011 be used for testing the predicate, so we must
1013 && strcmp (d1->u.pred.name, "address_operand") != 0)
1016 /* Don't check two predicate modes here, because if both predicates
1017 accept CONST_INT, then both can still be true even if the modes
1018 are different. If they don't accept CONST_INT, there will be a
1019 separate DT_mode that will make maybe_both_true_1 return 0. */
1022 if (d1->u.pred.index >= 0)
1024 /* If D2 tests a code, see if it is in the list of valid
1025 codes for D1's predicate. */
1026 if (d2->type == DT_code)
1028 const RTX_CODE *c = &preds[d1->u.pred.index].codes[0];
1031 if (*c == d2->u.code)
1039 /* Otherwise see if the predicates have any codes in common. */
1040 else if (d2->type == DT_pred && d2->u.pred.index >= 0)
1042 const RTX_CODE *c1 = &preds[d1->u.pred.index].codes[0];
1045 while (*c1 != 0 && !common)
1047 const RTX_CODE *c2 = &preds[d2->u.pred.index].codes[0];
1048 while (*c2 != 0 && !common)
1050 common = (*c1 == *c2);
1065 /* A subroutine of maybe_both_true; examines all the tests for a given node.
1066 Returns > 0 for "definitely both true" and < 0 for "maybe both true". */
1069 maybe_both_true_1 (d1, d2)
1070 struct decision_test *d1, *d2;
1072 struct decision_test *t1, *t2;
1074 /* A match_operand with no predicate can match anything. Recognize
1075 this by the existance of a lone DT_accept_op test. */
1076 if (d1->type == DT_accept_op || d2->type == DT_accept_op)
1079 /* Eliminate pairs of tests while they can exactly match. */
1080 while (d1 && d2 && d1->type == d2->type)
1082 if (maybe_both_true_2 (d1, d2) == 0)
1084 d1 = d1->next, d2 = d2->next;
1087 /* After that, consider all pairs. */
1088 for (t1 = d1; t1 ; t1 = t1->next)
1089 for (t2 = d2; t2 ; t2 = t2->next)
1090 if (maybe_both_true_2 (t1, t2) == 0)
1096 /* Return 0 if we can prove that there is no RTL that can match both
1097 D1 and D2. Otherwise, return 1 (it may be that there is an RTL that
1098 can match both or just that we couldn't prove there wasn't such an RTL).
1100 TOPLEVEL is non-zero if we are to only look at the top level and not
1101 recursively descend. */
1104 maybe_both_true (d1, d2, toplevel)
1105 struct decision *d1, *d2;
1108 struct decision *p1, *p2;
1111 /* Don't compare strings on the different positions in insn. Doing so
1112 is incorrect and results in false matches from constructs like
1114 [(set (subreg:HI (match_operand:SI "register_operand" "r") 0)
1115 (subreg:HI (match_operand:SI "register_operand" "r") 0))]
1117 [(set (match_operand:HI "register_operand" "r")
1118 (match_operand:HI "register_operand" "r"))]
1120 If we are presented with such, we are recursing through the remainder
1121 of a node's success nodes (from the loop at the end of this function).
1122 Skip forward until we come to a position that matches.
1124 Due to the way position strings are constructed, we know that iterating
1125 forward from the lexically lower position (e.g. "00") will run into
1126 the lexically higher position (e.g. "1") and not the other way around.
1127 This saves a bit of effort. */
1129 cmp = strcmp (d1->position, d2->position);
1135 /* If the d2->position was lexically lower, swap. */
1137 p1 = d1, d1 = d2, d2 = p1;
1139 if (d1->success.first == 0)
1141 for (p1 = d1->success.first; p1; p1 = p1->next)
1142 if (maybe_both_true (p1, d2, 0))
1148 /* Test the current level. */
1149 cmp = maybe_both_true_1 (d1->tests, d2->tests);
1153 /* We can't prove that D1 and D2 cannot both be true. If we are only
1154 to check the top level, return 1. Otherwise, see if we can prove
1155 that all choices in both successors are mutually exclusive. If
1156 either does not have any successors, we can't prove they can't both
1159 if (toplevel || d1->success.first == 0 || d2->success.first == 0)
1162 for (p1 = d1->success.first; p1; p1 = p1->next)
1163 for (p2 = d2->success.first; p2; p2 = p2->next)
1164 if (maybe_both_true (p1, p2, 0))
1170 /* A subroutine of nodes_identical. Examine two tests for equivalence. */
1173 nodes_identical_1 (d1, d2)
1174 struct decision_test *d1, *d2;
1179 return d1->u.mode == d2->u.mode;
1182 return d1->u.code == d2->u.code;
1185 return (d1->u.pred.mode == d2->u.pred.mode
1186 && strcmp (d1->u.pred.name, d2->u.pred.name) == 0);
1189 return strcmp (d1->u.c_test, d2->u.c_test) == 0;
1192 return d1->u.veclen == d2->u.veclen;
1195 return d1->u.dup == d2->u.dup;
1197 case DT_elt_zero_int:
1198 case DT_elt_one_int:
1199 case DT_elt_zero_wide:
1200 return d1->u.intval == d2->u.intval;
1203 return d1->u.opno == d2->u.opno;
1205 case DT_accept_insn:
1206 /* Differences will be handled in merge_accept_insn. */
1214 /* True iff the two nodes are identical (on one level only). Due
1215 to the way these lists are constructed, we shouldn't have to
1216 consider different orderings on the tests. */
1219 nodes_identical (d1, d2)
1220 struct decision *d1, *d2;
1222 struct decision_test *t1, *t2;
1224 for (t1 = d1->tests, t2 = d2->tests; t1 && t2; t1 = t1->next, t2 = t2->next)
1226 if (t1->type != t2->type)
1228 if (! nodes_identical_1 (t1, t2))
1232 /* For success, they should now both be null. */
1236 /* Check that their subnodes are at the same position, as any one set
1237 of sibling decisions must be at the same position. */
1238 if (d1->success.first
1239 && d2->success.first
1240 && strcmp (d1->success.first->position, d2->success.first->position))
1246 /* A subroutine of merge_trees; given two nodes that have been declared
1247 identical, cope with two insn accept states. If they differ in the
1248 number of clobbers, then the conflict was created by make_insn_sequence
1249 and we can drop the with-clobbers version on the floor. If both
1250 nodes have no additional clobbers, we have found an ambiguity in the
1251 source machine description. */
1254 merge_accept_insn (oldd, addd)
1255 struct decision *oldd, *addd;
1257 struct decision_test *old, *add;
1259 for (old = oldd->tests; old; old = old->next)
1260 if (old->type == DT_accept_insn)
1265 for (add = addd->tests; add; add = add->next)
1266 if (add->type == DT_accept_insn)
1271 /* If one node is for a normal insn and the second is for the base
1272 insn with clobbers stripped off, the second node should be ignored. */
1274 if (old->u.insn.num_clobbers_to_add == 0
1275 && add->u.insn.num_clobbers_to_add > 0)
1277 /* Nothing to do here. */
1279 else if (old->u.insn.num_clobbers_to_add > 0
1280 && add->u.insn.num_clobbers_to_add == 0)
1282 /* In this case, replace OLD with ADD. */
1283 old->u.insn = add->u.insn;
1287 message_with_line (add->u.insn.lineno, "`%s' matches `%s'",
1288 get_insn_name (add->u.insn.code_number),
1289 get_insn_name (old->u.insn.code_number));
1290 message_with_line (old->u.insn.lineno, "previous definition of `%s'",
1291 get_insn_name (old->u.insn.code_number));
1296 /* Merge two decision trees OLDH and ADDH, modifying OLDH destructively. */
1299 merge_trees (oldh, addh)
1300 struct decision_head *oldh, *addh;
1302 struct decision *next, *add;
1304 if (addh->first == 0)
1306 if (oldh->first == 0)
1312 /* Trying to merge bits at different positions isn't possible. */
1313 if (strcmp (oldh->first->position, addh->first->position))
1316 for (add = addh->first; add ; add = next)
1318 struct decision *old, *insert_before = NULL;
1322 /* The semantics of pattern matching state that the tests are
1323 done in the order given in the MD file so that if an insn
1324 matches two patterns, the first one will be used. However,
1325 in practice, most, if not all, patterns are unambiguous so
1326 that their order is independent. In that case, we can merge
1327 identical tests and group all similar modes and codes together.
1329 Scan starting from the end of OLDH until we reach a point
1330 where we reach the head of the list or where we pass a
1331 pattern that could also be true if NEW is true. If we find
1332 an identical pattern, we can merge them. Also, record the
1333 last node that tests the same code and mode and the last one
1334 that tests just the same mode.
1336 If we have no match, place NEW after the closest match we found. */
1338 for (old = oldh->last; old; old = old->prev)
1340 if (nodes_identical (old, add))
1342 merge_accept_insn (old, add);
1343 merge_trees (&old->success, &add->success);
1347 if (maybe_both_true (old, add, 0))
1350 /* Insert the nodes in DT test type order, which is roughly
1351 how expensive/important the test is. Given that the tests
1352 are also ordered within the list, examining the first is
1354 if (add->tests->type < old->tests->type)
1355 insert_before = old;
1358 if (insert_before == NULL)
1361 add->prev = oldh->last;
1362 oldh->last->next = add;
1367 if ((add->prev = insert_before->prev) != NULL)
1368 add->prev->next = add;
1371 add->next = insert_before;
1372 insert_before->prev = add;
1379 /* Walk the tree looking for sub-nodes that perform common tests.
1380 Factor out the common test into a new node. This enables us
1381 (depending on the test type) to emit switch statements later. */
1385 struct decision_head *head;
1387 struct decision *first, *next;
1389 for (first = head->first; first && first->next; first = next)
1391 enum decision_type type;
1392 struct decision *new, *old_last;
1394 type = first->tests->type;
1397 /* Want at least two compatible sequential nodes. */
1398 if (next->tests->type != type)
1401 /* Don't want all node types, just those we can turn into
1402 switch statements. */
1405 && type != DT_veclen
1406 && type != DT_elt_zero_int
1407 && type != DT_elt_one_int
1408 && type != DT_elt_zero_wide)
1411 /* If we'd been performing more than one test, create a new node
1412 below our first test. */
1413 if (first->tests->next != NULL)
1415 new = new_decision (first->position, &first->success);
1416 new->tests = first->tests->next;
1417 first->tests->next = NULL;
1420 /* Crop the node tree off after our first test. */
1422 old_last = head->last;
1425 /* For each compatible test, adjust to perform only one test in
1426 the top level node, then merge the node back into the tree. */
1429 struct decision_head h;
1431 if (next->tests->next != NULL)
1433 new = new_decision (next->position, &next->success);
1434 new->tests = next->tests->next;
1435 next->tests->next = NULL;
1440 h.first = h.last = new;
1442 merge_trees (head, &h);
1444 while (next && next->tests->type == type);
1446 /* After we run out of compatible tests, graft the remaining nodes
1447 back onto the tree. */
1450 next->prev = head->last;
1451 head->last->next = next;
1452 head->last = old_last;
1457 for (first = head->first; first; first = first->next)
1458 factor_tests (&first->success);
1461 /* After factoring, try to simplify the tests on any one node.
1462 Tests that are useful for switch statements are recognizable
1463 by having only a single test on a node -- we'll be manipulating
1464 nodes with multiple tests:
1466 If we have mode tests or code tests that are redundant with
1467 predicates, remove them. */
1470 simplify_tests (head)
1471 struct decision_head *head;
1473 struct decision *tree;
1475 for (tree = head->first; tree; tree = tree->next)
1477 struct decision_test *a, *b;
1484 /* Find a predicate node. */
1485 while (b && b->type != DT_pred)
1489 /* Due to how these tests are constructed, we don't even need
1490 to check that the mode and code are compatible -- they were
1491 generated from the predicate in the first place. */
1492 while (a->type == DT_mode || a->type == DT_code)
1499 for (tree = head->first; tree; tree = tree->next)
1500 simplify_tests (&tree->success);
1503 /* Count the number of subnodes of HEAD. If the number is high enough,
1504 make the first node in HEAD start a separate subroutine in the C code
1505 that is generated. */
1508 break_out_subroutines (head, initial)
1509 struct decision_head *head;
1513 struct decision *sub;
1515 for (sub = head->first; sub; sub = sub->next)
1516 size += 1 + break_out_subroutines (&sub->success, 0);
1518 if (size > SUBROUTINE_THRESHOLD && ! initial)
1520 head->first->subroutine_number = ++next_subroutine_number;
1526 /* For each node p, find the next alternative that might be true
1530 find_afterward (head, real_afterward)
1531 struct decision_head *head;
1532 struct decision *real_afterward;
1534 struct decision *p, *q, *afterward;
1536 /* We can't propogate alternatives across subroutine boundaries.
1537 This is not incorrect, merely a minor optimization loss. */
1540 afterward = (p->subroutine_number > 0 ? NULL : real_afterward);
1542 for ( ; p ; p = p->next)
1544 /* Find the next node that might be true if this one fails. */
1545 for (q = p->next; q ; q = q->next)
1546 if (maybe_both_true (p, q, 1))
1549 /* If we reached the end of the list without finding one,
1550 use the incoming afterward position. */
1559 for (p = head->first; p ; p = p->next)
1560 if (p->success.first)
1561 find_afterward (&p->success, p->afterward);
1563 /* When we are generating a subroutine, record the real afterward
1564 position in the first node where write_tree can find it, and we
1565 can do the right thing at the subroutine call site. */
1567 if (p->subroutine_number > 0)
1568 p->afterward = real_afterward;
1571 /* Assuming that the state of argument is denoted by OLDPOS, take whatever
1572 actions are necessary to move to NEWPOS. If we fail to move to the
1573 new state, branch to node AFTERWARD if non-zero, otherwise return.
1575 Failure to move to the new state can only occur if we are trying to
1576 match multiple insns and we try to step past the end of the stream. */
1579 change_state (oldpos, newpos, afterward, indent)
1582 struct decision *afterward;
1585 int odepth = strlen (oldpos);
1586 int ndepth = strlen (newpos);
1588 int old_has_insn, new_has_insn;
1590 /* Pop up as many levels as necessary. */
1591 for (depth = odepth; strncmp (oldpos, newpos, depth) != 0; --depth)
1594 /* Hunt for the last [A-Z] in both strings. */
1595 for (old_has_insn = odepth - 1; old_has_insn >= 0; --old_has_insn)
1596 if (oldpos[old_has_insn] >= 'A' && oldpos[old_has_insn] <= 'Z')
1598 for (new_has_insn = ndepth - 1; new_has_insn >= 0; --new_has_insn)
1599 if (newpos[new_has_insn] >= 'A' && newpos[new_has_insn] <= 'Z')
1602 /* Go down to desired level. */
1603 while (depth < ndepth)
1605 /* It's a different insn from the first one. */
1606 if (newpos[depth] >= 'A' && newpos[depth] <= 'Z')
1608 /* We can only fail if we're moving down the tree. */
1609 if (old_has_insn >= 0 && oldpos[old_has_insn] >= newpos[depth])
1611 printf ("%stem = peep2_next_insn (%d);\n",
1612 indent, newpos[depth] - 'A');
1616 printf ("%stem = peep2_next_insn (%d);\n",
1617 indent, newpos[depth] - 'A');
1618 printf ("%sif (tem == NULL_RTX)\n", indent);
1620 printf ("%s goto L%d;\n", indent, afterward->number);
1622 printf ("%s goto ret0;\n", indent);
1624 printf ("%sx%d = PATTERN (tem);\n", indent, depth + 1);
1626 else if (newpos[depth] >= 'a' && newpos[depth] <= 'z')
1627 printf ("%sx%d = XVECEXP (x%d, 0, %d);\n",
1628 indent, depth + 1, depth, newpos[depth] - 'a');
1630 printf ("%sx%d = XEXP (x%d, %c);\n",
1631 indent, depth + 1, depth, newpos[depth]);
1636 /* Print the enumerator constant for CODE -- the upcase version of
1643 register const char *p;
1644 for (p = GET_RTX_NAME (code); *p; p++)
1645 putchar (TOUPPER (*p));
1648 /* Emit code to cross an afterward link -- change state and branch. */
1651 write_afterward (start, afterward, indent)
1652 struct decision *start;
1653 struct decision *afterward;
1656 if (!afterward || start->subroutine_number > 0)
1657 printf("%sgoto ret0;\n", indent);
1660 change_state (start->position, afterward->position, NULL, indent);
1661 printf ("%sgoto L%d;\n", indent, afterward->number);
1665 /* Emit a switch statement, if possible, for an initial sequence of
1666 nodes at START. Return the first node yet untested. */
1668 static struct decision *
1669 write_switch (start, depth)
1670 struct decision *start;
1673 struct decision *p = start;
1674 enum decision_type type = p->tests->type;
1675 struct decision *needs_label = NULL;
1677 /* If we have two or more nodes in sequence that test the same one
1678 thing, we may be able to use a switch statement. */
1682 || p->next->tests->type != type
1683 || p->next->tests->next)
1686 /* DT_code is special in that we can do interesting things with
1687 known predicates at the same time. */
1688 if (type == DT_code)
1690 char codemap[NUM_RTX_CODE];
1691 struct decision *ret;
1694 memset (codemap, 0, sizeof(codemap));
1696 printf (" switch (GET_CODE (x%d))\n {\n", depth);
1697 code = p->tests->u.code;
1700 if (p != start && p->need_label && needs_label == NULL)
1705 printf (":\n goto L%d;\n", p->success.first->number);
1706 p->success.first->need_label = 1;
1713 && p->tests->type == DT_code
1714 && ! codemap[code = p->tests->u.code]);
1716 /* If P is testing a predicate that we know about and we haven't
1717 seen any of the codes that are valid for the predicate, we can
1718 write a series of "case" statement, one for each possible code.
1719 Since we are already in a switch, these redundant tests are very
1720 cheap and will reduce the number of predicates called. */
1722 /* Note that while we write out cases for these predicates here,
1723 we don't actually write the test here, as it gets kinda messy.
1724 It is trivial to leave this to later by telling our caller that
1725 we only processed the CODE tests. */
1726 if (needs_label != NULL)
1731 while (p && p->tests->type == DT_pred
1732 && p->tests->u.pred.index >= 0)
1736 for (c = &preds[p->tests->u.pred.index].codes[0]; *c ; ++c)
1737 if (codemap[(int) *c] != 0)
1740 for (c = &preds[p->tests->u.pred.index].codes[0]; *c ; ++c)
1745 codemap[(int) *c] = 1;
1748 printf (" goto L%d;\n", p->number);
1754 /* Make the default case skip the predicates we managed to match. */
1756 printf (" default:\n");
1761 printf (" goto L%d;\n", p->number);
1765 write_afterward (start, start->afterward, " ");
1768 printf (" break;\n");
1773 else if (type == DT_mode
1774 || type == DT_veclen
1775 || type == DT_elt_zero_int
1776 || type == DT_elt_one_int
1777 || type == DT_elt_zero_wide)
1779 printf (" switch (");
1783 printf ("GET_MODE (x%d)", depth);
1786 printf ("XVECLEN (x%d, 0)", depth);
1788 case DT_elt_zero_int:
1789 printf ("XINT (x%d, 0)", depth);
1791 case DT_elt_one_int:
1792 printf ("XINT (x%d, 1)", depth);
1794 case DT_elt_zero_wide:
1795 /* Convert result of XWINT to int for portability since some C
1796 compilers won't do it and some will. */
1797 printf ("(int) XWINT (x%d, 0)", depth);
1806 if (p != start && p->need_label && needs_label == NULL)
1813 printf ("%smode", GET_MODE_NAME (p->tests->u.mode));
1816 printf ("%d", p->tests->u.veclen);
1818 case DT_elt_zero_int:
1819 case DT_elt_one_int:
1820 case DT_elt_zero_wide:
1821 printf (HOST_WIDE_INT_PRINT_DEC, p->tests->u.intval);
1826 printf (":\n goto L%d;\n", p->success.first->number);
1827 p->success.first->need_label = 1;
1831 while (p && p->tests->type == type && !p->tests->next);
1833 printf (" default:\n break;\n }\n");
1835 return needs_label != NULL ? needs_label : p;
1839 /* None of the other tests are ameanable. */
1844 /* Emit code for one test. */
1847 write_cond (p, depth, subroutine_type)
1848 struct decision_test *p;
1850 enum routine_type subroutine_type;
1855 printf ("GET_MODE (x%d) == %smode", depth, GET_MODE_NAME (p->u.mode));
1859 printf ("GET_CODE (x%d) == ", depth);
1860 print_code (p->u.code);
1864 printf ("XVECLEN (x%d, 0) == %d", depth, p->u.veclen);
1867 case DT_elt_zero_int:
1868 printf ("XINT (x%d, 0) == %d", depth, (int) p->u.intval);
1871 case DT_elt_one_int:
1872 printf ("XINT (x%d, 1) == %d", depth, (int) p->u.intval);
1875 case DT_elt_zero_wide:
1876 printf ("XWINT (x%d, 0) == ", depth);
1877 printf (HOST_WIDE_INT_PRINT_DEC, p->u.intval);
1881 printf ("rtx_equal_p (x%d, operands[%d])", depth, p->u.dup);
1885 printf ("%s (x%d, %smode)", p->u.pred.name, depth,
1886 GET_MODE_NAME (p->u.pred.mode));
1890 printf ("(%s)", p->u.c_test);
1893 case DT_accept_insn:
1894 switch (subroutine_type)
1897 if (p->u.insn.num_clobbers_to_add == 0)
1899 printf ("pnum_clobbers != NULL");
1912 /* Emit code for one action. The previous tests have succeeded;
1913 TEST is the last of the chain. In the normal case we simply
1914 perform a state change. For the `accept' tests we must do more work. */
1917 write_action (p, test, depth, uncond, success, subroutine_type)
1919 struct decision_test *test;
1921 struct decision *success;
1922 enum routine_type subroutine_type;
1929 else if (test->type == DT_accept_op || test->type == DT_accept_insn)
1931 fputs (" {\n", stdout);
1938 if (test->type == DT_accept_op)
1940 printf("%soperands[%d] = x%d;\n", indent, test->u.opno, depth);
1942 /* Only allow DT_accept_insn to follow. */
1946 if (test->type != DT_accept_insn)
1951 /* Sanity check that we're now at the end of the list of tests. */
1955 if (test->type == DT_accept_insn)
1957 switch (subroutine_type)
1960 if (test->u.insn.num_clobbers_to_add != 0)
1961 printf ("%s*pnum_clobbers = %d;\n",
1962 indent, test->u.insn.num_clobbers_to_add);
1963 printf ("%sreturn %d;\n", indent, test->u.insn.code_number);
1967 printf ("%sreturn gen_split_%d (operands);\n",
1968 indent, test->u.insn.code_number);
1973 int match_len = 0, i;
1975 for (i = strlen (p->position) - 1; i >= 0; --i)
1976 if (p->position[i] >= 'A' && p->position[i] <= 'Z')
1978 match_len = p->position[i] - 'A';
1981 printf ("%s*_pmatch_len = %d;\n", indent, match_len);
1982 printf ("%stem = gen_peephole2_%d (insn, operands);\n",
1983 indent, test->u.insn.code_number);
1984 printf ("%sif (tem != 0)\n%s return tem;\n", indent, indent);
1994 printf("%sgoto L%d;\n", indent, success->number);
1995 success->need_label = 1;
1999 fputs (" }\n", stdout);
2002 /* Return 1 if the test is always true and has no fallthru path. Return -1
2003 if the test does have a fallthru path, but requires that the condition be
2004 terminated. Otherwise return 0 for a normal test. */
2005 /* ??? is_unconditional is a stupid name for a tri-state function. */
2008 is_unconditional (t, subroutine_type)
2009 struct decision_test *t;
2010 enum routine_type subroutine_type;
2012 if (t->type == DT_accept_op)
2015 if (t->type == DT_accept_insn)
2017 switch (subroutine_type)
2020 return (t->u.insn.num_clobbers_to_add == 0);
2033 /* Emit code for one node -- the conditional and the accompanying action.
2034 Return true if there is no fallthru path. */
2037 write_node (p, depth, subroutine_type)
2040 enum routine_type subroutine_type;
2042 struct decision_test *test, *last_test;
2045 last_test = test = p->tests;
2046 uncond = is_unconditional (test, subroutine_type);
2050 write_cond (test, depth, subroutine_type);
2052 while ((test = test->next) != NULL)
2057 uncond2 = is_unconditional (test, subroutine_type);
2062 write_cond (test, depth, subroutine_type);
2068 write_action (p, last_test, depth, uncond, p->success.first, subroutine_type);
2073 /* Emit code for all of the sibling nodes of HEAD. */
2076 write_tree_1 (head, depth, subroutine_type)
2077 struct decision_head *head;
2079 enum routine_type subroutine_type;
2081 struct decision *p, *next;
2084 for (p = head->first; p ; p = next)
2086 /* The label for the first element was printed in write_tree. */
2087 if (p != head->first && p->need_label)
2088 OUTPUT_LABEL (" ", p->number);
2090 /* Attempt to write a switch statement for a whole sequence. */
2091 next = write_switch (p, depth);
2096 /* Failed -- fall back and write one node. */
2097 uncond = write_node (p, depth, subroutine_type);
2102 /* Finished with this chain. Close a fallthru path by branching
2103 to the afterward node. */
2105 write_afterward (head->last, head->last->afterward, " ");
2108 /* Write out the decision tree starting at HEAD. PREVPOS is the
2109 position at the node that branched to this node. */
2112 write_tree (head, prevpos, type, initial)
2113 struct decision_head *head;
2114 const char *prevpos;
2115 enum routine_type type;
2118 register struct decision *p = head->first;
2122 OUTPUT_LABEL (" ", p->number);
2124 if (! initial && p->subroutine_number > 0)
2126 static const char * const name_prefix[] = {
2127 "recog", "split", "peephole2"
2130 static const char * const call_suffix[] = {
2131 ", pnum_clobbers", "", ", _pmatch_len"
2134 /* This node has been broken out into a separate subroutine.
2135 Call it, test the result, and branch accordingly. */
2139 printf (" tem = %s_%d (x0, insn%s);\n",
2140 name_prefix[type], p->subroutine_number, call_suffix[type]);
2141 if (IS_SPLIT (type))
2142 printf (" if (tem != 0)\n return tem;\n");
2144 printf (" if (tem >= 0)\n return tem;\n");
2146 change_state (p->position, p->afterward->position, NULL, " ");
2147 printf (" goto L%d;\n", p->afterward->number);
2151 printf (" return %s_%d (x0, insn%s);\n",
2152 name_prefix[type], p->subroutine_number, call_suffix[type]);
2157 int depth = strlen (p->position);
2159 change_state (prevpos, p->position, head->last->afterward, " ");
2160 write_tree_1 (head, depth, type);
2162 for (p = head->first; p; p = p->next)
2163 if (p->success.first)
2164 write_tree (&p->success, p->position, type, 0);
2168 /* Write out a subroutine of type TYPE to do comparisons starting at
2172 write_subroutine (head, type)
2173 struct decision_head *head;
2174 enum routine_type type;
2176 int subfunction = head->first ? head->first->subroutine_number : 0;
2181 s_or_e = subfunction ? "static " : "";
2184 sprintf (extension, "_%d", subfunction);
2185 else if (type == RECOG)
2186 extension[0] = '\0';
2188 strcpy (extension, "_insns");
2193 printf ("%sint recog%s PARAMS ((rtx, rtx, int *));\n", s_or_e, extension);
2195 recog%s (x0, insn, pnum_clobbers)\n\
2197 rtx insn ATTRIBUTE_UNUSED;\n\
2198 int *pnum_clobbers ATTRIBUTE_UNUSED;\n", s_or_e, extension);
2201 printf ("%srtx split%s PARAMS ((rtx, rtx));\n", s_or_e, extension);
2203 split%s (x0, insn)\n\
2205 rtx insn ATTRIBUTE_UNUSED;\n", s_or_e, extension);
2208 printf ("%srtx peephole2%s PARAMS ((rtx, rtx, int *));\n",
2211 peephole2%s (x0, insn, _pmatch_len)\n\
2213 rtx insn ATTRIBUTE_UNUSED;\n\
2214 int *_pmatch_len ATTRIBUTE_UNUSED;\n", s_or_e, extension);
2218 printf ("{\n register rtx * const operands ATTRIBUTE_UNUSED = &recog_data.operand[0];\n");
2219 for (i = 1; i <= max_depth; i++)
2220 printf (" register rtx x%d ATTRIBUTE_UNUSED;\n", i);
2222 printf (" %s tem ATTRIBUTE_UNUSED;\n", IS_SPLIT (type) ? "rtx" : "int");
2225 printf (" recog_data.insn = NULL_RTX;\n");
2228 write_tree (head, "", type, 1);
2230 printf (" goto ret0;\n");
2232 printf (" ret0:\n return %d;\n}\n\n", IS_SPLIT (type) ? 0 : -1);
2235 /* In break_out_subroutines, we discovered the boundaries for the
2236 subroutines, but did not write them out. Do so now. */
2239 write_subroutines (head, type)
2240 struct decision_head *head;
2241 enum routine_type type;
2245 for (p = head->first; p ; p = p->next)
2246 if (p->success.first)
2247 write_subroutines (&p->success, type);
2249 if (head->first->subroutine_number > 0)
2250 write_subroutine (head, type);
2253 /* Begin the output file. */
2259 /* Generated automatically by the program `genrecog' from the target\n\
2260 machine description file. */\n\
2262 #include \"config.h\"\n\
2263 #include \"system.h\"\n\
2264 #include \"rtl.h\"\n\
2265 #include \"tm_p.h\"\n\
2266 #include \"function.h\"\n\
2267 #include \"insn-config.h\"\n\
2268 #include \"recog.h\"\n\
2269 #include \"real.h\"\n\
2270 #include \"output.h\"\n\
2271 #include \"flags.h\"\n\
2272 #include \"hard-reg-set.h\"\n\
2273 #include \"resource.h\"\n\
2277 /* `recog' contains a decision tree that recognizes whether the rtx\n\
2278 X0 is a valid instruction.\n\
2280 recog returns -1 if the rtx is not valid. If the rtx is valid, recog\n\
2281 returns a nonnegative number which is the insn code number for the\n\
2282 pattern that matched. This is the same as the order in the machine\n\
2283 description of the entry that matched. This number can be used as an\n\
2284 index into `insn_data' and other tables.\n");
2286 The third argument to recog is an optional pointer to an int. If\n\
2287 present, recog will accept a pattern if it matches except for missing\n\
2288 CLOBBER expressions at the end. In that case, the value pointed to by\n\
2289 the optional pointer will be set to the number of CLOBBERs that need\n\
2290 to be added (it should be initialized to zero by the caller). If it");
2292 is set nonzero, the caller should allocate a PARALLEL of the\n\
2293 appropriate size, copy the initial entries, and call add_clobbers\n\
2294 (found in insn-emit.c) to fill in the CLOBBERs.\n\
2298 The function split_insns returns 0 if the rtl could not\n\
2299 be split or the split rtl in a SEQUENCE if it can be.\n\
2301 The function peephole2_insns returns 0 if the rtl could not\n\
2302 be matched. If there was a match, the new rtl is returned in a SEQUENCE,\n\
2303 and LAST_INSN will point to the last recognized insn in the old sequence.\n\
2308 /* Construct and return a sequence of decisions
2309 that will recognize INSN.
2311 TYPE says what type of routine we are recognizing (RECOG or SPLIT). */
2313 static struct decision_head
2314 make_insn_sequence (insn, type)
2316 enum routine_type type;
2319 const char *c_test = XSTR (insn, type == RECOG ? 2 : 1);
2320 struct decision *last;
2321 struct decision_test *test, **place;
2322 struct decision_head head;
2325 record_insn_name (next_insn_code, (type == RECOG ? XSTR (insn, 0) : NULL));
2327 c_test_pos[0] = '\0';
2328 if (type == PEEPHOLE2)
2332 /* peephole2 gets special treatment:
2333 - X always gets an outer parallel even if it's only one entry
2334 - we remove all traces of outer-level match_scratch and match_dup
2335 expressions here. */
2336 x = rtx_alloc (PARALLEL);
2337 PUT_MODE (x, VOIDmode);
2338 XVEC (x, 0) = rtvec_alloc (XVECLEN (insn, 0));
2339 for (i = j = 0; i < XVECLEN (insn, 0); i++)
2341 rtx tmp = XVECEXP (insn, 0, i);
2342 if (GET_CODE (tmp) != MATCH_SCRATCH && GET_CODE (tmp) != MATCH_DUP)
2344 XVECEXP (x, 0, j) = tmp;
2350 c_test_pos[0] = 'A' + j - 1;
2351 c_test_pos[1] = '\0';
2353 else if (XVECLEN (insn, type == RECOG) == 1)
2354 x = XVECEXP (insn, type == RECOG, 0);
2357 x = rtx_alloc (PARALLEL);
2358 XVEC (x, 0) = XVEC (insn, type == RECOG);
2359 PUT_MODE (x, VOIDmode);
2362 validate_pattern (x, insn, NULL_RTX, 0);
2364 memset(&head, 0, sizeof(head));
2365 last = add_to_sequence (x, &head, "", type, 1);
2367 /* Find the end of the test chain on the last node. */
2368 for (test = last->tests; test->next; test = test->next)
2370 place = &test->next;
2374 /* Need a new node if we have another test to add. */
2375 if (test->type == DT_accept_op)
2377 last = new_decision (c_test_pos, &last->success);
2378 place = &last->tests;
2380 test = new_decision_test (DT_c_test, &place);
2381 test->u.c_test = c_test;
2384 test = new_decision_test (DT_accept_insn, &place);
2385 test->u.insn.code_number = next_insn_code;
2386 test->u.insn.lineno = pattern_lineno;
2387 test->u.insn.num_clobbers_to_add = 0;
2392 /* If this is an DEFINE_INSN and X is a PARALLEL, see if it ends
2393 with a group of CLOBBERs of (hard) registers or MATCH_SCRATCHes.
2394 If so, set up to recognize the pattern without these CLOBBERs. */
2396 if (GET_CODE (x) == PARALLEL)
2400 /* Find the last non-clobber in the parallel. */
2401 for (i = XVECLEN (x, 0); i > 0; i--)
2403 rtx y = XVECEXP (x, 0, i - 1);
2404 if (GET_CODE (y) != CLOBBER
2405 || (GET_CODE (XEXP (y, 0)) != REG
2406 && GET_CODE (XEXP (y, 0)) != MATCH_SCRATCH))
2410 if (i != XVECLEN (x, 0))
2413 struct decision_head clobber_head;
2415 /* Build a similar insn without the clobbers. */
2417 new = XVECEXP (x, 0, 0);
2422 new = rtx_alloc (PARALLEL);
2423 XVEC (new, 0) = rtvec_alloc (i);
2424 for (j = i - 1; j >= 0; j--)
2425 XVECEXP (new, 0, j) = XVECEXP (x, 0, j);
2429 memset (&clobber_head, 0, sizeof(clobber_head));
2430 last = add_to_sequence (new, &clobber_head, "", type, 1);
2432 /* Find the end of the test chain on the last node. */
2433 for (test = last->tests; test->next; test = test->next)
2436 /* We definitely have a new test to add -- create a new
2438 place = &test->next;
2439 if (test->type == DT_accept_op)
2441 last = new_decision ("", &last->success);
2442 place = &last->tests;
2447 test = new_decision_test (DT_c_test, &place);
2448 test->u.c_test = c_test;
2451 test = new_decision_test (DT_accept_insn, &place);
2452 test->u.insn.code_number = next_insn_code;
2453 test->u.insn.lineno = pattern_lineno;
2454 test->u.insn.num_clobbers_to_add = XVECLEN (x, 0) - i;
2456 merge_trees (&head, &clobber_head);
2462 /* Define the subroutine we will call below and emit in genemit. */
2463 printf ("extern rtx gen_split_%d PARAMS ((rtx *));\n", next_insn_code);
2467 /* Define the subroutine we will call below and emit in genemit. */
2468 printf ("extern rtx gen_peephole2_%d PARAMS ((rtx, rtx *));\n",
2477 process_tree (head, subroutine_type)
2478 struct decision_head *head;
2479 enum routine_type subroutine_type;
2481 if (head->first == NULL)
2483 /* We can elide peephole2_insns, but not recog or split_insns. */
2484 if (subroutine_type == PEEPHOLE2)
2489 factor_tests (head);
2491 next_subroutine_number = 0;
2492 break_out_subroutines (head, 1);
2493 find_afterward (head, NULL);
2495 /* We run this after find_afterward, because find_afterward needs
2496 the redundant DT_mode tests on predicates to determine whether
2497 two tests can both be true or not. */
2498 simplify_tests(head);
2500 write_subroutines (head, subroutine_type);
2503 write_subroutine (head, subroutine_type);
2506 extern int main PARAMS ((int, char **));
2514 struct decision_head recog_tree, split_tree, peephole2_tree, h;
2516 progname = "genrecog";
2518 memset (&recog_tree, 0, sizeof recog_tree);
2519 memset (&split_tree, 0, sizeof split_tree);
2520 memset (&peephole2_tree, 0, sizeof peephole2_tree);
2523 fatal ("No input file name.");
2525 if (init_md_reader (argv[1]) != SUCCESS_EXIT_CODE)
2526 return (FATAL_EXIT_CODE);
2533 /* Read the machine description. */
2537 desc = read_md_rtx (&pattern_lineno, &next_insn_code);
2541 if (GET_CODE (desc) == DEFINE_INSN)
2543 h = make_insn_sequence (desc, RECOG);
2544 merge_trees (&recog_tree, &h);
2546 else if (GET_CODE (desc) == DEFINE_SPLIT)
2548 h = make_insn_sequence (desc, SPLIT);
2549 merge_trees (&split_tree, &h);
2551 else if (GET_CODE (desc) == DEFINE_PEEPHOLE2)
2553 h = make_insn_sequence (desc, PEEPHOLE2);
2554 merge_trees (&peephole2_tree, &h);
2561 return FATAL_EXIT_CODE;
2565 process_tree (&recog_tree, RECOG);
2566 process_tree (&split_tree, SPLIT);
2567 process_tree (&peephole2_tree, PEEPHOLE2);
2570 return (ferror (stdout) != 0 ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE);
2573 /* Define this so we can link with print-rtl.o to get debug_rtx function. */
2575 get_insn_name (code)
2578 if (code < insn_name_ptr_size)
2579 return insn_name_ptr[code];
2585 record_insn_name (code, name)
2589 static const char *last_real_name = "insn";
2590 static int last_real_code = 0;
2593 if (insn_name_ptr_size <= code)
2596 new_size = (insn_name_ptr_size ? insn_name_ptr_size * 2 : 512);
2598 (char **) xrealloc (insn_name_ptr, sizeof(char *) * new_size);
2599 memset (insn_name_ptr + insn_name_ptr_size, 0,
2600 sizeof(char *) * (new_size - insn_name_ptr_size));
2601 insn_name_ptr_size = new_size;
2604 if (!name || name[0] == '\0')
2606 new = xmalloc (strlen (last_real_name) + 10);
2607 sprintf (new, "%s+%d", last_real_name, code - last_real_code);
2611 last_real_name = new = xstrdup (name);
2612 last_real_code = code;
2615 insn_name_ptr[code] = new;
2619 debug_decision_2 (test)
2620 struct decision_test *test;
2625 fprintf (stderr, "mode=%s", GET_MODE_NAME (test->u.mode));
2628 fprintf (stderr, "code=%s", GET_RTX_NAME (test->u.code));
2631 fprintf (stderr, "veclen=%d", test->u.veclen);
2633 case DT_elt_zero_int:
2634 fprintf (stderr, "elt0_i=%d", (int) test->u.intval);
2636 case DT_elt_one_int:
2637 fprintf (stderr, "elt1_i=%d", (int) test->u.intval);
2639 case DT_elt_zero_wide:
2640 fprintf (stderr, "elt0_w=");
2641 fprintf (stderr, HOST_WIDE_INT_PRINT_DEC, test->u.intval);
2644 fprintf (stderr, "dup=%d", test->u.dup);
2647 fprintf (stderr, "pred=(%s,%s)",
2648 test->u.pred.name, GET_MODE_NAME(test->u.pred.mode));
2653 strncpy (sub, test->u.c_test, sizeof(sub));
2654 memcpy (sub+16, "...", 4);
2655 fprintf (stderr, "c_test=\"%s\"", sub);
2659 fprintf (stderr, "A_op=%d", test->u.opno);
2661 case DT_accept_insn:
2662 fprintf (stderr, "A_insn=(%d,%d)",
2663 test->u.insn.code_number, test->u.insn.num_clobbers_to_add);
2672 debug_decision_1 (d, indent)
2677 struct decision_test *test;
2681 for (i = 0; i < indent; ++i)
2683 fputs ("(nil)\n", stderr);
2687 for (i = 0; i < indent; ++i)
2694 debug_decision_2 (test);
2695 while ((test = test->next) != NULL)
2697 fputs (" + ", stderr);
2698 debug_decision_2 (test);
2701 fprintf (stderr, "} %d n %d a %d\n", d->number,
2702 (d->next ? d->next->number : -1),
2703 (d->afterward ? d->afterward->number : -1));
2707 debug_decision_0 (d, indent, maxdepth)
2709 int indent, maxdepth;
2718 for (i = 0; i < indent; ++i)
2720 fputs ("(nil)\n", stderr);
2724 debug_decision_1 (d, indent);
2725 for (n = d->success.first; n ; n = n->next)
2726 debug_decision_0 (n, indent + 2, maxdepth - 1);
2733 debug_decision_0 (d, 0, 1000000);
2737 debug_decision_list (d)
2742 debug_decision_0 (d, 0, 0);