diff options
| author | Jan Hubicka <jh@suse.cz> | 2000-12-15 14:50:32 +0100 |
|---|---|---|
| committer | Jan Hubicka <hubicka@gcc.gnu.org> | 2000-12-15 13:50:32 +0000 |
| commit | 29360e5681e7db46735ca063ffffd1890d06c99f (patch) | |
| tree | d14e672d768f8d154e961c5d75cf68c565cb0060 | |
| parent | dde068d924bc95eb7a0c3b78fc22a9665a2555ba (diff) | |
| download | gcc-29360e5681e7db46735ca063ffffd1890d06c99f.zip gcc-29360e5681e7db46735ca063ffffd1890d06c99f.tar.gz gcc-29360e5681e7db46735ca063ffffd1890d06c99f.tar.bz2 | |
genrecog.c (add_to_sequence): Remove special case for const_int_operand.
* genrecog.c (add_to_sequence): Remove special case for
const_int_operand.
(maybe_both_true): Return 1 when falling out of sequence when
trying to find common possition in the pattern.
From-SVN: r38284
| -rw-r--r-- | gcc/ChangeLog | 7 | ||||
| -rw-r--r-- | gcc/genrecog.c | 10 |
2 files changed, 9 insertions, 8 deletions
diff --git a/gcc/ChangeLog b/gcc/ChangeLog index b342fd7..ec345e5 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,10 @@ +Fri Dec 15 14:48:37 MET 2000 Jan Hubicka <jh@suse.cz> + + * genrecog.c (add_to_sequence): Remove special case for + const_int_operand. + (maybe_both_true): Return 1 when falling out of sequence when + trying to find common possition in the pattern. + Fri Dec 15 14:44:51 MET 2000 Jan Hubicka <jh@suse.cz> * integrate.c (copy_rtx_and_substitute): Copy mode too. diff --git a/gcc/genrecog.c b/gcc/genrecog.c index 795d521..8146b71 100644 --- a/gcc/genrecog.c +++ b/gcc/genrecog.c @@ -826,13 +826,7 @@ add_to_sequence (pattern, last, position, insn_type, top) code = UNKNOWN; } - /* We know exactly what const_int_operand matches -- any CONST_INT. */ - if (strcmp ("const_int_operand", pred_name) == 0) - { - code = CONST_INT; - mode = VOIDmode; - } - else if (pred_name[0] != 0) + if (pred_name[0] != 0) { test = new_decision_test (DT_pred, &place); test->u.pred.name = pred_name; @@ -1206,7 +1200,7 @@ maybe_both_true (d1, d2, toplevel) p1 = d1, d1 = d2, d2 = p1; if (d1->success.first == 0) - return 0; + return 1; for (p1 = d1->success.first; p1; p1 = p1->next) if (maybe_both_true (p1, d2, 0)) return 1; |