| blob | e78a71380374f7fdb93466c0fff17aad306f7a59 |
1 /* Optimize by combining instructions for GNU compiler.
2 Copyright (C) 1987-2017 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 LOG_LINKS does not have links for use of the CC0. They don't
37 need to, because the insn that sets the CC0 is always immediately
38 before the insn that tests it. So we always regard a branch
39 insn as having a logical link to the preceding insn. The same is true
40 for an insn explicitly using CC0.
42 We check (with modified_between_p) to avoid combining in such a way
43 as to move a computation to a place where its value would be different.
45 Combination is done by mathematically substituting the previous
46 insn(s) values for the regs they set into the expressions in
47 the later insns that refer to these regs. If the result is a valid insn
48 for our target machine, according to the machine description,
49 we install it, delete the earlier insns, and update the data flow
50 information (LOG_LINKS and REG_NOTES) for what we did.
52 There are a few exceptions where the dataflow information isn't
53 completely updated (however this is only a local issue since it is
54 regenerated before the next pass that uses it):
56 - reg_live_length is not updated
57 - reg_n_refs is not adjusted in the rare case when a register is
58 no longer required in a computation
59 - there are extremely rare cases (see distribute_notes) when a
60 REG_DEAD note is lost
61 - a LOG_LINKS entry that refers to an insn with multiple SETs may be
62 removed because there is no way to know which register it was
63 linking
65 To simplify substitution, we combine only when the earlier insn(s)
66 consist of only a single assignment. To simplify updating afterward,
67 we never combine when a subroutine call appears in the middle.
69 Since we do not represent assignments to CC0 explicitly except when that
70 is all an insn does, there is no LOG_LINKS entry in an insn that uses
71 the condition code for the insn that set the condition code.
72 Fortunately, these two insns must be consecutive.
73 Therefore, every JUMP_INSN is taken to have an implicit logical link
74 to the preceding insn. This is not quite right, since non-jumps can
75 also use the condition code; but in practice such insns would not
76 combine anyway. */
98 /* Include expr.h after insn-config.h so we get HAVE_conditional_move. */
108 /* Number of attempts to combine instructions in this function. */
112 /* Number of attempts that got as far as substitution in this function. */
116 /* Number of instructions combined with added SETs in this function. */
120 /* Number of instructions combined in this function. */
124 /* Totals over entire compilation. */
128 /* combine_instructions may try to replace the right hand side of the
129 second instruction with the value of an associated REG_EQUAL note
130 before throwing it at try_combine. That is problematic when there
131 is a REG_DEAD note for a register used in the old right hand side
132 and can cause distribute_notes to do wrong things. This is the
133 second instruction if it has been so modified, null otherwise. */
137 /* When I2MOD is nonnull, this is a copy of the old right hand side. */
141 /* When I2MOD is nonnull, this is a copy of the new right hand side. */
144 \f
146 /* Record last point of death of (hard or pseudo) register n. */
149 /* Record last point of modification of (hard or pseudo) register n. */
152 /* The next group of fields allows the recording of the last value assigned
153 to (hard or pseudo) register n. We use this information to see if an
154 operation being processed is redundant given a prior operation performed
155 on the register. For example, an `and' with a constant is redundant if
156 all the zero bits are already known to be turned off.
158 We use an approach similar to that used by cse, but change it in the
159 following ways:
161 (1) We do not want to reinitialize at each label.
162 (2) It is useful, but not critical, to know the actual value assigned
163 to a register. Often just its form is helpful.
165 Therefore, we maintain the following fields:
167 last_set_value the last value assigned
168 last_set_label records the value of label_tick when the
169 register was assigned
170 last_set_table_tick records the value of label_tick when a
171 value using the register is assigned
172 last_set_invalid set to nonzero when it is not valid
173 to use the value of this register in some
174 register's value
176 To understand the usage of these tables, it is important to understand
177 the distinction between the value in last_set_value being valid and
178 the register being validly contained in some other expression in the
179 table.
181 (The next two parameters are out of date).
183 reg_stat[i].last_set_value is valid if it is nonzero, and either
184 reg_n_sets[i] is 1 or reg_stat[i].last_set_label == label_tick.
186 Register I may validly appear in any expression returned for the value
187 of another register if reg_n_sets[i] is 1. It may also appear in the
188 value for register J if reg_stat[j].last_set_invalid is zero, or
189 reg_stat[i].last_set_label < reg_stat[j].last_set_label.
191 If an expression is found in the table containing a register which may
192 not validly appear in an expression, the register is replaced by
193 something that won't match, (clobber (const_int 0)). */
195 /* Record last value assigned to (hard or pseudo) register n. */
197 rtx last_set_value;
199 /* Record the value of label_tick when an expression involving register n
200 is placed in last_set_value. */
204 /* Record the value of label_tick when the value for register n is placed in
205 last_set_value. */
209 /* These fields are maintained in parallel with last_set_value and are
210 used to store the mode in which the register was last set, the bits
211 that were known to be zero when it was last set, and the number of
212 sign bits copies it was known to have when it was last set. */
218 /* Set nonzero if references to register n in expressions should not be
219 used. last_set_invalid is set nonzero when this register is being
220 assigned to and last_set_table_tick == label_tick. */
224 /* Some registers that are set more than once and used in more than one
225 basic block are nevertheless always set in similar ways. For example,
226 a QImode register may be loaded from memory in two places on a machine
227 where byte loads zero extend.
229 We record in the following fields if a register has some leading bits
230 that are always equal to the sign bit, and what we know about the
231 nonzero bits of a register, specifically which bits are known to be
232 zero.
234 If an entry is zero, it means that we don't know anything special. */
240 /* Record the value of the label_tick when the last truncation
241 happened. The field truncated_to_mode is only valid if
242 truncation_label == label_tick. */
246 /* Record the last truncation seen for this register. If truncation
247 is not a nop to this mode we might be able to save an explicit
248 truncation if we know that value already contains a truncated
249 value. */
252 };
257 /* One plus the highest pseudo for which we track REG_N_SETS.
258 regstat_init_n_sets_and_refs allocates the array for REG_N_SETS just once,
259 but during combine_split_insns new pseudos can be created. As we don't have
260 updated DF information in that case, it is hard to initialize the array
261 after growing. The combiner only cares about REG_N_SETS (regno) == 1,
262 so instead of growing the arrays, just assume all newly created pseudos
263 during combine might be set multiple times. */
267 /* Record the luid of the last insn that invalidated memory
268 (anything that writes memory, and subroutine calls, but not pushes). */
272 /* Record the luid of the last CALL_INSN
273 so we can tell whether a potential combination crosses any calls. */
277 /* When `subst' is called, this is the insn that is being modified
278 (by combining in a previous insn). The PATTERN of this insn
279 is still the old pattern partially modified and it should not be
280 looked at, but this may be used to examine the successors of the insn
281 to judge whether a simplification is valid. */
285 /* This is the lowest LUID that `subst' is currently dealing with.
286 get_last_value will not return a value if the register was set at or
287 after this LUID. If not for this mechanism, we could get confused if
288 I2 or I1 in try_combine were an insn that used the old value of a register
289 to obtain a new value. In that case, we might erroneously get the
290 new value of the register when we wanted the old one. */
294 /* This contains any hard registers that are used in newpat; reg_dead_at_p
295 must consider all these registers to be always live. */
299 /* This is an insn to which a LOG_LINKS entry has been added. If this
300 insn is the earlier than I2 or I3, combine should rescan starting at
301 that location. */
305 /* And similarly, for notes. */
309 /* Basic block in which we are performing combines. */
313 \f
314 /* Length of the currently allocated uid_insn_cost array. */
318 /* The following array records the insn_cost for every insn
319 in the instruction stream. */
323 /* The following array records the LOG_LINKS for every insn in the
324 instruction stream as struct insn_link pointers. */
330 };
336 {
340 }
342 #define INSN_COST(INSN) (uid_insn_cost[insn_uid_check (INSN)])
343 #define LOG_LINKS(INSN) (uid_log_links[insn_uid_check (INSN)])
345 #define FOR_EACH_LOG_LINK(L, INSN) \
346 for ((L) = LOG_LINKS (INSN); (L); (L) = (L)->next)
348 /* Links for LOG_LINKS are allocated from this obstack. */
352 /* Allocate a link. */
356 {
364 }
366 /* Incremented for each basic block. */
370 /* Reset to label_tick for each extended basic block in scanning order. */
374 /* Mode used to compute significance in reg_stat[].nonzero_bits. It is the
375 largest integer mode that can fit in HOST_BITS_PER_WIDE_INT. */
379 /* Nonzero when reg_stat[].nonzero_bits and reg_stat[].sign_bit_copies can
380 be safely used. It is zero while computing them and after combine has
381 completed. This former test prevents propagating values based on
382 previously set values, which can be incorrect if a variable is modified
383 in a loop. */
387 \f
388 /* Record one modification to rtl structure
389 to be undone by storing old_contents into *where. */
393 struct undo
394 {
399 };
401 /* Record a bunch of changes to be undone, up to MAX_UNDO of them.
402 num_undo says how many are currently recorded.
404 other_insn is nonzero if we have modified some other insn in the process
405 of working on subst_insn. It must be verified too. */
407 struct undobuf
408 {
412 };
416 /* Number of times the pseudo being substituted for
417 was found and replaced. */
422 scalar_int_mode,
425 scalar_int_mode,
497 \f
499 /* It is not safe to use ordinary gen_lowpart in combine.
500 See comments in gen_lowpart_for_combine. */
501 #undef RTL_HOOKS_GEN_LOWPART
502 #define RTL_HOOKS_GEN_LOWPART gen_lowpart_for_combine
504 /* Our implementation of gen_lowpart never emits a new pseudo. */
505 #undef RTL_HOOKS_GEN_LOWPART_NO_EMIT
506 #define RTL_HOOKS_GEN_LOWPART_NO_EMIT gen_lowpart_for_combine
508 #undef RTL_HOOKS_REG_NONZERO_REG_BITS
509 #define RTL_HOOKS_REG_NONZERO_REG_BITS reg_nonzero_bits_for_combine
511 #undef RTL_HOOKS_REG_NUM_SIGN_BIT_COPIES
512 #define RTL_HOOKS_REG_NUM_SIGN_BIT_COPIES reg_num_sign_bit_copies_for_combine
514 #undef RTL_HOOKS_REG_TRUNCATED_TO_MODE
515 #define RTL_HOOKS_REG_TRUNCATED_TO_MODE reg_truncated_to_mode
519 \f
520 /* Convenience wrapper for the canonicalize_comparison target hook.
521 Target hooks cannot use enum rtx_code. */
525 {
529 }
531 /* Try to split PATTERN found in INSN. This returns NULL_RTX if
532 PATTERN can not be split. Otherwise, it returns an insn sequence.
533 This is a wrapper around split_insns which ensures that the
534 reg_stat vector is made larger if the splitter creates a new
535 register. */
539 {
548 }
550 /* This is used by find_single_use to locate an rtx in LOC that
551 contains exactly one use of DEST, which is typically either a REG
552 or CC0. It returns a pointer to the innermost rtx expression
553 containing DEST. Appearances of DEST that are being used to
554 totally replace it are not counted. */
558 {
567 {
571 CASE_CONST_ANY:
576 /* If the destination is anything other than CC0, PC, a REG or a SUBREG
577 of a REG that occupies all of the REG, the insn uses DEST if
578 it is mentioned in the destination or the source. Otherwise, we
579 need just check the source. */
596 }
598 /* If it wasn't one of the common cases above, check each expression and
599 vector of this code. Look for a unique usage of DEST. */
603 {
605 {
610 else
616 /* Duplicate usage. */
618 }
620 {
624 {
630 else
637 }
638 }
639 }
642 }
645 /* See if DEST, produced in INSN, is used only a single time in the
646 sequel. If so, return a pointer to the innermost rtx expression in which
647 it is used.
649 If PLOC is nonzero, *PLOC is set to the insn containing the single use.
651 If DEST is cc0_rtx, we look only at the next insn. In that case, we don't
652 care about REG_DEAD notes or LOG_LINKS.
654 Otherwise, we find the single use by finding an insn that has a
655 LOG_LINKS pointing at INSN and has a REG_DEAD note for DEST. If DEST is
656 only referenced once in that insn, we know that it must be the first
657 and last insn referencing DEST. */
661 {
662 basic_block bb;
668 {
678 }
688 {
694 {
699 }
700 }
703 }
704 \f
705 /* Substitute NEWVAL, an rtx expression, into INTO, a place in some
706 insn. The substitution can be undone by undo_all. If INTO is already
707 set to NEWVAL, do not record this change. Because computing NEWVAL might
708 also call SUBST, we have to compute it before we put anything into
709 the undo table. */
711 static void
713 {
720 /* We'd like to catch as many invalid transformations here as
721 possible. Unfortunately, there are way too many mode changes
722 that are perfectly valid, so we'd waste too much effort for
723 little gain doing the checks here. Focus on catching invalid
724 transformations involving integer constants. */
727 {
728 /* Sanity check that we're replacing oldval with a CONST_INT
729 that is a valid sign-extension for the original mode. */
733 /* Replacing the operand of a SUBREG or a ZERO_EXTEND with a
734 CONST_INT is not valid, because after the replacement, the
735 original mode would be gone. Unfortunately, we can't tell
736 when do_SUBST is called to replace the operand thereof, so we
737 perform this test on oldval instead, checking whether an
738 invalid replacement took place before we got here. */
743 }
747 else
756 }
758 #define SUBST(INTO, NEWVAL) do_SUBST (&(INTO), (NEWVAL))
760 /* Similar to SUBST, but NEWVAL is an int expression. Note that substitution
761 for the value of a HOST_WIDE_INT value (including CONST_INT) is
762 not safe. */
764 static void
766 {
775 else
784 }
786 #define SUBST_INT(INTO, NEWVAL) do_SUBST_INT (&(INTO), (NEWVAL))
788 /* Similar to SUBST, but just substitute the mode. This is used when
789 changing the mode of a pseudo-register, so that any other
790 references to the entry in the regno_reg_rtx array will change as
791 well. */
793 static void
795 {
804 else
813 }
815 #define SUBST_MODE(INTO, NEWVAL) do_SUBST_MODE (&(INTO), (NEWVAL))
817 /* Similar to SUBST, but NEWVAL is a LOG_LINKS expression. */
819 static void
821 {
830 else
839 }
841 #define SUBST_LINK(oldval, newval) do_SUBST_LINK (&oldval, newval)
842 \f
843 /* Subroutine of try_combine. Determine whether the replacement patterns
844 NEWPAT, NEWI2PAT and NEWOTHERPAT are cheaper according to insn_cost
845 than the original sequence I0, I1, I2, I3 and undobuf.other_insn. Note
846 that I0, I1 and/or NEWI2PAT may be NULL_RTX. Similarly, NEWOTHERPAT and
847 undobuf.other_insn may also both be NULL_RTX. Return false if the cost
848 of all the instructions can be estimated and the replacements are more
849 expensive than the original sequence. */
851 static bool
854 {
859 /* Lookup the original insn_costs. */
864 {
867 {
871 }
872 else
873 {
877 }
878 }
879 else
880 {
883 }
885 /* If we have split a PARALLEL I2 to I1,I2, we have counted its cost twice;
886 correct that. */
891 /* Calculate the replacement insn_costs. */
900 {
910 }
911 else
912 {
915 }
918 {
927 optimize_this_for_speed_p);
931 {
934 }
935 else
937 }
939 /* Disallow this combination if both new_cost and old_cost are greater than
940 zero, and new_cost is greater than old cost. */
944 {
963 else
965 }
970 /* Update the uid_insn_cost array with the replacement costs. */
974 {
978 }
981 }
984 /* Delete any insns that copy a register to itself. */
986 static void
988 {
990 basic_block bb;
993 {
995 {
998 {
1003 }
1004 }
1005 }
1006 }
1008 \f
1009 /* Return false if we do not want to (or cannot) combine DEF. */
1010 static bool
1012 {
1013 /* Do not consider if it is pre/post modification in MEM. */
1019 /* Do not combine frame pointer adjustments. */
1022 || (!HARD_FRAME_POINTER_IS_FRAME_POINTER
1030 }
1032 /* Return false if we do not want to (or cannot) combine USE. */
1033 static bool
1035 {
1036 /* Do not consider the usage of the stack pointer by function call. */
1041 }
1043 /* Fill in log links field for all insns. */
1045 static void
1047 {
1048 basic_block bb;
1055 /* Pass through each block from the end, recording the uses of each
1056 register and establishing log links when def is encountered.
1057 Note that we do not clear next_use array in order to save time,
1058 so we have to test whether the use is in the same basic block as def.
1060 There are a few cases below when we do not consider the definition or
1061 usage -- these are taken from original flow.c did. Don't ask me why it is
1062 done this way; I don't know and if it works, I don't want to know. */
1065 {
1067 {
1071 /* Log links are created only once. */
1075 {
1091 /* flow.c claimed:
1093 We don't build a LOG_LINK for hard registers contained
1094 in ASM_OPERANDs. If these registers get replaced,
1095 we might wind up changing the semantics of the insn,
1096 even if reload can make what appear to be valid
1097 assignments later. */
1102 /* Don't add duplicate links between instructions. */
1111 }
1116 }
1117 }
1120 }
1122 /* Walk the LOG_LINKS of insn B to see if we find a reference to A. Return
1123 true if we found a LOG_LINK that proves that A feeds B. This only works
1124 if there are no instructions between A and B which could have a link
1125 depending on A, since in that case we would not record a link for B.
1126 We also check the implicit dependency created by a cc0 setter/user
1127 pair. */
1129 static bool
1131 {
1139 }
1140 \f
1141 /* Main entry point for combiner. F is the first insn of the function.
1142 NREGS is the first unused pseudo-reg number.
1144 Return nonzero if the combiner has turned an indirect jump
1145 instruction into a direct jump. */
1146 static int
1148 {
1153 basic_block last_bb;
1173 /* Allocate array for insn info. */
1181 /* Don't use reg_stat[].nonzero_bits when computing it. This can cause
1182 problems when, for example, we have j <<= 1 in a loop. */
1187 /* Scan all SETs and see if we can deduce anything about what
1188 bits are known to be zero for some registers and how many copies
1189 of the sign bit are known to exist for those registers.
1191 Also set any known values so that we can use it while searching
1192 for what bits are known to be set. */
1195 /* Allow the entry block and the first block to fall into the same EBB.
1196 Conceptually the incoming promotions are assigned to the entry block. */
1201 {
1206 label_tick++;
1214 {
1215 rtx links;
1221 insn);
1228 insn);
1230 /* Record the current insn_cost of this instruction. */
1234 {
1237 }
1238 }
1239 }
1243 /* Now scan all the insns in forward order. */
1251 {
1254 /* Ignore instruction combination in basic blocks that are going to
1255 be removed as unreachable anyway. See PR82386. */
1263 label_tick++;
1273 {
1287 /* See if we know about function return values before this
1288 insn based upon SUBREG flags. */
1291 /* See if we can find hardregs and subreg of pseudos in
1292 narrower modes. This could help turning TRUNCATEs
1293 into SUBREGs. */
1296 /* Try this insn with each insn it links back to. */
1302 {
1305 }
1307 /* Try each sequence of three linked insns ending with this one. */
1311 {
1314 /* If the linked insn has been replaced by a note, then there
1315 is no point in pursuing this chain any further. */
1323 {
1326 }
1327 }
1329 /* Try to combine a jump insn that uses CC0
1330 with a preceding insn that sets CC0, and maybe with its
1331 logical predecessor as well.
1332 This is how we make decrement-and-branch insns.
1333 We need this special code because data flow connections
1334 via CC0 do not get entered in LOG_LINKS. */
1341 {
1352 }
1354 /* Do the same for an insn that explicitly references CC0. */
1361 {
1372 }
1374 /* Finally, see if any of the insns that this insn links to
1375 explicitly references CC0. If so, try this insn, that insn,
1376 and its predecessor if it sets CC0. */
1378 {
1390 }
1392 /* Try combining an insn with two different insns whose results it
1393 uses. */
1403 {
1406 }
1408 /* Try four-instruction combinations. */
1411 {
1415 /* If the linked insn has been replaced by a note, then there
1416 is no point in pursuing this chain any further. */
1421 {
1425 /* I0 -> I1 -> I2 -> I3. */
1431 {
1434 }
1435 /* I0, I1 -> I2, I2 -> I3. */
1442 {
1445 }
1446 }
1449 {
1453 /* I0 -> I2; I1, I2 -> I3. */
1459 {
1462 }
1463 /* I0 -> I1; I1, I2 -> I3. */
1469 {
1472 }
1473 }
1474 }
1476 /* Try this insn with each REG_EQUAL note it links back to. */
1478 {
1484 /* Avoid using a register that may already been marked
1485 dead by an earlier instruction. */
1493 {
1494 /* Temporarily replace the set's source with the
1495 contents of the REG_EQUAL note. The insn will
1496 be deleted or recognized by try_combine. */
1507 last_combined_insn);
1510 {
1513 }
1516 }
1517 }
1522 retry:
1523 ;
1524 }
1525 }
1532 /* Clean up. */
1538 {
1541 {
1544 }
1546 }
1556 /* Make recognizer allow volatile MEMs again. */
1560 }
1562 /* Wipe the last_xxx fields of reg_stat in preparation for another pass. */
1564 static void
1566 {
1572 }
1573 \f
1574 /* Set up any promoted values for incoming argument registers. */
1576 static void
1578 {
1579 tree arg;
1584 {
1589 /* Only continue if the incoming argument is in a register. */
1593 /* Determine, if possible, whether all call sites of the current
1594 function lie within the current compilation unit. (This does
1595 take into account the exporting of a function via taking its
1596 address, and so forth.) */
1599 /* The mode and signedness of the argument before any promotions happen
1600 (equal to the mode of the pseudo holding it at that stage). */
1604 /* The mode and signedness of the argument after any source language and
1605 TARGET_PROMOTE_PROTOTYPES-driven promotions. */
1609 /* The mode and signedness of the argument as it is actually passed,
1610 see assign_parm_setup_reg in function.c. */
1614 /* The mode of the register in which the argument is being passed. */
1617 /* Eliminate sign extensions in the callee when:
1618 (a) A mode promotion has occurred; */
1621 /* (b) The mode of the register is the same as the mode of
1622 the argument as it is passed; */
1625 /* (c) There's no language level extension; */
1627 ;
1628 /* (c.1) All callers are from the current compilation unit. If that's
1629 the case we don't have to rely on an ABI, we only have to know
1630 what we're generating right now, and we know that we will do the
1631 mode1 to mode2 promotion with the given sign. */
1634 /* (c.2) The combination of the two promotions is useful. This is
1635 true when the signs match, or if the first promotion is unsigned.
1636 In the later case, (sign_extend (zero_extend x)) is the same as
1637 (zero_extend (zero_extend x)), so make sure to force UNS3 true. */
1643 /* Record that the value was promoted from mode1 to mode3,
1644 so that any sign extension at the head of the current
1645 function may be eliminated. */
1649 }
1650 }
1652 /* If MODE has a precision lower than PREC and SRC is a non-negative constant
1653 that would appear negative in MODE, sign-extend SRC for use in nonzero_bits
1654 because some machines (maybe most) will actually do the sign-extension and
1655 this is the conservative approach.
1657 ??? For 2.5, try to tighten up the MD files in this regard instead of this
1658 kludge. */
1660 static rtx
1662 {
1663 scalar_int_mode int_mode;
1672 }
1674 /* Update RSP for pseudo-register X from INSN's REG_EQUAL note (if one exists)
1675 and SET. */
1677 static void
1679 rtx x)
1680 {
1690 {
1694 }
1696 /* Don't call nonzero_bits if it cannot change anything. */
1698 {
1703 }
1705 /* Don't call num_sign_bit_copies if it cannot change anything. */
1707 {
1710 {
1714 }
1717 }
1718 }
1720 /* Called via note_stores. If X is a pseudo that is narrower than
1721 HOST_BITS_PER_WIDE_INT and is being set, record what bits are known zero.
1723 If we are setting only a portion of X and we can't figure out what
1724 portion, assume all bits will be used since we don't know what will
1725 be happening.
1727 Similarly, set how many bits of X are known to be copies of the sign bit
1728 at all locations in the function. This is the smallest number implied
1729 by any set of X. */
1731 static void
1733 {
1735 scalar_int_mode mode;
1739 /* If this register is undefined at the start of the file, we can't
1740 say what its contents were. */
1741 && ! REGNO_REG_SET_P
1745 {
1749 {
1753 }
1755 /* If this register is being initialized using itself, and the
1756 register is uninitialized in this basic block, and there are
1757 no LOG_LINKS which set the register, then part of the
1758 register is uninitialized. In that case we can't assume
1759 anything about the number of nonzero bits.
1761 ??? We could do better if we checked this in
1762 reg_{nonzero_bits,num_sign_bit_copies}_for_combine. Then we
1763 could avoid making assumptions about the insn which initially
1764 sets the register, while still using the information in other
1765 insns. We would have to be careful to check every insn
1766 involved in the combination. */
1772 {
1779 {
1783 }
1784 }
1786 /* If this is a complex assignment, see if we can convert it into a
1787 simple assignment. */
1790 /* If this is a simple assignment, or we have a paradoxical SUBREG,
1791 set what we know about X. */
1797 else
1798 {
1801 }
1802 }
1803 }
1804 \f
1805 /* See if INSN can be combined into I3. PRED, PRED2, SUCC and SUCC2 are
1806 optionally insns that were previously combined into I3 or that will be
1807 combined into the merger of INSN and I3. The order is PRED, PRED2,
1808 INSN, SUCC, SUCC2, I3.
1810 Return 0 if the combination is not allowed for any reason.
1812 If the combination is allowed, *PDEST will be set to the single
1813 destination of INSN and *PSRC to the single source, and this function
1814 will return 1. */
1816 static int
1820 {
1825 rtx link;
1830 {
1832 {
1837 }
1842 }
1846 /* Can combine only if previous insn is a SET of a REG, a SUBREG or CC0.
1847 or a PARALLEL consisting of such a SET and CLOBBERs.
1849 If INSN has CLOBBER parallel parts, ignore them for our processing.
1850 By definition, these happen during the execution of the insn. When it
1851 is merged with another insn, all bets are off. If they are, in fact,
1852 needed and aren't also supplied in I3, they may be added by
1853 recog_for_combine. Otherwise, it won't match.
1855 We can also ignore a SET whose SET_DEST is mentioned in a REG_UNUSED
1856 note.
1858 Get the source and destination of INSN. If more than one, can't
1859 combine. */
1865 {
1867 {
1871 {
1872 /* This is important to combine floating point insns
1873 for the SH4 port. */
1875 /* Combining an isolated USE doesn't make sense.
1876 We depend here on combinable_i3pat to reject them. */
1877 /* The code below this loop only verifies that the inputs of
1878 the SET in INSN do not change. We call reg_set_between_p
1879 to verify that the REG in the USE does not change between
1880 I3 and INSN.
1881 If the USE in INSN was for a pseudo register, the matching
1882 insn pattern will likely match any register; combining this
1883 with any other USE would only be safe if we knew that the
1884 used registers have identical values, or if there was
1885 something to tell them apart, e.g. different modes. For
1886 now, we forgo such complicated tests and simply disallow
1887 combining of USES of pseudo registers with any other USE. */
1890 {
1895 do
1896 {
1906 }
1908 }
1911 /* We can ignore CLOBBERs. */
1916 /* Ignore SETs whose result isn't used but not those that
1917 have side-effects. */
1923 /* If we have already found a SET, this is a second one and
1924 so we cannot combine with this insn. */
1932 /* Anything else means we can't combine. */
1934 }
1935 }
1938 /* If SET_SRC is an ASM_OPERANDS we can't throw away these CLOBBERs,
1939 so don't do anything with it. */
1942 }
1943 else
1949 /* The simplification in expand_field_assignment may call back to
1950 get_last_value, so set safe guard here. */
1956 /* Do not eliminate user-specified register if it is in an
1957 asm input because we may break the register asm usage defined
1958 in GCC manual if allow to do so.
1959 Be aware that this may cover more cases than we expect but this
1960 should be harmless. */
1965 /* Don't eliminate a store in the stack pointer. */
1967 /* Don't combine with an insn that sets a register to itself if it has
1968 a REG_EQUAL note. This may be part of a LIBCALL sequence. */
1970 /* Can't merge an ASM_OPERANDS. */
1972 /* Can't merge a function call. */
1974 /* Don't eliminate a function call argument. */
1980 /* Don't substitute into an incremented register. */
1984 /* Don't substitute into a non-local goto, this confuses CFG. */
1986 /* Make sure that DEST is not used after INSN but before SUCC, or
1987 after SUCC and before SUCC2, or after SUCC2 but before I3. */
1988 || (!all_adjacent
1989 && ((succ2
1993 || (succ
1994 /* SUCC and SUCC2 can be split halves from a PARALLEL; in
1995 that case SUCC is not in the insn stream, so use SUCC2
1996 instead for this test. */
1998 succ2
2001 /* Make sure that the value that is to be substituted for the register
2002 does not use any registers whose values alter in between. However,
2003 If the insns are adjacent, a use can't cross a set even though we
2004 think it might (this can happen for a sequence of insns each setting
2005 the same destination; last_set of that register might point to
2006 a NOTE). If INSN has a REG_EQUIV note, the register is always
2007 equivalent to the memory so the substitution is valid even if there
2008 are intervening stores. Also, don't move a volatile asm or
2009 UNSPEC_VOLATILE across any other insns. */
2010 || (! all_adjacent
2016 /* Don't combine across a CALL_INSN, because that would possibly
2017 change whether the life span of some REGs crosses calls or not,
2018 and it is a pain to update that information.
2019 Exception: if source is a constant, moving it later can't hurt.
2020 Accept that as a special case. */
2024 /* DEST must either be a REG or CC0. */
2026 {
2027 /* If register alignment is being enforced for multi-word items in all
2028 cases except for parameters, it is possible to have a register copy
2029 insn referencing a hard register that is not allowed to contain the
2030 mode being copied and which would not be valid as an operand of most
2031 insns. Eliminate this problem by not combining with such an insn.
2033 Also, on some machines we don't want to extend the life of a hard
2034 register. */
2039 /* Don't extend the life of a hard register unless it is
2040 user variable (if we have few registers) or it can't
2041 fit into the desired register (meaning something special
2042 is going on).
2043 Also avoid substituting a return register into I3, because
2044 reload can't handle a conflict with constraints of other
2045 inputs. */
2050 }
2058 {
2061 /* If the clobber represents an earlyclobber operand, we must not
2062 substitute an expression containing the clobbered register.
2063 As we do not analyze the constraint strings here, we have to
2064 make the conservative assumption. However, if the register is
2065 a fixed hard reg, the clobber cannot represent any operand;
2066 we leave it up to the machine description to either accept or
2067 reject use-and-clobber patterns. */
2073 }
2075 /* If INSN contains anything volatile, or is an `asm' (whether volatile
2076 or not), reject, unless nothing volatile comes between it and I3 */
2079 {
2080 /* Make sure neither succ nor succ2 contains a volatile reference. */
2085 /* We'll check insns between INSN and I3 below. */
2086 }
2088 /* If INSN is an asm, and DEST is a hard register, reject, since it has
2089 to be an explicit register variable, and was chosen for a reason. */
2095 /* If INSN contains volatile references (specifically volatile MEMs),
2096 we cannot combine across any other volatile references.
2097 Even if INSN doesn't contain volatile references, any intervening
2098 volatile insn might affect machine state. */
2101 ? volatile_refs_p
2108 /* If INSN contains an autoincrement or autodecrement, make sure that
2109 register is not used between there and I3, and not already used in
2110 I3 either. Neither must it be used in PRED or SUCC, if they exist.
2111 Also insist that I3 not be a jump; if it were one
2112 and the incremented register were spilled, we would lose. */
2130 /* Don't combine an insn that follows a CC0-setting insn.
2131 An insn that uses CC0 must not be separated from the one that sets it.
2132 We do, however, allow I2 to follow a CC0-setting insn if that insn
2133 is passed as I1; in that case it will be deleted also.
2134 We also allow combining in this case if all the insns are adjacent
2135 because that would leave the two CC0 insns adjacent as well.
2136 It would be more logical to test whether CC0 occurs inside I1 or I2,
2137 but that would be much slower, and this ought to be equivalent. */
2140 {
2145 }
2147 /* If we get here, we have passed all the tests and the combination is
2148 to be allowed. */
2154 }
2155 \f
2156 /* LOC is the location within I3 that contains its pattern or the component
2157 of a PARALLEL of the pattern. We validate that it is valid for combining.
2159 One problem is if I3 modifies its output, as opposed to replacing it
2160 entirely, we can't allow the output to contain I2DEST, I1DEST or I0DEST as
2161 doing so would produce an insn that is not equivalent to the original insns.
2163 Consider:
2165 (set (reg:DI 101) (reg:DI 100))
2166 (set (subreg:SI (reg:DI 101) 0) <foo>)
2168 This is NOT equivalent to:
2170 (parallel [(set (subreg:SI (reg:DI 100) 0) <foo>)
2171 (set (reg:DI 101) (reg:DI 100))])
2173 Not only does this modify 100 (in which case it might still be valid
2174 if 100 were dead in I2), it sets 101 to the ORIGINAL value of 100.
2176 We can also run into a problem if I2 sets a register that I1
2177 uses and I1 gets directly substituted into I3 (not via I2). In that
2178 case, we would be getting the wrong value of I2DEST into I3, so we
2179 must reject the combination. This case occurs when I2 and I1 both
2180 feed into I3, rather than when I1 feeds into I2, which feeds into I3.
2181 If I1_NOT_IN_SRC is nonzero, it means that finding I1 in the source
2182 of a SET must prevent combination from occurring. The same situation
2183 can occur for I0, in which case I0_NOT_IN_SRC is set.
2185 Before doing the above check, we first try to expand a field assignment
2186 into a set of logical operations.
2188 If PI3_DEST_KILLED is nonzero, it is a pointer to a location in which
2189 we place a register that is both set and used within I3. If more than one
2190 such register is detected, we fail.
2192 Return 1 if the combination is valid, zero otherwise. */
2194 static int
2197 {
2201 {
2206 rtx subdest;
2213 /* Check for the case where I3 modifies its output, as discussed
2214 above. We don't want to prevent pseudos from being combined
2215 into the address of a MEM, so only prevent the combination if
2216 i1 or i2 set the same MEM. */
2226 /* This is the same test done in can_combine_p except we can't test
2227 all_adjacent; we don't have to, since this instruction will stay
2228 in place, thus we are not considering increasing the lifetime of
2229 INNER_DEST.
2231 Also, if this insn sets a function argument, combining it with
2232 something that might need a spill could clobber a previous
2233 function argument; the all_adjacent test in can_combine_p also
2234 checks this; here, we do a more specific test for this case. */
2244 /* If DEST is used in I3, it is being killed in this insn, so
2245 record that for later. We have to consider paradoxical
2246 subregs here, since they kill the whole register, but we
2247 ignore partial subregs, STRICT_LOW_PART, etc.
2248 Never add REG_DEAD notes for the FRAME_POINTER_REGNUM or the
2249 STACK_POINTER_REGNUM, since these are always considered to be
2250 live. Similarly for ARG_POINTER_REGNUM if it is fixed. */
2258 && (HARD_FRAME_POINTER_IS_FRAME_POINTER
2264 {
2269 }
2270 }
2273 {
2280 }
2283 }
2284 \f
2285 /* Return 1 if X is an arithmetic expression that contains a multiplication
2286 and division. We don't count multiplications by powers of two here. */
2288 static int
2290 {
2292 {
2308 }
2309 }
2310 \f
2311 /* Determine whether INSN can be used in a combination. Return nonzero if
2312 not. This is used in try_combine to detect early some cases where we
2313 can't perform combinations. */
2315 static int
2317 {
2318 rtx set;
2321 /* If this isn't really an insn, we can't do anything.
2322 This can occur when flow deletes an insn that it has merged into an
2323 auto-increment address. */
2327 /* Never combine loads and stores involving hard regs that are likely
2328 to be spilled. The register allocator can usually handle such
2329 reg-reg moves by tying. If we allow the combiner to make
2330 substitutions of likely-spilled regs, reload might die.
2331 As an exception, we allow combinations involving fixed regs; these are
2332 not available to the register allocator so there's no risk involved. */
2353 }
2355 struct likely_spilled_retval_info
2356 {
2359 };
2361 /* Called via note_stores by likely_spilled_retval_p. Remove from info->mask
2362 hard registers that are known to be written to / clobbered in full. */
2363 static void
2365 {
2382 else
2385 }
2387 /* Return nonzero iff part of the return value is live during INSN, and
2388 it is likely spilled. This can happen when more than one insn is needed
2389 to copy the return value, e.g. when we consider to combine into the
2390 second copy insn for a complex value. */
2392 static int
2394 {
2396 rtx reg;
2399 /* We assume here that no machine mode needs more than
2400 32 hard registers when the value overlaps with a register
2401 for which TARGET_FUNCTION_VALUE_REGNO_P is true. */
2416 /* Disregard parts of the return value that are set later. */
2425 /* Check if any of the (probably) live return value registers is
2426 likely spilled. */
2427 nregs --;
2428 do
2429 {
2435 }
2437 /* Adjust INSN after we made a change to its destination.
2439 Changing the destination can invalidate notes that say something about
2440 the results of the insn and a LOG_LINK pointing to the insn. */
2442 static void
2444 {
2445 /* For notes, be conservative and simply remove them. */
2448 /* The new insn will have a destination that was previously the destination
2449 of an insn just above it. Call distribute_links to make a LOG_LINK from
2450 the next use of that destination. */
2466 }
2468 /* Return TRUE if combine can reuse reg X in mode MODE.
2469 ADDED_SETS is nonzero if the original set is still required. */
2470 static bool
2472 {
2478 /* Don't change between modes with different underlying register sizes,
2479 since this could lead to invalid subregs. */
2485 /* Allow hard registers if the new mode is legal, and occupies no more
2486 registers than the old mode. */
2491 /* Or a pseudo that is only used once. */
2494 && !added_sets
2496 }
2499 /* Check whether X, the destination of a set, refers to part of
2500 the register specified by REG. */
2502 static bool
2504 {
2505 /* Check that reg is an integer mode register. */
2516 }
2518 /* Delete the unconditional jump INSN and adjust the CFG correspondingly.
2519 Note that the INSN should be deleted *after* removing dead edges, so
2520 that the kept edge is the fallthrough edge for a (set (pc) (pc))
2521 but not for a (set (pc) (label_ref FOO)). */
2523 static void
2525 {
2533 {
2538 /* Remove barriers from the footer if there are any. */
2541 {
2544 else
2548 }
2551 }
2552 }
2554 /* Return whether PAT is a PARALLEL of exactly N register SETs followed
2555 by an arbitrary number of CLOBBERs. */
2556 static bool
2558 {
2577 }
2579 /* Return whether INSN, a PARALLEL of N register SETs (and maybe some
2580 CLOBBERs), can be split into individual SETs in that order, without
2581 changing semantics. */
2582 static bool
2584 {
2592 {
2601 }
2604 }
2606 /* Try to combine the insns I0, I1 and I2 into I3.
2607 Here I0, I1 and I2 appear earlier than I3.
2608 I0 and I1 can be zero; then we combine just I2 into I3, or I1 and I2 into
2609 I3.
2611 If we are combining more than two insns and the resulting insn is not
2612 recognized, try splitting it into two insns. If that happens, I2 and I3
2613 are retained and I1/I0 are pseudo-deleted by turning them into a NOTE.
2614 Otherwise, I0, I1 and I2 are pseudo-deleted.
2616 Return 0 if the combination does not work. Then nothing is changed.
2617 If we did the combination, return the insn at which combine should
2618 resume scanning.
2620 Set NEW_DIRECT_JUMP_P to a nonzero value if try_combine creates a
2621 new direct jump instruction.
2623 LAST_COMBINED_INSN is either I3, or some insn after I3 that has
2624 been I3 passed to an earlier try_combine within the same basic
2625 block. */
2630 {
2631 /* New patterns for I3 and I2, respectively. */
2635 /* Indicates need to preserve SET in I0, I1 or I2 in I3 if it is not
2636 dead. */
2638 /* Total number of SETs to put into I3. */
2640 /* Nonzero if I2's or I1's body now appears in I3. */
2642 /* INSN_CODEs for new I3, new I2, and user of condition code. */
2644 /* Contains I3 if the destination of I3 is used in its source, which means
2645 that the old life of I3 is being killed. If that usage is placed into
2646 I2 and not in I3, a REG_DEAD note must be made. */
2648 /* SET_DEST and SET_SRC of I2, I1 and I0. */
2650 /* Copy of SET_SRC of I1 and I0, if needed. */
2652 /* Set if I2DEST was reused as a scratch register. */
2654 /* The PATTERNs of I0, I1, and I2, or a copy of them in certain cases. */
2656 /* Indicates if I2DEST or I1DEST is in I2SRC or I1_SRC. */
2661 /* Notes that must be added to REG_NOTES in I3 and I2. */
2663 /* Notes that we substituted I3 into I2 instead of the normal case. */
2665 /* Notes that I1, I2 or I3 is a MULT operation. */
2672 rtx temp_expr;
2675 rtx new_other_notes;
2679 /* Immediately return if any of I0,I1,I2 are the same insn (I3 can
2680 never be). */
2684 /* Only try four-insn combinations when there's high likelihood of
2685 success. Look for simple insns, such as loads of constants or
2686 binary operations involving a constant. */
2688 {
2698 {
2701 rtx src;
2706 {
2709 }
2711 ngood++;
2714 nshift++;
2715 }
2717 /* If I0 loads a memory and I3 sets the same memory, then I1 and I2
2718 are likely manipulating its value. Ideally we'll be able to combine
2719 all four insns into a bitfield insertion of some kind.
2721 Note the source in I0 might be inside a sign/zero extension and the
2722 memory modes in I0 and I3 might be different. So extract the address
2723 from the destination of I3 and search for it in the source of I0.
2725 In the event that there's a match but the source/dest do not actually
2726 refer to the same memory, the worst that happens is we try some
2727 combinations that we wouldn't have otherwise. */
2729 /* Ensure the source of SET0 is a MEM, possibly buried inside
2730 an extension. */
2736 /* Ensure the destination of SET3 is a MEM. */
2738 /* Would it be better to extract the base address for the MEM
2739 in SET3 and look for that? I don't have cases where it matters
2740 but I could envision such cases. */
2746 }
2748 /* Exit early if one of the insns involved can't be used for
2749 combinations. */
2760 combine_attempts++;
2763 /* Reset the hard register usage information. */
2767 {
2774 else
2784 }
2786 /* If multiple insns feed into one of I2 or I3, they can be in any
2787 order. To simplify the code below, reorder them in sequence. */
2798 /* First check for one important special case that the code below will
2799 not handle. Namely, the case where I1 is zero, I2 is a PARALLEL
2800 and I3 is a SET whose SET_SRC is a SET_DEST in I2. In that case,
2801 we may be able to replace that destination with the destination of I3.
2802 This occurs in the common code where we compute both a quotient and
2803 remainder into a structure, in which case we want to do the computation
2804 directly into the structure to avoid register-register copies.
2806 Note that this case handles both multiple sets in I2 and also cases
2807 where I2 has a number of CLOBBERs inside the PARALLEL.
2809 We make very conservative checks below and only try to handle the
2810 most common cases of this. For example, we only handle the case
2811 where I2 and I3 are adjacent to avoid making difficult register
2812 usage tests. */
2820 /* If the dest of I3 is a ZERO_EXTRACT or STRICT_LOW_PART, the code
2821 below would need to check what is inside (and reg_overlap_mentioned_p
2822 doesn't support those codes anyway). Don't allow those destinations;
2823 the resulting insn isn't likely to be recognized anyway. */
2829 {
2832 /* Make sure that the destination of I3,
2833 which we are going to substitute into one output of I2,
2834 is not used within another output of I2. We must avoid making this:
2835 (parallel [(set (mem (reg 69)) ...)
2836 (set (reg 69) ...)])
2837 which is not well-defined as to order of actions.
2838 (Besides, reload can't handle output reloads for this.)
2840 The problem can also happen if the dest of I3 is a memory ref,
2841 if another dest in I2 is an indirect memory ref.
2843 Neither can this PARALLEL be an asm. We do not allow combining
2844 that usually (see can_combine_p), so do not here either. */
2847 {
2856 }
2862 {
2863 combine_merges++;
2873 /* Replace the dest in I2 with our dest and make the resulting
2874 insn the new pattern for I3. Then skip to where we validate
2875 the pattern. Everything was set up above. */
2880 }
2881 }
2883 /* If I2 is setting a pseudo to a constant and I3 is setting some
2884 sub-part of it to another constant, merge them by making a new
2885 constant. */
2893 {
2900 {
2905 {
2911 }
2912 }
2913 else
2914 {
2918 {
2921 }
2922 }
2925 {
2926 /* If this is the low part, we're done. */
2928 ;
2929 /* Handle the case where inner is twice the size of outer. */
2933 /* Otherwise give up for now. */
2934 else
2936 }
2939 {
2947 combine_merges++;
2954 /* Replace the source in I2 with the new constant and make the
2955 resulting insn the new pattern for I3. Then skip to where we
2956 validate the pattern. Everything was set up above. */
2962 /* The dest of I3 has been replaced with the dest of I2. */
2965 }
2966 }
2968 /* If we have no I1 and I2 looks like:
2969 (parallel [(set (reg:CC X) (compare:CC OP (const_int 0)))
2970 (set Y OP)])
2971 make up a dummy I1 that is
2972 (set Y OP)
2973 and change I2 to be
2974 (set (reg:CC X) (compare:CC Y (const_int 0)))
2976 (We can ignore any trailing CLOBBERs.)
2978 This undoes a previous combination and allows us to match a branch-and-
2979 decrement insn. */
2991 {
2992 /* We make I1 with the same INSN_UID as I2. This gives it
2993 the same DF_INSN_LUID for value tracking. Our fake I1 will
2994 never appear in the insn stream so giving it the same INSN_UID
2995 as I2 will not cause a problem. */
3008 }
3010 /* If I2 is a PARALLEL of two SETs of REGs (and perhaps some CLOBBERs),
3011 make those two SETs separate I1 and I2 insns, and make an I0 that is
3012 the original I1. */
3020 {
3021 /* If there is no I1, there is no I0 either. */
3024 /* We make I1 with the same INSN_UID as I2. This gives it
3025 the same DF_INSN_LUID for value tracking. Our fake I1 will
3026 never appear in the insn stream so giving it the same INSN_UID
3027 as I2 will not cause a problem. */
3035 }
3037 /* Verify that I2 and maybe I1 and I0 can be combined into I3. */
3039 {
3044 }
3046 {
3051 }
3053 {
3058 }
3060 /* Record whether I2DEST is used in I2SRC and similarly for the other
3061 cases. Knowing this will help in register status updating below. */
3072 /* For the earlier insns, determine which of the subsequent ones they
3073 feed. */
3080 /* Ensure that I3's pattern can be the destination of combines. */
3086 {
3089 }
3091 /* See if any of the insns is a MULT operation. Unless one is, we will
3092 reject a combination that is, since it must be slower. Be conservative
3093 here. */
3101 /* If I3 has an inc, then give up if I1 or I2 uses the reg that is inc'd.
3102 We used to do this EXCEPT in one case: I3 has a post-inc in an
3103 output operand. However, that exception can give rise to insns like
3104 mov r3,(r3)+
3105 which is a famous insn on the PDP-11 where the value of r3 used as the
3106 source was model-dependent. Avoid this sort of thing. */
3108 #if 0
3114 /* It's not the exception. */
3115 #endif
3117 {
3118 rtx link;
3124 {
3127 }
3128 }
3130 /* See if the SETs in I1 or I2 need to be kept around in the merged
3131 instruction: whenever the value set there is still needed past I3.
3132 For the SET in I2, this is easy: we see if I2DEST dies or is set in I3.
3134 For the SET in I1, we have two cases: if I1 and I2 independently feed
3135 into I3, the set in I1 needs to be kept around unless I1DEST dies
3136 or is set in I3. Otherwise (if I1 feeds I2 which feeds I3), the set
3137 in I1 needs to be kept around unless I1DEST dies or is set in either
3138 I2 or I3. The same considerations apply to I0. */
3145 else
3153 else
3156 /* We are about to copy insns for the case where they need to be kept
3157 around. Check that they can be copied in the merged instruction. */
3163 {
3166 }
3168 /* If the set in I2 needs to be kept around, we must make a copy of
3169 PATTERN (I2), so that when we substitute I1SRC for I1DEST in
3170 PATTERN (I2), we are only substituting for the original I1DEST, not into
3171 an already-substituted copy. This also prevents making self-referential
3172 rtx. If I2 is a PARALLEL, we just need the piece that assigns I2SRC to
3173 I2DEST. */
3176 {
3179 else
3181 }
3184 {
3187 else
3189 }
3192 {
3195 else
3197 }
3199 combine_merges++;
3201 /* Substitute in the latest insn for the regs set by the earlier ones. */
3207 /* Many machines that don't use CC0 have insns that can both perform an
3208 arithmetic operation and set the condition code. These operations will
3209 be represented as a PARALLEL with the first element of the vector
3210 being a COMPARE of an arithmetic operation with the constant zero.
3211 The second element of the vector will set some pseudo to the result
3212 of the same arithmetic operation. If we simplify the COMPARE, we won't
3213 match such a pattern and so will generate an extra insn. Here we test
3214 for this case, where both the comparison and the operation result are
3215 needed, and make the PARALLEL by just replacing I2DEST in I3SRC with
3216 I2SRC. Later we will make the PARALLEL that contains I2. */
3222 {
3223 rtx newpat_dest;
3229 scalar_int_mode mode;
3238 {
3244 }
3246 /* Do the rest only if op1 is const0_rtx, which may be the
3247 result of simplification. */
3249 {
3250 /* If a single use of the CC is found, prepare to modify it
3251 when SELECT_CC_MODE returns a new CC-class mode, or when
3252 the above simplify_compare_const() returned a new comparison
3253 operator. undobuf.other_insn is assigned the CC use insn
3254 when modifying it. */
3256 {
3257 #ifdef SELECT_CC_MODE
3258 machine_mode new_mode
3263 {
3268 else
3269 {
3272 }
3273 }
3274 #endif
3275 /* Cases for modifying the CC-using comparison. */
3277 /* ??? Do we need to verify the zero rtx? */
3279 {
3280 /* Replace cc_use_loc with entire new RTX. */
3285 }
3287 {
3288 /* Just replace the CC reg with a new mode. */
3291 }
3292 }
3294 /* Now we modify the current newpat:
3295 First, SET_DEST(newpat) is updated if the CC mode has been
3296 altered. For targets without SELECT_CC_MODE, this should be
3297 optimized away. */
3300 /* This is always done to propagate i2src into newpat. */
3303 /* Create new version of i2pat if needed; the below PARALLEL
3304 creation needs this to work correctly. */
3308 }
3309 }
3312 {
3313 /* It is possible that the source of I2 or I1 may be performing
3314 an unneeded operation, such as a ZERO_EXTEND of something
3315 that is known to have the high part zero. Handle that case
3316 by letting subst look at the inner insns.
3318 Another way to do this would be to have a function that tries
3319 to simplify a single insn instead of merging two or more
3320 insns. We don't do this because of the potential of infinite
3321 loops and because of the potential extra memory required.
3322 However, doing it the way we are is a bit of a kludge and
3323 doesn't catch all cases.
3325 But only do this if -fexpensive-optimizations since it slows
3326 things down and doesn't usually win.
3328 This is not done in the COMPARE case above because the
3329 unmodified I2PAT is used in the PARALLEL and so a pattern
3330 with a modified I2SRC would not match. */
3333 {
3334 /* Pass pc_rtx so no substitutions are done, just
3335 simplifications. */
3337 {
3340 }
3344 }
3349 /* If I1 feeds into I2 and I1DEST is in I1SRC, we need to make a unique
3350 copy of I2SRC each time we substitute it, in order to avoid creating
3351 self-referential RTL when we will be substituting I1SRC for I1DEST
3352 later. Likewise if I0 feeds into I2, either directly or indirectly
3353 through I1, and I0DEST is in I0SRC. */
3360 /* Record whether I2's body now appears within I3's body. */
3362 }
3364 /* If we already got a failure, don't try to do more. Otherwise, try to
3365 substitute I1 if we have it. */
3368 {
3369 /* Check that an autoincrement side-effect on I1 has not been lost.
3370 This happens if I1DEST is mentioned in I2 and dies there, and
3371 has disappeared from the new pattern. */
3373 && i1_feeds_i2_n
3376 /* Before we can do this substitution, we must redo the test done
3377 above (see detailed comments there) that ensures I1DEST isn't
3378 mentioned in any SETs in NEWPAT that are field assignments. */
3381 {
3384 }
3389 /* If the following substitution will modify I1SRC, make a copy of it
3390 for the case where it is substituted for I1DEST in I2PAT later. */
3394 /* If I0 feeds into I1 and I0DEST is in I0SRC, we need to make a unique
3395 copy of I1SRC each time we substitute it, in order to avoid creating
3396 self-referential RTL when we will be substituting I0SRC for I0DEST
3397 later. */
3402 /* Record whether I1's body now appears within I3's body. */
3404 }
3406 /* Likewise for I0 if we have it. */
3409 {
3416 {
3419 }
3421 /* If the following substitution will modify I0SRC, make a copy of it
3422 for the case where it is substituted for I0DEST in I1PAT later. */
3425 /* And a copy for I0DEST in I2PAT substitution. */
3434 }
3436 /* Fail if an autoincrement side-effect has been duplicated. Be careful
3437 to count all the ways that I2SRC and I1SRC can be used. */
3448 /* Fail if we tried to make a new register. */
3450 /* Fail if we couldn't do something and have a CLOBBER. */
3452 /* Fail if this new pattern is a MULT and we didn't have one before
3453 at the outer level. */
3456 {
3459 }
3461 /* If the actions of the earlier insns must be kept
3462 in addition to substituting them into the latest one,
3463 we must make a new PARALLEL for the latest insn
3464 to hold additional the SETs. */
3467 {
3469 combine_extras++;
3472 {
3478 }
3479 else
3480 {
3485 }
3491 {
3497 }
3499 {
3508 }
3509 }
3511 validate_replacement:
3513 /* Note which hard regs this insn has as inputs. */
3516 /* If recog_for_combine fails, it strips existing clobbers. If we'll
3517 consider splitting this pattern, we might need these clobbers. */
3520 {
3526 }
3528 /* We have recognized nothing yet. */
3531 /* See if this is a PARALLEL of two SETs where one SET's destination is
3532 a register that is unused and this isn't marked as an instruction that
3533 might trap in an EH region. In that case, we just need the other SET.
3534 We prefer this over the PARALLEL.
3536 This can occur when simplifying a divmod insn. We *must* test for this
3537 case here because the code below that splits two independent SETs doesn't
3538 handle this case correctly when it updates the register status.
3540 It's pointless doing this if we originally had two sets, one from
3541 i3, and one from i2. Combining then splitting the parallel results
3542 in the original i2 again plus an invalid insn (which we delete).
3543 The net effect is only to move instructions around, which makes
3544 debug info less accurate.
3546 If the remaining SET came from I2 its destination should not be used
3547 between I2 and I3. See PR82024. */
3552 {
3563 {
3566 }
3575 {
3580 {
3586 }
3587 }
3591 }
3593 /* Is the result of combination a valid instruction? */
3597 /* If we were combining three insns and the result is a simple SET
3598 with no ASM_OPERANDS that wasn't recognized, try to split it into two
3599 insns. There are two ways to do this. It can be split using a
3600 machine-specific method (like when you have an addition of a large
3601 constant) or by combine in the function find_split_point. */
3605 {
3609 /* See if the MD file can split NEWPAT. If it can't, see if letting it
3610 use I2DEST as a scratch register will help. In the latter case,
3611 convert I2DEST to the mode of the source of NEWPAT if we can. */
3615 /* We can only use I2DEST as a scratch reg if it doesn't overlap any
3616 inputs of NEWPAT. */
3618 /* ??? If I2DEST is not safe, and I1DEST exists, then it would be
3619 possible to try that as a scratch reg. This would require adding
3620 more code to make it work though. */
3623 {
3626 /* ??? Reusing i2dest without resetting the reg_stat entry for it
3627 (temporarily, until we are committed to this instruction
3628 combination) does not work: for example, any call to nonzero_bits
3629 on the register (from a splitter in the MD file, for example)
3630 will get the old information, which is invalid.
3632 Since nowadays we can create registers during combine just fine,
3633 we should just create a new one here, not reuse i2dest. */
3635 /* First try to split using the original register as a
3636 scratch register. */
3640 i2dest)));
3643 /* If that didn't work, try changing the mode of I2DEST if
3644 we can. */
3649 {
3651 rtx ni2dest;
3655 else
3656 {
3659 }
3661 parallel = (gen_rtx_PARALLEL
3665 ni2dest))));
3670 {
3678 }
3679 }
3682 }
3684 /* If recog_for_combine has discarded clobbers, try to use them
3685 again for the split. */
3687 {
3690 }
3693 {
3698 }
3702 {
3712 /* If I2 or I3 has multiple SETs, we won't know how to track
3713 register status, so don't use these insns. If I2's destination
3714 is used between I2 and I3, we also can't use these insns. */
3724 /* It is possible that both insns now set the destination of I3.
3725 If so, we must show an extra use of it. */
3728 {
3747 }
3748 }
3750 /* If we can split it and use I2DEST, go ahead and see if that
3751 helps things be recognized. Verify that none of the registers
3752 are set between I2 and I3. */
3756 /* We need I2DEST in the proper mode. If it is a hard register
3757 or the only use of a pseudo, we can change its mode.
3758 Make sure we don't change a hard register to have a mode that
3759 isn't valid for it, or change the number of registers. */
3766 /* We can't overwrite I2DEST if its value is still used by
3767 NEWPAT. */
3769 {
3778 /* *SPLIT may be part of I2SRC, so make sure we have the
3779 original expression around for later debug processing.
3780 We should not need I2SRC any more in other cases. */
3783 else
3786 /* Get NEWDEST as a register in the proper mode. We have already
3787 validated that we can do this. */
3789 {
3792 else
3793 {
3796 }
3797 }
3799 /* If *SPLIT is a (mult FOO (const_int pow2)), convert it to
3800 an ASHIFT. This can occur if it was inside a PLUS and hence
3801 appeared to be a memory address. This is a kludge. */
3806 {
3810 /* Update split_code because we may not have a multiply
3811 anymore. */
3813 }
3815 /* Similarly for (plus (mult FOO (const_int pow2))). */
3821 {
3826 i_rtx));
3827 /* Update split_code because we may not have a multiply
3828 anymore. */
3830 }
3832 #ifdef INSN_SCHEDULING
3833 /* If *SPLIT is a paradoxical SUBREG, when we split it, it should
3834 be written as a ZERO_EXTEND. */
3836 {
3837 /* Or as a SIGN_EXTEND if LOAD_EXTEND_OP says that that's
3838 what it really is. */
3843 else
3846 }
3847 #endif
3849 /* Attempt to split binary operators using arithmetic identities. */
3853 {
3860 /* Split "X = Y op Y" as "Z = Y; X = Z op Z". */
3862 {
3867 }
3868 /* Split "((P op Q) op R) op S" where op is PLUS or MULT. */
3875 {
3881 /* Split both "((X op Y) op X) op Y" and
3882 "((X op Y) op Y) op X" as "T op T" where T is
3883 "X op Y". */
3886 {
3891 }
3892 /* Split "((X op X) op Y) op Y)" as "T op T" where
3893 T is "X op Y". */
3895 {
3901 }
3902 }
3903 }
3906 {
3909 }
3913 /* recog_for_combine might have added CLOBBERs to newi2pat.
3914 Make sure NEWPAT does not depend on the clobbered regs. */
3918 {
3921 {
3924 }
3925 }
3927 /* If the split point was a MULT and we didn't have one before,
3928 don't use one now. */
3931 }
3932 }
3934 /* Check for a case where we loaded from memory in a narrow mode and
3935 then sign extended it, but we need both registers. In that case,
3936 we have a PARALLEL with both loads from the same memory location.
3937 We can split this into a load from memory followed by a register-register
3938 copy. This saves at least one insn, more if register allocation can
3939 eliminate the copy.
3941 We cannot do this if the destination of the first assignment is a
3942 condition code register or cc0. We eliminate this case by making sure
3943 the SET_DEST and SET_SRC have the same mode.
3945 We cannot do this if the destination of the second assignment is
3946 a register that we have already assumed is zero-extended. Similarly
3947 for a SUBREG of such a register. */
3981 {
3982 rtx ni2dest;
3996 }
3998 /* Similarly, check for a case where we have a PARALLEL of two independent
3999 SETs but we started with three insns. In this case, we can do the sets
4000 as two separate insns. This case occurs when some SET allows two
4001 other insns to combine, but the destination of that SET is still live.
4003 Also do this if we started with two insns and (at least) one of the
4004 resulting sets is a noop; this noop will be deleted later. */
4023 {
4027 /* Normally, it doesn't matter which of the two is done first,
4028 but the one that references cc0 can't be the second, and
4029 one which uses any regs/memory set in between i2 and i3 can't
4030 be first. The PARALLEL might also have been pre-existing in i3,
4031 so we need to make sure that we won't wrongly hoist a SET to i2
4032 that would conflict with a death note present in there. */
4040 /* If I3 is a jump, ensure that set0 is a jump so that
4041 we do not create invalid RTL. */
4043 )
4044 {
4047 }
4055 /* If I3 is a jump, ensure that set1 is a jump so that
4056 we do not create invalid RTL. */
4058 )
4059 {
4062 }
4063 else
4064 {
4067 }
4072 {
4073 /* recog_for_combine might have added CLOBBERs to newi2pat.
4074 Make sure NEWPAT does not depend on the clobbered regs. */
4076 {
4079 {
4082 {
4085 }
4086 }
4087 }
4090 }
4091 }
4093 /* If it still isn't recognized, fail and change things back the way they
4094 were. */
4096 /* Is the result a reasonable ASM_OPERANDS? */
4098 {
4101 }
4103 /* If we had to change another insn, make sure it is valid also. */
4105 {
4113 {
4116 }
4117 }
4119 /* If I2 is the CC0 setter and I3 is the CC0 user then check whether
4120 they are adjacent to each other or not. */
4122 {
4126 {
4129 }
4130 }
4132 /* Only allow this combination if insn_cost reports that the
4133 replacement instructions are cheaper than the originals. */
4135 {
4138 }
4141 {
4146 {
4151 /* Temporarily revert mode back. */
4155 {
4156 /* If we used i2dest as a scratch register with a
4157 different mode, substitute it for the original
4158 i2src while its original mode is temporarily
4159 restored, and then clear i2scratch so that we don't
4160 do it again later. */
4162 this_basic_block);
4164 /* Put back the new mode. */
4166 }
4167 else
4168 {
4173 {
4176 }
4177 else
4178 {
4185 }
4187 /* We're dealing with a reg that changed mode but not
4188 meaning, so we want to turn it into a subreg for
4189 the new mode. However, because of REG sharing and
4190 because its mode had already changed, we have to do
4191 it in two steps. First, replace any debug uses of
4192 reg, with its original mode temporarily restored,
4193 with this copy we have created; then, replace the
4194 copy with the SUBREG of the original shared reg,
4195 once again changed to the new mode. */
4197 this_basic_block);
4201 this_basic_block);
4202 }
4203 }
4204 }
4206 /* If we will be able to accept this, we have made a
4207 change to the destination of I3. This requires us to
4208 do a few adjustments. */
4211 {
4214 }
4216 /* We now know that we can do this combination. Merge the insns and
4217 update the status of registers and LOG_LINKS. */
4220 {
4225 /* If any of the notes in OTHER_INSN were REG_DEAD or REG_UNUSED,
4226 ensure that they are still valid. Then add any non-duplicate
4227 notes added by recog_for_combine. */
4229 {
4238 /* Simply drop equal note since it may be no longer valid
4239 for other_insn. It may be possible to record that CC
4240 register is changed and only discard those notes, but
4241 in practice it's unnecessary complication and doesn't
4242 give any meaningful improvement.
4244 See PR78559. */
4248 }
4252 NULL_RTX);
4253 }
4256 {
4259 rtx ni2dest;
4261 /* I3 now uses what used to be its destination and which is now
4262 I2's destination. This requires us to do a few adjustments. */
4266 /* We need a LOG_LINK from I3 to I2. But we used to have one,
4267 so we still will.
4269 However, some later insn might be using I2's dest and have
4270 a LOG_LINK pointing at I3. We must remove this link.
4271 The simplest way to remove the link is to point it at I1,
4272 which we know will be a NOTE. */
4274 /* newi2pat is usually a SET here; however, recog_for_combine might
4275 have added some clobbers. */
4278 else
4285 {
4288 {
4294 }
4295 }
4296 }
4298 {
4303 /* Compute which registers we expect to eliminate. newi2pat may be setting
4304 either i3dest or i2dest, so we must check it. */
4307 || !i2dest_killed
4309 /* For i1, we need to compute both local elimination and global
4310 elimination information with respect to newi2pat because i1dest
4311 may be the same as i3dest, in which case newi2pat may be setting
4312 i1dest. Global information is used when distributing REG_DEAD
4313 note for i2 and i3, in which case it does matter if newi2pat sets
4314 i1dest or not.
4316 Local information is used when distributing REG_DEAD note for i1,
4317 in which case it doesn't matter if newi2pat sets i1dest or not.
4318 See PR62151, if we have four insns combination:
4319 i0: r0 <- i0src
4320 i1: r1 <- i1src (using r0)
4321 REG_DEAD (r0)
4322 i2: r0 <- i2src (using r1)
4323 i3: r3 <- i3src (using r0)
4324 ix: using r0
4325 From i1's point of view, r0 is eliminated, no matter if it is set
4326 by newi2pat or not. In other words, REG_DEAD info for r0 in i1
4327 should be discarded.
4329 Note local information only affects cases in forms like "I1->I2->I3",
4330 "I0->I1->I2->I3" or "I0&I1->I2, I2->I3". For other cases like
4331 "I0->I1, I1&I2->I3" or "I1&I2->I3", newi2pat won't set i1dest or
4332 i0dest anyway. */
4334 || !i1dest_killed
4339 /* Same case as i1. */
4346 /* Get the old REG_NOTES and LOG_LINKS from all our insns and
4347 clear them. */
4355 /* Ensure that we do not have something that should not be shared but
4356 occurs multiple times in the new insns. Check this by first
4357 resetting all the `used' flags and then copying anything is shared. */
4381 {
4384 {
4386 {
4387 /* I2SRC must still be meaningful at this point. Some
4388 splitting operations can invalidate I2SRC, but those
4389 operations do not apply to calls. */
4393 }
4400 }
4401 }
4406 /* We had one special case above where I2 had more than one set and
4407 we replaced a destination of one of those sets with the destination
4408 of I3. In that case, we have to update LOG_LINKS of insns later
4409 in this basic block. Note that this (expensive) case is rare.
4411 Also, in this case, we must pretend that all REG_NOTEs for I2
4412 actually came from I3, so that REG_UNUSED notes from I2 will be
4413 properly handled. */
4416 {
4425 temp_insn
4435 {
4440 }
4441 else
4444 }
4452 {
4455 this_basic_block);
4458 }
4459 else
4460 {
4463 this_basic_block);
4465 }
4468 {
4473 this_basic_block);
4475 }
4478 {
4483 this_basic_block);
4485 }
4487 /* Get death notes for everything that is now used in either I3 or
4488 I2 and used to die in a previous insn. If we built two new
4489 patterns, move from I1 to I2 then I2 to I3 so that we get the
4490 proper movement on registers that I2 modifies. */
4496 else
4502 /* Distribute all the LOG_LINKS and REG_NOTES from I1, I2, and I3. */
4519 /* Distribute any notes added to I2 or I3 by recog_for_combine. We
4520 know these are REG_UNUSED and want them to go to the desired insn,
4521 so we always pass it as i3. */
4525 NULL_RTX);
4529 NULL_RTX);
4531 /* If I3DEST was used in I3SRC, it really died in I3. We may need to
4532 put a REG_DEAD note for it somewhere. If NEWI2PAT exists and sets
4533 I3DEST, the death must be somewhere before I2, not I3. If we passed I3
4534 in that case, it might delete I2. Similarly for I2 and I1.
4535 Show an additional death due to the REG_DEAD note we make here. If
4536 we discard it in distribute_notes, we will decrement it again. */
4539 {
4544 else
4547 }
4550 {
4555 else
4558 }
4561 {
4566 else
4569 }
4572 {
4577 else
4580 }
4588 {
4593 /* The insn that used to set this register doesn't exist, and
4594 this life of the register may not exist either. See if one of
4595 I3's links points to an insn that sets I2DEST. If it does,
4596 that is now the last known value for I2DEST. If we don't update
4597 this and I2 set the register to a value that depended on its old
4598 contents, we will get confused. If this insn is used, thing
4599 will be set correctly in combine_instructions. */
4607 /* If the reg formerly set in I2 died only once and that was in I3,
4608 zero its use count so it won't make `reload' do any work. */
4611 && ! i2dest_in_i2src
4614 }
4617 {
4630 && ! i1dest_in_i1src
4633 }
4636 {
4649 && ! i0dest_in_i0src
4652 }
4654 /* Update reg_stat[].nonzero_bits et al for any changes that may have
4655 been made to this insn. The order is important, because newi2pat
4656 can affect nonzero_bits of newpat. */
4660 }
4663 {
4665 {
4668 }
4670 }
4673 {
4675 {
4678 }
4680 }
4683 {
4685 {
4688 }
4690 }
4693 {
4695 {
4698 }
4700 }
4703 {
4705 {
4708 }
4710 }
4712 /* Set new_direct_jump_p if a new return or simple jump instruction
4713 has been created. Adjust the CFG accordingly. */
4715 {
4719 }
4724 {
4727 }
4731 {
4737 }
4742 {
4748 }
4750 /* A noop might also need cleaning up of CFG, if it comes from the
4751 simplification of a jump. */
4756 {
4759 }
4766 {
4769 }
4771 combine_successes++;
4781 }
4782 \f
4783 /* Get a marker for undoing to the current state. */
4787 {
4789 }
4791 /* Undo the modifications up to the marker. */
4793 static void
4795 {
4799 {
4804 {
4819 }
4823 }
4826 }
4828 /* Undo all the modifications recorded in undobuf. */
4830 static void
4832 {
4834 }
4836 /* We've committed to accepting the changes we made. Move all
4837 of the undos to the free list. */
4839 static void
4841 {
4845 {
4849 }
4851 }
4852 \f
4853 /* Find the innermost point within the rtx at LOC, possibly LOC itself,
4854 where we have an arithmetic expression and return that point. LOC will
4855 be inside INSN.
4857 try_combine will call this function to see if an insn can be split into
4858 two insns. */
4862 {
4872 /* First special-case some codes. */
4874 {
4876 #ifdef INSN_SCHEDULING
4877 /* If we are making a paradoxical SUBREG invalid, it becomes a split
4878 point. */
4881 #endif
4885 /* If we have (mem (const ..)) or (mem (symbol_ref ...)), split it
4886 using LO_SUM and HIGH. */
4889 {
4897 }
4899 /* If we have a PLUS whose second operand is a constant and the
4900 address is not valid, perhaps will can split it up using
4901 the machine-specific way to split large constants. We use
4902 the first pseudo-reg (one of the virtual regs) as a placeholder;
4903 it will not remain in the result. */
4908 {
4911 subst_insn);
4913 /* This should have produced two insns, each of which sets our
4914 placeholder. If the source of the second is a valid address,
4915 we can make put both sources together and make a split point
4916 in the middle. */
4929 && memory_address_addr_space_p
4932 {
4936 /* Replace the placeholder in SRC2 with SRC1. If we can
4937 find where in SRC2 it was placed, that can become our
4938 split point and we can replace this address with SRC2.
4939 Just try two obvious places. */
4950 {
4953 }
4954 }
4956 /* If that didn't work, perhaps the first operand is complex and
4957 needs to be computed separately, so make a split point there.
4958 This will occur on machines that just support REG + CONST
4959 and have a constant moved through some previous computation. */
4965 }
4967 /* If we have a PLUS whose first operand is complex, try computing it
4968 separately by making a split there. */
4979 /* If SET_DEST is CC0 and SET_SRC is not an operand, a COMPARE, or a
4980 ZERO_EXTRACT, the most likely reason why this doesn't match is that
4981 we need to put the operand into a register. So split at that
4982 point. */
4992 /* See if we can split SET_SRC as it stands. */
4997 /* See if we can split SET_DEST as it stands. */
5002 /* See if this is a bitfield assignment with everything constant. If
5003 so, this is an IOR of an AND, so split it into that. */
5015 {
5020 unsigned HOST_WIDE_INT mask
5022 rtx or_mask;
5031 else
5032 {
5038 or_mask));
5039 }
5046 }
5048 /* Otherwise, see if this is an operation that we can split into two.
5049 If so, try to split that. */
5053 {
5055 /* If we are AND'ing with a large constant that is only a single
5056 bit and the result is only being used in a context where we
5057 need to know if it is zero or nonzero, replace it with a bit
5058 extraction. This will avoid the large constant, which might
5059 have taken more than one insn to make. If the constant were
5060 not a valid argument to the AND but took only one insn to make,
5061 this is no worse, but if it took more than one insn, it will
5062 be better. */
5072 {
5077 {
5080 }
5081 }
5085 /* If STORE_FLAG_VALUE is -1, this is (NE X 0) and only one bit of X
5086 is known to be on, this can be converted into a NEG of a shift. */
5092 {
5099 pos_rtx)));
5104 }
5110 /* We can't optimize if either mode is a partial integer
5111 mode as we don't know how many bits are significant
5112 in those modes. */
5128 {
5136 }
5141 }
5146 {
5147 /* For unsigned, we have a choice of a shift followed by an
5148 AND or two shifts. Use two shifts for field sizes where the
5149 constant might be too large. We assume here that we can
5150 always at least get 8-bit constants in an AND insn, which is
5151 true for every current RISC. */
5154 {
5155 unsigned HOST_WIDE_INT mask
5160 gen_rtx_LSHIFTRT
5167 }
5168 else
5169 {
5173 gen_rtx_fmt_ee
5183 }
5184 }
5186 /* See if this is a simple operation with a constant as the second
5187 operand. It might be that this constant is out of range and hence
5188 could be used as a split point. */
5196 /* Finally, see if this is a simple operation with its first operand
5197 not in a register. The operation might require this operand in a
5198 register, so return it as a split point. We can always do this
5199 because if the first operand were another operation, we would have
5200 already found it as a split point. */
5209 /* We write NOR as (and (not A) (not B)), but if we don't have a NOR,
5210 it is better to write this as (not (ior A B)) so we can split it.
5211 Similarly for IOR. */
5213 {
5221 }
5223 /* Many RISC machines have a large set of logical insns. If the
5224 second operand is a NOT, put it first so we will try to split the
5225 other operand first. */
5227 {
5231 }
5236 /* Canonicalization can produce (minus A (mult B C)), where C is a
5237 constant. It may be better to try splitting (plus (mult B -C) A)
5238 instead if this isn't a multiply by a power of two. */
5242 {
5250 mode)),
5253 }
5255 /* Split at a multiply-accumulate instruction. However if this is
5256 the SET_SRC, we likely do not have such an instruction and it's
5257 worthless to try this split. */
5266 }
5268 /* Otherwise, select our actions depending on our rtx class. */
5270 {
5276 /* fall through */
5284 /* fall through */
5286 /* Some machines have (and (shift ...) ...) insns. If X is not
5287 an AND, but XEXP (X, 0) is, use it as our split point. */
5297 /* Otherwise, we don't have a split point. */
5299 }
5300 }
5301 \f
5302 /* Throughout X, replace FROM with TO, and return the result.
5303 The result is TO if X is FROM;
5304 otherwise the result is X, but its contents may have been modified.
5305 If they were modified, a record was made in undobuf so that
5306 undo_all will (among other things) return X to its original state.
5308 If the number of changes necessary is too much to record to undo,
5309 the excess changes are not made, so the result is invalid.
5310 The changes already made can still be undone.
5311 undobuf.num_undo is incremented for such changes, so by testing that
5312 the caller can tell whether the result is valid.
5314 `n_occurrences' is incremented each time FROM is replaced.
5316 IN_DEST is nonzero if we are processing the SET_DEST of a SET.
5318 IN_COND is nonzero if we are at the top level of a condition.
5320 UNIQUE_COPY is nonzero if each substitution must be unique. We do this
5321 by copying if `n_occurrences' is nonzero. */
5323 static rtx
5325 {
5330 rtx new_rtx;
5332 /* Two expressions are equal if they are identical copies of a shared
5333 RTX or if they are both registers with the same register number
5334 and mode. */
5336 #define COMBINE_RTX_EQUAL_P(X,Y) \
5337 ((X) == (Y) \
5338 || (REG_P (X) && REG_P (Y) \
5339 && REGNO (X) == REGNO (Y) && GET_MODE (X) == GET_MODE (Y)))
5341 /* Do not substitute into clobbers of regs -- this will never result in
5342 valid RTL. */
5347 {
5348 n_occurrences++;
5350 }
5352 /* If X and FROM are the same register but different modes, they
5353 will not have been seen as equal above. However, the log links code
5354 will make a LOG_LINKS entry for that case. If we do nothing, we
5355 will try to rerecognize our original insn and, when it succeeds,
5356 we will delete the feeding insn, which is incorrect.
5358 So force this insn not to match in this (rare) case. */
5363 /* If this is an object, we are done unless it is a MEM or LO_SUM, both
5364 of which may contain things that can be combined. */
5368 /* It is possible to have a subexpression appear twice in the insn.
5369 Suppose that FROM is a register that appears within TO.
5370 Then, after that subexpression has been scanned once by `subst',
5371 the second time it is scanned, TO may be found. If we were
5372 to scan TO here, we would find FROM within it and create a
5373 self-referent rtl structure which is completely wrong. */
5377 /* Parallel asm_operands need special attention because all of the
5378 inputs are shared across the arms. Furthermore, unsharing the
5379 rtl results in recognition failures. Failure to handle this case
5380 specially can result in circular rtl.
5382 Solve this by doing a normal pass across the first entry of the
5383 parallel, and only processing the SET_DESTs of the subsequent
5384 entries. Ug. */
5389 {
5392 /* If this substitution failed, this whole thing fails. */
5400 {
5406 {
5409 /* If this substitution failed, this whole thing fails. */
5415 }
5416 }
5417 }
5418 else
5419 {
5423 /* We don't need to process a SET_DEST that is a register, CC0,
5424 or PC, so set up to skip this common case. All other cases
5425 where we want to suppress replacing something inside a
5426 SET_SRC are handled via the IN_DEST operand. */
5433 /* Trying to simplify the operands of a widening MULT is not likely
5434 to create RTL matching a machine insn. */
5446 /* Get the mode of operand 0 in case X is now a SIGN_EXTEND of a
5447 constant. */
5452 {
5454 {
5457 {
5459 {
5462 n_occurrences++;
5463 }
5464 else
5465 {
5467 unique_copy);
5469 /* If this substitution failed, this whole thing
5470 fails. */
5474 }
5477 }
5478 }
5480 {
5481 /* If this is a register being set, ignore it. */
5488 ;
5491 {
5492 /* In general, don't install a subreg involving two
5493 modes not tieable. It can worsen register
5494 allocation, and can even make invalid reload
5495 insns, since the reg inside may need to be copied
5496 from in the outside mode, and that may be invalid
5497 if it is an fp reg copied in integer mode.
5499 We allow two exceptions to this: It is valid if
5500 it is inside another SUBREG and the mode of that
5501 SUBREG and the mode of the inside of TO is
5502 tieable and it is valid if X is a SET that copies
5503 FROM to CC0. */
5511 && (!HAVE_cc0
5526 n_occurrences++;
5527 }
5528 else
5529 /* If we are in a SET_DEST, suppress most cases unless we
5530 have gone inside a MEM, in which case we want to
5531 simplify the address. We assume here that things that
5532 are actually part of the destination have their inner
5533 parts in the first expression. This is true for SUBREG,
5534 STRICT_LOW_PART, and ZERO_EXTRACT, which are the only
5535 things aside from REG and MEM that should appear in a
5536 SET_DEST. */
5538 (((in_dest
5544 unique_copy);
5546 /* If we found that we will have to reject this combination,
5547 indicate that by returning the CLOBBER ourselves, rather than
5548 an expression containing it. This will speed things up as
5549 well as prevent accidents where two CLOBBERs are considered
5550 to be equal, thus producing an incorrect simplification. */
5556 {
5564 }
5567 {
5571 }
5572 else
5574 }
5575 }
5576 }
5578 /* Check if we are loading something from the constant pool via float
5579 extension; in this case we would undo compress_float_constant
5580 optimization and degenerate constant load to an immediate value. */
5584 {
5588 }
5590 /* Try to simplify X. If the simplification changed the code, it is likely
5591 that further simplification will help, so loop, but limit the number
5592 of repetitions that will be performed. */
5595 {
5596 /* If X is sufficiently simple, don't bother trying to do anything
5597 with it. */
5606 /* We no longer know the original mode of operand 0 since we
5607 have changed the form of X) */
5609 }
5612 }
5613 \f
5614 /* If X is a commutative operation whose operands are not in the canonical
5615 order, use substitutions to swap them. */
5617 static void
5619 {
5622 {
5626 }
5627 }
5629 /* Simplify X, a piece of RTL. We just operate on the expression at the
5630 outer level; call `subst' to simplify recursively. Return the new
5631 expression.
5633 OP0_MODE is the original mode of XEXP (x, 0). IN_DEST is nonzero
5634 if we are inside a SET_DEST. IN_COND is nonzero if we are at the top level
5635 of a condition. */
5637 static rtx
5640 {
5643 scalar_int_mode int_mode;
5644 rtx temp;
5647 /* If this is a commutative operation, put a constant last and a complex
5648 expression first. We don't need to do this for comparisons here. */
5651 /* Try to fold this expression in case we have constants that weren't
5652 present before. */
5655 {
5663 {
5666 {
5670 }
5673 }
5686 }
5689 {
5694 }
5696 /* If this is a simple operation applied to an IF_THEN_ELSE, try
5697 applying it to the arms of the IF_THEN_ELSE. This often simplifies
5698 things. Check for cases where both arms are testing the same
5699 condition.
5701 Don't do anything if all operands are very simple. */
5714 {
5719 /* If everything is a comparison, what we have is highly unlikely
5720 to be simpler, so don't use it. */
5723 {
5730 /* Simplify the alternative arms; this may collapse the true and
5731 false arms to store-flag values. Be careful to use copy_rtx
5732 here since true_rtx or false_rtx might share RTL with x as a
5733 result of the if_then_else_cond call above. */
5737 /* If true_rtx and false_rtx are not general_operands, an if_then_else
5738 is unlikely to be simpler. */
5741 {
5744 /* Restarting if we generate a store-flag expression will cause
5745 us to loop. Just drop through in this case. */
5747 /* If the result values are STORE_FLAG_VALUE and zero, we can
5748 just make the comparison operation. */
5759 /* Likewise, we can make the negate of a comparison operation
5760 if the result values are - STORE_FLAG_VALUE and zero. */
5768 mode);
5779 mode);
5780 else
5783 mode,
5784 VOIDmode,
5785 cond,
5786 cop1),
5791 }
5792 }
5793 }
5795 /* First see if we can apply the inverse distributive law. */
5798 {
5802 }
5804 /* If CODE is an associative operation not otherwise handled, see if we
5805 can associate some operands. This can win if they are constants or
5806 if they are logically related (i.e. (a & b) & a). */
5812 {
5814 {
5818 rtx inner;
5820 /* Make sure we pass the constant operand if any as the second
5821 one if this is a commutative operation. */
5829 /* For commutative operations, try the other pair if that one
5830 didn't simplify. */
5832 {
5837 }
5841 }
5842 }
5844 /* A little bit of algebraic simplification here. */
5846 {
5848 /* Ensure that our address has any ASHIFTs converted to MULT in case
5849 address-recognizing predicates are called later. */
5858 /* See if this can be moved to simplify_subreg. */
5861 /* Don't call gen_lowpart if the inner mode
5862 is VOIDmode and we cannot simplify it, as SUBREG without
5863 inner mode is invalid. */
5870 {
5871 rtx temp;
5877 /* If op is known to have all lower bits zero, the result is zero. */
5890 }
5892 /* Don't change the mode of the MEM if that would change the meaning
5893 of the address. */
5900 /* Note that we cannot do any narrowing for non-constants since
5901 we might have been counting on using the fact that some bits were
5902 zero. We now do this in the SET. */
5909 /* For C equal to the width of MODE minus 1, (neg (ashiftrt X C)) can be
5910 replaced by (lshiftrt X C). This will convert
5911 (neg (sign_extract X 1 Y)) to (zero_extract X 1 Y). */
5919 /* If X has only a single bit that might be nonzero, say, bit I, convert
5920 (neg X) to (ashiftrt (ashift X C-I) C-I) where C is the bitsize of
5921 MODE minus 1. This will convert (neg (zero_extract X 1 Y)) to
5922 (sign_extract X 1 Y). But only do this if TEMP isn't a register
5923 or a SUBREG of one since we'd be making the expression more
5924 complex if it was just a register. */
5931 {
5932 rtx temp1 = simplify_shift_const
5938 /* If all we did was surround TEMP with the two shifts, we
5939 haven't improved anything, so don't use it. Otherwise,
5940 we are better off with TEMP1. */
5945 }
5949 /* We can't handle truncation to a partial integer mode here
5950 because we don't know the real bitsize of the partial
5951 integer mode. */
5960 /* We can truncate a constant value and return it. */
5964 /* Similarly to what we do in simplify-rtx.c, a truncate of a register
5965 whose value is a comparison can be replaced with a subreg if
5966 STORE_FLAG_VALUE permits. */
5975 /* (const (const X)) can become (const X). Do it this way rather than
5976 returning the inner CONST since CONST can be shared with a
5977 REG_EQUAL note. */
5983 /* Convert (lo_sum (high FOO) FOO) to FOO. This is necessary so we
5984 can add in an offset. find_split_point will split this address up
5985 again if it doesn't match. */
5992 /* (plus (xor (and <foo> (const_int pow2 - 1)) <c>) <-c>)
5993 when c is (const_int (pow2 + 1) / 2) is a sign extension of a
5994 bit-field and can be replaced by either a sign_extend or a
5995 sign_extract. The `and' may be a zero_extend and the two
5996 <c>, -<c> constants may be reversed. */
6012 return simplify_shift_const
6019 /* If only the low-order bit of X is possibly nonzero, (plus x -1)
6020 can become (ashiftrt (ashift (xor x 1) C) C) where C is
6021 the bitsize of the mode - 1. This allows simplification of
6022 "a = (b & 8) == 0;" */
6029 return simplify_shift_const
6033 const1_rtx),
6037 /* If we are adding two things that have no bits in common, convert
6038 the addition into an IOR. This will often be further simplified,
6039 for example in cases like ((a & 1) + (a & 2)), which can
6040 become a & 3. */
6045 {
6046 /* Try to simplify the expression further. */
6050 /* If we could, great. If not, do not go ahead with the IOR
6051 replacement, since PLUS appears in many special purpose
6052 address arithmetic instructions. */
6060 }
6062 /* Canonicalize x + x into x << 1. */
6071 /* (minus <foo> (and <foo> (const_int -pow2))) becomes
6072 (and <foo> (const_int pow2-1)) */
6083 /* If we have (mult (plus A B) C), apply the distributive law and then
6084 the inverse distributive law to see if things simplify. This
6085 occurs mostly in addresses, often when unrolling loops. */
6088 {
6092 }
6094 /* Try simplify a*(b/c) as (a*b)/c. */
6097 {
6103 }
6107 /* If this is a divide by a power of two, treat it as a shift if
6108 its first operand is a shift. */
6128 /* If the first operand is a condition code, we can't do anything
6129 with it. */
6133 {
6141 /* Simplify our comparison, if possible. */
6144 /* If STORE_FLAG_VALUE is 1, we can convert (ne x 0) to simply X
6145 if only the low-order bit is possibly nonzero in X (such as when
6146 X is a ZERO_EXTRACT of one bit). Similarly, we can convert EQ to
6147 (xor X 1) or (minus 1 X); we use the former. Finally, if X is
6148 known to be either 0 or -1, NE becomes a NEG and EQ becomes
6149 (plus X 1).
6151 Remove any ZERO_EXTRACT we made when thinking this was a
6152 comparison. It may now be simpler to use, e.g., an AND. If a
6153 ZERO_EXTRACT is indeed appropriate, it will be placed back by
6154 the call to make_compound_operation in the SET case.
6156 Don't apply these optimizations if the caller would
6157 prefer a comparison rather than a value.
6158 E.g., for the condition in an IF_THEN_ELSE most targets need
6159 an explicit comparison. */
6162 ;
6180 {
6184 int_mode);
6185 }
6193 {
6197 const1_rtx);
6198 }
6207 {
6210 }
6212 /* If STORE_FLAG_VALUE is -1, we have cases similar to
6213 those above. */
6215 ;
6232 {
6236 int_mode);
6237 }
6246 {
6250 int_mode);
6251 }
6253 /* If X is 0/1, (eq X 0) is X-1. */
6260 {
6263 }
6265 /* If STORE_FLAG_VALUE says to just test the sign bit and X has just
6266 one bit that might be nonzero, we can convert (ne x 0) to
6267 (ashift x c) where C puts the bit in the sign bit. Remove any
6268 AND with STORE_FLAG_VALUE when we are done, since we are only
6269 going to test the sign bit. */
6277 {
6283 else
6285 }
6287 /* If the code changed, return a whole new comparison.
6288 We also need to avoid using SUBST in cases where
6289 simplify_comparison has widened a comparison with a CONST_INT,
6290 since in that case the wider CONST_INT may fail the sanity
6291 checks in do_SUBST. */
6298 /* Otherwise, keep this operation, but maybe change its operands.
6299 This also converts (ne (compare FOO BAR) 0) to (ne FOO BAR). */
6302 }
6312 /* If we are processing SET_DEST, we are done. */
6330 /* If this is a shift by a constant amount, simplify it. */
6338 (HOST_WIDE_INT_1U
6347 }
6350 }
6351 \f
6352 /* Simplify X, an IF_THEN_ELSE expression. Return the new expression. */
6354 static rtx
6356 {
6363 rtx temp;
6366 rtx reversed;
6369 /* Simplify storing of the truth value. */
6374 /* Also when the truth value has to be reversed. */
6380 /* Sometimes we can simplify the arm of an IF_THEN_ELSE if a register used
6381 in it is being compared against certain values. Get the true and false
6382 comparisons and see if that says anything about the value of each arm. */
6388 {
6389 HOST_WIDE_INT nzb;
6395 /* If FALSE_CODE is EQ, swap the codes and arms. */
6398 {
6401 }
6403 scalar_int_mode from_mode;
6405 {
6406 /* If we are comparing against zero and the expression being
6407 tested has only a single bit that might be nonzero, that is
6408 its value when it is not equal to zero. Similarly if it is
6409 known to be -1 or 0. */
6413 {
6416 }
6421 {
6424 }
6425 }
6427 /* Now simplify an arm if we know the value of the register in the
6428 branch and it is used in the arm. Be careful due to the potential
6429 of locally-shared RTL. */
6446 }
6448 /* If we have (if_then_else FOO (pc) (label_ref BAR)) and FOO can be
6449 reversed, do so to avoid needing two sets of patterns for
6450 subtract-and-branch insns. Similarly if we have a constant in the true
6451 arm, the false arm is the same as the first operand of the comparison, or
6452 the false arm is more complicated than the true arm. */
6465 {
6474 /* It is possible that the conditional has been simplified out. */
6477 }
6479 /* If the two arms are identical, we don't need the comparison. */
6484 /* Convert a == b ? b : a to "a". */
6496 /* Look for cases where we have (abs x) or (neg (abs X)). */
6499 && comparison_p
6506 {
6512 return
6515 mode);
6518 }
6520 /* Look for MIN or MAX. */
6523 && comparison_p
6528 {
6543 }
6545 /* If we have (if_then_else COND (OP Z C1) Z) and OP is an identity when its
6546 second operand is zero, this can be done as (OP Z (mult COND C2)) where
6547 C2 = C1 * STORE_FLAG_VALUE. Similarly if OP has an outer ZERO_EXTEND or
6548 SIGN_EXTEND as long as Z is already extended (so we don't destroy it).
6549 We can do this kind of thing in some cases when STORE_FLAG_VALUE is
6550 neither 1 or -1, but it isn't worth checking for. */
6553 && comparison_p
6556 {
6572 /* If an identity-zero op is commutative, check whether there
6573 would be a match if we swapped the operands. */
6594 {
6598 }
6611 {
6615 }
6632 {
6636 }
6649 {
6653 }
6656 {
6666 const_true_rtx));
6674 }
6675 }
6677 /* If we have (if_then_else (ne A 0) C1 0) and either A is known to be 0 or
6678 1 and C1 is a single bit or A is known to be 0 or -1 and C1 is the
6679 negation of a single bit, we can convert this operation to a shift. We
6680 can actually do this more generally, but it doesn't seem worth it. */
6692 return
6696 /* (IF_THEN_ELSE (NE A 0) C1 0) is A or a zero-extend of A if the only
6697 non-zero bit in A is C1. */
6705 {
6711 }
6714 }
6715 \f
6716 /* Simplify X, a SET expression. Return the new expression. */
6718 static rtx
6720 {
6723 machine_mode mode
6727 scalar_int_mode int_mode;
6729 /* (set (pc) (return)) gets written as (return). */
6733 /* Now that we know for sure which bits of SRC we are using, see if we can
6734 simplify the expression for the object knowing that we only need the
6735 low-order bits. */
6738 {
6741 }
6743 /* If we are setting CC0 or if the source is a COMPARE, look for the use of
6744 the comparison result and try to simplify it unless we already have used
6745 undobuf.other_insn. */
6753 {
6762 {
6765 {
6768 }
6769 }
6770 else
6778 {
6782 }
6783 else
6784 {
6789 /* Attempt to simplify CC user. */
6791 {
6795 }
6797 /* Convert X into a no-op move. */
6801 }
6803 /* Simplify our comparison, if possible. */
6806 #ifdef SELECT_CC_MODE
6807 /* If this machine has CC modes other than CCmode, check to see if we
6808 need to use a different CC mode here. */
6817 else
6820 /* If the mode changed, we have to change SET_DEST, the mode in the
6821 compare, and the mode in the place SET_DEST is used. If SET_DEST is
6822 a hard register, just build new versions with the proper mode. If it
6823 is a pseudo, we lose unless it is only time we set the pseudo, in
6824 which case we can safely change its mode. */
6826 {
6828 {
6830 rtx new_dest;
6834 else
6835 {
6838 }
6845 }
6846 }
6849 /* If the code changed, we have to build a new comparison in
6850 undobuf.other_insn. */
6852 {
6861 /* If the only change we made was to change an EQ into an NE or
6862 vice versa, OP0 has only one bit that might be nonzero, and OP1
6863 is zero, check if changing the user of the condition code will
6864 produce a valid insn. If it won't, we can keep the original code
6865 in that insn by surrounding our operation with an XOR. */
6872 {
6877 {
6884 }
6885 }
6886 }
6891 /* Don't generate a compare of a CC with 0, just use that CC. */
6893 {
6896 }
6897 /* Otherwise, if we didn't previously have the same COMPARE we
6898 want, create it from scratch. */
6901 {
6904 }
6905 }
6906 else
6907 {
6908 /* Get SET_SRC in a form where we have placed back any
6909 compound expressions. Then do the checks below. */
6912 }
6914 /* If we have (set x (subreg:m1 (op:m2 ...) 0)) with OP being some operation,
6915 and X being a REG or (subreg (reg)), we may be able to convert this to
6916 (set (subreg:m2 x) (op)).
6918 We can always do this if M1 is narrower than M2 because that means that
6919 we only care about the low bits of the result.
6921 However, on machines without WORD_REGISTER_OPERATIONS defined, we cannot
6922 perform a narrower operation than requested since the high-order bits will
6923 be undefined. On machine where it is defined, this transformation is safe
6924 as long as M1 and M2 have the same number of words. */
6940 {
6943 dest));
6947 }
6949 /* If we have (set (cc0) (subreg ...)), we try to remove the subreg
6950 in SRC. */
6954 {
6958 /* Here we make sure that we don't have a sign bit on. */
6961 {
6964 }
6965 }
6967 /* If we have (set FOO (subreg:M (mem:N BAR) 0)) with M wider than N, this
6968 would require a paradoxical subreg. Replace the subreg with a
6969 zero_extend to avoid the reload that would otherwise be required.
6970 Don't do this for vector modes, as the transformation is incorrect. */
6977 {
6982 }
6984 /* If we don't have a conditional move, SET_SRC is an IF_THEN_ELSE, and we
6985 are comparing an item known to be 0 or -1 against 0, use a logical
6986 operation instead. Check for one of the arms being an IOR of the other
6987 arm with some value. We compute three terms to be IOR'ed together. In
6988 practice, at most two will be nonzero. Then we do the IOR's. */
6996 && (!HAVE_conditional_move
7001 {
7026 int_mode),
7027 false_rtx);
7033 term3));
7036 }
7038 /* If either SRC or DEST is a CLOBBER of (const_int 0), make this
7039 whole thing fail. */
7044 else
7045 /* Convert this into a field assignment operation, if possible. */
7047 }
7048 \f
7049 /* Simplify, X, and AND, IOR, or XOR operation, and return the simplified
7050 result. */
7052 static rtx
7054 {
7057 scalar_int_mode mode;
7060 {
7062 /* We can call simplify_and_const_int only if we don't lose
7063 any (sign) bits when converting INTVAL (op1) to
7064 "unsigned HOST_WIDE_INT". */
7069 {
7076 }
7078 /* If we have any of (and (ior A B) C) or (and (xor A B) C),
7079 apply the distributive law and then the inverse distributive
7080 law to see if things simplify. */
7082 {
7086 }
7088 {
7092 }
7096 /* If we have (ior (and A B) C), apply the distributive law and then
7097 the inverse distributive law to see if things simplify. */
7100 {
7104 }
7107 {
7111 }
7116 }
7119 }
7120 \f
7121 /* We consider ZERO_EXTRACT, SIGN_EXTRACT, and SIGN_EXTEND as "compound
7122 operations" because they can be replaced with two more basic operations.
7123 ZERO_EXTEND is also considered "compound" because it can be replaced with
7124 an AND operation, which is simpler, though only one operation.
7126 The function expand_compound_operation is called with an rtx expression
7127 and will convert it to the appropriate shifts and AND operations,
7128 simplifying at each stage.
7130 The function make_compound_operation is called to convert an expression
7131 consisting of shifts and ANDs into the equivalent compound expression.
7132 It is the inverse of this function, loosely speaking. */
7134 static rtx
7136 {
7140 rtx tem;
7141 scalar_int_mode inner_mode;
7144 {
7147 /* FALLTHRU */
7149 /* We can't necessarily use a const_int for a multiword mode;
7150 it depends on implicitly extending the value.
7151 Since we don't know the right way to extend it,
7152 we can't tell whether the implicit way is right.
7154 Even for a mode that is no wider than a const_int,
7155 we can't win, because we need to sign extend one of its bits through
7156 the rest of it, and we don't know which bit. */
7160 /* Reject modes that aren't scalar integers because turning vector
7161 or complex modes into shifts causes problems. */
7165 /* Return if (subreg:MODE FROM 0) is not a safe replacement for
7166 (zero_extend:MODE FROM) or (sign_extend:MODE FROM). It is for any MEM
7167 because (SUBREG (MEM...)) is guaranteed to cause the MEM to be
7168 reloaded. If not for that, MEM's would very rarely be safe.
7170 Reject modes bigger than a word, because we might not be able
7171 to reference a two-register group starting with an arbitrary register
7172 (and currently gen_lowpart might crash for a SUBREG). */
7178 /* If the inner object has VOIDmode (the only way this can happen
7179 is if it is an ASM_OPERANDS), we can't do anything since we don't
7180 know how much masking to do. */
7189 /* fall through */
7192 /* If the operand is a CLOBBER, just return it. */
7200 /* Reject modes that aren't scalar integers because turning vector
7201 or complex modes into shifts causes problems. */
7208 /* This should stay within the object being extracted, fail otherwise. */
7219 }
7221 /* We've rejected non-scalar operations by now. */
7224 /* Convert sign extension to zero extension, if we know that the high
7225 bit is not set, as this is easier to optimize. It will be converted
7226 back to cheaper alternative in make_extraction. */
7232 {
7236 /* Make sure this is a profitable operation. */
7243 else
7245 }
7247 /* We can optimize some special cases of ZERO_EXTEND. */
7249 {
7250 /* (zero_extend:DI (truncate:SI foo:DI)) is just foo:DI if we
7251 know that the last value didn't have any inappropriate bits
7252 set. */
7260 /* Likewise for (zero_extend:DI (subreg:SI foo:DI 0)). */
7269 /* (zero_extend:DI (truncate:SI foo:DI)) is just foo:DI when foo
7270 is a comparison and STORE_FLAG_VALUE permits. This is like
7271 the first case, but it works even when MODE is larger
7272 than HOST_WIDE_INT. */
7280 /* Likewise for (zero_extend:DI (subreg:SI foo:DI 0)). */
7289 }
7291 /* If we reach here, we want to return a pair of shifts. The inner
7292 shift is a left shift of BITSIZE - POS - LEN bits. The outer
7293 shift is a right shift of BITSIZE - LEN bits. It is arithmetic or
7294 logical depending on the value of UNSIGNEDP.
7296 If this was a ZERO_EXTEND or ZERO_EXTRACT, this pair of shifts will be
7297 converted into an AND of a shift.
7299 We must check for the case where the left shift would have a negative
7300 count. This can happen in a case like (x >> 31) & 255 on machines
7301 that can't shift by a constant. On those machines, we would first
7302 combine the shift with the AND to produce a variable-position
7303 extraction. Then the constant of 31 would be substituted in
7304 to produce such a position. */
7308 {
7316 }
7321 pos),
7323 else
7324 /* Any other cases we can't handle. */
7327 /* If we couldn't do this for some reason, return the original
7328 expression. */
7333 }
7334 \f
7335 /* X is a SET which contains an assignment of one object into
7336 a part of another (such as a bit-field assignment, STRICT_LOW_PART,
7337 or certain SUBREGS). If possible, convert it into a series of
7338 logical operations.
7340 We half-heartedly support variable positions, but do not at all
7341 support variable lengths. */
7343 static const_rtx
7345 {
7346 rtx inner;
7350 scalar_int_mode compute_mode;
7352 /* Loop until we find something we can't simplify. */
7354 {
7357 {
7361 MAX_MODE_INT);
7362 }
7365 {
7370 /* A constant position should stay within the width of INNER. */
7376 {
7384 /* If position is ADJUST - X, new position is X. */
7386 else
7387 {
7392 pos);
7393 }
7394 }
7395 }
7397 /* If the destination is a subreg that overwrites the whole of the inner
7398 register, we can move the subreg to the source. */
7400 /* We need SUBREGs to compute nonzero_bits properly. */
7401 && nonzero_sign_valid
7403 {
7405 gen_lowpart
7409 }
7410 else
7416 /* Don't attempt bitwise arithmetic on non scalar integer modes. */
7418 {
7419 /* Don't do anything for vector or complex integral types. */
7423 /* Try to find an integral mode to pun with. */
7429 }
7431 /* Compute a mask of LEN bits, if we can do this on the host machine. */
7435 /* Don't try to compute in too wide unsupported modes. */
7439 /* Now compute the equivalent expression. Make a copy of INNER
7440 for the SET_DEST in case it is a MEM into which we will substitute;
7441 we don't want shared RTL in that case. */
7443 compute_mode);
7447 compute_mode,
7449 compute_mode),
7450 inner);
7455 mask),
7456 pos);
7461 }
7464 }
7465 \f
7466 /* Return an RTX for a reference to LEN bits of INNER. If POS_RTX is nonzero,
7467 it is an RTX that represents the (variable) starting position; otherwise,
7468 POS is the (constant) starting bit position. Both are counted from the LSB.
7470 UNSIGNEDP is nonzero for an unsigned reference and zero for a signed one.
7472 IN_DEST is nonzero if this is a reference in the destination of a SET.
7473 This is used when a ZERO_ or SIGN_EXTRACT isn't needed. If nonzero,
7474 a STRICT_LOW_PART will be used, if zero, ZERO_EXTEND or SIGN_EXTEND will
7475 be used.
7477 IN_COMPARE is nonzero if we are in a COMPARE. This means that a
7478 ZERO_EXTRACT should be built even for bits starting at bit 0.
7480 MODE is the desired mode of the result (if IN_DEST == 0).
7482 The result is an RTX for the extraction or NULL_RTX if the target
7483 can't handle it. */
7485 static rtx
7489 {
7490 /* This mode describes the size of the storage area
7491 to fetch the overall value from. Within that, we
7492 ignore the POS lowest bits, etc. */
7494 machine_mode inner_mode;
7495 scalar_int_mode wanted_inner_mode;
7501 HOST_WIDE_INT orig_pos;
7509 /* If trying or potentionally trying to extract
7510 bits outside of is_mode, don't look through
7511 non-paradoxical SUBREGs. See PR82192. */
7514 {
7515 /* If going from (subreg:SI (mem:QI ...)) to (mem:QI ...),
7516 consider just the QI as the memory to extract from.
7517 The subreg adds or removes high bits; its mode is
7518 irrelevant to the meaning of this extraction,
7519 since POS and LEN count from the lsb. */
7523 }
7528 {
7529 /* We're extracting the least significant bits of an rtx
7530 (ashift X (const_int C)), where LEN > C. Extract the
7531 least significant (LEN - C) bits of X, giving an rtx
7532 whose mode is MODE, then shift it left C times. */
7538 }
7540 /* If trying or potentionally trying to extract
7541 bits outside of is_mode, don't look through
7542 TRUNCATE. See PR82192. */
7549 /* See if this can be done without an extraction. We never can if the
7550 width of the field is not the same as that of some integer mode. For
7551 registers, we can only avoid the extraction if the position is at the
7552 low-order bit and this is either not in the destination or we have the
7553 appropriate STRICT_LOW_PART operation available.
7555 For MEM, we can avoid an extract if the field starts on an appropriate
7556 boundary and we can change the mode of the memory reference. */
7558 scalar_int_mode tmode;
7567 && (! in_dest
7571 && (pos
7574 /* We can't do this if we are widening INNER_MODE (it
7575 may not be aligned, for one thing). */
7581 {
7582 /* If INNER is a MEM, make a new MEM that encompasses just the desired
7583 field. If the original and current mode are the same, we need not
7584 adjust the offset. Otherwise, we do if bytes big endian.
7586 If INNER is not a MEM, get a piece consisting of just the field
7587 of interest (in this case POS % BITS_PER_WORD must be 0). */
7590 {
7591 HOST_WIDE_INT offset;
7593 /* POS counts from lsb, but make OFFSET count in memory order. */
7596 else
7600 }
7602 {
7604 {
7605 /* We can't call gen_lowpart in a DEST since we
7606 always want a SUBREG (see below) and it would sometimes
7607 return a new hard register. */
7609 {
7610 poly_uint64 offset
7613 /* Avoid creating invalid subregs, for example when
7614 simplifying (x>>32)&255. */
7619 }
7620 else
7622 }
7623 else
7625 }
7626 else
7628 len >= HOST_BITS_PER_WIDE_INT
7629 ? HOST_WIDE_INT_M1U
7632 /* If this extraction is going into the destination of a SET,
7633 make a STRICT_LOW_PART unless we made a MEM. */
7648 /* If we know that no extraneous bits are set, and that the high
7649 bit is not set, convert the extraction to the cheaper of
7650 sign and zero extension, that are equivalent in these cases. */
7656 {
7660 /* Prefer ZERO_EXTENSION, since it gives more information to
7661 backends. */
7666 }
7668 /* Otherwise, sign- or zero-extend unless we already are in the
7669 proper mode. */
7673 }
7675 /* Unless this is a COMPARE or we have a funny memory reference,
7676 don't do anything with zero-extending field extracts starting at
7677 the low-order bit since they are simple AND operations. */
7682 /* Unless INNER is not MEM, reject this if we would be spanning bytes or
7683 if the position is not a constant and the length is not 1. In all
7684 other cases, we would only be going outside our object in cases when
7685 an original shift would have been undefined. */
7694 /* If INNER is not from memory, we want it to have the mode of a register
7695 extraction pattern's structure operand, or word_mode if there is no
7696 such pattern. The same applies to extraction_mode and pos_mode
7697 and their respective operands.
7699 For memory, assume that the desired extraction_mode and pos_mode
7700 are the same as for a register operation, since at present we don't
7701 have named patterns for aligned memory structures. */
7705 {
7709 }
7711 /* Never narrow an object, since that might not be safe. */
7719 else
7720 {
7721 /* Be careful not to go beyond the extracted object and maintain the
7722 natural alignment of the memory. */
7727 }
7732 {
7733 /* POS is passed as if BITS_BIG_ENDIAN == 0, so we need to convert it to
7734 BITS_BIG_ENDIAN style. If position is constant, compute new
7735 position. Otherwise, build subtraction.
7736 Note that POS is relative to the mode of the original argument.
7737 If it's a MEM we need to recompute POS relative to that.
7738 However, if we're extracting from (or inserting into) a register,
7739 we want to recompute POS relative to wanted_inner_mode. */
7746 else
7747 pos_rtx
7750 pos_rtx);
7751 /* POS may be less than 0 now, but we check for that below.
7752 Note that it can only be less than 0 if !MEM_P (inner). */
7753 }
7755 /* If INNER has a wider mode, and this is a constant extraction, try to
7756 make it smaller and adjust the byte to point to the byte containing
7757 the value. */
7760 && ! pos_rtx
7765 {
7768 /* The computations below will be correct if the machine is big
7769 endian in both bits and bytes or little endian in bits and bytes.
7770 If it is mixed, we must adjust. */
7772 /* If bytes are big endian and we had a paradoxical SUBREG, we must
7773 adjust OFFSET to compensate. */
7778 /* We can now move to the desired byte. */
7789 }
7791 /* If INNER is not memory, get it into the proper mode. If we are changing
7792 its mode, POS must be a constant and smaller than the size of the new
7793 mode. */
7795 {
7796 /* On the LHS, don't create paradoxical subregs implicitely truncating
7797 the register unless TARGET_TRULY_NOOP_TRUNCATION. */
7800 wanted_inner_mode))
7812 pos_rtx
7814 ? HOST_WIDE_INT_M1U
7818 }
7820 /* Adjust mode of POS_RTX, if needed. If we want a wider mode, we
7821 have to zero extend. Otherwise, we can just use a SUBREG.
7823 We dealt with constant rtxes earlier, so pos_rtx cannot
7824 have VOIDmode at this point. */
7828 {
7832 /* If we know that no extraneous bits are set, and that the high
7833 bit is not set, convert extraction to cheaper one - either
7834 SIGN_EXTENSION or ZERO_EXTENSION, that are equivalent in these
7835 cases. */
7843 {
7847 /* Prefer ZERO_EXTENSION, since it gives more information to
7848 backends. */
7852 }
7854 }
7856 /* Make POS_RTX unless we already have it and it is correct. If we don't
7857 have a POS_RTX but we do have an ORIG_POS_RTX, the latter must
7858 be a CONST_INT. */
7865 /* Make the required operation. See if we can use existing rtx. */
7872 }
7873 \f
7874 /* See if X (of mode MODE) contains an ASHIFT of COUNT or more bits that
7875 can be commuted with any other operations in X. Return X without
7876 that shift if so. */
7878 static rtx
7880 {
7882 rtx tem;
7885 {
7887 /* This is the shift itself. If it is wide enough, we will return
7888 either the value being shifted if the shift count is equal to
7889 COUNT or a shift for the difference. */
7903 /* If we can safely shift this constant and we find the inner shift,
7904 make a new operation. */
7909 {
7913 }
7918 }
7921 }
7922 \f
7923 /* Subroutine of make_compound_operation. *X_PTR is the rtx at the current
7924 level of the expression and MODE is its mode. IN_CODE is as for
7925 make_compound_operation. *NEXT_CODE_PTR is the value of IN_CODE
7926 that should be used when recursing on operands of *X_PTR.
7928 There are two possible actions:
7930 - Return null. This tells the caller to recurse on *X_PTR with IN_CODE
7931 equal to *NEXT_CODE_PTR, after which *X_PTR holds the final value.
7933 - Return a new rtx, which the caller returns directly. */
7935 static rtx
7939 {
7947 rtx tem;
7948 scalar_int_mode inner_mode;
7952 {
7955 }
7957 /* Process depending on the code of this operation. If NEW is set
7958 nonzero, it will be returned. */
7961 {
7963 /* Convert shifts by constants into multiplications if inside
7964 an address. */
7968 {
7974 {
7977 }
7980 }
7989 {
7993 }
7996 {
8000 mode));
8002 }
8003 else
8004 {
8007 }
8017 {
8021 }
8024 {
8028 mode));
8030 }
8031 else
8032 {
8036 }
8039 /* If the second operand is not a constant, we can't do anything
8040 with it. */
8044 /* If the constant is a power of two minus one and the first operand
8045 is a logical right shift, make an extraction. */
8048 {
8052 }
8054 /* Same as previous, but for (subreg (lshiftrt ...)) in first op. */
8061 {
8068 /* If we narrowed the mode when dropping the subreg, then we lose. */
8072 /* If that didn't give anything, see if the AND simplifies on
8073 its own. */
8075 {
8079 }
8080 }
8081 /* Same as previous, but for (xor/ior (lshiftrt...) (lshiftrt...)). */
8087 {
8088 /* Apply the distributive law, and then try to make extractions. */
8095 }
8097 /* If we are have (and (rotate X C) M) and C is larger than the number
8098 of bits in M, this is an extraction. */
8104 {
8110 }
8112 /* On machines without logical shifts, if the operand of the AND is
8113 a logical shift and our mask turns off all the propagated sign
8114 bits, we can replace the logical shift with an arithmetic shift. */
8122 {
8132 next_code),
8134 }
8136 /* If the constant is one less than a power of two, this might be
8137 representable by an extraction even if no shift is present.
8138 If it doesn't end up being a ZERO_EXTEND, we will ignore it unless
8139 we are in a COMPARE. */
8143 next_code),
8146 /* If we are in a comparison and this is an AND with a power of two,
8147 convert this into the appropriate bit extract. */
8153 next_code),
8156 /* If the one operand is a paradoxical subreg of a register or memory and
8157 the constant (limited to the smaller mode) has only zero bits where
8158 the sub expression has known zero bits, this can be expressed as
8159 a zero_extend. */
8161 {
8162 rtx sub;
8168 {
8172 /* original AND constant with all the known zero bits set */
8175 {
8180 }
8181 }
8182 }
8187 /* If the sign bit is known to be zero, replace this with an
8188 arithmetic shift. */
8193 {
8196 next_code),
8199 }
8201 /* fall through */
8207 /* If we have (ashiftrt (ashift foo C1) C2) with C2 >= C1,
8208 this is a SIGN_EXTRACT. */
8215 {
8222 }
8224 /* See if we have operations between an ASHIFTRT and an ASHIFT.
8225 If so, try to merge the shifts into a SIGN_EXTEND. We could
8226 also do this for some cases of SIGN_EXTRACT, but it doesn't
8227 seem worth the effort; the case checked for occurs on Alpha. */
8238 next_code),
8245 /* Call ourselves recursively on the inner expression. If we are
8246 narrowing the object and it has a different RTL code from
8247 what it originally did, do this SUBREG as a force_to_mode. */
8248 {
8252 /* If the SUBREG is masking of a logical right shift,
8253 make an extraction. */
8260 {
8269 }
8271 /* If in_code is COMPARE, it isn't always safe to pass it through
8272 to the recursive make_compound_operation call. */
8276 /* (subreg:SI (and:DI (reg:DI) (const_int 0x800000000)) 0)
8277 is (const_int 0), rather than
8278 (subreg:SI (lshiftrt:DI (reg:DI) (const_int 35)) 0).
8279 Similarly (subreg:QI (and:SI (reg:SI) (const_int 0x80)) 0)
8280 for non-equality comparisons against 0 is not equivalent
8281 to (subreg:QI (lshiftrt:SI (reg:SI) (const_int 7)) 0). */
8291 simplified
8299 {
8300 rtx newer
8303 /* If we have something other than a SUBREG, we might have
8304 done an expansion, so rerun ourselves. */
8308 /* force_to_mode can expand compounds. If it just re-expanded
8309 the compound, use gen_lowpart to convert to the desired
8310 mode. */
8312 /* Likewise if it re-expanded the compound only partially.
8313 This happens for SUBREG of ZERO_EXTRACT if they extract
8314 the same number of bits. */
8323 }
8327 }
8332 }
8338 }
8340 /* Look at the expression rooted at X. Look for expressions
8341 equivalent to ZERO_EXTRACT, SIGN_EXTRACT, ZERO_EXTEND, SIGN_EXTEND.
8342 Form these expressions.
8344 Return the new rtx, usually just X.
8346 Also, for machines like the VAX that don't have logical shift insns,
8347 try to convert logical to arithmetic shift operations in cases where
8348 they are equivalent. This undoes the canonicalizations to logical
8349 shifts done elsewhere.
8351 We try, as much as possible, to re-use rtl expressions to save memory.
8353 IN_CODE says what kind of expression we are processing. Normally, it is
8354 SET. In a memory address it is MEM. When processing the arguments of
8355 a comparison or a COMPARE against zero, it is COMPARE, or EQ if more
8356 precisely it is an equality comparison against zero. */
8358 rtx
8360 {
8367 /* Select the code to be used in recursive calls. Once we are inside an
8368 address, we stay there. If we have a comparison, set to COMPARE,
8369 but once inside, go back to our default of SET. */
8376 scalar_int_mode mode;
8378 {
8384 }
8386 /* Now recursively process each operand of this operation. We need to
8387 handle ZERO_EXTEND specially so that we don't lose track of the
8388 inner mode. */
8390 {
8398 }
8403 {
8406 }
8409 {
8412 }
8416 }
8417 \f
8418 /* Given M see if it is a value that would select a field of bits
8419 within an item, but not the entire word. Return -1 if not.
8420 Otherwise, return the starting position of the field, where 0 is the
8421 low-order bit.
8423 *PLEN is set to the length of the field. */
8425 static int
8427 {
8428 /* Get the bit number of the first 1 bit from the right, -1 if none. */
8433 /* Now shift off the low-order zero bits and see if we have a
8434 power of two minus 1. */
8442 }
8443 \f
8444 /* If X refers to a register that equals REG in value, replace these
8445 references with REG. */
8446 static rtx
8448 {
8456 {
8489 /* FALLTHRU */
8493 {
8497 else
8499 }
8501 /* fall through */
8508 {
8511 {
8513 {
8516 }
8518 }
8519 }
8521 {
8524 {
8527 {
8529 {
8532 }
8534 }
8535 }
8536 }
8539 }
8542 }
8544 /* Return X converted to MODE. If the value is already truncated to
8545 MODE we can just return a subreg even though in the general case we
8546 would need an explicit truncation. */
8548 static rtx
8550 {
8555 {
8556 /* Bit-cast X into an integer mode. */
8561 }
8564 }
8566 /* See if X can be simplified knowing that we will only refer to it in
8567 MODE and will only refer to those bits that are nonzero in MASK.
8568 If other bits are being computed or if masking operations are done
8569 that select a superset of the bits in MASK, they can sometimes be
8570 ignored.
8572 Return a possibly simplified expression, but always convert X to
8573 MODE. If X is a CONST_INT, AND the CONST_INT with MASK.
8575 If JUST_SELECT is nonzero, don't optimize by noticing that bits in MASK
8576 are all off in X. This is used when X will be complemented, by either
8577 NOT, NEG, or XOR. */
8579 static rtx
8582 {
8585 machine_mode op_mode;
8588 /* If this is a CALL or ASM_OPERANDS, don't do anything. Some of the
8589 code below will do the wrong thing since the mode of such an
8590 expression is VOIDmode.
8592 Also do nothing if X is a CLOBBER; this can happen if X was
8593 the return value from a call to gen_lowpart. */
8597 /* We want to perform the operation in its present mode unless we know
8598 that the operation is valid in MODE, in which case we do the operation
8599 in MODE. */
8604 /* It is not valid to do a right-shift in a narrower mode
8605 than the one it came in with. */
8610 /* Truncate MASK to fit OP_MODE. */
8614 /* Determine what bits of X are guaranteed to be (non)zero. */
8617 /* If none of the bits in X are needed, return a zero. */
8621 /* If X is a CONST_INT, return a new one. Do this here since the
8622 test below will fail. */
8624 {
8627 else
8628 {
8631 }
8632 }
8634 /* If X is narrower than MODE and we want all the bits in X's mode, just
8635 get X in the proper mode. */
8640 /* We can ignore the effect of a SUBREG if it narrows the mode or
8641 if the constant masks to zero all the bits the mode doesn't have. */
8645 || (mask
8653 /* OP_MODE is either MODE or XMODE, so it must be a scalar
8654 integer too. */
8660 }
8662 /* Subroutine of force_to_mode that handles cases in which both X and
8663 the result are scalar integers. MODE is the mode of the result,
8664 XMODE is the mode of X, and OP_MODE says which of MODE or XMODE
8665 is preferred for simplified versions of X. The other arguments
8666 are as for force_to_mode. */
8668 static rtx
8672 {
8678 /* When we have an arithmetic operation, or a shift whose count we
8679 do not know, we need to assume that all bits up to the highest-order
8680 bit in MASK will be needed. This is how we form such a mask. */
8683 else
8688 {
8690 /* If X is a (clobber (const_int)), return it since we know we are
8691 generating something that won't match. */
8704 /* Similarly for a truncate. */
8708 /* If this is an AND with a constant, convert it into an AND
8709 whose constant is the AND of that constant with MASK. If it
8710 remains an AND of MASK, delete it since it is redundant. */
8713 {
8718 /* If X is still an AND, see if it is an AND with a mask that
8719 is just some low-order bits. If so, and it is MASK, we don't
8720 need it. */
8726 /* If it remains an AND, try making another AND with the bits
8727 in the mode mask that aren't in MASK turned on. If the
8728 constant in the AND is wide enough, this might make a
8729 cheaper constant. */
8734 {
8735 unsigned HOST_WIDE_INT cval
8737 rtx y;
8744 }
8747 }
8752 /* In (and (plus FOO C1) M), if M is a mask that just turns off
8753 low-order bits (as in an alignment operation) and FOO is already
8754 aligned to that boundary, mask C1 to that boundary as well.
8755 This may eliminate that PLUS and, later, the AND. */
8757 {
8761 /* If MODE is narrower than HOST_WIDE_INT and mask is a negative
8762 number, sign extend it. */
8775 }
8777 /* fall through */
8780 /* Substituting into the operands of a widening MULT is not likely to
8781 create RTL matching a machine insn. */
8791 /* For PLUS, MINUS and MULT, we need any bits less significant than the
8792 most significant bit in MASK since carries from those bits will
8793 affect the bits we are interested in. */
8798 /* If X is (minus C Y) where C's least set bit is larger than any bit
8799 in the mask, then we may replace with (neg Y). */
8802 {
8805 }
8807 /* Similarly, if C contains every bit in the fuller_mask, then we may
8808 replace with (not Y). */
8811 {
8814 }
8821 /* If X is (ior (lshiftrt FOO C1) C2), try to commute the IOR and
8822 LSHIFTRT so we end up with an (and (lshiftrt (ior ...) ...) ...)
8823 operation which may be a bitfield extraction. Ensure that the
8824 constant we form is not wider than the mode of X. */
8836 {
8839 xmode);
8845 }
8847 binop:
8848 /* For most binary operations, just propagate into the operation and
8849 change the mode if we have an operation of that mode. */
8854 /* If we ended up truncating both operands, truncate the result of the
8855 operation instead. */
8858 {
8861 }
8867 {
8870 }
8874 /* For left shifts, do the same, but just for the first operand.
8875 However, we cannot do anything with shifts where we cannot
8876 guarantee that the counts are smaller than the size of the mode
8877 because such a count will have a different meaning in a
8878 wider mode. */
8888 /* If the shift count is a constant and we can do arithmetic in
8889 the mode of the shift, refine which bits we need. Otherwise, use the
8890 conservative form of the mask. */
8896 else
8904 {
8907 }
8911 /* Here we can only do something if the shift count is a constant,
8912 this shift constant is valid for the host, and we can do arithmetic
8913 in OP_MODE. */
8919 {
8923 /* Select the mask of the bits we need for the shift operand. */
8926 /* We can only change the mode of the shift if we can do arithmetic
8927 in the mode of the shift and INNER_MASK is no wider than the
8928 width of X's mode. */
8935 {
8938 }
8939 }
8941 /* If we have (and (lshiftrt FOO C1) C2) where the combination of the
8942 shift and AND produces only copies of the sign bit (C2 is one less
8943 than a power of two), we can do this with just a shift. */
8947 /* The shift puts one of the sign bit copies in the least significant
8948 bit. */
8953 /* Number of bits left after the shift must be more than the mask
8954 needs. */
8957 /* Must be more sign bit copies than the mask needs. */
8960 {
8964 }
8968 /* If we are just looking for the sign bit, we don't need this shift at
8969 all, even if it has a variable count. */
8973 /* If this is a shift by a constant, get a mask that contains those bits
8974 that are not copies of the sign bit. We then have two cases: If
8975 MASK only includes those bits, this can be a logical shift, which may
8976 allow simplifications. If MASK is a single-bit field not within
8977 those bits, we are requesting a copy of the sign bit and hence can
8978 shift the sign bit to the appropriate location. */
8982 {
8986 /* If the considered data is wider than HOST_WIDE_INT, we can't
8987 represent a mask for all its bits in a single scalar.
8988 But we only care about the lower bits, so calculate these. */
8991 {
8994 /* GET_MODE_PRECISION (GET_MODE (x)) - INTVAL (XEXP (x, 1))
8995 is the number of bits a full-width mask would have set.
8996 We need only shift if these are fewer than nonzero can
8997 hold. If not, we must keep all bits set in nonzero. */
9002 + HOST_BITS_PER_WIDE_INT
9004 }
9005 else
9006 {
9009 }
9012 {
9017 }
9020 {
9021 x = simplify_shift_const
9027 }
9028 }
9030 /* If MASK is 1, convert this to an LSHIFTRT. This can be done
9031 even if the shift count isn't a constant. */
9035 shiftrt:
9037 /* If this is a zero- or sign-extension operation that just affects bits
9038 we don't care about, remove it. Be sure the call above returned
9039 something that is still a shift. */
9049 next_select);
9055 /* If the shift count is constant and we can do computations
9056 in the mode of X, compute where the bits we care about are.
9057 Otherwise, we can't do anything. Don't change the mode of
9058 the shift or propagate MODE into the shift, though. */
9061 {
9070 }
9074 /* If we just want the low-order bit, the NEG isn't needed since it
9075 won't change the low-order bit. */
9079 /* We need any bits less significant than the most significant bit in
9080 MASK since carries from those bits will affect the bits we are
9081 interested in. */
9086 /* (not FOO) is (xor FOO CONST), so if FOO is an LSHIFTRT, we can do the
9087 same as the XOR case above. Ensure that the constant we form is not
9088 wider than the mode of X. */
9096 {
9103 }
9105 /* (and (not FOO) CONST) is (not (or FOO (not CONST))), so we must
9106 use the full mask inside the NOT. */
9109 unop:
9112 next_select));
9114 {
9117 }
9121 /* (and (ne FOO 0) CONST) can be (and FOO CONST) if CONST is included
9122 in STORE_FLAG_VALUE and FOO has a single bit that might be nonzero,
9123 which is equal to STORE_FLAG_VALUE. */
9135 /* We have no way of knowing if the IF_THEN_ELSE can itself be
9136 written in a narrower mode. We play it safe and do not do so. */
9152 }
9154 /* Ensure we return a value of the proper mode. */
9156 }
9157 \f
9158 /* Return nonzero if X is an expression that has one of two values depending on
9159 whether some other value is zero or nonzero. In that case, we return the
9160 value that is being tested, *PTRUE is set to the value if the rtx being
9161 returned has a nonzero value, and *PFALSE is set to the other alternative.
9163 If we return zero, we set *PTRUE and *PFALSE to X. */
9165 static rtx
9167 {
9172 scalar_int_mode int_mode;
9174 /* If we are comparing a value against zero, we are done. */
9177 {
9181 }
9183 /* If this is a unary operation whose operand has one of two values, apply
9184 our opcode to compute those values. */
9187 {
9192 }
9194 /* If this is a COMPARE, do nothing, since the IF_THEN_ELSE we would
9195 make can't possibly match and would suppress other optimizations. */
9197 ;
9199 /* If this is a binary operation, see if either side has only one of two
9200 values. If either one does or if both do and they are conditional on
9201 the same value, compute the new true and false values. */
9203 {
9211 {
9212 /* Try to enable a simplification by undoing work done by
9213 if_then_else_cond if it converted a REG into something more
9214 complex. */
9216 {
9219 }
9220 else
9221 {
9224 }
9225 }
9229 {
9230 /* If if_then_else_cond returned zero, then true/false are the
9231 same rtl. We must copy one of them to prevent invalid rtl
9232 sharing. */
9239 {
9244 }
9245 else
9246 {
9249 }
9252 }
9254 /* See if we have PLUS, IOR, XOR, MINUS or UMAX, where one of the
9255 operands is zero when the other is nonzero, and vice-versa,
9256 and STORE_FLAG_VALUE is 1 or -1. */
9262 {
9279 {
9286 const_true_rtx);
9288 }
9289 }
9291 /* Similarly for MULT, AND and UMIN, except that for these the result
9292 is always zero. */
9296 {
9310 {
9313 }
9314 }
9315 }
9318 {
9319 /* If we have IF_THEN_ELSE already, extract the condition and
9320 canonicalize it if it is NE or EQ. */
9326 {
9329 }
9330 else
9332 }
9334 /* If X is a SUBREG, we can narrow both the true and false values
9335 if the inner expression, if there is a condition. */
9339 {
9345 {
9349 }
9350 }
9352 /* If X is a constant, this isn't special and will cause confusions
9353 if we treat it as such. Likewise if it is equivalent to a constant. */
9356 ;
9358 /* If we're in BImode, canonicalize on 0 and STORE_FLAG_VALUE, as that
9359 will be least confusing to the rest of the compiler. */
9361 {
9364 }
9366 /* If X is known to be either 0 or -1, those are the true and
9367 false values when testing X. */
9372 {
9375 }
9377 /* Likewise for 0 or a single bit. */
9380 {
9383 }
9385 /* Otherwise fail; show no condition with true and false values the same. */
9388 }
9389 \f
9390 /* Return the value of expression X given the fact that condition COND
9391 is known to be true when applied to REG as its first operand and VAL
9392 as its second. X is known to not be shared and so can be modified in
9393 place.
9395 We only handle the simplest cases, and specifically those cases that
9396 arise with IF_THEN_ELSE expressions. */
9398 static rtx
9400 {
9408 /* If either operand of the condition is a floating point value,
9409 then we have to avoid collapsing an EQ comparison. */
9419 /* If X is (abs REG) and we know something about REG's relationship
9420 with zero, we may be able to simplify this. */
9424 {
9433 }
9435 /* The only other cases we handle are MIN, MAX, and comparisons if the
9436 operands are the same as REG and VAL. */
9439 {
9441 {
9444 }
9447 {
9449 {
9457 else
9459 }
9462 {
9465 /* Do not reverse the condition when it is NE or EQ.
9466 This is because we cannot conclude anything about
9467 the value of 'SMAX (x, y)' when x is not equal to y,
9468 but we can when x equals y. */
9474 {
9485 }
9486 }
9487 }
9488 }
9490 {
9495 {
9496 /* We must simplify subreg here, before we lose track of the
9497 original inner_mode. */
9502 else
9504 }
9507 }
9508 /* We don't have to handle SIGN_EXTEND here, because even in the
9509 case of replacing something with a modeless CONST_INT, a
9510 CONST_INT is already (supposed to be) a valid sign extension for
9511 its narrower mode, which implies it's already properly
9512 sign-extended for the wider mode. Now, for ZERO_EXTEND, the
9513 story is different. */
9515 {
9520 {
9521 /* We must simplify the zero_extend here, before we lose
9522 track of the original inner_mode. */
9527 else
9529 }
9532 }
9536 {
9543 }
9546 }
9547 \f
9548 /* See if X and Y are equal for the purposes of seeing if we can rewrite an
9549 assignment as a field assignment. */
9551 static int
9553 {
9555 {
9563 }
9571 /* Check for a paradoxical SUBREG of a MEM compared with the MEM.
9572 Note that all SUBREGs of MEM are paradoxical; otherwise they
9573 would have been rewritten. */
9586 /* We used to see if get_last_value of X and Y were the same but that's
9587 not correct. In one direction, we'll cause the assignment to have
9588 the wrong destination and in the case, we'll import a register into this
9589 insn that might have already have been dead. So fail if none of the
9590 above cases are true. */
9592 }
9593 \f
9594 /* See if X, a SET operation, can be rewritten as a bit-field assignment.
9595 Return that assignment if so.
9597 We only handle the most common cases. */
9599 static rtx
9601 {
9604 rtx assign;
9606 HOST_WIDE_INT c1;
9607 HOST_WIDE_INT pos;
9609 rtx other;
9611 /* All the rules in this function are specific to scalar integers. */
9612 scalar_int_mode mode;
9616 /* If SRC was (and (not (ashift (const_int 1) POS)) DEST), this is
9617 a clear of a one-bit field. We will have changed it to
9618 (and (rotate (const_int -2) POS) DEST), so check for that. Also check
9619 for a SUBREG. */
9625 {
9631 }
9640 {
9647 }
9649 /* If SRC is (ior (ashift (const_int 1) POS) DEST), this is a set of a
9650 one-bit field. */
9654 {
9660 }
9662 /* If DEST is already a field assignment, i.e. ZERO_EXTRACT, and the
9663 SRC is an AND with all bits of that field set, then we can discard
9664 the AND. */
9669 {
9676 else
9679 /* Complete overlap. We can remove the source AND. */
9683 /* Partial overlap. We can reduce the source AND. */
9685 {
9689 }
9690 }
9692 /* The other case we handle is assignments into a constant-position
9693 field. They look like (ior/xor (and DEST C1) OTHER). If C1 represents
9694 a mask that has all one bits except for a group of zero bits and
9695 OTHER is known to have zeros where C1 has ones, this is such an
9696 assignment. Compute the position and length from C1. Shift OTHER
9697 to the appropriate position, force it to the required mode, and
9698 make the extraction. Check for the AND in both operands. */
9700 /* One or more SUBREGs might obscure the constant-position field
9701 assignment. The first one we are likely to encounter is an outer
9702 narrowing SUBREG, which we can just strip for the purposes of
9703 identifying the constant-field assignment. */
9720 /* The second SUBREG that might get in the way is a paradoxical
9721 SUBREG around the first operand of the AND. We want to
9722 pretend the operand is as wide as the destination here. We
9723 do this by adjusting the MEM to wider mode for the sole
9724 purpose of the call to rtx_equal_for_field_assignment_p. Also
9725 note this trick only works for MEMs. */
9737 /* The second SUBREG that might get in the way is a paradoxical
9738 SUBREG around the first operand of the AND. We want to
9739 pretend the operand is as wide as the destination here. We
9740 do this by adjusting the MEM to wider mode for the sole
9741 purpose of the call to rtx_equal_for_field_assignment_p. Also
9742 note this trick only works for MEMs. */
9750 else
9764 /* The mode to use for the source is the mode of the assignment, or of
9765 what is inside a possible STRICT_LOW_PART. */
9769 /* Shift OTHER right POS places and make it the source, restricting it
9770 to the proper length and mode. */
9774 dest);
9776 len >= HOST_BITS_PER_WIDE_INT
9777 ? HOST_WIDE_INT_M1U
9781 /* If SRC is masked by an AND that does not make a difference in
9782 the value being stored, strip it. */
9793 }
9794 \f
9795 /* See if X is of the form (+ (* a c) (* b c)) and convert to (* (+ a b) c)
9796 if so. */
9798 static rtx
9800 {
9804 rtx tem;
9806 /* Distributivity is not true for floating point as it can change the
9807 value. So we don't do it unless -funsafe-math-optimizations. */
9812 /* The outer operation can only be one of the following: */
9820 /* If either operand is a primitive we can't do anything, so get out
9821 fast. */
9831 /* See if the inner and outer operations distribute. */
9833 {
9838 /* These all distribute except over PLUS. */
9849 /* This is also a multiply, so it distributes over everything. */
9852 /* This used to handle SUBREG, but this turned out to be counter-
9853 productive, since (subreg (op ...)) usually is not handled by
9854 insn patterns, and this "optimization" therefore transformed
9855 recognizable patterns into unrecognizable ones. Therefore the
9856 SUBREG case was removed from here.
9858 It is possible that distributing SUBREG over arithmetic operations
9859 leads to an intermediate result than can then be optimized further,
9860 e.g. by moving the outer SUBREG to the other side of a SET as done
9861 in simplify_set. This seems to have been the original intent of
9862 handling SUBREGs here.
9864 However, with current GCC this does not appear to actually happen,
9865 at least on major platforms. If some case is found where removing
9866 the SUBREG case here prevents follow-on optimizations, distributing
9867 SUBREGs ought to be re-added at that place, e.g. in simplify_set. */
9871 }
9873 /* Set LHS and RHS to the inner operands (A and B in the example
9874 above) and set OTHER to the common operand (C in the example).
9875 There is only one way to do this unless the inner operation is
9876 commutative. */
9888 else
9891 /* Form the new inner operation, seeing if it simplifies first. */
9894 /* There is one exception to the general way of distributing:
9895 (a | c) ^ (b | c) -> (a ^ b) & ~c */
9897 {
9900 }
9902 /* We may be able to continuing distributing the result, so call
9903 ourselves recursively on the inner operation before forming the
9904 outer operation, which we return. */
9907 }
9909 /* See if X is of the form (* (+ A B) C), and if so convert to
9910 (+ (* A C) (* B C)) and try to simplify.
9912 Most of the time, this results in no change. However, if some of
9913 the operands are the same or inverses of each other, simplifications
9914 will result.
9916 For example, (and (ior A B) (not B)) can occur as the result of
9917 expanding a bit field assignment. When we apply the distributive
9918 law to this, we get (ior (and (A (not B))) (and (B (not B)))),
9919 which then simplifies to (and (A (not B))).
9921 Note that no checks happen on the validity of applying the inverse
9922 distributive law. This is pointless since we can do it in the
9923 few places where this routine is called.
9925 N is the index of the term that is decomposed (the arithmetic operation,
9926 i.e. (+ A B) in the first example above). !N is the index of the term that
9927 is distributed, i.e. of C in the first example above. */
9928 static rtx
9930 {
9931 machine_mode mode;
9935 /* Distributivity is not true for floating point as it can change the
9936 value. So we don't do it unless -funsafe-math-optimizations. */
9953 /* Special case (and (xor B C) (not A)), which is equivalent to
9954 (xor (ior A B) (ior A C)) */
9956 {
9959 }
9962 {
9963 /* Distribute the second term. */
9966 }
9967 else
9968 {
9969 /* Distribute the first term. */
9972 }
9982 }
9983 \f
9984 /* Simplify a logical `and' of VAROP with the constant CONSTOP, to be done
9985 in MODE. Return an equivalent form, if different from (and VAROP
9986 (const_int CONSTOP)). Otherwise, return NULL_RTX. */
9988 static rtx
9991 {
9994 rtx orig_varop;
10002 /* Simplify VAROP knowing that we will be only looking at some of the
10003 bits in it.
10005 Note by passing in CONSTOP, we guarantee that the bits not set in
10006 CONSTOP are not significant and will never be examined. We must
10007 ensure that is the case by explicitly masking out those bits
10008 before returning. */
10011 /* If VAROP is a CLOBBER, we will fail so return it. */
10015 /* If VAROP is a CONST_INT, then we need to apply the mask in CONSTOP
10016 to VAROP and return the new constant. */
10020 /* See what bits may be nonzero in VAROP. Unlike the general case of
10021 a call to nonzero_bits, here we don't care about bits outside
10022 MODE. */
10026 /* Turn off all bits in the constant that are known to already be zero.
10027 Thus, if the AND isn't needed at all, we will have CONSTOP == NONZERO_BITS
10028 which is tested below. */
10032 /* If we don't have any bits left, return zero. */
10036 /* If VAROP is a NEG of something known to be zero or 1 and CONSTOP is
10037 a power of two, we can replace this with an ASHIFT. */
10042 /* If VAROP is an IOR or XOR, apply the AND to both branches of the IOR
10043 or XOR, then try to apply the distributive law. This may eliminate
10044 operations if either branch can be simplified because of the AND.
10045 It may also make some cases more complex, but those cases probably
10046 won't match a pattern either with or without this. */
10049 {
10051 return
10052 gen_lowpart
10054 apply_distributive_law
10058 constop),
10061 constop))));
10062 }
10064 /* If VAROP is PLUS, and the constant is a mask of low bits, distribute
10065 the AND and see if one of the operands simplifies to zero. If so, we
10066 may eliminate it. */
10070 {
10079 }
10081 /* Make a SUBREG if necessary. If we can't make it, fail. */
10086 /* If we are only masking insignificant bits, return VAROP. */
10093 /* Otherwise, return an AND. */
10095 }
10098 /* We have X, a logical `and' of VAROP with the constant CONSTOP, to be done
10099 in MODE.
10101 Return an equivalent form, if different from X. Otherwise, return X. If
10102 X is zero, we are to always construct the equivalent form. */
10104 static rtx
10107 {
10118 }
10119 \f
10120 /* Given a REG X of mode XMODE, compute which bits in X can be nonzero.
10121 We don't care about bits outside of those defined in MODE.
10123 For most X this is simply GET_MODE_MASK (GET_MODE (MODE)), but if X is
10124 a shift, AND, or zero_extract, we can do better. */
10126 static rtx
10128 scalar_int_mode mode,
10130 {
10131 rtx tem;
10134 /* If X is a register whose nonzero bits value is current, use it.
10135 Otherwise, if X is a register whose value we can find, use that
10136 value. Otherwise, use the previously-computed global nonzero bits
10137 for this register. */
10151 && !REGNO_REG_SET_P
10154 {
10155 /* Note that, even if the precision of last_set_mode is lower than that
10156 of mode, record_value_for_reg invoked nonzero_bits on the register
10157 with nonzero_bits_mode (because last_set_mode is necessarily integral
10158 and HWI_COMPUTABLE_MODE_P in this case) so bits in nonzero_bits_mode
10159 are all valid, hence in mode too since nonzero_bits_mode is defined
10160 to the largest HWI_COMPUTABLE_MODE_P mode. */
10163 }
10167 {
10172 }
10175 {
10179 /* We don't know anything about the upper bits. */
10183 }
10186 }
10188 /* Given a reg X of mode XMODE, return the number of bits at the high-order
10189 end of X that are known to be equal to the sign bit. X will be used
10190 in mode MODE; the returned value will always be between 1 and the
10191 number of bits in MODE. */
10193 static rtx
10195 scalar_int_mode mode,
10197 {
10198 rtx tem;
10211 && !REGNO_REG_SET_P
10214 {
10217 }
10228 }
10229 \f
10230 /* Return the number of "extended" bits there are in X, when interpreted
10231 as a quantity in MODE whose signedness is indicated by UNSIGNEDP. For
10232 unsigned quantities, this is the number of high-order zero bits.
10233 For signed quantities, this is the number of copies of the sign bit
10234 minus 1. In both case, this function returns the number of "spare"
10235 bits. For example, if two quantities for which this function returns
10236 at least 1 are added, the addition is known not to overflow.
10238 This function will always return 0 unless called during combine, which
10239 implies that it must be called from a define_split. */
10241 unsigned int
10243 {
10247 scalar_int_mode int_mode;
10255 }
10257 /* This function is called from `simplify_shift_const' to merge two
10258 outer operations. Specifically, we have already found that we need
10259 to perform operation *POP0 with constant *PCONST0 at the outermost
10260 position. We would now like to also perform OP1 with constant CONST1
10261 (with *POP0 being done last).
10263 Return 1 if we can do the operation and update *POP0 and *PCONST0 with
10264 the resulting operation. *PCOMP_P is set to 1 if we would need to
10265 complement the innermost operand, otherwise it is unchanged.
10267 MODE is the mode in which the operation will be done. No bits outside
10268 the width of this mode matter. It is assumed that the width of this mode
10269 is smaller than or equal to HOST_BITS_PER_WIDE_INT.
10271 If *POP0 or OP1 are UNKNOWN, it means no operation is required. Only NEG, PLUS,
10272 IOR, XOR, and AND are supported. We may set *POP0 to SET if the proper
10273 result is simply *PCONST0.
10275 If the resulting operation cannot be expressed as one operation, we
10276 return 0 and do not change *POP0, *PCONST0, and *PCOMP_P. */
10278 static int
10279 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)
10280 {
10287 /* If OP0 is an AND, clear unimportant bits in CONST1. */
10291 /* If OP0 or OP1 is UNKNOWN, this is easy. Similarly if they are the same or
10292 if OP0 is SET. */
10301 {
10303 {
10321 }
10322 }
10324 /* Otherwise, if either is a PLUS or NEG, we can't do anything. */
10328 /* If the two constants aren't the same, we can't do anything. The
10329 remaining six cases can all be done. */
10333 else
10335 {
10338 /* (a & b) | b == b */
10341 /* (a ^ b) | b == a | b */
10342 {;}
10347 /* (a & b) ^ b == (~a) & b */
10350 /* (a | b) ^ b == a & ~b */
10356 /* (a | b) & b == b */
10359 /* (a ^ b) & b) == (~a) & b */
10364 }
10366 /* Check for NO-OP cases. */
10379 /* ??? Slightly redundant with the above mask, but not entirely.
10380 Moving this above means we'd have to sign-extend the mode mask
10381 for the final test. */
10386 }
10387 \f
10388 /* A helper to simplify_shift_const_1 to determine the mode we can perform
10389 the shift in. The original shift operation CODE is performed on OP in
10390 ORIG_MODE. Return the wider mode MODE if we can perform the operation
10391 in that mode. Return ORIG_MODE otherwise. We can also assume that the
10392 result of the shift is subject to operation OUTER_CODE with operand
10393 OUTER_CONST. */
10395 static scalar_int_mode
10399 {
10402 /* In general we can't perform in wider mode for right shift and rotate. */
10404 {
10406 /* We can still widen if the bits brought in from the left are identical
10407 to the sign bit of ORIG_MODE. */
10415 /* Similarly here but with zero bits. */
10420 /* We can also widen if the bits brought in will be masked off. This
10421 operation is performed in ORIG_MODE. */
10423 {
10429 }
10430 /* fall through */
10440 }
10441 }
10443 /* Simplify a shift of VAROP by ORIG_COUNT bits. CODE says what kind
10444 of shift. The result of the shift is RESULT_MODE. Return NULL_RTX
10445 if we cannot simplify it. Otherwise, return a simplified value.
10447 The shift is normally computed in the widest mode we find in VAROP, as
10448 long as it isn't a different number of words than RESULT_MODE. Exceptions
10449 are ASHIFTRT and ROTATE, which are always done in their original mode. */
10451 static rtx
10454 {
10459 machine_mode shift_mode;
10461 unsigned int mode_words
10463 /* We form (outer_op (code varop count) (outer_const)). */
10469 /* Make sure and truncate the "natural" shift on the way in. We don't
10470 want to do this inside the loop as it makes it more difficult to
10471 combine shifts. */
10475 /* If we were given an invalid count, don't do anything except exactly
10476 what was requested. */
10483 /* Unless one of the branches of the `if' in this loop does a `continue',
10484 we will `break' the loop after the `if'. */
10487 {
10488 /* If we have an operand of (clobber (const_int 0)), fail. */
10492 /* Convert ROTATERT to ROTATE. */
10494 {
10498 }
10502 {
10503 /* We only change the modes of scalar shifts. */
10509 }
10511 scalar_int_mode shift_unit_mode
10514 /* Handle cases where the count is greater than the size of the mode
10515 minus 1. For ASHIFT, use the size minus one as the count (this can
10516 occur when simplifying (lshiftrt (ashiftrt ..))). For rotates,
10517 take the count modulo the size. For other shifts, the result is
10518 zero.
10520 Since these shifts are being produced by the compiler by combining
10521 multiple operations, each of which are defined, we know what the
10522 result is supposed to be. */
10525 {
10530 else
10531 {
10532 /* We can't simply return zero because there may be an
10533 outer op. */
10537 }
10538 }
10540 /* If we discovered we had to complement VAROP, leave. Making a NOT
10541 here would cause an infinite loop. */
10546 {
10547 /* An arithmetic right shift of a quantity known to be -1 or 0
10548 is a no-op. */
10552 {
10555 }
10557 /* If we are doing an arithmetic right shift and discarding all but
10558 the sign bit copies, this is equivalent to doing a shift by the
10559 bitsize minus one. Convert it into that shift because it will
10560 often allow other simplifications. */
10567 /* We simplify the tests below and elsewhere by converting
10568 ASHIFTRT to LSHIFTRT if we know the sign bit is clear.
10569 `make_compound_operation' will convert it to an ASHIFTRT for
10570 those machines (such as VAX) that don't have an LSHIFTRT. */
10575 shift_unit_mode)))
10587 }
10590 {
10597 {
10600 }
10604 /* The following rules apply only to scalars. */
10609 /* If we have (xshiftrt (mem ...) C) and C is MODE_WIDTH
10610 minus the width of a smaller mode, we can do this with a
10611 SIGN_EXTEND or ZERO_EXTEND from the narrower memory location. */
10618 {
10627 }
10631 /* The following rules apply only to scalars. */
10637 /* If VAROP is a SUBREG, strip it as long as the inner operand has
10638 the same number of words as what we've seen so far. Then store
10639 the widest mode in MODE. */
10645 == mode_words
10647 {
10652 }
10656 /* Some machines use MULT instead of ASHIFT because MULT
10657 is cheaper. But it is still better on those machines to
10658 merge two shifts into one. */
10661 {
10666 }
10670 /* Similar, for when divides are cheaper. */
10673 {
10678 }
10682 /* If we are extracting just the sign bit of an arithmetic
10683 right shift, that shift is not needed. However, the sign
10684 bit of a wider mode may be different from what would be
10685 interpreted as the sign bit in a narrower mode, so, if
10686 the result is narrower, don't discard the shift. */
10691 {
10694 }
10696 /* fall through */
10701 /* The following rules apply only to scalars. */
10708 /* Here we have two nested shifts. The result is usually the
10709 AND of a new shift with a mask. We compute the result below. */
10715 {
10719 rtx mask_rtx;
10721 /* We have one common special case. We can't do any merging if
10722 the inner code is an ASHIFTRT of a smaller mode. However, if
10723 we have (ashift:M1 (subreg:M1 (ashiftrt:M2 FOO C1) 0) C2)
10724 with C2 == GET_MODE_BITSIZE (M1) - GET_MODE_BITSIZE (M2),
10725 we can convert it to
10726 (ashiftrt:M1 (ashift:M1 (and:M1 (subreg:M1 FOO 0) C3) C2) C1).
10727 This simplifies certain SIGN_EXTEND operations. */
10731 {
10732 /* C3 has the low-order C1 bits zero. */
10744 }
10746 /* If this was (ashiftrt (ashift foo C1) C2) and FOO has more
10747 than C1 high-order bits equal to the sign bit, we can convert
10748 this to either an ASHIFT or an ASHIFTRT depending on the
10749 two counts.
10751 We cannot do this if VAROP's mode is not SHIFT_UNIT_MODE. */
10757 {
10761 {
10764 }
10767 }
10769 /* There are some cases we can't do. If CODE is ASHIFTRT,
10770 we can only do this if FIRST_CODE is also ASHIFTRT.
10772 We can't do the case when CODE is ROTATE and FIRST_CODE is
10773 ASHIFTRT.
10775 If the mode of this shift is not the mode of the outer shift,
10776 we can't do this if either shift is a right shift or ROTATE.
10778 Finally, we can't do any of these if the mode is too wide
10779 unless the codes are the same.
10781 Handle the case where the shift codes are the same
10782 first. */
10785 {
10794 }
10805 /* To compute the mask to apply after the shift, shift the
10806 nonzero bits of the inner shift the same way the
10807 outer shift will. */
10810 int_result_mode);
10812 mask_rtx
10816 /* Give up if we can't compute an outer operation to use. */
10824 /* If the shifts are in the same direction, we add the
10825 counts. Otherwise, we subtract them. */
10829 else
10832 /* If COUNT is positive, the new shift is usually CODE,
10833 except for the two exceptions below, in which case it is
10834 FIRST_CODE. If the count is negative, FIRST_CODE should
10835 always be used */
10845 }
10847 /* If we have (A << B << C) for any shift, we can convert this to
10848 (A << C << B). This wins if A is a constant. Only try this if
10849 B is not a constant. */
10854 {
10855 /* For ((unsigned) (cstULL >> count)) >> cst2 we have to make
10856 sure the result will be masked. See PR70222. */
10864 /* For ((int) (cstLL >> count)) >> cst2 just give up. Queuing
10865 up outer sign extension (often left and right shift) is
10866 hardly more efficient than the original. See PR70429. */
10873 count_rtx);
10877 }
10881 /* The following rules apply only to scalars. */
10885 /* Make this fit the case below. */
10892 /* The following rules apply only to scalars. */
10898 /* If we have (xshiftrt (ior (plus X (const_int -1)) X) C)
10899 with C the size of VAROP - 1 and the shift is logical if
10900 STORE_FLAG_VALUE is 1 and arithmetic if STORE_FLAG_VALUE is -1,
10901 we have an (le X 0) operation. If we have an arithmetic shift
10902 and STORE_FLAG_VALUE is 1 or we have a logical shift with
10903 STORE_FLAG_VALUE of -1, we have a (neg (le X 0)) operation. */
10911 {
10914 const0_rtx);
10920 }
10922 /* If we have (shift (logical)), move the logical to the outside
10923 to allow it to possibly combine with another logical and the
10924 shift to combine with another shift. This also canonicalizes to
10925 what a ZERO_EXTRACT looks like. Also, some machines have
10926 (and (shift)) insns. */
10929 /* We can't do this if we have (ashiftrt (xor)) and the
10930 constant has its sign bit set in shift_unit_mode with
10931 shift_unit_mode wider than result_mode. */
10944 {
10947 }
10949 /* If we can't do that, try to simplify the shift in each arm of the
10950 logical expression, make a new logical expression, and apply
10951 the inverse distributive law. This also can't be done for
10952 (ashiftrt (xor)) where we've widened the shift and the constant
10953 changes the sign bit. */
10959 {
10971 }
10975 /* The following rules apply only to scalars. */
10980 /* Convert (lshiftrt (eq FOO 0) C) to (xor FOO 1) if STORE_FLAG_VALUE
10981 says that the sign bit can be tested, FOO has mode MODE, C is
10982 GET_MODE_PRECISION (MODE) - 1, and FOO has only its low-order bit
10983 that may be nonzero. */
10993 {
10997 }
11001 /* The following rules apply only to scalars. */
11006 /* (lshiftrt (neg A) C) where A is either 0 or 1 and C is one less
11007 than the number of bits in the mode is equivalent to A. */
11011 {
11015 }
11017 /* NEG commutes with ASHIFT since it is multiplication. Move the
11018 NEG outside to allow shifts to combine. */
11022 {
11025 }
11029 /* The following rules apply only to scalars. */
11034 /* (lshiftrt (plus A -1) C) where A is either 0 or 1 and C
11035 is one less than the number of bits in the mode is
11036 equivalent to (xor A 1). */
11043 {
11047 }
11049 /* If we have (xshiftrt (plus FOO BAR) C), and the only bits
11050 that might be nonzero in BAR are those being shifted out and those
11051 bits are known zero in FOO, we can replace the PLUS with FOO.
11052 Similarly in the other operand order. This code occurs when
11053 we are computing the size of a variable-size array. */
11060 {
11063 }
11071 {
11074 }
11076 /* (ashift (plus foo C) N) is (plus (ashift foo N) C'). */
11087 {
11090 }
11092 /* Check for 'PLUS signbit', which is the canonical form of 'XOR
11093 signbit', and attempt to change the PLUS to an XOR and move it to
11094 the outer operation as is done above in the AND/IOR/XOR case
11095 leg for shift(logical). See details in logical handling above
11096 for reasoning in doing so. */
11108 {
11111 }
11116 /* The following rules apply only to scalars. */
11121 /* If we have (xshiftrt (minus (ashiftrt X C)) X) C)
11122 with C the size of VAROP - 1 and the shift is logical if
11123 STORE_FLAG_VALUE is 1 and arithmetic if STORE_FLAG_VALUE is -1,
11124 we have a (gt X 0) operation. If the shift is arithmetic with
11125 STORE_FLAG_VALUE of 1 or logical with STORE_FLAG_VALUE == -1,
11126 we have a (neg (gt X 0)) operation. */
11135 {
11138 const0_rtx);
11144 }
11148 /* Change (lshiftrt (truncate (lshiftrt))) to (truncate (lshiftrt))
11149 if the truncate does not affect the value. */
11156 {
11160 new_count);
11163 new_count_rtx);
11167 }
11172 }
11175 }
11179 {
11180 /* We only change the modes of scalar shifts. */
11185 }
11187 /* We have now finished analyzing the shift. The result should be
11188 a shift of type CODE with SHIFT_MODE shifting VAROP COUNT places. If
11189 OUTER_OP is non-UNKNOWN, it is an operation that needs to be applied
11190 to the result of the shift. OUTER_CONST is the relevant constant,
11191 but we must turn off all bits turned off in the shift. */
11199 /* Make a SUBREG if necessary. If we can't make it, fail. */
11204 /* If we have an outer operation and we just made a shift, it is
11205 possible that we could have simplified the shift were it not
11206 for the outer operation. So try to do the simplification
11207 recursively. */
11211 else
11218 /* If we were doing an LSHIFTRT in a wider mode than it was originally,
11219 turn off all the bits that the shift would have turned off. */
11221 /* We only change the modes of scalar shifts. */
11225 /* Do the remainder of the processing in RESULT_MODE. */
11228 /* If COMPLEMENT_P is set, we have to complement X before doing the outer
11229 operation. */
11234 {
11244 {
11245 /* This means that we have determined that the result is
11246 equivalent to a constant. This should be rare. */
11249 }
11252 else
11255 }
11258 }
11260 /* Simplify a shift of VAROP by COUNT bits. CODE says what kind of shift.
11261 The result of the shift is RESULT_MODE. If we cannot simplify it,
11262 return X or, if it is NULL, synthesize the expression with
11263 simplify_gen_binary. Otherwise, return a simplified value.
11265 The shift is normally computed in the widest mode we find in VAROP, as
11266 long as it isn't a different number of words than RESULT_MODE. Exceptions
11267 are ASHIFTRT and ROTATE, which are always done in their original mode. */
11269 static rtx
11272 {
11283 }
11285 \f
11286 /* A subroutine of recog_for_combine. See there for arguments and
11287 return value. */
11289 static int
11291 {
11293 rtx pat_without_clobbers;
11301 /* If PAT is a PARALLEL, check to see if it contains the CLOBBER
11302 we use to indicate that something didn't match. If we find such a
11303 thing, force rejection. */
11317 {
11320 else
11323 }
11325 /* If it isn't, there is the possibility that we previously had an insn
11326 that clobbered some register as a side effect, but the combined
11327 insn doesn't need to do that. So try once more without the clobbers
11328 unless this represents an ASM insn. */
11332 {
11337 {
11340 pos++;
11341 }
11351 {
11354 else
11357 }
11358 }
11365 /* Recognize all noop sets, these will be killed by followup pass. */
11369 /* If we had any clobbers to add, make a new pattern than contains
11370 them. Then check to make sure that all of them are dead. */
11372 {
11382 else
11389 {
11394 {
11398 }
11399 }
11401 }
11405 {
11413 /* Allow targets to reject combined insn. */
11415 {
11418 dump_file);
11420 /* Callers expect recog_for_combine to strip
11421 clobbers from the pattern on failure. */
11426 }
11431 }
11437 }
11439 /* Change every ZERO_EXTRACT and ZERO_EXTEND of a SUBREG that can be
11440 expressed as an AND and maybe an LSHIFTRT, to that formulation.
11441 Return whether anything was so changed. */
11443 static bool
11445 {
11451 {
11463 {
11473 else
11477 }
11483 {
11489 }
11494 {
11498 }
11499 else
11505 {
11508 }
11512 }
11519 scalar_int_mode mode;
11525 {
11539 else
11547 }
11550 }
11552 /* Like recog, but we receive the address of a pointer to a new pattern.
11553 We try to match the rtx that the pointer points to.
11554 If that fails, we may try to modify or replace the pattern,
11555 storing the replacement into the same pointer object.
11557 Modifications include deletion or addition of CLOBBERs. If the
11558 instruction will still not match, we change ZERO_EXTEND and ZERO_EXTRACT
11559 to the equivalent AND and perhaps LSHIFTRT patterns, and try with that
11560 (and undo if that fails).
11562 PNOTES is a pointer to a location where any REG_UNUSED notes added for
11563 the CLOBBERs are placed.
11565 The value is the final insn code from the pattern ultimately matched,
11566 or -1. */
11568 static int
11570 {
11582 {
11585 {
11589 }
11590 }
11593 {
11598 }
11601 }
11602 \f
11603 /* Like gen_lowpart_general but for use by combine. In combine it
11604 is not possible to create any new pseudoregs. However, it is
11605 safe to create invalid memory addresses, because combine will
11606 try to recognize them and all they will do is make the combine
11607 attempt fail.
11609 If for some reason this cannot do its job, an rtx
11610 (clobber (const_int 0)) is returned.
11611 An insn containing that will not be recognized. */
11613 static rtx
11615 {
11619 rtx result;
11624 /* We can only support MODE being wider than a word if X is a
11625 constant integer or has a mode the same size. */
11630 /* X might be a paradoxical (subreg (mem)). In that case, gen_lowpart
11631 won't know what to do. So we will strip off the SUBREG here and
11632 process normally. */
11634 {
11637 /* For use in case we fall down into the address adjustments
11638 further below, we need to adjust the known mode and size of
11639 x; imode and isize, since we just adjusted x. */
11646 }
11654 {
11655 /* Refuse to work on a volatile memory ref or one with a mode-dependent
11656 address. */
11661 /* If we want to refer to something bigger than the original memref,
11662 generate a paradoxical subreg instead. That will force a reload
11663 of the original memref X. */
11669 }
11671 /* If X is a comparison operator, rewrite it in a new mode. This
11672 probably won't match, but may allow further simplifications. */
11676 /* If we couldn't simplify X any other way, just enclose it in a
11677 SUBREG. Normally, this SUBREG won't match, but some patterns may
11678 include an explicit SUBREG or we may simplify it further in combine. */
11679 else
11680 {
11681 rtx res;
11684 {
11689 }
11693 }
11695 fail:
11697 }
11698 \f
11699 /* Try to simplify a comparison between OP0 and a constant OP1,
11700 where CODE is the comparison code that will be tested, into a
11701 (CODE OP0 const0_rtx) form.
11703 The result is a possibly different comparison code to use.
11704 *POP1 may be updated. */
11706 static enum rtx_code
11709 {
11710 scalar_int_mode int_mode;
11713 /* Get the constant we are comparing against and turn off all bits
11714 not on in our mode. */
11718 /* If we are comparing against a constant power of two and the value
11719 being compared can only have that single bit nonzero (e.g., it was
11720 `and'ed with that bit), we can replace this with a comparison
11721 with zero. */
11730 {
11733 }
11735 /* Similarly, if we are comparing a value known to be either -1 or
11736 0 with -1, change it to the opposite comparison against zero. */
11742 {
11745 }
11747 /* Do some canonicalizations based on the comparison code. We prefer
11748 comparisons against zero and then prefer equality comparisons.
11749 If we can reduce the size of a constant, we will do that too. */
11751 {
11753 /* < C is equivalent to <= (C - 1) */
11755 {
11758 /* ... fall through to LE case below. */
11760 }
11761 else
11765 /* <= C is equivalent to < (C + 1); we do this for C < 0 */
11767 {
11770 }
11772 /* If we are doing a <= 0 comparison on a value known to have
11773 a zero sign bit, we can replace this with == 0. */
11784 /* >= C is equivalent to > (C - 1). */
11786 {
11789 /* ... fall through to GT below. */
11791 }
11792 else
11796 /* > C is equivalent to >= (C + 1); we do this for C < 0. */
11798 {
11801 }
11803 /* If we are doing a > 0 comparison on a value known to have
11804 a zero sign bit, we can replace this with != 0. */
11815 /* < C is equivalent to <= (C - 1). */
11817 {
11820 /* ... fall through ... */
11822 }
11823 /* (unsigned) < 0x80000000 is equivalent to >= 0. */
11828 {
11832 }
11833 else
11837 /* unsigned <= 0 is equivalent to == 0 */
11840 /* (unsigned) <= 0x7fffffff is equivalent to >= 0. */
11844 == ((HOST_WIDE_INT_1U
11846 {
11849 }
11853 /* >= C is equivalent to > (C - 1). */
11855 {
11858 /* ... fall through ... */
11860 }
11862 /* (unsigned) >= 0x80000000 is equivalent to < 0. */
11867 {
11871 }
11872 else
11876 /* unsigned > 0 is equivalent to != 0 */
11879 /* (unsigned) > 0x7fffffff is equivalent to < 0. */
11883 == (HOST_WIDE_INT_1U
11885 {
11888 }
11893 }
11897 }
11898 \f
11899 /* Simplify a comparison between *POP0 and *POP1 where CODE is the
11900 comparison code that will be tested.
11902 The result is a possibly different comparison code to use. *POP0 and
11903 *POP1 may be updated.
11905 It is possible that we might detect that a comparison is either always
11906 true or always false. However, we do not perform general constant
11907 folding in combine, so this knowledge isn't useful. Such tautologies
11908 should have been detected earlier. Hence we ignore all such cases. */
11910 static enum rtx_code
11912 {
11918 opt_scalar_int_mode tmode_iter;
11920 /* Try a few ways of applying the same transformation to both operands. */
11922 {
11923 /* The test below this one won't handle SIGN_EXTENDs on these machines,
11924 so check specially. */
11943 {
11946 }
11948 /* If both operands are the same constant shift, see if we can ignore the
11949 shift. We can if the shift is a rotate or if the bits shifted out of
11950 this shift are known to be zero for both inputs and if the type of
11951 comparison is compatible with the shift. */
11964 {
11977 else
11979 }
11981 /* If both operands are AND's of a paradoxical SUBREG by constant, the
11982 SUBREGs are of the same mode, and, in both cases, the AND would
11983 be redundant if the comparison was done in the narrower mode,
11984 do the comparison in the narrower mode (e.g., we are AND'ing with 1
11985 and the operand's possibly nonzero bits are 0xffffff01; in that case
11986 if we only care about QImode, we don't need the AND). This case
11987 occurs if the output mode of an scc insn is not SImode and
11988 STORE_FLAG_VALUE == 1 (e.g., the 386).
11990 Similarly, check for a case where the AND's are ZERO_EXTEND
11991 operations from some narrower mode even though a SUBREG is not
11992 present. */
11997 {
12013 {
12017 /* The resulting comparison is always unsigned since we masked
12018 off the original sign bit. */
12022 }
12028 {
12034 }
12038 }
12040 /* If both operands are NOT, we can strip off the outer operation
12041 and adjust the comparison code for swapped operands; similarly for
12042 NEG, except that this must be an equality comparison. */
12048 else
12050 }
12052 /* If the first operand is a constant, swap the operands and adjust the
12053 comparison code appropriately, but don't do this if the second operand
12054 is already a constant integer. */
12056 {
12059 }
12061 /* We now enter a loop during which we will try to simplify the comparison.
12062 For the most part, we only are concerned with comparisons with zero,
12063 but some things may really be comparisons with zero but not start
12064 out looking that way. */
12067 {
12069 scalar_int_mode int_mode;
12073 HOST_WIDE_INT const_op;
12075 /* We only want to handle integral modes. This catches VOIDmode,
12076 CCmode, and the floating-point modes. An exception is that we
12077 can handle VOIDmode if OP0 is a COMPARE or a comparison
12078 operation. */
12085 /* Try to simplify the compare to constant, possibly changing the
12086 comparison op, and/or changing op1 to zero. */
12090 /* Compute some predicates to simplify code below. */
12097 /* If this is a sign bit comparison and we can do arithmetic in
12098 MODE, say that we will only be needing the sign bit of OP0. */
12103 HOST_WIDE_INT_1U
12108 {
12109 /* We can't do anything if OP0 is a condition code value, rather
12110 than an actual data value. */
12116 /* Get the two operands being compared. */
12119 else
12122 /* Check for the cases where we simply want the result of the
12123 earlier test or the opposite of that result. */
12127 {
12131 else
12135 {
12140 }
12141 }
12143 }
12149 /* Now try cases based on the opcode of OP0. If none of the cases
12150 does a "continue", we exit this loop immediately after the
12151 switch. */
12156 {
12158 /* If we are extracting a single bit from a variable position in
12159 a constant that has only a single bit set and are comparing it
12160 with zero, we can convert this into an equality comparison
12161 between the position and the location of the single bit. */
12162 /* Except we can't if SHIFT_COUNT_TRUNCATED is set, since we might
12163 have already reduced the shift count modulo the word size. */
12169 {
12177 /* Result is nonzero iff shift count is equal to I. */
12180 }
12182 /* fall through */
12187 {
12190 }
12194 /* If testing for equality, we can take the NOT of the constant. */
12197 {
12201 }
12203 /* If just looking at the sign bit, reverse the sense of the
12204 comparison. */
12206 {
12210 }
12214 /* If testing for equality, we can take the NEG of the constant. */
12217 {
12221 }
12223 /* The remaining cases only apply to comparisons with zero. */
12227 /* When X is ABS or is known positive,
12228 (neg X) is < 0 if and only if X != 0. */
12236 {
12240 }
12242 /* If we have NEG of something whose two high-order bits are the
12243 same, we know that "(-a) < 0" is equivalent to "a > 0". */
12245 {
12249 }
12253 /* If we are testing equality and our count is a constant, we
12254 can perform the inverse operation on our RHS. */
12258 {
12262 }
12264 /* If we are doing a < 0 or >= 0 comparison, it means we are testing
12265 a particular bit. Convert it to an AND of a constant of that
12266 bit. This will be converted into a ZERO_EXTRACT. */
12270 {
12272 (HOST_WIDE_INT_1U
12277 }
12279 /* Fall through. */
12282 /* ABS is ignorable inside an equality comparison with zero. */
12284 {
12287 }
12291 /* Can simplify (compare (zero/sign_extend FOO) CONST) to
12292 (compare FOO CONST) if CONST fits in FOO's mode and we
12293 are either testing inequality or have an unsigned
12294 comparison with ZERO_EXTEND or a signed comparison with
12295 SIGN_EXTEND. But don't do it if we don't have a compare
12296 insn of the given mode, since we'd have to revert it
12297 later on, and then we wouldn't know whether to sign- or
12298 zero-extend. */
12300 && ! unsigned_comparison_p
12304 {
12307 }
12311 /* Check for the case where we are comparing A - C1 with C2, that is
12313 (subreg:MODE (plus (A) (-C1))) op (C2)
12315 with C1 a constant, and try to lift the SUBREG, i.e. to do the
12316 comparison in the wider mode. One of the following two conditions
12317 must be true in order for this to be valid:
12319 1. The mode extension results in the same bit pattern being added
12320 on both sides and the comparison is equality or unsigned. As
12321 C2 has been truncated to fit in MODE, the pattern can only be
12322 all 0s or all 1s.
12324 2. The mode extension results in the sign bit being copied on
12325 each side.
12327 The difficulty here is that we have predicates for A but not for
12328 (A - C1) so we need to check that C1 is within proper bounds so
12329 as to perturbate A as little as possible. */
12338 {
12346 /* (A - C1) zero-extends if it is positive and sign-extends
12347 if it is negative, C2 both zero- and sign-extends. */
12351 /* (A - C1) sign-extends if it is positive and 1-extends
12352 if it is negative, C2 both sign- and 1-extends. */
12359 /* (A - C1) always sign-extends, like C2. */
12363 {
12366 }
12367 }
12369 /* If the inner mode is narrower and we are extracting the low part,
12370 we can treat the SUBREG as if it were a ZERO_EXTEND. */
12372 ;
12381 {
12382 /* Remove outer subregs that don't do anything. */
12387 {
12391 }
12393 }
12394 else
12397 /* FALLTHROUGH */
12406 {
12409 }
12413 /* (eq (plus X A) B) -> (eq X (minus B A)). We can only do
12414 this for equality comparisons due to pathological cases involving
12415 overflows. */
12419 {
12423 }
12425 /* (plus (abs X) (const_int -1)) is < 0 if and only if X == 0. */
12428 {
12432 }
12436 /* We used to optimize signed comparisons against zero, but that
12437 was incorrect. Unsigned comparisons against zero (GTU, LEU)
12438 arrive here as equality comparisons, or (GEU, LTU) are
12439 optimized away. No need to special-case them. */
12441 /* (eq (minus A B) C) -> (eq A (plus B C)) or
12442 (eq B (minus A C)), whichever simplifies. We can only do
12443 this for equality comparisons due to pathological cases involving
12444 overflows. */
12448 {
12452 }
12457 {
12461 }
12463 /* The sign bit of (minus (ashiftrt X C) X), where C is the number
12464 of bits in X minus 1, is one iff X > 0. */
12469 {
12473 }
12477 /* (eq (xor A B) C) -> (eq A (xor B C)). This is a simplification
12478 if C is zero or B is a constant. */
12482 {
12486 }
12491 /* The sign bit of (ior (plus X (const_int -1)) X) is nonzero
12492 iff X <= 0. */
12496 {
12500 }
12504 /* Convert (and (xshift 1 X) Y) to (and (lshiftrt Y X) 1). This
12505 will be converted to a ZERO_EXTRACT later. */
12509 {
12514 }
12516 /* If we are comparing (and (lshiftrt X C1) C2) for equality with
12517 zero and X is a comparison and C1 and C2 describe only bits set
12518 in STORE_FLAG_VALUE, we can compare with X. */
12526 {
12533 {
12536 }
12537 }
12539 /* If we are doing an equality comparison of an AND of a bit equal
12540 to the sign bit, replace this with a LT or GE comparison of
12541 the underlying value. */
12548 {
12552 }
12554 /* If this AND operation is really a ZERO_EXTEND from a narrower
12555 mode, the constant fits within that mode, and this is either an
12556 equality or unsigned comparison, try to do this comparison in
12557 the narrower mode.
12559 Note that in:
12561 (ne:DI (and:DI (reg:DI 4) (const_int 0xffffffff)) (const_int 0))
12562 -> (ne:DI (reg:SI 4) (const_int 0))
12564 unless TARGET_TRULY_NOOP_TRUNCATION allows it or the register is
12565 known to hold a value of the required mode the
12566 transformation is invalid. */
12574 {
12577 }
12579 /* If this is (and:M1 (subreg:M1 X:M2 0) (const_int C1)) where C1
12580 fits in both M1 and M2 and the SUBREG is either paradoxical
12581 or represents the low part, permute the SUBREG and the AND
12582 and try again. */
12585 {
12587 /* Require an integral mode, to avoid creating something like
12588 (AND:SF ...). */
12591 /* It is unsafe to commute the AND into the SUBREG if the
12592 SUBREG is paradoxical and WORD_REGISTER_OPERATIONS is
12593 not defined. As originally written the upper bits
12594 have a defined value due to the AND operation.
12595 However, if we commute the AND inside the SUBREG then
12596 they no longer have defined values and the meaning of
12597 the code has been changed.
12598 Also C1 should not change value in the smaller mode,
12599 see PR67028 (a positive C1 can become negative in the
12600 smaller mode, so that the AND does no longer mask the
12601 upper bits). */
12602 && ((WORD_REGISTER_OPERATIONS
12614 {
12620 }
12621 }
12623 /* Convert (ne (and (not X) 1) 0) to (eq (and X 1) 0). */
12627 {
12632 }
12634 /* Convert (ne (and (lshiftrt (not X)) 1) 0) to
12635 (eq (and (lshiftrt X) 1) 0).
12636 Also handle the case where (not X) is expressed using xor. */
12640 {
12650 == HOST_WIDE_INT_1U
12652 {
12653 op0
12658 }
12659 }
12663 /* If we have (compare (ashift FOO N) (const_int C)) and
12664 the high order N bits of FOO (N+1 if an inequality comparison)
12665 are known to be zero, we can do this by comparing FOO with C
12666 shifted right N bits so long as the low-order N bits of C are
12667 zero. */
12679 {
12680 /* We must perform a logical shift, not an arithmetic one,
12681 as we want the top N bits of C to be zero. */
12688 }
12690 /* If we are doing a sign bit comparison, it means we are testing
12691 a particular bit. Convert it to the appropriate AND. */
12694 {
12696 (HOST_WIDE_INT_1U
12701 }
12703 /* If this an equality comparison with zero and we are shifting
12704 the low bit to the sign bit, we can convert this to an AND of the
12705 low-order bit. */
12709 {
12712 }
12716 /* If this is an equality comparison with zero, we can do this
12717 as a logical shift, which might be much simpler. */
12720 {
12725 }
12727 /* If OP0 is a sign extension and CODE is not an unsigned comparison,
12728 do the comparison in a narrower mode. */
12738 {
12741 }
12743 /* Likewise if OP0 is a PLUS of a sign extension with a
12744 constant, which is usually represented with the PLUS
12745 between the shifts. */
12757 {
12765 new_const);
12767 }
12769 /* FALLTHROUGH */
12771 /* If we have (compare (xshiftrt FOO N) (const_int C)) and
12772 the low order N bits of FOO are known to be zero, we can do this
12773 by comparing FOO with C shifted left N bits so long as no
12774 overflow occurs. Even if the low order N bits of FOO aren't known
12775 to be zero, if the comparison is >= or < we can use the same
12776 optimization and for > or <= by setting all the low
12777 order N bits in the comparison constant. */
12788 {
12789 unsigned HOST_WIDE_INT low_bits
12791 & ((HOST_WIDE_INT_1U
12794 {
12795 /* If the shift was logical, then we must make the condition
12796 unsigned. */
12805 const_op
12810 }
12811 }
12813 /* If we are using this shift to extract just the sign bit, we
12814 can replace this with an LT or GE comparison. */
12819 {
12823 }
12828 }
12831 }
12833 /* Now make any compound operations involved in this comparison. Then,
12834 check for an outmost SUBREG on OP0 that is not doing anything or is
12835 paradoxical. The latter transformation must only be performed when
12836 it is known that the "extra" bits will be the same in op0 and op1 or
12837 that they don't matter. There are three cases to consider:
12839 1. SUBREG_REG (op0) is a register. In this case the bits are don't
12840 care bits and we can assume they have any convenient value. So
12841 making the transformation is safe.
12843 2. SUBREG_REG (op0) is a memory and LOAD_EXTEND_OP is UNKNOWN.
12844 In this case the upper bits of op0 are undefined. We should not make
12845 the simplification in that case as we do not know the contents of
12846 those bits.
12848 3. SUBREG_REG (op0) is a memory and LOAD_EXTEND_OP is not UNKNOWN.
12849 In that case we know those bits are zeros or ones. We must also be
12850 sure that they are the same as the upper bits of op1.
12852 We can never remove a SUBREG for a non-equality comparison because
12853 the sign bit is in a different place in the underlying object. */
12866 {
12868 {
12869 /* For paradoxical subregs, allow case 1 as above. Case 3 isn't
12870 implemented. */
12872 {
12875 }
12876 }
12880 {
12885 }
12886 }
12888 /* We now do the opposite procedure: Some machines don't have compare
12889 insns in all modes. If OP0's mode is an integer mode smaller than a
12890 word and we can't do a compare in that mode, see if there is a larger
12891 mode for which we can do the compare. There are a number of cases in
12892 which we can use the wider mode. */
12898 {
12903 {
12906 /* If this is a test for negative, we can make an explicit
12907 test of the sign bit. Test this first so we can use
12908 a paradoxical subreg to extend OP0. */
12912 {
12913 unsigned HOST_WIDE_INT sign
12920 }
12922 /* If the only nonzero bits in OP0 and OP1 are those in the
12923 narrower mode and this is an equality or unsigned comparison,
12924 we can use the wider mode. Similarly for sign-extended
12925 values, in which case it is true for all comparisons. */
12942 {
12943 /* If OP0 is an AND and we don't have an AND in MODE either,
12944 make a new AND in the proper mode. */
12952 else
12953 {
12955 {
12960 }
12961 else
12962 {
12967 }
12969 }
12970 }
12971 }
12972 }
12974 /* We may have changed the comparison operands. Re-canonicalize. */
12976 {
12979 }
12981 /* If this machine only supports a subset of valid comparisons, see if we
12982 can convert an unsupported one into a supported one. */
12989 }
12990 \f
12991 /* Utility function for record_value_for_reg. Count number of
12992 rtxs in X. */
12993 static int
12995 {
13002 {
13022 }
13033 }
13034 \f
13035 /* Utility function for following routine. Called when X is part of a value
13036 being stored into last_set_value. Sets last_set_table_tick
13037 for each register mentioned. Similar to mention_regs in cse.c */
13039 static void
13041 {
13047 {
13053 {
13056 }
13059 }
13063 {
13064 /* Check for identical subexpressions. If x contains
13065 identical subexpression we only have to traverse one of
13066 them. */
13068 {
13069 /* Note that at this point x1 has already been
13070 processed. */
13074 /* If x0 and x1 are identical then there is no need to
13075 process x0. */
13079 /* If x0 is identical to a subexpression of x1 then while
13080 processing x1, x0 has already been processed. Thus we
13081 are done with x. */
13086 /* If x1 is identical to a subexpression of x0 then we
13087 still have to process the rest of x0. */
13090 {
13093 }
13094 }
13097 }
13101 }
13103 /* Record that REG is set to VALUE in insn INSN. If VALUE is zero, we
13104 are saying that the register is clobbered and we no longer know its
13105 value. If INSN is zero, don't update reg_stat[].last_set; this is
13106 only permitted with VALUE also zero and is used to invalidate the
13107 register. */
13109 static void
13111 {
13117 /* If VALUE contains REG and we have a previous value for REG, substitute
13118 the previous value. */
13120 {
13121 rtx tem;
13123 /* Set things up so get_last_value is allowed to see anything set up to
13124 our insn. */
13128 /* If TEM is simply a binary operation with two CLOBBERs as operands,
13129 it isn't going to be useful and will take a lot of time to process,
13130 so just use the CLOBBER. */
13133 {
13139 {
13140 /* If there are two or more occurrences of REG in VALUE,
13141 prevent the value from growing too much. */
13144 }
13147 }
13148 }
13150 /* For each register modified, show we don't know its value, that
13151 we don't know about its bitwise content, that its value has been
13152 updated, and that we don't know the location of the death of the
13153 register. */
13155 {
13167 }
13169 /* Mark registers that are being referenced in this value. */
13173 /* Now update the status of each register being set.
13174 If someone is using this register in this block, set this register
13175 to invalid since we will get confused between the two lives in this
13176 basic block. This makes using this register always invalid. In cse, we
13177 scan the table to invalidate all entries using this register, but this
13178 is too much work for us. */
13181 {
13187 else
13189 }
13191 /* The value being assigned might refer to X (like in "x++;"). In that
13192 case, we must replace it with (clobber (const_int 0)) to prevent
13193 infinite loops. */
13196 {
13200 }
13202 /* For the main register being modified, update the value, the mode, the
13203 nonzero bits, and the number of sign bit copies. */
13208 {
13216 rsp->last_set_sign_bit_copies
13218 }
13219 }
13221 /* Called via note_stores from record_dead_and_set_regs to handle one
13222 SET or CLOBBER in an insn. DATA is the instruction in which the
13223 set is occurring. */
13225 static void
13227 {
13234 {
13238 }
13241 {
13242 /* If we are setting the whole register, we know its value. Otherwise
13243 show that we don't know the value. We can handle SUBREG in
13244 some cases. */
13255 else
13257 }
13259 /* Ignore pushes, they clobber nothing. */
13262 }
13264 /* Update the records of when each REG was most recently set or killed
13265 for the things done by INSN. This is the last thing done in processing
13266 INSN in the combiner loop.
13268 We update reg_stat[], in particular fields last_set, last_set_value,
13269 last_set_mode, last_set_nonzero_bits, last_set_sign_bit_copies,
13270 last_death, and also the similar information mem_last_set (which insn
13271 most recently modified memory) and last_call_luid (which insn was the
13272 most recent subroutine call). */
13274 static void
13276 {
13277 rtx link;
13281 {
13284 {
13289 {
13294 }
13295 }
13298 }
13301 {
13302 hard_reg_set_iterator hrsi;
13304 {
13316 }
13320 /* We can't combine into a call pattern. Remember, though, that
13321 the return value register is set at this LUID. We could
13322 still replace a register with the return value from the
13323 wrong subroutine call! */
13325 }
13326 else
13328 }
13330 /* If a SUBREG has the promoted bit set, it is in fact a property of the
13331 register present in the SUBREG, so for each such SUBREG go back and
13332 adjust nonzero and sign bit information of the registers that are
13333 known to have some zero/sign bits set.
13335 This is needed because when combine blows the SUBREGs away, the
13336 information on zero/sign bits is lost and further combines can be
13337 missed because of that. */
13339 static void
13341 {
13343 rtx set;
13351 {
13360 {
13363 }
13367 {
13370 }
13373 {
13376 }
13377 else
13379 }
13380 }
13382 /* Check if X, a register, is known to contain a value already
13383 truncated to MODE. In this case we can use a subreg to refer to
13384 the truncated value even though in the generic case we would need
13385 an explicit truncation. */
13387 static bool
13389 {
13401 }
13403 /* If X is a hard reg or a subreg record the mode that the register is
13404 accessed in. For non-TARGET_TRULY_NOOP_TRUNCATION targets we might be
13405 able to turn a truncate into a subreg using this information. Return true
13406 if traversing X is complete. */
13408 static bool
13410 {
13411 machine_mode truncated_mode;
13415 {
13427 }
13428 /* ??? For hard-regs we now record everything. We might be able to
13429 optimize this using last_set_mode. */
13432 else
13439 {
13442 }
13445 }
13447 /* Callback for note_uses. Find hardregs and subregs of pseudos and
13448 the modes they are used in. This can help truning TRUNCATEs into
13449 SUBREGs. */
13451 static void
13453 {
13458 }
13460 /* Scan X for promoted SUBREGs. For each one found,
13461 note what it implies to the registers used in it. */
13463 static void
13465 {
13470 else
13471 {
13477 {
13487 }
13488 }
13489 }
13490 \f
13491 /* Verify that all the registers and memory references mentioned in *LOC are
13492 still valid. *LOC was part of a value set in INSN when label_tick was
13493 equal to TICK. Return 0 if some are not. If REPLACE is nonzero, replace
13494 the invalid references with (clobber (const_int 0)) and return 1. This
13495 replacement is useful because we often can get useful information about
13496 the form of a value (e.g., if it was produced by a shift that always
13497 produces -1 or 0) even though we don't know exactly what registers it
13498 was produced from. */
13500 static int
13502 {
13509 {
13515 {
13518 /* If this is a pseudo-register that was only set once and not
13519 live at the beginning of the function, it is always valid. */
13523 && (!REGNO_REG_SET_P
13525 regno)))
13527 {
13531 }
13532 }
13535 }
13536 /* If this is a memory reference, make sure that there were no stores after
13537 it that might have clobbered the value. We don't have alias info, so we
13538 assume any store invalidates it. Moreover, we only have local UIDs, so
13539 we also assume that there were stores in the intervening basic blocks. */
13542 {
13546 }
13549 {
13551 {
13552 /* Check for identical subexpressions. If x contains
13553 identical subexpression we only have to traverse one of
13554 them. */
13556 {
13557 /* Note that at this point x0 has already been checked
13558 and found valid. */
13562 /* If x0 and x1 are identical then x is also valid. */
13566 /* If x1 is identical to a subexpression of x0 then
13567 while checking x0, x1 has already been checked. Thus
13568 it is valid and so as x. */
13573 /* If x0 is identical to a subexpression of x1 then x is
13574 valid iff the rest of x1 is valid. */
13577 return
13581 }
13586 }
13592 }
13594 /* If we haven't found a reason for it to be invalid, it is valid. */
13596 }
13598 /* Get the last value assigned to X, if known. Some registers
13599 in the value may be replaced with (clobber (const_int 0)) if their value
13600 is known longer known reliably. */
13602 static rtx
13604 {
13606 rtx value;
13609 /* If this is a non-paradoxical SUBREG, get the value of its operand and
13610 then convert it to the desired mode. If this is a paradoxical SUBREG,
13611 we cannot predict what values the "extra" bits might have. */
13625 /* If we don't have a value, or if it isn't for this basic block and
13626 it's either a hard register, set more than once, or it's a live
13627 at the beginning of the function, return 0.
13629 Because if it's not live at the beginning of the function then the reg
13630 is always set before being used (is never used without being set).
13631 And, if it's set only once, and it's always set before use, then all
13632 uses must have the same last value, even if it's not from this basic
13633 block. */
13640 || REGNO_REG_SET_P
13644 /* If the value was set in a later insn than the ones we are processing,
13645 we can't use it even if the register was only set once. */
13650 /* If fewer bits were set than what we are asked for now, we cannot use
13651 the value. */
13656 /* If the value has all its registers valid, return it. */
13660 /* Otherwise, make a copy and replace any invalid register with
13661 (clobber (const_int 0)). If that fails for some reason, return 0. */
13668 }
13669 \f
13670 /* Define three variables used for communication between the following
13671 routines. */
13676 /* Function called via note_stores from reg_dead_at_p.
13678 If DEST is within [reg_dead_regno, reg_dead_endregno), set
13679 reg_dead_flag to 1 if X is a CLOBBER and to -1 it is a SET. */
13681 static void
13683 {
13693 }
13695 /* Return nonzero if REG is known to be dead at INSN.
13697 We scan backwards from INSN. If we hit a REG_DEAD note or a CLOBBER
13698 referencing REG, it is dead. If we hit a SET referencing REG, it is
13699 live. Otherwise, see if it is live or dead at the start of the basic
13700 block we are in. Hard regs marked as being live in NEWPAT_USED_REGS
13701 must be assumed to be always live. */
13703 static int
13705 {
13706 basic_block block;
13709 /* Set variables for reg_dead_at_p_1. */
13715 /* Check that reg isn't mentioned in NEWPAT_USED_REGS. For fixed registers
13716 we allow the machine description to decide whether use-and-clobber
13717 patterns are OK. */
13719 {
13723 }
13725 /* Scan backwards until we find a REG_DEAD note, SET, CLOBBER, or
13726 beginning of basic block. */
13729 {
13731 {
13741 }
13747 }
13749 /* Look at live-in sets for the basic block that we were in. */
13755 }
13756 \f
13757 /* Note hard registers in X that are used. */
13759 static void
13761 {
13767 {
13771 CASE_CONST_ANY:
13776 /* CC0 must die in the insn after it is set, so we don't need to take
13777 special note of it here. */
13782 /* If we are clobbering a MEM, mark any hard registers inside the
13783 address as used. */
13790 /* A hard reg in a wide mode may really be multiple registers.
13791 If so, mark all of them just like the first. */
13793 {
13794 /* None of this applies to the stack, frame or arg pointers. */
13796 || (!HARD_FRAME_POINTER_IS_FRAME_POINTER
13804 }
13808 {
13809 /* If setting a MEM, or a SUBREG of a MEM, then note any hard regs in
13810 the address. */
13822 }
13827 }
13829 /* Recursively scan the operands of this expression. */
13831 {
13835 {
13839 {
13844 }
13845 }
13846 }
13847 }
13848 \f
13849 /* Remove register number REGNO from the dead registers list of INSN.
13851 Return the note used to record the death, if there was one. */
13853 rtx
13855 {
13862 }
13864 /* For each register (hardware or pseudo) used within expression X, if its
13865 death is in an instruction with luid between FROM_LUID (inclusive) and
13866 TO_INSN (exclusive), put a REG_DEAD note for that register in the
13867 list headed by PNOTES.
13869 That said, don't move registers killed by maybe_kill_insn.
13871 This is done when X is being merged by combination into TO_INSN. These
13872 notes will then be distributed as needed. */
13874 static void
13877 {
13883 {
13887 /* If we do not know where the register died, it may still die between
13888 FROM_LUID and TO_INSN. If so, find it. This is PR83304. */
13890 {
13895 {
13897 {
13901 }
13904 }
13905 }
13907 /* Don't move the register if it gets killed in between from and to. */
13916 {
13919 /* It is possible for the call above to return 0. This can occur
13920 when last_death points to I2 or I1 that we combined with.
13921 In that case make a new note.
13923 We must also check for the case where X is a hard register
13924 and NOTE is a death note for a range of hard registers
13925 including X. In that case, we must put REG_DEAD notes for
13926 the remaining registers in place of NOTE. */
13930 {
13939 }
13941 /* If we didn't find any note, or if we found a REG_DEAD note that
13942 covers only part of the given reg, and we have a multi-reg hard
13943 register, then to be safe we must check for REG_DEAD notes
13944 for each register other than the first. They could have
13945 their own REG_DEAD notes lying around. */
13952 {
13959 else
13965 }
13968 {
13971 }
13972 else
13974 }
13977 }
13980 {
13985 /* In the case of a ZERO_EXTRACT, a STRICT_LOW_PART, or a SUBREG
13986 that accesses one word of a multi-word item, some
13987 piece of everything register in the expression is used by
13988 this insn, so remove any old death. */
13989 /* ??? So why do we test for equality of the sizes? */
13995 {
13998 }
14000 /* If this is some other SUBREG, we know it replaces the entire
14001 value, so use that as the destination. */
14005 /* If this is a MEM, adjust deaths of anything used in the address.
14006 For a REG (the only other possibility), the entire value is
14007 being replaced so the old value is not used in this insn. */
14013 }
14022 {
14024 {
14029 }
14032 }
14033 }
14034 \f
14035 /* Return 1 if X is the target of a bit-field assignment in BODY, the
14036 pattern of an insn. X must be a REG. */
14038 static int
14040 {
14044 {
14046 rtx target;
14053 else
14070 }
14078 }
14079 \f
14080 /* Given a chain of REG_NOTES originally from FROM_INSN, try to place them
14081 as appropriate. I3 and I2 are the insns resulting from the combination
14082 insns including FROM (I2 may be zero).
14084 ELIM_I2 and ELIM_I1 are either zero or registers that we know will
14085 not need REG_DEAD notes because they are being substituted for. This
14086 saves searching in the most common cases.
14088 Each note in the list is either ignored or placed on some insns, depending
14089 on the type of note. */
14091 static void
14094 {
14096 rtx tem_note;
14100 {
14105 {
14108 /* Doesn't matter much where we put this, as long as it's somewhere.
14109 It is preferable to keep these notes on branches, which is most
14110 likely to be i3. */
14117 else
14118 {
14121 }
14125 /* These notes must remain with the call or trapping instruction. */
14130 else
14131 {
14137 /* ??? Otherwise assume we've combined things such that we
14138 can now prove that the instructions can't trap. Drop the
14139 note in this case. */
14140 }
14144 /* ??? How to distribute between i3-i1. Assume i3 contains the
14145 entire adjustment. Assert i3 contains at least some adjust. */
14147 {
14149 /* fixup_args_size_notes looks at REG_NORETURN note,
14150 so ensure the note is placed there first. */
14152 {
14156 {
14162 }
14163 }
14165 /* emit_call_1 adds for !ACCUMULATE_OUTGOING_ARGS
14166 REG_ARGS_SIZE note to all noreturn calls, allow that here. */
14169 && !ACCUMULATE_OUTGOING_ARGS
14171 }
14179 /* These notes must remain with the call. It should not be
14180 possible for both I2 and I3 to be a call. */
14183 else
14184 {
14187 }
14191 /* Any clobbers for i3 may still exist, and so we must process
14192 REG_UNUSED notes from that insn.
14194 Any clobbers from i2 or i1 can only exist if they were added by
14195 recog_for_combine. In that case, recog_for_combine created the
14196 necessary REG_UNUSED notes. Trying to keep any original
14197 REG_UNUSED notes from these insns can cause incorrect output
14198 if it is for the same register as the original i3 dest.
14199 In that case, we will notice that the register is set in i3,
14200 and then add a REG_UNUSED note for the destination of i3, which
14201 is wrong. However, it is possible to have REG_UNUSED notes from
14202 i2 or i1 for register which were both used and clobbered, so
14203 we keep notes from i2 or i1 if they will turn into REG_DEAD
14204 notes. */
14206 /* If this register is set or clobbered in I3, put the note there
14207 unless there is one already. */
14209 {
14217 }
14218 /* Otherwise, if this register is used by I3, then this register
14219 now dies here, so we must put a REG_DEAD note here unless there
14220 is one already. */
14226 {
14229 }
14231 /* A SET or CLOBBER of the REG_UNUSED reg has been removed,
14232 but we can't tell which at this point. We must reset any
14233 expectations we had about the value that was previously
14234 stored in the reg. ??? Ideally, we'd adjust REG_N_SETS
14235 and, if appropriate, restore its previous value, but we
14236 don't have enough information for that at this point. */
14237 else
14238 {
14241 /* Otherwise, if this register is now referenced in i2
14242 then the register used to be modified in one of the
14243 original insns. If it was i3 (say, in an unused
14244 parallel), it's now completely gone, so the note can
14245 be discarded. But if it was modified in i2, i1 or i0
14246 and we still reference it in i2, then we're
14247 referencing the previous value, and since the
14248 register was modified and REG_UNUSED, we know that
14249 the previous value is now dead. So, if we only
14250 reference the register in i2, we change the note to
14251 REG_DEAD, to reflect the previous value. However, if
14252 we're also setting or clobbering the register as
14253 scratch, we know (because the register was not
14254 referenced in i3) that it's unused, just as it was
14255 unused before, and we place the note in i2. */
14258 {
14267 }
14268 }
14275 /* These notes say something about results of an insn. We can
14276 only support them if they used to be on I3 in which case they
14277 remain on I3. Otherwise they are ignored.
14279 If the note refers to an expression that is not a constant, we
14280 must also ignore the note since we cannot tell whether the
14281 equivalence is still true. It might be possible to do
14282 slightly better than this (we only have a problem if I2DEST
14283 or I1DEST is present in the expression), but it doesn't
14284 seem worth the trouble. */
14292 /* These notes say something about how a register is used. They must
14293 be present on any use of the register in I2 or I3. */
14298 {
14301 else
14303 }
14308 /* This can show up in several ways -- either directly in the
14309 pattern, or hidden off in the constant pool with (or without?)
14310 a REG_EQUAL note. */
14311 /* ??? Ignore the without-reg_equal-note problem for now. */
14323 {
14326 else
14328 }
14330 /* For REG_LABEL_TARGET on a JUMP_P, we prefer to put the note
14331 as a JUMP_LABEL or decrement LABEL_NUSES if it's already
14332 there. */
14337 {
14344 }
14350 {
14358 }
14362 /* This note says something about the value of a register prior
14363 to the execution of an insn. It is too much trouble to see
14364 if the note is still correct in all situations. It is better
14365 to simply delete it. */
14369 /* If we replaced the right hand side of FROM_INSN with a
14370 REG_EQUAL note, the original use of the dying register
14371 will not have been combined into I3 and I2. In such cases,
14372 FROM_INSN is guaranteed to be the first of the combined
14373 instructions, so we simply need to search back before
14374 FROM_INSN for the previous use or set of this register,
14375 then alter the notes there appropriately.
14377 If the register is used as an input in I3, it dies there.
14378 Similarly for I2, if it is nonzero and adjacent to I3.
14380 If the register is not used as an input in either I3 or I2
14381 and it is not one of the registers we were supposed to eliminate,
14382 there are two possibilities. We might have a non-adjacent I2
14383 or we might have somehow eliminated an additional register
14384 from a computation. For example, we might have had A & B where
14385 we discover that B will always be zero. In this case we will
14386 eliminate the reference to A.
14388 In both cases, we must search to see if we can find a previous
14389 use of A and put the death note there. */
14395 else
14396 {
14402 {
14403 /* If the new I2 sets the same register that is marked
14404 dead in the note, we do not in general know where to
14405 put the note. One important case we _can_ handle is
14406 when the note comes from I3. */
14409 else
14411 }
14418 && !(i2mod
14420 i2mod_old_rhs)))
14425 }
14428 {
14432 {
14434 {
14438 }
14440 /* If the register is being set at TEM_INSN, see if that is all
14441 TEM_INSN is doing. If so, delete TEM_INSN. Otherwise, make this
14442 into a REG_UNUSED note instead. Don't delete sets to
14443 global register vars. */
14447 {
14458 ;
14460 /* Verify that it was the set, and not a clobber that
14461 modified the register.
14463 CC0 targets must be careful to maintain setter/user
14464 pairs. If we cannot delete the setter due to side
14465 effects, mark the user with an UNUSED note instead
14466 of deleting it. */
14470 && (!HAVE_cc0
14474 {
14475 /* Move the notes and links of TEM_INSN elsewhere.
14476 This might delete other dead insns recursively.
14477 First set the pattern to something that won't use
14478 any register. */
14497 /* Delete the setter too. */
14499 {
14512 }
14513 }
14514 else
14515 {
14518 /* If there isn't already a REG_UNUSED note, put one
14519 here. Do not place a REG_DEAD note, even if
14520 the register is also used here; that would not
14521 match the algorithm used in lifetime analysis
14522 and can cause the consistency check in the
14523 scheduler to fail. */
14528 }
14529 }
14533 {
14536 /* If we are doing a 3->2 combination, and we have a
14537 register which formerly died in i3 and was not used
14538 by i2, which now no longer dies in i3 and is used in
14539 i2 but does not die in i2, and place is between i2
14540 and i3, then we may need to move a link from place to
14541 i2. */
14543 && from_insn
14546 {
14550 }
14552 }
14556 }
14558 }
14560 /* If the register is set or already dead at PLACE, we needn't do
14561 anything with this note if it is still a REG_DEAD note.
14562 We check here if it is set at all, not if is it totally replaced,
14563 which is what `dead_or_set_p' checks, so also check for it being
14564 set partially. */
14567 {
14573 {
14574 /* Unless the register previously died in PLACE, clear
14575 last_death. [I no longer understand why this is
14576 being done.] */
14580 }
14581 else
14584 /* If this is a death note for a hard reg that is occupying
14585 multiple registers, ensure that we are still using all
14586 parts of the object. If we find a piece of the object
14587 that is unused, we must arrange for an appropriate REG_DEAD
14588 note to be added for it. However, we can't just emit a USE
14589 and tag the note to it, since the register might actually
14590 be dead; so we recourse, and the recursive call then finds
14591 the previous insn that used this register. */
14594 {
14603 {
14606 }
14609 {
14610 /* Put only REG_DEAD notes for pieces that are
14611 not already dead or set. */
14615 {
14622 {
14624 NULL_RTX);
14628 NULL_RTX);
14629 }
14634 {
14636 {
14640 }
14644 {
14647 }
14648 }
14649 }
14652 }
14653 }
14654 }
14658 /* Any other notes should not be present at this point in the
14659 compilation. */
14661 }
14664 {
14668 /* Set added_notes_insn to the earliest insn we added a note to. */
14672 }
14675 {
14678 /* Set added_notes_insn to the earliest insn we added a note to. */
14682 }
14683 }
14684 }
14685 \f
14686 /* Similarly to above, distribute the LOG_LINKS that used to be present on
14687 I3, I2, and I1 to new locations. This is also called to add a link
14688 pointing at I3 when I3's destination is changed. */
14690 static void
14692 {
14696 {
14703 /* If the insn that this link points to is a NOTE, ignore it. */
14712 {
14715 {
14731 }
14734 }
14735 else
14745 /* A LOG_LINK is defined as being placed on the first insn that uses
14746 a register and points to the insn that sets the register. Start
14747 searching at the next insn after the target of the link and stop
14748 when we reach a set of the register or the end of the basic block.
14750 Note that this correctly handles the link that used to point from
14751 I3 to I2. Also note that not much searching is typically done here
14752 since most links don't point very far away. */
14761 {
14765 }
14768 {
14771 }
14775 /* If we found a place to put the link, place it there unless there
14776 is already a link to the same insn as LINK at that point. */
14779 {
14787 {
14791 /* Set added_links_insn to the earliest insn we added a
14792 link to. */
14796 }
14797 }
14798 }
14799 }
14800 \f
14801 /* Check for any register or memory mentioned in EQUIV that is not
14802 mentioned in EXPR. This is used to restrict EQUIV to "specializations"
14803 of EXPR where some registers may have been replaced by constants. */
14805 static bool
14807 {
14810 {
14815 }
14817 }
14818 \f
14819 DEBUG_FUNCTION void
14821 {
14822 fprintf
14824 ";; Combiner statistics: %d attempts, %d substitutions (%d requiring new space),\n;; %d successes.\n\n",
14826 }
14828 void
14830 {
14831 fprintf
14833 "\n;; Combiner totals: %d attempts, %d substitutions (%d requiring new space),\n;; %d successes.\n",
14835 }
14836 \f
14837 /* Try combining insns through substitution. */
14838 static unsigned int
14840 {
14850 rebuild_jump_labels_after_combine
14853 /* Combining insns may have turned an indirect jump into a
14854 direct jump. Rebuild the JUMP_LABEL fields of jumping
14855 instructions. */
14857 {
14864 }
14868 }
14873 {
14883 };
14886 {
14890 {}
14892 /* opt_pass methods: */
14895 {
14897 }
14903 rtl_opt_pass *
14905 {
14907 }