1 /* Optimize by combining instructions for GNU compiler.
2 Copyright (C) 1987, 1988, 1992 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, 675 Mass Ave, Cambridge, MA 02139, USA. */
21 /* This module is essentially the "combiner" phase of the U. of Arizona
22 Portable Optimizer, but redone to work on our list-structured
23 representation for RTL instead of their string representation.
25 The LOG_LINKS of each insn identify the most recent assignment
26 to each REG used in the insn. It is a list of previous insns,
27 each of which contains a SET for a REG that is used in this insn
28 and not used or set in between. LOG_LINKs never cross basic blocks.
29 They were set up by the preceding pass (lifetime analysis).
31 We try to combine each pair of insns joined by a logical link.
32 We also try to combine triples of insns A, B and C when
33 C has a link back to B and B has a link back to A.
35 LOG_LINKS does not have links for use of the CC0. They don't
36 need to, because the insn that sets the CC0 is always immediately
37 before the insn that tests it. So we always regard a branch
38 insn as having a logical link to the preceding insn. The same is true
39 for an insn explicitly using CC0.
41 We check (with use_crosses_set_p) to avoid combining in such a way
42 as to move a computation to a place where its value would be different.
44 Combination is done by mathematically substituting the previous
45 insn(s) values for the regs they set into the expressions in
46 the later insns that refer to these regs. If the result is a valid insn
47 for our target machine, according to the machine description,
48 we install it, delete the earlier insns, and update the data flow
49 information (LOG_LINKS and REG_NOTES) for what we did.
51 There are a few exceptions where the dataflow information created by
52 flow.c aren't completely updated:
54 - reg_live_length is not updated
55 - reg_n_refs is not adjusted in the rare case when a register is
56 no longer required in a computation
57 - there are extremely rare cases (see distribute_regnotes) when a
59 - a LOG_LINKS entry that refers to an insn with multiple SETs may be
60 removed because there is no way to know which register it was
63 To simplify substitution, we combine only when the earlier insn(s)
64 consist of only a single assignment. To simplify updating afterward,
65 we never combine when a subroutine call appears in the middle.
67 Since we do not represent assignments to CC0 explicitly except when that
68 is all an insn does, there is no LOG_LINKS entry in an insn that uses
69 the condition code for the insn that set the condition code.
70 Fortunately, these two insns must be consecutive.
71 Therefore, every JUMP_INSN is taken to have an implicit logical link
72 to the preceding insn. This is not quite right, since non-jumps can
73 also use the condition code; but in practice such insns would not
82 #include "basic-block.h"
83 #include "insn-config.h"
84 #include "insn-flags.h"
85 #include "insn-codes.h"
86 #include "insn-attr.h"
91 /* It is not safe to use ordinary gen_lowpart in combine.
92 Use gen_lowpart_for_combine instead. See comments there. */
93 #define gen_lowpart dont_use_gen_lowpart_you_dummy
95 /* Number of attempts to combine instructions in this function. */
97 static int combine_attempts;
99 /* Number of attempts that got as far as substitution in this function. */
101 static int combine_merges;
103 /* Number of instructions combined with added SETs in this function. */
105 static int combine_extras;
107 /* Number of instructions combined in this function. */
109 static int combine_successes;
111 /* Totals over entire compilation. */
113 static int total_attempts, total_merges, total_extras, total_successes;
115 /* Vector mapping INSN_UIDs to cuids.
116 The cuids are like uids but increase monotonically always.
117 Combine always uses cuids so that it can compare them.
118 But actually renumbering the uids, which we used to do,
119 proves to be a bad idea because it makes it hard to compare
120 the dumps produced by earlier passes with those from later passes. */
122 static int *uid_cuid;
124 /* Get the cuid of an insn. */
126 #define INSN_CUID(INSN) (uid_cuid[INSN_UID (INSN)])
128 /* Maximum register number, which is the size of the tables below. */
130 static int combine_max_regno;
132 /* Record last point of death of (hard or pseudo) register n. */
134 static rtx *reg_last_death;
136 /* Record last point of modification of (hard or pseudo) register n. */
138 static rtx *reg_last_set;
140 /* Record the cuid of the last insn that invalidated memory
141 (anything that writes memory, and subroutine calls, but not pushes). */
143 static int mem_last_set;
145 /* Record the cuid of the last CALL_INSN
146 so we can tell whether a potential combination crosses any calls. */
148 static int last_call_cuid;
150 /* When `subst' is called, this is the insn that is being modified
151 (by combining in a previous insn). The PATTERN of this insn
152 is still the old pattern partially modified and it should not be
153 looked at, but this may be used to examine the successors of the insn
154 to judge whether a simplification is valid. */
156 static rtx subst_insn;
158 /* This is the lowest CUID that `subst' is currently dealing with.
159 get_last_value will not return a value if the register was set at or
160 after this CUID. If not for this mechanism, we could get confused if
161 I2 or I1 in try_combine were an insn that used the old value of a register
162 to obtain a new value. In that case, we might erroneously get the
163 new value of the register when we wanted the old one. */
165 static int subst_low_cuid;
167 /* This is the value of undobuf.num_undo when we started processing this
168 substitution. This will prevent gen_rtx_combine from re-used a piece
169 from the previous expression. Doing so can produce circular rtl
172 static int previous_num_undos;
174 /* The next group of arrays allows the recording of the last value assigned
175 to (hard or pseudo) register n. We use this information to see if a
176 operation being processed is redundant given a prior operation performed
177 on the register. For example, an `and' with a constant is redundant if
178 all the zero bits are already known to be turned off.
180 We use an approach similar to that used by cse, but change it in the
183 (1) We do not want to reinitialize at each label.
184 (2) It is useful, but not critical, to know the actual value assigned
185 to a register. Often just its form is helpful.
187 Therefore, we maintain the following arrays:
189 reg_last_set_value the last value assigned
190 reg_last_set_label records the value of label_tick when the
191 register was assigned
192 reg_last_set_table_tick records the value of label_tick when a
193 value using the register is assigned
194 reg_last_set_invalid set to non-zero when it is not valid
195 to use the value of this register in some
198 To understand the usage of these tables, it is important to understand
199 the distinction between the value in reg_last_set_value being valid
200 and the register being validly contained in some other expression in the
203 Entry I in reg_last_set_value is valid if it is non-zero, and either
204 reg_n_sets[i] is 1 or reg_last_set_label[i] == label_tick.
206 Register I may validly appear in any expression returned for the value
207 of another register if reg_n_sets[i] is 1. It may also appear in the
208 value for register J if reg_last_set_label[i] < reg_last_set_label[j] or
209 reg_last_set_invalid[j] is zero.
211 If an expression is found in the table containing a register which may
212 not validly appear in an expression, the register is replaced by
213 something that won't match, (clobber (const_int 0)).
215 reg_last_set_invalid[i] is set non-zero when register I is being assigned
216 to and reg_last_set_table_tick[i] == label_tick. */
218 /* Record last value assigned to (hard or pseudo) register n. */
220 static rtx *reg_last_set_value;
222 /* Record the value of label_tick when the value for register n is placed in
223 reg_last_set_value[n]. */
225 static short *reg_last_set_label;
227 /* Record the value of label_tick when an expression involving register n
228 is placed in reg_last_set_value. */
230 static short *reg_last_set_table_tick;
232 /* Set non-zero if references to register n in expressions should not be
235 static char *reg_last_set_invalid;
237 /* Incremented for each label. */
239 static short label_tick;
241 /* Some registers that are set more than once and used in more than one
242 basic block are nevertheless always set in similar ways. For example,
243 a QImode register may be loaded from memory in two places on a machine
244 where byte loads zero extend.
246 We record in the following array what we know about the significant
247 bits of a register, specifically which bits are known to be zero.
249 If an entry is zero, it means that we don't know anything special. */
251 static HOST_WIDE_INT *reg_significant;
253 /* Mode used to compute significance in reg_significant. It is the largest
254 integer mode that can fit in HOST_BITS_PER_WIDE_INT. */
256 static enum machine_mode significant_mode;
258 /* Nonzero if we know that a register has some leading bits that are always
259 equal to the sign bit. */
261 static char *reg_sign_bit_copies;
263 /* Nonzero when reg_significant and reg_sign_bit_copies can be safely used.
264 It is zero while computing them and after combine has completed. This
265 former test prevents propagating values based on previously set values,
266 which can be incorrect if a variable is modified in a loop. */
268 static int significant_valid;
270 /* Record one modification to rtl structure
271 to be undone by storing old_contents into *where.
272 is_int is 1 if the contents are an int. */
277 union {rtx rtx; int i;} old_contents;
278 union {rtx *rtx; int *i;} where;
281 /* Record a bunch of changes to be undone, up to MAX_UNDO of them.
282 num_undo says how many are currently recorded.
284 storage is nonzero if we must undo the allocation of new storage.
285 The value of storage is what to pass to obfree.
287 other_insn is nonzero if we have modified some other insn in the process
288 of working on subst_insn. It must be verified too. */
296 struct undo undo[MAX_UNDO];
300 static struct undobuf undobuf;
302 /* Substitute NEWVAL, an rtx expression, into INTO, a place in some
303 insn. The substitution can be undone by undo_all. If INTO is already
304 set to NEWVAL, do not record this change. Because computing NEWVAL might
305 also call SUBST, we have to compute it before we put anything into
308 #define SUBST(INTO, NEWVAL) \
309 do { rtx _new = (NEWVAL); \
310 if (undobuf.num_undo < MAX_UNDO) \
312 undobuf.undo[undobuf.num_undo].is_int = 0; \
313 undobuf.undo[undobuf.num_undo].where.rtx = &INTO; \
314 undobuf.undo[undobuf.num_undo].old_contents.rtx = INTO; \
316 if (undobuf.undo[undobuf.num_undo].old_contents.rtx != INTO) \
317 undobuf.num_undo++; \
321 /* Similar to SUBST, but NEWVAL is an int. INTO will normally be an XINT
323 Note that substitution for the value of a CONST_INT is not safe. */
325 #define SUBST_INT(INTO, NEWVAL) \
326 do { if (undobuf.num_undo < MAX_UNDO) \
328 undobuf.undo[undobuf.num_undo].is_int = 1; \
329 undobuf.undo[undobuf.num_undo].where.i = (int *) &INTO; \
330 undobuf.undo[undobuf.num_undo].old_contents.i = INTO; \
332 if (undobuf.undo[undobuf.num_undo].old_contents.i != INTO) \
333 undobuf.num_undo++; \
337 /* Number of times the pseudo being substituted for
338 was found and replaced. */
340 static int n_occurrences;
342 static void set_significant ();
343 static void move_deaths ();
345 static void record_value_for_reg ();
346 static void record_dead_and_set_regs ();
347 static int use_crosses_set_p ();
348 static rtx try_combine ();
349 static rtx *find_split_point ();
351 static void undo_all ();
352 static int reg_dead_at_p ();
353 static rtx expand_compound_operation ();
354 static rtx expand_field_assignment ();
355 static rtx make_extraction ();
356 static int get_pos_from_mask ();
357 static rtx force_to_mode ();
358 static rtx known_cond ();
359 static rtx make_field_assignment ();
360 static rtx make_compound_operation ();
361 static rtx apply_distributive_law ();
362 static rtx simplify_and_const_int ();
363 static unsigned HOST_WIDE_INT significant_bits ();
364 static int num_sign_bit_copies ();
365 static int merge_outer_ops ();
366 static rtx simplify_shift_const ();
367 static int recog_for_combine ();
368 static rtx gen_lowpart_for_combine ();
369 static rtx gen_rtx_combine ();
370 static rtx gen_binary ();
371 static rtx gen_unary ();
372 static enum rtx_code simplify_comparison ();
373 static int reversible_comparison_p ();
374 static int get_last_value_validate ();
375 static rtx get_last_value ();
376 static void distribute_notes ();
377 static void distribute_links ();
379 /* Main entry point for combiner. F is the first insn of the function.
380 NREGS is the first unused pseudo-reg number. */
383 combine_instructions (f, nregs)
387 register rtx insn, next, prev;
389 register rtx links, nextlinks;
391 combine_attempts = 0;
394 combine_successes = 0;
396 combine_max_regno = nregs;
398 reg_last_death = (rtx *) alloca (nregs * sizeof (rtx));
399 reg_last_set = (rtx *) alloca (nregs * sizeof (rtx));
400 reg_last_set_value = (rtx *) alloca (nregs * sizeof (rtx));
401 reg_last_set_table_tick = (short *) alloca (nregs * sizeof (short));
402 reg_last_set_label = (short *) alloca (nregs * sizeof (short));
403 reg_last_set_invalid = (char *) alloca (nregs * sizeof (char));
404 reg_significant = (HOST_WIDE_INT *) alloca (nregs * sizeof (HOST_WIDE_INT));
405 reg_sign_bit_copies = (char *) alloca (nregs * sizeof (char));
407 bzero (reg_last_death, nregs * sizeof (rtx));
408 bzero (reg_last_set, nregs * sizeof (rtx));
409 bzero (reg_last_set_value, nregs * sizeof (rtx));
410 bzero (reg_last_set_table_tick, nregs * sizeof (short));
411 bzero (reg_last_set_invalid, nregs * sizeof (char));
412 bzero (reg_significant, nregs * sizeof (HOST_WIDE_INT));
413 bzero (reg_sign_bit_copies, nregs * sizeof (char));
415 init_recog_no_volatile ();
417 /* Compute maximum uid value so uid_cuid can be allocated. */
419 for (insn = f, i = 0; insn; insn = NEXT_INSN (insn))
420 if (INSN_UID (insn) > i)
423 uid_cuid = (int *) alloca ((i + 1) * sizeof (int));
425 significant_mode = mode_for_size (HOST_BITS_PER_WIDE_INT, MODE_INT, 0);
427 /* Don't use reg_significant when computing it. This can cause problems
428 when, for example, we have j <<= 1 in a loop. */
430 significant_valid = 0;
432 /* Compute the mapping from uids to cuids.
433 Cuids are numbers assigned to insns, like uids,
434 except that cuids increase monotonically through the code.
436 Scan all SETs and see if we can deduce anything about what
437 bits are significant for some registers. */
439 for (insn = f, i = 0; insn; insn = NEXT_INSN (insn))
441 INSN_CUID (insn) = ++i;
442 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
443 note_stores (PATTERN (insn), set_significant);
446 significant_valid = 1;
448 /* Now scan all the insns in forward order. */
454 for (insn = f; insn; insn = next ? next : NEXT_INSN (insn))
458 if (GET_CODE (insn) == CODE_LABEL)
461 else if (GET_CODE (insn) == INSN
462 || GET_CODE (insn) == CALL_INSN
463 || GET_CODE (insn) == JUMP_INSN)
465 /* Try this insn with each insn it links back to. */
467 for (links = LOG_LINKS (insn); links; links = XEXP (links, 1))
468 if ((next = try_combine (insn, XEXP (links, 0), NULL_RTX)) != 0)
471 /* Try each sequence of three linked insns ending with this one. */
473 for (links = LOG_LINKS (insn); links; links = XEXP (links, 1))
474 for (nextlinks = LOG_LINKS (XEXP (links, 0)); nextlinks;
475 nextlinks = XEXP (nextlinks, 1))
476 if ((next = try_combine (insn, XEXP (links, 0),
477 XEXP (nextlinks, 0))) != 0)
481 /* Try to combine a jump insn that uses CC0
482 with a preceding insn that sets CC0, and maybe with its
483 logical predecessor as well.
484 This is how we make decrement-and-branch insns.
485 We need this special code because data flow connections
486 via CC0 do not get entered in LOG_LINKS. */
488 if (GET_CODE (insn) == JUMP_INSN
489 && (prev = prev_nonnote_insn (insn)) != 0
490 && GET_CODE (prev) == INSN
491 && sets_cc0_p (PATTERN (prev)))
493 if ((next = try_combine (insn, prev, NULL_RTX)) != 0)
496 for (nextlinks = LOG_LINKS (prev); nextlinks;
497 nextlinks = XEXP (nextlinks, 1))
498 if ((next = try_combine (insn, prev,
499 XEXP (nextlinks, 0))) != 0)
503 /* Do the same for an insn that explicitly references CC0. */
504 if (GET_CODE (insn) == INSN
505 && (prev = prev_nonnote_insn (insn)) != 0
506 && GET_CODE (prev) == INSN
507 && sets_cc0_p (PATTERN (prev))
508 && GET_CODE (PATTERN (insn)) == SET
509 && reg_mentioned_p (cc0_rtx, SET_SRC (PATTERN (insn))))
511 if ((next = try_combine (insn, prev, NULL_RTX)) != 0)
514 for (nextlinks = LOG_LINKS (prev); nextlinks;
515 nextlinks = XEXP (nextlinks, 1))
516 if ((next = try_combine (insn, prev,
517 XEXP (nextlinks, 0))) != 0)
521 /* Finally, see if any of the insns that this insn links to
522 explicitly references CC0. If so, try this insn, that insn,
523 and its predecessor if it sets CC0. */
524 for (links = LOG_LINKS (insn); links; links = XEXP (links, 1))
525 if (GET_CODE (XEXP (links, 0)) == INSN
526 && GET_CODE (PATTERN (XEXP (links, 0))) == SET
527 && reg_mentioned_p (cc0_rtx, SET_SRC (PATTERN (XEXP (links, 0))))
528 && (prev = prev_nonnote_insn (XEXP (links, 0))) != 0
529 && GET_CODE (prev) == INSN
530 && sets_cc0_p (PATTERN (prev))
531 && (next = try_combine (insn, XEXP (links, 0), prev)) != 0)
535 /* Try combining an insn with two different insns whose results it
537 for (links = LOG_LINKS (insn); links; links = XEXP (links, 1))
538 for (nextlinks = XEXP (links, 1); nextlinks;
539 nextlinks = XEXP (nextlinks, 1))
540 if ((next = try_combine (insn, XEXP (links, 0),
541 XEXP (nextlinks, 0))) != 0)
544 if (GET_CODE (insn) != NOTE)
545 record_dead_and_set_regs (insn);
552 total_attempts += combine_attempts;
553 total_merges += combine_merges;
554 total_extras += combine_extras;
555 total_successes += combine_successes;
557 significant_valid = 0;
560 /* Called via note_stores. If X is a pseudo that is used in more than
561 one basic block, is narrower that HOST_BITS_PER_WIDE_INT, and is being
562 set, record what bits are significant. If we are clobbering X,
563 ignore this "set" because the clobbered value won't be used.
565 If we are setting only a portion of X and we can't figure out what
566 portion, assume all bits will be used since we don't know what will
569 Similarly, set how many bits of X are known to be copies of the sign bit
570 at all locations in the function. This is the smallest number implied
574 set_significant (x, set)
580 if (GET_CODE (x) == REG
581 && REGNO (x) >= FIRST_PSEUDO_REGISTER
582 && reg_n_sets[REGNO (x)] > 1
583 && reg_basic_block[REGNO (x)] < 0
584 && GET_MODE_BITSIZE (GET_MODE (x)) <= HOST_BITS_PER_WIDE_INT)
586 if (GET_CODE (set) == CLOBBER)
589 /* If this is a complex assignment, see if we can convert it into a
590 simple assignment. */
591 set = expand_field_assignment (set);
592 if (SET_DEST (set) == x)
594 reg_significant[REGNO (x)]
595 |= significant_bits (SET_SRC (set), significant_mode);
596 num = num_sign_bit_copies (SET_SRC (set), GET_MODE (x));
597 if (reg_sign_bit_copies[REGNO (x)] == 0
598 || reg_sign_bit_copies[REGNO (x)] > num)
599 reg_sign_bit_copies[REGNO (x)] = num;
603 reg_significant[REGNO (x)] = GET_MODE_MASK (GET_MODE (x));
604 reg_sign_bit_copies[REGNO (x)] = 0;
609 /* See if INSN can be combined into I3. PRED and SUCC are optionally
610 insns that were previously combined into I3 or that will be combined
611 into the merger of INSN and I3.
613 Return 0 if the combination is not allowed for any reason.
615 If the combination is allowed, *PDEST will be set to the single
616 destination of INSN and *PSRC to the single source, and this function
620 can_combine_p (insn, i3, pred, succ, pdest, psrc)
627 rtx set = 0, src, dest;
629 int all_adjacent = (succ ? (next_active_insn (insn) == succ
630 && next_active_insn (succ) == i3)
631 : next_active_insn (insn) == i3);
633 /* Can combine only if previous insn is a SET of a REG, a SUBREG or CC0.
634 or a PARALLEL consisting of such a SET and CLOBBERs.
636 If INSN has CLOBBER parallel parts, ignore them for our processing.
637 By definition, these happen during the execution of the insn. When it
638 is merged with another insn, all bets are off. If they are, in fact,
639 needed and aren't also supplied in I3, they may be added by
640 recog_for_combine. Otherwise, it won't match.
642 We can also ignore a SET whose SET_DEST is mentioned in a REG_UNUSED
645 Get the source and destination of INSN. If more than one, can't
648 if (GET_CODE (PATTERN (insn)) == SET)
649 set = PATTERN (insn);
650 else if (GET_CODE (PATTERN (insn)) == PARALLEL
651 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == SET)
653 for (i = 0; i < XVECLEN (PATTERN (insn), 0); i++)
655 rtx elt = XVECEXP (PATTERN (insn), 0, i);
657 switch (GET_CODE (elt))
659 /* We can ignore CLOBBERs. */
664 /* Ignore SETs whose result isn't used but not those that
665 have side-effects. */
666 if (find_reg_note (insn, REG_UNUSED, SET_DEST (elt))
667 && ! side_effects_p (elt))
670 /* If we have already found a SET, this is a second one and
671 so we cannot combine with this insn. */
679 /* Anything else means we can't combine. */
685 /* If SET_SRC is an ASM_OPERANDS we can't throw away these CLOBBERs,
686 so don't do anything with it. */
687 || GET_CODE (SET_SRC (set)) == ASM_OPERANDS)
696 set = expand_field_assignment (set);
697 src = SET_SRC (set), dest = SET_DEST (set);
699 /* Don't eliminate a store in the stack pointer. */
700 if (dest == stack_pointer_rtx
701 /* Don't install a subreg involving two modes not tieable.
702 It can worsen register allocation, and can even make invalid reload
703 insns, since the reg inside may need to be copied from in the
704 outside mode, and that may be invalid if it is an fp reg copied in
705 integer mode. As a special exception, we can allow this if
706 I3 is simply copying DEST, a REG, to CC0. */
707 || (GET_CODE (src) == SUBREG
708 && ! MODES_TIEABLE_P (GET_MODE (src), GET_MODE (SUBREG_REG (src)))
710 && ! (GET_CODE (i3) == INSN && GET_CODE (PATTERN (i3)) == SET
711 && SET_DEST (PATTERN (i3)) == cc0_rtx
712 && GET_CODE (dest) == REG && dest == SET_SRC (PATTERN (i3)))
715 /* If we couldn't eliminate a field assignment, we can't combine. */
716 || GET_CODE (dest) == ZERO_EXTRACT || GET_CODE (dest) == STRICT_LOW_PART
717 /* Don't combine with an insn that sets a register to itself if it has
718 a REG_EQUAL note. This may be part of a REG_NO_CONFLICT sequence. */
719 || (rtx_equal_p (src, dest) && find_reg_note (insn, REG_EQUAL, NULL_RTX))
720 /* Can't merge a function call. */
721 || GET_CODE (src) == CALL
722 /* Don't substitute into an incremented register. */
723 || FIND_REG_INC_NOTE (i3, dest)
724 || (succ && FIND_REG_INC_NOTE (succ, dest))
725 /* Don't combine the end of a libcall into anything. */
726 || find_reg_note (insn, REG_RETVAL, NULL_RTX)
727 /* Make sure that DEST is not used after SUCC but before I3. */
728 || (succ && ! all_adjacent
729 && reg_used_between_p (dest, succ, i3))
730 /* Make sure that the value that is to be substituted for the register
731 does not use any registers whose values alter in between. However,
732 If the insns are adjacent, a use can't cross a set even though we
733 think it might (this can happen for a sequence of insns each setting
734 the same destination; reg_last_set of that register might point to
735 a NOTE). Also, don't move a volatile asm across any other insns. */
737 && (use_crosses_set_p (src, INSN_CUID (insn))
738 || (GET_CODE (src) == ASM_OPERANDS && MEM_VOLATILE_P (src))))
739 /* If there is a REG_NO_CONFLICT note for DEST in I3 or SUCC, we get
740 better register allocation by not doing the combine. */
741 || find_reg_note (i3, REG_NO_CONFLICT, dest)
742 || (succ && find_reg_note (succ, REG_NO_CONFLICT, dest))
743 /* Don't combine across a CALL_INSN, because that would possibly
744 change whether the life span of some REGs crosses calls or not,
745 and it is a pain to update that information.
746 Exception: if source is a constant, moving it later can't hurt.
747 Accept that special case, because it helps -fforce-addr a lot. */
748 || (INSN_CUID (insn) < last_call_cuid && ! CONSTANT_P (src)))
751 /* DEST must either be a REG or CC0. */
752 if (GET_CODE (dest) == REG)
754 /* If register alignment is being enforced for multi-word items in all
755 cases except for parameters, it is possible to have a register copy
756 insn referencing a hard register that is not allowed to contain the
757 mode being copied and which would not be valid as an operand of most
758 insns. Eliminate this problem by not combining with such an insn.
760 Also, on some machines we don't want to extend the life of a hard
763 if (GET_CODE (src) == REG
764 && ((REGNO (dest) < FIRST_PSEUDO_REGISTER
765 && ! HARD_REGNO_MODE_OK (REGNO (dest), GET_MODE (dest)))
766 #ifdef SMALL_REGISTER_CLASSES
767 /* Don't extend the life of a hard register. */
768 || REGNO (src) < FIRST_PSEUDO_REGISTER
770 || (REGNO (src) < FIRST_PSEUDO_REGISTER
771 && ! HARD_REGNO_MODE_OK (REGNO (src), GET_MODE (src)))
776 else if (GET_CODE (dest) != CC0)
779 /* Don't substitute for a register intended as a clobberable operand.
780 Similarly, don't substitute an expression containing a register that
781 will be clobbered in I3. */
782 if (GET_CODE (PATTERN (i3)) == PARALLEL)
783 for (i = XVECLEN (PATTERN (i3), 0) - 1; i >= 0; i--)
784 if (GET_CODE (XVECEXP (PATTERN (i3), 0, i)) == CLOBBER
785 && (reg_overlap_mentioned_p (XEXP (XVECEXP (PATTERN (i3), 0, i), 0),
787 || rtx_equal_p (XEXP (XVECEXP (PATTERN (i3), 0, i), 0), dest)))
790 /* If INSN contains anything volatile, or is an `asm' (whether volatile
791 or not), reject, unless nothing volatile comes between it and I3,
792 with the exception of SUCC. */
794 if (GET_CODE (src) == ASM_OPERANDS || volatile_refs_p (src))
795 for (p = NEXT_INSN (insn); p != i3; p = NEXT_INSN (p))
796 if (GET_RTX_CLASS (GET_CODE (p)) == 'i'
797 && p != succ && volatile_refs_p (PATTERN (p)))
800 /* If INSN or I2 contains an autoincrement or autodecrement,
801 make sure that register is not used between there and I3,
802 and not already used in I3 either.
803 Also insist that I3 not be a jump; if it were one
804 and the incremented register were spilled, we would lose. */
807 for (link = REG_NOTES (insn); link; link = XEXP (link, 1))
808 if (REG_NOTE_KIND (link) == REG_INC
809 && (GET_CODE (i3) == JUMP_INSN
810 || reg_used_between_p (XEXP (link, 0), insn, i3)
811 || reg_overlap_mentioned_p (XEXP (link, 0), PATTERN (i3))))
816 /* Don't combine an insn that follows a CC0-setting insn.
817 An insn that uses CC0 must not be separated from the one that sets it.
818 We do, however, allow I2 to follow a CC0-setting insn if that insn
819 is passed as I1; in that case it will be deleted also.
820 We also allow combining in this case if all the insns are adjacent
821 because that would leave the two CC0 insns adjacent as well.
822 It would be more logical to test whether CC0 occurs inside I1 or I2,
823 but that would be much slower, and this ought to be equivalent. */
825 p = prev_nonnote_insn (insn);
826 if (p && p != pred && GET_CODE (p) == INSN && sets_cc0_p (PATTERN (p))
831 /* If we get here, we have passed all the tests and the combination is
840 /* LOC is the location within I3 that contains its pattern or the component
841 of a PARALLEL of the pattern. We validate that it is valid for combining.
843 One problem is if I3 modifies its output, as opposed to replacing it
844 entirely, we can't allow the output to contain I2DEST or I1DEST as doing
845 so would produce an insn that is not equivalent to the original insns.
849 (set (reg:DI 101) (reg:DI 100))
850 (set (subreg:SI (reg:DI 101) 0) <foo>)
852 This is NOT equivalent to:
854 (parallel [(set (subreg:SI (reg:DI 100) 0) <foo>)
855 (set (reg:DI 101) (reg:DI 100))])
857 Not only does this modify 100 (in which case it might still be valid
858 if 100 were dead in I2), it sets 101 to the ORIGINAL value of 100.
860 We can also run into a problem if I2 sets a register that I1
861 uses and I1 gets directly substituted into I3 (not via I2). In that
862 case, we would be getting the wrong value of I2DEST into I3, so we
863 must reject the combination. This case occurs when I2 and I1 both
864 feed into I3, rather than when I1 feeds into I2, which feeds into I3.
865 If I1_NOT_IN_SRC is non-zero, it means that finding I1 in the source
866 of a SET must prevent combination from occurring.
868 On machines where SMALL_REGISTER_CLASSES is defined, we don't combine
869 if the destination of a SET is a hard register.
871 Before doing the above check, we first try to expand a field assignment
872 into a set of logical operations.
874 If PI3_DEST_KILLED is non-zero, it is a pointer to a location in which
875 we place a register that is both set and used within I3. If more than one
876 such register is detected, we fail.
878 Return 1 if the combination is valid, zero otherwise. */
881 combinable_i3pat (i3, loc, i2dest, i1dest, i1_not_in_src, pi3dest_killed)
891 if (GET_CODE (x) == SET)
893 rtx set = expand_field_assignment (x);
894 rtx dest = SET_DEST (set);
895 rtx src = SET_SRC (set);
896 rtx inner_dest = dest, inner_src = src;
900 while (GET_CODE (inner_dest) == STRICT_LOW_PART
901 || GET_CODE (inner_dest) == SUBREG
902 || GET_CODE (inner_dest) == ZERO_EXTRACT)
903 inner_dest = XEXP (inner_dest, 0);
905 /* We probably don't need this any more now that LIMIT_RELOAD_CLASS
908 while (GET_CODE (inner_src) == STRICT_LOW_PART
909 || GET_CODE (inner_src) == SUBREG
910 || GET_CODE (inner_src) == ZERO_EXTRACT)
911 inner_src = XEXP (inner_src, 0);
913 /* If it is better that two different modes keep two different pseudos,
914 avoid combining them. This avoids producing the following pattern
916 (set (subreg:SI (reg/v:QI 21) 0)
917 (lshiftrt:SI (reg/v:SI 20)
919 If that were made, reload could not handle the pair of
920 reg 20/21, since it would try to get any GENERAL_REGS
921 but some of them don't handle QImode. */
923 if (rtx_equal_p (inner_src, i2dest)
924 && GET_CODE (inner_dest) == REG
925 && ! MODES_TIEABLE_P (GET_MODE (i2dest), GET_MODE (inner_dest)))
929 /* Check for the case where I3 modifies its output, as
931 if ((inner_dest != dest
932 && (reg_overlap_mentioned_p (i2dest, inner_dest)
933 || (i1dest && reg_overlap_mentioned_p (i1dest, inner_dest))))
934 /* This is the same test done in can_combine_p except that we
935 allow a hard register with SMALL_REGISTER_CLASSES if SRC is a
937 || (GET_CODE (inner_dest) == REG
938 && REGNO (inner_dest) < FIRST_PSEUDO_REGISTER
939 #ifdef SMALL_REGISTER_CLASSES
940 && GET_CODE (src) != CALL
942 && ! HARD_REGNO_MODE_OK (REGNO (inner_dest),
943 GET_MODE (inner_dest))
947 || (i1_not_in_src && reg_overlap_mentioned_p (i1dest, src)))
950 /* If DEST is used in I3, it is being killed in this insn,
951 so record that for later. */
952 if (pi3dest_killed && GET_CODE (dest) == REG
953 && reg_referenced_p (dest, PATTERN (i3)))
958 *pi3dest_killed = dest;
962 else if (GET_CODE (x) == PARALLEL)
966 for (i = 0; i < XVECLEN (x, 0); i++)
967 if (! combinable_i3pat (i3, &XVECEXP (x, 0, i), i2dest, i1dest,
968 i1_not_in_src, pi3dest_killed))
975 /* Try to combine the insns I1 and I2 into I3.
976 Here I1 and I2 appear earlier than I3.
977 I1 can be zero; then we combine just I2 into I3.
979 It we are combining three insns and the resulting insn is not recognized,
980 try splitting it into two insns. If that happens, I2 and I3 are retained
981 and I1 is pseudo-deleted by turning it into a NOTE. Otherwise, I1 and I2
984 If we created two insns, return I2; otherwise return I3.
985 Return 0 if the combination does not work. Then nothing is changed. */
988 try_combine (i3, i2, i1)
989 register rtx i3, i2, i1;
991 /* New patterns for I3 and I3, respectively. */
992 rtx newpat, newi2pat = 0;
993 /* Indicates need to preserve SET in I1 or I2 in I3 if it is not dead. */
994 int added_sets_1, added_sets_2;
995 /* Total number of SETs to put into I3. */
997 /* Nonzero is I2's body now appears in I3. */
999 /* INSN_CODEs for new I3, new I2, and user of condition code. */
1000 int insn_code_number, i2_code_number, other_code_number;
1001 /* Contains I3 if the destination of I3 is used in its source, which means
1002 that the old life of I3 is being killed. If that usage is placed into
1003 I2 and not in I3, a REG_DEAD note must be made. */
1004 rtx i3dest_killed = 0;
1005 /* SET_DEST and SET_SRC of I2 and I1. */
1006 rtx i2dest, i2src, i1dest = 0, i1src = 0;
1007 /* PATTERN (I2), or a copy of it in certain cases. */
1009 /* Indicates if I2DEST or I1DEST is in I2SRC or I1_SRC. */
1010 int i2dest_in_i2src, i1dest_in_i1src = 0, i2dest_in_i1src = 0;
1011 int i1_feeds_i3 = 0;
1012 /* Notes that must be added to REG_NOTES in I3 and I2. */
1013 rtx new_i3_notes, new_i2_notes;
1020 /* If any of I1, I2, and I3 isn't really an insn, we can't do anything.
1021 This can occur when flow deletes an insn that it has merged into an
1022 auto-increment address. We also can't do anything if I3 has a
1023 REG_LIBCALL note since we don't want to disrupt the contiguity of a
1026 if (GET_RTX_CLASS (GET_CODE (i3)) != 'i'
1027 || GET_RTX_CLASS (GET_CODE (i2)) != 'i'
1028 || (i1 && GET_RTX_CLASS (GET_CODE (i1)) != 'i')
1029 || find_reg_note (i3, REG_LIBCALL, NULL_RTX))
1034 undobuf.num_undo = previous_num_undos = 0;
1035 undobuf.other_insn = 0;
1037 /* Save the current high-water-mark so we can free storage if we didn't
1038 accept this combination. */
1039 undobuf.storage = (char *) oballoc (0);
1041 /* If I1 and I2 both feed I3, they can be in any order. To simplify the
1042 code below, set I1 to be the earlier of the two insns. */
1043 if (i1 && INSN_CUID (i1) > INSN_CUID (i2))
1044 temp = i1, i1 = i2, i2 = temp;
1046 /* First check for one important special-case that the code below will
1047 not handle. Namely, the case where I1 is zero, I2 has multiple sets,
1048 and I3 is a SET whose SET_SRC is a SET_DEST in I2. In that case,
1049 we may be able to replace that destination with the destination of I3.
1050 This occurs in the common code where we compute both a quotient and
1051 remainder into a structure, in which case we want to do the computation
1052 directly into the structure to avoid register-register copies.
1054 We make very conservative checks below and only try to handle the
1055 most common cases of this. For example, we only handle the case
1056 where I2 and I3 are adjacent to avoid making difficult register
1059 if (i1 == 0 && GET_CODE (i3) == INSN && GET_CODE (PATTERN (i3)) == SET
1060 && GET_CODE (SET_SRC (PATTERN (i3))) == REG
1061 && REGNO (SET_SRC (PATTERN (i3))) >= FIRST_PSEUDO_REGISTER
1062 #ifdef SMALL_REGISTER_CLASSES
1063 && (GET_CODE (SET_DEST (PATTERN (i3))) != REG
1064 || REGNO (SET_DEST (PATTERN (i3))) >= FIRST_PSEUDO_REGISTER)
1066 && find_reg_note (i3, REG_DEAD, SET_SRC (PATTERN (i3)))
1067 && GET_CODE (PATTERN (i2)) == PARALLEL
1068 && ! side_effects_p (SET_DEST (PATTERN (i3)))
1069 /* If the dest of I3 is a ZERO_EXTRACT or STRICT_LOW_PART, the code
1070 below would need to check what is inside (and reg_overlap_mentioned_p
1071 doesn't support those codes anyway). Don't allow those destinations;
1072 the resulting insn isn't likely to be recognized anyway. */
1073 && GET_CODE (SET_DEST (PATTERN (i3))) != ZERO_EXTRACT
1074 && GET_CODE (SET_DEST (PATTERN (i3))) != STRICT_LOW_PART
1075 && ! reg_overlap_mentioned_p (SET_SRC (PATTERN (i3)),
1076 SET_DEST (PATTERN (i3)))
1077 && next_real_insn (i2) == i3)
1079 rtx p2 = PATTERN (i2);
1081 /* Make sure that the destination of I3,
1082 which we are going to substitute into one output of I2,
1083 is not used within another output of I2. We must avoid making this:
1084 (parallel [(set (mem (reg 69)) ...)
1085 (set (reg 69) ...)])
1086 which is not well-defined as to order of actions.
1087 (Besides, reload can't handle output reloads for this.)
1089 The problem can also happen if the dest of I3 is a memory ref,
1090 if another dest in I2 is an indirect memory ref. */
1091 for (i = 0; i < XVECLEN (p2, 0); i++)
1092 if (GET_CODE (XVECEXP (p2, 0, i)) == SET
1093 && reg_overlap_mentioned_p (SET_DEST (PATTERN (i3)),
1094 SET_DEST (XVECEXP (p2, 0, i))))
1097 if (i == XVECLEN (p2, 0))
1098 for (i = 0; i < XVECLEN (p2, 0); i++)
1099 if (SET_DEST (XVECEXP (p2, 0, i)) == SET_SRC (PATTERN (i3)))
1104 subst_low_cuid = INSN_CUID (i2);
1107 i2dest = SET_SRC (PATTERN (i3));
1109 /* Replace the dest in I2 with our dest and make the resulting
1110 insn the new pattern for I3. Then skip to where we
1111 validate the pattern. Everything was set up above. */
1112 SUBST (SET_DEST (XVECEXP (p2, 0, i)),
1113 SET_DEST (PATTERN (i3)));
1116 goto validate_replacement;
1121 /* If we have no I1 and I2 looks like:
1122 (parallel [(set (reg:CC X) (compare:CC OP (const_int 0)))
1124 make up a dummy I1 that is
1127 (set (reg:CC X) (compare:CC Y (const_int 0)))
1129 (We can ignore any trailing CLOBBERs.)
1131 This undoes a previous combination and allows us to match a branch-and-
1134 if (i1 == 0 && GET_CODE (PATTERN (i2)) == PARALLEL
1135 && XVECLEN (PATTERN (i2), 0) >= 2
1136 && GET_CODE (XVECEXP (PATTERN (i2), 0, 0)) == SET
1137 && (GET_MODE_CLASS (GET_MODE (SET_DEST (XVECEXP (PATTERN (i2), 0, 0))))
1139 && GET_CODE (SET_SRC (XVECEXP (PATTERN (i2), 0, 0))) == COMPARE
1140 && XEXP (SET_SRC (XVECEXP (PATTERN (i2), 0, 0)), 1) == const0_rtx
1141 && GET_CODE (XVECEXP (PATTERN (i2), 0, 1)) == SET
1142 && GET_CODE (SET_DEST (XVECEXP (PATTERN (i2), 0, 1))) == REG
1143 && rtx_equal_p (XEXP (SET_SRC (XVECEXP (PATTERN (i2), 0, 0)), 0),
1144 SET_SRC (XVECEXP (PATTERN (i2), 0, 1))))
1146 for (i = XVECLEN (PATTERN (i2), 0) - 1; i >= 2; i--)
1147 if (GET_CODE (XVECEXP (PATTERN (i2), 0, i)) != CLOBBER)
1152 /* We make I1 with the same INSN_UID as I2. This gives it
1153 the same INSN_CUID for value tracking. Our fake I1 will
1154 never appear in the insn stream so giving it the same INSN_UID
1155 as I2 will not cause a problem. */
1157 i1 = gen_rtx (INSN, VOIDmode, INSN_UID (i2), 0, i2,
1158 XVECEXP (PATTERN (i2), 0, 1), -1, 0, 0);
1160 SUBST (PATTERN (i2), XVECEXP (PATTERN (i2), 0, 0));
1161 SUBST (XEXP (SET_SRC (PATTERN (i2)), 0),
1162 SET_DEST (PATTERN (i1)));
1167 /* Verify that I2 and I1 are valid for combining. */
1168 if (! can_combine_p (i2, i3, i1, NULL_RTX, &i2dest, &i2src)
1169 || (i1 && ! can_combine_p (i1, i3, NULL_RTX, i2, &i1dest, &i1src)))
1175 /* Record whether I2DEST is used in I2SRC and similarly for the other
1176 cases. Knowing this will help in register status updating below. */
1177 i2dest_in_i2src = reg_overlap_mentioned_p (i2dest, i2src);
1178 i1dest_in_i1src = i1 && reg_overlap_mentioned_p (i1dest, i1src);
1179 i2dest_in_i1src = i1 && reg_overlap_mentioned_p (i2dest, i1src);
1181 /* See if I1 directly feeds into I3. It does if I1DEST is not used
1183 i1_feeds_i3 = i1 && ! reg_overlap_mentioned_p (i1dest, i2src);
1185 /* Ensure that I3's pattern can be the destination of combines. */
1186 if (! combinable_i3pat (i3, &PATTERN (i3), i2dest, i1dest,
1187 i1 && i2dest_in_i1src && i1_feeds_i3,
1194 /* If I3 has an inc, then give up if I1 or I2 uses the reg that is inc'd.
1195 We used to do this EXCEPT in one case: I3 has a post-inc in an
1196 output operand. However, that exception can give rise to insns like
1198 which is a famous insn on the PDP-11 where the value of r3 used as the
1199 source was model-dependent. Avoid this sort of thing. */
1202 if (!(GET_CODE (PATTERN (i3)) == SET
1203 && GET_CODE (SET_SRC (PATTERN (i3))) == REG
1204 && GET_CODE (SET_DEST (PATTERN (i3))) == MEM
1205 && (GET_CODE (XEXP (SET_DEST (PATTERN (i3)), 0)) == POST_INC
1206 || GET_CODE (XEXP (SET_DEST (PATTERN (i3)), 0)) == POST_DEC)))
1207 /* It's not the exception. */
1210 for (link = REG_NOTES (i3); link; link = XEXP (link, 1))
1211 if (REG_NOTE_KIND (link) == REG_INC
1212 && (reg_overlap_mentioned_p (XEXP (link, 0), PATTERN (i2))
1214 && reg_overlap_mentioned_p (XEXP (link, 0), PATTERN (i1)))))
1221 /* See if the SETs in I1 or I2 need to be kept around in the merged
1222 instruction: whenever the value set there is still needed past I3.
1223 For the SETs in I2, this is easy: we see if I2DEST dies or is set in I3.
1225 For the SET in I1, we have two cases: If I1 and I2 independently
1226 feed into I3, the set in I1 needs to be kept around if I1DEST dies
1227 or is set in I3. Otherwise (if I1 feeds I2 which feeds I3), the set
1228 in I1 needs to be kept around unless I1DEST dies or is set in either
1229 I2 or I3. We can distinguish these cases by seeing if I2SRC mentions
1230 I1DEST. If so, we know I1 feeds into I2. */
1232 added_sets_2 = ! dead_or_set_p (i3, i2dest);
1235 = i1 && ! (i1_feeds_i3 ? dead_or_set_p (i3, i1dest)
1236 : (dead_or_set_p (i3, i1dest) || dead_or_set_p (i2, i1dest)));
1238 /* If the set in I2 needs to be kept around, we must make a copy of
1239 PATTERN (I2), so that when we substitute I1SRC for I1DEST in
1240 PATTERN (I2), we are only substituting for the original I1DEST, not into
1241 an already-substituted copy. This also prevents making self-referential
1242 rtx. If I2 is a PARALLEL, we just need the piece that assigns I2SRC to
1245 i2pat = (GET_CODE (PATTERN (i2)) == PARALLEL
1246 ? gen_rtx (SET, VOIDmode, i2dest, i2src)
1250 i2pat = copy_rtx (i2pat);
1254 /* Substitute in the latest insn for the regs set by the earlier ones. */
1256 maxreg = max_reg_num ();
1260 /* It is possible that the source of I2 or I1 may be performing an
1261 unneeded operation, such as a ZERO_EXTEND of something that is known
1262 to have the high part zero. Handle that case by letting subst look at
1263 the innermost one of them.
1265 Another way to do this would be to have a function that tries to
1266 simplify a single insn instead of merging two or more insns. We don't
1267 do this because of the potential of infinite loops and because
1268 of the potential extra memory required. However, doing it the way
1269 we are is a bit of a kludge and doesn't catch all cases.
1271 But only do this if -fexpensive-optimizations since it slows things down
1272 and doesn't usually win. */
1274 if (flag_expensive_optimizations)
1276 /* Pass pc_rtx so no substitutions are done, just simplifications.
1277 The cases that we are interested in here do not involve the few
1278 cases were is_replaced is checked. */
1281 subst_low_cuid = INSN_CUID (i1);
1282 i1src = subst (i1src, pc_rtx, pc_rtx, 0, 0);
1286 subst_low_cuid = INSN_CUID (i2);
1287 i2src = subst (i2src, pc_rtx, pc_rtx, 0, 0);
1290 previous_num_undos = undobuf.num_undo;
1294 /* Many machines that don't use CC0 have insns that can both perform an
1295 arithmetic operation and set the condition code. These operations will
1296 be represented as a PARALLEL with the first element of the vector
1297 being a COMPARE of an arithmetic operation with the constant zero.
1298 The second element of the vector will set some pseudo to the result
1299 of the same arithmetic operation. If we simplify the COMPARE, we won't
1300 match such a pattern and so will generate an extra insn. Here we test
1301 for this case, where both the comparison and the operation result are
1302 needed, and make the PARALLEL by just replacing I2DEST in I3SRC with
1303 I2SRC. Later we will make the PARALLEL that contains I2. */
1305 if (i1 == 0 && added_sets_2 && GET_CODE (PATTERN (i3)) == SET
1306 && GET_CODE (SET_SRC (PATTERN (i3))) == COMPARE
1307 && XEXP (SET_SRC (PATTERN (i3)), 1) == const0_rtx
1308 && rtx_equal_p (XEXP (SET_SRC (PATTERN (i3)), 0), i2dest))
1311 enum machine_mode compare_mode;
1313 newpat = PATTERN (i3);
1314 SUBST (XEXP (SET_SRC (newpat), 0), i2src);
1318 #ifdef EXTRA_CC_MODES
1319 /* See if a COMPARE with the operand we substituted in should be done
1320 with the mode that is currently being used. If not, do the same
1321 processing we do in `subst' for a SET; namely, if the destination
1322 is used only once, try to replace it with a register of the proper
1323 mode and also replace the COMPARE. */
1324 if (undobuf.other_insn == 0
1325 && (cc_use = find_single_use (SET_DEST (newpat), i3,
1326 &undobuf.other_insn))
1327 && ((compare_mode = SELECT_CC_MODE (GET_CODE (*cc_use),
1329 != GET_MODE (SET_DEST (newpat))))
1331 int regno = REGNO (SET_DEST (newpat));
1332 rtx new_dest = gen_rtx (REG, compare_mode, regno);
1334 if (regno < FIRST_PSEUDO_REGISTER
1335 || (reg_n_sets[regno] == 1 && ! added_sets_2
1336 && ! REG_USERVAR_P (SET_DEST (newpat))))
1338 if (regno >= FIRST_PSEUDO_REGISTER)
1339 SUBST (regno_reg_rtx[regno], new_dest);
1341 SUBST (SET_DEST (newpat), new_dest);
1342 SUBST (XEXP (*cc_use, 0), new_dest);
1343 SUBST (SET_SRC (newpat),
1344 gen_rtx_combine (COMPARE, compare_mode,
1345 i2src, const0_rtx));
1348 undobuf.other_insn = 0;
1355 n_occurrences = 0; /* `subst' counts here */
1357 /* If I1 feeds into I2 (not into I3) and I1DEST is in I1SRC, we
1358 need to make a unique copy of I2SRC each time we substitute it
1359 to avoid self-referential rtl. */
1361 subst_low_cuid = INSN_CUID (i2);
1362 newpat = subst (PATTERN (i3), i2dest, i2src, 0,
1363 ! i1_feeds_i3 && i1dest_in_i1src);
1364 previous_num_undos = undobuf.num_undo;
1366 /* Record whether i2's body now appears within i3's body. */
1367 i2_is_used = n_occurrences;
1370 /* If we already got a failure, don't try to do more. Otherwise,
1371 try to substitute in I1 if we have it. */
1373 if (i1 && GET_CODE (newpat) != CLOBBER)
1375 /* Before we can do this substitution, we must redo the test done
1376 above (see detailed comments there) that ensures that I1DEST
1377 isn't mentioned in any SETs in NEWPAT that are field assignments. */
1379 if (! combinable_i3pat (NULL_RTX, &newpat, i1dest, NULL_RTX,
1387 subst_low_cuid = INSN_CUID (i1);
1388 newpat = subst (newpat, i1dest, i1src, 0, 0);
1389 previous_num_undos = undobuf.num_undo;
1392 /* Fail if an autoincrement side-effect has been duplicated. Be careful
1393 to count all the ways that I2SRC and I1SRC can be used. */
1394 if ((FIND_REG_INC_NOTE (i2, NULL_RTX) != 0
1395 && i2_is_used + added_sets_2 > 1)
1396 || (i1 != 0 && FIND_REG_INC_NOTE (i1, NULL_RTX) != 0
1397 && (n_occurrences + added_sets_1 + (added_sets_2 && ! i1_feeds_i3)
1399 /* Fail if we tried to make a new register (we used to abort, but there's
1400 really no reason to). */
1401 || max_reg_num () != maxreg
1402 /* Fail if we couldn't do something and have a CLOBBER. */
1403 || GET_CODE (newpat) == CLOBBER)
1409 /* If the actions of the earlier insns must be kept
1410 in addition to substituting them into the latest one,
1411 we must make a new PARALLEL for the latest insn
1412 to hold additional the SETs. */
1414 if (added_sets_1 || added_sets_2)
1418 if (GET_CODE (newpat) == PARALLEL)
1420 rtvec old = XVEC (newpat, 0);
1421 total_sets = XVECLEN (newpat, 0) + added_sets_1 + added_sets_2;
1422 newpat = gen_rtx (PARALLEL, VOIDmode, rtvec_alloc (total_sets));
1423 bcopy (&old->elem[0], &XVECEXP (newpat, 0, 0),
1424 sizeof (old->elem[0]) * old->num_elem);
1429 total_sets = 1 + added_sets_1 + added_sets_2;
1430 newpat = gen_rtx (PARALLEL, VOIDmode, rtvec_alloc (total_sets));
1431 XVECEXP (newpat, 0, 0) = old;
1435 XVECEXP (newpat, 0, --total_sets)
1436 = (GET_CODE (PATTERN (i1)) == PARALLEL
1437 ? gen_rtx (SET, VOIDmode, i1dest, i1src) : PATTERN (i1));
1441 /* If there is no I1, use I2's body as is. We used to also not do
1442 the subst call below if I2 was substituted into I3,
1443 but that could lose a simplification. */
1445 XVECEXP (newpat, 0, --total_sets) = i2pat;
1447 /* See comment where i2pat is assigned. */
1448 XVECEXP (newpat, 0, --total_sets)
1449 = subst (i2pat, i1dest, i1src, 0, 0);
1453 /* We come here when we are replacing a destination in I2 with the
1454 destination of I3. */
1455 validate_replacement:
1457 /* Is the result of combination a valid instruction? */
1458 insn_code_number = recog_for_combine (&newpat, i3, &new_i3_notes);
1460 /* If the result isn't valid, see if it is a PARALLEL of two SETs where
1461 the second SET's destination is a register that is unused. In that case,
1462 we just need the first SET. This can occur when simplifying a divmod
1463 insn. We *must* test for this case here because the code below that
1464 splits two independent SETs doesn't handle this case correctly when it
1465 updates the register status. Also check the case where the first
1466 SET's destination is unused. That would not cause incorrect code, but
1467 does cause an unneeded insn to remain. */
1469 if (insn_code_number < 0 && GET_CODE (newpat) == PARALLEL
1470 && XVECLEN (newpat, 0) == 2
1471 && GET_CODE (XVECEXP (newpat, 0, 0)) == SET
1472 && GET_CODE (XVECEXP (newpat, 0, 1)) == SET
1473 && GET_CODE (SET_DEST (XVECEXP (newpat, 0, 1))) == REG
1474 && find_reg_note (i3, REG_UNUSED, SET_DEST (XVECEXP (newpat, 0, 1)))
1475 && ! side_effects_p (SET_SRC (XVECEXP (newpat, 0, 1)))
1476 && asm_noperands (newpat) < 0)
1478 newpat = XVECEXP (newpat, 0, 0);
1479 insn_code_number = recog_for_combine (&newpat, i3, &new_i3_notes);
1482 else if (insn_code_number < 0 && GET_CODE (newpat) == PARALLEL
1483 && XVECLEN (newpat, 0) == 2
1484 && GET_CODE (XVECEXP (newpat, 0, 0)) == SET
1485 && GET_CODE (XVECEXP (newpat, 0, 1)) == SET
1486 && GET_CODE (SET_DEST (XVECEXP (newpat, 0, 0))) == REG
1487 && find_reg_note (i3, REG_UNUSED, SET_DEST (XVECEXP (newpat, 0, 0)))
1488 && ! side_effects_p (SET_SRC (XVECEXP (newpat, 0, 0)))
1489 && asm_noperands (newpat) < 0)
1491 newpat = XVECEXP (newpat, 0, 1);
1492 insn_code_number = recog_for_combine (&newpat, i3, &new_i3_notes);
1495 /* See if this is an XOR. If so, perhaps the problem is that the
1496 constant is out of range. Replace it with a complemented XOR with
1497 a complemented constant; it might be in range. */
1499 else if (insn_code_number < 0 && GET_CODE (newpat) == SET
1500 && GET_CODE (SET_SRC (newpat)) == XOR
1501 && GET_CODE (XEXP (SET_SRC (newpat), 1)) == CONST_INT
1502 && ((temp = simplify_unary_operation (NOT,
1503 GET_MODE (SET_SRC (newpat)),
1504 XEXP (SET_SRC (newpat), 1),
1505 GET_MODE (SET_SRC (newpat))))
1508 enum machine_mode i_mode = GET_MODE (SET_SRC (newpat));
1510 = gen_rtx_combine (SET, VOIDmode, SET_DEST (newpat),
1511 gen_unary (NOT, i_mode,
1512 gen_binary (XOR, i_mode,
1513 XEXP (SET_SRC (newpat), 0),
1516 insn_code_number = recog_for_combine (&pat, i3, &new_i3_notes);
1517 if (insn_code_number >= 0)
1521 /* If we were combining three insns and the result is a simple SET
1522 with no ASM_OPERANDS that wasn't recognized, try to split it into two
1523 insns. There are two ways to do this. It can be split using a
1524 machine-specific method (like when you have an addition of a large
1525 constant) or by combine in the function find_split_point. */
1527 if (i1 && insn_code_number < 0 && GET_CODE (newpat) == SET
1528 && asm_noperands (newpat) < 0)
1530 rtx m_split, *split;
1531 rtx ni2dest = i2dest;
1533 /* See if the MD file can split NEWPAT. If it can't, see if letting it
1534 use I2DEST as a scratch register will help. In the latter case,
1535 convert I2DEST to the mode of the source of NEWPAT if we can. */
1537 m_split = split_insns (newpat, i3);
1539 /* We can only use I2DEST as a scratch reg if it doesn't overlap any
1540 inputs of NEWPAT. */
1542 /* ??? If I2DEST is not safe, and I1DEST exists, then it would be
1543 possible to try that as a scratch reg. This would require adding
1544 more code to make it work though. */
1546 if (m_split == 0 && ! reg_overlap_mentioned_p (ni2dest, newpat))
1548 /* If I2DEST is a hard register or the only use of a pseudo,
1549 we can change its mode. */
1550 if (GET_MODE (SET_DEST (newpat)) != GET_MODE (i2dest)
1551 && GET_MODE (SET_DEST (newpat)) != VOIDmode
1552 && GET_CODE (i2dest) == REG
1553 && (REGNO (i2dest) < FIRST_PSEUDO_REGISTER
1554 || (reg_n_sets[REGNO (i2dest)] == 1 && ! added_sets_2
1555 && ! REG_USERVAR_P (i2dest))))
1556 ni2dest = gen_rtx (REG, GET_MODE (SET_DEST (newpat)),
1559 m_split = split_insns (gen_rtx (PARALLEL, VOIDmode,
1560 gen_rtvec (2, newpat,
1567 if (m_split && GET_CODE (m_split) == SEQUENCE
1568 && XVECLEN (m_split, 0) == 2
1569 && (next_real_insn (i2) == i3
1570 || ! use_crosses_set_p (PATTERN (XVECEXP (m_split, 0, 0)),
1574 rtx newi3pat = PATTERN (XVECEXP (m_split, 0, 1));
1575 newi2pat = PATTERN (XVECEXP (m_split, 0, 0));
1577 i3set = single_set (XVECEXP (m_split, 0, 1));
1578 i2set = single_set (XVECEXP (m_split, 0, 0));
1580 /* In case we changed the mode of I2DEST, replace it in the
1581 pseudo-register table here. We can't do it above in case this
1582 code doesn't get executed and we do a split the other way. */
1584 if (REGNO (i2dest) >= FIRST_PSEUDO_REGISTER)
1585 SUBST (regno_reg_rtx[REGNO (i2dest)], ni2dest);
1587 i2_code_number = recog_for_combine (&newi2pat, i2, &new_i2_notes);
1589 /* If I2 or I3 has multiple SETs, we won't know how to track
1590 register status, so don't use these insns. */
1592 if (i2_code_number >= 0 && i2set && i3set)
1593 insn_code_number = recog_for_combine (&newi3pat, i3,
1596 if (insn_code_number >= 0)
1599 /* It is possible that both insns now set the destination of I3.
1600 If so, we must show an extra use of it. */
1602 if (insn_code_number >= 0 && GET_CODE (SET_DEST (i3set)) == REG
1603 && GET_CODE (SET_DEST (i2set)) == REG
1604 && REGNO (SET_DEST (i3set)) == REGNO (SET_DEST (i2set)))
1605 reg_n_sets[REGNO (SET_DEST (i2set))]++;
1608 /* If we can split it and use I2DEST, go ahead and see if that
1609 helps things be recognized. Verify that none of the registers
1610 are set between I2 and I3. */
1611 if (insn_code_number < 0 && (split = find_split_point (&newpat, i3)) != 0
1613 && GET_CODE (i2dest) == REG
1615 /* We need I2DEST in the proper mode. If it is a hard register
1616 or the only use of a pseudo, we can change its mode. */
1617 && (GET_MODE (*split) == GET_MODE (i2dest)
1618 || GET_MODE (*split) == VOIDmode
1619 || REGNO (i2dest) < FIRST_PSEUDO_REGISTER
1620 || (reg_n_sets[REGNO (i2dest)] == 1 && ! added_sets_2
1621 && ! REG_USERVAR_P (i2dest)))
1622 && (next_real_insn (i2) == i3
1623 || ! use_crosses_set_p (*split, INSN_CUID (i2)))
1624 /* We can't overwrite I2DEST if its value is still used by
1626 && ! reg_referenced_p (i2dest, newpat))
1628 rtx newdest = i2dest;
1630 /* Get NEWDEST as a register in the proper mode. We have already
1631 validated that we can do this. */
1632 if (GET_MODE (i2dest) != GET_MODE (*split)
1633 && GET_MODE (*split) != VOIDmode)
1635 newdest = gen_rtx (REG, GET_MODE (*split), REGNO (i2dest));
1637 if (REGNO (i2dest) >= FIRST_PSEUDO_REGISTER)
1638 SUBST (regno_reg_rtx[REGNO (i2dest)], newdest);
1641 /* If *SPLIT is a (mult FOO (const_int pow2)), convert it to
1642 an ASHIFT. This can occur if it was inside a PLUS and hence
1643 appeared to be a memory address. This is a kludge. */
1644 if (GET_CODE (*split) == MULT
1645 && GET_CODE (XEXP (*split, 1)) == CONST_INT
1646 && (i = exact_log2 (INTVAL (XEXP (*split, 1)))) >= 0)
1647 SUBST (*split, gen_rtx_combine (ASHIFT, GET_MODE (*split),
1648 XEXP (*split, 0), GEN_INT (i)));
1650 #ifdef INSN_SCHEDULING
1651 /* If *SPLIT is a paradoxical SUBREG, when we split it, it should
1652 be written as a ZERO_EXTEND. */
1653 if (GET_CODE (*split) == SUBREG
1654 && GET_CODE (SUBREG_REG (*split)) == MEM)
1655 SUBST (*split, gen_rtx_combine (ZERO_EXTEND, GET_MODE (*split),
1659 newi2pat = gen_rtx_combine (SET, VOIDmode, newdest, *split);
1660 SUBST (*split, newdest);
1661 i2_code_number = recog_for_combine (&newi2pat, i2, &new_i2_notes);
1662 if (i2_code_number >= 0)
1663 insn_code_number = recog_for_combine (&newpat, i3, &new_i3_notes);
1667 /* Check for a case where we loaded from memory in a narrow mode and
1668 then sign extended it, but we need both registers. In that case,
1669 we have a PARALLEL with both loads from the same memory location.
1670 We can split this into a load from memory followed by a register-register
1671 copy. This saves at least one insn, more if register allocation can
1672 eliminate the copy. */
1674 else if (i1 && insn_code_number < 0 && asm_noperands (newpat) < 0
1675 && GET_CODE (newpat) == PARALLEL
1676 && XVECLEN (newpat, 0) == 2
1677 && GET_CODE (XVECEXP (newpat, 0, 0)) == SET
1678 && GET_CODE (SET_SRC (XVECEXP (newpat, 0, 0))) == SIGN_EXTEND
1679 && GET_CODE (XVECEXP (newpat, 0, 1)) == SET
1680 && rtx_equal_p (SET_SRC (XVECEXP (newpat, 0, 1)),
1681 XEXP (SET_SRC (XVECEXP (newpat, 0, 0)), 0))
1682 && ! use_crosses_set_p (SET_SRC (XVECEXP (newpat, 0, 1)),
1684 && GET_CODE (SET_DEST (XVECEXP (newpat, 0, 1))) != ZERO_EXTRACT
1685 && GET_CODE (SET_DEST (XVECEXP (newpat, 0, 1))) != STRICT_LOW_PART
1686 && ! reg_overlap_mentioned_p (SET_DEST (XVECEXP (newpat, 0, 1)),
1687 SET_SRC (XVECEXP (newpat, 0, 1)))
1688 && ! find_reg_note (i3, REG_UNUSED,
1689 SET_DEST (XVECEXP (newpat, 0, 0))))
1693 newi2pat = XVECEXP (newpat, 0, 0);
1694 ni2dest = SET_DEST (XVECEXP (newpat, 0, 0));
1695 newpat = XVECEXP (newpat, 0, 1);
1696 SUBST (SET_SRC (newpat),
1697 gen_lowpart_for_combine (GET_MODE (SET_SRC (newpat)), ni2dest));
1698 i2_code_number = recog_for_combine (&newi2pat, i2, &new_i2_notes);
1699 if (i2_code_number >= 0)
1700 insn_code_number = recog_for_combine (&newpat, i3, &new_i3_notes);
1702 if (insn_code_number >= 0)
1707 /* If we will be able to accept this, we have made a change to the
1708 destination of I3. This can invalidate a LOG_LINKS pointing
1709 to I3. No other part of combine.c makes such a transformation.
1711 The new I3 will have a destination that was previously the
1712 destination of I1 or I2 and which was used in i2 or I3. Call
1713 distribute_links to make a LOG_LINK from the next use of
1714 that destination. */
1716 PATTERN (i3) = newpat;
1717 distribute_links (gen_rtx (INSN_LIST, VOIDmode, i3, NULL_RTX));
1719 /* I3 now uses what used to be its destination and which is
1720 now I2's destination. That means we need a LOG_LINK from
1721 I3 to I2. But we used to have one, so we still will.
1723 However, some later insn might be using I2's dest and have
1724 a LOG_LINK pointing at I3. We must remove this link.
1725 The simplest way to remove the link is to point it at I1,
1726 which we know will be a NOTE. */
1728 for (insn = NEXT_INSN (i3);
1729 insn && GET_CODE (insn) != CODE_LABEL
1730 && GET_CODE (PREV_INSN (insn)) != JUMP_INSN;
1731 insn = NEXT_INSN (insn))
1733 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i'
1734 && reg_referenced_p (ni2dest, PATTERN (insn)))
1736 for (link = LOG_LINKS (insn); link;
1737 link = XEXP (link, 1))
1738 if (XEXP (link, 0) == i3)
1739 XEXP (link, 0) = i1;
1747 /* Similarly, check for a case where we have a PARALLEL of two independent
1748 SETs but we started with three insns. In this case, we can do the sets
1749 as two separate insns. This case occurs when some SET allows two
1750 other insns to combine, but the destination of that SET is still live. */
1752 else if (i1 && insn_code_number < 0 && asm_noperands (newpat) < 0
1753 && GET_CODE (newpat) == PARALLEL
1754 && XVECLEN (newpat, 0) == 2
1755 && GET_CODE (XVECEXP (newpat, 0, 0)) == SET
1756 && GET_CODE (SET_DEST (XVECEXP (newpat, 0, 0))) != ZERO_EXTRACT
1757 && GET_CODE (SET_DEST (XVECEXP (newpat, 0, 0))) != STRICT_LOW_PART
1758 && GET_CODE (XVECEXP (newpat, 0, 1)) == SET
1759 && GET_CODE (SET_DEST (XVECEXP (newpat, 0, 1))) != ZERO_EXTRACT
1760 && GET_CODE (SET_DEST (XVECEXP (newpat, 0, 1))) != STRICT_LOW_PART
1761 && ! use_crosses_set_p (SET_SRC (XVECEXP (newpat, 0, 1)),
1763 /* Don't pass sets with (USE (MEM ...)) dests to the following. */
1764 && GET_CODE (SET_DEST (XVECEXP (newpat, 0, 1))) != USE
1765 && GET_CODE (SET_DEST (XVECEXP (newpat, 0, 0))) != USE
1766 && ! reg_referenced_p (SET_DEST (XVECEXP (newpat, 0, 1)),
1767 XVECEXP (newpat, 0, 0))
1768 && ! reg_referenced_p (SET_DEST (XVECEXP (newpat, 0, 0)),
1769 XVECEXP (newpat, 0, 1)))
1771 newi2pat = XVECEXP (newpat, 0, 1);
1772 newpat = XVECEXP (newpat, 0, 0);
1774 i2_code_number = recog_for_combine (&newi2pat, i2, &new_i2_notes);
1775 if (i2_code_number >= 0)
1776 insn_code_number = recog_for_combine (&newpat, i3, &new_i3_notes);
1779 /* If it still isn't recognized, fail and change things back the way they
1781 if ((insn_code_number < 0
1782 /* Is the result a reasonable ASM_OPERANDS? */
1783 && (! check_asm_operands (newpat) || added_sets_1 || added_sets_2)))
1789 /* If we had to change another insn, make sure it is valid also. */
1790 if (undobuf.other_insn)
1792 rtx other_notes = REG_NOTES (undobuf.other_insn);
1793 rtx other_pat = PATTERN (undobuf.other_insn);
1794 rtx new_other_notes;
1797 other_code_number = recog_for_combine (&other_pat, undobuf.other_insn,
1800 if (other_code_number < 0 && ! check_asm_operands (other_pat))
1806 PATTERN (undobuf.other_insn) = other_pat;
1808 /* If any of the notes in OTHER_INSN were REG_UNUSED, ensure that they
1809 are still valid. Then add any non-duplicate notes added by
1810 recog_for_combine. */
1811 for (note = REG_NOTES (undobuf.other_insn); note; note = next)
1813 next = XEXP (note, 1);
1815 if (REG_NOTE_KIND (note) == REG_UNUSED
1816 && ! reg_set_p (XEXP (note, 0), PATTERN (undobuf.other_insn)))
1818 if (GET_CODE (XEXP (note, 0)) == REG)
1819 reg_n_deaths[REGNO (XEXP (note, 0))]--;
1821 remove_note (undobuf.other_insn, note);
1825 for (note = new_other_notes; note; note = XEXP (note, 1))
1826 if (GET_CODE (XEXP (note, 0)) == REG)
1827 reg_n_deaths[REGNO (XEXP (note, 0))]++;
1829 distribute_notes (new_other_notes, undobuf.other_insn,
1830 undobuf.other_insn, NULL_RTX, NULL_RTX, NULL_RTX);
1833 /* We now know that we can do this combination. Merge the insns and
1834 update the status of registers and LOG_LINKS. */
1837 rtx i3notes, i2notes, i1notes = 0;
1838 rtx i3links, i2links, i1links = 0;
1840 int all_adjacent = (next_real_insn (i2) == i3
1841 && (i1 == 0 || next_real_insn (i1) == i2));
1843 /* Compute which registers we expect to eliminate. */
1844 rtx elim_i2 = (newi2pat || i2dest_in_i2src || i2dest_in_i1src
1846 rtx elim_i1 = i1 == 0 || i1dest_in_i1src ? 0 : i1dest;
1848 /* Get the old REG_NOTES and LOG_LINKS from all our insns and
1850 i3notes = REG_NOTES (i3), i3links = LOG_LINKS (i3);
1851 i2notes = REG_NOTES (i2), i2links = LOG_LINKS (i2);
1853 i1notes = REG_NOTES (i1), i1links = LOG_LINKS (i1);
1855 /* Ensure that we do not have something that should not be shared but
1856 occurs multiple times in the new insns. Check this by first
1857 resetting all the `used' flags and then copying anything is shared. */
1859 reset_used_flags (i3notes);
1860 reset_used_flags (i2notes);
1861 reset_used_flags (i1notes);
1862 reset_used_flags (newpat);
1863 reset_used_flags (newi2pat);
1864 if (undobuf.other_insn)
1865 reset_used_flags (PATTERN (undobuf.other_insn));
1867 i3notes = copy_rtx_if_shared (i3notes);
1868 i2notes = copy_rtx_if_shared (i2notes);
1869 i1notes = copy_rtx_if_shared (i1notes);
1870 newpat = copy_rtx_if_shared (newpat);
1871 newi2pat = copy_rtx_if_shared (newi2pat);
1872 if (undobuf.other_insn)
1873 reset_used_flags (PATTERN (undobuf.other_insn));
1875 INSN_CODE (i3) = insn_code_number;
1876 PATTERN (i3) = newpat;
1877 if (undobuf.other_insn)
1878 INSN_CODE (undobuf.other_insn) = other_code_number;
1880 /* We had one special case above where I2 had more than one set and
1881 we replaced a destination of one of those sets with the destination
1882 of I3. In that case, we have to update LOG_LINKS of insns later
1883 in this basic block. Note that this (expensive) case is rare. */
1885 if (GET_CODE (PATTERN (i2)) == PARALLEL)
1886 for (i = 0; i < XVECLEN (PATTERN (i2), 0); i++)
1887 if (GET_CODE (SET_DEST (XVECEXP (PATTERN (i2), 0, i))) == REG
1888 && SET_DEST (XVECEXP (PATTERN (i2), 0, i)) != i2dest
1889 && ! find_reg_note (i2, REG_UNUSED,
1890 SET_DEST (XVECEXP (PATTERN (i2), 0, i))))
1894 for (insn = NEXT_INSN (i2); insn; insn = NEXT_INSN (insn))
1896 if (insn != i3 && GET_RTX_CLASS (GET_CODE (insn)) == 'i')
1897 for (link = LOG_LINKS (insn); link; link = XEXP (link, 1))
1898 if (XEXP (link, 0) == i2)
1899 XEXP (link, 0) = i3;
1901 if (GET_CODE (insn) == CODE_LABEL
1902 || GET_CODE (insn) == JUMP_INSN)
1914 INSN_CODE (i2) = i2_code_number;
1915 PATTERN (i2) = newi2pat;
1919 PUT_CODE (i2, NOTE);
1920 NOTE_LINE_NUMBER (i2) = NOTE_INSN_DELETED;
1921 NOTE_SOURCE_FILE (i2) = 0;
1928 PUT_CODE (i1, NOTE);
1929 NOTE_LINE_NUMBER (i1) = NOTE_INSN_DELETED;
1930 NOTE_SOURCE_FILE (i1) = 0;
1933 /* Get death notes for everything that is now used in either I3 or
1934 I2 and used to die in a previous insn. */
1936 move_deaths (newpat, i1 ? INSN_CUID (i1) : INSN_CUID (i2), i3, &midnotes);
1938 move_deaths (newi2pat, INSN_CUID (i1), i2, &midnotes);
1940 /* Distribute all the LOG_LINKS and REG_NOTES from I1, I2, and I3. */
1942 distribute_notes (i3notes, i3, i3, newi2pat ? i2 : NULL_RTX,
1945 distribute_notes (i2notes, i2, i3, newi2pat ? i2 : NULL_RTX,
1948 distribute_notes (i1notes, i1, i3, newi2pat ? i2 : NULL_RTX,
1951 distribute_notes (midnotes, NULL_RTX, i3, newi2pat ? i2 : NULL_RTX,
1954 /* Distribute any notes added to I2 or I3 by recog_for_combine. We
1955 know these are REG_UNUSED and want them to go to the desired insn,
1956 so we always pass it as i3. We have not counted the notes in
1957 reg_n_deaths yet, so we need to do so now. */
1959 if (newi2pat && new_i2_notes)
1961 for (temp = new_i2_notes; temp; temp = XEXP (temp, 1))
1962 if (GET_CODE (XEXP (temp, 0)) == REG)
1963 reg_n_deaths[REGNO (XEXP (temp, 0))]++;
1965 distribute_notes (new_i2_notes, i2, i2, NULL_RTX, NULL_RTX, NULL_RTX);
1970 for (temp = new_i3_notes; temp; temp = XEXP (temp, 1))
1971 if (GET_CODE (XEXP (temp, 0)) == REG)
1972 reg_n_deaths[REGNO (XEXP (temp, 0))]++;
1974 distribute_notes (new_i3_notes, i3, i3, NULL_RTX, NULL_RTX, NULL_RTX);
1977 /* If I3DEST was used in I3SRC, it really died in I3. We may need to
1978 put a REG_DEAD note for it somewhere. Similarly for I2 and I1.
1979 Show an additional death due to the REG_DEAD note we make here. If
1980 we discard it in distribute_notes, we will decrement it again. */
1984 if (GET_CODE (i3dest_killed) == REG)
1985 reg_n_deaths[REGNO (i3dest_killed)]++;
1987 distribute_notes (gen_rtx (EXPR_LIST, REG_DEAD, i3dest_killed,
1989 NULL_RTX, i3, newi2pat ? i2 : NULL_RTX,
1990 NULL_RTX, NULL_RTX);
1993 /* For I2 and I1, we have to be careful. If NEWI2PAT exists and sets
1994 I2DEST or I1DEST, the death must be somewhere before I2, not I3. If
1995 we passed I3 in that case, it might delete I2. */
1997 if (i2dest_in_i2src)
1999 if (GET_CODE (i2dest) == REG)
2000 reg_n_deaths[REGNO (i2dest)]++;
2002 if (newi2pat && reg_set_p (i2dest, newi2pat))
2003 distribute_notes (gen_rtx (EXPR_LIST, REG_DEAD, i2dest, NULL_RTX),
2004 NULL_RTX, i2, NULL_RTX, NULL_RTX, NULL_RTX);
2006 distribute_notes (gen_rtx (EXPR_LIST, REG_DEAD, i2dest, NULL_RTX),
2007 NULL_RTX, i3, newi2pat ? i2 : NULL_RTX,
2008 NULL_RTX, NULL_RTX);
2011 if (i1dest_in_i1src)
2013 if (GET_CODE (i1dest) == REG)
2014 reg_n_deaths[REGNO (i1dest)]++;
2016 if (newi2pat && reg_set_p (i1dest, newi2pat))
2017 distribute_notes (gen_rtx (EXPR_LIST, REG_DEAD, i1dest, NULL_RTX),
2018 NULL_RTX, i2, NULL_RTX, NULL_RTX, NULL_RTX);
2020 distribute_notes (gen_rtx (EXPR_LIST, REG_DEAD, i1dest, NULL_RTX),
2021 NULL_RTX, i3, newi2pat ? i2 : NULL_RTX,
2022 NULL_RTX, NULL_RTX);
2025 distribute_links (i3links);
2026 distribute_links (i2links);
2027 distribute_links (i1links);
2029 if (GET_CODE (i2dest) == REG)
2032 rtx i2_insn = 0, i2_val = 0, set;
2034 /* The insn that used to set this register doesn't exist, and
2035 this life of the register may not exist either. See if one of
2036 I3's links points to an insn that sets I2DEST. If it does,
2037 that is now the last known value for I2DEST. If we don't update
2038 this and I2 set the register to a value that depended on its old
2039 contents, we will get confused. If this insn is used, thing
2040 will be set correctly in combine_instructions. */
2042 for (link = LOG_LINKS (i3); link; link = XEXP (link, 1))
2043 if ((set = single_set (XEXP (link, 0))) != 0
2044 && rtx_equal_p (i2dest, SET_DEST (set)))
2045 i2_insn = XEXP (link, 0), i2_val = SET_SRC (set);
2047 record_value_for_reg (i2dest, i2_insn, i2_val);
2049 /* If the reg formerly set in I2 died only once and that was in I3,
2050 zero its use count so it won't make `reload' do any work. */
2051 if (! added_sets_2 && newi2pat == 0)
2053 regno = REGNO (i2dest);
2054 reg_n_sets[regno]--;
2055 if (reg_n_sets[regno] == 0
2056 && ! (basic_block_live_at_start[0][regno / REGSET_ELT_BITS]
2057 & ((REGSET_ELT_TYPE) 1 << (regno % REGSET_ELT_BITS))))
2058 reg_n_refs[regno] = 0;
2062 if (i1 && GET_CODE (i1dest) == REG)
2065 rtx i1_insn = 0, i1_val = 0, set;
2067 for (link = LOG_LINKS (i3); link; link = XEXP (link, 1))
2068 if ((set = single_set (XEXP (link, 0))) != 0
2069 && rtx_equal_p (i1dest, SET_DEST (set)))
2070 i1_insn = XEXP (link, 0), i1_val = SET_SRC (set);
2072 record_value_for_reg (i1dest, i1_insn, i1_val);
2074 regno = REGNO (i1dest);
2077 reg_n_sets[regno]--;
2078 if (reg_n_sets[regno] == 0
2079 && ! (basic_block_live_at_start[0][regno / REGSET_ELT_BITS]
2080 & ((REGSET_ELT_TYPE) 1 << (regno % REGSET_ELT_BITS))))
2081 reg_n_refs[regno] = 0;
2085 /* Update reg_significant et al for any changes that may have been made
2088 note_stores (newpat, set_significant);
2090 note_stores (newi2pat, set_significant);
2092 /* If I3 is now an unconditional jump, ensure that it has a
2093 BARRIER following it since it may have initially been a
2094 conditional jump. It may also be the last nonnote insn. */
2096 if ((GET_CODE (newpat) == RETURN || simplejump_p (i3))
2097 && ((temp = next_nonnote_insn (i3)) == NULL_RTX
2098 || GET_CODE (temp) != BARRIER))
2099 emit_barrier_after (i3);
2102 combine_successes++;
2104 return newi2pat ? i2 : i3;
2107 /* Undo all the modifications recorded in undobuf. */
2113 if (undobuf.num_undo > MAX_UNDO)
2114 undobuf.num_undo = MAX_UNDO;
2115 for (i = undobuf.num_undo - 1; i >= 0; i--)
2117 if (undobuf.undo[i].is_int)
2118 *undobuf.undo[i].where.i = undobuf.undo[i].old_contents.i;
2120 *undobuf.undo[i].where.rtx = undobuf.undo[i].old_contents.rtx;
2124 obfree (undobuf.storage);
2125 undobuf.num_undo = 0;
2128 /* Find the innermost point within the rtx at LOC, possibly LOC itself,
2129 where we have an arithmetic expression and return that point. LOC will
2132 try_combine will call this function to see if an insn can be split into
2136 find_split_point (loc, insn)
2141 enum rtx_code code = GET_CODE (x);
2143 int len = 0, pos, unsignedp;
2146 /* First special-case some codes. */
2150 #ifdef INSN_SCHEDULING
2151 /* If we are making a paradoxical SUBREG invalid, it becomes a split
2153 if (GET_CODE (SUBREG_REG (x)) == MEM)
2156 return find_split_point (&SUBREG_REG (x), insn);
2160 /* If we have (mem (const ..)) or (mem (symbol_ref ...)), split it
2161 using LO_SUM and HIGH. */
2162 if (GET_CODE (XEXP (x, 0)) == CONST
2163 || GET_CODE (XEXP (x, 0)) == SYMBOL_REF)
2166 gen_rtx_combine (LO_SUM, Pmode,
2167 gen_rtx_combine (HIGH, Pmode, XEXP (x, 0)),
2169 return &XEXP (XEXP (x, 0), 0);
2173 /* If we have a PLUS whose second operand is a constant and the
2174 address is not valid, perhaps will can split it up using
2175 the machine-specific way to split large constants. We use
2176 the first psuedo-reg (one of the virtual regs) as a placeholder;
2177 it will not remain in the result. */
2178 if (GET_CODE (XEXP (x, 0)) == PLUS
2179 && GET_CODE (XEXP (XEXP (x, 0), 1)) == CONST_INT
2180 && ! memory_address_p (GET_MODE (x), XEXP (x, 0)))
2182 rtx reg = regno_reg_rtx[FIRST_PSEUDO_REGISTER];
2183 rtx seq = split_insns (gen_rtx (SET, VOIDmode, reg, XEXP (x, 0)),
2186 /* This should have produced two insns, each of which sets our
2187 placeholder. If the source of the second is a valid address,
2188 we can make put both sources together and make a split point
2191 if (seq && XVECLEN (seq, 0) == 2
2192 && GET_CODE (XVECEXP (seq, 0, 0)) == INSN
2193 && GET_CODE (PATTERN (XVECEXP (seq, 0, 0))) == SET
2194 && SET_DEST (PATTERN (XVECEXP (seq, 0, 0))) == reg
2195 && ! reg_mentioned_p (reg,
2196 SET_SRC (PATTERN (XVECEXP (seq, 0, 0))))
2197 && GET_CODE (XVECEXP (seq, 0, 1)) == INSN
2198 && GET_CODE (PATTERN (XVECEXP (seq, 0, 1))) == SET
2199 && SET_DEST (PATTERN (XVECEXP (seq, 0, 1))) == reg
2200 && memory_address_p (GET_MODE (x),
2201 SET_SRC (PATTERN (XVECEXP (seq, 0, 1)))))
2203 rtx src1 = SET_SRC (PATTERN (XVECEXP (seq, 0, 0)));
2204 rtx src2 = SET_SRC (PATTERN (XVECEXP (seq, 0, 1)));
2206 /* Replace the placeholder in SRC2 with SRC1. If we can
2207 find where in SRC2 it was placed, that can become our
2208 split point and we can replace this address with SRC2.
2209 Just try two obvious places. */
2211 src2 = replace_rtx (src2, reg, src1);
2213 if (XEXP (src2, 0) == src1)
2214 split = &XEXP (src2, 0);
2215 else if (GET_RTX_FORMAT (GET_CODE (XEXP (src2, 0)))[0] == 'e'
2216 && XEXP (XEXP (src2, 0), 0) == src1)
2217 split = &XEXP (XEXP (src2, 0), 0);
2221 SUBST (XEXP (x, 0), src2);
2226 /* If that didn't work, perhaps the first operand is complex and
2227 needs to be computed separately, so make a split point there.
2228 This will occur on machines that just support REG + CONST
2229 and have a constant moved through some previous computation. */
2231 else if (GET_RTX_CLASS (GET_CODE (XEXP (XEXP (x, 0), 0))) != 'o'
2232 && ! (GET_CODE (XEXP (XEXP (x, 0), 0)) == SUBREG
2233 && (GET_RTX_CLASS (GET_CODE (SUBREG_REG (XEXP (XEXP (x, 0), 0))))
2235 return &XEXP (XEXP (x, 0), 0);
2241 /* If SET_DEST is CC0 and SET_SRC is not an operand, a COMPARE, or a
2242 ZERO_EXTRACT, the most likely reason why this doesn't match is that
2243 we need to put the operand into a register. So split at that
2246 if (SET_DEST (x) == cc0_rtx
2247 && GET_CODE (SET_SRC (x)) != COMPARE
2248 && GET_CODE (SET_SRC (x)) != ZERO_EXTRACT
2249 && GET_RTX_CLASS (GET_CODE (SET_SRC (x))) != 'o'
2250 && ! (GET_CODE (SET_SRC (x)) == SUBREG
2251 && GET_RTX_CLASS (GET_CODE (SUBREG_REG (SET_SRC (x)))) == 'o'))
2252 return &SET_SRC (x);
2255 /* See if we can split SET_SRC as it stands. */
2256 split = find_split_point (&SET_SRC (x), insn);
2257 if (split && split != &SET_SRC (x))
2260 /* See if this is a bitfield assignment with everything constant. If
2261 so, this is an IOR of an AND, so split it into that. */
2262 if (GET_CODE (SET_DEST (x)) == ZERO_EXTRACT
2263 && (GET_MODE_BITSIZE (GET_MODE (XEXP (SET_DEST (x), 0)))
2264 <= HOST_BITS_PER_WIDE_INT)
2265 && GET_CODE (XEXP (SET_DEST (x), 1)) == CONST_INT
2266 && GET_CODE (XEXP (SET_DEST (x), 2)) == CONST_INT
2267 && GET_CODE (SET_SRC (x)) == CONST_INT
2268 && ((INTVAL (XEXP (SET_DEST (x), 1))
2269 + INTVAL (XEXP (SET_DEST (x), 2)))
2270 <= GET_MODE_BITSIZE (GET_MODE (XEXP (SET_DEST (x), 0))))
2271 && ! side_effects_p (XEXP (SET_DEST (x), 0)))
2273 int pos = INTVAL (XEXP (SET_DEST (x), 2));
2274 int len = INTVAL (XEXP (SET_DEST (x), 1));
2275 int src = INTVAL (SET_SRC (x));
2276 rtx dest = XEXP (SET_DEST (x), 0);
2277 enum machine_mode mode = GET_MODE (dest);
2278 unsigned HOST_WIDE_INT mask = ((HOST_WIDE_INT) 1 << len) - 1;
2281 pos = GET_MODE_BITSIZE (mode) - len - pos;
2286 gen_binary (IOR, mode, dest, GEN_INT (src << pos)));
2289 gen_binary (IOR, mode,
2290 gen_binary (AND, mode, dest,
2291 GEN_INT (~ (mask << pos)
2292 & GET_MODE_MASK (mode))),
2293 GEN_INT (src << pos)));
2295 SUBST (SET_DEST (x), dest);
2297 split = find_split_point (&SET_SRC (x), insn);
2298 if (split && split != &SET_SRC (x))
2302 /* Otherwise, see if this is an operation that we can split into two.
2303 If so, try to split that. */
2304 code = GET_CODE (SET_SRC (x));
2309 /* If we are AND'ing with a large constant that is only a single
2310 bit and the result is only being used in a context where we
2311 need to know if it is zero or non-zero, replace it with a bit
2312 extraction. This will avoid the large constant, which might
2313 have taken more than one insn to make. If the constant were
2314 not a valid argument to the AND but took only one insn to make,
2315 this is no worse, but if it took more than one insn, it will
2318 if (GET_CODE (XEXP (SET_SRC (x), 1)) == CONST_INT
2319 && GET_CODE (XEXP (SET_SRC (x), 0)) == REG
2320 && (pos = exact_log2 (INTVAL (XEXP (SET_SRC (x), 1)))) >= 7
2321 && GET_CODE (SET_DEST (x)) == REG
2322 && (split = find_single_use (SET_DEST (x), insn, NULL_PTR)) != 0
2323 && (GET_CODE (*split) == EQ || GET_CODE (*split) == NE)
2324 && XEXP (*split, 0) == SET_DEST (x)
2325 && XEXP (*split, 1) == const0_rtx)
2328 make_extraction (GET_MODE (SET_DEST (x)),
2329 XEXP (SET_SRC (x), 0),
2330 pos, NULL_RTX, 1, 1, 0, 0));
2331 return find_split_point (loc, insn);
2336 inner = XEXP (SET_SRC (x), 0);
2338 len = GET_MODE_BITSIZE (GET_MODE (inner));
2344 if (GET_CODE (XEXP (SET_SRC (x), 1)) == CONST_INT
2345 && GET_CODE (XEXP (SET_SRC (x), 2)) == CONST_INT)
2347 inner = XEXP (SET_SRC (x), 0);
2348 len = INTVAL (XEXP (SET_SRC (x), 1));
2349 pos = INTVAL (XEXP (SET_SRC (x), 2));
2352 pos = GET_MODE_BITSIZE (GET_MODE (inner)) - len - pos;
2354 unsignedp = (code == ZERO_EXTRACT);
2359 if (len && pos >= 0 && pos + len <= GET_MODE_BITSIZE (GET_MODE (inner)))
2361 enum machine_mode mode = GET_MODE (SET_SRC (x));
2363 /* For unsigned, we have a choice of a shift followed by an
2364 AND or two shifts. Use two shifts for field sizes where the
2365 constant might be too large. We assume here that we can
2366 always at least get 8-bit constants in an AND insn, which is
2367 true for every current RISC. */
2369 if (unsignedp && len <= 8)
2374 gen_rtx_combine (LSHIFTRT, mode,
2375 gen_lowpart_for_combine (mode, inner),
2377 GEN_INT (((HOST_WIDE_INT) 1 << len) - 1)));
2379 split = find_split_point (&SET_SRC (x), insn);
2380 if (split && split != &SET_SRC (x))
2387 (unsignedp ? LSHIFTRT : ASHIFTRT, mode,
2388 gen_rtx_combine (ASHIFT, mode,
2389 gen_lowpart_for_combine (mode, inner),
2390 GEN_INT (GET_MODE_BITSIZE (mode)
2392 GEN_INT (GET_MODE_BITSIZE (mode) - len)));
2394 split = find_split_point (&SET_SRC (x), insn);
2395 if (split && split != &SET_SRC (x))
2400 /* See if this is a simple operation with a constant as the second
2401 operand. It might be that this constant is out of range and hence
2402 could be used as a split point. */
2403 if ((GET_RTX_CLASS (GET_CODE (SET_SRC (x))) == '2'
2404 || GET_RTX_CLASS (GET_CODE (SET_SRC (x))) == 'c'
2405 || GET_RTX_CLASS (GET_CODE (SET_SRC (x))) == '<')
2406 && CONSTANT_P (XEXP (SET_SRC (x), 1))
2407 && (GET_RTX_CLASS (GET_CODE (XEXP (SET_SRC (x), 0))) == 'o'
2408 || (GET_CODE (XEXP (SET_SRC (x), 0)) == SUBREG
2409 && (GET_RTX_CLASS (GET_CODE (SUBREG_REG (XEXP (SET_SRC (x), 0))))
2411 return &XEXP (SET_SRC (x), 1);
2413 /* Finally, see if this is a simple operation with its first operand
2414 not in a register. The operation might require this operand in a
2415 register, so return it as a split point. We can always do this
2416 because if the first operand were another operation, we would have
2417 already found it as a split point. */
2418 if ((GET_RTX_CLASS (GET_CODE (SET_SRC (x))) == '2'
2419 || GET_RTX_CLASS (GET_CODE (SET_SRC (x))) == 'c'
2420 || GET_RTX_CLASS (GET_CODE (SET_SRC (x))) == '<'
2421 || GET_RTX_CLASS (GET_CODE (SET_SRC (x))) == '1')
2422 && ! register_operand (XEXP (SET_SRC (x), 0), VOIDmode))
2423 return &XEXP (SET_SRC (x), 0);
2429 /* We write NOR as (and (not A) (not B)), but if we don't have a NOR,
2430 it is better to write this as (not (ior A B)) so we can split it.
2431 Similarly for IOR. */
2432 if (GET_CODE (XEXP (x, 0)) == NOT && GET_CODE (XEXP (x, 1)) == NOT)
2435 gen_rtx_combine (NOT, GET_MODE (x),
2436 gen_rtx_combine (code == IOR ? AND : IOR,
2438 XEXP (XEXP (x, 0), 0),
2439 XEXP (XEXP (x, 1), 0))));
2440 return find_split_point (loc, insn);
2443 /* Many RISC machines have a large set of logical insns. If the
2444 second operand is a NOT, put it first so we will try to split the
2445 other operand first. */
2446 if (GET_CODE (XEXP (x, 1)) == NOT)
2448 rtx tem = XEXP (x, 0);
2449 SUBST (XEXP (x, 0), XEXP (x, 1));
2450 SUBST (XEXP (x, 1), tem);
2455 /* Otherwise, select our actions depending on our rtx class. */
2456 switch (GET_RTX_CLASS (code))
2458 case 'b': /* This is ZERO_EXTRACT and SIGN_EXTRACT. */
2460 split = find_split_point (&XEXP (x, 2), insn);
2463 /* ... fall through ... */
2467 split = find_split_point (&XEXP (x, 1), insn);
2470 /* ... fall through ... */
2472 /* Some machines have (and (shift ...) ...) insns. If X is not
2473 an AND, but XEXP (X, 0) is, use it as our split point. */
2474 if (GET_CODE (x) != AND && GET_CODE (XEXP (x, 0)) == AND)
2475 return &XEXP (x, 0);
2477 split = find_split_point (&XEXP (x, 0), insn);
2483 /* Otherwise, we don't have a split point. */
2487 /* Throughout X, replace FROM with TO, and return the result.
2488 The result is TO if X is FROM;
2489 otherwise the result is X, but its contents may have been modified.
2490 If they were modified, a record was made in undobuf so that
2491 undo_all will (among other things) return X to its original state.
2493 If the number of changes necessary is too much to record to undo,
2494 the excess changes are not made, so the result is invalid.
2495 The changes already made can still be undone.
2496 undobuf.num_undo is incremented for such changes, so by testing that
2497 the caller can tell whether the result is valid.
2499 `n_occurrences' is incremented each time FROM is replaced.
2501 IN_DEST is non-zero if we are processing the SET_DEST of a SET.
2503 UNIQUE_COPY is non-zero if each substitution must be unique. We do this
2504 by copying if `n_occurrences' is non-zero. */
2507 subst (x, from, to, in_dest, unique_copy)
2508 register rtx x, from, to;
2513 register int len, i;
2514 register enum rtx_code code = GET_CODE (x), orig_code = code;
2516 enum machine_mode mode = GET_MODE (x);
2517 enum machine_mode op0_mode = VOIDmode;
2522 /* FAKE_EXTEND_SAFE_P (MODE, FROM) is 1 if (subreg:MODE FROM 0) is a safe
2523 replacement for (zero_extend:MODE FROM) or (sign_extend:MODE FROM).
2524 If it is 0, that cannot be done. We can now do this for any MEM
2525 because (SUBREG (MEM...)) is guaranteed to cause the MEM to be reloaded.
2526 If not for that, MEM's would very rarely be safe. */
2528 /* Reject MODEs bigger than a word, because we might not be able
2529 to reference a two-register group starting with an arbitrary register
2530 (and currently gen_lowpart might crash for a SUBREG). */
2532 #define FAKE_EXTEND_SAFE_P(MODE, FROM) \
2533 (GET_MODE_SIZE (MODE) <= UNITS_PER_WORD)
2535 /* Two expressions are equal if they are identical copies of a shared
2536 RTX or if they are both registers with the same register number
2539 #define COMBINE_RTX_EQUAL_P(X,Y) \
2541 || (GET_CODE (X) == REG && GET_CODE (Y) == REG \
2542 && REGNO (X) == REGNO (Y) && GET_MODE (X) == GET_MODE (Y)))
2544 if (! in_dest && COMBINE_RTX_EQUAL_P (x, from))
2547 return (unique_copy && n_occurrences > 1 ? copy_rtx (to) : to);
2550 /* If X and FROM are the same register but different modes, they will
2551 not have been seen as equal above. However, flow.c will make a
2552 LOG_LINKS entry for that case. If we do nothing, we will try to
2553 rerecognize our original insn and, when it succeeds, we will
2554 delete the feeding insn, which is incorrect.
2556 So force this insn not to match in this (rare) case. */
2557 if (! in_dest && code == REG && GET_CODE (from) == REG
2558 && REGNO (x) == REGNO (from))
2559 return gen_rtx (CLOBBER, GET_MODE (x), const0_rtx);
2561 /* If this is an object, we are done unless it is a MEM or LO_SUM, both
2562 of which may contain things that can be combined. */
2563 if (code != MEM && code != LO_SUM && GET_RTX_CLASS (code) == 'o')
2566 /* It is possible to have a subexpression appear twice in the insn.
2567 Suppose that FROM is a register that appears within TO.
2568 Then, after that subexpression has been scanned once by `subst',
2569 the second time it is scanned, TO may be found. If we were
2570 to scan TO here, we would find FROM within it and create a
2571 self-referent rtl structure which is completely wrong. */
2572 if (COMBINE_RTX_EQUAL_P (x, to))
2575 len = GET_RTX_LENGTH (code);
2576 fmt = GET_RTX_FORMAT (code);
2578 /* We don't need to process a SET_DEST that is a register, CC0, or PC, so
2579 set up to skip this common case. All other cases where we want to
2580 suppress replacing something inside a SET_SRC are handled via the
2583 && (GET_CODE (SET_DEST (x)) == REG
2584 || GET_CODE (SET_DEST (x)) == CC0
2585 || GET_CODE (SET_DEST (x)) == PC))
2588 /* Get the mode of operand 0 in case X is now a SIGN_EXTEND of a constant. */
2590 op0_mode = GET_MODE (XEXP (x, 0));
2592 for (i = 0; i < len; i++)
2597 for (j = XVECLEN (x, i) - 1; j >= 0; j--)
2600 if (COMBINE_RTX_EQUAL_P (XVECEXP (x, i, j), from))
2602 new = (unique_copy && n_occurrences ? copy_rtx (to) : to);
2607 new = subst (XVECEXP (x, i, j), from, to, 0, unique_copy);
2609 /* If this substitution failed, this whole thing fails. */
2610 if (GET_CODE (new) == CLOBBER && XEXP (new, 0) == const0_rtx)
2614 SUBST (XVECEXP (x, i, j), new);
2617 else if (fmt[i] == 'e')
2621 if (COMBINE_RTX_EQUAL_P (XEXP (x, i), from))
2623 new = (unique_copy && n_occurrences ? copy_rtx (to) : to);
2627 /* If we are in a SET_DEST, suppress most cases unless we
2628 have gone inside a MEM, in which case we want to
2629 simplify the address. We assume here that things that
2630 are actually part of the destination have their inner
2631 parts in the first expression. This is true for SUBREG,
2632 STRICT_LOW_PART, and ZERO_EXTRACT, which are the only
2633 things aside from REG and MEM that should appear in a
2635 new = subst (XEXP (x, i), from, to,
2637 && (code == SUBREG || code == STRICT_LOW_PART
2638 || code == ZERO_EXTRACT))
2640 && i == 0), unique_copy);
2642 /* If we found that we will have to reject this combination,
2643 indicate that by returning the CLOBBER ourselves, rather than
2644 an expression containing it. This will speed things up as
2645 well as prevent accidents where two CLOBBERs are considered
2646 to be equal, thus producing an incorrect simplification. */
2648 if (GET_CODE (new) == CLOBBER && XEXP (new, 0) == const0_rtx)
2651 SUBST (XEXP (x, i), new);
2655 /* We come back to here if we have replaced the expression with one of
2656 a different code and it is likely that further simplification will be
2661 /* If we have restarted more than 4 times, we are probably looping, so
2663 if (++n_restarts > 4)
2666 /* If we are restarting at all, it means that we no longer know the
2667 original mode of operand 0 (since we have probably changed the
2671 op0_mode = VOIDmode;
2673 code = GET_CODE (x);
2675 /* If this is a commutative operation, put a constant last and a complex
2676 expression first. We don't need to do this for comparisons here. */
2677 if (GET_RTX_CLASS (code) == 'c'
2678 && ((CONSTANT_P (XEXP (x, 0)) && GET_CODE (XEXP (x, 1)) != CONST_INT)
2679 || (GET_RTX_CLASS (GET_CODE (XEXP (x, 0))) == 'o'
2680 && GET_RTX_CLASS (GET_CODE (XEXP (x, 1))) != 'o')
2681 || (GET_CODE (XEXP (x, 0)) == SUBREG
2682 && GET_RTX_CLASS (GET_CODE (SUBREG_REG (XEXP (x, 0)))) == 'o'
2683 && GET_RTX_CLASS (GET_CODE (XEXP (x, 1))) != 'o')))
2686 SUBST (XEXP (x, 0), XEXP (x, 1));
2687 SUBST (XEXP (x, 1), temp);
2690 /* If this is a PLUS, MINUS, or MULT, and the first operand is the
2691 sign extension of a PLUS with a constant, reverse the order of the sign
2692 extension and the addition. Note that this not the same as the original
2693 code, but overflow is undefined for signed values. Also note that the
2694 PLUS will have been partially moved "inside" the sign-extension, so that
2695 the first operand of X will really look like:
2696 (ashiftrt (plus (ashift A C4) C5) C4).
2698 (plus (ashiftrt (ashift A C4) C2) C4)
2699 and replace the first operand of X with that expression. Later parts
2700 of this function may simplify the expression further.
2702 For example, if we start with (mult (sign_extend (plus A C1)) C2),
2703 we swap the SIGN_EXTEND and PLUS. Later code will apply the
2704 distributive law to produce (plus (mult (sign_extend X) C1) C3).
2706 We do this to simplify address expressions. */
2708 if ((code == PLUS || code == MINUS || code == MULT)
2709 && GET_CODE (XEXP (x, 0)) == ASHIFTRT
2710 && GET_CODE (XEXP (XEXP (x, 0), 0)) == PLUS
2711 && GET_CODE (XEXP (XEXP (XEXP (x, 0), 0), 0)) == ASHIFT
2712 && GET_CODE (XEXP (XEXP (XEXP (XEXP (x, 0), 0), 0), 1)) == CONST_INT
2713 && GET_CODE (XEXP (XEXP (x, 0), 1)) == CONST_INT
2714 && XEXP (XEXP (XEXP (XEXP (x, 0), 0), 0), 1) == XEXP (XEXP (x, 0), 1)
2715 && GET_CODE (XEXP (XEXP (XEXP (x, 0), 0), 1)) == CONST_INT
2716 && (temp = simplify_binary_operation (ASHIFTRT, mode,
2717 XEXP (XEXP (XEXP (x, 0), 0), 1),
2718 XEXP (XEXP (x, 0), 1))) != 0)
2721 = simplify_shift_const (NULL_RTX, ASHIFT, mode,
2722 XEXP (XEXP (XEXP (XEXP (x, 0), 0), 0), 0),
2723 INTVAL (XEXP (XEXP (x, 0), 1)));
2725 new = simplify_shift_const (NULL_RTX, ASHIFTRT, mode, new,
2726 INTVAL (XEXP (XEXP (x, 0), 1)));
2728 SUBST (XEXP (x, 0), gen_binary (PLUS, mode, new, temp));
2731 /* If this is a simple operation applied to an IF_THEN_ELSE, try
2732 applying it to the arms of the IF_THEN_ELSE. This often simplifies
2733 things. Don't deal with operations that change modes here. */
2735 if ((GET_RTX_CLASS (code) == '2' || GET_RTX_CLASS (code) == 'c')
2736 && GET_CODE (XEXP (x, 0)) == IF_THEN_ELSE)
2738 /* Don't do this by using SUBST inside X since we might be messing
2739 up a shared expression. */
2740 rtx cond = XEXP (XEXP (x, 0), 0);
2741 rtx t_arm = subst (gen_binary (code, mode, XEXP (XEXP (x, 0), 1),
2743 pc_rtx, pc_rtx, 0, 0);
2744 rtx f_arm = subst (gen_binary (code, mode, XEXP (XEXP (x, 0), 2),
2746 pc_rtx, pc_rtx, 0, 0);
2749 x = gen_rtx (IF_THEN_ELSE, mode, cond, t_arm, f_arm);
2753 else if (GET_RTX_CLASS (code) == '1'
2754 && GET_CODE (XEXP (x, 0)) == IF_THEN_ELSE
2755 && GET_MODE (XEXP (x, 0)) == mode)
2757 rtx cond = XEXP (XEXP (x, 0), 0);
2758 rtx t_arm = subst (gen_unary (code, mode, XEXP (XEXP (x, 0), 1)),
2759 pc_rtx, pc_rtx, 0, 0);
2760 rtx f_arm = subst (gen_unary (code, mode, XEXP (XEXP (x, 0), 2)),
2761 pc_rtx, pc_rtx, 0, 0);
2763 x = gen_rtx_combine (IF_THEN_ELSE, mode, cond, t_arm, f_arm);
2767 /* Try to fold this expression in case we have constants that weren't
2770 switch (GET_RTX_CLASS (code))
2773 temp = simplify_unary_operation (code, mode, XEXP (x, 0), op0_mode);
2776 temp = simplify_relational_operation (code, op0_mode,
2777 XEXP (x, 0), XEXP (x, 1));
2778 #ifdef FLOAT_STORE_FLAG_VALUE
2779 if (temp != 0 && GET_MODE_CLASS (GET_MODE (x)) == MODE_FLOAT)
2780 temp = ((temp == const0_rtx) ? CONST0_RTX (GET_MODE (x))
2781 : immed_real_const_1 (FLOAT_STORE_FLAG_VALUE, GET_MODE (x)));
2786 temp = simplify_binary_operation (code, mode, XEXP (x, 0), XEXP (x, 1));
2790 temp = simplify_ternary_operation (code, mode, op0_mode, XEXP (x, 0),
2791 XEXP (x, 1), XEXP (x, 2));
2796 x = temp, code = GET_CODE (temp);
2798 /* First see if we can apply the inverse distributive law. */
2799 if (code == PLUS || code == MINUS || code == IOR || code == XOR)
2801 x = apply_distributive_law (x);
2802 code = GET_CODE (x);
2805 /* If CODE is an associative operation not otherwise handled, see if we
2806 can associate some operands. This can win if they are constants or
2807 if they are logically related (i.e. (a & b) & a. */
2808 if ((code == PLUS || code == MINUS
2809 || code == MULT || code == AND || code == IOR || code == XOR
2810 || code == DIV || code == UDIV
2811 || code == SMAX || code == SMIN || code == UMAX || code == UMIN)
2812 && GET_MODE_CLASS (mode) == MODE_INT)
2814 if (GET_CODE (XEXP (x, 0)) == code)
2816 rtx other = XEXP (XEXP (x, 0), 0);
2817 rtx inner_op0 = XEXP (XEXP (x, 0), 1);
2818 rtx inner_op1 = XEXP (x, 1);
2821 /* Make sure we pass the constant operand if any as the second
2822 one if this is a commutative operation. */
2823 if (CONSTANT_P (inner_op0) && GET_RTX_CLASS (code) == 'c')
2825 rtx tem = inner_op0;
2826 inner_op0 = inner_op1;
2829 inner = simplify_binary_operation (code == MINUS ? PLUS
2830 : code == DIV ? MULT
2831 : code == UDIV ? MULT
2833 mode, inner_op0, inner_op1);
2835 /* For commutative operations, try the other pair if that one
2837 if (inner == 0 && GET_RTX_CLASS (code) == 'c')
2839 other = XEXP (XEXP (x, 0), 1);
2840 inner = simplify_binary_operation (code, mode,
2841 XEXP (XEXP (x, 0), 0),
2847 x = gen_binary (code, mode, other, inner);
2854 /* A little bit of algebraic simplification here. */
2858 /* Ensure that our address has any ASHIFTs converted to MULT in case
2859 address-recognizing predicates are called later. */
2860 temp = make_compound_operation (XEXP (x, 0), MEM);
2861 SUBST (XEXP (x, 0), temp);
2865 /* (subreg:A (mem:B X) N) becomes a modified MEM unless the SUBREG
2866 is paradoxical. If we can't do that safely, then it becomes
2867 something nonsensical so that this combination won't take place. */
2869 if (GET_CODE (SUBREG_REG (x)) == MEM
2870 && (GET_MODE_SIZE (mode)
2871 <= GET_MODE_SIZE (GET_MODE (SUBREG_REG (x)))))
2873 rtx inner = SUBREG_REG (x);
2874 int endian_offset = 0;
2875 /* Don't change the mode of the MEM
2876 if that would change the meaning of the address. */
2877 if (MEM_VOLATILE_P (SUBREG_REG (x))
2878 || mode_dependent_address_p (XEXP (inner, 0)))
2879 return gen_rtx (CLOBBER, mode, const0_rtx);
2881 #if BYTES_BIG_ENDIAN
2882 if (GET_MODE_SIZE (mode) < UNITS_PER_WORD)
2883 endian_offset += UNITS_PER_WORD - GET_MODE_SIZE (mode);
2884 if (GET_MODE_SIZE (GET_MODE (inner)) < UNITS_PER_WORD)
2885 endian_offset -= UNITS_PER_WORD - GET_MODE_SIZE (GET_MODE (inner));
2887 /* Note if the plus_constant doesn't make a valid address
2888 then this combination won't be accepted. */
2889 x = gen_rtx (MEM, mode,
2890 plus_constant (XEXP (inner, 0),
2891 (SUBREG_WORD (x) * UNITS_PER_WORD
2893 MEM_VOLATILE_P (x) = MEM_VOLATILE_P (inner);
2894 RTX_UNCHANGING_P (x) = RTX_UNCHANGING_P (inner);
2895 MEM_IN_STRUCT_P (x) = MEM_IN_STRUCT_P (inner);
2899 /* If we are in a SET_DEST, these other cases can't apply. */
2903 /* Changing mode twice with SUBREG => just change it once,
2904 or not at all if changing back to starting mode. */
2905 if (GET_CODE (SUBREG_REG (x)) == SUBREG)
2907 if (mode == GET_MODE (SUBREG_REG (SUBREG_REG (x)))
2908 && SUBREG_WORD (x) == 0 && SUBREG_WORD (SUBREG_REG (x)) == 0)
2909 return SUBREG_REG (SUBREG_REG (x));
2911 SUBST_INT (SUBREG_WORD (x),
2912 SUBREG_WORD (x) + SUBREG_WORD (SUBREG_REG (x)));
2913 SUBST (SUBREG_REG (x), SUBREG_REG (SUBREG_REG (x)));
2916 /* SUBREG of a hard register => just change the register number
2917 and/or mode. If the hard register is not valid in that mode,
2918 suppress this combination. If the hard register is the stack,
2919 frame, or argument pointer, leave this as a SUBREG. */
2921 if (GET_CODE (SUBREG_REG (x)) == REG
2922 && REGNO (SUBREG_REG (x)) < FIRST_PSEUDO_REGISTER
2923 && REGNO (SUBREG_REG (x)) != FRAME_POINTER_REGNUM
2924 #if FRAME_POINTER_REGNUM != ARG_POINTER_REGNUM
2925 && REGNO (SUBREG_REG (x)) != ARG_POINTER_REGNUM
2927 && REGNO (SUBREG_REG (x)) != STACK_POINTER_REGNUM)
2929 if (HARD_REGNO_MODE_OK (REGNO (SUBREG_REG (x)) + SUBREG_WORD (x),
2931 return gen_rtx (REG, mode,
2932 REGNO (SUBREG_REG (x)) + SUBREG_WORD (x));
2934 return gen_rtx (CLOBBER, mode, const0_rtx);
2937 /* For a constant, try to pick up the part we want. Handle a full
2938 word and low-order part. Only do this if we are narrowing
2939 the constant; if it is being widened, we have no idea what
2940 the extra bits will have been set to. */
2942 if (CONSTANT_P (SUBREG_REG (x)) && op0_mode != VOIDmode
2943 && GET_MODE_SIZE (mode) == UNITS_PER_WORD
2944 && GET_MODE_SIZE (op0_mode) < UNITS_PER_WORD
2945 && GET_MODE_CLASS (mode) == MODE_INT)
2947 temp = operand_subword (SUBREG_REG (x), SUBREG_WORD (x),
2953 if (CONSTANT_P (SUBREG_REG (x)) && subreg_lowpart_p (x)
2954 && GET_MODE_SIZE (mode) < GET_MODE_SIZE (op0_mode))
2955 return gen_lowpart_for_combine (mode, SUBREG_REG (x));
2957 /* If we are narrowing the object, we need to see if we can simplify
2958 the expression for the object knowing that we only need the
2961 if (GET_MODE_SIZE (mode) < GET_MODE_SIZE (GET_MODE (SUBREG_REG (x)))
2962 && subreg_lowpart_p (x))
2963 return force_to_mode (SUBREG_REG (x), mode, GET_MODE_BITSIZE (mode),
2968 /* (not (plus X -1)) can become (neg X). */
2969 if (GET_CODE (XEXP (x, 0)) == PLUS
2970 && XEXP (XEXP (x, 0), 1) == constm1_rtx)
2972 x = gen_rtx_combine (NEG, mode, XEXP (XEXP (x, 0), 0));
2976 /* Similarly, (not (neg X)) is (plus X -1). */
2977 if (GET_CODE (XEXP (x, 0)) == NEG)
2979 x = gen_rtx_combine (PLUS, mode, XEXP (XEXP (x, 0), 0), constm1_rtx);
2983 /* (not (xor X C)) for C constant is (xor X D) with D = ~ C. */
2984 if (GET_CODE (XEXP (x, 0)) == XOR
2985 && GET_CODE (XEXP (XEXP (x, 0), 1)) == CONST_INT
2986 && (temp = simplify_unary_operation (NOT, mode,
2987 XEXP (XEXP (x, 0), 1),
2990 SUBST (XEXP (XEXP (x, 0), 1), temp);
2994 /* (not (ashift 1 X)) is (rotate ~1 X). We used to do this for operands
2995 other than 1, but that is not valid. We could do a similar
2996 simplification for (not (lshiftrt C X)) where C is just the sign bit,
2997 but this doesn't seem common enough to bother with. */
2998 if (GET_CODE (XEXP (x, 0)) == ASHIFT
2999 && XEXP (XEXP (x, 0), 0) == const1_rtx)
3001 x = gen_rtx (ROTATE, mode, gen_unary (NOT, mode, const1_rtx),
3002 XEXP (XEXP (x, 0), 1));
3006 if (GET_CODE (XEXP (x, 0)) == SUBREG
3007 && subreg_lowpart_p (XEXP (x, 0))
3008 && (GET_MODE_SIZE (GET_MODE (XEXP (x, 0)))
3009 < GET_MODE_SIZE (GET_MODE (SUBREG_REG (XEXP (x, 0)))))
3010 && GET_CODE (SUBREG_REG (XEXP (x, 0))) == ASHIFT
3011 && XEXP (SUBREG_REG (XEXP (x, 0)), 0) == const1_rtx)
3013 enum machine_mode inner_mode = GET_MODE (SUBREG_REG (XEXP (x, 0)));
3015 x = gen_rtx (ROTATE, inner_mode,
3016 gen_unary (NOT, inner_mode, const1_rtx),
3017 XEXP (SUBREG_REG (XEXP (x, 0)), 1));
3018 x = gen_lowpart_for_combine (mode, x);
3022 #if STORE_FLAG_VALUE == -1
3023 /* (not (comparison foo bar)) can be done by reversing the comparison
3025 if (GET_RTX_CLASS (GET_CODE (XEXP (x, 0))) == '<'
3026 && reversible_comparison_p (XEXP (x, 0)))
3027 return gen_rtx_combine (reverse_condition (GET_CODE (XEXP (x, 0))),
3028 mode, XEXP (XEXP (x, 0), 0),
3029 XEXP (XEXP (x, 0), 1));
3032 /* Apply De Morgan's laws to reduce number of patterns for machines
3033 with negating logical insns (and-not, nand, etc.). If result has
3034 only one NOT, put it first, since that is how the patterns are
3037 if (GET_CODE (XEXP (x, 0)) == IOR || GET_CODE (XEXP (x, 0)) == AND)
3039 rtx in1 = XEXP (XEXP (x, 0), 0), in2 = XEXP (XEXP (x, 0), 1);
3041 if (GET_CODE (in1) == NOT)
3042 in1 = XEXP (in1, 0);
3044 in1 = gen_rtx_combine (NOT, GET_MODE (in1), in1);
3046 if (GET_CODE (in2) == NOT)
3047 in2 = XEXP (in2, 0);
3048 else if (GET_CODE (in2) == CONST_INT
3049 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
3050 in2 = GEN_INT (GET_MODE_MASK (mode) & ~ INTVAL (in2));
3052 in2 = gen_rtx_combine (NOT, GET_MODE (in2), in2);
3054 if (GET_CODE (in2) == NOT)
3057 in2 = in1; in1 = tem;
3060 x = gen_rtx_combine (GET_CODE (XEXP (x, 0)) == IOR ? AND : IOR,
3067 /* (neg (plus X 1)) can become (not X). */
3068 if (GET_CODE (XEXP (x, 0)) == PLUS
3069 && XEXP (XEXP (x, 0), 1) == const1_rtx)
3071 x = gen_rtx_combine (NOT, mode, XEXP (XEXP (x, 0), 0));
3075 /* Similarly, (neg (not X)) is (plus X 1). */
3076 if (GET_CODE (XEXP (x, 0)) == NOT)
3078 x = gen_rtx_combine (PLUS, mode, XEXP (XEXP (x, 0), 0), const1_rtx);
3082 /* (neg (minus X Y)) can become (minus Y X). */
3083 if (GET_CODE (XEXP (x, 0)) == MINUS
3084 && (GET_MODE_CLASS (mode) != MODE_FLOAT
3085 /* x-y != -(y-x) with IEEE floating point. */
3086 || TARGET_FLOAT_FORMAT != IEEE_FLOAT_FORMAT))
3088 x = gen_binary (MINUS, mode, XEXP (XEXP (x, 0), 1),
3089 XEXP (XEXP (x, 0), 0));
3093 /* (neg (xor A 1)) is (plus A -1) if A is known to be either 0 or 1. */
3094 if (GET_CODE (XEXP (x, 0)) == XOR && XEXP (XEXP (x, 0), 1) == const1_rtx
3095 && significant_bits (XEXP (XEXP (x, 0), 0), mode) == 1)
3097 x = gen_binary (PLUS, mode, XEXP (XEXP (x, 0), 0), constm1_rtx);
3101 /* NEG commutes with ASHIFT since it is multiplication. Only do this
3102 if we can then eliminate the NEG (e.g.,
3103 if the operand is a constant). */
3105 if (GET_CODE (XEXP (x, 0)) == ASHIFT)
3107 temp = simplify_unary_operation (NEG, mode,
3108 XEXP (XEXP (x, 0), 0), mode);
3111 SUBST (XEXP (XEXP (x, 0), 0), temp);
3116 temp = expand_compound_operation (XEXP (x, 0));
3118 /* For C equal to the width of MODE minus 1, (neg (ashiftrt X C)) can be
3119 replaced by (lshiftrt X C). This will convert
3120 (neg (sign_extract X 1 Y)) to (zero_extract X 1 Y). */
3122 if (GET_CODE (temp) == ASHIFTRT
3123 && GET_CODE (XEXP (temp, 1)) == CONST_INT
3124 && INTVAL (XEXP (temp, 1)) == GET_MODE_BITSIZE (mode) - 1)
3126 x = simplify_shift_const (temp, LSHIFTRT, mode, XEXP (temp, 0),
3127 INTVAL (XEXP (temp, 1)));
3131 /* If X has only a single bit significant, say, bit I, convert
3132 (neg X) to (ashiftrt (ashift X C-I) C-I) where C is the bitsize of
3133 MODE minus 1. This will convert (neg (zero_extract X 1 Y)) to
3134 (sign_extract X 1 Y). But only do this if TEMP isn't a register
3135 or a SUBREG of one since we'd be making the expression more
3136 complex if it was just a register. */
3138 if (GET_CODE (temp) != REG
3139 && ! (GET_CODE (temp) == SUBREG
3140 && GET_CODE (SUBREG_REG (temp)) == REG)
3141 && (i = exact_log2 (significant_bits (temp, mode))) >= 0)
3143 rtx temp1 = simplify_shift_const
3144 (NULL_RTX, ASHIFTRT, mode,
3145 simplify_shift_const (NULL_RTX, ASHIFT, mode, temp,
3146 GET_MODE_BITSIZE (mode) - 1 - i),
3147 GET_MODE_BITSIZE (mode) - 1 - i);
3149 /* If all we did was surround TEMP with the two shifts, we
3150 haven't improved anything, so don't use it. Otherwise,
3151 we are better off with TEMP1. */
3152 if (GET_CODE (temp1) != ASHIFTRT
3153 || GET_CODE (XEXP (temp1, 0)) != ASHIFT
3154 || XEXP (XEXP (temp1, 0), 0) != temp)
3162 case FLOAT_TRUNCATE:
3163 /* (float_truncate:SF (float_extend:DF foo:SF)) = foo:SF. */
3164 if (GET_CODE (XEXP (x, 0)) == FLOAT_EXTEND
3165 && GET_MODE (XEXP (XEXP (x, 0), 0)) == mode)
3166 return XEXP (XEXP (x, 0), 0);
3171 /* Convert (compare FOO (const_int 0)) to FOO unless we aren't
3172 using cc0, in which case we want to leave it as a COMPARE
3173 so we can distinguish it from a register-register-copy. */
3174 if (XEXP (x, 1) == const0_rtx)
3177 /* In IEEE floating point, x-0 is not the same as x. */
3178 if ((TARGET_FLOAT_FORMAT != IEEE_FLOAT_FORMAT
3179 || GET_MODE_CLASS (GET_MODE (XEXP (x, 0))) == MODE_INT)
3180 && XEXP (x, 1) == CONST0_RTX (GET_MODE (XEXP (x, 0))))
3186 /* (const (const X)) can become (const X). Do it this way rather than
3187 returning the inner CONST since CONST can be shared with a
3189 if (GET_CODE (XEXP (x, 0)) == CONST)
3190 SUBST (XEXP (x, 0), XEXP (XEXP (x, 0), 0));
3195 /* Convert (lo_sum (high FOO) FOO) to FOO. This is necessary so we
3196 can add in an offset. find_split_point will split this address up
3197 again if it doesn't match. */
3198 if (GET_CODE (XEXP (x, 0)) == HIGH
3199 && rtx_equal_p (XEXP (XEXP (x, 0), 0), XEXP (x, 1)))
3205 /* If we have (plus (plus (A const) B)), associate it so that CONST is
3206 outermost. That's because that's the way indexed addresses are
3207 supposed to appear. This code used to check many more cases, but
3208 they are now checked elsewhere. */
3209 if (GET_CODE (XEXP (x, 0)) == PLUS
3210 && CONSTANT_ADDRESS_P (XEXP (XEXP (x, 0), 1)))
3211 return gen_binary (PLUS, mode,
3212 gen_binary (PLUS, mode, XEXP (XEXP (x, 0), 0),
3214 XEXP (XEXP (x, 0), 1));
3216 /* (plus (xor (and <foo> (const_int pow2 - 1)) <c>) <-c>)
3217 when c is (const_int (pow2 + 1) / 2) is a sign extension of a
3218 bit-field and can be replaced by either a sign_extend or a
3219 sign_extract. The `and' may be a zero_extend. */
3220 if (GET_CODE (XEXP (x, 0)) == XOR
3221 && GET_CODE (XEXP (x, 1)) == CONST_INT
3222 && GET_CODE (XEXP (XEXP (x, 0), 1)) == CONST_INT
3223 && INTVAL (XEXP (x, 1)) == - INTVAL (XEXP (XEXP (x, 0), 1))
3224 && (i = exact_log2 (INTVAL (XEXP (XEXP (x, 0), 1)))) >= 0
3225 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT
3226 && ((GET_CODE (XEXP (XEXP (x, 0), 0)) == AND
3227 && GET_CODE (XEXP (XEXP (XEXP (x, 0), 0), 1)) == CONST_INT
3228 && (INTVAL (XEXP (XEXP (XEXP (x, 0), 0), 1))
3229 == ((HOST_WIDE_INT) 1 << (i + 1)) - 1))
3230 || (GET_CODE (XEXP (XEXP (x, 0), 0)) == ZERO_EXTEND
3231 && (GET_MODE_BITSIZE (GET_MODE (XEXP (XEXP (XEXP (x, 0), 0), 0)))
3234 x = simplify_shift_const
3235 (NULL_RTX, ASHIFTRT, mode,
3236 simplify_shift_const (NULL_RTX, ASHIFT, mode,
3237 XEXP (XEXP (XEXP (x, 0), 0), 0),
3238 GET_MODE_BITSIZE (mode) - (i + 1)),
3239 GET_MODE_BITSIZE (mode) - (i + 1));
3243 /* If only the low-order bit of X is significant, (plus x -1)
3244 can become (ashiftrt (ashift (xor x 1) C) C) where C is
3245 the bitsize of the mode - 1. This allows simplification of
3246 "a = (b & 8) == 0;" */
3247 if (XEXP (x, 1) == constm1_rtx
3248 && GET_CODE (XEXP (x, 0)) != REG
3249 && ! (GET_CODE (XEXP (x,0)) == SUBREG
3250 && GET_CODE (SUBREG_REG (XEXP (x, 0))) == REG)
3251 && significant_bits (XEXP (x, 0), mode) == 1)
3253 x = simplify_shift_const
3254 (NULL_RTX, ASHIFTRT, mode,
3255 simplify_shift_const (NULL_RTX, ASHIFT, mode,
3256 gen_rtx_combine (XOR, mode,
3257 XEXP (x, 0), const1_rtx),
3258 GET_MODE_BITSIZE (mode) - 1),
3259 GET_MODE_BITSIZE (mode) - 1);
3263 /* If we are adding two things that have no bits in common, convert
3264 the addition into an IOR. This will often be further simplified,
3265 for example in cases like ((a & 1) + (a & 2)), which can
3268 if (GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT
3269 && (significant_bits (XEXP (x, 0), mode)
3270 & significant_bits (XEXP (x, 1), mode)) == 0)
3272 x = gen_binary (IOR, mode, XEXP (x, 0), XEXP (x, 1));
3278 /* (minus <foo> (and <foo> (const_int -pow2))) becomes
3279 (and <foo> (const_int pow2-1)) */
3280 if (GET_CODE (XEXP (x, 1)) == AND
3281 && GET_CODE (XEXP (XEXP (x, 1), 1)) == CONST_INT
3282 && exact_log2 (- INTVAL (XEXP (XEXP (x, 1), 1))) >= 0
3283 && rtx_equal_p (XEXP (XEXP (x, 1), 0), XEXP (x, 0)))
3285 x = simplify_and_const_int (NULL_RTX, mode, XEXP (x, 0),
3286 - INTVAL (XEXP (XEXP (x, 1), 1)) - 1);
3292 /* If we have (mult (plus A B) C), apply the distributive law and then
3293 the inverse distributive law to see if things simplify. This
3294 occurs mostly in addresses, often when unrolling loops. */
3296 if (GET_CODE (XEXP (x, 0)) == PLUS)
3298 x = apply_distributive_law
3299 (gen_binary (PLUS, mode,
3300 gen_binary (MULT, mode,
3301 XEXP (XEXP (x, 0), 0), XEXP (x, 1)),
3302 gen_binary (MULT, mode,
3303 XEXP (XEXP (x, 0), 1), XEXP (x, 1))));
3305 if (GET_CODE (x) != MULT)
3309 /* If this is multiplication by a power of two and its first operand is
3310 a shift, treat the multiply as a shift to allow the shifts to
3311 possibly combine. */
3312 if (GET_CODE (XEXP (x, 1)) == CONST_INT
3313 && (i = exact_log2 (INTVAL (XEXP (x, 1)))) >= 0
3314 && (GET_CODE (XEXP (x, 0)) == ASHIFT
3315 || GET_CODE (XEXP (x, 0)) == LSHIFTRT
3316 || GET_CODE (XEXP (x, 0)) == ASHIFTRT
3317 || GET_CODE (XEXP (x, 0)) == ROTATE
3318 || GET_CODE (XEXP (x, 0)) == ROTATERT))
3320 x = simplify_shift_const (NULL_RTX, ASHIFT, mode, XEXP (x, 0), i);
3324 /* Convert (mult (ashift (const_int 1) A) B) to (ashift B A). */
3325 if (GET_CODE (XEXP (x, 0)) == ASHIFT
3326 && XEXP (XEXP (x, 0), 0) == const1_rtx)
3327 return gen_rtx_combine (ASHIFT, mode, XEXP (x, 1),
3328 XEXP (XEXP (x, 0), 1));
3332 /* If this is a divide by a power of two, treat it as a shift if
3333 its first operand is a shift. */
3334 if (GET_CODE (XEXP (x, 1)) == CONST_INT
3335 && (i = exact_log2 (INTVAL (XEXP (x, 1)))) >= 0
3336 && (GET_CODE (XEXP (x, 0)) == ASHIFT
3337 || GET_CODE (XEXP (x, 0)) == LSHIFTRT
3338 || GET_CODE (XEXP (x, 0)) == ASHIFTRT
3339 || GET_CODE (XEXP (x, 0)) == ROTATE
3340 || GET_CODE (XEXP (x, 0)) == ROTATERT))
3342 x = simplify_shift_const (NULL_RTX, LSHIFTRT, mode, XEXP (x, 0), i);
3348 case GT: case GTU: case GE: case GEU:
3349 case LT: case LTU: case LE: case LEU:
3350 /* If the first operand is a condition code, we can't do anything
3352 if (GET_CODE (XEXP (x, 0)) == COMPARE
3353 || (GET_MODE_CLASS (GET_MODE (XEXP (x, 0))) != MODE_CC
3355 && XEXP (x, 0) != cc0_rtx
3359 rtx op0 = XEXP (x, 0);
3360 rtx op1 = XEXP (x, 1);
3361 enum rtx_code new_code;
3363 if (GET_CODE (op0) == COMPARE)
3364 op1 = XEXP (op0, 1), op0 = XEXP (op0, 0);
3366 /* Simplify our comparison, if possible. */
3367 new_code = simplify_comparison (code, &op0, &op1);
3369 #if STORE_FLAG_VALUE == 1
3370 /* If STORE_FLAG_VALUE is 1, we can convert (ne x 0) to simply X
3371 if only the low-order bit is significant in X (such as when
3372 X is a ZERO_EXTRACT of one bit. Similarly, we can convert
3373 EQ to (xor X 1). Remove any ZERO_EXTRACT we made when thinking
3374 this was a comparison. It may now be simpler to use, e.g., an
3375 AND. If a ZERO_EXTRACT is indeed appropriate, it will
3376 be placed back by the call to make_compound_operation in the
3378 if (new_code == NE && GET_MODE_CLASS (mode) == MODE_INT
3379 && op1 == const0_rtx
3380 && significant_bits (op0, GET_MODE (op0)) == 1)
3381 return gen_lowpart_for_combine (mode,
3382 expand_compound_operation (op0));
3383 else if (new_code == EQ && GET_MODE_CLASS (mode) == MODE_INT
3384 && op1 == const0_rtx
3385 && significant_bits (op0, GET_MODE (op0)) == 1)
3387 op0 = expand_compound_operation (op0);
3389 x = gen_rtx_combine (XOR, mode,
3390 gen_lowpart_for_combine (mode, op0),
3396 #if STORE_FLAG_VALUE == -1
3397 /* If STORE_FLAG_VALUE is -1, we can convert (ne x 0)
3398 to (neg x) if only the low-order bit of X is significant.
3399 This converts (ne (zero_extract X 1 Y) 0) to
3400 (sign_extract X 1 Y). */
3401 if (new_code == NE && GET_MODE_CLASS (mode) == MODE_INT
3402 && op1 == const0_rtx
3403 && significant_bits (op0, GET_MODE (op0)) == 1)
3405 op0 = expand_compound_operation (op0);
3406 x = gen_rtx_combine (NEG, mode,
3407 gen_lowpart_for_combine (mode, op0));
3412 /* If STORE_FLAG_VALUE says to just test the sign bit and X has just
3413 one significant bit, we can convert (ne x 0) to (ashift x c)
3414 where C puts the bit in the sign bit. Remove any AND with
3415 STORE_FLAG_VALUE when we are done, since we are only going to
3416 test the sign bit. */
3417 if (new_code == NE && GET_MODE_CLASS (mode) == MODE_INT
3418 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT
3419 && (STORE_FLAG_VALUE
3420 == (HOST_WIDE_INT) 1 << (GET_MODE_BITSIZE (mode) - 1))
3421 && op1 == const0_rtx
3422 && mode == GET_MODE (op0)
3423 && (i = exact_log2 (significant_bits (op0, GET_MODE (op0)))) >= 0)
3425 x = simplify_shift_const (NULL_RTX, ASHIFT, mode,
3426 expand_compound_operation (op0),
3427 GET_MODE_BITSIZE (mode) - 1 - i);
3428 if (GET_CODE (x) == AND && XEXP (x, 1) == const_true_rtx)
3434 /* If the code changed, return a whole new comparison. */
3435 if (new_code != code)
3436 return gen_rtx_combine (new_code, mode, op0, op1);
3438 /* Otherwise, keep this operation, but maybe change its operands.
3439 This also converts (ne (compare FOO BAR) 0) to (ne FOO BAR). */
3440 SUBST (XEXP (x, 0), op0);
3441 SUBST (XEXP (x, 1), op1);
3446 /* Sometimes we can simplify the arm of an IF_THEN_ELSE if a register
3447 used in it is being compared against certain values. Get the
3448 true and false comparisons and see if that says anything about the
3449 value of each arm. */
3451 if (GET_RTX_CLASS (GET_CODE (XEXP (x, 0))) == '<'
3452 && reversible_comparison_p (XEXP (x, 0))
3453 && GET_CODE (XEXP (XEXP (x, 0), 0)) == REG)
3456 rtx from = XEXP (XEXP (x, 0), 0);
3457 enum rtx_code true_code = GET_CODE (XEXP (x, 0));
3458 enum rtx_code false_code = reverse_condition (true_code);
3459 rtx true_val = XEXP (XEXP (x, 0), 1);
3460 rtx false_val = true_val;
3461 rtx true_arm = XEXP (x, 1);
3462 rtx false_arm = XEXP (x, 2);
3465 /* If FALSE_CODE is EQ, swap the codes and arms. */
3467 if (false_code == EQ)
3469 swapped = 1, true_code = EQ, false_code = NE;
3470 true_arm = XEXP (x, 2), false_arm = XEXP (x, 1);
3473 /* If we are comparing against zero and the expression being tested
3474 has only a single significant bit, that is its value when it is
3475 not equal to zero. Similarly if it is known to be -1 or 0. */
3477 if (true_code == EQ && true_val == const0_rtx
3478 && exact_log2 (sig = significant_bits (from,
3479 GET_MODE (from))) >= 0)
3480 false_code = EQ, false_val = GEN_INT (sig);
3481 else if (true_code == EQ && true_val == const0_rtx
3482 && (num_sign_bit_copies (from, GET_MODE (from))
3483 == GET_MODE_BITSIZE (GET_MODE (from))))
3484 false_code = EQ, false_val = constm1_rtx;
3486 /* Now simplify an arm if we know the value of the register
3487 in the branch and it is used in the arm. Be carefull due to
3488 the potential of locally-shared RTL. */
3490 if (reg_mentioned_p (from, true_arm))
3491 true_arm = subst (known_cond (copy_rtx (true_arm), true_code,
3493 pc_rtx, pc_rtx, 0, 0);
3494 if (reg_mentioned_p (from, false_arm))
3495 false_arm = subst (known_cond (copy_rtx (false_arm), false_code,
3497 pc_rtx, pc_rtx, 0, 0);
3499 SUBST (XEXP (x, 1), swapped ? false_arm : true_arm);
3500 SUBST (XEXP (x, 2), swapped ? true_arm : false_arm);
3503 /* If we have (if_then_else FOO (pc) (label_ref BAR)) and FOO can be
3504 reversed, do so to avoid needing two sets of patterns for
3505 subtract-and-branch insns. Similarly if we have a constant in that
3506 position or if the third operand is the same as the first operand
3507 of the comparison. */
3509 if (GET_RTX_CLASS (GET_CODE (XEXP (x, 0))) == '<'
3510 && reversible_comparison_p (XEXP (x, 0))
3511 && (XEXP (x, 1) == pc_rtx || GET_CODE (XEXP (x, 1)) == CONST_INT
3512 || rtx_equal_p (XEXP (x, 2), XEXP (XEXP (x, 0), 0))))
3515 gen_binary (reverse_condition (GET_CODE (XEXP (x, 0))),
3516 GET_MODE (XEXP (x, 0)),
3517 XEXP (XEXP (x, 0), 0), XEXP (XEXP (x, 0), 1)));
3520 SUBST (XEXP (x, 1), XEXP (x, 2));
3521 SUBST (XEXP (x, 2), temp);
3524 /* If the two arms are identical, we don't need the comparison. */
3526 if (rtx_equal_p (XEXP (x, 1), XEXP (x, 2))
3527 && ! side_effects_p (XEXP (x, 0)))
3530 /* Look for cases where we have (abs x) or (neg (abs X)). */
3532 if (GET_MODE_CLASS (mode) == MODE_INT
3533 && GET_CODE (XEXP (x, 2)) == NEG
3534 && rtx_equal_p (XEXP (x, 1), XEXP (XEXP (x, 2), 0))
3535 && GET_RTX_CLASS (GET_CODE (XEXP (x, 0))) == '<'
3536 && rtx_equal_p (XEXP (x, 1), XEXP (XEXP (x, 0), 0))
3537 && ! side_effects_p (XEXP (x, 1)))
3538 switch (GET_CODE (XEXP (x, 0)))
3542 x = gen_unary (ABS, mode, XEXP (x, 1));
3546 x = gen_unary (NEG, mode, gen_unary (ABS, mode, XEXP (x, 1)));
3550 /* Look for MIN or MAX. */
3552 if (GET_MODE_CLASS (mode) == MODE_INT
3553 && GET_RTX_CLASS (GET_CODE (XEXP (x, 0))) == '<'
3554 && rtx_equal_p (XEXP (XEXP (x, 0), 0), XEXP (x, 1))
3555 && rtx_equal_p (XEXP (XEXP (x, 0), 1), XEXP (x, 2))
3556 && ! side_effects_p (XEXP (x, 0)))
3557 switch (GET_CODE (XEXP (x, 0)))
3561 x = gen_binary (SMAX, mode, XEXP (x, 1), XEXP (x, 2));
3565 x = gen_binary (SMIN, mode, XEXP (x, 1), XEXP (x, 2));
3569 x = gen_binary (UMAX, mode, XEXP (x, 1), XEXP (x, 2));
3573 x = gen_binary (UMIN, mode, XEXP (x, 1), XEXP (x, 2));
3577 /* If we have something like (if_then_else (ne A 0) (OP X C) X),
3578 A is known to be either 0 or 1, and OP is an identity when its
3579 second operand is zero, this can be done as (OP X (mult A C)).
3580 Similarly if A is known to be 0 or -1 and also similarly if we have
3581 a ZERO_EXTEND or SIGN_EXTEND as long as X is already extended (so
3582 we don't destroy it). */
3584 if (mode != VOIDmode
3585 && (GET_CODE (XEXP (x, 0)) == EQ || GET_CODE (XEXP (x, 0)) == NE)
3586 && XEXP (XEXP (x, 0), 1) == const0_rtx
3587 && (significant_bits (XEXP (XEXP (x, 0), 0), mode) == 1
3588 || (num_sign_bit_copies (XEXP (XEXP (x, 0), 0), mode)
3589 == GET_MODE_BITSIZE (mode))))
3591 rtx nz = make_compound_operation (GET_CODE (XEXP (x, 0)) == NE
3592 ? XEXP (x, 1) : XEXP (x, 2));
3593 rtx z = GET_CODE (XEXP (x, 0)) == NE ? XEXP (x, 2) : XEXP (x, 1);
3594 rtx dir = (significant_bits (XEXP (XEXP (x, 0), 0), mode) == 1
3595 ? const1_rtx : constm1_rtx);
3597 enum machine_mode m = mode;
3598 enum rtx_code op, extend_op = 0;
3600 if ((GET_CODE (nz) == PLUS || GET_CODE (nz) == MINUS
3601 || GET_CODE (nz) == IOR || GET_CODE (nz) == XOR
3602 || GET_CODE (nz) == ASHIFT
3603 || GET_CODE (nz) == LSHIFTRT || GET_CODE (nz) == ASHIFTRT)
3604 && rtx_equal_p (XEXP (nz, 0), z))
3605 c = XEXP (nz, 1), op = GET_CODE (nz);
3606 else if (GET_CODE (nz) == SIGN_EXTEND
3607 && (GET_CODE (XEXP (nz, 0)) == PLUS
3608 || GET_CODE (XEXP (nz, 0)) == MINUS
3609 || GET_CODE (XEXP (nz, 0)) == IOR
3610 || GET_CODE (XEXP (nz, 0)) == XOR
3611 || GET_CODE (XEXP (nz, 0)) == ASHIFT
3612 || GET_CODE (XEXP (nz, 0)) == LSHIFTRT
3613 || GET_CODE (XEXP (nz, 0)) == ASHIFTRT)
3614 && GET_CODE (XEXP (XEXP (nz, 0), 0)) == SUBREG
3615 && subreg_lowpart_p (XEXP (XEXP (nz, 0), 0))
3616 && rtx_equal_p (SUBREG_REG (XEXP (XEXP (nz, 0), 0)), z)
3617 && (num_sign_bit_copies (z, GET_MODE (z))
3618 >= (GET_MODE_BITSIZE (mode)
3619 - GET_MODE_BITSIZE (GET_MODE (XEXP (XEXP (nz, 0), 0))))))
3621 c = XEXP (XEXP (nz, 0), 1);
3622 op = GET_CODE (XEXP (nz, 0));
3623 extend_op = SIGN_EXTEND;
3624 m = GET_MODE (XEXP (nz, 0));
3626 else if (GET_CODE (nz) == ZERO_EXTEND
3627 && (GET_CODE (XEXP (nz, 0)) == PLUS
3628 || GET_CODE (XEXP (nz, 0)) == MINUS
3629 || GET_CODE (XEXP (nz, 0)) == IOR
3630 || GET_CODE (XEXP (nz, 0)) == XOR
3631 || GET_CODE (XEXP (nz, 0)) == ASHIFT
3632 || GET_CODE (XEXP (nz, 0)) == LSHIFTRT
3633 || GET_CODE (XEXP (nz, 0)) == ASHIFTRT)
3634 && GET_CODE (XEXP (XEXP (nz, 0), 0)) == SUBREG
3635 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT
3636 && subreg_lowpart_p (XEXP (XEXP (nz, 0), 0))
3637 && rtx_equal_p (SUBREG_REG (XEXP (XEXP (nz, 0), 0)), z)
3638 && ((significant_bits (z, GET_MODE (z))
3639 & ~ GET_MODE_MASK (GET_MODE (XEXP (XEXP (nz, 0), 0))))
3642 c = XEXP (XEXP (nz, 0), 1);
3643 op = GET_CODE (XEXP (nz, 0));
3644 extend_op = ZERO_EXTEND;
3645 m = GET_MODE (XEXP (nz, 0));
3648 if (c && ! side_effects_p (c) && ! side_effects_p (z))
3651 = gen_binary (MULT, m,
3652 gen_lowpart_for_combine (m,
3653 XEXP (XEXP (x, 0), 0)),
3654 gen_binary (MULT, m, c, dir));
3656 temp = gen_binary (op, m, gen_lowpart_for_combine (m, z), temp);
3659 temp = gen_unary (extend_op, mode, temp);
3670 /* If we are processing SET_DEST, we are done. */
3674 x = expand_compound_operation (x);
3675 if (GET_CODE (x) != code)
3680 /* (set (pc) (return)) gets written as (return). */
3681 if (GET_CODE (SET_DEST (x)) == PC && GET_CODE (SET_SRC (x)) == RETURN)
3684 /* Convert this into a field assignment operation, if possible. */
3685 x = make_field_assignment (x);
3687 /* If we are setting CC0 or if the source is a COMPARE, look for the
3688 use of the comparison result and try to simplify it unless we already
3689 have used undobuf.other_insn. */
3690 if ((GET_CODE (SET_SRC (x)) == COMPARE
3692 || SET_DEST (x) == cc0_rtx
3695 && (cc_use = find_single_use (SET_DEST (x), subst_insn,
3697 && (undobuf.other_insn == 0 || other_insn == undobuf.other_insn)
3698 && GET_RTX_CLASS (GET_CODE (*cc_use)) == '<'
3699 && XEXP (*cc_use, 0) == SET_DEST (x))
3701 enum rtx_code old_code = GET_CODE (*cc_use);
3702 enum rtx_code new_code;
3704 int other_changed = 0;
3705 enum machine_mode compare_mode = GET_MODE (SET_DEST (x));
3707 if (GET_CODE (SET_SRC (x)) == COMPARE)
3708 op0 = XEXP (SET_SRC (x), 0), op1 = XEXP (SET_SRC (x), 1);
3710 op0 = SET_SRC (x), op1 = const0_rtx;
3712 /* Simplify our comparison, if possible. */
3713 new_code = simplify_comparison (old_code, &op0, &op1);
3715 #if !defined (HAVE_cc0) && defined (EXTRA_CC_MODES)
3716 /* If this machine has CC modes other than CCmode, check to see
3717 if we need to use a different CC mode here. */
3718 compare_mode = SELECT_CC_MODE (new_code, op0, op1);
3720 /* If the mode changed, we have to change SET_DEST, the mode
3721 in the compare, and the mode in the place SET_DEST is used.
3722 If SET_DEST is a hard register, just build new versions with
3723 the proper mode. If it is a pseudo, we lose unless it is only
3724 time we set the pseudo, in which case we can safely change
3726 if (compare_mode != GET_MODE (SET_DEST (x)))
3728 int regno = REGNO (SET_DEST (x));
3729 rtx new_dest = gen_rtx (REG, compare_mode, regno);
3731 if (regno < FIRST_PSEUDO_REGISTER
3732 || (reg_n_sets[regno] == 1
3733 && ! REG_USERVAR_P (SET_DEST (x))))
3735 if (regno >= FIRST_PSEUDO_REGISTER)
3736 SUBST (regno_reg_rtx[regno], new_dest);
3738 SUBST (SET_DEST (x), new_dest);
3739 SUBST (XEXP (*cc_use, 0), new_dest);
3745 /* If the code changed, we have to build a new comparison
3746 in undobuf.other_insn. */
3747 if (new_code != old_code)
3751 SUBST (*cc_use, gen_rtx_combine (new_code, GET_MODE (*cc_use),
3752 SET_DEST (x), const0_rtx));
3754 /* If the only change we made was to change an EQ into an
3755 NE or vice versa, OP0 has only one significant bit,
3756 and OP1 is zero, check if changing the user of the condition
3757 code will produce a valid insn. If it won't, we can keep
3758 the original code in that insn by surrounding our operation
3761 if (((old_code == NE && new_code == EQ)
3762 || (old_code == EQ && new_code == NE))
3763 && ! other_changed && op1 == const0_rtx
3764 && (GET_MODE_BITSIZE (GET_MODE (op0))
3765 <= HOST_BITS_PER_WIDE_INT)
3766 && (exact_log2 (mask = significant_bits (op0,
3770 rtx pat = PATTERN (other_insn), note = 0;
3772 if ((recog_for_combine (&pat, other_insn, ¬e) < 0
3773 && ! check_asm_operands (pat)))
3775 PUT_CODE (*cc_use, old_code);
3778 op0 = gen_binary (XOR, GET_MODE (op0), op0,
3787 undobuf.other_insn = other_insn;
3790 /* If we are now comparing against zero, change our source if
3791 needed. If we do not use cc0, we always have a COMPARE. */
3792 if (op1 == const0_rtx && SET_DEST (x) == cc0_rtx)
3793 SUBST (SET_SRC (x), op0);
3797 /* Otherwise, if we didn't previously have a COMPARE in the
3798 correct mode, we need one. */
3799 if (GET_CODE (SET_SRC (x)) != COMPARE
3800 || GET_MODE (SET_SRC (x)) != compare_mode)
3801 SUBST (SET_SRC (x), gen_rtx_combine (COMPARE, compare_mode,
3805 /* Otherwise, update the COMPARE if needed. */
3806 SUBST (XEXP (SET_SRC (x), 0), op0);
3807 SUBST (XEXP (SET_SRC (x), 1), op1);
3812 /* Get SET_SRC in a form where we have placed back any
3813 compound expressions. Then do the checks below. */
3814 temp = make_compound_operation (SET_SRC (x), SET);
3815 SUBST (SET_SRC (x), temp);
3818 /* If we have (set x (subreg:m1 (op:m2 ...) 0)) with OP being some
3819 operation, and X being a REG or (subreg (reg)), we may be able to
3820 convert this to (set (subreg:m2 x) (op)).
3822 We can always do this if M1 is narrower than M2 because that
3823 means that we only care about the low bits of the result.
3825 However, on most machines (those with BYTE_LOADS_ZERO_EXTEND
3826 and BYTES_LOADS_SIGN_EXTEND not defined), we cannot perform a
3827 narrower operation that requested since the high-order bits will
3828 be undefined. On machine where BYTE_LOADS_*_EXTEND is defined,
3829 however, this transformation is safe as long as M1 and M2 have
3830 the same number of words. */
3832 if (GET_CODE (SET_SRC (x)) == SUBREG
3833 && subreg_lowpart_p (SET_SRC (x))
3834 && GET_RTX_CLASS (GET_CODE (SUBREG_REG (SET_SRC (x)))) != 'o'
3835 && (((GET_MODE_SIZE (GET_MODE (SET_SRC (x))) + (UNITS_PER_WORD - 1))
3837 == ((GET_MODE_SIZE (GET_MODE (SUBREG_REG (SET_SRC (x))))
3838 + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD))
3839 #if ! defined(BYTE_LOADS_ZERO_EXTEND) && ! defined (BYTE_LOADS_SIGN_EXTEND)
3840 && (GET_MODE_SIZE (GET_MODE (SET_SRC (x)))
3841 < GET_MODE_SIZE (GET_MODE (SUBREG_REG (SET_SRC (x)))))
3843 && (GET_CODE (SET_DEST (x)) == REG
3844 || (GET_CODE (SET_DEST (x)) == SUBREG
3845 && GET_CODE (SUBREG_REG (SET_DEST (x))) == REG)))
3847 SUBST (SET_DEST (x),
3848 gen_lowpart_for_combine (GET_MODE (SUBREG_REG (SET_SRC (x))),
3850 SUBST (SET_SRC (x), SUBREG_REG (SET_SRC (x)));
3853 #ifdef BYTE_LOADS_ZERO_EXTEND
3854 /* If we have (set FOO (subreg:M (mem:N BAR) 0)) with
3855 M wider than N, this would require a paradoxical subreg.
3856 Replace the subreg with a zero_extend to avoid the reload that
3857 would otherwise be required. */
3858 if (GET_CODE (SET_SRC (x)) == SUBREG
3859 && subreg_lowpart_p (SET_SRC (x))
3860 && SUBREG_WORD (SET_SRC (x)) == 0
3861 && (GET_MODE_SIZE (GET_MODE (SET_SRC (x)))
3862 > GET_MODE_SIZE (GET_MODE (SUBREG_REG (SET_SRC (x)))))
3863 && GET_CODE (SUBREG_REG (SET_SRC (x))) == MEM)
3864 SUBST (SET_SRC (x), gen_rtx_combine (ZERO_EXTEND,
3865 GET_MODE (SET_SRC (x)),
3866 XEXP (SET_SRC (x), 0)));
3869 #ifndef HAVE_conditional_move
3871 /* If we don't have a conditional move, SET_SRC is an IF_THEN_ELSE,
3872 and we are comparing an item known to be 0 or -1 against 0, use a
3873 logical operation instead. Check for one of the arms being an IOR
3874 of the other arm with some value. We compute three terms to be
3875 IOR'ed together. In practice, at most two will be nonzero. Then
3878 if (GET_CODE (SET_DEST (x)) != PC
3879 && GET_CODE (SET_SRC (x)) == IF_THEN_ELSE
3880 && (GET_CODE (XEXP (SET_SRC (x), 0)) == EQ
3881 || GET_CODE (XEXP (SET_SRC (x), 0)) == NE)
3882 && XEXP (XEXP (SET_SRC (x), 0), 1) == const0_rtx
3883 && (num_sign_bit_copies (XEXP (XEXP (SET_SRC (x), 0), 0),
3884 GET_MODE (XEXP (XEXP (SET_SRC (x), 0), 0)))
3885 == GET_MODE_BITSIZE (GET_MODE (XEXP (XEXP (SET_SRC (x), 0), 0))))
3886 && ! side_effects_p (SET_SRC (x)))
3888 rtx true = (GET_CODE (XEXP (SET_SRC (x), 0)) == NE
3889 ? XEXP (SET_SRC (x), 1) : XEXP (SET_SRC (x), 2));
3890 rtx false = (GET_CODE (XEXP (SET_SRC (x), 0)) == NE
3891 ? XEXP (SET_SRC (x), 2) : XEXP (SET_SRC (x), 1));
3892 rtx term1 = const0_rtx, term2, term3;
3894 if (GET_CODE (true) == IOR && rtx_equal_p (XEXP (true, 0), false))
3895 term1 = false, true = XEXP (true, 1), false = const0_rtx;
3896 else if (GET_CODE (true) == IOR
3897 && rtx_equal_p (XEXP (true, 1), false))
3898 term1 = false, true = XEXP (true, 0), false = const0_rtx;
3899 else if (GET_CODE (false) == IOR
3900 && rtx_equal_p (XEXP (false, 0), true))
3901 term1 = true, false = XEXP (false, 1), true = const0_rtx;
3902 else if (GET_CODE (false) == IOR
3903 && rtx_equal_p (XEXP (false, 1), true))
3904 term1 = true, false = XEXP (false, 0), true = const0_rtx;
3906 term2 = gen_binary (AND, GET_MODE (SET_SRC (x)),
3907 XEXP (XEXP (SET_SRC (x), 0), 0), true);
3908 term3 = gen_binary (AND, GET_MODE (SET_SRC (x)),
3909 gen_unary (NOT, GET_MODE (SET_SRC (x)),
3910 XEXP (XEXP (SET_SRC (x), 0), 0)),
3914 gen_binary (IOR, GET_MODE (SET_SRC (x)),
3915 gen_binary (IOR, GET_MODE (SET_SRC (x)),
3923 if (GET_CODE (XEXP (x, 1)) == CONST_INT)
3925 x = simplify_and_const_int (x, mode, XEXP (x, 0),
3926 INTVAL (XEXP (x, 1)));
3928 /* If we have (ior (and (X C1) C2)) and the next restart would be
3929 the last, simplify this by making C1 as small as possible
3931 if (n_restarts >= 3 && GET_CODE (x) == IOR
3932 && GET_CODE (XEXP (x, 0)) == AND
3933 && GET_CODE (XEXP (XEXP (x, 0), 1)) == CONST_INT
3934 && GET_CODE (XEXP (x, 1)) == CONST_INT)
3936 temp = gen_binary (AND, mode, XEXP (XEXP (x, 0), 0),
3937 GEN_INT (INTVAL (XEXP (XEXP (x, 0), 1))
3938 & ~ INTVAL (XEXP (x, 1))));
3939 return gen_binary (IOR, mode, temp, XEXP (x, 1));
3942 if (GET_CODE (x) != AND)
3946 /* Convert (A | B) & A to A. */
3947 if (GET_CODE (XEXP (x, 0)) == IOR
3948 && (rtx_equal_p (XEXP (XEXP (x, 0), 0), XEXP (x, 1))
3949 || rtx_equal_p (XEXP (XEXP (x, 0), 1), XEXP (x, 1)))
3950 && ! side_effects_p (XEXP (XEXP (x, 0), 0))
3951 && ! side_effects_p (XEXP (XEXP (x, 0), 1)))
3954 /* Convert (A ^ B) & A to A & (~ B) since the latter is often a single
3955 insn (and may simplify more). */
3956 else if (GET_CODE (XEXP (x, 0)) == XOR
3957 && rtx_equal_p (XEXP (XEXP (x, 0), 0), XEXP (x, 1))
3958 && ! side_effects_p (XEXP (x, 1)))
3960 x = gen_binary (AND, mode,
3961 gen_unary (NOT, mode, XEXP (XEXP (x, 0), 1)),
3965 else if (GET_CODE (XEXP (x, 0)) == XOR
3966 && rtx_equal_p (XEXP (XEXP (x, 0), 1), XEXP (x, 1))
3967 && ! side_effects_p (XEXP (x, 1)))
3969 x = gen_binary (AND, mode,
3970 gen_unary (NOT, mode, XEXP (XEXP (x, 0), 0)),
3975 /* Similarly for (~ (A ^ B)) & A. */
3976 else if (GET_CODE (XEXP (x, 0)) == NOT
3977 && GET_CODE (XEXP (XEXP (x, 0), 0)) == XOR
3978 && rtx_equal_p (XEXP (XEXP (XEXP (x, 0), 0), 0), XEXP (x, 1))
3979 && ! side_effects_p (XEXP (x, 1)))
3981 x = gen_binary (AND, mode, XEXP (XEXP (XEXP (x, 0), 0), 1),
3985 else if (GET_CODE (XEXP (x, 0)) == NOT
3986 && GET_CODE (XEXP (XEXP (x, 0), 0)) == XOR
3987 && rtx_equal_p (XEXP (XEXP (XEXP (x, 0), 0), 1), XEXP (x, 1))
3988 && ! side_effects_p (XEXP (x, 1)))
3990 x = gen_binary (AND, mode, XEXP (XEXP (XEXP (x, 0), 0), 0),
3995 /* If we have (and A B) with A not an object but that is known to
3996 be -1 or 0, this is equivalent to the expression
3997 (if_then_else (ne A (const_int 0)) B (const_int 0))
3998 We make this conversion because it may allow further
3999 simplifications and then allow use of conditional move insns.
4000 If the machine doesn't have condition moves, code in case SET
4001 will convert the IF_THEN_ELSE back to the logical operation.
4002 We build the IF_THEN_ELSE here in case further simplification
4003 is possible (e.g., we can convert it to ABS). */
4005 if (GET_RTX_CLASS (GET_CODE (XEXP (x, 0))) != 'o'
4006 && ! (GET_CODE (XEXP (x, 0)) == SUBREG
4007 && GET_RTX_CLASS (GET_CODE (SUBREG_REG (XEXP (x, 0)))) == 'o')
4008 && (num_sign_bit_copies (XEXP (x, 0), GET_MODE (XEXP (x, 0)))
4009 == GET_MODE_BITSIZE (GET_MODE (XEXP (x, 0)))))
4011 rtx op0 = XEXP (x, 0);
4012 rtx op1 = const0_rtx;
4013 enum rtx_code comp_code
4014 = simplify_comparison (NE, &op0, &op1);
4016 x = gen_rtx_combine (IF_THEN_ELSE, mode,
4017 gen_binary (comp_code, VOIDmode, op0, op1),
4018 XEXP (x, 1), const0_rtx);
4022 /* In the following group of tests (and those in case IOR below),
4023 we start with some combination of logical operations and apply
4024 the distributive law followed by the inverse distributive law.
4025 Most of the time, this results in no change. However, if some of
4026 the operands are the same or inverses of each other, simplifications
4029 For example, (and (ior A B) (not B)) can occur as the result of
4030 expanding a bit field assignment. When we apply the distributive
4031 law to this, we get (ior (and (A (not B))) (and (B (not B)))),
4032 which then simplifies to (and (A (not B))). */
4034 /* If we have (and (ior A B) C), apply the distributive law and then
4035 the inverse distributive law to see if things simplify. */
4037 if (GET_CODE (XEXP (x, 0)) == IOR || GET_CODE (XEXP (x, 0)) == XOR)
4039 x = apply_distributive_law
4040 (gen_binary (GET_CODE (XEXP (x, 0)), mode,
4041 gen_binary (AND, mode,
4042 XEXP (XEXP (x, 0), 0), XEXP (x, 1)),
4043 gen_binary (AND, mode,
4044 XEXP (XEXP (x, 0), 1), XEXP (x, 1))));
4045 if (GET_CODE (x) != AND)
4049 if (GET_CODE (XEXP (x, 1)) == IOR || GET_CODE (XEXP (x, 1)) == XOR)
4051 x = apply_distributive_law
4052 (gen_binary (GET_CODE (XEXP (x, 1)), mode,
4053 gen_binary (AND, mode,
4054 XEXP (XEXP (x, 1), 0), XEXP (x, 0)),
4055 gen_binary (AND, mode,
4056 XEXP (XEXP (x, 1), 1), XEXP (x, 0))));
4057 if (GET_CODE (x) != AND)
4061 /* Similarly, taking advantage of the fact that
4062 (and (not A) (xor B C)) == (xor (ior A B) (ior A C)) */
4064 if (GET_CODE (XEXP (x, 0)) == NOT && GET_CODE (XEXP (x, 1)) == XOR)
4066 x = apply_distributive_law
4067 (gen_binary (XOR, mode,
4068 gen_binary (IOR, mode, XEXP (XEXP (x, 0), 0),
4069 XEXP (XEXP (x, 1), 0)),
4070 gen_binary (IOR, mode, XEXP (XEXP (x, 0), 0),
4071 XEXP (XEXP (x, 1), 1))));
4072 if (GET_CODE (x) != AND)
4076 else if (GET_CODE (XEXP (x, 1)) == NOT && GET_CODE (XEXP (x, 0)) == XOR)
4078 x = apply_distributive_law
4079 (gen_binary (XOR, mode,
4080 gen_binary (IOR, mode, XEXP (XEXP (x, 1), 0),
4081 XEXP (XEXP (x, 0), 0)),
4082 gen_binary (IOR, mode, XEXP (XEXP (x, 1), 0),
4083 XEXP (XEXP (x, 0), 1))));
4084 if (GET_CODE (x) != AND)
4090 /* (ior A C) is C if all significant bits of A are on in C. */
4091 if (GET_CODE (XEXP (x, 1)) == CONST_INT
4092 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT
4093 && (significant_bits (XEXP (x, 0), mode)
4094 & ~ INTVAL (XEXP (x, 1))) == 0)
4097 /* Convert (A & B) | A to A. */
4098 if (GET_CODE (XEXP (x, 0)) == AND
4099 && (rtx_equal_p (XEXP (XEXP (x, 0), 0), XEXP (x, 1))
4100 || rtx_equal_p (XEXP (XEXP (x, 0), 1), XEXP (x, 1)))
4101 && ! side_effects_p (XEXP (XEXP (x, 0), 0))
4102 && ! side_effects_p (XEXP (XEXP (x, 0), 1)))
4105 /* If we have (ior (and A B) C), apply the distributive law and then
4106 the inverse distributive law to see if things simplify. */
4108 if (GET_CODE (XEXP (x, 0)) == AND)
4110 x = apply_distributive_law
4111 (gen_binary (AND, mode,
4112 gen_binary (IOR, mode,
4113 XEXP (XEXP (x, 0), 0), XEXP (x, 1)),
4114 gen_binary (IOR, mode,
4115 XEXP (XEXP (x, 0), 1), XEXP (x, 1))));
4117 if (GET_CODE (x) != IOR)
4121 if (GET_CODE (XEXP (x, 1)) == AND)
4123 x = apply_distributive_law
4124 (gen_binary (AND, mode,
4125 gen_binary (IOR, mode,
4126 XEXP (XEXP (x, 1), 0), XEXP (x, 0)),
4127 gen_binary (IOR, mode,
4128 XEXP (XEXP (x, 1), 1), XEXP (x, 0))));
4130 if (GET_CODE (x) != IOR)
4134 /* Convert (ior (ashift A CX) (lshiftrt A CY)) where CX+CY equals the
4135 mode size to (rotate A CX). */
4137 if (((GET_CODE (XEXP (x, 0)) == ASHIFT
4138 && GET_CODE (XEXP (x, 1)) == LSHIFTRT)
4139 || (GET_CODE (XEXP (x, 1)) == ASHIFT
4140 && GET_CODE (XEXP (x, 0)) == LSHIFTRT))
4141 && rtx_equal_p (XEXP (XEXP (x, 0), 0), XEXP (XEXP (x, 1), 0))
4142 && GET_CODE (XEXP (XEXP (x, 0), 1)) == CONST_INT
4143 && GET_CODE (XEXP (XEXP (x, 1), 1)) == CONST_INT
4144 && (INTVAL (XEXP (XEXP (x, 0), 1)) + INTVAL (XEXP (XEXP (x, 1), 1))
4145 == GET_MODE_BITSIZE (mode)))
4149 if (GET_CODE (XEXP (x, 0)) == ASHIFT)
4150 shift_count = XEXP (XEXP (x, 0), 1);
4152 shift_count = XEXP (XEXP (x, 1), 1);
4153 x = gen_rtx (ROTATE, mode, XEXP (XEXP (x, 0), 0), shift_count);
4159 /* Convert (XOR (NOT x) (NOT y)) to (XOR x y).
4160 Also convert (XOR (NOT x) y) to (NOT (XOR x y)), similarly for
4163 int num_negated = 0;
4164 rtx in1 = XEXP (x, 0), in2 = XEXP (x, 1);
4166 if (GET_CODE (in1) == NOT)
4167 num_negated++, in1 = XEXP (in1, 0);
4168 if (GET_CODE (in2) == NOT)
4169 num_negated++, in2 = XEXP (in2, 0);
4171 if (num_negated == 2)
4173 SUBST (XEXP (x, 0), XEXP (XEXP (x, 0), 0));
4174 SUBST (XEXP (x, 1), XEXP (XEXP (x, 1), 0));
4176 else if (num_negated == 1)
4178 x = gen_unary (NOT, mode,
4179 gen_binary (XOR, mode, in1, in2));
4184 /* Convert (xor (and A B) B) to (and (not A) B). The latter may
4185 correspond to a machine insn or result in further simplifications
4186 if B is a constant. */
4188 if (GET_CODE (XEXP (x, 0)) == AND
4189 && rtx_equal_p (XEXP (XEXP (x, 0), 1), XEXP (x, 1))
4190 && ! side_effects_p (XEXP (x, 1)))
4192 x = gen_binary (AND, mode,
4193 gen_unary (NOT, mode, XEXP (XEXP (x, 0), 0)),
4197 else if (GET_CODE (XEXP (x, 0)) == AND
4198 && rtx_equal_p (XEXP (XEXP (x, 0), 0), XEXP (x, 1))
4199 && ! side_effects_p (XEXP (x, 1)))
4201 x = gen_binary (AND, mode,
4202 gen_unary (NOT, mode, XEXP (XEXP (x, 0), 1)),
4208 #if STORE_FLAG_VALUE == 1
4209 /* (xor (comparison foo bar) (const_int 1)) can become the reversed
4211 if (XEXP (x, 1) == const1_rtx
4212 && GET_RTX_CLASS (GET_CODE (XEXP (x, 0))) == '<'
4213 && reversible_comparison_p (XEXP (x, 0)))
4214 return gen_rtx_combine (reverse_condition (GET_CODE (XEXP (x, 0))),
4215 mode, XEXP (XEXP (x, 0), 0),
4216 XEXP (XEXP (x, 0), 1));
4219 /* (xor (comparison foo bar) (const_int sign-bit))
4220 when STORE_FLAG_VALUE is the sign bit. */
4221 if (GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT
4222 && (STORE_FLAG_VALUE
4223 == (HOST_WIDE_INT) 1 << (GET_MODE_BITSIZE (mode) - 1))
4224 && XEXP (x, 1) == const_true_rtx
4225 && GET_RTX_CLASS (GET_CODE (XEXP (x, 0))) == '<'
4226 && reversible_comparison_p (XEXP (x, 0)))
4227 return gen_rtx_combine (reverse_condition (GET_CODE (XEXP (x, 0))),
4228 mode, XEXP (XEXP (x, 0), 0),
4229 XEXP (XEXP (x, 0), 1));
4233 /* (abs (neg <foo>)) -> (abs <foo>) */
4234 if (GET_CODE (XEXP (x, 0)) == NEG)
4235 SUBST (XEXP (x, 0), XEXP (XEXP (x, 0), 0));
4237 /* If operand is something known to be positive, ignore the ABS. */
4238 if (GET_CODE (XEXP (x, 0)) == FFS || GET_CODE (XEXP (x, 0)) == ABS
4239 || ((GET_MODE_BITSIZE (GET_MODE (XEXP (x, 0)))
4240 <= HOST_BITS_PER_WIDE_INT)
4241 && ((significant_bits (XEXP (x, 0), GET_MODE (XEXP (x, 0)))
4242 & ((HOST_WIDE_INT) 1
4243 << (GET_MODE_BITSIZE (GET_MODE (XEXP (x, 0))) - 1)))
4248 /* If operand is known to be only -1 or 0, convert ABS to NEG. */
4249 if (num_sign_bit_copies (XEXP (x, 0), mode) == GET_MODE_BITSIZE (mode))
4251 x = gen_rtx_combine (NEG, mode, XEXP (x, 0));
4257 /* (ffs (*_extend <X>)) = (ffs <X>) */
4258 if (GET_CODE (XEXP (x, 0)) == SIGN_EXTEND
4259 || GET_CODE (XEXP (x, 0)) == ZERO_EXTEND)
4260 SUBST (XEXP (x, 0), XEXP (XEXP (x, 0), 0));
4264 /* (float (sign_extend <X>)) = (float <X>). */
4265 if (GET_CODE (XEXP (x, 0)) == SIGN_EXTEND)
4266 SUBST (XEXP (x, 0), XEXP (XEXP (x, 0), 0));
4275 /* If this is a shift by a constant amount, simplify it. */
4276 if (GET_CODE (XEXP (x, 1)) == CONST_INT)
4278 x = simplify_shift_const (x, code, mode, XEXP (x, 0),
4279 INTVAL (XEXP (x, 1)));
4280 if (GET_CODE (x) != code)
4284 #ifdef SHIFT_COUNT_TRUNCATED
4285 else if (GET_CODE (XEXP (x, 1)) != REG)
4287 force_to_mode (XEXP (x, 1), GET_MODE (x),
4288 exact_log2 (GET_MODE_BITSIZE (GET_MODE (x))),
4298 /* We consider ZERO_EXTRACT, SIGN_EXTRACT, and SIGN_EXTEND as "compound
4299 operations" because they can be replaced with two more basic operations.
4300 ZERO_EXTEND is also considered "compound" because it can be replaced with
4301 an AND operation, which is simpler, though only one operation.
4303 The function expand_compound_operation is called with an rtx expression
4304 and will convert it to the appropriate shifts and AND operations,
4305 simplifying at each stage.
4307 The function make_compound_operation is called to convert an expression
4308 consisting of shifts and ANDs into the equivalent compound expression.
4309 It is the inverse of this function, loosely speaking. */
4312 expand_compound_operation (x)
4320 switch (GET_CODE (x))
4325 /* We can't necessarily use a const_int for a multiword mode;
4326 it depends on implicitly extending the value.
4327 Since we don't know the right way to extend it,
4328 we can't tell whether the implicit way is right.
4330 Even for a mode that is no wider than a const_int,
4331 we can't win, because we need to sign extend one of its bits through
4332 the rest of it, and we don't know which bit. */
4333 if (GET_CODE (XEXP (x, 0)) == CONST_INT)
4336 if (! FAKE_EXTEND_SAFE_P (GET_MODE (XEXP (x, 0)), XEXP (x, 0)))
4339 len = GET_MODE_BITSIZE (GET_MODE (XEXP (x, 0)));
4340 /* If the inner object has VOIDmode (the only way this can happen
4341 is if it is a ASM_OPERANDS), we can't do anything since we don't
4342 know how much masking to do. */
4351 /* If the operand is a CLOBBER, just return it. */
4352 if (GET_CODE (XEXP (x, 0)) == CLOBBER)
4355 if (GET_CODE (XEXP (x, 1)) != CONST_INT
4356 || GET_CODE (XEXP (x, 2)) != CONST_INT
4357 || GET_MODE (XEXP (x, 0)) == VOIDmode)
4360 len = INTVAL (XEXP (x, 1));
4361 pos = INTVAL (XEXP (x, 2));
4363 /* If this goes outside the object being extracted, replace the object
4364 with a (use (mem ...)) construct that only combine understands
4365 and is used only for this purpose. */
4366 if (len + pos > GET_MODE_BITSIZE (GET_MODE (XEXP (x, 0))))
4367 SUBST (XEXP (x, 0), gen_rtx (USE, GET_MODE (x), XEXP (x, 0)));
4370 pos = GET_MODE_BITSIZE (GET_MODE (XEXP (x, 0))) - len - pos;
4378 /* If we reach here, we want to return a pair of shifts. The inner
4379 shift is a left shift of BITSIZE - POS - LEN bits. The outer
4380 shift is a right shift of BITSIZE - LEN bits. It is arithmetic or
4381 logical depending on the value of UNSIGNEDP.
4383 If this was a ZERO_EXTEND or ZERO_EXTRACT, this pair of shifts will be
4384 converted into an AND of a shift.
4386 We must check for the case where the left shift would have a negative
4387 count. This can happen in a case like (x >> 31) & 255 on machines
4388 that can't shift by a constant. On those machines, we would first
4389 combine the shift with the AND to produce a variable-position
4390 extraction. Then the constant of 31 would be substituted in to produce
4391 a such a position. */
4393 modewidth = GET_MODE_BITSIZE (GET_MODE (x));
4394 if (modewidth >= pos - len)
4395 tem = simplify_shift_const (NULL_RTX, unsignedp ? LSHIFTRT : ASHIFTRT,
4397 simplify_shift_const (NULL_RTX, ASHIFT,
4400 modewidth - pos - len),
4403 else if (unsignedp && len < HOST_BITS_PER_WIDE_INT)
4404 tem = simplify_and_const_int (NULL_RTX, GET_MODE (x),
4405 simplify_shift_const (NULL_RTX, LSHIFTRT,
4408 ((HOST_WIDE_INT) 1 << len) - 1);
4410 /* Any other cases we can't handle. */
4414 /* If we couldn't do this for some reason, return the original
4416 if (GET_CODE (tem) == CLOBBER)
4422 /* X is a SET which contains an assignment of one object into
4423 a part of another (such as a bit-field assignment, STRICT_LOW_PART,
4424 or certain SUBREGS). If possible, convert it into a series of
4427 We half-heartedly support variable positions, but do not at all
4428 support variable lengths. */
4431 expand_field_assignment (x)
4435 rtx pos; /* Always counts from low bit. */
4438 enum machine_mode compute_mode;
4440 /* Loop until we find something we can't simplify. */
4443 if (GET_CODE (SET_DEST (x)) == STRICT_LOW_PART
4444 && GET_CODE (XEXP (SET_DEST (x), 0)) == SUBREG)
4446 inner = SUBREG_REG (XEXP (SET_DEST (x), 0));
4447 len = GET_MODE_BITSIZE (GET_MODE (XEXP (SET_DEST (x), 0)));
4450 else if (GET_CODE (SET_DEST (x)) == ZERO_EXTRACT
4451 && GET_CODE (XEXP (SET_DEST (x), 1)) == CONST_INT)
4453 inner = XEXP (SET_DEST (x), 0);
4454 len = INTVAL (XEXP (SET_DEST (x), 1));
4455 pos = XEXP (SET_DEST (x), 2);
4457 /* If the position is constant and spans the width of INNER,
4458 surround INNER with a USE to indicate this. */
4459 if (GET_CODE (pos) == CONST_INT
4460 && INTVAL (pos) + len > GET_MODE_BITSIZE (GET_MODE (inner)))
4461 inner = gen_rtx (USE, GET_MODE (SET_DEST (x)), inner);
4464 if (GET_CODE (pos) == CONST_INT)
4465 pos = GEN_INT (GET_MODE_BITSIZE (GET_MODE (inner)) - len
4467 else if (GET_CODE (pos) == MINUS
4468 && GET_CODE (XEXP (pos, 1)) == CONST_INT
4469 && (INTVAL (XEXP (pos, 1))
4470 == GET_MODE_BITSIZE (GET_MODE (inner)) - len))
4471 /* If position is ADJUST - X, new position is X. */
4472 pos = XEXP (pos, 0);
4474 pos = gen_binary (MINUS, GET_MODE (pos),
4475 GEN_INT (GET_MODE_BITSIZE (GET_MODE (inner))
4481 /* A SUBREG between two modes that occupy the same numbers of words
4482 can be done by moving the SUBREG to the source. */
4483 else if (GET_CODE (SET_DEST (x)) == SUBREG
4484 && (((GET_MODE_SIZE (GET_MODE (SET_DEST (x)))
4485 + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD)
4486 == ((GET_MODE_SIZE (GET_MODE (SUBREG_REG (SET_DEST (x))))
4487 + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD)))
4489 x = gen_rtx (SET, VOIDmode, SUBREG_REG (SET_DEST (x)),
4490 gen_lowpart_for_combine (GET_MODE (SUBREG_REG (SET_DEST (x))),
4497 while (GET_CODE (inner) == SUBREG && subreg_lowpart_p (inner))
4498 inner = SUBREG_REG (inner);
4500 compute_mode = GET_MODE (inner);
4502 /* Compute a mask of LEN bits, if we can do this on the host machine. */
4503 if (len < HOST_BITS_PER_WIDE_INT)
4504 mask = GEN_INT (((HOST_WIDE_INT) 1 << len) - 1);
4508 /* Now compute the equivalent expression. Make a copy of INNER
4509 for the SET_DEST in case it is a MEM into which we will substitute;
4510 we don't want shared RTL in that case. */
4511 x = gen_rtx (SET, VOIDmode, copy_rtx (inner),
4512 gen_binary (IOR, compute_mode,
4513 gen_binary (AND, compute_mode,
4514 gen_unary (NOT, compute_mode,
4519 gen_binary (ASHIFT, compute_mode,
4520 gen_binary (AND, compute_mode,
4521 gen_lowpart_for_combine
4531 /* Return an RTX for a reference to LEN bits of INNER. POS is the starting
4532 bit position (counted from the LSB) if >= 0; otherwise POS_RTX represents
4533 the starting bit position.
4535 INNER may be a USE. This will occur when we started with a bitfield
4536 that went outside the boundary of the object in memory, which is
4537 allowed on most machines. To isolate this case, we produce a USE
4538 whose mode is wide enough and surround the MEM with it. The only
4539 code that understands the USE is this routine. If it is not removed,
4540 it will cause the resulting insn not to match.
4542 UNSIGNEDP is non-zero for an unsigned reference and zero for a
4545 IN_DEST is non-zero if this is a reference in the destination of a
4546 SET. This is used when a ZERO_ or SIGN_EXTRACT isn't needed. If non-zero,
4547 a STRICT_LOW_PART will be used, if zero, ZERO_EXTEND or SIGN_EXTEND will
4550 IN_COMPARE is non-zero if we are in a COMPARE. This means that a
4551 ZERO_EXTRACT should be built even for bits starting at bit 0.
4553 MODE is the desired mode of the result (if IN_DEST == 0). */
4556 make_extraction (mode, inner, pos, pos_rtx, len,
4557 unsignedp, in_dest, in_compare)
4558 enum machine_mode mode;
4564 int in_dest, in_compare;
4566 /* This mode describes the size of the storage area
4567 to fetch the overall value from. Within that, we
4568 ignore the POS lowest bits, etc. */
4569 enum machine_mode is_mode = GET_MODE (inner);
4570 enum machine_mode inner_mode;
4571 enum machine_mode wanted_mem_mode = byte_mode;
4572 enum machine_mode pos_mode = word_mode;
4573 enum machine_mode extraction_mode = word_mode;
4574 enum machine_mode tmode = mode_for_size (len, MODE_INT, 1);
4578 /* Get some information about INNER and get the innermost object. */
4579 if (GET_CODE (inner) == USE)
4580 /* (use:SI (mem:QI foo)) stands for (mem:SI foo). */
4581 /* We don't need to adjust the position because we set up the USE
4582 to pretend that it was a full-word object. */
4583 spans_byte = 1, inner = XEXP (inner, 0);
4584 else if (GET_CODE (inner) == SUBREG && subreg_lowpart_p (inner))
4586 /* If going from (subreg:SI (mem:QI ...)) to (mem:QI ...),
4587 consider just the QI as the memory to extract from.
4588 The subreg adds or removes high bits; its mode is
4589 irrelevant to the meaning of this extraction,
4590 since POS and LEN count from the lsb. */
4591 if (GET_CODE (SUBREG_REG (inner)) == MEM)
4592 is_mode = GET_MODE (SUBREG_REG (inner));
4593 inner = SUBREG_REG (inner);
4596 inner_mode = GET_MODE (inner);
4598 if (pos_rtx && GET_CODE (pos_rtx) == CONST_INT)
4599 pos = INTVAL (pos_rtx);
4601 /* See if this can be done without an extraction. We never can if the
4602 width of the field is not the same as that of some integer mode. For
4603 registers, we can only avoid the extraction if the position is at the
4604 low-order bit and this is either not in the destination or we have the
4605 appropriate STRICT_LOW_PART operation available.
4607 For MEM, we can avoid an extract if the field starts on an appropriate
4608 boundary and we can change the mode of the memory reference. However,
4609 we cannot directly access the MEM if we have a USE and the underlying
4610 MEM is not TMODE. This combination means that MEM was being used in a
4611 context where bits outside its mode were being referenced; that is only
4612 valid in bit-field insns. */
4614 if (tmode != BLKmode
4615 && ! (spans_byte && inner_mode != tmode)
4616 && ((pos == 0 && GET_CODE (inner) != MEM
4618 || (GET_CODE (inner) == REG
4619 && (movstrict_optab->handlers[(int) tmode].insn_code
4620 != CODE_FOR_nothing))))
4621 || (GET_CODE (inner) == MEM && pos >= 0
4623 % (STRICT_ALIGNMENT ? GET_MODE_ALIGNMENT (tmode)
4624 : BITS_PER_UNIT)) == 0
4625 /* We can't do this if we are widening INNER_MODE (it
4626 may not be aligned, for one thing). */
4627 && GET_MODE_BITSIZE (inner_mode) >= GET_MODE_BITSIZE (tmode)
4628 && (inner_mode == tmode
4629 || (! mode_dependent_address_p (XEXP (inner, 0))
4630 && ! MEM_VOLATILE_P (inner))))))
4632 /* If INNER is a MEM, make a new MEM that encompasses just the desired
4633 field. If the original and current mode are the same, we need not
4634 adjust the offset. Otherwise, we do if bytes big endian.
4636 If INNER is not a MEM, get a piece consisting of the just the field
4637 of interest (in this case POS must be 0). */
4639 if (GET_CODE (inner) == MEM)
4642 /* POS counts from lsb, but make OFFSET count in memory order. */
4643 if (BYTES_BIG_ENDIAN)
4644 offset = (GET_MODE_BITSIZE (is_mode) - len - pos) / BITS_PER_UNIT;
4646 offset = pos / BITS_PER_UNIT;
4648 new = gen_rtx (MEM, tmode, plus_constant (XEXP (inner, 0), offset));
4649 RTX_UNCHANGING_P (new) = RTX_UNCHANGING_P (inner);
4650 MEM_VOLATILE_P (new) = MEM_VOLATILE_P (inner);
4651 MEM_IN_STRUCT_P (new) = MEM_IN_STRUCT_P (inner);
4653 else if (GET_CODE (inner) == REG)
4654 /* We can't call gen_lowpart_for_combine here since we always want
4655 a SUBREG and it would sometimes return a new hard register. */
4656 new = gen_rtx (SUBREG, tmode, inner,
4658 && GET_MODE_SIZE (inner_mode) > UNITS_PER_WORD
4659 ? ((GET_MODE_SIZE (inner_mode) - GET_MODE_SIZE (tmode))
4663 new = force_to_mode (inner, tmode, len, NULL_RTX);
4665 /* If this extraction is going into the destination of a SET,
4666 make a STRICT_LOW_PART unless we made a MEM. */
4669 return (GET_CODE (new) == MEM ? new
4670 : (GET_CODE (new) != SUBREG
4671 ? gen_rtx (CLOBBER, tmode, const0_rtx)
4672 : gen_rtx_combine (STRICT_LOW_PART, VOIDmode, new)));
4674 /* Otherwise, sign- or zero-extend unless we already are in the
4677 return (mode == tmode ? new
4678 : gen_rtx_combine (unsignedp ? ZERO_EXTEND : SIGN_EXTEND,
4682 /* Unless this is a COMPARE or we have a funny memory reference,
4683 don't do anything with zero-extending field extracts starting at
4684 the low-order bit since they are simple AND operations. */
4685 if (pos == 0 && ! in_dest && ! in_compare && ! spans_byte && unsignedp)
4688 /* Get the mode to use should INNER be a MEM, the mode for the position,
4689 and the mode for the result. */
4693 wanted_mem_mode = insn_operand_mode[(int) CODE_FOR_insv][0];
4694 pos_mode = insn_operand_mode[(int) CODE_FOR_insv][2];
4695 extraction_mode = insn_operand_mode[(int) CODE_FOR_insv][3];
4700 if (! in_dest && unsignedp)
4702 wanted_mem_mode = insn_operand_mode[(int) CODE_FOR_extzv][1];
4703 pos_mode = insn_operand_mode[(int) CODE_FOR_extzv][3];
4704 extraction_mode = insn_operand_mode[(int) CODE_FOR_extzv][0];
4709 if (! in_dest && ! unsignedp)
4711 wanted_mem_mode = insn_operand_mode[(int) CODE_FOR_extv][1];
4712 pos_mode = insn_operand_mode[(int) CODE_FOR_extv][3];
4713 extraction_mode = insn_operand_mode[(int) CODE_FOR_extv][0];
4717 /* Never narrow an object, since that might not be safe. */
4719 if (mode != VOIDmode
4720 && GET_MODE_SIZE (extraction_mode) < GET_MODE_SIZE (mode))
4721 extraction_mode = mode;
4723 if (pos_rtx && GET_MODE (pos_rtx) != VOIDmode
4724 && GET_MODE_SIZE (pos_mode) < GET_MODE_SIZE (GET_MODE (pos_rtx)))
4725 pos_mode = GET_MODE (pos_rtx);
4727 /* If this is not from memory or we have to change the mode of memory and
4728 cannot, the desired mode is EXTRACTION_MODE. */
4729 if (GET_CODE (inner) != MEM
4730 || (inner_mode != wanted_mem_mode
4731 && (mode_dependent_address_p (XEXP (inner, 0))
4732 || MEM_VOLATILE_P (inner))))
4733 wanted_mem_mode = extraction_mode;
4736 /* If position is constant, compute new position. Otherwise, build
4739 pos = (MAX (GET_MODE_BITSIZE (is_mode), GET_MODE_BITSIZE (wanted_mem_mode))
4743 = gen_rtx_combine (MINUS, GET_MODE (pos_rtx),
4744 GEN_INT (MAX (GET_MODE_BITSIZE (is_mode),
4745 GET_MODE_BITSIZE (wanted_mem_mode))
4750 /* If INNER has a wider mode, make it smaller. If this is a constant
4751 extract, try to adjust the byte to point to the byte containing
4753 if (wanted_mem_mode != VOIDmode
4754 && GET_MODE_SIZE (wanted_mem_mode) < GET_MODE_SIZE (is_mode)
4755 && ((GET_CODE (inner) == MEM
4756 && (inner_mode == wanted_mem_mode
4757 || (! mode_dependent_address_p (XEXP (inner, 0))
4758 && ! MEM_VOLATILE_P (inner))))))
4762 /* The computations below will be correct if the machine is big
4763 endian in both bits and bytes or little endian in bits and bytes.
4764 If it is mixed, we must adjust. */
4766 #if BYTES_BIG_ENDIAN != BITS_BIG_ENDIAN
4767 if (! spans_byte && is_mode != wanted_mem_mode)
4768 offset = (GET_MODE_SIZE (is_mode)
4769 - GET_MODE_SIZE (wanted_mem_mode) - offset);
4772 /* If bytes are big endian and we had a paradoxical SUBREG, we must
4773 adjust OFFSET to compensate. */
4774 #if BYTES_BIG_ENDIAN
4776 && GET_MODE_SIZE (inner_mode) < GET_MODE_SIZE (is_mode))
4777 offset -= GET_MODE_SIZE (is_mode) - GET_MODE_SIZE (inner_mode);
4780 /* If this is a constant position, we can move to the desired byte. */
4783 offset += pos / BITS_PER_UNIT;
4784 pos %= GET_MODE_BITSIZE (wanted_mem_mode);
4787 if (offset != 0 || inner_mode != wanted_mem_mode)
4789 rtx newmem = gen_rtx (MEM, wanted_mem_mode,
4790 plus_constant (XEXP (inner, 0), offset));
4791 RTX_UNCHANGING_P (newmem) = RTX_UNCHANGING_P (inner);
4792 MEM_VOLATILE_P (newmem) = MEM_VOLATILE_P (inner);
4793 MEM_IN_STRUCT_P (newmem) = MEM_IN_STRUCT_P (inner);
4798 /* If INNER is not memory, we can always get it into the proper mode. */
4799 else if (GET_CODE (inner) != MEM)
4800 inner = force_to_mode (inner, extraction_mode,
4801 (pos < 0 ? GET_MODE_BITSIZE (extraction_mode)
4805 /* Adjust mode of POS_RTX, if needed. If we want a wider mode, we
4806 have to zero extend. Otherwise, we can just use a SUBREG. */
4808 && GET_MODE_SIZE (pos_mode) > GET_MODE_SIZE (GET_MODE (pos_rtx)))
4809 pos_rtx = gen_rtx_combine (ZERO_EXTEND, pos_mode, pos_rtx);
4811 && GET_MODE_SIZE (pos_mode) < GET_MODE_SIZE (GET_MODE (pos_rtx)))
4812 pos_rtx = gen_lowpart_for_combine (pos_mode, pos_rtx);
4814 /* Make POS_RTX unless we already have it and it is correct. */
4815 if (pos_rtx == 0 || (pos >= 0 && INTVAL (pos_rtx) != pos))
4816 pos_rtx = GEN_INT (pos);
4818 /* Make the required operation. See if we can use existing rtx. */
4819 new = gen_rtx_combine (unsignedp ? ZERO_EXTRACT : SIGN_EXTRACT,
4820 extraction_mode, inner, GEN_INT (len), pos_rtx);
4822 new = gen_lowpart_for_combine (mode, new);
4827 /* Look at the expression rooted at X. Look for expressions
4828 equivalent to ZERO_EXTRACT, SIGN_EXTRACT, ZERO_EXTEND, SIGN_EXTEND.
4829 Form these expressions.
4831 Return the new rtx, usually just X.
4833 Also, for machines like the Vax that don't have logical shift insns,
4834 try to convert logical to arithmetic shift operations in cases where
4835 they are equivalent. This undoes the canonicalizations to logical
4836 shifts done elsewhere.
4838 We try, as much as possible, to re-use rtl expressions to save memory.
4840 IN_CODE says what kind of expression we are processing. Normally, it is
4841 SET. In a memory address (inside a MEM, PLUS or minus, the latter two
4842 being kludges), it is MEM. When processing the arguments of a comparison
4843 or a COMPARE against zero, it is COMPARE. */
4846 make_compound_operation (x, in_code)
4848 enum rtx_code in_code;
4850 enum rtx_code code = GET_CODE (x);
4851 enum machine_mode mode = GET_MODE (x);
4852 int mode_width = GET_MODE_BITSIZE (mode);
4853 enum rtx_code next_code;
4858 /* Select the code to be used in recursive calls. Once we are inside an
4859 address, we stay there. If we have a comparison, set to COMPARE,
4860 but once inside, go back to our default of SET. */
4862 next_code = (code == MEM || code == PLUS || code == MINUS ? MEM
4863 : ((code == COMPARE || GET_RTX_CLASS (code) == '<')
4864 && XEXP (x, 1) == const0_rtx) ? COMPARE
4865 : in_code == COMPARE ? SET : in_code);
4867 /* Process depending on the code of this operation. If NEW is set
4868 non-zero, it will be returned. */
4874 /* Convert shifts by constants into multiplications if inside
4876 if (in_code == MEM && GET_CODE (XEXP (x, 1)) == CONST_INT
4877 && INTVAL (XEXP (x, 1)) < HOST_BITS_PER_WIDE_INT
4878 && INTVAL (XEXP (x, 1)) >= 0)
4879 new = gen_rtx_combine (MULT, mode, XEXP (x, 0),
4880 GEN_INT ((HOST_WIDE_INT) 1
4881 << INTVAL (XEXP (x, 1))));
4885 /* If the second operand is not a constant, we can't do anything
4887 if (GET_CODE (XEXP (x, 1)) != CONST_INT)
4890 /* If the constant is a power of two minus one and the first operand
4891 is a logical right shift, make an extraction. */
4892 if (GET_CODE (XEXP (x, 0)) == LSHIFTRT
4893 && (i = exact_log2 (INTVAL (XEXP (x, 1)) + 1)) >= 0)
4894 new = make_extraction (mode, XEXP (XEXP (x, 0), 0), -1,
4895 XEXP (XEXP (x, 0), 1), i, 1,
4896 0, in_code == COMPARE);
4898 /* Same as previous, but for (subreg (lshiftrt ...)) in first op. */
4899 else if (GET_CODE (XEXP (x, 0)) == SUBREG
4900 && subreg_lowpart_p (XEXP (x, 0))
4901 && GET_CODE (SUBREG_REG (XEXP (x, 0))) == LSHIFTRT
4902 && (i = exact_log2 (INTVAL (XEXP (x, 1)) + 1)) >= 0)
4903 new = make_extraction (GET_MODE (SUBREG_REG (XEXP (x, 0))),
4904 XEXP (SUBREG_REG (XEXP (x, 0)), 0), -1,
4905 XEXP (SUBREG_REG (XEXP (x, 0)), 1), i, 1,
4906 0, in_code == COMPARE);
4909 /* If we are have (and (rotate X C) M) and C is larger than the number
4910 of bits in M, this is an extraction. */
4912 else if (GET_CODE (XEXP (x, 0)) == ROTATE
4913 && GET_CODE (XEXP (XEXP (x, 0), 1)) == CONST_INT
4914 && (i = exact_log2 (INTVAL (XEXP (x, 1)) + 1)) >= 0
4915 && i <= INTVAL (XEXP (XEXP (x, 0), 1)))
4916 new = make_extraction (mode, XEXP (XEXP (x, 0), 0),
4917 (GET_MODE_BITSIZE (mode)
4918 - INTVAL (XEXP (XEXP (x, 0), 1))),
4919 NULL_RTX, i, 1, 0, in_code == COMPARE);
4921 /* On machines without logical shifts, if the operand of the AND is
4922 a logical shift and our mask turns off all the propagated sign
4923 bits, we can replace the logical shift with an arithmetic shift. */
4924 else if (ashr_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing
4925 && (lshr_optab->handlers[(int) mode].insn_code
4926 == CODE_FOR_nothing)
4927 && GET_CODE (XEXP (x, 0)) == LSHIFTRT
4928 && GET_CODE (XEXP (XEXP (x, 0), 1)) == CONST_INT
4929 && INTVAL (XEXP (XEXP (x, 0), 1)) >= 0
4930 && INTVAL (XEXP (XEXP (x, 0), 1)) < HOST_BITS_PER_WIDE_INT
4931 && mode_width <= HOST_BITS_PER_WIDE_INT)
4933 unsigned HOST_WIDE_INT mask = GET_MODE_MASK (mode);
4935 mask >>= INTVAL (XEXP (XEXP (x, 0), 1));
4936 if ((INTVAL (XEXP (x, 1)) & ~mask) == 0)
4938 gen_rtx_combine (ASHIFTRT, mode, XEXP (XEXP (x, 0), 0),
4939 XEXP (XEXP (x, 0), 1)));
4942 /* If the constant is one less than a power of two, this might be
4943 representable by an extraction even if no shift is present.
4944 If it doesn't end up being a ZERO_EXTEND, we will ignore it unless
4945 we are in a COMPARE. */
4946 else if ((i = exact_log2 (INTVAL (XEXP (x, 1)) + 1)) >= 0)
4947 new = make_extraction (mode, XEXP (x, 0), 0, NULL_RTX, i, 1,
4948 0, in_code == COMPARE);
4950 /* If we are in a comparison and this is an AND with a power of two,
4951 convert this into the appropriate bit extract. */
4952 else if (in_code == COMPARE
4953 && (i = exact_log2 (INTVAL (XEXP (x, 1)))) >= 0)
4954 new = make_extraction (mode, XEXP (x, 0), i, NULL_RTX, 1, 1, 0, 1);
4959 /* If the sign bit is known to be zero, replace this with an
4960 arithmetic shift. */
4961 if (ashr_optab->handlers[(int) mode].insn_code == CODE_FOR_nothing
4962 && lshr_optab->handlers[(int) mode].insn_code != CODE_FOR_nothing
4963 && mode_width <= HOST_BITS_PER_WIDE_INT
4964 && (significant_bits (XEXP (x, 0), mode)
4965 & (1 << (mode_width - 1))) == 0)
4967 new = gen_rtx_combine (ASHIFTRT, mode, XEXP (x, 0), XEXP (x, 1));
4971 /* ... fall through ... */
4974 /* If we have (ashiftrt (ashift foo C1) C2) with C2 >= C1,
4975 this is a SIGN_EXTRACT. */
4976 if (GET_CODE (XEXP (x, 1)) == CONST_INT
4977 && GET_CODE (XEXP (x, 0)) == ASHIFT
4978 && GET_CODE (XEXP (XEXP (x, 0), 1)) == CONST_INT
4979 && INTVAL (XEXP (x, 1)) >= INTVAL (XEXP (XEXP (x, 0), 1)))
4980 new = make_extraction (mode, XEXP (XEXP (x, 0), 0),
4981 (INTVAL (XEXP (x, 1))
4982 - INTVAL (XEXP (XEXP (x, 0), 1))),
4983 NULL_RTX, mode_width - INTVAL (XEXP (x, 1)),
4984 code == LSHIFTRT, 0, in_code == COMPARE);
4986 /* Similarly if we have (ashifrt (OP (ashift foo C1) C3) C2). In these
4987 cases, we are better off returning a SIGN_EXTEND of the operation. */
4989 if (GET_CODE (XEXP (x, 1)) == CONST_INT
4990 && (GET_CODE (XEXP (x, 0)) == IOR || GET_CODE (XEXP (x, 0)) == AND
4991 || GET_CODE (XEXP (x, 0)) == XOR
4992 || GET_CODE (XEXP (x, 0)) == PLUS)
4993 && GET_CODE (XEXP (XEXP (x, 0), 0)) == ASHIFT
4994 && GET_CODE (XEXP (XEXP (XEXP (x, 0), 0), 1)) == CONST_INT
4995 && INTVAL (XEXP (x, 1)) >= INTVAL (XEXP (XEXP (XEXP (x, 0), 0), 1))
4996 && INTVAL (XEXP (XEXP (XEXP (x, 0), 0), 1)) < HOST_BITS_PER_WIDE_INT
4997 && GET_CODE (XEXP (XEXP (x, 0), 1)) == CONST_INT
4998 && (INTVAL (XEXP (XEXP (x, 0), 1))
4999 & (((HOST_WIDE_INT) 1
5000 << INTVAL (XEXP (XEXP (XEXP (x, 0), 0), 1))) - 1)) == 0)
5002 HOST_WIDE_INT newop1
5003 = (INTVAL (XEXP (XEXP (x, 0), 1))
5004 >> INTVAL (XEXP (XEXP (XEXP (x, 0), 0), 1)));
5006 new = make_extraction (mode,
5007 gen_binary (GET_CODE (XEXP (x, 0)), mode,
5008 XEXP (XEXP (XEXP (x, 0), 0), 0),
5010 (INTVAL (XEXP (x, 1))
5011 - INTVAL (XEXP (XEXP (XEXP (x, 0), 0), 1))),
5012 NULL_RTX, mode_width - INTVAL (XEXP (x, 1)),
5013 code == LSHIFTRT, 0, in_code == COMPARE);
5016 /* Similarly for (ashiftrt (neg (ashift FOO C1)) C2). */
5017 if (GET_CODE (XEXP (x, 1)) == CONST_INT
5018 && GET_CODE (XEXP (x, 0)) == NEG
5019 && GET_CODE (XEXP (XEXP (x, 0), 0)) == ASHIFT
5020 && GET_CODE (XEXP (XEXP (XEXP (x, 0), 0), 1)) == CONST_INT
5021 && INTVAL (XEXP (x, 1)) >= INTVAL (XEXP (XEXP (XEXP (x, 0), 0), 1)))
5022 new = make_extraction (mode,
5023 gen_unary (GET_CODE (XEXP (x, 0)), mode,
5024 XEXP (XEXP (XEXP (x, 0), 0), 0)),
5025 (INTVAL (XEXP (x, 1))
5026 - INTVAL (XEXP (XEXP (XEXP (x, 0), 0), 1))),
5027 NULL_RTX, mode_width - INTVAL (XEXP (x, 1)),
5028 code == LSHIFTRT, 0, in_code == COMPARE);
5034 x = gen_lowpart_for_combine (mode, new);
5035 code = GET_CODE (x);
5038 /* Now recursively process each operand of this operation. */
5039 fmt = GET_RTX_FORMAT (code);
5040 for (i = 0; i < GET_RTX_LENGTH (code); i++)
5043 new = make_compound_operation (XEXP (x, i), next_code);
5044 SUBST (XEXP (x, i), new);
5050 /* Given M see if it is a value that would select a field of bits
5051 within an item, but not the entire word. Return -1 if not.
5052 Otherwise, return the starting position of the field, where 0 is the
5055 *PLEN is set to the length of the field. */
5058 get_pos_from_mask (m, plen)
5059 unsigned HOST_WIDE_INT m;
5062 /* Get the bit number of the first 1 bit from the right, -1 if none. */
5063 int pos = exact_log2 (m & - m);
5068 /* Now shift off the low-order zero bits and see if we have a power of
5070 *plen = exact_log2 ((m >> pos) + 1);
5078 /* Rewrite X so that it is an expression in MODE. We only care about the
5079 low-order BITS bits so we can ignore AND operations that just clear
5082 Also, if REG is non-zero and X is a register equal in value to REG,
5083 replace X with REG. */
5086 force_to_mode (x, mode, bits, reg)
5088 enum machine_mode mode;
5092 enum rtx_code code = GET_CODE (x);
5093 enum machine_mode op_mode = mode;
5095 /* If X is narrower than MODE or if BITS is larger than the size of MODE,
5096 just get X in the proper mode. */
5098 if (GET_MODE_SIZE (GET_MODE (x)) < GET_MODE_SIZE (mode)
5099 || bits > GET_MODE_BITSIZE (mode))
5100 return gen_lowpart_for_combine (mode, x);
5108 x = expand_compound_operation (x);
5109 if (GET_CODE (x) != code)
5110 return force_to_mode (x, mode, bits, reg);
5114 if (reg != 0 && (rtx_equal_p (get_last_value (reg), x)
5115 || rtx_equal_p (reg, get_last_value (x))))
5120 if (bits < HOST_BITS_PER_WIDE_INT)
5121 x = GEN_INT (INTVAL (x) & (((HOST_WIDE_INT) 1 << bits) - 1));
5125 /* Ignore low-order SUBREGs. */
5126 if (subreg_lowpart_p (x))
5127 return force_to_mode (SUBREG_REG (x), mode, bits, reg);
5131 /* If this is an AND with a constant. Otherwise, we fall through to
5132 do the general binary case. */
5134 if (GET_CODE (XEXP (x, 1)) == CONST_INT)
5136 HOST_WIDE_INT mask = INTVAL (XEXP (x, 1));
5137 int len = exact_log2 (mask + 1);
5138 rtx op = XEXP (x, 0);
5140 /* If this is masking some low-order bits, we may be able to
5141 impose a stricter constraint on what bits of the operand are
5144 op = force_to_mode (op, mode, len > 0 ? MIN (len, bits) : bits,
5147 if (bits < HOST_BITS_PER_WIDE_INT)
5148 mask &= ((HOST_WIDE_INT) 1 << bits) - 1;
5150 /* If we have no AND in MODE, use the original mode for the
5153 if (and_optab->handlers[(int) mode].insn_code == CODE_FOR_nothing)
5154 op_mode = GET_MODE (x);
5156 x = simplify_and_const_int (x, op_mode, op, mask);
5158 /* If X is still an AND, see if it is an AND with a mask that
5159 is just some low-order bits. If so, and it is BITS wide (it
5160 can't be wider), we don't need it. */
5162 if (GET_CODE (x) == AND && GET_CODE (XEXP (x, 1)) == CONST_INT
5163 && bits < HOST_BITS_PER_WIDE_INT
5164 && INTVAL (XEXP (x, 1)) == ((HOST_WIDE_INT) 1 << bits) - 1)
5170 /* ... fall through ... */
5177 /* For most binary operations, just propagate into the operation and
5178 change the mode if we have an operation of that mode. */
5181 && add_optab->handlers[(int) mode].insn_code == CODE_FOR_nothing)
5183 && sub_optab->handlers[(int) mode].insn_code == CODE_FOR_nothing)
5184 || (code == MULT && (smul_optab->handlers[(int) mode].insn_code
5185 == CODE_FOR_nothing))
5187 && and_optab->handlers[(int) mode].insn_code == CODE_FOR_nothing)
5189 && ior_optab->handlers[(int) mode].insn_code == CODE_FOR_nothing)
5190 || (code == XOR && (xor_optab->handlers[(int) mode].insn_code
5191 == CODE_FOR_nothing)))
5192 op_mode = GET_MODE (x);
5194 x = gen_binary (code, op_mode,
5195 gen_lowpart_for_combine (op_mode,
5196 force_to_mode (XEXP (x, 0),
5199 gen_lowpart_for_combine (op_mode,
5200 force_to_mode (XEXP (x, 1),
5207 /* For left shifts, do the same, but just for the first operand.
5208 If the shift count is a constant, we need even fewer bits of the
5211 if (GET_CODE (XEXP (x, 1)) == CONST_INT && INTVAL (XEXP (x, 1)) < bits)
5212 bits -= INTVAL (XEXP (x, 1));
5215 && ashl_optab->handlers[(int) mode].insn_code == CODE_FOR_nothing)
5216 || (code == LSHIFT && (lshl_optab->handlers[(int) mode].insn_code
5217 == CODE_FOR_nothing)))
5218 op_mode = GET_MODE (x);
5220 x = gen_binary (code, op_mode,
5221 gen_lowpart_for_combine (op_mode,
5222 force_to_mode (XEXP (x, 0),
5229 /* Here we can only do something if the shift count is a constant and
5230 the count plus BITS is no larger than the width of MODE, we can do
5231 the shift in MODE. */
5233 if (GET_CODE (XEXP (x, 1)) == CONST_INT
5234 && INTVAL (XEXP (x, 1)) + bits <= GET_MODE_BITSIZE (mode))
5236 rtx inner = force_to_mode (XEXP (x, 0), mode,
5237 bits + INTVAL (XEXP (x, 1)), reg);
5239 if (lshr_optab->handlers[(int) mode].insn_code == CODE_FOR_nothing)
5240 op_mode = GET_MODE (x);
5242 x = gen_binary (LSHIFTRT, op_mode,
5243 gen_lowpart_for_combine (op_mode, inner),
5249 /* If this is a sign-extension operation that just affects bits
5250 we don't care about, remove it. */
5252 if (GET_CODE (XEXP (x, 1)) == CONST_INT
5253 && INTVAL (XEXP (x, 1)) >= 0
5254 && INTVAL (XEXP (x, 1)) <= GET_MODE_BITSIZE (GET_MODE (x)) - bits
5255 && GET_CODE (XEXP (x, 0)) == ASHIFT
5256 && GET_CODE (XEXP (XEXP (x, 0), 1)) == CONST_INT
5257 && INTVAL (XEXP (XEXP (x, 0), 1)) == INTVAL (XEXP (x, 1)))
5258 return force_to_mode (XEXP (XEXP (x, 0), 0), mode, bits, reg);
5264 && neg_optab->handlers[(int) mode].insn_code == CODE_FOR_nothing)
5265 || (code == NOT && (one_cmpl_optab->handlers[(int) mode].insn_code
5266 == CODE_FOR_nothing)))
5267 op_mode = GET_MODE (x);
5269 /* Handle these similarly to the way we handle most binary operations. */
5270 x = gen_unary (code, op_mode,
5271 gen_lowpart_for_combine (op_mode,
5272 force_to_mode (XEXP (x, 0), mode,
5277 /* We have no way of knowing if the IF_THEN_ELSE can itself be
5278 written in a narrower mode. We play it safe and do not do so. */
5281 gen_lowpart_for_combine (GET_MODE (x),
5282 force_to_mode (XEXP (x, 1), mode,
5285 gen_lowpart_for_combine (GET_MODE (x),
5286 force_to_mode (XEXP (x, 2), mode,
5291 /* Ensure we return a value of the proper mode. */
5292 return gen_lowpart_for_combine (mode, x);
5295 /* Return the value of expression X given the fact that condition COND
5296 is known to be true when applied to REG as its first operand and VAL
5297 as its second. X is known to not be shared and so can be modified in
5300 We only handle the simplest cases, and specifically those cases that
5301 arise with IF_THEN_ELSE expressions. */
5304 known_cond (x, cond, reg, val)
5309 enum rtx_code code = GET_CODE (x);
5314 if (side_effects_p (x))
5317 if (cond == EQ && rtx_equal_p (x, reg))
5320 /* If X is (abs REG) and we know something about REG's relationship
5321 with zero, we may be able to simplify this. */
5323 if (code == ABS && rtx_equal_p (XEXP (x, 0), reg) && val == const0_rtx)
5326 case GE: case GT: case EQ:
5329 return gen_unary (NEG, GET_MODE (XEXP (x, 0)), XEXP (x, 0));
5332 /* The only other cases we handle are MIN, MAX, and comparisons if the
5333 operands are the same as REG and VAL. */
5335 else if (GET_RTX_CLASS (code) == '<' || GET_RTX_CLASS (code) == 'c')
5337 if (rtx_equal_p (XEXP (x, 0), val))
5338 cond = swap_condition (cond), temp = val, val = reg, reg = temp;
5340 if (rtx_equal_p (XEXP (x, 0), reg) && rtx_equal_p (XEXP (x, 1), val))
5342 if (GET_RTX_CLASS (code) == '<')
5343 return (comparison_dominates_p (cond, code) ? const_true_rtx
5344 : (comparison_dominates_p (cond,
5345 reverse_condition (code))
5348 else if (code == SMAX || code == SMIN
5349 || code == UMIN || code == UMAX)
5351 int unsignedp = (code == UMIN || code == UMAX);
5353 if (code == SMAX || code == UMAX)
5354 cond = reverse_condition (cond);
5359 return unsignedp ? x : XEXP (x, 1);
5361 return unsignedp ? x : XEXP (x, 0);
5363 return unsignedp ? XEXP (x, 1) : x;
5365 return unsignedp ? XEXP (x, 0) : x;
5371 fmt = GET_RTX_FORMAT (code);
5372 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
5375 SUBST (XEXP (x, i), known_cond (XEXP (x, i), cond, reg, val));
5376 else if (fmt[i] == 'E')
5377 for (j = XVECLEN (x, i) - 1; j >= 0; j--)
5378 SUBST (XVECEXP (x, i, j), known_cond (XVECEXP (x, i, j),
5385 /* See if X, a SET operation, can be rewritten as a bit-field assignment.
5386 Return that assignment if so.
5388 We only handle the most common cases. */
5391 make_field_assignment (x)
5394 rtx dest = SET_DEST (x);
5395 rtx src = SET_SRC (x);
5401 enum machine_mode mode;
5403 /* If SRC was (and (not (ashift (const_int 1) POS)) DEST), this is
5404 a clear of a one-bit field. We will have changed it to
5405 (and (rotate (const_int -2) POS) DEST), so check for that. Also check
5408 if (GET_CODE (src) == AND && GET_CODE (XEXP (src, 0)) == ROTATE
5409 && GET_CODE (XEXP (XEXP (src, 0), 0)) == CONST_INT
5410 && INTVAL (XEXP (XEXP (src, 0), 0)) == -2
5411 && (rtx_equal_p (dest, XEXP (src, 1))
5412 || rtx_equal_p (dest, get_last_value (XEXP (src, 1)))
5413 || rtx_equal_p (get_last_value (dest), XEXP (src, 1))))
5415 assign = make_extraction (VOIDmode, dest, -1, XEXP (XEXP (src, 0), 1),
5417 return gen_rtx (SET, VOIDmode, assign, const0_rtx);
5420 else if (GET_CODE (src) == AND && GET_CODE (XEXP (src, 0)) == SUBREG
5421 && subreg_lowpart_p (XEXP (src, 0))
5422 && (GET_MODE_SIZE (GET_MODE (XEXP (src, 0)))
5423 < GET_MODE_SIZE (GET_MODE (SUBREG_REG (XEXP (src, 0)))))
5424 && GET_CODE (SUBREG_REG (XEXP (src, 0))) == ROTATE
5425 && INTVAL (XEXP (SUBREG_REG (XEXP (src, 0)), 0)) == -2
5426 && (rtx_equal_p (dest, XEXP (src, 1))
5427 || rtx_equal_p (dest, get_last_value (XEXP (src, 1)))
5428 || rtx_equal_p (get_last_value (dest), XEXP (src, 1))))
5430 assign = make_extraction (VOIDmode, dest, -1,
5431 XEXP (SUBREG_REG (XEXP (src, 0)), 1),
5433 return gen_rtx (SET, VOIDmode, assign, const0_rtx);
5436 /* If SRC is (ior (ashift (const_int 1) POS DEST)), this is a set of a
5438 else if (GET_CODE (src) == IOR && GET_CODE (XEXP (src, 0)) == ASHIFT
5439 && XEXP (XEXP (src, 0), 0) == const1_rtx
5440 && (rtx_equal_p (dest, XEXP (src, 1))
5441 || rtx_equal_p (dest, get_last_value (XEXP (src, 1)))
5442 || rtx_equal_p (get_last_value (dest), XEXP (src, 1))))
5444 assign = make_extraction (VOIDmode, dest, -1, XEXP (XEXP (src, 0), 1),
5446 return gen_rtx (SET, VOIDmode, assign, const1_rtx);
5449 /* The other case we handle is assignments into a constant-position
5450 field. They look like (ior (and DEST C1) OTHER). If C1 represents
5451 a mask that has all one bits except for a group of zero bits and
5452 OTHER is known to have zeros where C1 has ones, this is such an
5453 assignment. Compute the position and length from C1. Shift OTHER
5454 to the appropriate position, force it to the required mode, and
5455 make the extraction. Check for the AND in both operands. */
5457 if (GET_CODE (src) == IOR && GET_CODE (XEXP (src, 0)) == AND
5458 && GET_CODE (XEXP (XEXP (src, 0), 1)) == CONST_INT
5459 && (rtx_equal_p (XEXP (XEXP (src, 0), 0), dest)
5460 || rtx_equal_p (XEXP (XEXP (src, 0), 0), get_last_value (dest))
5461 || rtx_equal_p (get_last_value (XEXP (XEXP (src, 0), 1)), dest)))
5462 c1 = INTVAL (XEXP (XEXP (src, 0), 1)), other = XEXP (src, 1);
5463 else if (GET_CODE (src) == IOR && GET_CODE (XEXP (src, 1)) == AND
5464 && GET_CODE (XEXP (XEXP (src, 1), 1)) == CONST_INT
5465 && (rtx_equal_p (XEXP (XEXP (src, 1), 0), dest)
5466 || rtx_equal_p (XEXP (XEXP (src, 1), 0), get_last_value (dest))
5467 || rtx_equal_p (get_last_value (XEXP (XEXP (src, 1), 0)),
5469 c1 = INTVAL (XEXP (XEXP (src, 1), 1)), other = XEXP (src, 0);
5473 pos = get_pos_from_mask (~c1, &len);
5474 if (pos < 0 || pos + len > GET_MODE_BITSIZE (GET_MODE (dest))
5475 || (GET_MODE_BITSIZE (GET_MODE (other)) <= HOST_BITS_PER_WIDE_INT
5476 && (c1 & significant_bits (other, GET_MODE (other))) != 0))
5479 assign = make_extraction (VOIDmode, dest, pos, NULL_RTX, len, 1, 1, 0);
5481 /* The mode to use for the source is the mode of the assignment, or of
5482 what is inside a possible STRICT_LOW_PART. */
5483 mode = (GET_CODE (assign) == STRICT_LOW_PART
5484 ? GET_MODE (XEXP (assign, 0)) : GET_MODE (assign));
5486 /* Shift OTHER right POS places and make it the source, restricting it
5487 to the proper length and mode. */
5489 src = force_to_mode (simplify_shift_const (NULL_RTX, LSHIFTRT,
5490 GET_MODE (src), other, pos),
5493 return gen_rtx_combine (SET, VOIDmode, assign, src);
5496 /* See if X is of the form (+ (* a c) (* b c)) and convert to (* (+ a b) c)
5500 apply_distributive_law (x)
5503 enum rtx_code code = GET_CODE (x);
5504 rtx lhs, rhs, other;
5506 enum rtx_code inner_code;
5508 /* The outer operation can only be one of the following: */
5509 if (code != IOR && code != AND && code != XOR
5510 && code != PLUS && code != MINUS)
5513 lhs = XEXP (x, 0), rhs = XEXP (x, 1);
5515 /* If either operand is a primitive we can't do anything, so get out fast. */
5516 if (GET_RTX_CLASS (GET_CODE (lhs)) == 'o'
5517 || GET_RTX_CLASS (GET_CODE (rhs)) == 'o')
5520 lhs = expand_compound_operation (lhs);
5521 rhs = expand_compound_operation (rhs);
5522 inner_code = GET_CODE (lhs);
5523 if (inner_code != GET_CODE (rhs))
5526 /* See if the inner and outer operations distribute. */
5533 /* These all distribute except over PLUS. */
5534 if (code == PLUS || code == MINUS)
5539 if (code != PLUS && code != MINUS)
5545 /* These are also multiplies, so they distribute over everything. */
5549 /* Non-paradoxical SUBREGs distributes over all operations, provided
5550 the inner modes and word numbers are the same, this is an extraction
5551 of a low-order part, we don't convert an fp operation to int or
5552 vice versa, and we would not be converting a single-word
5553 operation into a multi-word operation. The latter test is not
5554 required, but it prevents generating unneeded multi-word operations.
5555 Some of the previous tests are redundant given the latter test, but
5556 are retained because they are required for correctness.
5558 We produce the result slightly differently in this case. */
5560 if (GET_MODE (SUBREG_REG (lhs)) != GET_MODE (SUBREG_REG (rhs))
5561 || SUBREG_WORD (lhs) != SUBREG_WORD (rhs)
5562 || ! subreg_lowpart_p (lhs)
5563 || (GET_MODE_CLASS (GET_MODE (lhs))
5564 != GET_MODE_CLASS (GET_MODE (SUBREG_REG (lhs))))
5565 || (GET_MODE_SIZE (GET_MODE (lhs))
5566 < GET_MODE_SIZE (GET_MODE (SUBREG_REG (lhs))))
5567 || GET_MODE_SIZE (GET_MODE (SUBREG_REG (lhs))) > UNITS_PER_WORD)
5570 tem = gen_binary (code, GET_MODE (SUBREG_REG (lhs)),
5571 SUBREG_REG (lhs), SUBREG_REG (rhs));
5572 return gen_lowpart_for_combine (GET_MODE (x), tem);
5578 /* Set LHS and RHS to the inner operands (A and B in the example
5579 above) and set OTHER to the common operand (C in the example).
5580 These is only one way to do this unless the inner operation is
5582 if (GET_RTX_CLASS (inner_code) == 'c'
5583 && rtx_equal_p (XEXP (lhs, 0), XEXP (rhs, 0)))
5584 other = XEXP (lhs, 0), lhs = XEXP (lhs, 1), rhs = XEXP (rhs, 1);
5585 else if (GET_RTX_CLASS (inner_code) == 'c'
5586 && rtx_equal_p (XEXP (lhs, 0), XEXP (rhs, 1)))
5587 other = XEXP (lhs, 0), lhs = XEXP (lhs, 1), rhs = XEXP (rhs, 0);
5588 else if (GET_RTX_CLASS (inner_code) == 'c'
5589 && rtx_equal_p (XEXP (lhs, 1), XEXP (rhs, 0)))
5590 other = XEXP (lhs, 1), lhs = XEXP (lhs, 0), rhs = XEXP (rhs, 1);
5591 else if (rtx_equal_p (XEXP (lhs, 1), XEXP (rhs, 1)))
5592 other = XEXP (lhs, 1), lhs = XEXP (lhs, 0), rhs = XEXP (rhs, 0);
5596 /* Form the new inner operation, seeing if it simplifies first. */
5597 tem = gen_binary (code, GET_MODE (x), lhs, rhs);
5599 /* There is one exception to the general way of distributing:
5600 (a ^ b) | (a ^ c) -> (~a) & (b ^ c) */
5601 if (code == XOR && inner_code == IOR)
5604 other = gen_unary (NOT, GET_MODE (x), other);
5607 /* We may be able to continuing distributing the result, so call
5608 ourselves recursively on the inner operation before forming the
5609 outer operation, which we return. */
5610 return gen_binary (inner_code, GET_MODE (x),
5611 apply_distributive_law (tem), other);
5614 /* We have X, a logical `and' of VAROP with the constant CONSTOP, to be done
5617 Return an equivalent form, if different from X. Otherwise, return X. If
5618 X is zero, we are to always construct the equivalent form. */
5621 simplify_and_const_int (x, mode, varop, constop)
5623 enum machine_mode mode;
5625 unsigned HOST_WIDE_INT constop;
5627 register enum machine_mode tmode;
5629 unsigned HOST_WIDE_INT significant;
5631 /* There is a large class of optimizations based on the principle that
5632 some operations produce results where certain bits are known to be zero,
5633 and hence are not significant to the AND. For example, if we have just
5634 done a left shift of one bit, the low-order bit is known to be zero and
5635 hence an AND with a mask of ~1 would not do anything.
5637 At the end of the following loop, we set:
5639 VAROP to be the item to be AND'ed with;
5640 CONSTOP to the constant value to AND it with. */
5644 /* If we ever encounter a mode wider than the host machine's widest
5645 integer size, we can't compute the masks accurately, so give up. */
5646 if (GET_MODE_BITSIZE (GET_MODE (varop)) > HOST_BITS_PER_WIDE_INT)
5649 /* Unless one of the cases below does a `continue',
5650 a `break' will be executed to exit the loop. */
5652 switch (GET_CODE (varop))
5655 /* If VAROP is a (clobber (const_int)), return it since we know
5656 we are generating something that won't match. */
5659 #if ! BITS_BIG_ENDIAN
5661 /* VAROP is a (use (mem ..)) that was made from a bit-field
5662 extraction that spanned the boundary of the MEM. If we are
5663 now masking so it is within that boundary, we don't need the
5665 if ((constop & ~ GET_MODE_MASK (GET_MODE (XEXP (varop, 0)))) == 0)
5667 varop = XEXP (varop, 0);
5674 if (subreg_lowpart_p (varop)
5675 /* We can ignore the effect this SUBREG if it narrows the mode
5676 or, on machines where byte operations extend, if the
5677 constant masks to zero all the bits the mode doesn't have. */
5678 && ((GET_MODE_SIZE (GET_MODE (varop))
5679 < GET_MODE_SIZE (GET_MODE (SUBREG_REG (varop))))
5680 #if defined(BYTE_LOADS_ZERO_EXTEND) || defined(BYTE_LOADS_SIGN_EXTEND)
5682 & GET_MODE_MASK (GET_MODE (varop))
5683 & ~ GET_MODE_MASK (GET_MODE (SUBREG_REG (varop)))))
5687 varop = SUBREG_REG (varop);
5696 /* Try to expand these into a series of shifts and then work
5697 with that result. If we can't, for example, if the extract
5698 isn't at a fixed position, give up. */
5699 temp = expand_compound_operation (varop);
5708 if (GET_CODE (XEXP (varop, 1)) == CONST_INT)
5710 constop &= INTVAL (XEXP (varop, 1));
5711 varop = XEXP (varop, 0);
5718 /* If VAROP is (ior (lshiftrt FOO C1) C2), try to commute the IOR and
5719 LSHIFT so we end up with an (and (lshiftrt (ior ...) ...) ...)
5720 operation which may be a bitfield extraction. */
5722 if (GET_CODE (XEXP (varop, 0)) == LSHIFTRT
5723 && GET_CODE (XEXP (XEXP (varop, 0), 1)) == CONST_INT
5724 && INTVAL (XEXP (XEXP (varop, 0), 1)) >= 0
5725 && INTVAL (XEXP (XEXP (varop, 0), 1)) < HOST_BITS_PER_WIDE_INT
5726 && GET_CODE (XEXP (varop, 1)) == CONST_INT
5727 && (INTVAL (XEXP (varop, 1))
5728 & ~ significant_bits (XEXP (varop, 0),
5729 GET_MODE (varop)) == 0))
5731 temp = GEN_INT ((INTVAL (XEXP (varop, 1)) & constop)
5732 << INTVAL (XEXP (XEXP (varop, 0), 1)));
5733 temp = gen_binary (GET_CODE (varop), GET_MODE (varop),
5734 XEXP (XEXP (varop, 0), 0), temp);
5735 varop = gen_rtx_combine (LSHIFTRT, GET_MODE (varop),
5736 temp, XEXP (varop, 1));
5740 /* Apply the AND to both branches of the IOR or XOR, then try to
5741 apply the distributive law. This may eliminate operations
5742 if either branch can be simplified because of the AND.
5743 It may also make some cases more complex, but those cases
5744 probably won't match a pattern either with or without this. */
5746 gen_lowpart_for_combine
5747 (mode, apply_distributive_law
5749 (GET_CODE (varop), GET_MODE (varop),
5750 simplify_and_const_int (NULL_RTX, GET_MODE (varop),
5751 XEXP (varop, 0), constop),
5752 simplify_and_const_int (NULL_RTX, GET_MODE (varop),
5753 XEXP (varop, 1), constop))));
5756 /* (and (not FOO)) is (and (xor FOO CONST_OP)) so if FOO is an
5757 LSHIFTRT we can do the same as above. */
5759 if (GET_CODE (XEXP (varop, 0)) == LSHIFTRT
5760 && GET_CODE (XEXP (XEXP (varop, 0), 1)) == CONST_INT
5761 && INTVAL (XEXP (XEXP (varop, 0), 1)) >= 0
5762 && INTVAL (XEXP (XEXP (varop, 0), 1)) < HOST_BITS_PER_WIDE_INT)
5764 temp = GEN_INT (constop << INTVAL (XEXP (XEXP (varop, 0), 1)));
5765 temp = gen_binary (XOR, GET_MODE (varop),
5766 XEXP (XEXP (varop, 0), 0), temp);
5767 varop = gen_rtx_combine (LSHIFTRT, GET_MODE (varop),
5768 temp, XEXP (XEXP (varop, 0), 1));
5774 /* If we are just looking for the sign bit, we don't need this
5775 shift at all, even if it has a variable count. */
5776 if (constop == ((HOST_WIDE_INT) 1
5777 << (GET_MODE_BITSIZE (GET_MODE (varop)) - 1)))
5779 varop = XEXP (varop, 0);
5783 /* If this is a shift by a constant, get a mask that contains
5784 those bits that are not copies of the sign bit. We then have
5785 two cases: If CONSTOP only includes those bits, this can be
5786 a logical shift, which may allow simplifications. If CONSTOP
5787 is a single-bit field not within those bits, we are requesting
5788 a copy of the sign bit and hence can shift the sign bit to
5789 the appropriate location. */
5790 if (GET_CODE (XEXP (varop, 1)) == CONST_INT
5791 && INTVAL (XEXP (varop, 1)) >= 0
5792 && INTVAL (XEXP (varop, 1)) < HOST_BITS_PER_WIDE_INT)
5796 significant = GET_MODE_MASK (GET_MODE (varop));
5797 significant >>= INTVAL (XEXP (varop, 1));
5799 if ((constop & ~significant) == 0
5800 || (i = exact_log2 (constop)) >= 0)
5802 varop = simplify_shift_const
5803 (varop, LSHIFTRT, GET_MODE (varop), XEXP (varop, 0),
5804 i < 0 ? INTVAL (XEXP (varop, 1))
5805 : GET_MODE_BITSIZE (GET_MODE (varop)) - 1 - i);
5806 if (GET_CODE (varop) != ASHIFTRT)
5811 /* If our mask is 1, convert this to a LSHIFTRT. This can be done
5812 even if the shift count isn't a constant. */
5814 varop = gen_rtx_combine (LSHIFTRT, GET_MODE (varop),
5815 XEXP (varop, 0), XEXP (varop, 1));
5819 /* (and (ne FOO 0) CONST) can be (and FOO CONST) if CONST is
5820 included in STORE_FLAG_VALUE and FOO has no significant bits
5822 if ((constop & ~ STORE_FLAG_VALUE) == 0
5823 && XEXP (varop, 0) == const0_rtx
5824 && (significant_bits (XEXP (varop, 0), mode) & ~ constop) == 0)
5826 varop = XEXP (varop, 0);
5832 /* In (and (plus FOO C1) M), if M is a mask that just turns off
5833 low-order bits (as in an alignment operation) and FOO is already
5834 aligned to that boundary, we can convert remove this AND
5835 and possibly the PLUS if it is now adding zero. */
5836 if (GET_CODE (XEXP (varop, 1)) == CONST_INT
5837 && exact_log2 (-constop) >= 0
5838 && (significant_bits (XEXP (varop, 0), mode) & ~ constop) == 0)
5840 varop = plus_constant (XEXP (varop, 0),
5841 INTVAL (XEXP (varop, 1)) & constop);
5846 /* ... fall through ... */
5849 /* In (and (plus (and FOO M1) BAR) M2), if M1 and M2 are one
5850 less than powers of two and M2 is narrower than M1, we can
5851 eliminate the inner AND. This occurs when incrementing
5854 if (GET_CODE (XEXP (varop, 0)) == ZERO_EXTRACT
5855 || GET_CODE (XEXP (varop, 0)) == ZERO_EXTEND)
5856 SUBST (XEXP (varop, 0),
5857 expand_compound_operation (XEXP (varop, 0)));
5859 if (GET_CODE (XEXP (varop, 0)) == AND
5860 && GET_CODE (XEXP (XEXP (varop, 0), 1)) == CONST_INT
5861 && exact_log2 (constop + 1) >= 0
5862 && exact_log2 (INTVAL (XEXP (XEXP (varop, 0), 1)) + 1) >= 0
5863 && (~ INTVAL (XEXP (XEXP (varop, 0), 1)) & constop) == 0)
5864 SUBST (XEXP (varop, 0), XEXP (XEXP (varop, 0), 0));
5871 /* If we have reached a constant, this whole thing is constant. */
5872 if (GET_CODE (varop) == CONST_INT)
5873 return GEN_INT (constop & INTVAL (varop));
5875 /* See what bits are significant in VAROP. */
5876 significant = significant_bits (varop, mode);
5878 /* Turn off all bits in the constant that are known to already be zero.
5879 Thus, if the AND isn't needed at all, we will have CONSTOP == SIGNIFICANT
5880 which is tested below. */
5882 constop &= significant;
5884 /* If we don't have any bits left, return zero. */
5888 /* Get VAROP in MODE. Try to get a SUBREG if not. Don't make a new SUBREG
5889 if we already had one (just check for the simplest cases). */
5890 if (x && GET_CODE (XEXP (x, 0)) == SUBREG
5891 && GET_MODE (XEXP (x, 0)) == mode
5892 && SUBREG_REG (XEXP (x, 0)) == varop)
5893 varop = XEXP (x, 0);
5895 varop = gen_lowpart_for_combine (mode, varop);
5897 /* If we can't make the SUBREG, try to return what we were given. */
5898 if (GET_CODE (varop) == CLOBBER)
5899 return x ? x : varop;
5901 /* If we are only masking insignificant bits, return VAROP. */
5902 if (constop == significant)
5905 /* Otherwise, return an AND. See how much, if any, of X we can use. */
5906 else if (x == 0 || GET_CODE (x) != AND || GET_MODE (x) != mode)
5907 x = gen_rtx_combine (AND, mode, varop, GEN_INT (constop));
5911 if (GET_CODE (XEXP (x, 1)) != CONST_INT
5912 || INTVAL (XEXP (x, 1)) != constop)
5913 SUBST (XEXP (x, 1), GEN_INT (constop));
5915 SUBST (XEXP (x, 0), varop);
5921 /* Given an expression, X, compute which bits in X can be non-zero.
5922 We don't care about bits outside of those defined in MODE.
5924 For most X this is simply GET_MODE_MASK (GET_MODE (MODE)), but if X is
5925 a shift, AND, or zero_extract, we can do better. */
5927 static unsigned HOST_WIDE_INT
5928 significant_bits (x, mode)
5930 enum machine_mode mode;
5932 unsigned HOST_WIDE_INT significant = GET_MODE_MASK (mode);
5933 unsigned HOST_WIDE_INT inner_sig;
5935 int mode_width = GET_MODE_BITSIZE (mode);
5938 /* If X is wider than MODE, use its mode instead. */
5939 if (GET_MODE_BITSIZE (GET_MODE (x)) > mode_width)
5941 mode = GET_MODE (x);
5942 significant = GET_MODE_MASK (mode);
5943 mode_width = GET_MODE_BITSIZE (mode);
5946 if (mode_width > HOST_BITS_PER_WIDE_INT)
5947 /* Our only callers in this case look for single bit values. So
5948 just return the mode mask. Those tests will then be false. */
5951 code = GET_CODE (x);
5955 #ifdef STACK_BOUNDARY
5956 /* If this is the stack pointer, we may know something about its
5957 alignment. If PUSH_ROUNDING is defined, it is possible for the
5958 stack to be momentarily aligned only to that amount, so we pick
5959 the least alignment. */
5961 if (x == stack_pointer_rtx)
5963 int sp_alignment = STACK_BOUNDARY / BITS_PER_UNIT;
5965 #ifdef PUSH_ROUNDING
5966 sp_alignment = MIN (PUSH_ROUNDING (1), sp_alignment);
5969 return significant & ~ (sp_alignment - 1);
5973 /* If X is a register whose value we can find, use that value.
5974 Otherwise, use the previously-computed significant bits for this
5977 tem = get_last_value (x);
5979 return significant_bits (tem, mode);
5980 else if (significant_valid && reg_significant[REGNO (x)])
5981 return reg_significant[REGNO (x)] & significant;
5988 #ifdef BYTE_LOADS_ZERO_EXTEND
5990 /* In many, if not most, RISC machines, reading a byte from memory
5991 zeros the rest of the register. Noticing that fact saves a lot
5992 of extra zero-extends. */
5993 significant &= GET_MODE_MASK (GET_MODE (x));
5997 #if STORE_FLAG_VALUE == 1
6004 if (GET_MODE_CLASS (mode) == MODE_INT)
6007 /* A comparison operation only sets the bits given by its mode. The
6008 rest are set undefined. */
6009 if (GET_MODE_SIZE (GET_MODE (x)) < mode_width)
6010 significant |= (GET_MODE_MASK (mode) & ~ GET_MODE_MASK (GET_MODE (x)));
6015 if (num_sign_bit_copies (XEXP (x, 0), GET_MODE (x))
6016 == GET_MODE_BITSIZE (GET_MODE (x)))
6019 if (GET_MODE_SIZE (GET_MODE (x)) < mode_width)
6020 significant |= (GET_MODE_MASK (mode) & ~ GET_MODE_MASK (GET_MODE (x)));
6024 if (num_sign_bit_copies (XEXP (x, 0), GET_MODE (x))
6025 == GET_MODE_BITSIZE (GET_MODE (x)))
6030 significant &= (significant_bits (XEXP (x, 0), mode)
6031 & GET_MODE_MASK (mode));
6035 significant &= significant_bits (XEXP (x, 0), mode);
6036 if (GET_MODE (XEXP (x, 0)) != VOIDmode)
6037 significant &= GET_MODE_MASK (GET_MODE (XEXP (x, 0)));
6041 /* If the sign bit is known clear, this is the same as ZERO_EXTEND.
6042 Otherwise, show all the bits in the outer mode but not the inner
6044 inner_sig = significant_bits (XEXP (x, 0), mode);
6045 if (GET_MODE (XEXP (x, 0)) != VOIDmode)
6047 inner_sig &= GET_MODE_MASK (GET_MODE (XEXP (x, 0)));
6050 << (GET_MODE_BITSIZE (GET_MODE (XEXP (x, 0))) - 1))))
6051 inner_sig |= (GET_MODE_MASK (mode)
6052 & ~ GET_MODE_MASK (GET_MODE (XEXP (x, 0))));
6055 significant &= inner_sig;
6059 significant &= (significant_bits (XEXP (x, 0), mode)
6060 & significant_bits (XEXP (x, 1), mode));
6064 case UMIN: case UMAX: case SMIN: case SMAX:
6065 significant &= (significant_bits (XEXP (x, 0), mode)
6066 | significant_bits (XEXP (x, 1), mode));
6069 case PLUS: case MINUS:
6071 case DIV: case UDIV:
6072 case MOD: case UMOD:
6073 /* We can apply the rules of arithmetic to compute the number of
6074 high- and low-order zero bits of these operations. We start by
6075 computing the width (position of the highest-order non-zero bit)
6076 and the number of low-order zero bits for each value. */
6078 unsigned HOST_WIDE_INT sig0 = significant_bits (XEXP (x, 0), mode);
6079 unsigned HOST_WIDE_INT sig1 = significant_bits (XEXP (x, 1), mode);
6080 int width0 = floor_log2 (sig0) + 1;
6081 int width1 = floor_log2 (sig1) + 1;
6082 int low0 = floor_log2 (sig0 & -sig0);
6083 int low1 = floor_log2 (sig1 & -sig1);
6084 int op0_maybe_minusp = (sig0 & (1 << (mode_width - 1)));
6085 int op1_maybe_minusp = (sig1 & (1 << (mode_width - 1)));
6086 int result_width = mode_width;
6092 result_width = MAX (width0, width1) + 1;
6093 result_low = MIN (low0, low1);
6096 result_low = MIN (low0, low1);
6099 result_width = width0 + width1;
6100 result_low = low0 + low1;
6103 if (! op0_maybe_minusp && ! op1_maybe_minusp)
6104 result_width = width0;
6107 result_width = width0;
6110 if (! op0_maybe_minusp && ! op1_maybe_minusp)
6111 result_width = MIN (width0, width1);
6112 result_low = MIN (low0, low1);
6115 result_width = MIN (width0, width1);
6116 result_low = MIN (low0, low1);
6120 if (result_width < mode_width)
6121 significant &= ((HOST_WIDE_INT) 1 << result_width) - 1;
6124 significant &= ~ (((HOST_WIDE_INT) 1 << result_low) - 1);
6129 if (GET_CODE (XEXP (x, 1)) == CONST_INT
6130 && INTVAL (XEXP (x, 1)) < HOST_BITS_PER_WIDE_INT)
6131 significant &= ((HOST_WIDE_INT) 1 << INTVAL (XEXP (x, 1))) - 1;
6135 /* If this is a SUBREG formed for a promoted variable that has
6136 been zero-extended, we know that at least the high-order bits
6137 are zero, though others might be too. */
6139 if (SUBREG_PROMOTED_VAR_P (x) && SUBREG_PROMOTED_UNSIGNED_P (x))
6140 significant = (GET_MODE_MASK (GET_MODE (x))
6141 & significant_bits (SUBREG_REG (x), GET_MODE (x)));
6143 /* If the inner mode is a single word for both the host and target
6144 machines, we can compute this from which bits of the inner
6145 object are known significant. */
6146 if (GET_MODE_BITSIZE (GET_MODE (SUBREG_REG (x))) <= BITS_PER_WORD
6147 && (GET_MODE_BITSIZE (GET_MODE (SUBREG_REG (x)))
6148 <= HOST_BITS_PER_WIDE_INT))
6150 significant &= significant_bits (SUBREG_REG (x), mode);
6151 #if ! defined(BYTE_LOADS_ZERO_EXTEND) && ! defined(BYTE_LOADS_SIGN_EXTEND)
6152 /* On many CISC machines, accessing an object in a wider mode
6153 causes the high-order bits to become undefined. So they are
6154 not known to be zero. */
6155 if (GET_MODE_SIZE (GET_MODE (x))
6156 > GET_MODE_SIZE (GET_MODE (SUBREG_REG (x))))
6157 significant |= (GET_MODE_MASK (GET_MODE (x))
6158 & ~ GET_MODE_MASK (GET_MODE (SUBREG_REG (x))));
6168 /* The significant bits are in two classes: any bits within MODE
6169 that aren't in GET_MODE (x) are always significant. The rest of the
6170 significant bits are those that are significant in the operand of
6171 the shift when shifted the appropriate number of bits. This
6172 shows that high-order bits are cleared by the right shift and
6173 low-order bits by left shifts. */
6174 if (GET_CODE (XEXP (x, 1)) == CONST_INT
6175 && INTVAL (XEXP (x, 1)) >= 0
6176 && INTVAL (XEXP (x, 1)) < HOST_BITS_PER_WIDE_INT)
6178 enum machine_mode inner_mode = GET_MODE (x);
6179 int width = GET_MODE_BITSIZE (inner_mode);
6180 int count = INTVAL (XEXP (x, 1));
6181 unsigned HOST_WIDE_INT mode_mask = GET_MODE_MASK (inner_mode);
6182 unsigned HOST_WIDE_INT op_significant
6183 = significant_bits (XEXP (x, 0), mode);
6184 unsigned HOST_WIDE_INT inner = op_significant & mode_mask;
6185 unsigned HOST_WIDE_INT outer = 0;
6187 if (mode_width > width)
6188 outer = (op_significant & significant & ~ mode_mask);
6190 if (code == LSHIFTRT)
6192 else if (code == ASHIFTRT)
6196 /* If the sign bit was significant at before the shift, we
6197 need to mark all the places it could have been copied to
6198 by the shift significant. */
6199 if (inner & ((HOST_WIDE_INT) 1 << (width - 1 - count)))
6200 inner |= (((HOST_WIDE_INT) 1 << count) - 1) << (width - count);
6202 else if (code == LSHIFT || code == ASHIFT)
6205 inner = ((inner << (count % width)
6206 | (inner >> (width - (count % width)))) & mode_mask);
6208 significant &= (outer | inner);
6213 /* This is at most the number of bits in the mode. */
6214 significant = ((HOST_WIDE_INT) 1 << (floor_log2 (mode_width) + 1)) - 1;
6218 significant &= (significant_bits (XEXP (x, 1), mode)
6219 | significant_bits (XEXP (x, 2), mode));
6226 /* Return the number of bits at the high-order end of X that are known to
6227 be equal to the sign bit. This number will always be between 1 and
6228 the number of bits in the mode of X. MODE is the mode to be used
6229 if X is VOIDmode. */
6232 num_sign_bit_copies (x, mode)
6234 enum machine_mode mode;
6236 enum rtx_code code = GET_CODE (x);
6238 int num0, num1, result;
6239 unsigned HOST_WIDE_INT sig;
6242 /* If we weren't given a mode, use the mode of X. If the mode is still
6243 VOIDmode, we don't know anything. */
6245 if (mode == VOIDmode)
6246 mode = GET_MODE (x);
6248 if (mode == VOIDmode)
6251 bitwidth = GET_MODE_BITSIZE (mode);
6256 if (significant_valid && reg_sign_bit_copies[REGNO (x)] != 0)
6257 return reg_sign_bit_copies[REGNO (x)];
6259 tem = get_last_value (x);
6261 return num_sign_bit_copies (tem, mode);
6264 #ifdef BYTE_LOADS_SIGN_EXTEND
6266 /* Some RISC machines sign-extend all loads of smaller than a word. */
6267 return MAX (1, bitwidth - GET_MODE_BITSIZE (GET_MODE (x)) + 1);
6271 /* If the constant is negative, take its 1's complement and remask.
6272 Then see how many zero bits we have. */
6273 sig = INTVAL (x) & GET_MODE_MASK (mode);
6274 if (bitwidth <= HOST_BITS_PER_WIDE_INT
6275 && (sig & ((HOST_WIDE_INT) 1 << (bitwidth - 1))) != 0)
6276 sig = (~ sig) & GET_MODE_MASK (mode);
6278 return (sig == 0 ? bitwidth : bitwidth - floor_log2 (sig) - 1);
6281 /* If this is a SUBREG for a promoted object that is sign-extended
6282 and we are looking at it in a wider mode, we know that at least the
6283 high-order bits are known to be sign bit copies. */
6285 if (SUBREG_PROMOTED_VAR_P (x) && ! SUBREG_PROMOTED_UNSIGNED_P (x))
6286 return (GET_MODE_BITSIZE (mode) - GET_MODE_BITSIZE (GET_MODE (x))
6287 + num_sign_bit_copies (SUBREG_REG (x), GET_MODE (x)));
6289 /* For a smaller object, just ignore the high bits. */
6290 if (bitwidth <= GET_MODE_BITSIZE (GET_MODE (SUBREG_REG (x))))
6292 num0 = num_sign_bit_copies (SUBREG_REG (x), VOIDmode);
6293 return MAX (1, (num0
6294 - (GET_MODE_BITSIZE (GET_MODE (SUBREG_REG (x)))
6298 #if defined(BYTE_LOADS_ZERO_EXTEND) || defined(BYTE_LOADS_SIGN_EXTEND)
6299 /* For paradoxical SUBREGs, just look inside since, on machines with
6300 one of these defined, we assume that operations are actually
6301 performed on the full register. Note that we are passing MODE
6302 to the recursive call, so the number of sign bit copies will
6303 remain relative to that mode, not the inner mode. */
6305 if (GET_MODE_SIZE (GET_MODE (x))
6306 > GET_MODE_SIZE (GET_MODE (SUBREG_REG (x))))
6307 return num_sign_bit_copies (SUBREG_REG (x), mode);
6313 if (GET_CODE (XEXP (x, 1)) == CONST_INT)
6314 return MAX (1, bitwidth - INTVAL (XEXP (x, 1)));
6318 return (bitwidth - GET_MODE_BITSIZE (GET_MODE (XEXP (x, 0)))
6319 + num_sign_bit_copies (XEXP (x, 0), VOIDmode));
6322 /* For a smaller object, just ignore the high bits. */
6323 num0 = num_sign_bit_copies (XEXP (x, 0), VOIDmode);
6324 return MAX (1, (num0 - (GET_MODE_BITSIZE (GET_MODE (XEXP (x, 0)))
6328 return num_sign_bit_copies (XEXP (x, 0), mode);
6330 case ROTATE: case ROTATERT:
6331 /* If we are rotating left by a number of bits less than the number
6332 of sign bit copies, we can just subtract that amount from the
6334 if (GET_CODE (XEXP (x, 1)) == CONST_INT
6335 && INTVAL (XEXP (x, 1)) >= 0 && INTVAL (XEXP (x, 1)) < bitwidth)
6337 num0 = num_sign_bit_copies (XEXP (x, 0), mode);
6338 return MAX (1, num0 - (code == ROTATE ? INTVAL (XEXP (x, 1))
6339 : bitwidth - INTVAL (XEXP (x, 1))));
6344 /* In general, this subtracts one sign bit copy. But if the value
6345 is known to be positive, the number of sign bit copies is the
6346 same as that of the input. Finally, if the input has just one
6347 significant bit, all the bits are copies of the sign bit. */
6348 sig = significant_bits (XEXP (x, 0), mode);
6352 num0 = num_sign_bit_copies (XEXP (x, 0), mode);
6354 && bitwidth <= HOST_BITS_PER_WIDE_INT
6355 && (((HOST_WIDE_INT) 1 << (bitwidth - 1)) & sig))
6360 case IOR: case AND: case XOR:
6361 case SMIN: case SMAX: case UMIN: case UMAX:
6362 /* Logical operations will preserve the number of sign-bit copies.
6363 MIN and MAX operations always return one of the operands. */
6364 num0 = num_sign_bit_copies (XEXP (x, 0), mode);
6365 num1 = num_sign_bit_copies (XEXP (x, 1), mode);
6366 return MIN (num0, num1);
6368 case PLUS: case MINUS:
6369 /* For addition and subtraction, we can have a 1-bit carry. However,
6370 if we are subtracting 1 from a positive number, there will not
6371 be such a carry. Furthermore, if the positive number is known to
6372 be 0 or 1, we know the result is either -1 or 0. */
6374 if (code == PLUS && XEXP (x, 1) == constm1_rtx
6375 /* Don't do this if XEXP (x, 0) is a paradoxical subreg
6376 because in principle we don't know what the high bits are. */
6377 && !(GET_CODE (XEXP (x, 0)) == SUBREG
6378 && (GET_MODE_SIZE (GET_MODE (XEXP (XEXP (x, 0), 0)))
6379 < GET_MODE_SIZE (GET_MODE (XEXP (x, 0))))))
6381 sig = significant_bits (XEXP (x, 0), mode);
6382 if ((((HOST_WIDE_INT) 1 << (bitwidth - 1)) & sig) == 0)
6383 return (sig == 1 || sig == 0 ? bitwidth
6384 : bitwidth - floor_log2 (sig) - 1);
6387 num0 = num_sign_bit_copies (XEXP (x, 0), mode);
6388 num1 = num_sign_bit_copies (XEXP (x, 1), mode);
6389 return MAX (1, MIN (num0, num1) - 1);
6392 /* The number of bits of the product is the sum of the number of
6393 bits of both terms. However, unless one of the terms if known
6394 to be positive, we must allow for an additional bit since negating
6395 a negative number can remove one sign bit copy. */
6397 num0 = num_sign_bit_copies (XEXP (x, 0), mode);
6398 num1 = num_sign_bit_copies (XEXP (x, 1), mode);
6400 result = bitwidth - (bitwidth - num0) - (bitwidth - num1);
6402 && bitwidth <= HOST_BITS_PER_INT
6403 && ((significant_bits (XEXP (x, 0), mode)
6404 & ((HOST_WIDE_INT) 1 << (bitwidth - 1))) != 0)
6405 && (significant_bits (XEXP (x, 1), mode)
6406 & ((HOST_WIDE_INT) 1 << (bitwidth - 1)) != 0))
6409 return MAX (1, result);
6412 /* The result must be <= the first operand. */
6413 return num_sign_bit_copies (XEXP (x, 0), mode);
6416 /* The result must be <= the scond operand. */
6417 return num_sign_bit_copies (XEXP (x, 1), mode);
6420 /* Similar to unsigned division, except that we have to worry about
6421 the case where the divisor is negative, in which case we have
6423 result = num_sign_bit_copies (XEXP (x, 0), mode);
6425 && bitwidth <= HOST_BITS_PER_WIDE_INT
6426 && (significant_bits (XEXP (x, 1), mode)
6427 & ((HOST_WIDE_INT) 1 << (bitwidth - 1))) != 0)
6433 result = num_sign_bit_copies (XEXP (x, 1), mode);
6435 && bitwidth <= HOST_BITS_PER_WIDE_INT
6436 && (significant_bits (XEXP (x, 1), mode)
6437 & ((HOST_WIDE_INT) 1 << (bitwidth - 1))) != 0)
6443 /* Shifts by a constant add to the number of bits equal to the
6445 num0 = num_sign_bit_copies (XEXP (x, 0), mode);
6446 if (GET_CODE (XEXP (x, 1)) == CONST_INT
6447 && INTVAL (XEXP (x, 1)) > 0)
6448 num0 = MIN (bitwidth, num0 + INTVAL (XEXP (x, 1)));
6454 /* Left shifts destroy copies. */
6455 if (GET_CODE (XEXP (x, 1)) != CONST_INT
6456 || INTVAL (XEXP (x, 1)) < 0
6457 || INTVAL (XEXP (x, 1)) >= bitwidth)
6460 num0 = num_sign_bit_copies (XEXP (x, 0), mode);
6461 return MAX (1, num0 - INTVAL (XEXP (x, 1)));
6464 num0 = num_sign_bit_copies (XEXP (x, 1), mode);
6465 num1 = num_sign_bit_copies (XEXP (x, 2), mode);
6466 return MIN (num0, num1);
6468 #if STORE_FLAG_VALUE == -1
6469 case EQ: case NE: case GE: case GT: case LE: case LT:
6470 case GEU: case GTU: case LEU: case LTU:
6475 /* If we haven't been able to figure it out by one of the above rules,
6476 see if some of the high-order bits are known to be zero. If so,
6477 count those bits and return one less than that amount. If we can't
6478 safely compute the mask for this mode, always return BITWIDTH. */
6480 if (bitwidth > HOST_BITS_PER_WIDE_INT)
6483 sig = significant_bits (x, mode);
6484 return sig == GET_MODE_MASK (mode) ? 1 : bitwidth - floor_log2 (sig) - 1;
6487 /* Return the number of "extended" bits there are in X, when interpreted
6488 as a quantity in MODE whose signedness is indicated by UNSIGNEDP. For
6489 unsigned quantities, this is the number of high-order zero bits.
6490 For signed quantities, this is the number of copies of the sign bit
6491 minus 1. In both case, this function returns the number of "spare"
6492 bits. For example, if two quantities for which this function returns
6493 at least 1 are added, the addition is known not to overflow.
6495 This function will always return 0 unless called during combine, which
6496 implies that it must be called from a define_split. */
6499 extended_count (x, mode, unsignedp)
6501 enum machine_mode mode;
6504 if (significant_valid == 0)
6508 ? (GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT
6509 && (GET_MODE_BITSIZE (mode) - 1
6510 - floor_log2 (significant_bits (x, mode))))
6511 : num_sign_bit_copies (x, mode) - 1);
6514 /* This function is called from `simplify_shift_const' to merge two
6515 outer operations. Specifically, we have already found that we need
6516 to perform operation *POP0 with constant *PCONST0 at the outermost
6517 position. We would now like to also perform OP1 with constant CONST1
6518 (with *POP0 being done last).
6520 Return 1 if we can do the operation and update *POP0 and *PCONST0 with
6521 the resulting operation. *PCOMP_P is set to 1 if we would need to
6522 complement the innermost operand, otherwise it is unchanged.
6524 MODE is the mode in which the operation will be done. No bits outside
6525 the width of this mode matter. It is assumed that the width of this mode
6526 is smaller than or equal to HOST_BITS_PER_WIDE_INT.
6528 If *POP0 or OP1 are NIL, it means no operation is required. Only NEG, PLUS,
6529 IOR, XOR, and AND are supported. We may set *POP0 to SET if the proper
6530 result is simply *PCONST0.
6532 If the resulting operation cannot be expressed as one operation, we
6533 return 0 and do not change *POP0, *PCONST0, and *PCOMP_P. */
6536 merge_outer_ops (pop0, pconst0, op1, const1, mode, pcomp_p)
6537 enum rtx_code *pop0;
6538 HOST_WIDE_INT *pconst0;
6540 HOST_WIDE_INT const1;
6541 enum machine_mode mode;
6544 enum rtx_code op0 = *pop0;
6545 HOST_WIDE_INT const0 = *pconst0;
6547 const0 &= GET_MODE_MASK (mode);
6548 const1 &= GET_MODE_MASK (mode);
6550 /* If OP0 is an AND, clear unimportant bits in CONST1. */
6554 /* If OP0 or OP1 is NIL, this is easy. Similarly if they are the same or
6557 if (op1 == NIL || op0 == SET)
6560 else if (op0 == NIL)
6561 op0 = op1, const0 = const1;
6563 else if (op0 == op1)
6585 /* Otherwise, if either is a PLUS or NEG, we can't do anything. */
6586 else if (op0 == PLUS || op1 == PLUS || op0 == NEG || op1 == NEG)
6589 /* If the two constants aren't the same, we can't do anything. The
6590 remaining six cases can all be done. */
6591 else if (const0 != const1)
6599 /* (a & b) | b == b */
6601 else /* op1 == XOR */
6602 /* (a ^ b) | b == a | b */
6608 /* (a & b) ^ b == (~a) & b */
6609 op0 = AND, *pcomp_p = 1;
6610 else /* op1 == IOR */
6611 /* (a | b) ^ b == a & ~b */
6612 op0 = AND, *pconst0 = ~ const0;
6617 /* (a | b) & b == b */
6619 else /* op1 == XOR */
6620 /* (a ^ b) & b) == (~a) & b */
6625 /* Check for NO-OP cases. */
6626 const0 &= GET_MODE_MASK (mode);
6628 && (op0 == IOR || op0 == XOR || op0 == PLUS))
6630 else if (const0 == 0 && op0 == AND)
6632 else if (const0 == GET_MODE_MASK (mode) && op0 == AND)
6641 /* Simplify a shift of VAROP by COUNT bits. CODE says what kind of shift.
6642 The result of the shift is RESULT_MODE. X, if non-zero, is an expression
6643 that we started with.
6645 The shift is normally computed in the widest mode we find in VAROP, as
6646 long as it isn't a different number of words than RESULT_MODE. Exceptions
6647 are ASHIFTRT and ROTATE, which are always done in their original mode, */
6650 simplify_shift_const (x, code, result_mode, varop, count)
6653 enum machine_mode result_mode;
6657 enum rtx_code orig_code = code;
6658 int orig_count = count;
6659 enum machine_mode mode = result_mode;
6660 enum machine_mode shift_mode, tmode;
6662 = (GET_MODE_SIZE (mode) + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD;
6663 /* We form (outer_op (code varop count) (outer_const)). */
6664 enum rtx_code outer_op = NIL;
6665 HOST_WIDE_INT outer_const;
6667 int complement_p = 0;
6670 /* If we were given an invalid count, don't do anything except exactly
6671 what was requested. */
6673 if (count < 0 || count > GET_MODE_BITSIZE (mode))
6678 return gen_rtx (code, mode, varop, GEN_INT (count));
6681 /* Unless one of the branches of the `if' in this loop does a `continue',
6682 we will `break' the loop after the `if'. */
6686 /* If we have an operand of (clobber (const_int 0)), just return that
6688 if (GET_CODE (varop) == CLOBBER)
6691 /* If we discovered we had to complement VAROP, leave. Making a NOT
6692 here would cause an infinite loop. */
6696 /* Convert ROTATETRT to ROTATE. */
6697 if (code == ROTATERT)
6698 code = ROTATE, count = GET_MODE_BITSIZE (result_mode) - count;
6700 /* Canonicalize LSHIFT to ASHIFT. */
6704 /* We need to determine what mode we will do the shift in. If the
6705 shift is a ASHIFTRT or ROTATE, we must always do it in the mode it
6706 was originally done in. Otherwise, we can do it in MODE, the widest
6707 mode encountered. */
6708 shift_mode = (code == ASHIFTRT || code == ROTATE ? result_mode : mode);
6710 /* Handle cases where the count is greater than the size of the mode
6711 minus 1. For ASHIFT, use the size minus one as the count (this can
6712 occur when simplifying (lshiftrt (ashiftrt ..))). For rotates,
6713 take the count modulo the size. For other shifts, the result is
6716 Since these shifts are being produced by the compiler by combining
6717 multiple operations, each of which are defined, we know what the
6718 result is supposed to be. */
6720 if (count > GET_MODE_BITSIZE (shift_mode) - 1)
6722 if (code == ASHIFTRT)
6723 count = GET_MODE_BITSIZE (shift_mode) - 1;
6724 else if (code == ROTATE || code == ROTATERT)
6725 count %= GET_MODE_BITSIZE (shift_mode);
6728 /* We can't simply return zero because there may be an
6736 /* Negative counts are invalid and should not have been made (a
6737 programmer-specified negative count should have been handled
6742 /* An arithmetic right shift of a quantity known to be -1 or 0
6744 if (code == ASHIFTRT
6745 && (num_sign_bit_copies (varop, shift_mode)
6746 == GET_MODE_BITSIZE (shift_mode)))
6752 /* We simplify the tests below and elsewhere by converting
6753 ASHIFTRT to LSHIFTRT if we know the sign bit is clear.
6754 `make_compound_operation' will convert it to a ASHIFTRT for
6755 those machines (such as Vax) that don't have a LSHIFTRT. */
6756 if (GET_MODE_BITSIZE (shift_mode) <= HOST_BITS_PER_WIDE_INT
6758 && ((significant_bits (varop, shift_mode)
6759 & ((HOST_WIDE_INT) 1 << (GET_MODE_BITSIZE (shift_mode) - 1)))
6763 switch (GET_CODE (varop))
6769 new = expand_compound_operation (varop);
6778 /* If we have (xshiftrt (mem ...) C) and C is MODE_WIDTH
6779 minus the width of a smaller mode, we can do this with a
6780 SIGN_EXTEND or ZERO_EXTEND from the narrower memory location. */
6781 if ((code == ASHIFTRT || code == LSHIFTRT)
6782 && ! mode_dependent_address_p (XEXP (varop, 0))
6783 && ! MEM_VOLATILE_P (varop)
6784 && (tmode = mode_for_size (GET_MODE_BITSIZE (mode) - count,
6785 MODE_INT, 1)) != BLKmode)
6787 #if BYTES_BIG_ENDIAN
6788 new = gen_rtx (MEM, tmode, XEXP (varop, 0));
6790 new = gen_rtx (MEM, tmode,
6791 plus_constant (XEXP (varop, 0),
6792 count / BITS_PER_UNIT));
6793 RTX_UNCHANGING_P (new) = RTX_UNCHANGING_P (varop);
6794 MEM_VOLATILE_P (new) = MEM_VOLATILE_P (varop);
6795 MEM_IN_STRUCT_P (new) = MEM_IN_STRUCT_P (varop);
6797 varop = gen_rtx_combine (code == ASHIFTRT ? SIGN_EXTEND
6798 : ZERO_EXTEND, mode, new);
6805 /* Similar to the case above, except that we can only do this if
6806 the resulting mode is the same as that of the underlying
6807 MEM and adjust the address depending on the *bits* endianness
6808 because of the way that bit-field extract insns are defined. */
6809 if ((code == ASHIFTRT || code == LSHIFTRT)
6810 && (tmode = mode_for_size (GET_MODE_BITSIZE (mode) - count,
6811 MODE_INT, 1)) != BLKmode
6812 && tmode == GET_MODE (XEXP (varop, 0)))
6815 new = XEXP (varop, 0);
6817 new = copy_rtx (XEXP (varop, 0));
6818 SUBST (XEXP (new, 0),
6819 plus_constant (XEXP (new, 0),
6820 count / BITS_PER_UNIT));
6823 varop = gen_rtx_combine (code == ASHIFTRT ? SIGN_EXTEND
6824 : ZERO_EXTEND, mode, new);
6831 /* If VAROP is a SUBREG, strip it as long as the inner operand has
6832 the same number of words as what we've seen so far. Then store
6833 the widest mode in MODE. */
6834 if (subreg_lowpart_p (varop)
6835 && (GET_MODE_SIZE (GET_MODE (SUBREG_REG (varop)))
6836 > GET_MODE_SIZE (GET_MODE (varop)))
6837 && (((GET_MODE_SIZE (GET_MODE (SUBREG_REG (varop)))
6838 + (UNITS_PER_WORD - 1)) / UNITS_PER_WORD)
6841 varop = SUBREG_REG (varop);
6842 if (GET_MODE_SIZE (GET_MODE (varop)) > GET_MODE_SIZE (mode))
6843 mode = GET_MODE (varop);
6849 /* Some machines use MULT instead of ASHIFT because MULT
6850 is cheaper. But it is still better on those machines to
6851 merge two shifts into one. */
6852 if (GET_CODE (XEXP (varop, 1)) == CONST_INT
6853 && exact_log2 (INTVAL (XEXP (varop, 1))) >= 0)
6855 varop = gen_binary (ASHIFT, GET_MODE (varop), XEXP (varop, 0),
6856 GEN_INT (exact_log2 (INTVAL (XEXP (varop, 1)))));;
6862 /* Similar, for when divides are cheaper. */
6863 if (GET_CODE (XEXP (varop, 1)) == CONST_INT
6864 && exact_log2 (INTVAL (XEXP (varop, 1))) >= 0)
6866 varop = gen_binary (LSHIFTRT, GET_MODE (varop), XEXP (varop, 0),
6867 GEN_INT (exact_log2 (INTVAL (XEXP (varop, 1)))));
6873 /* If we are extracting just the sign bit of an arithmetic right
6874 shift, that shift is not needed. */
6875 if (code == LSHIFTRT && count == GET_MODE_BITSIZE (result_mode) - 1)
6877 varop = XEXP (varop, 0);
6881 /* ... fall through ... */
6887 /* Here we have two nested shifts. The result is usually the
6888 AND of a new shift with a mask. We compute the result below. */
6889 if (GET_CODE (XEXP (varop, 1)) == CONST_INT
6890 && INTVAL (XEXP (varop, 1)) >= 0
6891 && INTVAL (XEXP (varop, 1)) < GET_MODE_BITSIZE (GET_MODE (varop))
6892 && GET_MODE_BITSIZE (result_mode) <= HOST_BITS_PER_WIDE_INT
6893 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
6895 enum rtx_code first_code = GET_CODE (varop);
6896 int first_count = INTVAL (XEXP (varop, 1));
6897 unsigned HOST_WIDE_INT mask;
6901 if (first_code == LSHIFT)
6902 first_code = ASHIFT;
6904 /* We have one common special case. We can't do any merging if
6905 the inner code is an ASHIFTRT of a smaller mode. However, if
6906 we have (ashift:M1 (subreg:M1 (ashiftrt:M2 FOO C1) 0) C2)
6907 with C2 == GET_MODE_BITSIZE (M1) - GET_MODE_BITSIZE (M2),
6908 we can convert it to
6909 (ashiftrt:M1 (ashift:M1 (and:M1 (subreg:M1 FOO 0 C2) C3) C1).
6910 This simplifies certain SIGN_EXTEND operations. */
6911 if (code == ASHIFT && first_code == ASHIFTRT
6912 && (GET_MODE_BITSIZE (result_mode)
6913 - GET_MODE_BITSIZE (GET_MODE (varop))) == count)
6915 /* C3 has the low-order C1 bits zero. */
6917 mask = (GET_MODE_MASK (mode)
6918 & ~ (((HOST_WIDE_INT) 1 << first_count) - 1));
6920 varop = simplify_and_const_int (NULL_RTX, result_mode,
6921 XEXP (varop, 0), mask);
6922 varop = simplify_shift_const (NULL_RTX, ASHIFT, result_mode,
6924 count = first_count;
6929 /* If this was (ashiftrt (ashift foo C1) C2) and FOO has more
6930 than C1 high-order bits equal to the sign bit, we can convert
6931 this to either an ASHIFT or a ASHIFTRT depending on the
6934 We cannot do this if VAROP's mode is not SHIFT_MODE. */
6936 if (code == ASHIFTRT && first_code == ASHIFT
6937 && GET_MODE (varop) == shift_mode
6938 && (num_sign_bit_copies (XEXP (varop, 0), shift_mode)
6941 count -= first_count;
6943 count = - count, code = ASHIFT;
6944 varop = XEXP (varop, 0);
6948 /* There are some cases we can't do. If CODE is ASHIFTRT,
6949 we can only do this if FIRST_CODE is also ASHIFTRT.
6951 We can't do the case when CODE is ROTATE and FIRST_CODE is
6954 If the mode of this shift is not the mode of the outer shift,
6955 we can't do this if either shift is ASHIFTRT or ROTATE.
6957 Finally, we can't do any of these if the mode is too wide
6958 unless the codes are the same.
6960 Handle the case where the shift codes are the same
6963 if (code == first_code)
6965 if (GET_MODE (varop) != result_mode
6966 && (code == ASHIFTRT || code == ROTATE))
6969 count += first_count;
6970 varop = XEXP (varop, 0);
6974 if (code == ASHIFTRT
6975 || (code == ROTATE && first_code == ASHIFTRT)
6976 || GET_MODE_BITSIZE (mode) > HOST_BITS_PER_WIDE_INT
6977 || (GET_MODE (varop) != result_mode
6978 && (first_code == ASHIFTRT || first_code == ROTATE
6979 || code == ROTATE)))
6982 /* To compute the mask to apply after the shift, shift the
6983 significant bits of the inner shift the same way the
6984 outer shift will. */
6986 mask_rtx = GEN_INT (significant_bits (varop, GET_MODE (varop)));
6989 = simplify_binary_operation (code, result_mode, mask_rtx,
6992 /* Give up if we can't compute an outer operation to use. */
6994 || GET_CODE (mask_rtx) != CONST_INT
6995 || ! merge_outer_ops (&outer_op, &outer_const, AND,
6997 result_mode, &complement_p))
7000 /* If the shifts are in the same direction, we add the
7001 counts. Otherwise, we subtract them. */
7002 if ((code == ASHIFTRT || code == LSHIFTRT)
7003 == (first_code == ASHIFTRT || first_code == LSHIFTRT))
7004 count += first_count;
7006 count -= first_count;
7008 /* If COUNT is positive, the new shift is usually CODE,
7009 except for the two exceptions below, in which case it is
7010 FIRST_CODE. If the count is negative, FIRST_CODE should
7013 && ((first_code == ROTATE && code == ASHIFT)
7014 || (first_code == ASHIFTRT && code == LSHIFTRT)))
7017 code = first_code, count = - count;
7019 varop = XEXP (varop, 0);
7023 /* If we have (A << B << C) for any shift, we can convert this to
7024 (A << C << B). This wins if A is a constant. Only try this if
7025 B is not a constant. */
7027 else if (GET_CODE (varop) == code
7028 && GET_CODE (XEXP (varop, 1)) != CONST_INT
7030 = simplify_binary_operation (code, mode,
7034 varop = gen_rtx_combine (code, mode, new, XEXP (varop, 1));
7041 /* Make this fit the case below. */
7042 varop = gen_rtx_combine (XOR, mode, XEXP (varop, 0),
7043 GEN_INT (GET_MODE_MASK (mode)));
7049 /* If we have (xshiftrt (ior (plus X (const_int -1)) X) C)
7050 with C the size of VAROP - 1 and the shift is logical if
7051 STORE_FLAG_VALUE is 1 and arithmetic if STORE_FLAG_VALUE is -1,
7052 we have an (le X 0) operation. If we have an arithmetic shift
7053 and STORE_FLAG_VALUE is 1 or we have a logical shift with
7054 STORE_FLAG_VALUE of -1, we have a (neg (le X 0)) operation. */
7056 if (GET_CODE (varop) == IOR && GET_CODE (XEXP (varop, 0)) == PLUS
7057 && XEXP (XEXP (varop, 0), 1) == constm1_rtx
7058 && (STORE_FLAG_VALUE == 1 || STORE_FLAG_VALUE == -1)
7059 && (code == LSHIFTRT || code == ASHIFTRT)
7060 && count == GET_MODE_BITSIZE (GET_MODE (varop)) - 1
7061 && rtx_equal_p (XEXP (XEXP (varop, 0), 0), XEXP (varop, 1)))
7064 varop = gen_rtx_combine (LE, GET_MODE (varop), XEXP (varop, 1),
7067 if (STORE_FLAG_VALUE == 1 ? code == ASHIFTRT : code == LSHIFTRT)
7068 varop = gen_rtx_combine (NEG, GET_MODE (varop), varop);
7073 /* If we have (shift (logical)), move the logical to the outside
7074 to allow it to possibly combine with another logical and the
7075 shift to combine with another shift. This also canonicalizes to
7076 what a ZERO_EXTRACT looks like. Also, some machines have
7077 (and (shift)) insns. */
7079 if (GET_CODE (XEXP (varop, 1)) == CONST_INT
7080 && (new = simplify_binary_operation (code, result_mode,
7082 GEN_INT (count))) != 0
7083 && merge_outer_ops (&outer_op, &outer_const, GET_CODE (varop),
7084 INTVAL (new), result_mode, &complement_p))
7086 varop = XEXP (varop, 0);
7090 /* If we can't do that, try to simplify the shift in each arm of the
7091 logical expression, make a new logical expression, and apply
7092 the inverse distributive law. */
7094 rtx lhs = simplify_shift_const (NULL_RTX, code, result_mode,
7095 XEXP (varop, 0), count);
7096 rtx rhs = simplify_shift_const (NULL_RTX, code, result_mode,
7097 XEXP (varop, 1), count);
7099 varop = gen_binary (GET_CODE (varop), result_mode, lhs, rhs);
7100 varop = apply_distributive_law (varop);
7107 /* convert (lshift (eq FOO 0) C) to (xor FOO 1) if STORE_FLAG_VALUE
7108 says that the sign bit can be tested, FOO has mode MODE, C is
7109 GET_MODE_BITSIZE (MODE) - 1, and FOO has only the low-order bit
7112 && XEXP (varop, 1) == const0_rtx
7113 && GET_MODE (XEXP (varop, 0)) == result_mode
7114 && count == GET_MODE_BITSIZE (result_mode) - 1
7115 && GET_MODE_BITSIZE (result_mode) <= HOST_BITS_PER_WIDE_INT
7116 && ((STORE_FLAG_VALUE
7117 & ((HOST_WIDE_INT) 1 << (GET_MODE_BITSIZE (result_mode) - 1))))
7118 && significant_bits (XEXP (varop, 0), result_mode) == 1
7119 && merge_outer_ops (&outer_op, &outer_const, XOR,
7120 (HOST_WIDE_INT) 1, result_mode,
7123 varop = XEXP (varop, 0);
7130 /* (lshiftrt (neg A) C) where A is either 0 or 1 and C is one less
7131 than the number of bits in the mode is equivalent to A. */
7132 if (code == LSHIFTRT && count == GET_MODE_BITSIZE (result_mode) - 1
7133 && significant_bits (XEXP (varop, 0), result_mode) == 1)
7135 varop = XEXP (varop, 0);
7140 /* NEG commutes with ASHIFT since it is multiplication. Move the
7141 NEG outside to allow shifts to combine. */
7143 && merge_outer_ops (&outer_op, &outer_const, NEG,
7144 (HOST_WIDE_INT) 0, result_mode,
7147 varop = XEXP (varop, 0);
7153 /* (lshiftrt (plus A -1) C) where A is either 0 or 1 and C
7154 is one less than the number of bits in the mode is
7155 equivalent to (xor A 1). */
7156 if (code == LSHIFTRT && count == GET_MODE_BITSIZE (result_mode) - 1
7157 && XEXP (varop, 1) == constm1_rtx
7158 && significant_bits (XEXP (varop, 0), result_mode) == 1
7159 && merge_outer_ops (&outer_op, &outer_const, XOR,
7160 (HOST_WIDE_INT) 1, result_mode,
7164 varop = XEXP (varop, 0);
7168 /* If we have (xshiftrt (plus FOO BAR) C), and the only bits
7169 significant in BAR are those being shifted out and those
7170 bits are known zero in FOO, we can replace the PLUS with FOO.
7171 Similarly in the other operand order. This code occurs when
7172 we are computing the size of a variable-size array. */
7174 if ((code == ASHIFTRT || code == LSHIFTRT)
7175 && count < HOST_BITS_PER_WIDE_INT
7176 && significant_bits (XEXP (varop, 1), result_mode) >> count == 0
7177 && (significant_bits (XEXP (varop, 1), result_mode)
7178 & significant_bits (XEXP (varop, 0), result_mode)) == 0)
7180 varop = XEXP (varop, 0);
7183 else if ((code == ASHIFTRT || code == LSHIFTRT)
7184 && count < HOST_BITS_PER_WIDE_INT
7185 && GET_MODE_BITSIZE (result_mode) <= HOST_BITS_PER_WIDE_INT
7186 && 0 == (significant_bits (XEXP (varop, 0), result_mode)
7188 && 0 == (significant_bits (XEXP (varop, 0), result_mode)
7189 & significant_bits (XEXP (varop, 1),
7192 varop = XEXP (varop, 1);
7196 /* (ashift (plus foo C) N) is (plus (ashift foo N) C'). */
7198 && GET_CODE (XEXP (varop, 1)) == CONST_INT
7199 && (new = simplify_binary_operation (ASHIFT, result_mode,
7201 GEN_INT (count))) != 0
7202 && merge_outer_ops (&outer_op, &outer_const, PLUS,
7203 INTVAL (new), result_mode, &complement_p))
7205 varop = XEXP (varop, 0);
7211 /* If we have (xshiftrt (minus (ashiftrt X C)) X) C)
7212 with C the size of VAROP - 1 and the shift is logical if
7213 STORE_FLAG_VALUE is 1 and arithmetic if STORE_FLAG_VALUE is -1,
7214 we have a (gt X 0) operation. If the shift is arithmetic with
7215 STORE_FLAG_VALUE of 1 or logical with STORE_FLAG_VALUE == -1,
7216 we have a (neg (gt X 0)) operation. */
7218 if (GET_CODE (XEXP (varop, 0)) == ASHIFTRT
7219 && count == GET_MODE_BITSIZE (GET_MODE (varop)) - 1
7220 && (STORE_FLAG_VALUE == 1 || STORE_FLAG_VALUE == -1)
7221 && (code == LSHIFTRT || code == ASHIFTRT)
7222 && GET_CODE (XEXP (XEXP (varop, 0), 1)) == CONST_INT
7223 && INTVAL (XEXP (XEXP (varop, 0), 1)) == count
7224 && rtx_equal_p (XEXP (XEXP (varop, 0), 0), XEXP (varop, 1)))
7227 varop = gen_rtx_combine (GT, GET_MODE (varop), XEXP (varop, 1),
7230 if (STORE_FLAG_VALUE == 1 ? code == ASHIFTRT : code == LSHIFTRT)
7231 varop = gen_rtx_combine (NEG, GET_MODE (varop), varop);
7241 /* We need to determine what mode to do the shift in. If the shift is
7242 a ASHIFTRT or ROTATE, we must always do it in the mode it was originally
7243 done in. Otherwise, we can do it in MODE, the widest mode encountered.
7244 The code we care about is that of the shift that will actually be done,
7245 not the shift that was originally requested. */
7246 shift_mode = (code == ASHIFTRT || code == ROTATE ? result_mode : mode);
7248 /* We have now finished analyzing the shift. The result should be
7249 a shift of type CODE with SHIFT_MODE shifting VAROP COUNT places. If
7250 OUTER_OP is non-NIL, it is an operation that needs to be applied
7251 to the result of the shift. OUTER_CONST is the relevant constant,
7252 but we must turn off all bits turned off in the shift.
7254 If we were passed a value for X, see if we can use any pieces of
7255 it. If not, make new rtx. */
7257 if (x && GET_RTX_CLASS (GET_CODE (x)) == '2'
7258 && GET_CODE (XEXP (x, 1)) == CONST_INT
7259 && INTVAL (XEXP (x, 1)) == count)
7260 const_rtx = XEXP (x, 1);
7262 const_rtx = GEN_INT (count);
7264 if (x && GET_CODE (XEXP (x, 0)) == SUBREG
7265 && GET_MODE (XEXP (x, 0)) == shift_mode
7266 && SUBREG_REG (XEXP (x, 0)) == varop)
7267 varop = XEXP (x, 0);
7268 else if (GET_MODE (varop) != shift_mode)
7269 varop = gen_lowpart_for_combine (shift_mode, varop);
7271 /* If we can't make the SUBREG, try to return what we were given. */
7272 if (GET_CODE (varop) == CLOBBER)
7273 return x ? x : varop;
7275 new = simplify_binary_operation (code, shift_mode, varop, const_rtx);
7280 if (x == 0 || GET_CODE (x) != code || GET_MODE (x) != shift_mode)
7281 x = gen_rtx_combine (code, shift_mode, varop, const_rtx);
7283 SUBST (XEXP (x, 0), varop);
7284 SUBST (XEXP (x, 1), const_rtx);
7287 /* If we were doing a LSHIFTRT in a wider mode than it was originally,
7288 turn off all the bits that the shift would have turned off. */
7289 if (orig_code == LSHIFTRT && result_mode != shift_mode)
7290 x = simplify_and_const_int (NULL_RTX, shift_mode, x,
7291 GET_MODE_MASK (result_mode) >> orig_count);
7293 /* Do the remainder of the processing in RESULT_MODE. */
7294 x = gen_lowpart_for_combine (result_mode, x);
7296 /* If COMPLEMENT_P is set, we have to complement X before doing the outer
7299 x = gen_unary (NOT, result_mode, x);
7301 if (outer_op != NIL)
7303 if (GET_MODE_BITSIZE (result_mode) < HOST_BITS_PER_WIDE_INT)
7304 outer_const &= GET_MODE_MASK (result_mode);
7306 if (outer_op == AND)
7307 x = simplify_and_const_int (NULL_RTX, result_mode, x, outer_const);
7308 else if (outer_op == SET)
7309 /* This means that we have determined that the result is
7310 equivalent to a constant. This should be rare. */
7311 x = GEN_INT (outer_const);
7312 else if (GET_RTX_CLASS (outer_op) == '1')
7313 x = gen_unary (outer_op, result_mode, x);
7315 x = gen_binary (outer_op, result_mode, x, GEN_INT (outer_const));
7321 /* Like recog, but we receive the address of a pointer to a new pattern.
7322 We try to match the rtx that the pointer points to.
7323 If that fails, we may try to modify or replace the pattern,
7324 storing the replacement into the same pointer object.
7326 Modifications include deletion or addition of CLOBBERs.
7328 PNOTES is a pointer to a location where any REG_UNUSED notes added for
7329 the CLOBBERs are placed.
7331 The value is the final insn code from the pattern ultimately matched,
7335 recog_for_combine (pnewpat, insn, pnotes)
7340 register rtx pat = *pnewpat;
7341 int insn_code_number;
7342 int num_clobbers_to_add = 0;
7346 /* Is the result of combination a valid instruction? */
7347 insn_code_number = recog (pat, insn, &num_clobbers_to_add);
7349 /* If it isn't, there is the possibility that we previously had an insn
7350 that clobbered some register as a side effect, but the combined
7351 insn doesn't need to do that. So try once more without the clobbers
7352 unless this represents an ASM insn. */
7354 if (insn_code_number < 0 && ! check_asm_operands (pat)
7355 && GET_CODE (pat) == PARALLEL)
7359 for (pos = 0, i = 0; i < XVECLEN (pat, 0); i++)
7360 if (GET_CODE (XVECEXP (pat, 0, i)) != CLOBBER)
7363 SUBST (XVECEXP (pat, 0, pos), XVECEXP (pat, 0, i));
7367 SUBST_INT (XVECLEN (pat, 0), pos);
7370 pat = XVECEXP (pat, 0, 0);
7372 insn_code_number = recog (pat, insn, &num_clobbers_to_add);
7375 /* If we had any clobbers to add, make a new pattern than contains
7376 them. Then check to make sure that all of them are dead. */
7377 if (num_clobbers_to_add)
7379 rtx newpat = gen_rtx (PARALLEL, VOIDmode,
7380 gen_rtvec (GET_CODE (pat) == PARALLEL
7381 ? XVECLEN (pat, 0) + num_clobbers_to_add
7382 : num_clobbers_to_add + 1));
7384 if (GET_CODE (pat) == PARALLEL)
7385 for (i = 0; i < XVECLEN (pat, 0); i++)
7386 XVECEXP (newpat, 0, i) = XVECEXP (pat, 0, i);
7388 XVECEXP (newpat, 0, 0) = pat;
7390 add_clobbers (newpat, insn_code_number);
7392 for (i = XVECLEN (newpat, 0) - num_clobbers_to_add;
7393 i < XVECLEN (newpat, 0); i++)
7395 if (GET_CODE (XEXP (XVECEXP (newpat, 0, i), 0)) == REG
7396 && ! reg_dead_at_p (XEXP (XVECEXP (newpat, 0, i), 0), insn))
7398 notes = gen_rtx (EXPR_LIST, REG_UNUSED,
7399 XEXP (XVECEXP (newpat, 0, i), 0), notes);
7407 return insn_code_number;
7410 /* Like gen_lowpart but for use by combine. In combine it is not possible
7411 to create any new pseudoregs. However, it is safe to create
7412 invalid memory addresses, because combine will try to recognize
7413 them and all they will do is make the combine attempt fail.
7415 If for some reason this cannot do its job, an rtx
7416 (clobber (const_int 0)) is returned.
7417 An insn containing that will not be recognized. */
7422 gen_lowpart_for_combine (mode, x)
7423 enum machine_mode mode;
7428 if (GET_MODE (x) == mode)
7431 /* We can only support MODE being wider than a word if X is a
7432 constant integer or has a mode the same size. */
7434 if (GET_MODE_SIZE (mode) > UNITS_PER_WORD
7435 && ! ((GET_MODE (x) == VOIDmode
7436 && (GET_CODE (x) == CONST_INT
7437 || GET_CODE (x) == CONST_DOUBLE))
7438 || GET_MODE_SIZE (GET_MODE (x)) == GET_MODE_SIZE (mode)))
7439 return gen_rtx (CLOBBER, GET_MODE (x), const0_rtx);
7441 /* X might be a paradoxical (subreg (mem)). In that case, gen_lowpart
7442 won't know what to do. So we will strip off the SUBREG here and
7443 process normally. */
7444 if (GET_CODE (x) == SUBREG && GET_CODE (SUBREG_REG (x)) == MEM)
7447 if (GET_MODE (x) == mode)
7451 result = gen_lowpart_common (mode, x);
7455 if (GET_CODE (x) == MEM)
7457 register int offset = 0;
7460 /* Refuse to work on a volatile memory ref or one with a mode-dependent
7462 if (MEM_VOLATILE_P (x) || mode_dependent_address_p (XEXP (x, 0)))
7463 return gen_rtx (CLOBBER, GET_MODE (x), const0_rtx);
7465 /* If we want to refer to something bigger than the original memref,
7466 generate a perverse subreg instead. That will force a reload
7467 of the original memref X. */
7468 if (GET_MODE_SIZE (GET_MODE (x)) < GET_MODE_SIZE (mode))
7469 return gen_rtx (SUBREG, mode, x, 0);
7471 #if WORDS_BIG_ENDIAN
7472 offset = (MAX (GET_MODE_SIZE (GET_MODE (x)), UNITS_PER_WORD)
7473 - MAX (GET_MODE_SIZE (mode), UNITS_PER_WORD));
7475 #if BYTES_BIG_ENDIAN
7476 /* Adjust the address so that the address-after-the-data
7478 offset -= (MIN (UNITS_PER_WORD, GET_MODE_SIZE (mode))
7479 - MIN (UNITS_PER_WORD, GET_MODE_SIZE (GET_MODE (x))));
7481 new = gen_rtx (MEM, mode, plus_constant (XEXP (x, 0), offset));
7482 RTX_UNCHANGING_P (new) = RTX_UNCHANGING_P (x);
7483 MEM_VOLATILE_P (new) = MEM_VOLATILE_P (x);
7484 MEM_IN_STRUCT_P (new) = MEM_IN_STRUCT_P (x);
7488 /* If X is a comparison operator, rewrite it in a new mode. This
7489 probably won't match, but may allow further simplifications. */
7490 else if (GET_RTX_CLASS (GET_CODE (x)) == '<')
7491 return gen_rtx_combine (GET_CODE (x), mode, XEXP (x, 0), XEXP (x, 1));
7493 /* If we couldn't simplify X any other way, just enclose it in a
7494 SUBREG. Normally, this SUBREG won't match, but some patterns may
7495 include an explicit SUBREG or we may simplify it further in combine. */
7500 if (WORDS_BIG_ENDIAN && GET_MODE_SIZE (GET_MODE (x)) > UNITS_PER_WORD)
7501 word = ((GET_MODE_SIZE (GET_MODE (x))
7502 - MAX (GET_MODE_SIZE (mode), UNITS_PER_WORD))
7504 return gen_rtx (SUBREG, mode, x, word);
7508 /* Make an rtx expression. This is a subset of gen_rtx and only supports
7509 expressions of 1, 2, or 3 operands, each of which are rtx expressions.
7511 If the identical expression was previously in the insn (in the undobuf),
7512 it will be returned. Only if it is not found will a new expression
7517 gen_rtx_combine (va_alist)
7522 enum machine_mode mode;
7530 code = va_arg (p, enum rtx_code);
7531 mode = va_arg (p, enum machine_mode);
7532 n_args = GET_RTX_LENGTH (code);
7533 fmt = GET_RTX_FORMAT (code);
7535 if (n_args == 0 || n_args > 3)
7538 /* Get each arg and verify that it is supposed to be an expression. */
7539 for (j = 0; j < n_args; j++)
7544 args[j] = va_arg (p, rtx);
7547 /* See if this is in undobuf. Be sure we don't use objects that came
7548 from another insn; this could produce circular rtl structures. */
7550 for (i = previous_num_undos; i < undobuf.num_undo; i++)
7551 if (!undobuf.undo[i].is_int
7552 && GET_CODE (undobuf.undo[i].old_contents.rtx) == code
7553 && GET_MODE (undobuf.undo[i].old_contents.rtx) == mode)
7555 for (j = 0; j < n_args; j++)
7556 if (XEXP (undobuf.undo[i].old_contents.rtx, j) != args[j])
7560 return undobuf.undo[i].old_contents.rtx;
7563 /* Otherwise make a new rtx. We know we have 1, 2, or 3 args.
7564 Use rtx_alloc instead of gen_rtx because it's faster on RISC. */
7565 rt = rtx_alloc (code);
7566 PUT_MODE (rt, mode);
7567 XEXP (rt, 0) = args[0];
7570 XEXP (rt, 1) = args[1];
7572 XEXP (rt, 2) = args[2];
7577 /* These routines make binary and unary operations by first seeing if they
7578 fold; if not, a new expression is allocated. */
7581 gen_binary (code, mode, op0, op1)
7583 enum machine_mode mode;
7589 if (GET_RTX_CLASS (code) == 'c'
7590 && (GET_CODE (op0) == CONST_INT
7591 || (CONSTANT_P (op0) && GET_CODE (op1) != CONST_INT)))
7592 tem = op0, op0 = op1, op1 = tem;
7594 if (GET_RTX_CLASS (code) == '<')
7596 enum machine_mode op_mode = GET_MODE (op0);
7597 if (op_mode == VOIDmode)
7598 op_mode = GET_MODE (op1);
7599 result = simplify_relational_operation (code, op_mode, op0, op1);
7602 result = simplify_binary_operation (code, mode, op0, op1);
7607 /* Put complex operands first and constants second. */
7608 if (GET_RTX_CLASS (code) == 'c'
7609 && ((CONSTANT_P (op0) && GET_CODE (op1) != CONST_INT)
7610 || (GET_RTX_CLASS (GET_CODE (op0)) == 'o'
7611 && GET_RTX_CLASS (GET_CODE (op1)) != 'o')
7612 || (GET_CODE (op0) == SUBREG
7613 && GET_RTX_CLASS (GET_CODE (SUBREG_REG (op0))) == 'o'
7614 && GET_RTX_CLASS (GET_CODE (op1)) != 'o')))
7615 return gen_rtx_combine (code, mode, op1, op0);
7617 return gen_rtx_combine (code, mode, op0, op1);
7621 gen_unary (code, mode, op0)
7623 enum machine_mode mode;
7626 rtx result = simplify_unary_operation (code, mode, op0, mode);
7631 return gen_rtx_combine (code, mode, op0);
7634 /* Simplify a comparison between *POP0 and *POP1 where CODE is the
7635 comparison code that will be tested.
7637 The result is a possibly different comparison code to use. *POP0 and
7638 *POP1 may be updated.
7640 It is possible that we might detect that a comparison is either always
7641 true or always false. However, we do not perform general constant
7642 folding in combine, so this knowledge isn't useful. Such tautologies
7643 should have been detected earlier. Hence we ignore all such cases. */
7645 static enum rtx_code
7646 simplify_comparison (code, pop0, pop1)
7655 enum machine_mode mode, tmode;
7657 /* Try a few ways of applying the same transformation to both operands. */
7660 /* If both operands are the same constant shift, see if we can ignore the
7661 shift. We can if the shift is a rotate or if the bits shifted out of
7662 this shift are not significant for either input and if the type of
7663 comparison is compatible with the shift. */
7664 if (GET_CODE (op0) == GET_CODE (op1)
7665 && GET_MODE_BITSIZE (GET_MODE (op0)) <= HOST_BITS_PER_WIDE_INT
7666 && ((GET_CODE (op0) == ROTATE && (code == NE || code == EQ))
7667 || ((GET_CODE (op0) == LSHIFTRT
7668 || GET_CODE (op0) == ASHIFT || GET_CODE (op0) == LSHIFT)
7669 && (code != GT && code != LT && code != GE && code != LE))
7670 || (GET_CODE (op0) == ASHIFTRT
7671 && (code != GTU && code != LTU
7672 && code != GEU && code != GEU)))
7673 && GET_CODE (XEXP (op0, 1)) == CONST_INT
7674 && INTVAL (XEXP (op0, 1)) >= 0
7675 && INTVAL (XEXP (op0, 1)) < HOST_BITS_PER_WIDE_INT
7676 && XEXP (op0, 1) == XEXP (op1, 1))
7678 enum machine_mode mode = GET_MODE (op0);
7679 unsigned HOST_WIDE_INT mask = GET_MODE_MASK (mode);
7680 int shift_count = INTVAL (XEXP (op0, 1));
7682 if (GET_CODE (op0) == LSHIFTRT || GET_CODE (op0) == ASHIFTRT)
7683 mask &= (mask >> shift_count) << shift_count;
7684 else if (GET_CODE (op0) == ASHIFT || GET_CODE (op0) == LSHIFT)
7685 mask = (mask & (mask << shift_count)) >> shift_count;
7687 if ((significant_bits (XEXP (op0, 0), mode) & ~ mask) == 0
7688 && (significant_bits (XEXP (op1, 0), mode) & ~ mask) == 0)
7689 op0 = XEXP (op0, 0), op1 = XEXP (op1, 0);
7694 /* If both operands are AND's of a paradoxical SUBREG by constant, the
7695 SUBREGs are of the same mode, and, in both cases, the AND would
7696 be redundant if the comparison was done in the narrower mode,
7697 do the comparison in the narrower mode (e.g., we are AND'ing with 1
7698 and the operand's significant bits are 0xffffff01; in that case if
7699 we only care about QImode, we don't need the AND). This case occurs
7700 if the output mode of an scc insn is not SImode and
7701 STORE_FLAG_VALUE == 1 (e.g., the 386). */
7703 else if (GET_CODE (op0) == AND && GET_CODE (op1) == AND
7704 && GET_CODE (XEXP (op0, 1)) == CONST_INT
7705 && GET_CODE (XEXP (op1, 1)) == CONST_INT
7706 && GET_CODE (XEXP (op0, 0)) == SUBREG
7707 && GET_CODE (XEXP (op1, 0)) == SUBREG
7708 && (GET_MODE_SIZE (GET_MODE (XEXP (op0, 0)))
7709 > GET_MODE_SIZE (GET_MODE (SUBREG_REG (XEXP (op0, 0)))))
7710 && (GET_MODE (SUBREG_REG (XEXP (op0, 0)))
7711 == GET_MODE (SUBREG_REG (XEXP (op1, 0))))
7712 && (GET_MODE_BITSIZE (GET_MODE (SUBREG_REG (XEXP (op0, 0))))
7713 <= HOST_BITS_PER_WIDE_INT)
7714 && (significant_bits (SUBREG_REG (XEXP (op0, 0)),
7715 GET_MODE (SUBREG_REG (XEXP (op0, 0))))
7716 & ~ INTVAL (XEXP (op0, 1))) == 0
7717 && (significant_bits (SUBREG_REG (XEXP (op1, 0)),
7718 GET_MODE (SUBREG_REG (XEXP (op1, 0))))
7719 & ~ INTVAL (XEXP (op1, 1))) == 0)
7721 op0 = SUBREG_REG (XEXP (op0, 0));
7722 op1 = SUBREG_REG (XEXP (op1, 0));
7724 /* the resulting comparison is always unsigned since we masked off
7725 the original sign bit. */
7726 code = unsigned_condition (code);
7732 /* If the first operand is a constant, swap the operands and adjust the
7733 comparison code appropriately. */
7734 if (CONSTANT_P (op0))
7736 tem = op0, op0 = op1, op1 = tem;
7737 code = swap_condition (code);
7740 /* We now enter a loop during which we will try to simplify the comparison.
7741 For the most part, we only are concerned with comparisons with zero,
7742 but some things may really be comparisons with zero but not start
7743 out looking that way. */
7745 while (GET_CODE (op1) == CONST_INT)
7747 enum machine_mode mode = GET_MODE (op0);
7748 int mode_width = GET_MODE_BITSIZE (mode);
7749 unsigned HOST_WIDE_INT mask = GET_MODE_MASK (mode);
7750 int equality_comparison_p;
7751 int sign_bit_comparison_p;
7752 int unsigned_comparison_p;
7753 HOST_WIDE_INT const_op;
7755 /* We only want to handle integral modes. This catches VOIDmode,
7756 CCmode, and the floating-point modes. An exception is that we
7757 can handle VOIDmode if OP0 is a COMPARE or a comparison
7760 if (GET_MODE_CLASS (mode) != MODE_INT
7761 && ! (mode == VOIDmode
7762 && (GET_CODE (op0) == COMPARE
7763 || GET_RTX_CLASS (GET_CODE (op0)) == '<')))
7766 /* Get the constant we are comparing against and turn off all bits
7767 not on in our mode. */
7768 const_op = INTVAL (op1);
7769 if (mode_width <= HOST_BITS_PER_WIDE_INT)
7772 /* If we are comparing against a constant power of two and the value
7773 being compared has only that single significant bit (e.g., it was
7774 `and'ed with that bit), we can replace this with a comparison
7777 && (code == EQ || code == NE || code == GE || code == GEU
7778 || code == LT || code == LTU)
7779 && mode_width <= HOST_BITS_PER_WIDE_INT
7780 && exact_log2 (const_op) >= 0
7781 && significant_bits (op0, mode) == const_op)
7783 code = (code == EQ || code == GE || code == GEU ? NE : EQ);
7784 op1 = const0_rtx, const_op = 0;
7787 /* Similarly, if we are comparing a value known to be either -1 or
7788 0 with -1, change it to the opposite comparison against zero. */
7791 && (code == EQ || code == NE || code == GT || code == LE
7792 || code == GEU || code == LTU)
7793 && num_sign_bit_copies (op0, mode) == mode_width)
7795 code = (code == EQ || code == LE || code == GEU ? NE : EQ);
7796 op1 = const0_rtx, const_op = 0;
7799 /* Do some canonicalizations based on the comparison code. We prefer
7800 comparisons against zero and then prefer equality comparisons.
7801 If we can reduce the size of a constant, we will do that too. */
7806 /* < C is equivalent to <= (C - 1) */
7810 op1 = GEN_INT (const_op);
7812 /* ... fall through to LE case below. */
7818 /* <= C is equivalent to < (C + 1); we do this for C < 0 */
7822 op1 = GEN_INT (const_op);
7826 /* If we are doing a <= 0 comparison on a value known to have
7827 a zero sign bit, we can replace this with == 0. */
7828 else if (const_op == 0
7829 && mode_width <= HOST_BITS_PER_WIDE_INT
7830 && (significant_bits (op0, mode)
7831 & ((HOST_WIDE_INT) 1 << (mode_width - 1))) == 0)
7836 /* >= C is equivalent to > (C - 1). */
7840 op1 = GEN_INT (const_op);
7842 /* ... fall through to GT below. */
7848 /* > C is equivalent to >= (C + 1); we do this for C < 0*/
7852 op1 = GEN_INT (const_op);
7856 /* If we are doing a > 0 comparison on a value known to have
7857 a zero sign bit, we can replace this with != 0. */
7858 else if (const_op == 0
7859 && mode_width <= HOST_BITS_PER_WIDE_INT
7860 && (significant_bits (op0, mode)
7861 & ((HOST_WIDE_INT) 1 << (mode_width - 1))) == 0)
7866 /* < C is equivalent to <= (C - 1). */
7870 op1 = GEN_INT (const_op);
7872 /* ... fall through ... */
7875 /* (unsigned) < 0x80000000 is equivalent to >= 0. */
7876 else if (const_op == (HOST_WIDE_INT) 1 << (mode_width - 1))
7878 const_op = 0, op1 = const0_rtx;
7886 /* unsigned <= 0 is equivalent to == 0 */
7890 /* (unsigned) <= 0x7fffffff is equivalent to >= 0. */
7891 else if (const_op == ((HOST_WIDE_INT) 1 << (mode_width - 1)) - 1)
7893 const_op = 0, op1 = const0_rtx;
7899 /* >= C is equivalent to < (C - 1). */
7903 op1 = GEN_INT (const_op);
7905 /* ... fall through ... */
7908 /* (unsigned) >= 0x80000000 is equivalent to < 0. */
7909 else if (const_op == (HOST_WIDE_INT) 1 << (mode_width - 1))
7911 const_op = 0, op1 = const0_rtx;
7918 /* unsigned > 0 is equivalent to != 0 */
7922 /* (unsigned) > 0x7fffffff is equivalent to < 0. */
7923 else if (const_op == ((HOST_WIDE_INT) 1 << (mode_width - 1)) - 1)
7925 const_op = 0, op1 = const0_rtx;
7931 /* Compute some predicates to simplify code below. */
7933 equality_comparison_p = (code == EQ || code == NE);
7934 sign_bit_comparison_p = ((code == LT || code == GE) && const_op == 0);
7935 unsigned_comparison_p = (code == LTU || code == LEU || code == GTU
7938 /* Now try cases based on the opcode of OP0. If none of the cases
7939 does a "continue", we exit this loop immediately after the
7942 switch (GET_CODE (op0))
7945 /* If we are extracting a single bit from a variable position in
7946 a constant that has only a single bit set and are comparing it
7947 with zero, we can convert this into an equality comparison
7948 between the position and the location of the single bit. We can't
7949 do this if bit endian and we don't have an extzv since we then
7950 can't know what mode to use for the endianness adjustment. */
7952 #if ! BITS_BIG_ENDIAN || defined (HAVE_extzv)
7953 if (GET_CODE (XEXP (op0, 0)) == CONST_INT
7954 && XEXP (op0, 1) == const1_rtx
7955 && equality_comparison_p && const_op == 0
7956 && (i = exact_log2 (INTVAL (XEXP (op0, 0)))) >= 0)
7959 i = (GET_MODE_BITSIZE
7960 (insn_operand_mode[(int) CODE_FOR_extzv][1]) - 1 - i);
7963 op0 = XEXP (op0, 2);
7967 /* Result is nonzero iff shift count is equal to I. */
7968 code = reverse_condition (code);
7973 /* ... fall through ... */
7976 tem = expand_compound_operation (op0);
7985 /* If testing for equality, we can take the NOT of the constant. */
7986 if (equality_comparison_p
7987 && (tem = simplify_unary_operation (NOT, mode, op1, mode)) != 0)
7989 op0 = XEXP (op0, 0);
7994 /* If just looking at the sign bit, reverse the sense of the
7996 if (sign_bit_comparison_p)
7998 op0 = XEXP (op0, 0);
7999 code = (code == GE ? LT : GE);
8005 /* If testing for equality, we can take the NEG of the constant. */
8006 if (equality_comparison_p
8007 && (tem = simplify_unary_operation (NEG, mode, op1, mode)) != 0)
8009 op0 = XEXP (op0, 0);
8014 /* The remaining cases only apply to comparisons with zero. */
8018 /* When X is ABS or is known positive,
8019 (neg X) is < 0 if and only if X != 0. */
8021 if (sign_bit_comparison_p
8022 && (GET_CODE (XEXP (op0, 0)) == ABS
8023 || (mode_width <= HOST_BITS_PER_WIDE_INT
8024 && (significant_bits (XEXP (op0, 0), mode)
8025 & ((HOST_WIDE_INT) 1 << (mode_width - 1))) == 0)))
8027 op0 = XEXP (op0, 0);
8028 code = (code == LT ? NE : EQ);
8032 /* If we have NEG of something whose two high-order bits are the
8033 same, we know that "(-a) < 0" is equivalent to "a > 0". */
8034 if (num_sign_bit_copies (op0, mode) >= 2)
8036 op0 = XEXP (op0, 0);
8037 code = swap_condition (code);
8043 /* If we are testing equality and our count is a constant, we
8044 can perform the inverse operation on our RHS. */
8045 if (equality_comparison_p && GET_CODE (XEXP (op0, 1)) == CONST_INT
8046 && (tem = simplify_binary_operation (ROTATERT, mode,
8047 op1, XEXP (op0, 1))) != 0)
8049 op0 = XEXP (op0, 0);
8054 /* If we are doing a < 0 or >= 0 comparison, it means we are testing
8055 a particular bit. Convert it to an AND of a constant of that
8056 bit. This will be converted into a ZERO_EXTRACT. */
8057 if (const_op == 0 && sign_bit_comparison_p
8058 && GET_CODE (XEXP (op0, 1)) == CONST_INT
8059 && mode_width <= HOST_BITS_PER_WIDE_INT)
8061 op0 = simplify_and_const_int (NULL_RTX, mode, XEXP (op0, 0),
8064 - INTVAL (XEXP (op0, 1)))));
8065 code = (code == LT ? NE : EQ);
8069 /* ... fall through ... */
8072 /* ABS is ignorable inside an equality comparison with zero. */
8073 if (const_op == 0 && equality_comparison_p)
8075 op0 = XEXP (op0, 0);
8082 /* Can simplify (compare (zero/sign_extend FOO) CONST)
8083 to (compare FOO CONST) if CONST fits in FOO's mode and we
8084 are either testing inequality or have an unsigned comparison
8085 with ZERO_EXTEND or a signed comparison with SIGN_EXTEND. */
8086 if (! unsigned_comparison_p
8087 && (GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 0)))
8088 <= HOST_BITS_PER_WIDE_INT)
8089 && ((unsigned HOST_WIDE_INT) const_op
8090 < (((HOST_WIDE_INT) 1
8091 << (GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 0))) - 1)))))
8093 op0 = XEXP (op0, 0);
8099 /* Check for the case where we are comparing A - C1 with C2,
8100 both constants are smaller than 1/2 the maxium positive
8101 value in MODE, and the comparison is equality or unsigned.
8102 In that case, if A is either zero-extended to MODE or has
8103 sufficient sign bits so that the high-order bit in MODE
8104 is a copy of the sign in the inner mode, we can prove that it is
8105 safe to do the operation in the wider mode. This simplifies
8106 many range checks. */
8108 if (mode_width <= HOST_BITS_PER_WIDE_INT
8109 && subreg_lowpart_p (op0)
8110 && GET_CODE (SUBREG_REG (op0)) == PLUS
8111 && GET_CODE (XEXP (SUBREG_REG (op0), 1)) == CONST_INT
8112 && INTVAL (XEXP (SUBREG_REG (op0), 1)) < 0
8113 && (- INTVAL (XEXP (SUBREG_REG (op0), 1))
8114 < GET_MODE_MASK (mode) / 2)
8115 && (unsigned) const_op < GET_MODE_MASK (mode) / 2
8116 && (0 == (significant_bits (XEXP (SUBREG_REG (op0), 0),
8117 GET_MODE (SUBREG_REG (op0)))
8118 & ~ GET_MODE_MASK (mode))
8119 || (num_sign_bit_copies (XEXP (SUBREG_REG (op0), 0),
8120 GET_MODE (SUBREG_REG (op0)))
8121 > (GET_MODE_BITSIZE (GET_MODE (SUBREG_REG (op0)))
8122 - GET_MODE_BITSIZE (mode)))))
8124 op0 = SUBREG_REG (op0);
8128 /* If the inner mode is narrower and we are extracting the low part,
8129 we can treat the SUBREG as if it were a ZERO_EXTEND. */
8130 if (subreg_lowpart_p (op0)
8131 && GET_MODE_BITSIZE (GET_MODE (SUBREG_REG (op0))) < mode_width)
8132 /* Fall through */ ;
8136 /* ... fall through ... */
8139 if ((unsigned_comparison_p || equality_comparison_p)
8140 && (GET_MODE_BITSIZE (GET_MODE (XEXP (op0, 0)))
8141 <= HOST_BITS_PER_WIDE_INT)
8142 && ((unsigned HOST_WIDE_INT) const_op
8143 < GET_MODE_MASK (GET_MODE (XEXP (op0, 0)))))
8145 op0 = XEXP (op0, 0);
8151 /* (eq (plus X C1) C2) -> (eq X (minus C2 C1)). We can only do
8152 this for equality comparisons due to pathological cases involving
8154 if (equality_comparison_p && GET_CODE (XEXP (op0, 1)) == CONST_INT
8155 && (tem = simplify_binary_operation (MINUS, mode, op1,
8156 XEXP (op0, 1))) != 0)
8158 op0 = XEXP (op0, 0);
8163 /* (plus (abs X) (const_int -1)) is < 0 if and only if X == 0. */
8164 if (const_op == 0 && XEXP (op0, 1) == constm1_rtx
8165 && GET_CODE (XEXP (op0, 0)) == ABS && sign_bit_comparison_p)
8167 op0 = XEXP (XEXP (op0, 0), 0);
8168 code = (code == LT ? EQ : NE);
8174 /* The sign bit of (minus (ashiftrt X C) X), where C is the number
8175 of bits in X minus 1, is one iff X > 0. */
8176 if (sign_bit_comparison_p && GET_CODE (XEXP (op0, 0)) == ASHIFTRT
8177 && GET_CODE (XEXP (XEXP (op0, 0), 1)) == CONST_INT
8178 && INTVAL (XEXP (XEXP (op0, 0), 1)) == mode_width - 1
8179 && rtx_equal_p (XEXP (XEXP (op0, 0), 0), XEXP (op0, 1)))
8181 op0 = XEXP (op0, 1);
8182 code = (code == GE ? LE : GT);
8188 /* (eq (xor A B) C) -> (eq A (xor B C)). This is a simplification
8189 if C is zero or B is a constant. */
8190 if (equality_comparison_p
8191 && 0 != (tem = simplify_binary_operation (XOR, mode,
8192 XEXP (op0, 1), op1)))
8194 op0 = XEXP (op0, 0);
8201 case LT: case LTU: case LE: case LEU:
8202 case GT: case GTU: case GE: case GEU:
8203 /* We can't do anything if OP0 is a condition code value, rather
8204 than an actual data value. */
8207 || XEXP (op0, 0) == cc0_rtx
8209 || GET_MODE_CLASS (GET_MODE (XEXP (op0, 0))) == MODE_CC)
8212 /* Get the two operands being compared. */
8213 if (GET_CODE (XEXP (op0, 0)) == COMPARE)
8214 tem = XEXP (XEXP (op0, 0), 0), tem1 = XEXP (XEXP (op0, 0), 1);
8216 tem = XEXP (op0, 0), tem1 = XEXP (op0, 1);
8218 /* Check for the cases where we simply want the result of the
8219 earlier test or the opposite of that result. */
8221 || (code == EQ && reversible_comparison_p (op0))
8222 || (GET_MODE_BITSIZE (GET_MODE (op0)) <= HOST_BITS_PER_WIDE_INT
8223 && GET_MODE_CLASS (GET_MODE (op0)) == MODE_INT
8224 && (STORE_FLAG_VALUE
8225 & (((HOST_WIDE_INT) 1
8226 << (GET_MODE_BITSIZE (GET_MODE (op0)) - 1))))
8228 || (code == GE && reversible_comparison_p (op0)))))
8230 code = (code == LT || code == NE
8231 ? GET_CODE (op0) : reverse_condition (GET_CODE (op0)));
8232 op0 = tem, op1 = tem1;
8238 /* The sign bit of (ior (plus X (const_int -1)) X) is non-zero
8240 if (sign_bit_comparison_p && GET_CODE (XEXP (op0, 0)) == PLUS
8241 && XEXP (XEXP (op0, 0), 1) == constm1_rtx
8242 && rtx_equal_p (XEXP (XEXP (op0, 0), 0), XEXP (op0, 1)))
8244 op0 = XEXP (op0, 1);
8245 code = (code == GE ? GT : LE);
8251 /* Convert (and (xshift 1 X) Y) to (and (lshiftrt Y X) 1). This
8252 will be converted to a ZERO_EXTRACT later. */
8253 if (const_op == 0 && equality_comparison_p
8254 && (GET_CODE (XEXP (op0, 0)) == ASHIFT
8255 || GET_CODE (XEXP (op0, 0)) == LSHIFT)
8256 && XEXP (XEXP (op0, 0), 0) == const1_rtx)
8258 op0 = simplify_and_const_int
8259 (op0, mode, gen_rtx_combine (LSHIFTRT, mode,
8261 XEXP (XEXP (op0, 0), 1)),
8266 /* If we are comparing (and (lshiftrt X C1) C2) for equality with
8267 zero and X is a comparison and C1 and C2 describe only bits set
8268 in STORE_FLAG_VALUE, we can compare with X. */
8269 if (const_op == 0 && equality_comparison_p
8270 && mode_width <= HOST_BITS_PER_WIDE_INT
8271 && GET_CODE (XEXP (op0, 1)) == CONST_INT
8272 && GET_CODE (XEXP (op0, 0)) == LSHIFTRT
8273 && GET_CODE (XEXP (XEXP (op0, 0), 1)) == CONST_INT
8274 && INTVAL (XEXP (XEXP (op0, 0), 1)) >= 0
8275 && INTVAL (XEXP (XEXP (op0, 0), 1)) < HOST_BITS_PER_WIDE_INT)
8277 mask = ((INTVAL (XEXP (op0, 1)) & GET_MODE_MASK (mode))
8278 << INTVAL (XEXP (XEXP (op0, 0), 1)));
8279 if ((~ STORE_FLAG_VALUE & mask) == 0
8280 && (GET_RTX_CLASS (GET_CODE (XEXP (XEXP (op0, 0), 0))) == '<'
8281 || ((tem = get_last_value (XEXP (XEXP (op0, 0), 0))) != 0
8282 && GET_RTX_CLASS (GET_CODE (tem)) == '<')))
8284 op0 = XEXP (XEXP (op0, 0), 0);
8289 /* If we are doing an equality comparison of an AND of a bit equal
8290 to the sign bit, replace this with a LT or GE comparison of
8291 the underlying value. */
8292 if (equality_comparison_p
8294 && GET_CODE (XEXP (op0, 1)) == CONST_INT
8295 && mode_width <= HOST_BITS_PER_WIDE_INT
8296 && ((INTVAL (XEXP (op0, 1)) & GET_MODE_MASK (mode))
8297 == (HOST_WIDE_INT) 1 << (mode_width - 1)))
8299 op0 = XEXP (op0, 0);
8300 code = (code == EQ ? GE : LT);
8304 /* If this AND operation is really a ZERO_EXTEND from a narrower
8305 mode, the constant fits within that mode, and this is either an
8306 equality or unsigned comparison, try to do this comparison in
8307 the narrower mode. */
8308 if ((equality_comparison_p || unsigned_comparison_p)
8309 && GET_CODE (XEXP (op0, 1)) == CONST_INT
8310 && (i = exact_log2 ((INTVAL (XEXP (op0, 1))
8311 & GET_MODE_MASK (mode))
8313 && const_op >> i == 0
8314 && (tmode = mode_for_size (i, MODE_INT, 1)) != BLKmode)
8316 op0 = gen_lowpart_for_combine (tmode, XEXP (op0, 0));
8323 /* If we have (compare (xshift FOO N) (const_int C)) and
8324 the high order N bits of FOO (N+1 if an inequality comparison)
8325 are not significant, we can do this by comparing FOO with C
8326 shifted right N bits so long as the low-order N bits of C are
8328 if (GET_CODE (XEXP (op0, 1)) == CONST_INT
8329 && INTVAL (XEXP (op0, 1)) >= 0
8330 && ((INTVAL (XEXP (op0, 1)) + ! equality_comparison_p)
8331 < HOST_BITS_PER_WIDE_INT)
8333 & ((HOST_WIDE_INT) 1 << INTVAL (XEXP (op0, 1))) - 1) == 0)
8334 && mode_width <= HOST_BITS_PER_WIDE_INT
8335 && (significant_bits (XEXP (op0, 0), mode)
8336 & ~ (mask >> (INTVAL (XEXP (op0, 1))
8337 + ! equality_comparison_p))) == 0)
8339 const_op >>= INTVAL (XEXP (op0, 1));
8340 op1 = GEN_INT (const_op);
8341 op0 = XEXP (op0, 0);
8345 /* If we are doing a sign bit comparison, it means we are testing
8346 a particular bit. Convert it to the appropriate AND. */
8347 if (sign_bit_comparison_p && GET_CODE (XEXP (op0, 1)) == CONST_INT
8348 && mode_width <= HOST_BITS_PER_WIDE_INT)
8350 op0 = simplify_and_const_int (NULL_RTX, mode, XEXP (op0, 0),
8353 - INTVAL (XEXP (op0, 1)))));
8354 code = (code == LT ? NE : EQ);
8358 /* If this an equality comparison with zero and we are shifting
8359 the low bit to the sign bit, we can convert this to an AND of the
8361 if (const_op == 0 && equality_comparison_p
8362 && GET_CODE (XEXP (op0, 1)) == CONST_INT
8363 && INTVAL (XEXP (op0, 1)) == mode_width - 1)
8365 op0 = simplify_and_const_int (NULL_RTX, mode, XEXP (op0, 0),
8372 /* If this is an equality comparison with zero, we can do this
8373 as a logical shift, which might be much simpler. */
8374 if (equality_comparison_p && const_op == 0
8375 && GET_CODE (XEXP (op0, 1)) == CONST_INT)
8377 op0 = simplify_shift_const (NULL_RTX, LSHIFTRT, mode,
8379 INTVAL (XEXP (op0, 1)));
8383 /* If OP0 is a sign extension and CODE is not an unsigned comparison,
8384 do the comparison in a narrower mode. */
8385 if (! unsigned_comparison_p
8386 && GET_CODE (XEXP (op0, 1)) == CONST_INT
8387 && GET_CODE (XEXP (op0, 0)) == ASHIFT
8388 && XEXP (op0, 1) == XEXP (XEXP (op0, 0), 1)
8389 && (tmode = mode_for_size (mode_width - INTVAL (XEXP (op0, 1)),
8390 MODE_INT, 1)) != BLKmode
8391 && ((unsigned HOST_WIDE_INT) const_op <= GET_MODE_MASK (tmode)
8392 || ((unsigned HOST_WIDE_INT) - const_op
8393 <= GET_MODE_MASK (tmode))))
8395 op0 = gen_lowpart_for_combine (tmode, XEXP (XEXP (op0, 0), 0));
8399 /* ... fall through ... */
8401 /* If we have (compare (xshiftrt FOO N) (const_int C)) and
8402 the low order N bits of FOO are not significant, we can do this
8403 by comparing FOO with C shifted left N bits so long as no
8405 if (GET_CODE (XEXP (op0, 1)) == CONST_INT
8406 && INTVAL (XEXP (op0, 1)) >= 0
8407 && INTVAL (XEXP (op0, 1)) < HOST_BITS_PER_WIDE_INT
8408 && mode_width <= HOST_BITS_PER_WIDE_INT
8409 && (significant_bits (XEXP (op0, 0), mode)
8410 & (((HOST_WIDE_INT) 1 << INTVAL (XEXP (op0, 1))) - 1)) == 0
8412 || (floor_log2 (const_op) + INTVAL (XEXP (op0, 1))
8415 const_op <<= INTVAL (XEXP (op0, 1));
8416 op1 = GEN_INT (const_op);
8417 op0 = XEXP (op0, 0);
8421 /* If we are using this shift to extract just the sign bit, we
8422 can replace this with an LT or GE comparison. */
8424 && (equality_comparison_p || sign_bit_comparison_p)
8425 && GET_CODE (XEXP (op0, 1)) == CONST_INT
8426 && INTVAL (XEXP (op0, 1)) == mode_width - 1)
8428 op0 = XEXP (op0, 0);
8429 code = (code == NE || code == GT ? LT : GE);
8438 /* Now make any compound operations involved in this comparison. Then,
8439 check for an outmost SUBREG on OP0 that isn't doing anything or is
8440 paradoxical. The latter case can only occur when it is known that the
8441 "extra" bits will be zero. Therefore, it is safe to remove the SUBREG.
8442 We can never remove a SUBREG for a non-equality comparison because the
8443 sign bit is in a different place in the underlying object. */
8445 op0 = make_compound_operation (op0, op1 == const0_rtx ? COMPARE : SET);
8446 op1 = make_compound_operation (op1, SET);
8448 if (GET_CODE (op0) == SUBREG && subreg_lowpart_p (op0)
8449 && GET_MODE_CLASS (GET_MODE (op0)) == MODE_INT
8450 && (code == NE || code == EQ)
8451 && ((GET_MODE_SIZE (GET_MODE (op0))
8452 > GET_MODE_SIZE (GET_MODE (SUBREG_REG (op0))))))
8454 op0 = SUBREG_REG (op0);
8455 op1 = gen_lowpart_for_combine (GET_MODE (op0), op1);
8458 else if (GET_CODE (op0) == SUBREG && subreg_lowpart_p (op0)
8459 && GET_MODE_CLASS (GET_MODE (op0)) == MODE_INT
8460 && (code == NE || code == EQ)
8461 && (GET_MODE_BITSIZE (GET_MODE (SUBREG_REG (op0)))
8462 <= HOST_BITS_PER_WIDE_INT)
8463 && (significant_bits (SUBREG_REG (op0), GET_MODE (SUBREG_REG (op0)))
8464 & ~ GET_MODE_MASK (GET_MODE (op0))) == 0
8465 && (tem = gen_lowpart_for_combine (GET_MODE (SUBREG_REG (op0)),
8467 (significant_bits (tem, GET_MODE (SUBREG_REG (op0)))
8468 & ~ GET_MODE_MASK (GET_MODE (op0))) == 0))
8469 op0 = SUBREG_REG (op0), op1 = tem;
8471 /* We now do the opposite procedure: Some machines don't have compare
8472 insns in all modes. If OP0's mode is an integer mode smaller than a
8473 word and we can't do a compare in that mode, see if there is a larger
8474 mode for which we can do the compare. There are a number of cases in
8475 which we can use the wider mode. */
8477 mode = GET_MODE (op0);
8478 if (mode != VOIDmode && GET_MODE_CLASS (mode) == MODE_INT
8479 && GET_MODE_SIZE (mode) < UNITS_PER_WORD
8480 && cmp_optab->handlers[(int) mode].insn_code == CODE_FOR_nothing)
8481 for (tmode = GET_MODE_WIDER_MODE (mode);
8483 && GET_MODE_BITSIZE (tmode) <= HOST_BITS_PER_WIDE_INT);
8484 tmode = GET_MODE_WIDER_MODE (tmode))
8485 if (cmp_optab->handlers[(int) tmode].insn_code != CODE_FOR_nothing)
8487 /* If the only significant bits in OP0 and OP1 are those in the
8488 narrower mode and this is an equality or unsigned comparison,
8489 we can use the wider mode. Similarly for sign-extended
8490 values and equality or signed comparisons. */
8491 if (((code == EQ || code == NE
8492 || code == GEU || code == GTU || code == LEU || code == LTU)
8493 && ((significant_bits (op0, tmode) & ~ GET_MODE_MASK (mode))
8495 && ((significant_bits (op1, tmode) & ~ GET_MODE_MASK (mode))
8497 || ((code == EQ || code == NE
8498 || code == GE || code == GT || code == LE || code == LT)
8499 && (num_sign_bit_copies (op0, tmode)
8500 > GET_MODE_BITSIZE (tmode) - GET_MODE_BITSIZE (mode))
8501 && (num_sign_bit_copies (op1, tmode)
8502 > GET_MODE_BITSIZE (tmode) - GET_MODE_BITSIZE (mode))))
8504 op0 = gen_lowpart_for_combine (tmode, op0);
8505 op1 = gen_lowpart_for_combine (tmode, op1);
8509 /* If this is a test for negative, we can make an explicit
8510 test of the sign bit. */
8512 if (op1 == const0_rtx && (code == LT || code == GE)
8513 && GET_MODE_BITSIZE (mode) <= HOST_BITS_PER_WIDE_INT)
8515 op0 = gen_binary (AND, tmode,
8516 gen_lowpart_for_combine (tmode, op0),
8517 GEN_INT ((HOST_WIDE_INT) 1
8518 << (GET_MODE_BITSIZE (mode) - 1)));
8519 code = (code == LT) ? NE : EQ;
8530 /* Return 1 if we know that X, a comparison operation, is not operating
8531 on a floating-point value or is EQ or NE, meaning that we can safely
8535 reversible_comparison_p (x)
8538 if (TARGET_FLOAT_FORMAT != IEEE_FLOAT_FORMAT
8539 || GET_CODE (x) == NE || GET_CODE (x) == EQ)
8542 switch (GET_MODE_CLASS (GET_MODE (XEXP (x, 0))))
8548 x = get_last_value (XEXP (x, 0));
8549 return (x && GET_CODE (x) == COMPARE
8550 && GET_MODE_CLASS (GET_MODE (XEXP (x, 0))) == MODE_INT);
8556 /* Utility function for following routine. Called when X is part of a value
8557 being stored into reg_last_set_value. Sets reg_last_set_table_tick
8558 for each register mentioned. Similar to mention_regs in cse.c */
8561 update_table_tick (x)
8564 register enum rtx_code code = GET_CODE (x);
8565 register char *fmt = GET_RTX_FORMAT (code);
8570 int regno = REGNO (x);
8571 int endregno = regno + (regno < FIRST_PSEUDO_REGISTER
8572 ? HARD_REGNO_NREGS (regno, GET_MODE (x)) : 1);
8574 for (i = regno; i < endregno; i++)
8575 reg_last_set_table_tick[i] = label_tick;
8580 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
8581 /* Note that we can't have an "E" in values stored; see
8582 get_last_value_validate. */
8584 update_table_tick (XEXP (x, i));
8587 /* Record that REG is set to VALUE in insn INSN. If VALUE is zero, we
8588 are saying that the register is clobbered and we no longer know its
8589 value. If INSN is zero, don't update reg_last_set; this call is normally
8590 done with VALUE also zero to invalidate the register. */
8593 record_value_for_reg (reg, insn, value)
8598 int regno = REGNO (reg);
8599 int endregno = regno + (regno < FIRST_PSEUDO_REGISTER
8600 ? HARD_REGNO_NREGS (regno, GET_MODE (reg)) : 1);
8603 /* If VALUE contains REG and we have a previous value for REG, substitute
8604 the previous value. */
8605 if (value && insn && reg_overlap_mentioned_p (reg, value))
8609 /* Set things up so get_last_value is allowed to see anything set up to
8611 subst_low_cuid = INSN_CUID (insn);
8612 tem = get_last_value (reg);
8615 value = replace_rtx (copy_rtx (value), reg, tem);
8618 /* For each register modified, show we don't know its value, that
8619 its value has been updated, and that we don't know the location of
8620 the death of the register. */
8621 for (i = regno; i < endregno; i ++)
8624 reg_last_set[i] = insn;
8625 reg_last_set_value[i] = 0;
8626 reg_last_death[i] = 0;
8629 /* Mark registers that are being referenced in this value. */
8631 update_table_tick (value);
8633 /* Now update the status of each register being set.
8634 If someone is using this register in this block, set this register
8635 to invalid since we will get confused between the two lives in this
8636 basic block. This makes using this register always invalid. In cse, we
8637 scan the table to invalidate all entries using this register, but this
8638 is too much work for us. */
8640 for (i = regno; i < endregno; i++)
8642 reg_last_set_label[i] = label_tick;
8643 if (value && reg_last_set_table_tick[i] == label_tick)
8644 reg_last_set_invalid[i] = 1;
8646 reg_last_set_invalid[i] = 0;
8649 /* The value being assigned might refer to X (like in "x++;"). In that
8650 case, we must replace it with (clobber (const_int 0)) to prevent
8652 if (value && ! get_last_value_validate (&value,
8653 reg_last_set_label[regno], 0))
8655 value = copy_rtx (value);
8656 if (! get_last_value_validate (&value, reg_last_set_label[regno], 1))
8660 /* For the main register being modified, update the value. */
8661 reg_last_set_value[regno] = value;
8665 /* Used for communication between the following two routines. */
8666 static rtx record_dead_insn;
8668 /* Called via note_stores from record_dead_and_set_regs to handle one
8669 SET or CLOBBER in an insn. */
8672 record_dead_and_set_regs_1 (dest, setter)
8675 if (GET_CODE (dest) == REG)
8677 /* If we are setting the whole register, we know its value. Otherwise
8678 show that we don't know the value. We can handle SUBREG in
8680 if (GET_CODE (setter) == SET && dest == SET_DEST (setter))
8681 record_value_for_reg (dest, record_dead_insn, SET_SRC (setter));
8682 else if (GET_CODE (setter) == SET
8683 && GET_CODE (SET_DEST (setter)) == SUBREG
8684 && SUBREG_REG (SET_DEST (setter)) == dest
8685 && subreg_lowpart_p (SET_DEST (setter)))
8686 record_value_for_reg (dest, record_dead_insn,
8687 gen_lowpart_for_combine (GET_MODE (dest),
8690 record_value_for_reg (dest, record_dead_insn, NULL_RTX);
8692 else if (GET_CODE (dest) == MEM
8693 /* Ignore pushes, they clobber nothing. */
8694 && ! push_operand (dest, GET_MODE (dest)))
8695 mem_last_set = INSN_CUID (record_dead_insn);
8698 /* Update the records of when each REG was most recently set or killed
8699 for the things done by INSN. This is the last thing done in processing
8700 INSN in the combiner loop.
8702 We update reg_last_set, reg_last_set_value, reg_last_death, and also the
8703 similar information mem_last_set (which insn most recently modified memory)
8704 and last_call_cuid (which insn was the most recent subroutine call). */
8707 record_dead_and_set_regs (insn)
8711 for (link = REG_NOTES (insn); link; link = XEXP (link, 1))
8713 if (REG_NOTE_KIND (link) == REG_DEAD)
8714 reg_last_death[REGNO (XEXP (link, 0))] = insn;
8715 else if (REG_NOTE_KIND (link) == REG_INC)
8716 record_value_for_reg (XEXP (link, 0), insn, NULL_RTX);
8719 if (GET_CODE (insn) == CALL_INSN)
8720 last_call_cuid = mem_last_set = INSN_CUID (insn);
8722 record_dead_insn = insn;
8723 note_stores (PATTERN (insn), record_dead_and_set_regs_1);
8726 /* Utility routine for the following function. Verify that all the registers
8727 mentioned in *LOC are valid when *LOC was part of a value set when
8728 label_tick == TICK. Return 0 if some are not.
8730 If REPLACE is non-zero, replace the invalid reference with
8731 (clobber (const_int 0)) and return 1. This replacement is useful because
8732 we often can get useful information about the form of a value (e.g., if
8733 it was produced by a shift that always produces -1 or 0) even though
8734 we don't know exactly what registers it was produced from. */
8737 get_last_value_validate (loc, tick, replace)
8743 char *fmt = GET_RTX_FORMAT (GET_CODE (x));
8744 int len = GET_RTX_LENGTH (GET_CODE (x));
8747 if (GET_CODE (x) == REG)
8749 int regno = REGNO (x);
8750 int endregno = regno + (regno < FIRST_PSEUDO_REGISTER
8751 ? HARD_REGNO_NREGS (regno, GET_MODE (x)) : 1);
8754 for (j = regno; j < endregno; j++)
8755 if (reg_last_set_invalid[j]
8756 /* If this is a pseudo-register that was only set once, it is
8758 || (! (regno >= FIRST_PSEUDO_REGISTER && reg_n_sets[regno] == 1)
8759 && reg_last_set_label[j] > tick))
8762 *loc = gen_rtx (CLOBBER, GET_MODE (x), const0_rtx);
8769 for (i = 0; i < len; i++)
8771 && get_last_value_validate (&XEXP (x, i), tick, replace) == 0)
8772 /* Don't bother with these. They shouldn't occur anyway. */
8776 /* If we haven't found a reason for it to be invalid, it is valid. */
8780 /* Get the last value assigned to X, if known. Some registers
8781 in the value may be replaced with (clobber (const_int 0)) if their value
8782 is known longer known reliably. */
8791 /* If this is a non-paradoxical SUBREG, get the value of its operand and
8792 then convert it to the desired mode. If this is a paradoxical SUBREG,
8793 we cannot predict what values the "extra" bits might have. */
8794 if (GET_CODE (x) == SUBREG
8795 && subreg_lowpart_p (x)
8796 && (GET_MODE_SIZE (GET_MODE (x))
8797 <= GET_MODE_SIZE (GET_MODE (SUBREG_REG (x))))
8798 && (value = get_last_value (SUBREG_REG (x))) != 0)
8799 return gen_lowpart_for_combine (GET_MODE (x), value);
8801 if (GET_CODE (x) != REG)
8805 value = reg_last_set_value[regno];
8807 /* If we don't have a value or if it isn't for this basic block, return 0. */
8810 || (reg_n_sets[regno] != 1
8811 && (reg_last_set_label[regno] != label_tick)))
8814 /* If the value was set in a later insn that the ones we are processing,
8815 we can't use it even if the register was only set once, but make a quick
8816 check to see if the previous insn set it to something. This is commonly
8817 the case when the same pseudo is used by repeated insns. */
8819 if (INSN_CUID (reg_last_set[regno]) >= subst_low_cuid)
8823 for (insn = prev_nonnote_insn (subst_insn);
8824 insn && INSN_CUID (insn) >= subst_low_cuid;
8825 insn = prev_nonnote_insn (insn))
8829 && (set = single_set (insn)) != 0
8830 && rtx_equal_p (SET_DEST (set), x))
8832 value = SET_SRC (set);
8834 /* Make sure that VALUE doesn't reference X. Replace any
8835 expliit references with a CLOBBER. If there are any remaining
8836 references (rare), don't use the value. */
8838 if (reg_mentioned_p (x, value))
8839 value = replace_rtx (copy_rtx (value), x,
8840 gen_rtx (CLOBBER, GET_MODE (x), const0_rtx));
8842 if (reg_overlap_mentioned_p (x, value))
8849 /* If the value has all its registers valid, return it. */
8850 if (get_last_value_validate (&value, reg_last_set_label[regno], 0))
8853 /* Otherwise, make a copy and replace any invalid register with
8854 (clobber (const_int 0)). If that fails for some reason, return 0. */
8856 value = copy_rtx (value);
8857 if (get_last_value_validate (&value, reg_last_set_label[regno], 1))
8863 /* Return nonzero if expression X refers to a REG or to memory
8864 that is set in an instruction more recent than FROM_CUID. */
8867 use_crosses_set_p (x, from_cuid)
8873 register enum rtx_code code = GET_CODE (x);
8877 register int regno = REGNO (x);
8878 #ifdef PUSH_ROUNDING
8879 /* Don't allow uses of the stack pointer to be moved,
8880 because we don't know whether the move crosses a push insn. */
8881 if (regno == STACK_POINTER_REGNUM)
8884 return (reg_last_set[regno]
8885 && INSN_CUID (reg_last_set[regno]) > from_cuid);
8888 if (code == MEM && mem_last_set > from_cuid)
8891 fmt = GET_RTX_FORMAT (code);
8893 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
8898 for (j = XVECLEN (x, i) - 1; j >= 0; j--)
8899 if (use_crosses_set_p (XVECEXP (x, i, j), from_cuid))
8902 else if (fmt[i] == 'e'
8903 && use_crosses_set_p (XEXP (x, i), from_cuid))
8909 /* Define three variables used for communication between the following
8912 static int reg_dead_regno, reg_dead_endregno;
8913 static int reg_dead_flag;
8915 /* Function called via note_stores from reg_dead_at_p.
8917 If DEST is within [reg_dead_rengno, reg_dead_endregno), set
8918 reg_dead_flag to 1 if X is a CLOBBER and to -1 it is a SET. */
8921 reg_dead_at_p_1 (dest, x)
8925 int regno, endregno;
8927 if (GET_CODE (dest) != REG)
8930 regno = REGNO (dest);
8931 endregno = regno + (regno < FIRST_PSEUDO_REGISTER
8932 ? HARD_REGNO_NREGS (regno, GET_MODE (dest)) : 1);
8934 if (reg_dead_endregno > regno && reg_dead_regno < endregno)
8935 reg_dead_flag = (GET_CODE (x) == CLOBBER) ? 1 : -1;
8938 /* Return non-zero if REG is known to be dead at INSN.
8940 We scan backwards from INSN. If we hit a REG_DEAD note or a CLOBBER
8941 referencing REG, it is dead. If we hit a SET referencing REG, it is
8942 live. Otherwise, see if it is live or dead at the start of the basic
8946 reg_dead_at_p (reg, insn)
8952 /* Set variables for reg_dead_at_p_1. */
8953 reg_dead_regno = REGNO (reg);
8954 reg_dead_endregno = reg_dead_regno + (reg_dead_regno < FIRST_PSEUDO_REGISTER
8955 ? HARD_REGNO_NREGS (reg_dead_regno,
8961 /* Scan backwards until we find a REG_DEAD note, SET, CLOBBER, label, or
8962 beginning of function. */
8963 for (; insn && GET_CODE (insn) != CODE_LABEL;
8964 insn = prev_nonnote_insn (insn))
8966 note_stores (PATTERN (insn), reg_dead_at_p_1);
8968 return reg_dead_flag == 1 ? 1 : 0;
8970 if (find_regno_note (insn, REG_DEAD, reg_dead_regno))
8974 /* Get the basic block number that we were in. */
8979 for (block = 0; block < n_basic_blocks; block++)
8980 if (insn == basic_block_head[block])
8983 if (block == n_basic_blocks)
8987 for (i = reg_dead_regno; i < reg_dead_endregno; i++)
8988 if (basic_block_live_at_start[block][i / REGSET_ELT_BITS]
8989 & ((REGSET_ELT_TYPE) 1 << (i % REGSET_ELT_BITS)))
8995 /* Remove register number REGNO from the dead registers list of INSN.
8997 Return the note used to record the death, if there was one. */
9000 remove_death (regno, insn)
9004 register rtx note = find_regno_note (insn, REG_DEAD, regno);
9008 reg_n_deaths[regno]--;
9009 remove_note (insn, note);
9015 /* For each register (hardware or pseudo) used within expression X, if its
9016 death is in an instruction with cuid between FROM_CUID (inclusive) and
9017 TO_INSN (exclusive), put a REG_DEAD note for that register in the
9018 list headed by PNOTES.
9020 This is done when X is being merged by combination into TO_INSN. These
9021 notes will then be distributed as needed. */
9024 move_deaths (x, from_cuid, to_insn, pnotes)
9031 register int len, i;
9032 register enum rtx_code code = GET_CODE (x);
9036 register int regno = REGNO (x);
9037 register rtx where_dead = reg_last_death[regno];
9039 if (where_dead && INSN_CUID (where_dead) >= from_cuid
9040 && INSN_CUID (where_dead) < INSN_CUID (to_insn))
9042 rtx note = remove_death (regno, reg_last_death[regno]);
9044 /* It is possible for the call above to return 0. This can occur
9045 when reg_last_death points to I2 or I1 that we combined with.
9046 In that case make a new note. */
9050 XEXP (note, 1) = *pnotes;
9054 *pnotes = gen_rtx (EXPR_LIST, REG_DEAD, x, *pnotes);
9056 reg_n_deaths[regno]++;
9062 else if (GET_CODE (x) == SET)
9064 rtx dest = SET_DEST (x);
9066 move_deaths (SET_SRC (x), from_cuid, to_insn, pnotes);
9068 /* In the case of a ZERO_EXTRACT, a STRICT_LOW_PART, or a SUBREG
9069 that accesses one word of a multi-word item, some
9070 piece of everything register in the expression is used by
9071 this insn, so remove any old death. */
9073 if (GET_CODE (dest) == ZERO_EXTRACT
9074 || GET_CODE (dest) == STRICT_LOW_PART
9075 || (GET_CODE (dest) == SUBREG
9076 && (((GET_MODE_SIZE (GET_MODE (dest))
9077 + UNITS_PER_WORD - 1) / UNITS_PER_WORD)
9078 == ((GET_MODE_SIZE (GET_MODE (SUBREG_REG (dest)))
9079 + UNITS_PER_WORD - 1) / UNITS_PER_WORD))))
9081 move_deaths (dest, from_cuid, to_insn, pnotes);
9085 /* If this is some other SUBREG, we know it replaces the entire
9086 value, so use that as the destination. */
9087 if (GET_CODE (dest) == SUBREG)
9088 dest = SUBREG_REG (dest);
9090 /* If this is a MEM, adjust deaths of anything used in the address.
9091 For a REG (the only other possibility), the entire value is
9092 being replaced so the old value is not used in this insn. */
9094 if (GET_CODE (dest) == MEM)
9095 move_deaths (XEXP (dest, 0), from_cuid, to_insn, pnotes);
9099 else if (GET_CODE (x) == CLOBBER)
9102 len = GET_RTX_LENGTH (code);
9103 fmt = GET_RTX_FORMAT (code);
9105 for (i = 0; i < len; i++)
9110 for (j = XVECLEN (x, i) - 1; j >= 0; j--)
9111 move_deaths (XVECEXP (x, i, j), from_cuid, to_insn, pnotes);
9113 else if (fmt[i] == 'e')
9114 move_deaths (XEXP (x, i), from_cuid, to_insn, pnotes);
9118 /* Return 1 if X is the target of a bit-field assignment in BODY, the
9119 pattern of an insn. X must be a REG. */
9122 reg_bitfield_target_p (x, body)
9128 if (GET_CODE (body) == SET)
9130 rtx dest = SET_DEST (body);
9132 int regno, tregno, endregno, endtregno;
9134 if (GET_CODE (dest) == ZERO_EXTRACT)
9135 target = XEXP (dest, 0);
9136 else if (GET_CODE (dest) == STRICT_LOW_PART)
9137 target = SUBREG_REG (XEXP (dest, 0));
9141 if (GET_CODE (target) == SUBREG)
9142 target = SUBREG_REG (target);
9144 if (GET_CODE (target) != REG)
9147 tregno = REGNO (target), regno = REGNO (x);
9148 if (tregno >= FIRST_PSEUDO_REGISTER || regno >= FIRST_PSEUDO_REGISTER)
9151 endtregno = tregno + HARD_REGNO_NREGS (tregno, GET_MODE (target));
9152 endregno = regno + HARD_REGNO_NREGS (regno, GET_MODE (x));
9154 return endregno > tregno && regno < endtregno;
9157 else if (GET_CODE (body) == PARALLEL)
9158 for (i = XVECLEN (body, 0) - 1; i >= 0; i--)
9159 if (reg_bitfield_target_p (x, XVECEXP (body, 0, i)))
9165 /* Given a chain of REG_NOTES originally from FROM_INSN, try to place them
9166 as appropriate. I3 and I2 are the insns resulting from the combination
9167 insns including FROM (I2 may be zero).
9169 ELIM_I2 and ELIM_I1 are either zero or registers that we know will
9170 not need REG_DEAD notes because they are being substituted for. This
9171 saves searching in the most common cases.
9173 Each note in the list is either ignored or placed on some insns, depending
9174 on the type of note. */
9177 distribute_notes (notes, from_insn, i3, i2, elim_i2, elim_i1)
9181 rtx elim_i2, elim_i1;
9183 rtx note, next_note;
9186 for (note = notes; note; note = next_note)
9188 rtx place = 0, place2 = 0;
9190 /* If this NOTE references a pseudo register, ensure it references
9191 the latest copy of that register. */
9192 if (XEXP (note, 0) && GET_CODE (XEXP (note, 0)) == REG
9193 && REGNO (XEXP (note, 0)) >= FIRST_PSEUDO_REGISTER)
9194 XEXP (note, 0) = regno_reg_rtx[REGNO (XEXP (note, 0))];
9196 next_note = XEXP (note, 1);
9197 switch (REG_NOTE_KIND (note))
9200 /* If this register is set or clobbered in I3, put the note there
9201 unless there is one already. */
9202 if (reg_set_p (XEXP (note, 0), PATTERN (i3)))
9204 if (! (GET_CODE (XEXP (note, 0)) == REG
9205 ? find_regno_note (i3, REG_UNUSED, REGNO (XEXP (note, 0)))
9206 : find_reg_note (i3, REG_UNUSED, XEXP (note, 0))))
9209 /* Otherwise, if this register is used by I3, then this register
9210 now dies here, so we must put a REG_DEAD note here unless there
9212 else if (reg_referenced_p (XEXP (note, 0), PATTERN (i3))
9213 && ! (GET_CODE (XEXP (note, 0)) == REG
9214 ? find_regno_note (i3, REG_DEAD, REGNO (XEXP (note, 0)))
9215 : find_reg_note (i3, REG_DEAD, XEXP (note, 0))))
9217 PUT_REG_NOTE_KIND (note, REG_DEAD);
9225 /* These notes say something about results of an insn. We can
9226 only support them if they used to be on I3 in which case they
9227 remain on I3. Otherwise they are ignored.
9229 If the note refers to an expression that is not a constant, we
9230 must also ignore the note since we cannot tell whether the
9231 equivalence is still true. It might be possible to do
9232 slightly better than this (we only have a problem if I2DEST
9233 or I1DEST is present in the expression), but it doesn't
9234 seem worth the trouble. */
9237 && (XEXP (note, 0) == 0 || CONSTANT_P (XEXP (note, 0))))
9242 case REG_NO_CONFLICT:
9244 /* These notes say something about how a register is used. They must
9245 be present on any use of the register in I2 or I3. */
9246 if (reg_mentioned_p (XEXP (note, 0), PATTERN (i3)))
9249 if (i2 && reg_mentioned_p (XEXP (note, 0), PATTERN (i2)))
9259 /* It is too much trouble to try to see if this note is still
9260 correct in all situations. It is better to simply delete it. */
9264 /* If the insn previously containing this note still exists,
9265 put it back where it was. Otherwise move it to the previous
9266 insn. Adjust the corresponding REG_LIBCALL note. */
9267 if (GET_CODE (from_insn) != NOTE)
9271 tem = find_reg_note (XEXP (note, 0), REG_LIBCALL, NULL_RTX);
9272 place = prev_real_insn (from_insn);
9274 XEXP (tem, 0) = place;
9279 /* This is handled similarly to REG_RETVAL. */
9280 if (GET_CODE (from_insn) != NOTE)
9284 tem = find_reg_note (XEXP (note, 0), REG_RETVAL, NULL_RTX);
9285 place = next_real_insn (from_insn);
9287 XEXP (tem, 0) = place;
9292 /* If the register is used as an input in I3, it dies there.
9293 Similarly for I2, if it is non-zero and adjacent to I3.
9295 If the register is not used as an input in either I3 or I2
9296 and it is not one of the registers we were supposed to eliminate,
9297 there are two possibilities. We might have a non-adjacent I2
9298 or we might have somehow eliminated an additional register
9299 from a computation. For example, we might have had A & B where
9300 we discover that B will always be zero. In this case we will
9301 eliminate the reference to A.
9303 In both cases, we must search to see if we can find a previous
9304 use of A and put the death note there. */
9306 if (reg_referenced_p (XEXP (note, 0), PATTERN (i3)))
9308 else if (i2 != 0 && next_nonnote_insn (i2) == i3
9309 && reg_referenced_p (XEXP (note, 0), PATTERN (i2)))
9312 if (XEXP (note, 0) == elim_i2 || XEXP (note, 0) == elim_i1)
9315 /* If the register is used in both I2 and I3 and it dies in I3,
9316 we might have added another reference to it. If reg_n_refs
9317 was 2, bump it to 3. This has to be correct since the
9318 register must have been set somewhere. The reason this is
9319 done is because local-alloc.c treats 2 references as a
9322 if (place == i3 && i2 != 0 && GET_CODE (XEXP (note, 0)) == REG
9323 && reg_n_refs[REGNO (XEXP (note, 0))]== 2
9324 && reg_referenced_p (XEXP (note, 0), PATTERN (i2)))
9325 reg_n_refs[REGNO (XEXP (note, 0))] = 3;
9328 for (tem = prev_nonnote_insn (i3);
9329 tem && (GET_CODE (tem) == INSN
9330 || GET_CODE (tem) == CALL_INSN);
9331 tem = prev_nonnote_insn (tem))
9333 /* If the register is being set at TEM, see if that is all
9334 TEM is doing. If so, delete TEM. Otherwise, make this
9335 into a REG_UNUSED note instead. */
9336 if (reg_set_p (XEXP (note, 0), PATTERN (tem)))
9338 rtx set = single_set (tem);
9340 /* Verify that it was the set, and not a clobber that
9341 modified the register. */
9343 if (set != 0 && ! side_effects_p (SET_SRC (set))
9344 && rtx_equal_p (XEXP (note, 0), SET_DEST (set)))
9346 /* Move the notes and links of TEM elsewhere.
9347 This might delete other dead insns recursively.
9348 First set the pattern to something that won't use
9351 PATTERN (tem) = pc_rtx;
9353 distribute_notes (REG_NOTES (tem), tem, tem,
9354 NULL_RTX, NULL_RTX, NULL_RTX);
9355 distribute_links (LOG_LINKS (tem));
9357 PUT_CODE (tem, NOTE);
9358 NOTE_LINE_NUMBER (tem) = NOTE_INSN_DELETED;
9359 NOTE_SOURCE_FILE (tem) = 0;
9363 PUT_REG_NOTE_KIND (note, REG_UNUSED);
9365 /* If there isn't already a REG_UNUSED note, put one
9367 if (! find_regno_note (tem, REG_UNUSED,
9368 REGNO (XEXP (note, 0))))
9373 else if (reg_referenced_p (XEXP (note, 0), PATTERN (tem)))
9380 /* If the register is set or already dead at PLACE, we needn't do
9381 anything with this note if it is still a REG_DEAD note.
9383 Note that we cannot use just `dead_or_set_p' here since we can
9384 convert an assignment to a register into a bit-field assignment.
9385 Therefore, we must also omit the note if the register is the
9386 target of a bitfield assignment. */
9388 if (place && REG_NOTE_KIND (note) == REG_DEAD)
9390 int regno = REGNO (XEXP (note, 0));
9392 if (dead_or_set_p (place, XEXP (note, 0))
9393 || reg_bitfield_target_p (XEXP (note, 0), PATTERN (place)))
9395 /* Unless the register previously died in PLACE, clear
9396 reg_last_death. [I no longer understand why this is
9398 if (reg_last_death[regno] != place)
9399 reg_last_death[regno] = 0;
9403 reg_last_death[regno] = place;
9405 /* If this is a death note for a hard reg that is occupying
9406 multiple registers, ensure that we are still using all
9407 parts of the object. If we find a piece of the object
9408 that is unused, we must add a USE for that piece before
9409 PLACE and put the appropriate REG_DEAD note on it.
9411 An alternative would be to put a REG_UNUSED for the pieces
9412 on the insn that set the register, but that can't be done if
9413 it is not in the same block. It is simpler, though less
9414 efficient, to add the USE insns. */
9416 if (place && regno < FIRST_PSEUDO_REGISTER
9417 && HARD_REGNO_NREGS (regno, GET_MODE (XEXP (note, 0))) > 1)
9420 = regno + HARD_REGNO_NREGS (regno,
9421 GET_MODE (XEXP (note, 0)));
9425 for (i = regno; i < endregno; i++)
9426 if (! refers_to_regno_p (i, i + 1, PATTERN (place), 0))
9428 rtx piece = gen_rtx (REG, word_mode, i);
9431 /* See if we already placed a USE note for this
9432 register in front of PLACE. */
9434 GET_CODE (PREV_INSN (p)) == INSN
9435 && GET_CODE (PATTERN (PREV_INSN (p))) == USE;
9437 if (rtx_equal_p (piece,
9438 XEXP (PATTERN (PREV_INSN (p)), 0)))
9447 = emit_insn_before (gen_rtx (USE, VOIDmode,
9450 REG_NOTES (use_insn)
9451 = gen_rtx (EXPR_LIST, REG_DEAD, piece,
9452 REG_NOTES (use_insn));
9460 /* Put only REG_DEAD notes for pieces that are
9461 still used and that are not already dead or set. */
9463 for (i = regno; i < endregno; i++)
9465 rtx piece = gen_rtx (REG, word_mode, i);
9467 if (reg_referenced_p (piece, PATTERN (place))
9468 && ! dead_or_set_p (place, piece)
9469 && ! reg_bitfield_target_p (piece,
9471 REG_NOTES (place) = gen_rtx (EXPR_LIST, REG_DEAD,
9483 /* Any other notes should not be present at this point in the
9490 XEXP (note, 1) = REG_NOTES (place);
9491 REG_NOTES (place) = note;
9493 else if ((REG_NOTE_KIND (note) == REG_DEAD
9494 || REG_NOTE_KIND (note) == REG_UNUSED)
9495 && GET_CODE (XEXP (note, 0)) == REG)
9496 reg_n_deaths[REGNO (XEXP (note, 0))]--;
9500 if ((REG_NOTE_KIND (note) == REG_DEAD
9501 || REG_NOTE_KIND (note) == REG_UNUSED)
9502 && GET_CODE (XEXP (note, 0)) == REG)
9503 reg_n_deaths[REGNO (XEXP (note, 0))]++;
9505 REG_NOTES (place2) = gen_rtx (GET_CODE (note), REG_NOTE_KIND (note),
9506 XEXP (note, 0), REG_NOTES (place2));
9511 /* Similarly to above, distribute the LOG_LINKS that used to be present on
9512 I3, I2, and I1 to new locations. This is also called in one case to
9513 add a link pointing at I3 when I3's destination is changed. */
9516 distribute_links (links)
9519 rtx link, next_link;
9521 for (link = links; link; link = next_link)
9527 next_link = XEXP (link, 1);
9529 /* If the insn that this link points to is a NOTE or isn't a single
9530 set, ignore it. In the latter case, it isn't clear what we
9531 can do other than ignore the link, since we can't tell which
9532 register it was for. Such links wouldn't be used by combine
9535 It is not possible for the destination of the target of the link to
9536 have been changed by combine. The only potential of this is if we
9537 replace I3, I2, and I1 by I3 and I2. But in that case the
9538 destination of I2 also remains unchanged. */
9540 if (GET_CODE (XEXP (link, 0)) == NOTE
9541 || (set = single_set (XEXP (link, 0))) == 0)
9544 reg = SET_DEST (set);
9545 while (GET_CODE (reg) == SUBREG || GET_CODE (reg) == ZERO_EXTRACT
9546 || GET_CODE (reg) == SIGN_EXTRACT
9547 || GET_CODE (reg) == STRICT_LOW_PART)
9548 reg = XEXP (reg, 0);
9550 /* A LOG_LINK is defined as being placed on the first insn that uses
9551 a register and points to the insn that sets the register. Start
9552 searching at the next insn after the target of the link and stop
9553 when we reach a set of the register or the end of the basic block.
9555 Note that this correctly handles the link that used to point from
9556 I3 to I2. Also note that not much searching is typically done here
9557 since most links don't point very far away. */
9559 for (insn = NEXT_INSN (XEXP (link, 0));
9560 (insn && GET_CODE (insn) != CODE_LABEL
9561 && GET_CODE (PREV_INSN (insn)) != JUMP_INSN);
9562 insn = NEXT_INSN (insn))
9563 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i'
9564 && reg_overlap_mentioned_p (reg, PATTERN (insn)))
9566 if (reg_referenced_p (reg, PATTERN (insn)))
9571 /* If we found a place to put the link, place it there unless there
9572 is already a link to the same insn as LINK at that point. */
9578 for (link2 = LOG_LINKS (place); link2; link2 = XEXP (link2, 1))
9579 if (XEXP (link2, 0) == XEXP (link, 0))
9584 XEXP (link, 1) = LOG_LINKS (place);
9585 LOG_LINKS (place) = link;
9592 dump_combine_stats (file)
9597 ";; Combiner statistics: %d attempts, %d substitutions (%d requiring new space),\n;; %d successes.\n\n",
9598 combine_attempts, combine_merges, combine_extras, combine_successes);
9602 dump_combine_total_stats (file)
9607 "\n;; Combiner totals: %d attempts, %d substitutions (%d requiring new space),\n;; %d successes.\n",
9608 total_attempts, total_merges, total_extras, total_successes);