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 num_clobbers_to_add; /* Number of CLOBBERs to be added. */
123 /* Data structure for decision tree for recognizing legitimate insns. */
127 struct decision_head success; /* Nodes to test on success. */
128 struct decision *next; /* Node to test on failure. */
129 struct decision *prev; /* Node whose failure tests us. */
130 struct decision *afterward; /* Node to test on success,
131 but failure of successor nodes. */
133 const char *position; /* String denoting position in pattern. */
135 struct decision_test *tests; /* The tests for this node. */
137 int number; /* Node number, used for labels */
138 int subroutine_number; /* Number of subroutine this node starts */
139 int need_label; /* Label needs to be output. */
142 #define SUBROUTINE_THRESHOLD 100
144 static int next_subroutine_number;
146 /* We can write three types of subroutines: One for insn recognition,
147 one to split insns, and one for peephole-type optimizations. This
148 defines which type is being written. */
151 RECOG, SPLIT, PEEPHOLE2
154 #define IS_SPLIT(X) ((X) != RECOG)
156 /* Next available node number for tree nodes. */
158 static int next_number;
160 /* Next number to use as an insn_code. */
162 static int next_insn_code;
164 /* Similar, but counts all expressions in the MD file; used for
167 static int next_index;
169 /* Record the highest depth we ever have so we know how many variables to
170 allocate in each subroutine we make. */
172 static int max_depth;
174 /* This table contains a list of the rtl codes that can possibly match a
175 predicate defined in recog.c. The function `maybe_both_true' uses it to
176 deduce that there are no expressions that can be matches by certain pairs
177 of tree nodes. Also, if a predicate can match only one code, we can
178 hardwire that code into the node testing the predicate. */
180 static struct pred_table
183 RTX_CODE codes[NUM_RTX_CODE];
185 {"general_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
186 LABEL_REF, SUBREG, REG, MEM}},
187 #ifdef PREDICATE_CODES
190 {"address_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
191 LABEL_REF, SUBREG, REG, MEM, PLUS, MINUS, MULT}},
192 {"register_operand", {SUBREG, REG}},
193 {"scratch_operand", {SCRATCH, REG}},
194 {"immediate_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
196 {"const_int_operand", {CONST_INT}},
197 {"const_double_operand", {CONST_INT, CONST_DOUBLE}},
198 {"nonimmediate_operand", {SUBREG, REG, MEM}},
199 {"nonmemory_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
200 LABEL_REF, SUBREG, REG}},
201 {"push_operand", {MEM}},
202 {"pop_operand", {MEM}},
203 {"memory_operand", {SUBREG, MEM}},
204 {"indirect_operand", {SUBREG, MEM}},
205 {"comparison_operator", {EQ, NE, LE, LT, GE, GT, LEU, LTU, GEU, GTU}},
206 {"mode_independent_operand", {CONST_INT, CONST_DOUBLE, CONST, SYMBOL_REF,
207 LABEL_REF, SUBREG, REG, MEM}}
210 #define NUM_KNOWN_PREDS (sizeof preds / sizeof preds[0])
212 static struct decision *new_decision
213 PROTO((const char *, struct decision_head *));
214 static struct decision_test *new_decision_test
215 PROTO((enum decision_type, struct decision_test ***));
216 static struct decision *add_to_sequence
217 PROTO((rtx, struct decision_head *, const char *, enum routine_type, int));
219 static int maybe_both_true_2
220 PROTO((struct decision_test *, struct decision_test *));
221 static int maybe_both_true_1
222 PROTO((struct decision_test *, struct decision_test *));
223 static int maybe_both_true
224 PROTO((struct decision *, struct decision *, int));
226 static int nodes_identical_1
227 PROTO((struct decision_test *, struct decision_test *));
228 static int nodes_identical
229 PROTO((struct decision *, struct decision *));
230 static void merge_accept_insn
231 PROTO((struct decision *, struct decision *));
232 static void merge_trees
233 PROTO((struct decision_head *, struct decision_head *));
235 static void factor_tests
236 PROTO((struct decision_head *));
237 static void simplify_tests
238 PROTO((struct decision_head *));
239 static int break_out_subroutines
240 PROTO((struct decision_head *, int));
241 static void find_afterward
242 PROTO((struct decision_head *, struct decision *));
244 static void change_state
245 PROTO((const char *, const char *, struct decision *, const char *));
246 static void print_code
247 PROTO((enum rtx_code));
248 static void write_afterward
249 PROTO((struct decision *, struct decision *, const char *));
250 static struct decision *write_switch
251 PROTO((struct decision *, int));
252 static void write_cond
253 PROTO((struct decision_test *, int, enum routine_type));
254 static void write_action
255 PROTO((struct decision_test *, int, int, struct decision *,
257 static int is_unconditional
258 PROTO((struct decision_test *, enum routine_type));
259 static int write_node
260 PROTO((struct decision *, int, enum routine_type));
261 static void write_tree_1
262 PROTO((struct decision_head *, int, enum routine_type));
263 static void write_tree
264 PROTO((struct decision_head *, const char *, enum routine_type, int));
265 static void write_subroutine
266 PROTO((struct decision_head *, enum routine_type));
267 static void write_subroutines
268 PROTO((struct decision_head *, enum routine_type));
269 static void write_header
272 static struct decision_head make_insn_sequence
273 PROTO((rtx, enum routine_type));
274 static void process_tree
275 PROTO((struct decision_head *, enum routine_type));
277 static void record_insn_name
278 PROTO((int, const char *));
280 static void debug_decision_1
281 PROTO((struct decision *, int));
282 static void debug_decision_2
283 PROTO((struct decision_test *));
284 extern void debug_decision
285 PROTO((struct decision *));
287 /* Create a new node in sequence after LAST. */
289 static struct decision *
290 new_decision (position, last)
291 const char *position;
292 struct decision_head *last;
294 register struct decision *new
295 = (struct decision *) xmalloc (sizeof (struct decision));
297 memset (new, 0, sizeof (*new));
298 new->success = *last;
299 new->position = xstrdup (position);
300 new->number = next_number++;
302 last->first = last->last = new;
306 /* Create a new test and link it in at PLACE. */
308 static struct decision_test *
309 new_decision_test (type, pplace)
310 enum decision_type type;
311 struct decision_test ***pplace;
313 struct decision_test **place = *pplace;
314 struct decision_test *test;
316 test = (struct decision_test *) xmalloc (sizeof (*test));
327 /* Create a chain of nodes to verify that an rtl expression matches
330 LAST is a pointer to the listhead in the previous node in the chain (or
331 in the calling function, for the first node).
333 POSITION is the string representing the current position in the insn.
335 INSN_TYPE is the type of insn for which we are emitting code.
337 A pointer to the final node in the chain is returned. */
339 static struct decision *
340 add_to_sequence (pattern, last, position, insn_type, top)
342 struct decision_head *last;
343 const char *position;
344 enum routine_type insn_type;
348 struct decision *this, *sub;
349 struct decision_test *test;
350 struct decision_test **place;
353 register const char *fmt;
354 int depth = strlen (position);
356 enum machine_mode mode;
358 if (depth > max_depth)
361 subpos = (char *) alloca (depth + 2);
362 strcpy (subpos, position);
363 subpos[depth + 1] = 0;
365 sub = this = new_decision (position, last);
366 place = &this->tests;
369 mode = GET_MODE (pattern);
370 code = GET_CODE (pattern);
375 /* Toplevel peephole pattern. */
376 if (insn_type == PEEPHOLE2 && top)
378 /* We don't need the node we just created -- unlink it. */
379 last->first = last->last = NULL;
381 for (i = 0; i < (size_t) XVECLEN (pattern, 0); i++)
383 /* Which insn we're looking at is represented by A-Z. We don't
384 ever use 'A', however; it is always implied. */
386 subpos[depth] = (i > 0 ? 'A' + i : 0);
387 sub = add_to_sequence (XVECEXP (pattern, 0, i),
388 last, subpos, insn_type, 0);
389 last = &sub->success;
394 /* Else nothing special. */
403 const char *pred_name;
404 RTX_CODE was_code = code;
405 int allows_const_int = 1;
407 if (code == MATCH_SCRATCH)
409 pred_name = "scratch_operand";
414 pred_name = XSTR (pattern, 1);
415 if (code == MATCH_PARALLEL)
421 /* We know exactly what const_int_operand matches -- any CONST_INT. */
422 if (strcmp ("const_int_operand", pred_name) == 0)
427 else if (pred_name[0] != 0)
429 test = new_decision_test (DT_pred, &place);
430 test->u.pred.name = pred_name;
431 test->u.pred.mode = mode;
433 /* See if we know about this predicate and save its number. If
434 we do, and it only accepts one code, note that fact. The
435 predicate `const_int_operand' only tests for a CONST_INT, so
436 if we do so we can avoid calling it at all.
438 Finally, if we know that the predicate does not allow
439 CONST_INT, we know that the only way the predicate can match
440 is if the modes match (here we use the kludge of relying on
441 the fact that "address_operand" accepts CONST_INT; otherwise,
442 it would have to be a special case), so we can test the mode
443 (but we need not). This fact should considerably simplify the
446 for (i = 0; i < NUM_KNOWN_PREDS; i++)
447 if (! strcmp (preds[i].name, pred_name))
450 if (i < NUM_KNOWN_PREDS)
452 int allows_const_int, j;
454 test->u.pred.index = i;
456 if (preds[i].codes[1] == 0 && code == UNKNOWN)
457 code = preds[i].codes[0];
459 allows_const_int = 0;
460 for (j = 0; preds[i].codes[j] != 0; j++)
461 if (preds[i].codes[j] == CONST_INT)
463 allows_const_int = 1;
469 test->u.pred.index = -1;
470 #ifdef PREDICATE_CODES
471 /* If the port has a list of the predicates it uses but
473 fprintf (stderr, "Warning: `%s' not in PREDICATE_CODES\n",
479 /* Can't enforce a mode if we allow const_int. */
480 if (allows_const_int)
483 /* Accept the operand, ie. record it in `operands'. */
484 test = new_decision_test (DT_accept_op, &place);
485 test->u.opno = XINT (pattern, 0);
487 if (was_code == MATCH_OPERATOR || was_code == MATCH_PARALLEL)
489 char base = (was_code == MATCH_OPERATOR ? '0' : 'a');
490 for (i = 0; i < (size_t) XVECLEN (pattern, 2); i++)
492 subpos[depth] = i + base;
493 sub = add_to_sequence (XVECEXP (pattern, 2, i),
494 &sub->success, subpos, insn_type, 0);
503 test = new_decision_test (DT_dup, &place);
504 test->u.dup = XINT (pattern, 0);
506 test = new_decision_test (DT_accept_op, &place);
507 test->u.opno = XINT (pattern, 0);
509 for (i = 0; i < (size_t) XVECLEN (pattern, 1); i++)
511 subpos[depth] = i + '0';
512 sub = add_to_sequence (XVECEXP (pattern, 1, i),
513 &sub->success, subpos, insn_type, 0);
521 test = new_decision_test (DT_dup, &place);
522 test->u.dup = XINT (pattern, 0);
526 pattern = XEXP (pattern, 0);
530 /* The operands of a SET must have the same mode unless one
532 if (GET_MODE (SET_SRC (pattern)) != VOIDmode
533 && GET_MODE (SET_DEST (pattern)) != VOIDmode
534 && GET_MODE (SET_SRC (pattern)) != GET_MODE (SET_DEST (pattern))
535 /* The mode of an ADDRESS_OPERAND is the mode of the memory
536 reference, not the mode of the address. */
537 && ! (GET_CODE (SET_SRC (pattern)) == MATCH_OPERAND
538 && ! strcmp (XSTR (SET_SRC (pattern), 1), "address_operand")))
540 print_rtl (stderr, pattern);
541 fputc ('\n', stderr);
542 fatal ("mode mismatch in SET");
547 if (GET_MODE (XEXP (pattern, 0)) != VOIDmode)
549 print_rtl (stderr, pattern);
550 fputc ('\n', stderr);
551 fatal ("operand to LABEL_REF not VOIDmode");
559 fmt = GET_RTX_FORMAT (code);
560 len = GET_RTX_LENGTH (code);
562 /* Do tests against the current node first. */
563 for (i = 0; i < (size_t) len; i++)
569 test = new_decision_test (DT_elt_zero_int, &place);
570 test->u.intval = XINT (pattern, i);
574 test = new_decision_test (DT_elt_one_int, &place);
575 test->u.intval = XINT (pattern, i);
580 else if (fmt[i] == 'w')
585 test = new_decision_test (DT_elt_zero_wide, &place);
586 test->u.intval = XWINT (pattern, i);
588 else if (fmt[i] == 'E')
593 test = new_decision_test (DT_veclen, &place);
594 test->u.veclen = XVECLEN (pattern, i);
598 /* Now test our sub-patterns. */
599 for (i = 0; i < (size_t) len; i++)
604 subpos[depth] = '0' + i;
605 sub = add_to_sequence (XEXP (pattern, i), &sub->success,
606 subpos, insn_type, 0);
612 for (j = 0; j < XVECLEN (pattern, i); j++)
614 subpos[depth] = 'a' + j;
615 sub = add_to_sequence (XVECEXP (pattern, i, j),
616 &sub->success, subpos, insn_type, 0);
633 /* Insert nodes testing mode and code, if they're still relevant,
634 before any of the nodes we may have added above. */
637 place = &this->tests;
638 test = new_decision_test (DT_code, &place);
642 if (mode != VOIDmode)
644 place = &this->tests;
645 test = new_decision_test (DT_mode, &place);
649 /* If we didn't insert any tests or accept nodes, hork. */
650 if (this->tests == NULL)
656 /* A subroutine of maybe_both_true; examines only one test.
657 Returns > 0 for "definitely both true" and < 0 for "maybe both true". */
660 maybe_both_true_2 (d1, d2)
661 struct decision_test *d1, *d2;
663 if (d1->type == d2->type)
668 return d1->u.mode == d2->u.mode;
671 return d1->u.code == d2->u.code;
674 return d1->u.veclen == d2->u.veclen;
676 case DT_elt_zero_int:
678 case DT_elt_zero_wide:
679 return d1->u.intval == d2->u.intval;
686 /* If either has a predicate that we know something about, set
687 things up so that D1 is the one that always has a known
688 predicate. Then see if they have any codes in common. */
690 if (d1->type == DT_pred || d2->type == DT_pred)
692 if (d2->type == DT_pred)
694 struct decision_test *tmp;
695 tmp = d1, d1 = d2, d2 = tmp;
698 /* If D2 tests a mode, see if it matches D1. */
699 if (d1->u.pred.mode != VOIDmode)
701 if (d2->type == DT_mode)
703 if (d1->u.pred.mode != d2->u.mode)
706 else if (d2->type == DT_pred)
708 if (d2->u.pred.mode != VOIDmode
709 && d1->u.pred.mode != d2->u.pred.mode)
714 if (d1->u.pred.index >= 0)
716 /* If D2 tests a code, see if it is in the list of valid
717 codes for D1's predicate. */
718 if (d2->type == DT_code)
720 const RTX_CODE *c = &preds[d1->u.pred.index].codes[0];
723 if (*c == d2->u.code)
731 /* Otherwise see if the predicates have any codes in common. */
732 else if (d2->type == DT_pred && d2->u.pred.index >= 0)
734 const RTX_CODE *c1 = &preds[d1->u.pred.index].codes[0];
737 while (*c1 != 0 && !common)
739 const RTX_CODE *c2 = &preds[d2->u.pred.index].codes[0];
740 while (*c2 != 0 && !common)
742 common = (*c1 == *c2);
757 /* A subroutine of maybe_both_true; examines all the tests for a given node.
758 Returns > 0 for "definitely both true" and < 0 for "maybe both true". */
761 maybe_both_true_1 (d1, d2)
762 struct decision_test *d1, *d2;
764 struct decision_test *t1, *t2;
766 /* A match_operand with no predicate can match anything. Recognize
767 this by the existance of a lone DT_accept_op test. */
768 if (d1->type == DT_accept_op || d2->type == DT_accept_op)
771 /* Eliminate pairs of tests while they can exactly match. */
772 while (d1 && d2 && d1->type == d2->type)
774 if (maybe_both_true_2 (d1, d2) == 0)
776 d1 = d1->next, d2 = d2->next;
779 /* After that, consider all pairs. */
780 for (t1 = d1; t1 ; t1 = t1->next)
781 for (t2 = d2; t2 ; t2 = t2->next)
782 if (maybe_both_true_2 (t1, t2) == 0)
788 /* Return 0 if we can prove that there is no RTL that can match both
789 D1 and D2. Otherwise, return 1 (it may be that there is an RTL that
790 can match both or just that we couldn't prove there wasn't such an RTL).
792 TOPLEVEL is non-zero if we are to only look at the top level and not
793 recursively descend. */
796 maybe_both_true (d1, d2, toplevel)
797 struct decision *d1, *d2;
800 struct decision *p1, *p2;
803 /* Don't compare strings on the different positions in insn. Doing so
804 is incorrect and results in false matches from constructs like
806 [(set (subreg:HI (match_operand:SI "register_operand" "r") 0)
807 (subreg:HI (match_operand:SI "register_operand" "r") 0))]
809 [(set (match_operand:HI "register_operand" "r")
810 (match_operand:HI "register_operand" "r"))]
812 If we are presented with such, we are recursing through the remainder
813 of a node's success nodes (from the loop at the end of this function).
814 Skip forward until we come to a position that matches.
816 Due to the way position strings are constructed, we know that iterating
817 forward from the lexically lower position (e.g. "00") will run into
818 the lexically higher position (e.g. "1") and not the other way around.
819 This saves a bit of effort. */
821 cmp = strcmp (d1->position, d2->position);
827 /* If the d2->position was lexically lower, swap. */
829 p1 = d1, d1 = d2, d2 = p1;
831 if (d1->success.first == 0)
833 for (p1 = d1->success.first; p1; p1 = p1->next)
834 if (maybe_both_true (p1, d2, 0))
840 /* Test the current level. */
841 cmp = maybe_both_true_1 (d1->tests, d2->tests);
845 /* We can't prove that D1 and D2 cannot both be true. If we are only
846 to check the top level, return 1. Otherwise, see if we can prove
847 that all choices in both successors are mutually exclusive. If
848 either does not have any successors, we can't prove they can't both
851 if (toplevel || d1->success.first == 0 || d2->success.first == 0)
854 for (p1 = d1->success.first; p1; p1 = p1->next)
855 for (p2 = d2->success.first; p2; p2 = p2->next)
856 if (maybe_both_true (p1, p2, 0))
862 /* A subroutine of nodes_identical. Examine two tests for equivalence. */
865 nodes_identical_1 (d1, d2)
866 struct decision_test *d1, *d2;
871 return d1->u.mode == d2->u.mode;
874 return d1->u.code == d2->u.code;
877 return (d1->u.pred.mode == d2->u.pred.mode
878 && strcmp (d1->u.pred.name, d2->u.pred.name) == 0);
881 return strcmp (d1->u.c_test, d2->u.c_test) == 0;
884 return d1->u.veclen == d2->u.veclen;
887 return d1->u.dup == d2->u.dup;
889 case DT_elt_zero_int:
891 case DT_elt_zero_wide:
892 return d1->u.intval == d2->u.intval;
895 return d1->u.opno == d2->u.opno;
898 /* Differences will be handled in merge_accept_insn. */
906 /* True iff the two nodes are identical (on one level only). Due
907 to the way these lists are constructed, we shouldn't have to
908 consider different orderings on the tests. */
911 nodes_identical (d1, d2)
912 struct decision *d1, *d2;
914 struct decision_test *t1, *t2;
916 for (t1 = d1->tests, t2 = d2->tests; t1 && t2; t1 = t1->next, t2 = t2->next)
918 if (t1->type != t2->type)
920 if (! nodes_identical_1 (t1, t2))
924 /* For success, they should now both be null. */
928 /* A subroutine of merge_trees; given two nodes that have been declared
929 identical, cope with two insn accept states. If they differ in the
930 number of clobbers, then the conflict was created by make_insn_sequence
931 and we can drop the with-clobbers version on the floor. If both
932 nodes have no additional clobbers, we have found an ambiguity in the
933 source machine description. */
936 merge_accept_insn (oldd, addd)
937 struct decision *oldd, *addd;
939 struct decision_test *old, *add;
941 for (old = oldd->tests; old; old = old->next)
942 if (old->type == DT_accept_insn)
947 for (add = addd->tests; add; add = add->next)
948 if (add->type == DT_accept_insn)
953 /* If one node is for a normal insn and the second is for the base
954 insn with clobbers stripped off, the second node should be ignored. */
956 if (old->u.insn.num_clobbers_to_add == 0
957 && add->u.insn.num_clobbers_to_add > 0)
959 /* Nothing to do here. */
961 else if (old->u.insn.num_clobbers_to_add > 0
962 && add->u.insn.num_clobbers_to_add == 0)
964 /* In this case, replace OLD with ADD. */
965 old->u.insn = add->u.insn;
969 fatal ("Two actions at one point in tree for insns \"%s\" (%d) and \"%s\" (%d)",
970 get_insn_name (old->u.insn.code_number),
971 old->u.insn.code_number,
972 get_insn_name (add->u.insn.code_number),
973 add->u.insn.code_number);
977 /* Merge two decision trees OLDH and ADDH, modifying OLDH destructively. */
980 merge_trees (oldh, addh)
981 struct decision_head *oldh, *addh;
983 struct decision *next, *add;
985 if (addh->first == 0)
987 if (oldh->first == 0)
993 /* Trying to merge bits at different positions isn't possible. */
994 if (strcmp (oldh->first->position, addh->first->position))
997 for (add = addh->first; add ; add = next)
999 struct decision *old, *insert_before = NULL;
1003 /* The semantics of pattern matching state that the tests are
1004 done in the order given in the MD file so that if an insn
1005 matches two patterns, the first one will be used. However,
1006 in practice, most, if not all, patterns are unambiguous so
1007 that their order is independent. In that case, we can merge
1008 identical tests and group all similar modes and codes together.
1010 Scan starting from the end of OLDH until we reach a point
1011 where we reach the head of the list or where we pass a
1012 pattern that could also be true if NEW is true. If we find
1013 an identical pattern, we can merge them. Also, record the
1014 last node that tests the same code and mode and the last one
1015 that tests just the same mode.
1017 If we have no match, place NEW after the closest match we found. */
1019 for (old = oldh->last; old; old = old->prev)
1021 if (nodes_identical (old, add))
1023 merge_accept_insn (old, add);
1024 merge_trees (&old->success, &add->success);
1028 if (maybe_both_true (old, add, 0))
1031 /* Insert the nodes in DT test type order, which is roughly
1032 how expensive/important the test is. Given that the tests
1033 are also ordered within the list, examining the first is
1035 if (add->tests->type < old->tests->type)
1036 insert_before = old;
1039 if (insert_before == NULL)
1042 add->prev = oldh->last;
1043 oldh->last->next = add;
1048 if ((add->prev = insert_before->prev) != NULL)
1049 add->prev->next = add;
1052 add->next = insert_before;
1053 insert_before->prev = add;
1060 /* Walk the tree looking for sub-nodes that perform common tests.
1061 Factor out the common test into a new node. This enables us
1062 (depending on the test type) to emit switch statements later. */
1066 struct decision_head *head;
1068 struct decision *first, *next;
1070 for (first = head->first; first && first->next; first = next)
1072 enum decision_type type;
1073 struct decision *new, *old_last;
1075 type = first->tests->type;
1078 /* Want at least two compatible sequential nodes. */
1079 if (next->tests->type != type)
1082 /* Don't want all node types, just those we can turn into
1083 switch statements. */
1086 && type != DT_veclen
1087 && type != DT_elt_zero_int
1088 && type != DT_elt_one_int
1089 && type != DT_elt_zero_wide)
1092 /* If we'd been performing more than one test, create a new node
1093 below our first test. */
1094 if (first->tests->next != NULL)
1096 new = new_decision (first->position, &first->success);
1097 new->tests = first->tests->next;
1098 first->tests->next = NULL;
1101 /* Crop the node tree off after our first test. */
1103 old_last = head->last;
1106 /* For each compatible test, adjust to perform only one test in
1107 the top level node, then merge the node back into the tree. */
1110 struct decision_head h;
1112 if (next->tests->next != NULL)
1114 new = new_decision (next->position, &next->success);
1115 new->tests = next->tests->next;
1116 next->tests->next = NULL;
1121 h.first = h.last = new;
1123 merge_trees (head, &h);
1125 while (next && next->tests->type == type);
1127 /* After we run out of compatible tests, graft the remaining nodes
1128 back onto the tree. */
1131 next->prev = head->last;
1132 head->last->next = next;
1133 head->last = old_last;
1138 for (first = head->first; first; first = first->next)
1139 factor_tests (&first->success);
1142 /* After factoring, try to simplify the tests on any one node.
1143 Tests that are useful for switch statements are recognizable
1144 by having only a single test on a node -- we'll be manipulating
1145 nodes with multiple tests:
1147 If we have mode tests or code tests that are redundant with
1148 predicates, remove them. */
1151 simplify_tests (head)
1152 struct decision_head *head;
1154 struct decision *tree;
1156 for (tree = head->first; tree; tree = tree->next)
1158 struct decision_test *a, *b;
1165 /* Find a predicate node. */
1166 while (b && b->type != DT_pred)
1170 /* Due to how these tests are constructed, we don't even need
1171 to check that the mode and code are compatible -- they were
1172 generated from the predicate in the first place. */
1173 while (a->type == DT_mode || a->type == DT_code)
1180 for (tree = head->first; tree; tree = tree->next)
1181 simplify_tests (&tree->success);
1184 /* Count the number of subnodes of HEAD. If the number is high enough,
1185 make the first node in HEAD start a separate subroutine in the C code
1186 that is generated. */
1189 break_out_subroutines (head, initial)
1190 struct decision_head *head;
1194 struct decision *sub;
1196 for (sub = head->first; sub; sub = sub->next)
1197 size += 1 + break_out_subroutines (&sub->success, 0);
1199 if (size > SUBROUTINE_THRESHOLD && ! initial)
1201 head->first->subroutine_number = ++next_subroutine_number;
1207 /* For each node p, find the next alternative that might be true
1211 find_afterward (head, real_afterward)
1212 struct decision_head *head;
1213 struct decision *real_afterward;
1215 struct decision *p, *q, *afterward;
1217 /* We can't propogate alternatives across subroutine boundaries.
1218 This is not incorrect, merely a minor optimization loss. */
1221 afterward = (p->subroutine_number > 0 ? NULL : real_afterward);
1223 for ( ; p ; p = p->next)
1225 /* Find the next node that might be true if this one fails. */
1226 for (q = p->next; q ; q = q->next)
1227 if (maybe_both_true (p, q, 1))
1230 /* If we reached the end of the list without finding one,
1231 use the incoming afterward position. */
1240 for (p = head->first; p ; p = p->next)
1241 if (p->success.first)
1242 find_afterward (&p->success, p->afterward);
1244 /* When we are generating a subroutine, record the real afterward
1245 position in the first node where write_tree can find it, and we
1246 can do the right thing at the subroutine call site. */
1248 if (p->subroutine_number > 0)
1249 p->afterward = real_afterward;
1252 /* Assuming that the state of argument is denoted by OLDPOS, take whatever
1253 actions are necessary to move to NEWPOS. If we fail to move to the
1254 new state, branch to node AFTERWARD if non-zero, otherwise return.
1256 Failure to move to the new state can only occur if we are trying to
1257 match multiple insns and we try to step past the end of the stream. */
1260 change_state (oldpos, newpos, afterward, indent)
1263 struct decision *afterward;
1266 int odepth = strlen (oldpos);
1267 int ndepth = strlen (newpos);
1269 int old_has_insn, new_has_insn;
1271 /* Pop up as many levels as necessary. */
1272 for (depth = odepth; strncmp (oldpos, newpos, depth) != 0; --depth)
1275 /* Hunt for the last [A-Z] in both strings. */
1276 for (old_has_insn = odepth - 1; old_has_insn >= 0; --old_has_insn)
1277 if (oldpos[old_has_insn] >= 'A' && oldpos[old_has_insn] <= 'Z')
1279 for (new_has_insn = odepth - 1; new_has_insn >= 0; --new_has_insn)
1280 if (newpos[new_has_insn] >= 'A' && newpos[new_has_insn] <= 'Z')
1283 /* Make sure to reset the _last_insn pointer when popping back up. */
1284 if (old_has_insn >= 0 && new_has_insn < 0)
1285 printf ("%s_last_insn = insn;\n", indent);
1287 /* Go down to desired level. */
1288 while (depth < ndepth)
1290 /* It's a different insn from the first one. */
1291 if (newpos[depth] >= 'A' && newpos[depth] <= 'Z')
1293 /* We can only fail if we're moving down the tree. */
1294 if (old_has_insn >= 0 && oldpos[old_has_insn] >= newpos[depth])
1296 printf ("%s_last_insn = recog_next_insn (insn, %d);\n",
1297 indent, newpos[depth] - 'A');
1301 printf ("%stem = recog_next_insn (insn, %d);\n",
1302 indent, newpos[depth] - 'A');
1303 printf ("%sif (tem == NULL_RTX)\n", indent);
1305 printf ("%s goto L%d;\n", indent, afterward->number);
1307 printf ("%s goto ret0;\n", indent);
1308 printf ("%s_last_insn = tem;\n", indent);
1310 printf ("%sx%d = PATTERN (_last_insn);\n", indent, depth + 1);
1312 else if (newpos[depth] >= 'a' && newpos[depth] <= 'z')
1313 printf ("%sx%d = XVECEXP (x%d, 0, %d);\n",
1314 indent, depth + 1, depth, newpos[depth] - 'a');
1316 printf ("%sx%d = XEXP (x%d, %c);\n",
1317 indent, depth + 1, depth, newpos[depth]);
1322 /* Print the enumerator constant for CODE -- the upcase version of
1329 register const char *p;
1330 for (p = GET_RTX_NAME (code); *p; p++)
1331 putchar (TOUPPER (*p));
1334 /* Emit code to cross an afterward link -- change state and branch. */
1337 write_afterward (start, afterward, indent)
1338 struct decision *start;
1339 struct decision *afterward;
1342 if (!afterward || start->subroutine_number > 0)
1343 printf("%sgoto ret0;\n", indent);
1346 change_state (start->position, afterward->position, NULL, indent);
1347 printf ("%sgoto L%d;\n", indent, afterward->number);
1351 /* Emit a switch statement, if possible, for an initial sequence of
1352 nodes at START. Return the first node yet untested. */
1354 static struct decision *
1355 write_switch (start, depth)
1356 struct decision *start;
1359 struct decision *p = start;
1360 enum decision_type type = p->tests->type;
1362 /* If we have two or more nodes in sequence that test the same one
1363 thing, we may be able to use a switch statement. */
1367 || p->next->tests->type != type
1368 || p->next->tests->next)
1371 /* DT_code is special in that we can do interesting things with
1372 known predicates at the same time. */
1373 if (type == DT_code)
1375 char codemap[NUM_RTX_CODE];
1376 struct decision *ret;
1378 memset (codemap, 0, sizeof(codemap));
1380 printf (" switch (GET_CODE (x%d))\n {\n", depth);
1383 RTX_CODE code = p->tests->u.code;
1386 printf (":\n goto L%d;\n", p->success.first->number);
1387 p->success.first->need_label = 1;
1392 while (p && p->tests->type == DT_code && !p->tests->next);
1394 /* If P is testing a predicate that we know about and we haven't
1395 seen any of the codes that are valid for the predicate, we can
1396 write a series of "case" statement, one for each possible code.
1397 Since we are already in a switch, these redundant tests are very
1398 cheap and will reduce the number of predicates called. */
1400 /* Note that while we write out cases for these predicates here,
1401 we don't actually write the test here, as it gets kinda messy.
1402 It is trivial to leave this to later by telling our caller that
1403 we only processed the CODE tests. */
1406 while (p && p->tests->type == DT_pred
1407 && p->tests->u.pred.index >= 0)
1411 for (c = &preds[p->tests->u.pred.index].codes[0]; *c ; ++c)
1412 if (codemap[(int) *c] != 0)
1415 for (c = &preds[p->tests->u.pred.index].codes[0]; *c ; ++c)
1420 codemap[(int) *c] = 1;
1423 printf (" goto L%d;\n", p->number);
1429 /* Make the default case skip the predicates we managed to match. */
1431 printf (" default:\n");
1436 printf (" goto L%d;\n", p->number);
1440 write_afterward (start, start->afterward, " ");
1443 printf (" break;\n");
1448 else if (type == DT_mode
1449 || type == DT_veclen
1450 || type == DT_elt_zero_int
1451 || type == DT_elt_one_int
1452 || type == DT_elt_zero_wide)
1456 printf (" switch (");
1460 str = "GET_MODE (x%d)";
1463 str = "XVECLEN (x%d, 0)";
1465 case DT_elt_zero_int:
1466 str = "XINT (x%d, 0)";
1468 case DT_elt_one_int:
1469 str = "XINT (x%d, 1)";
1471 case DT_elt_zero_wide:
1472 str = "XWINT (x%d, 0)";
1477 printf (str, depth);
1486 printf ("%smode", GET_MODE_NAME (p->tests->u.mode));
1489 printf ("%d", p->tests->u.veclen);
1491 case DT_elt_zero_int:
1492 case DT_elt_one_int:
1493 case DT_elt_zero_wide:
1494 printf (HOST_WIDE_INT_PRINT_DEC, p->tests->u.intval);
1499 printf (":\n goto L%d;\n", p->success.first->number);
1500 p->success.first->need_label = 1;
1504 while (p && p->tests->type == type && !p->tests->next);
1506 printf (" default:\n break;\n }\n");
1512 /* None of the other tests are ameanable. */
1517 /* Emit code for one test. */
1520 write_cond (p, depth, subroutine_type)
1521 struct decision_test *p;
1523 enum routine_type subroutine_type;
1528 printf ("GET_MODE (x%d) == %smode", depth, GET_MODE_NAME (p->u.mode));
1532 printf ("GET_CODE (x%d) == ", depth);
1533 print_code (p->u.code);
1537 printf ("XVECLEN (x%d, 0) == %d", depth, p->u.veclen);
1540 case DT_elt_zero_int:
1541 printf ("XINT (x%d, 0) == %d", depth, (int) p->u.intval);
1544 case DT_elt_one_int:
1545 printf ("XINT (x%d, 1) == %d", depth, (int) p->u.intval);
1548 case DT_elt_zero_wide:
1549 printf ("XWINT (x%d, 0) == ", depth);
1550 printf (HOST_WIDE_INT_PRINT_DEC, p->u.intval);
1554 printf ("rtx_equal_p (x%d, operands[%d])", depth, p->u.dup);
1558 printf ("%s (x%d, %smode)", p->u.pred.name, depth,
1559 GET_MODE_NAME (p->u.pred.mode));
1563 printf ("(%s)", p->u.c_test);
1566 case DT_accept_insn:
1567 switch (subroutine_type)
1570 if (p->u.insn.num_clobbers_to_add == 0)
1572 printf ("pnum_clobbers != NULL");
1585 /* Emit code for one action. The previous tests have succeeded;
1586 TEST is the last of the chain. In the normal case we simply
1587 perform a state change. For the `accept' tests we must do more work. */
1590 write_action (test, depth, uncond, success, subroutine_type)
1591 struct decision_test *test;
1593 struct decision *success;
1594 enum routine_type subroutine_type;
1601 else if (test->type == DT_accept_op || test->type == DT_accept_insn)
1603 fputs (" {\n", stdout);
1610 if (test->type == DT_accept_op)
1612 printf("%soperands[%d] = x%d;\n", indent, test->u.opno, depth);
1614 /* Only allow DT_accept_insn to follow. */
1618 if (test->type != DT_accept_insn)
1623 /* Sanity check that we're now at the end of the list of tests. */
1627 if (test->type == DT_accept_insn)
1629 switch (subroutine_type)
1632 if (test->u.insn.num_clobbers_to_add != 0)
1633 printf ("%s*pnum_clobbers = %d;\n",
1634 indent, test->u.insn.num_clobbers_to_add);
1635 printf ("%sreturn %d;\n", indent, test->u.insn.code_number);
1639 printf ("%sreturn gen_split_%d (operands);\n",
1640 indent, test->u.insn.code_number);
1644 printf ("%stem = gen_peephole2_%d (insn, operands);\n",
1645 indent, test->u.insn.code_number);
1646 printf ("%sif (tem != 0)\n%s goto ret1;\n", indent, indent);
1655 printf("%sgoto L%d;\n", indent, success->number);
1656 success->need_label = 1;
1660 fputs (" }\n", stdout);
1663 /* Return 1 if the test is always true and has no fallthru path. Return -1
1664 if the test does have a fallthru path, but requires that the condition be
1665 terminated. Otherwise return 0 for a normal test. */
1666 /* ??? is_unconditional is a stupid name for a tri-state function. */
1669 is_unconditional (t, subroutine_type)
1670 struct decision_test *t;
1671 enum routine_type subroutine_type;
1673 if (t->type == DT_accept_op)
1676 if (t->type == DT_accept_insn)
1678 switch (subroutine_type)
1681 return (t->u.insn.num_clobbers_to_add == 0);
1694 /* Emit code for one node -- the conditional and the accompanying action.
1695 Return true if there is no fallthru path. */
1698 write_node (p, depth, subroutine_type)
1701 enum routine_type subroutine_type;
1703 struct decision_test *test, *last_test;
1706 last_test = test = p->tests;
1707 uncond = is_unconditional (test, subroutine_type);
1711 write_cond (test, depth, subroutine_type);
1713 while ((test = test->next) != NULL)
1718 uncond2 = is_unconditional (test, subroutine_type);
1723 write_cond (test, depth, subroutine_type);
1729 write_action (last_test, depth, uncond, p->success.first, subroutine_type);
1734 /* Emit code for all of the sibling nodes of HEAD. */
1737 write_tree_1 (head, depth, subroutine_type)
1738 struct decision_head *head;
1740 enum routine_type subroutine_type;
1742 struct decision *p, *next;
1745 for (p = head->first; p ; p = next)
1747 /* The label for the first element was printed in write_tree. */
1748 if (p != head->first && p->need_label)
1749 OUTPUT_LABEL (" ", p->number);
1751 /* Attempt to write a switch statement for a whole sequence. */
1752 next = write_switch (p, depth);
1757 /* Failed -- fall back and write one node. */
1758 uncond = write_node (p, depth, subroutine_type);
1763 /* Finished with this chain. Close a fallthru path by branching
1764 to the afterward node. */
1766 write_afterward (head->last, head->last->afterward, " ");
1769 /* Write out the decision tree starting at HEAD. PREVPOS is the
1770 position at the node that branched to this node. */
1773 write_tree (head, prevpos, type, initial)
1774 struct decision_head *head;
1775 const char *prevpos;
1776 enum routine_type type;
1779 register struct decision *p = head->first;
1783 OUTPUT_LABEL (" ", p->number);
1785 if (! initial && p->subroutine_number > 0)
1787 static const char * const name_prefix[] = {
1788 "recog", "split", "peephole2"
1791 static const char * const call_suffix[] = {
1792 ", pnum_clobbers", "", ", _plast_insn"
1795 /* This node has been broken out into a separate subroutine.
1796 Call it, test the result, and branch accordingly. */
1800 printf (" tem = %s_%d (x0, insn%s);\n",
1801 name_prefix[type], p->subroutine_number, call_suffix[type]);
1802 if (IS_SPLIT (type))
1803 printf (" if (tem != 0)\n return tem;\n");
1805 printf (" if (tem >= 0)\n return tem;\n");
1807 change_state (p->position, p->afterward->position, NULL, " ");
1808 printf (" goto L%d;\n", p->afterward->number);
1812 printf (" return %s_%d (x0, insn%s);\n",
1813 name_prefix[type], p->subroutine_number, call_suffix[type]);
1818 int depth = strlen (p->position);
1820 change_state (prevpos, p->position, head->last->afterward, " ");
1821 write_tree_1 (head, depth, type);
1823 for (p = head->first; p; p = p->next)
1824 if (p->success.first)
1825 write_tree (&p->success, p->position, type, 0);
1829 /* Write out a subroutine of type TYPE to do comparisons starting at
1833 write_subroutine (head, type)
1834 struct decision_head *head;
1835 enum routine_type type;
1837 static const char * const proto_pattern[] = {
1838 "%sint recog%s PROTO ((rtx, rtx, int *));\n",
1839 "%srtx split%s PROTO ((rtx, rtx));\n",
1840 "%srtx peephole2%s PROTO ((rtx, rtx, rtx *));\n"
1843 static const char * const decl_pattern[] = {
1845 recog%s (x0, insn, pnum_clobbers)\n\
1847 rtx insn ATTRIBUTE_UNUSED;\n\
1848 int *pnum_clobbers ATTRIBUTE_UNUSED;\n",
1851 split%s (x0, insn)\n\
1853 rtx insn ATTRIBUTE_UNUSED;\n",
1856 peephole2%s (x0, insn, _plast_insn)\n\
1858 rtx insn ATTRIBUTE_UNUSED;\n\
1859 rtx *_plast_insn ATTRIBUTE_UNUSED;\n"
1862 int subfunction = head->first->subroutine_number;
1867 s_or_e = subfunction ? "static " : "";
1870 sprintf (extension, "_%d", subfunction);
1871 else if (type == RECOG)
1872 extension[0] = '\0';
1874 strcpy (extension, "_insns");
1876 printf (proto_pattern[type], s_or_e, extension);
1877 printf (decl_pattern[type], s_or_e, extension);
1879 printf ("{\n register rtx * const operands = &recog_data.operand[0];\n");
1880 for (i = 1; i <= max_depth; i++)
1881 printf (" register rtx x%d ATTRIBUTE_UNUSED;\n", i);
1883 if (type == PEEPHOLE2)
1884 printf (" register rtx _last_insn = insn;\n");
1885 printf (" %s tem ATTRIBUTE_UNUSED;\n", IS_SPLIT (type) ? "rtx" : "int");
1887 write_tree (head, "", type, 1);
1889 if (type == PEEPHOLE2)
1890 printf (" ret1:\n *_plast_insn = _last_insn;\n return tem;\n");
1891 printf (" ret0:\n return %d;\n}\n\n", IS_SPLIT (type) ? 0 : -1);
1894 /* In break_out_subroutines, we discovered the boundaries for the
1895 subroutines, but did not write them out. Do so now. */
1898 write_subroutines (head, type)
1899 struct decision_head *head;
1900 enum routine_type type;
1904 for (p = head->first; p ; p = p->next)
1905 if (p->success.first)
1906 write_subroutines (&p->success, type);
1908 if (head->first->subroutine_number > 0)
1909 write_subroutine (head, type);
1912 /* Begin the output file. */
1918 /* Generated automatically by the program `genrecog' from the target\n\
1919 machine description file. */\n\
1921 #include \"config.h\"\n\
1922 #include \"system.h\"\n\
1923 #include \"rtl.h\"\n\
1924 #include \"tm_p.h\"\n\
1925 #include \"function.h\"\n\
1926 #include \"insn-config.h\"\n\
1927 #include \"recog.h\"\n\
1928 #include \"real.h\"\n\
1929 #include \"output.h\"\n\
1930 #include \"flags.h\"\n\
1931 #include \"hard-reg-set.h\"\n\
1932 #include \"resource.h\"\n\
1936 /* `recog' contains a decision tree that recognizes whether the rtx\n\
1937 X0 is a valid instruction.\n\
1939 recog returns -1 if the rtx is not valid. If the rtx is valid, recog\n\
1940 returns a nonnegative number which is the insn code number for the\n\
1941 pattern that matched. This is the same as the order in the machine\n\
1942 description of the entry that matched. This number can be used as an\n\
1943 index into `insn_data' and other tables.\n\
1945 The third argument to recog is an optional pointer to an int. If\n\
1946 present, recog will accept a pattern if it matches except for missing\n\
1947 CLOBBER expressions at the end. In that case, the value pointed to by\n\
1948 the optional pointer will be set to the number of CLOBBERs that need\n\
1949 to be added (it should be initialized to zero by the caller). If it\n\
1950 is set nonzero, the caller should allocate a PARALLEL of the\n\
1951 appropriate size, copy the initial entries, and call add_clobbers\n\
1952 (found in insn-emit.c) to fill in the CLOBBERs.\n\
1956 The function split_insns returns 0 if the rtl could not\n\
1957 be split or the split rtl in a SEQUENCE if it can be.\n\
1959 The function peephole2_insns returns 0 if the rtl could not\n\
1960 be matched. If there was a match, the new rtl is returned in a SEQUENCE,\n\
1961 and LAST_INSN will point to the last recognized insn in the old sequence.\n\
1966 /* Construct and return a sequence of decisions
1967 that will recognize INSN.
1969 TYPE says what type of routine we are recognizing (RECOG or SPLIT). */
1971 static struct decision_head
1972 make_insn_sequence (insn, type)
1974 enum routine_type type;
1977 const char *c_test = XSTR (insn, type == RECOG ? 2 : 1);
1978 struct decision *last;
1979 struct decision_test *test, **place;
1980 struct decision_head head;
1982 record_insn_name (next_insn_code, (type == RECOG ? XSTR (insn, 0) : NULL));
1984 if (type == PEEPHOLE2)
1988 /* peephole2 gets special treatment:
1989 - X always gets an outer parallel even if it's only one entry
1990 - we remove all traces of outer-level match_scratch and match_dup
1991 expressions here. */
1992 x = rtx_alloc (PARALLEL);
1993 PUT_MODE (x, VOIDmode);
1994 XVEC (x, 0) = rtvec_alloc (XVECLEN (insn, 0));
1995 for (i = j = 0; i < XVECLEN (insn, 0); i++)
1997 rtx tmp = XVECEXP (insn, 0, i);
1998 if (GET_CODE (tmp) != MATCH_SCRATCH && GET_CODE (tmp) != MATCH_DUP)
2000 XVECEXP (x, 0, j) = tmp;
2006 else if (XVECLEN (insn, type == RECOG) == 1)
2007 x = XVECEXP (insn, type == RECOG, 0);
2010 x = rtx_alloc (PARALLEL);
2011 XVEC (x, 0) = XVEC (insn, type == RECOG);
2012 PUT_MODE (x, VOIDmode);
2015 memset(&head, 0, sizeof(head));
2016 last = add_to_sequence (x, &head, "", type, 1);
2018 /* Find the end of the test chain on the last node. */
2019 for (test = last->tests; test->next; test = test->next)
2021 place = &test->next;
2025 /* Need a new node if we have another test to add. */
2026 if (test->type == DT_accept_op)
2028 last = new_decision ("", &last->success);
2029 place = &last->tests;
2031 test = new_decision_test (DT_c_test, &place);
2032 test->u.c_test = c_test;
2035 test = new_decision_test (DT_accept_insn, &place);
2036 test->u.insn.code_number = next_insn_code;
2037 test->u.insn.num_clobbers_to_add = 0;
2042 /* If this is an DEFINE_INSN and X is a PARALLEL, see if it ends
2043 with a group of CLOBBERs of (hard) registers or MATCH_SCRATCHes.
2044 If so, set up to recognize the pattern without these CLOBBERs. */
2046 if (GET_CODE (x) == PARALLEL)
2050 /* Find the last non-clobber in the parallel. */
2051 for (i = XVECLEN (x, 0); i > 0; i--)
2053 rtx y = XVECEXP (x, 0, i - 1);
2054 if (GET_CODE (y) != CLOBBER
2055 || (GET_CODE (XEXP (y, 0)) != REG
2056 && GET_CODE (XEXP (y, 0)) != MATCH_SCRATCH))
2060 if (i != XVECLEN (x, 0))
2063 struct decision_head clobber_head;
2065 /* Build a similar insn without the clobbers. */
2067 new = XVECEXP (x, 0, 0);
2072 new = rtx_alloc (PARALLEL);
2073 XVEC (new, 0) = rtvec_alloc (i);
2074 for (j = i - 1; j >= 0; j--)
2075 XVECEXP (new, 0, j) = XVECEXP (x, 0, j);
2079 memset (&clobber_head, 0, sizeof(clobber_head));
2080 last = add_to_sequence (new, &clobber_head, "", type, 1);
2082 /* Find the end of the test chain on the last node. */
2083 for (test = last->tests; test->next; test = test->next)
2086 /* We definitely have a new test to add -- create a new
2088 place = &test->next;
2089 if (test->type == DT_accept_op)
2091 last = new_decision ("", &last->success);
2092 place = &last->tests;
2097 test = new_decision_test (DT_c_test, &place);
2098 test->u.c_test = c_test;
2101 test = new_decision_test (DT_accept_insn, &place);
2102 test->u.insn.code_number = next_insn_code;
2103 test->u.insn.num_clobbers_to_add = XVECLEN (x, 0) - i;
2105 merge_trees (&head, &clobber_head);
2111 /* Define the subroutine we will call below and emit in genemit. */
2112 printf ("extern rtx gen_split_%d PROTO ((rtx *));\n", next_insn_code);
2116 /* Define the subroutine we will call below and emit in genemit. */
2117 printf ("extern rtx gen_peephole2_%d PROTO ((rtx, rtx *));\n",
2127 process_tree (head, subroutine_type)
2128 struct decision_head *head;
2129 enum routine_type subroutine_type;
2131 if (head->first == NULL)
2134 factor_tests (head);
2135 simplify_tests (head);
2137 next_subroutine_number = 0;
2138 break_out_subroutines (head, 1);
2139 find_afterward (head, NULL);
2141 write_subroutines (head, subroutine_type);
2142 write_subroutine (head, subroutine_type);
2151 struct decision_head recog_tree, split_tree, peephole2_tree, h;
2155 progname = "genrecog";
2156 obstack_init (rtl_obstack);
2158 memset (&recog_tree, 0, sizeof recog_tree);
2159 memset (&split_tree, 0, sizeof split_tree);
2160 memset (&peephole2_tree, 0, sizeof peephole2_tree);
2163 fatal ("No input file name.");
2165 infile = fopen (argv[1], "r");
2169 return FATAL_EXIT_CODE;
2177 /* Read the machine description. */
2181 c = read_skip_spaces (infile);
2186 desc = read_rtx (infile);
2187 if (GET_CODE (desc) == DEFINE_INSN)
2189 h = make_insn_sequence (desc, RECOG);
2190 merge_trees (&recog_tree, &h);
2192 else if (GET_CODE (desc) == DEFINE_SPLIT)
2194 h = make_insn_sequence (desc, SPLIT);
2195 merge_trees (&split_tree, &h);
2197 else if (GET_CODE (desc) == DEFINE_PEEPHOLE2)
2199 h = make_insn_sequence (desc, PEEPHOLE2);
2200 merge_trees (&peephole2_tree, &h);
2203 if (GET_CODE (desc) == DEFINE_PEEPHOLE
2204 || GET_CODE (desc) == DEFINE_EXPAND)
2211 process_tree (&recog_tree, RECOG);
2212 process_tree (&split_tree, SPLIT);
2213 process_tree (&peephole2_tree, PEEPHOLE2);
2216 return (ferror (stdout) != 0 ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE);
2219 /* Define this so we can link with print-rtl.o to get debug_rtx function. */
2221 get_insn_name (code)
2224 if (code < insn_name_ptr_size)
2225 return insn_name_ptr[code];
2231 record_insn_name (code, name)
2235 static const char *last_real_name = "insn";
2236 static int last_real_code = 0;
2239 if (insn_name_ptr_size <= code)
2242 new_size = (insn_name_ptr_size ? insn_name_ptr_size * 2 : 512);
2244 (char **) xrealloc (insn_name_ptr, sizeof(char *) * new_size);
2245 memset (insn_name_ptr + insn_name_ptr_size, 0,
2246 sizeof(char *) * (new_size - insn_name_ptr_size));
2247 insn_name_ptr_size = new_size;
2250 if (!name || name[0] == '\0')
2252 new = xmalloc (strlen (last_real_name) + 10);
2253 sprintf (new, "%s+%d", last_real_name, code - last_real_code);
2257 last_real_name = new = xstrdup (name);
2258 last_real_code = code;
2261 insn_name_ptr[code] = new;
2268 register size_t len = strlen (input) + 1;
2269 register char *output = xmalloc (len);
2270 memcpy (output, input, len);
2275 xrealloc (old, size)
2281 ptr = (PTR) realloc (old, size);
2283 ptr = (PTR) malloc (size);
2285 fatal ("virtual memory exhausted");
2293 register PTR val = (PTR) malloc (size);
2296 fatal ("virtual memory exhausted");
2301 debug_decision_2 (test)
2302 struct decision_test *test;
2307 fprintf (stderr, "mode=%s", GET_MODE_NAME (test->u.mode));
2310 fprintf (stderr, "code=%s", GET_RTX_NAME (test->u.code));
2313 fprintf (stderr, "veclen=%d", test->u.veclen);
2315 case DT_elt_zero_int:
2316 fprintf (stderr, "elt0_i=%d", (int) test->u.intval);
2318 case DT_elt_one_int:
2319 fprintf (stderr, "elt1_i=%d", (int) test->u.intval);
2321 case DT_elt_zero_wide:
2322 fprintf (stderr, "elt0_w=");
2323 fprintf (stderr, HOST_WIDE_INT_PRINT_DEC, test->u.intval);
2326 fprintf (stderr, "dup=%d", test->u.dup);
2329 fprintf (stderr, "pred=(%s,%s)",
2330 test->u.pred.name, GET_MODE_NAME(test->u.pred.mode));
2335 strncpy (sub, test->u.c_test, sizeof(sub));
2336 memcpy (sub+16, "...", 4);
2337 fprintf (stderr, "c_test=\"%s\"", sub);
2341 fprintf (stderr, "A_op=%d", test->u.opno);
2343 case DT_accept_insn:
2344 fprintf (stderr, "A_insn=(%d,%d)",
2345 test->u.insn.code_number, test->u.insn.num_clobbers_to_add);
2354 debug_decision_1 (d, indent)
2359 struct decision_test *test;
2363 for (i = 0; i < indent; ++i)
2365 fputs ("(nil)\n", stderr);
2369 for (i = 0; i < indent; ++i)
2376 debug_decision_2 (test);
2377 while ((test = test->next) != NULL)
2379 fputs (" + ", stderr);
2380 debug_decision_2 (test);
2383 fprintf (stderr, "} %d\n", d->number);
2387 debug_decision_0 (d, indent, maxdepth)
2389 int indent, maxdepth;
2398 for (i = 0; i < indent; ++i)
2400 fputs ("(nil)\n", stderr);
2404 debug_decision_1 (d, indent);
2405 for (n = d->success.first; n ; n = n->next)
2406 debug_decision_0 (n, indent + 2, maxdepth - 1);
2413 debug_decision_0 (d, 0, 1000000);
2417 debug_decision_list (d)
2422 debug_decision_0 (d, 0, 0);