1 /* Perform various loop optimizations, including strength reduction.
2 Copyright (C) 1987, 88, 89, 91-98, 1999 Free Software Foundation, Inc.
4 This file is part of GNU CC.
6 GNU CC is free software; you can redistribute it and/or modify
7 it under the terms of the GNU General Public License as published by
8 the Free Software Foundation; either version 2, or (at your option)
11 GNU CC is distributed in the hope that it will be useful,
12 but WITHOUT ANY WARRANTY; without even the implied warranty of
13 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 GNU General Public License for more details.
16 You should have received a copy of the GNU General Public License
17 along with GNU CC; see the file COPYING. If not, write to
18 the Free Software Foundation, 59 Temple Place - Suite 330,
19 Boston, MA 02111-1307, USA. */
22 /* This is the loop optimization pass of the compiler.
23 It finds invariant computations within loops and moves them
24 to the beginning of the loop. Then it identifies basic and
25 general induction variables. Strength reduction is applied to the general
26 induction variables, and induction variable elimination is applied to
27 the basic induction variables.
29 It also finds cases where
30 a register is set within the loop by zero-extending a narrower value
31 and changes these to zero the entire register once before the loop
32 and merely copy the low part within the loop.
34 Most of the complexity is in heuristics to decide when it is worth
35 while to do these things. */
42 #include "insn-config.h"
43 #include "insn-flags.h"
45 #include "hard-reg-set.h"
53 /* Vector mapping INSN_UIDs to luids.
54 The luids are like uids but increase monotonically always.
55 We use them to see whether a jump comes from outside a given loop. */
59 /* Indexed by INSN_UID, contains the ordinal giving the (innermost) loop
60 number the insn is contained in. */
64 /* 1 + largest uid of any insn. */
68 /* 1 + luid of last insn. */
72 /* Number of loops detected in current function. Used as index to the
75 static int max_loop_num;
77 /* Indexed by loop number, contains the first and last insn of each loop. */
79 static rtx *loop_number_loop_starts, *loop_number_loop_ends;
81 /* Likewise for the continue insn */
82 static rtx *loop_number_loop_cont;
84 /* The first code_label that is reached in every loop iteration.
85 0 when not computed yet, initially const0_rtx if a jump couldn't be
87 Also set to 0 when there is no such label before the NOTE_INSN_LOOP_CONT
88 of this loop, or in verify_dominator, if a jump couldn't be followed. */
89 static rtx *loop_number_cont_dominator;
91 /* For each loop, gives the containing loop number, -1 if none. */
95 #ifdef HAVE_decrement_and_branch_on_count
96 /* Records whether resource in use by inner loop. */
98 int *loop_used_count_register;
99 #endif /* HAVE_decrement_and_branch_on_count */
101 /* Indexed by loop number, contains a nonzero value if the "loop" isn't
102 really a loop (an insn outside the loop branches into it). */
104 static char *loop_invalid;
106 /* Indexed by loop number, links together all LABEL_REFs which refer to
107 code labels outside the loop. Used by routines that need to know all
108 loop exits, such as final_biv_value and final_giv_value.
110 This does not include loop exits due to return instructions. This is
111 because all bivs and givs are pseudos, and hence must be dead after a
112 return, so the presense of a return does not affect any of the
113 optimizations that use this info. It is simpler to just not include return
114 instructions on this list. */
116 rtx *loop_number_exit_labels;
118 /* Indexed by loop number, counts the number of LABEL_REFs on
119 loop_number_exit_labels for this loop and all loops nested inside it. */
121 int *loop_number_exit_count;
123 /* Nonzero if there is a subroutine call in the current loop. */
125 static int loop_has_call;
127 /* Nonzero if there is a volatile memory reference in the current
130 static int loop_has_volatile;
132 /* Nonzero if there is a tablejump in the current loop. */
134 static int loop_has_tablejump;
136 /* Added loop_continue which is the NOTE_INSN_LOOP_CONT of the
137 current loop. A continue statement will generate a branch to
138 NEXT_INSN (loop_continue). */
140 static rtx loop_continue;
142 /* Indexed by register number, contains the number of times the reg
143 is set during the loop being scanned.
144 During code motion, a negative value indicates a reg that has been
145 made a candidate; in particular -2 means that it is an candidate that
146 we know is equal to a constant and -1 means that it is an candidate
147 not known equal to a constant.
148 After code motion, regs moved have 0 (which is accurate now)
149 while the failed candidates have the original number of times set.
151 Therefore, at all times, == 0 indicates an invariant register;
152 < 0 a conditionally invariant one. */
154 static varray_type set_in_loop;
156 /* Original value of set_in_loop; same except that this value
157 is not set negative for a reg whose sets have been made candidates
158 and not set to 0 for a reg that is moved. */
160 static varray_type n_times_set;
162 /* Index by register number, 1 indicates that the register
163 cannot be moved or strength reduced. */
165 static varray_type may_not_optimize;
167 /* Contains the insn in which a register was used if it was used
168 exactly once; contains const0_rtx if it was used more than once. */
170 static varray_type reg_single_usage;
172 /* Nonzero means reg N has already been moved out of one loop.
173 This reduces the desire to move it out of another. */
175 static char *moved_once;
177 /* List of MEMs that are stored in this loop. */
179 static rtx loop_store_mems;
181 /* The insn where the first of these was found. */
182 static rtx first_loop_store_insn;
184 typedef struct loop_mem_info {
185 rtx mem; /* The MEM itself. */
186 rtx reg; /* Corresponding pseudo, if any. */
187 int optimize; /* Nonzero if we can optimize access to this MEM. */
190 /* Array of MEMs that are used (read or written) in this loop, but
191 cannot be aliased by anything in this loop, except perhaps
192 themselves. In other words, if loop_mems[i] is altered during the
193 loop, it is altered by an expression that is rtx_equal_p to it. */
195 static loop_mem_info *loop_mems;
197 /* The index of the next available slot in LOOP_MEMS. */
199 static int loop_mems_idx;
201 /* The number of elements allocated in LOOP_MEMs. */
203 static int loop_mems_allocated;
205 /* Nonzero if we don't know what MEMs were changed in the current loop.
206 This happens if the loop contains a call (in which case `loop_has_call'
207 will also be set) or if we store into more than NUM_STORES MEMs. */
209 static int unknown_address_altered;
211 /* Count of movable (i.e. invariant) instructions discovered in the loop. */
212 static int num_movables;
214 /* Count of memory write instructions discovered in the loop. */
215 static int num_mem_sets;
217 /* Number of loops contained within the current one, including itself. */
218 static int loops_enclosed;
220 /* Bound on pseudo register number before loop optimization.
221 A pseudo has valid regscan info if its number is < max_reg_before_loop. */
222 int max_reg_before_loop;
224 /* This obstack is used in product_cheap_p to allocate its rtl. It
225 may call gen_reg_rtx which, in turn, may reallocate regno_reg_rtx.
226 If we used the same obstack that it did, we would be deallocating
229 static struct obstack temp_obstack;
231 /* This is where the pointer to the obstack being used for RTL is stored. */
233 extern struct obstack *rtl_obstack;
235 #define obstack_chunk_alloc xmalloc
236 #define obstack_chunk_free free
238 /* During the analysis of a loop, a chain of `struct movable's
239 is made to record all the movable insns found.
240 Then the entire chain can be scanned to decide which to move. */
244 rtx insn; /* A movable insn */
245 rtx set_src; /* The expression this reg is set from. */
246 rtx set_dest; /* The destination of this SET. */
247 rtx dependencies; /* When INSN is libcall, this is an EXPR_LIST
248 of any registers used within the LIBCALL. */
249 int consec; /* Number of consecutive following insns
250 that must be moved with this one. */
251 int regno; /* The register it sets */
252 short lifetime; /* lifetime of that register;
253 may be adjusted when matching movables
254 that load the same value are found. */
255 short savings; /* Number of insns we can move for this reg,
256 including other movables that force this
257 or match this one. */
258 unsigned int cond : 1; /* 1 if only conditionally movable */
259 unsigned int force : 1; /* 1 means MUST move this insn */
260 unsigned int global : 1; /* 1 means reg is live outside this loop */
261 /* If PARTIAL is 1, GLOBAL means something different:
262 that the reg is live outside the range from where it is set
263 to the following label. */
264 unsigned int done : 1; /* 1 inhibits further processing of this */
266 unsigned int partial : 1; /* 1 means this reg is used for zero-extending.
267 In particular, moving it does not make it
269 unsigned int move_insn : 1; /* 1 means that we call emit_move_insn to
270 load SRC, rather than copying INSN. */
271 unsigned int move_insn_first:1;/* Same as above, if this is necessary for the
272 first insn of a consecutive sets group. */
273 unsigned int is_equiv : 1; /* 1 means a REG_EQUIV is present on INSN. */
274 enum machine_mode savemode; /* Nonzero means it is a mode for a low part
275 that we should avoid changing when clearing
276 the rest of the reg. */
277 struct movable *match; /* First entry for same value */
278 struct movable *forces; /* An insn that must be moved if this is */
279 struct movable *next;
282 static struct movable *the_movables;
284 FILE *loop_dump_stream;
286 /* Forward declarations. */
288 static void verify_dominator PROTO((int));
289 static void find_and_verify_loops PROTO((rtx));
290 static void mark_loop_jump PROTO((rtx, int));
291 static void prescan_loop PROTO((rtx, rtx));
292 static int reg_in_basic_block_p PROTO((rtx, rtx));
293 static int consec_sets_invariant_p PROTO((rtx, int, rtx));
294 static rtx libcall_other_reg PROTO((rtx, rtx));
295 static int labels_in_range_p PROTO((rtx, int));
296 static void count_one_set PROTO((rtx, rtx, varray_type, rtx *));
298 static void count_loop_regs_set PROTO((rtx, rtx, varray_type, varray_type,
300 static void note_addr_stored PROTO((rtx, rtx));
301 static int loop_reg_used_before_p PROTO((rtx, rtx, rtx, rtx, rtx));
302 static void scan_loop PROTO((rtx, rtx, rtx, int, int));
304 static void replace_call_address PROTO((rtx, rtx, rtx));
306 static rtx skip_consec_insns PROTO((rtx, int));
307 static int libcall_benefit PROTO((rtx));
308 static void ignore_some_movables PROTO((struct movable *));
309 static void force_movables PROTO((struct movable *));
310 static void combine_movables PROTO((struct movable *, int));
311 static int regs_match_p PROTO((rtx, rtx, struct movable *));
312 static int rtx_equal_for_loop_p PROTO((rtx, rtx, struct movable *));
313 static void add_label_notes PROTO((rtx, rtx));
314 static void move_movables PROTO((struct movable *, int, int, rtx, rtx, int));
315 static int count_nonfixed_reads PROTO((rtx));
316 static void strength_reduce PROTO((rtx, rtx, rtx, int, rtx, rtx, rtx, int, int));
317 static void find_single_use_in_loop PROTO((rtx, rtx, varray_type));
318 static int valid_initial_value_p PROTO((rtx, rtx, int, rtx));
319 static void find_mem_givs PROTO((rtx, rtx, int, rtx, rtx));
320 static void record_biv PROTO((struct induction *, rtx, rtx, rtx, rtx, rtx *, int, int));
321 static void check_final_value PROTO((struct induction *, rtx, rtx,
322 unsigned HOST_WIDE_INT));
323 static void record_giv PROTO((struct induction *, rtx, rtx, rtx, rtx, rtx, int, enum g_types, int, rtx *, rtx, rtx));
324 static void update_giv_derive PROTO((rtx));
325 static int basic_induction_var PROTO((rtx, enum machine_mode, rtx, rtx, rtx *, rtx *, rtx **));
326 static rtx simplify_giv_expr PROTO((rtx, int *));
327 static int general_induction_var PROTO((rtx, rtx *, rtx *, rtx *, int, int *));
328 static int consec_sets_giv PROTO((int, rtx, rtx, rtx, rtx *, rtx *, rtx *));
329 static int check_dbra_loop PROTO((rtx, int, rtx, struct loop_info *));
330 static rtx express_from_1 PROTO((rtx, rtx, rtx));
331 static rtx combine_givs_p PROTO((struct induction *, struct induction *));
332 static void combine_givs PROTO((struct iv_class *));
333 struct recombine_givs_stats;
334 static int find_life_end PROTO((rtx, struct recombine_givs_stats *, rtx, rtx));
335 static void recombine_givs PROTO((struct iv_class *, rtx, rtx, int));
336 static int product_cheap_p PROTO((rtx, rtx));
337 static int maybe_eliminate_biv PROTO((struct iv_class *, rtx, rtx, int, int, int));
338 static int maybe_eliminate_biv_1 PROTO((rtx, rtx, struct iv_class *, int, rtx));
339 static int last_use_this_basic_block PROTO((rtx, rtx));
340 static void record_initial PROTO((rtx, rtx));
341 static void update_reg_last_use PROTO((rtx, rtx));
342 static rtx next_insn_in_loop PROTO((rtx, rtx, rtx, rtx));
343 static void load_mems_and_recount_loop_regs_set PROTO((rtx, rtx, rtx,
345 static void load_mems PROTO((rtx, rtx, rtx, rtx));
346 static int insert_loop_mem PROTO((rtx *, void *));
347 static int replace_loop_mem PROTO((rtx *, void *));
348 static int replace_label PROTO((rtx *, void *));
350 typedef struct rtx_and_int {
355 typedef struct rtx_pair {
360 /* Nonzero iff INSN is between START and END, inclusive. */
361 #define INSN_IN_RANGE_P(INSN, START, END) \
362 (INSN_UID (INSN) < max_uid_for_loop \
363 && INSN_LUID (INSN) >= INSN_LUID (START) \
364 && INSN_LUID (INSN) <= INSN_LUID (END))
366 #ifdef HAVE_decrement_and_branch_on_count
367 /* Test whether BCT applicable and safe. */
368 static void insert_bct PROTO((rtx, rtx, struct loop_info *));
370 /* Auxiliary function that inserts the BCT pattern into the loop. */
371 static void instrument_loop_bct PROTO((rtx, rtx, rtx));
372 #endif /* HAVE_decrement_and_branch_on_count */
374 /* Indirect_jump_in_function is computed once per function. */
375 int indirect_jump_in_function = 0;
376 static int indirect_jump_in_function_p PROTO((rtx));
378 static int compute_luids PROTO((rtx, rtx, int));
380 static int loop_insn_first_p PROTO((rtx, rtx));
382 static int biv_elimination_giv_has_0_offset PROTO((struct induction *,
383 struct induction *, rtx));
385 /* Relative gain of eliminating various kinds of operations. */
388 static int shift_cost;
389 static int mult_cost;
392 /* Benefit penalty, if a giv is not replaceable, i.e. must emit an insn to
393 copy the value of the strength reduced giv to its original register. */
394 static int copy_cost;
396 /* Cost of using a register, to normalize the benefits of a giv. */
397 static int reg_address_cost;
403 char *free_point = (char *) oballoc (1);
404 rtx reg = gen_rtx_REG (word_mode, LAST_VIRTUAL_REGISTER + 1);
406 add_cost = rtx_cost (gen_rtx_PLUS (word_mode, reg, reg), SET);
409 reg_address_cost = ADDRESS_COST (reg);
411 reg_address_cost = rtx_cost (reg, MEM);
414 /* We multiply by 2 to reconcile the difference in scale between
415 these two ways of computing costs. Otherwise the cost of a copy
416 will be far less than the cost of an add. */
420 /* Free the objects we just allocated. */
423 /* Initialize the obstack used for rtl in product_cheap_p. */
424 gcc_obstack_init (&temp_obstack);
427 /* Compute the mapping from uids to luids.
428 LUIDs are numbers assigned to insns, like uids,
429 except that luids increase monotonically through the code.
430 Start at insn START and stop just before END. Assign LUIDs
431 starting with PREV_LUID + 1. Return the last assigned LUID + 1. */
433 compute_luids (start, end, prev_luid)
440 for (insn = start, i = prev_luid; insn != end; insn = NEXT_INSN (insn))
442 if (INSN_UID (insn) >= max_uid_for_loop)
444 /* Don't assign luids to line-number NOTEs, so that the distance in
445 luids between two insns is not affected by -g. */
446 if (GET_CODE (insn) != NOTE
447 || NOTE_LINE_NUMBER (insn) <= 0)
448 uid_luid[INSN_UID (insn)] = ++i;
450 /* Give a line number note the same luid as preceding insn. */
451 uid_luid[INSN_UID (insn)] = i;
456 /* Entry point of this file. Perform loop optimization
457 on the current function. F is the first insn of the function
458 and DUMPFILE is a stream for output of a trace of actions taken
459 (or 0 if none should be output). */
462 loop_optimize (f, dumpfile, unroll_p, bct_p)
463 /* f is the first instruction of a chain of insns for one function */
471 loop_dump_stream = dumpfile;
473 init_recog_no_volatile ();
475 max_reg_before_loop = max_reg_num ();
477 moved_once = (char *) alloca (max_reg_before_loop);
478 bzero (moved_once, max_reg_before_loop);
482 /* Count the number of loops. */
485 for (insn = f; insn; insn = NEXT_INSN (insn))
487 if (GET_CODE (insn) == NOTE
488 && NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG)
492 /* Don't waste time if no loops. */
493 if (max_loop_num == 0)
496 /* Get size to use for tables indexed by uids.
497 Leave some space for labels allocated by find_and_verify_loops. */
498 max_uid_for_loop = get_max_uid () + 1 + max_loop_num * 32;
500 uid_luid = (int *) alloca (max_uid_for_loop * sizeof (int));
501 uid_loop_num = (int *) alloca (max_uid_for_loop * sizeof (int));
503 bzero ((char *) uid_luid, max_uid_for_loop * sizeof (int));
504 bzero ((char *) uid_loop_num, max_uid_for_loop * sizeof (int));
506 /* Allocate tables for recording each loop. We set each entry, so they need
508 loop_number_loop_starts = (rtx *) alloca (max_loop_num * sizeof (rtx));
509 loop_number_loop_ends = (rtx *) alloca (max_loop_num * sizeof (rtx));
510 loop_number_loop_cont = (rtx *) alloca (max_loop_num * sizeof (rtx));
511 loop_number_cont_dominator = (rtx *) alloca (max_loop_num * sizeof (rtx));
512 loop_outer_loop = (int *) alloca (max_loop_num * sizeof (int));
513 loop_invalid = (char *) alloca (max_loop_num * sizeof (char));
514 loop_number_exit_labels = (rtx *) alloca (max_loop_num * sizeof (rtx));
515 loop_number_exit_count = (int *) alloca (max_loop_num * sizeof (int));
517 #ifdef HAVE_decrement_and_branch_on_count
518 /* Allocate for BCT optimization */
519 loop_used_count_register = (int *) alloca (max_loop_num * sizeof (int));
520 bzero ((char *) loop_used_count_register, max_loop_num * sizeof (int));
521 #endif /* HAVE_decrement_and_branch_on_count */
523 /* Find and process each loop.
524 First, find them, and record them in order of their beginnings. */
525 find_and_verify_loops (f);
527 /* Now find all register lifetimes. This must be done after
528 find_and_verify_loops, because it might reorder the insns in the
530 reg_scan (f, max_reg_num (), 1);
532 /* This must occur after reg_scan so that registers created by gcse
533 will have entries in the register tables.
535 We could have added a call to reg_scan after gcse_main in toplev.c,
536 but moving this call to init_alias_analysis is more efficient. */
537 init_alias_analysis ();
539 /* See if we went too far. Note that get_max_uid already returns
540 one more that the maximum uid of all insn. */
541 if (get_max_uid () > max_uid_for_loop)
543 /* Now reset it to the actual size we need. See above. */
544 max_uid_for_loop = get_max_uid ();
546 /* find_and_verify_loops has already called compute_luids, but it might
547 have rearranged code afterwards, so we need to recompute the luids now. */
548 max_luid = compute_luids (f, NULL_RTX, 0);
550 /* Don't leave gaps in uid_luid for insns that have been
551 deleted. It is possible that the first or last insn
552 using some register has been deleted by cross-jumping.
553 Make sure that uid_luid for that former insn's uid
554 points to the general area where that insn used to be. */
555 for (i = 0; i < max_uid_for_loop; i++)
557 uid_luid[0] = uid_luid[i];
558 if (uid_luid[0] != 0)
561 for (i = 0; i < max_uid_for_loop; i++)
562 if (uid_luid[i] == 0)
563 uid_luid[i] = uid_luid[i - 1];
565 /* Create a mapping from loops to BLOCK tree nodes. */
566 if (unroll_p && write_symbols != NO_DEBUG)
567 find_loop_tree_blocks ();
569 /* Determine if the function has indirect jump. On some systems
570 this prevents low overhead loop instructions from being used. */
571 indirect_jump_in_function = indirect_jump_in_function_p (f);
573 /* Now scan the loops, last ones first, since this means inner ones are done
574 before outer ones. */
575 for (i = max_loop_num-1; i >= 0; i--)
576 if (! loop_invalid[i] && loop_number_loop_ends[i])
577 scan_loop (loop_number_loop_starts[i], loop_number_loop_ends[i],
578 loop_number_loop_cont[i], unroll_p, bct_p);
580 /* If debugging and unrolling loops, we must replicate the tree nodes
581 corresponding to the blocks inside the loop, so that the original one
582 to one mapping will remain. */
583 if (unroll_p && write_symbols != NO_DEBUG)
584 unroll_block_trees ();
586 end_alias_analysis ();
589 /* Returns the next insn, in execution order, after INSN. START and
590 END are the NOTE_INSN_LOOP_BEG and NOTE_INSN_LOOP_END for the loop,
591 respectively. LOOP_TOP, if non-NULL, is the top of the loop in the
592 insn-stream; it is used with loops that are entered near the
596 next_insn_in_loop (insn, start, end, loop_top)
602 insn = NEXT_INSN (insn);
607 /* Go to the top of the loop, and continue there. */
621 /* Optimize one loop whose start is LOOP_START and end is END.
622 LOOP_START is the NOTE_INSN_LOOP_BEG and END is the matching
624 LOOP_CONT is the NOTE_INSN_LOOP_CONT. */
626 /* ??? Could also move memory writes out of loops if the destination address
627 is invariant, the source is invariant, the memory write is not volatile,
628 and if we can prove that no read inside the loop can read this address
629 before the write occurs. If there is a read of this address after the
630 write, then we can also mark the memory read as invariant. */
633 scan_loop (loop_start, end, loop_cont, unroll_p, bct_p)
634 rtx loop_start, end, loop_cont;
639 /* 1 if we are scanning insns that could be executed zero times. */
641 /* 1 if we are scanning insns that might never be executed
642 due to a subroutine call which might exit before they are reached. */
644 /* For a rotated loop that is entered near the bottom,
645 this is the label at the top. Otherwise it is zero. */
647 /* Jump insn that enters the loop, or 0 if control drops in. */
648 rtx loop_entry_jump = 0;
649 /* Place in the loop where control enters. */
651 /* Number of insns in the loop. */
656 /* The SET from an insn, if it is the only SET in the insn. */
658 /* Chain describing insns movable in current loop. */
659 struct movable *movables = 0;
660 /* Last element in `movables' -- so we can add elements at the end. */
661 struct movable *last_movable = 0;
662 /* Ratio of extra register life span we can justify
663 for saving an instruction. More if loop doesn't call subroutines
664 since in that case saving an insn makes more difference
665 and more registers are available. */
667 /* Nonzero if we are scanning instructions in a sub-loop. */
671 /* Determine whether this loop starts with a jump down to a test at
672 the end. This will occur for a small number of loops with a test
673 that is too complex to duplicate in front of the loop.
675 We search for the first insn or label in the loop, skipping NOTEs.
676 However, we must be careful not to skip past a NOTE_INSN_LOOP_BEG
677 (because we might have a loop executed only once that contains a
678 loop which starts with a jump to its exit test) or a NOTE_INSN_LOOP_END
679 (in case we have a degenerate loop).
681 Note that if we mistakenly think that a loop is entered at the top
682 when, in fact, it is entered at the exit test, the only effect will be
683 slightly poorer optimization. Making the opposite error can generate
684 incorrect code. Since very few loops now start with a jump to the
685 exit test, the code here to detect that case is very conservative. */
687 for (p = NEXT_INSN (loop_start);
689 && GET_CODE (p) != CODE_LABEL && GET_RTX_CLASS (GET_CODE (p)) != 'i'
690 && (GET_CODE (p) != NOTE
691 || (NOTE_LINE_NUMBER (p) != NOTE_INSN_LOOP_BEG
692 && NOTE_LINE_NUMBER (p) != NOTE_INSN_LOOP_END));
698 /* Set up variables describing this loop. */
699 prescan_loop (loop_start, end);
700 threshold = (loop_has_call ? 1 : 2) * (1 + n_non_fixed_regs);
702 /* If loop has a jump before the first label,
703 the true entry is the target of that jump.
704 Start scan from there.
705 But record in LOOP_TOP the place where the end-test jumps
706 back to so we can scan that after the end of the loop. */
707 if (GET_CODE (p) == JUMP_INSN)
711 /* Loop entry must be unconditional jump (and not a RETURN) */
713 && JUMP_LABEL (p) != 0
714 /* Check to see whether the jump actually
715 jumps out of the loop (meaning it's no loop).
716 This case can happen for things like
717 do {..} while (0). If this label was generated previously
718 by loop, we can't tell anything about it and have to reject
720 && INSN_IN_RANGE_P (JUMP_LABEL (p), loop_start, end))
722 loop_top = next_label (scan_start);
723 scan_start = JUMP_LABEL (p);
727 /* If SCAN_START was an insn created by loop, we don't know its luid
728 as required by loop_reg_used_before_p. So skip such loops. (This
729 test may never be true, but it's best to play it safe.)
731 Also, skip loops where we do not start scanning at a label. This
732 test also rejects loops starting with a JUMP_INSN that failed the
735 if (INSN_UID (scan_start) >= max_uid_for_loop
736 || GET_CODE (scan_start) != CODE_LABEL)
738 if (loop_dump_stream)
739 fprintf (loop_dump_stream, "\nLoop from %d to %d is phony.\n\n",
740 INSN_UID (loop_start), INSN_UID (end));
744 /* Count number of times each reg is set during this loop.
745 Set VARRAY_CHAR (may_not_optimize, I) if it is not safe to move out
746 the setting of register I. Set VARRAY_RTX (reg_single_usage, I). */
748 /* Allocate extra space for REGS that might be created by
749 load_mems. We allocate a little extra slop as well, in the hopes
750 that even after the moving of movables creates some new registers
751 we won't have to reallocate these arrays. However, we do grow
752 the arrays, if necessary, in load_mems_recount_loop_regs_set. */
753 nregs = max_reg_num () + loop_mems_idx + 16;
754 VARRAY_INT_INIT (set_in_loop, nregs, "set_in_loop");
755 VARRAY_INT_INIT (n_times_set, nregs, "n_times_set");
756 VARRAY_CHAR_INIT (may_not_optimize, nregs, "may_not_optimize");
757 VARRAY_RTX_INIT (reg_single_usage, nregs, "reg_single_usage");
759 count_loop_regs_set (loop_top ? loop_top : loop_start, end,
760 may_not_optimize, reg_single_usage, &insn_count, nregs);
762 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
764 VARRAY_CHAR (may_not_optimize, i) = 1;
765 VARRAY_INT (set_in_loop, i) = 1;
768 #ifdef AVOID_CCMODE_COPIES
769 /* Don't try to move insns which set CC registers if we should not
770 create CCmode register copies. */
771 for (i = max_reg_num () - 1; i >= FIRST_PSEUDO_REGISTER; i--)
772 if (GET_MODE_CLASS (GET_MODE (regno_reg_rtx[i])) == MODE_CC)
773 VARRAY_CHAR (may_not_optimize, i) = 1;
776 bcopy ((char *) &set_in_loop->data,
777 (char *) &n_times_set->data, nregs * sizeof (int));
779 if (loop_dump_stream)
781 fprintf (loop_dump_stream, "\nLoop from %d to %d: %d real insns.\n",
782 INSN_UID (loop_start), INSN_UID (end), insn_count);
784 fprintf (loop_dump_stream, "Continue at insn %d.\n",
785 INSN_UID (loop_continue));
788 /* Scan through the loop finding insns that are safe to move.
789 Set set_in_loop negative for the reg being set, so that
790 this reg will be considered invariant for subsequent insns.
791 We consider whether subsequent insns use the reg
792 in deciding whether it is worth actually moving.
794 MAYBE_NEVER is nonzero if we have passed a conditional jump insn
795 and therefore it is possible that the insns we are scanning
796 would never be executed. At such times, we must make sure
797 that it is safe to execute the insn once instead of zero times.
798 When MAYBE_NEVER is 0, all insns will be executed at least once
799 so that is not a problem. */
801 for (p = next_insn_in_loop (scan_start, scan_start, end, loop_top);
803 p = next_insn_in_loop (p, scan_start, end, loop_top))
805 if (GET_RTX_CLASS (GET_CODE (p)) == 'i'
806 && find_reg_note (p, REG_LIBCALL, NULL_RTX))
808 else if (GET_RTX_CLASS (GET_CODE (p)) == 'i'
809 && find_reg_note (p, REG_RETVAL, NULL_RTX))
812 if (GET_CODE (p) == INSN
813 && (set = single_set (p))
814 && GET_CODE (SET_DEST (set)) == REG
815 && ! VARRAY_CHAR (may_not_optimize, REGNO (SET_DEST (set))))
820 rtx src = SET_SRC (set);
821 rtx dependencies = 0;
823 /* Figure out what to use as a source of this insn. If a REG_EQUIV
824 note is given or if a REG_EQUAL note with a constant operand is
825 specified, use it as the source and mark that we should move
826 this insn by calling emit_move_insn rather that duplicating the
829 Otherwise, only use the REG_EQUAL contents if a REG_RETVAL note
831 temp = find_reg_note (p, REG_EQUIV, NULL_RTX);
833 src = XEXP (temp, 0), move_insn = 1;
836 temp = find_reg_note (p, REG_EQUAL, NULL_RTX);
837 if (temp && CONSTANT_P (XEXP (temp, 0)))
838 src = XEXP (temp, 0), move_insn = 1;
839 if (temp && find_reg_note (p, REG_RETVAL, NULL_RTX))
841 src = XEXP (temp, 0);
842 /* A libcall block can use regs that don't appear in
843 the equivalent expression. To move the libcall,
844 we must move those regs too. */
845 dependencies = libcall_other_reg (p, src);
849 /* Don't try to optimize a register that was made
850 by loop-optimization for an inner loop.
851 We don't know its life-span, so we can't compute the benefit. */
852 if (REGNO (SET_DEST (set)) >= max_reg_before_loop)
854 else if (/* The register is used in basic blocks other
855 than the one where it is set (meaning that
856 something after this point in the loop might
857 depend on its value before the set). */
858 ! reg_in_basic_block_p (p, SET_DEST (set))
859 /* And the set is not guaranteed to be executed one
860 the loop starts, or the value before the set is
861 needed before the set occurs...
863 ??? Note we have quadratic behaviour here, mitigated
864 by the fact that the previous test will often fail for
865 large loops. Rather than re-scanning the entire loop
866 each time for register usage, we should build tables
867 of the register usage and use them here instead. */
869 || loop_reg_used_before_p (set, p, loop_start,
871 /* It is unsafe to move the set.
873 This code used to consider it OK to move a set of a variable
874 which was not created by the user and not used in an exit test.
875 That behavior is incorrect and was removed. */
877 else if ((tem = invariant_p (src))
878 && (dependencies == 0
879 || (tem2 = invariant_p (dependencies)) != 0)
880 && (VARRAY_INT (set_in_loop,
881 REGNO (SET_DEST (set))) == 1
883 = consec_sets_invariant_p
885 VARRAY_INT (set_in_loop, REGNO (SET_DEST (set))),
887 /* If the insn can cause a trap (such as divide by zero),
888 can't move it unless it's guaranteed to be executed
889 once loop is entered. Even a function call might
890 prevent the trap insn from being reached
891 (since it might exit!) */
892 && ! ((maybe_never || call_passed)
893 && may_trap_p (src)))
895 register struct movable *m;
896 register int regno = REGNO (SET_DEST (set));
898 /* A potential lossage is where we have a case where two insns
899 can be combined as long as they are both in the loop, but
900 we move one of them outside the loop. For large loops,
901 this can lose. The most common case of this is the address
902 of a function being called.
904 Therefore, if this register is marked as being used exactly
905 once if we are in a loop with calls (a "large loop"), see if
906 we can replace the usage of this register with the source
907 of this SET. If we can, delete this insn.
909 Don't do this if P has a REG_RETVAL note or if we have
910 SMALL_REGISTER_CLASSES and SET_SRC is a hard register. */
913 && VARRAY_RTX (reg_single_usage, regno) != 0
914 && VARRAY_RTX (reg_single_usage, regno) != const0_rtx
915 && REGNO_FIRST_UID (regno) == INSN_UID (p)
916 && (REGNO_LAST_UID (regno)
917 == INSN_UID (VARRAY_RTX (reg_single_usage, regno)))
918 && VARRAY_INT (set_in_loop, regno) == 1
919 && ! side_effects_p (SET_SRC (set))
920 && ! find_reg_note (p, REG_RETVAL, NULL_RTX)
921 && (! SMALL_REGISTER_CLASSES
922 || (! (GET_CODE (SET_SRC (set)) == REG
923 && REGNO (SET_SRC (set)) < FIRST_PSEUDO_REGISTER)))
924 /* This test is not redundant; SET_SRC (set) might be
925 a call-clobbered register and the life of REGNO
926 might span a call. */
927 && ! modified_between_p (SET_SRC (set), p,
929 (reg_single_usage, regno))
930 && no_labels_between_p (p, VARRAY_RTX (reg_single_usage, regno))
931 && validate_replace_rtx (SET_DEST (set), SET_SRC (set),
933 (reg_single_usage, regno)))
935 /* Replace any usage in a REG_EQUAL note. Must copy the
936 new source, so that we don't get rtx sharing between the
937 SET_SOURCE and REG_NOTES of insn p. */
938 REG_NOTES (VARRAY_RTX (reg_single_usage, regno))
939 = replace_rtx (REG_NOTES (VARRAY_RTX
940 (reg_single_usage, regno)),
941 SET_DEST (set), copy_rtx (SET_SRC (set)));
944 NOTE_LINE_NUMBER (p) = NOTE_INSN_DELETED;
945 NOTE_SOURCE_FILE (p) = 0;
946 VARRAY_INT (set_in_loop, regno) = 0;
950 m = (struct movable *) alloca (sizeof (struct movable));
954 m->dependencies = dependencies;
955 m->set_dest = SET_DEST (set);
957 m->consec = VARRAY_INT (set_in_loop,
958 REGNO (SET_DEST (set))) - 1;
962 m->move_insn = move_insn;
963 m->move_insn_first = 0;
964 m->is_equiv = (find_reg_note (p, REG_EQUIV, NULL_RTX) != 0);
965 m->savemode = VOIDmode;
967 /* Set M->cond if either invariant_p or consec_sets_invariant_p
968 returned 2 (only conditionally invariant). */
969 m->cond = ((tem | tem1 | tem2) > 1);
970 m->global = (uid_luid[REGNO_LAST_UID (regno)] > INSN_LUID (end)
971 || uid_luid[REGNO_FIRST_UID (regno)] < INSN_LUID (loop_start));
973 m->lifetime = (uid_luid[REGNO_LAST_UID (regno)]
974 - uid_luid[REGNO_FIRST_UID (regno)]);
975 m->savings = VARRAY_INT (n_times_set, regno);
976 if (find_reg_note (p, REG_RETVAL, NULL_RTX))
977 m->savings += libcall_benefit (p);
978 VARRAY_INT (set_in_loop, regno) = move_insn ? -2 : -1;
979 /* Add M to the end of the chain MOVABLES. */
983 last_movable->next = m;
988 /* It is possible for the first instruction to have a
989 REG_EQUAL note but a non-invariant SET_SRC, so we must
990 remember the status of the first instruction in case
991 the last instruction doesn't have a REG_EQUAL note. */
992 m->move_insn_first = m->move_insn;
994 /* Skip this insn, not checking REG_LIBCALL notes. */
995 p = next_nonnote_insn (p);
996 /* Skip the consecutive insns, if there are any. */
997 p = skip_consec_insns (p, m->consec);
998 /* Back up to the last insn of the consecutive group. */
999 p = prev_nonnote_insn (p);
1001 /* We must now reset m->move_insn, m->is_equiv, and possibly
1002 m->set_src to correspond to the effects of all the
1004 temp = find_reg_note (p, REG_EQUIV, NULL_RTX);
1006 m->set_src = XEXP (temp, 0), m->move_insn = 1;
1009 temp = find_reg_note (p, REG_EQUAL, NULL_RTX);
1010 if (temp && CONSTANT_P (XEXP (temp, 0)))
1011 m->set_src = XEXP (temp, 0), m->move_insn = 1;
1016 m->is_equiv = (find_reg_note (p, REG_EQUIV, NULL_RTX) != 0);
1019 /* If this register is always set within a STRICT_LOW_PART
1020 or set to zero, then its high bytes are constant.
1021 So clear them outside the loop and within the loop
1022 just load the low bytes.
1023 We must check that the machine has an instruction to do so.
1024 Also, if the value loaded into the register
1025 depends on the same register, this cannot be done. */
1026 else if (SET_SRC (set) == const0_rtx
1027 && GET_CODE (NEXT_INSN (p)) == INSN
1028 && (set1 = single_set (NEXT_INSN (p)))
1029 && GET_CODE (set1) == SET
1030 && (GET_CODE (SET_DEST (set1)) == STRICT_LOW_PART)
1031 && (GET_CODE (XEXP (SET_DEST (set1), 0)) == SUBREG)
1032 && (SUBREG_REG (XEXP (SET_DEST (set1), 0))
1034 && !reg_mentioned_p (SET_DEST (set), SET_SRC (set1)))
1036 register int regno = REGNO (SET_DEST (set));
1037 if (VARRAY_INT (set_in_loop, regno) == 2)
1039 register struct movable *m;
1040 m = (struct movable *) alloca (sizeof (struct movable));
1043 m->set_dest = SET_DEST (set);
1044 m->dependencies = 0;
1050 m->move_insn_first = 0;
1052 /* If the insn may not be executed on some cycles,
1053 we can't clear the whole reg; clear just high part.
1054 Not even if the reg is used only within this loop.
1061 Clearing x before the inner loop could clobber a value
1062 being saved from the last time around the outer loop.
1063 However, if the reg is not used outside this loop
1064 and all uses of the register are in the same
1065 basic block as the store, there is no problem.
1067 If this insn was made by loop, we don't know its
1068 INSN_LUID and hence must make a conservative
1070 m->global = (INSN_UID (p) >= max_uid_for_loop
1071 || (uid_luid[REGNO_LAST_UID (regno)]
1073 || (uid_luid[REGNO_FIRST_UID (regno)]
1075 || (labels_in_range_p
1076 (p, uid_luid[REGNO_FIRST_UID (regno)])));
1077 if (maybe_never && m->global)
1078 m->savemode = GET_MODE (SET_SRC (set1));
1080 m->savemode = VOIDmode;
1084 m->lifetime = (uid_luid[REGNO_LAST_UID (regno)]
1085 - uid_luid[REGNO_FIRST_UID (regno)]);
1087 VARRAY_INT (set_in_loop, regno) = -1;
1088 /* Add M to the end of the chain MOVABLES. */
1092 last_movable->next = m;
1097 /* Past a call insn, we get to insns which might not be executed
1098 because the call might exit. This matters for insns that trap.
1099 Call insns inside a REG_LIBCALL/REG_RETVAL block always return,
1100 so they don't count. */
1101 else if (GET_CODE (p) == CALL_INSN && ! in_libcall)
1103 /* Past a label or a jump, we get to insns for which we
1104 can't count on whether or how many times they will be
1105 executed during each iteration. Therefore, we can
1106 only move out sets of trivial variables
1107 (those not used after the loop). */
1108 /* Similar code appears twice in strength_reduce. */
1109 else if ((GET_CODE (p) == CODE_LABEL || GET_CODE (p) == JUMP_INSN)
1110 /* If we enter the loop in the middle, and scan around to the
1111 beginning, don't set maybe_never for that. This must be an
1112 unconditional jump, otherwise the code at the top of the
1113 loop might never be executed. Unconditional jumps are
1114 followed a by barrier then loop end. */
1115 && ! (GET_CODE (p) == JUMP_INSN && JUMP_LABEL (p) == loop_top
1116 && NEXT_INSN (NEXT_INSN (p)) == end
1117 && simplejump_p (p)))
1119 else if (GET_CODE (p) == NOTE)
1121 /* At the virtual top of a converted loop, insns are again known to
1122 be executed: logically, the loop begins here even though the exit
1123 code has been duplicated. */
1124 if (NOTE_LINE_NUMBER (p) == NOTE_INSN_LOOP_VTOP && loop_depth == 0)
1125 maybe_never = call_passed = 0;
1126 else if (NOTE_LINE_NUMBER (p) == NOTE_INSN_LOOP_BEG)
1128 else if (NOTE_LINE_NUMBER (p) == NOTE_INSN_LOOP_END)
1133 /* If one movable subsumes another, ignore that other. */
1135 ignore_some_movables (movables);
1137 /* For each movable insn, see if the reg that it loads
1138 leads when it dies right into another conditionally movable insn.
1139 If so, record that the second insn "forces" the first one,
1140 since the second can be moved only if the first is. */
1142 force_movables (movables);
1144 /* See if there are multiple movable insns that load the same value.
1145 If there are, make all but the first point at the first one
1146 through the `match' field, and add the priorities of them
1147 all together as the priority of the first. */
1149 combine_movables (movables, nregs);
1151 /* Now consider each movable insn to decide whether it is worth moving.
1152 Store 0 in set_in_loop for each reg that is moved.
1154 Generally this increases code size, so do not move moveables when
1155 optimizing for code size. */
1157 if (! optimize_size)
1158 move_movables (movables, threshold,
1159 insn_count, loop_start, end, nregs);
1161 /* Now candidates that still are negative are those not moved.
1162 Change set_in_loop to indicate that those are not actually invariant. */
1163 for (i = 0; i < nregs; i++)
1164 if (VARRAY_INT (set_in_loop, i) < 0)
1165 VARRAY_INT (set_in_loop, i) = VARRAY_INT (n_times_set, i);
1167 /* Now that we've moved some things out of the loop, we might be able to
1168 hoist even more memory references. */
1169 load_mems_and_recount_loop_regs_set (scan_start, end, loop_top,
1170 loop_start, &insn_count);
1172 if (flag_strength_reduce)
1174 the_movables = movables;
1175 strength_reduce (scan_start, end, loop_top,
1176 insn_count, loop_start, end, loop_cont, unroll_p, bct_p);
1179 VARRAY_FREE (reg_single_usage);
1180 VARRAY_FREE (set_in_loop);
1181 VARRAY_FREE (n_times_set);
1182 VARRAY_FREE (may_not_optimize);
1185 /* Add elements to *OUTPUT to record all the pseudo-regs
1186 mentioned in IN_THIS but not mentioned in NOT_IN_THIS. */
1189 record_excess_regs (in_this, not_in_this, output)
1190 rtx in_this, not_in_this;
1197 code = GET_CODE (in_this);
1211 if (REGNO (in_this) >= FIRST_PSEUDO_REGISTER
1212 && ! reg_mentioned_p (in_this, not_in_this))
1213 *output = gen_rtx_EXPR_LIST (VOIDmode, in_this, *output);
1220 fmt = GET_RTX_FORMAT (code);
1221 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
1228 for (j = 0; j < XVECLEN (in_this, i); j++)
1229 record_excess_regs (XVECEXP (in_this, i, j), not_in_this, output);
1233 record_excess_regs (XEXP (in_this, i), not_in_this, output);
1239 /* Check what regs are referred to in the libcall block ending with INSN,
1240 aside from those mentioned in the equivalent value.
1241 If there are none, return 0.
1242 If there are one or more, return an EXPR_LIST containing all of them. */
1245 libcall_other_reg (insn, equiv)
1248 rtx note = find_reg_note (insn, REG_RETVAL, NULL_RTX);
1249 rtx p = XEXP (note, 0);
1252 /* First, find all the regs used in the libcall block
1253 that are not mentioned as inputs to the result. */
1257 if (GET_CODE (p) == INSN || GET_CODE (p) == JUMP_INSN
1258 || GET_CODE (p) == CALL_INSN)
1259 record_excess_regs (PATTERN (p), equiv, &output);
1266 /* Return 1 if all uses of REG
1267 are between INSN and the end of the basic block. */
1270 reg_in_basic_block_p (insn, reg)
1273 int regno = REGNO (reg);
1276 if (REGNO_FIRST_UID (regno) != INSN_UID (insn))
1279 /* Search this basic block for the already recorded last use of the reg. */
1280 for (p = insn; p; p = NEXT_INSN (p))
1282 switch (GET_CODE (p))
1289 /* Ordinary insn: if this is the last use, we win. */
1290 if (REGNO_LAST_UID (regno) == INSN_UID (p))
1295 /* Jump insn: if this is the last use, we win. */
1296 if (REGNO_LAST_UID (regno) == INSN_UID (p))
1298 /* Otherwise, it's the end of the basic block, so we lose. */
1303 /* It's the end of the basic block, so we lose. */
1311 /* The "last use" doesn't follow the "first use"?? */
1315 /* Compute the benefit of eliminating the insns in the block whose
1316 last insn is LAST. This may be a group of insns used to compute a
1317 value directly or can contain a library call. */
1320 libcall_benefit (last)
1326 for (insn = XEXP (find_reg_note (last, REG_RETVAL, NULL_RTX), 0);
1327 insn != last; insn = NEXT_INSN (insn))
1329 if (GET_CODE (insn) == CALL_INSN)
1330 benefit += 10; /* Assume at least this many insns in a library
1332 else if (GET_CODE (insn) == INSN
1333 && GET_CODE (PATTERN (insn)) != USE
1334 && GET_CODE (PATTERN (insn)) != CLOBBER)
1341 /* Skip COUNT insns from INSN, counting library calls as 1 insn. */
1344 skip_consec_insns (insn, count)
1348 for (; count > 0; count--)
1352 /* If first insn of libcall sequence, skip to end. */
1353 /* Do this at start of loop, since INSN is guaranteed to
1355 if (GET_CODE (insn) != NOTE
1356 && (temp = find_reg_note (insn, REG_LIBCALL, NULL_RTX)))
1357 insn = XEXP (temp, 0);
1359 do insn = NEXT_INSN (insn);
1360 while (GET_CODE (insn) == NOTE);
1366 /* Ignore any movable whose insn falls within a libcall
1367 which is part of another movable.
1368 We make use of the fact that the movable for the libcall value
1369 was made later and so appears later on the chain. */
1372 ignore_some_movables (movables)
1373 struct movable *movables;
1375 register struct movable *m, *m1;
1377 for (m = movables; m; m = m->next)
1379 /* Is this a movable for the value of a libcall? */
1380 rtx note = find_reg_note (m->insn, REG_RETVAL, NULL_RTX);
1384 /* Check for earlier movables inside that range,
1385 and mark them invalid. We cannot use LUIDs here because
1386 insns created by loop.c for prior loops don't have LUIDs.
1387 Rather than reject all such insns from movables, we just
1388 explicitly check each insn in the libcall (since invariant
1389 libcalls aren't that common). */
1390 for (insn = XEXP (note, 0); insn != m->insn; insn = NEXT_INSN (insn))
1391 for (m1 = movables; m1 != m; m1 = m1->next)
1392 if (m1->insn == insn)
1398 /* For each movable insn, see if the reg that it loads
1399 leads when it dies right into another conditionally movable insn.
1400 If so, record that the second insn "forces" the first one,
1401 since the second can be moved only if the first is. */
1404 force_movables (movables)
1405 struct movable *movables;
1407 register struct movable *m, *m1;
1408 for (m1 = movables; m1; m1 = m1->next)
1409 /* Omit this if moving just the (SET (REG) 0) of a zero-extend. */
1410 if (!m1->partial && !m1->done)
1412 int regno = m1->regno;
1413 for (m = m1->next; m; m = m->next)
1414 /* ??? Could this be a bug? What if CSE caused the
1415 register of M1 to be used after this insn?
1416 Since CSE does not update regno_last_uid,
1417 this insn M->insn might not be where it dies.
1418 But very likely this doesn't matter; what matters is
1419 that M's reg is computed from M1's reg. */
1420 if (INSN_UID (m->insn) == REGNO_LAST_UID (regno)
1423 if (m != 0 && m->set_src == m1->set_dest
1424 /* If m->consec, m->set_src isn't valid. */
1428 /* Increase the priority of the moving the first insn
1429 since it permits the second to be moved as well. */
1433 m1->lifetime += m->lifetime;
1434 m1->savings += m->savings;
1439 /* Find invariant expressions that are equal and can be combined into
1443 combine_movables (movables, nregs)
1444 struct movable *movables;
1447 register struct movable *m;
1448 char *matched_regs = (char *) alloca (nregs);
1449 enum machine_mode mode;
1451 /* Regs that are set more than once are not allowed to match
1452 or be matched. I'm no longer sure why not. */
1453 /* Perhaps testing m->consec_sets would be more appropriate here? */
1455 for (m = movables; m; m = m->next)
1456 if (m->match == 0 && VARRAY_INT (n_times_set, m->regno) == 1 && !m->partial)
1458 register struct movable *m1;
1459 int regno = m->regno;
1461 bzero (matched_regs, nregs);
1462 matched_regs[regno] = 1;
1464 /* We want later insns to match the first one. Don't make the first
1465 one match any later ones. So start this loop at m->next. */
1466 for (m1 = m->next; m1; m1 = m1->next)
1467 if (m != m1 && m1->match == 0 && VARRAY_INT (n_times_set, m1->regno) == 1
1468 /* A reg used outside the loop mustn't be eliminated. */
1470 /* A reg used for zero-extending mustn't be eliminated. */
1472 && (matched_regs[m1->regno]
1475 /* Can combine regs with different modes loaded from the
1476 same constant only if the modes are the same or
1477 if both are integer modes with M wider or the same
1478 width as M1. The check for integer is redundant, but
1479 safe, since the only case of differing destination
1480 modes with equal sources is when both sources are
1481 VOIDmode, i.e., CONST_INT. */
1482 (GET_MODE (m->set_dest) == GET_MODE (m1->set_dest)
1483 || (GET_MODE_CLASS (GET_MODE (m->set_dest)) == MODE_INT
1484 && GET_MODE_CLASS (GET_MODE (m1->set_dest)) == MODE_INT
1485 && (GET_MODE_BITSIZE (GET_MODE (m->set_dest))
1486 >= GET_MODE_BITSIZE (GET_MODE (m1->set_dest)))))
1487 /* See if the source of M1 says it matches M. */
1488 && ((GET_CODE (m1->set_src) == REG
1489 && matched_regs[REGNO (m1->set_src)])
1490 || rtx_equal_for_loop_p (m->set_src, m1->set_src,
1492 && ((m->dependencies == m1->dependencies)
1493 || rtx_equal_p (m->dependencies, m1->dependencies)))
1495 m->lifetime += m1->lifetime;
1496 m->savings += m1->savings;
1499 matched_regs[m1->regno] = 1;
1503 /* Now combine the regs used for zero-extension.
1504 This can be done for those not marked `global'
1505 provided their lives don't overlap. */
1507 for (mode = GET_CLASS_NARROWEST_MODE (MODE_INT); mode != VOIDmode;
1508 mode = GET_MODE_WIDER_MODE (mode))
1510 register struct movable *m0 = 0;
1512 /* Combine all the registers for extension from mode MODE.
1513 Don't combine any that are used outside this loop. */
1514 for (m = movables; m; m = m->next)
1515 if (m->partial && ! m->global
1516 && mode == GET_MODE (SET_SRC (PATTERN (NEXT_INSN (m->insn)))))
1518 register struct movable *m1;
1519 int first = uid_luid[REGNO_FIRST_UID (m->regno)];
1520 int last = uid_luid[REGNO_LAST_UID (m->regno)];
1524 /* First one: don't check for overlap, just record it. */
1529 /* Make sure they extend to the same mode.
1530 (Almost always true.) */
1531 if (GET_MODE (m->set_dest) != GET_MODE (m0->set_dest))
1534 /* We already have one: check for overlap with those
1535 already combined together. */
1536 for (m1 = movables; m1 != m; m1 = m1->next)
1537 if (m1 == m0 || (m1->partial && m1->match == m0))
1538 if (! (uid_luid[REGNO_FIRST_UID (m1->regno)] > last
1539 || uid_luid[REGNO_LAST_UID (m1->regno)] < first))
1542 /* No overlap: we can combine this with the others. */
1543 m0->lifetime += m->lifetime;
1544 m0->savings += m->savings;
1553 /* Return 1 if regs X and Y will become the same if moved. */
1556 regs_match_p (x, y, movables)
1558 struct movable *movables;
1562 struct movable *mx, *my;
1564 for (mx = movables; mx; mx = mx->next)
1565 if (mx->regno == xn)
1568 for (my = movables; my; my = my->next)
1569 if (my->regno == yn)
1573 && ((mx->match == my->match && mx->match != 0)
1575 || mx == my->match));
1578 /* Return 1 if X and Y are identical-looking rtx's.
1579 This is the Lisp function EQUAL for rtx arguments.
1581 If two registers are matching movables or a movable register and an
1582 equivalent constant, consider them equal. */
1585 rtx_equal_for_loop_p (x, y, movables)
1587 struct movable *movables;
1591 register struct movable *m;
1592 register enum rtx_code code;
1597 if (x == 0 || y == 0)
1600 code = GET_CODE (x);
1602 /* If we have a register and a constant, they may sometimes be
1604 if (GET_CODE (x) == REG && VARRAY_INT (set_in_loop, REGNO (x)) == -2
1607 for (m = movables; m; m = m->next)
1608 if (m->move_insn && m->regno == REGNO (x)
1609 && rtx_equal_p (m->set_src, y))
1612 else if (GET_CODE (y) == REG && VARRAY_INT (set_in_loop, REGNO (y)) == -2
1615 for (m = movables; m; m = m->next)
1616 if (m->move_insn && m->regno == REGNO (y)
1617 && rtx_equal_p (m->set_src, x))
1621 /* Otherwise, rtx's of different codes cannot be equal. */
1622 if (code != GET_CODE (y))
1625 /* (MULT:SI x y) and (MULT:HI x y) are NOT equivalent.
1626 (REG:SI x) and (REG:HI x) are NOT equivalent. */
1628 if (GET_MODE (x) != GET_MODE (y))
1631 /* These three types of rtx's can be compared nonrecursively. */
1633 return (REGNO (x) == REGNO (y) || regs_match_p (x, y, movables));
1635 if (code == LABEL_REF)
1636 return XEXP (x, 0) == XEXP (y, 0);
1637 if (code == SYMBOL_REF)
1638 return XSTR (x, 0) == XSTR (y, 0);
1640 /* Compare the elements. If any pair of corresponding elements
1641 fail to match, return 0 for the whole things. */
1643 fmt = GET_RTX_FORMAT (code);
1644 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
1649 if (XWINT (x, i) != XWINT (y, i))
1654 if (XINT (x, i) != XINT (y, i))
1659 /* Two vectors must have the same length. */
1660 if (XVECLEN (x, i) != XVECLEN (y, i))
1663 /* And the corresponding elements must match. */
1664 for (j = 0; j < XVECLEN (x, i); j++)
1665 if (rtx_equal_for_loop_p (XVECEXP (x, i, j), XVECEXP (y, i, j), movables) == 0)
1670 if (rtx_equal_for_loop_p (XEXP (x, i), XEXP (y, i), movables) == 0)
1675 if (strcmp (XSTR (x, i), XSTR (y, i)))
1680 /* These are just backpointers, so they don't matter. */
1686 /* It is believed that rtx's at this level will never
1687 contain anything but integers and other rtx's,
1688 except for within LABEL_REFs and SYMBOL_REFs. */
1696 /* If X contains any LABEL_REF's, add REG_LABEL notes for them to all
1697 insns in INSNS which use thet reference. */
1700 add_label_notes (x, insns)
1704 enum rtx_code code = GET_CODE (x);
1709 if (code == LABEL_REF && !LABEL_REF_NONLOCAL_P (x))
1711 /* This code used to ignore labels that referred to dispatch tables to
1712 avoid flow generating (slighly) worse code.
1714 We no longer ignore such label references (see LABEL_REF handling in
1715 mark_jump_label for additional information). */
1716 for (insn = insns; insn; insn = NEXT_INSN (insn))
1717 if (reg_mentioned_p (XEXP (x, 0), insn))
1718 REG_NOTES (insn) = gen_rtx_EXPR_LIST (REG_LABEL, XEXP (x, 0),
1722 fmt = GET_RTX_FORMAT (code);
1723 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
1726 add_label_notes (XEXP (x, i), insns);
1727 else if (fmt[i] == 'E')
1728 for (j = XVECLEN (x, i) - 1; j >= 0; j--)
1729 add_label_notes (XVECEXP (x, i, j), insns);
1733 /* Scan MOVABLES, and move the insns that deserve to be moved.
1734 If two matching movables are combined, replace one reg with the
1735 other throughout. */
1738 move_movables (movables, threshold, insn_count, loop_start, end, nregs)
1739 struct movable *movables;
1747 register struct movable *m;
1749 /* Map of pseudo-register replacements to handle combining
1750 when we move several insns that load the same value
1751 into different pseudo-registers. */
1752 rtx *reg_map = (rtx *) alloca (nregs * sizeof (rtx));
1753 char *already_moved = (char *) alloca (nregs);
1755 bzero (already_moved, nregs);
1756 bzero ((char *) reg_map, nregs * sizeof (rtx));
1760 for (m = movables; m; m = m->next)
1762 /* Describe this movable insn. */
1764 if (loop_dump_stream)
1766 fprintf (loop_dump_stream, "Insn %d: regno %d (life %d), ",
1767 INSN_UID (m->insn), m->regno, m->lifetime);
1769 fprintf (loop_dump_stream, "consec %d, ", m->consec);
1771 fprintf (loop_dump_stream, "cond ");
1773 fprintf (loop_dump_stream, "force ");
1775 fprintf (loop_dump_stream, "global ");
1777 fprintf (loop_dump_stream, "done ");
1779 fprintf (loop_dump_stream, "move-insn ");
1781 fprintf (loop_dump_stream, "matches %d ",
1782 INSN_UID (m->match->insn));
1784 fprintf (loop_dump_stream, "forces %d ",
1785 INSN_UID (m->forces->insn));
1788 /* Count movables. Value used in heuristics in strength_reduce. */
1791 /* Ignore the insn if it's already done (it matched something else).
1792 Otherwise, see if it is now safe to move. */
1796 || (1 == invariant_p (m->set_src)
1797 && (m->dependencies == 0
1798 || 1 == invariant_p (m->dependencies))
1800 || 1 == consec_sets_invariant_p (m->set_dest,
1803 && (! m->forces || m->forces->done))
1807 int savings = m->savings;
1809 /* We have an insn that is safe to move.
1810 Compute its desirability. */
1815 if (loop_dump_stream)
1816 fprintf (loop_dump_stream, "savings %d ", savings);
1818 if (moved_once[regno] && loop_dump_stream)
1819 fprintf (loop_dump_stream, "halved since already moved ");
1821 /* An insn MUST be moved if we already moved something else
1822 which is safe only if this one is moved too: that is,
1823 if already_moved[REGNO] is nonzero. */
1825 /* An insn is desirable to move if the new lifetime of the
1826 register is no more than THRESHOLD times the old lifetime.
1827 If it's not desirable, it means the loop is so big
1828 that moving won't speed things up much,
1829 and it is liable to make register usage worse. */
1831 /* It is also desirable to move if it can be moved at no
1832 extra cost because something else was already moved. */
1834 if (already_moved[regno]
1835 || flag_move_all_movables
1836 || (threshold * savings * m->lifetime) >=
1837 (moved_once[regno] ? insn_count * 2 : insn_count)
1838 || (m->forces && m->forces->done
1839 && VARRAY_INT (n_times_set, m->forces->regno) == 1))
1842 register struct movable *m1;
1845 /* Now move the insns that set the reg. */
1847 if (m->partial && m->match)
1851 /* Find the end of this chain of matching regs.
1852 Thus, we load each reg in the chain from that one reg.
1853 And that reg is loaded with 0 directly,
1854 since it has ->match == 0. */
1855 for (m1 = m; m1->match; m1 = m1->match);
1856 newpat = gen_move_insn (SET_DEST (PATTERN (m->insn)),
1857 SET_DEST (PATTERN (m1->insn)));
1858 i1 = emit_insn_before (newpat, loop_start);
1860 /* Mark the moved, invariant reg as being allowed to
1861 share a hard reg with the other matching invariant. */
1862 REG_NOTES (i1) = REG_NOTES (m->insn);
1863 r1 = SET_DEST (PATTERN (m->insn));
1864 r2 = SET_DEST (PATTERN (m1->insn));
1866 = gen_rtx_EXPR_LIST (VOIDmode, r1,
1867 gen_rtx_EXPR_LIST (VOIDmode, r2,
1869 delete_insn (m->insn);
1874 if (loop_dump_stream)
1875 fprintf (loop_dump_stream, " moved to %d", INSN_UID (i1));
1877 /* If we are to re-generate the item being moved with a
1878 new move insn, first delete what we have and then emit
1879 the move insn before the loop. */
1880 else if (m->move_insn)
1884 for (count = m->consec; count >= 0; count--)
1886 /* If this is the first insn of a library call sequence,
1888 if (GET_CODE (p) != NOTE
1889 && (temp = find_reg_note (p, REG_LIBCALL, NULL_RTX)))
1892 /* If this is the last insn of a libcall sequence, then
1893 delete every insn in the sequence except the last.
1894 The last insn is handled in the normal manner. */
1895 if (GET_CODE (p) != NOTE
1896 && (temp = find_reg_note (p, REG_RETVAL, NULL_RTX)))
1898 temp = XEXP (temp, 0);
1900 temp = delete_insn (temp);
1904 p = delete_insn (p);
1906 /* simplify_giv_expr expects that it can walk the insns
1907 at m->insn forwards and see this old sequence we are
1908 tossing here. delete_insn does preserve the next
1909 pointers, but when we skip over a NOTE we must fix
1910 it up. Otherwise that code walks into the non-deleted
1912 while (p && GET_CODE (p) == NOTE)
1913 p = NEXT_INSN (temp) = NEXT_INSN (p);
1917 emit_move_insn (m->set_dest, m->set_src);
1918 temp = get_insns ();
1921 add_label_notes (m->set_src, temp);
1923 i1 = emit_insns_before (temp, loop_start);
1924 if (! find_reg_note (i1, REG_EQUAL, NULL_RTX))
1926 = gen_rtx_EXPR_LIST (m->is_equiv ? REG_EQUIV : REG_EQUAL,
1927 m->set_src, REG_NOTES (i1));
1929 if (loop_dump_stream)
1930 fprintf (loop_dump_stream, " moved to %d", INSN_UID (i1));
1932 /* The more regs we move, the less we like moving them. */
1937 for (count = m->consec; count >= 0; count--)
1941 /* If first insn of libcall sequence, skip to end. */
1942 /* Do this at start of loop, since p is guaranteed to
1944 if (GET_CODE (p) != NOTE
1945 && (temp = find_reg_note (p, REG_LIBCALL, NULL_RTX)))
1948 /* If last insn of libcall sequence, move all
1949 insns except the last before the loop. The last
1950 insn is handled in the normal manner. */
1951 if (GET_CODE (p) != NOTE
1952 && (temp = find_reg_note (p, REG_RETVAL, NULL_RTX)))
1956 rtx fn_address_insn = 0;
1959 for (temp = XEXP (temp, 0); temp != p;
1960 temp = NEXT_INSN (temp))
1966 if (GET_CODE (temp) == NOTE)
1969 body = PATTERN (temp);
1971 /* Find the next insn after TEMP,
1972 not counting USE or NOTE insns. */
1973 for (next = NEXT_INSN (temp); next != p;
1974 next = NEXT_INSN (next))
1975 if (! (GET_CODE (next) == INSN
1976 && GET_CODE (PATTERN (next)) == USE)
1977 && GET_CODE (next) != NOTE)
1980 /* If that is the call, this may be the insn
1981 that loads the function address.
1983 Extract the function address from the insn
1984 that loads it into a register.
1985 If this insn was cse'd, we get incorrect code.
1987 So emit a new move insn that copies the
1988 function address into the register that the
1989 call insn will use. flow.c will delete any
1990 redundant stores that we have created. */
1991 if (GET_CODE (next) == CALL_INSN
1992 && GET_CODE (body) == SET
1993 && GET_CODE (SET_DEST (body)) == REG
1994 && (n = find_reg_note (temp, REG_EQUAL,
1997 fn_reg = SET_SRC (body);
1998 if (GET_CODE (fn_reg) != REG)
1999 fn_reg = SET_DEST (body);
2000 fn_address = XEXP (n, 0);
2001 fn_address_insn = temp;
2003 /* We have the call insn.
2004 If it uses the register we suspect it might,
2005 load it with the correct address directly. */
2006 if (GET_CODE (temp) == CALL_INSN
2008 && reg_referenced_p (fn_reg, body))
2009 emit_insn_after (gen_move_insn (fn_reg,
2013 if (GET_CODE (temp) == CALL_INSN)
2015 i1 = emit_call_insn_before (body, loop_start);
2016 /* Because the USAGE information potentially
2017 contains objects other than hard registers
2018 we need to copy it. */
2019 if (CALL_INSN_FUNCTION_USAGE (temp))
2020 CALL_INSN_FUNCTION_USAGE (i1)
2021 = copy_rtx (CALL_INSN_FUNCTION_USAGE (temp));
2024 i1 = emit_insn_before (body, loop_start);
2027 if (temp == fn_address_insn)
2028 fn_address_insn = i1;
2029 REG_NOTES (i1) = REG_NOTES (temp);
2035 if (m->savemode != VOIDmode)
2037 /* P sets REG to zero; but we should clear only
2038 the bits that are not covered by the mode
2040 rtx reg = m->set_dest;
2046 (GET_MODE (reg), and_optab, reg,
2047 GEN_INT ((((HOST_WIDE_INT) 1
2048 << GET_MODE_BITSIZE (m->savemode)))
2050 reg, 1, OPTAB_LIB_WIDEN);
2054 emit_move_insn (reg, tem);
2055 sequence = gen_sequence ();
2057 i1 = emit_insn_before (sequence, loop_start);
2059 else if (GET_CODE (p) == CALL_INSN)
2061 i1 = emit_call_insn_before (PATTERN (p), loop_start);
2062 /* Because the USAGE information potentially
2063 contains objects other than hard registers
2064 we need to copy it. */
2065 if (CALL_INSN_FUNCTION_USAGE (p))
2066 CALL_INSN_FUNCTION_USAGE (i1)
2067 = copy_rtx (CALL_INSN_FUNCTION_USAGE (p));
2069 else if (count == m->consec && m->move_insn_first)
2071 /* The SET_SRC might not be invariant, so we must
2072 use the REG_EQUAL note. */
2074 emit_move_insn (m->set_dest, m->set_src);
2075 temp = get_insns ();
2078 add_label_notes (m->set_src, temp);
2080 i1 = emit_insns_before (temp, loop_start);
2081 if (! find_reg_note (i1, REG_EQUAL, NULL_RTX))
2083 = gen_rtx_EXPR_LIST ((m->is_equiv ? REG_EQUIV
2085 m->set_src, REG_NOTES (i1));
2088 i1 = emit_insn_before (PATTERN (p), loop_start);
2090 if (REG_NOTES (i1) == 0)
2092 REG_NOTES (i1) = REG_NOTES (p);
2094 /* If there is a REG_EQUAL note present whose value
2095 is not loop invariant, then delete it, since it
2096 may cause problems with later optimization passes.
2097 It is possible for cse to create such notes
2098 like this as a result of record_jump_cond. */
2100 if ((temp = find_reg_note (i1, REG_EQUAL, NULL_RTX))
2101 && ! invariant_p (XEXP (temp, 0)))
2102 remove_note (i1, temp);
2108 if (loop_dump_stream)
2109 fprintf (loop_dump_stream, " moved to %d",
2112 /* If library call, now fix the REG_NOTES that contain
2113 insn pointers, namely REG_LIBCALL on FIRST
2114 and REG_RETVAL on I1. */
2115 if ((temp = find_reg_note (i1, REG_RETVAL, NULL_RTX)))
2117 XEXP (temp, 0) = first;
2118 temp = find_reg_note (first, REG_LIBCALL, NULL_RTX);
2119 XEXP (temp, 0) = i1;
2126 /* simplify_giv_expr expects that it can walk the insns
2127 at m->insn forwards and see this old sequence we are
2128 tossing here. delete_insn does preserve the next
2129 pointers, but when we skip over a NOTE we must fix
2130 it up. Otherwise that code walks into the non-deleted
2132 while (p && GET_CODE (p) == NOTE)
2133 p = NEXT_INSN (temp) = NEXT_INSN (p);
2136 /* The more regs we move, the less we like moving them. */
2140 /* Any other movable that loads the same register
2142 already_moved[regno] = 1;
2144 /* This reg has been moved out of one loop. */
2145 moved_once[regno] = 1;
2147 /* The reg set here is now invariant. */
2149 VARRAY_INT (set_in_loop, regno) = 0;
2153 /* Change the length-of-life info for the register
2154 to say it lives at least the full length of this loop.
2155 This will help guide optimizations in outer loops. */
2157 if (uid_luid[REGNO_FIRST_UID (regno)] > INSN_LUID (loop_start))
2158 /* This is the old insn before all the moved insns.
2159 We can't use the moved insn because it is out of range
2160 in uid_luid. Only the old insns have luids. */
2161 REGNO_FIRST_UID (regno) = INSN_UID (loop_start);
2162 if (uid_luid[REGNO_LAST_UID (regno)] < INSN_LUID (end))
2163 REGNO_LAST_UID (regno) = INSN_UID (end);
2165 /* Combine with this moved insn any other matching movables. */
2168 for (m1 = movables; m1; m1 = m1->next)
2173 /* Schedule the reg loaded by M1
2174 for replacement so that shares the reg of M.
2175 If the modes differ (only possible in restricted
2176 circumstances, make a SUBREG. */
2177 if (GET_MODE (m->set_dest) == GET_MODE (m1->set_dest))
2178 reg_map[m1->regno] = m->set_dest;
2181 = gen_lowpart_common (GET_MODE (m1->set_dest),
2184 /* Get rid of the matching insn
2185 and prevent further processing of it. */
2188 /* if library call, delete all insn except last, which
2190 if ((temp = find_reg_note (m1->insn, REG_RETVAL,
2193 for (temp = XEXP (temp, 0); temp != m1->insn;
2194 temp = NEXT_INSN (temp))
2197 delete_insn (m1->insn);
2199 /* Any other movable that loads the same register
2201 already_moved[m1->regno] = 1;
2203 /* The reg merged here is now invariant,
2204 if the reg it matches is invariant. */
2206 VARRAY_INT (set_in_loop, m1->regno) = 0;
2209 else if (loop_dump_stream)
2210 fprintf (loop_dump_stream, "not desirable");
2212 else if (loop_dump_stream && !m->match)
2213 fprintf (loop_dump_stream, "not safe");
2215 if (loop_dump_stream)
2216 fprintf (loop_dump_stream, "\n");
2220 new_start = loop_start;
2222 /* Go through all the instructions in the loop, making
2223 all the register substitutions scheduled in REG_MAP. */
2224 for (p = new_start; p != end; p = NEXT_INSN (p))
2225 if (GET_CODE (p) == INSN || GET_CODE (p) == JUMP_INSN
2226 || GET_CODE (p) == CALL_INSN)
2228 replace_regs (PATTERN (p), reg_map, nregs, 0);
2229 replace_regs (REG_NOTES (p), reg_map, nregs, 0);
2235 /* Scan X and replace the address of any MEM in it with ADDR.
2236 REG is the address that MEM should have before the replacement. */
2239 replace_call_address (x, reg, addr)
2242 register enum rtx_code code;
2248 code = GET_CODE (x);
2262 /* Short cut for very common case. */
2263 replace_call_address (XEXP (x, 1), reg, addr);
2267 /* Short cut for very common case. */
2268 replace_call_address (XEXP (x, 0), reg, addr);
2272 /* If this MEM uses a reg other than the one we expected,
2273 something is wrong. */
2274 if (XEXP (x, 0) != reg)
2283 fmt = GET_RTX_FORMAT (code);
2284 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2287 replace_call_address (XEXP (x, i), reg, addr);
2291 for (j = 0; j < XVECLEN (x, i); j++)
2292 replace_call_address (XVECEXP (x, i, j), reg, addr);
2298 /* Return the number of memory refs to addresses that vary
2302 count_nonfixed_reads (x)
2305 register enum rtx_code code;
2313 code = GET_CODE (x);
2327 return ((invariant_p (XEXP (x, 0)) != 1)
2328 + count_nonfixed_reads (XEXP (x, 0)));
2335 fmt = GET_RTX_FORMAT (code);
2336 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
2339 value += count_nonfixed_reads (XEXP (x, i));
2343 for (j = 0; j < XVECLEN (x, i); j++)
2344 value += count_nonfixed_reads (XVECEXP (x, i, j));
2352 /* P is an instruction that sets a register to the result of a ZERO_EXTEND.
2353 Replace it with an instruction to load just the low bytes
2354 if the machine supports such an instruction,
2355 and insert above LOOP_START an instruction to clear the register. */
2358 constant_high_bytes (p, loop_start)
2362 register int insn_code_number;
2364 /* Try to change (SET (REG ...) (ZERO_EXTEND (..:B ...)))
2365 to (SET (STRICT_LOW_PART (SUBREG:B (REG...))) ...). */
2367 new = gen_rtx_SET (VOIDmode,
2368 gen_rtx_STRICT_LOW_PART (VOIDmode,
2369 gen_rtx_SUBREG (GET_MODE (XEXP (SET_SRC (PATTERN (p)), 0)),
2370 SET_DEST (PATTERN (p)),
2372 XEXP (SET_SRC (PATTERN (p)), 0));
2373 insn_code_number = recog (new, p);
2375 if (insn_code_number)
2379 /* Clear destination register before the loop. */
2380 emit_insn_before (gen_rtx_SET (VOIDmode, SET_DEST (PATTERN (p)),
2384 /* Inside the loop, just load the low part. */
2390 /* Scan a loop setting the variables `unknown_address_altered',
2391 `num_mem_sets', `loop_continue', `loops_enclosed', `loop_has_call',
2392 `loop_has_volatile', and `loop_has_tablejump'.
2393 Also, fill in the array `loop_mems' and the list `loop_store_mems'. */
2396 prescan_loop (start, end)
2399 register int level = 1;
2401 int loop_has_multiple_exit_targets = 0;
2402 /* The label after END. Jumping here is just like falling off the
2403 end of the loop. We use next_nonnote_insn instead of next_label
2404 as a hedge against the (pathological) case where some actual insn
2405 might end up between the two. */
2406 rtx exit_target = next_nonnote_insn (end);
2407 if (exit_target == NULL_RTX || GET_CODE (exit_target) != CODE_LABEL)
2408 loop_has_multiple_exit_targets = 1;
2410 unknown_address_altered = 0;
2412 loop_has_volatile = 0;
2413 loop_has_tablejump = 0;
2414 loop_store_mems = NULL_RTX;
2415 first_loop_store_insn = NULL_RTX;
2422 for (insn = NEXT_INSN (start); insn != NEXT_INSN (end);
2423 insn = NEXT_INSN (insn))
2425 if (GET_CODE (insn) == NOTE)
2427 if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_BEG)
2430 /* Count number of loops contained in this one. */
2433 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_END)
2442 else if (NOTE_LINE_NUMBER (insn) == NOTE_INSN_LOOP_CONT)
2445 loop_continue = insn;
2448 else if (GET_CODE (insn) == CALL_INSN)
2450 if (! CONST_CALL_P (insn))
2451 unknown_address_altered = 1;
2454 else if (GET_CODE (insn) == INSN || GET_CODE (insn) == JUMP_INSN)
2456 rtx label1 = NULL_RTX;
2457 rtx label2 = NULL_RTX;
2459 if (volatile_refs_p (PATTERN (insn)))
2460 loop_has_volatile = 1;
2462 if (GET_CODE (insn) == JUMP_INSN
2463 && (GET_CODE (PATTERN (insn)) == ADDR_DIFF_VEC
2464 || GET_CODE (PATTERN (insn)) == ADDR_VEC))
2465 loop_has_tablejump = 1;
2467 note_stores (PATTERN (insn), note_addr_stored);
2468 if (! first_loop_store_insn && loop_store_mems)
2469 first_loop_store_insn = insn;
2471 if (! loop_has_multiple_exit_targets
2472 && GET_CODE (insn) == JUMP_INSN
2473 && GET_CODE (PATTERN (insn)) == SET
2474 && SET_DEST (PATTERN (insn)) == pc_rtx)
2476 if (GET_CODE (SET_SRC (PATTERN (insn))) == IF_THEN_ELSE)
2478 label1 = XEXP (SET_SRC (PATTERN (insn)), 1);
2479 label2 = XEXP (SET_SRC (PATTERN (insn)), 2);
2483 label1 = SET_SRC (PATTERN (insn));
2487 if (label1 && label1 != pc_rtx)
2489 if (GET_CODE (label1) != LABEL_REF)
2491 /* Something tricky. */
2492 loop_has_multiple_exit_targets = 1;
2495 else if (XEXP (label1, 0) != exit_target
2496 && LABEL_OUTSIDE_LOOP_P (label1))
2498 /* A jump outside the current loop. */
2499 loop_has_multiple_exit_targets = 1;
2509 else if (GET_CODE (insn) == RETURN)
2510 loop_has_multiple_exit_targets = 1;
2513 /* Now, rescan the loop, setting up the LOOP_MEMS array. */
2514 if (/* We can't tell what MEMs are aliased by what. */
2515 !unknown_address_altered
2516 /* An exception thrown by a called function might land us
2519 /* We don't want loads for MEMs moved to a location before the
2520 one at which their stack memory becomes allocated. (Note
2521 that this is not a problem for malloc, etc., since those
2522 require actual function calls. */
2523 && !current_function_calls_alloca
2524 /* There are ways to leave the loop other than falling off the
2526 && !loop_has_multiple_exit_targets)
2527 for (insn = NEXT_INSN (start); insn != NEXT_INSN (end);
2528 insn = NEXT_INSN (insn))
2529 for_each_rtx (&insn, insert_loop_mem, 0);
2532 /* LOOP_NUMBER_CONT_DOMINATOR is now the last label between the loop start
2533 and the continue note that is a the destination of a (cond)jump after
2534 the continue note. If there is any (cond)jump between the loop start
2535 and what we have so far as LOOP_NUMBER_CONT_DOMINATOR that has a
2536 target between LOOP_DOMINATOR and the continue note, move
2537 LOOP_NUMBER_CONT_DOMINATOR forward to that label; if a jump's
2538 destination cannot be determined, clear LOOP_NUMBER_CONT_DOMINATOR. */
2541 verify_dominator (loop_number)
2546 if (! loop_number_cont_dominator[loop_number])
2547 /* This can happen for an empty loop, e.g. in
2548 gcc.c-torture/compile/920410-2.c */
2550 if (loop_number_cont_dominator[loop_number] == const0_rtx)
2552 loop_number_cont_dominator[loop_number] = 0;
2555 for (insn = loop_number_loop_starts[loop_number];
2556 insn != loop_number_cont_dominator[loop_number];
2557 insn = NEXT_INSN (insn))
2559 if (GET_CODE (insn) == JUMP_INSN
2560 && GET_CODE (PATTERN (insn)) != RETURN)
2562 rtx label = JUMP_LABEL (insn);
2563 int label_luid = INSN_LUID (label);
2565 if (! condjump_p (insn)
2566 && ! condjump_in_parallel_p (insn))
2568 loop_number_cont_dominator[loop_number] = NULL_RTX;
2571 if (label_luid < INSN_LUID (loop_number_loop_cont[loop_number])
2573 > INSN_LUID (loop_number_cont_dominator[loop_number])))
2574 loop_number_cont_dominator[loop_number] = label;
2579 /* Scan the function looking for loops. Record the start and end of each loop.
2580 Also mark as invalid loops any loops that contain a setjmp or are branched
2581 to from outside the loop. */
2584 find_and_verify_loops (f)
2588 int current_loop = -1;
2592 compute_luids (f, NULL_RTX, 0);
2594 /* If there are jumps to undefined labels,
2595 treat them as jumps out of any/all loops.
2596 This also avoids writing past end of tables when there are no loops. */
2597 uid_loop_num[0] = -1;
2599 /* Find boundaries of loops, mark which loops are contained within
2600 loops, and invalidate loops that have setjmp. */
2602 for (insn = f; insn; insn = NEXT_INSN (insn))
2604 if (GET_CODE (insn) == NOTE)
2605 switch (NOTE_LINE_NUMBER (insn))
2607 case NOTE_INSN_LOOP_BEG:
2608 loop_number_loop_starts[++next_loop] = insn;
2609 loop_number_loop_ends[next_loop] = 0;
2610 loop_number_loop_cont[next_loop] = 0;
2611 loop_number_cont_dominator[next_loop] = 0;
2612 loop_outer_loop[next_loop] = current_loop;
2613 loop_invalid[next_loop] = 0;
2614 loop_number_exit_labels[next_loop] = 0;
2615 loop_number_exit_count[next_loop] = 0;
2616 current_loop = next_loop;
2619 case NOTE_INSN_SETJMP:
2620 /* In this case, we must invalidate our current loop and any
2622 for (loop = current_loop; loop != -1; loop = loop_outer_loop[loop])
2624 loop_invalid[loop] = 1;
2625 if (loop_dump_stream)
2626 fprintf (loop_dump_stream,
2627 "\nLoop at %d ignored due to setjmp.\n",
2628 INSN_UID (loop_number_loop_starts[loop]));
2632 case NOTE_INSN_LOOP_CONT:
2633 loop_number_loop_cont[current_loop] = insn;
2635 case NOTE_INSN_LOOP_END:
2636 if (current_loop == -1)
2639 loop_number_loop_ends[current_loop] = insn;
2640 verify_dominator (current_loop);
2641 current_loop = loop_outer_loop[current_loop];
2647 /* If for any loop, this is a jump insn between the NOTE_INSN_LOOP_CONT
2648 and NOTE_INSN_LOOP_END notes, update loop_number_loop_dominator. */
2649 else if (GET_CODE (insn) == JUMP_INSN
2650 && GET_CODE (PATTERN (insn)) != RETURN
2651 && current_loop >= 0)
2654 rtx label = JUMP_LABEL (insn);
2656 if (! condjump_p (insn) && ! condjump_in_parallel_p (insn))
2659 this_loop = current_loop;
2662 /* First see if we care about this loop. */
2663 if (loop_number_loop_cont[this_loop]
2664 && loop_number_cont_dominator[this_loop] != const0_rtx)
2666 /* If the jump destination is not known, invalidate
2667 loop_number_const_dominator. */
2669 loop_number_cont_dominator[this_loop] = const0_rtx;
2671 /* Check if the destination is between loop start and
2673 if ((INSN_LUID (label)
2674 < INSN_LUID (loop_number_loop_cont[this_loop]))
2675 && (INSN_LUID (label)
2676 > INSN_LUID (loop_number_loop_starts[this_loop]))
2677 /* And if there is no later destination already
2679 && (! loop_number_cont_dominator[this_loop]
2680 || (INSN_LUID (label)
2681 > INSN_LUID (loop_number_cont_dominator
2683 loop_number_cont_dominator[this_loop] = label;
2685 this_loop = loop_outer_loop[this_loop];
2687 while (this_loop >= 0);
2690 /* Note that this will mark the NOTE_INSN_LOOP_END note as being in the
2691 enclosing loop, but this doesn't matter. */
2692 uid_loop_num[INSN_UID (insn)] = current_loop;
2695 /* Any loop containing a label used in an initializer must be invalidated,
2696 because it can be jumped into from anywhere. */
2698 for (label = forced_labels; label; label = XEXP (label, 1))
2702 for (loop_num = uid_loop_num[INSN_UID (XEXP (label, 0))];
2704 loop_num = loop_outer_loop[loop_num])
2705 loop_invalid[loop_num] = 1;
2708 /* Any loop containing a label used for an exception handler must be
2709 invalidated, because it can be jumped into from anywhere. */
2711 for (label = exception_handler_labels; label; label = XEXP (label, 1))
2715 for (loop_num = uid_loop_num[INSN_UID (XEXP (label, 0))];
2717 loop_num = loop_outer_loop[loop_num])
2718 loop_invalid[loop_num] = 1;
2721 /* Now scan all insn's in the function. If any JUMP_INSN branches into a
2722 loop that it is not contained within, that loop is marked invalid.
2723 If any INSN or CALL_INSN uses a label's address, then the loop containing
2724 that label is marked invalid, because it could be jumped into from
2727 Also look for blocks of code ending in an unconditional branch that
2728 exits the loop. If such a block is surrounded by a conditional
2729 branch around the block, move the block elsewhere (see below) and
2730 invert the jump to point to the code block. This may eliminate a
2731 label in our loop and will simplify processing by both us and a
2732 possible second cse pass. */
2734 for (insn = f; insn; insn = NEXT_INSN (insn))
2735 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
2737 int this_loop_num = uid_loop_num[INSN_UID (insn)];
2739 if (GET_CODE (insn) == INSN || GET_CODE (insn) == CALL_INSN)
2741 rtx note = find_reg_note (insn, REG_LABEL, NULL_RTX);
2746 for (loop_num = uid_loop_num[INSN_UID (XEXP (note, 0))];
2748 loop_num = loop_outer_loop[loop_num])
2749 loop_invalid[loop_num] = 1;
2753 if (GET_CODE (insn) != JUMP_INSN)
2756 mark_loop_jump (PATTERN (insn), this_loop_num);
2758 /* See if this is an unconditional branch outside the loop. */
2759 if (this_loop_num != -1
2760 && (GET_CODE (PATTERN (insn)) == RETURN
2761 || (simplejump_p (insn)
2762 && (uid_loop_num[INSN_UID (JUMP_LABEL (insn))]
2764 && get_max_uid () < max_uid_for_loop)
2767 rtx our_next = next_real_insn (insn);
2769 int outer_loop = -1;
2771 /* Go backwards until we reach the start of the loop, a label,
2773 for (p = PREV_INSN (insn);
2774 GET_CODE (p) != CODE_LABEL
2775 && ! (GET_CODE (p) == NOTE
2776 && NOTE_LINE_NUMBER (p) == NOTE_INSN_LOOP_BEG)
2777 && GET_CODE (p) != JUMP_INSN;
2781 /* Check for the case where we have a jump to an inner nested
2782 loop, and do not perform the optimization in that case. */
2784 if (JUMP_LABEL (insn))
2786 dest_loop = uid_loop_num[INSN_UID (JUMP_LABEL (insn))];
2787 if (dest_loop != -1)
2789 for (outer_loop = dest_loop; outer_loop != -1;
2790 outer_loop = loop_outer_loop[outer_loop])
2791 if (outer_loop == this_loop_num)
2796 /* Make sure that the target of P is within the current loop. */
2798 if (GET_CODE (p) == JUMP_INSN && JUMP_LABEL (p)
2799 && uid_loop_num[INSN_UID (JUMP_LABEL (p))] != this_loop_num)
2800 outer_loop = this_loop_num;
2802 /* If we stopped on a JUMP_INSN to the next insn after INSN,
2803 we have a block of code to try to move.
2805 We look backward and then forward from the target of INSN
2806 to find a BARRIER at the same loop depth as the target.
2807 If we find such a BARRIER, we make a new label for the start
2808 of the block, invert the jump in P and point it to that label,
2809 and move the block of code to the spot we found. */
2811 if (outer_loop == -1
2812 && GET_CODE (p) == JUMP_INSN
2813 && JUMP_LABEL (p) != 0
2814 /* Just ignore jumps to labels that were never emitted.
2815 These always indicate compilation errors. */
2816 && INSN_UID (JUMP_LABEL (p)) != 0
2818 && ! simplejump_p (p)
2819 && next_real_insn (JUMP_LABEL (p)) == our_next)
2822 = JUMP_LABEL (insn) ? JUMP_LABEL (insn) : get_last_insn ();
2823 int target_loop_num = uid_loop_num[INSN_UID (target)];
2826 for (loc = target; loc; loc = PREV_INSN (loc))
2827 if (GET_CODE (loc) == BARRIER
2828 && uid_loop_num[INSN_UID (loc)] == target_loop_num)
2832 for (loc = target; loc; loc = NEXT_INSN (loc))
2833 if (GET_CODE (loc) == BARRIER
2834 && uid_loop_num[INSN_UID (loc)] == target_loop_num)
2839 rtx cond_label = JUMP_LABEL (p);
2840 rtx new_label = get_label_after (p);
2842 /* Ensure our label doesn't go away. */
2843 LABEL_NUSES (cond_label)++;
2845 /* Verify that uid_loop_num is large enough and that
2847 if (invert_jump (p, new_label))
2851 /* If no suitable BARRIER was found, create a suitable
2852 one before TARGET. Since TARGET is a fall through
2853 path, we'll need to insert an jump around our block
2854 and a add a BARRIER before TARGET.
2856 This creates an extra unconditional jump outside
2857 the loop. However, the benefits of removing rarely
2858 executed instructions from inside the loop usually
2859 outweighs the cost of the extra unconditional jump
2860 outside the loop. */
2865 temp = gen_jump (JUMP_LABEL (insn));
2866 temp = emit_jump_insn_before (temp, target);
2867 JUMP_LABEL (temp) = JUMP_LABEL (insn);
2868 LABEL_NUSES (JUMP_LABEL (insn))++;
2869 loc = emit_barrier_before (target);
2872 /* Include the BARRIER after INSN and copy the
2874 new_label = squeeze_notes (new_label, NEXT_INSN (insn));
2875 reorder_insns (new_label, NEXT_INSN (insn), loc);
2877 /* All those insns are now in TARGET_LOOP_NUM. */
2878 for (q = new_label; q != NEXT_INSN (NEXT_INSN (insn));
2880 uid_loop_num[INSN_UID (q)] = target_loop_num;
2882 /* The label jumped to by INSN is no longer a loop exit.
2883 Unless INSN does not have a label (e.g., it is a
2884 RETURN insn), search loop_number_exit_labels to find
2885 its label_ref, and remove it. Also turn off
2886 LABEL_OUTSIDE_LOOP_P bit. */
2887 if (JUMP_LABEL (insn))
2892 r = loop_number_exit_labels[this_loop_num];
2893 r; q = r, r = LABEL_NEXTREF (r))
2894 if (XEXP (r, 0) == JUMP_LABEL (insn))
2896 LABEL_OUTSIDE_LOOP_P (r) = 0;
2898 LABEL_NEXTREF (q) = LABEL_NEXTREF (r);
2900 loop_number_exit_labels[this_loop_num]
2901 = LABEL_NEXTREF (r);
2905 for (loop_num = this_loop_num;
2906 loop_num != -1 && loop_num != target_loop_num;
2907 loop_num = loop_outer_loop[loop_num])
2908 loop_number_exit_count[loop_num]--;
2910 /* If we didn't find it, then something is wrong. */
2915 /* P is now a jump outside the loop, so it must be put
2916 in loop_number_exit_labels, and marked as such.
2917 The easiest way to do this is to just call
2918 mark_loop_jump again for P. */
2919 mark_loop_jump (PATTERN (p), this_loop_num);
2921 /* If INSN now jumps to the insn after it,
2923 if (JUMP_LABEL (insn) != 0
2924 && (next_real_insn (JUMP_LABEL (insn))
2925 == next_real_insn (insn)))
2929 /* Continue the loop after where the conditional
2930 branch used to jump, since the only branch insn
2931 in the block (if it still remains) is an inter-loop
2932 branch and hence needs no processing. */
2933 insn = NEXT_INSN (cond_label);
2935 if (--LABEL_NUSES (cond_label) == 0)
2936 delete_insn (cond_label);
2938 /* This loop will be continued with NEXT_INSN (insn). */
2939 insn = PREV_INSN (insn);
2946 /* If any label in X jumps to a loop different from LOOP_NUM and any of the
2947 loops it is contained in, mark the target loop invalid.
2949 For speed, we assume that X is part of a pattern of a JUMP_INSN. */
2952 mark_loop_jump (x, loop_num)
2960 switch (GET_CODE (x))
2973 /* There could be a label reference in here. */
2974 mark_loop_jump (XEXP (x, 0), loop_num);
2980 mark_loop_jump (XEXP (x, 0), loop_num);
2981 mark_loop_jump (XEXP (x, 1), loop_num);
2985 /* This may refer to a LABEL_REF or SYMBOL_REF. */
2986 mark_loop_jump (XEXP (x, 1), loop_num);
2991 mark_loop_jump (XEXP (x, 0), loop_num);
2995 dest_loop = uid_loop_num[INSN_UID (XEXP (x, 0))];
2997 /* Link together all labels that branch outside the loop. This
2998 is used by final_[bg]iv_value and the loop unrolling code. Also
2999 mark this LABEL_REF so we know that this branch should predict
3002 /* A check to make sure the label is not in an inner nested loop,
3003 since this does not count as a loop exit. */
3004 if (dest_loop != -1)
3006 for (outer_loop = dest_loop; outer_loop != -1;
3007 outer_loop = loop_outer_loop[outer_loop])
3008 if (outer_loop == loop_num)
3014 if (loop_num != -1 && outer_loop == -1)
3016 LABEL_OUTSIDE_LOOP_P (x) = 1;
3017 LABEL_NEXTREF (x) = loop_number_exit_labels[loop_num];
3018 loop_number_exit_labels[loop_num] = x;
3020 for (outer_loop = loop_num;
3021 outer_loop != -1 && outer_loop != dest_loop;
3022 outer_loop = loop_outer_loop[outer_loop])
3023 loop_number_exit_count[outer_loop]++;
3026 /* If this is inside a loop, but not in the current loop or one enclosed
3027 by it, it invalidates at least one loop. */
3029 if (dest_loop == -1)
3032 /* We must invalidate every nested loop containing the target of this
3033 label, except those that also contain the jump insn. */
3035 for (; dest_loop != -1; dest_loop = loop_outer_loop[dest_loop])
3037 /* Stop when we reach a loop that also contains the jump insn. */
3038 for (outer_loop = loop_num; outer_loop != -1;
3039 outer_loop = loop_outer_loop[outer_loop])
3040 if (dest_loop == outer_loop)
3043 /* If we get here, we know we need to invalidate a loop. */
3044 if (loop_dump_stream && ! loop_invalid[dest_loop])
3045 fprintf (loop_dump_stream,
3046 "\nLoop at %d ignored due to multiple entry points.\n",
3047 INSN_UID (loop_number_loop_starts[dest_loop]));
3049 loop_invalid[dest_loop] = 1;
3054 /* If this is not setting pc, ignore. */
3055 if (SET_DEST (x) == pc_rtx)
3056 mark_loop_jump (SET_SRC (x), loop_num);
3060 mark_loop_jump (XEXP (x, 1), loop_num);
3061 mark_loop_jump (XEXP (x, 2), loop_num);
3066 for (i = 0; i < XVECLEN (x, 0); i++)
3067 mark_loop_jump (XVECEXP (x, 0, i), loop_num);
3071 for (i = 0; i < XVECLEN (x, 1); i++)
3072 mark_loop_jump (XVECEXP (x, 1, i), loop_num);
3076 /* Strictly speaking this is not a jump into the loop, only a possible
3077 jump out of the loop. However, we have no way to link the destination
3078 of this jump onto the list of exit labels. To be safe we mark this
3079 loop and any containing loops as invalid. */
3082 for (outer_loop = loop_num; outer_loop != -1;
3083 outer_loop = loop_outer_loop[outer_loop])
3085 if (loop_dump_stream && ! loop_invalid[outer_loop])
3086 fprintf (loop_dump_stream,
3087 "\nLoop at %d ignored due to unknown exit jump.\n",
3088 INSN_UID (loop_number_loop_starts[outer_loop]));
3089 loop_invalid[outer_loop] = 1;
3096 /* Return nonzero if there is a label in the range from
3097 insn INSN to and including the insn whose luid is END
3098 INSN must have an assigned luid (i.e., it must not have
3099 been previously created by loop.c). */
3102 labels_in_range_p (insn, end)
3106 while (insn && INSN_LUID (insn) <= end)
3108 if (GET_CODE (insn) == CODE_LABEL)
3110 insn = NEXT_INSN (insn);
3116 /* Record that a memory reference X is being set. */
3119 note_addr_stored (x, y)
3121 rtx y ATTRIBUTE_UNUSED;
3123 if (x == 0 || GET_CODE (x) != MEM)
3126 /* Count number of memory writes.
3127 This affects heuristics in strength_reduce. */
3130 /* BLKmode MEM means all memory is clobbered. */
3131 if (GET_MODE (x) == BLKmode)
3132 unknown_address_altered = 1;
3134 if (unknown_address_altered)
3137 loop_store_mems = gen_rtx_EXPR_LIST (VOIDmode, x, loop_store_mems);
3140 /* Return nonzero if the rtx X is invariant over the current loop.
3142 The value is 2 if we refer to something only conditionally invariant.
3144 If `unknown_address_altered' is nonzero, no memory ref is invariant.
3145 Otherwise, a memory ref is invariant if it does not conflict with
3146 anything stored in `loop_store_mems'. */
3153 register enum rtx_code code;
3155 int conditional = 0;
3160 code = GET_CODE (x);
3170 /* A LABEL_REF is normally invariant, however, if we are unrolling
3171 loops, and this label is inside the loop, then it isn't invariant.
3172 This is because each unrolled copy of the loop body will have
3173 a copy of this label. If this was invariant, then an insn loading
3174 the address of this label into a register might get moved outside
3175 the loop, and then each loop body would end up using the same label.
3177 We don't know the loop bounds here though, so just fail for all
3179 if (flag_unroll_loops)
3186 case UNSPEC_VOLATILE:
3190 /* We used to check RTX_UNCHANGING_P (x) here, but that is invalid
3191 since the reg might be set by initialization within the loop. */
3193 if ((x == frame_pointer_rtx || x == hard_frame_pointer_rtx
3194 || x == arg_pointer_rtx)
3195 && ! current_function_has_nonlocal_goto)
3199 && REGNO (x) < FIRST_PSEUDO_REGISTER && call_used_regs[REGNO (x)])
3202 if (VARRAY_INT (set_in_loop, REGNO (x)) < 0)
3205 return VARRAY_INT (set_in_loop, REGNO (x)) == 0;
3208 /* Volatile memory references must be rejected. Do this before
3209 checking for read-only items, so that volatile read-only items
3210 will be rejected also. */
3211 if (MEM_VOLATILE_P (x))
3214 /* Read-only items (such as constants in a constant pool) are
3215 invariant if their address is. */
3216 if (RTX_UNCHANGING_P (x))
3219 /* If we had a subroutine call, any location in memory could have been
3221 if (unknown_address_altered)
3224 /* See if there is any dependence between a store and this load. */
3225 mem_list_entry = loop_store_mems;
3226 while (mem_list_entry)
3228 if (true_dependence (XEXP (mem_list_entry, 0), VOIDmode,
3231 mem_list_entry = XEXP (mem_list_entry, 1);
3234 /* It's not invalidated by a store in memory
3235 but we must still verify the address is invariant. */
3239 /* Don't mess with insns declared volatile. */
3240 if (MEM_VOLATILE_P (x))
3248 fmt = GET_RTX_FORMAT (code);
3249 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
3253 int tem = invariant_p (XEXP (x, i));
3259 else if (fmt[i] == 'E')
3262 for (j = 0; j < XVECLEN (x, i); j++)
3264 int tem = invariant_p (XVECEXP (x, i, j));
3274 return 1 + conditional;
3278 /* Return nonzero if all the insns in the loop that set REG
3279 are INSN and the immediately following insns,
3280 and if each of those insns sets REG in an invariant way
3281 (not counting uses of REG in them).
3283 The value is 2 if some of these insns are only conditionally invariant.
3285 We assume that INSN itself is the first set of REG
3286 and that its source is invariant. */
3289 consec_sets_invariant_p (reg, n_sets, insn)
3293 register rtx p = insn;
3294 register int regno = REGNO (reg);
3296 /* Number of sets we have to insist on finding after INSN. */
3297 int count = n_sets - 1;
3298 int old = VARRAY_INT (set_in_loop, regno);
3302 /* If N_SETS hit the limit, we can't rely on its value. */
3306 VARRAY_INT (set_in_loop, regno) = 0;
3310 register enum rtx_code code;
3314 code = GET_CODE (p);
3316 /* If library call, skip to end of it. */
3317 if (code == INSN && (temp = find_reg_note (p, REG_LIBCALL, NULL_RTX)))
3322 && (set = single_set (p))
3323 && GET_CODE (SET_DEST (set)) == REG
3324 && REGNO (SET_DEST (set)) == regno)
3326 this = invariant_p (SET_SRC (set));
3329 else if ((temp = find_reg_note (p, REG_EQUAL, NULL_RTX)))
3331 /* If this is a libcall, then any invariant REG_EQUAL note is OK.
3332 If this is an ordinary insn, then only CONSTANT_P REG_EQUAL
3334 this = (CONSTANT_P (XEXP (temp, 0))
3335 || (find_reg_note (p, REG_RETVAL, NULL_RTX)
3336 && invariant_p (XEXP (temp, 0))));
3343 else if (code != NOTE)
3345 VARRAY_INT (set_in_loop, regno) = old;
3350 VARRAY_INT (set_in_loop, regno) = old;
3351 /* If invariant_p ever returned 2, we return 2. */
3352 return 1 + (value & 2);
3356 /* I don't think this condition is sufficient to allow INSN
3357 to be moved, so we no longer test it. */
3359 /* Return 1 if all insns in the basic block of INSN and following INSN
3360 that set REG are invariant according to TABLE. */
3363 all_sets_invariant_p (reg, insn, table)
3367 register rtx p = insn;
3368 register int regno = REGNO (reg);
3372 register enum rtx_code code;
3374 code = GET_CODE (p);
3375 if (code == CODE_LABEL || code == JUMP_INSN)
3377 if (code == INSN && GET_CODE (PATTERN (p)) == SET
3378 && GET_CODE (SET_DEST (PATTERN (p))) == REG
3379 && REGNO (SET_DEST (PATTERN (p))) == regno)
3381 if (!invariant_p (SET_SRC (PATTERN (p)), table))
3388 /* Look at all uses (not sets) of registers in X. For each, if it is
3389 the single use, set USAGE[REGNO] to INSN; if there was a previous use in
3390 a different insn, set USAGE[REGNO] to const0_rtx. */
3393 find_single_use_in_loop (insn, x, usage)
3398 enum rtx_code code = GET_CODE (x);
3399 char *fmt = GET_RTX_FORMAT (code);
3403 VARRAY_RTX (usage, REGNO (x))
3404 = (VARRAY_RTX (usage, REGNO (x)) != 0
3405 && VARRAY_RTX (usage, REGNO (x)) != insn)
3406 ? const0_rtx : insn;
3408 else if (code == SET)
3410 /* Don't count SET_DEST if it is a REG; otherwise count things
3411 in SET_DEST because if a register is partially modified, it won't
3412 show up as a potential movable so we don't care how USAGE is set
3414 if (GET_CODE (SET_DEST (x)) != REG)
3415 find_single_use_in_loop (insn, SET_DEST (x), usage);
3416 find_single_use_in_loop (insn, SET_SRC (x), usage);
3419 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
3421 if (fmt[i] == 'e' && XEXP (x, i) != 0)
3422 find_single_use_in_loop (insn, XEXP (x, i), usage);
3423 else if (fmt[i] == 'E')
3424 for (j = XVECLEN (x, i) - 1; j >= 0; j--)
3425 find_single_use_in_loop (insn, XVECEXP (x, i, j), usage);
3429 /* Count and record any set in X which is contained in INSN. Update
3430 MAY_NOT_MOVE and LAST_SET for any register set in X. */
3433 count_one_set (insn, x, may_not_move, last_set)
3435 varray_type may_not_move;
3438 if (GET_CODE (x) == CLOBBER && GET_CODE (XEXP (x, 0)) == REG)
3439 /* Don't move a reg that has an explicit clobber.
3440 It's not worth the pain to try to do it correctly. */
3441 VARRAY_CHAR (may_not_move, REGNO (XEXP (x, 0))) = 1;
3443 if (GET_CODE (x) == SET || GET_CODE (x) == CLOBBER)
3445 rtx dest = SET_DEST (x);
3446 while (GET_CODE (dest) == SUBREG
3447 || GET_CODE (dest) == ZERO_EXTRACT
3448 || GET_CODE (dest) == SIGN_EXTRACT
3449 || GET_CODE (dest) == STRICT_LOW_PART)
3450 dest = XEXP (dest, 0);
3451 if (GET_CODE (dest) == REG)
3453 register int regno = REGNO (dest);
3454 /* If this is the first setting of this reg
3455 in current basic block, and it was set before,
3456 it must be set in two basic blocks, so it cannot
3457 be moved out of the loop. */
3458 if (VARRAY_INT (set_in_loop, regno) > 0
3459 && last_set[regno] == 0)
3460 VARRAY_CHAR (may_not_move, regno) = 1;
3461 /* If this is not first setting in current basic block,
3462 see if reg was used in between previous one and this.
3463 If so, neither one can be moved. */
3464 if (last_set[regno] != 0
3465 && reg_used_between_p (dest, last_set[regno], insn))
3466 VARRAY_CHAR (may_not_move, regno) = 1;
3467 if (VARRAY_INT (set_in_loop, regno) < 127)
3468 ++VARRAY_INT (set_in_loop, regno);
3469 last_set[regno] = insn;
3474 /* Increment SET_IN_LOOP at the index of each register
3475 that is modified by an insn between FROM and TO.
3476 If the value of an element of SET_IN_LOOP becomes 127 or more,
3477 stop incrementing it, to avoid overflow.
3479 Store in SINGLE_USAGE[I] the single insn in which register I is
3480 used, if it is only used once. Otherwise, it is set to 0 (for no
3481 uses) or const0_rtx for more than one use. This parameter may be zero,
3482 in which case this processing is not done.
3484 Store in *COUNT_PTR the number of actual instruction
3485 in the loop. We use this to decide what is worth moving out. */
3487 /* last_set[n] is nonzero iff reg n has been set in the current basic block.
3488 In that case, it is the insn that last set reg n. */
3491 count_loop_regs_set (from, to, may_not_move, single_usage, count_ptr, nregs)
3492 register rtx from, to;
3493 varray_type may_not_move;
3494 varray_type single_usage;
3498 register rtx *last_set = (rtx *) alloca (nregs * sizeof (rtx));
3500 register int count = 0;
3502 bzero ((char *) last_set, nregs * sizeof (rtx));
3503 for (insn = from; insn != to; insn = NEXT_INSN (insn))
3505 if (GET_RTX_CLASS (GET_CODE (insn)) == 'i')
3509 /* Record registers that have exactly one use. */
3510 find_single_use_in_loop (insn, PATTERN (insn), single_usage);
3512 /* Include uses in REG_EQUAL notes. */
3513 if (REG_NOTES (insn))
3514 find_single_use_in_loop (insn, REG_NOTES (insn), single_usage);
3516 if (GET_CODE (PATTERN (insn)) == SET
3517 || GET_CODE (PATTERN (insn)) == CLOBBER)
3518 count_one_set (insn, PATTERN (insn), may_not_move, last_set);
3519 else if (GET_CODE (PATTERN (insn)) == PARALLEL)
3522 for (i = XVECLEN (PATTERN (insn), 0) - 1; i >= 0; i--)
3523 count_one_set (insn, XVECEXP (PATTERN (insn), 0, i),
3524 may_not_move, last_set);
3528 if (GET_CODE (insn) == CODE_LABEL || GET_CODE (insn) == JUMP_INSN)
3529 bzero ((char *) last_set, nregs * sizeof (rtx));
3534 /* Given a loop that is bounded by LOOP_START and LOOP_END
3535 and that is entered at SCAN_START,
3536 return 1 if the register set in SET contained in insn INSN is used by
3537 any insn that precedes INSN in cyclic order starting
3538 from the loop entry point.
3540 We don't want to use INSN_LUID here because if we restrict INSN to those
3541 that have a valid INSN_LUID, it means we cannot move an invariant out
3542 from an inner loop past two loops. */
3545 loop_reg_used_before_p (set, insn, loop_start, scan_start, loop_end)
3546 rtx set, insn, loop_start, scan_start, loop_end;
3548 rtx reg = SET_DEST (set);
3551 /* Scan forward checking for register usage. If we hit INSN, we
3552 are done. Otherwise, if we hit LOOP_END, wrap around to LOOP_START. */
3553 for (p = scan_start; p != insn; p = NEXT_INSN (p))
3555 if (GET_RTX_CLASS (GET_CODE (p)) == 'i'
3556 && reg_overlap_mentioned_p (reg, PATTERN (p)))
3566 /* A "basic induction variable" or biv is a pseudo reg that is set
3567 (within this loop) only by incrementing or decrementing it. */
3568 /* A "general induction variable" or giv is a pseudo reg whose
3569 value is a linear function of a biv. */
3571 /* Bivs are recognized by `basic_induction_var';
3572 Givs by `general_induction_var'. */
3574 /* Indexed by register number, indicates whether or not register is an
3575 induction variable, and if so what type. */
3577 varray_type reg_iv_type;
3579 /* Indexed by register number, contains pointer to `struct induction'
3580 if register is an induction variable. This holds general info for
3581 all induction variables. */
3583 varray_type reg_iv_info;
3585 /* Indexed by register number, contains pointer to `struct iv_class'
3586 if register is a basic induction variable. This holds info describing
3587 the class (a related group) of induction variables that the biv belongs
3590 struct iv_class **reg_biv_class;
3592 /* The head of a list which links together (via the next field)
3593 every iv class for the current loop. */
3595 struct iv_class *loop_iv_list;
3597 /* Givs made from biv increments are always splittable for loop unrolling.
3598 Since there is no regscan info for them, we have to keep track of them
3600 int first_increment_giv, last_increment_giv;
3602 /* Communication with routines called via `note_stores'. */
3604 static rtx note_insn;
3606 /* Dummy register to have non-zero DEST_REG for DEST_ADDR type givs. */
3608 static rtx addr_placeholder;
3610 /* ??? Unfinished optimizations, and possible future optimizations,
3611 for the strength reduction code. */
3613 /* ??? The interaction of biv elimination, and recognition of 'constant'
3614 bivs, may cause problems. */
3616 /* ??? Add heuristics so that DEST_ADDR strength reduction does not cause
3617 performance problems.
3619 Perhaps don't eliminate things that can be combined with an addressing
3620 mode. Find all givs that have the same biv, mult_val, and add_val;
3621 then for each giv, check to see if its only use dies in a following
3622 memory address. If so, generate a new memory address and check to see
3623 if it is valid. If it is valid, then store the modified memory address,
3624 otherwise, mark the giv as not done so that it will get its own iv. */
3626 /* ??? Could try to optimize branches when it is known that a biv is always
3629 /* ??? When replace a biv in a compare insn, we should replace with closest
3630 giv so that an optimized branch can still be recognized by the combiner,
3631 e.g. the VAX acb insn. */
3633 /* ??? Many of the checks involving uid_luid could be simplified if regscan
3634 was rerun in loop_optimize whenever a register was added or moved.
3635 Also, some of the optimizations could be a little less conservative. */
3637 /* Perform strength reduction and induction variable elimination.
3639 Pseudo registers created during this function will be beyond the last
3640 valid index in several tables including n_times_set and regno_last_uid.
3641 This does not cause a problem here, because the added registers cannot be
3642 givs outside of their loop, and hence will never be reconsidered.
3643 But scan_loop must check regnos to make sure they are in bounds.
3645 SCAN_START is the first instruction in the loop, as the loop would
3646 actually be executed. END is the NOTE_INSN_LOOP_END. LOOP_TOP is
3647 the first instruction in the loop, as it is layed out in the
3648 instruction stream. LOOP_START is the NOTE_INSN_LOOP_BEG.
3649 LOOP_CONT is the NOTE_INSN_LOOP_CONT. */
3652 strength_reduce (scan_start, end, loop_top, insn_count,
3653 loop_start, loop_end, loop_cont, unroll_p, bct_p)
3661 int unroll_p, bct_p ATTRIBUTE_UNUSED;
3669 /* This is 1 if current insn is not executed at least once for every loop
3671 int not_every_iteration = 0;
3672 /* This is 1 if current insn may be executed more than once for every
3674 int maybe_multiple = 0;
3675 /* Temporary list pointers for traversing loop_iv_list. */
3676 struct iv_class *bl, **backbl;
3677 /* Ratio of extra register life span we can justify
3678 for saving an instruction. More if loop doesn't call subroutines
3679 since in that case saving an insn makes more difference
3680 and more registers are available. */
3681 /* ??? could set this to last value of threshold in move_movables */
3682 int threshold = (loop_has_call ? 1 : 2) * (3 + n_non_fixed_regs);
3683 /* Map of pseudo-register replacements. */
3688 rtx end_insert_before;
3690 int n_extra_increment;
3691 struct loop_info loop_iteration_info;
3692 struct loop_info *loop_info = &loop_iteration_info;
3694 /* If scan_start points to the loop exit test, we have to be wary of
3695 subversive use of gotos inside expression statements. */
3696 if (prev_nonnote_insn (scan_start) != prev_nonnote_insn (loop_start))
3697 maybe_multiple = back_branch_in_range_p (scan_start, loop_start, loop_end);
3699 VARRAY_INT_INIT (reg_iv_type, max_reg_before_loop, "reg_iv_type");
3700 VARRAY_GENERIC_PTR_INIT (reg_iv_info, max_reg_before_loop, "reg_iv_info");
3701 reg_biv_class = (struct iv_class **)
3702 alloca (max_reg_before_loop * sizeof (struct iv_class *));
3703 bzero ((char *) reg_biv_class, (max_reg_before_loop
3704 * sizeof (struct iv_class *)));
3707 addr_placeholder = gen_reg_rtx (Pmode);
3709 /* Save insn immediately after the loop_end. Insns inserted after loop_end
3710 must be put before this insn, so that they will appear in the right
3711 order (i.e. loop order).
3713 If loop_end is the end of the current function, then emit a
3714 NOTE_INSN_DELETED after loop_end and set end_insert_before to the
3716 if (NEXT_INSN (loop_end) != 0)
3717 end_insert_before = NEXT_INSN (loop_end);
3719 end_insert_before = emit_note_after (NOTE_INSN_DELETED, loop_end);
3721 /* Scan through loop to find all possible bivs. */
3723 for (p = next_insn_in_loop (scan_start, scan_start, end, loop_top);
3725 p = next_insn_in_loop (p, scan_start, end, loop_top))
3727 if (GET_CODE (p) == INSN
3728 && (set = single_set (p))
3729 && GET_CODE (SET_DEST (set)) == REG)
3731 dest_reg = SET_DEST (set);
3732 if (REGNO (dest_reg) < max_reg_before_loop
3733 && REGNO (dest_reg) >= FIRST_PSEUDO_REGISTER
3734 && REG_IV_TYPE (REGNO (dest_reg)) != NOT_BASIC_INDUCT)
3736 if (basic_induction_var (SET_SRC (set), GET_MODE (SET_SRC (set)),
3737 dest_reg, p, &inc_val, &mult_val,
3740 /* It is a possible basic induction variable.
3741 Create and initialize an induction structure for it. */
3744 = (struct induction *) alloca (sizeof (struct induction));
3746 record_biv (v, p, dest_reg, inc_val, mult_val, location,
3747 not_every_iteration, maybe_multiple);
3748 REG_IV_TYPE (REGNO (dest_reg)) = BASIC_INDUCT;
3750 else if (REGNO (dest_reg) < max_reg_before_loop)
3751 REG_IV_TYPE (REGNO (dest_reg)) = NOT_BASIC_INDUCT;
3755 /* Past CODE_LABEL, we get to insns that may be executed multiple
3756 times. The only way we can be sure that they can't is if every
3757 jump insn between here and the end of the loop either
3758 returns, exits the loop, is a jump to a location that is still
3759 behind the label, or is a jump to the loop start. */
3761 if (GET_CODE (p) == CODE_LABEL)
3769 insn = NEXT_INSN (insn);
3770 if (insn == scan_start)
3778 if (insn == scan_start)
3782 if (GET_CODE (insn) == JUMP_INSN
3783 && GET_CODE (PATTERN (insn)) != RETURN
3784 && (! condjump_p (insn)
3785 || (JUMP_LABEL (insn) != 0
3786 && JUMP_LABEL (insn) != scan_start
3787 && (INSN_UID (JUMP_LABEL (insn)) >= max_uid_for_loop
3788 || (INSN_UID (p) < max_uid_for_loop
3789 ? (INSN_LUID (JUMP_LABEL (insn))
3791 : (INSN_UID (insn) >= max_uid_for_loop
3792 || (INSN_LUID (JUMP_LABEL (insn))
3793 < INSN_LUID (insn))))))))
3801 /* Past a jump, we get to insns for which we can't count
3802 on whether they will be executed during each iteration. */
3803 /* This code appears twice in strength_reduce. There is also similar
3804 code in scan_loop. */
3805 if (GET_CODE (p) == JUMP_INSN
3806 /* If we enter the loop in the middle, and scan around to the
3807 beginning, don't set not_every_iteration for that.
3808 This can be any kind of jump, since we want to know if insns
3809 will be executed if the loop is executed. */
3810 && ! (JUMP_LABEL (p) == loop_top
3811 && ((NEXT_INSN (NEXT_INSN (p)) == loop_end && simplejump_p (p))
3812 || (NEXT_INSN (p) == loop_end && condjump_p (p)))))
3816 /* If this is a jump outside the loop, then it also doesn't
3817 matter. Check to see if the target of this branch is on the
3818 loop_number_exits_labels list. */
3820 for (label = loop_number_exit_labels[uid_loop_num[INSN_UID (loop_start)]];
3822 label = LABEL_NEXTREF (label))
3823 if (XEXP (label, 0) == JUMP_LABEL (p))
3827 not_every_iteration = 1;
3830 else if (GET_CODE (p) == NOTE)
3832 /* At the virtual top of a converted loop, insns are again known to
3833 be executed each iteration: logically, the loop begins here
3834 even though the exit code has been duplicated.
3836 Insns are also again known to be executed each iteration at
3837 the LOOP_CONT note. */
3838 if ((NOTE_LINE_NUMBER (p) == NOTE_INSN_LOOP_VTOP
3839 || NOTE_LINE_NUMBER (p) == NOTE_INSN_LOOP_CONT)
3841 not_every_iteration = 0;
3842 else if (NOTE_LINE_NUMBER (p) == NOTE_INSN_LOOP_BEG)
3844 else if (NOTE_LINE_NUMBER (p) == NOTE_INSN_LOOP_END)
3848 /* Unlike in the code motion pass where MAYBE_NEVER indicates that
3849 an insn may never be executed, NOT_EVERY_ITERATION indicates whether
3850 or not an insn is known to be executed each iteration of the
3851 loop, whether or not any iterations are known to occur.
3853 Therefore, if we have just passed a label and have no more labels
3854 between here and the test insn of the loop, we know these insns
3855 will be executed each iteration. */
3857 if (not_every_iteration && GET_CODE (p) == CODE_LABEL
3858 && no_labels_between_p (p, loop_end)
3859 && insn_first_p (p, loop_cont))
3860 not_every_iteration = 0;
3863 /* Scan loop_iv_list to remove all regs that proved not to be bivs.
3864 Make a sanity check against n_times_set. */
3865 for (backbl = &loop_iv_list, bl = *backbl; bl; bl = bl->next)
3867 if (REG_IV_TYPE (bl->regno) != BASIC_INDUCT
3868 /* Above happens if register modified by subreg, etc. */
3869 /* Make sure it is not recognized as a basic induction var: */
3870 || VARRAY_INT (n_times_set, bl->regno) != bl->biv_count
3871 /* If never incremented, it is invariant that we decided not to
3872 move. So leave it alone. */
3873 || ! bl->incremented)
3875 if (loop_dump_stream)
3876 fprintf (loop_dump_stream, "Reg %d: biv discarded, %s\n",
3878 (REG_IV_TYPE (bl->regno) != BASIC_INDUCT
3879 ? "not induction variable"
3880 : (! bl->incremented ? "never incremented"
3883 REG_IV_TYPE (bl->regno) = NOT_BASIC_INDUCT;
3890 if (loop_dump_stream)
3891 fprintf (loop_dump_stream, "Reg %d: biv verified\n", bl->regno);
3895 /* Exit if there are no bivs. */
3898 /* Can still unroll the loop anyways, but indicate that there is no
3899 strength reduction info available. */
3901 unroll_loop (loop_end, insn_count, loop_start, end_insert_before,
3907 /* Find initial value for each biv by searching backwards from loop_start,
3908 halting at first label. Also record any test condition. */
3911 for (p = loop_start; p && GET_CODE (p) != CODE_LABEL; p = PREV_INSN (p))
3915 if (GET_CODE (p) == CALL_INSN)
3918 if (GET_CODE (p) == INSN || GET_CODE (p) == JUMP_INSN
3919 || GET_CODE (p) == CALL_INSN)
3920 note_stores (PATTERN (p), record_initial);
3922 /* Record any test of a biv that branches around the loop if no store
3923 between it and the start of loop. We only care about tests with
3924 constants and registers and only certain of those. */
3925 if (GET_CODE (p) == JUMP_INSN
3926 && JUMP_LABEL (p) != 0
3927 && next_real_insn (JUMP_LABEL (p)) == next_real_insn (loop_end)
3928 && (test = get_condition_for_loop (p)) != 0
3929 && GET_CODE (XEXP (test, 0)) == REG
3930 && REGNO (XEXP (test, 0)) < max_reg_before_loop
3931 && (bl = reg_biv_class[REGNO (XEXP (test, 0))]) != 0
3932 && valid_initial_value_p (XEXP (test, 1), p, call_seen, loop_start)
3933 && bl->init_insn == 0)
3935 /* If an NE test, we have an initial value! */
3936 if (GET_CODE (test) == NE)
3939 bl->init_set = gen_rtx_SET (VOIDmode,
3940 XEXP (test, 0), XEXP (test, 1));
3943 bl->initial_test = test;
3947 /* Look at the each biv and see if we can say anything better about its
3948 initial value from any initializing insns set up above. (This is done
3949 in two passes to avoid missing SETs in a PARALLEL.) */
3950 for (backbl = &loop_iv_list; (bl = *backbl); backbl = &bl->next)
3955 if (! bl->init_insn)
3958 /* IF INIT_INSN has a REG_EQUAL or REG_EQUIV note and the value
3959 is a constant, use the value of that. */
3960 if (((note = find_reg_note (bl->init_insn, REG_EQUAL, 0)) != NULL
3961 && CONSTANT_P (XEXP (note, 0)))
3962 || ((note = find_reg_note (bl->init_insn, REG_EQUIV, 0)) != NULL
3963 && CONSTANT_P (XEXP (note, 0))))
3964 src = XEXP (note, 0);
3966 src = SET_SRC (bl->init_set);
3968 if (loop_dump_stream)
3969 fprintf (loop_dump_stream,
3970 "Biv %d initialized at insn %d: initial value ",
3971 bl->regno, INSN_UID (bl->init_insn));
3973 if ((GET_MODE (src) == GET_MODE (regno_reg_rtx[bl->regno])
3974 || GET_MODE (src) == VOIDmode)
3975 && valid_initial_value_p (src, bl->init_insn, call_seen, loop_start))
3977 bl->initial_value = src;
3979 if (loop_dump_stream)
3981 if (GET_CODE (src) == CONST_INT)
3983 fprintf (loop_dump_stream, HOST_WIDE_INT_PRINT_DEC, INTVAL (src));
3984 fputc ('\n', loop_dump_stream);
3988 print_rtl (loop_dump_stream, src);
3989 fprintf (loop_dump_stream, "\n");
3995 struct iv_class *bl2 = 0;
3998 /* Biv initial value is not a simple move. If it is the sum of
3999 another biv and a constant, check if both bivs are incremented
4000 in lockstep. Then we are actually looking at a giv.
4001 For simplicity, we only handle the case where there is but a
4002 single increment, and the register is not used elsewhere. */
4003 if (bl->biv_count == 1
4004 && bl->regno < max_reg_before_loop
4005 && uid_luid[REGNO_LAST_UID (bl->regno)] < INSN_LUID (loop_end)
4006 && GET_CODE (src) == PLUS
4007 && GET_CODE (XEXP (src, 0)) == REG
4008 && CONSTANT_P (XEXP (src, 1))
4009 && ((increment = biv_total_increment (bl, loop_start, loop_end))
4012 int regno = REGNO (XEXP (src, 0));
4014 for (bl2 = loop_iv_list; bl2; bl2 = bl2->next)
4015 if (bl2->regno == regno)
4019 /* Now, can we transform this biv into a giv? */
4021 && bl2->biv_count == 1
4022 && rtx_equal_p (increment,
4023 biv_total_increment (bl2, loop_start, loop_end))
4024 /* init_insn is only set to insns that are before loop_start
4025 without any intervening labels. */
4026 && ! reg_set_between_p (bl2->biv->src_reg,
4027 PREV_INSN (bl->init_insn), loop_start)
4028 /* The register from BL2 must be set before the register from
4029 BL is set, or we must be able to move the latter set after
4030 the former set. Currently there can't be any labels
4031 in-between when biv_toal_increment returns nonzero both times
4032 but we test it here in case some day some real cfg analysis
4033 gets used to set always_computable. */
4034 && ((insn_first_p (bl2->biv->insn, bl->biv->insn)
4035 && no_labels_between_p (bl2->biv->insn, bl->biv->insn))
4036 || (! reg_used_between_p (bl->biv->src_reg, bl->biv->insn,
4038 && no_jumps_between_p (bl->biv->insn, bl2->biv->insn)))
4039 && validate_change (bl->biv->insn,
4040 &SET_SRC (single_set (bl->biv->insn)),
4043 int loop_num = uid_loop_num[INSN_UID (loop_start)];
4044 rtx dominator = loop_number_cont_dominator[loop_num];
4045 rtx giv = bl->biv->src_reg;
4046 rtx giv_insn = bl->biv->insn;
4047 rtx after_giv = NEXT_INSN (giv_insn);
4049 if (loop_dump_stream)
4050 fprintf (loop_dump_stream, "is giv of biv %d\n", bl2->regno);
4051 /* Let this giv be discovered by the generic code. */
4052 REG_IV_TYPE (bl->regno) = UNKNOWN_INDUCT;
4053 /* We can get better optimization if we can move the giv setting
4054 before the first giv use. */
4056 && ! reg_set_between_p (bl2->biv->src_reg, loop_start,
4058 && ! reg_used_between_p (giv, loop_start, dominator)
4059 && ! reg_used_between_p (giv, giv_insn, loop_end))
4064 for (next = NEXT_INSN (dominator); ; next = NEXT_INSN (next))
4066 if ((GET_RTX_CLASS (GET_CODE (next)) == 'i'
4067 && (reg_mentioned_p (giv, PATTERN (next))
4068 || reg_set_p (bl2->biv->src_reg, next)))
4069 || GET_CODE (next) == JUMP_INSN)
4072 if (GET_RTX_CLASS (GET_CODE (next)) != 'i'
4073 || ! sets_cc0_p (PATTERN (next)))
4077 if (loop_dump_stream)
4078 fprintf (loop_dump_stream, "move after insn %d\n",
4079 INSN_UID (dominator));
4080 /* Avoid problems with luids by actually moving the insn
4081 and adjusting all luids in the range. */
4082 reorder_insns (giv_insn, giv_insn, dominator);
4083 for (p = dominator; INSN_UID (p) >= max_uid_for_loop; )
4085 compute_luids (giv_insn, after_giv, INSN_LUID (p));
4086 /* If the only purpose of the init insn is to initialize
4087 this giv, delete it. */
4088 if (single_set (bl->init_insn)
4089 && ! reg_used_between_p (giv, bl->init_insn, loop_start))
4090 delete_insn (bl->init_insn);
4092 else if (! insn_first_p (bl2->biv->insn, bl->biv->insn))
4094 rtx p = PREV_INSN (giv_insn);
4095 while (INSN_UID (p) >= max_uid_for_loop)
4097 reorder_insns (giv_insn, giv_insn, bl2->biv->insn);
4098 compute_luids (after_giv, NEXT_INSN (giv_insn),
4101 /* Remove this biv from the chain. */
4111 /* If we can't make it a giv,
4112 let biv keep initial value of "itself". */
4113 else if (loop_dump_stream)
4114 fprintf (loop_dump_stream, "is complex\n");
4118 /* If a biv is unconditionally incremented several times in a row, convert
4119 all but the last increment into a giv. */
4121 /* Get an upper bound for the number of registers
4122 we might have after all bivs have been processed. */
4123 first_increment_giv = max_reg_num ();
4124 for (n_extra_increment = 0, bl = loop_iv_list; bl; bl = bl->next)
4125 n_extra_increment += bl->biv_count - 1;
4126 /* XXX Temporary. */
4127 if (0 && n_extra_increment)
4129 int nregs = first_increment_giv + n_extra_increment;
4131 /* Reallocate reg_iv_type and reg_iv_info. */
4132 VARRAY_GROW (reg_iv_type, nregs);
4133 VARRAY_GROW (reg_iv_info, nregs);
4135 for (bl = loop_iv_list; bl; bl = bl->next)
4137 struct induction **vp, *v, *next;
4139 /* The biv increments lists are in reverse order. Fix this first. */
4140 for (v = bl->biv, bl->biv = 0; v; v = next)
4143 v->next_iv = bl->biv;
4147 for (vp = &bl->biv, next = *vp; v = next, next = v->next_iv;)
4149 HOST_WIDE_INT offset;
4150 rtx set, add_val, old_reg, dest_reg, last_use_insn;
4151 int old_regno, new_regno;
4153 if (! v->always_executed
4154 || v->maybe_multiple
4155 || GET_CODE (v->add_val) != CONST_INT
4156 || ! next->always_executed
4157 || next->maybe_multiple
4158 || ! CONSTANT_P (next->add_val))
4163 offset = INTVAL (v->add_val);
4164 set = single_set (v->insn);
4165 add_val = plus_constant (next->add_val, offset);
4166 old_reg = v->dest_reg;
4167 dest_reg = gen_reg_rtx (v->mode);
4169 /* Unlike reg_iv_type / reg_iv_info, the other three arrays
4170 have been allocated with some slop space, so we may not
4171 actually need to reallocate them. If we do, the following
4172 if statement will be executed just once in this loop. */
4173 if ((unsigned) max_reg_num () > n_times_set->num_elements)
4175 /* Grow all the remaining arrays. */
4176 VARRAY_GROW (set_in_loop, nregs);
4177 VARRAY_GROW (n_times_set, nregs);
4178 VARRAY_GROW (may_not_optimize, nregs);
4181 validate_change (v->insn, &SET_DEST (set), dest_reg, 1);
4182 validate_change (next->insn, next->location, add_val, 1);
4183 if (! apply_change_group ())
4188 next->add_val = add_val;
4189 v->dest_reg = dest_reg;
4190 v->giv_type = DEST_REG;
4191 v->location = &SET_SRC (set);
4193 v->combined_with = 0;
4195 v->derive_adjustment = 0;
4201 v->auto_inc_opt = 0;
4204 v->derived_from = 0;
4205 v->always_computable = 1;
4206 v->always_executed = 1;
4208 v->no_const_addval = 0;
4210 old_regno = REGNO (old_reg);
4211 new_regno = REGNO (dest_reg);
4212 VARRAY_INT (set_in_loop, old_regno)--;
4213 VARRAY_INT (set_in_loop, new_regno) = 1;
4214 VARRAY_INT (n_times_set, old_regno)--;
4215 VARRAY_INT (n_times_set, new_regno) = 1;
4216 VARRAY_CHAR (may_not_optimize, new_regno) = 0;
4218 REG_IV_TYPE (new_regno) = GENERAL_INDUCT;
4219 REG_IV_INFO (new_regno) = v;
4221 /* Remove the increment from the list of biv increments,
4222 and record it as a giv. */
4225 v->next_iv = bl->giv;
4228 v->benefit = rtx_cost (SET_SRC (set), SET);
4229 bl->total_benefit += v->benefit;
4231 /* Now replace the biv with DEST_REG in all insns between
4232 the replaced increment and the next increment, and
4233 remember the last insn that needed a replacement. */
4234 for (last_use_insn = v->insn, p = NEXT_INSN (v->insn);
4236 p = next_insn_in_loop (p, scan_start, end, loop_top))
4240 if (GET_RTX_CLASS (GET_CODE (p)) != 'i')
4242 if (reg_mentioned_p (old_reg, PATTERN (p)))
4245 if (! validate_replace_rtx (old_reg, dest_reg, p))
4248 for (note = REG_NOTES (p); note; note = XEXP (note, 1))
4250 if (GET_CODE (note) == EXPR_LIST)
4252 = replace_rtx (XEXP (note, 0), old_reg, dest_reg);
4256 v->last_use = last_use_insn;
4257 v->lifetime = INSN_LUID (v->insn) - INSN_LUID (last_use_insn);
4258 /* If the lifetime is zero, it means that this register is really
4259 a dead store. So mark this as a giv that can be ignored.
4260 This will not prevent the biv from being eliminated. */
4261 if (v->lifetime == 0)
4266 last_increment_giv = max_reg_num () - 1;
4268 /* Search the loop for general induction variables. */
4270 /* A register is a giv if: it is only set once, it is a function of a
4271 biv and a constant (or invariant), and it is not a biv. */
4273 not_every_iteration = 0;
4279 /* At end of a straight-in loop, we are done.
4280 At end of a loop entered at the bottom, scan the top. */
4281 if (p == scan_start)
4289 if (p == scan_start)
4293 /* Look for a general induction variable in a register. */
4294 if (GET_CODE (p) == INSN
4295 && (set = single_set (p))
4296 && GET_CODE (SET_DEST (set)) == REG
4297 && ! VARRAY_CHAR (may_not_optimize, REGNO (SET_DEST (set))))
4304 rtx last_consec_insn;
4306 dest_reg = SET_DEST (set);
4307 if (REGNO (dest_reg) < FIRST_PSEUDO_REGISTER)
4310 if (/* SET_SRC is a giv. */
4311 (general_induction_var (SET_SRC (set), &src_reg, &add_val,
4312 &mult_val, 0, &benefit)
4313 /* Equivalent expression is a giv. */
4314 || ((regnote = find_reg_note (p, REG_EQUAL, NULL_RTX))
4315 && general_induction_var (XEXP (regnote, 0), &src_reg,
4316 &add_val, &mult_val, 0,
4318 /* Don't try to handle any regs made by loop optimization.
4319 We have nothing on them in regno_first_uid, etc. */
4320 && REGNO (dest_reg) < max_reg_before_loop
4321 /* Don't recognize a BASIC_INDUCT_VAR here. */
4322 && dest_reg != src_reg
4323 /* This must be the only place where the register is set. */
4324 && (VARRAY_INT (n_times_set, REGNO (dest_reg)) == 1
4325 /* or all sets must be consecutive and make a giv. */
4326 || (benefit = consec_sets_giv (benefit, p,
4328 &add_val, &mult_val,
4329 &last_consec_insn))))
4332 = (struct induction *) alloca (sizeof (struct induction));
4334 /* If this is a library call, increase benefit. */
4335 if (find_reg_note (p, REG_RETVAL, NULL_RTX))
4336 benefit += libcall_benefit (p);
4338 /* Skip the consecutive insns, if there are any. */
4339 if (VARRAY_INT (n_times_set, REGNO (dest_reg)) != 1)
4340 p = last_consec_insn;
4342 record_giv (v, p, src_reg, dest_reg, mult_val, add_val, benefit,
4343 DEST_REG, not_every_iteration, NULL_PTR, loop_start,
4349 #ifndef DONT_REDUCE_ADDR
4350 /* Look for givs which are memory addresses. */
4351 /* This resulted in worse code on a VAX 8600. I wonder if it
4353 if (GET_CODE (p) == INSN)
4354 find_mem_givs (PATTERN (p), p, not_every_iteration, loop_start,
4358 /* Update the status of whether giv can derive other givs. This can
4359 change when we pass a label or an insn that updates a biv. */
4360 if (GET_CODE (p) == INSN || GET_CODE (p) == JUMP_INSN
4361 || GET_CODE (p) == CODE_LABEL)
4362 update_giv_derive (p);
4364 /* Past a jump, we get to insns for which we can't count
4365 on whether they will be executed during each iteration. */
4366 /* This code appears twice in strength_reduce. There is also similar
4367 code in scan_loop. */
4368 if (GET_CODE (p) == JUMP_INSN
4369 /* If we enter the loop in the middle, and scan around to the
4370 beginning, don't set not_every_iteration for that.
4371 This can be any kind of jump, since we want to know if insns
4372 will be executed if the loop is executed. */
4373 && ! (JUMP_LABEL (p) == loop_top
4374 && ((NEXT_INSN (NEXT_INSN (p)) == loop_end && simplejump_p (p))
4375 || (NEXT_INSN (p) == loop_end && condjump_p (p)))))
4379 /* If this is a jump outside the loop, then it also doesn't
4380 matter. Check to see if the target of this branch is on the
4381 loop_number_exits_labels list. */
4383 for (label = loop_number_exit_labels[uid_loop_num[INSN_UID (loop_start)]];
4385 label = LABEL_NEXTREF (label))
4386 if (XEXP (label, 0) == JUMP_LABEL (p))
4390 not_every_iteration = 1;
4393 else if (GET_CODE (p) == NOTE)
4395 /* At the virtual top of a converted loop, insns are again known to
4396 be executed each iteration: logically, the loop begins here
4397 even though the exit code has been duplicated.
4399 Insns are also again known to be executed each iteration at
4400 the LOOP_CONT note. */
4401 if ((NOTE_LINE_NUMBER (p) == NOTE_INSN_LOOP_VTOP
4402 || NOTE_LINE_NUMBER (p) == NOTE_INSN_LOOP_CONT)
4404 not_every_iteration = 0;
4405 else if (NOTE_LINE_NUMBER (p) == NOTE_INSN_LOOP_BEG)
4407 else if (NOTE_LINE_NUMBER (p) == NOTE_INSN_LOOP_END)
4411 /* Unlike in the code motion pass where MAYBE_NEVER indicates that
4412 an insn may never be executed, NOT_EVERY_ITERATION indicates whether
4413 or not an insn is known to be executed each iteration of the
4414 loop, whether or not any iterations are known to occur.
4416 Therefore, if we have just passed a label and have no more labels
4417 between here and the test insn of the loop, we know these insns
4418 will be executed each iteration. */
4420 if (not_every_iteration && GET_CODE (p) == CODE_LABEL
4421 && no_labels_between_p (p, loop_end)
4422 && insn_first_p (p, loop_cont))
4423 not_every_iteration = 0;
4426 /* Try to calculate and save the number of loop iterations. This is
4427 set to zero if the actual number can not be calculated. This must
4428 be called after all giv's have been identified, since otherwise it may
4429 fail if the iteration variable is a giv. */
4431 loop_iterations (loop_start, loop_end, loop_info);
4433 /* Now for each giv for which we still don't know whether or not it is
4434 replaceable, check to see if it is replaceable because its final value
4435 can be calculated. This must be done after loop_iterations is called,
4436 so that final_giv_value will work correctly. */
4438 for (bl = loop_iv_list; bl; bl = bl->next)
4440 struct induction *v;
4442 for (v = bl->giv; v; v = v->next_iv)
4443 if (! v->replaceable && ! v->not_replaceable)
4444 check_final_value (v, loop_start, loop_end, loop_info->n_iterations);
4447 /* Try to prove that the loop counter variable (if any) is always
4448 nonnegative; if so, record that fact with a REG_NONNEG note
4449 so that "decrement and branch until zero" insn can be used. */
4450 check_dbra_loop (loop_end, insn_count, loop_start, loop_info);
4452 /* Create reg_map to hold substitutions for replaceable giv regs.
4453 Some givs might have been made from biv increments, so look at
4454 reg_iv_type for a suitable size. */
4455 reg_map_size = reg_iv_type->num_elements;
4456 reg_map = (rtx *) alloca (reg_map_size * sizeof (rtx));
4457 bzero ((char *) reg_map, reg_map_size * sizeof (rtx));
4459 /* Examine each iv class for feasibility of strength reduction/induction
4460 variable elimination. */
4462 for (bl = loop_iv_list; bl; bl = bl->next)
4464 struct induction *v;
4467 rtx final_value = 0;
4470 /* Test whether it will be possible to eliminate this biv
4471 provided all givs are reduced. This is possible if either
4472 the reg is not used outside the loop, or we can compute
4473 what its final value will be.
4475 For architectures with a decrement_and_branch_until_zero insn,
4476 don't do this if we put a REG_NONNEG note on the endtest for
4479 /* Compare against bl->init_insn rather than loop_start.
4480 We aren't concerned with any uses of the biv between
4481 init_insn and loop_start since these won't be affected
4482 by the value of the biv elsewhere in the function, so
4483 long as init_insn doesn't use the biv itself.
4484 March 14, 1989 -- self@bayes.arc.nasa.gov */
4486 if ((uid_luid[REGNO_LAST_UID (bl->regno)] < INSN_LUID (loop_end)
4488 && INSN_UID (bl->init_insn) < max_uid_for_loop
4489 && uid_luid[REGNO_FIRST_UID (bl->regno)] >= INSN_LUID (bl->init_insn)
4490 #ifdef HAVE_decrement_and_branch_until_zero
4493 && ! reg_mentioned_p (bl->biv->dest_reg, SET_SRC (bl->init_set)))
4494 || ((final_value = final_biv_value (bl, loop_start, loop_end,
4495 loop_info->n_iterations))
4496 #ifdef HAVE_decrement_and_branch_until_zero
4500 bl->eliminable = maybe_eliminate_biv (bl, loop_start, end, 0,
4501 threshold, insn_count);
4504 if (loop_dump_stream)
4506 fprintf (loop_dump_stream,
4507 "Cannot eliminate biv %d.\n",
4509 fprintf (loop_dump_stream,
4510 "First use: insn %d, last use: insn %d.\n",
4511 REGNO_FIRST_UID (bl->regno),
4512 REGNO_LAST_UID (bl->regno));
4516 /* Combine all giv's for this iv_class. */
4519 /* This will be true at the end, if all givs which depend on this
4520 biv have been strength reduced.
4521 We can't (currently) eliminate the biv unless this is so. */
4524 /* Check each giv in this class to see if we will benefit by reducing
4525 it. Skip giv's combined with others. */
4526 for (v = bl->giv; v; v = v->next_iv)
4528 struct induction *tv;
4530 if (v->ignore || v->same)
4533 benefit = v->benefit;
4535 /* Reduce benefit if not replaceable, since we will insert
4536 a move-insn to replace the insn that calculates this giv.
4537 Don't do this unless the giv is a user variable, since it
4538 will often be marked non-replaceable because of the duplication
4539 of the exit code outside the loop. In such a case, the copies
4540 we insert are dead and will be deleted. So they don't have
4541 a cost. Similar situations exist. */
4542 /* ??? The new final_[bg]iv_value code does a much better job
4543 of finding replaceable giv's, and hence this code may no longer
4545 if (! v->replaceable && ! bl->eliminable
4546 && REG_USERVAR_P (v->dest_reg))
4547 benefit -= copy_cost;
4549 /* Decrease the benefit to count the add-insns that we will
4550 insert to increment the reduced reg for the giv. */
4551 benefit -= add_cost * bl->biv_count;
4553 /* Decide whether to strength-reduce this giv or to leave the code
4554 unchanged (recompute it from the biv each time it is used).
4555 This decision can be made independently for each giv. */
4558 /* Attempt to guess whether autoincrement will handle some of the
4559 new add insns; if so, increase BENEFIT (undo the subtraction of
4560 add_cost that was done above). */
4561 if (v->giv_type == DEST_ADDR
4562 && GET_CODE (v->mult_val) == CONST_INT)
4564 if (HAVE_POST_INCREMENT
4565 && INTVAL (v->mult_val) == GET_MODE_SIZE (v->mem_mode))
4566 benefit += add_cost * bl->biv_count;
4567 else if (HAVE_PRE_INCREMENT
4568 && INTVAL (v->mult_val) == GET_MODE_SIZE (v->mem_mode))
4569 benefit += add_cost * bl->biv_count;
4570 else if (HAVE_POST_DECREMENT
4571 && -INTVAL (v->mult_val) == GET_MODE_SIZE (v->mem_mode))
4572 benefit += add_cost * bl->biv_count;
4573 else if (HAVE_PRE_DECREMENT
4574 && -INTVAL (v->mult_val) == GET_MODE_SIZE (v->mem_mode))
4575 benefit += add_cost * bl->biv_count;
4579 /* If an insn is not to be strength reduced, then set its ignore
4580 flag, and clear all_reduced. */
4582 /* A giv that depends on a reversed biv must be reduced if it is
4583 used after the loop exit, otherwise, it would have the wrong
4584 value after the loop exit. To make it simple, just reduce all
4585 of such giv's whether or not we know they are used after the loop
4588 if ( ! flag_reduce_all_givs && v->lifetime * threshold * benefit < insn_count
4591 if (loop_dump_stream)
4592 fprintf (loop_dump_stream,
4593 "giv of insn %d not worth while, %d vs %d.\n",
4595 v->lifetime * threshold * benefit, insn_count);
4601 /* Check that we can increment the reduced giv without a
4602 multiply insn. If not, reject it. */
4604 for (tv = bl->biv; tv; tv = tv->next_iv)
4605 if (tv->mult_val == const1_rtx
4606 && ! product_cheap_p (tv->add_val, v->mult_val))
4608 if (loop_dump_stream)
4609 fprintf (loop_dump_stream,
4610 "giv of insn %d: would need a multiply.\n",
4611 INSN_UID (v->insn));
4620 /* XXX Temporary. */
4621 /* Now that we know which givs will be reduced, try to rearrange the
4622 combinations to reduce register pressure.
4623 recombine_givs calls find_life_end, which needs reg_iv_type and
4624 reg_iv_info to be valid for all pseudos. We do the necessary
4625 reallocation here since it allows to check if there are still
4626 more bivs to process. */
4627 nregs = max_reg_num ();
4628 if (nregs > reg_iv_type->num_elements)
4630 /* If there are still more bivs to process, allocate some slack
4631 space so that we're not constantly reallocating these arrays. */
4634 /* Reallocate reg_iv_type and reg_iv_info. */
4635 VARRAY_GROW (reg_iv_type, nregs);
4636 VARRAY_GROW (reg_iv_info, nregs);
4638 recombine_givs (bl, loop_start, loop_end, unroll_p);
4641 /* Reduce each giv that we decided to reduce. */
4643 for (v = bl->giv; v; v = v->next_iv)
4645 struct induction *tv;
4646 if (! v->ignore && v->same == 0)
4648 int auto_inc_opt = 0;
4650 v->new_reg = gen_reg_rtx (v->mode);
4652 if (v->derived_from)
4655 = replace_rtx (PATTERN (v->insn), v->dest_reg, v->new_reg);
4656 if (bl->biv_count != 1)
4658 /* For each place where the biv is incremented, add an
4659 insn to set the new, reduced reg for the giv. */
4660 for (tv = bl->biv; tv; tv = tv->next_iv)
4662 /* We always emit reduced giv increments before the
4663 biv increment when bl->biv_count != 1. So by
4664 emitting the add insns for derived givs after the
4665 biv increment, they pick up the updated value of
4667 emit_insn_after (copy_rtx (PATTERN (v->insn)),
4676 /* If the target has auto-increment addressing modes, and
4677 this is an address giv, then try to put the increment
4678 immediately after its use, so that flow can create an
4679 auto-increment addressing mode. */
4680 if (v->giv_type == DEST_ADDR && bl->biv_count == 1
4681 && bl->biv->always_executed && ! bl->biv->maybe_multiple
4682 /* We don't handle reversed biv's because bl->biv->insn
4683 does not have a valid INSN_LUID. */
4685 && v->always_executed && ! v->maybe_multiple
4686 && INSN_UID (v->insn) < max_uid_for_loop)
4688 /* If other giv's have been combined with this one, then
4689 this will work only if all uses of the other giv's occur
4690 before this giv's insn. This is difficult to check.
4692 We simplify this by looking for the common case where
4693 there is one DEST_REG giv, and this giv's insn is the
4694 last use of the dest_reg of that DEST_REG giv. If the
4695 increment occurs after the address giv, then we can
4696 perform the optimization. (Otherwise, the increment
4697 would have to go before other_giv, and we would not be
4698 able to combine it with the address giv to get an
4699 auto-inc address.) */
4700 if (v->combined_with)
4702 struct induction *other_giv = 0;
4704 for (tv = bl->giv; tv; tv = tv->next_iv)
4712 if (! tv && other_giv
4713 && REGNO (other_giv->dest_reg) < max_reg_before_loop
4714 && (REGNO_LAST_UID (REGNO (other_giv->dest_reg))
4715 == INSN_UID (v->insn))
4716 && INSN_LUID (v->insn) < INSN_LUID (bl->biv->insn))
4719 /* Check for case where increment is before the address
4720 giv. Do this test in "loop order". */
4721 else if ((INSN_LUID (v->insn) > INSN_LUID (bl->biv->insn)
4722 && (INSN_LUID (v->insn) < INSN_LUID (scan_start)
4723 || (INSN_LUID (bl->biv->insn)
4724 > INSN_LUID (scan_start))))
4725 || (INSN_LUID (v->insn) < INSN_LUID (scan_start)
4726 && (INSN_LUID (scan_start)
4727 < INSN_LUID (bl->biv->insn))))
4736 /* We can't put an insn immediately after one setting
4737 cc0, or immediately before one using cc0. */
4738 if ((auto_inc_opt == 1 && sets_cc0_p (PATTERN (v->insn)))
4739 || (auto_inc_opt == -1
4740 && (prev = prev_nonnote_insn (v->insn)) != 0
4741 && GET_RTX_CLASS (GET_CODE (prev)) == 'i'
4742 && sets_cc0_p (PATTERN (prev))))
4748 v->auto_inc_opt = 1;
4752 /* For each place where the biv is incremented, add an insn
4753 to increment the new, reduced reg for the giv. */
4754 for (tv = bl->biv; tv; tv = tv->next_iv)
4759 insert_before = tv->insn;
4760 else if (auto_inc_opt == 1)
4761 insert_before = NEXT_INSN (v->insn);
4763 insert_before = v->insn;
4765 if (tv->mult_val == const1_rtx)
4766 emit_iv_add_mult (tv->add_val, v->mult_val,
4767 v->new_reg, v->new_reg, insert_before);
4768 else /* tv->mult_val == const0_rtx */
4769 /* A multiply is acceptable here
4770 since this is presumed to be seldom executed. */
4771 emit_iv_add_mult (tv->add_val, v->mult_val,
4772 v->add_val, v->new_reg, insert_before);
4775 /* Add code at loop start to initialize giv's reduced reg. */
4777 emit_iv_add_mult (bl->initial_value, v->mult_val,
4778 v->add_val, v->new_reg, loop_start);
4782 /* Rescan all givs. If a giv is the same as a giv not reduced, mark it
4785 For each giv register that can be reduced now: if replaceable,
4786 substitute reduced reg wherever the old giv occurs;
4787 else add new move insn "giv_reg = reduced_reg".
4789 Also check for givs whose first use is their definition and whose
4790 last use is the definition of another giv. If so, it is likely
4791 dead and should not be used to eliminate a biv. */
4792 for (v = bl->giv; v; v = v->next_iv)
4794 if (v->same && v->same->ignore)
4802 struct induction *v1;
4804 for (v1 = bl->giv; v1; v1 = v1->next_iv)
4805 if (v->last_use == v1->insn)
4808 else if (v->giv_type == DEST_REG
4809 && REGNO_FIRST_UID (REGNO (v->dest_reg)) == INSN_UID (v->insn))
4811 struct induction *v1;
4813 for (v1 = bl->giv; v1; v1 = v1->next_iv)
4814 if (REGNO_LAST_UID (REGNO (v->dest_reg)) == INSN_UID (v1->insn))
4818 /* Update expression if this was combined, in case other giv was
4821 v->new_reg = replace_rtx (v->new_reg,
4822 v->same->dest_reg, v->same->new_reg);
4824 if (v->giv_type == DEST_ADDR)
4825 /* Store reduced reg as the address in the memref where we found
4827 validate_change (v->insn, v->location, v->new_reg, 0);
4828 else if (v->replaceable)
4830 reg_map[REGNO (v->dest_reg)] = v->new_reg;
4833 /* I can no longer duplicate the original problem. Perhaps
4834 this is unnecessary now? */
4836 /* Replaceable; it isn't strictly necessary to delete the old
4837 insn and emit a new one, because v->dest_reg is now dead.
4839 However, especially when unrolling loops, the special
4840 handling for (set REG0 REG1) in the second cse pass may
4841 make v->dest_reg live again. To avoid this problem, emit
4842 an insn to set the original giv reg from the reduced giv.
4843 We can not delete the original insn, since it may be part
4844 of a LIBCALL, and the code in flow that eliminates dead
4845 libcalls will fail if it is deleted. */
4846 emit_insn_after (gen_move_insn (v->dest_reg, v->new_reg),
4852 /* Not replaceable; emit an insn to set the original giv reg from
4853 the reduced giv, same as above. */
4854 emit_insn_after (gen_move_insn (v->dest_reg, v->new_reg),
4858 /* When a loop is reversed, givs which depend on the reversed
4859 biv, and which are live outside the loop, must be set to their
4860 correct final value. This insn is only needed if the giv is
4861 not replaceable. The correct final value is the same as the
4862 value that the giv starts the reversed loop with. */
4863 if (bl->reversed && ! v->replaceable)
4864 emit_iv_add_mult (bl->initial_value, v->mult_val,
4865 v->add_val, v->dest_reg, end_insert_before);
4866 else if (v->final_value)
4870 /* If the loop has multiple exits, emit the insn before the
4871 loop to ensure that it will always be executed no matter
4872 how the loop exits. Otherwise, emit the insn after the loop,
4873 since this is slightly more efficient. */
4874 if (loop_number_exit_count[uid_loop_num[INSN_UID (loop_start)]])
4875 insert_before = loop_start;
4877 insert_before = end_insert_before;
4878 emit_insn_before (gen_move_insn (v->dest_reg, v->final_value),
4882 /* If the insn to set the final value of the giv was emitted
4883 before the loop, then we must delete the insn inside the loop
4884 that sets it. If this is a LIBCALL, then we must delete
4885 every insn in the libcall. Note, however, that
4886 final_giv_value will only succeed when there are multiple
4887 exits if the giv is dead at each exit, hence it does not
4888 matter that the original insn remains because it is dead
4890 /* Delete the insn inside the loop that sets the giv since
4891 the giv is now set before (or after) the loop. */
4892 delete_insn (v->insn);
4896 if (loop_dump_stream)
4898 fprintf (loop_dump_stream, "giv at %d reduced to ",
4899 INSN_UID (v->insn));
4900 print_rtl (loop_dump_stream, v->new_reg);
4901 fprintf (loop_dump_stream, "\n");
4905 /* All the givs based on the biv bl have been reduced if they
4908 /* For each giv not marked as maybe dead that has been combined with a
4909 second giv, clear any "maybe dead" mark on that second giv.
4910 v->new_reg will either be or refer to the register of the giv it
4913 Doing this clearing avoids problems in biv elimination where a
4914 giv's new_reg is a complex value that can't be put in the insn but
4915 the giv combined with (with a reg as new_reg) is marked maybe_dead.
4916 Since the register will be used in either case, we'd prefer it be
4917 used from the simpler giv. */
4919 for (v = bl->giv; v; v = v->next_iv)
4920 if (! v->maybe_dead && v->same)
4921 v->same->maybe_dead = 0;
4923 /* Try to eliminate the biv, if it is a candidate.
4924 This won't work if ! all_reduced,
4925 since the givs we planned to use might not have been reduced.
4927 We have to be careful that we didn't initially think we could eliminate
4928 this biv because of a giv that we now think may be dead and shouldn't
4929 be used as a biv replacement.
4931 Also, there is the possibility that we may have a giv that looks
4932 like it can be used to eliminate a biv, but the resulting insn
4933 isn't valid. This can happen, for example, on the 88k, where a
4934 JUMP_INSN can compare a register only with zero. Attempts to
4935 replace it with a compare with a constant will fail.
4937 Note that in cases where this call fails, we may have replaced some
4938 of the occurrences of the biv with a giv, but no harm was done in
4939 doing so in the rare cases where it can occur. */
4941 if (all_reduced == 1 && bl->eliminable
4942 && maybe_eliminate_biv (bl, loop_start, end, 1,
4943 threshold, insn_count))
4946 /* ?? If we created a new test to bypass the loop entirely,
4947 or otherwise drop straight in, based on this test, then
4948 we might want to rewrite it also. This way some later
4949 pass has more hope of removing the initialization of this
4952 /* If final_value != 0, then the biv may be used after loop end
4953 and we must emit an insn to set it just in case.
4955 Reversed bivs already have an insn after the loop setting their
4956 value, so we don't need another one. We can't calculate the
4957 proper final value for such a biv here anyways. */
4958 if (final_value != 0 && ! bl->reversed)
4962 /* If the loop has multiple exits, emit the insn before the
4963 loop to ensure that it will always be executed no matter
4964 how the loop exits. Otherwise, emit the insn after the
4965 loop, since this is slightly more efficient. */
4966 if (loop_number_exit_count[uid_loop_num[INSN_UID (loop_start)]])
4967 insert_before = loop_start;
4969 insert_before = end_insert_before;
4971 emit_insn_before (gen_move_insn (bl->biv->dest_reg, final_value),
4976 /* Delete all of the instructions inside the loop which set
4977 the biv, as they are all dead. If is safe to delete them,
4978 because an insn setting a biv will never be part of a libcall. */
4979 /* However, deleting them will invalidate the regno_last_uid info,
4980 so keeping them around is more convenient. Final_biv_value
4981 will only succeed when there are multiple exits if the biv
4982 is dead at each exit, hence it does not matter that the original
4983 insn remains, because it is dead anyways. */
4984 for (v = bl->biv; v; v = v->next_iv)
4985 delete_insn (v->insn);
4988 if (loop_dump_stream)
4989 fprintf (loop_dump_stream, "Reg %d: biv eliminated\n",
4994 /* Go through all the instructions in the loop, making all the
4995 register substitutions scheduled in REG_MAP. */
4997 for (p = loop_start; p != end; p = NEXT_INSN (p))
4998 if (GET_CODE (p) == INSN || GET_CODE (p) == JUMP_INSN
4999 || GET_CODE (p) == CALL_INSN)
5001 replace_regs (PATTERN (p), reg_map, reg_map_size, 0);
5002 replace_regs (REG_NOTES (p), reg_map, reg_map_size, 0);
5006 /* Unroll loops from within strength reduction so that we can use the
5007 induction variable information that strength_reduce has already
5011 unroll_loop (loop_end, insn_count, loop_start, end_insert_before,
5014 #ifdef HAVE_decrement_and_branch_on_count
5015 /* Instrument the loop with BCT insn. */
5016 if (HAVE_decrement_and_branch_on_count && bct_p
5017 && flag_branch_on_count_reg)
5018 insert_bct (loop_start, loop_end, loop_info);
5019 #endif /* HAVE_decrement_and_branch_on_count */
5021 if (loop_dump_stream)
5022 fprintf (loop_dump_stream, "\n");
5023 VARRAY_FREE (reg_iv_type);
5024 VARRAY_FREE (reg_iv_info);
5027 /* Return 1 if X is a valid source for an initial value (or as value being
5028 compared against in an initial test).
5030 X must be either a register or constant and must not be clobbered between
5031 the current insn and the start of the loop.
5033 INSN is the insn containing X. */
5036 valid_initial_value_p (x, insn, call_seen, loop_start)
5045 /* Only consider pseudos we know about initialized in insns whose luids
5047 if (GET_CODE (x) != REG
5048 || REGNO (x) >= max_reg_before_loop)
5051 /* Don't use call-clobbered registers across a call which clobbers it. On
5052 some machines, don't use any hard registers at all. */
5053 if (REGNO (x) < FIRST_PSEUDO_REGISTER
5054 && (SMALL_REGISTER_CLASSES
5055 || (call_used_regs[REGNO (x)] && call_seen)))
5058 /* Don't use registers that have been clobbered before the start of the
5060 if (reg_set_between_p (x, insn, loop_start))
5066 /* Scan X for memory refs and check each memory address
5067 as a possible giv. INSN is the insn whose pattern X comes from.
5068 NOT_EVERY_ITERATION is 1 if the insn might not be executed during
5069 every loop iteration. */
5072 find_mem_givs (x, insn, not_every_iteration, loop_start, loop_end)
5075 int not_every_iteration;
5076 rtx loop_start, loop_end;
5079 register enum rtx_code code;
5085 code = GET_CODE (x);
5109 /* This code used to disable creating GIVs with mult_val == 1 and
5110 add_val == 0. However, this leads to lost optimizations when
5111 it comes time to combine a set of related DEST_ADDR GIVs, since
5112 this one would not be seen. */
5114 if (general_induction_var (XEXP (x, 0), &src_reg, &add_val,
5115 &mult_val, 1, &benefit))
5117 /* Found one; record it. */
5119 = (struct induction *) oballoc (sizeof (struct induction));
5121 record_giv (v, insn, src_reg, addr_placeholder, mult_val,
5122 add_val, benefit, DEST_ADDR, not_every_iteration,
5123 &XEXP (x, 0), loop_start, loop_end);
5125 v->mem_mode = GET_MODE (x);
5134 /* Recursively scan the subexpressions for other mem refs. */
5136 fmt = GET_RTX_FORMAT (code);
5137 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
5139 find_mem_givs (XEXP (x, i), insn, not_every_iteration, loop_start,
5141 else if (fmt[i] == 'E')
5142 for (j = 0; j < XVECLEN (x, i); j++)
5143 find_mem_givs (XVECEXP (x, i, j), insn, not_every_iteration,
5144 loop_start, loop_end);
5147 /* Fill in the data about one biv update.
5148 V is the `struct induction' in which we record the biv. (It is
5149 allocated by the caller, with alloca.)
5150 INSN is the insn that sets it.
5151 DEST_REG is the biv's reg.
5153 MULT_VAL is const1_rtx if the biv is being incremented here, in which case
5154 INC_VAL is the increment. Otherwise, MULT_VAL is const0_rtx and the biv is
5155 being set to INC_VAL.
5157 NOT_EVERY_ITERATION is nonzero if this biv update is not know to be
5158 executed every iteration; MAYBE_MULTIPLE is nonzero if this biv update
5159 can be executed more than once per iteration. If MAYBE_MULTIPLE
5160 and NOT_EVERY_ITERATION are both zero, we know that the biv update is
5161 executed exactly once per iteration. */
5164 record_biv (v, insn, dest_reg, inc_val, mult_val, location,
5165 not_every_iteration, maybe_multiple)
5166 struct induction *v;
5172 int not_every_iteration;
5175 struct iv_class *bl;
5178 v->src_reg = dest_reg;
5179 v->dest_reg = dest_reg;
5180 v->mult_val = mult_val;
5181 v->add_val = inc_val;
5182 v->location = location;
5183 v->mode = GET_MODE (dest_reg);
5184 v->always_computable = ! not_every_iteration;
5185 v->always_executed = ! not_every_iteration;
5186 v->maybe_multiple = maybe_multiple;
5188 /* Add this to the reg's iv_class, creating a class
5189 if this is the first incrementation of the reg. */
5191 bl = reg_biv_class[REGNO (dest_reg)];
5194 /* Create and initialize new iv_class. */
5196 bl = (struct iv_class *) oballoc (sizeof (struct iv_class));
5198 bl->regno = REGNO (dest_reg);
5204 /* Set initial value to the reg itself. */
5205 bl->initial_value = dest_reg;
5206 /* We haven't seen the initializing insn yet */
5209 bl->initial_test = 0;
5210 bl->incremented = 0;
5214 bl->total_benefit = 0;
5216 /* Add this class to loop_iv_list. */
5217 bl->next = loop_iv_list;
5220 /* Put it in the array of biv register classes. */
5221 reg_biv_class[REGNO (dest_reg)] = bl;
5224 /* Update IV_CLASS entry for this biv. */
5225 v->next_iv = bl->biv;
5228 if (mult_val == const1_rtx)
5229 bl->incremented = 1;
5231 if (loop_dump_stream)
5233 fprintf (loop_dump_stream,
5234 "Insn %d: possible biv, reg %d,",
5235 INSN_UID (insn), REGNO (dest_reg));
5236 if (GET_CODE (inc_val) == CONST_INT)
5238 fprintf (loop_dump_stream, " const =");
5239 fprintf (loop_dump_stream, HOST_WIDE_INT_PRINT_DEC, INTVAL (inc_val));
5240 fputc ('\n', loop_dump_stream);
5244 fprintf (loop_dump_stream, " const = ");
5245 print_rtl (loop_dump_stream, inc_val);
5246 fprintf (loop_dump_stream, "\n");
5251 /* Fill in the data about one giv.
5252 V is the `struct induction' in which we record the giv. (It is
5253 allocated by the caller, with alloca.)
5254 INSN is the insn that sets it.
5255 BENEFIT estimates the savings from deleting this insn.
5256 TYPE is DEST_REG or DEST_ADDR; it says whether the giv is computed
5257 into a register or is used as a memory address.
5259 SRC_REG is the biv reg which the giv is computed from.
5260 DEST_REG is the giv's reg (if the giv is stored in a reg).
5261 MULT_VAL and ADD_VAL are the coefficients used to compute the giv.
5262 LOCATION points to the place where this giv's value appears in INSN. */
5265 record_giv (v, insn, src_reg, dest_reg, mult_val, add_val, benefit,
5266 type, not_every_iteration, location, loop_start, loop_end)
5267 struct induction *v;
5271 rtx mult_val, add_val;
5274 int not_every_iteration;
5276 rtx loop_start, loop_end;
5278 struct induction *b;
5279 struct iv_class *bl;
5280 rtx set = single_set (insn);
5283 v->src_reg = src_reg;
5285 v->dest_reg = dest_reg;
5286 v->mult_val = mult_val;
5287 v->add_val = add_val;
5288 v->benefit = benefit;
5289 v->location = location;
5291 v->combined_with = 0;
5292 v->maybe_multiple = 0;
5294 v->derive_adjustment = 0;
5300 v->auto_inc_opt = 0;
5303 v->derived_from = 0;
5306 /* The v->always_computable field is used in update_giv_derive, to
5307 determine whether a giv can be used to derive another giv. For a
5308 DEST_REG giv, INSN computes a new value for the giv, so its value
5309 isn't computable if INSN insn't executed every iteration.
5310 However, for a DEST_ADDR giv, INSN merely uses the value of the giv;
5311 it does not compute a new value. Hence the value is always computable
5312 regardless of whether INSN is executed each iteration. */
5314 if (type == DEST_ADDR)
5315 v->always_computable = 1;
5317 v->always_computable = ! not_every_iteration;
5319 v->always_executed = ! not_every_iteration;
5321 if (type == DEST_ADDR)
5323 v->mode = GET_MODE (*location);
5326 else /* type == DEST_REG */
5328 v->mode = GET_MODE (SET_DEST (set));
5330 v->lifetime = (uid_luid[REGNO_LAST_UID (REGNO (dest_reg))]
5331 - uid_luid[REGNO_FIRST_UID (REGNO (dest_reg))]);
5333 /* If the lifetime is zero, it means that this register is
5334 really a dead store. So mark this as a giv that can be
5335 ignored. This will not prevent the biv from being eliminated. */
5336 if (v->lifetime == 0)
5339 REG_IV_TYPE (REGNO (dest_reg)) = GENERAL_INDUCT;
5340 REG_IV_INFO (REGNO (dest_reg)) = v;
5343 /* Add the giv to the class of givs computed from one biv. */
5345 bl = reg_biv_class[REGNO (src_reg)];
5348 v->next_iv = bl->giv;
5350 /* Don't count DEST_ADDR. This is supposed to count the number of
5351 insns that calculate givs. */
5352 if (type == DEST_REG)
5354 bl->total_benefit += benefit;
5357 /* Fatal error, biv missing for this giv? */
5360 if (type == DEST_ADDR)
5364 /* The giv can be replaced outright by the reduced register only if all
5365 of the following conditions are true:
5366 - the insn that sets the giv is always executed on any iteration
5367 on which the giv is used at all
5368 (there are two ways to deduce this:
5369 either the insn is executed on every iteration,
5370 or all uses follow that insn in the same basic block),
5371 - the giv is not used outside the loop
5372 - no assignments to the biv occur during the giv's lifetime. */
5374 if (REGNO_FIRST_UID (REGNO (dest_reg)) == INSN_UID (insn)
5375 /* Previous line always fails if INSN was moved by loop opt. */
5376 && uid_luid[REGNO_LAST_UID (REGNO (dest_reg))] < INSN_LUID (loop_end)
5377 && (! not_every_iteration
5378 || last_use_this_basic_block (dest_reg, insn)))
5380 /* Now check that there are no assignments to the biv within the
5381 giv's lifetime. This requires two separate checks. */
5383 /* Check each biv update, and fail if any are between the first
5384 and last use of the giv.
5386 If this loop contains an inner loop that was unrolled, then
5387 the insn modifying the biv may have been emitted by the loop
5388 unrolling code, and hence does not have a valid luid. Just
5389 mark the biv as not replaceable in this case. It is not very
5390 useful as a biv, because it is used in two different loops.
5391 It is very unlikely that we would be able to optimize the giv
5392 using this biv anyways. */
5395 for (b = bl->biv; b; b = b->next_iv)
5397 if (INSN_UID (b->insn) >= max_uid_for_loop
5398 || ((uid_luid[INSN_UID (b->insn)]
5399 >= uid_luid[REGNO_FIRST_UID (REGNO (dest_reg))])
5400 && (uid_luid[INSN_UID (b->insn)]
5401 <= uid_luid[REGNO_LAST_UID (REGNO (dest_reg))])))
5404 v->not_replaceable = 1;
5409 /* If there are any backwards branches that go from after the
5410 biv update to before it, then this giv is not replaceable. */
5412 for (b = bl->biv; b; b = b->next_iv)
5413 if (back_branch_in_range_p (b->insn, loop_start, loop_end))
5416 v->not_replaceable = 1;
5422 /* May still be replaceable, we don't have enough info here to
5425 v->not_replaceable = 0;
5429 /* Record whether the add_val contains a const_int, for later use by
5434 v->no_const_addval = 1;
5435 if (tem == const0_rtx)
5437 else if (GET_CODE (tem) == CONST_INT)
5438 v->no_const_addval = 0;
5439 else if (GET_CODE (tem) == PLUS)
5443 if (GET_CODE (XEXP (tem, 0)) == PLUS)
5444 tem = XEXP (tem, 0);
5445 else if (GET_CODE (XEXP (tem, 1)) == PLUS)
5446 tem = XEXP (tem, 1);
5450 if (GET_CODE (XEXP (tem, 1)) == CONST_INT)
5451 v->no_const_addval = 0;
5455 if (loop_dump_stream)
5457 if (type == DEST_REG)
5458 fprintf (loop_dump_stream, "Insn %d: giv reg %d",
5459 INSN_UID (insn), REGNO (dest_reg));
5461 fprintf (loop_dump_stream, "Insn %d: dest address",
5464 fprintf (loop_dump_stream, " src reg %d benefit %d",
5465 REGNO (src_reg), v->benefit);
5466 fprintf (loop_dump_stream, " lifetime %d",
5470 fprintf (loop_dump_stream, " replaceable");
5472 if (v->no_const_addval)
5473 fprintf (loop_dump_stream, " ncav");
5475 if (GET_CODE (mult_val) == CONST_INT)
5477 fprintf (loop_dump_stream, " mult ");
5478 fprintf (loop_dump_stream, HOST_WIDE_INT_PRINT_DEC, INTVAL (mult_val));
5482 fprintf (loop_dump_stream, " mult ");
5483 print_rtl (loop_dump_stream, mult_val);
5486 if (GET_CODE (add_val) == CONST_INT)
5488 fprintf (loop_dump_stream, " add ");
5489 fprintf (loop_dump_stream, HOST_WIDE_INT_PRINT_DEC, INTVAL (add_val));
5493 fprintf (loop_dump_stream, " add ");
5494 print_rtl (loop_dump_stream, add_val);
5498 if (loop_dump_stream)
5499 fprintf (loop_dump_stream, "\n");
5504 /* All this does is determine whether a giv can be made replaceable because
5505 its final value can be calculated. This code can not be part of record_giv
5506 above, because final_giv_value requires that the number of loop iterations
5507 be known, and that can not be accurately calculated until after all givs
5508 have been identified. */
5511 check_final_value (v, loop_start, loop_end, n_iterations)
5512 struct induction *v;
5513 rtx loop_start, loop_end;
5514 unsigned HOST_WIDE_INT n_iterations;
5516 struct iv_class *bl;
5517 rtx final_value = 0;
5519 bl = reg_biv_class[REGNO (v->src_reg)];
5521 /* DEST_ADDR givs will never reach here, because they are always marked
5522 replaceable above in record_giv. */
5524 /* The giv can be replaced outright by the reduced register only if all
5525 of the following conditions are true:
5526 - the insn that sets the giv is always executed on any iteration
5527 on which the giv is used at all
5528 (there are two ways to deduce this:
5529 either the insn is executed on every iteration,
5530 or all uses follow that insn in the same basic block),
5531 - its final value can be calculated (this condition is different
5532 than the one above in record_giv)
5533 - no assignments to the biv occur during the giv's lifetime. */
5536 /* This is only called now when replaceable is known to be false. */
5537 /* Clear replaceable, so that it won't confuse final_giv_value. */
5541 if ((final_value = final_giv_value (v, loop_start, loop_end, n_iterations))
5542 && (v->always_computable || last_use_this_basic_block (v->dest_reg, v->insn)))
5544 int biv_increment_seen = 0;
5550 /* When trying to determine whether or not a biv increment occurs
5551 during the lifetime of the giv, we can ignore uses of the variable
5552 outside the loop because final_value is true. Hence we can not
5553 use regno_last_uid and regno_first_uid as above in record_giv. */
5555 /* Search the loop to determine whether any assignments to the
5556 biv occur during the giv's lifetime. Start with the insn
5557 that sets the giv, and search around the loop until we come
5558 back to that insn again.
5560 Also fail if there is a jump within the giv's lifetime that jumps
5561 to somewhere outside the lifetime but still within the loop. This
5562 catches spaghetti code where the execution order is not linear, and
5563 hence the above test fails. Here we assume that the giv lifetime
5564 does not extend from one iteration of the loop to the next, so as
5565 to make the test easier. Since the lifetime isn't known yet,
5566 this requires two loops. See also record_giv above. */
5568 last_giv_use = v->insn;
5574 p = NEXT_INSN (loop_start);
5578 if (GET_CODE (p) == INSN || GET_CODE (p) == JUMP_INSN
5579 || GET_CODE (p) == CALL_INSN)
5581 if (biv_increment_seen)
5583 if (reg_mentioned_p (v->dest_reg, PATTERN (p)))
5586 v->not_replaceable = 1;
5590 else if (reg_set_p (v->src_reg, PATTERN (p)))
5591 biv_increment_seen = 1;
5592 else if (reg_mentioned_p (v->dest_reg, PATTERN (p)))
5597 /* Now that the lifetime of the giv is known, check for branches
5598 from within the lifetime to outside the lifetime if it is still
5608 p = NEXT_INSN (loop_start);
5609 if (p == last_giv_use)
5612 if (GET_CODE (p) == JUMP_INSN && JUMP_LABEL (p)
5613 && LABEL_NAME (JUMP_LABEL (p))
5614 && ((INSN_UID (JUMP_LABEL (p)) >= max_uid_for_loop)
5615 || (INSN_UID (v->insn) >= max_uid_for_loop)
5616 || (INSN_UID (last_giv_use) >= max_uid_for_loop)
5617 || (INSN_LUID (JUMP_LABEL (p)) < INSN_LUID (v->insn)
5618 && INSN_LUID (JUMP_LABEL (p)) > INSN_LUID (loop_start))
5619 || (INSN_LUID (JUMP_LABEL (p)) > INSN_LUID (last_giv_use)
5620 && INSN_LUID (JUMP_LABEL (p)) < INSN_LUID (loop_end))))
5623 v->not_replaceable = 1;
5625 if (loop_dump_stream)
5626 fprintf (loop_dump_stream,
5627 "Found branch outside giv lifetime.\n");
5634 /* If it is replaceable, then save the final value. */
5636 v->final_value = final_value;
5639 if (loop_dump_stream && v->replaceable)
5640 fprintf (loop_dump_stream, "Insn %d: giv reg %d final_value replaceable\n",
5641 INSN_UID (v->insn), REGNO (v->dest_reg));
5644 /* Update the status of whether a giv can derive other givs.
5646 We need to do something special if there is or may be an update to the biv
5647 between the time the giv is defined and the time it is used to derive
5650 In addition, a giv that is only conditionally set is not allowed to
5651 derive another giv once a label has been passed.
5653 The cases we look at are when a label or an update to a biv is passed. */
5656 update_giv_derive (p)
5659 struct iv_class *bl;
5660 struct induction *biv, *giv;
5664 /* Search all IV classes, then all bivs, and finally all givs.
5666 There are three cases we are concerned with. First we have the situation
5667 of a giv that is only updated conditionally. In that case, it may not
5668 derive any givs after a label is passed.
5670 The second case is when a biv update occurs, or may occur, after the
5671 definition of a giv. For certain biv updates (see below) that are
5672 known to occur between the giv definition and use, we can adjust the
5673 giv definition. For others, or when the biv update is conditional,
5674 we must prevent the giv from deriving any other givs. There are two
5675 sub-cases within this case.
5677 If this is a label, we are concerned with any biv update that is done
5678 conditionally, since it may be done after the giv is defined followed by
5679 a branch here (actually, we need to pass both a jump and a label, but
5680 this extra tracking doesn't seem worth it).
5682 If this is a jump, we are concerned about any biv update that may be
5683 executed multiple times. We are actually only concerned about
5684 backward jumps, but it is probably not worth performing the test
5685 on the jump again here.
5687 If this is a biv update, we must adjust the giv status to show that a
5688 subsequent biv update was performed. If this adjustment cannot be done,
5689 the giv cannot derive further givs. */
5691 for (bl = loop_iv_list; bl; bl = bl->next)
5692 for (biv = bl->biv; biv; biv = biv->next_iv)
5693 if (GET_CODE (p) == CODE_LABEL || GET_CODE (p) == JUMP_INSN
5696 for (giv = bl->giv; giv; giv = giv->next_iv)
5698 /* If cant_derive is already true, there is no point in
5699 checking all of these conditions again. */
5700 if (giv->cant_derive)
5703 /* If this giv is conditionally set and we have passed a label,
5704 it cannot derive anything. */
5705 if (GET_CODE (p) == CODE_LABEL && ! giv->always_computable)
5706 giv->cant_derive = 1;
5708 /* Skip givs that have mult_val == 0, since
5709 they are really invariants. Also skip those that are
5710 replaceable, since we know their lifetime doesn't contain
5712 else if (giv->mult_val == const0_rtx || giv->replaceable)
5715 /* The only way we can allow this giv to derive another
5716 is if this is a biv increment and we can form the product
5717 of biv->add_val and giv->mult_val. In this case, we will
5718 be able to compute a compensation. */
5719 else if (biv->insn == p)
5723 if (biv->mult_val == const1_rtx)
5724 tem = simplify_giv_expr (gen_rtx_MULT (giv->mode,
5729 if (tem && giv->derive_adjustment)
5730 tem = simplify_giv_expr (gen_rtx_PLUS (giv->mode, tem,
5731 giv->derive_adjustment),
5734 giv->derive_adjustment = tem;
5736 giv->cant_derive = 1;
5738 else if ((GET_CODE (p) == CODE_LABEL && ! biv->always_computable)
5739 || (GET_CODE (p) == JUMP_INSN && biv->maybe_multiple))
5740 giv->cant_derive = 1;
5745 /* Check whether an insn is an increment legitimate for a basic induction var.
5746 X is the source of insn P, or a part of it.
5747 MODE is the mode in which X should be interpreted.
5749 DEST_REG is the putative biv, also the destination of the insn.
5750 We accept patterns of these forms:
5751 REG = REG + INVARIANT (includes REG = REG - CONSTANT)
5752 REG = INVARIANT + REG
5754 If X is suitable, we return 1, set *MULT_VAL to CONST1_RTX,
5755 store the additive term into *INC_VAL, and store the place where
5756 we found the additive term into *LOCATION.
5758 If X is an assignment of an invariant into DEST_REG, we set
5759 *MULT_VAL to CONST0_RTX, and store the invariant into *INC_VAL.
5761 We also want to detect a BIV when it corresponds to a variable
5762 whose mode was promoted via PROMOTED_MODE. In that case, an increment
5763 of the variable may be a PLUS that adds a SUBREG of that variable to
5764 an invariant and then sign- or zero-extends the result of the PLUS
5767 Most GIVs in such cases will be in the promoted mode, since that is the
5768 probably the natural computation mode (and almost certainly the mode
5769 used for addresses) on the machine. So we view the pseudo-reg containing
5770 the variable as the BIV, as if it were simply incremented.
5772 Note that treating the entire pseudo as a BIV will result in making
5773 simple increments to any GIVs based on it. However, if the variable
5774 overflows in its declared mode but not its promoted mode, the result will
5775 be incorrect. This is acceptable if the variable is signed, since
5776 overflows in such cases are undefined, but not if it is unsigned, since
5777 those overflows are defined. So we only check for SIGN_EXTEND and
5780 If we cannot find a biv, we return 0. */
5783 basic_induction_var (x, mode, dest_reg, p, inc_val, mult_val, location)
5785 enum machine_mode mode;
5792 register enum rtx_code code;
5796 code = GET_CODE (x);
5800 if (rtx_equal_p (XEXP (x, 0), dest_reg)
5801 || (GET_CODE (XEXP (x, 0)) == SUBREG
5802 && SUBREG_PROMOTED_VAR_P (XEXP (x, 0))
5803 && SUBREG_REG (XEXP (x, 0)) == dest_reg))
5805 argp = &XEXP (x, 1);
5807 else if (rtx_equal_p (XEXP (x, 1), dest_reg)
5808 || (GET_CODE (XEXP (x, 1)) == SUBREG
5809 && SUBREG_PROMOTED_VAR_P (XEXP (x, 1))
5810 && SUBREG_REG (XEXP (x, 1)) == dest_reg))
5812 argp = &XEXP (x, 0);
5818 if (invariant_p (arg) != 1)
5821 *inc_val = convert_modes (GET_MODE (dest_reg), GET_MODE (x), arg, 0);
5822 *mult_val = const1_rtx;
5827 /* If this is a SUBREG for a promoted variable, check the inner
5829 if (SUBREG_PROMOTED_VAR_P (x))
5830 return basic_induction_var (SUBREG_REG (x), GET_MODE (SUBREG_REG (x)),
5831 dest_reg, p, inc_val, mult_val, location);
5835 /* If this register is assigned in a previous insn, look at its
5836 source, but don't go outside the loop or past a label. */
5842 insn = PREV_INSN (insn);
5843 } while (insn && GET_CODE (insn) == NOTE
5844 && NOTE_LINE_NUMBER (insn) != NOTE_INSN_LOOP_BEG);
5848 set = single_set (insn);
5852 if ((SET_DEST (set) == x
5853 || (GET_CODE (SET_DEST (set)) == SUBREG
5854 && (GET_MODE_SIZE (GET_MODE (SET_DEST (set)))
5856 && SUBREG_REG (SET_DEST (set)) == x))
5857 && basic_induction_var (SET_SRC (set),
5858 (GET_MODE (SET_SRC (set)) == VOIDmode
5860 : GET_MODE (SET_SRC (set))),
5862 inc_val, mult_val, location))
5865 /* ... fall through ... */
5867 /* Can accept constant setting of biv only when inside inner most loop.
5868 Otherwise, a biv of an inner loop may be incorrectly recognized
5869 as a biv of the outer loop,
5870 causing code to be moved INTO the inner loop. */
5872 if (invariant_p (x) != 1)
5877 /* convert_modes aborts if we try to convert to or from CCmode, so just
5878 exclude that case. It is very unlikely that a condition code value
5879 would be a useful iterator anyways. */
5880 if (loops_enclosed == 1
5881 && GET_MODE_CLASS (mode) != MODE_CC
5882 && GET_MODE_CLASS (GET_MODE (dest_reg)) != MODE_CC)
5884 /* Possible bug here? Perhaps we don't know the mode of X. */
5885 *inc_val = convert_modes (GET_MODE (dest_reg), mode, x, 0);
5886 *mult_val = const0_rtx;
5893 return basic_induction_var (XEXP (x, 0), GET_MODE (XEXP (x, 0)),
5894 dest_reg, p, inc_val, mult_val, location);
5897 /* Similar, since this can be a sign extension. */
5898 for (insn = PREV_INSN (p);
5899 (insn && GET_CODE (insn) == NOTE
5900 && NOTE_LINE_NUMBER (insn) != NOTE_INSN_LOOP_BEG);
5901 insn = PREV_INSN (insn))
5905 set = single_set (insn);
5907 if (set && SET_DEST (set) == XEXP (x, 0)
5908 && GET_CODE (XEXP (x, 1)) == CONST_INT
5909 && INTVAL (XEXP (x, 1)) >= 0
5910 && GET_CODE (SET_SRC (set)) == ASHIFT
5911 && XEXP (x, 1) == XEXP (SET_SRC (set), 1))
5912 return basic_induction_var (XEXP (SET_SRC (set), 0),
5913 GET_MODE (XEXP (x, 0)),
5914 dest_reg, insn, inc_val, mult_val,
5923 /* A general induction variable (giv) is any quantity that is a linear
5924 function of a basic induction variable,
5925 i.e. giv = biv * mult_val + add_val.
5926 The coefficients can be any loop invariant quantity.
5927 A giv need not be computed directly from the biv;
5928 it can be computed by way of other givs. */
5930 /* Determine whether X computes a giv.
5931 If it does, return a nonzero value
5932 which is the benefit from eliminating the computation of X;
5933 set *SRC_REG to the register of the biv that it is computed from;
5934 set *ADD_VAL and *MULT_VAL to the coefficients,
5935 such that the value of X is biv * mult + add; */
5938 general_induction_var (x, src_reg, add_val, mult_val, is_addr, pbenefit)
5949 /* If this is an invariant, forget it, it isn't a giv. */
5950 if (invariant_p (x) == 1)
5953 /* See if the expression could be a giv and get its form.
5954 Mark our place on the obstack in case we don't find a giv. */
5955 storage = (char *) oballoc (0);
5957 x = simplify_giv_expr (x, pbenefit);
5964 switch (GET_CODE (x))
5968 /* Since this is now an invariant and wasn't before, it must be a giv
5969 with MULT_VAL == 0. It doesn't matter which BIV we associate this
5971 *src_reg = loop_iv_list->biv->dest_reg;
5972 *mult_val = const0_rtx;
5977 /* This is equivalent to a BIV. */
5979 *mult_val = const1_rtx;
5980 *add_val = const0_rtx;
5984 /* Either (plus (biv) (invar)) or
5985 (plus (mult (biv) (invar_1)) (invar_2)). */
5986 if (GET_CODE (XEXP (x, 0)) == MULT)
5988 *src_reg = XEXP (XEXP (x, 0), 0);
5989 *mult_val = XEXP (XEXP (x, 0), 1);
5993 *src_reg = XEXP (x, 0);
5994 *mult_val = const1_rtx;
5996 *add_val = XEXP (x, 1);
6000 /* ADD_VAL is zero. */
6001 *src_reg = XEXP (x, 0);
6002 *mult_val = XEXP (x, 1);
6003 *add_val = const0_rtx;
6010 /* Remove any enclosing USE from ADD_VAL and MULT_VAL (there will be
6011 unless they are CONST_INT). */
6012 if (GET_CODE (*add_val) == USE)
6013 *add_val = XEXP (*add_val, 0);
6014 if (GET_CODE (*mult_val) == USE)
6015 *mult_val = XEXP (*mult_val, 0);
6020 *pbenefit += ADDRESS_COST (orig_x) - reg_address_cost;
6022 *pbenefit += rtx_cost (orig_x, MEM) - reg_address_cost;
6026 *pbenefit += rtx_cost (orig_x, SET);
6028 /* Always return true if this is a giv so it will be detected as such,
6029 even if the benefit is zero or negative. This allows elimination
6030 of bivs that might otherwise not be eliminated. */
6034 /* Given an expression, X, try to form it as a linear function of a biv.
6035 We will canonicalize it to be of the form
6036 (plus (mult (BIV) (invar_1))
6038 with possible degeneracies.
6040 The invariant expressions must each be of a form that can be used as a
6041 machine operand. We surround then with a USE rtx (a hack, but localized
6042 and certainly unambiguous!) if not a CONST_INT for simplicity in this
6043 routine; it is the caller's responsibility to strip them.
6045 If no such canonicalization is possible (i.e., two biv's are used or an
6046 expression that is neither invariant nor a biv or giv), this routine
6049 For a non-zero return, the result will have a code of CONST_INT, USE,
6050 REG (for a BIV), PLUS, or MULT. No other codes will occur.
6052 *BENEFIT will be incremented by the benefit of any sub-giv encountered. */
6054 static rtx sge_plus PROTO ((enum machine_mode, rtx, rtx));
6055 static rtx sge_plus_constant PROTO ((rtx, rtx));
6058 simplify_giv_expr (x, benefit)
6062 enum machine_mode mode = GET_MODE (x);
6066 /* If this is not an integer mode, or if we cannot do arithmetic in this
6067 mode, this can't be a giv. */
6068 if (mode != VOIDmode
6069 && (GET_MODE_CLASS (mode) != MODE_INT
6070 || GET_MODE_BITSIZE (mode) > HOST_BITS_PER_WIDE_INT))
6073 switch (GET_CODE (x))
6076 arg0 = simplify_giv_expr (XEXP (x, 0), benefit);
6077 arg1 = simplify_giv_expr (XEXP (x, 1), benefit);
6078 if (arg0 == 0 || arg1 == 0)
6081 /* Put constant last, CONST_INT last if both constant. */
6082 if ((GET_CODE (arg0) == USE
6083 || GET_CODE (arg0) == CONST_INT)
6084 && ! ((GET_CODE (arg0) == USE
6085 && GET_CODE (arg1) == USE)
6086 || GET_CODE (arg1) == CONST_INT))
6087 tem = arg0, arg0 = arg1, arg1 = tem;
6089 /* Handle addition of zero, then addition of an invariant. */
6090 if (arg1 == const0_rtx)
6092 else if (GET_CODE (arg1) == CONST_INT || GET_CODE (arg1) == USE)
6093 switch (GET_CODE (arg0))
6097 /* Adding two invariants must result in an invariant, so enclose
6098 addition operation inside a USE and return it. */
6099 if (GET_CODE (arg0) == USE)
6100 arg0 = XEXP (arg0, 0);
6101 if (GET_CODE (arg1) == USE)
6102 arg1 = XEXP (arg1, 0);
6104 if (GET_CODE (arg0) == CONST_INT)
6105 tem = arg0, arg0 = arg1, arg1 = tem;
6106 if (GET_CODE (arg1) == CONST_INT)
6107 tem = sge_plus_constant (arg0, arg1);
6109 tem = sge_plus (mode, arg0, arg1);
6111 if (GET_CODE (tem) != CONST_INT)
6112 tem = gen_rtx_USE (mode, tem);
6117 /* biv + invar or mult + invar. Return sum. */
6118 return gen_rtx_PLUS (mode, arg0, arg1);
6121 /* (a + invar_1) + invar_2. Associate. */
6122 return simplify_giv_expr (
6123 gen_rtx_PLUS (mode, XEXP (arg0, 0),
6124 gen_rtx_PLUS (mode, XEXP (arg0, 1), arg1)),
6131 /* Each argument must be either REG, PLUS, or MULT. Convert REG to
6132 MULT to reduce cases. */
6133 if (GET_CODE (arg0) == REG)
6134 arg0 = gen_rtx_MULT (mode, arg0, const1_rtx);
6135 if (GET_CODE (arg1) == REG)
6136 arg1 = gen_rtx_MULT (mode, arg1, const1_rtx);
6138 /* Now have PLUS + PLUS, PLUS + MULT, MULT + PLUS, or MULT + MULT.
6139 Put a MULT first, leaving PLUS + PLUS, MULT + PLUS, or MULT + MULT.
6140 Recurse to associate the second PLUS. */
6141 if (GET_CODE (arg1) == MULT)
6142 tem = arg0, arg0 = arg1, arg1 = tem;
6144 if (GET_CODE (arg1) == PLUS)
6145 return simplify_giv_expr (gen_rtx_PLUS (mode,
6146 gen_rtx_PLUS (mode, arg0,
6151 /* Now must have MULT + MULT. Distribute if same biv, else not giv. */
6152 if (GET_CODE (arg0) != MULT || GET_CODE (arg1) != MULT)
6155 if (!rtx_equal_p (arg0, arg1))
6158 return simplify_giv_expr (gen_rtx_MULT (mode,
6166 /* Handle "a - b" as "a + b * (-1)". */
6167 return simplify_giv_expr (gen_rtx_PLUS (mode,
6169 gen_rtx_MULT (mode, XEXP (x, 1),
6174 arg0 = simplify_giv_expr (XEXP (x, 0), benefit);
6175 arg1 = simplify_giv_expr (XEXP (x, 1), benefit);
6176 if (arg0 == 0 || arg1 == 0)
6179 /* Put constant last, CONST_INT last if both constant. */
6180 if ((GET_CODE (arg0) == USE || GET_CODE (arg0) == CONST_INT)
6181 && GET_CODE (arg1) != CONST_INT)
6182 tem = arg0, arg0 = arg1, arg1 = tem;
6184 /* If second argument is not now constant, not giv. */
6185 if (GET_CODE (arg1) != USE && GET_CODE (arg1) != CONST_INT)
6188 /* Handle multiply by 0 or 1. */
6189 if (arg1 == const0_rtx)
6192 else if (arg1 == const1_rtx)
6195 switch (GET_CODE (arg0))
6198 /* biv * invar. Done. */
6199 return gen_rtx_MULT (mode, arg0, arg1);
6202 /* Product of two constants. */
6203 return GEN_INT (INTVAL (arg0) * INTVAL (arg1));
6206 /* invar * invar. It is a giv, but very few of these will
6207 actually pay off, so limit to simple registers. */
6208 if (GET_CODE (arg1) != CONST_INT)
6211 arg0 = XEXP (arg0, 0);
6212 if (GET_CODE (arg0) == REG)
6213 tem = gen_rtx_MULT (mode, arg0, arg1);
6214 else if (GET_CODE (arg0) == MULT
6215 && GET_CODE (XEXP (arg0, 0)) == REG
6216 && GET_CODE (XEXP (arg0, 1)) == CONST_INT)
6218 tem = gen_rtx_MULT (mode, XEXP (arg0, 0),
6219 GEN_INT (INTVAL (XEXP (arg0, 1))
6224 return gen_rtx_USE (mode, tem);
6227 /* (a * invar_1) * invar_2. Associate. */
6228 return simplify_giv_expr (gen_rtx_MULT (mode, XEXP (arg0, 0),
6235 /* (a + invar_1) * invar_2. Distribute. */
6236 return simplify_giv_expr (gen_rtx_PLUS (mode,
6250 /* Shift by constant is multiply by power of two. */
6251 if (GET_CODE (XEXP (x, 1)) != CONST_INT)
6254 return simplify_giv_expr (gen_rtx_MULT (mode,
6256 GEN_INT ((HOST_WIDE_INT) 1
6257 << INTVAL (XEXP (x, 1)))),
6261 /* "-a" is "a * (-1)" */
6262 return simplify_giv_expr (gen_rtx_MULT (mode, XEXP (x, 0), constm1_rtx),
6266 /* "~a" is "-a - 1". Silly, but easy. */
6267 return simplify_giv_expr (gen_rtx_MINUS (mode,
6268 gen_rtx_NEG (mode, XEXP (x, 0)),
6273 /* Already in proper form for invariant. */
6277 /* If this is a new register, we can't deal with it. */
6278 if (REGNO (x) >= max_reg_before_loop)
6281 /* Check for biv or giv. */
6282 switch (REG_IV_TYPE (REGNO (x)))
6286 case GENERAL_INDUCT:
6288 struct induction *v = REG_IV_INFO (REGNO (x));
6290 /* Form expression from giv and add benefit. Ensure this giv
6291 can derive another and subtract any needed adjustment if so. */
6292 *benefit += v->benefit;
6296 tem = gen_rtx_PLUS (mode, gen_rtx_MULT (mode, v->src_reg,
6299 if (v->derive_adjustment)
6300 tem = gen_rtx_MINUS (mode, tem, v->derive_adjustment);
6301 return simplify_giv_expr (tem, benefit);
6305 /* If it isn't an induction variable, and it is invariant, we
6306 may be able to simplify things further by looking through
6307 the bits we just moved outside the loop. */
6308 if (invariant_p (x) == 1)
6312 for (m = the_movables; m ; m = m->next)
6313 if (rtx_equal_p (x, m->set_dest))
6315 /* Ok, we found a match. Substitute and simplify. */
6317 /* If we match another movable, we must use that, as
6318 this one is going away. */
6320 return simplify_giv_expr (m->match->set_dest, benefit);
6322 /* If consec is non-zero, this is a member of a group of
6323 instructions that were moved together. We handle this
6324 case only to the point of seeking to the last insn and
6325 looking for a REG_EQUAL. Fail if we don't find one. */
6330 do { tem = NEXT_INSN (tem); } while (--i > 0);
6332 tem = find_reg_note (tem, REG_EQUAL, NULL_RTX);
6334 tem = XEXP (tem, 0);
6338 tem = single_set (m->insn);
6340 tem = SET_SRC (tem);
6345 /* What we are most interested in is pointer
6346 arithmetic on invariants -- only take
6347 patterns we may be able to do something with. */
6348 if (GET_CODE (tem) == PLUS
6349 || GET_CODE (tem) == MULT
6350 || GET_CODE (tem) == ASHIFT
6351 || GET_CODE (tem) == CONST_INT
6352 || GET_CODE (tem) == SYMBOL_REF)
6354 tem = simplify_giv_expr (tem, benefit);
6358 else if (GET_CODE (tem) == CONST
6359 && GET_CODE (XEXP (tem, 0)) == PLUS
6360 && GET_CODE (XEXP (XEXP (tem, 0), 0)) == SYMBOL_REF
6361 && GET_CODE (XEXP (XEXP (tem, 0), 1)) == CONST_INT)
6363 tem = simplify_giv_expr (XEXP (tem, 0), benefit);
6374 /* Fall through to general case. */
6376 /* If invariant, return as USE (unless CONST_INT).
6377 Otherwise, not giv. */
6378 if (GET_CODE (x) == USE)
6381 if (invariant_p (x) == 1)
6383 if (GET_CODE (x) == CONST_INT)
6385 if (GET_CODE (x) == CONST
6386 && GET_CODE (XEXP (x, 0)) == PLUS
6387 && GET_CODE (XEXP (XEXP (x, 0), 0)) == SYMBOL_REF
6388 && GET_CODE (XEXP (XEXP (x, 0), 1)) == CONST_INT)
6390 return gen_rtx_USE (mode, x);
6397 /* This routine folds invariants such that there is only ever one
6398 CONST_INT in the summation. It is only used by simplify_giv_expr. */
6401 sge_plus_constant (x, c)
6404 if (GET_CODE (x) == CONST_INT)
6405 return GEN_INT (INTVAL (x) + INTVAL (c));
6406 else if (GET_CODE (x) != PLUS)
6407 return gen_rtx_PLUS (GET_MODE (x), x, c);
6408 else if (GET_CODE (XEXP (x, 1)) == CONST_INT)
6410 return gen_rtx_PLUS (GET_MODE (x), XEXP (x, 0),
6411 GEN_INT (INTVAL (XEXP (x, 1)) + INTVAL (c)));
6413 else if (GET_CODE (XEXP (x, 0)) == PLUS
6414 || GET_CODE (XEXP (x, 1)) != PLUS)
6416 return gen_rtx_PLUS (GET_MODE (x),
6417 sge_plus_constant (XEXP (x, 0), c), XEXP (x, 1));
6421 return gen_rtx_PLUS (GET_MODE (x),
6422 sge_plus_constant (XEXP (x, 1), c), XEXP (x, 0));
6427 sge_plus (mode, x, y)
6428 enum machine_mode mode;
6431 while (GET_CODE (y) == PLUS)
6433 rtx a = XEXP (y, 0);
6434 if (GET_CODE (a) == CONST_INT)
6435 x = sge_plus_constant (x, a);
6437 x = gen_rtx_PLUS (mode, x, a);
6440 if (GET_CODE (y) == CONST_INT)
6441 x = sge_plus_constant (x, y);
6443 x = gen_rtx_PLUS (mode, x, y);
6447 /* Help detect a giv that is calculated by several consecutive insns;
6451 The caller has already identified the first insn P as having a giv as dest;
6452 we check that all other insns that set the same register follow
6453 immediately after P, that they alter nothing else,
6454 and that the result of the last is still a giv.
6456 The value is 0 if the reg set in P is not really a giv.
6457 Otherwise, the value is the amount gained by eliminating
6458 all the consecutive insns that compute the value.
6460 FIRST_BENEFIT is the amount gained by eliminating the first insn, P.
6461 SRC_REG is the reg of the biv; DEST_REG is the reg of the giv.
6463 The coefficients of the ultimate giv value are stored in
6464 *MULT_VAL and *ADD_VAL. */
6467 consec_sets_giv (first_benefit, p, src_reg, dest_reg,
6468 add_val, mult_val, last_consec_insn)
6475 rtx *last_consec_insn;
6483 /* Indicate that this is a giv so that we can update the value produced in
6484 each insn of the multi-insn sequence.
6486 This induction structure will be used only by the call to
6487 general_induction_var below, so we can allocate it on our stack.
6488 If this is a giv, our caller will replace the induct var entry with
6489 a new induction structure. */
6491 = (struct induction *) alloca (sizeof (struct induction));
6492 v->src_reg = src_reg;
6493 v->mult_val = *mult_val;
6494 v->add_val = *add_val;
6495 v->benefit = first_benefit;
6497 v->derive_adjustment = 0;
6499 REG_IV_TYPE (REGNO (dest_reg)) = GENERAL_INDUCT;
6500 REG_IV_INFO (REGNO (dest_reg)) = v;
6502 count = VARRAY_INT (n_times_set, REGNO (dest_reg)) - 1;
6507 code = GET_CODE (p);
6509 /* If libcall, skip to end of call sequence. */
6510 if (code == INSN && (temp = find_reg_note (p, REG_LIBCALL, NULL_RTX)))
6514 && (set = single_set (p))
6515 && GET_CODE (SET_DEST (set)) == REG
6516 && SET_DEST (set) == dest_reg
6517 && (general_induction_var (SET_SRC (set), &src_reg,
6518 add_val, mult_val, 0, &benefit)
6519 /* Giv created by equivalent expression. */
6520 || ((temp = find_reg_note (p, REG_EQUAL, NULL_RTX))
6521 && general_induction_var (XEXP (temp, 0), &src_reg,
6522 add_val, mult_val, 0, &benefit)))
6523 && src_reg == v->src_reg)
6525 if (find_reg_note (p, REG_RETVAL, NULL_RTX))
6526 benefit += libcall_benefit (p);
6529 v->mult_val = *mult_val;
6530 v->add_val = *add_val;
6531 v->benefit = benefit;
6533 else if (code != NOTE)
6535 /* Allow insns that set something other than this giv to a
6536 constant. Such insns are needed on machines which cannot
6537 include long constants and should not disqualify a giv. */
6539 && (set = single_set (p))
6540 && SET_DEST (set) != dest_reg
6541 && CONSTANT_P (SET_SRC (set)))
6544 REG_IV_TYPE (REGNO (dest_reg)) = UNKNOWN_INDUCT;
6549 *last_consec_insn = p;
6553 /* Return an rtx, if any, that expresses giv G2 as a function of the register
6554 represented by G1. If no such expression can be found, or it is clear that
6555 it cannot possibly be a valid address, 0 is returned.
6557 To perform the computation, we note that
6560 where `v' is the biv.
6562 So G2 = (y/b) * G1 + (b - a*y/x).
6564 Note that MULT = y/x.
6566 Update: A and B are now allowed to be additive expressions such that
6567 B contains all variables in A. That is, computing B-A will not require
6568 subtracting variables. */
6571 express_from_1 (a, b, mult)
6574 /* If MULT is zero, then A*MULT is zero, and our expression is B. */
6576 if (mult == const0_rtx)
6579 /* If MULT is not 1, we cannot handle A with non-constants, since we
6580 would then be required to subtract multiples of the registers in A.
6581 This is theoretically possible, and may even apply to some Fortran
6582 constructs, but it is a lot of work and we do not attempt it here. */
6584 if (mult != const1_rtx && GET_CODE (a) != CONST_INT)
6587 /* In general these structures are sorted top to bottom (down the PLUS
6588 chain), but not left to right across the PLUS. If B is a higher
6589 order giv than A, we can strip one level and recurse. If A is higher
6590 order, we'll eventually bail out, but won't know that until the end.
6591 If they are the same, we'll strip one level around this loop. */
6593 while (GET_CODE (a) == PLUS && GET_CODE (b) == PLUS)
6595 rtx ra, rb, oa, ob, tmp;
6597 ra = XEXP (a, 0), oa = XEXP (a, 1);
6598 if (GET_CODE (ra) == PLUS)
6599 tmp = ra, ra = oa, oa = tmp;
6601 rb = XEXP (b, 0), ob = XEXP (b, 1);
6602 if (GET_CODE (rb) == PLUS)
6603 tmp = rb, rb = ob, ob = tmp;
6605 if (rtx_equal_p (ra, rb))
6606 /* We matched: remove one reg completely. */
6608 else if (GET_CODE (ob) != PLUS && rtx_equal_p (ra, ob))
6609 /* An alternate match. */
6611 else if (GET_CODE (oa) != PLUS && rtx_equal_p (oa, rb))
6612 /* An alternate match. */
6616 /* Indicates an extra register in B. Strip one level from B and
6617 recurse, hoping B was the higher order expression. */
6618 ob = express_from_1 (a, ob, mult);
6621 return gen_rtx_PLUS (GET_MODE (b), rb, ob);
6625 /* Here we are at the last level of A, go through the cases hoping to
6626 get rid of everything but a constant. */
6628 if (GET_CODE (a) == PLUS)
6632 ra = XEXP (a, 0), oa = XEXP (a, 1);
6633 if (rtx_equal_p (oa, b))
6635 else if (!rtx_equal_p (ra, b))
6638 if (GET_CODE (oa) != CONST_INT)
6641 return GEN_INT (-INTVAL (oa) * INTVAL (mult));
6643 else if (GET_CODE (a) == CONST_INT)
6645 return plus_constant (b, -INTVAL (a) * INTVAL (mult));
6647 else if (GET_CODE (b) == PLUS)
6649 if (rtx_equal_p (a, XEXP (b, 0)))
6651 else if (rtx_equal_p (a, XEXP (b, 1)))
6656 else if (rtx_equal_p (a, b))
6663 express_from (g1, g2)
6664 struct induction *g1, *g2;
6668 /* The value that G1 will be multiplied by must be a constant integer. Also,
6669 the only chance we have of getting a valid address is if b*c/a (see above
6670 for notation) is also an integer. */
6671 if (GET_CODE (g1->mult_val) == CONST_INT
6672 && GET_CODE (g2->mult_val) == CONST_INT)
6674 if (g1->mult_val == const0_rtx
6675 || INTVAL (g2->mult_val) % INTVAL (g1->mult_val) != 0)
6677 mult = GEN_INT (INTVAL (g2->mult_val) / INTVAL (g1->mult_val));
6679 else if (rtx_equal_p (g1->mult_val, g2->mult_val))
6683 /* ??? Find out if the one is a multiple of the other? */
6687 add = express_from_1 (g1->add_val, g2->add_val, mult);
6688 if (add == NULL_RTX)
6691 /* Form simplified final result. */
6692 if (mult == const0_rtx)
6694 else if (mult == const1_rtx)
6695 mult = g1->dest_reg;
6697 mult = gen_rtx_MULT (g2->mode, g1->dest_reg, mult);
6699 if (add == const0_rtx)
6703 if (GET_CODE (add) == PLUS
6704 && CONSTANT_P (XEXP (add, 1)))
6706 rtx tem = XEXP (add, 1);
6707 mult = gen_rtx_PLUS (g2->mode, mult, XEXP (add, 0));
6711 return gen_rtx_PLUS (g2->mode, mult, add);
6716 /* Return an rtx, if any, that expresses giv G2 as a function of the register
6717 represented by G1. This indicates that G2 should be combined with G1 and
6718 that G2 can use (either directly or via an address expression) a register
6719 used to represent G1. */
6722 combine_givs_p (g1, g2)
6723 struct induction *g1, *g2;
6725 rtx tem = express_from (g1, g2);
6727 /* If these givs are identical, they can be combined. We use the results
6728 of express_from because the addends are not in a canonical form, so
6729 rtx_equal_p is a weaker test. */
6730 /* But don't combine a DEST_REG giv with a DEST_ADDR giv; we want the
6731 combination to be the other way round. */
6732 if (tem == g1->dest_reg
6733 && (g1->giv_type == DEST_REG || g2->giv_type == DEST_ADDR))
6735 return g1->dest_reg;
6738 /* If G2 can be expressed as a function of G1 and that function is valid
6739 as an address and no more expensive than using a register for G2,
6740 the expression of G2 in terms of G1 can be used. */
6742 && g2->giv_type == DEST_ADDR
6743 && memory_address_p (g2->mem_mode, tem)
6744 /* ??? Looses, especially with -fforce-addr, where *g2->location
6745 will always be a register, and so anything more complicated
6749 && ADDRESS_COST (tem) <= ADDRESS_COST (*g2->location)
6751 && rtx_cost (tem, MEM) <= rtx_cost (*g2->location, MEM)
6762 struct combine_givs_stats
6769 cmp_combine_givs_stats (x, y)
6770 struct combine_givs_stats *x, *y;
6773 d = y->total_benefit - x->total_benefit;
6774 /* Stabilize the sort. */
6776 d = x->giv_number - y->giv_number;
6780 /* Check all pairs of givs for iv_class BL and see if any can be combined with
6781 any other. If so, point SAME to the giv combined with and set NEW_REG to
6782 be an expression (in terms of the other giv's DEST_REG) equivalent to the
6783 giv. Also, update BENEFIT and related fields for cost/benefit analysis. */
6787 struct iv_class *bl;
6789 /* Additional benefit to add for being combined multiple times. */
6790 const int extra_benefit = 3;
6792 struct induction *g1, *g2, **giv_array;
6793 int i, j, k, giv_count;
6794 struct combine_givs_stats *stats;
6797 /* Count givs, because bl->giv_count is incorrect here. */
6799 for (g1 = bl->giv; g1; g1 = g1->next_iv)
6804 = (struct induction **) alloca (giv_count * sizeof (struct induction *));
6806 for (g1 = bl->giv; g1; g1 = g1->next_iv)
6808 giv_array[i++] = g1;
6810 stats = (struct combine_givs_stats *) alloca (giv_count * sizeof (*stats));
6811 bzero ((char *) stats, giv_count * sizeof (*stats));
6813 can_combine = (rtx *) alloca (giv_count * giv_count * sizeof(rtx));
6814 bzero ((char *) can_combine, giv_count * giv_count * sizeof(rtx));
6816 for (i = 0; i < giv_count; i++)
6822 stats[i].giv_number = i;
6824 /* If a DEST_REG GIV is used only once, do not allow it to combine
6825 with anything, for in doing so we will gain nothing that cannot
6826 be had by simply letting the GIV with which we would have combined
6827 to be reduced on its own. The losage shows up in particular with
6828 DEST_ADDR targets on hosts with reg+reg addressing, though it can
6829 be seen elsewhere as well. */
6830 if (g1->giv_type == DEST_REG
6831 && (single_use = VARRAY_RTX (reg_single_usage, REGNO (g1->dest_reg)))
6832 && single_use != const0_rtx)
6835 this_benefit = g1->benefit;
6836 /* Add an additional weight for zero addends. */
6837 if (g1->no_const_addval)
6840 for (j = 0; j < giv_count; j++)
6846 && (this_combine = combine_givs_p (g1, g2)) != NULL_RTX)
6848 can_combine[i*giv_count + j] = this_combine;
6849 this_benefit += g2->benefit + extra_benefit;
6852 stats[i].total_benefit = this_benefit;
6855 /* Iterate, combining until we can't. */
6857 qsort (stats, giv_count, sizeof(*stats), cmp_combine_givs_stats);
6859 if (loop_dump_stream)
6861 fprintf (loop_dump_stream, "Sorted combine statistics:\n");
6862 for (k = 0; k < giv_count; k++)
6864 g1 = giv_array[stats[k].giv_number];
6865 if (!g1->combined_with && !g1->same)
6866 fprintf (loop_dump_stream, " {%d, %d}",
6867 INSN_UID (giv_array[stats[k].giv_number]->insn),
6868 stats[k].total_benefit);
6870 putc ('\n', loop_dump_stream);
6873 for (k = 0; k < giv_count; k++)
6875 int g1_add_benefit = 0;
6877 i = stats[k].giv_number;
6880 /* If it has already been combined, skip. */
6881 if (g1->combined_with || g1->same)
6884 for (j = 0; j < giv_count; j++)
6887 if (g1 != g2 && can_combine[i*giv_count + j]
6888 /* If it has already been combined, skip. */
6889 && ! g2->same && ! g2->combined_with)
6893 g2->new_reg = can_combine[i*giv_count + j];
6895 g1->combined_with++;
6896 g1->lifetime += g2->lifetime;
6898 g1_add_benefit += g2->benefit;
6900 /* ??? The new final_[bg]iv_value code does a much better job
6901 of finding replaceable giv's, and hence this code may no
6902 longer be necessary. */
6903 if (! g2->replaceable && REG_USERVAR_P (g2->dest_reg))
6904 g1_add_benefit -= copy_cost;
6906 /* To help optimize the next set of combinations, remove
6907 this giv from the benefits of other potential mates. */
6908 for (l = 0; l < giv_count; ++l)
6910 int m = stats[l].giv_number;
6911 if (can_combine[m*giv_count + j])
6912 stats[l].total_benefit -= g2->benefit + extra_benefit;
6915 if (loop_dump_stream)
6916 fprintf (loop_dump_stream,
6917 "giv at %d combined with giv at %d\n",
6918 INSN_UID (g2->insn), INSN_UID (g1->insn));
6922 /* To help optimize the next set of combinations, remove
6923 this giv from the benefits of other potential mates. */
6924 if (g1->combined_with)
6926 for (j = 0; j < giv_count; ++j)
6928 int m = stats[j].giv_number;
6929 if (can_combine[m*giv_count + j])
6930 stats[j].total_benefit -= g1->benefit + extra_benefit;
6933 g1->benefit += g1_add_benefit;
6935 /* We've finished with this giv, and everything it touched.
6936 Restart the combination so that proper weights for the
6937 rest of the givs are properly taken into account. */
6938 /* ??? Ideally we would compact the arrays at this point, so
6939 as to not cover old ground. But sanely compacting
6940 can_combine is tricky. */
6946 struct recombine_givs_stats
6949 int start_luid, end_luid;
6952 /* Used below as comparison function for qsort. We want a ascending luid
6953 when scanning the array starting at the end, thus the arguments are
6956 cmp_recombine_givs_stats (x, y)
6957 struct recombine_givs_stats *x, *y;
6960 d = y->start_luid - x->start_luid;
6961 /* Stabilize the sort. */
6963 d = y->giv_number - x->giv_number;
6967 /* Scan X, which is a part of INSN, for the end of life of a giv. Also
6968 look for the start of life of a giv where the start has not been seen
6969 yet to unlock the search for the end of its life.
6970 Only consider givs that belong to BIV.
6971 Return the total number of lifetime ends that have been found. */
6973 find_life_end (x, stats, insn, biv)
6975 struct recombine_givs_stats *stats;
6982 code = GET_CODE (x);
6987 rtx reg = SET_DEST (x);
6988 if (GET_CODE (reg) == REG)
6990 int regno = REGNO (reg);
6991 struct induction *v = REG_IV_INFO (regno);
6993 if (REG_IV_TYPE (regno) == GENERAL_INDUCT
6995 && v->src_reg == biv
6996 && stats[v->ix].end_luid <= 0)
6998 /* If we see a 0 here for end_luid, it means that we have
6999 scanned the entire loop without finding any use at all.
7000 We must not predicate this code on a start_luid match
7001 since that would make the test fail for givs that have
7002 been hoisted out of inner loops. */
7003 if (stats[v->ix].end_luid == 0)
7005 stats[v->ix].end_luid = stats[v->ix].start_luid;
7006 return 1 + find_life_end (SET_SRC (x), stats, insn, biv);
7008 else if (stats[v->ix].start_luid == INSN_LUID (insn))
7009 stats[v->ix].end_luid = 0;
7011 return find_life_end (SET_SRC (x), stats, insn, biv);
7017 int regno = REGNO (x);
7018 struct induction *v = REG_IV_INFO (regno);
7020 if (REG_IV_TYPE (regno) == GENERAL_INDUCT
7022 && v->src_reg == biv
7023 && stats[v->ix].end_luid == 0)
7025 while (INSN_UID (insn) >= max_uid_for_loop)
7026 insn = NEXT_INSN (insn);
7027 stats[v->ix].end_luid = INSN_LUID (insn);
7040 fmt = GET_RTX_FORMAT (code);
7042 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
7045 retval += find_life_end (XEXP (x, i), stats, insn, biv);
7047 else if (fmt[i] == 'E')
7048 for (j = XVECLEN (x, i) - 1; j >= 0; j--)
7049 retval += find_life_end (XVECEXP (x, i, j), stats, insn, biv);
7054 /* For each giv that has been combined with another, look if
7055 we can combine it with the most recently used one instead.
7056 This tends to shorten giv lifetimes, and helps the next step:
7057 try to derive givs from other givs. */
7059 recombine_givs (bl, loop_start, loop_end, unroll_p)
7060 struct iv_class *bl;
7061 rtx loop_start, loop_end;
7064 struct induction *v, **giv_array, *last_giv;
7065 struct recombine_givs_stats *stats;
7068 int ends_need_computing;
7070 for (giv_count = 0, v = bl->giv; v; v = v->next_iv)
7076 = (struct induction **) alloca (giv_count * sizeof (struct induction *));
7077 stats = (struct recombine_givs_stats *) alloca (giv_count * sizeof *stats);
7079 /* Initialize stats and set up the ix field for each giv in stats to name
7080 the corresponding index into stats. */
7081 for (i = 0, v = bl->giv; v; v = v->next_iv)
7088 stats[i].giv_number = i;
7089 /* If this giv has been hoisted out of an inner loop, use the luid of
7090 the previous insn. */
7091 for (p = v->insn; INSN_UID (p) >= max_uid_for_loop; )
7093 stats[i].start_luid = INSN_LUID (p);
7098 qsort (stats, giv_count, sizeof(*stats), cmp_recombine_givs_stats);
7100 /* Do the actual most-recently-used recombination. */
7101 for (last_giv = 0, i = giv_count - 1; i >= 0; i--)
7103 v = giv_array[stats[i].giv_number];
7106 struct induction *old_same = v->same;
7109 /* combine_givs_p actually says if we can make this transformation.
7110 The other tests are here only to avoid keeping a giv alive
7111 that could otherwise be eliminated. */
7113 && ((old_same->maybe_dead && ! old_same->combined_with)
7114 || ! last_giv->maybe_dead
7115 || last_giv->combined_with)
7116 && (new_combine = combine_givs_p (last_giv, v)))
7118 old_same->combined_with--;
7119 v->new_reg = new_combine;
7121 last_giv->combined_with++;
7122 /* No need to update lifetimes / benefits here since we have
7123 already decided what to reduce. */
7125 if (loop_dump_stream)
7127 fprintf (loop_dump_stream,
7128 "giv at %d recombined with giv at %d as ",
7129 INSN_UID (v->insn), INSN_UID (last_giv->insn));
7130 print_rtl (loop_dump_stream, v->new_reg);
7131 putc ('\n', loop_dump_stream);
7137 else if (v->giv_type != DEST_REG)
7140 || (last_giv->maybe_dead && ! last_giv->combined_with)
7142 || v->combined_with)
7146 ends_need_computing = 0;
7147 /* For each DEST_REG giv, compute lifetime starts, and try to compute
7148 lifetime ends from regscan info. */
7149 for (i = 0, v = bl->giv; v; v = v->next_iv)
7153 if (v->giv_type == DEST_ADDR)
7155 /* Loop unrolling of an inner loop can even create new DEST_REG
7158 for (p = v->insn; INSN_UID (p) >= max_uid_for_loop; )
7160 stats[i].start_luid = stats[i].end_luid = INSN_LUID (p);
7162 stats[i].end_luid++;
7164 else /* v->giv_type == DEST_REG */
7168 stats[i].start_luid = INSN_LUID (v->insn);
7169 stats[i].end_luid = INSN_LUID (v->last_use);
7171 else if (INSN_UID (v->insn) >= max_uid_for_loop)
7174 /* This insn has been created by loop optimization on an inner
7175 loop. We don't have a proper start_luid that will match
7176 when we see the first set. But we do know that there will
7177 be no use before the set, so we can set end_luid to 0 so that
7178 we'll start looking for the last use right away. */
7179 for (p = PREV_INSN (v->insn); INSN_UID (p) >= max_uid_for_loop; )
7181 stats[i].start_luid = INSN_LUID (p);
7182 stats[i].end_luid = 0;
7183 ends_need_computing++;
7187 int regno = REGNO (v->dest_reg);
7188 int count = VARRAY_INT (n_times_set, regno) - 1;
7191 /* Find the first insn that sets the giv, so that we can verify
7192 if this giv's lifetime wraps around the loop. We also need
7193 the luid of the first setting insn in order to detect the
7194 last use properly. */
7197 p = prev_nonnote_insn (p);
7198 if (reg_set_p (v->dest_reg, p))
7202 stats[i].start_luid = INSN_LUID (p);
7203 if (stats[i].start_luid > uid_luid[REGNO_FIRST_UID (regno)])
7205 stats[i].end_luid = -1;
7206 ends_need_computing++;
7210 stats[i].end_luid = uid_luid[REGNO_LAST_UID (regno)];
7211 if (stats[i].end_luid > INSN_LUID (loop_end))
7213 stats[i].end_luid = -1;
7214 ends_need_computing++;
7222 /* If the regscan information was unconclusive for one or more DEST_REG
7223 givs, scan the all insn in the loop to find out lifetime ends. */
7224 if (ends_need_computing)
7226 rtx biv = bl->biv->src_reg;
7231 if (p == loop_start)
7234 if (GET_RTX_CLASS (GET_CODE (p)) != 'i')
7236 ends_need_computing -= find_life_end (PATTERN (p), stats, p, biv);
7238 while (ends_need_computing);
7241 /* Set start_luid back to the last insn that sets the giv. This allows
7242 more combinations. */
7243 for (i = 0, v = bl->giv; v; v = v->next_iv)
7247 if (INSN_UID (v->insn) < max_uid_for_loop)
7248 stats[i].start_luid = INSN_LUID (v->insn);
7252 /* Now adjust lifetime ends by taking combined givs into account. */
7253 for (i = 0, v = bl->giv; v; v = v->next_iv)
7260 if (v->same && ! v->same->ignore)
7263 luid = stats[i].start_luid;
7264 /* Use unsigned arithmetic to model loop wrap-around. */
7265 if (luid - stats[j].start_luid
7266 > (unsigned) stats[j].end_luid - stats[j].start_luid)
7267 stats[j].end_luid = luid;
7272 qsort (stats, giv_count, sizeof(*stats), cmp_recombine_givs_stats);
7274 /* Try to derive DEST_REG givs from previous DEST_REG givs with the
7275 same mult_val and non-overlapping lifetime. This reduces register
7277 Once we find a DEST_REG giv that is suitable to derive others from,
7278 we set last_giv to this giv, and try to derive as many other DEST_REG
7279 givs from it without joining overlapping lifetimes. If we then
7280 encounter a DEST_REG giv that we can't derive, we set rescan to the
7281 index for this giv (unless rescan is already set).
7282 When we are finished with the current LAST_GIV (i.e. the inner loop
7283 terminates), we start again with rescan, which then becomes the new
7285 for (i = giv_count - 1; i >= 0; i = rescan)
7287 int life_start, life_end;
7289 for (last_giv = 0, rescan = -1; i >= 0; i--)
7293 v = giv_array[stats[i].giv_number];
7294 if (v->giv_type != DEST_REG || v->derived_from || v->same)
7298 /* Don't use a giv that's likely to be dead to derive
7299 others - that would be likely to keep that giv alive. */
7300 if (! v->maybe_dead || v->combined_with)
7303 life_start = stats[i].start_luid;
7304 life_end = stats[i].end_luid;
7308 /* Use unsigned arithmetic to model loop wrap around. */
7309 if (((unsigned) stats[i].start_luid - life_start
7310 >= (unsigned) life_end - life_start)
7311 && ((unsigned) stats[i].end_luid - life_start
7312 > (unsigned) life_end - life_start)
7313 /* Check that the giv insn we're about to use for deriving
7314 precedes all uses of that giv. Note that initializing the
7315 derived giv would defeat the purpose of reducing register
7317 ??? We could arrange to move the insn. */
7318 && ((unsigned) stats[i].end_luid - INSN_LUID (loop_start)
7319 > (unsigned) stats[i].start_luid - INSN_LUID (loop_start))
7320 && rtx_equal_p (last_giv->mult_val, v->mult_val)
7321 /* ??? Could handle libcalls, but would need more logic. */
7322 && ! find_reg_note (v->insn, REG_RETVAL, NULL_RTX)
7323 /* We would really like to know if for any giv that v
7324 is combined with, v->insn or any intervening biv increment
7325 dominates that combined giv. However, we
7326 don't have this detailed control flow information.
7327 N.B. since last_giv will be reduced, it is valid
7328 anywhere in the loop, so we don't need to check the
7329 validity of last_giv.
7330 We rely here on the fact that v->always_executed implies that
7331 there is no jump to someplace else in the loop before the
7332 giv insn, and hence any insn that is executed before the
7333 giv insn in the loop will have a lower luid. */
7334 && (v->always_executed || ! v->combined_with)
7335 && (sum = express_from (last_giv, v))
7336 /* Make sure we don't make the add more expensive. ADD_COST
7337 doesn't take different costs of registers and constants into
7338 account, so compare the cost of the actual SET_SRCs. */
7339 && (rtx_cost (sum, SET)
7340 <= rtx_cost (SET_SRC (single_set (v->insn)), SET))
7341 /* ??? unroll can't understand anything but reg + const_int
7342 sums. It would be cleaner to fix unroll. */
7343 && ((GET_CODE (sum) == PLUS
7344 && GET_CODE (XEXP (sum, 0)) == REG
7345 && GET_CODE (XEXP (sum, 1)) == CONST_INT)
7347 && validate_change (v->insn, &PATTERN (v->insn),
7348 gen_rtx_SET (GET_MODE (v->dest_reg),
7349 v->dest_reg, sum), 0))
7351 v->derived_from = last_giv;
7352 v->new_reg = v->dest_reg;
7353 life_end = stats[i].end_luid;
7355 if (loop_dump_stream)
7357 fprintf (loop_dump_stream,
7358 "giv at %d derived from %d as ",
7359 INSN_UID (v->insn), INSN_UID (last_giv->insn));
7360 print_rtl (loop_dump_stream, v->new_reg);
7361 putc ('\n', loop_dump_stream);
7364 else if (rescan < 0)
7370 /* EMIT code before INSERT_BEFORE to set REG = B * M + A. */
7373 emit_iv_add_mult (b, m, a, reg, insert_before)
7374 rtx b; /* initial value of basic induction variable */
7375 rtx m; /* multiplicative constant */
7376 rtx a; /* additive constant */
7377 rtx reg; /* destination register */
7383 /* Prevent unexpected sharing of these rtx. */
7387 /* Increase the lifetime of any invariants moved further in code. */
7388 update_reg_last_use (a, insert_before);
7389 update_reg_last_use (b, insert_before);
7390 update_reg_last_use (m, insert_before);
7393 result = expand_mult_add (b, reg, m, a, GET_MODE (reg), 0);
7395 emit_move_insn (reg, result);
7396 seq = gen_sequence ();
7399 emit_insn_before (seq, insert_before);
7401 /* It is entirely possible that the expansion created lots of new
7402 registers. Iterate over the sequence we just created and
7405 if (GET_CODE (seq) == SEQUENCE)
7408 for (i = 0; i < XVECLEN (seq, 0); ++i)
7410 rtx set = single_set (XVECEXP (seq, 0, i));
7411 if (set && GET_CODE (SET_DEST (set)) == REG)
7412 record_base_value (REGNO (SET_DEST (set)), SET_SRC (set), 0);
7415 else if (GET_CODE (seq) == SET
7416 && GET_CODE (SET_DEST (seq)) == REG)
7417 record_base_value (REGNO (SET_DEST (seq)), SET_SRC (seq), 0);
7420 /* Test whether A * B can be computed without
7421 an actual multiply insn. Value is 1 if so. */
7424 product_cheap_p (a, b)
7430 struct obstack *old_rtl_obstack = rtl_obstack;
7431 char *storage = (char *) obstack_alloc (&temp_obstack, 0);
7434 /* If only one is constant, make it B. */
7435 if (GET_CODE (a) == CONST_INT)
7436 tmp = a, a = b, b = tmp;
7438 /* If first constant, both constant, so don't need multiply. */
7439 if (GET_CODE (a) == CONST_INT)
7442 /* If second not constant, neither is constant, so would need multiply. */
7443 if (GET_CODE (b) != CONST_INT)
7446 /* One operand is constant, so might not need multiply insn. Generate the
7447 code for the multiply and see if a call or multiply, or long sequence
7448 of insns is generated. */
7450 rtl_obstack = &temp_obstack;
7452 expand_mult (GET_MODE (a), a, b, NULL_RTX, 0);
7453 tmp = gen_sequence ();
7456 if (GET_CODE (tmp) == SEQUENCE)
7458 if (XVEC (tmp, 0) == 0)
7460 else if (XVECLEN (tmp, 0) > 3)
7463 for (i = 0; i < XVECLEN (tmp, 0); i++)
7465 rtx insn = XVECEXP (tmp, 0, i);
7467 if (GET_CODE (insn) != INSN
7468 || (GET_CODE (PATTERN (insn)) == SET
7469 && GET_CODE (SET_SRC (PATTERN (insn))) == MULT)
7470 || (GET_CODE (PATTERN (insn)) == PARALLEL
7471 && GET_CODE (XVECEXP (PATTERN (insn), 0, 0)) == SET
7472 && GET_CODE (SET_SRC (XVECEXP (PATTERN (insn), 0, 0))) == MULT))
7479 else if (GET_CODE (tmp) == SET
7480 && GET_CODE (SET_SRC (tmp)) == MULT)
7482 else if (GET_CODE (tmp) == PARALLEL
7483 && GET_CODE (XVECEXP (tmp, 0, 0)) == SET
7484 && GET_CODE (SET_SRC (XVECEXP (tmp, 0, 0))) == MULT)
7487 /* Free any storage we obtained in generating this multiply and restore rtl
7488 allocation to its normal obstack. */
7489 obstack_free (&temp_obstack, storage);
7490 rtl_obstack = old_rtl_obstack;
7495 /* Check to see if loop can be terminated by a "decrement and branch until
7496 zero" instruction. If so, add a REG_NONNEG note to the branch insn if so.
7497 Also try reversing an increment loop to a decrement loop
7498 to see if the optimization can be performed.
7499 Value is nonzero if optimization was performed. */
7501 /* This is useful even if the architecture doesn't have such an insn,
7502 because it might change a loops which increments from 0 to n to a loop
7503 which decrements from n to 0. A loop that decrements to zero is usually
7504 faster than one that increments from zero. */
7506 /* ??? This could be rewritten to use some of the loop unrolling procedures,
7507 such as approx_final_value, biv_total_increment, loop_iterations, and
7508 final_[bg]iv_value. */
7511 check_dbra_loop (loop_end, insn_count, loop_start, loop_info)
7515 struct loop_info *loop_info;
7517 struct iv_class *bl;
7524 rtx before_comparison;
7528 int compare_and_branch;
7530 /* If last insn is a conditional branch, and the insn before tests a
7531 register value, try to optimize it. Otherwise, we can't do anything. */
7533 jump = PREV_INSN (loop_end);
7534 comparison = get_condition_for_loop (jump);
7535 if (comparison == 0)
7538 /* Try to compute whether the compare/branch at the loop end is one or
7539 two instructions. */
7540 get_condition (jump, &first_compare);
7541 if (first_compare == jump)
7542 compare_and_branch = 1;
7543 else if (first_compare == prev_nonnote_insn (jump))
7544 compare_and_branch = 2;
7548 /* Check all of the bivs to see if the compare uses one of them.
7549 Skip biv's set more than once because we can't guarantee that
7550 it will be zero on the last iteration. Also skip if the biv is
7551 used between its update and the test insn. */
7553 for (bl = loop_iv_list; bl; bl = bl->next)
7555 if (bl->biv_count == 1
7556 && bl->biv->dest_reg == XEXP (comparison, 0)
7557 && ! reg_used_between_p (regno_reg_rtx[bl->regno], bl->biv->insn,
7565 /* Look for the case where the basic induction variable is always
7566 nonnegative, and equals zero on the last iteration.
7567 In this case, add a reg_note REG_NONNEG, which allows the
7568 m68k DBRA instruction to be used. */
7570 if (((GET_CODE (comparison) == GT
7571 && GET_CODE (XEXP (comparison, 1)) == CONST_INT
7572 && INTVAL (XEXP (comparison, 1)) == -1)
7573 || (GET_CODE (comparison) == NE && XEXP (comparison, 1) == const0_rtx))
7574 && GET_CODE (bl->biv->add_val) == CONST_INT
7575 && INTVAL (bl->biv->add_val) < 0)
7577 /* Initial value must be greater than 0,
7578 init_val % -dec_value == 0 to ensure that it equals zero on
7579 the last iteration */
7581 if (GET_CODE (bl->initial_value) == CONST_INT
7582 && INTVAL (bl->initial_value) > 0
7583 && (INTVAL (bl->initial_value)
7584 % (-INTVAL (bl->biv->add_val))) == 0)
7586 /* register always nonnegative, add REG_NOTE to branch */
7587 REG_NOTES (PREV_INSN (loop_end))
7588 = gen_rtx_EXPR_LIST (REG_NONNEG, NULL_RTX,
7589 REG_NOTES (PREV_INSN (loop_end)));
7595 /* If the decrement is 1 and the value was tested as >= 0 before
7596 the loop, then we can safely optimize. */
7597 for (p = loop_start; p; p = PREV_INSN (p))
7599 if (GET_CODE (p) == CODE_LABEL)
7601 if (GET_CODE (p) != JUMP_INSN)
7604 before_comparison = get_condition_for_loop (p);
7605 if (before_comparison
7606 && XEXP (before_comparison, 0) == bl->biv->dest_reg
7607 && GET_CODE (before_comparison) == LT
7608 && XEXP (before_comparison, 1) == const0_rtx
7609 && ! reg_set_between_p (bl->biv->dest_reg, p, loop_start)
7610 && INTVAL (bl->biv->add_val) == -1)
7612 REG_NOTES (PREV_INSN (loop_end))
7613 = gen_rtx_EXPR_LIST (REG_NONNEG, NULL_RTX,
7614 REG_NOTES (PREV_INSN (loop_end)));
7621 else if (INTVAL (bl->biv->add_val) > 0)
7623 /* Try to change inc to dec, so can apply above optimization. */
7625 all registers modified are induction variables or invariant,
7626 all memory references have non-overlapping addresses
7627 (obviously true if only one write)
7628 allow 2 insns for the compare/jump at the end of the loop. */
7629 /* Also, we must avoid any instructions which use both the reversed
7630 biv and another biv. Such instructions will fail if the loop is
7631 reversed. We meet this condition by requiring that either
7632 no_use_except_counting is true, or else that there is only
7634 int num_nonfixed_reads = 0;
7635 /* 1 if the iteration var is used only to count iterations. */
7636 int no_use_except_counting = 0;
7637 /* 1 if the loop has no memory store, or it has a single memory store
7638 which is reversible. */
7639 int reversible_mem_store = 1;
7641 if (bl->giv_count == 0
7642 && ! loop_number_exit_count[uid_loop_num[INSN_UID (loop_start)]])
7644 rtx bivreg = regno_reg_rtx[bl->regno];
7646 /* If there are no givs for this biv, and the only exit is the
7647 fall through at the end of the loop, then
7648 see if perhaps there are no uses except to count. */
7649 no_use_except_counting = 1;
7650 for (p = loop_start; p != loop_end; p = NEXT_INSN (p))
7651 if (GET_RTX_CLASS (GET_CODE (p)) == 'i')
7653 rtx set = single_set (p);
7655 if (set && GET_CODE (SET_DEST (set)) == REG
7656 && REGNO (SET_DEST (set)) == bl->regno)
7657 /* An insn that sets the biv is okay. */
7659 else if (p == prev_nonnote_insn (prev_nonnote_insn (loop_end))
7660 || p == prev_nonnote_insn (loop_end))
7661 /* Don't bother about the end test. */
7663 else if (reg_mentioned_p (bivreg, PATTERN (p)))
7665 no_use_except_counting = 0;
7671 if (no_use_except_counting)
7672 ; /* no need to worry about MEMs. */
7673 else if (num_mem_sets <= 1)
7675 for (p = loop_start; p != loop_end; p = NEXT_INSN (p))
7676 if (GET_RTX_CLASS (GET_CODE (p)) == 'i')
7677 num_nonfixed_reads += count_nonfixed_reads (PATTERN (p));
7679 /* If the loop has a single store, and the destination address is
7680 invariant, then we can't reverse the loop, because this address
7681 might then have the wrong value at loop exit.
7682 This would work if the source was invariant also, however, in that
7683 case, the insn should have been moved out of the loop. */
7685 if (num_mem_sets == 1)
7687 struct induction *v;
7689 reversible_mem_store
7690 = (! unknown_address_altered
7691 && ! invariant_p (XEXP (loop_store_mems, 0)));
7693 /* If the store depends on a register that is set after the
7694 store, it depends on the initial value, and is thus not
7696 for (v = bl->giv; reversible_mem_store && v; v = v->next_iv)
7698 if (v->giv_type == DEST_REG
7699 && reg_mentioned_p (v->dest_reg,
7700 XEXP (loop_store_mems, 0))
7701 && (INSN_UID (v->insn) >= max_uid_for_loop
7702 || (INSN_LUID (v->insn)
7703 > INSN_LUID (first_loop_store_insn))))
7704 reversible_mem_store = 0;
7711 /* This code only acts for innermost loops. Also it simplifies
7712 the memory address check by only reversing loops with
7713 zero or one memory access.
7714 Two memory accesses could involve parts of the same array,
7715 and that can't be reversed.
7716 If the biv is used only for counting, than we don't need to worry
7717 about all these things. */
7719 if ((num_nonfixed_reads <= 1
7721 && !loop_has_volatile
7722 && reversible_mem_store
7723 && (bl->giv_count + bl->biv_count + num_mem_sets
7724 + num_movables + compare_and_branch == insn_count)
7725 && (bl == loop_iv_list && bl->next == 0))
7726 || no_use_except_counting)
7730 /* Loop can be reversed. */
7731 if (loop_dump_stream)
7732 fprintf (loop_dump_stream, "Can reverse loop\n");
7734 /* Now check other conditions:
7736 The increment must be a constant, as must the initial value,
7737 and the comparison code must be LT.
7739 This test can probably be improved since +/- 1 in the constant
7740 can be obtained by changing LT to LE and vice versa; this is
7744 /* for constants, LE gets turned into LT */
7745 && (GET_CODE (comparison) == LT
7746 || (GET_CODE (comparison) == LE
7747 && no_use_except_counting)))
7749 HOST_WIDE_INT add_val, add_adjust, comparison_val;
7750 rtx initial_value, comparison_value;
7752 enum rtx_code cmp_code;
7753 int comparison_const_width;
7754 unsigned HOST_WIDE_INT comparison_sign_mask;
7756 add_val = INTVAL (bl->biv->add_val);
7757 comparison_value = XEXP (comparison, 1);
7758 if (GET_MODE (comparison_value) == VOIDmode)
7759 comparison_const_width
7760 = GET_MODE_BITSIZE (GET_MODE (XEXP (comparison, 0)));
7762 comparison_const_width
7763 = GET_MODE_BITSIZE (GET_MODE (comparison_value));
7764 if (comparison_const_width > HOST_BITS_PER_WIDE_INT)
7765 comparison_const_width = HOST_BITS_PER_WIDE_INT;
7766 comparison_sign_mask
7767 = (unsigned HOST_WIDE_INT)1 << (comparison_const_width - 1);
7769 /* If the comparison value is not a loop invariant, then we
7770 can not reverse this loop.
7772 ??? If the insns which initialize the comparison value as
7773 a whole compute an invariant result, then we could move
7774 them out of the loop and proceed with loop reversal. */
7775 if (!invariant_p (comparison_value))
7778 if (GET_CODE (comparison_value) == CONST_INT)
7779 comparison_val = INTVAL (comparison_value);
7780 initial_value = bl->initial_value;
7782 /* Normalize the initial value if it is an integer and
7783 has no other use except as a counter. This will allow
7784 a few more loops to be reversed. */
7785 if (no_use_except_counting
7786 && GET_CODE (comparison_value) == CONST_INT
7787 && GET_CODE (initial_value) == CONST_INT)
7789 comparison_val = comparison_val - INTVAL (bl->initial_value);
7790 /* The code below requires comparison_val to be a multiple
7791 of add_val in order to do the loop reversal, so
7792 round up comparison_val to a multiple of add_val.
7793 Since comparison_value is constant, we know that the
7794 current comparison code is LT. */
7795 comparison_val = comparison_val + add_val - 1;
7797 -= (unsigned HOST_WIDE_INT) comparison_val % add_val;
7798 /* We postpone overflow checks for COMPARISON_VAL here;
7799 even if there is an overflow, we might still be able to
7800 reverse the loop, if converting the loop exit test to
7802 initial_value = const0_rtx;
7805 /* First check if we can do a vanilla loop reversal. */
7806 if (initial_value == const0_rtx
7807 /* If we have a decrement_and_branch_on_count, prefer
7808 the NE test, since this will allow that instruction to
7809 be generated. Note that we must use a vanilla loop
7810 reversal if the biv is used to calculate a giv or has
7811 a non-counting use. */
7812 #if ! defined (HAVE_decrement_and_branch_until_zero) && defined (HAVE_decrement_and_branch_on_count)
7813 && (! (add_val == 1 && loop_info->vtop
7814 && (bl->biv_count == 0
7815 || no_use_except_counting)))
7817 && GET_CODE (comparison_value) == CONST_INT
7818 /* Now do postponed overflow checks on COMPARISON_VAL. */
7819 && ! (((comparison_val - add_val) ^ INTVAL (comparison_value))
7820 & comparison_sign_mask))
7822 /* Register will always be nonnegative, with value
7823 0 on last iteration */
7824 add_adjust = add_val;
7828 else if (add_val == 1 && loop_info->vtop
7829 && (bl->biv_count == 0
7830 || no_use_except_counting))
7838 if (GET_CODE (comparison) == LE)
7839 add_adjust -= add_val;
7841 /* If the initial value is not zero, or if the comparison
7842 value is not an exact multiple of the increment, then we
7843 can not reverse this loop. */
7844 if (initial_value == const0_rtx
7845 && GET_CODE (comparison_value) == CONST_INT)
7847 if (((unsigned HOST_WIDE_INT) comparison_val % add_val) != 0)
7852 if (! no_use_except_counting || add_val != 1)
7856 final_value = comparison_value;
7858 /* Reset these in case we normalized the initial value
7859 and comparison value above. */
7860 if (GET_CODE (comparison_value) == CONST_INT
7861 && GET_CODE (initial_value) == CONST_INT)
7863 comparison_value = GEN_INT (comparison_val);
7865 = GEN_INT (comparison_val + INTVAL (bl->initial_value));
7867 bl->initial_value = initial_value;
7869 /* Save some info needed to produce the new insns. */
7870 reg = bl->biv->dest_reg;
7871 jump_label = XEXP (SET_SRC (PATTERN (PREV_INSN (loop_end))), 1);
7872 if (jump_label == pc_rtx)
7873 jump_label = XEXP (SET_SRC (PATTERN (PREV_INSN (loop_end))), 2);
7874 new_add_val = GEN_INT (- INTVAL (bl->biv->add_val));
7876 /* Set start_value; if this is not a CONST_INT, we need
7878 Initialize biv to start_value before loop start.
7879 The old initializing insn will be deleted as a
7880 dead store by flow.c. */
7881 if (initial_value == const0_rtx
7882 && GET_CODE (comparison_value) == CONST_INT)
7884 start_value = GEN_INT (comparison_val - add_adjust);
7885 emit_insn_before (gen_move_insn (reg, start_value),
7888 else if (GET_CODE (initial_value) == CONST_INT)
7890 rtx offset = GEN_INT (-INTVAL (initial_value) - add_adjust);
7891 enum machine_mode mode = GET_MODE (reg);
7892 enum insn_code icode
7893 = add_optab->handlers[(int) mode].insn_code;
7894 if (! (*insn_operand_predicate[icode][0]) (reg, mode)
7895 || ! ((*insn_operand_predicate[icode][1])
7896 (comparison_value, mode))
7897 || ! (*insn_operand_predicate[icode][2]) (offset, mode))
7900 = gen_rtx_PLUS (mode, comparison_value, offset);
7901 emit_insn_before ((GEN_FCN (icode)
7902 (reg, comparison_value, offset)),
7904 if (GET_CODE (comparison) == LE)
7905 final_value = gen_rtx_PLUS (mode, comparison_value,
7908 else if (! add_adjust)
7910 enum machine_mode mode = GET_MODE (reg);
7911 enum insn_code icode
7912 = sub_optab->handlers[(int) mode].insn_code;
7913 if (! (*insn_operand_predicate[icode][0]) (reg, mode)
7914 || ! ((*insn_operand_predicate[icode][1])
7915 (comparison_value, mode))
7916 || ! ((*insn_operand_predicate[icode][2])
7917 (initial_value, mode)))
7920 = gen_rtx_MINUS (mode, comparison_value, initial_value);
7921 emit_insn_before ((GEN_FCN (icode)
7922 (reg, comparison_value, initial_value)),
7926 /* We could handle the other cases too, but it'll be
7927 better to have a testcase first. */
7930 /* We may not have a single insn which can increment a reg, so
7931 create a sequence to hold all the insns from expand_inc. */
7933 expand_inc (reg, new_add_val);
7934 tem = gen_sequence ();
7937 p = emit_insn_before (tem, bl->biv->insn);
7938 delete_insn (bl->biv->insn);
7940 /* Update biv info to reflect its new status. */
7942 bl->initial_value = start_value;
7943 bl->biv->add_val = new_add_val;
7945 /* Update loop info. */
7946 loop_info->initial_value = reg;
7947 loop_info->initial_equiv_value = reg;
7948 loop_info->final_value = const0_rtx;
7949 loop_info->final_equiv_value = const0_rtx;
7950 loop_info->comparison_value = const0_rtx;
7951 loop_info->comparison_code = cmp_code;
7952 loop_info->increment = new_add_val;
7954 /* Inc LABEL_NUSES so that delete_insn will
7955 not delete the label. */
7956 LABEL_NUSES (XEXP (jump_label, 0)) ++;
7958 /* Emit an insn after the end of the loop to set the biv's
7959 proper exit value if it is used anywhere outside the loop. */
7960 if ((REGNO_LAST_UID (bl->regno) != INSN_UID (first_compare))
7962 || REGNO_FIRST_UID (bl->regno) != INSN_UID (bl->init_insn))
7963 emit_insn_after (gen_move_insn (reg, final_value),
7966 /* Delete compare/branch at end of loop. */
7967 delete_insn (PREV_INSN (loop_end));
7968 if (compare_and_branch == 2)
7969 delete_insn (first_compare);
7971 /* Add new compare/branch insn at end of loop. */
7973 emit_cmp_and_jump_insns (reg, const0_rtx, cmp_code, NULL_RTX,
7974 GET_MODE (reg), 0, 0,
7975 XEXP (jump_label, 0));
7976 tem = gen_sequence ();
7978 emit_jump_insn_before (tem, loop_end);
7980 for (tem = PREV_INSN (loop_end);
7981 tem && GET_CODE (tem) != JUMP_INSN;
7982 tem = PREV_INSN (tem))
7986 JUMP_LABEL (tem) = XEXP (jump_label, 0);
7992 /* Increment of LABEL_NUSES done above. */
7993 /* Register is now always nonnegative,
7994 so add REG_NONNEG note to the branch. */
7995 REG_NOTES (tem) = gen_rtx_EXPR_LIST (REG_NONNEG, NULL_RTX,
8001 /* Mark that this biv has been reversed. Each giv which depends
8002 on this biv, and which is also live past the end of the loop
8003 will have to be fixed up. */
8007 if (loop_dump_stream)
8008 fprintf (loop_dump_stream,
8009 "Reversed loop and added reg_nonneg\n");
8019 /* Verify whether the biv BL appears to be eliminable,
8020 based on the insns in the loop that refer to it.
8021 LOOP_START is the first insn of the loop, and END is the end insn.
8023 If ELIMINATE_P is non-zero, actually do the elimination.
8025 THRESHOLD and INSN_COUNT are from loop_optimize and are used to
8026 determine whether invariant insns should be placed inside or at the
8027 start of the loop. */
8030 maybe_eliminate_biv (bl, loop_start, end, eliminate_p, threshold, insn_count)
8031 struct iv_class *bl;
8035 int threshold, insn_count;
8037 rtx reg = bl->biv->dest_reg;
8040 /* Scan all insns in the loop, stopping if we find one that uses the
8041 biv in a way that we cannot eliminate. */
8043 for (p = loop_start; p != end; p = NEXT_INSN (p))
8045 enum rtx_code code = GET_CODE (p);
8046 rtx where = threshold >= insn_count ? loop_start : p;
8048 if ((code == INSN || code == JUMP_INSN || code == CALL_INSN)
8049 && reg_mentioned_p (reg, PATTERN (p))
8050 && ! maybe_eliminate_biv_1 (PATTERN (p), p, bl, eliminate_p, where))
8052 if (loop_dump_stream)
8053 fprintf (loop_dump_stream,
8054 "Cannot eliminate biv %d: biv used in insn %d.\n",
8055 bl->regno, INSN_UID (p));
8062 if (loop_dump_stream)
8063 fprintf (loop_dump_stream, "biv %d %s eliminated.\n",
8064 bl->regno, eliminate_p ? "was" : "can be");
8071 /* INSN and REFERENCE are instructions in the same insn chain.
8072 Return non-zero if INSN is first.
8073 This is like insn_first_p, except that we use the luid information if
8077 loop_insn_first_p (insn, reference)
8078 rtx insn, reference;
8080 return ((INSN_UID (insn) < max_uid_for_loop
8081 && INSN_UID (reference) < max_uid_for_loop)
8082 ? INSN_LUID (insn) < INSN_LUID (reference)
8083 : insn_first_p (insn, reference));
8086 /* We are trying to eliminate BIV in INSN using GIV. Return non-zero if
8087 the offset that we have to take into account due to auto-increment /
8088 div derivation is zero. */
8090 biv_elimination_giv_has_0_offset (biv, giv, insn)
8091 struct induction *biv, *giv;
8094 /* If the giv V had the auto-inc address optimization applied
8095 to it, and INSN occurs between the giv insn and the biv
8096 insn, then we'd have to adjust the value used here.
8097 This is rare, so we don't bother to make this possible. */
8098 if (giv->auto_inc_opt
8099 && ((loop_insn_first_p (giv->insn, insn)
8100 && loop_insn_first_p (insn, biv->insn))
8101 || (loop_insn_first_p (biv->insn, insn)
8102 && loop_insn_first_p (insn, giv->insn))))
8105 /* If the giv V was derived from another giv, and INSN does
8106 not occur between the giv insn and the biv insn, then we'd
8107 have to adjust the value used here. This is rare, so we don't
8108 bother to make this possible. */
8109 if (giv->derived_from
8110 && ! (giv->always_executed
8111 && loop_insn_first_p (giv->insn, insn)
8112 && loop_insn_first_p (insn, biv->insn)))
8115 && giv->same->derived_from
8116 && ! (giv->same->always_executed
8117 && loop_insn_first_p (giv->same->insn, insn)
8118 && loop_insn_first_p (insn, biv->insn)))
8124 /* If BL appears in X (part of the pattern of INSN), see if we can
8125 eliminate its use. If so, return 1. If not, return 0.
8127 If BIV does not appear in X, return 1.
8129 If ELIMINATE_P is non-zero, actually do the elimination. WHERE indicates
8130 where extra insns should be added. Depending on how many items have been
8131 moved out of the loop, it will either be before INSN or at the start of
8135 maybe_eliminate_biv_1 (x, insn, bl, eliminate_p, where)
8137 struct iv_class *bl;
8141 enum rtx_code code = GET_CODE (x);
8142 rtx reg = bl->biv->dest_reg;
8143 enum machine_mode mode = GET_MODE (reg);
8144 struct induction *v;
8156 /* If we haven't already been able to do something with this BIV,
8157 we can't eliminate it. */
8163 /* If this sets the BIV, it is not a problem. */
8164 if (SET_DEST (x) == reg)
8167 /* If this is an insn that defines a giv, it is also ok because
8168 it will go away when the giv is reduced. */
8169 for (v = bl->giv; v; v = v->next_iv)
8170 if (v->giv_type == DEST_REG && SET_DEST (x) == v->dest_reg)
8174 if (SET_DEST (x) == cc0_rtx && SET_SRC (x) == reg)
8176 /* Can replace with any giv that was reduced and
8177 that has (MULT_VAL != 0) and (ADD_VAL == 0).
8178 Require a constant for MULT_VAL, so we know it's nonzero.
8179 ??? We disable this optimization to avoid potential
8182 for (v = bl->giv; v; v = v->next_iv)
8183 if (CONSTANT_P (v->mult_val) && v->mult_val != const0_rtx
8184 && v->add_val == const0_rtx
8185 && ! v->ignore && ! v->maybe_dead && v->always_computable
8189 if (! biv_elimination_giv_has_0_offset (bl->biv, v, insn))
8195 /* If the giv has the opposite direction of change,
8196 then reverse the comparison. */
8197 if (INTVAL (v->mult_val) < 0)
8198 new = gen_rtx_COMPARE (GET_MODE (v->new_reg),
8199 const0_rtx, v->new_reg);
8203 /* We can probably test that giv's reduced reg. */
8204 if (validate_change (insn, &SET_SRC (x), new, 0))
8208 /* Look for a giv with (MULT_VAL != 0) and (ADD_VAL != 0);
8209 replace test insn with a compare insn (cmp REDUCED_GIV ADD_VAL).
8210 Require a constant for MULT_VAL, so we know it's nonzero.
8211 ??? Do this only if ADD_VAL is a pointer to avoid a potential
8212 overflow problem. */
8214 for (v = bl->giv; v; v = v->next_iv)
8215 if (CONSTANT_P (v->mult_val) && v->mult_val != const0_rtx
8216 && ! v->ignore && ! v->maybe_dead && v->always_computable
8218 && (GET_CODE (v->add_val) == SYMBOL_REF
8219 || GET_CODE (v->add_val) == LABEL_REF
8220 || GET_CODE (v->add_val) == CONST
8221 || (GET_CODE (v->add_val) == REG
8222 && REGNO_POINTER_FLAG (REGNO (v->add_val)))))
8224 if (! biv_elimination_giv_has_0_offset (bl->biv, v, insn))
8230 /* If the giv has the opposite direction of change,
8231 then reverse the comparison. */
8232 if (INTVAL (v->mult_val) < 0)
8233 new = gen_rtx_COMPARE (VOIDmode, copy_rtx (v->add_val),
8236 new = gen_rtx_COMPARE (VOIDmode, v->new_reg,
8237 copy_rtx (v->add_val));
8239 /* Replace biv with the giv's reduced register. */
8240 update_reg_last_use (v->add_val, insn);
8241 if (validate_change (insn, &SET_SRC (PATTERN (insn)), new, 0))
8244 /* Insn doesn't support that constant or invariant. Copy it
8245 into a register (it will be a loop invariant.) */
8246 tem = gen_reg_rtx (GET_MODE (v->new_reg));
8248 emit_insn_before (gen_move_insn (tem, copy_rtx (v->add_val)),
8251 /* Substitute the new register for its invariant value in
8252 the compare expression. */
8253 XEXP (new, (INTVAL (v->mult_val) < 0) ? 0 : 1) = tem;
8254 if (validate_change (insn, &SET_SRC (PATTERN (insn)), new, 0))
8263 case GT: case GE: case GTU: case GEU:
8264 case LT: case LE: case LTU: case LEU:
8265 /* See if either argument is the biv. */
8266 if (XEXP (x, 0) == reg)
8267 arg = XEXP (x, 1), arg_operand = 1;
8268 else if (XEXP (x, 1) == reg)
8269 arg = XEXP (x, 0), arg_operand = 0;
8273 if (CONSTANT_P (arg))
8275 /* First try to replace with any giv that has constant positive
8276 mult_val and constant add_val. We might be able to support
8277 negative mult_val, but it seems complex to do it in general. */
8279 for (v = bl->giv; v; v = v->next_iv)
8280 if (CONSTANT_P (v->mult_val) && INTVAL (v->mult_val) > 0
8281 && (GET_CODE (v->add_val) == SYMBOL_REF
8282 || GET_CODE (v->add_val) == LABEL_REF
8283 || GET_CODE (v->add_val) == CONST
8284 || (GET_CODE (v->add_val) == REG
8285 && REGNO_POINTER_FLAG (REGNO (v->add_val))))
8286 && ! v->ignore && ! v->maybe_dead && v->always_computable
8289 if (! biv_elimination_giv_has_0_offset (bl->biv, v, insn))
8295 /* Replace biv with the giv's reduced reg. */
8296 XEXP (x, 1-arg_operand) = v->new_reg;
8298 /* If all constants are actually constant integers and
8299 the derived constant can be directly placed in the COMPARE,
8301 if (GET_CODE (arg) == CONST_INT
8302 && GET_CODE (v->mult_val) == CONST_INT
8303 && GET_CODE (v->add_val) == CONST_INT
8304 && validate_change (insn, &XEXP (x, arg_operand),
8305 GEN_INT (INTVAL (arg)
8306 * INTVAL (v->mult_val)
8307 + INTVAL (v->add_val)), 0))
8310 /* Otherwise, load it into a register. */
8311 tem = gen_reg_rtx (mode);
8312 emit_iv_add_mult (arg, v->mult_val, v->add_val, tem, where);
8313 if (validate_change (insn, &XEXP (x, arg_operand), tem, 0))
8316 /* If that failed, put back the change we made above. */
8317 XEXP (x, 1-arg_operand) = reg;
8320 /* Look for giv with positive constant mult_val and nonconst add_val.
8321 Insert insns to calculate new compare value.
8322 ??? Turn this off due to possible overflow. */
8324 for (v = bl->giv; v; v = v->next_iv)
8325 if (CONSTANT_P (v->mult_val) && INTVAL (v->mult_val) > 0
8326 && ! v->ignore && ! v->maybe_dead && v->always_computable
8332 if (! biv_elimination_giv_has_0_offset (bl->biv, v, insn))
8338 tem = gen_reg_rtx (mode);
8340 /* Replace biv with giv's reduced register. */
8341 validate_change (insn, &XEXP (x, 1 - arg_operand),
8344 /* Compute value to compare against. */
8345 emit_iv_add_mult (arg, v->mult_val, v->add_val, tem, where);
8346 /* Use it in this insn. */
8347 validate_change (insn, &XEXP (x, arg_operand), tem, 1);
8348 if (apply_change_group ())
8352 else if (GET_CODE (arg) == REG || GET_CODE (arg) == MEM)
8354 if (invariant_p (arg) == 1)
8356 /* Look for giv with constant positive mult_val and nonconst
8357 add_val. Insert insns to compute new compare value.
8358 ??? Turn this off due to possible overflow. */
8360 for (v = bl->giv; v; v = v->next_iv)
8361 if (CONSTANT_P (v->mult_val) && INTVAL (v->mult_val) > 0
8362 && ! v->ignore && ! v->maybe_dead && v->always_computable
8368 if (! biv_elimination_giv_has_0_offset (bl->biv, v, insn))
8374 tem = gen_reg_rtx (mode);
8376 /* Replace biv with giv's reduced register. */
8377 validate_change (insn, &XEXP (x, 1 - arg_operand),
8380 /* Compute value to compare against. */
8381 emit_iv_add_mult (arg, v->mult_val, v->add_val,
8383 validate_change (insn, &XEXP (x, arg_operand), tem, 1);
8384 if (apply_change_group ())
8389 /* This code has problems. Basically, you can't know when
8390 seeing if we will eliminate BL, whether a particular giv
8391 of ARG will be reduced. If it isn't going to be reduced,
8392 we can't eliminate BL. We can try forcing it to be reduced,
8393 but that can generate poor code.
8395 The problem is that the benefit of reducing TV, below should
8396 be increased if BL can actually be eliminated, but this means
8397 we might have to do a topological sort of the order in which
8398 we try to process biv. It doesn't seem worthwhile to do
8399 this sort of thing now. */
8402 /* Otherwise the reg compared with had better be a biv. */
8403 if (GET_CODE (arg) != REG
8404 || REG_IV_TYPE (REGNO (arg)) != BASIC_INDUCT)
8407 /* Look for a pair of givs, one for each biv,
8408 with identical coefficients. */
8409 for (v = bl->giv; v; v = v->next_iv)
8411 struct induction *tv;
8413 if (v->ignore || v->maybe_dead || v->mode != mode)
8416 for (tv = reg_biv_class[REGNO (arg)]->giv; tv; tv = tv->next_iv)
8417 if (! tv->ignore && ! tv->maybe_dead
8418 && rtx_equal_p (tv->mult_val, v->mult_val)
8419 && rtx_equal_p (tv->add_val, v->add_val)
8420 && tv->mode == mode)
8422 if (! biv_elimination_giv_has_0_offset (bl->biv, v, insn))
8428 /* Replace biv with its giv's reduced reg. */
8429 XEXP (x, 1-arg_operand) = v->new_reg;
8430 /* Replace other operand with the other giv's
8432 XEXP (x, arg_operand) = tv->new_reg;
8439 /* If we get here, the biv can't be eliminated. */
8443 /* If this address is a DEST_ADDR giv, it doesn't matter if the
8444 biv is used in it, since it will be replaced. */
8445 for (v = bl->giv; v; v = v->next_iv)
8446 if (v->giv_type == DEST_ADDR && v->location == &XEXP (x, 0))
8454 /* See if any subexpression fails elimination. */
8455 fmt = GET_RTX_FORMAT (code);
8456 for (i = GET_RTX_LENGTH (code) - 1; i >= 0; i--)
8461 if (! maybe_eliminate_biv_1 (XEXP (x, i), insn, bl,
8462 eliminate_p, where))
8467 for (j = XVECLEN (x, i) - 1; j >= 0; j--)
8468 if (! maybe_eliminate_biv_1 (XVECEXP (x, i, j), insn, bl,
8469 eliminate_p, where))
8478 /* Return nonzero if the last use of REG
8479 is in an insn following INSN in the same basic block. */
8482 last_use_this_basic_block (reg, insn)
8488 n && GET_CODE (n) != CODE_LABEL && GET_CODE (n) != JUMP_INSN;
8491 if (REGNO_LAST_UID (REGNO (reg)) == INSN_UID (n))
8497 /* Called via `note_stores' to record the initial value of a biv. Here we
8498 just record the location of the set and process it later. */
8501 record_initial (dest, set)
8505 struct iv_class *bl;
8507 if (GET_CODE (dest) != REG
8508 || REGNO (dest) >= max_reg_before_loop
8509 || REG_IV_TYPE (REGNO (dest)) != BASIC_INDUCT)
8512 bl = reg_biv_class[REGNO (dest)];
8514 /* If this is the first set found, record it. */
8515 if (bl->init_insn == 0)
8517 bl->init_insn = note_insn;
8522 /* If any of the registers in X are "old" and currently have a last use earlier
8523 than INSN, update them to have a last use of INSN. Their actual last use
8524 will be the previous insn but it will not have a valid uid_luid so we can't
8528 update_reg_last_use (x, insn)
8532 /* Check for the case where INSN does not have a valid luid. In this case,
8533 there is no need to modify the regno_last_uid, as this can only happen
8534 when code is inserted after the loop_end to set a pseudo's final value,
8535 and hence this insn will never be the last use of x. */
8536 if (GET_CODE (x) == REG && REGNO (x) < max_reg_before_loop
8537 && INSN_UID (insn) < max_uid_for_loop
8538 && uid_luid[REGNO_LAST_UID (REGNO (x))] < uid_luid[INSN_UID (insn)])
8539 REGNO_LAST_UID (REGNO (x)) = INSN_UID (insn);
8543 register char *fmt = GET_RTX_FORMAT (GET_CODE (x));
8544 for (i = GET_RTX_LENGTH (GET_CODE (x)) - 1; i >= 0; i--)
8547 update_reg_last_use (XEXP (x, i), insn);
8548 else if (fmt[i] == 'E')
8549 for (j = XVECLEN (x, i) - 1; j >= 0; j--)
8550 update_reg_last_use (XVECEXP (x, i, j), insn);
8555 /* Given a jump insn JUMP, return the condition that will cause it to branch
8556 to its JUMP_LABEL. If the condition cannot be understood, or is an
8557 inequality floating-point comparison which needs to be reversed, 0 will
8560 If EARLIEST is non-zero, it is a pointer to a place where the earliest
8561 insn used in locating the condition was found. If a replacement test
8562 of the condition is desired, it should be placed in front of that
8563 insn and we will be sure that the inputs are still valid.
8565 The condition will be returned in a canonical form to simplify testing by
8566 callers. Specifically:
8568 (1) The code will always be a comparison operation (EQ, NE, GT, etc.).
8569 (2) Both operands will be machine operands; (cc0) will have been replaced.
8570 (3) If an operand is a constant, it will be the second operand.
8571 (4) (LE x const) will be replaced with (LT x <const+1>) and similarly
8572 for GE, GEU, and LEU. */
8575 get_condition (jump, earliest)
8584 int reverse_code = 0;
8585 int did_reverse_condition = 0;
8586 enum machine_mode mode;
8588 /* If this is not a standard conditional jump, we can't parse it. */
8589 if (GET_CODE (jump) != JUMP_INSN
8590 || ! condjump_p (jump) || simplejump_p (jump))
8593 code = GET_CODE (XEXP (SET_SRC (PATTERN (jump)), 0));
8594 mode = GET_MODE (XEXP (SET_SRC (PATTERN (jump)), 0));
8595 op0 = XEXP (XEXP (SET_SRC (PATTERN (jump)), 0), 0);
8596 op1 = XEXP (XEXP (SET_SRC (PATTERN (jump)), 0), 1);
8601 /* If this branches to JUMP_LABEL when the condition is false, reverse
8603 if (GET_CODE (XEXP (SET_SRC (PATTERN (jump)), 2)) == LABEL_REF
8604 && XEXP (XEXP (SET_SRC (PATTERN (jump)), 2), 0) == JUMP_LABEL (jump))
8605 code = reverse_condition (code), did_reverse_condition ^= 1;
8607 /* If we are comparing a register with zero, see if the register is set
8608 in the previous insn to a COMPARE or a comparison operation. Perform
8609 the same tests as a function of STORE_FLAG_VALUE as find_comparison_args
8612 while (GET_RTX_CLASS (code) == '<' && op1 == CONST0_RTX (GET_MODE (op0)))
8614 /* Set non-zero when we find something of interest. */
8618 /* If comparison with cc0, import actual comparison from compare
8622 if ((prev = prev_nonnote_insn (prev)) == 0
8623 || GET_CODE (prev) != INSN
8624 || (set = single_set (prev)) == 0
8625 || SET_DEST (set) != cc0_rtx)
8628 op0 = SET_SRC (set);
8629 op1 = CONST0_RTX (GET_MODE (op0));
8635 /* If this is a COMPARE, pick up the two things being compared. */
8636 if (GET_CODE (op0) == COMPARE)
8638 op1 = XEXP (op0, 1);
8639 op0 = XEXP (op0, 0);
8642 else if (GET_CODE (op0) != REG)
8645 /* Go back to the previous insn. Stop if it is not an INSN. We also
8646 stop if it isn't a single set or if it has a REG_INC note because
8647 we don't want to bother dealing with it. */
8649 if ((prev = prev_nonnote_insn (prev)) == 0
8650 || GET_CODE (prev) != INSN
8651 || FIND_REG_INC_NOTE (prev, 0)
8652 || (set = single_set (prev)) == 0)
8655 /* If this is setting OP0, get what it sets it to if it looks
8657 if (rtx_equal_p (SET_DEST (set), op0))
8659 enum machine_mode inner_mode = GET_MODE (SET_SRC (set));
8661 /* ??? We may not combine comparisons done in a CCmode with
8662 comparisons not done in a CCmode. This is to aid targets
8663 like Alpha that have an IEEE compliant EQ instruction, and
8664 a non-IEEE compliant BEQ instruction. The use of CCmode is
8665 actually artificial, simply to prevent the combination, but
8666 should not affect other platforms.
8668 However, we must allow VOIDmode comparisons to match either
8669 CCmode or non-CCmode comparison, because some ports have
8670 modeless comparisons inside branch patterns.
8672 ??? This mode check should perhaps look more like the mode check
8673 in simplify_comparison in combine. */
8675 if ((GET_CODE (SET_SRC (set)) == COMPARE
8678 && GET_MODE_CLASS (inner_mode) == MODE_INT
8679 && (GET_MODE_BITSIZE (inner_mode)
8680 <= HOST_BITS_PER_WIDE_INT)
8681 && (STORE_FLAG_VALUE
8682 & ((HOST_WIDE_INT) 1
8683 << (GET_MODE_BITSIZE (inner_mode) - 1))))
8684 #ifdef FLOAT_STORE_FLAG_VALUE
8686 && GET_MODE_CLASS (inner_mode) == MODE_FLOAT
8687 && FLOAT_STORE_FLAG_VALUE < 0)
8690 && GET_RTX_CLASS (GET_CODE (SET_SRC (set))) == '<'))
8691 && (((GET_MODE_CLASS (mode) == MODE_CC)
8692 == (GET_MODE_CLASS (inner_mode) == MODE_CC))
8693 || mode == VOIDmode || inner_mode == VOIDmode))
8695 else if (((code == EQ
8697 && (GET_MODE_BITSIZE (inner_mode)
8698 <= HOST_BITS_PER_WIDE_INT)
8699 && GET_MODE_CLASS (inner_mode) == MODE_INT
8700 && (STORE_FLAG_VALUE
8701 & ((HOST_WIDE_INT) 1
8702 << (GET_MODE_BITSIZE (inner_mode) - 1))))
8703 #ifdef FLOAT_STORE_FLAG_VALUE
8705 && GET_MODE_CLASS (inner_mode) == MODE_FLOAT
8706 && FLOAT_STORE_FLAG_VALUE < 0)
8709 && GET_RTX_CLASS (GET_CODE (SET_SRC (set))) == '<'
8710 && (((GET_MODE_CLASS (mode) == MODE_CC)
8711 == (GET_MODE_CLASS (inner_mode) == MODE_CC))
8712 || mode == VOIDmode || inner_mode == VOIDmode))
8715 /* We might have reversed a LT to get a GE here. But this wasn't
8716 actually the comparison of data, so we don't flag that we
8717 have had to reverse the condition. */
8718 did_reverse_condition ^= 1;
8726 else if (reg_set_p (op0, prev))
8727 /* If this sets OP0, but not directly, we have to give up. */
8732 if (GET_RTX_CLASS (GET_CODE (x)) == '<')
8733 code = GET_CODE (x);
8736 code = reverse_condition (code);
8737 did_reverse_condition ^= 1;
8741 op0 = XEXP (x, 0), op1 = XEXP (x, 1);
8747 /* If constant is first, put it last. */
8748 if (CONSTANT_P (op0))
8749 code = swap_condition (code), tem = op0, op0 = op1, op1 = tem;
8751 /* If OP0 is the result of a comparison, we weren't able to find what
8752 was really being compared, so fail. */
8753 if (GET_MODE_CLASS (GET_MODE (op0)) == MODE_CC)
8756 /* Canonicalize any ordered comparison with integers involving equality
8757 if we can do computations in the relevant mode and we do not
8760 if (GET_CODE (op1) == CONST_INT
8761 && GET_MODE (op0) != VOIDmode
8762 && GET_MODE_BITSIZE (GET_MODE (op0)) <= HOST_BITS_PER_WIDE_INT)
8764 HOST_WIDE_INT const_val = INTVAL (op1);
8765 unsigned HOST_WIDE_INT uconst_val = const_val;
8766 unsigned HOST_WIDE_INT max_val
8767 = (unsigned HOST_WIDE_INT) GET_MODE_MASK (GET_MODE (op0));
8772 if ((unsigned HOST_WIDE_INT) const_val != max_val >> 1)
8773 code = LT, op1 = GEN_INT (const_val + 1);
8776 /* When cross-compiling, const_val might be sign-extended from
8777 BITS_PER_WORD to HOST_BITS_PER_WIDE_INT */
8779 if ((HOST_WIDE_INT) (const_val & max_val)
8780 != (((HOST_WIDE_INT) 1
8781 << (GET_MODE_BITSIZE (GET_MODE (op0)) - 1))))
8782 code = GT, op1 = GEN_INT (const_val - 1);
8786 if (uconst_val < max_val)
8787 code = LTU, op1 = GEN_INT (uconst_val + 1);
8791 if (uconst_val != 0)
8792 code = GTU, op1 = GEN_INT (uconst_val - 1);
8800 /* If this was floating-point and we reversed anything other than an
8801 EQ or NE, return zero. */
8802 if (TARGET_FLOAT_FORMAT == IEEE_FLOAT_FORMAT
8803 && did_reverse_condition && code != NE && code != EQ
8805 && GET_MODE_CLASS (GET_MODE (op0)) == MODE_FLOAT)
8809 /* Never return CC0; return zero instead. */
8814 return gen_rtx_fmt_ee (code, VOIDmode, op0, op1);
8817 /* Similar to above routine, except that we also put an invariant last
8818 unless both operands are invariants. */
8821 get_condition_for_loop (x)
8824 rtx comparison = get_condition (x, NULL_PTR);
8827 || ! invariant_p (XEXP (comparison, 0))
8828 || invariant_p (XEXP (comparison, 1)))
8831 return gen_rtx_fmt_ee (swap_condition (GET_CODE (comparison)), VOIDmode,
8832 XEXP (comparison, 1), XEXP (comparison, 0));
8835 #ifdef HAVE_decrement_and_branch_on_count
8836 /* Instrument loop for insertion of bct instruction. We distinguish between
8837 loops with compile-time bounds and those with run-time bounds.
8838 Information from loop_iterations() is used to compute compile-time bounds.
8839 Run-time bounds should use loop preconditioning, but currently ignored.
8843 insert_bct (loop_start, loop_end, loop_info)
8844 rtx loop_start, loop_end;
8845 struct loop_info *loop_info;
8848 unsigned HOST_WIDE_INT n_iterations;
8850 int increment_direction, compare_direction;
8852 /* If the loop condition is <= or >=, the number of iteration
8853 is 1 more than the range of the bounds of the loop. */
8854 int add_iteration = 0;
8856 enum machine_mode loop_var_mode = word_mode;
8858 int loop_num = uid_loop_num [INSN_UID (loop_start)];
8860 /* It's impossible to instrument a competely unrolled loop. */
8861 if (loop_info->unroll_number == -1)
8864 /* Make sure that the count register is not in use. */
8865 if (loop_used_count_register [loop_num])
8867 if (loop_dump_stream)
8868 fprintf (loop_dump_stream,
8869 "insert_bct %d: BCT instrumentation failed: count register already in use\n",
8874 /* Make sure that the function has no indirect jumps. */
8875 if (indirect_jump_in_function)
8877 if (loop_dump_stream)
8878 fprintf (loop_dump_stream,
8879 "insert_bct %d: BCT instrumentation failed: indirect jump in function\n",
8884 /* Make sure that the last loop insn is a conditional jump. */
8885 if (GET_CODE (PREV_INSN (loop_end)) != JUMP_INSN
8886 || ! condjump_p (PREV_INSN (loop_end))
8887 || simplejump_p (PREV_INSN (loop_end)))
8889 if (loop_dump_stream)
8890 fprintf (loop_dump_stream,
8891 "insert_bct %d: BCT instrumentation failed: invalid jump at loop end\n",
8896 /* Make sure that the loop does not contain a function call
8897 (the count register might be altered by the called function). */
8900 if (loop_dump_stream)
8901 fprintf (loop_dump_stream,
8902 "insert_bct %d: BCT instrumentation failed: function call in loop\n",
8907 /* Make sure that the loop does not jump via a table.
8908 (the count register might be used to perform the branch on table). */
8909 if (loop_has_tablejump)
8911 if (loop_dump_stream)
8912 fprintf (loop_dump_stream,
8913 "insert_bct %d: BCT instrumentation failed: computed branch in the loop\n",
8918 /* Account for loop unrolling in instrumented iteration count. */
8919 if (loop_info->unroll_number > 1)
8920 n_iterations = loop_info->n_iterations / loop_info->unroll_number;
8922 n_iterations = loop_info->n_iterations;
8924 if (n_iterations != 0 && n_iterations < 3)
8926 /* Allow an enclosing outer loop to benefit if possible. */
8927 if (loop_dump_stream)
8928 fprintf (loop_dump_stream,
8929 "insert_bct %d: Too few iterations to benefit from BCT optimization\n",
8934 /* Try to instrument the loop. */
8936 /* Handle the simpler case, where the bounds are known at compile time. */
8937 if (n_iterations > 0)
8939 /* Mark all enclosing loops that they cannot use count register. */
8940 for (i = loop_num; i != -1; i = loop_outer_loop[i])
8941 loop_used_count_register[i] = 1;
8942 instrument_loop_bct (loop_start, loop_end, GEN_INT (n_iterations));
8946 /* Handle the more complex case, that the bounds are NOT known
8947 at compile time. In this case we generate run_time calculation
8948 of the number of iterations. */
8950 if (loop_info->iteration_var == 0)
8952 if (loop_dump_stream)
8953 fprintf (loop_dump_stream,
8954 "insert_bct %d: BCT Runtime Instrumentation failed: no loop iteration variable found\n",
8959 if (GET_MODE_CLASS (GET_MODE (loop_info->iteration_var)) != MODE_INT
8960 || GET_MODE_SIZE (GET_MODE (loop_info->iteration_var)) != UNITS_PER_WORD)
8962 if (loop_dump_stream)
8963 fprintf (loop_dump_stream,
8964 "insert_bct %d: BCT Runtime Instrumentation failed: loop variable not integer\n",
8969 /* With runtime bounds, if the compare is of the form '!=' we give up */
8970 if (loop_info->comparison_code == NE)
8972 if (loop_dump_stream)
8973 fprintf (loop_dump_stream,
8974 "insert_bct %d: BCT Runtime Instrumentation failed: runtime bounds with != comparison\n",
8978 /* Use common loop preconditioning code instead. */
8982 /* We rely on the existence of run-time guard to ensure that the
8983 loop executes at least once. */
8985 rtx iterations_num_reg;
8987 unsigned HOST_WIDE_INT increment_value_abs
8988 = INTVAL (increment) * increment_direction;
8990 /* make sure that the increment is a power of two, otherwise (an
8991 expensive) divide is needed. */
8992 if (exact_log2 (increment_value_abs) == -1)
8994 if (loop_dump_stream)
8995 fprintf (loop_dump_stream,
8996 "insert_bct: not instrumenting BCT because the increment is not power of 2\n");
9000 /* compute the number of iterations */
9005 /* Again, the number of iterations is calculated by:
9007 ; compare-val - initial-val + (increment -1) + additional-iteration
9008 ; num_iterations = -----------------------------------------------------------------
9011 /* ??? Do we have to call copy_rtx here before passing rtx to
9013 if (compare_direction > 0)
9015 /* <, <= :the loop variable is increasing */
9016 temp_reg = expand_binop (loop_var_mode, sub_optab,
9017 comparison_value, initial_value,
9018 NULL_RTX, 0, OPTAB_LIB_WIDEN);
9022 temp_reg = expand_binop (loop_var_mode, sub_optab,
9023 initial_value, comparison_value,
9024 NULL_RTX, 0, OPTAB_LIB_WIDEN);
9027 if (increment_value_abs - 1 + add_iteration != 0)
9028 temp_reg = expand_binop (loop_var_mode, add_optab, temp_reg,
9029 GEN_INT (increment_value_abs - 1
9031 NULL_RTX, 0, OPTAB_LIB_WIDEN);
9033 if (increment_value_abs != 1)
9035 /* ??? This will generate an expensive divide instruction for
9036 most targets. The original authors apparently expected this
9037 to be a shift, since they test for power-of-2 divisors above,
9038 but just naively generating a divide instruction will not give
9039 a shift. It happens to work for the PowerPC target because
9040 the rs6000.md file has a divide pattern that emits shifts.
9041 It will probably not work for any other target. */
9042 iterations_num_reg = expand_binop (loop_var_mode, sdiv_optab,
9044 GEN_INT (increment_value_abs),
9045 NULL_RTX, 0, OPTAB_LIB_WIDEN);
9048 iterations_num_reg = temp_reg;
9050 sequence = gen_sequence ();
9052 emit_insn_before (sequence, loop_start);
9053 instrument_loop_bct (loop_start, loop_end, iterations_num_reg);
9057 #endif /* Complex case */
9060 /* Instrument loop by inserting a bct in it as follows:
9061 1. A new counter register is created.
9062 2. In the head of the loop the new variable is initialized to the value
9063 passed in the loop_num_iterations parameter.
9064 3. At the end of the loop, comparison of the register with 0 is generated.
9065 The created comparison follows the pattern defined for the
9066 decrement_and_branch_on_count insn, so this insn will be generated.
9067 4. The branch on the old variable are deleted. The compare must remain
9068 because it might be used elsewhere. If the loop-variable or condition
9069 register are used elsewhere, they will be eliminated by flow. */
9072 instrument_loop_bct (loop_start, loop_end, loop_num_iterations)
9073 rtx loop_start, loop_end;
9074 rtx loop_num_iterations;
9080 if (HAVE_decrement_and_branch_on_count)
9082 if (loop_dump_stream)
9084 fputs ("instrument_bct: Inserting BCT (", loop_dump_stream);
9085 if (GET_CODE (loop_num_iterations) == CONST_INT)
9086 fprintf (loop_dump_stream, HOST_WIDE_INT_PRINT_DEC,
9087 INTVAL (loop_num_iterations));
9089 fputs ("runtime", loop_dump_stream);
9090 fputs (" iterations)", loop_dump_stream);
9093 /* Discard original jump to continue loop. Original compare result
9094 may still be live, so it cannot be discarded explicitly. */
9095 delete_insn (PREV_INSN (loop_end));
9097 /* Insert the label which will delimit the start of the loop. */
9098 start_label = gen_label_rtx ();
9099 emit_label_after (start_label, loop_start);
9101 /* Insert initialization of the count register into the loop header. */
9103 counter_reg = gen_reg_rtx (word_mode);
9104 emit_insn (gen_move_insn (counter_reg, loop_num_iterations));
9105 sequence = gen_sequence ();
9107 emit_insn_before (sequence, loop_start);
9109 /* Insert new comparison on the count register instead of the
9110 old one, generating the needed BCT pattern (that will be
9111 later recognized by assembly generation phase). */
9112 emit_jump_insn_before (gen_decrement_and_branch_on_count (counter_reg,
9115 LABEL_NUSES (start_label)++;
9119 #endif /* HAVE_decrement_and_branch_on_count */
9121 /* Scan the function and determine whether it has indirect (computed) jumps.
9123 This is taken mostly from flow.c; similar code exists elsewhere
9124 in the compiler. It may be useful to put this into rtlanal.c. */
9126 indirect_jump_in_function_p (start)
9131 for (insn = start; insn; insn = NEXT_INSN (insn))
9132 if (computed_jump_p (insn))
9138 /* Add MEM to the LOOP_MEMS array, if appropriate. See the
9139 documentation for LOOP_MEMS for the definition of `appropriate'.
9140 This function is called from prescan_loop via for_each_rtx. */
9143 insert_loop_mem (mem, data)
9145 void *data ATTRIBUTE_UNUSED;
9153 switch (GET_CODE (m))
9159 /* We're not interested in the MEM associated with a
9160 CONST_DOUBLE, so there's no need to traverse into this. */
9164 /* This is not a MEM. */
9168 /* See if we've already seen this MEM. */
9169 for (i = 0; i < loop_mems_idx; ++i)
9170 if (rtx_equal_p (m, loop_mems[i].mem))
9172 if (GET_MODE (m) != GET_MODE (loop_mems[i].mem))
9173 /* The modes of the two memory accesses are different. If
9174 this happens, something tricky is going on, and we just
9175 don't optimize accesses to this MEM. */
9176 loop_mems[i].optimize = 0;
9181 /* Resize the array, if necessary. */
9182 if (loop_mems_idx == loop_mems_allocated)
9184 if (loop_mems_allocated != 0)
9185 loop_mems_allocated *= 2;
9187 loop_mems_allocated = 32;
9189 loop_mems = (loop_mem_info*)
9190 xrealloc (loop_mems,
9191 loop_mems_allocated * sizeof (loop_mem_info));
9194 /* Actually insert the MEM. */
9195 loop_mems[loop_mems_idx].mem = m;
9196 /* We can't hoist this MEM out of the loop if it's a BLKmode MEM
9197 because we can't put it in a register. We still store it in the
9198 table, though, so that if we see the same address later, but in a
9199 non-BLK mode, we'll not think we can optimize it at that point. */
9200 loop_mems[loop_mems_idx].optimize = (GET_MODE (m) != BLKmode);
9201 loop_mems[loop_mems_idx].reg = NULL_RTX;
9207 /* Like load_mems, but also ensures that SET_IN_LOOP,
9208 MAY_NOT_OPTIMIZE, REG_SINGLE_USAGE, and INSN_COUNT have the correct
9209 values after load_mems. */
9212 load_mems_and_recount_loop_regs_set (scan_start, end, loop_top, start,
9220 int nregs = max_reg_num ();
9222 load_mems (scan_start, end, loop_top, start);
9224 /* Recalculate set_in_loop and friends since load_mems may have
9225 created new registers. */
9226 if (max_reg_num () > nregs)
9232 nregs = max_reg_num ();
9234 if ((unsigned) nregs > set_in_loop->num_elements)
9236 /* Grow all the arrays. */
9237 VARRAY_GROW (set_in_loop, nregs);
9238 VARRAY_GROW (n_times_set, nregs);
9239 VARRAY_GROW (may_not_optimize, nregs);
9240 VARRAY_GROW (reg_single_usage, nregs);
9242 /* Clear the arrays */
9243 bzero ((char *) &set_in_loop->data, nregs * sizeof (int));
9244 bzero ((char *) &may_not_optimize->data, nregs * sizeof (char));
9245 bzero ((char *) ®_single_usage->data, nregs * sizeof (rtx));
9247 count_loop_regs_set (loop_top ? loop_top : start, end,
9248 may_not_optimize, reg_single_usage,
9251 for (i = 0; i < FIRST_PSEUDO_REGISTER; i++)
9253 VARRAY_CHAR (may_not_optimize, i) = 1;
9254 VARRAY_INT (set_in_loop, i) = 1;
9257 #ifdef AVOID_CCMODE_COPIES
9258 /* Don't try to move insns which set CC registers if we should not
9259 create CCmode register copies. */
9260 for (i = max_reg_num () - 1; i >= FIRST_PSEUDO_REGISTER; i--)
9261 if (GET_MODE_CLASS (GET_MODE (regno_reg_rtx[i])) == MODE_CC)
9262 VARRAY_CHAR (may_not_optimize, i) = 1;
9265 /* Set n_times_set for the new registers. */
9266 bcopy ((char *) (&set_in_loop->data.i[0] + old_nregs),
9267 (char *) (&n_times_set->data.i[0] + old_nregs),
9268 (nregs - old_nregs) * sizeof (int));
9272 /* Move MEMs into registers for the duration of the loop. SCAN_START
9273 is the first instruction in the loop (as it is executed). The
9274 other parameters are as for next_insn_in_loop. */
9277 load_mems (scan_start, end, loop_top, start)
9283 int maybe_never = 0;
9286 rtx label = NULL_RTX;
9289 if (loop_mems_idx > 0)
9291 /* Nonzero if the next instruction may never be executed. */
9292 int next_maybe_never = 0;
9294 /* Check to see if it's possible that some instructions in the
9295 loop are never executed. */
9296 for (p = next_insn_in_loop (scan_start, scan_start, end, loop_top);
9297 p != NULL_RTX && !maybe_never;
9298 p = next_insn_in_loop (p, scan_start, end, loop_top))
9300 if (GET_CODE (p) == CODE_LABEL)
9302 else if (GET_CODE (p) == JUMP_INSN
9303 /* If we enter the loop in the middle, and scan
9304 around to the beginning, don't set maybe_never
9305 for that. This must be an unconditional jump,
9306 otherwise the code at the top of the loop might
9307 never be executed. Unconditional jumps are
9308 followed a by barrier then loop end. */
9309 && ! (GET_CODE (p) == JUMP_INSN
9310 && JUMP_LABEL (p) == loop_top
9311 && NEXT_INSN (NEXT_INSN (p)) == end
9312 && simplejump_p (p)))
9314 if (!condjump_p (p))
9315 /* Something complicated. */
9318 /* If there are any more instructions in the loop, they
9319 might not be reached. */
9320 next_maybe_never = 1;
9322 else if (next_maybe_never)
9326 /* Actually move the MEMs. */
9327 for (i = 0; i < loop_mems_idx; ++i)
9331 rtx mem = loop_mems[i].mem;
9334 if (MEM_VOLATILE_P (mem)
9335 || invariant_p (XEXP (mem, 0)) != 1)
9336 /* There's no telling whether or not MEM is modified. */
9337 loop_mems[i].optimize = 0;
9339 /* Go through the MEMs written to in the loop to see if this
9340 one is aliased by one of them. */
9341 mem_list_entry = loop_store_mems;
9342 while (mem_list_entry)
9344 if (rtx_equal_p (mem, XEXP (mem_list_entry, 0)))
9346 else if (true_dependence (XEXP (mem_list_entry, 0), VOIDmode,
9349 /* MEM is indeed aliased by this store. */
9350 loop_mems[i].optimize = 0;
9353 mem_list_entry = XEXP (mem_list_entry, 1);
9356 /* If this MEM is written to, we must be sure that there
9357 are no reads from another MEM that aliases this one. */
9358 if (loop_mems[i].optimize && written)
9362 for (j = 0; j < loop_mems_idx; ++j)
9366 else if (true_dependence (mem,
9371 /* It's not safe to hoist loop_mems[i] out of
9372 the loop because writes to it might not be
9373 seen by reads from loop_mems[j]. */
9374 loop_mems[i].optimize = 0;
9380 if (maybe_never && may_trap_p (mem))
9381 /* We can't access the MEM outside the loop; it might
9382 cause a trap that wouldn't have happened otherwise. */
9383 loop_mems[i].optimize = 0;
9385 if (!loop_mems[i].optimize)
9386 /* We thought we were going to lift this MEM out of the
9387 loop, but later discovered that we could not. */
9390 /* Allocate a pseudo for this MEM. We set REG_USERVAR_P in
9391 order to keep scan_loop from moving stores to this MEM
9392 out of the loop just because this REG is neither a
9393 user-variable nor used in the loop test. */
9394 reg = gen_reg_rtx (GET_MODE (mem));
9395 REG_USERVAR_P (reg) = 1;
9396 loop_mems[i].reg = reg;
9398 /* Now, replace all references to the MEM with the
9399 corresponding pesudos. */
9400 for (p = next_insn_in_loop (scan_start, scan_start, end, loop_top);
9402 p = next_insn_in_loop (p, scan_start, end, loop_top))
9407 for_each_rtx (&p, replace_loop_mem, &ri);
9410 if (!apply_change_group ())
9411 /* We couldn't replace all occurrences of the MEM. */
9412 loop_mems[i].optimize = 0;
9417 /* Load the memory immediately before START, which is
9418 the NOTE_LOOP_BEG. */
9419 set = gen_move_insn (reg, mem);
9420 emit_insn_before (set, start);
9424 if (label == NULL_RTX)
9426 /* We must compute the former
9427 right-after-the-end label before we insert
9429 end_label = next_label (end);
9430 label = gen_label_rtx ();
9431 emit_label_after (label, end);
9434 /* Store the memory immediately after END, which is
9435 the NOTE_LOOP_END. */
9436 set = gen_move_insn (copy_rtx (mem), reg);
9437 emit_insn_after (set, label);
9440 if (loop_dump_stream)
9442 fprintf (loop_dump_stream, "Hoisted regno %d %s from ",
9443 REGNO (reg), (written ? "r/w" : "r/o"));
9444 print_rtl (loop_dump_stream, mem);
9445 fputc ('\n', loop_dump_stream);
9451 if (label != NULL_RTX)
9453 /* Now, we need to replace all references to the previous exit
9454 label with the new one. */
9459 for (p = start; p != end; p = NEXT_INSN (p))
9461 for_each_rtx (&p, replace_label, &rr);
9463 /* If this is a JUMP_INSN, then we also need to fix the JUMP_LABEL
9464 field. This is not handled by for_each_rtx because it doesn't
9465 handle unprinted ('0') fields. We need to update JUMP_LABEL
9466 because the immediately following unroll pass will use it.
9467 replace_label would not work anyways, because that only handles
9469 if (GET_CODE (p) == JUMP_INSN && JUMP_LABEL (p) == end_label)
9470 JUMP_LABEL (p) = label;
9475 /* Replace MEM with its associated pseudo register. This function is
9476 called from load_mems via for_each_rtx. DATA is actually an
9477 rtx_and_int * describing the instruction currently being scanned
9478 and the MEM we are currently replacing. */
9481 replace_loop_mem (mem, data)
9493 switch (GET_CODE (m))
9499 /* We're not interested in the MEM associated with a
9500 CONST_DOUBLE, so there's no need to traverse into one. */
9504 /* This is not a MEM. */
9508 ri = (rtx_and_int*) data;
9511 if (!rtx_equal_p (loop_mems[i].mem, m))
9512 /* This is not the MEM we are currently replacing. */
9517 /* Actually replace the MEM. */
9518 validate_change (insn, mem, loop_mems[i].reg, 1);
9523 /* Replace occurrences of the old exit label for the loop with the new
9524 one. DATA is an rtx_pair containing the old and new labels,
9528 replace_label (x, data)
9533 rtx old_label = ((rtx_pair*) data)->r1;
9534 rtx new_label = ((rtx_pair*) data)->r2;
9539 if (GET_CODE (l) != LABEL_REF)
9542 if (XEXP (l, 0) != old_label)
9545 XEXP (l, 0) = new_label;
9546 ++LABEL_NUSES (new_label);
9547 --LABEL_NUSES (old_label);