| blob | 03e9a7809193fd882203997b15a5e0a15609626d |
1 /* Optimize by combining instructions for GNU compiler.
2 Copyright (C) 1987-2021 Free Software Foundation, Inc.
4 This file is part of GCC.
6 GCC is free software; you can redistribute it and/or modify it under
7 the terms of the GNU General Public License as published by the Free
8 Software Foundation; either version 3, or (at your option) any later
9 version.
11 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
12 WARRANTY; without even the implied warranty of MERCHANTABILITY or
13 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
14 for more details.
16 You should have received a copy of the GNU General Public License
17 along with GCC; see the file COPYING3. If not see
18 <http://www.gnu.org/licenses/>. */
20 /* This module is essentially the "combiner" phase of the U. of Arizona
21 Portable Optimizer, but redone to work on our list-structured
22 representation for RTL instead of their string representation.
24 The LOG_LINKS of each insn identify the most recent assignment
25 to each REG used in the insn. It is a list of previous insns,
26 each of which contains a SET for a REG that is used in this insn
27 and not used or set in between. LOG_LINKs never cross basic blocks.
28 They were set up by the preceding pass (lifetime analysis).
30 We try to combine each pair of insns joined by a logical link.
31 We also try to combine triplets of insns A, B and C when C has
32 a link back to B and B has a link back to A. Likewise for a
33 small number of quadruplets of insns A, B, C and D for which
34 there's high likelihood of success.
36 We check (with modified_between_p) to avoid combining in such a way
37 as to move a computation to a place where its value would be different.
39 Combination is done by mathematically substituting the previous
40 insn(s) values for the regs they set into the expressions in
41 the later insns that refer to these regs. If the result is a valid insn
42 for our target machine, according to the machine description,
43 we install it, delete the earlier insns, and update the data flow
44 information (LOG_LINKS and REG_NOTES) for what we did.
46 There are a few exceptions where the dataflow information isn't
47 completely updated (however this is only a local issue since it is
48 regenerated before the next pass that uses it):
50 - reg_live_length is not updated
51 - reg_n_refs is not adjusted in the rare case when a register is
52 no longer required in a computation
53 - there are extremely rare cases (see distribute_notes) when a
54 REG_DEAD note is lost
55 - a LOG_LINKS entry that refers to an insn with multiple SETs may be
56 removed because there is no way to know which register it was
57 linking
59 To simplify substitution, we combine only when the earlier insn(s)
60 consist of only a single assignment. To simplify updating afterward,
61 we never combine when a subroutine call appears in the middle. */
83 /* Include expr.h after insn-config.h so we get HAVE_conditional_move. */
95 /* Number of attempts to combine instructions in this function. */
99 /* Number of attempts that got as far as substitution in this function. */
103 /* Number of instructions combined with added SETs in this function. */
107 /* Number of instructions combined in this function. */
111 /* Totals over entire compilation. */
115 /* combine_instructions may try to replace the right hand side of the
116 second instruction with the value of an associated REG_EQUAL note
117 before throwing it at try_combine. That is problematic when there
118 is a REG_DEAD note for a register used in the old right hand side
119 and can cause distribute_notes to do wrong things. This is the
120 second instruction if it has been so modified, null otherwise. */
124 /* When I2MOD is nonnull, this is a copy of the old right hand side. */
128 /* When I2MOD is nonnull, this is a copy of the new right hand side. */
131 \f
133 /* Record last point of death of (hard or pseudo) register n. */
136 /* Record last point of modification of (hard or pseudo) register n. */
139 /* The next group of fields allows the recording of the last value assigned
140 to (hard or pseudo) register n. We use this information to see if an
141 operation being processed is redundant given a prior operation performed
142 on the register. For example, an `and' with a constant is redundant if
143 all the zero bits are already known to be turned off.
145 We use an approach similar to that used by cse, but change it in the
146 following ways:
148 (1) We do not want to reinitialize at each label.
149 (2) It is useful, but not critical, to know the actual value assigned
150 to a register. Often just its form is helpful.
152 Therefore, we maintain the following fields:
154 last_set_value the last value assigned
155 last_set_label records the value of label_tick when the
156 register was assigned
157 last_set_table_tick records the value of label_tick when a
158 value using the register is assigned
159 last_set_invalid set to nonzero when it is not valid
160 to use the value of this register in some
161 register's value
163 To understand the usage of these tables, it is important to understand
164 the distinction between the value in last_set_value being valid and
165 the register being validly contained in some other expression in the
166 table.
168 (The next two parameters are out of date).
170 reg_stat[i].last_set_value is valid if it is nonzero, and either
171 reg_n_sets[i] is 1 or reg_stat[i].last_set_label == label_tick.
173 Register I may validly appear in any expression returned for the value
174 of another register if reg_n_sets[i] is 1. It may also appear in the
175 value for register J if reg_stat[j].last_set_invalid is zero, or
176 reg_stat[i].last_set_label < reg_stat[j].last_set_label.
178 If an expression is found in the table containing a register which may
179 not validly appear in an expression, the register is replaced by
180 something that won't match, (clobber (const_int 0)). */
182 /* Record last value assigned to (hard or pseudo) register n. */
184 rtx last_set_value;
186 /* Record the value of label_tick when an expression involving register n
187 is placed in last_set_value. */
191 /* Record the value of label_tick when the value for register n is placed in
192 last_set_value. */
196 /* These fields are maintained in parallel with last_set_value and are
197 used to store the mode in which the register was last set, the bits
198 that were known to be zero when it was last set, and the number of
199 sign bits copies it was known to have when it was last set. */
205 /* Set nonzero if references to register n in expressions should not be
206 used. last_set_invalid is set nonzero when this register is being
207 assigned to and last_set_table_tick == label_tick. */
211 /* Some registers that are set more than once and used in more than one
212 basic block are nevertheless always set in similar ways. For example,
213 a QImode register may be loaded from memory in two places on a machine
214 where byte loads zero extend.
216 We record in the following fields if a register has some leading bits
217 that are always equal to the sign bit, and what we know about the
218 nonzero bits of a register, specifically which bits are known to be
219 zero.
221 If an entry is zero, it means that we don't know anything special. */
227 /* Record the value of the label_tick when the last truncation
228 happened. The field truncated_to_mode is only valid if
229 truncation_label == label_tick. */
233 /* Record the last truncation seen for this register. If truncation
234 is not a nop to this mode we might be able to save an explicit
235 truncation if we know that value already contains a truncated
236 value. */
239 };
244 /* One plus the highest pseudo for which we track REG_N_SETS.
245 regstat_init_n_sets_and_refs allocates the array for REG_N_SETS just once,
246 but during combine_split_insns new pseudos can be created. As we don't have
247 updated DF information in that case, it is hard to initialize the array
248 after growing. The combiner only cares about REG_N_SETS (regno) == 1,
249 so instead of growing the arrays, just assume all newly created pseudos
250 during combine might be set multiple times. */
254 /* Record the luid of the last insn that invalidated memory
255 (anything that writes memory, and subroutine calls, but not pushes). */
259 /* Record the luid of the last CALL_INSN
260 so we can tell whether a potential combination crosses any calls. */
264 /* When `subst' is called, this is the insn that is being modified
265 (by combining in a previous insn). The PATTERN of this insn
266 is still the old pattern partially modified and it should not be
267 looked at, but this may be used to examine the successors of the insn
268 to judge whether a simplification is valid. */
272 /* This is the lowest LUID that `subst' is currently dealing with.
273 get_last_value will not return a value if the register was set at or
274 after this LUID. If not for this mechanism, we could get confused if
275 I2 or I1 in try_combine were an insn that used the old value of a register
276 to obtain a new value. In that case, we might erroneously get the
277 new value of the register when we wanted the old one. */
281 /* This contains any hard registers that are used in newpat; reg_dead_at_p
282 must consider all these registers to be always live. */
286 /* This is an insn to which a LOG_LINKS entry has been added. If this
287 insn is the earlier than I2 or I3, combine should rescan starting at
288 that location. */
292 /* And similarly, for notes. */
296 /* Basic block in which we are performing combines. */
300 \f
301 /* Length of the currently allocated uid_insn_cost array. */
305 /* The following array records the insn_cost for every insn
306 in the instruction stream. */
310 /* The following array records the LOG_LINKS for every insn in the
311 instruction stream as struct insn_link pointers. */
317 };
323 {
327 }
329 #define INSN_COST(INSN) (uid_insn_cost[insn_uid_check (INSN)])
330 #define LOG_LINKS(INSN) (uid_log_links[insn_uid_check (INSN)])
332 #define FOR_EACH_LOG_LINK(L, INSN) \
333 for ((L) = LOG_LINKS (INSN); (L); (L) = (L)->next)
335 /* Links for LOG_LINKS are allocated from this obstack. */
339 /* Allocate a link. */
343 {
351 }
353 /* Incremented for each basic block. */
357 /* Reset to label_tick for each extended basic block in scanning order. */
361 /* Mode used to compute significance in reg_stat[].nonzero_bits. It is the
362 largest integer mode that can fit in HOST_BITS_PER_WIDE_INT. */
366 /* Nonzero when reg_stat[].nonzero_bits and reg_stat[].sign_bit_copies can
367 be safely used. It is zero while computing them and after combine has
368 completed. This former test prevents propagating values based on
369 previously set values, which can be incorrect if a variable is modified
370 in a loop. */
374 \f
375 /* Record one modification to rtl structure
376 to be undone by storing old_contents into *where. */
380 struct undo
381 {
386 };
388 /* Record a bunch of changes to be undone, up to MAX_UNDO of them.
389 num_undo says how many are currently recorded.
391 other_insn is nonzero if we have modified some other insn in the process
392 of working on subst_insn. It must be verified too. */
394 struct undobuf
395 {
399 };
403 /* Number of times the pseudo being substituted for
404 was found and replaced. */
409 scalar_int_mode,
412 scalar_int_mode,
484 \f
486 /* It is not safe to use ordinary gen_lowpart in combine.
487 See comments in gen_lowpart_for_combine. */
488 #undef RTL_HOOKS_GEN_LOWPART
489 #define RTL_HOOKS_GEN_LOWPART gen_lowpart_for_combine
491 /* Our implementation of gen_lowpart never emits a new pseudo. */
492 #undef RTL_HOOKS_GEN_LOWPART_NO_EMIT
493 #define RTL_HOOKS_GEN_LOWPART_NO_EMIT gen_lowpart_for_combine
495 #undef RTL_HOOKS_REG_NONZERO_REG_BITS
496 #define RTL_HOOKS_REG_NONZERO_REG_BITS reg_nonzero_bits_for_combine
498 #undef RTL_HOOKS_REG_NUM_SIGN_BIT_COPIES
499 #define RTL_HOOKS_REG_NUM_SIGN_BIT_COPIES reg_num_sign_bit_copies_for_combine
501 #undef RTL_HOOKS_REG_TRUNCATED_TO_MODE
502 #define RTL_HOOKS_REG_TRUNCATED_TO_MODE reg_truncated_to_mode
506 \f
507 /* Convenience wrapper for the canonicalize_comparison target hook.
508 Target hooks cannot use enum rtx_code. */
512 {
516 }
518 /* Try to split PATTERN found in INSN. This returns NULL_RTX if
519 PATTERN cannot be split. Otherwise, it returns an insn sequence.
520 This is a wrapper around split_insns which ensures that the
521 reg_stat vector is made larger if the splitter creates a new
522 register. */
526 {
535 }
537 /* This is used by find_single_use to locate an rtx in LOC that
538 contains exactly one use of DEST, which is typically a REG.
539 It returns a pointer to the innermost rtx expression
540 containing DEST. Appearances of DEST that are being used to
541 totally replace it are not counted. */
545 {
554 {
558 CASE_CONST_ANY:
563 /* If the destination is anything other than PC, a REG or a SUBREG
564 of a REG that occupies all of the REG, the insn uses DEST if
565 it is mentioned in the destination or the source. Otherwise, we
566 need just check the source. */
582 }
584 /* If it wasn't one of the common cases above, check each expression and
585 vector of this code. Look for a unique usage of DEST. */
589 {
591 {
596 else
602 /* Duplicate usage. */
604 }
606 {
610 {
616 else
623 }
624 }
625 }
628 }
631 /* See if DEST, produced in INSN, is used only a single time in the
632 sequel. If so, return a pointer to the innermost rtx expression in which
633 it is used.
635 If PLOC is nonzero, *PLOC is set to the insn containing the single use.
637 Otherwise, we find the single use by finding an insn that has a
638 LOG_LINKS pointing at INSN and has a REG_DEAD note for DEST. If DEST is
639 only referenced once in that insn, we know that it must be the first
640 and last insn referencing DEST. */
644 {
645 basic_block bb;
658 {
664 {
669 }
670 }
673 }
674 \f
675 /* Substitute NEWVAL, an rtx expression, into INTO, a place in some
676 insn. The substitution can be undone by undo_all. If INTO is already
677 set to NEWVAL, do not record this change. Because computing NEWVAL might
678 also call SUBST, we have to compute it before we put anything into
679 the undo table. */
681 static void
683 {
690 /* We'd like to catch as many invalid transformations here as
691 possible. Unfortunately, there are way too many mode changes
692 that are perfectly valid, so we'd waste too much effort for
693 little gain doing the checks here. Focus on catching invalid
694 transformations involving integer constants. */
697 {
698 /* Sanity check that we're replacing oldval with a CONST_INT
699 that is a valid sign-extension for the original mode. */
703 /* Replacing the operand of a SUBREG or a ZERO_EXTEND with a
704 CONST_INT is not valid, because after the replacement, the
705 original mode would be gone. Unfortunately, we can't tell
706 when do_SUBST is called to replace the operand thereof, so we
707 perform this test on oldval instead, checking whether an
708 invalid replacement took place before we got here. */
713 }
717 else
726 }
728 #define SUBST(INTO, NEWVAL) do_SUBST (&(INTO), (NEWVAL))
730 /* Similar to SUBST, but NEWVAL is an int expression. Note that substitution
731 for the value of a HOST_WIDE_INT value (including CONST_INT) is
732 not safe. */
734 static void
736 {
745 else
754 }
756 #define SUBST_INT(INTO, NEWVAL) do_SUBST_INT (&(INTO), (NEWVAL))
758 /* Similar to SUBST, but just substitute the mode. This is used when
759 changing the mode of a pseudo-register, so that any other
760 references to the entry in the regno_reg_rtx array will change as
761 well. */
763 static void
765 {
774 else
783 }
785 #define SUBST_MODE(INTO, NEWVAL) do_SUBST_MODE (&(INTO), (NEWVAL))
787 /* Similar to SUBST, but NEWVAL is a LOG_LINKS expression. */
789 static void
791 {
800 else
809 }
811 #define SUBST_LINK(oldval, newval) do_SUBST_LINK (&oldval, newval)
812 \f
813 /* Subroutine of try_combine. Determine whether the replacement patterns
814 NEWPAT, NEWI2PAT and NEWOTHERPAT are cheaper according to insn_cost
815 than the original sequence I0, I1, I2, I3 and undobuf.other_insn. Note
816 that I0, I1 and/or NEWI2PAT may be NULL_RTX. Similarly, NEWOTHERPAT and
817 undobuf.other_insn may also both be NULL_RTX. Return false if the cost
818 of all the instructions can be estimated and the replacements are more
819 expensive than the original sequence. */
821 static bool
824 {
829 /* Lookup the original insn_costs. */
834 {
837 {
841 }
842 else
843 {
847 }
848 }
849 else
850 {
853 }
855 /* If we have split a PARALLEL I2 to I1,I2, we have counted its cost twice;
856 correct that. */
861 /* Calculate the replacement insn_costs. */
870 {
880 }
881 else
882 {
885 }
888 {
897 optimize_this_for_speed_p);
901 {
904 }
905 else
907 }
909 /* Disallow this combination if both new_cost and old_cost are greater than
910 zero, and new_cost is greater than old cost. */
914 {
933 else
935 }
940 /* Update the uid_insn_cost array with the replacement costs. */
944 {
948 }
951 }
954 /* Delete any insns that copy a register to itself.
955 Return true if the CFG was changed. */
957 static bool
959 {
961 basic_block bb;
966 {
968 {
971 {
976 }
977 }
978 }
981 }
983 \f
984 /* Return false if we do not want to (or cannot) combine DEF. */
985 static bool
987 {
988 /* Do not consider if it is pre/post modification in MEM. */
994 /* Do not combine frame pointer adjustments. */
997 || (!HARD_FRAME_POINTER_IS_FRAME_POINTER
1005 }
1007 /* Return false if we do not want to (or cannot) combine USE. */
1008 static bool
1010 {
1011 /* Do not consider the usage of the stack pointer by function call. */
1016 }
1018 /* Fill in log links field for all insns. */
1020 static void
1022 {
1023 basic_block bb;
1030 /* Pass through each block from the end, recording the uses of each
1031 register and establishing log links when def is encountered.
1032 Note that we do not clear next_use array in order to save time,
1033 so we have to test whether the use is in the same basic block as def.
1035 There are a few cases below when we do not consider the definition or
1036 usage -- these are taken from original flow.c did. Don't ask me why it is
1037 done this way; I don't know and if it works, I don't want to know. */
1040 {
1042 {
1046 /* Log links are created only once. */
1050 {
1066 /* flow.c claimed:
1068 We don't build a LOG_LINK for hard registers contained
1069 in ASM_OPERANDs. If these registers get replaced,
1070 we might wind up changing the semantics of the insn,
1071 even if reload can make what appear to be valid
1072 assignments later. */
1077 /* Don't add duplicate links between instructions. */
1086 }
1091 }
1092 }
1095 }
1097 /* Walk the LOG_LINKS of insn B to see if we find a reference to A. Return
1098 true if we found a LOG_LINK that proves that A feeds B. This only works
1099 if there are no instructions between A and B which could have a link
1100 depending on A, since in that case we would not record a link for B. */
1102 static bool
1104 {
1110 }
1111 \f
1112 /* Main entry point for combiner. F is the first insn of the function.
1113 NREGS is the first unused pseudo-reg number.
1115 Return nonzero if the CFG was changed (e.g. if the combiner has
1116 turned an indirect jump instruction into a direct jump). */
1117 static int
1119 {
1123 basic_block last_bb;
1143 /* Allocate array for insn info. */
1151 /* Don't use reg_stat[].nonzero_bits when computing it. This can cause
1152 problems when, for example, we have j <<= 1 in a loop. */
1157 /* Scan all SETs and see if we can deduce anything about what
1158 bits are known to be zero for some registers and how many copies
1159 of the sign bit are known to exist for those registers.
1161 Also set any known values so that we can use it while searching
1162 for what bits are known to be set. */
1165 /* Allow the entry block and the first block to fall into the same EBB.
1166 Conceptually the incoming promotions are assigned to the entry block. */
1171 {
1176 label_tick++;
1184 {
1185 rtx links;
1197 insn);
1199 /* Record the current insn_cost of this instruction. */
1202 {
1205 }
1206 }
1207 }
1211 /* Now scan all the insns in forward order. */
1219 {
1222 /* Ignore instruction combination in basic blocks that are going to
1223 be removed as unreachable anyway. See PR82386. */
1231 label_tick++;
1241 {
1255 /* See if we know about function return values before this
1256 insn based upon SUBREG flags. */
1259 /* See if we can find hardregs and subreg of pseudos in
1260 narrower modes. This could help turning TRUNCATEs
1261 into SUBREGs. */
1264 /* Try this insn with each insn it links back to. */
1270 {
1273 }
1275 /* Try each sequence of three linked insns ending with this one. */
1279 {
1282 /* If the linked insn has been replaced by a note, then there
1283 is no point in pursuing this chain any further. */
1291 {
1294 }
1295 }
1297 /* Try combining an insn with two different insns whose results it
1298 uses. */
1308 {
1311 }
1313 /* Try four-instruction combinations. */
1316 {
1320 /* If the linked insn has been replaced by a note, then there
1321 is no point in pursuing this chain any further. */
1326 {
1330 /* I0 -> I1 -> I2 -> I3. */
1336 {
1339 }
1340 /* I0, I1 -> I2, I2 -> I3. */
1347 {
1350 }
1351 }
1354 {
1358 /* I0 -> I2; I1, I2 -> I3. */
1364 {
1367 }
1368 /* I0 -> I1; I1, I2 -> I3. */
1374 {
1377 }
1378 }
1379 }
1381 /* Try this insn with each REG_EQUAL note it links back to. */
1383 {
1390 /* Avoid using a register that may already been marked
1391 dead by an earlier instruction. */
1399 {
1400 /* Temporarily replace the set's source with the
1401 contents of the REG_EQUAL note. The insn will
1402 be deleted or recognized by try_combine. */
1413 last_combined_insn);
1416 {
1419 }
1422 }
1423 }
1428 retry:
1429 ;
1430 }
1431 }
1438 /* Clean up. */
1444 {
1447 {
1450 }
1452 }
1462 /* Make recognizer allow volatile MEMs again. */
1466 }
1468 /* Wipe the last_xxx fields of reg_stat in preparation for another pass. */
1470 static void
1472 {
1478 }
1479 \f
1480 /* Set up any promoted values for incoming argument registers. */
1482 static void
1484 {
1485 tree arg;
1490 {
1495 /* Only continue if the incoming argument is in a register. */
1499 /* Determine, if possible, whether all call sites of the current
1500 function lie within the current compilation unit. (This does
1501 take into account the exporting of a function via taking its
1502 address, and so forth.) */
1503 strictly_local
1506 /* The mode and signedness of the argument before any promotions happen
1507 (equal to the mode of the pseudo holding it at that stage). */
1511 /* The mode and signedness of the argument after any source language and
1512 TARGET_PROMOTE_PROTOTYPES-driven promotions. */
1516 /* The mode and signedness of the argument as it is actually passed,
1517 see assign_parm_setup_reg in function.c. */
1521 /* The mode of the register in which the argument is being passed. */
1524 /* Eliminate sign extensions in the callee when:
1525 (a) A mode promotion has occurred; */
1528 /* (b) The mode of the register is the same as the mode of
1529 the argument as it is passed; */
1532 /* (c) There's no language level extension; */
1534 ;
1535 /* (c.1) All callers are from the current compilation unit. If that's
1536 the case we don't have to rely on an ABI, we only have to know
1537 what we're generating right now, and we know that we will do the
1538 mode1 to mode2 promotion with the given sign. */
1541 /* (c.2) The combination of the two promotions is useful. This is
1542 true when the signs match, or if the first promotion is unsigned.
1543 In the later case, (sign_extend (zero_extend x)) is the same as
1544 (zero_extend (zero_extend x)), so make sure to force UNS3 true. */
1550 /* Record that the value was promoted from mode1 to mode3,
1551 so that any sign extension at the head of the current
1552 function may be eliminated. */
1556 }
1557 }
1559 /* If MODE has a precision lower than PREC and SRC is a non-negative constant
1560 that would appear negative in MODE, sign-extend SRC for use in nonzero_bits
1561 because some machines (maybe most) will actually do the sign-extension and
1562 this is the conservative approach.
1564 ??? For 2.5, try to tighten up the MD files in this regard instead of this
1565 kludge. */
1567 static rtx
1569 {
1570 scalar_int_mode int_mode;
1579 }
1581 /* Update RSP for pseudo-register X from INSN's REG_EQUAL note (if one exists)
1582 and SET. */
1584 static void
1586 rtx x)
1587 {
1597 {
1601 }
1603 /* Don't call nonzero_bits if it cannot change anything. */
1605 {
1614 }
1616 /* Don't call num_sign_bit_copies if it cannot change anything. */
1618 {
1621 {
1625 }
1628 }
1629 }
1631 /* Called via note_stores. If X is a pseudo that is narrower than
1632 HOST_BITS_PER_WIDE_INT and is being set, record what bits are known zero.
1634 If we are setting only a portion of X and we can't figure out what
1635 portion, assume all bits will be used since we don't know what will
1636 be happening.
1638 Similarly, set how many bits of X are known to be copies of the sign bit
1639 at all locations in the function. This is the smallest number implied
1640 by any set of X. */
1642 static void
1644 {
1646 scalar_int_mode mode;
1650 /* If this register is undefined at the start of the file, we can't
1651 say what its contents were. */
1652 && ! REGNO_REG_SET_P
1656 {
1660 {
1664 }
1666 /* If this register is being initialized using itself, and the
1667 register is uninitialized in this basic block, and there are
1668 no LOG_LINKS which set the register, then part of the
1669 register is uninitialized. In that case we can't assume
1670 anything about the number of nonzero bits.
1672 ??? We could do better if we checked this in
1673 reg_{nonzero_bits,num_sign_bit_copies}_for_combine. Then we
1674 could avoid making assumptions about the insn which initially
1675 sets the register, while still using the information in other
1676 insns. We would have to be careful to check every insn
1677 involved in the combination. */
1683 {
1690 {
1694 }
1695 }
1697 /* If this is a complex assignment, see if we can convert it into a
1698 simple assignment. */
1701 /* If this is a simple assignment, or we have a paradoxical SUBREG,
1702 set what we know about X. */
1708 else
1709 {
1712 }
1713 }
1714 }
1715 \f
1716 /* See if INSN can be combined into I3. PRED, PRED2, SUCC and SUCC2 are
1717 optionally insns that were previously combined into I3 or that will be
1718 combined into the merger of INSN and I3. The order is PRED, PRED2,
1719 INSN, SUCC, SUCC2, I3.
1721 Return 0 if the combination is not allowed for any reason.
1723 If the combination is allowed, *PDEST will be set to the single
1724 destination of INSN and *PSRC to the single source, and this function
1725 will return 1. */
1727 static int
1731 {
1736 rtx link;
1741 {
1743 {
1748 }
1753 }
1757 /* Can combine only if previous insn is a SET of a REG or a SUBREG,
1758 or a PARALLEL consisting of such a SET and CLOBBERs.
1760 If INSN has CLOBBER parallel parts, ignore them for our processing.
1761 By definition, these happen during the execution of the insn. When it
1762 is merged with another insn, all bets are off. If they are, in fact,
1763 needed and aren't also supplied in I3, they may be added by
1764 recog_for_combine. Otherwise, it won't match.
1766 We can also ignore a SET whose SET_DEST is mentioned in a REG_UNUSED
1767 note.
1769 Get the source and destination of INSN. If more than one, can't
1770 combine. */
1776 {
1778 {
1782 {
1783 /* This is important to combine floating point insns
1784 for the SH4 port. */
1786 /* Combining an isolated USE doesn't make sense.
1787 We depend here on combinable_i3pat to reject them. */
1788 /* The code below this loop only verifies that the inputs of
1789 the SET in INSN do not change. We call reg_set_between_p
1790 to verify that the REG in the USE does not change between
1791 I3 and INSN.
1792 If the USE in INSN was for a pseudo register, the matching
1793 insn pattern will likely match any register; combining this
1794 with any other USE would only be safe if we knew that the
1795 used registers have identical values, or if there was
1796 something to tell them apart, e.g. different modes. For
1797 now, we forgo such complicated tests and simply disallow
1798 combining of USES of pseudo registers with any other USE. */
1801 {
1806 do
1807 {
1817 }
1819 }
1822 /* We can ignore CLOBBERs. */
1827 /* Ignore SETs whose result isn't used but not those that
1828 have side-effects. */
1834 /* If we have already found a SET, this is a second one and
1835 so we cannot combine with this insn. */
1843 /* Anything else means we can't combine. */
1845 }
1846 }
1849 /* If SET_SRC is an ASM_OPERANDS we can't throw away these CLOBBERs,
1850 so don't do anything with it. */
1853 }
1854 else
1860 /* The simplification in expand_field_assignment may call back to
1861 get_last_value, so set safe guard here. */
1867 /* Do not eliminate user-specified register if it is in an
1868 asm input because we may break the register asm usage defined
1869 in GCC manual if allow to do so.
1870 Be aware that this may cover more cases than we expect but this
1871 should be harmless. */
1876 /* Don't eliminate a store in the stack pointer. */
1878 /* Don't combine with an insn that sets a register to itself if it has
1879 a REG_EQUAL note. This may be part of a LIBCALL sequence. */
1881 /* Can't merge an ASM_OPERANDS. */
1883 /* Can't merge a function call. */
1885 /* Don't eliminate a function call argument. */
1891 /* Don't substitute into an incremented register. */
1895 /* Don't substitute into a non-local goto, this confuses CFG. */
1897 /* Make sure that DEST is not used after INSN but before SUCC, or
1898 after SUCC and before SUCC2, or after SUCC2 but before I3. */
1899 || (!all_adjacent
1900 && ((succ2
1905 || (succ
1906 /* SUCC and SUCC2 can be split halves from a PARALLEL; in
1907 that case SUCC is not in the insn stream, so use SUCC2
1908 instead for this test. */
1910 succ2
1913 /* Make sure that the value that is to be substituted for the register
1914 does not use any registers whose values alter in between. However,
1915 If the insns are adjacent, a use can't cross a set even though we
1916 think it might (this can happen for a sequence of insns each setting
1917 the same destination; last_set of that register might point to
1918 a NOTE). If INSN has a REG_EQUIV note, the register is always
1919 equivalent to the memory so the substitution is valid even if there
1920 are intervening stores. Also, don't move a volatile asm or
1921 UNSPEC_VOLATILE across any other insns. */
1922 || (! all_adjacent
1928 /* Don't combine across a CALL_INSN, because that would possibly
1929 change whether the life span of some REGs crosses calls or not,
1930 and it is a pain to update that information.
1931 Exception: if source is a constant, moving it later can't hurt.
1932 Accept that as a special case. */
1936 /* DEST must be a REG. */
1938 {
1939 /* If register alignment is being enforced for multi-word items in all
1940 cases except for parameters, it is possible to have a register copy
1941 insn referencing a hard register that is not allowed to contain the
1942 mode being copied and which would not be valid as an operand of most
1943 insns. Eliminate this problem by not combining with such an insn.
1945 Also, on some machines we don't want to extend the life of a hard
1946 register. */
1951 /* Don't extend the life of a hard register unless it is
1952 user variable (if we have few registers) or it can't
1953 fit into the desired register (meaning something special
1954 is going on).
1955 Also avoid substituting a return register into I3, because
1956 reload can't handle a conflict with constraints of other
1957 inputs. */
1962 }
1963 else
1970 {
1973 /* If the clobber represents an earlyclobber operand, we must not
1974 substitute an expression containing the clobbered register.
1975 As we do not analyze the constraint strings here, we have to
1976 make the conservative assumption. However, if the register is
1977 a fixed hard reg, the clobber cannot represent any operand;
1978 we leave it up to the machine description to either accept or
1979 reject use-and-clobber patterns. */
1985 }
1987 /* If INSN contains anything volatile, or is an `asm' (whether volatile
1988 or not), reject, unless nothing volatile comes between it and I3 */
1991 {
1992 /* Make sure neither succ nor succ2 contains a volatile reference. */
1997 /* We'll check insns between INSN and I3 below. */
1998 }
2000 /* If INSN is an asm, and DEST is a hard register, reject, since it has
2001 to be an explicit register variable, and was chosen for a reason. */
2007 /* If INSN contains volatile references (specifically volatile MEMs),
2008 we cannot combine across any other volatile references.
2009 Even if INSN doesn't contain volatile references, any intervening
2010 volatile insn might affect machine state. */
2013 ? volatile_refs_p
2020 /* If INSN contains an autoincrement or autodecrement, make sure that
2021 register is not used between there and I3, and not already used in
2022 I3 either. Neither must it be used in PRED or SUCC, if they exist.
2023 Also insist that I3 not be a jump if using LRA; if it were one
2024 and the incremented register were spilled, we would lose.
2025 Reload handles this correctly. */
2043 /* If we get here, we have passed all the tests and the combination is
2044 to be allowed. */
2050 }
2051 \f
2052 /* LOC is the location within I3 that contains its pattern or the component
2053 of a PARALLEL of the pattern. We validate that it is valid for combining.
2055 One problem is if I3 modifies its output, as opposed to replacing it
2056 entirely, we can't allow the output to contain I2DEST, I1DEST or I0DEST as
2057 doing so would produce an insn that is not equivalent to the original insns.
2059 Consider:
2061 (set (reg:DI 101) (reg:DI 100))
2062 (set (subreg:SI (reg:DI 101) 0) <foo>)
2064 This is NOT equivalent to:
2066 (parallel [(set (subreg:SI (reg:DI 100) 0) <foo>)
2067 (set (reg:DI 101) (reg:DI 100))])
2069 Not only does this modify 100 (in which case it might still be valid
2070 if 100 were dead in I2), it sets 101 to the ORIGINAL value of 100.
2072 We can also run into a problem if I2 sets a register that I1
2073 uses and I1 gets directly substituted into I3 (not via I2). In that
2074 case, we would be getting the wrong value of I2DEST into I3, so we
2075 must reject the combination. This case occurs when I2 and I1 both
2076 feed into I3, rather than when I1 feeds into I2, which feeds into I3.
2077 If I1_NOT_IN_SRC is nonzero, it means that finding I1 in the source
2078 of a SET must prevent combination from occurring. The same situation
2079 can occur for I0, in which case I0_NOT_IN_SRC is set.
2081 Before doing the above check, we first try to expand a field assignment
2082 into a set of logical operations.
2084 If PI3_DEST_KILLED is nonzero, it is a pointer to a location in which
2085 we place a register that is both set and used within I3. If more than one
2086 such register is detected, we fail.
2088 Return 1 if the combination is valid, zero otherwise. */
2090 static int
2093 {
2097 {
2102 rtx subdest;
2109 /* Check for the case where I3 modifies its output, as discussed
2110 above. We don't want to prevent pseudos from being combined
2111 into the address of a MEM, so only prevent the combination if
2112 i1 or i2 set the same MEM. */
2122 /* This is the same test done in can_combine_p except we can't test
2123 all_adjacent; we don't have to, since this instruction will stay
2124 in place, thus we are not considering increasing the lifetime of
2125 INNER_DEST.
2127 Also, if this insn sets a function argument, combining it with
2128 something that might need a spill could clobber a previous
2129 function argument; the all_adjacent test in can_combine_p also
2130 checks this; here, we do a more specific test for this case. */
2140 /* If DEST is used in I3, it is being killed in this insn, so
2141 record that for later. We have to consider paradoxical
2142 subregs here, since they kill the whole register, but we
2143 ignore partial subregs, STRICT_LOW_PART, etc.
2144 Never add REG_DEAD notes for the FRAME_POINTER_REGNUM or the
2145 STACK_POINTER_REGNUM, since these are always considered to be
2146 live. Similarly for ARG_POINTER_REGNUM if it is fixed. */
2154 && (HARD_FRAME_POINTER_IS_FRAME_POINTER
2160 {
2165 }
2166 }
2169 {
2176 }
2179 }
2180 \f
2181 /* Return 1 if X is an arithmetic expression that contains a multiplication
2182 and division. We don't count multiplications by powers of two here. */
2184 static int
2186 {
2188 {
2204 }
2205 }
2206 \f
2207 /* Determine whether INSN can be used in a combination. Return nonzero if
2208 not. This is used in try_combine to detect early some cases where we
2209 can't perform combinations. */
2211 static int
2213 {
2214 rtx set;
2217 /* If this isn't really an insn, we can't do anything.
2218 This can occur when flow deletes an insn that it has merged into an
2219 auto-increment address. */
2223 /* Never combine loads and stores involving hard regs that are likely
2224 to be spilled. The register allocator can usually handle such
2225 reg-reg moves by tying. If we allow the combiner to make
2226 substitutions of likely-spilled regs, reload might die.
2227 As an exception, we allow combinations involving fixed regs; these are
2228 not available to the register allocator so there's no risk involved. */
2242 #ifdef LEAF_REGISTERS
2244 #else
2245 )
2246 #endif
2253 }
2255 struct likely_spilled_retval_info
2256 {
2259 };
2261 /* Called via note_stores by likely_spilled_retval_p. Remove from info->mask
2262 hard registers that are known to be written to / clobbered in full. */
2263 static void
2265 {
2282 else
2285 }
2287 /* Return nonzero iff part of the return value is live during INSN, and
2288 it is likely spilled. This can happen when more than one insn is needed
2289 to copy the return value, e.g. when we consider to combine into the
2290 second copy insn for a complex value. */
2292 static int
2294 {
2296 rtx reg;
2299 /* We assume here that no machine mode needs more than
2300 32 hard registers when the value overlaps with a register
2301 for which TARGET_FUNCTION_VALUE_REGNO_P is true. */
2316 /* Disregard parts of the return value that are set later. */
2325 /* Check if any of the (probably) live return value registers is
2326 likely spilled. */
2327 nregs --;
2328 do
2329 {
2335 }
2337 /* Adjust INSN after we made a change to its destination.
2339 Changing the destination can invalidate notes that say something about
2340 the results of the insn and a LOG_LINK pointing to the insn. */
2342 static void
2344 {
2345 /* For notes, be conservative and simply remove them. */
2348 /* The new insn will have a destination that was previously the destination
2349 of an insn just above it. Call distribute_links to make a LOG_LINK from
2350 the next use of that destination. */
2366 }
2368 /* Return TRUE if combine can reuse reg X in mode MODE.
2369 ADDED_SETS is nonzero if the original set is still required. */
2370 static bool
2372 {
2378 /* Don't change between modes with different underlying register sizes,
2379 since this could lead to invalid subregs. */
2385 /* Allow hard registers if the new mode is legal, and occupies no more
2386 registers than the old mode. */
2391 /* Or a pseudo that is only used once. */
2394 && !added_sets
2396 }
2399 /* Check whether X, the destination of a set, refers to part of
2400 the register specified by REG. */
2402 static bool
2404 {
2405 /* Check that reg is an integer mode register. */
2416 }
2418 /* Return whether PAT is a PARALLEL of exactly N register SETs followed
2419 by an arbitrary number of CLOBBERs. */
2420 static bool
2422 {
2437 {
2444 }
2446 }
2448 /* Return whether INSN, a PARALLEL of N register SETs (and maybe some
2449 CLOBBERs), can be split into individual SETs in that order, without
2450 changing semantics. */
2451 static bool
2453 {
2461 {
2470 }
2473 }
2475 /* Return whether X is just a single_set, with the source
2476 a general_operand. */
2477 static bool
2479 {
2485 }
2487 /* Callback function to count autoincs. */
2489 static int
2491 {
2495 }
2497 /* Try to combine the insns I0, I1 and I2 into I3.
2498 Here I0, I1 and I2 appear earlier than I3.
2499 I0 and I1 can be zero; then we combine just I2 into I3, or I1 and I2 into
2500 I3.
2502 If we are combining more than two insns and the resulting insn is not
2503 recognized, try splitting it into two insns. If that happens, I2 and I3
2504 are retained and I1/I0 are pseudo-deleted by turning them into a NOTE.
2505 Otherwise, I0, I1 and I2 are pseudo-deleted.
2507 Return 0 if the combination does not work. Then nothing is changed.
2508 If we did the combination, return the insn at which combine should
2509 resume scanning.
2511 Set NEW_DIRECT_JUMP_P to a nonzero value if try_combine creates a
2512 new direct jump instruction.
2514 LAST_COMBINED_INSN is either I3, or some insn after I3 that has
2515 been I3 passed to an earlier try_combine within the same basic
2516 block. */
2521 {
2522 /* New patterns for I3 and I2, respectively. */
2526 /* Indicates need to preserve SET in I0, I1 or I2 in I3 if it is not
2527 dead. */
2529 /* Total number of SETs to put into I3. */
2531 /* Nonzero if I2's or I1's body now appears in I3. */
2533 /* INSN_CODEs for new I3, new I2, and user of condition code. */
2535 /* Contains I3 if the destination of I3 is used in its source, which means
2536 that the old life of I3 is being killed. If that usage is placed into
2537 I2 and not in I3, a REG_DEAD note must be made. */
2539 /* SET_DEST and SET_SRC of I2, I1 and I0. */
2541 /* Copy of SET_SRC of I1 and I0, if needed. */
2543 /* Set if I2DEST was reused as a scratch register. */
2545 /* The PATTERNs of I0, I1, and I2, or a copy of them in certain cases. */
2547 /* Indicates if I2DEST or I1DEST is in I2SRC or I1_SRC. */
2552 /* Notes that must be added to REG_NOTES in I3 and I2. */
2554 /* Notes that we substituted I3 into I2 instead of the normal case. */
2556 /* Notes that I1, I2 or I3 is a MULT operation. */
2566 rtx temp_expr;
2569 rtx new_other_notes;
2573 /* Immediately return if any of I0,I1,I2 are the same insn (I3 can
2574 never be). */
2578 /* Only try four-insn combinations when there's high likelihood of
2579 success. Look for simple insns, such as loads of constants or
2580 binary operations involving a constant. */
2582 {
2592 {
2595 rtx src;
2600 {
2603 }
2605 ngood++;
2608 nshift++;
2609 }
2611 /* If I0 loads a memory and I3 sets the same memory, then I1 and I2
2612 are likely manipulating its value. Ideally we'll be able to combine
2613 all four insns into a bitfield insertion of some kind.
2615 Note the source in I0 might be inside a sign/zero extension and the
2616 memory modes in I0 and I3 might be different. So extract the address
2617 from the destination of I3 and search for it in the source of I0.
2619 In the event that there's a match but the source/dest do not actually
2620 refer to the same memory, the worst that happens is we try some
2621 combinations that we wouldn't have otherwise. */
2623 /* Ensure the source of SET0 is a MEM, possibly buried inside
2624 an extension. */
2630 /* Ensure the destination of SET3 is a MEM. */
2632 /* Would it be better to extract the base address for the MEM
2633 in SET3 and look for that? I don't have cases where it matters
2634 but I could envision such cases. */
2640 }
2642 /* Exit early if one of the insns involved can't be used for
2643 combinations. */
2654 combine_attempts++;
2657 /* Reset the hard register usage information. */
2661 {
2668 else
2678 }
2680 /* If multiple insns feed into one of I2 or I3, they can be in any
2681 order. To simplify the code below, reorder them in sequence. */
2692 /* First check for one important special case that the code below will
2693 not handle. Namely, the case where I1 is zero, I2 is a PARALLEL
2694 and I3 is a SET whose SET_SRC is a SET_DEST in I2. In that case,
2695 we may be able to replace that destination with the destination of I3.
2696 This occurs in the common code where we compute both a quotient and
2697 remainder into a structure, in which case we want to do the computation
2698 directly into the structure to avoid register-register copies.
2700 Note that this case handles both multiple sets in I2 and also cases
2701 where I2 has a number of CLOBBERs inside the PARALLEL.
2703 We make very conservative checks below and only try to handle the
2704 most common cases of this. For example, we only handle the case
2705 where I2 and I3 are adjacent to avoid making difficult register
2706 usage tests. */
2714 /* If the dest of I3 is a ZERO_EXTRACT or STRICT_LOW_PART, the code
2715 below would need to check what is inside (and reg_overlap_mentioned_p
2716 doesn't support those codes anyway). Don't allow those destinations;
2717 the resulting insn isn't likely to be recognized anyway. */
2723 {
2726 /* Make sure that the destination of I3,
2727 which we are going to substitute into one output of I2,
2728 is not used within another output of I2. We must avoid making this:
2729 (parallel [(set (mem (reg 69)) ...)
2730 (set (reg 69) ...)])
2731 which is not well-defined as to order of actions.
2732 (Besides, reload can't handle output reloads for this.)
2734 The problem can also happen if the dest of I3 is a memory ref,
2735 if another dest in I2 is an indirect memory ref.
2737 Neither can this PARALLEL be an asm. We do not allow combining
2738 that usually (see can_combine_p), so do not here either. */
2741 {
2750 }
2756 {
2757 combine_merges++;
2767 /* Replace the dest in I2 with our dest and make the resulting
2768 insn the new pattern for I3. Then skip to where we validate
2769 the pattern. Everything was set up above. */
2774 }
2775 }
2777 /* If I2 is setting a pseudo to a constant and I3 is setting some
2778 sub-part of it to another constant, merge them by making a new
2779 constant. */
2787 {
2794 {
2799 {
2805 }
2806 }
2807 else
2808 {
2812 {
2815 }
2816 }
2819 {
2820 /* If this is the low part, we're done. */
2822 ;
2823 /* Handle the case where inner is twice the size of outer. */
2827 /* Otherwise give up for now. */
2828 else
2830 }
2833 {
2841 combine_merges++;
2848 /* Replace the source in I2 with the new constant and make the
2849 resulting insn the new pattern for I3. Then skip to where we
2850 validate the pattern. Everything was set up above. */
2856 /* The dest of I3 has been replaced with the dest of I2. */
2859 }
2860 }
2862 /* If we have no I1 and I2 looks like:
2863 (parallel [(set (reg:CC X) (compare:CC OP (const_int 0)))
2864 (set Y OP)])
2865 make up a dummy I1 that is
2866 (set Y OP)
2867 and change I2 to be
2868 (set (reg:CC X) (compare:CC Y (const_int 0)))
2870 (We can ignore any trailing CLOBBERs.)
2872 This undoes a previous combination and allows us to match a branch-and-
2873 decrement insn. */
2885 {
2886 /* We make I1 with the same INSN_UID as I2. This gives it
2887 the same DF_INSN_LUID for value tracking. Our fake I1 will
2888 never appear in the insn stream so giving it the same INSN_UID
2889 as I2 will not cause a problem. */
2902 }
2904 /* If I2 is a PARALLEL of two SETs of REGs (and perhaps some CLOBBERs),
2905 make those two SETs separate I1 and I2 insns, and make an I0 that is
2906 the original I1. */
2914 {
2915 /* If there is no I1, there is no I0 either. */
2918 /* We make I1 with the same INSN_UID as I2. This gives it
2919 the same DF_INSN_LUID for value tracking. Our fake I1 will
2920 never appear in the insn stream so giving it the same INSN_UID
2921 as I2 will not cause a problem. */
2929 }
2931 /* Verify that I2 and maybe I1 and I0 can be combined into I3. */
2933 {
2938 }
2940 {
2945 }
2947 {
2952 }
2954 /* Record whether i2 and i3 are trivial moves. */
2958 /* Record whether I2DEST is used in I2SRC and similarly for the other
2959 cases. Knowing this will help in register status updating below. */
2970 /* For the earlier insns, determine which of the subsequent ones they
2971 feed. */
2978 /* Ensure that I3's pattern can be the destination of combines. */
2984 {
2987 }
2989 /* See if any of the insns is a MULT operation. Unless one is, we will
2990 reject a combination that is, since it must be slower. Be conservative
2991 here. */
2999 /* If I3 has an inc, then give up if I1 or I2 uses the reg that is inc'd.
3000 We used to do this EXCEPT in one case: I3 has a post-inc in an
3001 output operand. However, that exception can give rise to insns like
3002 mov r3,(r3)+
3003 which is a famous insn on the PDP-11 where the value of r3 used as the
3004 source was model-dependent. Avoid this sort of thing. */
3006 #if 0
3012 /* It's not the exception. */
3013 #endif
3015 {
3016 rtx link;
3022 {
3025 }
3026 }
3028 /* See if the SETs in I1 or I2 need to be kept around in the merged
3029 instruction: whenever the value set there is still needed past I3.
3030 For the SET in I2, this is easy: we see if I2DEST dies or is set in I3.
3032 For the SET in I1, we have two cases: if I1 and I2 independently feed
3033 into I3, the set in I1 needs to be kept around unless I1DEST dies
3034 or is set in I3. Otherwise (if I1 feeds I2 which feeds I3), the set
3035 in I1 needs to be kept around unless I1DEST dies or is set in either
3036 I2 or I3. The same considerations apply to I0. */
3043 else
3051 else
3054 /* We are about to copy insns for the case where they need to be kept
3055 around. Check that they can be copied in the merged instruction. */
3061 {
3064 }
3066 /* We cannot safely duplicate volatile references in any case. */
3071 {
3074 }
3076 /* Count how many auto_inc expressions there were in the original insns;
3077 we need to have the same number in the resulting patterns. */
3086 /* If the set in I2 needs to be kept around, we must make a copy of
3087 PATTERN (I2), so that when we substitute I1SRC for I1DEST in
3088 PATTERN (I2), we are only substituting for the original I1DEST, not into
3089 an already-substituted copy. This also prevents making self-referential
3090 rtx. If I2 is a PARALLEL, we just need the piece that assigns I2SRC to
3091 I2DEST. */
3094 {
3097 else
3099 }
3102 {
3105 else
3107 }
3110 {
3113 else
3115 }
3117 combine_merges++;
3119 /* Substitute in the latest insn for the regs set by the earlier ones. */
3125 /* Many machines have insns that can both perform an
3126 arithmetic operation and set the condition code. These operations will
3127 be represented as a PARALLEL with the first element of the vector
3128 being a COMPARE of an arithmetic operation with the constant zero.
3129 The second element of the vector will set some pseudo to the result
3130 of the same arithmetic operation. If we simplify the COMPARE, we won't
3131 match such a pattern and so will generate an extra insn. Here we test
3132 for this case, where both the comparison and the operation result are
3133 needed, and make the PARALLEL by just replacing I2DEST in I3SRC with
3134 I2SRC. Later we will make the PARALLEL that contains I2. */
3140 {
3141 rtx newpat_dest;
3147 scalar_int_mode mode;
3156 {
3162 }
3164 /* Do the rest only if op1 is const0_rtx, which may be the
3165 result of simplification. */
3167 {
3168 /* If a single use of the CC is found, prepare to modify it
3169 when SELECT_CC_MODE returns a new CC-class mode, or when
3170 the above simplify_compare_const() returned a new comparison
3171 operator. undobuf.other_insn is assigned the CC use insn
3172 when modifying it. */
3174 {
3175 #ifdef SELECT_CC_MODE
3176 machine_mode new_mode
3181 {
3186 else
3187 {
3190 }
3191 }
3192 #endif
3193 /* Cases for modifying the CC-using comparison. */
3195 /* ??? Do we need to verify the zero rtx? */
3197 {
3198 /* Replace cc_use_loc with entire new RTX. */
3203 }
3205 {
3206 /* Just replace the CC reg with a new mode. */
3209 }
3210 }
3212 /* Now we modify the current newpat:
3213 First, SET_DEST(newpat) is updated if the CC mode has been
3214 altered. For targets without SELECT_CC_MODE, this should be
3215 optimized away. */
3218 /* This is always done to propagate i2src into newpat. */
3221 /* Create new version of i2pat if needed; the below PARALLEL
3222 creation needs this to work correctly. */
3226 }
3227 }
3230 {
3231 /* It is possible that the source of I2 or I1 may be performing
3232 an unneeded operation, such as a ZERO_EXTEND of something
3233 that is known to have the high part zero. Handle that case
3234 by letting subst look at the inner insns.
3236 Another way to do this would be to have a function that tries
3237 to simplify a single insn instead of merging two or more
3238 insns. We don't do this because of the potential of infinite
3239 loops and because of the potential extra memory required.
3240 However, doing it the way we are is a bit of a kludge and
3241 doesn't catch all cases.
3243 But only do this if -fexpensive-optimizations since it slows
3244 things down and doesn't usually win.
3246 This is not done in the COMPARE case above because the
3247 unmodified I2PAT is used in the PARALLEL and so a pattern
3248 with a modified I2SRC would not match. */
3251 {
3252 /* Pass pc_rtx so no substitutions are done, just
3253 simplifications. */
3255 {
3258 }
3262 }
3267 /* If I1 feeds into I2 and I1DEST is in I1SRC, we need to make a unique
3268 copy of I2SRC each time we substitute it, in order to avoid creating
3269 self-referential RTL when we will be substituting I1SRC for I1DEST
3270 later. Likewise if I0 feeds into I2, either directly or indirectly
3271 through I1, and I0DEST is in I0SRC. */
3278 /* Record whether I2's body now appears within I3's body. */
3280 }
3282 /* If we already got a failure, don't try to do more. Otherwise, try to
3283 substitute I1 if we have it. */
3286 {
3287 /* Before we can do this substitution, we must redo the test done
3288 above (see detailed comments there) that ensures I1DEST isn't
3289 mentioned in any SETs in NEWPAT that are field assignments. */
3292 {
3295 }
3300 /* If the following substitution will modify I1SRC, make a copy of it
3301 for the case where it is substituted for I1DEST in I2PAT later. */
3305 /* If I0 feeds into I1 and I0DEST is in I0SRC, we need to make a unique
3306 copy of I1SRC each time we substitute it, in order to avoid creating
3307 self-referential RTL when we will be substituting I0SRC for I0DEST
3308 later. */
3313 /* Record whether I1's body now appears within I3's body. */
3315 }
3317 /* Likewise for I0 if we have it. */
3320 {
3323 {
3326 }
3328 /* If the following substitution will modify I0SRC, make a copy of it
3329 for the case where it is substituted for I0DEST in I1PAT later. */
3332 /* And a copy for I0DEST in I2PAT substitution. */
3341 }
3344 {
3349 {
3354 }
3355 }
3357 /* Fail if an autoincrement side-effect has been duplicated. Be careful
3358 to count all the ways that I2SRC and I1SRC can be used. */
3369 /* Fail if we tried to make a new register. */
3371 /* Fail if we couldn't do something and have a CLOBBER. */
3373 /* Fail if this new pattern is a MULT and we didn't have one before
3374 at the outer level. */
3377 {
3380 }
3382 /* If the actions of the earlier insns must be kept
3383 in addition to substituting them into the latest one,
3384 we must make a new PARALLEL for the latest insn
3385 to hold additional the SETs. */
3388 {
3390 combine_extras++;
3393 {
3399 }
3400 else
3401 {
3406 }
3412 {
3418 }
3420 {
3429 }
3430 }
3432 validate_replacement:
3434 /* Note which hard regs this insn has as inputs. */
3437 /* If recog_for_combine fails, it strips existing clobbers. If we'll
3438 consider splitting this pattern, we might need these clobbers. */
3441 {
3447 }
3449 /* We have recognized nothing yet. */
3452 /* See if this is a PARALLEL of two SETs where one SET's destination is
3453 a register that is unused and this isn't marked as an instruction that
3454 might trap in an EH region. In that case, we just need the other SET.
3455 We prefer this over the PARALLEL.
3457 This can occur when simplifying a divmod insn. We *must* test for this
3458 case here because the code below that splits two independent SETs doesn't
3459 handle this case correctly when it updates the register status.
3461 It's pointless doing this if we originally had two sets, one from
3462 i3, and one from i2. Combining then splitting the parallel results
3463 in the original i2 again plus an invalid insn (which we delete).
3464 The net effect is only to move instructions around, which makes
3465 debug info less accurate.
3467 If the remaining SET came from I2 its destination should not be used
3468 between I2 and I3. See PR82024. */
3473 {
3484 {
3487 }
3496 {
3501 {
3507 }
3508 }
3512 }
3514 /* Is the result of combination a valid instruction? */
3518 /* If we were combining three insns and the result is a simple SET
3519 with no ASM_OPERANDS that wasn't recognized, try to split it into two
3520 insns. There are two ways to do this. It can be split using a
3521 machine-specific method (like when you have an addition of a large
3522 constant) or by combine in the function find_split_point. */
3526 {
3530 /* See if the MD file can split NEWPAT. If it can't, see if letting it
3531 use I2DEST as a scratch register will help. In the latter case,
3532 convert I2DEST to the mode of the source of NEWPAT if we can. */
3536 /* We can only use I2DEST as a scratch reg if it doesn't overlap any
3537 inputs of NEWPAT. */
3539 /* ??? If I2DEST is not safe, and I1DEST exists, then it would be
3540 possible to try that as a scratch reg. This would require adding
3541 more code to make it work though. */
3544 {
3547 /* ??? Reusing i2dest without resetting the reg_stat entry for it
3548 (temporarily, until we are committed to this instruction
3549 combination) does not work: for example, any call to nonzero_bits
3550 on the register (from a splitter in the MD file, for example)
3551 will get the old information, which is invalid.
3553 Since nowadays we can create registers during combine just fine,
3554 we should just create a new one here, not reuse i2dest. */
3556 /* First try to split using the original register as a
3557 scratch register. */
3561 i2dest)));
3564 /* If that didn't work, try changing the mode of I2DEST if
3565 we can. */
3570 {
3572 rtx ni2dest;
3576 else
3577 {
3580 }
3582 parallel = (gen_rtx_PARALLEL
3586 ni2dest))));
3591 {
3599 }
3600 }
3603 }
3605 /* If recog_for_combine has discarded clobbers, try to use them
3606 again for the split. */
3608 {
3611 }
3614 {
3619 }
3623 {
3633 /* If I2 or I3 has multiple SETs, we won't know how to track
3634 register status, so don't use these insns. If I2's destination
3635 is used between I2 and I3, we also can't use these insns. */
3645 /* It is possible that both insns now set the destination of I3.
3646 If so, we must show an extra use of it. */
3649 {
3668 }
3669 }
3671 /* If we can split it and use I2DEST, go ahead and see if that
3672 helps things be recognized. Verify that none of the registers
3673 are set between I2 and I3. */
3676 /* We need I2DEST in the proper mode. If it is a hard register
3677 or the only use of a pseudo, we can change its mode.
3678 Make sure we don't change a hard register to have a mode that
3679 isn't valid for it, or change the number of registers. */
3686 /* We can't overwrite I2DEST if its value is still used by
3687 NEWPAT. */
3689 {
3698 /* *SPLIT may be part of I2SRC, so make sure we have the
3699 original expression around for later debug processing.
3700 We should not need I2SRC any more in other cases. */
3703 else
3706 /* Get NEWDEST as a register in the proper mode. We have already
3707 validated that we can do this. */
3709 {
3712 else
3713 {
3716 }
3717 }
3719 /* If *SPLIT is a (mult FOO (const_int pow2)), convert it to
3720 an ASHIFT. This can occur if it was inside a PLUS and hence
3721 appeared to be a memory address. This is a kludge. */
3726 {
3730 /* Update split_code because we may not have a multiply
3731 anymore. */
3733 }
3735 /* Similarly for (plus (mult FOO (const_int pow2))). */
3741 {
3746 i_rtx));
3747 /* Update split_code because we may not have a multiply
3748 anymore. */
3750 }
3752 #ifdef INSN_SCHEDULING
3753 /* If *SPLIT is a paradoxical SUBREG, when we split it, it should
3754 be written as a ZERO_EXTEND. */
3756 {
3757 /* Or as a SIGN_EXTEND if LOAD_EXTEND_OP says that that's
3758 what it really is. */
3763 else
3766 }
3767 #endif
3769 /* Attempt to split binary operators using arithmetic identities. */
3773 {
3780 /* Split "X = Y op Y" as "Z = Y; X = Z op Z". */
3782 {
3787 }
3788 /* Split "((P op Q) op R) op S" where op is PLUS or MULT. */
3795 {
3801 /* Split both "((X op Y) op X) op Y" and
3802 "((X op Y) op Y) op X" as "T op T" where T is
3803 "X op Y". */
3806 {
3811 }
3812 /* Split "((X op X) op Y) op Y)" as "T op T" where
3813 T is "X op Y". */
3815 {
3821 }
3822 }
3823 }
3826 {
3829 }
3833 /* recog_for_combine might have added CLOBBERs to newi2pat.
3834 Make sure NEWPAT does not depend on the clobbered regs. */
3838 {
3841 {
3844 }
3845 }
3847 /* If the split point was a MULT and we didn't have one before,
3848 don't use one now. */
3851 }
3852 }
3854 /* Check for a case where we loaded from memory in a narrow mode and
3855 then sign extended it, but we need both registers. In that case,
3856 we have a PARALLEL with both loads from the same memory location.
3857 We can split this into a load from memory followed by a register-register
3858 copy. This saves at least one insn, more if register allocation can
3859 eliminate the copy.
3861 We cannot do this if the destination of the first assignment is a
3862 condition code register. We eliminate this case by making sure
3863 the SET_DEST and SET_SRC have the same mode.
3865 We cannot do this if the destination of the second assignment is
3866 a register that we have already assumed is zero-extended. Similarly
3867 for a SUBREG of such a register. */
3886 BITS_PER_WORD)
3888 HOST_BITS_PER_INT)
3896 BITS_PER_WORD)
3898 HOST_BITS_PER_INT)
3905 {
3906 rtx ni2dest;
3920 }
3922 /* Similarly, check for a case where we have a PARALLEL of two independent
3923 SETs but we started with three insns. In this case, we can do the sets
3924 as two separate insns. This case occurs when some SET allows two
3925 other insns to combine, but the destination of that SET is still live.
3927 Also do this if we started with two insns and (at least) one of the
3928 resulting sets is a noop; this noop will be deleted later.
3930 Also do this if we started with two insns neither of which was a simple
3931 move. */
3938 && (i1
3952 {
3956 /* Normally, it doesn't matter which of the two is done first, but
3957 one which uses any regs/memory set in between i2 and i3 can't
3958 be first. The PARALLEL might also have been pre-existing in i3,
3959 so we need to make sure that we won't wrongly hoist a SET to i2
3960 that would conflict with a death note present in there, or would
3961 have its dest modified between i2 and i3. */
3969 /* If I3 is a jump, ensure that set0 is a jump so that
3970 we do not create invalid RTL. */
3972 )
3973 {
3976 }
3984 /* If I3 is a jump, ensure that set1 is a jump so that
3985 we do not create invalid RTL. */
3987 )
3988 {
3991 }
3992 else
3993 {
3996 }
4001 {
4002 /* recog_for_combine might have added CLOBBERs to newi2pat.
4003 Make sure NEWPAT does not depend on the clobbered regs. */
4005 {
4008 {
4011 {
4014 }
4015 }
4016 }
4022 }
4023 }
4025 /* If it still isn't recognized, fail and change things back the way they
4026 were. */
4028 /* Is the result a reasonable ASM_OPERANDS? */
4030 {
4033 }
4035 /* If we had to change another insn, make sure it is valid also. */
4037 {
4045 {
4048 }
4049 }
4051 /* Only allow this combination if insn_cost reports that the
4052 replacement instructions are cheaper than the originals. */
4054 {
4057 }
4060 {
4065 {
4070 /* Temporarily revert mode back. */
4074 {
4075 /* If we used i2dest as a scratch register with a
4076 different mode, substitute it for the original
4077 i2src while its original mode is temporarily
4078 restored, and then clear i2scratch so that we don't
4079 do it again later. */
4081 this_basic_block);
4083 /* Put back the new mode. */
4085 }
4086 else
4087 {
4092 {
4095 }
4096 else
4097 {
4104 }
4106 /* We're dealing with a reg that changed mode but not
4107 meaning, so we want to turn it into a subreg for
4108 the new mode. However, because of REG sharing and
4109 because its mode had already changed, we have to do
4110 it in two steps. First, replace any debug uses of
4111 reg, with its original mode temporarily restored,
4112 with this copy we have created; then, replace the
4113 copy with the SUBREG of the original shared reg,
4114 once again changed to the new mode. */
4116 this_basic_block);
4120 this_basic_block);
4121 }
4122 }
4123 }
4125 /* If we will be able to accept this, we have made a
4126 change to the destination of I3. This requires us to
4127 do a few adjustments. */
4130 {
4133 }
4135 /* We now know that we can do this combination. Merge the insns and
4136 update the status of registers and LOG_LINKS. */
4139 {
4144 /* If any of the notes in OTHER_INSN were REG_DEAD or REG_UNUSED,
4145 ensure that they are still valid. Then add any non-duplicate
4146 notes added by recog_for_combine. */
4148 {
4157 /* Simply drop equal note since it may be no longer valid
4158 for other_insn. It may be possible to record that CC
4159 register is changed and only discard those notes, but
4160 in practice it's unnecessary complication and doesn't
4161 give any meaningful improvement.
4163 See PR78559. */
4167 }
4171 NULL_RTX);
4172 }
4175 {
4176 /* I3 now uses what used to be its destination and which is now
4177 I2's destination. This requires us to do a few adjustments. */
4180 }
4183 {
4184 /* We might need a LOG_LINK from I3 to I2. But then we used to
4185 have one, so we still will.
4187 However, some later insn might be using I2's dest and have
4188 a LOG_LINK pointing at I3. We should change it to point at
4189 I2 instead. */
4191 /* newi2pat is usually a SET here; however, recog_for_combine might
4192 have added some clobbers. */
4200 {
4205 !done
4206 && insn
4210 {
4214 {
4218 }
4219 }
4220 }
4221 }
4223 {
4228 /* Compute which registers we expect to eliminate. newi2pat may be setting
4229 either i3dest or i2dest, so we must check it. */
4232 || !i2dest_killed
4234 /* For i1, we need to compute both local elimination and global
4235 elimination information with respect to newi2pat because i1dest
4236 may be the same as i3dest, in which case newi2pat may be setting
4237 i1dest. Global information is used when distributing REG_DEAD
4238 note for i2 and i3, in which case it does matter if newi2pat sets
4239 i1dest or not.
4241 Local information is used when distributing REG_DEAD note for i1,
4242 in which case it doesn't matter if newi2pat sets i1dest or not.
4243 See PR62151, if we have four insns combination:
4244 i0: r0 <- i0src
4245 i1: r1 <- i1src (using r0)
4246 REG_DEAD (r0)
4247 i2: r0 <- i2src (using r1)
4248 i3: r3 <- i3src (using r0)
4249 ix: using r0
4250 From i1's point of view, r0 is eliminated, no matter if it is set
4251 by newi2pat or not. In other words, REG_DEAD info for r0 in i1
4252 should be discarded.
4254 Note local information only affects cases in forms like "I1->I2->I3",
4255 "I0->I1->I2->I3" or "I0&I1->I2, I2->I3". For other cases like
4256 "I0->I1, I1&I2->I3" or "I1&I2->I3", newi2pat won't set i1dest or
4257 i0dest anyway. */
4259 || !i1dest_killed
4264 /* Same case as i1. */
4271 /* Get the old REG_NOTES and LOG_LINKS from all our insns and
4272 clear them. */
4280 /* Ensure that we do not have something that should not be shared but
4281 occurs multiple times in the new insns. Check this by first
4282 resetting all the `used' flags and then copying anything is shared. */
4306 {
4309 {
4311 {
4312 /* I2SRC must still be meaningful at this point. Some
4313 splitting operations can invalidate I2SRC, but those
4314 operations do not apply to calls. */
4318 }
4325 }
4326 }
4331 /* We had one special case above where I2 had more than one set and
4332 we replaced a destination of one of those sets with the destination
4333 of I3. In that case, we have to update LOG_LINKS of insns later
4334 in this basic block. Note that this (expensive) case is rare.
4336 Also, in this case, we must pretend that all REG_NOTEs for I2
4337 actually came from I3, so that REG_UNUSED notes from I2 will be
4338 properly handled. */
4341 {
4350 temp_insn
4360 {
4365 }
4366 else
4369 }
4377 {
4380 this_basic_block);
4383 }
4384 else
4385 {
4388 this_basic_block);
4390 }
4393 {
4398 this_basic_block);
4400 }
4403 {
4408 this_basic_block);
4410 }
4412 /* Get death notes for everything that is now used in either I3 or
4413 I2 and used to die in a previous insn. If we built two new
4414 patterns, move from I1 to I2 then I2 to I3 so that we get the
4415 proper movement on registers that I2 modifies. */
4421 else
4427 /* Distribute all the LOG_LINKS and REG_NOTES from I1, I2, and I3. */
4444 /* Distribute any notes added to I2 or I3 by recog_for_combine. We
4445 know these are REG_UNUSED and want them to go to the desired insn,
4446 so we always pass it as i3. */
4450 NULL_RTX);
4454 NULL_RTX);
4456 /* If I3DEST was used in I3SRC, it really died in I3. We may need to
4457 put a REG_DEAD note for it somewhere. If NEWI2PAT exists and sets
4458 I3DEST, the death must be somewhere before I2, not I3. If we passed I3
4459 in that case, it might delete I2. Similarly for I2 and I1.
4460 Show an additional death due to the REG_DEAD note we make here. If
4461 we discard it in distribute_notes, we will decrement it again. */
4464 {
4469 else
4472 }
4475 {
4480 else
4483 }
4486 {
4491 else
4494 }
4497 {
4502 else
4505 }
4513 {
4518 /* The insn that used to set this register doesn't exist, and
4519 this life of the register may not exist either. See if one of
4520 I3's links points to an insn that sets I2DEST. If it does,
4521 that is now the last known value for I2DEST. If we don't update
4522 this and I2 set the register to a value that depended on its old
4523 contents, we will get confused. If this insn is used, thing
4524 will be set correctly in combine_instructions. */
4532 /* If the reg formerly set in I2 died only once and that was in I3,
4533 zero its use count so it won't make `reload' do any work. */
4536 && ! i2dest_in_i2src
4539 }
4542 {
4555 && ! i1dest_in_i1src
4558 }
4561 {
4574 && ! i0dest_in_i0src
4577 }
4579 /* Update reg_stat[].nonzero_bits et al for any changes that may have
4580 been made to this insn. The order is important, because newi2pat
4581 can affect nonzero_bits of newpat. */
4585 }
4588 {
4590 {
4593 }
4595 }
4598 {
4600 {
4603 }
4605 }
4608 {
4610 {
4613 }
4615 }
4618 {
4620 {
4623 }
4625 }
4628 {
4630 {
4633 }
4635 }
4637 /* Set new_direct_jump_p if a new return or simple jump instruction
4638 has been created. Adjust the CFG accordingly. */
4640 {
4644 }
4649 {
4652 }
4656 {
4662 }
4667 {
4673 }
4675 /* A noop might also need cleaning up of CFG, if it comes from the
4676 simplification of a jump. */
4681 {
4684 }
4691 {
4694 }
4696 combine_successes++;
4706 }
4707 \f
4708 /* Get a marker for undoing to the current state. */
4712 {
4714 }
4716 /* Undo the modifications up to the marker. */
4718 static void
4720 {
4724 {
4729 {
4744 }
4748 }
4751 }
4753 /* Undo all the modifications recorded in undobuf. */
4755 static void
4757 {
4759 }
4761 /* We've committed to accepting the changes we made. Move all
4762 of the undos to the free list. */
4764 static void
4766 {
4770 {
4774 }
4776 }
4777 \f
4778 /* Find the innermost point within the rtx at LOC, possibly LOC itself,
4779 where we have an arithmetic expression and return that point. LOC will
4780 be inside INSN.
4782 try_combine will call this function to see if an insn can be split into
4783 two insns. */
4787 {
4797 /* First special-case some codes. */
4799 {
4801 #ifdef INSN_SCHEDULING
4802 /* If we are making a paradoxical SUBREG invalid, it becomes a split
4803 point. */
4806 #endif
4810 /* If we have (mem (const ..)) or (mem (symbol_ref ...)), split it
4811 using LO_SUM and HIGH. */
4814 {
4822 }
4824 /* If we have a PLUS whose second operand is a constant and the
4825 address is not valid, perhaps we can split it up using
4826 the machine-specific way to split large constants. We use
4827 the first pseudo-reg (one of the virtual regs) as a placeholder;
4828 it will not remain in the result. */
4833 {
4836 subst_insn);
4838 /* This should have produced two insns, each of which sets our
4839 placeholder. If the source of the second is a valid address,
4840 we can put both sources together and make a split point
4841 in the middle. */
4854 && memory_address_addr_space_p
4857 {
4861 /* Replace the placeholder in SRC2 with SRC1. If we can
4862 find where in SRC2 it was placed, that can become our
4863 split point and we can replace this address with SRC2.
4864 Just try two obvious places. */
4875 {
4878 }
4879 }
4881 /* If that didn't work and we have a nested plus, like:
4882 ((REG1 * CONST1) + REG2) + CONST2 and (REG1 + REG2) + CONST2
4883 is valid address, try to split (REG1 * CONST1). */
4890 {
4895 {
4898 }
4900 }
4907 {
4912 {
4915 }
4917 }
4919 /* If that didn't work, perhaps the first operand is complex and
4920 needs to be computed separately, so make a split point there.
4921 This will occur on machines that just support REG + CONST
4922 and have a constant moved through some previous computation. */
4927 }
4929 /* If we have a PLUS whose first operand is complex, try computing it
4930 separately by making a split there. */
4941 /* See if we can split SET_SRC as it stands. */
4946 /* See if we can split SET_DEST as it stands. */
4951 /* See if this is a bitfield assignment with everything constant. If
4952 so, this is an IOR of an AND, so split it into that. */
4964 {
4970 rtx or_mask;
4979 else
4980 {
4986 or_mask));
4987 }
4994 }
4996 /* Otherwise, see if this is an operation that we can split into two.
4997 If so, try to split that. */
5001 {
5003 /* If we are AND'ing with a large constant that is only a single
5004 bit and the result is only being used in a context where we
5005 need to know if it is zero or nonzero, replace it with a bit
5006 extraction. This will avoid the large constant, which might
5007 have taken more than one insn to make. If the constant were
5008 not a valid argument to the AND but took only one insn to make,
5009 this is no worse, but if it took more than one insn, it will
5010 be better. */
5020 {
5025 {
5028 }
5029 }
5033 /* If STORE_FLAG_VALUE is -1, this is (NE X 0) and only one bit of X
5034 is known to be on, this can be converted into a NEG of a shift. */
5040 {
5047 pos_rtx)));
5052 }
5058 /* We can't optimize if either mode is a partial integer
5059 mode as we don't know how many bits are significant
5060 in those modes. */
5076 {
5084 }
5089 }
5095 {
5096 /* For unsigned, we have a choice of a shift followed by an
5097 AND or two shifts. Use two shifts for field sizes where the
5098 constant might be too large. We assume here that we can
5099 always at least get 8-bit constants in an AND insn, which is
5100 true for every current RISC. */
5103 {
5104 unsigned HOST_WIDE_INT mask
5109 gen_rtx_LSHIFTRT
5116 }
5117 else
5118 {
5122 gen_rtx_fmt_ee
5132 }
5133 }
5135 /* See if this is a simple operation with a constant as the second
5136 operand. It might be that this constant is out of range and hence
5137 could be used as a split point. */
5145 /* Finally, see if this is a simple operation with its first operand
5146 not in a register. The operation might require this operand in a
5147 register, so return it as a split point. We can always do this
5148 because if the first operand were another operation, we would have
5149 already found it as a split point. */
5158 /* We write NOR as (and (not A) (not B)), but if we don't have a NOR,
5159 it is better to write this as (not (ior A B)) so we can split it.
5160 Similarly for IOR. */
5162 {
5170 }
5172 /* Many RISC machines have a large set of logical insns. If the
5173 second operand is a NOT, put it first so we will try to split the
5174 other operand first. */
5176 {
5180 }
5185 /* Canonicalization can produce (minus A (mult B C)), where C is a
5186 constant. It may be better to try splitting (plus (mult B -C) A)
5187 instead if this isn't a multiply by a power of two. */
5191 {
5199 mode)),
5202 }
5204 /* Split at a multiply-accumulate instruction. However if this is
5205 the SET_SRC, we likely do not have such an instruction and it's
5206 worthless to try this split. */
5215 }
5217 /* Otherwise, select our actions depending on our rtx class. */
5219 {
5225 /* fall through */
5233 /* fall through */
5235 /* Some machines have (and (shift ...) ...) insns. If X is not
5236 an AND, but XEXP (X, 0) is, use it as our split point. */
5246 /* Otherwise, we don't have a split point. */
5248 }
5249 }
5250 \f
5251 /* Throughout X, replace FROM with TO, and return the result.
5252 The result is TO if X is FROM;
5253 otherwise the result is X, but its contents may have been modified.
5254 If they were modified, a record was made in undobuf so that
5255 undo_all will (among other things) return X to its original state.
5257 If the number of changes necessary is too much to record to undo,
5258 the excess changes are not made, so the result is invalid.
5259 The changes already made can still be undone.
5260 undobuf.num_undo is incremented for such changes, so by testing that
5261 the caller can tell whether the result is valid.
5263 `n_occurrences' is incremented each time FROM is replaced.
5265 IN_DEST is nonzero if we are processing the SET_DEST of a SET.
5267 IN_COND is nonzero if we are at the top level of a condition.
5269 UNIQUE_COPY is nonzero if each substitution must be unique. We do this
5270 by copying if `n_occurrences' is nonzero. */
5272 static rtx
5274 {
5279 rtx new_rtx;
5281 /* Two expressions are equal if they are identical copies of a shared
5282 RTX or if they are both registers with the same register number
5283 and mode. */
5285 #define COMBINE_RTX_EQUAL_P(X,Y) \
5286 ((X) == (Y) \
5287 || (REG_P (X) && REG_P (Y) \
5288 && REGNO (X) == REGNO (Y) && GET_MODE (X) == GET_MODE (Y)))
5290 /* Do not substitute into clobbers of regs -- this will never result in
5291 valid RTL. */
5296 {
5297 n_occurrences++;
5299 }
5301 /* If X and FROM are the same register but different modes, they
5302 will not have been seen as equal above. However, the log links code
5303 will make a LOG_LINKS entry for that case. If we do nothing, we
5304 will try to rerecognize our original insn and, when it succeeds,
5305 we will delete the feeding insn, which is incorrect.
5307 So force this insn not to match in this (rare) case. */
5312 /* If this is an object, we are done unless it is a MEM or LO_SUM, both
5313 of which may contain things that can be combined. */
5317 /* It is possible to have a subexpression appear twice in the insn.
5318 Suppose that FROM is a register that appears within TO.
5319 Then, after that subexpression has been scanned once by `subst',
5320 the second time it is scanned, TO may be found. If we were
5321 to scan TO here, we would find FROM within it and create a
5322 self-referent rtl structure which is completely wrong. */
5326 /* Parallel asm_operands need special attention because all of the
5327 inputs are shared across the arms. Furthermore, unsharing the
5328 rtl results in recognition failures. Failure to handle this case
5329 specially can result in circular rtl.
5331 Solve this by doing a normal pass across the first entry of the
5332 parallel, and only processing the SET_DESTs of the subsequent
5333 entries. Ug. */
5338 {
5341 /* If this substitution failed, this whole thing fails. */
5349 {
5353 {
5356 /* If this substitution failed, this whole thing fails. */
5362 }
5363 }
5364 }
5365 else
5366 {
5370 /* We don't need to process a SET_DEST that is a register or PC, so
5371 set up to skip this common case. All other cases where we want
5372 to suppress replacing something inside a SET_SRC are handled via
5373 the IN_DEST operand. */
5379 /* Trying to simplify the operands of a widening MULT is not likely
5380 to create RTL matching a machine insn. */
5392 /* Get the mode of operand 0 in case X is now a SIGN_EXTEND of a
5393 constant. */
5398 {
5400 {
5403 {
5405 {
5408 n_occurrences++;
5409 }
5410 else
5411 {
5413 unique_copy);
5415 /* If this substitution failed, this whole thing
5416 fails. */
5420 }
5423 }
5424 }
5426 {
5427 /* If this is a register being set, ignore it. */
5434 ;
5437 {
5438 /* In general, don't install a subreg involving two
5439 modes not tieable. It can worsen register
5440 allocation, and can even make invalid reload
5441 insns, since the reg inside may need to be copied
5442 from in the outside mode, and that may be invalid
5443 if it is an fp reg copied in integer mode.
5445 We allow an exception to this: It is valid if
5446 it is inside another SUBREG and the mode of that
5447 SUBREG and the mode of the inside of TO is
5448 tieable. */
5467 n_occurrences++;
5468 }
5469 else
5470 /* If we are in a SET_DEST, suppress most cases unless we
5471 have gone inside a MEM, in which case we want to
5472 simplify the address. We assume here that things that
5473 are actually part of the destination have their inner
5474 parts in the first expression. This is true for SUBREG,
5475 STRICT_LOW_PART, and ZERO_EXTRACT, which are the only
5476 things aside from REG and MEM that should appear in a
5477 SET_DEST. */
5479 (((in_dest
5485 unique_copy);
5487 /* If we found that we will have to reject this combination,
5488 indicate that by returning the CLOBBER ourselves, rather than
5489 an expression containing it. This will speed things up as
5490 well as prevent accidents where two CLOBBERs are considered
5491 to be equal, thus producing an incorrect simplification. */
5497 {
5505 }
5511 {
5513 new_rtx,
5517 }
5518 else
5520 }
5521 }
5522 }
5524 /* Check if we are loading something from the constant pool via float
5525 extension; in this case we would undo compress_float_constant
5526 optimization and degenerate constant load to an immediate value. */
5530 {
5534 }
5536 /* Try to simplify X. If the simplification changed the code, it is likely
5537 that further simplification will help, so loop, but limit the number
5538 of repetitions that will be performed. */
5541 {
5542 /* If X is sufficiently simple, don't bother trying to do anything
5543 with it. */
5552 /* We no longer know the original mode of operand 0 since we
5553 have changed the form of X) */
5555 }
5558 }
5559 \f
5560 /* If X is a commutative operation whose operands are not in the canonical
5561 order, use substitutions to swap them. */
5563 static void
5565 {
5568 {
5572 }
5573 }
5575 /* Simplify X, a piece of RTL. We just operate on the expression at the
5576 outer level; call `subst' to simplify recursively. Return the new
5577 expression.
5579 OP0_MODE is the original mode of XEXP (x, 0). IN_DEST is nonzero
5580 if we are inside a SET_DEST. IN_COND is nonzero if we are at the top level
5581 of a condition. */
5583 static rtx
5586 {
5589 scalar_int_mode int_mode;
5590 rtx temp;
5593 /* If this is a commutative operation, put a constant last and a complex
5594 expression first. We don't need to do this for comparisons here. */
5597 /* Try to fold this expression in case we have constants that weren't
5598 present before. */
5601 {
5609 {
5612 {
5616 }
5619 }
5632 }
5635 {
5640 }
5642 /* If this is a simple operation applied to an IF_THEN_ELSE, try
5643 applying it to the arms of the IF_THEN_ELSE. This often simplifies
5644 things. Check for cases where both arms are testing the same
5645 condition.
5647 Don't do anything if all operands are very simple. */
5660 {
5665 /* If everything is a comparison, what we have is highly unlikely
5666 to be simpler, so don't use it. */
5669 /* Similarly, if we end up with one of the expressions the same
5670 as the original, it is certainly not simpler. */
5673 {
5680 /* Simplify the alternative arms; this may collapse the true and
5681 false arms to store-flag values. Be careful to use copy_rtx
5682 here since true_rtx or false_rtx might share RTL with x as a
5683 result of the if_then_else_cond call above. */
5687 /* If true_rtx and false_rtx are not general_operands, an if_then_else
5688 is unlikely to be simpler. */
5691 {
5694 /* Restarting if we generate a store-flag expression will cause
5695 us to loop. Just drop through in this case. */
5697 /* If the result values are STORE_FLAG_VALUE and zero, we can
5698 just make the comparison operation. */
5709 /* Likewise, we can make the negate of a comparison operation
5710 if the result values are - STORE_FLAG_VALUE and zero. */
5718 mode);
5729 mode);
5733 }
5734 }
5735 }
5737 /* First see if we can apply the inverse distributive law. */
5740 {
5744 }
5746 /* If CODE is an associative operation not otherwise handled, see if we
5747 can associate some operands. This can win if they are constants or
5748 if they are logically related (i.e. (a & b) & a). */
5754 {
5756 {
5760 rtx inner;
5762 /* Make sure we pass the constant operand if any as the second
5763 one if this is a commutative operation. */
5771 /* For commutative operations, try the other pair if that one
5772 didn't simplify. */
5774 {
5779 }
5783 }
5784 }
5786 /* A little bit of algebraic simplification here. */
5788 {
5790 /* Ensure that our address has any ASHIFTs converted to MULT in case
5791 address-recognizing predicates are called later. */
5800 /* See if this can be moved to simplify_subreg. */
5803 /* Don't call gen_lowpart if the inner mode
5804 is VOIDmode and we cannot simplify it, as SUBREG without
5805 inner mode is invalid. */
5812 {
5813 rtx temp;
5819 /* If op is known to have all lower bits zero, the result is zero. */
5833 }
5835 /* Don't change the mode of the MEM if that would change the meaning
5836 of the address. */
5843 /* Note that we cannot do any narrowing for non-constants since
5844 we might have been counting on using the fact that some bits were
5845 zero. We now do this in the SET. */
5852 /* For C equal to the width of MODE minus 1, (neg (ashiftrt X C)) can be
5853 replaced by (lshiftrt X C). This will convert
5854 (neg (sign_extract X 1 Y)) to (zero_extract X 1 Y). */
5862 /* If X has only a single bit that might be nonzero, say, bit I, convert
5863 (neg X) to (ashiftrt (ashift X C-I) C-I) where C is the bitsize of
5864 MODE minus 1. This will convert (neg (zero_extract X 1 Y)) to
5865 (sign_extract X 1 Y). But only do this if TEMP isn't a register
5866 or a SUBREG of one since we'd be making the expression more
5867 complex if it was just a register. */
5874 {
5875 rtx temp1 = simplify_shift_const
5881 /* If all we did was surround TEMP with the two shifts, we
5882 haven't improved anything, so don't use it. Otherwise,
5883 we are better off with TEMP1. */
5888 }
5892 /* We can't handle truncation to a partial integer mode here
5893 because we don't know the real bitsize of the partial
5894 integer mode. */
5903 /* We can truncate a constant value and return it. */
5904 {
5905 poly_int64 c;
5908 }
5910 /* Similarly to what we do in simplify-rtx.c, a truncate of a register
5911 whose value is a comparison can be replaced with a subreg if
5912 STORE_FLAG_VALUE permits. */
5922 /* (const (const X)) can become (const X). Do it this way rather than
5923 returning the inner CONST since CONST can be shared with a
5924 REG_EQUAL note. */
5930 /* Convert (lo_sum (high FOO) FOO) to FOO. This is necessary so we
5931 can add in an offset. find_split_point will split this address up
5932 again if it doesn't match. */
5939 /* (plus (xor (and <foo> (const_int pow2 - 1)) <c>) <-c>)
5940 when c is (const_int (pow2 + 1) / 2) is a sign extension of a
5941 bit-field and can be replaced by either a sign_extend or a
5942 sign_extract. The `and' may be a zero_extend and the two
5943 <c>, -<c> constants may be reversed. */
5960 return simplify_shift_const
5967 /* If only the low-order bit of X is possibly nonzero, (plus x -1)
5968 can become (ashiftrt (ashift (xor x 1) C) C) where C is
5969 the bitsize of the mode - 1. This allows simplification of
5970 "a = (b & 8) == 0;" */
5977 return simplify_shift_const
5981 const1_rtx),
5985 /* If we are adding two things that have no bits in common, convert
5986 the addition into an IOR. This will often be further simplified,
5987 for example in cases like ((a & 1) + (a & 2)), which can
5988 become a & 3. */
5993 {
5994 /* Try to simplify the expression further. */
5998 /* If we could, great. If not, do not go ahead with the IOR
5999 replacement, since PLUS appears in many special purpose
6000 address arithmetic instructions. */
6008 }
6010 /* Canonicalize x + x into x << 1. */
6019 /* (minus <foo> (and <foo> (const_int -pow2))) becomes
6020 (and <foo> (const_int pow2-1)) */
6031 /* If we have (mult (plus A B) C), apply the distributive law and then
6032 the inverse distributive law to see if things simplify. This
6033 occurs mostly in addresses, often when unrolling loops. */
6036 {
6040 }
6042 /* Try simplify a*(b/c) as (a*b)/c. */
6045 {
6051 }
6055 /* If this is a divide by a power of two, treat it as a shift if
6056 its first operand is a shift. */
6076 /* If the first operand is a condition code, we can't do anything
6077 with it. */
6080 {
6088 /* Simplify our comparison, if possible. */
6091 /* If STORE_FLAG_VALUE is 1, we can convert (ne x 0) to simply X
6092 if only the low-order bit is possibly nonzero in X (such as when
6093 X is a ZERO_EXTRACT of one bit). Similarly, we can convert EQ to
6094 (xor X 1) or (minus 1 X); we use the former. Finally, if X is
6095 known to be either 0 or -1, NE becomes a NEG and EQ becomes
6096 (plus X 1).
6098 Remove any ZERO_EXTRACT we made when thinking this was a
6099 comparison. It may now be simpler to use, e.g., an AND. If a
6100 ZERO_EXTRACT is indeed appropriate, it will be placed back by
6101 the call to make_compound_operation in the SET case.
6103 Don't apply these optimizations if the caller would
6104 prefer a comparison rather than a value.
6105 E.g., for the condition in an IF_THEN_ELSE most targets need
6106 an explicit comparison. */
6109 ;
6127 {
6131 int_mode);
6132 }
6140 {
6144 const1_rtx);
6145 }
6154 {
6157 }
6159 /* If STORE_FLAG_VALUE is -1, we have cases similar to
6160 those above. */
6162 ;
6179 {
6183 int_mode);
6184 }
6193 {
6197 int_mode);
6198 }
6200 /* If X is 0/1, (eq X 0) is X-1. */
6207 {
6210 }
6212 /* If STORE_FLAG_VALUE says to just test the sign bit and X has just
6213 one bit that might be nonzero, we can convert (ne x 0) to
6214 (ashift x c) where C puts the bit in the sign bit. Remove any
6215 AND with STORE_FLAG_VALUE when we are done, since we are only
6216 going to test the sign bit. */
6224 {
6230 else
6232 }
6234 /* If the code changed, return a whole new comparison.
6235 We also need to avoid using SUBST in cases where
6236 simplify_comparison has widened a comparison with a CONST_INT,
6237 since in that case the wider CONST_INT may fail the sanity
6238 checks in do_SUBST. */
6245 /* Otherwise, keep this operation, but maybe change its operands.
6246 This also converts (ne (compare FOO BAR) 0) to (ne FOO BAR). */
6249 }
6259 /* If we are processing SET_DEST, we are done. */
6277 /* If this is a shift by a constant amount, simplify it. */
6285 (HOST_WIDE_INT_1U
6292 {
6296 /* If we select a low-part subreg, return that. */
6298 {
6302 }
6303 }
6307 }
6310 }
6311 \f
6312 /* Simplify X, an IF_THEN_ELSE expression. Return the new expression. */
6314 static rtx
6316 {
6323 rtx temp;
6326 rtx reversed;
6329 /* Simplify storing of the truth value. */
6334 /* Also when the truth value has to be reversed. */
6340 /* Sometimes we can simplify the arm of an IF_THEN_ELSE if a register used
6341 in it is being compared against certain values. Get the true and false
6342 comparisons and see if that says anything about the value of each arm. */
6348 {
6349 HOST_WIDE_INT nzb;
6355 /* If FALSE_CODE is EQ, swap the codes and arms. */
6358 {
6361 }
6363 scalar_int_mode from_mode;
6365 {
6366 /* If we are comparing against zero and the expression being
6367 tested has only a single bit that might be nonzero, that is
6368 its value when it is not equal to zero. Similarly if it is
6369 known to be -1 or 0. */
6373 {
6376 }
6381 {
6384 }
6385 }
6387 /* Now simplify an arm if we know the value of the register in the
6388 branch and it is used in the arm. Be careful due to the potential
6389 of locally-shared RTL. */
6406 }
6408 /* If we have (if_then_else FOO (pc) (label_ref BAR)) and FOO can be
6409 reversed, do so to avoid needing two sets of patterns for
6410 subtract-and-branch insns. Similarly if we have a constant in the true
6411 arm, the false arm is the same as the first operand of the comparison, or
6412 the false arm is more complicated than the true arm. */
6425 {
6433 /* It is possible that the conditional has been simplified out. */
6436 }
6438 /* If the two arms are identical, we don't need the comparison. */
6443 /* Convert a == b ? b : a to "a". */
6455 /* Look for cases where we have (abs x) or (neg (abs X)). */
6458 && comparison_p
6465 {
6471 return
6474 mode);
6477 }
6479 /* Look for MIN or MAX. */
6482 || (flag_unsafe_math_optimizations
6485 && comparison_p
6490 {
6505 }
6507 /* If we have (if_then_else COND (OP Z C1) Z) and OP is an identity when its
6508 second operand is zero, this can be done as (OP Z (mult COND C2)) where
6509 C2 = C1 * STORE_FLAG_VALUE. Similarly if OP has an outer ZERO_EXTEND or
6510 SIGN_EXTEND as long as Z is already extended (so we don't destroy it).
6511 We can do this kind of thing in some cases when STORE_FLAG_VALUE is
6512 neither 1 or -1, but it isn't worth checking for. */
6515 && comparison_p
6518 {
6534 /* If an identity-zero op is commutative, check whether there
6535 would be a match if we swapped the operands. */
6556 {
6560 }
6573 {
6577 }
6594 {
6598 }
6611 {
6615 }
6618 {
6628 const_true_rtx));
6636 }
6637 }
6639 /* If we have (if_then_else (ne A 0) C1 0) and either A is known to be 0 or
6640 1 and C1 is a single bit or A is known to be 0 or -1 and C1 is the
6641 negation of a single bit, we can convert this operation to a shift. We
6642 can actually do this more generally, but it doesn't seem worth it. */
6654 return
6658 /* (IF_THEN_ELSE (NE A 0) C1 0) is A or a zero-extend of A if the only
6659 non-zero bit in A is C1. */
6667 {
6673 }
6676 }
6677 \f
6678 /* Simplify X, a SET expression. Return the new expression. */
6680 static rtx
6682 {
6685 machine_mode mode
6689 scalar_int_mode int_mode;
6691 /* (set (pc) (return)) gets written as (return). */
6695 /* Now that we know for sure which bits of SRC we are using, see if we can
6696 simplify the expression for the object knowing that we only need the
6697 low-order bits. */
6700 {
6703 }
6705 /* If the source is a COMPARE, look for the use of the comparison result
6706 and try to simplify it unless we already have used undobuf.other_insn. */
6712 {
6721 {
6724 {
6727 }
6728 }
6729 else
6737 {
6741 }
6742 else
6743 {
6748 /* Attempt to simplify CC user. */
6750 {
6754 }
6756 /* Convert X into a no-op move. */
6760 }
6762 /* Simplify our comparison, if possible. */
6765 #ifdef SELECT_CC_MODE
6766 /* If this machine has CC modes other than CCmode, check to see if we
6767 need to use a different CC mode here. */
6776 else
6779 /* If the mode changed, we have to change SET_DEST, the mode in the
6780 compare, and the mode in the place SET_DEST is used. If SET_DEST is
6781 a hard register, just build new versions with the proper mode. If it
6782 is a pseudo, we lose unless it is only time we set the pseudo, in
6783 which case we can safely change its mode. */
6785 {
6787 {
6789 rtx new_dest;
6793 else
6794 {
6797 }
6804 }
6805 }
6808 /* If the code changed, we have to build a new comparison in
6809 undobuf.other_insn. */
6811 {
6820 /* If the only change we made was to change an EQ into an NE or
6821 vice versa, OP0 has only one bit that might be nonzero, and OP1
6822 is zero, check if changing the user of the condition code will
6823 produce a valid insn. If it won't, we can keep the original code
6824 in that insn by surrounding our operation with an XOR. */
6831 {
6836 {
6843 }
6844 }
6845 }
6850 /* Don't generate a compare of a CC with 0, just use that CC. */
6852 {
6855 }
6856 /* Otherwise, if we didn't previously have the same COMPARE we
6857 want, create it from scratch. */
6860 {
6863 }
6864 }
6865 else
6866 {
6867 /* Get SET_SRC in a form where we have placed back any
6868 compound expressions. Then do the checks below. */
6871 }
6873 /* If we have (set x (subreg:m1 (op:m2 ...) 0)) with OP being some operation,
6874 and X being a REG or (subreg (reg)), we may be able to convert this to
6875 (set (subreg:m2 x) (op)).
6877 We can always do this if M1 is narrower than M2 because that means that
6878 we only care about the low bits of the result.
6880 However, on machines without WORD_REGISTER_OPERATIONS defined, we cannot
6881 perform a narrower operation than requested since the high-order bits will
6882 be undefined. On machine where it is defined, this transformation is safe
6883 as long as M1 and M2 have the same number of words. */
6887 && (known_equal_after_align_up
6890 UNITS_PER_WORD))
6899 {
6902 dest));
6906 }
6908 /* If we have (set FOO (subreg:M (mem:N BAR) 0)) with M wider than N, this
6909 would require a paradoxical subreg. Replace the subreg with a
6910 zero_extend to avoid the reload that would otherwise be required.
6911 Don't do this unless we have a scalar integer mode, otherwise the
6912 transformation is incorrect. */
6919 {
6924 }
6926 /* If we don't have a conditional move, SET_SRC is an IF_THEN_ELSE, and we
6927 are comparing an item known to be 0 or -1 against 0, use a logical
6928 operation instead. Check for one of the arms being an IOR of the other
6929 arm with some value. We compute three terms to be IOR'ed together. In
6930 practice, at most two will be nonzero. Then we do the IOR's. */
6938 && (!HAVE_conditional_move
6943 {
6968 int_mode),
6969 false_rtx);
6975 term3));
6978 }
6980 /* If either SRC or DEST is a CLOBBER of (const_int 0), make this
6981 whole thing fail. */
6986 else
6987 /* Convert this into a field assignment operation, if possible. */
6989 }
6990 \f
6991 /* Simplify, X, and AND, IOR, or XOR operation, and return the simplified
6992 result. */
6994 static rtx
6996 {
6999 scalar_int_mode mode;
7002 {
7004 /* We can call simplify_and_const_int only if we don't lose
7005 any (sign) bits when converting INTVAL (op1) to
7006 "unsigned HOST_WIDE_INT". */
7011 {
7018 }
7020 /* If we have any of (and (ior A B) C) or (and (xor A B) C),
7021 apply the distributive law and then the inverse distributive
7022 law to see if things simplify. */
7024 {
7028 }
7030 {
7034 }
7038 /* If we have (ior (and A B) C), apply the distributive law and then
7039 the inverse distributive law to see if things simplify. */
7042 {
7046 }
7049 {
7053 }
7058 }
7061 }
7062 \f
7063 /* We consider ZERO_EXTRACT, SIGN_EXTRACT, and SIGN_EXTEND as "compound
7064 operations" because they can be replaced with two more basic operations.
7065 ZERO_EXTEND is also considered "compound" because it can be replaced with
7066 an AND operation, which is simpler, though only one operation.
7068 The function expand_compound_operation is called with an rtx expression
7069 and will convert it to the appropriate shifts and AND operations,
7070 simplifying at each stage.
7072 The function make_compound_operation is called to convert an expression
7073 consisting of shifts and ANDs into the equivalent compound expression.
7074 It is the inverse of this function, loosely speaking. */
7076 static rtx
7078 {
7082 rtx tem;
7083 scalar_int_mode inner_mode;
7086 {
7089 /* FALLTHRU */
7091 /* We can't necessarily use a const_int for a multiword mode;
7092 it depends on implicitly extending the value.
7093 Since we don't know the right way to extend it,
7094 we can't tell whether the implicit way is right.
7096 Even for a mode that is no wider than a const_int,
7097 we can't win, because we need to sign extend one of its bits through
7098 the rest of it, and we don't know which bit. */
7102 /* Reject modes that aren't scalar integers because turning vector
7103 or complex modes into shifts causes problems. */
7107 /* Return if (subreg:MODE FROM 0) is not a safe replacement for
7108 (zero_extend:MODE FROM) or (sign_extend:MODE FROM). It is for any MEM
7109 because (SUBREG (MEM...)) is guaranteed to cause the MEM to be
7110 reloaded. If not for that, MEM's would very rarely be safe.
7112 Reject modes bigger than a word, because we might not be able
7113 to reference a two-register group starting with an arbitrary register
7114 (and currently gen_lowpart might crash for a SUBREG). */
7120 /* If the inner object has VOIDmode (the only way this can happen
7121 is if it is an ASM_OPERANDS), we can't do anything since we don't
7122 know how much masking to do. */
7131 /* fall through */
7134 /* If the operand is a CLOBBER, just return it. */
7142 /* Reject modes that aren't scalar integers because turning vector
7143 or complex modes into shifts causes problems. */
7150 /* This should stay within the object being extracted, fail otherwise. */
7161 }
7163 /* We've rejected non-scalar operations by now. */
7166 /* Convert sign extension to zero extension, if we know that the high
7167 bit is not set, as this is easier to optimize. It will be converted
7168 back to cheaper alternative in make_extraction. */
7174 {
7178 /* Make sure this is a profitable operation. */
7185 else
7187 }
7189 /* We can optimize some special cases of ZERO_EXTEND. */
7191 {
7192 /* (zero_extend:DI (truncate:SI foo:DI)) is just foo:DI if we
7193 know that the last value didn't have any inappropriate bits
7194 set. */
7202 /* Likewise for (zero_extend:DI (subreg:SI foo:DI 0)). */
7211 /* (zero_extend:DI (truncate:SI foo:DI)) is just foo:DI when foo
7212 is a comparison and STORE_FLAG_VALUE permits. This is like
7213 the first case, but it works even when MODE is larger
7214 than HOST_WIDE_INT. */
7222 /* Likewise for (zero_extend:DI (subreg:SI foo:DI 0)). */
7231 }
7233 /* If we reach here, we want to return a pair of shifts. The inner
7234 shift is a left shift of BITSIZE - POS - LEN bits. The outer
7235 shift is a right shift of BITSIZE - LEN bits. It is arithmetic or
7236 logical depending on the value of UNSIGNEDP.
7238 If this was a ZERO_EXTEND or ZERO_EXTRACT, this pair of shifts will be
7239 converted into an AND of a shift.
7241 We must check for the case where the left shift would have a negative
7242 count. This can happen in a case like (x >> 31) & 255 on machines
7243 that can't shift by a constant. On those machines, we would first
7244 combine the shift with the AND to produce a variable-position
7245 extraction. Then the constant of 31 would be substituted in
7246 to produce such a position. */
7250 {
7258 }
7260 {
7268 }
7269 else
7270 /* Any other cases we can't handle. */
7273 /* If we couldn't do this for some reason, return the original
7274 expression. */
7279 }
7280 \f
7281 /* X is a SET which contains an assignment of one object into
7282 a part of another (such as a bit-field assignment, STRICT_LOW_PART,
7283 or certain SUBREGS). If possible, convert it into a series of
7284 logical operations.
7286 We half-heartedly support variable positions, but do not at all
7287 support variable lengths. */
7289 static const_rtx
7291 {
7292 rtx inner;
7296 scalar_int_mode compute_mode;
7298 /* Loop until we find something we can't simplify. */
7300 {
7303 {
7309 MAX_MODE_INT);
7310 }
7313 {
7321 /* A constant position should stay within the width of INNER. */
7326 {
7332 /* If position is ADJUST - X, new position is X. */
7334 else
7338 pos);
7339 }
7340 }
7342 /* If the destination is a subreg that overwrites the whole of the inner
7343 register, we can move the subreg to the source. */
7345 /* We need SUBREGs to compute nonzero_bits properly. */
7346 && nonzero_sign_valid
7348 {
7350 gen_lowpart
7354 }
7355 else
7361 /* Don't attempt bitwise arithmetic on non scalar integer modes. */
7363 {
7364 /* Don't do anything for vector or complex integral types. */
7368 /* Try to find an integral mode to pun with. */
7374 }
7376 /* Compute a mask of LEN bits, if we can do this on the host machine. */
7380 /* Don't try to compute in too wide unsupported modes. */
7384 /* Now compute the equivalent expression. Make a copy of INNER
7385 for the SET_DEST in case it is a MEM into which we will substitute;
7386 we don't want shared RTL in that case. */
7388 compute_mode);
7392 compute_mode,
7394 compute_mode),
7395 inner);
7400 mask),
7401 pos);
7406 }
7409 }
7410 \f
7411 /* Return an RTX for a reference to LEN bits of INNER. If POS_RTX is nonzero,
7412 it is an RTX that represents the (variable) starting position; otherwise,
7413 POS is the (constant) starting bit position. Both are counted from the LSB.
7415 UNSIGNEDP is nonzero for an unsigned reference and zero for a signed one.
7417 IN_DEST is nonzero if this is a reference in the destination of a SET.
7418 This is used when a ZERO_ or SIGN_EXTRACT isn't needed. If nonzero,
7419 a STRICT_LOW_PART will be used, if zero, ZERO_EXTEND or SIGN_EXTEND will
7420 be used.
7422 IN_COMPARE is nonzero if we are in a COMPARE. This means that a
7423 ZERO_EXTRACT should be built even for bits starting at bit 0.
7425 MODE is the desired mode of the result (if IN_DEST == 0).
7427 The result is an RTX for the extraction or NULL_RTX if the target
7428 can't handle it. */
7430 static rtx
7434 {
7435 /* This mode describes the size of the storage area
7436 to fetch the overall value from. Within that, we
7437 ignore the POS lowest bits, etc. */
7439 machine_mode inner_mode;
7440 scalar_int_mode wanted_inner_mode;
7446 HOST_WIDE_INT orig_pos;
7454 /* If trying or potentionally trying to extract
7455 bits outside of is_mode, don't look through
7456 non-paradoxical SUBREGs. See PR82192. */
7459 {
7460 /* If going from (subreg:SI (mem:QI ...)) to (mem:QI ...),
7461 consider just the QI as the memory to extract from.
7462 The subreg adds or removes high bits; its mode is
7463 irrelevant to the meaning of this extraction,
7464 since POS and LEN count from the lsb. */
7468 }
7473 {
7474 /* We're extracting the least significant bits of an rtx
7475 (ashift X (const_int C)), where LEN > C. Extract the
7476 least significant (LEN - C) bits of X, giving an rtx
7477 whose mode is MODE, then shift it left C times. */
7483 }
7487 {
7488 /* We're extracting the least significant bits of an rtx
7489 (mult X (const_int 2^C)), where LEN > C. Extract the
7490 least significant (LEN - C) bits of X, giving an rtx
7491 whose mode is MODE, then multiply it by 2^C. */
7494 {
7500 }
7501 }
7503 /* If trying or potentionally trying to extract
7504 bits outside of is_mode, don't look through
7505 TRUNCATE. See PR82192. */
7512 /* See if this can be done without an extraction. We never can if the
7513 width of the field is not the same as that of some integer mode. For
7514 registers, we can only avoid the extraction if the position is at the
7515 low-order bit and this is either not in the destination or we have the
7516 appropriate STRICT_LOW_PART operation available.
7518 For MEM, we can avoid an extract if the field starts on an appropriate
7519 boundary and we can change the mode of the memory reference. */
7521 scalar_int_mode tmode;
7530 && (! in_dest
7534 && (pos
7537 /* We can't do this if we are widening INNER_MODE (it
7538 may not be aligned, for one thing). */
7545 {
7546 /* If INNER is a MEM, make a new MEM that encompasses just the desired
7547 field. If the original and current mode are the same, we need not
7548 adjust the offset. Otherwise, we do if bytes big endian.
7550 If INNER is not a MEM, get a piece consisting of just the field
7551 of interest (in this case POS % BITS_PER_WORD must be 0). */
7554 {
7555 poly_int64 offset;
7557 /* POS counts from lsb, but make OFFSET count in memory order. */
7561 else
7565 }
7567 {
7569 {
7570 /* We can't call gen_lowpart in a DEST since we
7571 always want a SUBREG (see below) and it would sometimes
7572 return a new hard register. */
7574 {
7575 poly_uint64 offset
7578 /* Avoid creating invalid subregs, for example when
7579 simplifying (x>>32)&255. */
7584 }
7585 else
7587 }
7588 else
7590 }
7591 else
7593 len >= HOST_BITS_PER_WIDE_INT
7594 ? HOST_WIDE_INT_M1U
7597 /* If this extraction is going into the destination of a SET,
7598 make a STRICT_LOW_PART unless we made a MEM. */
7613 /* If we know that no extraneous bits are set, and that the high
7614 bit is not set, convert the extraction to the cheaper of
7615 sign and zero extension, that are equivalent in these cases. */
7621 {
7625 /* Prefer ZERO_EXTENSION, since it gives more information to
7626 backends. */
7631 }
7633 /* Otherwise, sign- or zero-extend unless we already are in the
7634 proper mode. */
7638 }
7640 /* Unless this is a COMPARE or we have a funny memory reference,
7641 don't do anything with zero-extending field extracts starting at
7642 the low-order bit since they are simple AND operations. */
7647 /* Unless INNER is not MEM, reject this if we would be spanning bytes or
7648 if the position is not a constant and the length is not 1. In all
7649 other cases, we would only be going outside our object in cases when
7650 an original shift would have been undefined. */
7659 /* If INNER is not from memory, we want it to have the mode of a register
7660 extraction pattern's structure operand, or word_mode if there is no
7661 such pattern. The same applies to extraction_mode and pos_mode
7662 and their respective operands.
7664 For memory, assume that the desired extraction_mode and pos_mode
7665 are the same as for a register operation, since at present we don't
7666 have named patterns for aligned memory structures. */
7671 {
7675 }
7677 /* Never narrow an object, since that might not be safe. */
7683 /* Punt if len is too large for extraction_mode. */
7689 else
7690 {
7691 /* Be careful not to go beyond the extracted object and maintain the
7692 natural alignment of the memory. */
7697 }
7702 {
7703 /* POS is passed as if BITS_BIG_ENDIAN == 0, so we need to convert it to
7704 BITS_BIG_ENDIAN style. If position is constant, compute new
7705 position. Otherwise, build subtraction.
7706 Note that POS is relative to the mode of the original argument.
7707 If it's a MEM we need to recompute POS relative to that.
7708 However, if we're extracting from (or inserting into) a register,
7709 we want to recompute POS relative to wanted_inner_mode. */
7718 else
7719 pos_rtx
7722 pos_rtx);
7723 /* POS may be less than 0 now, but we check for that below.
7724 Note that it can only be less than 0 if !MEM_P (inner). */
7725 }
7727 /* If INNER has a wider mode, and this is a constant extraction, try to
7728 make it smaller and adjust the byte to point to the byte containing
7729 the value. */
7732 && ! pos_rtx
7737 {
7740 /* The computations below will be correct if the machine is big
7741 endian in both bits and bytes or little endian in bits and bytes.
7742 If it is mixed, we must adjust. */
7744 /* If bytes are big endian and we had a paradoxical SUBREG, we must
7745 adjust OFFSET to compensate. */
7750 /* We can now move to the desired byte. */
7761 }
7763 /* If INNER is not memory, get it into the proper mode. If we are changing
7764 its mode, POS must be a constant and smaller than the size of the new
7765 mode. */
7767 {
7768 /* On the LHS, don't create paradoxical subregs implicitely truncating
7769 the register unless TARGET_TRULY_NOOP_TRUNCATION. */
7772 wanted_inner_mode))
7784 pos_rtx
7786 ? HOST_WIDE_INT_M1U
7790 }
7792 /* Adjust mode of POS_RTX, if needed. If we want a wider mode, we
7793 have to zero extend. Otherwise, we can just use a SUBREG.
7795 We dealt with constant rtxes earlier, so pos_rtx cannot
7796 have VOIDmode at this point. */
7800 {
7804 /* If we know that no extraneous bits are set, and that the high
7805 bit is not set, convert extraction to cheaper one - either
7806 SIGN_EXTENSION or ZERO_EXTENSION, that are equivalent in these
7807 cases. */
7815 {
7819 /* Prefer ZERO_EXTENSION, since it gives more information to
7820 backends. */
7824 }
7826 }
7828 /* Make POS_RTX unless we already have it and it is correct. If we don't
7829 have a POS_RTX but we do have an ORIG_POS_RTX, the latter must
7830 be a CONST_INT. */
7837 /* Make the required operation. See if we can use existing rtx. */
7844 }
7845 \f
7846 /* See if X (of mode MODE) contains an ASHIFT of COUNT or more bits that
7847 can be commuted with any other operations in X. Return X without
7848 that shift if so. */
7850 static rtx
7852 {
7854 rtx tem;
7857 {
7859 /* This is the shift itself. If it is wide enough, we will return
7860 either the value being shifted if the shift count is equal to
7861 COUNT or a shift for the difference. */
7875 /* If we can safely shift this constant and we find the inner shift,
7876 make a new operation. */
7881 {
7885 }
7890 }
7893 }
7894 \f
7895 /* Subroutine of make_compound_operation. *X_PTR is the rtx at the current
7896 level of the expression and MODE is its mode. IN_CODE is as for
7897 make_compound_operation. *NEXT_CODE_PTR is the value of IN_CODE
7898 that should be used when recursing on operands of *X_PTR.
7900 There are two possible actions:
7902 - Return null. This tells the caller to recurse on *X_PTR with IN_CODE
7903 equal to *NEXT_CODE_PTR, after which *X_PTR holds the final value.
7905 - Return a new rtx, which the caller returns directly. */
7907 static rtx
7911 {
7919 rtx tem;
7920 scalar_int_mode inner_mode;
7924 {
7927 }
7929 /* Process depending on the code of this operation. If NEW is set
7930 nonzero, it will be returned. */
7933 {
7935 /* Convert shifts by constants into multiplications if inside
7936 an address. */
7940 {
7946 {
7949 }
7952 }
7961 {
7965 }
7968 {
7972 mode));
7974 }
7975 else
7976 {
7979 }
7989 {
7993 }
7996 {
8000 mode));
8002 }
8003 else
8004 {
8008 }
8011 /* If the second operand is not a constant, we can't do anything
8012 with it. */
8016 /* If the constant is a power of two minus one and the first operand
8017 is a logical right shift, make an extraction. */
8020 {
8024 }
8026 /* Same as previous, but for (subreg (lshiftrt ...)) in first op. */
8033 {
8040 /* If we narrowed the mode when dropping the subreg, then we lose. */
8044 /* If that didn't give anything, see if the AND simplifies on
8045 its own. */
8047 {
8051 }
8052 }
8053 /* Same as previous, but for (xor/ior (lshiftrt...) (lshiftrt...)). */
8059 {
8060 /* Apply the distributive law, and then try to make extractions. */
8067 }
8069 /* If we are have (and (rotate X C) M) and C is larger than the number
8070 of bits in M, this is an extraction. */
8076 {
8082 }
8084 /* On machines without logical shifts, if the operand of the AND is
8085 a logical shift and our mask turns off all the propagated sign
8086 bits, we can replace the logical shift with an arithmetic shift. */
8094 {
8104 next_code),
8106 }
8108 /* If the constant is one less than a power of two, this might be
8109 representable by an extraction even if no shift is present.
8110 If it doesn't end up being a ZERO_EXTEND, we will ignore it unless
8111 we are in a COMPARE. */
8115 next_code),
8118 /* If we are in a comparison and this is an AND with a power of two,
8119 convert this into the appropriate bit extract. */
8125 next_code),
8128 /* If the one operand is a paradoxical subreg of a register or memory and
8129 the constant (limited to the smaller mode) has only zero bits where
8130 the sub expression has known zero bits, this can be expressed as
8131 a zero_extend. */
8133 {
8134 rtx sub;
8142 {
8146 /* original AND constant with all the known zero bits set */
8149 {
8153 }
8154 }
8155 }
8160 /* If the sign bit is known to be zero, replace this with an
8161 arithmetic shift. */
8166 {
8169 next_code),
8172 }
8174 /* fall through */
8180 /* If we have (ashiftrt (ashift foo C1) C2) with C2 >= C1,
8181 this is a SIGN_EXTRACT. */
8188 {
8195 }
8197 /* See if we have operations between an ASHIFTRT and an ASHIFT.
8198 If so, try to merge the shifts into a SIGN_EXTEND. We could
8199 also do this for some cases of SIGN_EXTRACT, but it doesn't
8200 seem worth the effort; the case checked for occurs on Alpha. */
8211 next_code),
8218 /* Call ourselves recursively on the inner expression. If we are
8219 narrowing the object and it has a different RTL code from
8220 what it originally did, do this SUBREG as a force_to_mode. */
8221 {
8225 /* If the SUBREG is masking of a logical right shift,
8226 make an extraction. */
8233 {
8242 }
8244 /* If in_code is COMPARE, it isn't always safe to pass it through
8245 to the recursive make_compound_operation call. */
8249 /* (subreg:SI (and:DI (reg:DI) (const_int 0x800000000)) 0)
8250 is (const_int 0), rather than
8251 (subreg:SI (lshiftrt:DI (reg:DI) (const_int 35)) 0).
8252 Similarly (subreg:QI (and:SI (reg:SI) (const_int 0x80)) 0)
8253 for non-equality comparisons against 0 is not equivalent
8254 to (subreg:QI (lshiftrt:SI (reg:SI) (const_int 7)) 0). */
8264 simplified
8272 {
8273 rtx newer
8276 /* If we have something other than a SUBREG, we might have
8277 done an expansion, so rerun ourselves. */
8281 /* force_to_mode can expand compounds. If it just re-expanded
8282 the compound, use gen_lowpart to convert to the desired
8283 mode. */
8285 /* Likewise if it re-expanded the compound only partially.
8286 This happens for SUBREG of ZERO_EXTRACT if they extract
8287 the same number of bits. */
8296 }
8300 }
8305 }
8311 }
8313 /* Look at the expression rooted at X. Look for expressions
8314 equivalent to ZERO_EXTRACT, SIGN_EXTRACT, ZERO_EXTEND, SIGN_EXTEND.
8315 Form these expressions.
8317 Return the new rtx, usually just X.
8319 Also, for machines like the VAX that don't have logical shift insns,
8320 try to convert logical to arithmetic shift operations in cases where
8321 they are equivalent. This undoes the canonicalizations to logical
8322 shifts done elsewhere.
8324 We try, as much as possible, to re-use rtl expressions to save memory.
8326 IN_CODE says what kind of expression we are processing. Normally, it is
8327 SET. In a memory address it is MEM. When processing the arguments of
8328 a comparison or a COMPARE against zero, it is COMPARE, or EQ if more
8329 precisely it is an equality comparison against zero. */
8331 rtx
8333 {
8340 /* Select the code to be used in recursive calls. Once we are inside an
8341 address, we stay there. If we have a comparison, set to COMPARE,
8342 but once inside, go back to our default of SET. */
8349 scalar_int_mode mode;
8351 {
8357 }
8359 /* Now recursively process each operand of this operation. We need to
8360 handle ZERO_EXTEND specially so that we don't lose track of the
8361 inner mode. */
8363 {
8371 }
8376 {
8379 }
8382 {
8385 }
8389 }
8390 \f
8391 /* Given M see if it is a value that would select a field of bits
8392 within an item, but not the entire word. Return -1 if not.
8393 Otherwise, return the starting position of the field, where 0 is the
8394 low-order bit.
8396 *PLEN is set to the length of the field. */
8398 static int
8400 {
8401 /* Get the bit number of the first 1 bit from the right, -1 if none. */
8406 /* Now shift off the low-order zero bits and see if we have a
8407 power of two minus 1. */
8415 }
8416 \f
8417 /* If X refers to a register that equals REG in value, replace these
8418 references with REG. */
8419 static rtx
8421 {
8429 {
8462 /* FALLTHRU */
8466 {
8470 else
8472 }
8474 /* fall through */
8481 {
8484 {
8486 {
8489 }
8491 }
8492 }
8494 {
8497 {
8500 {
8502 {
8505 }
8507 }
8508 }
8509 }
8512 }
8515 }
8517 /* Return X converted to MODE. If the value is already truncated to
8518 MODE we can just return a subreg even though in the general case we
8519 would need an explicit truncation. */
8521 static rtx
8523 {
8528 {
8529 /* Bit-cast X into an integer mode. */
8534 }
8537 }
8539 /* See if X can be simplified knowing that we will only refer to it in
8540 MODE and will only refer to those bits that are nonzero in MASK.
8541 If other bits are being computed or if masking operations are done
8542 that select a superset of the bits in MASK, they can sometimes be
8543 ignored.
8545 Return a possibly simplified expression, but always convert X to
8546 MODE. If X is a CONST_INT, AND the CONST_INT with MASK.
8548 If JUST_SELECT is nonzero, don't optimize by noticing that bits in MASK
8549 are all off in X. This is used when X will be complemented, by either
8550 NOT, NEG, or XOR. */
8552 static rtx
8555 {
8558 machine_mode op_mode;
8561 /* If this is a CALL or ASM_OPERANDS, don't do anything. Some of the
8562 code below will do the wrong thing since the mode of such an
8563 expression is VOIDmode.
8565 Also do nothing if X is a CLOBBER; this can happen if X was
8566 the return value from a call to gen_lowpart. */
8570 /* We want to perform the operation in its present mode unless we know
8571 that the operation is valid in MODE, in which case we do the operation
8572 in MODE. */
8577 /* It is not valid to do a right-shift in a narrower mode
8578 than the one it came in with. */
8583 /* Truncate MASK to fit OP_MODE. */
8587 /* Determine what bits of X are guaranteed to be (non)zero. */
8590 /* If none of the bits in X are needed, return a zero. */
8594 /* If X is a CONST_INT, return a new one. Do this here since the
8595 test below will fail. */
8597 {
8600 else
8601 {
8604 }
8605 }
8607 /* If X is narrower than MODE and we want all the bits in X's mode, just
8608 get X in the proper mode. */
8613 /* We can ignore the effect of a SUBREG if it narrows the mode or
8614 if the constant masks to zero all the bits the mode doesn't have. */
8618 || (mask
8626 /* OP_MODE is either MODE or XMODE, so it must be a scalar
8627 integer too. */
8633 }
8635 /* Subroutine of force_to_mode that handles cases in which both X and
8636 the result are scalar integers. MODE is the mode of the result,
8637 XMODE is the mode of X, and OP_MODE says which of MODE or XMODE
8638 is preferred for simplified versions of X. The other arguments
8639 are as for force_to_mode. */
8641 static rtx
8645 {
8650 poly_int64 const_op0;
8652 /* When we have an arithmetic operation, or a shift whose count we
8653 do not know, we need to assume that all bits up to the highest-order
8654 bit in MASK will be needed. This is how we form such a mask. */
8657 else
8662 {
8664 /* If X is a (clobber (const_int)), return it since we know we are
8665 generating something that won't match. */
8678 /* Similarly for a truncate. */
8682 /* If this is an AND with a constant, convert it into an AND
8683 whose constant is the AND of that constant with MASK. If it
8684 remains an AND of MASK, delete it since it is redundant. */
8687 {
8692 /* If X is still an AND, see if it is an AND with a mask that
8693 is just some low-order bits. If so, and it is MASK, we don't
8694 need it. */
8700 /* If it remains an AND, try making another AND with the bits
8701 in the mode mask that aren't in MASK turned on. If the
8702 constant in the AND is wide enough, this might make a
8703 cheaper constant. */
8708 {
8709 unsigned HOST_WIDE_INT cval
8711 rtx y;
8718 }
8721 }
8726 /* In (and (plus FOO C1) M), if M is a mask that just turns off
8727 low-order bits (as in an alignment operation) and FOO is already
8728 aligned to that boundary, mask C1 to that boundary as well.
8729 This may eliminate that PLUS and, later, the AND. */
8731 {
8735 /* If MODE is narrower than HOST_WIDE_INT and mask is a negative
8736 number, sign extend it. */
8749 }
8751 /* fall through */
8754 /* Substituting into the operands of a widening MULT is not likely to
8755 create RTL matching a machine insn. */
8765 /* For PLUS, MINUS and MULT, we need any bits less significant than the
8766 most significant bit in MASK since carries from those bits will
8767 affect the bits we are interested in. */
8772 /* If X is (minus C Y) where C's least set bit is larger than any bit
8773 in the mask, then we may replace with (neg Y). */
8776 {
8779 }
8781 /* Similarly, if C contains every bit in the fuller_mask, then we may
8782 replace with (not Y). */
8785 {
8788 }
8795 /* If X is (ior (lshiftrt FOO C1) C2), try to commute the IOR and
8796 LSHIFTRT so we end up with an (and (lshiftrt (ior ...) ...) ...)
8797 operation which may be a bitfield extraction. Ensure that the
8798 constant we form is not wider than the mode of X. */
8810 {
8813 xmode);
8819 }
8821 binop:
8822 /* For most binary operations, just propagate into the operation and
8823 change the mode if we have an operation of that mode. */
8828 /* If we ended up truncating both operands, truncate the result of the
8829 operation instead. */
8832 {
8835 }
8841 {
8844 }
8848 /* For left shifts, do the same, but just for the first operand.
8849 However, we cannot do anything with shifts where we cannot
8850 guarantee that the counts are smaller than the size of the mode
8851 because such a count will have a different meaning in a
8852 wider mode. */
8862 /* If the shift count is a constant and we can do arithmetic in
8863 the mode of the shift, refine which bits we need. Otherwise, use the
8864 conservative form of the mask. */
8870 else
8878 {
8881 }
8885 /* Here we can only do something if the shift count is a constant,
8886 this shift constant is valid for the host, and we can do arithmetic
8887 in OP_MODE. */
8893 {
8897 /* Select the mask of the bits we need for the shift operand. */
8900 /* We can only change the mode of the shift if we can do arithmetic
8901 in the mode of the shift and INNER_MASK is no wider than the
8902 width of X's mode. */
8909 {
8912 }
8913 }
8915 /* If we have (and (lshiftrt FOO C1) C2) where the combination of the
8916 shift and AND produces only copies of the sign bit (C2 is one less
8917 than a power of two), we can do this with just a shift. */
8921 /* The shift puts one of the sign bit copies in the least significant
8922 bit. */
8927 /* Number of bits left after the shift must be more than the mask
8928 needs. */
8931 /* Must be more sign bit copies than the mask needs. */
8934 {
8938 }
8942 /* If we are just looking for the sign bit, we don't need this shift at
8943 all, even if it has a variable count. */
8947 /* If this is a shift by a constant, get a mask that contains those bits
8948 that are not copies of the sign bit. We then have two cases: If
8949 MASK only includes those bits, this can be a logical shift, which may
8950 allow simplifications. If MASK is a single-bit field not within
8951 those bits, we are requesting a copy of the sign bit and hence can
8952 shift the sign bit to the appropriate location. */
8956 {
8960 /* If the considered data is wider than HOST_WIDE_INT, we can't
8961 represent a mask for all its bits in a single scalar.
8962 But we only care about the lower bits, so calculate these. */
8965 {
8968 /* GET_MODE_PRECISION (GET_MODE (x)) - INTVAL (XEXP (x, 1))
8969 is the number of bits a full-width mask would have set.
8970 We need only shift if these are fewer than nonzero can
8971 hold. If not, we must keep all bits set in nonzero. */
8976 + HOST_BITS_PER_WIDE_INT
8978 }
8979 else
8980 {
8983 }
8986 {
8991 }
8994 {
8995 x = simplify_shift_const
9001 }
9002 }
9004 /* If MASK is 1, convert this to an LSHIFTRT. This can be done
9005 even if the shift count isn't a constant. */
9009 shiftrt:
9011 /* If this is a zero- or sign-extension operation that just affects bits
9012 we don't care about, remove it. Be sure the call above returned
9013 something that is still a shift. */
9023 next_select);
9029 /* If the shift count is constant and we can do computations
9030 in the mode of X, compute where the bits we care about are.
9031 Otherwise, we can't do anything. Don't change the mode of
9032 the shift or propagate MODE into the shift, though. */
9035 {
9044 }
9048 /* If we just want the low-order bit, the NEG isn't needed since it
9049 won't change the low-order bit. */
9053 /* We need any bits less significant than the most significant bit in
9054 MASK since carries from those bits will affect the bits we are
9055 interested in. */
9060 /* (not FOO) is (xor FOO CONST), so if FOO is an LSHIFTRT, we can do the
9061 same as the XOR case above. Ensure that the constant we form is not
9062 wider than the mode of X. */
9070 {
9077 }
9079 /* (and (not FOO) CONST) is (not (or FOO (not CONST))), so we must
9080 use the full mask inside the NOT. */
9083 unop:
9086 next_select));
9088 {
9091 }
9095 /* (and (ne FOO 0) CONST) can be (and FOO CONST) if CONST is included
9096 in STORE_FLAG_VALUE and FOO has a single bit that might be nonzero,
9097 which is equal to STORE_FLAG_VALUE. */
9109 /* We have no way of knowing if the IF_THEN_ELSE can itself be
9110 written in a narrower mode. We play it safe and do not do so. */
9126 }
9128 /* Ensure we return a value of the proper mode. */
9130 }
9131 \f
9132 /* Return nonzero if X is an expression that has one of two values depending on
9133 whether some other value is zero or nonzero. In that case, we return the
9134 value that is being tested, *PTRUE is set to the value if the rtx being
9135 returned has a nonzero value, and *PFALSE is set to the other alternative.
9137 If we return zero, we set *PTRUE and *PFALSE to X. */
9139 static rtx
9141 {
9146 scalar_int_mode int_mode;
9148 /* If we are comparing a value against zero, we are done. */
9151 {
9155 }
9157 /* If this is a unary operation whose operand has one of two values, apply
9158 our opcode to compute those values. */
9161 {
9166 }
9168 /* If this is a COMPARE, do nothing, since the IF_THEN_ELSE we would
9169 make can't possibly match and would suppress other optimizations. */
9171 ;
9173 /* If this is a binary operation, see if either side has only one of two
9174 values. If either one does or if both do and they are conditional on
9175 the same value, compute the new true and false values. */
9177 {
9185 {
9186 /* Try to enable a simplification by undoing work done by
9187 if_then_else_cond if it converted a REG into something more
9188 complex. */
9190 {
9193 }
9194 else
9195 {
9198 }
9199 }
9203 {
9204 /* If if_then_else_cond returned zero, then true/false are the
9205 same rtl. We must copy one of them to prevent invalid rtl
9206 sharing. */
9213 {
9218 }
9219 else
9220 {
9223 }
9226 }
9228 /* See if we have PLUS, IOR, XOR, MINUS or UMAX, where one of the
9229 operands is zero when the other is nonzero, and vice-versa,
9230 and STORE_FLAG_VALUE is 1 or -1. */
9236 {
9254 {
9261 const_true_rtx);
9263 }
9264 }
9266 /* Similarly for MULT, AND and UMIN, except that for these the result
9267 is always zero. */
9271 {
9285 {
9288 }
9289 }
9290 }
9293 {
9294 /* If we have IF_THEN_ELSE already, extract the condition and
9295 canonicalize it if it is NE or EQ. */
9301 {
9304 }
9305 else
9307 }
9309 /* If X is a SUBREG, we can narrow both the true and false values
9310 if the inner expression, if there is a condition. */
9314 {
9320 {
9324 }
9325 }
9327 /* If X is a constant, this isn't special and will cause confusions
9328 if we treat it as such. Likewise if it is equivalent to a constant. */
9331 ;
9333 /* If we're in BImode, canonicalize on 0 and STORE_FLAG_VALUE, as that
9334 will be least confusing to the rest of the compiler. */
9336 {
9339 }
9341 /* If X is known to be either 0 or -1, those are the true and
9342 false values when testing X. */
9347 {
9350 }
9352 /* Likewise for 0 or a single bit. */
9355 {
9358 }
9360 /* Otherwise fail; show no condition with true and false values the same. */
9363 }
9364 \f
9365 /* Return the value of expression X given the fact that condition COND
9366 is known to be true when applied to REG as its first operand and VAL
9367 as its second. X is known to not be shared and so can be modified in
9368 place.
9370 We only handle the simplest cases, and specifically those cases that
9371 arise with IF_THEN_ELSE expressions. */
9373 static rtx
9375 {
9383 /* If either operand of the condition is a floating point value,
9384 then we have to avoid collapsing an EQ comparison. */
9394 /* If X is (abs REG) and we know something about REG's relationship
9395 with zero, we may be able to simplify this. */
9399 {
9408 }
9410 /* The only other cases we handle are MIN, MAX, and comparisons if the
9411 operands are the same as REG and VAL. */
9414 {
9416 {
9419 }
9422 {
9424 {
9432 else
9434 }
9437 {
9440 /* Do not reverse the condition when it is NE or EQ.
9441 This is because we cannot conclude anything about
9442 the value of 'SMAX (x, y)' when x is not equal to y,
9443 but we can when x equals y. */
9449 {
9460 }
9461 }
9462 }
9463 }
9465 {
9470 {
9471 /* We must simplify subreg here, before we lose track of the
9472 original inner_mode. */
9477 else
9479 }
9482 }
9483 /* We don't have to handle SIGN_EXTEND here, because even in the
9484 case of replacing something with a modeless CONST_INT, a
9485 CONST_INT is already (supposed to be) a valid sign extension for
9486 its narrower mode, which implies it's already properly
9487 sign-extended for the wider mode. Now, for ZERO_EXTEND, the
9488 story is different. */
9490 {
9495 {
9496 /* We must simplify the zero_extend here, before we lose
9497 track of the original inner_mode. */
9502 else
9504 }
9507 }
9511 {
9518 }
9521 }
9522 \f
9523 /* See if X and Y are equal for the purposes of seeing if we can rewrite an
9524 assignment as a field assignment. */
9526 static int
9528 {
9530 {
9538 }
9546 /* Check for a paradoxical SUBREG of a MEM compared with the MEM.
9547 Note that all SUBREGs of MEM are paradoxical; otherwise they
9548 would have been rewritten. */
9561 /* We used to see if get_last_value of X and Y were the same but that's
9562 not correct. In one direction, we'll cause the assignment to have
9563 the wrong destination and in the case, we'll import a register into this
9564 insn that might have already have been dead. So fail if none of the
9565 above cases are true. */
9567 }
9568 \f
9569 /* See if X, a SET operation, can be rewritten as a bit-field assignment.
9570 Return that assignment if so.
9572 We only handle the most common cases. */
9574 static rtx
9576 {
9579 rtx assign;
9581 HOST_WIDE_INT c1;
9582 HOST_WIDE_INT pos;
9584 rtx other;
9586 /* All the rules in this function are specific to scalar integers. */
9587 scalar_int_mode mode;
9591 /* If SRC was (and (not (ashift (const_int 1) POS)) DEST), this is
9592 a clear of a one-bit field. We will have changed it to
9593 (and (rotate (const_int -2) POS) DEST), so check for that. Also check
9594 for a SUBREG. */
9600 {
9606 }
9615 {
9622 }
9624 /* If SRC is (ior (ashift (const_int 1) POS) DEST), this is a set of a
9625 one-bit field. */
9629 {
9635 }
9637 /* If DEST is already a field assignment, i.e. ZERO_EXTRACT, and the
9638 SRC is an AND with all bits of that field set, then we can discard
9639 the AND. */
9644 {
9651 else
9654 /* Complete overlap. We can remove the source AND. */
9658 /* Partial overlap. We can reduce the source AND. */
9660 {
9664 }
9665 }
9667 /* The other case we handle is assignments into a constant-position
9668 field. They look like (ior/xor (and DEST C1) OTHER). If C1 represents
9669 a mask that has all one bits except for a group of zero bits and
9670 OTHER is known to have zeros where C1 has ones, this is such an
9671 assignment. Compute the position and length from C1. Shift OTHER
9672 to the appropriate position, force it to the required mode, and
9673 make the extraction. Check for the AND in both operands. */
9675 /* One or more SUBREGs might obscure the constant-position field
9676 assignment. The first one we are likely to encounter is an outer
9677 narrowing SUBREG, which we can just strip for the purposes of
9678 identifying the constant-field assignment. */
9695 /* The second SUBREG that might get in the way is a paradoxical
9696 SUBREG around the first operand of the AND. We want to
9697 pretend the operand is as wide as the destination here. We
9698 do this by adjusting the MEM to wider mode for the sole
9699 purpose of the call to rtx_equal_for_field_assignment_p. Also
9700 note this trick only works for MEMs. */
9712 /* The second SUBREG that might get in the way is a paradoxical
9713 SUBREG around the first operand of the AND. We want to
9714 pretend the operand is as wide as the destination here. We
9715 do this by adjusting the MEM to wider mode for the sole
9716 purpose of the call to rtx_equal_for_field_assignment_p. Also
9717 note this trick only works for MEMs. */
9725 else
9739 /* The mode to use for the source is the mode of the assignment, or of
9740 what is inside a possible STRICT_LOW_PART. */
9744 /* Shift OTHER right POS places and make it the source, restricting it
9745 to the proper length and mode. */
9749 dest);
9751 len >= HOST_BITS_PER_WIDE_INT
9752 ? HOST_WIDE_INT_M1U
9756 /* If SRC is masked by an AND that does not make a difference in
9757 the value being stored, strip it. */
9768 }
9769 \f
9770 /* See if X is of the form (+ (* a c) (* b c)) and convert to (* (+ a b) c)
9771 if so. */
9773 static rtx
9775 {
9779 rtx tem;
9781 /* Distributivity is not true for floating point as it can change the
9782 value. So we don't do it unless -funsafe-math-optimizations. */
9787 /* The outer operation can only be one of the following: */
9795 /* If either operand is a primitive we can't do anything, so get out
9796 fast. */
9806 /* See if the inner and outer operations distribute. */
9808 {
9813 /* These all distribute except over PLUS. */
9824 /* This is also a multiply, so it distributes over everything. */
9827 /* This used to handle SUBREG, but this turned out to be counter-
9828 productive, since (subreg (op ...)) usually is not handled by
9829 insn patterns, and this "optimization" therefore transformed
9830 recognizable patterns into unrecognizable ones. Therefore the
9831 SUBREG case was removed from here.
9833 It is possible that distributing SUBREG over arithmetic operations
9834 leads to an intermediate result than can then be optimized further,
9835 e.g. by moving the outer SUBREG to the other side of a SET as done
9836 in simplify_set. This seems to have been the original intent of
9837 handling SUBREGs here.
9839 However, with current GCC this does not appear to actually happen,
9840 at least on major platforms. If some case is found where removing
9841 the SUBREG case here prevents follow-on optimizations, distributing
9842 SUBREGs ought to be re-added at that place, e.g. in simplify_set. */
9846 }
9848 /* Set LHS and RHS to the inner operands (A and B in the example
9849 above) and set OTHER to the common operand (C in the example).
9850 There is only one way to do this unless the inner operation is
9851 commutative. */
9863 else
9866 /* Form the new inner operation, seeing if it simplifies first. */
9869 /* There is one exception to the general way of distributing:
9870 (a | c) ^ (b | c) -> (a ^ b) & ~c */
9872 {
9875 }
9877 /* We may be able to continuing distributing the result, so call
9878 ourselves recursively on the inner operation before forming the
9879 outer operation, which we return. */
9882 }
9884 /* See if X is of the form (* (+ A B) C), and if so convert to
9885 (+ (* A C) (* B C)) and try to simplify.
9887 Most of the time, this results in no change. However, if some of
9888 the operands are the same or inverses of each other, simplifications
9889 will result.
9891 For example, (and (ior A B) (not B)) can occur as the result of
9892 expanding a bit field assignment. When we apply the distributive
9893 law to this, we get (ior (and (A (not B))) (and (B (not B)))),
9894 which then simplifies to (and (A (not B))).
9896 Note that no checks happen on the validity of applying the inverse
9897 distributive law. This is pointless since we can do it in the
9898 few places where this routine is called.
9900 N is the index of the term that is decomposed (the arithmetic operation,
9901 i.e. (+ A B) in the first example above). !N is the index of the term that
9902 is distributed, i.e. of C in the first example above. */
9903 static rtx
9905 {
9906 machine_mode mode;
9910 /* Distributivity is not true for floating point as it can change the
9911 value. So we don't do it unless -funsafe-math-optimizations. */
9928 /* Special case (and (xor B C) (not A)), which is equivalent to
9929 (xor (ior A B) (ior A C)) */
9931 {
9934 }
9937 {
9938 /* Distribute the second term. */
9941 }
9942 else
9943 {
9944 /* Distribute the first term. */
9947 }
9957 }
9958 \f
9959 /* Simplify a logical `and' of VAROP with the constant CONSTOP, to be done
9960 in MODE. Return an equivalent form, if different from (and VAROP
9961 (const_int CONSTOP)). Otherwise, return NULL_RTX. */
9963 static rtx
9966 {
9969 rtx orig_varop;
9977 /* Simplify VAROP knowing that we will be only looking at some of the
9978 bits in it.
9980 Note by passing in CONSTOP, we guarantee that the bits not set in
9981 CONSTOP are not significant and will never be examined. We must
9982 ensure that is the case by explicitly masking out those bits
9983 before returning. */
9986 /* If VAROP is a CLOBBER, we will fail so return it. */
9990 /* If VAROP is a CONST_INT, then we need to apply the mask in CONSTOP
9991 to VAROP and return the new constant. */
9995 /* See what bits may be nonzero in VAROP. Unlike the general case of
9996 a call to nonzero_bits, here we don't care about bits outside
9997 MODE. */
10001 /* Turn off all bits in the constant that are known to already be zero.
10002 Thus, if the AND isn't needed at all, we will have CONSTOP == NONZERO_BITS
10003 which is tested below. */
10007 /* If we don't have any bits left, return zero. */
10011 /* If VAROP is a NEG of something known to be zero or 1 and CONSTOP is
10012 a power of two, we can replace this with an ASHIFT. */
10017 /* If VAROP is an IOR or XOR, apply the AND to both branches of the IOR
10018 or XOR, then try to apply the distributive law. This may eliminate
10019 operations if either branch can be simplified because of the AND.
10020 It may also make some cases more complex, but those cases probably
10021 won't match a pattern either with or without this. */
10024 {
10026 return
10027 gen_lowpart
10029 apply_distributive_law
10033 constop),
10036 constop))));
10037 }
10039 /* If VAROP is PLUS, and the constant is a mask of low bits, distribute
10040 the AND and see if one of the operands simplifies to zero. If so, we
10041 may eliminate it. */
10045 {
10054 }
10056 /* Make a SUBREG if necessary. If we can't make it, fail. */
10061 /* If we are only masking insignificant bits, return VAROP. */
10068 /* Otherwise, return an AND. */
10070 }
10073 /* We have X, a logical `and' of VAROP with the constant CONSTOP, to be done
10074 in MODE.
10076 Return an equivalent form, if different from X. Otherwise, return X. If
10077 X is zero, we are to always construct the equivalent form. */
10079 static rtx
10082 {
10093 }
10094 \f
10095 /* Given a REG X of mode XMODE, compute which bits in X can be nonzero.
10096 We don't care about bits outside of those defined in MODE.
10097 We DO care about all the bits in MODE, even if XMODE is smaller than MODE.
10099 For most X this is simply GET_MODE_MASK (GET_MODE (MODE)), but if X is
10100 a shift, AND, or zero_extract, we can do better. */
10102 static rtx
10104 scalar_int_mode mode,
10106 {
10107 rtx tem;
10110 /* If X is a register whose nonzero bits value is current, use it.
10111 Otherwise, if X is a register whose value we can find, use that
10112 value. Otherwise, use the previously-computed global nonzero bits
10113 for this register. */
10128 && !REGNO_REG_SET_P
10131 {
10132 /* Note that, even if the precision of last_set_mode is lower than that
10133 of mode, record_value_for_reg invoked nonzero_bits on the register
10134 with nonzero_bits_mode (because last_set_mode is necessarily integral
10135 and HWI_COMPUTABLE_MODE_P in this case) so bits in nonzero_bits_mode
10136 are all valid, hence in mode too since nonzero_bits_mode is defined
10137 to the largest HWI_COMPUTABLE_MODE_P mode. */
10140 }
10144 {
10149 }
10152 {
10156 /* We don't know anything about the upper bits. */
10160 }
10163 }
10165 /* Given a reg X of mode XMODE, return the number of bits at the high-order
10166 end of X that are known to be equal to the sign bit. X will be used
10167 in mode MODE; the returned value will always be between 1 and the
10168 number of bits in MODE. */
10170 static rtx
10172 scalar_int_mode mode,
10174 {
10175 rtx tem;
10188 && !REGNO_REG_SET_P
10191 {
10194 }
10205 }
10206 \f
10207 /* Return the number of "extended" bits there are in X, when interpreted
10208 as a quantity in MODE whose signedness is indicated by UNSIGNEDP. For
10209 unsigned quantities, this is the number of high-order zero bits.
10210 For signed quantities, this is the number of copies of the sign bit
10211 minus 1. In both case, this function returns the number of "spare"
10212 bits. For example, if two quantities for which this function returns
10213 at least 1 are added, the addition is known not to overflow.
10215 This function will always return 0 unless called during combine, which
10216 implies that it must be called from a define_split. */
10218 unsigned int
10220 {
10224 scalar_int_mode int_mode;
10232 }
10234 /* This function is called from `simplify_shift_const' to merge two
10235 outer operations. Specifically, we have already found that we need
10236 to perform operation *POP0 with constant *PCONST0 at the outermost
10237 position. We would now like to also perform OP1 with constant CONST1
10238 (with *POP0 being done last).
10240 Return 1 if we can do the operation and update *POP0 and *PCONST0 with
10241 the resulting operation. *PCOMP_P is set to 1 if we would need to
10242 complement the innermost operand, otherwise it is unchanged.
10244 MODE is the mode in which the operation will be done. No bits outside
10245 the width of this mode matter. It is assumed that the width of this mode
10246 is smaller than or equal to HOST_BITS_PER_WIDE_INT.
10248 If *POP0 or OP1 are UNKNOWN, it means no operation is required. Only NEG, PLUS,
10249 IOR, XOR, and AND are supported. We may set *POP0 to SET if the proper
10250 result is simply *PCONST0.
10252 If the resulting operation cannot be expressed as one operation, we
10253 return 0 and do not change *POP0, *PCONST0, and *PCOMP_P. */
10255 static int
10256 merge_outer_ops (enum rtx_code *pop0, HOST_WIDE_INT *pconst0, enum rtx_code op1, HOST_WIDE_INT const1, machine_mode mode, int *pcomp_p)
10257 {
10264 /* If OP0 is an AND, clear unimportant bits in CONST1. */
10268 /* If OP0 or OP1 is UNKNOWN, this is easy. Similarly if they are the same or
10269 if OP0 is SET. */
10278 {
10280 {
10298 }
10299 }
10301 /* Otherwise, if either is a PLUS or NEG, we can't do anything. */
10305 /* If the two constants aren't the same, we can't do anything. The
10306 remaining six cases can all be done. */
10310 else
10312 {
10315 /* (a & b) | b == b */
10318 /* (a ^ b) | b == a | b */
10319 {;}
10324 /* (a & b) ^ b == (~a) & b */
10327 /* (a | b) ^ b == a & ~b */
10333 /* (a | b) & b == b */
10336 /* (a ^ b) & b) == (~a) & b */
10341 }
10343 /* Check for NO-OP cases. */
10356 /* ??? Slightly redundant with the above mask, but not entirely.
10357 Moving this above means we'd have to sign-extend the mode mask
10358 for the final test. */
10363 }
10364 \f
10365 /* A helper to simplify_shift_const_1 to determine the mode we can perform
10366 the shift in. The original shift operation CODE is performed on OP in
10367 ORIG_MODE. Return the wider mode MODE if we can perform the operation
10368 in that mode. Return ORIG_MODE otherwise. We can also assume that the
10369 result of the shift is subject to operation OUTER_CODE with operand
10370 OUTER_CONST. */
10372 static scalar_int_mode
10376 {
10379 /* In general we can't perform in wider mode for right shift and rotate. */
10381 {
10383 /* We can still widen if the bits brought in from the left are identical
10384 to the sign bit of ORIG_MODE. */
10392 /* Similarly here but with zero bits. */
10397 /* We can also widen if the bits brought in will be masked off. This
10398 operation is performed in ORIG_MODE. */
10400 {
10406 }
10407 /* fall through */
10417 }
10418 }
10420 /* Simplify a shift of VAROP by ORIG_COUNT bits. CODE says what kind
10421 of shift. The result of the shift is RESULT_MODE. Return NULL_RTX
10422 if we cannot simplify it. Otherwise, return a simplified value.
10424 The shift is normally computed in the widest mode we find in VAROP, as
10425 long as it isn't a different number of words than RESULT_MODE. Exceptions
10426 are ASHIFTRT and ROTATE, which are always done in their original mode. */
10428 static rtx
10431 {
10436 machine_mode shift_mode;
10438 /* We form (outer_op (code varop count) (outer_const)). */
10444 /* Make sure and truncate the "natural" shift on the way in. We don't
10445 want to do this inside the loop as it makes it more difficult to
10446 combine shifts. */
10450 /* If we were given an invalid count, don't do anything except exactly
10451 what was requested. */
10458 /* Unless one of the branches of the `if' in this loop does a `continue',
10459 we will `break' the loop after the `if'. */
10462 {
10463 /* If we have an operand of (clobber (const_int 0)), fail. */
10467 /* Convert ROTATERT to ROTATE. */
10469 {
10473 }
10477 {
10478 /* We only change the modes of scalar shifts. */
10484 }
10486 scalar_int_mode shift_unit_mode
10489 /* Handle cases where the count is greater than the size of the mode
10490 minus 1. For ASHIFT, use the size minus one as the count (this can
10491 occur when simplifying (lshiftrt (ashiftrt ..))). For rotates,
10492 take the count modulo the size. For other shifts, the result is
10493 zero.
10495 Since these shifts are being produced by the compiler by combining
10496 multiple operations, each of which are defined, we know what the
10497 result is supposed to be. */
10500 {
10505 else
10506 {
10507 /* We can't simply return zero because there may be an
10508 outer op. */
10512 }
10513 }
10515 /* If we discovered we had to complement VAROP, leave. Making a NOT
10516 here would cause an infinite loop. */
10521 {
10522 /* An arithmetic right shift of a quantity known to be -1 or 0
10523 is a no-op. */
10527 {
10530 }
10532 /* If we are doing an arithmetic right shift and discarding all but
10533 the sign bit copies, this is equivalent to doing a shift by the
10534 bitsize minus one. Convert it into that shift because it will
10535 often allow other simplifications. */
10542 /* We simplify the tests below and elsewhere by converting
10543 ASHIFTRT to LSHIFTRT if we know the sign bit is clear.
10544 `make_compound_operation' will convert it to an ASHIFTRT for
10545 those machines (such as VAX) that don't have an LSHIFTRT. */
10550 shift_unit_mode)))
10562 }
10565 {
10572 {
10575 }
10579 /* The following rules apply only to scalars. */
10584 /* If we have (xshiftrt (mem ...) C) and C is MODE_WIDTH
10585 minus the width of a smaller mode, we can do this with a
10586 SIGN_EXTEND or ZERO_EXTEND from the narrower memory location. */
10593 {
10602 }
10606 /* The following rules apply only to scalars. */
10612 /* If VAROP is a SUBREG, strip it as long as the inner operand has
10613 the same number of words as what we've seen so far. Then store
10614 the widest mode in MODE. */
10621 {
10626 }
10630 /* Some machines use MULT instead of ASHIFT because MULT
10631 is cheaper. But it is still better on those machines to
10632 merge two shifts into one. */
10635 {
10640 }
10644 /* Similar, for when divides are cheaper. */
10647 {
10652 }
10656 /* If we are extracting just the sign bit of an arithmetic
10657 right shift, that shift is not needed. However, the sign
10658 bit of a wider mode may be different from what would be
10659 interpreted as the sign bit in a narrower mode, so, if
10660 the result is narrower, don't discard the shift. */
10665 {
10668 }
10670 /* fall through */
10675 /* The following rules apply only to scalars. */
10682 /* Here we have two nested shifts. The result is usually the
10683 AND of a new shift with a mask. We compute the result below. */
10689 {
10693 rtx mask_rtx;
10695 /* We have one common special case. We can't do any merging if
10696 the inner code is an ASHIFTRT of a smaller mode. However, if
10697 we have (ashift:M1 (subreg:M1 (ashiftrt:M2 FOO C1) 0) C2)
10698 with C2 == GET_MODE_BITSIZE (M1) - GET_MODE_BITSIZE (M2),
10699 we can convert it to
10700 (ashiftrt:M1 (ashift:M1 (and:M1 (subreg:M1 FOO 0) C3) C2) C1).
10701 This simplifies certain SIGN_EXTEND operations. */
10705 {
10706 /* C3 has the low-order C1 bits zero. */
10718 }
10720 /* If this was (ashiftrt (ashift foo C1) C2) and FOO has more
10721 than C1 high-order bits equal to the sign bit, we can convert
10722 this to either an ASHIFT or an ASHIFTRT depending on the
10723 two counts.
10725 We cannot do this if VAROP's mode is not SHIFT_UNIT_MODE. */
10731 {
10735 {
10738 }
10741 }
10743 /* There are some cases we can't do. If CODE is ASHIFTRT,
10744 we can only do this if FIRST_CODE is also ASHIFTRT.
10746 We can't do the case when CODE is ROTATE and FIRST_CODE is
10747 ASHIFTRT.
10749 If the mode of this shift is not the mode of the outer shift,
10750 we can't do this if either shift is a right shift or ROTATE.
10752 Finally, we can't do any of these if the mode is too wide
10753 unless the codes are the same.
10755 Handle the case where the shift codes are the same
10756 first. */
10759 {
10768 }
10779 /* To compute the mask to apply after the shift, shift the
10780 nonzero bits of the inner shift the same way the
10781 outer shift will. */
10784 int_result_mode);
10786 mask_rtx
10790 /* Give up if we can't compute an outer operation to use. */
10798 /* If the shifts are in the same direction, we add the
10799 counts. Otherwise, we subtract them. */
10803 else
10806 /* If COUNT is positive, the new shift is usually CODE,
10807 except for the two exceptions below, in which case it is
10808 FIRST_CODE. If the count is negative, FIRST_CODE should
10809 always be used */
10819 }
10821 /* If we have (A << B << C) for any shift, we can convert this to
10822 (A << C << B). This wins if A is a constant. Only try this if
10823 B is not a constant. */
10828 {
10829 /* For ((unsigned) (cstULL >> count)) >> cst2 we have to make
10830 sure the result will be masked. See PR70222. */
10838 /* For ((int) (cstLL >> count)) >> cst2 just give up. Queuing
10839 up outer sign extension (often left and right shift) is
10840 hardly more efficient than the original. See PR70429.
10841 Similarly punt for rotates with different modes.
10842 See PR97386. */
10850 count_rtx);
10854 }
10858 /* The following rules apply only to scalars. */
10862 /* Make this fit the case below. */
10869 /* The following rules apply only to scalars. */
10875 /* If we have (xshiftrt (ior (plus X (const_int -1)) X) C)
10876 with C the size of VAROP - 1 and the shift is logical if
10877 STORE_FLAG_VALUE is 1 and arithmetic if STORE_FLAG_VALUE is -1,
10878 we have an (le X 0) operation. If we have an arithmetic shift
10879 and STORE_FLAG_VALUE is 1 or we have a logical shift with
10880 STORE_FLAG_VALUE of -1, we have a (neg (le X 0)) operation. */
10888 {
10891 const0_rtx);
10897 }
10899 /* If we have (shift (logical)), move the logical to the outside
10900 to allow it to possibly combine with another logical and the
10901 shift to combine with another shift. This also canonicalizes to
10902 what a ZERO_EXTRACT looks like. Also, some machines have
10903 (and (shift)) insns. */
10906 /* We can't do this if we have (ashiftrt (xor)) and the
10907 constant has its sign bit set in shift_unit_mode with
10908 shift_unit_mode wider than result_mode. */
10921 {
10924 }
10926 /* If we can't do that, try to simplify the shift in each arm of the
10927 logical expression, make a new logical expression, and apply
10928 the inverse distributive law. This also can't be done for
10929 (ashiftrt (xor)) where we've widened the shift and the constant
10930 changes the sign bit. */
10936 {
10948 }
10952 /* The following rules apply only to scalars. */
10957 /* Convert (lshiftrt (eq FOO 0) C) to (xor FOO 1) if STORE_FLAG_VALUE
10958 says that the sign bit can be tested, FOO has mode MODE, C is
10959 GET_MODE_PRECISION (MODE) - 1, and FOO has only its low-order bit
10960 that may be nonzero. */
10970 {
10974 }
10978 /* The following rules apply only to scalars. */
10983 /* (lshiftrt (neg A) C) where A is either 0 or 1 and C is one less
10984 than the number of bits in the mode is equivalent to A. */
10988 {
10992 }
10994 /* NEG commutes with ASHIFT since it is multiplication. Move the
10995 NEG outside to allow shifts to combine. */
10999 {
11002 }
11006 /* The following rules apply only to scalars. */
11011 /* (lshiftrt (plus A -1) C) where A is either 0 or 1 and C
11012 is one less than the number of bits in the mode is
11013 equivalent to (xor A 1). */
11020 {
11024 }
11026 /* If we have (xshiftrt (plus FOO BAR) C), and the only bits
11027 that might be nonzero in BAR are those being shifted out and those
11028 bits are known zero in FOO, we can replace the PLUS with FOO.
11029 Similarly in the other operand order. This code occurs when
11030 we are computing the size of a variable-size array. */
11037 {
11040 }
11048 {
11051 }
11053 /* (ashift (plus foo C) N) is (plus (ashift foo N) C'). */
11064 {
11067 }
11069 /* Check for 'PLUS signbit', which is the canonical form of 'XOR
11070 signbit', and attempt to change the PLUS to an XOR and move it to
11071 the outer operation as is done above in the AND/IOR/XOR case
11072 leg for shift(logical). See details in logical handling above
11073 for reasoning in doing so. */
11085 {
11088 }
11093 /* The following rules apply only to scalars. */
11098 /* If we have (xshiftrt (minus (ashiftrt X C)) X) C)
11099 with C the size of VAROP - 1 and the shift is logical if
11100 STORE_FLAG_VALUE is 1 and arithmetic if STORE_FLAG_VALUE is -1,
11101 we have a (gt X 0) operation. If the shift is arithmetic with
11102 STORE_FLAG_VALUE of 1 or logical with STORE_FLAG_VALUE == -1,
11103 we have a (neg (gt X 0)) operation. */
11112 {
11115 const0_rtx);
11121 }
11125 /* Change (lshiftrt (truncate (lshiftrt))) to (truncate (lshiftrt))
11126 if the truncate does not affect the value. */
11133 {
11137 new_count);
11140 new_count_rtx);
11144 }
11149 }
11152 }
11156 {
11157 /* We only change the modes of scalar shifts. */
11162 }
11164 /* We have now finished analyzing the shift. The result should be
11165 a shift of type CODE with SHIFT_MODE shifting VAROP COUNT places. If
11166 OUTER_OP is non-UNKNOWN, it is an operation that needs to be applied
11167 to the result of the shift. OUTER_CONST is the relevant constant,
11168 but we must turn off all bits turned off in the shift. */
11176 /* Make a SUBREG if necessary. If we can't make it, fail. */
11181 /* If we have an outer operation and we just made a shift, it is
11182 possible that we could have simplified the shift were it not
11183 for the outer operation. So try to do the simplification
11184 recursively. */
11188 else
11195 /* If we were doing an LSHIFTRT in a wider mode than it was originally,
11196 turn off all the bits that the shift would have turned off. */
11198 /* We only change the modes of scalar shifts. */
11202 /* Do the remainder of the processing in RESULT_MODE. */
11205 /* If COMPLEMENT_P is set, we have to complement X before doing the outer
11206 operation. */
11211 {
11221 {
11222 /* This means that we have determined that the result is
11223 equivalent to a constant. This should be rare. */
11226 }
11229 else
11232 }
11235 }
11237 /* Simplify a shift of VAROP by COUNT bits. CODE says what kind of shift.
11238 The result of the shift is RESULT_MODE. If we cannot simplify it,
11239 return X or, if it is NULL, synthesize the expression with
11240 simplify_gen_binary. Otherwise, return a simplified value.
11242 The shift is normally computed in the widest mode we find in VAROP, as
11243 long as it isn't a different number of words than RESULT_MODE. Exceptions
11244 are ASHIFTRT and ROTATE, which are always done in their original mode. */
11246 static rtx
11249 {
11260 }
11262 \f
11263 /* A subroutine of recog_for_combine. See there for arguments and
11264 return value. */
11266 static int
11268 {
11270 rtx pat_without_clobbers;
11278 /* If PAT is a PARALLEL, check to see if it contains the CLOBBER
11279 we use to indicate that something didn't match. If we find such a
11280 thing, force rejection. */
11294 {
11297 else
11300 }
11302 /* If it isn't, there is the possibility that we previously had an insn
11303 that clobbered some register as a side effect, but the combined
11304 insn doesn't need to do that. So try once more without the clobbers
11305 unless this represents an ASM insn. */
11309 {
11314 {
11317 pos++;
11318 }
11328 {
11331 else
11334 }
11335 }
11342 /* Recognize all noop sets, these will be killed by followup pass. */
11346 /* If we had any clobbers to add, make a new pattern than contains
11347 them. Then check to make sure that all of them are dead. */
11349 {
11359 else
11366 {
11371 {
11375 }
11376 }
11378 }
11382 {
11390 /* Allow targets to reject combined insn. */
11392 {
11395 dump_file);
11397 /* Callers expect recog_for_combine to strip
11398 clobbers from the pattern on failure. */
11403 }
11408 }
11414 }
11416 /* Change every ZERO_EXTRACT and ZERO_EXTEND of a SUBREG that can be
11417 expressed as an AND and maybe an LSHIFTRT, to that formulation.
11418 Return whether anything was so changed. */
11420 static bool
11422 {
11428 {
11440 {
11450 else
11454 {
11460 }
11461 }
11467 {
11472 {
11478 }
11479 }
11484 {
11488 }
11489 else
11495 {
11498 }
11502 }
11509 scalar_int_mode mode;
11515 {
11529 else
11537 }
11540 }
11542 /* Like recog, but we receive the address of a pointer to a new pattern.
11543 We try to match the rtx that the pointer points to.
11544 If that fails, we may try to modify or replace the pattern,
11545 storing the replacement into the same pointer object.
11547 Modifications include deletion or addition of CLOBBERs. If the
11548 instruction will still not match, we change ZERO_EXTEND and ZERO_EXTRACT
11549 to the equivalent AND and perhaps LSHIFTRT patterns, and try with that
11550 (and undo if that fails).
11552 PNOTES is a pointer to a location where any REG_UNUSED notes added for
11553 the CLOBBERs are placed.
11555 The value is the final insn code from the pattern ultimately matched,
11556 or -1. */
11558 static int
11560 {
11570 {
11571 /* For an unrecognized single set of a constant, try placing it in
11572 the constant pool, if this function already uses one. */
11577 {
11583 {
11586 }
11587 }
11588 else
11590 }
11592 {
11595 {
11599 }
11600 }
11603 {
11608 }
11611 }
11612 \f
11613 /* Like gen_lowpart_general but for use by combine. In combine it
11614 is not possible to create any new pseudoregs. However, it is
11615 safe to create invalid memory addresses, because combine will
11616 try to recognize them and all they will do is make the combine
11617 attempt fail.
11619 If for some reason this cannot do its job, an rtx
11620 (clobber (const_int 0)) is returned.
11621 An insn containing that will not be recognized. */
11623 static rtx
11625 {
11627 rtx result;
11632 /* We can only support MODE being wider than a word if X is a
11633 constant integer or has a mode the same size. */
11639 /* X might be a paradoxical (subreg (mem)). In that case, gen_lowpart
11640 won't know what to do. So we will strip off the SUBREG here and
11641 process normally. */
11643 {
11646 /* For use in case we fall down into the address adjustments
11647 further below, we need to adjust the known mode and size of
11648 x; imode and isize, since we just adjusted x. */
11653 }
11661 {
11662 /* Refuse to work on a volatile memory ref or one with a mode-dependent
11663 address. */
11668 /* If we want to refer to something bigger than the original memref,
11669 generate a paradoxical subreg instead. That will force a reload
11670 of the original memref X. */
11676 }
11678 /* If X is a comparison operator, rewrite it in a new mode. This
11679 probably won't match, but may allow further simplifications. */
11685 /* If we couldn't simplify X any other way, just enclose it in a
11686 SUBREG. Normally, this SUBREG won't match, but some patterns may
11687 include an explicit SUBREG or we may simplify it further in combine. */
11688 else
11689 {
11690 rtx res;
11693 {
11698 }
11702 }
11704 fail:
11706 }
11707 \f
11708 /* Try to simplify a comparison between OP0 and a constant OP1,
11709 where CODE is the comparison code that will be tested, into a
11710 (CODE OP0 const0_rtx) form.
11712 The result is a possibly different comparison code to use.
11713 *POP1 may be updated. */
11715 static enum rtx_code
11718 {
11719 scalar_int_mode int_mode;
11722 /* Get the constant we are comparing against and turn off all bits
11723 not on in our mode. */
11727 /* If we are comparing against a constant power of two and the value
11728 being compared can only have that single bit nonzero (e.g., it was
11729 `and'ed with that bit), we can replace this with a comparison
11730 with zero. */
11739 {
11742 }
11744 /* Similarly, if we are comparing a value known to be either -1 or
11745 0 with -1, change it to the opposite comparison against zero. */
11751 {
11754 }
11756 /* Do some canonicalizations based on the comparison code. We prefer
11757 comparisons against zero and then prefer equality comparisons.
11758 If we can reduce the size of a constant, we will do that too. */
11760 {
11762 /* < C is equivalent to <= (C - 1) */
11764 {
11767 /* ... fall through to LE case below. */
11769 }
11770 else
11774 /* <= C is equivalent to < (C + 1); we do this for C < 0 */
11776 {
11779 }
11781 /* If we are doing a <= 0 comparison on a value known to have
11782 a zero sign bit, we can replace this with == 0. */
11793 /* >= C is equivalent to > (C - 1). */
11795 {
11798 /* ... fall through to GT below. */
11800 }
11801 else
11805 /* > C is equivalent to >= (C + 1); we do this for C < 0. */
11807 {
11810 }
11812 /* If we are doing a > 0 comparison on a value known to have
11813 a zero sign bit, we can replace this with != 0. */
11824 /* < C is equivalent to <= (C - 1). */
11826 {
11829 /* ... fall through ... */
11831 }
11832 /* (unsigned) < 0x80000000 is equivalent to >= 0. */
11837 {
11841 }
11842 else
11846 /* unsigned <= 0 is equivalent to == 0 */
11849 /* (unsigned) <= 0x7fffffff is equivalent to >= 0. */
11853 == ((HOST_WIDE_INT_1U
11855 {
11858 }
11862 /* >= C is equivalent to > (C - 1). */
11864 {
11867 /* ... fall through ... */
11869 }
11871 /* (unsigned) >= 0x80000000 is equivalent to < 0. */
11876 {
11880 }
11881 else
11885 /* unsigned > 0 is equivalent to != 0 */
11888 /* (unsigned) > 0x7fffffff is equivalent to < 0. */
11892 == (HOST_WIDE_INT_1U
11894 {
11897 }
11902 }
11906 }
11907 \f
11908 /* Simplify a comparison between *POP0 and *POP1 where CODE is the
11909 comparison code that will be tested.
11911 The result is a possibly different comparison code to use. *POP0 and
11912 *POP1 may be updated.
11914 It is possible that we might detect that a comparison is either always
11915 true or always false. However, we do not perform general constant
11916 folding in combine, so this knowledge isn't useful. Such tautologies
11917 should have been detected earlier. Hence we ignore all such cases. */
11919 static enum rtx_code
11921 {
11927 opt_scalar_int_mode tmode_iter;
11929 /* Try a few ways of applying the same transformation to both operands. */
11931 {
11932 /* The test below this one won't handle SIGN_EXTENDs on these machines,
11933 so check specially. */
11952 {
11955 }
11957 /* If both operands are the same constant shift, see if we can ignore the
11958 shift. We can if the shift is a rotate or if the bits shifted out of
11959 this shift are known to be zero for both inputs and if the type of
11960 comparison is compatible with the shift. */
11973 {
11986 else
11988 }
11990 /* If both operands are AND's of a paradoxical SUBREG by constant, the
11991 SUBREGs are of the same mode, and, in both cases, the AND would
11992 be redundant if the comparison was done in the narrower mode,
11993 do the comparison in the narrower mode (e.g., we are AND'ing with 1
11994 and the operand's possibly nonzero bits are 0xffffff01; in that case
11995 if we only care about QImode, we don't need the AND). This case
11996 occurs if the output mode of an scc insn is not SImode and
11997 STORE_FLAG_VALUE == 1 (e.g., the 386).
11999 Similarly, check for a case where the AND's are ZERO_EXTEND
12000 operations from some narrower mode even though a SUBREG is not
12001 present. */
12006 {
12022 {
12026 /* The resulting comparison is always unsigned since we masked
12027 off the original sign bit. */
12031 }
12037 {
12043 }
12047 }
12049 /* If both operands are NOT, we can strip off the outer operation
12050 and adjust the comparison code for swapped operands; similarly for
12051 NEG, except that this must be an equality comparison. */
12057 else
12059 }
12061 /* If the first operand is a constant, swap the operands and adjust the
12062 comparison code appropriately, but don't do this if the second operand
12063 is already a constant integer. */
12065 {
12068 }
12070 /* We now enter a loop during which we will try to simplify the comparison.
12071 For the most part, we only are concerned with comparisons with zero,
12072 but some things may really be comparisons with zero but not start
12073 out looking that way. */
12076 {
12078 scalar_int_mode int_mode;
12082 HOST_WIDE_INT const_op;
12084 /* We only want to handle integral modes. This catches VOIDmode,
12085 CCmode, and the floating-point modes. An exception is that we
12086 can handle VOIDmode if OP0 is a COMPARE or a comparison
12087 operation. */
12094 /* Try to simplify the compare to constant, possibly changing the
12095 comparison op, and/or changing op1 to zero. */
12099 /* Compute some predicates to simplify code below. */
12106 /* If this is a sign bit comparison and we can do arithmetic in
12107 MODE, say that we will only be needing the sign bit of OP0. */
12112 HOST_WIDE_INT_1U
12117 {
12118 /* We can't do anything if OP0 is a condition code value, rather
12119 than an actual data value. */
12124 /* Get the two operands being compared. */
12127 else
12130 /* Check for the cases where we simply want the result of the
12131 earlier test or the opposite of that result. */
12135 {
12139 else
12143 {
12148 }
12149 }
12151 }
12157 /* Now try cases based on the opcode of OP0. If none of the cases
12158 does a "continue", we exit this loop immediately after the
12159 switch. */
12164 {
12166 /* If we are extracting a single bit from a variable position in
12167 a constant that has only a single bit set and are comparing it
12168 with zero, we can convert this into an equality comparison
12169 between the position and the location of the single bit. */
12170 /* Except we can't if SHIFT_COUNT_TRUNCATED is set, since we might
12171 have already reduced the shift count modulo the word size. */
12177 {
12185 /* Result is nonzero iff shift count is equal to I. */
12188 }
12190 /* fall through */
12195 {
12198 }
12202 /* If testing for equality, we can take the NOT of the constant. */
12205 {
12209 }
12211 /* If just looking at the sign bit, reverse the sense of the
12212 comparison. */
12214 {
12218 }
12222 /* If testing for equality, we can take the NEG of the constant. */
12225 {
12229 }
12231 /* The remaining cases only apply to comparisons with zero. */
12235 /* When X is ABS or is known positive,
12236 (neg X) is < 0 if and only if X != 0. */
12244 {
12248 }
12250 /* If we have NEG of something whose two high-order bits are the
12251 same, we know that "(-a) < 0" is equivalent to "a > 0". */
12253 {
12257 }
12261 /* If we are testing equality and our count is a constant, we
12262 can perform the inverse operation on our RHS. */
12266 {
12270 }
12272 /* If we are doing a < 0 or >= 0 comparison, it means we are testing
12273 a particular bit. Convert it to an AND of a constant of that
12274 bit. This will be converted into a ZERO_EXTRACT. */
12279 {
12281 (HOST_WIDE_INT_1U
12286 }
12288 /* Fall through. */
12291 /* ABS is ignorable inside an equality comparison with zero. */
12293 {
12296 }
12300 /* Can simplify (compare (zero/sign_extend FOO) CONST) to
12301 (compare FOO CONST) if CONST fits in FOO's mode and we
12302 are either testing inequality or have an unsigned
12303 comparison with ZERO_EXTEND or a signed comparison with
12304 SIGN_EXTEND. But don't do it if we don't have a compare
12305 insn of the given mode, since we'd have to revert it
12306 later on, and then we wouldn't know whether to sign- or
12307 zero-extend. */
12309 && ! unsigned_comparison_p
12313 {
12316 }
12320 /* Check for the case where we are comparing A - C1 with C2, that is
12322 (subreg:MODE (plus (A) (-C1))) op (C2)
12324 with C1 a constant, and try to lift the SUBREG, i.e. to do the
12325 comparison in the wider mode. One of the following two conditions
12326 must be true in order for this to be valid:
12328 1. The mode extension results in the same bit pattern being added
12329 on both sides and the comparison is equality or unsigned. As
12330 C2 has been truncated to fit in MODE, the pattern can only be
12331 all 0s or all 1s.
12333 2. The mode extension results in the sign bit being copied on
12334 each side.
12336 The difficulty here is that we have predicates for A but not for
12337 (A - C1) so we need to check that C1 is within proper bounds so
12338 as to perturbate A as little as possible. */
12347 {
12355 /* (A - C1) zero-extends if it is positive and sign-extends
12356 if it is negative, C2 both zero- and sign-extends. */
12360 /* (A - C1) sign-extends if it is positive and 1-extends
12361 if it is negative, C2 both sign- and 1-extends. */
12368 /* (A - C1) always sign-extends, like C2. */
12372 {
12375 }
12376 }
12378 /* If the inner mode is narrower and we are extracting the low part,
12379 we can treat the SUBREG as if it were a ZERO_EXTEND. */
12381 ;
12390 {
12391 /* Remove outer subregs that don't do anything. */
12396 {
12400 }
12402 }
12403 else
12406 /* FALLTHROUGH */
12415 {
12418 }
12422 /* (eq (plus X A) B) -> (eq X (minus B A)). We can only do
12423 this for equality comparisons due to pathological cases involving
12424 overflows. */
12428 {
12432 }
12434 /* (plus (abs X) (const_int -1)) is < 0 if and only if X == 0. */
12437 {
12441 }
12445 /* We used to optimize signed comparisons against zero, but that
12446 was incorrect. Unsigned comparisons against zero (GTU, LEU)
12447 arrive here as equality comparisons, or (GEU, LTU) are
12448 optimized away. No need to special-case them. */
12450 /* (eq (minus A B) C) -> (eq A (plus B C)) or
12451 (eq B (minus A C)), whichever simplifies. We can only do
12452 this for equality comparisons due to pathological cases involving
12453 overflows. */
12457 {
12461 }
12466 {
12470 }
12472 /* The sign bit of (minus (ashiftrt X C) X), where C is the number
12473 of bits in X minus 1, is one iff X > 0. */
12478 {
12482 }
12486 /* (eq (xor A B) C) -> (eq A (xor B C)). This is a simplification
12487 if C is zero or B is a constant. */
12491 {
12495 }
12500 /* The sign bit of (ior (plus X (const_int -1)) X) is nonzero
12501 iff X <= 0. */
12505 {
12509 }
12513 /* Convert (and (xshift 1 X) Y) to (and (lshiftrt Y X) 1). This
12514 will be converted to a ZERO_EXTRACT later. */
12518 {
12523 }
12525 /* If we are comparing (and (lshiftrt X C1) C2) for equality with
12526 zero and X is a comparison and C1 and C2 describe only bits set
12527 in STORE_FLAG_VALUE, we can compare with X. */
12535 {
12542 {
12545 }
12546 }
12548 /* If we are doing an equality comparison of an AND of a bit equal
12549 to the sign bit, replace this with a LT or GE comparison of
12550 the underlying value. */
12557 {
12561 }
12563 /* If this AND operation is really a ZERO_EXTEND from a narrower
12564 mode, the constant fits within that mode, and this is either an
12565 equality or unsigned comparison, try to do this comparison in
12566 the narrower mode.
12568 Note that in:
12570 (ne:DI (and:DI (reg:DI 4) (const_int 0xffffffff)) (const_int 0))
12571 -> (ne:DI (reg:SI 4) (const_int 0))
12573 unless TARGET_TRULY_NOOP_TRUNCATION allows it or the register is
12574 known to hold a value of the required mode the
12575 transformation is invalid. */
12583 {
12586 }
12588 /* If this is (and:M1 (subreg:M1 X:M2 0) (const_int C1)) where C1
12589 fits in both M1 and M2 and the SUBREG is either paradoxical
12590 or represents the low part, permute the SUBREG and the AND
12591 and try again. */
12594 {
12596 /* Require an integral mode, to avoid creating something like
12597 (AND:SF ...). */
12600 /* It is unsafe to commute the AND into the SUBREG if the
12601 SUBREG is paradoxical and WORD_REGISTER_OPERATIONS is
12602 not defined. As originally written the upper bits
12603 have a defined value due to the AND operation.
12604 However, if we commute the AND inside the SUBREG then
12605 they no longer have defined values and the meaning of
12606 the code has been changed.
12607 Also C1 should not change value in the smaller mode,
12608 see PR67028 (a positive C1 can become negative in the
12609 smaller mode, so that the AND does no longer mask the
12610 upper bits). */
12611 && ((WORD_REGISTER_OPERATIONS
12623 {
12629 }
12630 }
12632 /* Convert (ne (and (not X) 1) 0) to (eq (and X 1) 0). */
12636 {
12641 }
12643 /* Convert (ne (and (lshiftrt (not X)) 1) 0) to
12644 (eq (and (lshiftrt X) 1) 0).
12645 Also handle the case where (not X) is expressed using xor. */
12649 {
12659 == HOST_WIDE_INT_1U
12661 {
12662 op0
12667 }
12668 }
12672 /* If we have (compare (ashift FOO N) (const_int C)) and
12673 the high order N bits of FOO (N+1 if an inequality comparison)
12674 are known to be zero, we can do this by comparing FOO with C
12675 shifted right N bits so long as the low-order N bits of C are
12676 zero. */
12688 {
12689 /* We must perform a logical shift, not an arithmetic one,
12690 as we want the top N bits of C to be zero. */
12697 }
12699 /* If we are doing a sign bit comparison, it means we are testing
12700 a particular bit. Convert it to the appropriate AND. */
12703 {
12705 (HOST_WIDE_INT_1U
12710 }
12712 /* If this an equality comparison with zero and we are shifting
12713 the low bit to the sign bit, we can convert this to an AND of the
12714 low-order bit. */
12718 {
12721 }
12725 /* If this is an equality comparison with zero, we can do this
12726 as a logical shift, which might be much simpler. */
12729 {
12734 }
12736 /* If OP0 is a sign extension and CODE is not an unsigned comparison,
12737 do the comparison in a narrower mode. */
12747 {
12750 }
12752 /* Likewise if OP0 is a PLUS of a sign extension with a
12753 constant, which is usually represented with the PLUS
12754 between the shifts. */
12766 {
12774 new_const);
12776 }
12778 /* FALLTHROUGH */
12780 /* If we have (compare (xshiftrt FOO N) (const_int C)) and
12781 the low order N bits of FOO are known to be zero, we can do this
12782 by comparing FOO with C shifted left N bits so long as no
12783 overflow occurs. Even if the low order N bits of FOO aren't known
12784 to be zero, if the comparison is >= or < we can use the same
12785 optimization and for > or <= by setting all the low
12786 order N bits in the comparison constant. */
12797 {
12798 unsigned HOST_WIDE_INT low_bits
12800 & ((HOST_WIDE_INT_1U
12803 {
12804 /* If the shift was logical, then we must make the condition
12805 unsigned. */
12814 const_op
12819 }
12820 }
12822 /* If we are using this shift to extract just the sign bit, we
12823 can replace this with an LT or GE comparison. */
12828 {
12832 }
12837 }
12840 }
12842 /* Now make any compound operations involved in this comparison. Then,
12843 check for an outmost SUBREG on OP0 that is not doing anything or is
12844 paradoxical. The latter transformation must only be performed when
12845 it is known that the "extra" bits will be the same in op0 and op1 or
12846 that they don't matter. There are three cases to consider:
12848 1. SUBREG_REG (op0) is a register. In this case the bits are don't
12849 care bits and we can assume they have any convenient value. So
12850 making the transformation is safe.
12852 2. SUBREG_REG (op0) is a memory and LOAD_EXTEND_OP is UNKNOWN.
12853 In this case the upper bits of op0 are undefined. We should not make
12854 the simplification in that case as we do not know the contents of
12855 those bits.
12857 3. SUBREG_REG (op0) is a memory and LOAD_EXTEND_OP is not UNKNOWN.
12858 In that case we know those bits are zeros or ones. We must also be
12859 sure that they are the same as the upper bits of op1.
12861 We can never remove a SUBREG for a non-equality comparison because
12862 the sign bit is in a different place in the underlying object. */
12875 {
12877 {
12878 /* For paradoxical subregs, allow case 1 as above. Case 3 isn't
12879 implemented. */
12881 {
12884 }
12885 }
12889 {
12894 }
12895 }
12897 /* We now do the opposite procedure: Some machines don't have compare
12898 insns in all modes. If OP0's mode is an integer mode smaller than a
12899 word and we can't do a compare in that mode, see if there is a larger
12900 mode for which we can do the compare. There are a number of cases in
12901 which we can use the wider mode. */
12907 {
12912 {
12915 /* If this is a test for negative, we can make an explicit
12916 test of the sign bit. Test this first so we can use
12917 a paradoxical subreg to extend OP0. */
12921 {
12922 unsigned HOST_WIDE_INT sign
12929 }
12931 /* If the only nonzero bits in OP0 and OP1 are those in the
12932 narrower mode and this is an equality or unsigned comparison,
12933 we can use the wider mode. Similarly for sign-extended
12934 values, in which case it is true for all comparisons. */
12951 {
12952 /* If OP0 is an AND and we don't have an AND in MODE either,
12953 make a new AND in the proper mode. */
12961 else
12962 {
12964 {
12969 }
12970 else
12971 {
12976 }
12978 }
12979 }
12980 }
12981 }
12983 /* We may have changed the comparison operands. Re-canonicalize. */
12985 {
12988 }
12990 /* If this machine only supports a subset of valid comparisons, see if we
12991 can convert an unsupported one into a supported one. */
12998 }
12999 \f
13000 /* Utility function for record_value_for_reg. Count number of
13001 rtxs in X. */
13002 static int
13004 {
13011 {
13031 }
13042 }
13043 \f
13044 /* Utility function for following routine. Called when X is part of a value
13045 being stored into last_set_value. Sets last_set_table_tick
13046 for each register mentioned. Similar to mention_regs in cse.c */
13048 static void
13050 {
13056 {
13062 {
13065 }
13068 }
13072 {
13073 /* Check for identical subexpressions. If x contains
13074 identical subexpression we only have to traverse one of
13075 them. */
13077 {
13078 /* Note that at this point x1 has already been
13079 processed. */
13083 /* If x0 and x1 are identical then there is no need to
13084 process x0. */
13088 /* If x0 is identical to a subexpression of x1 then while
13089 processing x1, x0 has already been processed. Thus we
13090 are done with x. */
13095 /* If x1 is identical to a subexpression of x0 then we
13096 still have to process the rest of x0. */
13099 {
13102 }
13103 }
13106 }
13110 }
13112 /* Record that REG is set to VALUE in insn INSN. If VALUE is zero, we
13113 are saying that the register is clobbered and we no longer know its
13114 value. If INSN is zero, don't update reg_stat[].last_set; this is
13115 only permitted with VALUE also zero and is used to invalidate the
13116 register. */
13118 static void
13120 {
13126 /* If VALUE contains REG and we have a previous value for REG, substitute
13127 the previous value. */
13129 {
13130 rtx tem;
13132 /* Set things up so get_last_value is allowed to see anything set up to
13133 our insn. */
13137 /* If TEM is simply a binary operation with two CLOBBERs as operands,
13138 it isn't going to be useful and will take a lot of time to process,
13139 so just use the CLOBBER. */
13142 {
13148 {
13149 /* If there are two or more occurrences of REG in VALUE,
13150 prevent the value from growing too much. */
13153 }
13156 }
13157 }
13159 /* For each register modified, show we don't know its value, that
13160 we don't know about its bitwise content, that its value has been
13161 updated, and that we don't know the location of the death of the
13162 register. */
13164 {
13176 }
13178 /* Mark registers that are being referenced in this value. */
13182 /* Now update the status of each register being set.
13183 If someone is using this register in this block, set this register
13184 to invalid since we will get confused between the two lives in this
13185 basic block. This makes using this register always invalid. In cse, we
13186 scan the table to invalidate all entries using this register, but this
13187 is too much work for us. */
13190 {
13196 else
13198 }
13200 /* The value being assigned might refer to X (like in "x++;"). In that
13201 case, we must replace it with (clobber (const_int 0)) to prevent
13202 infinite loops. */
13205 {
13209 }
13211 /* For the main register being modified, update the value, the mode, the
13212 nonzero bits, and the number of sign bit copies. */
13217 {
13225 rsp->last_set_sign_bit_copies
13227 }
13228 }
13230 /* Called via note_stores from record_dead_and_set_regs to handle one
13231 SET or CLOBBER in an insn. DATA is the instruction in which the
13232 set is occurring. */
13234 static void
13236 {
13243 {
13247 }
13250 {
13251 /* If we are setting the whole register, we know its value. Otherwise
13252 show that we don't know the value. We can handle a SUBREG if it's
13253 the low part, but we must be careful with paradoxical SUBREGs on
13254 RISC architectures because we cannot strip e.g. an extension around
13255 a load and record the naked load since the RTL middle-end considers
13256 that the upper bits are defined according to LOAD_EXTEND_OP. */
13263 BITS_PER_WORD)
13266 WORD_REGISTER_OPERATIONS
13272 else
13274 }
13276 /* Ignore pushes, they clobber nothing. */
13279 }
13281 /* Update the records of when each REG was most recently set or killed
13282 for the things done by INSN. This is the last thing done in processing
13283 INSN in the combiner loop.
13285 We update reg_stat[], in particular fields last_set, last_set_value,
13286 last_set_mode, last_set_nonzero_bits, last_set_sign_bit_copies,
13287 last_death, and also the similar information mem_last_set (which insn
13288 most recently modified memory) and last_call_luid (which insn was the
13289 most recent subroutine call). */
13291 static void
13293 {
13294 rtx link;
13298 {
13301 {
13306 {
13311 }
13312 }
13315 }
13318 {
13319 HARD_REG_SET callee_clobbers
13321 hard_reg_set_iterator hrsi;
13323 {
13326 /* ??? We could try to preserve some information from the last
13327 set of register I if the call doesn't actually clobber
13328 (reg:last_set_mode I), which might be true for ABIs with
13329 partial clobbers. However, it would be difficult to
13330 update last_set_nonzero_bits and last_sign_bit_copies
13331 to account for the part of I that actually was clobbered.
13332 It wouldn't help much anyway, since we rarely see this
13333 situation before RA. */
13343 }
13347 /* We can't combine into a call pattern. Remember, though, that
13348 the return value register is set at this LUID. We could
13349 still replace a register with the return value from the
13350 wrong subroutine call! */
13352 }
13353 else
13355 }
13357 /* If a SUBREG has the promoted bit set, it is in fact a property of the
13358 register present in the SUBREG, so for each such SUBREG go back and
13359 adjust nonzero and sign bit information of the registers that are
13360 known to have some zero/sign bits set.
13362 This is needed because when combine blows the SUBREGs away, the
13363 information on zero/sign bits is lost and further combines can be
13364 missed because of that. */
13366 static void
13368 {
13370 rtx set;
13378 {
13387 {
13390 }
13394 {
13397 }
13400 {
13403 }
13404 else
13406 }
13407 }
13409 /* Check if X, a register, is known to contain a value already
13410 truncated to MODE. In this case we can use a subreg to refer to
13411 the truncated value even though in the generic case we would need
13412 an explicit truncation. */
13414 static bool
13416 {
13428 }
13430 /* If X is a hard reg or a subreg record the mode that the register is
13431 accessed in. For non-TARGET_TRULY_NOOP_TRUNCATION targets we might be
13432 able to turn a truncate into a subreg using this information. Return true
13433 if traversing X is complete. */
13435 static bool
13437 {
13438 machine_mode truncated_mode;
13442 {
13454 }
13455 /* ??? For hard-regs we now record everything. We might be able to
13456 optimize this using last_set_mode. */
13459 else
13466 {
13469 }
13472 }
13474 /* Callback for note_uses. Find hardregs and subregs of pseudos and
13475 the modes they are used in. This can help truning TRUNCATEs into
13476 SUBREGs. */
13478 static void
13480 {
13485 }
13487 /* Scan X for promoted SUBREGs. For each one found,
13488 note what it implies to the registers used in it. */
13490 static void
13492 {
13497 else
13498 {
13504 {
13514 }
13515 }
13516 }
13517 \f
13518 /* Verify that all the registers and memory references mentioned in *LOC are
13519 still valid. *LOC was part of a value set in INSN when label_tick was
13520 equal to TICK. Return 0 if some are not. If REPLACE is nonzero, replace
13521 the invalid references with (clobber (const_int 0)) and return 1. This
13522 replacement is useful because we often can get useful information about
13523 the form of a value (e.g., if it was produced by a shift that always
13524 produces -1 or 0) even though we don't know exactly what registers it
13525 was produced from. */
13527 static int
13529 {
13536 {
13542 {
13545 /* If this is a pseudo-register that was only set once and not
13546 live at the beginning of the function, it is always valid. */
13550 && (!REGNO_REG_SET_P
13552 regno)))
13554 {
13558 }
13559 }
13562 }
13563 /* If this is a memory reference, make sure that there were no stores after
13564 it that might have clobbered the value. We don't have alias info, so we
13565 assume any store invalidates it. Moreover, we only have local UIDs, so
13566 we also assume that there were stores in the intervening basic blocks. */
13569 {
13573 }
13576 {
13578 {
13579 /* Check for identical subexpressions. If x contains
13580 identical subexpression we only have to traverse one of
13581 them. */
13583 {
13584 /* Note that at this point x0 has already been checked
13585 and found valid. */
13589 /* If x0 and x1 are identical then x is also valid. */
13593 /* If x1 is identical to a subexpression of x0 then
13594 while checking x0, x1 has already been checked. Thus
13595 it is valid and so as x. */
13600 /* If x0 is identical to a subexpression of x1 then x is
13601 valid iff the rest of x1 is valid. */
13604 return
13608 }
13613 }
13619 }
13621 /* If we haven't found a reason for it to be invalid, it is valid. */
13623 }
13625 /* Get the last value assigned to X, if known. Some registers
13626 in the value may be replaced with (clobber (const_int 0)) if their value
13627 is known longer known reliably. */
13629 static rtx
13631 {
13633 rtx value;
13636 /* If this is a non-paradoxical SUBREG, get the value of its operand and
13637 then convert it to the desired mode. If this is a paradoxical SUBREG,
13638 we cannot predict what values the "extra" bits might have. */
13652 /* If we don't have a value, or if it isn't for this basic block and
13653 it's either a hard register, set more than once, or it's a live
13654 at the beginning of the function, return 0.
13656 Because if it's not live at the beginning of the function then the reg
13657 is always set before being used (is never used without being set).
13658 And, if it's set only once, and it's always set before use, then all
13659 uses must have the same last value, even if it's not from this basic
13660 block. */
13667 || REGNO_REG_SET_P
13671 /* If the value was set in a later insn than the ones we are processing,
13672 we can't use it even if the register was only set once. */
13677 /* If fewer bits were set than what we are asked for now, we cannot use
13678 the value. */
13683 /* If the value has all its registers valid, return it. */
13687 /* Otherwise, make a copy and replace any invalid register with
13688 (clobber (const_int 0)). If that fails for some reason, return 0. */
13695 }
13696 \f
13697 /* Define three variables used for communication between the following
13698 routines. */
13702 rtx reg_dead_reg;
13704 /* Function called via note_stores from reg_dead_at_p.
13706 If DEST is within [reg_dead_regno, reg_dead_endregno), set
13707 reg_dead_flag to 1 if X is a CLOBBER and to -1 it is a SET. */
13709 static void
13711 {
13721 }
13723 /* Return nonzero if REG is known to be dead at INSN.
13725 We scan backwards from INSN. If we hit a REG_DEAD note or a CLOBBER
13726 referencing REG, it is dead. If we hit a SET referencing REG, it is
13727 live. Otherwise, see if it is live or dead at the start of the basic
13728 block we are in. Hard regs marked as being live in NEWPAT_USED_REGS
13729 must be assumed to be always live. */
13731 static int
13733 {
13734 basic_block block;
13737 /* Set variables for reg_dead_at_p_1. */
13744 /* Check that reg isn't mentioned in NEWPAT_USED_REGS. For fixed registers
13745 we allow the machine description to decide whether use-and-clobber
13746 patterns are OK. */
13748 {
13752 }
13754 /* Scan backwards until we find a REG_DEAD note, SET, CLOBBER, or
13755 beginning of basic block. */
13758 {
13760 {
13770 }
13776 }
13778 /* Look at live-in sets for the basic block that we were in. */
13784 }
13785 \f
13786 /* Note hard registers in X that are used. */
13788 static void
13790 {
13796 {
13800 CASE_CONST_ANY:
13808 /* If we are clobbering a MEM, mark any hard registers inside the
13809 address as used. */
13816 /* A hard reg in a wide mode may really be multiple registers.
13817 If so, mark all of them just like the first. */
13819 {
13820 /* None of this applies to the stack, frame or arg pointers. */
13822 || (!HARD_FRAME_POINTER_IS_FRAME_POINTER
13830 }
13834 {
13835 /* If setting a MEM, or a SUBREG of a MEM, then note any hard regs in
13836 the address. */
13848 }
13853 }
13855 /* Recursively scan the operands of this expression. */
13857 {
13861 {
13865 {
13870 }
13871 }
13872 }
13873 }
13874 \f
13875 /* Remove register number REGNO from the dead registers list of INSN.
13877 Return the note used to record the death, if there was one. */
13879 rtx
13881 {
13888 }
13890 /* For each register (hardware or pseudo) used within expression X, if its
13891 death is in an instruction with luid between FROM_LUID (inclusive) and
13892 TO_INSN (exclusive), put a REG_DEAD note for that register in the
13893 list headed by PNOTES.
13895 That said, don't move registers killed by maybe_kill_insn.
13897 This is done when X is being merged by combination into TO_INSN. These
13898 notes will then be distributed as needed. */
13900 static void
13903 {
13909 {
13913 /* If we do not know where the register died, it may still die between
13914 FROM_LUID and TO_INSN. If so, find it. This is PR83304. */
13916 {
13921 {
13923 {
13927 }
13930 }
13931 }
13933 /* Don't move the register if it gets killed in between from and to. */
13942 {
13945 /* It is possible for the call above to return 0. This can occur
13946 when last_death points to I2 or I1 that we combined with.
13947 In that case make a new note.
13949 We must also check for the case where X is a hard register
13950 and NOTE is a death note for a range of hard registers
13951 including X. In that case, we must put REG_DEAD notes for
13952 the remaining registers in place of NOTE. */
13956 {
13965 }
13967 /* If we didn't find any note, or if we found a REG_DEAD note that
13968 covers only part of the given reg, and we have a multi-reg hard
13969 register, then to be safe we must check for REG_DEAD notes
13970 for each register other than the first. They could have
13971 their own REG_DEAD notes lying around. */
13978 {
13985 else
13991 }
13994 {
13997 }
13998 else
14000 }
14003 }
14006 {
14011 /* In the case of a ZERO_EXTRACT, a STRICT_LOW_PART, or a SUBREG
14012 that accesses one word of a multi-word item, some
14013 piece of everything register in the expression is used by
14014 this insn, so remove any old death. */
14015 /* ??? So why do we test for equality of the sizes? */
14021 {
14024 }
14026 /* If this is some other SUBREG, we know it replaces the entire
14027 value, so use that as the destination. */
14031 /* If this is a MEM, adjust deaths of anything used in the address.
14032 For a REG (the only other possibility), the entire value is
14033 being replaced so the old value is not used in this insn. */
14039 }
14048 {
14050 {
14055 }
14058 }
14059 }
14060 \f
14061 /* Return 1 if X is the target of a bit-field assignment in BODY, the
14062 pattern of an insn. X must be a REG. */
14064 static int
14066 {
14070 {
14072 rtx target;
14079 else
14096 }
14104 }
14105 \f
14106 /* Given a chain of REG_NOTES originally from FROM_INSN, try to place them
14107 as appropriate. I3 and I2 are the insns resulting from the combination
14108 insns including FROM (I2 may be zero).
14110 ELIM_I2 and ELIM_I1 are either zero or registers that we know will
14111 not need REG_DEAD notes because they are being substituted for. This
14112 saves searching in the most common cases.
14114 Each note in the list is either ignored or placed on some insns, depending
14115 on the type of note. */
14117 static void
14120 {
14122 rtx tem_note;
14126 {
14131 {
14134 /* Doesn't matter much where we put this, as long as it's somewhere.
14135 It is preferable to keep these notes on branches, which is most
14136 likely to be i3. */
14143 else
14144 {
14147 }
14151 /* These notes must remain with the call or trapping instruction. */
14156 else
14157 {
14163 /* ??? Otherwise assume we've combined things such that we
14164 can now prove that the instructions can't trap. Drop the
14165 note in this case. */
14166 }
14170 /* ??? How to distribute between i3-i1. Assume i3 contains the
14171 entire adjustment. Assert i3 contains at least some adjust. */
14173 {
14175 /* fixup_args_size_notes looks at REG_NORETURN note,
14176 so ensure the note is placed there first. */
14178 {
14182 {
14188 }
14189 }
14191 /* emit_call_1 adds for !ACCUMULATE_OUTGOING_ARGS
14192 REG_ARGS_SIZE note to all noreturn calls, allow that here. */
14195 && !ACCUMULATE_OUTGOING_ARGS
14197 }
14206 /* These notes must remain with the call. It should not be
14207 possible for both I2 and I3 to be a call. */
14210 else
14211 {
14214 }
14218 /* Any clobbers for i3 may still exist, and so we must process
14219 REG_UNUSED notes from that insn.
14221 Any clobbers from i2 or i1 can only exist if they were added by
14222 recog_for_combine. In that case, recog_for_combine created the
14223 necessary REG_UNUSED notes. Trying to keep any original
14224 REG_UNUSED notes from these insns can cause incorrect output
14225 if it is for the same register as the original i3 dest.
14226 In that case, we will notice that the register is set in i3,
14227 and then add a REG_UNUSED note for the destination of i3, which
14228 is wrong. However, it is possible to have REG_UNUSED notes from
14229 i2 or i1 for register which were both used and clobbered, so
14230 we keep notes from i2 or i1 if they will turn into REG_DEAD
14231 notes. */
14233 /* If this register is set or clobbered between FROM_INSN and I3,
14234 we should not create a note for it. */
14238 /* If this register is set or clobbered in I3, put the note there
14239 unless there is one already. */
14241 {
14249 }
14250 /* Otherwise, if this register is used by I3, then this register
14251 now dies here, so we must put a REG_DEAD note here unless there
14252 is one already. */
14258 {
14261 }
14263 /* A SET or CLOBBER of the REG_UNUSED reg has been removed,
14264 but we can't tell which at this point. We must reset any
14265 expectations we had about the value that was previously
14266 stored in the reg. ??? Ideally, we'd adjust REG_N_SETS
14267 and, if appropriate, restore its previous value, but we
14268 don't have enough information for that at this point. */
14269 else
14270 {
14273 /* Otherwise, if this register is now referenced in i2
14274 then the register used to be modified in one of the
14275 original insns. If it was i3 (say, in an unused
14276 parallel), it's now completely gone, so the note can
14277 be discarded. But if it was modified in i2, i1 or i0
14278 and we still reference it in i2, then we're
14279 referencing the previous value, and since the
14280 register was modified and REG_UNUSED, we know that
14281 the previous value is now dead. So, if we only
14282 reference the register in i2, we change the note to
14283 REG_DEAD, to reflect the previous value. However, if
14284 we're also setting or clobbering the register as
14285 scratch, we know (because the register was not
14286 referenced in i3) that it's unused, just as it was
14287 unused before, and we place the note in i2. */
14290 {
14299 }
14300 }
14307 /* These notes say something about results of an insn. We can
14308 only support them if they used to be on I3 in which case they
14309 remain on I3. Otherwise they are ignored.
14311 If the note refers to an expression that is not a constant, we
14312 must also ignore the note since we cannot tell whether the
14313 equivalence is still true. It might be possible to do
14314 slightly better than this (we only have a problem if I2DEST
14315 or I1DEST is present in the expression), but it doesn't
14316 seem worth the trouble. */
14324 /* These notes say something about how a register is used. They must
14325 be present on any use of the register in I2 or I3. */
14330 {
14333 else
14335 }
14340 /* This can show up in several ways -- either directly in the
14341 pattern, or hidden off in the constant pool with (or without?)
14342 a REG_EQUAL note. */
14343 /* ??? Ignore the without-reg_equal-note problem for now. */
14355 {
14358 else
14360 }
14362 /* For REG_LABEL_TARGET on a JUMP_P, we prefer to put the note
14363 as a JUMP_LABEL or decrement LABEL_NUSES if it's already
14364 there. */
14369 {
14376 }
14382 {
14390 }
14394 /* This note says something about the value of a register prior
14395 to the execution of an insn. It is too much trouble to see
14396 if the note is still correct in all situations. It is better
14397 to simply delete it. */
14401 /* If we replaced the right hand side of FROM_INSN with a
14402 REG_EQUAL note, the original use of the dying register
14403 will not have been combined into I3 and I2. In such cases,
14404 FROM_INSN is guaranteed to be the first of the combined
14405 instructions, so we simply need to search back before
14406 FROM_INSN for the previous use or set of this register,
14407 then alter the notes there appropriately.
14409 If the register is used as an input in I3, it dies there.
14410 Similarly for I2, if it is nonzero and adjacent to I3.
14412 If the register is not used as an input in either I3 or I2
14413 and it is not one of the registers we were supposed to eliminate,
14414 there are two possibilities. We might have a non-adjacent I2
14415 or we might have somehow eliminated an additional register
14416 from a computation. For example, we might have had A & B where
14417 we discover that B will always be zero. In this case we will
14418 eliminate the reference to A.
14420 In both cases, we must search to see if we can find a previous
14421 use of A and put the death note there. */
14427 else
14428 {
14434 {
14435 /* If the new I2 sets the same register that is marked
14436 dead in the note, we do not in general know where to
14437 put the note. One important case we _can_ handle is
14438 when the note comes from I3. */
14441 else
14443 }
14450 && !(i2mod
14452 i2mod_old_rhs)))
14457 }
14460 {
14464 {
14466 {
14470 }
14472 /* If the register is being set at TEM_INSN, see if that is all
14473 TEM_INSN is doing. If so, delete TEM_INSN. Otherwise, make this
14474 into a REG_UNUSED note instead. Don't delete sets to
14475 global register vars. */
14479 {
14489 ;
14491 /* Verify that it was the set, and not a clobber that
14492 modified the register.
14494 If we cannot delete the setter due to side
14495 effects, mark the user with an UNUSED note instead
14496 of deleting it. */
14500 {
14501 /* Move the notes and links of TEM_INSN elsewhere.
14502 This might delete other dead insns recursively.
14503 First set the pattern to something that won't use
14504 any register. */
14522 }
14523 else
14524 {
14527 /* If there isn't already a REG_UNUSED note, put one
14528 here. Do not place a REG_DEAD note, even if
14529 the register is also used here; that would not
14530 match the algorithm used in lifetime analysis
14531 and can cause the consistency check in the
14532 scheduler to fail. */
14537 }
14538 }
14542 {
14545 /* If we are doing a 3->2 combination, and we have a
14546 register which formerly died in i3 and was not used
14547 by i2, which now no longer dies in i3 and is used in
14548 i2 but does not die in i2, and place is between i2
14549 and i3, then we may need to move a link from place to
14550 i2. */
14552 && from_insn
14555 {
14559 }
14561 }
14565 }
14567 }
14569 /* If the register is set or already dead at PLACE, we needn't do
14570 anything with this note if it is still a REG_DEAD note.
14571 We check here if it is set at all, not if is it totally replaced,
14572 which is what `dead_or_set_p' checks, so also check for it being
14573 set partially. */
14576 {
14582 {
14583 /* Unless the register previously died in PLACE, clear
14584 last_death. [I no longer understand why this is
14585 being done.] */
14589 }
14590 else
14593 /* If this is a death note for a hard reg that is occupying
14594 multiple registers, ensure that we are still using all
14595 parts of the object. If we find a piece of the object
14596 that is unused, we must arrange for an appropriate REG_DEAD
14597 note to be added for it. However, we can't just emit a USE
14598 and tag the note to it, since the register might actually
14599 be dead; so we recourse, and the recursive call then finds
14600 the previous insn that used this register. */
14603 {
14612 {
14615 }
14618 {
14619 /* Put only REG_DEAD notes for pieces that are
14620 not already dead or set. */
14624 {
14631 {
14633 NULL_RTX);
14637 NULL_RTX);
14638 }
14643 {
14645 {
14649 }
14653 {
14656 }
14657 }
14658 }
14661 }
14662 }
14663 }
14667 /* Any other notes should not be present at this point in the
14668 compilation. */
14670 }
14673 {
14677 /* Set added_notes_insn to the earliest insn we added a note to. */
14681 }
14684 {
14687 /* Set added_notes_insn to the earliest insn we added a note to. */
14691 }
14692 }
14693 }
14694 \f
14695 /* Similarly to above, distribute the LOG_LINKS that used to be present on
14696 I3, I2, and I1 to new locations. This is also called to add a link
14697 pointing at I3 when I3's destination is changed. */
14699 static void
14701 {
14705 {
14712 /* If the insn that this link points to is a NOTE, ignore it. */
14721 {
14724 {
14740 }
14743 }
14744 else
14757 /* A LOG_LINK is defined as being placed on the first insn that uses
14758 a register and points to the insn that sets the register. Start
14759 searching at the next insn after the target of the link and stop
14760 when we reach a set of the register or the end of the basic block.
14762 Note that this correctly handles the link that used to point from
14763 I3 to I2. Also note that not much searching is typically done here
14764 since most links don't point very far away. */
14773 {
14777 }
14780 {
14783 }
14787 /* If we found a place to put the link, place it there unless there
14788 is already a link to the same insn as LINK at that point. */
14791 {
14799 {
14803 /* Set added_links_insn to the earliest insn we added a
14804 link to. */
14808 }
14809 }
14810 }
14811 }
14812 \f
14813 /* Check for any register or memory mentioned in EQUIV that is not
14814 mentioned in EXPR. This is used to restrict EQUIV to "specializations"
14815 of EXPR where some registers may have been replaced by constants. */
14817 static bool
14819 {
14822 {
14827 }
14829 }
14830 \f
14831 DEBUG_FUNCTION void
14833 {
14834 fprintf
14836 ";; Combiner statistics: %d attempts, %d substitutions (%d requiring new space),\n;; %d successes.\n\n",
14838 }
14840 void
14842 {
14843 fprintf
14845 "\n;; Combiner totals: %d attempts, %d substitutions (%d requiring new space),\n;; %d successes.\n",
14847 }
14848 \f
14849 /* Make pseudo-to-pseudo copies after every hard-reg-to-pseudo-copy, because
14850 the reg-to-reg copy can usefully combine with later instructions, but we
14851 do not want to combine the hard reg into later instructions, for that
14852 restricts register allocation. */
14853 static void
14855 {
14856 basic_block bb;
14859 {
14863 {
14886 }
14887 }
14888 }
14890 /* Try combining insns through substitution. */
14891 static unsigned int
14893 {
14903 int rebuild_jump_labels_after_combine
14906 /* Combining insns may have turned an indirect jump into a
14907 direct jump. Rebuild the JUMP_LABEL fields of jumping
14908 instructions. */
14910 {
14917 }
14921 }
14926 {
14936 };
14939 {
14943 {}
14945 /* opt_pass methods: */
14948 {
14950 }
14956 rtl_opt_pass *
14958 {
14960 }