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;
406 if (code == MATCH_SCRATCH)
408 pred_name = "scratch_operand";
413 pred_name = XSTR (pattern, 1);
414 if (code == MATCH_PARALLEL)
420 /* We know exactly what const_int_operand matches -- any CONST_INT. */
421 if (strcmp ("const_int_operand", pred_name) == 0)
426 else if (pred_name[0] != 0)
428 test = new_decision_test (DT_pred, &place);
429 test->u.pred.name = pred_name;
430 test->u.pred.mode = mode;
432 /* See if we know about this predicate and save its number. If
433 we do, and it only accepts one code, note that fact. The
434 predicate `const_int_operand' only tests for a CONST_INT, so
435 if we do so we can avoid calling it at all.
437 Finally, if we know that the predicate does not allow
438 CONST_INT, we know that the only way the predicate can match
439 is if the modes match (here we use the kludge of relying on
440 the fact that "address_operand" accepts CONST_INT; otherwise,
441 it would have to be a special case), so we can test the mode
442 (but we need not). This fact should considerably simplify the
445 for (i = 0; i < NUM_KNOWN_PREDS; i++)
446 if (! strcmp (preds[i].name, pred_name))
449 if (i < NUM_KNOWN_PREDS)
451 int allows_const_int, j;
453 test->u.pred.index = i;
455 if (preds[i].codes[1] == 0 && code == UNKNOWN)
456 code = preds[i].codes[0];
458 allows_const_int = 0;
459 for (j = 0; preds[i].codes[j] != 0; j++)
460 if (preds[i].codes[j] == CONST_INT)
462 allows_const_int = 1;
466 /* Can't enforce a mode if we allow const_int. */
467 if (allows_const_int)
472 test->u.pred.index = -1;
473 #ifdef PREDICATE_CODES
474 /* If the port has a list of the predicates it uses but
476 fprintf (stderr, "Warning: `%s' not in PREDICATE_CODES\n",
482 /* Accept the operand, ie. record it in `operands'. */
483 test = new_decision_test (DT_accept_op, &place);
484 test->u.opno = XINT (pattern, 0);
486 if (was_code == MATCH_OPERATOR || was_code == MATCH_PARALLEL)
488 char base = (was_code == MATCH_OPERATOR ? '0' : 'a');
489 for (i = 0; i < (size_t) XVECLEN (pattern, 2); i++)
491 subpos[depth] = i + base;
492 sub = add_to_sequence (XVECEXP (pattern, 2, i),
493 &sub->success, subpos, insn_type, 0);
502 test = new_decision_test (DT_dup, &place);
503 test->u.dup = XINT (pattern, 0);
505 test = new_decision_test (DT_accept_op, &place);
506 test->u.opno = XINT (pattern, 0);
508 for (i = 0; i < (size_t) XVECLEN (pattern, 1); i++)
510 subpos[depth] = i + '0';
511 sub = add_to_sequence (XVECEXP (pattern, 1, i),
512 &sub->success, subpos, insn_type, 0);
520 test = new_decision_test (DT_dup, &place);
521 test->u.dup = XINT (pattern, 0);
525 pattern = XEXP (pattern, 0);
529 /* The operands of a SET must have the same mode unless one
531 if (GET_MODE (SET_SRC (pattern)) != VOIDmode
532 && GET_MODE (SET_DEST (pattern)) != VOIDmode
533 && GET_MODE (SET_SRC (pattern)) != GET_MODE (SET_DEST (pattern))
534 /* The mode of an ADDRESS_OPERAND is the mode of the memory
535 reference, not the mode of the address. */
536 && ! (GET_CODE (SET_SRC (pattern)) == MATCH_OPERAND
537 && ! strcmp (XSTR (SET_SRC (pattern), 1), "address_operand")))
539 print_rtl (stderr, pattern);
540 fputc ('\n', stderr);
541 fatal ("mode mismatch in SET");
546 if (GET_MODE (XEXP (pattern, 0)) != VOIDmode)
548 print_rtl (stderr, pattern);
549 fputc ('\n', stderr);
550 fatal ("operand to LABEL_REF not VOIDmode");
558 fmt = GET_RTX_FORMAT (code);
559 len = GET_RTX_LENGTH (code);
561 /* Do tests against the current node first. */
562 for (i = 0; i < (size_t) len; i++)
568 test = new_decision_test (DT_elt_zero_int, &place);
569 test->u.intval = XINT (pattern, i);
573 test = new_decision_test (DT_elt_one_int, &place);
574 test->u.intval = XINT (pattern, i);
579 else if (fmt[i] == 'w')
584 test = new_decision_test (DT_elt_zero_wide, &place);
585 test->u.intval = XWINT (pattern, i);
587 else if (fmt[i] == 'E')
592 test = new_decision_test (DT_veclen, &place);
593 test->u.veclen = XVECLEN (pattern, i);
597 /* Now test our sub-patterns. */
598 for (i = 0; i < (size_t) len; i++)
603 subpos[depth] = '0' + i;
604 sub = add_to_sequence (XEXP (pattern, i), &sub->success,
605 subpos, insn_type, 0);
611 for (j = 0; j < XVECLEN (pattern, i); j++)
613 subpos[depth] = 'a' + j;
614 sub = add_to_sequence (XVECEXP (pattern, i, j),
615 &sub->success, subpos, insn_type, 0);
632 /* Insert nodes testing mode and code, if they're still relevant,
633 before any of the nodes we may have added above. */
636 place = &this->tests;
637 test = new_decision_test (DT_code, &place);
641 if (mode != VOIDmode)
643 place = &this->tests;
644 test = new_decision_test (DT_mode, &place);
648 /* If we didn't insert any tests or accept nodes, hork. */
649 if (this->tests == NULL)
655 /* A subroutine of maybe_both_true; examines only one test.
656 Returns > 0 for "definitely both true" and < 0 for "maybe both true". */
659 maybe_both_true_2 (d1, d2)
660 struct decision_test *d1, *d2;
662 if (d1->type == d2->type)
667 return d1->u.mode == d2->u.mode;
670 return d1->u.code == d2->u.code;
673 return d1->u.veclen == d2->u.veclen;
675 case DT_elt_zero_int:
677 case DT_elt_zero_wide:
678 return d1->u.intval == d2->u.intval;
685 /* If either has a predicate that we know something about, set
686 things up so that D1 is the one that always has a known
687 predicate. Then see if they have any codes in common. */
689 if (d1->type == DT_pred || d2->type == DT_pred)
691 if (d2->type == DT_pred)
693 struct decision_test *tmp;
694 tmp = d1, d1 = d2, d2 = tmp;
697 /* If D2 tests a mode, see if it matches D1. */
698 if (d1->u.pred.mode != VOIDmode)
700 if (d2->type == DT_mode)
702 if (d1->u.pred.mode != d2->u.mode)
705 else if (d2->type == DT_pred)
707 if (d2->u.pred.mode != VOIDmode
708 && d1->u.pred.mode != d2->u.pred.mode)
713 if (d1->u.pred.index >= 0)
715 /* If D2 tests a code, see if it is in the list of valid
716 codes for D1's predicate. */
717 if (d2->type == DT_code)
719 const RTX_CODE *c = &preds[d1->u.pred.index].codes[0];
722 if (*c == d2->u.code)
730 /* Otherwise see if the predicates have any codes in common. */
731 else if (d2->type == DT_pred && d2->u.pred.index >= 0)
733 const RTX_CODE *c1 = &preds[d1->u.pred.index].codes[0];
736 while (*c1 != 0 && !common)
738 const RTX_CODE *c2 = &preds[d2->u.pred.index].codes[0];
739 while (*c2 != 0 && !common)
741 common = (*c1 == *c2);
756 /* A subroutine of maybe_both_true; examines all the tests for a given node.
757 Returns > 0 for "definitely both true" and < 0 for "maybe both true". */
760 maybe_both_true_1 (d1, d2)
761 struct decision_test *d1, *d2;
763 struct decision_test *t1, *t2;
765 /* A match_operand with no predicate can match anything. Recognize
766 this by the existance of a lone DT_accept_op test. */
767 if (d1->type == DT_accept_op || d2->type == DT_accept_op)
770 /* Eliminate pairs of tests while they can exactly match. */
771 while (d1 && d2 && d1->type == d2->type)
773 if (maybe_both_true_2 (d1, d2) == 0)
775 d1 = d1->next, d2 = d2->next;
778 /* After that, consider all pairs. */
779 for (t1 = d1; t1 ; t1 = t1->next)
780 for (t2 = d2; t2 ; t2 = t2->next)
781 if (maybe_both_true_2 (t1, t2) == 0)
787 /* Return 0 if we can prove that there is no RTL that can match both
788 D1 and D2. Otherwise, return 1 (it may be that there is an RTL that
789 can match both or just that we couldn't prove there wasn't such an RTL).
791 TOPLEVEL is non-zero if we are to only look at the top level and not
792 recursively descend. */
795 maybe_both_true (d1, d2, toplevel)
796 struct decision *d1, *d2;
799 struct decision *p1, *p2;
802 /* Don't compare strings on the different positions in insn. Doing so
803 is incorrect and results in false matches from constructs like
805 [(set (subreg:HI (match_operand:SI "register_operand" "r") 0)
806 (subreg:HI (match_operand:SI "register_operand" "r") 0))]
808 [(set (match_operand:HI "register_operand" "r")
809 (match_operand:HI "register_operand" "r"))]
811 If we are presented with such, we are recursing through the remainder
812 of a node's success nodes (from the loop at the end of this function).
813 Skip forward until we come to a position that matches.
815 Due to the way position strings are constructed, we know that iterating
816 forward from the lexically lower position (e.g. "00") will run into
817 the lexically higher position (e.g. "1") and not the other way around.
818 This saves a bit of effort. */
820 cmp = strcmp (d1->position, d2->position);
826 /* If the d2->position was lexically lower, swap. */
828 p1 = d1, d1 = d2, d2 = p1;
830 if (d1->success.first == 0)
832 for (p1 = d1->success.first; p1; p1 = p1->next)
833 if (maybe_both_true (p1, d2, 0))
839 /* Test the current level. */
840 cmp = maybe_both_true_1 (d1->tests, d2->tests);
844 /* We can't prove that D1 and D2 cannot both be true. If we are only
845 to check the top level, return 1. Otherwise, see if we can prove
846 that all choices in both successors are mutually exclusive. If
847 either does not have any successors, we can't prove they can't both
850 if (toplevel || d1->success.first == 0 || d2->success.first == 0)
853 for (p1 = d1->success.first; p1; p1 = p1->next)
854 for (p2 = d2->success.first; p2; p2 = p2->next)
855 if (maybe_both_true (p1, p2, 0))
861 /* A subroutine of nodes_identical. Examine two tests for equivalence. */
864 nodes_identical_1 (d1, d2)
865 struct decision_test *d1, *d2;
870 return d1->u.mode == d2->u.mode;
873 return d1->u.code == d2->u.code;
876 return (d1->u.pred.mode == d2->u.pred.mode
877 && strcmp (d1->u.pred.name, d2->u.pred.name) == 0);
880 return strcmp (d1->u.c_test, d2->u.c_test) == 0;
883 return d1->u.veclen == d2->u.veclen;
886 return d1->u.dup == d2->u.dup;
888 case DT_elt_zero_int:
890 case DT_elt_zero_wide:
891 return d1->u.intval == d2->u.intval;
894 return d1->u.opno == d2->u.opno;
897 /* Differences will be handled in merge_accept_insn. */
905 /* True iff the two nodes are identical (on one level only). Due
906 to the way these lists are constructed, we shouldn't have to
907 consider different orderings on the tests. */
910 nodes_identical (d1, d2)
911 struct decision *d1, *d2;
913 struct decision_test *t1, *t2;
915 for (t1 = d1->tests, t2 = d2->tests; t1 && t2; t1 = t1->next, t2 = t2->next)
917 if (t1->type != t2->type)
919 if (! nodes_identical_1 (t1, t2))
923 /* For success, they should now both be null. */
927 /* A subroutine of merge_trees; given two nodes that have been declared
928 identical, cope with two insn accept states. If they differ in the
929 number of clobbers, then the conflict was created by make_insn_sequence
930 and we can drop the with-clobbers version on the floor. If both
931 nodes have no additional clobbers, we have found an ambiguity in the
932 source machine description. */
935 merge_accept_insn (oldd, addd)
936 struct decision *oldd, *addd;
938 struct decision_test *old, *add;
940 for (old = oldd->tests; old; old = old->next)
941 if (old->type == DT_accept_insn)
946 for (add = addd->tests; add; add = add->next)
947 if (add->type == DT_accept_insn)
952 /* If one node is for a normal insn and the second is for the base
953 insn with clobbers stripped off, the second node should be ignored. */
955 if (old->u.insn.num_clobbers_to_add == 0
956 && add->u.insn.num_clobbers_to_add > 0)
958 /* Nothing to do here. */
960 else if (old->u.insn.num_clobbers_to_add > 0
961 && add->u.insn.num_clobbers_to_add == 0)
963 /* In this case, replace OLD with ADD. */
964 old->u.insn = add->u.insn;
968 fatal ("Two actions at one point in tree for insns \"%s\" (%d) and \"%s\" (%d)",
969 get_insn_name (old->u.insn.code_number),
970 old->u.insn.code_number,
971 get_insn_name (add->u.insn.code_number),
972 add->u.insn.code_number);
976 /* Merge two decision trees OLDH and ADDH, modifying OLDH destructively. */
979 merge_trees (oldh, addh)
980 struct decision_head *oldh, *addh;
982 struct decision *next, *add;
984 if (addh->first == 0)
986 if (oldh->first == 0)
992 /* Trying to merge bits at different positions isn't possible. */
993 if (strcmp (oldh->first->position, addh->first->position))
996 for (add = addh->first; add ; add = next)
998 struct decision *old, *insert_before = NULL;
1002 /* The semantics of pattern matching state that the tests are
1003 done in the order given in the MD file so that if an insn
1004 matches two patterns, the first one will be used. However,
1005 in practice, most, if not all, patterns are unambiguous so
1006 that their order is independent. In that case, we can merge
1007 identical tests and group all similar modes and codes together.
1009 Scan starting from the end of OLDH until we reach a point
1010 where we reach the head of the list or where we pass a
1011 pattern that could also be true if NEW is true. If we find
1012 an identical pattern, we can merge them. Also, record the
1013 last node that tests the same code and mode and the last one
1014 that tests just the same mode.
1016 If we have no match, place NEW after the closest match we found. */
1018 for (old = oldh->last; old; old = old->prev)
1020 if (nodes_identical (old, add))
1022 merge_accept_insn (old, add);
1023 merge_trees (&old->success, &add->success);
1027 if (maybe_both_true (old, add, 0))
1030 /* Insert the nodes in DT test type order, which is roughly
1031 how expensive/important the test is. Given that the tests
1032 are also ordered within the list, examining the first is
1034 if (add->tests->type < old->tests->type)
1035 insert_before = old;
1038 if (insert_before == NULL)
1041 add->prev = oldh->last;
1042 oldh->last->next = add;
1047 if ((add->prev = insert_before->prev) != NULL)
1048 add->prev->next = add;
1051 add->next = insert_before;
1052 insert_before->prev = add;
1059 /* Walk the tree looking for sub-nodes that perform common tests.
1060 Factor out the common test into a new node. This enables us
1061 (depending on the test type) to emit switch statements later. */
1065 struct decision_head *head;
1067 struct decision *first, *next;
1069 for (first = head->first; first && first->next; first = next)
1071 enum decision_type type;
1072 struct decision *new, *old_last;
1074 type = first->tests->type;
1077 /* Want at least two compatible sequential nodes. */
1078 if (next->tests->type != type)
1081 /* Don't want all node types, just those we can turn into
1082 switch statements. */
1085 && type != DT_veclen
1086 && type != DT_elt_zero_int
1087 && type != DT_elt_one_int
1088 && type != DT_elt_zero_wide)
1091 /* If we'd been performing more than one test, create a new node
1092 below our first test. */
1093 if (first->tests->next != NULL)
1095 new = new_decision (first->position, &first->success);
1096 new->tests = first->tests->next;
1097 first->tests->next = NULL;
1100 /* Crop the node tree off after our first test. */
1102 old_last = head->last;
1105 /* For each compatible test, adjust to perform only one test in
1106 the top level node, then merge the node back into the tree. */
1109 struct decision_head h;
1111 if (next->tests->next != NULL)
1113 new = new_decision (next->position, &next->success);
1114 new->tests = next->tests->next;
1115 next->tests->next = NULL;
1120 h.first = h.last = new;
1122 merge_trees (head, &h);
1124 while (next && next->tests->type == type);
1126 /* After we run out of compatible tests, graft the remaining nodes
1127 back onto the tree. */
1130 next->prev = head->last;
1131 head->last->next = next;
1132 head->last = old_last;
1137 for (first = head->first; first; first = first->next)
1138 factor_tests (&first->success);
1141 /* After factoring, try to simplify the tests on any one node.
1142 Tests that are useful for switch statements are recognizable
1143 by having only a single test on a node -- we'll be manipulating
1144 nodes with multiple tests:
1146 If we have mode tests or code tests that are redundant with
1147 predicates, remove them. */
1150 simplify_tests (head)
1151 struct decision_head *head;
1153 struct decision *tree;
1155 for (tree = head->first; tree; tree = tree->next)
1157 struct decision_test *a, *b;
1164 /* Find a predicate node. */
1165 while (b && b->type != DT_pred)
1169 /* Due to how these tests are constructed, we don't even need
1170 to check that the mode and code are compatible -- they were
1171 generated from the predicate in the first place. */
1172 while (a->type == DT_mode || a->type == DT_code)
1179 for (tree = head->first; tree; tree = tree->next)
1180 simplify_tests (&tree->success);
1183 /* Count the number of subnodes of HEAD. If the number is high enough,
1184 make the first node in HEAD start a separate subroutine in the C code
1185 that is generated. */
1188 break_out_subroutines (head, initial)
1189 struct decision_head *head;
1193 struct decision *sub;
1195 for (sub = head->first; sub; sub = sub->next)
1196 size += 1 + break_out_subroutines (&sub->success, 0);
1198 if (size > SUBROUTINE_THRESHOLD && ! initial)
1200 head->first->subroutine_number = ++next_subroutine_number;
1206 /* For each node p, find the next alternative that might be true
1210 find_afterward (head, real_afterward)
1211 struct decision_head *head;
1212 struct decision *real_afterward;
1214 struct decision *p, *q, *afterward;
1216 /* We can't propogate alternatives across subroutine boundaries.
1217 This is not incorrect, merely a minor optimization loss. */
1220 afterward = (p->subroutine_number > 0 ? NULL : real_afterward);
1222 for ( ; p ; p = p->next)
1224 /* Find the next node that might be true if this one fails. */
1225 for (q = p->next; q ; q = q->next)
1226 if (maybe_both_true (p, q, 1))
1229 /* If we reached the end of the list without finding one,
1230 use the incoming afterward position. */
1239 for (p = head->first; p ; p = p->next)
1240 if (p->success.first)
1241 find_afterward (&p->success, p->afterward);
1243 /* When we are generating a subroutine, record the real afterward
1244 position in the first node where write_tree can find it, and we
1245 can do the right thing at the subroutine call site. */
1247 if (p->subroutine_number > 0)
1248 p->afterward = real_afterward;
1251 /* Assuming that the state of argument is denoted by OLDPOS, take whatever
1252 actions are necessary to move to NEWPOS. If we fail to move to the
1253 new state, branch to node AFTERWARD if non-zero, otherwise return.
1255 Failure to move to the new state can only occur if we are trying to
1256 match multiple insns and we try to step past the end of the stream. */
1259 change_state (oldpos, newpos, afterward, indent)
1262 struct decision *afterward;
1265 int odepth = strlen (oldpos);
1266 int ndepth = strlen (newpos);
1268 int old_has_insn, new_has_insn;
1270 /* Pop up as many levels as necessary. */
1271 for (depth = odepth; strncmp (oldpos, newpos, depth) != 0; --depth)
1274 /* Hunt for the last [A-Z] in both strings. */
1275 for (old_has_insn = odepth - 1; old_has_insn >= 0; --old_has_insn)
1276 if (oldpos[old_has_insn] >= 'A' && oldpos[old_has_insn] <= 'Z')
1278 for (new_has_insn = odepth - 1; new_has_insn >= 0; --new_has_insn)
1279 if (newpos[new_has_insn] >= 'A' && newpos[new_has_insn] <= 'Z')
1282 /* Make sure to reset the _last_insn pointer when popping back up. */
1283 if (old_has_insn >= 0 && new_has_insn < 0)
1284 printf ("%s_last_insn = insn;\n", indent);
1286 /* Go down to desired level. */
1287 while (depth < ndepth)
1289 /* It's a different insn from the first one. */
1290 if (newpos[depth] >= 'A' && newpos[depth] <= 'Z')
1292 /* We can only fail if we're moving down the tree. */
1293 if (old_has_insn >= 0 && oldpos[old_has_insn] >= newpos[depth])
1295 printf ("%s_last_insn = recog_next_insn (insn, %d);\n",
1296 indent, newpos[depth] - 'A');
1300 printf ("%stem = recog_next_insn (insn, %d);\n",
1301 indent, newpos[depth] - 'A');
1302 printf ("%sif (tem == NULL_RTX)\n", indent);
1304 printf ("%s goto L%d;\n", indent, afterward->number);
1306 printf ("%s goto ret0;\n", indent);
1307 printf ("%s_last_insn = tem;\n", indent);
1309 printf ("%sx%d = PATTERN (_last_insn);\n", indent, depth + 1);
1311 else if (newpos[depth] >= 'a' && newpos[depth] <= 'z')
1312 printf ("%sx%d = XVECEXP (x%d, 0, %d);\n",
1313 indent, depth + 1, depth, newpos[depth] - 'a');
1315 printf ("%sx%d = XEXP (x%d, %c);\n",
1316 indent, depth + 1, depth, newpos[depth]);
1321 /* Print the enumerator constant for CODE -- the upcase version of
1328 register const char *p;
1329 for (p = GET_RTX_NAME (code); *p; p++)
1330 putchar (TOUPPER (*p));
1333 /* Emit code to cross an afterward link -- change state and branch. */
1336 write_afterward (start, afterward, indent)
1337 struct decision *start;
1338 struct decision *afterward;
1341 if (!afterward || start->subroutine_number > 0)
1342 printf("%sgoto ret0;\n", indent);
1345 change_state (start->position, afterward->position, NULL, indent);
1346 printf ("%sgoto L%d;\n", indent, afterward->number);
1350 /* Emit a switch statement, if possible, for an initial sequence of
1351 nodes at START. Return the first node yet untested. */
1353 static struct decision *
1354 write_switch (start, depth)
1355 struct decision *start;
1358 struct decision *p = start;
1359 enum decision_type type = p->tests->type;
1361 /* If we have two or more nodes in sequence that test the same one
1362 thing, we may be able to use a switch statement. */
1366 || p->next->tests->type != type
1367 || p->next->tests->next)
1370 /* DT_code is special in that we can do interesting things with
1371 known predicates at the same time. */
1372 if (type == DT_code)
1374 char codemap[NUM_RTX_CODE];
1375 struct decision *ret;
1377 memset (codemap, 0, sizeof(codemap));
1379 printf (" switch (GET_CODE (x%d))\n {\n", depth);
1382 RTX_CODE code = p->tests->u.code;
1385 printf (":\n goto L%d;\n", p->success.first->number);
1386 p->success.first->need_label = 1;
1391 while (p && p->tests->type == DT_code && !p->tests->next);
1393 /* If P is testing a predicate that we know about and we haven't
1394 seen any of the codes that are valid for the predicate, we can
1395 write a series of "case" statement, one for each possible code.
1396 Since we are already in a switch, these redundant tests are very
1397 cheap and will reduce the number of predicates called. */
1399 /* Note that while we write out cases for these predicates here,
1400 we don't actually write the test here, as it gets kinda messy.
1401 It is trivial to leave this to later by telling our caller that
1402 we only processed the CODE tests. */
1405 while (p && p->tests->type == DT_pred
1406 && p->tests->u.pred.index >= 0)
1410 for (c = &preds[p->tests->u.pred.index].codes[0]; *c ; ++c)
1411 if (codemap[(int) *c] != 0)
1414 for (c = &preds[p->tests->u.pred.index].codes[0]; *c ; ++c)
1419 codemap[(int) *c] = 1;
1422 printf (" goto L%d;\n", p->number);
1428 /* Make the default case skip the predicates we managed to match. */
1430 printf (" default:\n");
1435 printf (" goto L%d;\n", p->number);
1439 write_afterward (start, start->afterward, " ");
1442 printf (" break;\n");
1447 else if (type == DT_mode
1448 || type == DT_veclen
1449 || type == DT_elt_zero_int
1450 || type == DT_elt_one_int
1451 || type == DT_elt_zero_wide)
1455 printf (" switch (");
1459 str = "GET_MODE (x%d)";
1462 str = "XVECLEN (x%d, 0)";
1464 case DT_elt_zero_int:
1465 str = "XINT (x%d, 0)";
1467 case DT_elt_one_int:
1468 str = "XINT (x%d, 1)";
1470 case DT_elt_zero_wide:
1471 str = "XWINT (x%d, 0)";
1476 printf (str, depth);
1485 printf ("%smode", GET_MODE_NAME (p->tests->u.mode));
1488 printf ("%d", p->tests->u.veclen);
1490 case DT_elt_zero_int:
1491 case DT_elt_one_int:
1492 case DT_elt_zero_wide:
1493 printf (HOST_WIDE_INT_PRINT_DEC, p->tests->u.intval);
1498 printf (":\n goto L%d;\n", p->success.first->number);
1499 p->success.first->need_label = 1;
1503 while (p && p->tests->type == type && !p->tests->next);
1505 printf (" default:\n break;\n }\n");
1511 /* None of the other tests are ameanable. */
1516 /* Emit code for one test. */
1519 write_cond (p, depth, subroutine_type)
1520 struct decision_test *p;
1522 enum routine_type subroutine_type;
1527 printf ("GET_MODE (x%d) == %smode", depth, GET_MODE_NAME (p->u.mode));
1531 printf ("GET_CODE (x%d) == ", depth);
1532 print_code (p->u.code);
1536 printf ("XVECLEN (x%d, 0) == %d", depth, p->u.veclen);
1539 case DT_elt_zero_int:
1540 printf ("XINT (x%d, 0) == %d", depth, (int) p->u.intval);
1543 case DT_elt_one_int:
1544 printf ("XINT (x%d, 1) == %d", depth, (int) p->u.intval);
1547 case DT_elt_zero_wide:
1548 printf ("XWINT (x%d, 0) == ", depth);
1549 printf (HOST_WIDE_INT_PRINT_DEC, p->u.intval);
1553 printf ("rtx_equal_p (x%d, operands[%d])", depth, p->u.dup);
1557 printf ("%s (x%d, %smode)", p->u.pred.name, depth,
1558 GET_MODE_NAME (p->u.pred.mode));
1562 printf ("(%s)", p->u.c_test);
1565 case DT_accept_insn:
1566 switch (subroutine_type)
1569 if (p->u.insn.num_clobbers_to_add == 0)
1571 printf ("pnum_clobbers != NULL");
1584 /* Emit code for one action. The previous tests have succeeded;
1585 TEST is the last of the chain. In the normal case we simply
1586 perform a state change. For the `accept' tests we must do more work. */
1589 write_action (test, depth, uncond, success, subroutine_type)
1590 struct decision_test *test;
1592 struct decision *success;
1593 enum routine_type subroutine_type;
1600 else if (test->type == DT_accept_op || test->type == DT_accept_insn)
1602 fputs (" {\n", stdout);
1609 if (test->type == DT_accept_op)
1611 printf("%soperands[%d] = x%d;\n", indent, test->u.opno, depth);
1613 /* Only allow DT_accept_insn to follow. */
1617 if (test->type != DT_accept_insn)
1622 /* Sanity check that we're now at the end of the list of tests. */
1626 if (test->type == DT_accept_insn)
1628 switch (subroutine_type)
1631 if (test->u.insn.num_clobbers_to_add != 0)
1632 printf ("%s*pnum_clobbers = %d;\n",
1633 indent, test->u.insn.num_clobbers_to_add);
1634 printf ("%sreturn %d;\n", indent, test->u.insn.code_number);
1638 printf ("%sreturn gen_split_%d (operands);\n",
1639 indent, test->u.insn.code_number);
1643 printf ("%stem = gen_peephole2_%d (insn, operands);\n",
1644 indent, test->u.insn.code_number);
1645 printf ("%sif (tem != 0)\n%s goto ret1;\n", indent, indent);
1654 printf("%sgoto L%d;\n", indent, success->number);
1655 success->need_label = 1;
1659 fputs (" }\n", stdout);
1662 /* Return 1 if the test is always true and has no fallthru path. Return -1
1663 if the test does have a fallthru path, but requires that the condition be
1664 terminated. Otherwise return 0 for a normal test. */
1665 /* ??? is_unconditional is a stupid name for a tri-state function. */
1668 is_unconditional (t, subroutine_type)
1669 struct decision_test *t;
1670 enum routine_type subroutine_type;
1672 if (t->type == DT_accept_op)
1675 if (t->type == DT_accept_insn)
1677 switch (subroutine_type)
1680 return (t->u.insn.num_clobbers_to_add == 0);
1693 /* Emit code for one node -- the conditional and the accompanying action.
1694 Return true if there is no fallthru path. */
1697 write_node (p, depth, subroutine_type)
1700 enum routine_type subroutine_type;
1702 struct decision_test *test, *last_test;
1705 last_test = test = p->tests;
1706 uncond = is_unconditional (test, subroutine_type);
1710 write_cond (test, depth, subroutine_type);
1712 while ((test = test->next) != NULL)
1717 uncond2 = is_unconditional (test, subroutine_type);
1722 write_cond (test, depth, subroutine_type);
1728 write_action (last_test, depth, uncond, p->success.first, subroutine_type);
1733 /* Emit code for all of the sibling nodes of HEAD. */
1736 write_tree_1 (head, depth, subroutine_type)
1737 struct decision_head *head;
1739 enum routine_type subroutine_type;
1741 struct decision *p, *next;
1744 for (p = head->first; p ; p = next)
1746 /* The label for the first element was printed in write_tree. */
1747 if (p != head->first && p->need_label)
1748 OUTPUT_LABEL (" ", p->number);
1750 /* Attempt to write a switch statement for a whole sequence. */
1751 next = write_switch (p, depth);
1756 /* Failed -- fall back and write one node. */
1757 uncond = write_node (p, depth, subroutine_type);
1762 /* Finished with this chain. Close a fallthru path by branching
1763 to the afterward node. */
1765 write_afterward (head->last, head->last->afterward, " ");
1768 /* Write out the decision tree starting at HEAD. PREVPOS is the
1769 position at the node that branched to this node. */
1772 write_tree (head, prevpos, type, initial)
1773 struct decision_head *head;
1774 const char *prevpos;
1775 enum routine_type type;
1778 register struct decision *p = head->first;
1782 OUTPUT_LABEL (" ", p->number);
1784 if (! initial && p->subroutine_number > 0)
1786 static const char * const name_prefix[] = {
1787 "recog", "split", "peephole2"
1790 static const char * const call_suffix[] = {
1791 ", pnum_clobbers", "", ", _plast_insn"
1794 /* This node has been broken out into a separate subroutine.
1795 Call it, test the result, and branch accordingly. */
1799 printf (" tem = %s_%d (x0, insn%s);\n",
1800 name_prefix[type], p->subroutine_number, call_suffix[type]);
1801 if (IS_SPLIT (type))
1802 printf (" if (tem != 0)\n return tem;\n");
1804 printf (" if (tem >= 0)\n return tem;\n");
1806 change_state (p->position, p->afterward->position, NULL, " ");
1807 printf (" goto L%d;\n", p->afterward->number);
1811 printf (" return %s_%d (x0, insn%s);\n",
1812 name_prefix[type], p->subroutine_number, call_suffix[type]);
1817 int depth = strlen (p->position);
1819 change_state (prevpos, p->position, head->last->afterward, " ");
1820 write_tree_1 (head, depth, type);
1822 for (p = head->first; p; p = p->next)
1823 if (p->success.first)
1824 write_tree (&p->success, p->position, type, 0);
1828 /* Write out a subroutine of type TYPE to do comparisons starting at
1832 write_subroutine (head, type)
1833 struct decision_head *head;
1834 enum routine_type type;
1836 static const char * const proto_pattern[] = {
1837 "%sint recog%s PROTO ((rtx, rtx, int *));\n",
1838 "%srtx split%s PROTO ((rtx, rtx));\n",
1839 "%srtx peephole2%s PROTO ((rtx, rtx, rtx *));\n"
1842 static const char * const decl_pattern[] = {
1844 recog%s (x0, insn, pnum_clobbers)\n\
1846 rtx insn ATTRIBUTE_UNUSED;\n\
1847 int *pnum_clobbers ATTRIBUTE_UNUSED;\n",
1850 split%s (x0, insn)\n\
1852 rtx insn ATTRIBUTE_UNUSED;\n",
1855 peephole2%s (x0, insn, _plast_insn)\n\
1857 rtx insn ATTRIBUTE_UNUSED;\n\
1858 rtx *_plast_insn ATTRIBUTE_UNUSED;\n"
1861 int subfunction = head->first->subroutine_number;
1866 s_or_e = subfunction ? "static " : "";
1869 sprintf (extension, "_%d", subfunction);
1870 else if (type == RECOG)
1871 extension[0] = '\0';
1873 strcpy (extension, "_insns");
1875 printf (proto_pattern[type], s_or_e, extension);
1876 printf (decl_pattern[type], s_or_e, extension);
1878 printf ("{\n register rtx * const operands = &recog_data.operand[0];\n");
1879 for (i = 1; i <= max_depth; i++)
1880 printf (" register rtx x%d ATTRIBUTE_UNUSED;\n", i);
1882 if (type == PEEPHOLE2)
1883 printf (" register rtx _last_insn = insn;\n");
1884 printf (" %s tem ATTRIBUTE_UNUSED;\n", IS_SPLIT (type) ? "rtx" : "int");
1886 write_tree (head, "", type, 1);
1888 if (type == PEEPHOLE2)
1889 printf (" ret1:\n *_plast_insn = _last_insn;\n return tem;\n");
1890 printf (" ret0:\n return %d;\n}\n\n", IS_SPLIT (type) ? 0 : -1);
1893 /* In break_out_subroutines, we discovered the boundaries for the
1894 subroutines, but did not write them out. Do so now. */
1897 write_subroutines (head, type)
1898 struct decision_head *head;
1899 enum routine_type type;
1903 for (p = head->first; p ; p = p->next)
1904 if (p->success.first)
1905 write_subroutines (&p->success, type);
1907 if (head->first->subroutine_number > 0)
1908 write_subroutine (head, type);
1911 /* Begin the output file. */
1917 /* Generated automatically by the program `genrecog' from the target\n\
1918 machine description file. */\n\
1920 #include \"config.h\"\n\
1921 #include \"system.h\"\n\
1922 #include \"rtl.h\"\n\
1923 #include \"tm_p.h\"\n\
1924 #include \"function.h\"\n\
1925 #include \"insn-config.h\"\n\
1926 #include \"recog.h\"\n\
1927 #include \"real.h\"\n\
1928 #include \"output.h\"\n\
1929 #include \"flags.h\"\n\
1933 /* `recog' contains a decision tree that recognizes whether the rtx\n\
1934 X0 is a valid instruction.\n\
1936 recog returns -1 if the rtx is not valid. If the rtx is valid, recog\n\
1937 returns a nonnegative number which is the insn code number for the\n\
1938 pattern that matched. This is the same as the order in the machine\n\
1939 description of the entry that matched. This number can be used as an\n\
1940 index into `insn_data' and other tables.\n\
1942 The third argument to recog is an optional pointer to an int. If\n\
1943 present, recog will accept a pattern if it matches except for missing\n\
1944 CLOBBER expressions at the end. In that case, the value pointed to by\n\
1945 the optional pointer will be set to the number of CLOBBERs that need\n\
1946 to be added (it should be initialized to zero by the caller). If it\n\
1947 is set nonzero, the caller should allocate a PARALLEL of the\n\
1948 appropriate size, copy the initial entries, and call add_clobbers\n\
1949 (found in insn-emit.c) to fill in the CLOBBERs.\n\
1953 The function split_insns returns 0 if the rtl could not\n\
1954 be split or the split rtl in a SEQUENCE if it can be.\n\
1956 The function peephole2_insns returns 0 if the rtl could not\n\
1957 be matched. If there was a match, the new rtl is returned in a SEQUENCE,\n\
1958 and LAST_INSN will point to the last recognized insn in the old sequence.\n\
1963 /* Construct and return a sequence of decisions
1964 that will recognize INSN.
1966 TYPE says what type of routine we are recognizing (RECOG or SPLIT). */
1968 static struct decision_head
1969 make_insn_sequence (insn, type)
1971 enum routine_type type;
1974 const char *c_test = XSTR (insn, type == RECOG ? 2 : 1);
1975 struct decision *last;
1976 struct decision_test *test, **place;
1977 struct decision_head head;
1979 record_insn_name (next_insn_code, (type == RECOG ? XSTR (insn, 0) : NULL));
1981 if (type == PEEPHOLE2)
1985 /* peephole2 gets special treatment:
1986 - X always gets an outer parallel even if it's only one entry
1987 - we remove all traces of outer-level match_scratch and match_dup
1988 expressions here. */
1989 x = rtx_alloc (PARALLEL);
1990 PUT_MODE (x, VOIDmode);
1991 XVEC (x, 0) = rtvec_alloc (XVECLEN (insn, 0));
1992 for (i = j = 0; i < XVECLEN (insn, 0); i++)
1994 rtx tmp = XVECEXP (insn, 0, i);
1995 if (GET_CODE (tmp) != MATCH_SCRATCH && GET_CODE (tmp) != MATCH_DUP)
1997 XVECEXP (x, 0, j) = tmp;
2003 else if (XVECLEN (insn, type == RECOG) == 1)
2004 x = XVECEXP (insn, type == RECOG, 0);
2007 x = rtx_alloc (PARALLEL);
2008 XVEC (x, 0) = XVEC (insn, type == RECOG);
2009 PUT_MODE (x, VOIDmode);
2012 memset(&head, 0, sizeof(head));
2013 last = add_to_sequence (x, &head, "", type, 1);
2015 /* Find the end of the test chain on the last node. */
2016 for (test = last->tests; test->next; test = test->next)
2018 place = &test->next;
2022 /* Need a new node if we have another test to add. */
2023 if (test->type == DT_accept_op)
2025 last = new_decision ("", &last->success);
2026 place = &last->tests;
2028 test = new_decision_test (DT_c_test, &place);
2029 test->u.c_test = c_test;
2032 test = new_decision_test (DT_accept_insn, &place);
2033 test->u.insn.code_number = next_insn_code;
2034 test->u.insn.num_clobbers_to_add = 0;
2039 /* If this is an DEFINE_INSN and X is a PARALLEL, see if it ends
2040 with a group of CLOBBERs of (hard) registers or MATCH_SCRATCHes.
2041 If so, set up to recognize the pattern without these CLOBBERs. */
2043 if (GET_CODE (x) == PARALLEL)
2047 /* Find the last non-clobber in the parallel. */
2048 for (i = XVECLEN (x, 0); i > 0; i--)
2050 rtx y = XVECEXP (x, 0, i - 1);
2051 if (GET_CODE (y) != CLOBBER
2052 || (GET_CODE (XEXP (y, 0)) != REG
2053 && GET_CODE (XEXP (y, 0)) != MATCH_SCRATCH))
2057 if (i != XVECLEN (x, 0))
2060 struct decision_head clobber_head;
2062 /* Build a similar insn without the clobbers. */
2064 new = XVECEXP (x, 0, 0);
2069 new = rtx_alloc (PARALLEL);
2070 XVEC (new, 0) = rtvec_alloc (i);
2071 for (j = i - 1; j >= 0; j--)
2072 XVECEXP (new, 0, j) = XVECEXP (x, 0, j);
2076 memset (&clobber_head, 0, sizeof(clobber_head));
2077 last = add_to_sequence (new, &clobber_head, "", type, 1);
2079 /* Find the end of the test chain on the last node. */
2080 for (test = last->tests; test->next; test = test->next)
2083 /* We definitely have a new test to add -- create a new
2085 place = &test->next;
2086 if (test->type == DT_accept_op)
2088 last = new_decision ("", &last->success);
2089 place = &last->tests;
2094 test = new_decision_test (DT_c_test, &place);
2095 test->u.c_test = c_test;
2098 test = new_decision_test (DT_accept_insn, &place);
2099 test->u.insn.code_number = next_insn_code;
2100 test->u.insn.num_clobbers_to_add = XVECLEN (x, 0) - i;
2102 merge_trees (&head, &clobber_head);
2108 /* Define the subroutine we will call below and emit in genemit. */
2109 printf ("extern rtx gen_split_%d PROTO ((rtx *));\n", next_insn_code);
2113 /* Define the subroutine we will call below and emit in genemit. */
2114 printf ("extern rtx gen_peephole2_%d PROTO ((rtx, rtx *));\n",
2124 process_tree (head, subroutine_type)
2125 struct decision_head *head;
2126 enum routine_type subroutine_type;
2128 if (head->first == NULL)
2131 factor_tests (head);
2132 simplify_tests (head);
2134 next_subroutine_number = 0;
2135 break_out_subroutines (head, 1);
2136 find_afterward (head, NULL);
2138 write_subroutines (head, subroutine_type);
2139 write_subroutine (head, subroutine_type);
2148 struct decision_head recog_tree, split_tree, peephole2_tree, h;
2152 progname = "genrecog";
2153 obstack_init (rtl_obstack);
2155 memset (&recog_tree, 0, sizeof recog_tree);
2156 memset (&split_tree, 0, sizeof split_tree);
2157 memset (&peephole2_tree, 0, sizeof peephole2_tree);
2160 fatal ("No input file name.");
2162 infile = fopen (argv[1], "r");
2166 return FATAL_EXIT_CODE;
2174 /* Read the machine description. */
2178 c = read_skip_spaces (infile);
2183 desc = read_rtx (infile);
2184 if (GET_CODE (desc) == DEFINE_INSN)
2186 h = make_insn_sequence (desc, RECOG);
2187 merge_trees (&recog_tree, &h);
2189 else if (GET_CODE (desc) == DEFINE_SPLIT)
2191 h = make_insn_sequence (desc, SPLIT);
2192 merge_trees (&split_tree, &h);
2194 else if (GET_CODE (desc) == DEFINE_PEEPHOLE2)
2196 h = make_insn_sequence (desc, PEEPHOLE2);
2197 merge_trees (&peephole2_tree, &h);
2200 if (GET_CODE (desc) == DEFINE_PEEPHOLE
2201 || GET_CODE (desc) == DEFINE_EXPAND)
2208 process_tree (&recog_tree, RECOG);
2209 process_tree (&split_tree, SPLIT);
2210 process_tree (&peephole2_tree, PEEPHOLE2);
2213 return (ferror (stdout) != 0 ? FATAL_EXIT_CODE : SUCCESS_EXIT_CODE);
2216 /* Define this so we can link with print-rtl.o to get debug_rtx function. */
2218 get_insn_name (code)
2221 if (code < insn_name_ptr_size)
2222 return insn_name_ptr[code];
2228 record_insn_name (code, name)
2232 static const char *last_real_name = "insn";
2233 static int last_real_code = 0;
2236 if (insn_name_ptr_size <= code)
2239 new_size = (insn_name_ptr_size ? insn_name_ptr_size * 2 : 512);
2241 (char **) xrealloc (insn_name_ptr, sizeof(char *) * new_size);
2242 memset (insn_name_ptr + insn_name_ptr_size, 0,
2243 sizeof(char *) * (new_size - insn_name_ptr_size));
2244 insn_name_ptr_size = new_size;
2247 if (!name || name[0] == '\0')
2249 new = xmalloc (strlen (last_real_name) + 10);
2250 sprintf (new, "%s+%d", last_real_name, code - last_real_code);
2254 last_real_name = new = xstrdup (name);
2255 last_real_code = code;
2258 insn_name_ptr[code] = new;
2265 register size_t len = strlen (input) + 1;
2266 register char *output = xmalloc (len);
2267 memcpy (output, input, len);
2272 xrealloc (old, size)
2278 ptr = (PTR) realloc (old, size);
2280 ptr = (PTR) malloc (size);
2282 fatal ("virtual memory exhausted");
2290 register PTR val = (PTR) malloc (size);
2293 fatal ("virtual memory exhausted");
2298 debug_decision_2 (test)
2299 struct decision_test *test;
2304 fprintf (stderr, "mode=%s", GET_MODE_NAME (test->u.mode));
2307 fprintf (stderr, "code=%s", GET_RTX_NAME (test->u.code));
2310 fprintf (stderr, "veclen=%d", test->u.veclen);
2312 case DT_elt_zero_int:
2313 fprintf (stderr, "elt0_i=%d", (int) test->u.intval);
2315 case DT_elt_one_int:
2316 fprintf (stderr, "elt1_i=%d", (int) test->u.intval);
2318 case DT_elt_zero_wide:
2319 fprintf (stderr, "elt0_w=");
2320 fprintf (stderr, HOST_WIDE_INT_PRINT_DEC, test->u.intval);
2323 fprintf (stderr, "dup=%d", test->u.dup);
2326 fprintf (stderr, "pred=(%s,%s)",
2327 test->u.pred.name, GET_MODE_NAME(test->u.pred.mode));
2332 strncpy (sub, test->u.c_test, sizeof(sub));
2333 memcpy (sub+16, "...", 4);
2334 fprintf (stderr, "c_test=\"%s\"", sub);
2338 fprintf (stderr, "A_op=%d", test->u.opno);
2340 case DT_accept_insn:
2341 fprintf (stderr, "A_insn=(%d,%d)",
2342 test->u.insn.code_number, test->u.insn.num_clobbers_to_add);
2351 debug_decision_1 (d, indent)
2356 struct decision_test *test;
2360 for (i = 0; i < indent; ++i)
2362 fputs ("(nil)\n", stderr);
2366 for (i = 0; i < indent; ++i)
2373 debug_decision_2 (test);
2374 while ((test = test->next) != NULL)
2376 fputs (" + ", stderr);
2377 debug_decision_2 (test);
2380 fprintf (stderr, "} %d\n", d->number);
2384 debug_decision_0 (d, indent, maxdepth)
2386 int indent, maxdepth;
2395 for (i = 0; i < indent; ++i)
2397 fputs ("(nil)\n", stderr);
2401 debug_decision_1 (d, indent);
2402 for (n = d->success.first; n ; n = n->next)
2403 debug_decision_0 (n, indent + 2, maxdepth - 1);
2410 debug_decision_0 (d, 0, 1000000);