| blob | 613831e02cf7546844b4ae1a1301180de0fa1a6e |
1 /* Perform instruction reorganizations for delay slot filling.
2 Copyright (C) 1992-2020 Free Software Foundation, Inc.
3 Contributed by Richard Kenner (kenner@vlsi1.ultra.nyu.edu).
4 Hacked by Michael Tiemann (tiemann@cygnus.com).
6 This file is part of GCC.
8 GCC is free software; you can redistribute it and/or modify it under
9 the terms of the GNU General Public License as published by the Free
10 Software Foundation; either version 3, or (at your option) any later
11 version.
13 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
14 WARRANTY; without even the implied warranty of MERCHANTABILITY or
15 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
16 for more details.
18 You should have received a copy of the GNU General Public License
19 along with GCC; see the file COPYING3. If not see
20 <http://www.gnu.org/licenses/>. */
22 /* Instruction reorganization pass.
24 This pass runs after register allocation and final jump
25 optimization. It should be the last pass to run before peephole.
26 It serves primarily to fill delay slots of insns, typically branch
27 and call insns. Other insns typically involve more complicated
28 interactions of data dependencies and resource constraints, and
29 are better handled by scheduling before register allocation (by the
30 function `schedule_insns').
32 The Branch Penalty is the number of extra cycles that are needed to
33 execute a branch insn. On an ideal machine, branches take a single
34 cycle, and the Branch Penalty is 0. Several RISC machines approach
35 branch delays differently:
37 The MIPS has a single branch delay slot. Most insns
38 (except other branches) can be used to fill this slot. When the
39 slot is filled, two insns execute in two cycles, reducing the
40 branch penalty to zero.
42 The SPARC always has a branch delay slot, but its effects can be
43 annulled when the branch is not taken. This means that failing to
44 find other sources of insns, we can hoist an insn from the branch
45 target that would only be safe to execute knowing that the branch
46 is taken.
48 The HP-PA always has a branch delay slot. For unconditional branches
49 its effects can be annulled when the branch is taken. The effects
50 of the delay slot in a conditional branch can be nullified for forward
51 taken branches, or for untaken backward branches. This means
52 we can hoist insns from the fall-through path for forward branches or
53 steal insns from the target of backward branches.
55 The TMS320C3x and C4x have three branch delay slots. When the three
56 slots are filled, the branch penalty is zero. Most insns can fill the
57 delay slots except jump insns.
59 Three techniques for filling delay slots have been implemented so far:
61 (1) `fill_simple_delay_slots' is the simplest, most efficient way
62 to fill delay slots. This pass first looks for insns which come
63 from before the branch and which are safe to execute after the
64 branch. Then it searches after the insn requiring delay slots or,
65 in the case of a branch, for insns that are after the point at
66 which the branch merges into the fallthrough code, if such a point
67 exists. When such insns are found, the branch penalty decreases
68 and no code expansion takes place.
70 (2) `fill_eager_delay_slots' is more complicated: it is used for
71 scheduling conditional jumps, or for scheduling jumps which cannot
72 be filled using (1). A machine need not have annulled jumps to use
73 this strategy, but it helps (by keeping more options open).
74 `fill_eager_delay_slots' tries to guess the direction the branch
75 will go; if it guesses right 100% of the time, it can reduce the
76 branch penalty as much as `fill_simple_delay_slots' does. If it
77 guesses wrong 100% of the time, it might as well schedule nops. When
78 `fill_eager_delay_slots' takes insns from the fall-through path of
79 the jump, usually there is no code expansion; when it takes insns
80 from the branch target, there is code expansion if it is not the
81 only way to reach that target.
83 (3) `relax_delay_slots' uses a set of rules to simplify code that
84 has been reorganized by (1) and (2). It finds cases where
85 conditional test can be eliminated, jumps can be threaded, extra
86 insns can be eliminated, etc. It is the job of (1) and (2) to do a
87 good job of scheduling locally; `relax_delay_slots' takes care of
88 making the various individual schedules work well together. It is
89 especially tuned to handle the control flow interactions of branch
90 insns. It does nothing for insns with delay slots that do not
91 branch.
93 On machines that use CC0, we are very conservative. We will not make
94 a copy of an insn involving CC0 since we want to maintain a 1-1
95 correspondence between the insn that sets and uses CC0. The insns are
96 allowed to be separated by placing an insn that sets CC0 (but not an insn
97 that uses CC0; we could do this, but it doesn't seem worthwhile) in a
98 delay slot. In that case, we point each insn at the other with REG_CC_USER
99 and REG_CC_SETTER notes. Note that these restrictions affect very few
100 machines because most RISC machines with delay slots will not use CC0
101 (the RT is the only known exception at this point). */
121 \f
122 /* First, some functions that were used before GCC got a control flow graph.
123 These functions are now only used here in reorg.c, and have therefore
124 been moved here to avoid inadvertent misuse elsewhere in the compiler. */
126 /* Return the last label to mark the same position as LABEL. Return LABEL
127 itself if it is null or any return rtx. */
129 static rtx
131 {
139 /* __builtin_unreachable can create a CODE_LABEL followed by a BARRIER.
141 Since reaching the CODE_LABEL is undefined behavior, we can return
142 any code label and we're OK at runtime.
144 However, if we return a CODE_LABEL which leads to a shrinked wrapped
145 epilogue, but the path does not have a prologue, then we will trip
146 a sanity check in the dwarf2 cfi code which wants to verify that
147 the CFIs are all the same on the traces leading to the epilogue.
149 So we explicitly disallow looking through BARRIERS here. */
157 }
159 /* INSN uses CC0 and is being moved into a delay slot. Set up REG_CC_SETTER
160 and REG_CC_USER notes so we can find it. */
162 static void
164 {
172 }
173 \f
174 /* Insns which have delay slots that have not yet been filled. */
179 /* Define macros to refer to the first and last slot containing unfilled
180 insns. These are used because the list may move and its address
181 should be recomputed at each use. */
183 #define unfilled_slots_base \
184 ((rtx_insn **) obstack_base (&unfilled_slots_obstack))
186 #define unfilled_slots_next \
187 ((rtx_insn **) obstack_next_free (&unfilled_slots_obstack))
189 /* Points to the label before the end of the function, or before a
190 return insn. */
192 /* Likewise for a simple_return. */
195 /* Mapping between INSN_UID's and position in the code since INSN_UID's do
196 not always monotonically increase. */
199 /* Highest valid index in `uid_to_ruid'. */
227 rtx *);
249 \f
250 /* A wrapper around next_active_insn which takes care to return ret_rtx
251 unchanged. */
253 static rtx
255 {
259 }
260 \f
261 /* Return true iff INSN is a simplejump, or any kind of return insn. */
263 static bool
265 {
269 }
270 \f
271 /* Return TRUE if this insn should stop the search for insn to fill delay
272 slots. LABELS_P indicates that labels should terminate the search.
273 In all cases, jumps terminate the search. */
275 static int
277 {
281 /* If the insn can throw an exception that is caught within the function,
282 it may effectively perform a jump from the viewpoint of the function.
283 Therefore act like for a jump. */
288 {
302 /* OK unless it contains a delay slot or is an `asm' insn of some type.
303 We don't know anything about these. */
310 }
311 }
312 \f
313 /* Return TRUE if any resources are marked in both RES1 and RES2 or if either
314 resource set contains a volatile memory reference. Otherwise, return FALSE. */
316 static int
318 {
324 }
326 /* Return TRUE if any resource marked in RES, a `struct resources', is
327 referenced by INSN. If INCLUDE_DELAYED_EFFECTS is set, return if the called
328 routine is using those resources.
330 We compute this by computing all the resources referenced by INSN and
331 seeing if this conflicts with RES. It might be faster to directly check
332 ourselves, and this is the way it used to work, but it means duplicating
333 a large block of complex code. */
335 static int
338 {
344 }
346 /* Return TRUE if INSN modifies resources that are marked in RES.
347 INCLUDE_DELAYED_EFFECTS is set if the actions of that routine should be
348 included. CC0 is only modified if it is explicitly set; see comments
349 in front of mark_set_resources for details. */
351 static int
354 {
359 (include_delayed_effects
360 ? MARK_SRC_DEST_CALL
363 }
364 \f
365 /* Find a label at the end of the function or before a RETURN. If there
366 is none, try to make one. If that fails, returns 0.
368 The property of such a label is that it is placed just before the
369 epilogue or a bare RETURN insn, so that another bare RETURN can be
370 turned into a jump to the label unconditionally. In particular, the
371 label cannot be placed before a RETURN insn with a filled delay slot.
373 ??? There may be a problem with the current implementation. Suppose
374 we start with a bare RETURN insn and call find_end_label. It may set
375 function_return_label just before the RETURN. Suppose the machinery
376 is able to fill the delay slot of the RETURN insn afterwards. Then
377 function_return_label is no longer valid according to the property
378 described above and find_end_label will still return it unmodified.
379 Note that this is probably mitigated by the following observation:
380 once function_return_label is made, it is very likely the target of
381 a jump, so filling the delay slot of the RETURN will be much more
382 difficult.
383 KIND is either simple_return_rtx or ret_rtx, indicating which type of
384 return we're looking for. */
388 {
394 else
395 {
398 }
400 /* If we found one previously, return it. */
404 /* Otherwise, see if there is a label at the end of the function. If there
405 is, it must be that RETURN insns aren't needed, so that is our return
406 label and we don't have to do anything else. */
415 /* When a target threads its epilogue we might already have a
416 suitable return insn. If so put a label before it for the
417 function_return_label. */
421 {
426 /* Put the label before any USE insns that may precede the RETURN
427 insn. */
433 }
437 else
438 {
441 /* If the basic block reorder pass moves the return insn to
442 some other place try to locate it again and put our
443 function_return_label there. */
447 {
450 /* Put the label before any USE insns that may precede the
451 RETURN insn. */
456 }
457 else
458 {
460 /* The RETURN insn has its delay slot filled so we cannot
461 emit the label just before it. Since we already have
462 an epilogue and cannot emit a new RETURN, we cannot
463 emit the label at all. */
466 /* Otherwise, make a new label and emit a RETURN and BARRIER,
467 if needed. */
470 {
471 /* The return we make may have delay slots too. */
478 }
479 }
481 }
483 /* Show one additional use for this label so it won't go away until
484 we are done. */
488 }
489 \f
490 /* Put INSN and LIST together in a SEQUENCE rtx of LENGTH, and replace
491 the pattern of INSN with the SEQUENCE.
493 Returns the insn containing the SEQUENCE that replaces INSN. */
497 {
498 /* Allocate the rtvec to hold the insns and the SEQUENCE. */
503 /* If DELAY_INSN has a location, use it for SEQ_INSN. If DELAY_INSN does
504 not have a location, but one of the delayed insns does, we pick up a
505 location from there later. */
508 /* Unlink INSN from the insn chain, so that we can put it into
509 the SEQUENCE. Remember where we want to emit SEQUENCE in AFTER. */
514 /* Build our SEQUENCE and rebuild the insn chain. */
521 {
525 /* Show that this copy of the insn isn't deleted. */
528 /* Unlink insn from its original place, and re-emit it into
529 the sequence. */
533 /* SPARC assembler, for instance, emit warning when debug info is output
534 into the delay slot. */
540 {
543 {
545 /* Remove any REG_DEAD notes because we can't rely on them now
546 that the insn has been moved. */
552 /* Keep the label reference count up to date. */
559 }
560 }
561 }
564 /* Splice our SEQUENCE into the insn stream where INSN used to be. */
568 }
570 /* Add INSN to DELAY_LIST and return the head of the new list. The list must
571 be in the order in which the insns are to be executed. */
573 static void
575 {
576 /* If INSN has its block number recorded, clear it since we may
577 be moving the insn to a new block. */
581 }
582 \f
583 /* Delete INSN from the delay slot of the insn that it is in, which may
584 produce an insn with no delay slots. Return the new insn. */
588 {
594 /* We first must find the insn containing the SEQUENCE with INSN in its
595 delay slot. Do this by finding an insn, TRIAL, where
596 PREV_INSN (NEXT_INSN (TRIAL)) != TRIAL. */
601 ;
609 /* Create a delay list consisting of all the insns other than the one
610 we are deleting (unless we were the only one). */
617 /* Delete the old SEQUENCE, re-emit the insn that used to have the delay
618 list, and rebuild the delay list if non-empty. */
624 /* If there was a barrier after the old SEQUENCE, remit it. */
628 /* If there are any delay insns, remit them. Otherwise clear the
629 annul flag. */
637 /* Show we need to fill this insn again. */
641 }
642 \f
643 /* Delete INSN, a JUMP_INSN. If it is a conditional jump, we must track down
644 the insn that sets CC0 for it and delete it too. */
646 static void
648 {
649 /* Delete the insn that sets cc0 for us. On machines without cc0, we could
650 delete the insn that sets the condition code, but it is hard to find it.
651 Since this case is rare anyway, don't bother trying; there would likely
652 be other insns that became dead anyway, which we wouldn't know to
653 delete. */
656 {
659 /* If a reg-note was found, it points to an insn to set CC0. This
660 insn is in the delay list of some other insn. So delete it from
661 the delay list it was in. */
663 {
667 }
668 else
669 {
670 /* The insn setting CC0 is our previous insn, but it may be in
671 a delay slot. It will be the last insn in the delay slot, if
672 it is. */
681 else
683 }
684 }
687 }
688 \f
689 /* Counters for delay-slot filling. */
691 #define NUM_REORG_FUNCTIONS 2
692 #define MAX_DELAY_HISTOGRAM 3
693 #define MAX_REORG_PASSES 2
701 static void
703 {
708 }
709 \f
710 /* Optimize the following cases:
712 1. When a conditional branch skips over only one instruction,
713 use an annulling branch and put that insn in the delay slot.
714 Use either a branch that annuls when the condition if true or
715 invert the test with a branch that annuls when the condition is
716 false. This saves insns, since otherwise we must copy an insn
717 from the L1 target.
719 (orig) (skip) (otherwise)
720 Bcc.n L1 Bcc',a L1 Bcc,a L1'
721 insn insn insn2
722 L1: L1: L1:
723 insn2 insn2 insn2
724 insn3 insn3 L1':
725 insn3
727 2. When a conditional branch skips over only one instruction,
728 and after that, it unconditionally branches somewhere else,
729 perform the similar optimization. This saves executing the
730 second branch in the case where the inverted condition is true.
732 Bcc.n L1 Bcc',a L2
733 insn insn
734 L1: L1:
735 Bra L2 Bra L2
737 INSN is a JUMP_INSN.
739 This should be expanded to skip over N insns, where N is the number
740 of delay slots required. */
742 static void
744 {
761 /* There are two cases where we are just executing one insn (we assume
762 here that a branch requires only one insn; this should be generalized
763 at some point): Where the branch goes around a single insn or where
764 we have one insn followed by a branch to the same label we branch to.
765 In both of these cases, inverting the jump and annulling the delay
766 slot give the same effect in fewer insns. */
771 {
773 {
778 }
785 /* Also, if we are targeting an unconditional
786 branch, thread our jump to the target of that branch. Don't
787 change this into a RETURN here, because it may not accept what
788 we have in the delay slot. We'll fix this up later. */
790 {
796 {
797 /* Recompute the flags based on TARGET_LABEL since threading
798 the jump to TARGET_LABEL may change the direction of the
799 jump (which may change the circumstances in which the
800 delay slot is nullified). */
804 }
805 }
808 }
809 }
810 \f
811 /* Encode and return branch direction and prediction information for
812 INSN assuming it will jump to LABEL.
814 Non conditional branches return no direction information and
815 are predicted as very likely taken. */
817 static int
819 {
822 /* get_jump_flags can be passed any insn with delay slots, these may
823 be INSNs, CALL_INSNs, or JUMP_INSNs. Only JUMP_INSNs have branch
824 direction information, and only if they are conditional jumps.
826 If LABEL is a return, then there is no way to determine the branch
827 direction. */
833 flags
836 /* No valid direction information. */
837 else
841 }
843 /* Return truth value of the statement that this branch
844 is mostly taken. If we think that the branch is extremely likely
845 to be taken, we return 2. If the branch is slightly more likely to be
846 taken, return 1. If the branch is slightly less likely to be taken,
847 return 0 and if the branch is highly unlikely to be taken, return -1. */
849 static int
851 {
852 /* If branch probabilities are available, then use that number since it
853 always gives a correct answer. */
856 {
866 else
868 }
870 /* If there is no note, assume branches are not taken.
871 This should be rare. */
873 }
875 /* Return the condition under which INSN will branch to TARGET. If TARGET
876 is zero, return the condition under which INSN will return. If INSN is
877 an unconditional branch, return const_true_rtx. If INSN isn't a simple
878 type of jump, or it doesn't go to TARGET, return 0. */
880 static rtx
882 {
884 rtx src;
911 {
918 }
921 }
923 /* Return nonzero if CONDITION is more strict than the condition of
924 INSN, i.e., if INSN will always branch if CONDITION is true. */
926 static int
928 {
947 }
949 /* Return nonzero if redirecting JUMP to NEWLABEL does not invalidate
950 any insns already in the delay slot of JUMP. */
952 static int
954 {
958 /* Make sure all the delay slots of this jump would still
959 be valid after threading the jump. If they are still
960 valid, then return nonzero. */
965 #if ANNUL_IFFALSE_SLOTS
969 #endif
970 #if ANNUL_IFTRUE_SLOTS
974 #endif
979 }
981 /* Return nonzero if redirecting JUMP to NEWLABEL does not invalidate
982 any insns we wish to place in the delay slot of JUMP. */
984 static int
987 {
988 /* Make sure all the insns in DELAY_LIST would still be
989 valid after threading the jump. If they are still
990 valid, then return nonzero. */
997 #if ANNUL_IFFALSE_SLOTS
1001 #endif
1002 #if ANNUL_IFTRUE_SLOTS
1006 #endif
1011 }
1013 /* DELAY_LIST is a list of insns that have already been placed into delay
1014 slots. See if all of them have the same annulling status as ANNUL_TRUE_P.
1015 If not, return 0; otherwise return 1. */
1017 static int
1020 {
1029 }
1030 \f
1031 /* INSN branches to an insn whose pattern SEQ is a SEQUENCE. Given that
1032 the condition tested by INSN is CONDITION and the resources shown in
1033 OTHER_NEEDED are needed after INSN, see whether INSN can take all the insns
1034 from SEQ's delay list, in addition to whatever insns it may execute
1035 (in DELAY_LIST). SETS and NEEDED are denote resources already set and
1036 needed while searching for delay slot insns. Return the concatenated
1037 delay list if possible, otherwise, return 0.
1039 SLOTS_TO_FILL is the total number of slots required by INSN, and
1040 PSLOTS_FILLED points to the number filled so far (also the number of
1041 insns in DELAY_LIST). It is updated with the number that have been
1042 filled from the SEQUENCE, if any.
1044 PANNUL_P points to a nonzero value if we already know that we need
1045 to annul INSN. If this routine determines that annulling is needed,
1046 it may set that value nonzero.
1048 PNEW_THREAD points to a location that is to receive the place at which
1049 execution should continue. */
1051 static void
1059 {
1069 /* We can't do anything if there are more delay slots in SEQ than we
1070 can handle, or if we don't know that it will be a taken branch.
1071 We know that it will be a taken branch if it is either an unconditional
1072 branch or a conditional branch with a stricter branch condition.
1074 Also, exit if the branch has more than one set, since then it is computing
1075 other results that can't be ignored, e.g. the HPPA mov&branch instruction.
1076 ??? It may be possible to move other sets into INSN in addition to
1077 moving the instructions in the delay slots.
1079 We cannot steal the delay list if one of the instructions in the
1080 current delay_list modifies the condition codes and the jump in the
1081 sequence is a conditional jump. We cannot do this because we cannot
1082 change the direction of the jump because the condition codes
1083 will effect the direction of the jump in the sequence. */
1089 {
1093 }
1100 /* On some targets, branches with delay slots can have a limited
1101 displacement. Give the back end a chance to tell us we can't do
1102 this. */
1108 {
1115 /* If TRIAL sets CC0, we can't copy it, so we can't steal this
1116 delay list. */
1118 /* If TRIAL is from the fallthrough code of an annulled branch insn
1119 in SEQ, we cannot use it. */
1124 /* If this insn was already done (usually in a previous delay slot),
1125 pretend we put it in our delay slot. */
1130 /* We will end up re-vectoring this branch, so compute flags
1131 based on jumping to the new label. */
1145 {
1147 {
1148 /* Frame related instructions cannot go into annulled delay
1149 slots, it messes up the dwarf info. */
1153 }
1157 total_slots_filled++;
1161 }
1162 else
1164 }
1166 /* Record the effect of the instructions that were redundant and which
1167 we therefore decided not to copy. */
1170 {
1173 }
1175 /* Show the place to which we will be branching. */
1178 /* Add any new insns to the delay list and update the count of the
1179 number of slots filled. */
1187 }
1188 \f
1189 /* Similar to steal_delay_list_from_target except that SEQ is on the
1190 fallthrough path of INSN. Here we only do something if the delay insn
1191 of SEQ is an unconditional branch. In that case we steal its delay slot
1192 for INSN since unconditional branches are much easier to fill. */
1194 static void
1203 {
1211 /* We can't do anything if SEQ's delay insn isn't an
1212 unconditional branch. */
1218 {
1222 /* If TRIAL sets CC0, stealing it will move it too far from the use
1223 of CC0. */
1231 /* If this insn was already done, we don't need it. */
1233 {
1238 }
1248 {
1256 }
1257 else
1259 }
1263 }
1264 \f
1265 /* Try merging insns starting at THREAD which match exactly the insns in
1266 INSN's delay list.
1268 If all insns were matched and the insn was previously annulling, the
1269 annul bit will be cleared.
1271 For each insn that is merged, if the branch is or will be non-annulling,
1272 we delete the merged insn. */
1274 static void
1276 {
1292 /* If this is not an annulling branch, take into account anything needed in
1293 INSN's delay slot. This prevents two increments from being incorrectly
1294 folded into one. If we are annulling, this would be the correct
1295 thing to do. (The alternative, looking at things set in NEXT_TO_MATCH
1296 will essentially disable this optimization. This method is somewhat of
1297 a kludge, but I don't see a better way.) */
1305 {
1311 /* TRIAL must be a CALL_INSN or INSN. Skip USE and CLOBBER. */
1317 /* We can't share an insn that sets cc0. */
1323 /* Update next_trial, in case try_split succeeded. */
1325 /* Likewise THREAD. */
1328 /* Have to test this condition if annul condition is different
1329 from (and less restrictive than) non-annulling one. */
1331 {
1334 {
1341 }
1342 else
1349 }
1353 }
1355 /* See if we stopped on a filled insn. If we did, try to see if its
1356 delay slots match. */
1362 {
1366 /* Account for resources set/needed by the filled insn. */
1371 {
1375 /* Account for resources set by the insn following NEXT_TO_MATCH
1376 inside INSN's delay list. */
1380 /* Account for resources set by the insn before DTRIAL and inside
1381 TRIAL's delay list. */
1390 /* Check that DTRIAL and NEXT_TO_MATCH does not reference a
1391 resource modified between them (only dtrial is checked because
1392 next_to_match and dtrial shall to be equal in order to hit
1393 this line) */
1396 {
1398 {
1406 }
1407 else
1415 }
1416 else
1417 {
1418 /* Keep track of the set/referenced resources for the delay
1419 slots of any trial insns we encounter. */
1422 }
1423 }
1424 }
1426 /* If all insns in the delay slot have been matched and we were previously
1427 annulling the branch, we need not any more. In that case delete all the
1428 merged insns. Also clear the INSN_FROM_TARGET_P bit of each insn in
1429 the delay list so that we know that it isn't only being used at the
1430 target. */
1432 {
1436 {
1441 }
1442 else
1443 {
1446 }
1452 }
1453 }
1454 \f
1455 /* See if INSN is redundant with an insn in front of TARGET. Often this
1456 is called when INSN is a candidate for a delay slot of TARGET.
1457 DELAY_LIST are insns that will be placed in delay slots of TARGET in front
1458 of INSN. Often INSN will be redundant with an insn in a delay slot of
1459 some previous insn. This happens when we have a series of branches to the
1460 same label; in that case the first insn at the target might want to go
1461 into each of the delay slots.
1463 If we are not careful, this routine can take up a significant fraction
1464 of the total compilation time (4%), but only wins rarely. Hence we
1465 speed this routine up by making two passes. The first pass goes back
1466 until it hits a label and sees if it finds an insn with an identical
1467 pattern. Only in this (relatively rare) event does it check for
1468 data conflicts.
1470 We do not split insns we encounter. This could cause us not to find a
1471 redundant insn, but the cost of splitting seems greater than the possible
1472 gain in rare cases. */
1476 {
1480 rtx pat;
1485 /* If INSN has any REG_UNUSED notes, it can't match anything since we
1486 are allowed to not actually assign to such a register. */
1490 /* Scan backwards looking for a match. */
1495 {
1496 /* (use (insn))s can come immediately after a barrier if the
1497 label that used to precede them has been deleted as dead.
1498 See delete_related_insns. */
1514 {
1515 /* Stop for a CALL and its delay slots because it is difficult to
1516 track its resource needs correctly. */
1520 /* Stop for an INSN or JUMP_INSN with delayed effects and its delay
1521 slots because it is difficult to track its resource needs
1522 correctly. */
1530 /* See if any of the insns in the delay slot match, updating
1531 resource requirements as we go. */
1538 /* If found a match, exit this loop early. */
1541 }
1546 }
1548 /* If we didn't find an insn that matches, return 0. */
1552 /* See what resources this insn sets and needs. If they overlap, or
1553 if this insn references CC0, it can't be redundant. */
1560 /* If TARGET is a SEQUENCE, get the main insn. */
1566 /* The insn requiring the delay may not set anything needed or set by
1567 INSN. */
1572 /* Insns we pass may not set either NEEDED or SET, so merge them for
1573 simpler tests. */
1577 /* This insn isn't redundant if it conflicts with an insn that either is
1578 or will be in a delay slot of TARGET. */
1592 /* Scan backwards until we reach a label or an insn that uses something
1593 INSN sets or sets something insn uses or sets. */
1599 {
1612 {
1616 /* If this is a CALL_INSN and its delay slots, it is hard to track
1617 the resource needs properly, so give up. */
1621 /* If this is an INSN or JUMP_INSN with delayed effects, it
1622 is hard to track the resource needs properly, so give up. */
1633 /* See if any of the insns in the delay slot match, updating
1634 resource requirements as we go. */
1636 {
1639 /* If an insn will be annulled if the branch is false, it isn't
1640 considered as a possible duplicate insn. */
1643 {
1644 /* Show that this insn will be used in the sequel. */
1647 }
1649 /* Unless this is an annulled insn from the target of a branch,
1650 we must stop if it sets anything needed or set by INSN. */
1654 }
1656 /* If the insn requiring the delay slot conflicts with INSN, we
1657 must stop. */
1660 }
1661 else
1662 {
1663 /* See if TRIAL is the same as INSN. */
1668 /* Can't go any further if TRIAL conflicts with INSN. */
1671 }
1672 }
1675 }
1676 \f
1677 /* Return 1 if THREAD can only be executed in one way. If LABEL is nonzero,
1678 it is the target of the branch insn being scanned. If ALLOW_FALLTHROUGH
1679 is nonzero, we are allowed to fall into this thread; otherwise, we are
1680 not.
1682 If LABEL is used more than one or we pass a label other than LABEL before
1683 finding an active insn, we do not own this thread. */
1685 static int
1687 {
1691 /* We don't own the function end. */
1695 /* We have a non-NULL insn. */
1698 /* Get the first active insn, or THREAD_INSN, if it is an active insn. */
1709 /* Ensure that we reach a BARRIER before any insn or label. */
1721 }
1722 \f
1723 /* Called when INSN is being moved from a location near the target of a jump.
1724 We leave a marker of the form (use (INSN)) immediately in front of WHERE
1725 for mark_target_live_regs. These markers will be deleted at the end.
1727 We used to try to update the live status of registers if WHERE is at
1728 the start of a basic block, but that can't work since we may remove a
1729 BARRIER in relax_delay_slots. */
1731 static void
1733 {
1736 /* INSN might be making a value live in a block where it didn't use to
1737 be. So recompute liveness information for this block. */
1739 }
1741 /* Similar to REDIRECT_JUMP except that we update the BB_TICKS entry for
1742 the basic block containing the jump. */
1744 static int
1746 {
1749 }
1751 /* Called when INSN is being moved forward into a delay slot of DELAYED_INSN.
1752 We check every instruction between INSN and DELAYED_INSN for REG_DEAD notes
1753 that reference values used in INSN. If we find one, then we move the
1754 REG_DEAD note to INSN.
1756 This is needed to handle the case where a later insn (after INSN) has a
1757 REG_DEAD note for a register used by INSN, and this later insn subsequently
1758 gets moved before a CODE_LABEL because it is a redundant insn. In this
1759 case, mark_target_live_regs may be confused into thinking the register
1760 is dead because it sees a REG_DEAD note immediately before a CODE_LABEL. */
1762 static void
1764 {
1771 {
1779 {
1780 /* Move the REG_DEAD note from P to INSN. */
1784 }
1785 }
1786 }
1788 /* Called when an insn redundant with start_insn is deleted. If there
1789 is a REG_DEAD note for the target of start_insn between start_insn
1790 and stop_insn, then the REG_DEAD note needs to be deleted since the
1791 value no longer dies there.
1793 If the REG_DEAD note isn't deleted, then mark_target_live_regs may be
1794 confused into thinking the register is dead. */
1796 static void
1798 {
1805 {
1813 {
1816 }
1817 }
1818 }
1820 /* Delete any REG_UNUSED notes that exist on INSN but not on OTHER_INSN.
1822 This handles the case of udivmodXi4 instructions which optimize their
1823 output depending on whether any REG_UNUSED notes are present. We must
1824 make sure that INSN calculates as many results as OTHER_INSN does. */
1826 static void
1828 {
1832 {
1841 }
1842 }
1843 \f
1846 /* Return the label before INSN, or put a new label there. If SIBLING is
1847 non-zero, it is another label associated with the new label (if any),
1848 typically the former target of the jump that will be redirected to
1849 the new label. */
1853 {
1856 /* Find an existing label at this point
1857 or make a new one if there is none. */
1861 {
1868 {
1871 }
1872 }
1874 }
1876 /* Scan a function looking for insns that need a delay slot and find insns to
1877 put into the delay slot.
1879 NON_JUMPS_P is nonzero if we are to only try to fill non-jump insns (such
1880 as calls). We do these first since we don't want jump insns (that are
1881 easier to fill) to get the only insns that could be used for non-jump insns.
1882 When it is zero, only try to fill JUMP_INSNs.
1884 When slots are filled in this manner, the insns (including the
1885 delay_insn) are put together in a SEQUENCE rtx. In this fashion,
1886 it is possible to tell whether a delay slot has really been filled
1887 or not. `final' knows how to deal with this, by communicating
1888 through FINAL_SEQUENCE. */
1890 static void
1892 {
1894 rtx pat;
1902 {
1904 /* Get the next insn to fill. If it has already had any slots assigned,
1905 we can't do anything with it. Maybe we'll improve this later. */
1916 /* It may have been that this insn used to need delay slots, but
1917 now doesn't; ignore in that case. This can happen, for example,
1918 on the HP PA RISC, where the number of delay slots depends on
1919 what insns are nearby. */
1922 /* Some machine description have defined instructions to have
1923 delay slots only in certain circumstances which may depend on
1924 nearby insns (which change due to reorg's actions).
1926 For example, the PA port normally has delay slots for unconditional
1927 jumps.
1929 However, the PA port claims such jumps do not have a delay slot
1930 if they are immediate successors of certain CALL_INSNs. This
1931 allows the port to favor filling the delay slot of the call with
1932 the unconditional jump. */
1936 /* This insn needs, or can use, some delay slots. SLOTS_TO_FILL
1937 says how many. After initialization, first try optimizing
1939 call _foo call _foo
1940 nop add %o7,.-L1,%o7
1941 b,a L1
1942 nop
1944 If this case applies, the delay slot of the call is filled with
1945 the unconditional jump. This is done first to avoid having the
1946 delay slot of the call filled in the backward scan. Also, since
1947 the unconditional jump is likely to also have a delay slot, that
1948 insn must exist when it is subsequently scanned.
1950 This is tried on each insn with delay slots as some machines
1951 have insns which perform calls, but are not represented as
1952 CALL_INSNs. */
1959 else
1968 {
1970 slots_filled++;
1973 /* TRIAL may have had its delay slot filled, then unfilled. When
1974 the delay slot is unfilled, TRIAL is placed back on the unfilled
1975 slots obstack. Unfortunately, it is placed on the end of the
1976 obstack, not in its original location. Therefore, we must search
1977 from entry i + 1 to the end of the unfilled slots obstack to
1978 try and find TRIAL. */
1981 tmp++;
1983 /* Remove the unconditional jump from consideration for delay slot
1984 filling and unthread it. */
1987 {
1994 }
1995 }
1997 /* Now, scan backwards from the insn to search for a potential
1998 delay-slot candidate. Stop searching when a label or jump is hit.
2000 For each candidate, if it is to go into the delay slot (moved
2001 forward in execution sequence), it must not need or set any resources
2002 that were set by later insns and must not set any resources that
2003 are needed for those insns.
2005 The delay slot insn itself sets resources unless it is a call
2006 (in which case the called routine, not the insn itself, is doing
2007 the setting). */
2010 {
2011 /* If the flags register is dead after the insn, then we want to be
2012 able to accept a candidate that clobbers it. For this purpose,
2013 we need to filter the flags register during life analysis, so
2014 that it doesn't create RAW and WAW dependencies, while still
2015 creating the necessary WAR dependencies. */
2016 bool filter_flags
2025 {
2028 }
2033 {
2036 /* This must be an INSN or CALL_INSN. */
2039 /* Stand-alone USE and CLOBBER are just for flow. */
2043 /* And DEBUG_INSNs never go into delay slots. */
2047 /* Check for resource conflict first, to avoid unnecessary
2048 splitting. */
2054 /* Can't separate set of cc0 from its use. */
2057 {
2061 {
2062 /* In this case, we are searching backward, so if we
2063 find insns to put on the delay list, we want
2064 to put them at the head, rather than the
2065 tail, of the list. */
2074 }
2075 }
2079 {
2081 /* If the flags register is set, then it doesn't create RAW
2082 dependencies any longer and it also doesn't create WAW
2083 dependencies since it's dead after the original insn. */
2085 {
2088 }
2089 }
2091 }
2092 }
2094 /* If all needed slots haven't been filled, we come here. */
2096 /* Try to optimize case of jumping around a single insn. */
2103 {
2107 }
2109 /* Try to get insns from beyond the insn needing the delay slot.
2110 These insns can neither set or reference resources set in insns being
2111 skipped, cannot set resources in the insn being skipped, and, if this
2112 is a CALL_INSN (or a CALL_INSN is passed), cannot trap (because the
2113 call might not return).
2115 There used to be code which continued past the target label if
2116 we saw all uses of the target label. This code did not work,
2117 because it failed to account for some instructions which were
2118 both annulled and marked as from the target. This can happen as a
2119 result of optimize_skip. Since this code was redundant with
2120 fill_eager_delay_slots anyways, it was just deleted. */
2123 /* If this instruction could throw an exception which is
2124 caught in the same function, then it's not safe to fill
2125 the delay slot with an instruction from beyond this
2126 point. For example, consider:
2128 int i = 2;
2130 try {
2131 f();
2132 i = 3;
2133 } catch (...) {}
2135 return i;
2137 Even though `i' is a local variable, we must be sure not
2138 to put `i = 3' in the delay slot if `f' might throw an
2139 exception.
2141 Presumably, we should also check to see if we could get
2142 back to this function via `setjmp'. */
2145 {
2159 {
2162 /* This must be an INSN or CALL_INSN. */
2165 /* Stand-alone USE and CLOBBER are just for flow. */
2169 /* And DEBUG_INSNs do not go in delay slots. */
2173 /* If this already has filled delay slots, get the insn needing
2174 the delay slots. */
2177 else
2180 /* Stop our search when seeing a jump. */
2184 /* See if we have a resource problem before we try to split. */
2194 {
2204 }
2209 /* Ensure we don't put insns between the setting of cc and the
2210 comparison by moving a setting of cc into an earlier delay
2211 slot since these insns could clobber the condition code. */
2214 /* If this is a call, we might not get here. */
2217 }
2219 /* If there are slots left to fill and our search was stopped by an
2220 unconditional branch, try the insn at the branch target. We can
2221 redirect the branch if it works.
2223 Don't do this if the insn at the branch target is a branch. */
2225 && trial
2240 {
2241 /* See comment in relax_delay_slots about necessity of using
2242 next_real_nondebug_insn here. */
2247 else
2251 {
2254 slots_filled++;
2256 new_label);
2257 }
2258 }
2259 }
2261 /* If this is an unconditional jump, then try to get insns from the
2262 target of the jump. */
2281 }
2282 }
2283 \f
2284 /* Follow any unconditional jump at LABEL, for the purpose of redirecting JUMP;
2285 return the ultimate label reached by any such chain of jumps.
2286 Return a suitable return rtx if the chain ultimately leads to a
2287 return instruction.
2288 If LABEL is not followed by a jump, return LABEL.
2289 If the chain loops or we can't find end, return LABEL,
2290 since that tells caller to avoid changing the insn.
2291 If the returned label is obtained by following a crossing jump,
2292 set *CROSSING to true, otherwise set it to false. */
2294 static rtx
2296 {
2316 depth++)
2317 {
2320 /* If we have found a cycle, make the insn jump to itself. */
2324 /* Cannot follow returns and cannot look through tablejumps. */
2338 }
2342 }
2344 /* Try to find insns to place in delay slots.
2346 INSN is the jump needing SLOTS_TO_FILL delay slots. It tests CONDITION
2347 or is an unconditional branch if CONDITION is const_true_rtx.
2348 *PSLOTS_FILLED is updated with the number of slots that we have filled.
2350 THREAD is a flow-of-control, either the insns to be executed if the
2351 branch is true or if the branch is false, THREAD_IF_TRUE says which.
2353 OPPOSITE_THREAD is the thread in the opposite direction. It is used
2354 to see if any potential delay slot insns set things needed there.
2356 LIKELY is nonzero if it is extremely likely that the branch will be
2357 taken and THREAD_IF_TRUE is set. This is used for the branch at the
2358 end of a loop back up to the top.
2360 OWN_THREAD is true if we are the only user of the thread, i.e. it is
2361 the target of the jump when we are the only jump going there.
2363 If OWN_THREAD is false, it must be the "true" thread of a jump. In that
2364 case, we can only take insns from the head of the thread for our delay
2365 slot. We then adjust the jump to point after the insns we have taken. */
2367 static void
2372 {
2373 rtx new_thread;
2380 /* Validate our arguments. */
2386 /* If our thread is the end of subroutine, we can't get any delay
2387 insns from that. */
2393 /* If this is an unconditional branch, nothing is needed at the
2394 opposite thread. Otherwise, compute what is needed there. */
2397 else
2400 /* If the insn at THREAD can be split, do it here to avoid having to
2401 update THREAD and NEW_THREAD if it is done in the loop below. Also
2402 initialize NEW_THREAD. */
2406 /* Scan insns at THREAD. We are looking for an insn that can be removed
2407 from THREAD (it neither sets nor references resources that were set
2408 ahead of it and it doesn't set anything needs by the insns ahead of
2409 it) and that either can be placed in an annulling insn or aren't
2410 needed at OPPOSITE_THREAD. */
2415 /* Handle the flags register specially, to be able to accept a
2416 candidate that clobbers it. See also fill_simple_delay_slots. */
2417 bool filter_flags
2424 {
2428 }
2430 /* If we do not own this thread, we must stop as soon as we find
2431 something that we can't put in a delay slot, since all we can do
2432 is branch into THREAD at a later point. Therefore, labels stop
2433 the search if this is not the `true' thread. */
2438 {
2441 /* If we have passed a label, we no longer own this thread. */
2443 {
2446 }
2455 /* If TRIAL conflicts with the insns ahead of it, we lose. Also,
2456 don't separate or copy insns that set and use CC0. */
2460 /* If we're handling sets to the flags register specially, we
2461 only allow an insn into a delay-slot, if it either:
2462 - doesn't set the flags register,
2463 - the "set" of the flags register isn't used (clobbered),
2464 - insns between the delay-slot insn and the trial-insn
2465 as accounted in "set", have not affected the flags register. */
2466 && (! filter_flags
2473 {
2476 /* If TRIAL is redundant with some insn before INSN, we don't
2477 actually need to add it to the delay list; we can merely pretend
2478 we did. */
2480 {
2483 {
2486 {
2490 }
2493 }
2494 else
2495 {
2498 }
2501 }
2503 /* There are two ways we can win: If TRIAL doesn't set anything
2504 needed at the opposite thread and can't trap, or if it can
2505 go into an annulled delay slot. But we want neither to copy
2506 nor to speculate frame-related insns. */
2513 {
2523 }
2527 {
2540 {
2544 winner:
2549 /* If we own this thread, delete the insn. If this is the
2550 destination of a branch, show that a basic block status
2551 may have been updated. In any case, mark the new
2552 starting point of this thread. */
2554 {
2555 rtx note;
2559 {
2563 }
2565 /* We are moving this insn, not deleting it. We must
2566 temporarily increment the use count on any referenced
2567 label lest it be deleted by delete_related_insns. */
2573 {
2574 /* REG_LABEL_OPERAND could be
2575 NOTE_INSN_DELETED_LABEL too. */
2578 else
2581 }
2592 {
2593 /* REG_LABEL_OPERAND could be
2594 NOTE_INSN_DELETED_LABEL too. */
2597 else
2600 }
2603 }
2604 else
2614 {
2615 /* Even though we have filled all the slots, we
2616 may be branching to a location that has a
2617 redundant insn. Skip any if so. */
2624 && (prior_insn
2627 {
2628 /* We know we do not own the thread, so no need
2629 to call update_block and delete_insn. */
2632 new_thread
2634 }
2636 }
2639 }
2640 }
2641 }
2643 /* This insn can't go into a delay slot. */
2648 {
2651 /* Groups of flags-register setters with users should not
2652 affect opportunities to move flags-register-setting insns
2653 (clobbers) into the delay-slot. */
2656 }
2658 /* Ensure we don't put insns between the setting of cc and the comparison
2659 by moving a setting of cc into an earlier delay slot since these insns
2660 could clobber the condition code. */
2663 /* If this insn is a register-register copy and the next insn has
2664 a use of our destination, change it to use our source. That way,
2665 it will become a candidate for our delay slot the next time
2666 through this loop. This case occurs commonly in loops that
2667 scan a list.
2669 We could check for more complex cases than those tested below,
2670 but it doesn't seem worth it. It might also be a good idea to try
2671 to swap the two insns. That might do better.
2673 We can't do this if the next insn modifies our destination, because
2674 that would make the replacement into the insn invalid. We also can't
2675 do this if it modifies our source, because it might be an earlyclobber
2676 operand. This latter test also prevents updating the contents of
2677 a PRE_INC. We also can't do this if there's overlap of source and
2678 destination. Overlap may happen for larger-than-register-size modes. */
2684 {
2694 }
2695 }
2697 /* If we stopped on a branch insn that has delay slots, see if we can
2698 steal some of the insns in those slots. */
2702 {
2704 /* If this is the `true' thread, we will want to follow the jump,
2705 so we can only do this if we have taken everything up to here. */
2707 {
2713 /* If we owned the thread and are told that it branched
2714 elsewhere, make sure we own the thread at the new location. */
2717 }
2723 }
2725 /* If we haven't found anything for this delay slot and it is very
2726 likely that the branch will be taken, see if the insn at our target
2727 increments or decrements a register with an increment that does not
2728 depend on the destination register. If so, try to place the opposite
2729 arithmetic insn after the jump insn and put the arithmetic insn in the
2730 delay slot. If we can't do this, return. */
2737 {
2738 rtx dest;
2739 rtx src;
2741 /* We know "new_thread" is an insn due to NONJUMP_INSN_P (new_thread)
2742 above. */
2759 {
2761 rtx new_arith;
2764 /* If this is a constant adjustment, use the same code with
2765 the negated constant. Otherwise, reverse the sense of the
2766 arithmetic. */
2770 else
2779 {
2782 }
2785 {
2788 {
2792 }
2794 }
2795 else
2804 }
2805 }
2810 /* If we are to branch into the middle of this thread, find an appropriate
2811 label or make a new one if none, and redirect INSN to it. If we hit the
2812 end of the function, use the end-of-function label. */
2814 {
2815 rtx label;
2831 else
2836 {
2840 }
2841 }
2842 }
2843 \f
2844 /* Make another attempt to find insns to place in delay slots.
2846 We previously looked for insns located in front of the delay insn
2847 and, for non-jump delay insns, located behind the delay insn.
2849 Here only try to schedule jump insns and try to move insns from either
2850 the target or the following insns into the delay slot. If annulling is
2851 supported, we will be likely to do this. Otherwise, we can do this only
2852 if safe. */
2854 static void
2856 {
2862 {
2863 rtx condition;
2880 /* Some machine description have defined instructions to have
2881 delay slots only in certain circumstances which may depend on
2882 nearby insns (which change due to reorg's actions).
2884 For example, the PA port normally has delay slots for unconditional
2885 jumps.
2887 However, the PA port claims such jumps do not have a delay slot
2888 if they are immediate successors of certain CALL_INSNs. This
2889 allows the port to favor filling the delay slot of the call with
2890 the unconditional jump. */
2901 /* Get the next active fallthrough and target insns and see if we own
2902 them. Then see whether the branch is likely true. We don't need
2903 to do a lot of this for unconditional branches. */
2909 {
2913 }
2914 else
2915 {
2919 }
2921 /* If this insn is expected to branch, first try to get insns from our
2922 target, then our fallthrough insns. If it is not expected to branch,
2923 try the other order. */
2926 {
2929 own_target,
2933 {
2934 /* Even though we didn't find anything for delay slots,
2935 we might have found a redundant insn which we deleted
2936 from the thread that was filled. So we have to recompute
2937 the next insn at the target. */
2945 }
2946 }
2947 else
2948 {
2958 }
2968 }
2969 }
2970 \f
2973 /* Recursively delete prior insns that compute the value (used only by INSN
2974 which the caller is deleting) stored in the register mentioned by NOTE
2975 which is a REG_DEAD note associated with INSN. */
2977 static void
2979 {
2987 {
2990 /* If we reach a CALL which is not calling a const function
2991 or the callee pops the arguments, then give up. */
2997 /* If we reach a SEQUENCE, it is too complex to try to
2998 do anything with it, so give up. We can be run during
2999 and after reorg, so SEQUENCE rtl can legitimately show
3000 up here. */
3006 /* reorg creates USEs that look like this. We leave them
3007 alone because reorg needs them for its own purposes. */
3011 {
3016 {
3017 /* If we find a SET of something else, we can't
3018 delete the insn. */
3023 {
3029 }
3033 }
3036 {
3046 /* We may have a multi-word hard register and some, but not
3047 all, of the words of the register are needed in subsequent
3048 insns. Write REG_UNUSED notes for those parts that were not
3049 needed. */
3052 {
3063 }
3064 }
3067 }
3069 /* If PAT references the register that dies here, it is an
3070 additional use. Hence any prior SET isn't dead. However, this
3071 insn becomes the new place for the REG_DEAD note. */
3073 {
3077 }
3078 }
3079 }
3081 /* Delete INSN and recursively delete insns that compute values used only
3082 by INSN. This uses the REG_DEAD notes computed during flow analysis.
3084 Look at all our REG_DEAD notes. If a previous insn does nothing other
3085 than set a register that dies in this insn, we can delete that insn
3086 as well.
3088 On machines with CC0, if CC0 is used in this insn, we may be able to
3089 delete the insn that set it. */
3091 static void
3093 {
3097 {
3099 /* We assume that at this stage
3100 CC's are always set explicitly
3101 and always immediately before the jump that
3102 will use them. So if the previous insn
3103 exists to set the CC's, delete it
3104 (unless it performs auto-increments, etc.). */
3107 {
3111 else
3112 /* Otherwise, show that cc0 won't be used. */
3114 }
3115 }
3118 {
3122 /* Verify that the REG_NOTE is legitimate. */
3127 }
3130 }
3132 /* If all INSN does is set the pc, delete it,
3133 and delete the insn that set the condition codes for it
3134 if that's what the previous thing was. */
3136 static void
3138 {
3143 }
3147 {
3150 {
3156 }
3158 }
3160 /* Return TRUE if there is a NOTE_INSN_SWITCH_TEXT_SECTIONS note in between
3161 BEG and END. */
3163 static bool
3165 {
3171 }
3173 \f
3174 /* Once we have tried two ways to fill a delay slot, make a pass over the
3175 code to try to improve the results and to do such things as more jump
3176 threading. */
3178 static void
3180 {
3184 rtx target_label;
3186 /* Look at every JUMP_INSN and see if we can improve it. */
3188 {
3194 /* If this is a jump insn, see if it now jumps to a jump, jumps to
3195 the next insn, or jumps to a label that is not the last of a
3196 group of consecutive labels. */
3200 {
3202 target_label
3212 {
3215 }
3218 {
3222 }
3224 /* See if this jump conditionally branches around an unconditional
3225 jump. If so, invert this jump and point it to the target of the
3226 second jump. Check if it's possible on the target. */
3229 && target_label
3234 {
3237 /* Be careful how we do this to avoid deleting code or
3238 labels that are momentarily dead. See similar optimization
3239 in jump.c.
3241 We also need to ensure we properly handle the case when
3242 invert_jump fails. */
3249 {
3252 /* We have just removed a BARRIER, which means that the block
3253 number of the next insns has effectively been changed (see
3254 find_basic_block in resource.c), so clear it. */
3259 }
3268 }
3269 }
3271 /* If this is an unconditional jump and the previous insn is a
3272 conditional jump, try reversing the condition of the previous
3273 insn and swapping our targets. The next pass might be able to
3274 fill the slots.
3276 Don't do this if we expect the conditional branch to be true, because
3277 we would then be making the more common case longer. */
3284 {
3290 }
3292 /* Now look only at cases where we have a filled delay slot. */
3299 /* See if the first insn in the delay slot is redundant with some
3300 previous insn. Remove it from the delay slot if so; then set up
3301 to reprocess this insn. */
3303 {
3309 }
3311 /* See if we have a RETURN insn with a filled delay slot followed
3312 by a RETURN insn with an unfilled a delay slot. If so, we can delete
3313 the first RETURN (but not its delay insn). This gives the same
3314 effect in fewer instructions.
3316 Only do so if optimizing for size since this results in slower, but
3317 smaller code. */
3320 && next
3323 {
3327 /* Delete the RETURN and just execute the delay list insns.
3329 We do this by deleting the INSN containing the SEQUENCE, then
3330 re-emitting the insns separately, and then deleting the RETURN.
3331 This allows the count of the jump target to be properly
3332 decremented.
3334 Note that we need to change the INSN_UID of the re-emitted insns
3335 since it is used to hash the insns for mark_target_live_regs and
3336 the re-emitted insns will no longer be wrapped up in a SEQUENCE.
3338 Clear the from target bit, since these insns are no longer
3339 in delay slots. */
3352 }
3354 /* Now look only at the cases where we have a filled JUMP_INSN. */
3365 /* If this jump goes to another unconditional jump, thread it, but
3366 don't convert a jump into a RETURN here. */
3368 delay_jump_insn,
3375 {
3380 }
3382 /* If the first insn at TARGET_LABEL is redundant with a previous
3383 insn, redirect the jump to the following insn and process again.
3384 We use next_real_nondebug_insn instead of next_active_insn so we
3385 don't skip USE-markers, or we'll end up with incorrect
3386 liveness info. */
3391 {
3392 /* Figure out where to emit the special USE insn so we don't
3393 later incorrectly compute register live/death info. */
3399 {
3400 /* Insert the special USE insn and update dataflow info.
3401 We know "trial" is an insn here as it is the output of
3402 next_real_nondebug_insn () above. */
3405 /* Now emit a label before the special USE insn, and
3406 redirect our jump to the new label. */
3411 }
3412 }
3414 /* Similarly, if it is an unconditional jump with one insn in its
3415 delay list and that insn is redundant, thread the jump. */
3423 {
3431 {
3436 }
3437 }
3439 /* See if we have a simple (conditional) jump that is useless. */
3445 /* If the last insn in the delay slot sets CC0 for some insn,
3446 various code assumes that it is in a delay slot. We could
3447 put it back where it belonged and delete the register notes,
3448 but it doesn't seem worthwhile in this uncommon case. */
3449 && (!HAVE_cc0
3452 {
3456 /* All this insn does is execute its delay list and jump to the
3457 following insn. So delete the jump and just execute the delay
3458 list insns.
3460 We do this by deleting the INSN containing the SEQUENCE, then
3461 re-emitting the insns separately, and then deleting the jump.
3462 This allows the count of the jump target to be properly
3463 decremented.
3465 Note that we need to change the INSN_UID of the re-emitted insns
3466 since it is used to hash the insns for mark_target_live_regs and
3467 the re-emitted insns will no longer be wrapped up in a SEQUENCE.
3469 Clear the from target bit, since these insns are no longer
3470 in delay slots. */
3483 }
3485 /* See if this is an unconditional jump around a single insn which is
3486 identical to the one in its delay slot. In this case, we can just
3487 delete the branch and the insn in its delay slot. */
3493 {
3496 }
3498 /* See if this jump (with its delay slots) conditionally branches
3499 around an unconditional jump (without delay slots). If so, invert
3500 this jump and point it to the target of the second jump. We cannot
3501 do this for annulled jumps, though. Again, don't convert a jump to
3502 a RETURN here. */
3509 {
3516 /* find_end_label can generate a new label. Check this first. */
3521 {
3522 /* Be careful how we do this to avoid deleting code or labels
3523 that are momentarily dead. See similar optimization in
3524 jump.c */
3529 {
3530 /* Must update the INSN_FROM_TARGET_P bits now that
3531 the branch is reversed, so that mark_target_live_regs
3532 will handle the delay slot insn correctly. */
3534 {
3537 }
3539 /* We have just removed a BARRIER, which means that the block
3540 number of the next insns has effectively been changed (see
3541 find_basic_block in resource.c), so clear it. */
3547 }
3552 }
3553 }
3555 /* If we own the thread opposite the way this insn branches, see if we
3556 can merge its delay slots with following insns. */
3565 /* If we get here, we haven't deleted INSN. But we may have deleted
3566 NEXT, so recompute it. */
3568 }
3569 }
3570 \f
3572 /* Look for filled jumps to the end of function label. We can try to convert
3573 them into RETURN insns if the insns in the delay slot are valid for the
3574 RETURN as well. */
3576 static void
3578 {
3585 /* See if there is a RETURN insn in the function other than the one we
3586 made for END_OF_FUNCTION_LABEL. If so, set up anything we can't change
3587 into a RETURN to jump to it. */
3590 {
3594 else
3597 }
3599 /* Show an extra usage of REAL_RETURN_LABEL so it won't go away if it
3600 was equal to END_OF_FUNCTION_LABEL. */
3606 /* Clear the list of insns to fill so we can use it. */
3610 {
3614 /* Only look at filled JUMP_INSNs that go to the end of function
3615 label. */
3628 {
3631 }
3633 {
3636 }
3637 else
3642 /* If we can't make the jump into a RETURN, try to redirect it to the best
3643 RETURN and go on to the next insn. */
3645 {
3646 /* Make sure redirecting the jump will not invalidate the delay
3647 slot insns. */
3651 }
3653 /* See if this RETURN can accept the insns current in its delay slot.
3654 It can if it has more or an equal number of slots and the contents
3655 of each is valid. */
3660 {
3663 #if ANNUL_IFFALSE_SLOTS
3668 #endif
3669 #if ANNUL_IFTRUE_SLOTS
3674 #endif
3678 }
3679 else
3685 /* We have to do something with this insn. If it is an unconditional
3686 RETURN, delete the SEQUENCE and output the individual insns,
3687 followed by the RETURN. Then set things up so we try to find
3688 insns for its delay slots, if it needs some. */
3690 {
3702 }
3703 else
3704 /* It is probably more efficient to keep this with its current
3705 delay slot as a branch to a RETURN. */
3707 }
3709 /* Now delete REAL_RETURN_LABEL if we never used it. Then try to fill any
3710 new delay slots we have created. */
3719 }
3720 \f
3721 /* Try to find insns to place in delay slots. */
3723 static void
3725 {
3730 /* If the current function has no insns other than the prologue and
3731 epilogue, then do not try to fill any delay slots. */
3735 /* Find the highest INSN_UID and allocate and initialize our map from
3736 INSN_UID's to position in code. */
3738 {
3744 }
3750 /* Initialize the list of insns that need filling. */
3752 {
3755 }
3758 {
3759 rtx target;
3761 /* Skip vector tables. We can't get attributes for them. */
3772 /* Ensure all jumps go to the last of a set of consecutive labels. */
3779 }
3783 /* Show we haven't computed an end-of-function label yet. */
3786 /* Initialize the statistics for this function. */
3790 /* Now do the delay slot filling. Try everything twice in case earlier
3791 changes make more slots fillable. */
3795 reorg_pass_number++)
3796 {
3802 }
3804 /* If we made an end of function label, indicate that it is now
3805 safe to delete it by undoing our prior adjustment to LABEL_NUSES.
3806 If it is now unused, delete it. */
3820 /* Delete any USE insns made by update_block; subsequent passes don't need
3821 them or know how to deal with them. */
3823 {
3829 }
3833 /* It is not clear why the line below is needed, but it does seem to be. */
3837 {
3844 reorg_pass_number++)
3845 {
3848 {
3857 {
3863 }
3865 }
3866 }
3870 {
3875 {
3877 {
3878 rtx control;
3885 else
3887 }
3890 }
3891 }
3895 {
3897 {
3902 }
3903 }
3907 {
3911 {
3913 {
3918 }
3919 }
3921 }
3924 }
3927 {
3930 }
3935 }
3936 \f
3937 /* Run delay slot optimization. */
3938 static unsigned int
3940 {
3945 }
3950 {
3960 };
3963 {
3967 {}
3969 /* opt_pass methods: */
3972 {
3974 }
3978 bool
3980 {
3981 /* At -O0 dataflow info isn't updated after RA. */
3986 }
3990 rtl_opt_pass *
3992 {
3994 }
3996 /* Machine dependent reorg pass. */
4001 {
4011 };
4014 {
4018 {}
4020 /* opt_pass methods: */
4022 {
4024 }
4027 {
4030 }
4036 rtl_opt_pass *
4038 {
4040 }