| blob | 91e32c88c8898781a884cb3b263855b88206cac7 |
1 /* Optimize by combining instructions for GNU compiler.
2 Copyright (C) 1987-2019 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. */
109 /* Number of attempts to combine instructions in this function. */
113 /* Number of attempts that got as far as substitution in this function. */
117 /* Number of instructions combined with added SETs in this function. */
121 /* Number of instructions combined in this function. */
125 /* Totals over entire compilation. */
129 /* combine_instructions may try to replace the right hand side of the
130 second instruction with the value of an associated REG_EQUAL note
131 before throwing it at try_combine. That is problematic when there
132 is a REG_DEAD note for a register used in the old right hand side
133 and can cause distribute_notes to do wrong things. This is the
134 second instruction if it has been so modified, null otherwise. */
138 /* When I2MOD is nonnull, this is a copy of the old right hand side. */
142 /* When I2MOD is nonnull, this is a copy of the new right hand side. */
145 \f
147 /* Record last point of death of (hard or pseudo) register n. */
150 /* Record last point of modification of (hard or pseudo) register n. */
153 /* The next group of fields allows the recording of the last value assigned
154 to (hard or pseudo) register n. We use this information to see if an
155 operation being processed is redundant given a prior operation performed
156 on the register. For example, an `and' with a constant is redundant if
157 all the zero bits are already known to be turned off.
159 We use an approach similar to that used by cse, but change it in the
160 following ways:
162 (1) We do not want to reinitialize at each label.
163 (2) It is useful, but not critical, to know the actual value assigned
164 to a register. Often just its form is helpful.
166 Therefore, we maintain the following fields:
168 last_set_value the last value assigned
169 last_set_label records the value of label_tick when the
170 register was assigned
171 last_set_table_tick records the value of label_tick when a
172 value using the register is assigned
173 last_set_invalid set to nonzero when it is not valid
174 to use the value of this register in some
175 register's value
177 To understand the usage of these tables, it is important to understand
178 the distinction between the value in last_set_value being valid and
179 the register being validly contained in some other expression in the
180 table.
182 (The next two parameters are out of date).
184 reg_stat[i].last_set_value is valid if it is nonzero, and either
185 reg_n_sets[i] is 1 or reg_stat[i].last_set_label == label_tick.
187 Register I may validly appear in any expression returned for the value
188 of another register if reg_n_sets[i] is 1. It may also appear in the
189 value for register J if reg_stat[j].last_set_invalid is zero, or
190 reg_stat[i].last_set_label < reg_stat[j].last_set_label.
192 If an expression is found in the table containing a register which may
193 not validly appear in an expression, the register is replaced by
194 something that won't match, (clobber (const_int 0)). */
196 /* Record last value assigned to (hard or pseudo) register n. */
198 rtx last_set_value;
200 /* Record the value of label_tick when an expression involving register n
201 is placed in last_set_value. */
205 /* Record the value of label_tick when the value for register n is placed in
206 last_set_value. */
210 /* These fields are maintained in parallel with last_set_value and are
211 used to store the mode in which the register was last set, the bits
212 that were known to be zero when it was last set, and the number of
213 sign bits copies it was known to have when it was last set. */
219 /* Set nonzero if references to register n in expressions should not be
220 used. last_set_invalid is set nonzero when this register is being
221 assigned to and last_set_table_tick == label_tick. */
225 /* Some registers that are set more than once and used in more than one
226 basic block are nevertheless always set in similar ways. For example,
227 a QImode register may be loaded from memory in two places on a machine
228 where byte loads zero extend.
230 We record in the following fields if a register has some leading bits
231 that are always equal to the sign bit, and what we know about the
232 nonzero bits of a register, specifically which bits are known to be
233 zero.
235 If an entry is zero, it means that we don't know anything special. */
241 /* Record the value of the label_tick when the last truncation
242 happened. The field truncated_to_mode is only valid if
243 truncation_label == label_tick. */
247 /* Record the last truncation seen for this register. If truncation
248 is not a nop to this mode we might be able to save an explicit
249 truncation if we know that value already contains a truncated
250 value. */
253 };
258 /* One plus the highest pseudo for which we track REG_N_SETS.
259 regstat_init_n_sets_and_refs allocates the array for REG_N_SETS just once,
260 but during combine_split_insns new pseudos can be created. As we don't have
261 updated DF information in that case, it is hard to initialize the array
262 after growing. The combiner only cares about REG_N_SETS (regno) == 1,
263 so instead of growing the arrays, just assume all newly created pseudos
264 during combine might be set multiple times. */
268 /* Record the luid of the last insn that invalidated memory
269 (anything that writes memory, and subroutine calls, but not pushes). */
273 /* Record the luid of the last CALL_INSN
274 so we can tell whether a potential combination crosses any calls. */
278 /* When `subst' is called, this is the insn that is being modified
279 (by combining in a previous insn). The PATTERN of this insn
280 is still the old pattern partially modified and it should not be
281 looked at, but this may be used to examine the successors of the insn
282 to judge whether a simplification is valid. */
286 /* This is the lowest LUID that `subst' is currently dealing with.
287 get_last_value will not return a value if the register was set at or
288 after this LUID. If not for this mechanism, we could get confused if
289 I2 or I1 in try_combine were an insn that used the old value of a register
290 to obtain a new value. In that case, we might erroneously get the
291 new value of the register when we wanted the old one. */
295 /* This contains any hard registers that are used in newpat; reg_dead_at_p
296 must consider all these registers to be always live. */
300 /* This is an insn to which a LOG_LINKS entry has been added. If this
301 insn is the earlier than I2 or I3, combine should rescan starting at
302 that location. */
306 /* And similarly, for notes. */
310 /* Basic block in which we are performing combines. */
314 \f
315 /* Length of the currently allocated uid_insn_cost array. */
319 /* The following array records the insn_cost for every insn
320 in the instruction stream. */
324 /* The following array records the LOG_LINKS for every insn in the
325 instruction stream as struct insn_link pointers. */
331 };
337 {
341 }
343 #define INSN_COST(INSN) (uid_insn_cost[insn_uid_check (INSN)])
344 #define LOG_LINKS(INSN) (uid_log_links[insn_uid_check (INSN)])
346 #define FOR_EACH_LOG_LINK(L, INSN) \
347 for ((L) = LOG_LINKS (INSN); (L); (L) = (L)->next)
349 /* Links for LOG_LINKS are allocated from this obstack. */
353 /* Allocate a link. */
357 {
365 }
367 /* Incremented for each basic block. */
371 /* Reset to label_tick for each extended basic block in scanning order. */
375 /* Mode used to compute significance in reg_stat[].nonzero_bits. It is the
376 largest integer mode that can fit in HOST_BITS_PER_WIDE_INT. */
380 /* Nonzero when reg_stat[].nonzero_bits and reg_stat[].sign_bit_copies can
381 be safely used. It is zero while computing them and after combine has
382 completed. This former test prevents propagating values based on
383 previously set values, which can be incorrect if a variable is modified
384 in a loop. */
388 \f
389 /* Record one modification to rtl structure
390 to be undone by storing old_contents into *where. */
394 struct undo
395 {
400 };
402 /* Record a bunch of changes to be undone, up to MAX_UNDO of them.
403 num_undo says how many are currently recorded.
405 other_insn is nonzero if we have modified some other insn in the process
406 of working on subst_insn. It must be verified too. */
408 struct undobuf
409 {
413 };
417 /* Number of times the pseudo being substituted for
418 was found and replaced. */
423 scalar_int_mode,
426 scalar_int_mode,
498 \f
500 /* It is not safe to use ordinary gen_lowpart in combine.
501 See comments in gen_lowpart_for_combine. */
502 #undef RTL_HOOKS_GEN_LOWPART
503 #define RTL_HOOKS_GEN_LOWPART gen_lowpart_for_combine
505 /* Our implementation of gen_lowpart never emits a new pseudo. */
506 #undef RTL_HOOKS_GEN_LOWPART_NO_EMIT
507 #define RTL_HOOKS_GEN_LOWPART_NO_EMIT gen_lowpart_for_combine
509 #undef RTL_HOOKS_REG_NONZERO_REG_BITS
510 #define RTL_HOOKS_REG_NONZERO_REG_BITS reg_nonzero_bits_for_combine
512 #undef RTL_HOOKS_REG_NUM_SIGN_BIT_COPIES
513 #define RTL_HOOKS_REG_NUM_SIGN_BIT_COPIES reg_num_sign_bit_copies_for_combine
515 #undef RTL_HOOKS_REG_TRUNCATED_TO_MODE
516 #define RTL_HOOKS_REG_TRUNCATED_TO_MODE reg_truncated_to_mode
520 \f
521 /* Convenience wrapper for the canonicalize_comparison target hook.
522 Target hooks cannot use enum rtx_code. */
526 {
530 }
532 /* Try to split PATTERN found in INSN. This returns NULL_RTX if
533 PATTERN cannot be split. Otherwise, it returns an insn sequence.
534 This is a wrapper around split_insns which ensures that the
535 reg_stat vector is made larger if the splitter creates a new
536 register. */
540 {
549 }
551 /* This is used by find_single_use to locate an rtx in LOC that
552 contains exactly one use of DEST, which is typically either a REG
553 or CC0. It returns a pointer to the innermost rtx expression
554 containing DEST. Appearances of DEST that are being used to
555 totally replace it are not counted. */
559 {
568 {
572 CASE_CONST_ANY:
578 /* If the destination is anything other than CC0, PC, a REG or a SUBREG
579 of a REG that occupies all of the REG, the insn uses DEST if
580 it is mentioned in the destination or the source. Otherwise, we
581 need just check the source. */
598 }
600 /* If it wasn't one of the common cases above, check each expression and
601 vector of this code. Look for a unique usage of DEST. */
605 {
607 {
612 else
618 /* Duplicate usage. */
620 }
622 {
626 {
632 else
639 }
640 }
641 }
644 }
647 /* See if DEST, produced in INSN, is used only a single time in the
648 sequel. If so, return a pointer to the innermost rtx expression in which
649 it is used.
651 If PLOC is nonzero, *PLOC is set to the insn containing the single use.
653 If DEST is cc0_rtx, we look only at the next insn. In that case, we don't
654 care about REG_DEAD notes or LOG_LINKS.
656 Otherwise, we find the single use by finding an insn that has a
657 LOG_LINKS pointing at INSN and has a REG_DEAD note for DEST. If DEST is
658 only referenced once in that insn, we know that it must be the first
659 and last insn referencing DEST. */
663 {
664 basic_block bb;
670 {
680 }
690 {
696 {
701 }
702 }
705 }
706 \f
707 /* Substitute NEWVAL, an rtx expression, into INTO, a place in some
708 insn. The substitution can be undone by undo_all. If INTO is already
709 set to NEWVAL, do not record this change. Because computing NEWVAL might
710 also call SUBST, we have to compute it before we put anything into
711 the undo table. */
713 static void
715 {
722 /* We'd like to catch as many invalid transformations here as
723 possible. Unfortunately, there are way too many mode changes
724 that are perfectly valid, so we'd waste too much effort for
725 little gain doing the checks here. Focus on catching invalid
726 transformations involving integer constants. */
729 {
730 /* Sanity check that we're replacing oldval with a CONST_INT
731 that is a valid sign-extension for the original mode. */
735 /* Replacing the operand of a SUBREG or a ZERO_EXTEND with a
736 CONST_INT is not valid, because after the replacement, the
737 original mode would be gone. Unfortunately, we can't tell
738 when do_SUBST is called to replace the operand thereof, so we
739 perform this test on oldval instead, checking whether an
740 invalid replacement took place before we got here. */
745 }
749 else
758 }
760 #define SUBST(INTO, NEWVAL) do_SUBST (&(INTO), (NEWVAL))
762 /* Similar to SUBST, but NEWVAL is an int expression. Note that substitution
763 for the value of a HOST_WIDE_INT value (including CONST_INT) is
764 not safe. */
766 static void
768 {
777 else
786 }
788 #define SUBST_INT(INTO, NEWVAL) do_SUBST_INT (&(INTO), (NEWVAL))
790 /* Similar to SUBST, but just substitute the mode. This is used when
791 changing the mode of a pseudo-register, so that any other
792 references to the entry in the regno_reg_rtx array will change as
793 well. */
795 static void
797 {
806 else
815 }
817 #define SUBST_MODE(INTO, NEWVAL) do_SUBST_MODE (&(INTO), (NEWVAL))
819 /* Similar to SUBST, but NEWVAL is a LOG_LINKS expression. */
821 static void
823 {
832 else
841 }
843 #define SUBST_LINK(oldval, newval) do_SUBST_LINK (&oldval, newval)
844 \f
845 /* Subroutine of try_combine. Determine whether the replacement patterns
846 NEWPAT, NEWI2PAT and NEWOTHERPAT are cheaper according to insn_cost
847 than the original sequence I0, I1, I2, I3 and undobuf.other_insn. Note
848 that I0, I1 and/or NEWI2PAT may be NULL_RTX. Similarly, NEWOTHERPAT and
849 undobuf.other_insn may also both be NULL_RTX. Return false if the cost
850 of all the instructions can be estimated and the replacements are more
851 expensive than the original sequence. */
853 static bool
856 {
861 /* Lookup the original insn_costs. */
866 {
869 {
873 }
874 else
875 {
879 }
880 }
881 else
882 {
885 }
887 /* If we have split a PARALLEL I2 to I1,I2, we have counted its cost twice;
888 correct that. */
893 /* Calculate the replacement insn_costs. */
902 {
912 }
913 else
914 {
917 }
920 {
929 optimize_this_for_speed_p);
933 {
936 }
937 else
939 }
941 /* Disallow this combination if both new_cost and old_cost are greater than
942 zero, and new_cost is greater than old cost. */
946 {
965 else
967 }
972 /* Update the uid_insn_cost array with the replacement costs. */
976 {
980 }
983 }
986 /* Delete any insns that copy a register to itself.
987 Return true if the CFG was changed. */
989 static bool
991 {
993 basic_block bb;
998 {
1000 {
1003 {
1008 }
1009 }
1010 }
1013 }
1015 \f
1016 /* Return false if we do not want to (or cannot) combine DEF. */
1017 static bool
1019 {
1020 /* Do not consider if it is pre/post modification in MEM. */
1026 /* Do not combine frame pointer adjustments. */
1029 || (!HARD_FRAME_POINTER_IS_FRAME_POINTER
1037 }
1039 /* Return false if we do not want to (or cannot) combine USE. */
1040 static bool
1042 {
1043 /* Do not consider the usage of the stack pointer by function call. */
1048 }
1050 /* Fill in log links field for all insns. */
1052 static void
1054 {
1055 basic_block bb;
1062 /* Pass through each block from the end, recording the uses of each
1063 register and establishing log links when def is encountered.
1064 Note that we do not clear next_use array in order to save time,
1065 so we have to test whether the use is in the same basic block as def.
1067 There are a few cases below when we do not consider the definition or
1068 usage -- these are taken from original flow.c did. Don't ask me why it is
1069 done this way; I don't know and if it works, I don't want to know. */
1072 {
1074 {
1078 /* Log links are created only once. */
1082 {
1098 /* flow.c claimed:
1100 We don't build a LOG_LINK for hard registers contained
1101 in ASM_OPERANDs. If these registers get replaced,
1102 we might wind up changing the semantics of the insn,
1103 even if reload can make what appear to be valid
1104 assignments later. */
1109 /* Don't add duplicate links between instructions. */
1118 }
1123 }
1124 }
1127 }
1129 /* Walk the LOG_LINKS of insn B to see if we find a reference to A. Return
1130 true if we found a LOG_LINK that proves that A feeds B. This only works
1131 if there are no instructions between A and B which could have a link
1132 depending on A, since in that case we would not record a link for B.
1133 We also check the implicit dependency created by a cc0 setter/user
1134 pair. */
1136 static bool
1138 {
1146 }
1147 \f
1148 /* Main entry point for combiner. F is the first insn of the function.
1149 NREGS is the first unused pseudo-reg number.
1151 Return nonzero if the CFG was changed (e.g. if the combiner has
1152 turned an indirect jump instruction into a direct jump). */
1153 static int
1155 {
1160 basic_block last_bb;
1180 /* Allocate array for insn info. */
1188 /* Don't use reg_stat[].nonzero_bits when computing it. This can cause
1189 problems when, for example, we have j <<= 1 in a loop. */
1194 /* Scan all SETs and see if we can deduce anything about what
1195 bits are known to be zero for some registers and how many copies
1196 of the sign bit are known to exist for those registers.
1198 Also set any known values so that we can use it while searching
1199 for what bits are known to be set. */
1202 /* Allow the entry block and the first block to fall into the same EBB.
1203 Conceptually the incoming promotions are assigned to the entry block. */
1208 {
1213 label_tick++;
1221 {
1222 rtx links;
1228 insn);
1235 insn);
1237 /* Record the current insn_cost of this instruction. */
1241 {
1244 }
1245 }
1246 }
1250 /* Now scan all the insns in forward order. */
1258 {
1261 /* Ignore instruction combination in basic blocks that are going to
1262 be removed as unreachable anyway. See PR82386. */
1270 label_tick++;
1280 {
1294 /* See if we know about function return values before this
1295 insn based upon SUBREG flags. */
1298 /* See if we can find hardregs and subreg of pseudos in
1299 narrower modes. This could help turning TRUNCATEs
1300 into SUBREGs. */
1303 /* Try this insn with each insn it links back to. */
1309 {
1312 }
1314 /* Try each sequence of three linked insns ending with this one. */
1318 {
1321 /* If the linked insn has been replaced by a note, then there
1322 is no point in pursuing this chain any further. */
1330 {
1333 }
1334 }
1336 /* Try to combine a jump insn that uses CC0
1337 with a preceding insn that sets CC0, and maybe with its
1338 logical predecessor as well.
1339 This is how we make decrement-and-branch insns.
1340 We need this special code because data flow connections
1341 via CC0 do not get entered in LOG_LINKS. */
1348 {
1359 }
1361 /* Do the same for an insn that explicitly references CC0. */
1368 {
1379 }
1381 /* Finally, see if any of the insns that this insn links to
1382 explicitly references CC0. If so, try this insn, that insn,
1383 and its predecessor if it sets CC0. */
1385 {
1397 }
1399 /* Try combining an insn with two different insns whose results it
1400 uses. */
1410 {
1413 }
1415 /* Try four-instruction combinations. */
1418 {
1422 /* If the linked insn has been replaced by a note, then there
1423 is no point in pursuing this chain any further. */
1428 {
1432 /* I0 -> I1 -> I2 -> I3. */
1438 {
1441 }
1442 /* I0, I1 -> I2, I2 -> I3. */
1449 {
1452 }
1453 }
1456 {
1460 /* I0 -> I2; I1, I2 -> I3. */
1466 {
1469 }
1470 /* I0 -> I1; I1, I2 -> I3. */
1476 {
1479 }
1480 }
1481 }
1483 /* Try this insn with each REG_EQUAL note it links back to. */
1485 {
1491 /* Avoid using a register that may already been marked
1492 dead by an earlier instruction. */
1500 {
1501 /* Temporarily replace the set's source with the
1502 contents of the REG_EQUAL note. The insn will
1503 be deleted or recognized by try_combine. */
1514 last_combined_insn);
1517 {
1520 }
1523 }
1524 }
1529 retry:
1530 ;
1531 }
1532 }
1539 /* Clean up. */
1545 {
1548 {
1551 }
1553 }
1563 /* Make recognizer allow volatile MEMs again. */
1567 }
1569 /* Wipe the last_xxx fields of reg_stat in preparation for another pass. */
1571 static void
1573 {
1579 }
1580 \f
1581 /* Set up any promoted values for incoming argument registers. */
1583 static void
1585 {
1586 tree arg;
1591 {
1596 /* Only continue if the incoming argument is in a register. */
1600 /* Determine, if possible, whether all call sites of the current
1601 function lie within the current compilation unit. (This does
1602 take into account the exporting of a function via taking its
1603 address, and so forth.) */
1606 /* The mode and signedness of the argument before any promotions happen
1607 (equal to the mode of the pseudo holding it at that stage). */
1611 /* The mode and signedness of the argument after any source language and
1612 TARGET_PROMOTE_PROTOTYPES-driven promotions. */
1616 /* The mode and signedness of the argument as it is actually passed,
1617 see assign_parm_setup_reg in function.c. */
1621 /* The mode of the register in which the argument is being passed. */
1624 /* Eliminate sign extensions in the callee when:
1625 (a) A mode promotion has occurred; */
1628 /* (b) The mode of the register is the same as the mode of
1629 the argument as it is passed; */
1632 /* (c) There's no language level extension; */
1634 ;
1635 /* (c.1) All callers are from the current compilation unit. If that's
1636 the case we don't have to rely on an ABI, we only have to know
1637 what we're generating right now, and we know that we will do the
1638 mode1 to mode2 promotion with the given sign. */
1641 /* (c.2) The combination of the two promotions is useful. This is
1642 true when the signs match, or if the first promotion is unsigned.
1643 In the later case, (sign_extend (zero_extend x)) is the same as
1644 (zero_extend (zero_extend x)), so make sure to force UNS3 true. */
1650 /* Record that the value was promoted from mode1 to mode3,
1651 so that any sign extension at the head of the current
1652 function may be eliminated. */
1656 }
1657 }
1659 /* If MODE has a precision lower than PREC and SRC is a non-negative constant
1660 that would appear negative in MODE, sign-extend SRC for use in nonzero_bits
1661 because some machines (maybe most) will actually do the sign-extension and
1662 this is the conservative approach.
1664 ??? For 2.5, try to tighten up the MD files in this regard instead of this
1665 kludge. */
1667 static rtx
1669 {
1670 scalar_int_mode int_mode;
1679 }
1681 /* Update RSP for pseudo-register X from INSN's REG_EQUAL note (if one exists)
1682 and SET. */
1684 static void
1686 rtx x)
1687 {
1697 {
1701 }
1703 /* Don't call nonzero_bits if it cannot change anything. */
1705 {
1714 }
1716 /* Don't call num_sign_bit_copies if it cannot change anything. */
1718 {
1721 {
1725 }
1728 }
1729 }
1731 /* Called via note_stores. If X is a pseudo that is narrower than
1732 HOST_BITS_PER_WIDE_INT and is being set, record what bits are known zero.
1734 If we are setting only a portion of X and we can't figure out what
1735 portion, assume all bits will be used since we don't know what will
1736 be happening.
1738 Similarly, set how many bits of X are known to be copies of the sign bit
1739 at all locations in the function. This is the smallest number implied
1740 by any set of X. */
1742 static void
1744 {
1746 scalar_int_mode mode;
1750 /* If this register is undefined at the start of the file, we can't
1751 say what its contents were. */
1752 && ! REGNO_REG_SET_P
1756 {
1760 {
1764 }
1766 /* Should not happen as we only using pseduo registers. */
1769 /* If this register is being initialized using itself, and the
1770 register is uninitialized in this basic block, and there are
1771 no LOG_LINKS which set the register, then part of the
1772 register is uninitialized. In that case we can't assume
1773 anything about the number of nonzero bits.
1775 ??? We could do better if we checked this in
1776 reg_{nonzero_bits,num_sign_bit_copies}_for_combine. Then we
1777 could avoid making assumptions about the insn which initially
1778 sets the register, while still using the information in other
1779 insns. We would have to be careful to check every insn
1780 involved in the combination. */
1786 {
1793 {
1797 }
1798 }
1800 /* If this is a complex assignment, see if we can convert it into a
1801 simple assignment. */
1804 /* If this is a simple assignment, or we have a paradoxical SUBREG,
1805 set what we know about X. */
1811 else
1812 {
1815 }
1816 }
1817 }
1818 \f
1819 /* See if INSN can be combined into I3. PRED, PRED2, SUCC and SUCC2 are
1820 optionally insns that were previously combined into I3 or that will be
1821 combined into the merger of INSN and I3. The order is PRED, PRED2,
1822 INSN, SUCC, SUCC2, I3.
1824 Return 0 if the combination is not allowed for any reason.
1826 If the combination is allowed, *PDEST will be set to the single
1827 destination of INSN and *PSRC to the single source, and this function
1828 will return 1. */
1830 static int
1834 {
1839 rtx link;
1844 {
1846 {
1851 }
1856 }
1860 /* Can combine only if previous insn is a SET of a REG, a SUBREG or CC0.
1861 or a PARALLEL consisting of such a SET and CLOBBERs.
1863 If INSN has CLOBBER parallel parts, ignore them for our processing.
1864 By definition, these happen during the execution of the insn. When it
1865 is merged with another insn, all bets are off. If they are, in fact,
1866 needed and aren't also supplied in I3, they may be added by
1867 recog_for_combine. Otherwise, it won't match.
1869 We can also ignore a SET whose SET_DEST is mentioned in a REG_UNUSED
1870 note.
1872 Get the source and destination of INSN. If more than one, can't
1873 combine. */
1879 {
1881 {
1885 {
1886 /* This is important to combine floating point insns
1887 for the SH4 port. */
1889 /* Combining an isolated USE doesn't make sense.
1890 We depend here on combinable_i3pat to reject them. */
1891 /* The code below this loop only verifies that the inputs of
1892 the SET in INSN do not change. We call reg_set_between_p
1893 to verify that the REG in the USE does not change between
1894 I3 and INSN.
1895 If the USE in INSN was for a pseudo register, the matching
1896 insn pattern will likely match any register; combining this
1897 with any other USE would only be safe if we knew that the
1898 used registers have identical values, or if there was
1899 something to tell them apart, e.g. different modes. For
1900 now, we forgo such complicated tests and simply disallow
1901 combining of USES of pseudo registers with any other USE. */
1904 {
1909 do
1910 {
1920 }
1922 }
1925 /* We can ignore CLOBBERs. */
1931 /* Ignore SETs whose result isn't used but not those that
1932 have side-effects. */
1938 /* If we have already found a SET, this is a second one and
1939 so we cannot combine with this insn. */
1947 /* Anything else means we can't combine. */
1949 }
1950 }
1953 /* If SET_SRC is an ASM_OPERANDS we can't throw away these CLOBBERs,
1954 so don't do anything with it. */
1957 }
1958 else
1964 /* The simplification in expand_field_assignment may call back to
1965 get_last_value, so set safe guard here. */
1971 /* Do not eliminate user-specified register if it is in an
1972 asm input because we may break the register asm usage defined
1973 in GCC manual if allow to do so.
1974 Be aware that this may cover more cases than we expect but this
1975 should be harmless. */
1980 /* Don't eliminate a store in the stack pointer. */
1982 /* Don't combine with an insn that sets a register to itself if it has
1983 a REG_EQUAL note. This may be part of a LIBCALL sequence. */
1985 /* Can't merge an ASM_OPERANDS. */
1987 /* Can't merge a function call. */
1989 /* Don't eliminate a function call argument. */
1995 /* Don't substitute into an incremented register. */
1999 /* Don't substitute into a non-local goto, this confuses CFG. */
2001 /* Make sure that DEST is not used after INSN but before SUCC, or
2002 after SUCC and before SUCC2, or after SUCC2 but before I3. */
2003 || (!all_adjacent
2004 && ((succ2
2009 || (succ
2010 /* SUCC and SUCC2 can be split halves from a PARALLEL; in
2011 that case SUCC is not in the insn stream, so use SUCC2
2012 instead for this test. */
2014 succ2
2017 /* Make sure that the value that is to be substituted for the register
2018 does not use any registers whose values alter in between. However,
2019 If the insns are adjacent, a use can't cross a set even though we
2020 think it might (this can happen for a sequence of insns each setting
2021 the same destination; last_set of that register might point to
2022 a NOTE). If INSN has a REG_EQUIV note, the register is always
2023 equivalent to the memory so the substitution is valid even if there
2024 are intervening stores. Also, don't move a volatile asm or
2025 UNSPEC_VOLATILE across any other insns. */
2026 || (! all_adjacent
2032 /* Don't combine across a CALL_INSN, because that would possibly
2033 change whether the life span of some REGs crosses calls or not,
2034 and it is a pain to update that information.
2035 Exception: if source is a constant, moving it later can't hurt.
2036 Accept that as a special case. */
2040 /* DEST must either be a REG or CC0. */
2042 {
2043 /* If register alignment is being enforced for multi-word items in all
2044 cases except for parameters, it is possible to have a register copy
2045 insn referencing a hard register that is not allowed to contain the
2046 mode being copied and which would not be valid as an operand of most
2047 insns. Eliminate this problem by not combining with such an insn.
2049 Also, on some machines we don't want to extend the life of a hard
2050 register. */
2055 /* Don't extend the life of a hard register unless it is
2056 user variable (if we have few registers) or it can't
2057 fit into the desired register (meaning something special
2058 is going on).
2059 Also avoid substituting a return register into I3, because
2060 reload can't handle a conflict with constraints of other
2061 inputs. */
2066 }
2074 {
2077 /* If the clobber represents an earlyclobber operand, we must not
2078 substitute an expression containing the clobbered register.
2079 As we do not analyze the constraint strings here, we have to
2080 make the conservative assumption. However, if the register is
2081 a fixed hard reg, the clobber cannot represent any operand;
2082 we leave it up to the machine description to either accept or
2083 reject use-and-clobber patterns. */
2089 }
2091 /* If INSN contains anything volatile, or is an `asm' (whether volatile
2092 or not), reject, unless nothing volatile comes between it and I3 */
2095 {
2096 /* Make sure neither succ nor succ2 contains a volatile reference. */
2101 /* We'll check insns between INSN and I3 below. */
2102 }
2104 /* If INSN is an asm, and DEST is a hard register, reject, since it has
2105 to be an explicit register variable, and was chosen for a reason. */
2111 /* If INSN contains volatile references (specifically volatile MEMs),
2112 we cannot combine across any other volatile references.
2113 Even if INSN doesn't contain volatile references, any intervening
2114 volatile insn might affect machine state. */
2117 ? volatile_refs_p
2124 /* If INSN contains an autoincrement or autodecrement, make sure that
2125 register is not used between there and I3, and not already used in
2126 I3 either. Neither must it be used in PRED or SUCC, if they exist.
2127 Also insist that I3 not be a jump; if it were one
2128 and the incremented register were spilled, we would lose. */
2146 /* Don't combine an insn that follows a CC0-setting insn.
2147 An insn that uses CC0 must not be separated from the one that sets it.
2148 We do, however, allow I2 to follow a CC0-setting insn if that insn
2149 is passed as I1; in that case it will be deleted also.
2150 We also allow combining in this case if all the insns are adjacent
2151 because that would leave the two CC0 insns adjacent as well.
2152 It would be more logical to test whether CC0 occurs inside I1 or I2,
2153 but that would be much slower, and this ought to be equivalent. */
2156 {
2161 }
2163 /* If we get here, we have passed all the tests and the combination is
2164 to be allowed. */
2170 }
2171 \f
2172 /* LOC is the location within I3 that contains its pattern or the component
2173 of a PARALLEL of the pattern. We validate that it is valid for combining.
2175 One problem is if I3 modifies its output, as opposed to replacing it
2176 entirely, we can't allow the output to contain I2DEST, I1DEST or I0DEST as
2177 doing so would produce an insn that is not equivalent to the original insns.
2179 Consider:
2181 (set (reg:DI 101) (reg:DI 100))
2182 (set (subreg:SI (reg:DI 101) 0) <foo>)
2184 This is NOT equivalent to:
2186 (parallel [(set (subreg:SI (reg:DI 100) 0) <foo>)
2187 (set (reg:DI 101) (reg:DI 100))])
2189 Not only does this modify 100 (in which case it might still be valid
2190 if 100 were dead in I2), it sets 101 to the ORIGINAL value of 100.
2192 We can also run into a problem if I2 sets a register that I1
2193 uses and I1 gets directly substituted into I3 (not via I2). In that
2194 case, we would be getting the wrong value of I2DEST into I3, so we
2195 must reject the combination. This case occurs when I2 and I1 both
2196 feed into I3, rather than when I1 feeds into I2, which feeds into I3.
2197 If I1_NOT_IN_SRC is nonzero, it means that finding I1 in the source
2198 of a SET must prevent combination from occurring. The same situation
2199 can occur for I0, in which case I0_NOT_IN_SRC is set.
2201 Before doing the above check, we first try to expand a field assignment
2202 into a set of logical operations.
2204 If PI3_DEST_KILLED is nonzero, it is a pointer to a location in which
2205 we place a register that is both set and used within I3. If more than one
2206 such register is detected, we fail.
2208 Return 1 if the combination is valid, zero otherwise. */
2210 static int
2213 {
2217 {
2222 rtx subdest;
2229 /* Check for the case where I3 modifies its output, as discussed
2230 above. We don't want to prevent pseudos from being combined
2231 into the address of a MEM, so only prevent the combination if
2232 i1 or i2 set the same MEM. */
2242 /* This is the same test done in can_combine_p except we can't test
2243 all_adjacent; we don't have to, since this instruction will stay
2244 in place, thus we are not considering increasing the lifetime of
2245 INNER_DEST.
2247 Also, if this insn sets a function argument, combining it with
2248 something that might need a spill could clobber a previous
2249 function argument; the all_adjacent test in can_combine_p also
2250 checks this; here, we do a more specific test for this case. */
2260 /* If DEST is used in I3, it is being killed in this insn, so
2261 record that for later. We have to consider paradoxical
2262 subregs here, since they kill the whole register, but we
2263 ignore partial subregs, STRICT_LOW_PART, etc.
2264 Never add REG_DEAD notes for the FRAME_POINTER_REGNUM or the
2265 STACK_POINTER_REGNUM, since these are always considered to be
2266 live. Similarly for ARG_POINTER_REGNUM if it is fixed. */
2274 && (HARD_FRAME_POINTER_IS_FRAME_POINTER
2280 {
2285 }
2286 }
2289 {
2296 }
2299 }
2300 \f
2301 /* Return 1 if X is an arithmetic expression that contains a multiplication
2302 and division. We don't count multiplications by powers of two here. */
2304 static int
2306 {
2308 {
2324 }
2325 }
2326 \f
2327 /* Determine whether INSN can be used in a combination. Return nonzero if
2328 not. This is used in try_combine to detect early some cases where we
2329 can't perform combinations. */
2331 static int
2333 {
2334 rtx set;
2337 /* If this isn't really an insn, we can't do anything.
2338 This can occur when flow deletes an insn that it has merged into an
2339 auto-increment address. */
2343 /* Never combine loads and stores involving hard regs that are likely
2344 to be spilled. The register allocator can usually handle such
2345 reg-reg moves by tying. If we allow the combiner to make
2346 substitutions of likely-spilled regs, reload might die.
2347 As an exception, we allow combinations involving fixed regs; these are
2348 not available to the register allocator so there's no risk involved. */
2362 #ifdef LEAF_REGISTERS
2364 #else
2365 )
2366 #endif
2373 }
2375 struct likely_spilled_retval_info
2376 {
2379 };
2381 /* Called via note_stores by likely_spilled_retval_p. Remove from info->mask
2382 hard registers that are known to be written to / clobbered in full. */
2383 static void
2385 {
2402 else
2405 }
2407 /* Return nonzero iff part of the return value is live during INSN, and
2408 it is likely spilled. This can happen when more than one insn is needed
2409 to copy the return value, e.g. when we consider to combine into the
2410 second copy insn for a complex value. */
2412 static int
2414 {
2416 rtx reg;
2419 /* We assume here that no machine mode needs more than
2420 32 hard registers when the value overlaps with a register
2421 for which TARGET_FUNCTION_VALUE_REGNO_P is true. */
2436 /* Disregard parts of the return value that are set later. */
2445 /* Check if any of the (probably) live return value registers is
2446 likely spilled. */
2447 nregs --;
2448 do
2449 {
2455 }
2457 /* Adjust INSN after we made a change to its destination.
2459 Changing the destination can invalidate notes that say something about
2460 the results of the insn and a LOG_LINK pointing to the insn. */
2462 static void
2464 {
2465 /* For notes, be conservative and simply remove them. */
2468 /* The new insn will have a destination that was previously the destination
2469 of an insn just above it. Call distribute_links to make a LOG_LINK from
2470 the next use of that destination. */
2486 }
2488 /* Return TRUE if combine can reuse reg X in mode MODE.
2489 ADDED_SETS is nonzero if the original set is still required. */
2490 static bool
2492 {
2498 /* Don't change between modes with different underlying register sizes,
2499 since this could lead to invalid subregs. */
2505 /* Allow hard registers if the new mode is legal, and occupies no more
2506 registers than the old mode. */
2511 /* Or a pseudo that is only used once. */
2514 && !added_sets
2516 }
2519 /* Check whether X, the destination of a set, refers to part of
2520 the register specified by REG. */
2522 static bool
2524 {
2525 /* Check that reg is an integer mode register. */
2536 }
2538 /* Delete the unconditional jump INSN and adjust the CFG correspondingly.
2539 Note that the INSN should be deleted *after* removing dead edges, so
2540 that the kept edge is the fallthrough edge for a (set (pc) (pc))
2541 but not for a (set (pc) (label_ref FOO)). */
2543 static void
2545 {
2553 {
2558 /* Remove barriers from the footer if there are any. */
2561 {
2564 else
2568 }
2571 }
2572 }
2574 /* Return whether PAT is a PARALLEL of exactly N register SETs followed
2575 by an arbitrary number of CLOBBERs. */
2576 static bool
2578 {
2593 {
2602 }
2604 }
2606 /* Return whether INSN, a PARALLEL of N register SETs (and maybe some
2607 CLOBBERs), can be split into individual SETs in that order, without
2608 changing semantics. */
2609 static bool
2611 {
2619 {
2628 }
2631 }
2633 /* Return whether X is just a single set, with the source
2634 a general_operand. */
2635 static bool
2637 {
2642 }
2644 /* Try to combine the insns I0, I1 and I2 into I3.
2645 Here I0, I1 and I2 appear earlier than I3.
2646 I0 and I1 can be zero; then we combine just I2 into I3, or I1 and I2 into
2647 I3.
2649 If we are combining more than two insns and the resulting insn is not
2650 recognized, try splitting it into two insns. If that happens, I2 and I3
2651 are retained and I1/I0 are pseudo-deleted by turning them into a NOTE.
2652 Otherwise, I0, I1 and I2 are pseudo-deleted.
2654 Return 0 if the combination does not work. Then nothing is changed.
2655 If we did the combination, return the insn at which combine should
2656 resume scanning.
2658 Set NEW_DIRECT_JUMP_P to a nonzero value if try_combine creates a
2659 new direct jump instruction.
2661 LAST_COMBINED_INSN is either I3, or some insn after I3 that has
2662 been I3 passed to an earlier try_combine within the same basic
2663 block. */
2668 {
2669 /* New patterns for I3 and I2, respectively. */
2673 /* Indicates need to preserve SET in I0, I1 or I2 in I3 if it is not
2674 dead. */
2676 /* Total number of SETs to put into I3. */
2678 /* Nonzero if I2's or I1's body now appears in I3. */
2680 /* INSN_CODEs for new I3, new I2, and user of condition code. */
2682 /* Contains I3 if the destination of I3 is used in its source, which means
2683 that the old life of I3 is being killed. If that usage is placed into
2684 I2 and not in I3, a REG_DEAD note must be made. */
2686 /* SET_DEST and SET_SRC of I2, I1 and I0. */
2688 /* Copy of SET_SRC of I1 and I0, if needed. */
2690 /* Set if I2DEST was reused as a scratch register. */
2692 /* The PATTERNs of I0, I1, and I2, or a copy of them in certain cases. */
2694 /* Indicates if I2DEST or I1DEST is in I2SRC or I1_SRC. */
2699 /* Notes that must be added to REG_NOTES in I3 and I2. */
2701 /* Notes that we substituted I3 into I2 instead of the normal case. */
2703 /* Notes that I1, I2 or I3 is a MULT operation. */
2712 rtx temp_expr;
2715 rtx new_other_notes;
2719 /* Immediately return if any of I0,I1,I2 are the same insn (I3 can
2720 never be). */
2724 /* Only try four-insn combinations when there's high likelihood of
2725 success. Look for simple insns, such as loads of constants or
2726 binary operations involving a constant. */
2728 {
2738 {
2741 rtx src;
2746 {
2749 }
2751 ngood++;
2754 nshift++;
2755 }
2757 /* If I0 loads a memory and I3 sets the same memory, then I1 and I2
2758 are likely manipulating its value. Ideally we'll be able to combine
2759 all four insns into a bitfield insertion of some kind.
2761 Note the source in I0 might be inside a sign/zero extension and the
2762 memory modes in I0 and I3 might be different. So extract the address
2763 from the destination of I3 and search for it in the source of I0.
2765 In the event that there's a match but the source/dest do not actually
2766 refer to the same memory, the worst that happens is we try some
2767 combinations that we wouldn't have otherwise. */
2769 /* Ensure the source of SET0 is a MEM, possibly buried inside
2770 an extension. */
2776 /* Ensure the destination of SET3 is a MEM. */
2778 /* Would it be better to extract the base address for the MEM
2779 in SET3 and look for that? I don't have cases where it matters
2780 but I could envision such cases. */
2786 }
2788 /* Exit early if one of the insns involved can't be used for
2789 combinations. */
2800 combine_attempts++;
2803 /* Reset the hard register usage information. */
2807 {
2814 else
2824 }
2826 /* If multiple insns feed into one of I2 or I3, they can be in any
2827 order. To simplify the code below, reorder them in sequence. */
2838 /* First check for one important special case that the code below will
2839 not handle. Namely, the case where I1 is zero, I2 is a PARALLEL
2840 and I3 is a SET whose SET_SRC is a SET_DEST in I2. In that case,
2841 we may be able to replace that destination with the destination of I3.
2842 This occurs in the common code where we compute both a quotient and
2843 remainder into a structure, in which case we want to do the computation
2844 directly into the structure to avoid register-register copies.
2846 Note that this case handles both multiple sets in I2 and also cases
2847 where I2 has a number of CLOBBERs inside the PARALLEL.
2849 We make very conservative checks below and only try to handle the
2850 most common cases of this. For example, we only handle the case
2851 where I2 and I3 are adjacent to avoid making difficult register
2852 usage tests. */
2860 /* If the dest of I3 is a ZERO_EXTRACT or STRICT_LOW_PART, the code
2861 below would need to check what is inside (and reg_overlap_mentioned_p
2862 doesn't support those codes anyway). Don't allow those destinations;
2863 the resulting insn isn't likely to be recognized anyway. */
2869 {
2872 /* Make sure that the destination of I3,
2873 which we are going to substitute into one output of I2,
2874 is not used within another output of I2. We must avoid making this:
2875 (parallel [(set (mem (reg 69)) ...)
2876 (set (reg 69) ...)])
2877 which is not well-defined as to order of actions.
2878 (Besides, reload can't handle output reloads for this.)
2880 The problem can also happen if the dest of I3 is a memory ref,
2881 if another dest in I2 is an indirect memory ref.
2883 Neither can this PARALLEL be an asm. We do not allow combining
2884 that usually (see can_combine_p), so do not here either. */
2887 {
2897 }
2903 {
2904 combine_merges++;
2914 /* Replace the dest in I2 with our dest and make the resulting
2915 insn the new pattern for I3. Then skip to where we validate
2916 the pattern. Everything was set up above. */
2921 }
2922 }
2924 /* If I2 is setting a pseudo to a constant and I3 is setting some
2925 sub-part of it to another constant, merge them by making a new
2926 constant. */
2934 {
2941 {
2946 {
2952 }
2953 }
2954 else
2955 {
2959 {
2962 }
2963 }
2966 {
2967 /* If this is the low part, we're done. */
2969 ;
2970 /* Handle the case where inner is twice the size of outer. */
2974 /* Otherwise give up for now. */
2975 else
2977 }
2980 {
2988 combine_merges++;
2995 /* Replace the source in I2 with the new constant and make the
2996 resulting insn the new pattern for I3. Then skip to where we
2997 validate the pattern. Everything was set up above. */
3003 /* The dest of I3 has been replaced with the dest of I2. */
3006 }
3007 }
3009 /* If we have no I1 and I2 looks like:
3010 (parallel [(set (reg:CC X) (compare:CC OP (const_int 0)))
3011 (set Y OP)])
3012 make up a dummy I1 that is
3013 (set Y OP)
3014 and change I2 to be
3015 (set (reg:CC X) (compare:CC Y (const_int 0)))
3017 (We can ignore any trailing CLOBBERs.)
3019 This undoes a previous combination and allows us to match a branch-and-
3020 decrement insn. */
3032 {
3033 /* We make I1 with the same INSN_UID as I2. This gives it
3034 the same DF_INSN_LUID for value tracking. Our fake I1 will
3035 never appear in the insn stream so giving it the same INSN_UID
3036 as I2 will not cause a problem. */
3049 }
3051 /* If I2 is a PARALLEL of two SETs of REGs (and perhaps some CLOBBERs),
3052 make those two SETs separate I1 and I2 insns, and make an I0 that is
3053 the original I1. */
3061 {
3062 /* If there is no I1, there is no I0 either. */
3065 /* We make I1 with the same INSN_UID as I2. This gives it
3066 the same DF_INSN_LUID for value tracking. Our fake I1 will
3067 never appear in the insn stream so giving it the same INSN_UID
3068 as I2 will not cause a problem. */
3076 }
3078 /* Verify that I2 and maybe I1 and I0 can be combined into I3. */
3080 {
3085 }
3087 {
3092 }
3094 {
3099 }
3101 /* Record whether i2 and i3 are trivial moves. */
3105 /* Record whether I2DEST is used in I2SRC and similarly for the other
3106 cases. Knowing this will help in register status updating below. */
3117 /* For the earlier insns, determine which of the subsequent ones they
3118 feed. */
3125 /* Ensure that I3's pattern can be the destination of combines. */
3131 {
3134 }
3136 /* See if any of the insns is a MULT operation. Unless one is, we will
3137 reject a combination that is, since it must be slower. Be conservative
3138 here. */
3146 /* If I3 has an inc, then give up if I1 or I2 uses the reg that is inc'd.
3147 We used to do this EXCEPT in one case: I3 has a post-inc in an
3148 output operand. However, that exception can give rise to insns like
3149 mov r3,(r3)+
3150 which is a famous insn on the PDP-11 where the value of r3 used as the
3151 source was model-dependent. Avoid this sort of thing. */
3153 #if 0
3159 /* It's not the exception. */
3160 #endif
3162 {
3163 rtx link;
3169 {
3172 }
3173 }
3175 /* See if the SETs in I1 or I2 need to be kept around in the merged
3176 instruction: whenever the value set there is still needed past I3.
3177 For the SET in I2, this is easy: we see if I2DEST dies or is set in I3.
3179 For the SET in I1, we have two cases: if I1 and I2 independently feed
3180 into I3, the set in I1 needs to be kept around unless I1DEST dies
3181 or is set in I3. Otherwise (if I1 feeds I2 which feeds I3), the set
3182 in I1 needs to be kept around unless I1DEST dies or is set in either
3183 I2 or I3. The same considerations apply to I0. */
3190 else
3198 else
3201 /* We are about to copy insns for the case where they need to be kept
3202 around. Check that they can be copied in the merged instruction. */
3208 {
3211 }
3213 /* If the set in I2 needs to be kept around, we must make a copy of
3214 PATTERN (I2), so that when we substitute I1SRC for I1DEST in
3215 PATTERN (I2), we are only substituting for the original I1DEST, not into
3216 an already-substituted copy. This also prevents making self-referential
3217 rtx. If I2 is a PARALLEL, we just need the piece that assigns I2SRC to
3218 I2DEST. */
3221 {
3224 else
3226 }
3229 {
3232 else
3234 }
3237 {
3240 else
3242 }
3244 combine_merges++;
3246 /* Substitute in the latest insn for the regs set by the earlier ones. */
3252 /* Many machines that don't use CC0 have insns that can both perform an
3253 arithmetic operation and set the condition code. These operations will
3254 be represented as a PARALLEL with the first element of the vector
3255 being a COMPARE of an arithmetic operation with the constant zero.
3256 The second element of the vector will set some pseudo to the result
3257 of the same arithmetic operation. If we simplify the COMPARE, we won't
3258 match such a pattern and so will generate an extra insn. Here we test
3259 for this case, where both the comparison and the operation result are
3260 needed, and make the PARALLEL by just replacing I2DEST in I3SRC with
3261 I2SRC. Later we will make the PARALLEL that contains I2. */
3267 {
3268 rtx newpat_dest;
3274 scalar_int_mode mode;
3283 {
3289 }
3291 /* Do the rest only if op1 is const0_rtx, which may be the
3292 result of simplification. */
3294 {
3295 /* If a single use of the CC is found, prepare to modify it
3296 when SELECT_CC_MODE returns a new CC-class mode, or when
3297 the above simplify_compare_const() returned a new comparison
3298 operator. undobuf.other_insn is assigned the CC use insn
3299 when modifying it. */
3301 {
3302 #ifdef SELECT_CC_MODE
3303 machine_mode new_mode
3308 {
3313 else
3314 {
3317 }
3318 }
3319 #endif
3320 /* Cases for modifying the CC-using comparison. */
3322 /* ??? Do we need to verify the zero rtx? */
3324 {
3325 /* Replace cc_use_loc with entire new RTX. */
3330 }
3332 {
3333 /* Just replace the CC reg with a new mode. */
3336 }
3337 }
3339 /* Now we modify the current newpat:
3340 First, SET_DEST(newpat) is updated if the CC mode has been
3341 altered. For targets without SELECT_CC_MODE, this should be
3342 optimized away. */
3345 /* This is always done to propagate i2src into newpat. */
3348 /* Create new version of i2pat if needed; the below PARALLEL
3349 creation needs this to work correctly. */
3353 }
3354 }
3357 {
3358 /* It is possible that the source of I2 or I1 may be performing
3359 an unneeded operation, such as a ZERO_EXTEND of something
3360 that is known to have the high part zero. Handle that case
3361 by letting subst look at the inner insns.
3363 Another way to do this would be to have a function that tries
3364 to simplify a single insn instead of merging two or more
3365 insns. We don't do this because of the potential of infinite
3366 loops and because of the potential extra memory required.
3367 However, doing it the way we are is a bit of a kludge and
3368 doesn't catch all cases.
3370 But only do this if -fexpensive-optimizations since it slows
3371 things down and doesn't usually win.
3373 This is not done in the COMPARE case above because the
3374 unmodified I2PAT is used in the PARALLEL and so a pattern
3375 with a modified I2SRC would not match. */
3378 {
3379 /* Pass pc_rtx so no substitutions are done, just
3380 simplifications. */
3382 {
3385 }
3389 }
3394 /* If I1 feeds into I2 and I1DEST is in I1SRC, we need to make a unique
3395 copy of I2SRC each time we substitute it, in order to avoid creating
3396 self-referential RTL when we will be substituting I1SRC for I1DEST
3397 later. Likewise if I0 feeds into I2, either directly or indirectly
3398 through I1, and I0DEST is in I0SRC. */
3405 /* Record whether I2's body now appears within I3's body. */
3407 }
3409 /* If we already got a failure, don't try to do more. Otherwise, try to
3410 substitute I1 if we have it. */
3413 {
3414 /* Check that an autoincrement side-effect on I1 has not been lost.
3415 This happens if I1DEST is mentioned in I2 and dies there, and
3416 has disappeared from the new pattern. */
3418 && i1_feeds_i2_n
3421 /* Before we can do this substitution, we must redo the test done
3422 above (see detailed comments there) that ensures I1DEST isn't
3423 mentioned in any SETs in NEWPAT that are field assignments. */
3426 {
3429 }
3434 /* If the following substitution will modify I1SRC, make a copy of it
3435 for the case where it is substituted for I1DEST in I2PAT later. */
3439 /* If I0 feeds into I1 and I0DEST is in I0SRC, we need to make a unique
3440 copy of I1SRC each time we substitute it, in order to avoid creating
3441 self-referential RTL when we will be substituting I0SRC for I0DEST
3442 later. */
3447 /* Record whether I1's body now appears within I3's body. */
3449 }
3451 /* Likewise for I0 if we have it. */
3454 {
3461 {
3464 }
3466 /* If the following substitution will modify I0SRC, make a copy of it
3467 for the case where it is substituted for I0DEST in I1PAT later. */
3470 /* And a copy for I0DEST in I2PAT substitution. */
3479 }
3481 /* Fail if an autoincrement side-effect has been duplicated. Be careful
3482 to count all the ways that I2SRC and I1SRC can be used. */
3493 /* Fail if we tried to make a new register. */
3495 /* Fail if we couldn't do something and have a CLOBBER. */
3497 /* Fail if this new pattern is a MULT and we didn't have one before
3498 at the outer level. */
3501 {
3504 }
3506 /* If the actions of the earlier insns must be kept
3507 in addition to substituting them into the latest one,
3508 we must make a new PARALLEL for the latest insn
3509 to hold additional the SETs. */
3512 {
3514 combine_extras++;
3517 {
3523 }
3524 else
3525 {
3530 }
3536 {
3542 }
3544 {
3553 }
3554 }
3556 validate_replacement:
3558 /* Note which hard regs this insn has as inputs. */
3561 /* If recog_for_combine fails, it strips existing clobbers. If we'll
3562 consider splitting this pattern, we might need these clobbers. */
3565 {
3571 }
3573 /* We have recognized nothing yet. */
3576 /* See if this is a PARALLEL of two SETs where one SET's destination is
3577 a register that is unused and this isn't marked as an instruction that
3578 might trap in an EH region. In that case, we just need the other SET.
3579 We prefer this over the PARALLEL.
3581 This can occur when simplifying a divmod insn. We *must* test for this
3582 case here because the code below that splits two independent SETs doesn't
3583 handle this case correctly when it updates the register status.
3585 It's pointless doing this if we originally had two sets, one from
3586 i3, and one from i2. Combining then splitting the parallel results
3587 in the original i2 again plus an invalid insn (which we delete).
3588 The net effect is only to move instructions around, which makes
3589 debug info less accurate.
3591 If the remaining SET came from I2 its destination should not be used
3592 between I2 and I3. See PR82024. */
3597 {
3608 {
3611 }
3620 {
3625 {
3631 }
3632 }
3636 }
3638 /* Is the result of combination a valid instruction? */
3642 /* If we were combining three insns and the result is a simple SET
3643 with no ASM_OPERANDS that wasn't recognized, try to split it into two
3644 insns. There are two ways to do this. It can be split using a
3645 machine-specific method (like when you have an addition of a large
3646 constant) or by combine in the function find_split_point. */
3650 {
3654 /* See if the MD file can split NEWPAT. If it can't, see if letting it
3655 use I2DEST as a scratch register will help. In the latter case,
3656 convert I2DEST to the mode of the source of NEWPAT if we can. */
3660 /* We can only use I2DEST as a scratch reg if it doesn't overlap any
3661 inputs of NEWPAT. */
3663 /* ??? If I2DEST is not safe, and I1DEST exists, then it would be
3664 possible to try that as a scratch reg. This would require adding
3665 more code to make it work though. */
3668 {
3671 /* ??? Reusing i2dest without resetting the reg_stat entry for it
3672 (temporarily, until we are committed to this instruction
3673 combination) does not work: for example, any call to nonzero_bits
3674 on the register (from a splitter in the MD file, for example)
3675 will get the old information, which is invalid.
3677 Since nowadays we can create registers during combine just fine,
3678 we should just create a new one here, not reuse i2dest. */
3680 /* First try to split using the original register as a
3681 scratch register. */
3685 i2dest)));
3688 /* If that didn't work, try changing the mode of I2DEST if
3689 we can. */
3694 {
3696 rtx ni2dest;
3700 else
3701 {
3704 }
3706 parallel = (gen_rtx_PARALLEL
3710 ni2dest))));
3715 {
3723 }
3724 }
3727 }
3729 /* If recog_for_combine has discarded clobbers, try to use them
3730 again for the split. */
3732 {
3735 }
3738 {
3743 }
3747 {
3757 /* If I2 or I3 has multiple SETs, we won't know how to track
3758 register status, so don't use these insns. If I2's destination
3759 is used between I2 and I3, we also can't use these insns. */
3769 /* It is possible that both insns now set the destination of I3.
3770 If so, we must show an extra use of it. */
3773 {
3792 }
3793 }
3795 /* If we can split it and use I2DEST, go ahead and see if that
3796 helps things be recognized. Verify that none of the registers
3797 are set between I2 and I3. */
3801 /* We need I2DEST in the proper mode. If it is a hard register
3802 or the only use of a pseudo, we can change its mode.
3803 Make sure we don't change a hard register to have a mode that
3804 isn't valid for it, or change the number of registers. */
3811 /* We can't overwrite I2DEST if its value is still used by
3812 NEWPAT. */
3814 {
3823 /* *SPLIT may be part of I2SRC, so make sure we have the
3824 original expression around for later debug processing.
3825 We should not need I2SRC any more in other cases. */
3828 else
3831 /* Get NEWDEST as a register in the proper mode. We have already
3832 validated that we can do this. */
3834 {
3837 else
3838 {
3841 }
3842 }
3844 /* If *SPLIT is a (mult FOO (const_int pow2)), convert it to
3845 an ASHIFT. This can occur if it was inside a PLUS and hence
3846 appeared to be a memory address. This is a kludge. */
3851 {
3855 /* Update split_code because we may not have a multiply
3856 anymore. */
3858 }
3860 /* Similarly for (plus (mult FOO (const_int pow2))). */
3866 {
3871 i_rtx));
3872 /* Update split_code because we may not have a multiply
3873 anymore. */
3875 }
3877 #ifdef INSN_SCHEDULING
3878 /* If *SPLIT is a paradoxical SUBREG, when we split it, it should
3879 be written as a ZERO_EXTEND. */
3881 {
3882 /* Or as a SIGN_EXTEND if LOAD_EXTEND_OP says that that's
3883 what it really is. */
3888 else
3891 }
3892 #endif
3894 /* Attempt to split binary operators using arithmetic identities. */
3898 {
3905 /* Split "X = Y op Y" as "Z = Y; X = Z op Z". */
3907 {
3912 }
3913 /* Split "((P op Q) op R) op S" where op is PLUS or MULT. */
3920 {
3926 /* Split both "((X op Y) op X) op Y" and
3927 "((X op Y) op Y) op X" as "T op T" where T is
3928 "X op Y". */
3931 {
3936 }
3937 /* Split "((X op X) op Y) op Y)" as "T op T" where
3938 T is "X op Y". */
3940 {
3946 }
3947 }
3948 }
3951 {
3954 }
3958 /* recog_for_combine might have added CLOBBERs to newi2pat.
3959 Make sure NEWPAT does not depend on the clobbered regs. */
3963 {
3966 {
3969 }
3970 }
3972 /* If the split point was a MULT and we didn't have one before,
3973 don't use one now. */
3976 }
3977 }
3979 /* Check for a case where we loaded from memory in a narrow mode and
3980 then sign extended it, but we need both registers. In that case,
3981 we have a PARALLEL with both loads from the same memory location.
3982 We can split this into a load from memory followed by a register-register
3983 copy. This saves at least one insn, more if register allocation can
3984 eliminate the copy.
3986 We cannot do this if the destination of the first assignment is a
3987 condition code register or cc0. We eliminate this case by making sure
3988 the SET_DEST and SET_SRC have the same mode.
3990 We cannot do this if the destination of the second assignment is
3991 a register that we have already assumed is zero-extended. Similarly
3992 for a SUBREG of such a register. */
4011 BITS_PER_WORD)
4013 HOST_BITS_PER_INT)
4021 BITS_PER_WORD)
4023 HOST_BITS_PER_INT)
4030 {
4031 rtx ni2dest;
4045 }
4047 /* Similarly, check for a case where we have a PARALLEL of two independent
4048 SETs but we started with three insns. In this case, we can do the sets
4049 as two separate insns. This case occurs when some SET allows two
4050 other insns to combine, but the destination of that SET is still live.
4052 Also do this if we started with two insns and (at least) one of the
4053 resulting sets is a noop; this noop will be deleted later.
4055 Also do this if we started with two insns neither of which was a simple
4056 move. */
4063 && (i1
4077 {
4081 /* Normally, it doesn't matter which of the two is done first,
4082 but the one that references cc0 can't be the second, and
4083 one which uses any regs/memory set in between i2 and i3 can't
4084 be first. The PARALLEL might also have been pre-existing in i3,
4085 so we need to make sure that we won't wrongly hoist a SET to i2
4086 that would conflict with a death note present in there, or would
4087 have its dest modified between i2 and i3. */
4096 /* If I3 is a jump, ensure that set0 is a jump so that
4097 we do not create invalid RTL. */
4099 )
4100 {
4103 }
4112 /* If I3 is a jump, ensure that set1 is a jump so that
4113 we do not create invalid RTL. */
4115 )
4116 {
4119 }
4120 else
4121 {
4124 }
4129 {
4130 /* recog_for_combine might have added CLOBBERs to newi2pat.
4131 Make sure NEWPAT does not depend on the clobbered regs. */
4133 {
4136 {
4139 {
4142 }
4143 }
4144 }
4150 }
4151 }
4153 /* If it still isn't recognized, fail and change things back the way they
4154 were. */
4156 /* Is the result a reasonable ASM_OPERANDS? */
4158 {
4161 }
4163 /* If we had to change another insn, make sure it is valid also. */
4165 {
4173 {
4176 }
4177 }
4179 /* If I2 is the CC0 setter and I3 is the CC0 user then check whether
4180 they are adjacent to each other or not. */
4182 {
4186 {
4189 }
4190 }
4192 /* Only allow this combination if insn_cost reports that the
4193 replacement instructions are cheaper than the originals. */
4195 {
4198 }
4201 {
4206 {
4211 /* Temporarily revert mode back. */
4215 {
4216 /* If we used i2dest as a scratch register with a
4217 different mode, substitute it for the original
4218 i2src while its original mode is temporarily
4219 restored, and then clear i2scratch so that we don't
4220 do it again later. */
4222 this_basic_block);
4224 /* Put back the new mode. */
4226 }
4227 else
4228 {
4233 {
4236 }
4237 else
4238 {
4245 }
4247 /* We're dealing with a reg that changed mode but not
4248 meaning, so we want to turn it into a subreg for
4249 the new mode. However, because of REG sharing and
4250 because its mode had already changed, we have to do
4251 it in two steps. First, replace any debug uses of
4252 reg, with its original mode temporarily restored,
4253 with this copy we have created; then, replace the
4254 copy with the SUBREG of the original shared reg,
4255 once again changed to the new mode. */
4257 this_basic_block);
4261 this_basic_block);
4262 }
4263 }
4264 }
4266 /* If we will be able to accept this, we have made a
4267 change to the destination of I3. This requires us to
4268 do a few adjustments. */
4271 {
4274 }
4276 /* We now know that we can do this combination. Merge the insns and
4277 update the status of registers and LOG_LINKS. */
4280 {
4285 /* If any of the notes in OTHER_INSN were REG_DEAD or REG_UNUSED,
4286 ensure that they are still valid. Then add any non-duplicate
4287 notes added by recog_for_combine. */
4289 {
4298 /* Simply drop equal note since it may be no longer valid
4299 for other_insn. It may be possible to record that CC
4300 register is changed and only discard those notes, but
4301 in practice it's unnecessary complication and doesn't
4302 give any meaningful improvement.
4304 See PR78559. */
4308 }
4312 NULL_RTX);
4313 }
4316 {
4317 /* I3 now uses what used to be its destination and which is now
4318 I2's destination. This requires us to do a few adjustments. */
4321 }
4324 {
4325 /* We might need a LOG_LINK from I3 to I2. But then we used to
4326 have one, so we still will.
4328 However, some later insn might be using I2's dest and have
4329 a LOG_LINK pointing at I3. We should change it to point at
4330 I2 instead. */
4332 /* newi2pat is usually a SET here; however, recog_for_combine might
4333 have added some clobbers. */
4338 /* It can only be a SET of a REG or of a SUBREG of a REG. */
4343 !done
4344 && insn
4348 {
4352 {
4356 }
4357 }
4358 }
4360 {
4365 /* Compute which registers we expect to eliminate. newi2pat may be setting
4366 either i3dest or i2dest, so we must check it. */
4369 || !i2dest_killed
4371 /* For i1, we need to compute both local elimination and global
4372 elimination information with respect to newi2pat because i1dest
4373 may be the same as i3dest, in which case newi2pat may be setting
4374 i1dest. Global information is used when distributing REG_DEAD
4375 note for i2 and i3, in which case it does matter if newi2pat sets
4376 i1dest or not.
4378 Local information is used when distributing REG_DEAD note for i1,
4379 in which case it doesn't matter if newi2pat sets i1dest or not.
4380 See PR62151, if we have four insns combination:
4381 i0: r0 <- i0src
4382 i1: r1 <- i1src (using r0)
4383 REG_DEAD (r0)
4384 i2: r0 <- i2src (using r1)
4385 i3: r3 <- i3src (using r0)
4386 ix: using r0
4387 From i1's point of view, r0 is eliminated, no matter if it is set
4388 by newi2pat or not. In other words, REG_DEAD info for r0 in i1
4389 should be discarded.
4391 Note local information only affects cases in forms like "I1->I2->I3",
4392 "I0->I1->I2->I3" or "I0&I1->I2, I2->I3". For other cases like
4393 "I0->I1, I1&I2->I3" or "I1&I2->I3", newi2pat won't set i1dest or
4394 i0dest anyway. */
4396 || !i1dest_killed
4401 /* Same case as i1. */
4408 /* Get the old REG_NOTES and LOG_LINKS from all our insns and
4409 clear them. */
4417 /* Ensure that we do not have something that should not be shared but
4418 occurs multiple times in the new insns. Check this by first
4419 resetting all the `used' flags and then copying anything is shared. */
4443 {
4446 {
4448 {
4449 /* I2SRC must still be meaningful at this point. Some
4450 splitting operations can invalidate I2SRC, but those
4451 operations do not apply to calls. */
4455 }
4462 }
4463 }
4468 /* We had one special case above where I2 had more than one set and
4469 we replaced a destination of one of those sets with the destination
4470 of I3. In that case, we have to update LOG_LINKS of insns later
4471 in this basic block. Note that this (expensive) case is rare.
4473 Also, in this case, we must pretend that all REG_NOTEs for I2
4474 actually came from I3, so that REG_UNUSED notes from I2 will be
4475 properly handled. */
4478 {
4487 temp_insn
4497 {
4502 }
4503 else
4506 }
4514 {
4517 this_basic_block);
4520 }
4521 else
4522 {
4525 this_basic_block);
4527 }
4530 {
4535 this_basic_block);
4537 }
4540 {
4545 this_basic_block);
4547 }
4549 /* Get death notes for everything that is now used in either I3 or
4550 I2 and used to die in a previous insn. If we built two new
4551 patterns, move from I1 to I2 then I2 to I3 so that we get the
4552 proper movement on registers that I2 modifies. */
4558 else
4564 /* Distribute all the LOG_LINKS and REG_NOTES from I1, I2, and I3. */
4581 /* Distribute any notes added to I2 or I3 by recog_for_combine. We
4582 know these are REG_UNUSED and want them to go to the desired insn,
4583 so we always pass it as i3. */
4587 NULL_RTX);
4591 NULL_RTX);
4593 /* If I3DEST was used in I3SRC, it really died in I3. We may need to
4594 put a REG_DEAD note for it somewhere. If NEWI2PAT exists and sets
4595 I3DEST, the death must be somewhere before I2, not I3. If we passed I3
4596 in that case, it might delete I2. Similarly for I2 and I1.
4597 Show an additional death due to the REG_DEAD note we make here. If
4598 we discard it in distribute_notes, we will decrement it again. */
4601 {
4606 else
4609 }
4612 {
4617 else
4620 }
4623 {
4628 else
4631 }
4634 {
4639 else
4642 }
4650 {
4655 /* The insn that used to set this register doesn't exist, and
4656 this life of the register may not exist either. See if one of
4657 I3's links points to an insn that sets I2DEST. If it does,
4658 that is now the last known value for I2DEST. If we don't update
4659 this and I2 set the register to a value that depended on its old
4660 contents, we will get confused. If this insn is used, thing
4661 will be set correctly in combine_instructions. */
4669 /* If the reg formerly set in I2 died only once and that was in I3,
4670 zero its use count so it won't make `reload' do any work. */
4673 && ! i2dest_in_i2src
4676 }
4679 {
4692 && ! i1dest_in_i1src
4695 }
4698 {
4711 && ! i0dest_in_i0src
4714 }
4716 /* Update reg_stat[].nonzero_bits et al for any changes that may have
4717 been made to this insn. The order is important, because newi2pat
4718 can affect nonzero_bits of newpat. */
4722 }
4725 {
4727 {
4730 }
4732 }
4735 {
4737 {
4740 }
4742 }
4745 {
4747 {
4750 }
4752 }
4755 {
4757 {
4760 }
4762 }
4765 {
4767 {
4770 }
4772 }
4774 /* Set new_direct_jump_p if a new return or simple jump instruction
4775 has been created. Adjust the CFG accordingly. */
4777 {
4781 }
4786 {
4789 }
4793 {
4799 }
4804 {
4810 }
4812 /* A noop might also need cleaning up of CFG, if it comes from the
4813 simplification of a jump. */
4818 {
4821 }
4828 {
4831 }
4833 combine_successes++;
4843 }
4844 \f
4845 /* Get a marker for undoing to the current state. */
4849 {
4851 }
4853 /* Undo the modifications up to the marker. */
4855 static void
4857 {
4861 {
4866 {
4881 }
4885 }
4888 }
4890 /* Undo all the modifications recorded in undobuf. */
4892 static void
4894 {
4896 }
4898 /* We've committed to accepting the changes we made. Move all
4899 of the undos to the free list. */
4901 static void
4903 {
4907 {
4911 }
4913 }
4914 \f
4915 /* Find the innermost point within the rtx at LOC, possibly LOC itself,
4916 where we have an arithmetic expression and return that point. LOC will
4917 be inside INSN.
4919 try_combine will call this function to see if an insn can be split into
4920 two insns. */
4924 {
4934 /* First special-case some codes. */
4936 {
4938 #ifdef INSN_SCHEDULING
4939 /* If we are making a paradoxical SUBREG invalid, it becomes a split
4940 point. */
4943 #endif
4947 /* If we have (mem (const ..)) or (mem (symbol_ref ...)), split it
4948 using LO_SUM and HIGH. */
4951 {
4959 }
4961 /* If we have a PLUS whose second operand is a constant and the
4962 address is not valid, perhaps we can split it up using
4963 the machine-specific way to split large constants. We use
4964 the first pseudo-reg (one of the virtual regs) as a placeholder;
4965 it will not remain in the result. */
4970 {
4973 subst_insn);
4975 /* This should have produced two insns, each of which sets our
4976 placeholder. If the source of the second is a valid address,
4977 we can put both sources together and make a split point
4978 in the middle. */
4991 && memory_address_addr_space_p
4994 {
4998 /* Replace the placeholder in SRC2 with SRC1. If we can
4999 find where in SRC2 it was placed, that can become our
5000 split point and we can replace this address with SRC2.
5001 Just try two obvious places. */
5012 {
5015 }
5016 }
5018 /* If that didn't work and we have a nested plus, like:
5019 ((REG1 * CONST1) + REG2) + CONST2 and (REG1 + REG2) + CONST2
5020 is valid address, try to split (REG1 * CONST1). */
5027 {
5032 {
5035 }
5037 }
5044 {
5049 {
5052 }
5054 }
5056 /* If that didn't work, perhaps the first operand is complex and
5057 needs to be computed separately, so make a split point there.
5058 This will occur on machines that just support REG + CONST
5059 and have a constant moved through some previous computation. */
5064 }
5066 /* If we have a PLUS whose first operand is complex, try computing it
5067 separately by making a split there. */
5078 /* If SET_DEST is CC0 and SET_SRC is not an operand, a COMPARE, or a
5079 ZERO_EXTRACT, the most likely reason why this doesn't match is that
5080 we need to put the operand into a register. So split at that
5081 point. */
5091 /* See if we can split SET_SRC as it stands. */
5096 /* See if we can split SET_DEST as it stands. */
5101 /* See if this is a bitfield assignment with everything constant. If
5102 so, this is an IOR of an AND, so split it into that. */
5114 {
5119 unsigned HOST_WIDE_INT mask
5121 rtx or_mask;
5130 else
5131 {
5137 or_mask));
5138 }
5145 }
5147 /* Otherwise, see if this is an operation that we can split into two.
5148 If so, try to split that. */
5152 {
5154 /* If we are AND'ing with a large constant that is only a single
5155 bit and the result is only being used in a context where we
5156 need to know if it is zero or nonzero, replace it with a bit
5157 extraction. This will avoid the large constant, which might
5158 have taken more than one insn to make. If the constant were
5159 not a valid argument to the AND but took only one insn to make,
5160 this is no worse, but if it took more than one insn, it will
5161 be better. */
5171 {
5176 {
5179 }
5180 }
5184 /* If STORE_FLAG_VALUE is -1, this is (NE X 0) and only one bit of X
5185 is known to be on, this can be converted into a NEG of a shift. */
5191 {
5198 pos_rtx)));
5203 }
5209 /* We can't optimize if either mode is a partial integer
5210 mode as we don't know how many bits are significant
5211 in those modes. */
5227 {
5235 }
5240 }
5246 {
5247 /* For unsigned, we have a choice of a shift followed by an
5248 AND or two shifts. Use two shifts for field sizes where the
5249 constant might be too large. We assume here that we can
5250 always at least get 8-bit constants in an AND insn, which is
5251 true for every current RISC. */
5254 {
5255 unsigned HOST_WIDE_INT mask
5260 gen_rtx_LSHIFTRT
5267 }
5268 else
5269 {
5273 gen_rtx_fmt_ee
5283 }
5284 }
5286 /* See if this is a simple operation with a constant as the second
5287 operand. It might be that this constant is out of range and hence
5288 could be used as a split point. */
5296 /* Finally, see if this is a simple operation with its first operand
5297 not in a register. The operation might require this operand in a
5298 register, so return it as a split point. We can always do this
5299 because if the first operand were another operation, we would have
5300 already found it as a split point. */
5309 /* We write NOR as (and (not A) (not B)), but if we don't have a NOR,
5310 it is better to write this as (not (ior A B)) so we can split it.
5311 Similarly for IOR. */
5313 {
5321 }
5323 /* Many RISC machines have a large set of logical insns. If the
5324 second operand is a NOT, put it first so we will try to split the
5325 other operand first. */
5327 {
5331 }
5336 /* Canonicalization can produce (minus A (mult B C)), where C is a
5337 constant. It may be better to try splitting (plus (mult B -C) A)
5338 instead if this isn't a multiply by a power of two. */
5342 {
5350 mode)),
5353 }
5355 /* Split at a multiply-accumulate instruction. However if this is
5356 the SET_SRC, we likely do not have such an instruction and it's
5357 worthless to try this split. */
5366 }
5368 /* Otherwise, select our actions depending on our rtx class. */
5370 {
5376 /* fall through */
5384 /* fall through */
5386 /* Some machines have (and (shift ...) ...) insns. If X is not
5387 an AND, but XEXP (X, 0) is, use it as our split point. */
5397 /* Otherwise, we don't have a split point. */
5399 }
5400 }
5401 \f
5402 /* Throughout X, replace FROM with TO, and return the result.
5403 The result is TO if X is FROM;
5404 otherwise the result is X, but its contents may have been modified.
5405 If they were modified, a record was made in undobuf so that
5406 undo_all will (among other things) return X to its original state.
5408 If the number of changes necessary is too much to record to undo,
5409 the excess changes are not made, so the result is invalid.
5410 The changes already made can still be undone.
5411 undobuf.num_undo is incremented for such changes, so by testing that
5412 the caller can tell whether the result is valid.
5414 `n_occurrences' is incremented each time FROM is replaced.
5416 IN_DEST is nonzero if we are processing the SET_DEST of a SET.
5418 IN_COND is nonzero if we are at the top level of a condition.
5420 UNIQUE_COPY is nonzero if each substitution must be unique. We do this
5421 by copying if `n_occurrences' is nonzero. */
5423 static rtx
5425 {
5430 rtx new_rtx;
5432 /* Two expressions are equal if they are identical copies of a shared
5433 RTX or if they are both registers with the same register number
5434 and mode. */
5436 #define COMBINE_RTX_EQUAL_P(X,Y) \
5437 ((X) == (Y) \
5438 || (REG_P (X) && REG_P (Y) \
5439 && REGNO (X) == REGNO (Y) && GET_MODE (X) == GET_MODE (Y)))
5441 /* Do not substitute into clobbers of regs -- this will never result in
5442 valid RTL. */
5447 {
5448 n_occurrences++;
5450 }
5452 /* If X and FROM are the same register but different modes, they
5453 will not have been seen as equal above. However, the log links code
5454 will make a LOG_LINKS entry for that case. If we do nothing, we
5455 will try to rerecognize our original insn and, when it succeeds,
5456 we will delete the feeding insn, which is incorrect.
5458 So force this insn not to match in this (rare) case. */
5463 /* If this is an object, we are done unless it is a MEM or LO_SUM, both
5464 of which may contain things that can be combined. */
5468 /* It is possible to have a subexpression appear twice in the insn.
5469 Suppose that FROM is a register that appears within TO.
5470 Then, after that subexpression has been scanned once by `subst',
5471 the second time it is scanned, TO may be found. If we were
5472 to scan TO here, we would find FROM within it and create a
5473 self-referent rtl structure which is completely wrong. */
5477 /* Parallel asm_operands need special attention because all of the
5478 inputs are shared across the arms. Furthermore, unsharing the
5479 rtl results in recognition failures. Failure to handle this case
5480 specially can result in circular rtl.
5482 Solve this by doing a normal pass across the first entry of the
5483 parallel, and only processing the SET_DESTs of the subsequent
5484 entries. Ug. */
5489 {
5492 /* If this substitution failed, this whole thing fails. */
5500 {
5506 {
5509 /* If this substitution failed, this whole thing fails. */
5515 }
5516 }
5517 }
5518 else
5519 {
5523 /* We don't need to process a SET_DEST that is a register, CC0,
5524 or PC, so set up to skip this common case. All other cases
5525 where we want to suppress replacing something inside a
5526 SET_SRC are handled via the IN_DEST operand. */
5533 /* Trying to simplify the operands of a widening MULT is not likely
5534 to create RTL matching a machine insn. */
5546 /* Get the mode of operand 0 in case X is now a SIGN_EXTEND of a
5547 constant. */
5552 {
5554 {
5557 {
5559 {
5562 n_occurrences++;
5563 }
5564 else
5565 {
5567 unique_copy);
5569 /* If this substitution failed, this whole thing
5570 fails. */
5574 }
5577 }
5578 }
5580 {
5581 /* If this is a register being set, ignore it. */
5588 ;
5591 {
5592 /* In general, don't install a subreg involving two
5593 modes not tieable. It can worsen register
5594 allocation, and can even make invalid reload
5595 insns, since the reg inside may need to be copied
5596 from in the outside mode, and that may be invalid
5597 if it is an fp reg copied in integer mode.
5599 We allow two exceptions to this: It is valid if
5600 it is inside another SUBREG and the mode of that
5601 SUBREG and the mode of the inside of TO is
5602 tieable and it is valid if X is a SET that copies
5603 FROM to CC0. */
5611 && (!HAVE_cc0
5626 n_occurrences++;
5627 }
5628 else
5629 /* If we are in a SET_DEST, suppress most cases unless we
5630 have gone inside a MEM, in which case we want to
5631 simplify the address. We assume here that things that
5632 are actually part of the destination have their inner
5633 parts in the first expression. This is true for SUBREG,
5634 STRICT_LOW_PART, and ZERO_EXTRACT, which are the only
5635 things aside from REG and MEM that should appear in a
5636 SET_DEST. */
5638 (((in_dest
5644 unique_copy);
5646 /* If we found that we will have to reject this combination,
5647 indicate that by returning the CLOBBER ourselves, rather than
5648 an expression containing it. This will speed things up as
5649 well as prevent accidents where two CLOBBERs are considered
5650 to be equal, thus producing an incorrect simplification. */
5656 {
5664 }
5669 {
5671 new_rtx,
5675 }
5676 else
5678 }
5679 }
5680 }
5682 /* Check if we are loading something from the constant pool via float
5683 extension; in this case we would undo compress_float_constant
5684 optimization and degenerate constant load to an immediate value. */
5688 {
5692 }
5694 /* Try to simplify X. If the simplification changed the code, it is likely
5695 that further simplification will help, so loop, but limit the number
5696 of repetitions that will be performed. */
5699 {
5700 /* If X is sufficiently simple, don't bother trying to do anything
5701 with it. */
5710 /* We no longer know the original mode of operand 0 since we
5711 have changed the form of X) */
5713 }
5716 }
5717 \f
5718 /* If X is a commutative operation whose operands are not in the canonical
5719 order, use substitutions to swap them. */
5721 static void
5723 {
5726 {
5730 }
5731 }
5733 /* Simplify X, a piece of RTL. We just operate on the expression at the
5734 outer level; call `subst' to simplify recursively. Return the new
5735 expression.
5737 OP0_MODE is the original mode of XEXP (x, 0). IN_DEST is nonzero
5738 if we are inside a SET_DEST. IN_COND is nonzero if we are at the top level
5739 of a condition. */
5741 static rtx
5744 {
5747 scalar_int_mode int_mode;
5748 rtx temp;
5751 /* If this is a commutative operation, put a constant last and a complex
5752 expression first. We don't need to do this for comparisons here. */
5755 /* Try to fold this expression in case we have constants that weren't
5756 present before. */
5759 {
5767 {
5770 {
5774 }
5777 }
5790 }
5793 {
5798 }
5800 /* If this is a simple operation applied to an IF_THEN_ELSE, try
5801 applying it to the arms of the IF_THEN_ELSE. This often simplifies
5802 things. Check for cases where both arms are testing the same
5803 condition.
5805 Don't do anything if all operands are very simple. */
5818 {
5823 /* If everything is a comparison, what we have is highly unlikely
5824 to be simpler, so don't use it. */
5827 /* Similarly, if we end up with one of the expressions the same
5828 as the original, it is certainly not simpler. */
5831 {
5838 /* Simplify the alternative arms; this may collapse the true and
5839 false arms to store-flag values. Be careful to use copy_rtx
5840 here since true_rtx or false_rtx might share RTL with x as a
5841 result of the if_then_else_cond call above. */
5845 /* If true_rtx and false_rtx are not general_operands, an if_then_else
5846 is unlikely to be simpler. */
5849 {
5852 /* Restarting if we generate a store-flag expression will cause
5853 us to loop. Just drop through in this case. */
5855 /* If the result values are STORE_FLAG_VALUE and zero, we can
5856 just make the comparison operation. */
5867 /* Likewise, we can make the negate of a comparison operation
5868 if the result values are - STORE_FLAG_VALUE and zero. */
5876 mode);
5887 mode);
5888 else
5891 mode,
5892 VOIDmode,
5893 cond,
5894 cop1),
5899 }
5900 }
5901 }
5903 /* First see if we can apply the inverse distributive law. */
5906 {
5910 }
5912 /* If CODE is an associative operation not otherwise handled, see if we
5913 can associate some operands. This can win if they are constants or
5914 if they are logically related (i.e. (a & b) & a). */
5920 {
5922 {
5926 rtx inner;
5928 /* Make sure we pass the constant operand if any as the second
5929 one if this is a commutative operation. */
5937 /* For commutative operations, try the other pair if that one
5938 didn't simplify. */
5940 {
5945 }
5949 }
5950 }
5952 /* A little bit of algebraic simplification here. */
5954 {
5956 /* Ensure that our address has any ASHIFTs converted to MULT in case
5957 address-recognizing predicates are called later. */
5966 /* See if this can be moved to simplify_subreg. */
5969 /* Don't call gen_lowpart if the inner mode
5970 is VOIDmode and we cannot simplify it, as SUBREG without
5971 inner mode is invalid. */
5978 {
5979 rtx temp;
5985 /* If op is known to have all lower bits zero, the result is zero. */
5999 }
6001 /* Don't change the mode of the MEM if that would change the meaning
6002 of the address. */
6009 /* Note that we cannot do any narrowing for non-constants since
6010 we might have been counting on using the fact that some bits were
6011 zero. We now do this in the SET. */
6018 /* For C equal to the width of MODE minus 1, (neg (ashiftrt X C)) can be
6019 replaced by (lshiftrt X C). This will convert
6020 (neg (sign_extract X 1 Y)) to (zero_extract X 1 Y). */
6028 /* If X has only a single bit that might be nonzero, say, bit I, convert
6029 (neg X) to (ashiftrt (ashift X C-I) C-I) where C is the bitsize of
6030 MODE minus 1. This will convert (neg (zero_extract X 1 Y)) to
6031 (sign_extract X 1 Y). But only do this if TEMP isn't a register
6032 or a SUBREG of one since we'd be making the expression more
6033 complex if it was just a register. */
6040 {
6041 rtx temp1 = simplify_shift_const
6047 /* If all we did was surround TEMP with the two shifts, we
6048 haven't improved anything, so don't use it. Otherwise,
6049 we are better off with TEMP1. */
6054 }
6058 /* We can't handle truncation to a partial integer mode here
6059 because we don't know the real bitsize of the partial
6060 integer mode. */
6069 /* We can truncate a constant value and return it. */
6070 {
6071 poly_int64 c;
6074 }
6076 /* Similarly to what we do in simplify-rtx.c, a truncate of a register
6077 whose value is a comparison can be replaced with a subreg if
6078 STORE_FLAG_VALUE permits. */
6087 /* (const (const X)) can become (const X). Do it this way rather than
6088 returning the inner CONST since CONST can be shared with a
6089 REG_EQUAL note. */
6095 /* Convert (lo_sum (high FOO) FOO) to FOO. This is necessary so we
6096 can add in an offset. find_split_point will split this address up
6097 again if it doesn't match. */
6104 /* (plus (xor (and <foo> (const_int pow2 - 1)) <c>) <-c>)
6105 when c is (const_int (pow2 + 1) / 2) is a sign extension of a
6106 bit-field and can be replaced by either a sign_extend or a
6107 sign_extract. The `and' may be a zero_extend and the two
6108 <c>, -<c> constants may be reversed. */
6125 return simplify_shift_const
6132 /* If only the low-order bit of X is possibly nonzero, (plus x -1)
6133 can become (ashiftrt (ashift (xor x 1) C) C) where C is
6134 the bitsize of the mode - 1. This allows simplification of
6135 "a = (b & 8) == 0;" */
6142 return simplify_shift_const
6146 const1_rtx),
6150 /* If we are adding two things that have no bits in common, convert
6151 the addition into an IOR. This will often be further simplified,
6152 for example in cases like ((a & 1) + (a & 2)), which can
6153 become a & 3. */
6158 {
6159 /* Try to simplify the expression further. */
6163 /* If we could, great. If not, do not go ahead with the IOR
6164 replacement, since PLUS appears in many special purpose
6165 address arithmetic instructions. */
6173 }
6175 /* Canonicalize x + x into x << 1. */
6184 /* (minus <foo> (and <foo> (const_int -pow2))) becomes
6185 (and <foo> (const_int pow2-1)) */
6196 /* If we have (mult (plus A B) C), apply the distributive law and then
6197 the inverse distributive law to see if things simplify. This
6198 occurs mostly in addresses, often when unrolling loops. */
6201 {
6205 }
6207 /* Try simplify a*(b/c) as (a*b)/c. */
6210 {
6216 }
6220 /* If this is a divide by a power of two, treat it as a shift if
6221 its first operand is a shift. */
6241 /* If the first operand is a condition code, we can't do anything
6242 with it. */
6246 {
6254 /* Simplify our comparison, if possible. */
6257 /* If STORE_FLAG_VALUE is 1, we can convert (ne x 0) to simply X
6258 if only the low-order bit is possibly nonzero in X (such as when
6259 X is a ZERO_EXTRACT of one bit). Similarly, we can convert EQ to
6260 (xor X 1) or (minus 1 X); we use the former. Finally, if X is
6261 known to be either 0 or -1, NE becomes a NEG and EQ becomes
6262 (plus X 1).
6264 Remove any ZERO_EXTRACT we made when thinking this was a
6265 comparison. It may now be simpler to use, e.g., an AND. If a
6266 ZERO_EXTRACT is indeed appropriate, it will be placed back by
6267 the call to make_compound_operation in the SET case.
6269 Don't apply these optimizations if the caller would
6270 prefer a comparison rather than a value.
6271 E.g., for the condition in an IF_THEN_ELSE most targets need
6272 an explicit comparison. */
6275 ;
6293 {
6297 int_mode);
6298 }
6306 {
6310 const1_rtx);
6311 }
6320 {
6323 }
6325 /* If STORE_FLAG_VALUE is -1, we have cases similar to
6326 those above. */
6328 ;
6345 {
6349 int_mode);
6350 }
6359 {
6363 int_mode);
6364 }
6366 /* If X is 0/1, (eq X 0) is X-1. */
6373 {
6376 }
6378 /* If STORE_FLAG_VALUE says to just test the sign bit and X has just
6379 one bit that might be nonzero, we can convert (ne x 0) to
6380 (ashift x c) where C puts the bit in the sign bit. Remove any
6381 AND with STORE_FLAG_VALUE when we are done, since we are only
6382 going to test the sign bit. */
6390 {
6396 else
6398 }
6400 /* If the code changed, return a whole new comparison.
6401 We also need to avoid using SUBST in cases where
6402 simplify_comparison has widened a comparison with a CONST_INT,
6403 since in that case the wider CONST_INT may fail the sanity
6404 checks in do_SUBST. */
6411 /* Otherwise, keep this operation, but maybe change its operands.
6412 This also converts (ne (compare FOO BAR) 0) to (ne FOO BAR). */
6415 }
6425 /* If we are processing SET_DEST, we are done. */
6443 /* If this is a shift by a constant amount, simplify it. */
6451 (HOST_WIDE_INT_1U
6460 }
6463 }
6464 \f
6465 /* Simplify X, an IF_THEN_ELSE expression. Return the new expression. */
6467 static rtx
6469 {
6476 rtx temp;
6479 rtx reversed;
6482 /* Simplify storing of the truth value. */
6487 /* Also when the truth value has to be reversed. */
6493 /* Sometimes we can simplify the arm of an IF_THEN_ELSE if a register used
6494 in it is being compared against certain values. Get the true and false
6495 comparisons and see if that says anything about the value of each arm. */
6501 {
6502 HOST_WIDE_INT nzb;
6508 /* If FALSE_CODE is EQ, swap the codes and arms. */
6511 {
6514 }
6516 scalar_int_mode from_mode;
6518 {
6519 /* If we are comparing against zero and the expression being
6520 tested has only a single bit that might be nonzero, that is
6521 its value when it is not equal to zero. Similarly if it is
6522 known to be -1 or 0. */
6526 {
6529 }
6534 {
6537 }
6538 }
6540 /* Now simplify an arm if we know the value of the register in the
6541 branch and it is used in the arm. Be careful due to the potential
6542 of locally-shared RTL. */
6559 }
6561 /* If we have (if_then_else FOO (pc) (label_ref BAR)) and FOO can be
6562 reversed, do so to avoid needing two sets of patterns for
6563 subtract-and-branch insns. Similarly if we have a constant in the true
6564 arm, the false arm is the same as the first operand of the comparison, or
6565 the false arm is more complicated than the true arm. */
6578 {
6587 /* It is possible that the conditional has been simplified out. */
6590 }
6592 /* If the two arms are identical, we don't need the comparison. */
6597 /* Convert a == b ? b : a to "a". */
6609 /* Look for cases where we have (abs x) or (neg (abs X)). */
6612 && comparison_p
6619 {
6625 return
6628 mode);
6631 }
6633 /* Look for MIN or MAX. */
6636 && comparison_p
6641 {
6656 }
6658 /* If we have (if_then_else COND (OP Z C1) Z) and OP is an identity when its
6659 second operand is zero, this can be done as (OP Z (mult COND C2)) where
6660 C2 = C1 * STORE_FLAG_VALUE. Similarly if OP has an outer ZERO_EXTEND or
6661 SIGN_EXTEND as long as Z is already extended (so we don't destroy it).
6662 We can do this kind of thing in some cases when STORE_FLAG_VALUE is
6663 neither 1 or -1, but it isn't worth checking for. */
6666 && comparison_p
6669 {
6685 /* If an identity-zero op is commutative, check whether there
6686 would be a match if we swapped the operands. */
6707 {
6711 }
6724 {
6728 }
6745 {
6749 }
6762 {
6766 }
6769 {
6779 const_true_rtx));
6787 }
6788 }
6790 /* If we have (if_then_else (ne A 0) C1 0) and either A is known to be 0 or
6791 1 and C1 is a single bit or A is known to be 0 or -1 and C1 is the
6792 negation of a single bit, we can convert this operation to a shift. We
6793 can actually do this more generally, but it doesn't seem worth it. */
6805 return
6809 /* (IF_THEN_ELSE (NE A 0) C1 0) is A or a zero-extend of A if the only
6810 non-zero bit in A is C1. */
6818 {
6824 }
6827 }
6828 \f
6829 /* Simplify X, a SET expression. Return the new expression. */
6831 static rtx
6833 {
6836 machine_mode mode
6840 scalar_int_mode int_mode;
6842 /* (set (pc) (return)) gets written as (return). */
6846 /* Now that we know for sure which bits of SRC we are using, see if we can
6847 simplify the expression for the object knowing that we only need the
6848 low-order bits. */
6851 {
6854 }
6856 /* If we are setting CC0 or if the source is a COMPARE, look for the use of
6857 the comparison result and try to simplify it unless we already have used
6858 undobuf.other_insn. */
6866 {
6875 {
6878 {
6881 }
6882 }
6883 else
6891 {
6895 }
6896 else
6897 {
6902 /* Attempt to simplify CC user. */
6904 {
6908 }
6910 /* Convert X into a no-op move. */
6914 }
6916 /* Simplify our comparison, if possible. */
6919 #ifdef SELECT_CC_MODE
6920 /* If this machine has CC modes other than CCmode, check to see if we
6921 need to use a different CC mode here. */
6930 else
6933 /* If the mode changed, we have to change SET_DEST, the mode in the
6934 compare, and the mode in the place SET_DEST is used. If SET_DEST is
6935 a hard register, just build new versions with the proper mode. If it
6936 is a pseudo, we lose unless it is only time we set the pseudo, in
6937 which case we can safely change its mode. */
6939 {
6941 {
6943 rtx new_dest;
6947 else
6948 {
6951 }
6958 }
6959 }
6962 /* If the code changed, we have to build a new comparison in
6963 undobuf.other_insn. */
6965 {
6974 /* If the only change we made was to change an EQ into an NE or
6975 vice versa, OP0 has only one bit that might be nonzero, and OP1
6976 is zero, check if changing the user of the condition code will
6977 produce a valid insn. If it won't, we can keep the original code
6978 in that insn by surrounding our operation with an XOR. */
6985 {
6990 {
6997 }
6998 }
6999 }
7004 /* Don't generate a compare of a CC with 0, just use that CC. */
7006 {
7009 }
7010 /* Otherwise, if we didn't previously have the same COMPARE we
7011 want, create it from scratch. */
7014 {
7017 }
7018 }
7019 else
7020 {
7021 /* Get SET_SRC in a form where we have placed back any
7022 compound expressions. Then do the checks below. */
7025 }
7027 /* If we have (set x (subreg:m1 (op:m2 ...) 0)) with OP being some operation,
7028 and X being a REG or (subreg (reg)), we may be able to convert this to
7029 (set (subreg:m2 x) (op)).
7031 We can always do this if M1 is narrower than M2 because that means that
7032 we only care about the low bits of the result.
7034 However, on machines without WORD_REGISTER_OPERATIONS defined, we cannot
7035 perform a narrower operation than requested since the high-order bits will
7036 be undefined. On machine where it is defined, this transformation is safe
7037 as long as M1 and M2 have the same number of words. */
7041 && (known_equal_after_align_up
7044 UNITS_PER_WORD))
7053 {
7056 dest));
7060 }
7062 /* If we have (set (cc0) (subreg ...)), we try to remove the subreg
7063 in SRC. */
7067 {
7071 /* Here we make sure that we don't have a sign bit on. */
7074 {
7077 }
7078 }
7080 /* If we have (set FOO (subreg:M (mem:N BAR) 0)) with M wider than N, this
7081 would require a paradoxical subreg. Replace the subreg with a
7082 zero_extend to avoid the reload that would otherwise be required.
7083 Don't do this unless we have a scalar integer mode, otherwise the
7084 transformation is incorrect. */
7091 {
7096 }
7098 /* If we don't have a conditional move, SET_SRC is an IF_THEN_ELSE, and we
7099 are comparing an item known to be 0 or -1 against 0, use a logical
7100 operation instead. Check for one of the arms being an IOR of the other
7101 arm with some value. We compute three terms to be IOR'ed together. In
7102 practice, at most two will be nonzero. Then we do the IOR's. */
7110 && (!HAVE_conditional_move
7115 {
7140 int_mode),
7141 false_rtx);
7147 term3));
7150 }
7152 /* If either SRC or DEST is a CLOBBER of (const_int 0), make this
7153 whole thing fail. */
7158 else
7159 /* Convert this into a field assignment operation, if possible. */
7161 }
7162 \f
7163 /* Simplify, X, and AND, IOR, or XOR operation, and return the simplified
7164 result. */
7166 static rtx
7168 {
7171 scalar_int_mode mode;
7174 {
7176 /* We can call simplify_and_const_int only if we don't lose
7177 any (sign) bits when converting INTVAL (op1) to
7178 "unsigned HOST_WIDE_INT". */
7183 {
7190 }
7192 /* If we have any of (and (ior A B) C) or (and (xor A B) C),
7193 apply the distributive law and then the inverse distributive
7194 law to see if things simplify. */
7196 {
7200 }
7202 {
7206 }
7210 /* If we have (ior (and A B) C), apply the distributive law and then
7211 the inverse distributive law to see if things simplify. */
7214 {
7218 }
7221 {
7225 }
7230 }
7233 }
7234 \f
7235 /* We consider ZERO_EXTRACT, SIGN_EXTRACT, and SIGN_EXTEND as "compound
7236 operations" because they can be replaced with two more basic operations.
7237 ZERO_EXTEND is also considered "compound" because it can be replaced with
7238 an AND operation, which is simpler, though only one operation.
7240 The function expand_compound_operation is called with an rtx expression
7241 and will convert it to the appropriate shifts and AND operations,
7242 simplifying at each stage.
7244 The function make_compound_operation is called to convert an expression
7245 consisting of shifts and ANDs into the equivalent compound expression.
7246 It is the inverse of this function, loosely speaking. */
7248 static rtx
7250 {
7254 rtx tem;
7255 scalar_int_mode inner_mode;
7258 {
7261 /* FALLTHRU */
7263 /* We can't necessarily use a const_int for a multiword mode;
7264 it depends on implicitly extending the value.
7265 Since we don't know the right way to extend it,
7266 we can't tell whether the implicit way is right.
7268 Even for a mode that is no wider than a const_int,
7269 we can't win, because we need to sign extend one of its bits through
7270 the rest of it, and we don't know which bit. */
7274 /* Reject modes that aren't scalar integers because turning vector
7275 or complex modes into shifts causes problems. */
7279 /* Return if (subreg:MODE FROM 0) is not a safe replacement for
7280 (zero_extend:MODE FROM) or (sign_extend:MODE FROM). It is for any MEM
7281 because (SUBREG (MEM...)) is guaranteed to cause the MEM to be
7282 reloaded. If not for that, MEM's would very rarely be safe.
7284 Reject modes bigger than a word, because we might not be able
7285 to reference a two-register group starting with an arbitrary register
7286 (and currently gen_lowpart might crash for a SUBREG). */
7292 /* If the inner object has VOIDmode (the only way this can happen
7293 is if it is an ASM_OPERANDS), we can't do anything since we don't
7294 know how much masking to do. */
7303 /* fall through */
7306 /* If the operand is a CLOBBER, just return it. */
7314 /* Reject modes that aren't scalar integers because turning vector
7315 or complex modes into shifts causes problems. */
7322 /* This should stay within the object being extracted, fail otherwise. */
7333 }
7335 /* We've rejected non-scalar operations by now. */
7338 /* Convert sign extension to zero extension, if we know that the high
7339 bit is not set, as this is easier to optimize. It will be converted
7340 back to cheaper alternative in make_extraction. */
7346 {
7350 /* Make sure this is a profitable operation. */
7357 else
7359 }
7361 /* We can optimize some special cases of ZERO_EXTEND. */
7363 {
7364 /* (zero_extend:DI (truncate:SI foo:DI)) is just foo:DI if we
7365 know that the last value didn't have any inappropriate bits
7366 set. */
7374 /* Likewise for (zero_extend:DI (subreg:SI foo:DI 0)). */
7383 /* (zero_extend:DI (truncate:SI foo:DI)) is just foo:DI when foo
7384 is a comparison and STORE_FLAG_VALUE permits. This is like
7385 the first case, but it works even when MODE is larger
7386 than HOST_WIDE_INT. */
7394 /* Likewise for (zero_extend:DI (subreg:SI foo:DI 0)). */
7403 }
7405 /* If we reach here, we want to return a pair of shifts. The inner
7406 shift is a left shift of BITSIZE - POS - LEN bits. The outer
7407 shift is a right shift of BITSIZE - LEN bits. It is arithmetic or
7408 logical depending on the value of UNSIGNEDP.
7410 If this was a ZERO_EXTEND or ZERO_EXTRACT, this pair of shifts will be
7411 converted into an AND of a shift.
7413 We must check for the case where the left shift would have a negative
7414 count. This can happen in a case like (x >> 31) & 255 on machines
7415 that can't shift by a constant. On those machines, we would first
7416 combine the shift with the AND to produce a variable-position
7417 extraction. Then the constant of 31 would be substituted in
7418 to produce such a position. */
7422 {
7430 }
7435 pos),
7437 else
7438 /* Any other cases we can't handle. */
7441 /* If we couldn't do this for some reason, return the original
7442 expression. */
7447 }
7448 \f
7449 /* X is a SET which contains an assignment of one object into
7450 a part of another (such as a bit-field assignment, STRICT_LOW_PART,
7451 or certain SUBREGS). If possible, convert it into a series of
7452 logical operations.
7454 We half-heartedly support variable positions, but do not at all
7455 support variable lengths. */
7457 static const_rtx
7459 {
7460 rtx inner;
7464 scalar_int_mode compute_mode;
7466 /* Loop until we find something we can't simplify. */
7468 {
7471 {
7477 MAX_MODE_INT);
7478 }
7481 {
7489 /* A constant position should stay within the width of INNER. */
7494 {
7500 /* If position is ADJUST - X, new position is X. */
7502 else
7506 pos);
7507 }
7508 }
7510 /* If the destination is a subreg that overwrites the whole of the inner
7511 register, we can move the subreg to the source. */
7513 /* We need SUBREGs to compute nonzero_bits properly. */
7514 && nonzero_sign_valid
7516 {
7518 gen_lowpart
7522 }
7523 else
7529 /* Don't attempt bitwise arithmetic on non scalar integer modes. */
7531 {
7532 /* Don't do anything for vector or complex integral types. */
7536 /* Try to find an integral mode to pun with. */
7542 }
7544 /* Compute a mask of LEN bits, if we can do this on the host machine. */
7548 /* Don't try to compute in too wide unsupported modes. */
7552 /* Now compute the equivalent expression. Make a copy of INNER
7553 for the SET_DEST in case it is a MEM into which we will substitute;
7554 we don't want shared RTL in that case. */
7556 compute_mode);
7560 compute_mode,
7562 compute_mode),
7563 inner);
7568 mask),
7569 pos);
7574 }
7577 }
7578 \f
7579 /* Return an RTX for a reference to LEN bits of INNER. If POS_RTX is nonzero,
7580 it is an RTX that represents the (variable) starting position; otherwise,
7581 POS is the (constant) starting bit position. Both are counted from the LSB.
7583 UNSIGNEDP is nonzero for an unsigned reference and zero for a signed one.
7585 IN_DEST is nonzero if this is a reference in the destination of a SET.
7586 This is used when a ZERO_ or SIGN_EXTRACT isn't needed. If nonzero,
7587 a STRICT_LOW_PART will be used, if zero, ZERO_EXTEND or SIGN_EXTEND will
7588 be used.
7590 IN_COMPARE is nonzero if we are in a COMPARE. This means that a
7591 ZERO_EXTRACT should be built even for bits starting at bit 0.
7593 MODE is the desired mode of the result (if IN_DEST == 0).
7595 The result is an RTX for the extraction or NULL_RTX if the target
7596 can't handle it. */
7598 static rtx
7602 {
7603 /* This mode describes the size of the storage area
7604 to fetch the overall value from. Within that, we
7605 ignore the POS lowest bits, etc. */
7607 machine_mode inner_mode;
7608 scalar_int_mode wanted_inner_mode;
7614 HOST_WIDE_INT orig_pos;
7622 /* If trying or potentionally trying to extract
7623 bits outside of is_mode, don't look through
7624 non-paradoxical SUBREGs. See PR82192. */
7627 {
7628 /* If going from (subreg:SI (mem:QI ...)) to (mem:QI ...),
7629 consider just the QI as the memory to extract from.
7630 The subreg adds or removes high bits; its mode is
7631 irrelevant to the meaning of this extraction,
7632 since POS and LEN count from the lsb. */
7636 }
7641 {
7642 /* We're extracting the least significant bits of an rtx
7643 (ashift X (const_int C)), where LEN > C. Extract the
7644 least significant (LEN - C) bits of X, giving an rtx
7645 whose mode is MODE, then shift it left C times. */
7651 }
7653 /* If trying or potentionally trying to extract
7654 bits outside of is_mode, don't look through
7655 TRUNCATE. See PR82192. */
7662 /* See if this can be done without an extraction. We never can if the
7663 width of the field is not the same as that of some integer mode. For
7664 registers, we can only avoid the extraction if the position is at the
7665 low-order bit and this is either not in the destination or we have the
7666 appropriate STRICT_LOW_PART operation available.
7668 For MEM, we can avoid an extract if the field starts on an appropriate
7669 boundary and we can change the mode of the memory reference. */
7671 scalar_int_mode tmode;
7680 && (! in_dest
7684 && (pos
7687 /* We can't do this if we are widening INNER_MODE (it
7688 may not be aligned, for one thing). */
7695 {
7696 /* If INNER is a MEM, make a new MEM that encompasses just the desired
7697 field. If the original and current mode are the same, we need not
7698 adjust the offset. Otherwise, we do if bytes big endian.
7700 If INNER is not a MEM, get a piece consisting of just the field
7701 of interest (in this case POS % BITS_PER_WORD must be 0). */
7704 {
7705 poly_int64 offset;
7707 /* POS counts from lsb, but make OFFSET count in memory order. */
7711 else
7715 }
7717 {
7719 {
7720 /* We can't call gen_lowpart in a DEST since we
7721 always want a SUBREG (see below) and it would sometimes
7722 return a new hard register. */
7724 {
7725 poly_uint64 offset
7728 /* Avoid creating invalid subregs, for example when
7729 simplifying (x>>32)&255. */
7734 }
7735 else
7737 }
7738 else
7740 }
7741 else
7743 len >= HOST_BITS_PER_WIDE_INT
7744 ? HOST_WIDE_INT_M1U
7747 /* If this extraction is going into the destination of a SET,
7748 make a STRICT_LOW_PART unless we made a MEM. */
7763 /* If we know that no extraneous bits are set, and that the high
7764 bit is not set, convert the extraction to the cheaper of
7765 sign and zero extension, that are equivalent in these cases. */
7771 {
7775 /* Prefer ZERO_EXTENSION, since it gives more information to
7776 backends. */
7781 }
7783 /* Otherwise, sign- or zero-extend unless we already are in the
7784 proper mode. */
7788 }
7790 /* Unless this is a COMPARE or we have a funny memory reference,
7791 don't do anything with zero-extending field extracts starting at
7792 the low-order bit since they are simple AND operations. */
7797 /* Unless INNER is not MEM, reject this if we would be spanning bytes or
7798 if the position is not a constant and the length is not 1. In all
7799 other cases, we would only be going outside our object in cases when
7800 an original shift would have been undefined. */
7809 /* If INNER is not from memory, we want it to have the mode of a register
7810 extraction pattern's structure operand, or word_mode if there is no
7811 such pattern. The same applies to extraction_mode and pos_mode
7812 and their respective operands.
7814 For memory, assume that the desired extraction_mode and pos_mode
7815 are the same as for a register operation, since at present we don't
7816 have named patterns for aligned memory structures. */
7821 {
7825 }
7827 /* Never narrow an object, since that might not be safe. */
7833 /* Punt if len is too large for extraction_mode. */
7839 else
7840 {
7841 /* Be careful not to go beyond the extracted object and maintain the
7842 natural alignment of the memory. */
7847 }
7852 {
7853 /* POS is passed as if BITS_BIG_ENDIAN == 0, so we need to convert it to
7854 BITS_BIG_ENDIAN style. If position is constant, compute new
7855 position. Otherwise, build subtraction.
7856 Note that POS is relative to the mode of the original argument.
7857 If it's a MEM we need to recompute POS relative to that.
7858 However, if we're extracting from (or inserting into) a register,
7859 we want to recompute POS relative to wanted_inner_mode. */
7868 else
7869 pos_rtx
7872 pos_rtx);
7873 /* POS may be less than 0 now, but we check for that below.
7874 Note that it can only be less than 0 if !MEM_P (inner). */
7875 }
7877 /* If INNER has a wider mode, and this is a constant extraction, try to
7878 make it smaller and adjust the byte to point to the byte containing
7879 the value. */
7882 && ! pos_rtx
7887 {
7890 /* The computations below will be correct if the machine is big
7891 endian in both bits and bytes or little endian in bits and bytes.
7892 If it is mixed, we must adjust. */
7894 /* If bytes are big endian and we had a paradoxical SUBREG, we must
7895 adjust OFFSET to compensate. */
7900 /* We can now move to the desired byte. */
7911 }
7913 /* If INNER is not memory, get it into the proper mode. If we are changing
7914 its mode, POS must be a constant and smaller than the size of the new
7915 mode. */
7917 {
7918 /* On the LHS, don't create paradoxical subregs implicitely truncating
7919 the register unless TARGET_TRULY_NOOP_TRUNCATION. */
7922 wanted_inner_mode))
7934 pos_rtx
7936 ? HOST_WIDE_INT_M1U
7940 }
7942 /* Adjust mode of POS_RTX, if needed. If we want a wider mode, we
7943 have to zero extend. Otherwise, we can just use a SUBREG.
7945 We dealt with constant rtxes earlier, so pos_rtx cannot
7946 have VOIDmode at this point. */
7950 {
7954 /* If we know that no extraneous bits are set, and that the high
7955 bit is not set, convert extraction to cheaper one - either
7956 SIGN_EXTENSION or ZERO_EXTENSION, that are equivalent in these
7957 cases. */
7965 {
7969 /* Prefer ZERO_EXTENSION, since it gives more information to
7970 backends. */
7974 }
7976 }
7978 /* Make POS_RTX unless we already have it and it is correct. If we don't
7979 have a POS_RTX but we do have an ORIG_POS_RTX, the latter must
7980 be a CONST_INT. */
7987 /* Make the required operation. See if we can use existing rtx. */
7994 }
7995 \f
7996 /* See if X (of mode MODE) contains an ASHIFT of COUNT or more bits that
7997 can be commuted with any other operations in X. Return X without
7998 that shift if so. */
8000 static rtx
8002 {
8004 rtx tem;
8007 {
8009 /* This is the shift itself. If it is wide enough, we will return
8010 either the value being shifted if the shift count is equal to
8011 COUNT or a shift for the difference. */
8025 /* If we can safely shift this constant and we find the inner shift,
8026 make a new operation. */
8031 {
8035 }
8040 }
8043 }
8044 \f
8045 /* Subroutine of make_compound_operation. *X_PTR is the rtx at the current
8046 level of the expression and MODE is its mode. IN_CODE is as for
8047 make_compound_operation. *NEXT_CODE_PTR is the value of IN_CODE
8048 that should be used when recursing on operands of *X_PTR.
8050 There are two possible actions:
8052 - Return null. This tells the caller to recurse on *X_PTR with IN_CODE
8053 equal to *NEXT_CODE_PTR, after which *X_PTR holds the final value.
8055 - Return a new rtx, which the caller returns directly. */
8057 static rtx
8061 {
8069 rtx tem;
8070 scalar_int_mode inner_mode;
8074 {
8077 }
8079 /* Process depending on the code of this operation. If NEW is set
8080 nonzero, it will be returned. */
8083 {
8085 /* Convert shifts by constants into multiplications if inside
8086 an address. */
8090 {
8096 {
8099 }
8102 }
8111 {
8115 }
8118 {
8122 mode));
8124 }
8125 else
8126 {
8129 }
8139 {
8143 }
8146 {
8150 mode));
8152 }
8153 else
8154 {
8158 }
8161 /* If the second operand is not a constant, we can't do anything
8162 with it. */
8166 /* If the constant is a power of two minus one and the first operand
8167 is a logical right shift, make an extraction. */
8170 {
8174 }
8176 /* Same as previous, but for (subreg (lshiftrt ...)) in first op. */
8183 {
8190 /* If we narrowed the mode when dropping the subreg, then we lose. */
8194 /* If that didn't give anything, see if the AND simplifies on
8195 its own. */
8197 {
8201 }
8202 }
8203 /* Same as previous, but for (xor/ior (lshiftrt...) (lshiftrt...)). */
8209 {
8210 /* Apply the distributive law, and then try to make extractions. */
8217 }
8219 /* If we are have (and (rotate X C) M) and C is larger than the number
8220 of bits in M, this is an extraction. */
8226 {
8232 }
8234 /* On machines without logical shifts, if the operand of the AND is
8235 a logical shift and our mask turns off all the propagated sign
8236 bits, we can replace the logical shift with an arithmetic shift. */
8244 {
8254 next_code),
8256 }
8258 /* If the constant is one less than a power of two, this might be
8259 representable by an extraction even if no shift is present.
8260 If it doesn't end up being a ZERO_EXTEND, we will ignore it unless
8261 we are in a COMPARE. */
8265 next_code),
8268 /* If we are in a comparison and this is an AND with a power of two,
8269 convert this into the appropriate bit extract. */
8275 next_code),
8278 /* If the one operand is a paradoxical subreg of a register or memory and
8279 the constant (limited to the smaller mode) has only zero bits where
8280 the sub expression has known zero bits, this can be expressed as
8281 a zero_extend. */
8283 {
8284 rtx sub;
8292 {
8296 /* original AND constant with all the known zero bits set */
8299 {
8303 }
8304 }
8305 }
8310 /* If the sign bit is known to be zero, replace this with an
8311 arithmetic shift. */
8316 {
8319 next_code),
8322 }
8324 /* fall through */
8330 /* If we have (ashiftrt (ashift foo C1) C2) with C2 >= C1,
8331 this is a SIGN_EXTRACT. */
8338 {
8345 }
8347 /* See if we have operations between an ASHIFTRT and an ASHIFT.
8348 If so, try to merge the shifts into a SIGN_EXTEND. We could
8349 also do this for some cases of SIGN_EXTRACT, but it doesn't
8350 seem worth the effort; the case checked for occurs on Alpha. */
8361 next_code),
8368 /* Call ourselves recursively on the inner expression. If we are
8369 narrowing the object and it has a different RTL code from
8370 what it originally did, do this SUBREG as a force_to_mode. */
8371 {
8375 /* If the SUBREG is masking of a logical right shift,
8376 make an extraction. */
8383 {
8392 }
8394 /* If in_code is COMPARE, it isn't always safe to pass it through
8395 to the recursive make_compound_operation call. */
8399 /* (subreg:SI (and:DI (reg:DI) (const_int 0x800000000)) 0)
8400 is (const_int 0), rather than
8401 (subreg:SI (lshiftrt:DI (reg:DI) (const_int 35)) 0).
8402 Similarly (subreg:QI (and:SI (reg:SI) (const_int 0x80)) 0)
8403 for non-equality comparisons against 0 is not equivalent
8404 to (subreg:QI (lshiftrt:SI (reg:SI) (const_int 7)) 0). */
8414 simplified
8422 {
8423 rtx newer
8426 /* If we have something other than a SUBREG, we might have
8427 done an expansion, so rerun ourselves. */
8431 /* force_to_mode can expand compounds. If it just re-expanded
8432 the compound, use gen_lowpart to convert to the desired
8433 mode. */
8435 /* Likewise if it re-expanded the compound only partially.
8436 This happens for SUBREG of ZERO_EXTRACT if they extract
8437 the same number of bits. */
8446 }
8450 }
8455 }
8461 }
8463 /* Look at the expression rooted at X. Look for expressions
8464 equivalent to ZERO_EXTRACT, SIGN_EXTRACT, ZERO_EXTEND, SIGN_EXTEND.
8465 Form these expressions.
8467 Return the new rtx, usually just X.
8469 Also, for machines like the VAX that don't have logical shift insns,
8470 try to convert logical to arithmetic shift operations in cases where
8471 they are equivalent. This undoes the canonicalizations to logical
8472 shifts done elsewhere.
8474 We try, as much as possible, to re-use rtl expressions to save memory.
8476 IN_CODE says what kind of expression we are processing. Normally, it is
8477 SET. In a memory address it is MEM. When processing the arguments of
8478 a comparison or a COMPARE against zero, it is COMPARE, or EQ if more
8479 precisely it is an equality comparison against zero. */
8481 rtx
8483 {
8490 /* Select the code to be used in recursive calls. Once we are inside an
8491 address, we stay there. If we have a comparison, set to COMPARE,
8492 but once inside, go back to our default of SET. */
8499 scalar_int_mode mode;
8501 {
8507 }
8509 /* Now recursively process each operand of this operation. We need to
8510 handle ZERO_EXTEND specially so that we don't lose track of the
8511 inner mode. */
8513 {
8521 }
8526 {
8529 }
8532 {
8535 }
8539 }
8540 \f
8541 /* Given M see if it is a value that would select a field of bits
8542 within an item, but not the entire word. Return -1 if not.
8543 Otherwise, return the starting position of the field, where 0 is the
8544 low-order bit.
8546 *PLEN is set to the length of the field. */
8548 static int
8550 {
8551 /* Get the bit number of the first 1 bit from the right, -1 if none. */
8556 /* Now shift off the low-order zero bits and see if we have a
8557 power of two minus 1. */
8565 }
8566 \f
8567 /* If X refers to a register that equals REG in value, replace these
8568 references with REG. */
8569 static rtx
8571 {
8579 {
8612 /* FALLTHRU */
8616 {
8620 else
8622 }
8624 /* fall through */
8631 {
8634 {
8636 {
8639 }
8641 }
8642 }
8644 {
8647 {
8650 {
8652 {
8655 }
8657 }
8658 }
8659 }
8662 }
8665 }
8667 /* Return X converted to MODE. If the value is already truncated to
8668 MODE we can just return a subreg even though in the general case we
8669 would need an explicit truncation. */
8671 static rtx
8673 {
8678 {
8679 /* Bit-cast X into an integer mode. */
8684 }
8687 }
8689 /* See if X can be simplified knowing that we will only refer to it in
8690 MODE and will only refer to those bits that are nonzero in MASK.
8691 If other bits are being computed or if masking operations are done
8692 that select a superset of the bits in MASK, they can sometimes be
8693 ignored.
8695 Return a possibly simplified expression, but always convert X to
8696 MODE. If X is a CONST_INT, AND the CONST_INT with MASK.
8698 If JUST_SELECT is nonzero, don't optimize by noticing that bits in MASK
8699 are all off in X. This is used when X will be complemented, by either
8700 NOT, NEG, or XOR. */
8702 static rtx
8705 {
8708 machine_mode op_mode;
8711 /* If this is a CALL or ASM_OPERANDS, don't do anything. Some of the
8712 code below will do the wrong thing since the mode of such an
8713 expression is VOIDmode.
8715 Also do nothing if X is a CLOBBER; this can happen if X was
8716 the return value from a call to gen_lowpart. */
8720 /* We want to perform the operation in its present mode unless we know
8721 that the operation is valid in MODE, in which case we do the operation
8722 in MODE. */
8727 /* It is not valid to do a right-shift in a narrower mode
8728 than the one it came in with. */
8733 /* Truncate MASK to fit OP_MODE. */
8737 /* Determine what bits of X are guaranteed to be (non)zero. */
8740 /* If none of the bits in X are needed, return a zero. */
8744 /* If X is a CONST_INT, return a new one. Do this here since the
8745 test below will fail. */
8747 {
8750 else
8751 {
8754 }
8755 }
8757 /* If X is narrower than MODE and we want all the bits in X's mode, just
8758 get X in the proper mode. */
8763 /* We can ignore the effect of a SUBREG if it narrows the mode or
8764 if the constant masks to zero all the bits the mode doesn't have. */
8768 || (mask
8776 /* OP_MODE is either MODE or XMODE, so it must be a scalar
8777 integer too. */
8783 }
8785 /* Subroutine of force_to_mode that handles cases in which both X and
8786 the result are scalar integers. MODE is the mode of the result,
8787 XMODE is the mode of X, and OP_MODE says which of MODE or XMODE
8788 is preferred for simplified versions of X. The other arguments
8789 are as for force_to_mode. */
8791 static rtx
8795 {
8800 poly_int64 const_op0;
8802 /* When we have an arithmetic operation, or a shift whose count we
8803 do not know, we need to assume that all bits up to the highest-order
8804 bit in MASK will be needed. This is how we form such a mask. */
8807 else
8812 {
8814 /* If X is a (clobber (const_int)), return it since we know we are
8815 generating something that won't match. */
8828 /* Similarly for a truncate. */
8832 /* If this is an AND with a constant, convert it into an AND
8833 whose constant is the AND of that constant with MASK. If it
8834 remains an AND of MASK, delete it since it is redundant. */
8837 {
8842 /* If X is still an AND, see if it is an AND with a mask that
8843 is just some low-order bits. If so, and it is MASK, we don't
8844 need it. */
8850 /* If it remains an AND, try making another AND with the bits
8851 in the mode mask that aren't in MASK turned on. If the
8852 constant in the AND is wide enough, this might make a
8853 cheaper constant. */
8858 {
8859 unsigned HOST_WIDE_INT cval
8861 rtx y;
8868 }
8871 }
8876 /* In (and (plus FOO C1) M), if M is a mask that just turns off
8877 low-order bits (as in an alignment operation) and FOO is already
8878 aligned to that boundary, mask C1 to that boundary as well.
8879 This may eliminate that PLUS and, later, the AND. */
8881 {
8885 /* If MODE is narrower than HOST_WIDE_INT and mask is a negative
8886 number, sign extend it. */
8899 }
8901 /* fall through */
8904 /* Substituting into the operands of a widening MULT is not likely to
8905 create RTL matching a machine insn. */
8915 /* For PLUS, MINUS and MULT, we need any bits less significant than the
8916 most significant bit in MASK since carries from those bits will
8917 affect the bits we are interested in. */
8922 /* If X is (minus C Y) where C's least set bit is larger than any bit
8923 in the mask, then we may replace with (neg Y). */
8926 {
8929 }
8931 /* Similarly, if C contains every bit in the fuller_mask, then we may
8932 replace with (not Y). */
8935 {
8938 }
8945 /* If X is (ior (lshiftrt FOO C1) C2), try to commute the IOR and
8946 LSHIFTRT so we end up with an (and (lshiftrt (ior ...) ...) ...)
8947 operation which may be a bitfield extraction. Ensure that the
8948 constant we form is not wider than the mode of X. */
8960 {
8963 xmode);
8969 }
8971 binop:
8972 /* For most binary operations, just propagate into the operation and
8973 change the mode if we have an operation of that mode. */
8978 /* If we ended up truncating both operands, truncate the result of the
8979 operation instead. */
8982 {
8985 }
8991 {
8994 }
8998 /* For left shifts, do the same, but just for the first operand.
8999 However, we cannot do anything with shifts where we cannot
9000 guarantee that the counts are smaller than the size of the mode
9001 because such a count will have a different meaning in a
9002 wider mode. */
9012 /* If the shift count is a constant and we can do arithmetic in
9013 the mode of the shift, refine which bits we need. Otherwise, use the
9014 conservative form of the mask. */
9020 else
9028 {
9031 }
9035 /* Here we can only do something if the shift count is a constant,
9036 this shift constant is valid for the host, and we can do arithmetic
9037 in OP_MODE. */
9043 {
9047 /* Select the mask of the bits we need for the shift operand. */
9050 /* We can only change the mode of the shift if we can do arithmetic
9051 in the mode of the shift and INNER_MASK is no wider than the
9052 width of X's mode. */
9059 {
9062 }
9063 }
9065 /* If we have (and (lshiftrt FOO C1) C2) where the combination of the
9066 shift and AND produces only copies of the sign bit (C2 is one less
9067 than a power of two), we can do this with just a shift. */
9071 /* The shift puts one of the sign bit copies in the least significant
9072 bit. */
9077 /* Number of bits left after the shift must be more than the mask
9078 needs. */
9081 /* Must be more sign bit copies than the mask needs. */
9084 {
9088 }
9092 /* If we are just looking for the sign bit, we don't need this shift at
9093 all, even if it has a variable count. */
9097 /* If this is a shift by a constant, get a mask that contains those bits
9098 that are not copies of the sign bit. We then have two cases: If
9099 MASK only includes those bits, this can be a logical shift, which may
9100 allow simplifications. If MASK is a single-bit field not within
9101 those bits, we are requesting a copy of the sign bit and hence can
9102 shift the sign bit to the appropriate location. */
9106 {
9110 /* If the considered data is wider than HOST_WIDE_INT, we can't
9111 represent a mask for all its bits in a single scalar.
9112 But we only care about the lower bits, so calculate these. */
9115 {
9118 /* GET_MODE_PRECISION (GET_MODE (x)) - INTVAL (XEXP (x, 1))
9119 is the number of bits a full-width mask would have set.
9120 We need only shift if these are fewer than nonzero can
9121 hold. If not, we must keep all bits set in nonzero. */
9126 + HOST_BITS_PER_WIDE_INT
9128 }
9129 else
9130 {
9133 }
9136 {
9141 }
9144 {
9145 x = simplify_shift_const
9151 }
9152 }
9154 /* If MASK is 1, convert this to an LSHIFTRT. This can be done
9155 even if the shift count isn't a constant. */
9159 shiftrt:
9161 /* If this is a zero- or sign-extension operation that just affects bits
9162 we don't care about, remove it. Be sure the call above returned
9163 something that is still a shift. */
9173 next_select);
9179 /* If the shift count is constant and we can do computations
9180 in the mode of X, compute where the bits we care about are.
9181 Otherwise, we can't do anything. Don't change the mode of
9182 the shift or propagate MODE into the shift, though. */
9185 {
9194 }
9198 /* If we just want the low-order bit, the NEG isn't needed since it
9199 won't change the low-order bit. */
9203 /* We need any bits less significant than the most significant bit in
9204 MASK since carries from those bits will affect the bits we are
9205 interested in. */
9210 /* (not FOO) is (xor FOO CONST), so if FOO is an LSHIFTRT, we can do the
9211 same as the XOR case above. Ensure that the constant we form is not
9212 wider than the mode of X. */
9220 {
9227 }
9229 /* (and (not FOO) CONST) is (not (or FOO (not CONST))), so we must
9230 use the full mask inside the NOT. */
9233 unop:
9236 next_select));
9238 {
9241 }
9245 /* (and (ne FOO 0) CONST) can be (and FOO CONST) if CONST is included
9246 in STORE_FLAG_VALUE and FOO has a single bit that might be nonzero,
9247 which is equal to STORE_FLAG_VALUE. */
9259 /* We have no way of knowing if the IF_THEN_ELSE can itself be
9260 written in a narrower mode. We play it safe and do not do so. */
9276 }
9278 /* Ensure we return a value of the proper mode. */
9280 }
9281 \f
9282 /* Return nonzero if X is an expression that has one of two values depending on
9283 whether some other value is zero or nonzero. In that case, we return the
9284 value that is being tested, *PTRUE is set to the value if the rtx being
9285 returned has a nonzero value, and *PFALSE is set to the other alternative.
9287 If we return zero, we set *PTRUE and *PFALSE to X. */
9289 static rtx
9291 {
9296 scalar_int_mode int_mode;
9298 /* If we are comparing a value against zero, we are done. */
9301 {
9305 }
9307 /* If this is a unary operation whose operand has one of two values, apply
9308 our opcode to compute those values. */
9311 {
9316 }
9318 /* If this is a COMPARE, do nothing, since the IF_THEN_ELSE we would
9319 make can't possibly match and would suppress other optimizations. */
9321 ;
9323 /* If this is a binary operation, see if either side has only one of two
9324 values. If either one does or if both do and they are conditional on
9325 the same value, compute the new true and false values. */
9327 {
9335 {
9336 /* Try to enable a simplification by undoing work done by
9337 if_then_else_cond if it converted a REG into something more
9338 complex. */
9340 {
9343 }
9344 else
9345 {
9348 }
9349 }
9353 {
9354 /* If if_then_else_cond returned zero, then true/false are the
9355 same rtl. We must copy one of them to prevent invalid rtl
9356 sharing. */
9363 {
9368 }
9369 else
9370 {
9373 }
9376 }
9378 /* See if we have PLUS, IOR, XOR, MINUS or UMAX, where one of the
9379 operands is zero when the other is nonzero, and vice-versa,
9380 and STORE_FLAG_VALUE is 1 or -1. */
9386 {
9404 {
9411 const_true_rtx);
9413 }
9414 }
9416 /* Similarly for MULT, AND and UMIN, except that for these the result
9417 is always zero. */
9421 {
9435 {
9438 }
9439 }
9440 }
9443 {
9444 /* If we have IF_THEN_ELSE already, extract the condition and
9445 canonicalize it if it is NE or EQ. */
9451 {
9454 }
9455 else
9457 }
9459 /* If X is a SUBREG, we can narrow both the true and false values
9460 if the inner expression, if there is a condition. */
9464 {
9470 {
9474 }
9475 }
9477 /* If X is a constant, this isn't special and will cause confusions
9478 if we treat it as such. Likewise if it is equivalent to a constant. */
9481 ;
9483 /* If we're in BImode, canonicalize on 0 and STORE_FLAG_VALUE, as that
9484 will be least confusing to the rest of the compiler. */
9486 {
9489 }
9491 /* If X is known to be either 0 or -1, those are the true and
9492 false values when testing X. */
9497 {
9500 }
9502 /* Likewise for 0 or a single bit. */
9505 {
9508 }
9510 /* Otherwise fail; show no condition with true and false values the same. */
9513 }
9514 \f
9515 /* Return the value of expression X given the fact that condition COND
9516 is known to be true when applied to REG as its first operand and VAL
9517 as its second. X is known to not be shared and so can be modified in
9518 place.
9520 We only handle the simplest cases, and specifically those cases that
9521 arise with IF_THEN_ELSE expressions. */
9523 static rtx
9525 {
9533 /* If either operand of the condition is a floating point value,
9534 then we have to avoid collapsing an EQ comparison. */
9544 /* If X is (abs REG) and we know something about REG's relationship
9545 with zero, we may be able to simplify this. */
9549 {
9558 }
9560 /* The only other cases we handle are MIN, MAX, and comparisons if the
9561 operands are the same as REG and VAL. */
9564 {
9566 {
9569 }
9572 {
9574 {
9582 else
9584 }
9587 {
9590 /* Do not reverse the condition when it is NE or EQ.
9591 This is because we cannot conclude anything about
9592 the value of 'SMAX (x, y)' when x is not equal to y,
9593 but we can when x equals y. */
9599 {
9610 }
9611 }
9612 }
9613 }
9615 {
9620 {
9621 /* We must simplify subreg here, before we lose track of the
9622 original inner_mode. */
9627 else
9629 }
9632 }
9633 /* We don't have to handle SIGN_EXTEND here, because even in the
9634 case of replacing something with a modeless CONST_INT, a
9635 CONST_INT is already (supposed to be) a valid sign extension for
9636 its narrower mode, which implies it's already properly
9637 sign-extended for the wider mode. Now, for ZERO_EXTEND, the
9638 story is different. */
9640 {
9645 {
9646 /* We must simplify the zero_extend here, before we lose
9647 track of the original inner_mode. */
9652 else
9654 }
9657 }
9661 {
9668 }
9671 }
9672 \f
9673 /* See if X and Y are equal for the purposes of seeing if we can rewrite an
9674 assignment as a field assignment. */
9676 static int
9678 {
9680 {
9688 }
9696 /* Check for a paradoxical SUBREG of a MEM compared with the MEM.
9697 Note that all SUBREGs of MEM are paradoxical; otherwise they
9698 would have been rewritten. */
9711 /* We used to see if get_last_value of X and Y were the same but that's
9712 not correct. In one direction, we'll cause the assignment to have
9713 the wrong destination and in the case, we'll import a register into this
9714 insn that might have already have been dead. So fail if none of the
9715 above cases are true. */
9717 }
9718 \f
9719 /* See if X, a SET operation, can be rewritten as a bit-field assignment.
9720 Return that assignment if so.
9722 We only handle the most common cases. */
9724 static rtx
9726 {
9729 rtx assign;
9731 HOST_WIDE_INT c1;
9732 HOST_WIDE_INT pos;
9734 rtx other;
9736 /* All the rules in this function are specific to scalar integers. */
9737 scalar_int_mode mode;
9741 /* If SRC was (and (not (ashift (const_int 1) POS)) DEST), this is
9742 a clear of a one-bit field. We will have changed it to
9743 (and (rotate (const_int -2) POS) DEST), so check for that. Also check
9744 for a SUBREG. */
9750 {
9756 }
9765 {
9772 }
9774 /* If SRC is (ior (ashift (const_int 1) POS) DEST), this is a set of a
9775 one-bit field. */
9779 {
9785 }
9787 /* If DEST is already a field assignment, i.e. ZERO_EXTRACT, and the
9788 SRC is an AND with all bits of that field set, then we can discard
9789 the AND. */
9794 {
9801 else
9804 /* Complete overlap. We can remove the source AND. */
9808 /* Partial overlap. We can reduce the source AND. */
9810 {
9814 }
9815 }
9817 /* The other case we handle is assignments into a constant-position
9818 field. They look like (ior/xor (and DEST C1) OTHER). If C1 represents
9819 a mask that has all one bits except for a group of zero bits and
9820 OTHER is known to have zeros where C1 has ones, this is such an
9821 assignment. Compute the position and length from C1. Shift OTHER
9822 to the appropriate position, force it to the required mode, and
9823 make the extraction. Check for the AND in both operands. */
9825 /* One or more SUBREGs might obscure the constant-position field
9826 assignment. The first one we are likely to encounter is an outer
9827 narrowing SUBREG, which we can just strip for the purposes of
9828 identifying the constant-field assignment. */
9845 /* The second SUBREG that might get in the way is a paradoxical
9846 SUBREG around the first operand of the AND. We want to
9847 pretend the operand is as wide as the destination here. We
9848 do this by adjusting the MEM to wider mode for the sole
9849 purpose of the call to rtx_equal_for_field_assignment_p. Also
9850 note this trick only works for MEMs. */
9862 /* The second SUBREG that might get in the way is a paradoxical
9863 SUBREG around the first operand of the AND. We want to
9864 pretend the operand is as wide as the destination here. We
9865 do this by adjusting the MEM to wider mode for the sole
9866 purpose of the call to rtx_equal_for_field_assignment_p. Also
9867 note this trick only works for MEMs. */
9875 else
9889 /* The mode to use for the source is the mode of the assignment, or of
9890 what is inside a possible STRICT_LOW_PART. */
9894 /* Shift OTHER right POS places and make it the source, restricting it
9895 to the proper length and mode. */
9899 dest);
9901 len >= HOST_BITS_PER_WIDE_INT
9902 ? HOST_WIDE_INT_M1U
9906 /* If SRC is masked by an AND that does not make a difference in
9907 the value being stored, strip it. */
9918 }
9919 \f
9920 /* See if X is of the form (+ (* a c) (* b c)) and convert to (* (+ a b) c)
9921 if so. */
9923 static rtx
9925 {
9929 rtx tem;
9931 /* Distributivity is not true for floating point as it can change the
9932 value. So we don't do it unless -funsafe-math-optimizations. */
9937 /* The outer operation can only be one of the following: */
9945 /* If either operand is a primitive we can't do anything, so get out
9946 fast. */
9956 /* See if the inner and outer operations distribute. */
9958 {
9963 /* These all distribute except over PLUS. */
9974 /* This is also a multiply, so it distributes over everything. */
9977 /* This used to handle SUBREG, but this turned out to be counter-
9978 productive, since (subreg (op ...)) usually is not handled by
9979 insn patterns, and this "optimization" therefore transformed
9980 recognizable patterns into unrecognizable ones. Therefore the
9981 SUBREG case was removed from here.
9983 It is possible that distributing SUBREG over arithmetic operations
9984 leads to an intermediate result than can then be optimized further,
9985 e.g. by moving the outer SUBREG to the other side of a SET as done
9986 in simplify_set. This seems to have been the original intent of
9987 handling SUBREGs here.
9989 However, with current GCC this does not appear to actually happen,
9990 at least on major platforms. If some case is found where removing
9991 the SUBREG case here prevents follow-on optimizations, distributing
9992 SUBREGs ought to be re-added at that place, e.g. in simplify_set. */
9996 }
9998 /* Set LHS and RHS to the inner operands (A and B in the example
9999 above) and set OTHER to the common operand (C in the example).
10000 There is only one way to do this unless the inner operation is
10001 commutative. */
10013 else
10016 /* Form the new inner operation, seeing if it simplifies first. */
10019 /* There is one exception to the general way of distributing:
10020 (a | c) ^ (b | c) -> (a ^ b) & ~c */
10022 {
10025 }
10027 /* We may be able to continuing distributing the result, so call
10028 ourselves recursively on the inner operation before forming the
10029 outer operation, which we return. */
10032 }
10034 /* See if X is of the form (* (+ A B) C), and if so convert to
10035 (+ (* A C) (* B C)) and try to simplify.
10037 Most of the time, this results in no change. However, if some of
10038 the operands are the same or inverses of each other, simplifications
10039 will result.
10041 For example, (and (ior A B) (not B)) can occur as the result of
10042 expanding a bit field assignment. When we apply the distributive
10043 law to this, we get (ior (and (A (not B))) (and (B (not B)))),
10044 which then simplifies to (and (A (not B))).
10046 Note that no checks happen on the validity of applying the inverse
10047 distributive law. This is pointless since we can do it in the
10048 few places where this routine is called.
10050 N is the index of the term that is decomposed (the arithmetic operation,
10051 i.e. (+ A B) in the first example above). !N is the index of the term that
10052 is distributed, i.e. of C in the first example above. */
10053 static rtx
10055 {
10056 machine_mode mode;
10060 /* Distributivity is not true for floating point as it can change the
10061 value. So we don't do it unless -funsafe-math-optimizations. */
10078 /* Special case (and (xor B C) (not A)), which is equivalent to
10079 (xor (ior A B) (ior A C)) */
10081 {
10084 }
10087 {
10088 /* Distribute the second term. */
10091 }
10092 else
10093 {
10094 /* Distribute the first term. */
10097 }
10107 }
10108 \f
10109 /* Simplify a logical `and' of VAROP with the constant CONSTOP, to be done
10110 in MODE. Return an equivalent form, if different from (and VAROP
10111 (const_int CONSTOP)). Otherwise, return NULL_RTX. */
10113 static rtx
10116 {
10119 rtx orig_varop;
10127 /* Simplify VAROP knowing that we will be only looking at some of the
10128 bits in it.
10130 Note by passing in CONSTOP, we guarantee that the bits not set in
10131 CONSTOP are not significant and will never be examined. We must
10132 ensure that is the case by explicitly masking out those bits
10133 before returning. */
10136 /* If VAROP is a CLOBBER, we will fail so return it. */
10140 /* If VAROP is a CONST_INT, then we need to apply the mask in CONSTOP
10141 to VAROP and return the new constant. */
10145 /* See what bits may be nonzero in VAROP. Unlike the general case of
10146 a call to nonzero_bits, here we don't care about bits outside
10147 MODE. */
10151 /* Turn off all bits in the constant that are known to already be zero.
10152 Thus, if the AND isn't needed at all, we will have CONSTOP == NONZERO_BITS
10153 which is tested below. */
10157 /* If we don't have any bits left, return zero. */
10161 /* If VAROP is a NEG of something known to be zero or 1 and CONSTOP is
10162 a power of two, we can replace this with an ASHIFT. */
10167 /* If VAROP is an IOR or XOR, apply the AND to both branches of the IOR
10168 or XOR, then try to apply the distributive law. This may eliminate
10169 operations if either branch can be simplified because of the AND.
10170 It may also make some cases more complex, but those cases probably
10171 won't match a pattern either with or without this. */
10174 {
10176 return
10177 gen_lowpart
10179 apply_distributive_law
10183 constop),
10186 constop))));
10187 }
10189 /* If VAROP is PLUS, and the constant is a mask of low bits, distribute
10190 the AND and see if one of the operands simplifies to zero. If so, we
10191 may eliminate it. */
10195 {
10204 }
10206 /* Make a SUBREG if necessary. If we can't make it, fail. */
10211 /* If we are only masking insignificant bits, return VAROP. */
10218 /* Otherwise, return an AND. */
10220 }
10223 /* We have X, a logical `and' of VAROP with the constant CONSTOP, to be done
10224 in MODE.
10226 Return an equivalent form, if different from X. Otherwise, return X. If
10227 X is zero, we are to always construct the equivalent form. */
10229 static rtx
10232 {
10243 }
10244 \f
10245 /* Given a REG X of mode XMODE, compute which bits in X can be nonzero.
10246 We don't care about bits outside of those defined in MODE.
10247 We DO care about all the bits in MODE, even if XMODE is smaller than MODE.
10249 For most X this is simply GET_MODE_MASK (GET_MODE (MODE)), but if X is
10250 a shift, AND, or zero_extract, we can do better. */
10252 static rtx
10254 scalar_int_mode mode,
10256 {
10257 rtx tem;
10260 /* If X is a register whose nonzero bits value is current, use it.
10261 Otherwise, if X is a register whose value we can find, use that
10262 value. Otherwise, use the previously-computed global nonzero bits
10263 for this register. */
10278 && !REGNO_REG_SET_P
10281 {
10282 /* Note that, even if the precision of last_set_mode is lower than that
10283 of mode, record_value_for_reg invoked nonzero_bits on the register
10284 with nonzero_bits_mode (because last_set_mode is necessarily integral
10285 and HWI_COMPUTABLE_MODE_P in this case) so bits in nonzero_bits_mode
10286 are all valid, hence in mode too since nonzero_bits_mode is defined
10287 to the largest HWI_COMPUTABLE_MODE_P mode. */
10290 }
10294 {
10299 }
10302 {
10306 /* We don't know anything about the upper bits. */
10310 }
10313 }
10315 /* Given a reg X of mode XMODE, return the number of bits at the high-order
10316 end of X that are known to be equal to the sign bit. X will be used
10317 in mode MODE; the returned value will always be between 1 and the
10318 number of bits in MODE. */
10320 static rtx
10322 scalar_int_mode mode,
10324 {
10325 rtx tem;
10338 && !REGNO_REG_SET_P
10341 {
10344 }
10355 }
10356 \f
10357 /* Return the number of "extended" bits there are in X, when interpreted
10358 as a quantity in MODE whose signedness is indicated by UNSIGNEDP. For
10359 unsigned quantities, this is the number of high-order zero bits.
10360 For signed quantities, this is the number of copies of the sign bit
10361 minus 1. In both case, this function returns the number of "spare"
10362 bits. For example, if two quantities for which this function returns
10363 at least 1 are added, the addition is known not to overflow.
10365 This function will always return 0 unless called during combine, which
10366 implies that it must be called from a define_split. */
10368 unsigned int
10370 {
10374 scalar_int_mode int_mode;
10382 }
10384 /* This function is called from `simplify_shift_const' to merge two
10385 outer operations. Specifically, we have already found that we need
10386 to perform operation *POP0 with constant *PCONST0 at the outermost
10387 position. We would now like to also perform OP1 with constant CONST1
10388 (with *POP0 being done last).
10390 Return 1 if we can do the operation and update *POP0 and *PCONST0 with
10391 the resulting operation. *PCOMP_P is set to 1 if we would need to
10392 complement the innermost operand, otherwise it is unchanged.
10394 MODE is the mode in which the operation will be done. No bits outside
10395 the width of this mode matter. It is assumed that the width of this mode
10396 is smaller than or equal to HOST_BITS_PER_WIDE_INT.
10398 If *POP0 or OP1 are UNKNOWN, it means no operation is required. Only NEG, PLUS,
10399 IOR, XOR, and AND are supported. We may set *POP0 to SET if the proper
10400 result is simply *PCONST0.
10402 If the resulting operation cannot be expressed as one operation, we
10403 return 0 and do not change *POP0, *PCONST0, and *PCOMP_P. */
10405 static int
10406 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)
10407 {
10414 /* If OP0 is an AND, clear unimportant bits in CONST1. */
10418 /* If OP0 or OP1 is UNKNOWN, this is easy. Similarly if they are the same or
10419 if OP0 is SET. */
10428 {
10430 {
10448 }
10449 }
10451 /* Otherwise, if either is a PLUS or NEG, we can't do anything. */
10455 /* If the two constants aren't the same, we can't do anything. The
10456 remaining six cases can all be done. */
10460 else
10462 {
10465 /* (a & b) | b == b */
10468 /* (a ^ b) | b == a | b */
10469 {;}
10474 /* (a & b) ^ b == (~a) & b */
10477 /* (a | b) ^ b == a & ~b */
10483 /* (a | b) & b == b */
10486 /* (a ^ b) & b) == (~a) & b */
10491 }
10493 /* Check for NO-OP cases. */
10506 /* ??? Slightly redundant with the above mask, but not entirely.
10507 Moving this above means we'd have to sign-extend the mode mask
10508 for the final test. */
10513 }
10514 \f
10515 /* A helper to simplify_shift_const_1 to determine the mode we can perform
10516 the shift in. The original shift operation CODE is performed on OP in
10517 ORIG_MODE. Return the wider mode MODE if we can perform the operation
10518 in that mode. Return ORIG_MODE otherwise. We can also assume that the
10519 result of the shift is subject to operation OUTER_CODE with operand
10520 OUTER_CONST. */
10522 static scalar_int_mode
10526 {
10529 /* In general we can't perform in wider mode for right shift and rotate. */
10531 {
10533 /* We can still widen if the bits brought in from the left are identical
10534 to the sign bit of ORIG_MODE. */
10542 /* Similarly here but with zero bits. */
10547 /* We can also widen if the bits brought in will be masked off. This
10548 operation is performed in ORIG_MODE. */
10550 {
10556 }
10557 /* fall through */
10567 }
10568 }
10570 /* Simplify a shift of VAROP by ORIG_COUNT bits. CODE says what kind
10571 of shift. The result of the shift is RESULT_MODE. Return NULL_RTX
10572 if we cannot simplify it. Otherwise, return a simplified value.
10574 The shift is normally computed in the widest mode we find in VAROP, as
10575 long as it isn't a different number of words than RESULT_MODE. Exceptions
10576 are ASHIFTRT and ROTATE, which are always done in their original mode. */
10578 static rtx
10581 {
10586 machine_mode shift_mode;
10588 /* We form (outer_op (code varop count) (outer_const)). */
10594 /* Make sure and truncate the "natural" shift on the way in. We don't
10595 want to do this inside the loop as it makes it more difficult to
10596 combine shifts. */
10600 /* If we were given an invalid count, don't do anything except exactly
10601 what was requested. */
10608 /* Unless one of the branches of the `if' in this loop does a `continue',
10609 we will `break' the loop after the `if'. */
10612 {
10613 /* If we have an operand of (clobber (const_int 0)), fail. */
10617 /* Convert ROTATERT to ROTATE. */
10619 {
10623 }
10627 {
10628 /* We only change the modes of scalar shifts. */
10634 }
10636 scalar_int_mode shift_unit_mode
10639 /* Handle cases where the count is greater than the size of the mode
10640 minus 1. For ASHIFT, use the size minus one as the count (this can
10641 occur when simplifying (lshiftrt (ashiftrt ..))). For rotates,
10642 take the count modulo the size. For other shifts, the result is
10643 zero.
10645 Since these shifts are being produced by the compiler by combining
10646 multiple operations, each of which are defined, we know what the
10647 result is supposed to be. */
10650 {
10655 else
10656 {
10657 /* We can't simply return zero because there may be an
10658 outer op. */
10662 }
10663 }
10665 /* If we discovered we had to complement VAROP, leave. Making a NOT
10666 here would cause an infinite loop. */
10671 {
10672 /* An arithmetic right shift of a quantity known to be -1 or 0
10673 is a no-op. */
10677 {
10680 }
10682 /* If we are doing an arithmetic right shift and discarding all but
10683 the sign bit copies, this is equivalent to doing a shift by the
10684 bitsize minus one. Convert it into that shift because it will
10685 often allow other simplifications. */
10692 /* We simplify the tests below and elsewhere by converting
10693 ASHIFTRT to LSHIFTRT if we know the sign bit is clear.
10694 `make_compound_operation' will convert it to an ASHIFTRT for
10695 those machines (such as VAX) that don't have an LSHIFTRT. */
10700 shift_unit_mode)))
10712 }
10715 {
10722 {
10725 }
10729 /* The following rules apply only to scalars. */
10734 /* If we have (xshiftrt (mem ...) C) and C is MODE_WIDTH
10735 minus the width of a smaller mode, we can do this with a
10736 SIGN_EXTEND or ZERO_EXTEND from the narrower memory location. */
10743 {
10752 }
10756 /* The following rules apply only to scalars. */
10762 /* If VAROP is a SUBREG, strip it as long as the inner operand has
10763 the same number of words as what we've seen so far. Then store
10764 the widest mode in MODE. */
10771 {
10776 }
10780 /* Some machines use MULT instead of ASHIFT because MULT
10781 is cheaper. But it is still better on those machines to
10782 merge two shifts into one. */
10785 {
10790 }
10794 /* Similar, for when divides are cheaper. */
10797 {
10802 }
10806 /* If we are extracting just the sign bit of an arithmetic
10807 right shift, that shift is not needed. However, the sign
10808 bit of a wider mode may be different from what would be
10809 interpreted as the sign bit in a narrower mode, so, if
10810 the result is narrower, don't discard the shift. */
10815 {
10818 }
10820 /* fall through */
10825 /* The following rules apply only to scalars. */
10832 /* Here we have two nested shifts. The result is usually the
10833 AND of a new shift with a mask. We compute the result below. */
10839 {
10843 rtx mask_rtx;
10845 /* We have one common special case. We can't do any merging if
10846 the inner code is an ASHIFTRT of a smaller mode. However, if
10847 we have (ashift:M1 (subreg:M1 (ashiftrt:M2 FOO C1) 0) C2)
10848 with C2 == GET_MODE_BITSIZE (M1) - GET_MODE_BITSIZE (M2),
10849 we can convert it to
10850 (ashiftrt:M1 (ashift:M1 (and:M1 (subreg:M1 FOO 0) C3) C2) C1).
10851 This simplifies certain SIGN_EXTEND operations. */
10855 {
10856 /* C3 has the low-order C1 bits zero. */
10868 }
10870 /* If this was (ashiftrt (ashift foo C1) C2) and FOO has more
10871 than C1 high-order bits equal to the sign bit, we can convert
10872 this to either an ASHIFT or an ASHIFTRT depending on the
10873 two counts.
10875 We cannot do this if VAROP's mode is not SHIFT_UNIT_MODE. */
10881 {
10885 {
10888 }
10891 }
10893 /* There are some cases we can't do. If CODE is ASHIFTRT,
10894 we can only do this if FIRST_CODE is also ASHIFTRT.
10896 We can't do the case when CODE is ROTATE and FIRST_CODE is
10897 ASHIFTRT.
10899 If the mode of this shift is not the mode of the outer shift,
10900 we can't do this if either shift is a right shift or ROTATE.
10902 Finally, we can't do any of these if the mode is too wide
10903 unless the codes are the same.
10905 Handle the case where the shift codes are the same
10906 first. */
10909 {
10918 }
10929 /* To compute the mask to apply after the shift, shift the
10930 nonzero bits of the inner shift the same way the
10931 outer shift will. */
10934 int_result_mode);
10936 mask_rtx
10940 /* Give up if we can't compute an outer operation to use. */
10948 /* If the shifts are in the same direction, we add the
10949 counts. Otherwise, we subtract them. */
10953 else
10956 /* If COUNT is positive, the new shift is usually CODE,
10957 except for the two exceptions below, in which case it is
10958 FIRST_CODE. If the count is negative, FIRST_CODE should
10959 always be used */
10969 }
10971 /* If we have (A << B << C) for any shift, we can convert this to
10972 (A << C << B). This wins if A is a constant. Only try this if
10973 B is not a constant. */
10978 {
10979 /* For ((unsigned) (cstULL >> count)) >> cst2 we have to make
10980 sure the result will be masked. See PR70222. */
10988 /* For ((int) (cstLL >> count)) >> cst2 just give up. Queuing
10989 up outer sign extension (often left and right shift) is
10990 hardly more efficient than the original. See PR70429. */
10997 count_rtx);
11001 }
11005 /* The following rules apply only to scalars. */
11009 /* Make this fit the case below. */
11016 /* The following rules apply only to scalars. */
11022 /* If we have (xshiftrt (ior (plus X (const_int -1)) X) C)
11023 with C the size of VAROP - 1 and the shift is logical if
11024 STORE_FLAG_VALUE is 1 and arithmetic if STORE_FLAG_VALUE is -1,
11025 we have an (le X 0) operation. If we have an arithmetic shift
11026 and STORE_FLAG_VALUE is 1 or we have a logical shift with
11027 STORE_FLAG_VALUE of -1, we have a (neg (le X 0)) operation. */
11035 {
11038 const0_rtx);
11044 }
11046 /* If we have (shift (logical)), move the logical to the outside
11047 to allow it to possibly combine with another logical and the
11048 shift to combine with another shift. This also canonicalizes to
11049 what a ZERO_EXTRACT looks like. Also, some machines have
11050 (and (shift)) insns. */
11053 /* We can't do this if we have (ashiftrt (xor)) and the
11054 constant has its sign bit set in shift_unit_mode with
11055 shift_unit_mode wider than result_mode. */
11068 {
11071 }
11073 /* If we can't do that, try to simplify the shift in each arm of the
11074 logical expression, make a new logical expression, and apply
11075 the inverse distributive law. This also can't be done for
11076 (ashiftrt (xor)) where we've widened the shift and the constant
11077 changes the sign bit. */
11083 {
11095 }
11099 /* The following rules apply only to scalars. */
11104 /* Convert (lshiftrt (eq FOO 0) C) to (xor FOO 1) if STORE_FLAG_VALUE
11105 says that the sign bit can be tested, FOO has mode MODE, C is
11106 GET_MODE_PRECISION (MODE) - 1, and FOO has only its low-order bit
11107 that may be nonzero. */
11117 {
11121 }
11125 /* The following rules apply only to scalars. */
11130 /* (lshiftrt (neg A) C) where A is either 0 or 1 and C is one less
11131 than the number of bits in the mode is equivalent to A. */
11135 {
11139 }
11141 /* NEG commutes with ASHIFT since it is multiplication. Move the
11142 NEG outside to allow shifts to combine. */
11146 {
11149 }
11153 /* The following rules apply only to scalars. */
11158 /* (lshiftrt (plus A -1) C) where A is either 0 or 1 and C
11159 is one less than the number of bits in the mode is
11160 equivalent to (xor A 1). */
11167 {
11171 }
11173 /* If we have (xshiftrt (plus FOO BAR) C), and the only bits
11174 that might be nonzero in BAR are those being shifted out and those
11175 bits are known zero in FOO, we can replace the PLUS with FOO.
11176 Similarly in the other operand order. This code occurs when
11177 we are computing the size of a variable-size array. */
11184 {
11187 }
11195 {
11198 }
11200 /* (ashift (plus foo C) N) is (plus (ashift foo N) C'). */
11211 {
11214 }
11216 /* Check for 'PLUS signbit', which is the canonical form of 'XOR
11217 signbit', and attempt to change the PLUS to an XOR and move it to
11218 the outer operation as is done above in the AND/IOR/XOR case
11219 leg for shift(logical). See details in logical handling above
11220 for reasoning in doing so. */
11232 {
11235 }
11240 /* The following rules apply only to scalars. */
11245 /* If we have (xshiftrt (minus (ashiftrt X C)) X) C)
11246 with C the size of VAROP - 1 and the shift is logical if
11247 STORE_FLAG_VALUE is 1 and arithmetic if STORE_FLAG_VALUE is -1,
11248 we have a (gt X 0) operation. If the shift is arithmetic with
11249 STORE_FLAG_VALUE of 1 or logical with STORE_FLAG_VALUE == -1,
11250 we have a (neg (gt X 0)) operation. */
11259 {
11262 const0_rtx);
11268 }
11272 /* Change (lshiftrt (truncate (lshiftrt))) to (truncate (lshiftrt))
11273 if the truncate does not affect the value. */
11280 {
11284 new_count);
11287 new_count_rtx);
11291 }
11296 }
11299 }
11303 {
11304 /* We only change the modes of scalar shifts. */
11309 }
11311 /* We have now finished analyzing the shift. The result should be
11312 a shift of type CODE with SHIFT_MODE shifting VAROP COUNT places. If
11313 OUTER_OP is non-UNKNOWN, it is an operation that needs to be applied
11314 to the result of the shift. OUTER_CONST is the relevant constant,
11315 but we must turn off all bits turned off in the shift. */
11323 /* Make a SUBREG if necessary. If we can't make it, fail. */
11328 /* If we have an outer operation and we just made a shift, it is
11329 possible that we could have simplified the shift were it not
11330 for the outer operation. So try to do the simplification
11331 recursively. */
11335 else
11342 /* If we were doing an LSHIFTRT in a wider mode than it was originally,
11343 turn off all the bits that the shift would have turned off. */
11345 /* We only change the modes of scalar shifts. */
11349 /* Do the remainder of the processing in RESULT_MODE. */
11352 /* If COMPLEMENT_P is set, we have to complement X before doing the outer
11353 operation. */
11358 {
11368 {
11369 /* This means that we have determined that the result is
11370 equivalent to a constant. This should be rare. */
11373 }
11376 else
11379 }
11382 }
11384 /* Simplify a shift of VAROP by COUNT bits. CODE says what kind of shift.
11385 The result of the shift is RESULT_MODE. If we cannot simplify it,
11386 return X or, if it is NULL, synthesize the expression with
11387 simplify_gen_binary. Otherwise, return a simplified value.
11389 The shift is normally computed in the widest mode we find in VAROP, as
11390 long as it isn't a different number of words than RESULT_MODE. Exceptions
11391 are ASHIFTRT and ROTATE, which are always done in their original mode. */
11393 static rtx
11396 {
11407 }
11409 \f
11410 /* A subroutine of recog_for_combine. See there for arguments and
11411 return value. */
11413 static int
11415 {
11417 rtx pat_without_clobbers;
11425 /* If PAT is a PARALLEL, check to see if it contains the CLOBBER
11426 we use to indicate that something didn't match. If we find such a
11427 thing, force rejection. */
11441 {
11444 else
11447 }
11449 /* If it isn't, there is the possibility that we previously had an insn
11450 that clobbered some register as a side effect, but the combined
11451 insn doesn't need to do that. So try once more without the clobbers
11452 unless this represents an ASM insn. */
11456 {
11461 {
11464 pos++;
11465 }
11475 {
11478 else
11481 }
11482 }
11489 /* Recognize all noop sets, these will be killed by followup pass. */
11493 /* If we had any clobbers to add, make a new pattern than contains
11494 them. Then check to make sure that all of them are dead. */
11496 {
11506 else
11513 {
11518 {
11522 }
11523 }
11525 }
11529 {
11537 /* Allow targets to reject combined insn. */
11539 {
11542 dump_file);
11544 /* Callers expect recog_for_combine to strip
11545 clobbers from the pattern on failure. */
11550 }
11555 }
11561 }
11563 /* Change every ZERO_EXTRACT and ZERO_EXTEND of a SUBREG that can be
11564 expressed as an AND and maybe an LSHIFTRT, to that formulation.
11565 Return whether anything was so changed. */
11567 static bool
11569 {
11575 {
11587 {
11597 else
11601 {
11607 }
11608 }
11614 {
11619 {
11625 }
11626 }
11631 {
11635 }
11636 else
11642 {
11645 }
11649 }
11656 scalar_int_mode mode;
11662 {
11676 else
11684 }
11687 }
11689 /* Like recog, but we receive the address of a pointer to a new pattern.
11690 We try to match the rtx that the pointer points to.
11691 If that fails, we may try to modify or replace the pattern,
11692 storing the replacement into the same pointer object.
11694 Modifications include deletion or addition of CLOBBERs. If the
11695 instruction will still not match, we change ZERO_EXTEND and ZERO_EXTRACT
11696 to the equivalent AND and perhaps LSHIFTRT patterns, and try with that
11697 (and undo if that fails).
11699 PNOTES is a pointer to a location where any REG_UNUSED notes added for
11700 the CLOBBERs are placed.
11702 The value is the final insn code from the pattern ultimately matched,
11703 or -1. */
11705 static int
11707 {
11719 {
11722 {
11726 }
11727 }
11730 {
11735 }
11738 }
11739 \f
11740 /* Like gen_lowpart_general but for use by combine. In combine it
11741 is not possible to create any new pseudoregs. However, it is
11742 safe to create invalid memory addresses, because combine will
11743 try to recognize them and all they will do is make the combine
11744 attempt fail.
11746 If for some reason this cannot do its job, an rtx
11747 (clobber (const_int 0)) is returned.
11748 An insn containing that will not be recognized. */
11750 static rtx
11752 {
11754 rtx result;
11759 /* We can only support MODE being wider than a word if X is a
11760 constant integer or has a mode the same size. */
11766 /* X might be a paradoxical (subreg (mem)). In that case, gen_lowpart
11767 won't know what to do. So we will strip off the SUBREG here and
11768 process normally. */
11770 {
11773 /* For use in case we fall down into the address adjustments
11774 further below, we need to adjust the known mode and size of
11775 x; imode and isize, since we just adjusted x. */
11780 }
11788 {
11789 /* Refuse to work on a volatile memory ref or one with a mode-dependent
11790 address. */
11795 /* If we want to refer to something bigger than the original memref,
11796 generate a paradoxical subreg instead. That will force a reload
11797 of the original memref X. */
11803 }
11805 /* If X is a comparison operator, rewrite it in a new mode. This
11806 probably won't match, but may allow further simplifications. */
11810 /* If we couldn't simplify X any other way, just enclose it in a
11811 SUBREG. Normally, this SUBREG won't match, but some patterns may
11812 include an explicit SUBREG or we may simplify it further in combine. */
11813 else
11814 {
11815 rtx res;
11818 {
11823 }
11827 }
11829 fail:
11831 }
11832 \f
11833 /* Try to simplify a comparison between OP0 and a constant OP1,
11834 where CODE is the comparison code that will be tested, into a
11835 (CODE OP0 const0_rtx) form.
11837 The result is a possibly different comparison code to use.
11838 *POP1 may be updated. */
11840 static enum rtx_code
11843 {
11844 scalar_int_mode int_mode;
11847 /* Get the constant we are comparing against and turn off all bits
11848 not on in our mode. */
11852 /* If we are comparing against a constant power of two and the value
11853 being compared can only have that single bit nonzero (e.g., it was
11854 `and'ed with that bit), we can replace this with a comparison
11855 with zero. */
11864 {
11867 }
11869 /* Similarly, if we are comparing a value known to be either -1 or
11870 0 with -1, change it to the opposite comparison against zero. */
11876 {
11879 }
11881 /* Do some canonicalizations based on the comparison code. We prefer
11882 comparisons against zero and then prefer equality comparisons.
11883 If we can reduce the size of a constant, we will do that too. */
11885 {
11887 /* < C is equivalent to <= (C - 1) */
11889 {
11892 /* ... fall through to LE case below. */
11894 }
11895 else
11899 /* <= C is equivalent to < (C + 1); we do this for C < 0 */
11901 {
11904 }
11906 /* If we are doing a <= 0 comparison on a value known to have
11907 a zero sign bit, we can replace this with == 0. */
11918 /* >= C is equivalent to > (C - 1). */
11920 {
11923 /* ... fall through to GT below. */
11925 }
11926 else
11930 /* > C is equivalent to >= (C + 1); we do this for C < 0. */
11932 {
11935 }
11937 /* If we are doing a > 0 comparison on a value known to have
11938 a zero sign bit, we can replace this with != 0. */
11949 /* < C is equivalent to <= (C - 1). */
11951 {
11954 /* ... fall through ... */
11956 }
11957 /* (unsigned) < 0x80000000 is equivalent to >= 0. */
11962 {
11966 }
11967 else
11971 /* unsigned <= 0 is equivalent to == 0 */
11974 /* (unsigned) <= 0x7fffffff is equivalent to >= 0. */
11978 == ((HOST_WIDE_INT_1U
11980 {
11983 }
11987 /* >= C is equivalent to > (C - 1). */
11989 {
11992 /* ... fall through ... */
11994 }
11996 /* (unsigned) >= 0x80000000 is equivalent to < 0. */
12001 {
12005 }
12006 else
12010 /* unsigned > 0 is equivalent to != 0 */
12013 /* (unsigned) > 0x7fffffff is equivalent to < 0. */
12017 == (HOST_WIDE_INT_1U
12019 {
12022 }
12027 }
12031 }
12032 \f
12033 /* Simplify a comparison between *POP0 and *POP1 where CODE is the
12034 comparison code that will be tested.
12036 The result is a possibly different comparison code to use. *POP0 and
12037 *POP1 may be updated.
12039 It is possible that we might detect that a comparison is either always
12040 true or always false. However, we do not perform general constant
12041 folding in combine, so this knowledge isn't useful. Such tautologies
12042 should have been detected earlier. Hence we ignore all such cases. */
12044 static enum rtx_code
12046 {
12052 opt_scalar_int_mode tmode_iter;
12054 /* Try a few ways of applying the same transformation to both operands. */
12056 {
12057 /* The test below this one won't handle SIGN_EXTENDs on these machines,
12058 so check specially. */
12077 {
12080 }
12082 /* If both operands are the same constant shift, see if we can ignore the
12083 shift. We can if the shift is a rotate or if the bits shifted out of
12084 this shift are known to be zero for both inputs and if the type of
12085 comparison is compatible with the shift. */
12098 {
12111 else
12113 }
12115 /* If both operands are AND's of a paradoxical SUBREG by constant, the
12116 SUBREGs are of the same mode, and, in both cases, the AND would
12117 be redundant if the comparison was done in the narrower mode,
12118 do the comparison in the narrower mode (e.g., we are AND'ing with 1
12119 and the operand's possibly nonzero bits are 0xffffff01; in that case
12120 if we only care about QImode, we don't need the AND). This case
12121 occurs if the output mode of an scc insn is not SImode and
12122 STORE_FLAG_VALUE == 1 (e.g., the 386).
12124 Similarly, check for a case where the AND's are ZERO_EXTEND
12125 operations from some narrower mode even though a SUBREG is not
12126 present. */
12131 {
12147 {
12151 /* The resulting comparison is always unsigned since we masked
12152 off the original sign bit. */
12156 }
12162 {
12168 }
12172 }
12174 /* If both operands are NOT, we can strip off the outer operation
12175 and adjust the comparison code for swapped operands; similarly for
12176 NEG, except that this must be an equality comparison. */
12182 else
12184 }
12186 /* If the first operand is a constant, swap the operands and adjust the
12187 comparison code appropriately, but don't do this if the second operand
12188 is already a constant integer. */
12190 {
12193 }
12195 /* We now enter a loop during which we will try to simplify the comparison.
12196 For the most part, we only are concerned with comparisons with zero,
12197 but some things may really be comparisons with zero but not start
12198 out looking that way. */
12201 {
12203 scalar_int_mode int_mode;
12207 HOST_WIDE_INT const_op;
12209 /* We only want to handle integral modes. This catches VOIDmode,
12210 CCmode, and the floating-point modes. An exception is that we
12211 can handle VOIDmode if OP0 is a COMPARE or a comparison
12212 operation. */
12219 /* Try to simplify the compare to constant, possibly changing the
12220 comparison op, and/or changing op1 to zero. */
12224 /* Compute some predicates to simplify code below. */
12231 /* If this is a sign bit comparison and we can do arithmetic in
12232 MODE, say that we will only be needing the sign bit of OP0. */
12237 HOST_WIDE_INT_1U
12242 {
12243 /* We can't do anything if OP0 is a condition code value, rather
12244 than an actual data value. */
12250 /* Get the two operands being compared. */
12253 else
12256 /* Check for the cases where we simply want the result of the
12257 earlier test or the opposite of that result. */
12261 {
12265 else
12269 {
12274 }
12275 }
12277 }
12283 /* Now try cases based on the opcode of OP0. If none of the cases
12284 does a "continue", we exit this loop immediately after the
12285 switch. */
12290 {
12292 /* If we are extracting a single bit from a variable position in
12293 a constant that has only a single bit set and are comparing it
12294 with zero, we can convert this into an equality comparison
12295 between the position and the location of the single bit. */
12296 /* Except we can't if SHIFT_COUNT_TRUNCATED is set, since we might
12297 have already reduced the shift count modulo the word size. */
12303 {
12311 /* Result is nonzero iff shift count is equal to I. */
12314 }
12316 /* fall through */
12321 {
12324 }
12328 /* If testing for equality, we can take the NOT of the constant. */
12331 {
12335 }
12337 /* If just looking at the sign bit, reverse the sense of the
12338 comparison. */
12340 {
12344 }
12348 /* If testing for equality, we can take the NEG of the constant. */
12351 {
12355 }
12357 /* The remaining cases only apply to comparisons with zero. */
12361 /* When X is ABS or is known positive,
12362 (neg X) is < 0 if and only if X != 0. */
12370 {
12374 }
12376 /* If we have NEG of something whose two high-order bits are the
12377 same, we know that "(-a) < 0" is equivalent to "a > 0". */
12379 {
12383 }
12387 /* If we are testing equality and our count is a constant, we
12388 can perform the inverse operation on our RHS. */
12392 {
12396 }
12398 /* If we are doing a < 0 or >= 0 comparison, it means we are testing
12399 a particular bit. Convert it to an AND of a constant of that
12400 bit. This will be converted into a ZERO_EXTRACT. */
12404 {
12406 (HOST_WIDE_INT_1U
12411 }
12413 /* Fall through. */
12416 /* ABS is ignorable inside an equality comparison with zero. */
12418 {
12421 }
12425 /* Can simplify (compare (zero/sign_extend FOO) CONST) to
12426 (compare FOO CONST) if CONST fits in FOO's mode and we
12427 are either testing inequality or have an unsigned
12428 comparison with ZERO_EXTEND or a signed comparison with
12429 SIGN_EXTEND. But don't do it if we don't have a compare
12430 insn of the given mode, since we'd have to revert it
12431 later on, and then we wouldn't know whether to sign- or
12432 zero-extend. */
12434 && ! unsigned_comparison_p
12438 {
12441 }
12445 /* Check for the case where we are comparing A - C1 with C2, that is
12447 (subreg:MODE (plus (A) (-C1))) op (C2)
12449 with C1 a constant, and try to lift the SUBREG, i.e. to do the
12450 comparison in the wider mode. One of the following two conditions
12451 must be true in order for this to be valid:
12453 1. The mode extension results in the same bit pattern being added
12454 on both sides and the comparison is equality or unsigned. As
12455 C2 has been truncated to fit in MODE, the pattern can only be
12456 all 0s or all 1s.
12458 2. The mode extension results in the sign bit being copied on
12459 each side.
12461 The difficulty here is that we have predicates for A but not for
12462 (A - C1) so we need to check that C1 is within proper bounds so
12463 as to perturbate A as little as possible. */
12472 {
12480 /* (A - C1) zero-extends if it is positive and sign-extends
12481 if it is negative, C2 both zero- and sign-extends. */
12485 /* (A - C1) sign-extends if it is positive and 1-extends
12486 if it is negative, C2 both sign- and 1-extends. */
12493 /* (A - C1) always sign-extends, like C2. */
12497 {
12500 }
12501 }
12503 /* If the inner mode is narrower and we are extracting the low part,
12504 we can treat the SUBREG as if it were a ZERO_EXTEND. */
12506 ;
12515 {
12516 /* Remove outer subregs that don't do anything. */
12521 {
12525 }
12527 }
12528 else
12531 /* FALLTHROUGH */
12540 {
12543 }
12547 /* (eq (plus X A) B) -> (eq X (minus B A)). We can only do
12548 this for equality comparisons due to pathological cases involving
12549 overflows. */
12553 {
12557 }
12559 /* (plus (abs X) (const_int -1)) is < 0 if and only if X == 0. */
12562 {
12566 }
12570 /* We used to optimize signed comparisons against zero, but that
12571 was incorrect. Unsigned comparisons against zero (GTU, LEU)
12572 arrive here as equality comparisons, or (GEU, LTU) are
12573 optimized away. No need to special-case them. */
12575 /* (eq (minus A B) C) -> (eq A (plus B C)) or
12576 (eq B (minus A C)), whichever simplifies. We can only do
12577 this for equality comparisons due to pathological cases involving
12578 overflows. */
12582 {
12586 }
12591 {
12595 }
12597 /* The sign bit of (minus (ashiftrt X C) X), where C is the number
12598 of bits in X minus 1, is one iff X > 0. */
12603 {
12607 }
12611 /* (eq (xor A B) C) -> (eq A (xor B C)). This is a simplification
12612 if C is zero or B is a constant. */
12616 {
12620 }
12625 /* The sign bit of (ior (plus X (const_int -1)) X) is nonzero
12626 iff X <= 0. */
12630 {
12634 }
12638 /* Convert (and (xshift 1 X) Y) to (and (lshiftrt Y X) 1). This
12639 will be converted to a ZERO_EXTRACT later. */
12643 {
12648 }
12650 /* If we are comparing (and (lshiftrt X C1) C2) for equality with
12651 zero and X is a comparison and C1 and C2 describe only bits set
12652 in STORE_FLAG_VALUE, we can compare with X. */
12660 {
12667 {
12670 }
12671 }
12673 /* If we are doing an equality comparison of an AND of a bit equal
12674 to the sign bit, replace this with a LT or GE comparison of
12675 the underlying value. */
12682 {
12686 }
12688 /* If this AND operation is really a ZERO_EXTEND from a narrower
12689 mode, the constant fits within that mode, and this is either an
12690 equality or unsigned comparison, try to do this comparison in
12691 the narrower mode.
12693 Note that in:
12695 (ne:DI (and:DI (reg:DI 4) (const_int 0xffffffff)) (const_int 0))
12696 -> (ne:DI (reg:SI 4) (const_int 0))
12698 unless TARGET_TRULY_NOOP_TRUNCATION allows it or the register is
12699 known to hold a value of the required mode the
12700 transformation is invalid. */
12708 {
12711 }
12713 /* If this is (and:M1 (subreg:M1 X:M2 0) (const_int C1)) where C1
12714 fits in both M1 and M2 and the SUBREG is either paradoxical
12715 or represents the low part, permute the SUBREG and the AND
12716 and try again. */
12719 {
12721 /* Require an integral mode, to avoid creating something like
12722 (AND:SF ...). */
12725 /* It is unsafe to commute the AND into the SUBREG if the
12726 SUBREG is paradoxical and WORD_REGISTER_OPERATIONS is
12727 not defined. As originally written the upper bits
12728 have a defined value due to the AND operation.
12729 However, if we commute the AND inside the SUBREG then
12730 they no longer have defined values and the meaning of
12731 the code has been changed.
12732 Also C1 should not change value in the smaller mode,
12733 see PR67028 (a positive C1 can become negative in the
12734 smaller mode, so that the AND does no longer mask the
12735 upper bits). */
12736 && ((WORD_REGISTER_OPERATIONS
12748 {
12754 }
12755 }
12757 /* Convert (ne (and (not X) 1) 0) to (eq (and X 1) 0). */
12761 {
12766 }
12768 /* Convert (ne (and (lshiftrt (not X)) 1) 0) to
12769 (eq (and (lshiftrt X) 1) 0).
12770 Also handle the case where (not X) is expressed using xor. */
12774 {
12784 == HOST_WIDE_INT_1U
12786 {
12787 op0
12792 }
12793 }
12797 /* If we have (compare (ashift FOO N) (const_int C)) and
12798 the high order N bits of FOO (N+1 if an inequality comparison)
12799 are known to be zero, we can do this by comparing FOO with C
12800 shifted right N bits so long as the low-order N bits of C are
12801 zero. */
12813 {
12814 /* We must perform a logical shift, not an arithmetic one,
12815 as we want the top N bits of C to be zero. */
12822 }
12824 /* If we are doing a sign bit comparison, it means we are testing
12825 a particular bit. Convert it to the appropriate AND. */
12828 {
12830 (HOST_WIDE_INT_1U
12835 }
12837 /* If this an equality comparison with zero and we are shifting
12838 the low bit to the sign bit, we can convert this to an AND of the
12839 low-order bit. */
12843 {
12846 }
12850 /* If this is an equality comparison with zero, we can do this
12851 as a logical shift, which might be much simpler. */
12854 {
12859 }
12861 /* If OP0 is a sign extension and CODE is not an unsigned comparison,
12862 do the comparison in a narrower mode. */
12872 {
12875 }
12877 /* Likewise if OP0 is a PLUS of a sign extension with a
12878 constant, which is usually represented with the PLUS
12879 between the shifts. */
12891 {
12899 new_const);
12901 }
12903 /* FALLTHROUGH */
12905 /* If we have (compare (xshiftrt FOO N) (const_int C)) and
12906 the low order N bits of FOO are known to be zero, we can do this
12907 by comparing FOO with C shifted left N bits so long as no
12908 overflow occurs. Even if the low order N bits of FOO aren't known
12909 to be zero, if the comparison is >= or < we can use the same
12910 optimization and for > or <= by setting all the low
12911 order N bits in the comparison constant. */
12922 {
12923 unsigned HOST_WIDE_INT low_bits
12925 & ((HOST_WIDE_INT_1U
12928 {
12929 /* If the shift was logical, then we must make the condition
12930 unsigned. */
12939 const_op
12944 }
12945 }
12947 /* If we are using this shift to extract just the sign bit, we
12948 can replace this with an LT or GE comparison. */
12953 {
12957 }
12962 }
12965 }
12967 /* Now make any compound operations involved in this comparison. Then,
12968 check for an outmost SUBREG on OP0 that is not doing anything or is
12969 paradoxical. The latter transformation must only be performed when
12970 it is known that the "extra" bits will be the same in op0 and op1 or
12971 that they don't matter. There are three cases to consider:
12973 1. SUBREG_REG (op0) is a register. In this case the bits are don't
12974 care bits and we can assume they have any convenient value. So
12975 making the transformation is safe.
12977 2. SUBREG_REG (op0) is a memory and LOAD_EXTEND_OP is UNKNOWN.
12978 In this case the upper bits of op0 are undefined. We should not make
12979 the simplification in that case as we do not know the contents of
12980 those bits.
12982 3. SUBREG_REG (op0) is a memory and LOAD_EXTEND_OP is not UNKNOWN.
12983 In that case we know those bits are zeros or ones. We must also be
12984 sure that they are the same as the upper bits of op1.
12986 We can never remove a SUBREG for a non-equality comparison because
12987 the sign bit is in a different place in the underlying object. */
13000 {
13002 {
13003 /* For paradoxical subregs, allow case 1 as above. Case 3 isn't
13004 implemented. */
13006 {
13009 }
13010 }
13014 {
13019 }
13020 }
13022 /* We now do the opposite procedure: Some machines don't have compare
13023 insns in all modes. If OP0's mode is an integer mode smaller than a
13024 word and we can't do a compare in that mode, see if there is a larger
13025 mode for which we can do the compare. There are a number of cases in
13026 which we can use the wider mode. */
13032 {
13037 {
13040 /* If this is a test for negative, we can make an explicit
13041 test of the sign bit. Test this first so we can use
13042 a paradoxical subreg to extend OP0. */
13046 {
13047 unsigned HOST_WIDE_INT sign
13054 }
13056 /* If the only nonzero bits in OP0 and OP1 are those in the
13057 narrower mode and this is an equality or unsigned comparison,
13058 we can use the wider mode. Similarly for sign-extended
13059 values, in which case it is true for all comparisons. */
13076 {
13077 /* If OP0 is an AND and we don't have an AND in MODE either,
13078 make a new AND in the proper mode. */
13086 else
13087 {
13089 {
13094 }
13095 else
13096 {
13101 }
13103 }
13104 }
13105 }
13106 }
13108 /* We may have changed the comparison operands. Re-canonicalize. */
13110 {
13113 }
13115 /* If this machine only supports a subset of valid comparisons, see if we
13116 can convert an unsupported one into a supported one. */
13123 }
13124 \f
13125 /* Utility function for record_value_for_reg. Count number of
13126 rtxs in X. */
13127 static int
13129 {
13136 {
13156 }
13167 }
13168 \f
13169 /* Utility function for following routine. Called when X is part of a value
13170 being stored into last_set_value. Sets last_set_table_tick
13171 for each register mentioned. Similar to mention_regs in cse.c */
13173 static void
13175 {
13181 {
13187 {
13190 }
13193 }
13197 {
13198 /* Check for identical subexpressions. If x contains
13199 identical subexpression we only have to traverse one of
13200 them. */
13202 {
13203 /* Note that at this point x1 has already been
13204 processed. */
13208 /* If x0 and x1 are identical then there is no need to
13209 process x0. */
13213 /* If x0 is identical to a subexpression of x1 then while
13214 processing x1, x0 has already been processed. Thus we
13215 are done with x. */
13220 /* If x1 is identical to a subexpression of x0 then we
13221 still have to process the rest of x0. */
13224 {
13227 }
13228 }
13231 }
13235 }
13237 /* Record that REG is set to VALUE in insn INSN. If VALUE is zero, we
13238 are saying that the register is clobbered and we no longer know its
13239 value. If INSN is zero, don't update reg_stat[].last_set; this is
13240 only permitted with VALUE also zero and is used to invalidate the
13241 register. */
13243 static void
13245 {
13251 /* If VALUE contains REG and we have a previous value for REG, substitute
13252 the previous value. */
13254 {
13255 rtx tem;
13257 /* Set things up so get_last_value is allowed to see anything set up to
13258 our insn. */
13262 /* If TEM is simply a binary operation with two CLOBBERs as operands,
13263 it isn't going to be useful and will take a lot of time to process,
13264 so just use the CLOBBER. */
13267 {
13273 {
13274 /* If there are two or more occurrences of REG in VALUE,
13275 prevent the value from growing too much. */
13278 }
13281 }
13282 }
13284 /* For each register modified, show we don't know its value, that
13285 we don't know about its bitwise content, that its value has been
13286 updated, and that we don't know the location of the death of the
13287 register. */
13289 {
13301 }
13303 /* Mark registers that are being referenced in this value. */
13307 /* Now update the status of each register being set.
13308 If someone is using this register in this block, set this register
13309 to invalid since we will get confused between the two lives in this
13310 basic block. This makes using this register always invalid. In cse, we
13311 scan the table to invalidate all entries using this register, but this
13312 is too much work for us. */
13315 {
13321 else
13323 }
13325 /* The value being assigned might refer to X (like in "x++;"). In that
13326 case, we must replace it with (clobber (const_int 0)) to prevent
13327 infinite loops. */
13330 {
13334 }
13336 /* For the main register being modified, update the value, the mode, the
13337 nonzero bits, and the number of sign bit copies. */
13342 {
13350 rsp->last_set_sign_bit_copies
13352 }
13353 }
13355 /* Called via note_stores from record_dead_and_set_regs to handle one
13356 SET or CLOBBER in an insn. DATA is the instruction in which the
13357 set is occurring. */
13359 static void
13361 {
13368 {
13372 }
13375 {
13376 /* If we are setting the whole register, we know its value. Otherwise
13377 show that we don't know the value. We can handle a SUBREG if it's
13378 the low part, but we must be careful with paradoxical SUBREGs on
13379 RISC architectures because we cannot strip e.g. an extension around
13380 a load and record the naked load since the RTL middle-end considers
13381 that the upper bits are defined according to LOAD_EXTEND_OP. */
13388 BITS_PER_WORD)
13391 WORD_REGISTER_OPERATIONS
13398 {
13401 && reg_is_clobbered_by_clobber_high
13405 }
13406 else
13408 }
13410 /* Ignore pushes, they clobber nothing. */
13413 }
13415 /* Update the records of when each REG was most recently set or killed
13416 for the things done by INSN. This is the last thing done in processing
13417 INSN in the combiner loop.
13419 We update reg_stat[], in particular fields last_set, last_set_value,
13420 last_set_mode, last_set_nonzero_bits, last_set_sign_bit_copies,
13421 last_death, and also the similar information mem_last_set (which insn
13422 most recently modified memory) and last_call_luid (which insn was the
13423 most recent subroutine call). */
13425 static void
13427 {
13428 rtx link;
13432 {
13435 {
13440 {
13445 }
13446 }
13449 }
13452 {
13453 hard_reg_set_iterator hrsi;
13455 {
13467 }
13471 /* We can't combine into a call pattern. Remember, though, that
13472 the return value register is set at this LUID. We could
13473 still replace a register with the return value from the
13474 wrong subroutine call! */
13476 }
13477 else
13479 }
13481 /* If a SUBREG has the promoted bit set, it is in fact a property of the
13482 register present in the SUBREG, so for each such SUBREG go back and
13483 adjust nonzero and sign bit information of the registers that are
13484 known to have some zero/sign bits set.
13486 This is needed because when combine blows the SUBREGs away, the
13487 information on zero/sign bits is lost and further combines can be
13488 missed because of that. */
13490 static void
13492 {
13494 rtx set;
13502 {
13511 {
13514 }
13518 {
13521 }
13524 {
13527 }
13528 else
13530 }
13531 }
13533 /* Check if X, a register, is known to contain a value already
13534 truncated to MODE. In this case we can use a subreg to refer to
13535 the truncated value even though in the generic case we would need
13536 an explicit truncation. */
13538 static bool
13540 {
13552 }
13554 /* If X is a hard reg or a subreg record the mode that the register is
13555 accessed in. For non-TARGET_TRULY_NOOP_TRUNCATION targets we might be
13556 able to turn a truncate into a subreg using this information. Return true
13557 if traversing X is complete. */
13559 static bool
13561 {
13562 machine_mode truncated_mode;
13566 {
13578 }
13579 /* ??? For hard-regs we now record everything. We might be able to
13580 optimize this using last_set_mode. */
13583 else
13590 {
13593 }
13596 }
13598 /* Callback for note_uses. Find hardregs and subregs of pseudos and
13599 the modes they are used in. This can help truning TRUNCATEs into
13600 SUBREGs. */
13602 static void
13604 {
13609 }
13611 /* Scan X for promoted SUBREGs. For each one found,
13612 note what it implies to the registers used in it. */
13614 static void
13616 {
13621 else
13622 {
13628 {
13638 }
13639 }
13640 }
13641 \f
13642 /* Verify that all the registers and memory references mentioned in *LOC are
13643 still valid. *LOC was part of a value set in INSN when label_tick was
13644 equal to TICK. Return 0 if some are not. If REPLACE is nonzero, replace
13645 the invalid references with (clobber (const_int 0)) and return 1. This
13646 replacement is useful because we often can get useful information about
13647 the form of a value (e.g., if it was produced by a shift that always
13648 produces -1 or 0) even though we don't know exactly what registers it
13649 was produced from. */
13651 static int
13653 {
13660 {
13666 {
13669 /* If this is a pseudo-register that was only set once and not
13670 live at the beginning of the function, it is always valid. */
13674 && (!REGNO_REG_SET_P
13676 regno)))
13678 {
13682 }
13683 }
13686 }
13687 /* If this is a memory reference, make sure that there were no stores after
13688 it that might have clobbered the value. We don't have alias info, so we
13689 assume any store invalidates it. Moreover, we only have local UIDs, so
13690 we also assume that there were stores in the intervening basic blocks. */
13693 {
13697 }
13700 {
13702 {
13703 /* Check for identical subexpressions. If x contains
13704 identical subexpression we only have to traverse one of
13705 them. */
13707 {
13708 /* Note that at this point x0 has already been checked
13709 and found valid. */
13713 /* If x0 and x1 are identical then x is also valid. */
13717 /* If x1 is identical to a subexpression of x0 then
13718 while checking x0, x1 has already been checked. Thus
13719 it is valid and so as x. */
13724 /* If x0 is identical to a subexpression of x1 then x is
13725 valid iff the rest of x1 is valid. */
13728 return
13732 }
13737 }
13743 }
13745 /* If we haven't found a reason for it to be invalid, it is valid. */
13747 }
13749 /* Get the last value assigned to X, if known. Some registers
13750 in the value may be replaced with (clobber (const_int 0)) if their value
13751 is known longer known reliably. */
13753 static rtx
13755 {
13757 rtx value;
13760 /* If this is a non-paradoxical SUBREG, get the value of its operand and
13761 then convert it to the desired mode. If this is a paradoxical SUBREG,
13762 we cannot predict what values the "extra" bits might have. */
13776 /* If we don't have a value, or if it isn't for this basic block and
13777 it's either a hard register, set more than once, or it's a live
13778 at the beginning of the function, return 0.
13780 Because if it's not live at the beginning of the function then the reg
13781 is always set before being used (is never used without being set).
13782 And, if it's set only once, and it's always set before use, then all
13783 uses must have the same last value, even if it's not from this basic
13784 block. */
13791 || REGNO_REG_SET_P
13795 /* If the value was set in a later insn than the ones we are processing,
13796 we can't use it even if the register was only set once. */
13801 /* If fewer bits were set than what we are asked for now, we cannot use
13802 the value. */
13807 /* If the value has all its registers valid, return it. */
13811 /* Otherwise, make a copy and replace any invalid register with
13812 (clobber (const_int 0)). If that fails for some reason, return 0. */
13819 }
13820 \f
13821 /* Define three variables used for communication between the following
13822 routines. */
13826 rtx reg_dead_reg;
13828 /* Function called via note_stores from reg_dead_at_p.
13830 If DEST is within [reg_dead_regno, reg_dead_endregno), set
13831 reg_dead_flag to 1 if X is a CLOBBER and to -1 it is a SET. */
13833 static void
13835 {
13849 }
13851 /* Return nonzero if REG is known to be dead at INSN.
13853 We scan backwards from INSN. If we hit a REG_DEAD note or a CLOBBER
13854 referencing REG, it is dead. If we hit a SET referencing REG, it is
13855 live. Otherwise, see if it is live or dead at the start of the basic
13856 block we are in. Hard regs marked as being live in NEWPAT_USED_REGS
13857 must be assumed to be always live. */
13859 static int
13861 {
13862 basic_block block;
13865 /* Set variables for reg_dead_at_p_1. */
13872 /* Check that reg isn't mentioned in NEWPAT_USED_REGS. For fixed registers
13873 we allow the machine description to decide whether use-and-clobber
13874 patterns are OK. */
13876 {
13880 }
13882 /* Scan backwards until we find a REG_DEAD note, SET, CLOBBER, or
13883 beginning of basic block. */
13886 {
13888 {
13898 }
13904 }
13906 /* Look at live-in sets for the basic block that we were in. */
13912 }
13913 \f
13914 /* Note hard registers in X that are used. */
13916 static void
13918 {
13924 {
13928 CASE_CONST_ANY:
13933 /* CC0 must die in the insn after it is set, so we don't need to take
13934 special note of it here. */
13939 /* If we are clobbering a MEM, mark any hard registers inside the
13940 address as used. */
13947 /* A hard reg in a wide mode may really be multiple registers.
13948 If so, mark all of them just like the first. */
13950 {
13951 /* None of this applies to the stack, frame or arg pointers. */
13953 || (!HARD_FRAME_POINTER_IS_FRAME_POINTER
13961 }
13965 {
13966 /* If setting a MEM, or a SUBREG of a MEM, then note any hard regs in
13967 the address. */
13979 }
13984 }
13986 /* Recursively scan the operands of this expression. */
13988 {
13992 {
13996 {
14001 }
14002 }
14003 }
14004 }
14005 \f
14006 /* Remove register number REGNO from the dead registers list of INSN.
14008 Return the note used to record the death, if there was one. */
14010 rtx
14012 {
14019 }
14021 /* For each register (hardware or pseudo) used within expression X, if its
14022 death is in an instruction with luid between FROM_LUID (inclusive) and
14023 TO_INSN (exclusive), put a REG_DEAD note for that register in the
14024 list headed by PNOTES.
14026 That said, don't move registers killed by maybe_kill_insn.
14028 This is done when X is being merged by combination into TO_INSN. These
14029 notes will then be distributed as needed. */
14031 static void
14034 {
14040 {
14044 /* If we do not know where the register died, it may still die between
14045 FROM_LUID and TO_INSN. If so, find it. This is PR83304. */
14047 {
14052 {
14054 {
14058 }
14061 }
14062 }
14064 /* Don't move the register if it gets killed in between from and to. */
14073 {
14076 /* It is possible for the call above to return 0. This can occur
14077 when last_death points to I2 or I1 that we combined with.
14078 In that case make a new note.
14080 We must also check for the case where X is a hard register
14081 and NOTE is a death note for a range of hard registers
14082 including X. In that case, we must put REG_DEAD notes for
14083 the remaining registers in place of NOTE. */
14087 {
14096 }
14098 /* If we didn't find any note, or if we found a REG_DEAD note that
14099 covers only part of the given reg, and we have a multi-reg hard
14100 register, then to be safe we must check for REG_DEAD notes
14101 for each register other than the first. They could have
14102 their own REG_DEAD notes lying around. */
14109 {
14116 else
14122 }
14125 {
14128 }
14129 else
14131 }
14134 }
14137 {
14142 /* In the case of a ZERO_EXTRACT, a STRICT_LOW_PART, or a SUBREG
14143 that accesses one word of a multi-word item, some
14144 piece of everything register in the expression is used by
14145 this insn, so remove any old death. */
14146 /* ??? So why do we test for equality of the sizes? */
14152 {
14155 }
14157 /* If this is some other SUBREG, we know it replaces the entire
14158 value, so use that as the destination. */
14162 /* If this is a MEM, adjust deaths of anything used in the address.
14163 For a REG (the only other possibility), the entire value is
14164 being replaced so the old value is not used in this insn. */
14170 }
14179 {
14181 {
14186 }
14189 }
14190 }
14191 \f
14192 /* Return 1 if X is the target of a bit-field assignment in BODY, the
14193 pattern of an insn. X must be a REG. */
14195 static int
14197 {
14201 {
14203 rtx target;
14210 else
14227 }
14235 }
14236 \f
14237 /* Given a chain of REG_NOTES originally from FROM_INSN, try to place them
14238 as appropriate. I3 and I2 are the insns resulting from the combination
14239 insns including FROM (I2 may be zero).
14241 ELIM_I2 and ELIM_I1 are either zero or registers that we know will
14242 not need REG_DEAD notes because they are being substituted for. This
14243 saves searching in the most common cases.
14245 Each note in the list is either ignored or placed on some insns, depending
14246 on the type of note. */
14248 static void
14251 {
14253 rtx tem_note;
14257 {
14262 {
14265 /* Doesn't matter much where we put this, as long as it's somewhere.
14266 It is preferable to keep these notes on branches, which is most
14267 likely to be i3. */
14274 else
14275 {
14278 }
14282 /* These notes must remain with the call or trapping instruction. */
14287 else
14288 {
14294 /* ??? Otherwise assume we've combined things such that we
14295 can now prove that the instructions can't trap. Drop the
14296 note in this case. */
14297 }
14301 /* ??? How to distribute between i3-i1. Assume i3 contains the
14302 entire adjustment. Assert i3 contains at least some adjust. */
14304 {
14306 /* fixup_args_size_notes looks at REG_NORETURN note,
14307 so ensure the note is placed there first. */
14309 {
14313 {
14319 }
14320 }
14322 /* emit_call_1 adds for !ACCUMULATE_OUTGOING_ARGS
14323 REG_ARGS_SIZE note to all noreturn calls, allow that here. */
14326 && !ACCUMULATE_OUTGOING_ARGS
14328 }
14336 /* These notes must remain with the call. It should not be
14337 possible for both I2 and I3 to be a call. */
14340 else
14341 {
14344 }
14348 /* Any clobbers for i3 may still exist, and so we must process
14349 REG_UNUSED notes from that insn.
14351 Any clobbers from i2 or i1 can only exist if they were added by
14352 recog_for_combine. In that case, recog_for_combine created the
14353 necessary REG_UNUSED notes. Trying to keep any original
14354 REG_UNUSED notes from these insns can cause incorrect output
14355 if it is for the same register as the original i3 dest.
14356 In that case, we will notice that the register is set in i3,
14357 and then add a REG_UNUSED note for the destination of i3, which
14358 is wrong. However, it is possible to have REG_UNUSED notes from
14359 i2 or i1 for register which were both used and clobbered, so
14360 we keep notes from i2 or i1 if they will turn into REG_DEAD
14361 notes. */
14363 /* If this register is set or clobbered in I3, put the note there
14364 unless there is one already. */
14366 {
14374 }
14375 /* Otherwise, if this register is used by I3, then this register
14376 now dies here, so we must put a REG_DEAD note here unless there
14377 is one already. */
14383 {
14386 }
14388 /* A SET or CLOBBER of the REG_UNUSED reg has been removed,
14389 but we can't tell which at this point. We must reset any
14390 expectations we had about the value that was previously
14391 stored in the reg. ??? Ideally, we'd adjust REG_N_SETS
14392 and, if appropriate, restore its previous value, but we
14393 don't have enough information for that at this point. */
14394 else
14395 {
14398 /* Otherwise, if this register is now referenced in i2
14399 then the register used to be modified in one of the
14400 original insns. If it was i3 (say, in an unused
14401 parallel), it's now completely gone, so the note can
14402 be discarded. But if it was modified in i2, i1 or i0
14403 and we still reference it in i2, then we're
14404 referencing the previous value, and since the
14405 register was modified and REG_UNUSED, we know that
14406 the previous value is now dead. So, if we only
14407 reference the register in i2, we change the note to
14408 REG_DEAD, to reflect the previous value. However, if
14409 we're also setting or clobbering the register as
14410 scratch, we know (because the register was not
14411 referenced in i3) that it's unused, just as it was
14412 unused before, and we place the note in i2. */
14415 {
14424 }
14425 }
14432 /* These notes say something about results of an insn. We can
14433 only support them if they used to be on I3 in which case they
14434 remain on I3. Otherwise they are ignored.
14436 If the note refers to an expression that is not a constant, we
14437 must also ignore the note since we cannot tell whether the
14438 equivalence is still true. It might be possible to do
14439 slightly better than this (we only have a problem if I2DEST
14440 or I1DEST is present in the expression), but it doesn't
14441 seem worth the trouble. */
14449 /* These notes say something about how a register is used. They must
14450 be present on any use of the register in I2 or I3. */
14455 {
14458 else
14460 }
14465 /* This can show up in several ways -- either directly in the
14466 pattern, or hidden off in the constant pool with (or without?)
14467 a REG_EQUAL note. */
14468 /* ??? Ignore the without-reg_equal-note problem for now. */
14480 {
14483 else
14485 }
14487 /* For REG_LABEL_TARGET on a JUMP_P, we prefer to put the note
14488 as a JUMP_LABEL or decrement LABEL_NUSES if it's already
14489 there. */
14494 {
14501 }
14507 {
14515 }
14519 /* This note says something about the value of a register prior
14520 to the execution of an insn. It is too much trouble to see
14521 if the note is still correct in all situations. It is better
14522 to simply delete it. */
14526 /* If we replaced the right hand side of FROM_INSN with a
14527 REG_EQUAL note, the original use of the dying register
14528 will not have been combined into I3 and I2. In such cases,
14529 FROM_INSN is guaranteed to be the first of the combined
14530 instructions, so we simply need to search back before
14531 FROM_INSN for the previous use or set of this register,
14532 then alter the notes there appropriately.
14534 If the register is used as an input in I3, it dies there.
14535 Similarly for I2, if it is nonzero and adjacent to I3.
14537 If the register is not used as an input in either I3 or I2
14538 and it is not one of the registers we were supposed to eliminate,
14539 there are two possibilities. We might have a non-adjacent I2
14540 or we might have somehow eliminated an additional register
14541 from a computation. For example, we might have had A & B where
14542 we discover that B will always be zero. In this case we will
14543 eliminate the reference to A.
14545 In both cases, we must search to see if we can find a previous
14546 use of A and put the death note there. */
14552 else
14553 {
14559 {
14560 /* If the new I2 sets the same register that is marked
14561 dead in the note, we do not in general know where to
14562 put the note. One important case we _can_ handle is
14563 when the note comes from I3. */
14566 else
14568 }
14575 && !(i2mod
14577 i2mod_old_rhs)))
14582 }
14585 {
14589 {
14591 {
14595 }
14597 /* If the register is being set at TEM_INSN, see if that is all
14598 TEM_INSN is doing. If so, delete TEM_INSN. Otherwise, make this
14599 into a REG_UNUSED note instead. Don't delete sets to
14600 global register vars. */
14604 {
14615 ;
14617 /* Verify that it was the set, and not a clobber that
14618 modified the register.
14620 CC0 targets must be careful to maintain setter/user
14621 pairs. If we cannot delete the setter due to side
14622 effects, mark the user with an UNUSED note instead
14623 of deleting it. */
14627 && (!HAVE_cc0
14631 {
14632 /* Move the notes and links of TEM_INSN elsewhere.
14633 This might delete other dead insns recursively.
14634 First set the pattern to something that won't use
14635 any register. */
14654 /* Delete the setter too. */
14656 {
14669 }
14670 }
14671 else
14672 {
14675 /* If there isn't already a REG_UNUSED note, put one
14676 here. Do not place a REG_DEAD note, even if
14677 the register is also used here; that would not
14678 match the algorithm used in lifetime analysis
14679 and can cause the consistency check in the
14680 scheduler to fail. */
14685 }
14686 }
14690 {
14693 /* If we are doing a 3->2 combination, and we have a
14694 register which formerly died in i3 and was not used
14695 by i2, which now no longer dies in i3 and is used in
14696 i2 but does not die in i2, and place is between i2
14697 and i3, then we may need to move a link from place to
14698 i2. */
14700 && from_insn
14703 {
14707 }
14709 }
14713 }
14715 }
14717 /* If the register is set or already dead at PLACE, we needn't do
14718 anything with this note if it is still a REG_DEAD note.
14719 We check here if it is set at all, not if is it totally replaced,
14720 which is what `dead_or_set_p' checks, so also check for it being
14721 set partially. */
14724 {
14730 {
14731 /* Unless the register previously died in PLACE, clear
14732 last_death. [I no longer understand why this is
14733 being done.] */
14737 }
14738 else
14741 /* If this is a death note for a hard reg that is occupying
14742 multiple registers, ensure that we are still using all
14743 parts of the object. If we find a piece of the object
14744 that is unused, we must arrange for an appropriate REG_DEAD
14745 note to be added for it. However, we can't just emit a USE
14746 and tag the note to it, since the register might actually
14747 be dead; so we recourse, and the recursive call then finds
14748 the previous insn that used this register. */
14751 {
14760 {
14763 }
14766 {
14767 /* Put only REG_DEAD notes for pieces that are
14768 not already dead or set. */
14772 {
14779 {
14781 NULL_RTX);
14785 NULL_RTX);
14786 }
14791 {
14793 {
14797 }
14801 {
14804 }
14805 }
14806 }
14809 }
14810 }
14811 }
14815 /* Any other notes should not be present at this point in the
14816 compilation. */
14818 }
14821 {
14825 /* Set added_notes_insn to the earliest insn we added a note to. */
14829 }
14832 {
14835 /* Set added_notes_insn to the earliest insn we added a note to. */
14839 }
14840 }
14841 }
14842 \f
14843 /* Similarly to above, distribute the LOG_LINKS that used to be present on
14844 I3, I2, and I1 to new locations. This is also called to add a link
14845 pointing at I3 when I3's destination is changed. */
14847 static void
14849 {
14853 {
14860 /* If the insn that this link points to is a NOTE, ignore it. */
14869 {
14872 {
14888 }
14891 }
14892 else
14905 /* A LOG_LINK is defined as being placed on the first insn that uses
14906 a register and points to the insn that sets the register. Start
14907 searching at the next insn after the target of the link and stop
14908 when we reach a set of the register or the end of the basic block.
14910 Note that this correctly handles the link that used to point from
14911 I3 to I2. Also note that not much searching is typically done here
14912 since most links don't point very far away. */
14921 {
14925 }
14928 {
14931 }
14935 /* If we found a place to put the link, place it there unless there
14936 is already a link to the same insn as LINK at that point. */
14939 {
14947 {
14951 /* Set added_links_insn to the earliest insn we added a
14952 link to. */
14956 }
14957 }
14958 }
14959 }
14960 \f
14961 /* Check for any register or memory mentioned in EQUIV that is not
14962 mentioned in EXPR. This is used to restrict EQUIV to "specializations"
14963 of EXPR where some registers may have been replaced by constants. */
14965 static bool
14967 {
14970 {
14975 }
14977 }
14978 \f
14979 DEBUG_FUNCTION void
14981 {
14982 fprintf
14984 ";; Combiner statistics: %d attempts, %d substitutions (%d requiring new space),\n;; %d successes.\n\n",
14986 }
14988 void
14990 {
14991 fprintf
14993 "\n;; Combiner totals: %d attempts, %d substitutions (%d requiring new space),\n;; %d successes.\n",
14995 }
14996 \f
14997 /* Make pseudo-to-pseudo copies after every hard-reg-to-pseudo-copy, because
14998 the reg-to-reg copy can usefully combine with later instructions, but we
14999 do not want to combine the hard reg into later instructions, for that
15000 restricts register allocation. */
15001 static void
15003 {
15004 basic_block bb;
15007 {
15011 {
15034 }
15035 }
15036 }
15038 /* Try combining insns through substitution. */
15039 static unsigned int
15041 {
15051 int rebuild_jump_labels_after_combine
15054 /* Combining insns may have turned an indirect jump into a
15055 direct jump. Rebuild the JUMP_LABEL fields of jumping
15056 instructions. */
15058 {
15065 }
15069 }
15074 {
15084 };
15087 {
15091 {}
15093 /* opt_pass methods: */
15096 {
15098 }
15104 rtl_opt_pass *
15106 {
15108 }