2 Copyright (C) 2003, 2004, 2005 Free Software Foundation, Inc.
3 Contributed by Dorit Naishlos <dorit@il.ibm.com>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 2, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING. If not, write to the Free
19 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
22 /* Loop Vectorization Pass.
24 This pass tries to vectorize loops. This first implementation focuses on
25 simple inner-most loops, with no conditional control flow, and a set of
26 simple operations which vector form can be expressed using existing
27 tree codes (PLUS, MULT etc).
29 For example, the vectorizer transforms the following simple loop:
31 short a[N]; short b[N]; short c[N]; int i;
37 as if it was manually vectorized by rewriting the source code into:
39 typedef int __attribute__((mode(V8HI))) v8hi;
40 short a[N]; short b[N]; short c[N]; int i;
41 v8hi *pa = (v8hi*)a, *pb = (v8hi*)b, *pc = (v8hi*)c;
44 for (i=0; i<N/8; i++){
51 The main entry to this pass is vectorize_loops(), in which
52 the vectorizer applies a set of analyses on a given set of loops,
53 followed by the actual vectorization transformation for the loops that
54 had successfully passed the analysis phase.
56 Throughout this pass we make a distinction between two types of
57 data: scalars (which are represented by SSA_NAMES), and memory references
58 ("data-refs"). These two types of data require different handling both
59 during analysis and transformation. The types of data-refs that the
60 vectorizer currently supports are ARRAY_REFS which base is an array DECL
61 (not a pointer), and INDIRECT_REFS through pointers; both array and pointer
62 accesses are required to have a simple (consecutive) access pattern.
66 The driver for the analysis phase is vect_analyze_loop_nest().
67 It applies a set of analyses, some of which rely on the scalar evolution
68 analyzer (scev) developed by Sebastian Pop.
70 During the analysis phase the vectorizer records some information
71 per stmt in a "stmt_vec_info" struct which is attached to each stmt in the
72 loop, as well as general information about the loop as a whole, which is
73 recorded in a "loop_vec_info" struct attached to each loop.
77 The loop transformation phase scans all the stmts in the loop, and
78 creates a vector stmt (or a sequence of stmts) for each scalar stmt S in
79 the loop that needs to be vectorized. It insert the vector code sequence
80 just before the scalar stmt S, and records a pointer to the vector code
81 in STMT_VINFO_VEC_STMT (stmt_info) (stmt_info is the stmt_vec_info struct
82 attached to S). This pointer will be used for the vectorization of following
83 stmts which use the def of stmt S. Stmt S is removed if it writes to memory;
84 otherwise, we rely on dead code elimination for removing it.
86 For example, say stmt S1 was vectorized into stmt VS1:
89 S1: b = x[i]; STMT_VINFO_VEC_STMT (stmt_info (S1)) = VS1
92 To vectorize stmt S2, the vectorizer first finds the stmt that defines
93 the operand 'b' (S1), and gets the relevant vector def 'vb' from the
94 vector stmt VS1 pointed by STMT_VINFO_VEC_STMT (stmt_info (S1)). The
95 resulting sequence would be:
98 S1: b = x[i]; STMT_VINFO_VEC_STMT (stmt_info (S1)) = VS1
100 S2: a = b; STMT_VINFO_VEC_STMT (stmt_info (S2)) = VS2
102 Operands that are not SSA_NAMEs, are data-refs that appear in
103 load/store operations (like 'x[i]' in S1), and are handled differently.
107 Currently the only target specific information that is used is the
108 size of the vector (in bytes) - "UNITS_PER_SIMD_WORD". Targets that can
109 support different sizes of vectors, for now will need to specify one value
110 for "UNITS_PER_SIMD_WORD". More flexibility will be added in the future.
112 Since we only vectorize operations which vector form can be
113 expressed using existing tree codes, to verify that an operation is
114 supported, the vectorizer checks the relevant optab at the relevant
115 machine_mode (e.g, add_optab->handlers[(int) V8HImode].insn_code). If
116 the value found is CODE_FOR_nothing, then there's no target support, and
117 we can't vectorize the stmt.
119 For additional information on this project see:
120 http://gcc.gnu.org/projects/tree-ssa/vectorization.html
125 #include "coretypes.h"
131 #include "basic-block.h"
132 #include "diagnostic.h"
133 #include "tree-flow.h"
134 #include "tree-dump.h"
137 #include "cfglayout.h"
141 #include "tree-chrec.h"
142 #include "tree-data-ref.h"
143 #include "tree-scalar-evolution.h"
145 #include "tree-vectorizer.h"
146 #include "tree-pass.h"
148 /*************************************************************************
149 Simple Loop Peeling Utilities
150 *************************************************************************/
151 static struct loop *slpeel_tree_duplicate_loop_to_edge_cfg
152 (struct loop *, struct loops *, edge);
153 static void slpeel_update_phis_for_duplicate_loop
154 (struct loop *, struct loop *, bool after);
155 static void slpeel_update_phi_nodes_for_guard1
156 (edge, struct loop *, bool, basic_block *, bitmap *);
157 static void slpeel_update_phi_nodes_for_guard2
158 (edge, struct loop *, bool, basic_block *);
159 static edge slpeel_add_loop_guard (basic_block, tree, basic_block, basic_block);
161 static void rename_use_op (use_operand_p);
162 static void rename_variables_in_bb (basic_block);
163 static void rename_variables_in_loop (struct loop *);
165 /*************************************************************************
166 General Vectorization Utilities
167 *************************************************************************/
168 static void vect_set_dump_settings (void);
170 /* vect_dump will be set to stderr or dump_file if exist. */
173 /* vect_verbosity_level set to an invalid value
174 to mark that it's uninitialized. */
175 enum verbosity_levels vect_verbosity_level = MAX_VERBOSITY_LEVEL;
177 /* Number of loops, at the beginning of vectorization. */
178 unsigned int vect_loops_num;
181 static LOC vect_loop_location;
183 /*************************************************************************
184 Simple Loop Peeling Utilities
186 Utilities to support loop peeling for vectorization purposes.
187 *************************************************************************/
190 /* Renames the use *OP_P. */
193 rename_use_op (use_operand_p op_p)
197 if (TREE_CODE (USE_FROM_PTR (op_p)) != SSA_NAME)
200 new_name = get_current_def (USE_FROM_PTR (op_p));
202 /* Something defined outside of the loop. */
206 /* An ordinary ssa name defined in the loop. */
208 SET_USE (op_p, new_name);
212 /* Renames the variables in basic block BB. */
215 rename_variables_in_bb (basic_block bb)
218 block_stmt_iterator bsi;
224 struct loop *loop = bb->loop_father;
226 for (bsi = bsi_start (bb); !bsi_end_p (bsi); bsi_next (&bsi))
228 stmt = bsi_stmt (bsi);
229 FOR_EACH_SSA_USE_OPERAND (use_p, stmt, iter,
230 (SSA_OP_ALL_USES | SSA_OP_ALL_KILLS))
231 rename_use_op (use_p);
234 FOR_EACH_EDGE (e, ei, bb->succs)
236 if (!flow_bb_inside_loop_p (loop, e->dest))
238 for (phi = phi_nodes (e->dest); phi; phi = PHI_CHAIN (phi))
239 rename_use_op (PHI_ARG_DEF_PTR_FROM_EDGE (phi, e));
244 /* Renames variables in new generated LOOP. */
247 rename_variables_in_loop (struct loop *loop)
252 bbs = get_loop_body (loop);
254 for (i = 0; i < loop->num_nodes; i++)
255 rename_variables_in_bb (bbs[i]);
261 /* Update the PHI nodes of NEW_LOOP.
263 NEW_LOOP is a duplicate of ORIG_LOOP.
264 AFTER indicates whether NEW_LOOP executes before or after ORIG_LOOP:
265 AFTER is true if NEW_LOOP executes after ORIG_LOOP, and false if it
266 executes before it. */
269 slpeel_update_phis_for_duplicate_loop (struct loop *orig_loop,
270 struct loop *new_loop, bool after)
273 tree phi_new, phi_orig;
275 edge orig_loop_latch = loop_latch_edge (orig_loop);
276 edge orig_entry_e = loop_preheader_edge (orig_loop);
277 edge new_loop_exit_e = new_loop->single_exit;
278 edge new_loop_entry_e = loop_preheader_edge (new_loop);
279 edge entry_arg_e = (after ? orig_loop_latch : orig_entry_e);
282 step 1. For each loop-header-phi:
283 Add the first phi argument for the phi in NEW_LOOP
284 (the one associated with the entry of NEW_LOOP)
286 step 2. For each loop-header-phi:
287 Add the second phi argument for the phi in NEW_LOOP
288 (the one associated with the latch of NEW_LOOP)
290 step 3. Update the phis in the successor block of NEW_LOOP.
292 case 1: NEW_LOOP was placed before ORIG_LOOP:
293 The successor block of NEW_LOOP is the header of ORIG_LOOP.
294 Updating the phis in the successor block can therefore be done
295 along with the scanning of the loop header phis, because the
296 header blocks of ORIG_LOOP and NEW_LOOP have exactly the same
297 phi nodes, organized in the same order.
299 case 2: NEW_LOOP was placed after ORIG_LOOP:
300 The successor block of NEW_LOOP is the original exit block of
301 ORIG_LOOP - the phis to be updated are the loop-closed-ssa phis.
302 We postpone updating these phis to a later stage (when
303 loop guards are added).
307 /* Scan the phis in the headers of the old and new loops
308 (they are organized in exactly the same order). */
310 for (phi_new = phi_nodes (new_loop->header),
311 phi_orig = phi_nodes (orig_loop->header);
313 phi_new = PHI_CHAIN (phi_new), phi_orig = PHI_CHAIN (phi_orig))
316 def = PHI_ARG_DEF_FROM_EDGE (phi_orig, entry_arg_e);
317 add_phi_arg (phi_new, def, new_loop_entry_e);
320 def = PHI_ARG_DEF_FROM_EDGE (phi_orig, orig_loop_latch);
321 if (TREE_CODE (def) != SSA_NAME)
324 new_ssa_name = get_current_def (def);
327 /* This only happens if there are no definitions
328 inside the loop. use the phi_result in this case. */
329 new_ssa_name = PHI_RESULT (phi_new);
332 /* An ordinary ssa name defined in the loop. */
333 add_phi_arg (phi_new, new_ssa_name, loop_latch_edge (new_loop));
335 /* step 3 (case 1). */
338 gcc_assert (new_loop_exit_e == orig_entry_e);
339 SET_PHI_ARG_DEF (phi_orig,
340 new_loop_exit_e->dest_idx,
347 /* Update PHI nodes for a guard of the LOOP.
350 - LOOP, GUARD_EDGE: LOOP is a loop for which we added guard code that
351 controls whether LOOP is to be executed. GUARD_EDGE is the edge that
352 originates from the guard-bb, skips LOOP and reaches the (unique) exit
353 bb of LOOP. This loop-exit-bb is an empty bb with one successor.
354 We denote this bb NEW_MERGE_BB because before the guard code was added
355 it had a single predecessor (the LOOP header), and now it became a merge
356 point of two paths - the path that ends with the LOOP exit-edge, and
357 the path that ends with GUARD_EDGE.
358 - NEW_EXIT_BB: New basic block that is added by this function between LOOP
359 and NEW_MERGE_BB. It is used to place loop-closed-ssa-form exit-phis.
361 ===> The CFG before the guard-code was added:
364 if (exit_loop) goto update_bb
365 else goto LOOP_header_bb
368 ==> The CFG after the guard-code was added:
370 if (LOOP_guard_condition) goto new_merge_bb
371 else goto LOOP_header_bb
374 if (exit_loop_condition) goto new_merge_bb
375 else goto LOOP_header_bb
380 ==> The CFG after this function:
382 if (LOOP_guard_condition) goto new_merge_bb
383 else goto LOOP_header_bb
386 if (exit_loop_condition) goto new_exit_bb
387 else goto LOOP_header_bb
394 1. creates and updates the relevant phi nodes to account for the new
395 incoming edge (GUARD_EDGE) into NEW_MERGE_BB. This involves:
396 1.1. Create phi nodes at NEW_MERGE_BB.
397 1.2. Update the phi nodes at the successor of NEW_MERGE_BB (denoted
398 UPDATE_BB). UPDATE_BB was the exit-bb of LOOP before NEW_MERGE_BB
399 2. preserves loop-closed-ssa-form by creating the required phi nodes
400 at the exit of LOOP (i.e, in NEW_EXIT_BB).
402 There are two flavors to this function:
404 slpeel_update_phi_nodes_for_guard1:
405 Here the guard controls whether we enter or skip LOOP, where LOOP is a
406 prolog_loop (loop1 below), and the new phis created in NEW_MERGE_BB are
407 for variables that have phis in the loop header.
409 slpeel_update_phi_nodes_for_guard2:
410 Here the guard controls whether we enter or skip LOOP, where LOOP is an
411 epilog_loop (loop2 below), and the new phis created in NEW_MERGE_BB are
412 for variables that have phis in the loop exit.
414 I.E., the overall structure is:
417 guard1 (goto loop1/merg1_bb)
420 guard2 (goto merge1_bb/merge2_bb)
427 slpeel_update_phi_nodes_for_guard1 takes care of creating phis in
428 loop1_exit_bb and merge1_bb. These are entry phis (phis for the vars
429 that have phis in loop1->header).
431 slpeel_update_phi_nodes_for_guard2 takes care of creating phis in
432 loop2_exit_bb and merge2_bb. These are exit phis (phis for the vars
433 that have phis in next_bb). It also adds some of these phis to
436 slpeel_update_phi_nodes_for_guard1 is always called before
437 slpeel_update_phi_nodes_for_guard2. They are both needed in order
438 to create correct data-flow and loop-closed-ssa-form.
440 Generally slpeel_update_phi_nodes_for_guard1 creates phis for variables
441 that change between iterations of a loop (and therefore have a phi-node
442 at the loop entry), whereas slpeel_update_phi_nodes_for_guard2 creates
443 phis for variables that are used out of the loop (and therefore have
444 loop-closed exit phis). Some variables may be both updated between
445 iterations and used after the loop. This is why in loop1_exit_bb we
446 may need both entry_phis (created by slpeel_update_phi_nodes_for_guard1)
447 and exit phis (created by slpeel_update_phi_nodes_for_guard2).
449 - IS_NEW_LOOP: if IS_NEW_LOOP is true, then LOOP is a newly created copy of
450 an original loop. i.e., we have:
453 guard_bb (goto LOOP/new_merge)
459 If IS_NEW_LOOP is false, then LOOP is an original loop, in which case we
463 guard_bb (goto LOOP/new_merge)
469 The SSA names defined in the original loop have a current
470 reaching definition that that records the corresponding new
471 ssa-name used in the new duplicated loop copy.
474 /* Function slpeel_update_phi_nodes_for_guard1
477 - GUARD_EDGE, LOOP, IS_NEW_LOOP, NEW_EXIT_BB - as explained above.
478 - DEFS - a bitmap of ssa names to mark new names for which we recorded
481 In the context of the overall structure, we have:
484 guard1 (goto loop1/merg1_bb)
487 guard2 (goto merge1_bb/merge2_bb)
494 For each name updated between loop iterations (i.e - for each name that has
495 an entry (loop-header) phi in LOOP) we create a new phi in:
496 1. merge1_bb (to account for the edge from guard1)
497 2. loop1_exit_bb (an exit-phi to keep LOOP in loop-closed form)
501 slpeel_update_phi_nodes_for_guard1 (edge guard_edge, struct loop *loop,
502 bool is_new_loop, basic_block *new_exit_bb,
505 tree orig_phi, new_phi;
506 tree update_phi, update_phi2;
507 tree guard_arg, loop_arg;
508 basic_block new_merge_bb = guard_edge->dest;
509 edge e = EDGE_SUCC (new_merge_bb, 0);
510 basic_block update_bb = e->dest;
511 basic_block orig_bb = loop->header;
513 tree current_new_name;
515 /* Create new bb between loop and new_merge_bb. */
516 *new_exit_bb = split_edge (loop->single_exit);
517 add_bb_to_loop (*new_exit_bb, loop->outer);
519 new_exit_e = EDGE_SUCC (*new_exit_bb, 0);
521 for (orig_phi = phi_nodes (orig_bb), update_phi = phi_nodes (update_bb);
522 orig_phi && update_phi;
523 orig_phi = PHI_CHAIN (orig_phi), update_phi = PHI_CHAIN (update_phi))
525 /** 1. Handle new-merge-point phis **/
527 /* 1.1. Generate new phi node in NEW_MERGE_BB: */
528 new_phi = create_phi_node (SSA_NAME_VAR (PHI_RESULT (orig_phi)),
531 /* 1.2. NEW_MERGE_BB has two incoming edges: GUARD_EDGE and the exit-edge
532 of LOOP. Set the two phi args in NEW_PHI for these edges: */
533 loop_arg = PHI_ARG_DEF_FROM_EDGE (orig_phi, EDGE_SUCC (loop->latch, 0));
534 guard_arg = PHI_ARG_DEF_FROM_EDGE (orig_phi, loop_preheader_edge (loop));
536 add_phi_arg (new_phi, loop_arg, new_exit_e);
537 add_phi_arg (new_phi, guard_arg, guard_edge);
539 /* 1.3. Update phi in successor block. */
540 gcc_assert (PHI_ARG_DEF_FROM_EDGE (update_phi, e) == loop_arg
541 || PHI_ARG_DEF_FROM_EDGE (update_phi, e) == guard_arg);
542 SET_PHI_ARG_DEF (update_phi, e->dest_idx, PHI_RESULT (new_phi));
543 update_phi2 = new_phi;
546 /** 2. Handle loop-closed-ssa-form phis **/
548 /* 2.1. Generate new phi node in NEW_EXIT_BB: */
549 new_phi = create_phi_node (SSA_NAME_VAR (PHI_RESULT (orig_phi)),
552 /* 2.2. NEW_EXIT_BB has one incoming edge: the exit-edge of the loop. */
553 add_phi_arg (new_phi, loop_arg, loop->single_exit);
555 /* 2.3. Update phi in successor of NEW_EXIT_BB: */
556 gcc_assert (PHI_ARG_DEF_FROM_EDGE (update_phi2, new_exit_e) == loop_arg);
557 SET_PHI_ARG_DEF (update_phi2, new_exit_e->dest_idx, PHI_RESULT (new_phi));
559 /* 2.4. Record the newly created name with set_current_def.
560 We want to find a name such that
561 name = get_current_def (orig_loop_name)
562 and to set its current definition as follows:
563 set_current_def (name, new_phi_name)
565 If LOOP is a new loop then loop_arg is already the name we're
566 looking for. If LOOP is the original loop, then loop_arg is
567 the orig_loop_name and the relevant name is recorded in its
568 current reaching definition. */
570 current_new_name = loop_arg;
573 current_new_name = get_current_def (loop_arg);
574 /* current_def is not available only if the variable does not
575 change inside the loop, in which case we also don't care
576 about recording a current_def for it because we won't be
577 trying to create loop-exit-phis for it. */
578 if (!current_new_name)
581 gcc_assert (get_current_def (current_new_name) == NULL_TREE);
583 set_current_def (current_new_name, PHI_RESULT (new_phi));
584 bitmap_set_bit (*defs, SSA_NAME_VERSION (current_new_name));
587 set_phi_nodes (new_merge_bb, phi_reverse (phi_nodes (new_merge_bb)));
591 /* Function slpeel_update_phi_nodes_for_guard2
594 - GUARD_EDGE, LOOP, IS_NEW_LOOP, NEW_EXIT_BB - as explained above.
596 In the context of the overall structure, we have:
599 guard1 (goto loop1/merg1_bb)
602 guard2 (goto merge1_bb/merge2_bb)
609 For each name used out side the loop (i.e - for each name that has an exit
610 phi in next_bb) we create a new phi in:
611 1. merge2_bb (to account for the edge from guard_bb)
612 2. loop2_exit_bb (an exit-phi to keep LOOP in loop-closed form)
613 3. guard2 bb (an exit phi to keep the preceding loop in loop-closed form),
614 if needed (if it wasn't handled by slpeel_update_phis_nodes_for_phi1).
618 slpeel_update_phi_nodes_for_guard2 (edge guard_edge, struct loop *loop,
619 bool is_new_loop, basic_block *new_exit_bb)
621 tree orig_phi, new_phi;
622 tree update_phi, update_phi2;
623 tree guard_arg, loop_arg;
624 basic_block new_merge_bb = guard_edge->dest;
625 edge e = EDGE_SUCC (new_merge_bb, 0);
626 basic_block update_bb = e->dest;
628 tree orig_def, orig_def_new_name;
629 tree new_name, new_name2;
632 /* Create new bb between loop and new_merge_bb. */
633 *new_exit_bb = split_edge (loop->single_exit);
634 add_bb_to_loop (*new_exit_bb, loop->outer);
636 new_exit_e = EDGE_SUCC (*new_exit_bb, 0);
638 for (update_phi = phi_nodes (update_bb); update_phi;
639 update_phi = PHI_CHAIN (update_phi))
641 orig_phi = update_phi;
642 orig_def = PHI_ARG_DEF_FROM_EDGE (orig_phi, e);
643 orig_def_new_name = get_current_def (orig_def);
646 /** 1. Handle new-merge-point phis **/
648 /* 1.1. Generate new phi node in NEW_MERGE_BB: */
649 new_phi = create_phi_node (SSA_NAME_VAR (PHI_RESULT (orig_phi)),
652 /* 1.2. NEW_MERGE_BB has two incoming edges: GUARD_EDGE and the exit-edge
653 of LOOP. Set the two PHI args in NEW_PHI for these edges: */
655 new_name2 = NULL_TREE;
656 if (orig_def_new_name)
658 new_name = orig_def_new_name;
659 /* Some variables have both loop-entry-phis and loop-exit-phis.
660 Such variables were given yet newer names by phis placed in
661 guard_bb by slpeel_update_phi_nodes_for_guard1. I.e:
662 new_name2 = get_current_def (get_current_def (orig_name)). */
663 new_name2 = get_current_def (new_name);
668 guard_arg = orig_def;
673 guard_arg = new_name;
677 guard_arg = new_name2;
679 add_phi_arg (new_phi, loop_arg, new_exit_e);
680 add_phi_arg (new_phi, guard_arg, guard_edge);
682 /* 1.3. Update phi in successor block. */
683 gcc_assert (PHI_ARG_DEF_FROM_EDGE (update_phi, e) == orig_def);
684 SET_PHI_ARG_DEF (update_phi, e->dest_idx, PHI_RESULT (new_phi));
685 update_phi2 = new_phi;
688 /** 2. Handle loop-closed-ssa-form phis **/
690 /* 2.1. Generate new phi node in NEW_EXIT_BB: */
691 new_phi = create_phi_node (SSA_NAME_VAR (PHI_RESULT (orig_phi)),
694 /* 2.2. NEW_EXIT_BB has one incoming edge: the exit-edge of the loop. */
695 add_phi_arg (new_phi, loop_arg, loop->single_exit);
697 /* 2.3. Update phi in successor of NEW_EXIT_BB: */
698 gcc_assert (PHI_ARG_DEF_FROM_EDGE (update_phi2, new_exit_e) == loop_arg);
699 SET_PHI_ARG_DEF (update_phi2, new_exit_e->dest_idx, PHI_RESULT (new_phi));
702 /** 3. Handle loop-closed-ssa-form phis for first loop **/
704 /* 3.1. Find the relevant names that need an exit-phi in
705 GUARD_BB, i.e. names for which
706 slpeel_update_phi_nodes_for_guard1 had not already created a
707 phi node. This is the case for names that are used outside
708 the loop (and therefore need an exit phi) but are not updated
709 across loop iterations (and therefore don't have a
712 slpeel_update_phi_nodes_for_guard1 is responsible for
713 creating loop-exit phis in GUARD_BB for names that have a
714 loop-header-phi. When such a phi is created we also record
715 the new name in its current definition. If this new name
716 exists, then guard_arg was set to this new name (see 1.2
717 above). Therefore, if guard_arg is not this new name, this
718 is an indication that an exit-phi in GUARD_BB was not yet
719 created, so we take care of it here. */
720 if (guard_arg == new_name2)
724 /* 3.2. Generate new phi node in GUARD_BB: */
725 new_phi = create_phi_node (SSA_NAME_VAR (PHI_RESULT (orig_phi)),
728 /* 3.3. GUARD_BB has one incoming edge: */
729 gcc_assert (EDGE_COUNT (guard_edge->src->preds) == 1);
730 add_phi_arg (new_phi, arg, EDGE_PRED (guard_edge->src, 0));
732 /* 3.4. Update phi in successor of GUARD_BB: */
733 gcc_assert (PHI_ARG_DEF_FROM_EDGE (update_phi2, guard_edge)
735 SET_PHI_ARG_DEF (update_phi2, guard_edge->dest_idx, PHI_RESULT (new_phi));
738 set_phi_nodes (new_merge_bb, phi_reverse (phi_nodes (new_merge_bb)));
742 /* Make the LOOP iterate NITERS times. This is done by adding a new IV
743 that starts at zero, increases by one and its limit is NITERS.
745 Assumption: the exit-condition of LOOP is the last stmt in the loop. */
748 slpeel_make_loop_iterate_ntimes (struct loop *loop, tree niters)
750 tree indx_before_incr, indx_after_incr, cond_stmt, cond;
752 edge exit_edge = loop->single_exit;
753 block_stmt_iterator loop_cond_bsi;
754 block_stmt_iterator incr_bsi;
756 tree begin_label = tree_block_label (loop->latch);
757 tree exit_label = tree_block_label (loop->single_exit->dest);
758 tree init = build_int_cst (TREE_TYPE (niters), 0);
759 tree step = build_int_cst (TREE_TYPE (niters), 1);
764 orig_cond = get_loop_exit_condition (loop);
765 gcc_assert (orig_cond);
766 loop_cond_bsi = bsi_for_stmt (orig_cond);
768 standard_iv_increment_position (loop, &incr_bsi, &insert_after);
769 create_iv (init, step, NULL_TREE, loop,
770 &incr_bsi, insert_after, &indx_before_incr, &indx_after_incr);
772 if (exit_edge->flags & EDGE_TRUE_VALUE) /* 'then' edge exits the loop. */
774 cond = build2 (GE_EXPR, boolean_type_node, indx_after_incr, niters);
775 then_label = build1 (GOTO_EXPR, void_type_node, exit_label);
776 else_label = build1 (GOTO_EXPR, void_type_node, begin_label);
778 else /* 'then' edge loops back. */
780 cond = build2 (LT_EXPR, boolean_type_node, indx_after_incr, niters);
781 then_label = build1 (GOTO_EXPR, void_type_node, begin_label);
782 else_label = build1 (GOTO_EXPR, void_type_node, exit_label);
785 cond_stmt = build3 (COND_EXPR, TREE_TYPE (orig_cond), cond,
786 then_label, else_label);
787 bsi_insert_before (&loop_cond_bsi, cond_stmt, BSI_SAME_STMT);
789 /* Remove old loop exit test: */
790 bsi_remove (&loop_cond_bsi);
792 loop_loc = find_loop_location (loop);
793 if (dump_file && (dump_flags & TDF_DETAILS))
795 if (loop_loc != UNKNOWN_LOC)
796 fprintf (dump_file, "\nloop at %s:%d: ",
797 LOC_FILE (loop_loc), LOC_LINE (loop_loc));
798 print_generic_expr (dump_file, cond_stmt, TDF_SLIM);
801 loop->nb_iterations = niters;
805 /* Given LOOP this function generates a new copy of it and puts it
806 on E which is either the entry or exit of LOOP. */
809 slpeel_tree_duplicate_loop_to_edge_cfg (struct loop *loop, struct loops *loops,
812 struct loop *new_loop;
813 basic_block *new_bbs, *bbs;
816 basic_block exit_dest;
819 at_exit = (e == loop->single_exit);
820 if (!at_exit && e != loop_preheader_edge (loop))
823 bbs = get_loop_body (loop);
825 /* Check whether duplication is possible. */
826 if (!can_copy_bbs_p (bbs, loop->num_nodes))
832 /* Generate new loop structure. */
833 new_loop = duplicate_loop (loops, loop, loop->outer);
840 exit_dest = loop->single_exit->dest;
841 was_imm_dom = (get_immediate_dominator (CDI_DOMINATORS,
842 exit_dest) == loop->header ?
845 new_bbs = xmalloc (sizeof (basic_block) * loop->num_nodes);
847 copy_bbs (bbs, loop->num_nodes, new_bbs,
848 &loop->single_exit, 1, &new_loop->single_exit, NULL);
850 /* Duplicating phi args at exit bbs as coming
851 also from exit of duplicated loop. */
852 for (phi = phi_nodes (exit_dest); phi; phi = PHI_CHAIN (phi))
854 phi_arg = PHI_ARG_DEF_FROM_EDGE (phi, loop->single_exit);
857 edge new_loop_exit_edge;
859 if (EDGE_SUCC (new_loop->header, 0)->dest == new_loop->latch)
860 new_loop_exit_edge = EDGE_SUCC (new_loop->header, 1);
862 new_loop_exit_edge = EDGE_SUCC (new_loop->header, 0);
864 add_phi_arg (phi, phi_arg, new_loop_exit_edge);
868 if (at_exit) /* Add the loop copy at exit. */
870 redirect_edge_and_branch_force (e, new_loop->header);
871 set_immediate_dominator (CDI_DOMINATORS, new_loop->header, e->src);
873 set_immediate_dominator (CDI_DOMINATORS, exit_dest, new_loop->header);
875 else /* Add the copy at entry. */
878 edge entry_e = loop_preheader_edge (loop);
879 basic_block preheader = entry_e->src;
881 if (!flow_bb_inside_loop_p (new_loop,
882 EDGE_SUCC (new_loop->header, 0)->dest))
883 new_exit_e = EDGE_SUCC (new_loop->header, 0);
885 new_exit_e = EDGE_SUCC (new_loop->header, 1);
887 redirect_edge_and_branch_force (new_exit_e, loop->header);
888 set_immediate_dominator (CDI_DOMINATORS, loop->header,
891 /* We have to add phi args to the loop->header here as coming
892 from new_exit_e edge. */
893 for (phi = phi_nodes (loop->header); phi; phi = PHI_CHAIN (phi))
895 phi_arg = PHI_ARG_DEF_FROM_EDGE (phi, entry_e);
897 add_phi_arg (phi, phi_arg, new_exit_e);
900 redirect_edge_and_branch_force (entry_e, new_loop->header);
901 set_immediate_dominator (CDI_DOMINATORS, new_loop->header, preheader);
911 /* Given the condition statement COND, put it as the last statement
912 of GUARD_BB; EXIT_BB is the basic block to skip the loop;
913 Assumes that this is the single exit of the guarded loop.
914 Returns the skip edge. */
917 slpeel_add_loop_guard (basic_block guard_bb, tree cond, basic_block exit_bb,
920 block_stmt_iterator bsi;
922 tree cond_stmt, then_label, else_label;
924 enter_e = EDGE_SUCC (guard_bb, 0);
925 enter_e->flags &= ~EDGE_FALLTHRU;
926 enter_e->flags |= EDGE_FALSE_VALUE;
927 bsi = bsi_last (guard_bb);
929 then_label = build1 (GOTO_EXPR, void_type_node,
930 tree_block_label (exit_bb));
931 else_label = build1 (GOTO_EXPR, void_type_node,
932 tree_block_label (enter_e->dest));
933 cond_stmt = build3 (COND_EXPR, void_type_node, cond,
934 then_label, else_label);
935 bsi_insert_after (&bsi, cond_stmt, BSI_NEW_STMT);
936 /* Add new edge to connect guard block to the merge/loop-exit block. */
937 new_e = make_edge (guard_bb, exit_bb, EDGE_TRUE_VALUE);
938 set_immediate_dominator (CDI_DOMINATORS, exit_bb, dom_bb);
943 /* This function verifies that the following restrictions apply to LOOP:
945 (2) it consists of exactly 2 basic blocks - header, and an empty latch.
946 (3) it is single entry, single exit
947 (4) its exit condition is the last stmt in the header
948 (5) E is the entry/exit edge of LOOP.
952 slpeel_can_duplicate_loop_p (struct loop *loop, edge e)
954 edge exit_e = loop->single_exit;
955 edge entry_e = loop_preheader_edge (loop);
956 tree orig_cond = get_loop_exit_condition (loop);
957 block_stmt_iterator loop_exit_bsi = bsi_last (exit_e->src);
959 if (need_ssa_update_p ())
963 /* All loops have an outer scope; the only case loop->outer is NULL is for
964 the function itself. */
966 || loop->num_nodes != 2
967 || !empty_block_p (loop->latch)
968 || !loop->single_exit
969 /* Verify that new loop exit condition can be trivially modified. */
970 || (!orig_cond || orig_cond != bsi_stmt (loop_exit_bsi))
971 || (e != exit_e && e != entry_e))
977 #ifdef ENABLE_CHECKING
979 slpeel_verify_cfg_after_peeling (struct loop *first_loop,
980 struct loop *second_loop)
982 basic_block loop1_exit_bb = first_loop->single_exit->dest;
983 basic_block loop2_entry_bb = loop_preheader_edge (second_loop)->src;
984 basic_block loop1_entry_bb = loop_preheader_edge (first_loop)->src;
986 /* A guard that controls whether the second_loop is to be executed or skipped
987 is placed in first_loop->exit. first_loopt->exit therefore has two
988 successors - one is the preheader of second_loop, and the other is a bb
991 gcc_assert (EDGE_COUNT (loop1_exit_bb->succs) == 2);
993 /* 1. Verify that one of the successors of first_loopt->exit is the preheader
996 /* The preheader of new_loop is expected to have two predecessors:
997 first_loop->exit and the block that precedes first_loop. */
999 gcc_assert (EDGE_COUNT (loop2_entry_bb->preds) == 2
1000 && ((EDGE_PRED (loop2_entry_bb, 0)->src == loop1_exit_bb
1001 && EDGE_PRED (loop2_entry_bb, 1)->src == loop1_entry_bb)
1002 || (EDGE_PRED (loop2_entry_bb, 1)->src == loop1_exit_bb
1003 && EDGE_PRED (loop2_entry_bb, 0)->src == loop1_entry_bb)));
1005 /* Verify that the other successor of first_loopt->exit is after the
1011 /* Function slpeel_tree_peel_loop_to_edge.
1013 Peel the first (last) iterations of LOOP into a new prolog (epilog) loop
1014 that is placed on the entry (exit) edge E of LOOP. After this transformation
1015 we have two loops one after the other - first-loop iterates FIRST_NITERS
1016 times, and second-loop iterates the remainder NITERS - FIRST_NITERS times.
1019 - LOOP: the loop to be peeled.
1020 - E: the exit or entry edge of LOOP.
1021 If it is the entry edge, we peel the first iterations of LOOP. In this
1022 case first-loop is LOOP, and second-loop is the newly created loop.
1023 If it is the exit edge, we peel the last iterations of LOOP. In this
1024 case, first-loop is the newly created loop, and second-loop is LOOP.
1025 - NITERS: the number of iterations that LOOP iterates.
1026 - FIRST_NITERS: the number of iterations that the first-loop should iterate.
1027 - UPDATE_FIRST_LOOP_COUNT: specified whether this function is responsible
1028 for updating the loop bound of the first-loop to FIRST_NITERS. If it
1029 is false, the caller of this function may want to take care of this
1030 (this can be useful if we don't want new stmts added to first-loop).
1033 The function returns a pointer to the new loop-copy, or NULL if it failed
1034 to perform the transformation.
1036 The function generates two if-then-else guards: one before the first loop,
1037 and the other before the second loop:
1039 if (FIRST_NITERS == 0) then skip the first loop,
1040 and go directly to the second loop.
1041 The second guard is:
1042 if (FIRST_NITERS == NITERS) then skip the second loop.
1044 FORNOW only simple loops are supported (see slpeel_can_duplicate_loop_p).
1045 FORNOW the resulting code will not be in loop-closed-ssa form.
1049 slpeel_tree_peel_loop_to_edge (struct loop *loop, struct loops *loops,
1050 edge e, tree first_niters,
1051 tree niters, bool update_first_loop_count)
1053 struct loop *new_loop = NULL, *first_loop, *second_loop;
1057 basic_block bb_before_second_loop, bb_after_second_loop;
1058 basic_block bb_before_first_loop;
1059 basic_block bb_between_loops;
1060 basic_block new_exit_bb;
1061 edge exit_e = loop->single_exit;
1064 if (!slpeel_can_duplicate_loop_p (loop, e))
1067 /* We have to initialize cfg_hooks. Then, when calling
1068 cfg_hooks->split_edge, the function tree_split_edge
1069 is actually called and, when calling cfg_hooks->duplicate_block,
1070 the function tree_duplicate_bb is called. */
1071 tree_register_cfg_hooks ();
1074 /* 1. Generate a copy of LOOP and put it on E (E is the entry/exit of LOOP).
1075 Resulting CFG would be:
1088 if (!(new_loop = slpeel_tree_duplicate_loop_to_edge_cfg (loop, loops, e)))
1090 loop_loc = find_loop_location (loop);
1091 if (dump_file && (dump_flags & TDF_DETAILS))
1093 if (loop_loc != UNKNOWN_LOC)
1094 fprintf (dump_file, "\n%s:%d: note: ",
1095 LOC_FILE (loop_loc), LOC_LINE (loop_loc));
1096 fprintf (dump_file, "tree_duplicate_loop_to_edge_cfg failed.\n");
1103 /* NEW_LOOP was placed after LOOP. */
1105 second_loop = new_loop;
1109 /* NEW_LOOP was placed before LOOP. */
1110 first_loop = new_loop;
1114 definitions = ssa_names_to_replace ();
1115 slpeel_update_phis_for_duplicate_loop (loop, new_loop, e == exit_e);
1116 rename_variables_in_loop (new_loop);
1119 /* 2. Add the guard that controls whether the first loop is executed.
1120 Resulting CFG would be:
1122 bb_before_first_loop:
1123 if (FIRST_NITERS == 0) GOTO bb_before_second_loop
1130 bb_before_second_loop:
1139 bb_before_first_loop = split_edge (loop_preheader_edge (first_loop));
1140 add_bb_to_loop (bb_before_first_loop, first_loop->outer);
1141 bb_before_second_loop = split_edge (first_loop->single_exit);
1142 add_bb_to_loop (bb_before_second_loop, first_loop->outer);
1145 fold_build2 (LE_EXPR, boolean_type_node, first_niters,
1146 build_int_cst (TREE_TYPE (first_niters), 0));
1147 skip_e = slpeel_add_loop_guard (bb_before_first_loop, pre_condition,
1148 bb_before_second_loop, bb_before_first_loop);
1149 slpeel_update_phi_nodes_for_guard1 (skip_e, first_loop,
1150 first_loop == new_loop,
1151 &new_exit_bb, &definitions);
1154 /* 3. Add the guard that controls whether the second loop is executed.
1155 Resulting CFG would be:
1157 bb_before_first_loop:
1158 if (FIRST_NITERS == 0) GOTO bb_before_second_loop (skip first loop)
1166 if (FIRST_NITERS == NITERS) GOTO bb_after_second_loop (skip second loop)
1167 GOTO bb_before_second_loop
1169 bb_before_second_loop:
1175 bb_after_second_loop:
1180 bb_between_loops = new_exit_bb;
1181 bb_after_second_loop = split_edge (second_loop->single_exit);
1182 add_bb_to_loop (bb_after_second_loop, second_loop->outer);
1185 fold_build2 (EQ_EXPR, boolean_type_node, first_niters, niters);
1186 skip_e = slpeel_add_loop_guard (bb_between_loops, pre_condition,
1187 bb_after_second_loop, bb_before_first_loop);
1188 slpeel_update_phi_nodes_for_guard2 (skip_e, second_loop,
1189 second_loop == new_loop, &new_exit_bb);
1191 /* 4. Make first-loop iterate FIRST_NITERS times, if requested.
1193 if (update_first_loop_count)
1194 slpeel_make_loop_iterate_ntimes (first_loop, first_niters);
1196 BITMAP_FREE (definitions);
1197 delete_update_ssa ();
1202 /* Function vect_get_loop_location.
1204 Extract the location of the loop in the source code.
1205 If the loop is not well formed for vectorization, an estimated
1206 location is calculated.
1207 Return the loop location if succeed and NULL if not. */
1210 find_loop_location (struct loop *loop)
1212 tree node = NULL_TREE;
1214 block_stmt_iterator si;
1219 node = get_loop_exit_condition (loop);
1221 if (node && EXPR_P (node) && EXPR_HAS_LOCATION (node)
1222 && EXPR_FILENAME (node) && EXPR_LINENO (node))
1223 return EXPR_LOC (node);
1225 /* If we got here the loop is probably not "well formed",
1226 try to estimate the loop location */
1233 for (si = bsi_start (bb); !bsi_end_p (si); bsi_next (&si))
1235 node = bsi_stmt (si);
1236 if (node && EXPR_P (node) && EXPR_HAS_LOCATION (node))
1237 return EXPR_LOC (node);
1244 /*************************************************************************
1245 Vectorization Debug Information.
1246 *************************************************************************/
1248 /* Function vect_set_verbosity_level.
1250 Called from toplev.c upon detection of the
1251 -ftree-vectorizer-verbose=N option. */
1254 vect_set_verbosity_level (const char *val)
1259 if (vl < MAX_VERBOSITY_LEVEL)
1260 vect_verbosity_level = vl;
1262 vect_verbosity_level = MAX_VERBOSITY_LEVEL - 1;
1266 /* Function vect_set_dump_settings.
1268 Fix the verbosity level of the vectorizer if the
1269 requested level was not set explicitly using the flag
1270 -ftree-vectorizer-verbose=N.
1271 Decide where to print the debugging information (dump_file/stderr).
1272 If the user defined the verbosity level, but there is no dump file,
1273 print to stderr, otherwise print to the dump file. */
1276 vect_set_dump_settings (void)
1278 vect_dump = dump_file;
1280 /* Check if the verbosity level was defined by the user: */
1281 if (vect_verbosity_level != MAX_VERBOSITY_LEVEL)
1283 /* If there is no dump file, print to stderr. */
1289 /* User didn't specify verbosity level: */
1290 if (dump_file && (dump_flags & TDF_DETAILS))
1291 vect_verbosity_level = REPORT_DETAILS;
1292 else if (dump_file && (dump_flags & TDF_STATS))
1293 vect_verbosity_level = REPORT_UNVECTORIZED_LOOPS;
1295 vect_verbosity_level = REPORT_NONE;
1297 gcc_assert (dump_file || vect_verbosity_level == REPORT_NONE);
1301 /* Function debug_loop_details.
1303 For vectorization debug dumps. */
1306 vect_print_dump_info (enum verbosity_levels vl)
1308 if (vl > vect_verbosity_level)
1311 if (vect_loop_location == UNKNOWN_LOC)
1312 fprintf (vect_dump, "\n%s:%d: note: ",
1313 DECL_SOURCE_FILE (current_function_decl),
1314 DECL_SOURCE_LINE (current_function_decl));
1316 fprintf (vect_dump, "\n%s:%d: note: ",
1317 LOC_FILE (vect_loop_location), LOC_LINE (vect_loop_location));
1324 /*************************************************************************
1325 Vectorization Utilities.
1326 *************************************************************************/
1328 /* Function new_stmt_vec_info.
1330 Create and initialize a new stmt_vec_info struct for STMT. */
1333 new_stmt_vec_info (tree stmt, loop_vec_info loop_vinfo)
1336 res = (stmt_vec_info) xcalloc (1, sizeof (struct _stmt_vec_info));
1338 STMT_VINFO_TYPE (res) = undef_vec_info_type;
1339 STMT_VINFO_STMT (res) = stmt;
1340 STMT_VINFO_LOOP_VINFO (res) = loop_vinfo;
1341 STMT_VINFO_RELEVANT_P (res) = 0;
1342 STMT_VINFO_LIVE_P (res) = 0;
1343 STMT_VINFO_VECTYPE (res) = NULL;
1344 STMT_VINFO_VEC_STMT (res) = NULL;
1345 STMT_VINFO_DATA_REF (res) = NULL;
1346 if (TREE_CODE (stmt) == PHI_NODE)
1347 STMT_VINFO_DEF_TYPE (res) = vect_unknown_def_type;
1349 STMT_VINFO_DEF_TYPE (res) = vect_loop_def;
1350 STMT_VINFO_MEMTAG (res) = NULL;
1351 STMT_VINFO_PTR_INFO (res) = NULL;
1352 STMT_VINFO_SUBVARS (res) = NULL;
1353 STMT_VINFO_VECT_DR_BASE_ADDRESS (res) = NULL;
1354 STMT_VINFO_VECT_INIT_OFFSET (res) = NULL_TREE;
1355 STMT_VINFO_VECT_STEP (res) = NULL_TREE;
1356 STMT_VINFO_VECT_BASE_ALIGNED_P (res) = false;
1357 STMT_VINFO_VECT_MISALIGNMENT (res) = NULL_TREE;
1358 STMT_VINFO_SAME_ALIGN_REFS (res) = VEC_alloc (dr_p, heap, 5);
1364 /* Function new_loop_vec_info.
1366 Create and initialize a new loop_vec_info struct for LOOP, as well as
1367 stmt_vec_info structs for all the stmts in LOOP. */
1370 new_loop_vec_info (struct loop *loop)
1374 block_stmt_iterator si;
1377 res = (loop_vec_info) xcalloc (1, sizeof (struct _loop_vec_info));
1379 bbs = get_loop_body (loop);
1381 /* Create stmt_info for all stmts in the loop. */
1382 for (i = 0; i < loop->num_nodes; i++)
1384 basic_block bb = bbs[i];
1387 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
1389 tree_ann_t ann = get_tree_ann (phi);
1390 set_stmt_info (ann, new_stmt_vec_info (phi, res));
1393 for (si = bsi_start (bb); !bsi_end_p (si); bsi_next (&si))
1395 tree stmt = bsi_stmt (si);
1398 ann = stmt_ann (stmt);
1399 set_stmt_info ((tree_ann_t)ann, new_stmt_vec_info (stmt, res));
1403 LOOP_VINFO_LOOP (res) = loop;
1404 LOOP_VINFO_BBS (res) = bbs;
1405 LOOP_VINFO_EXIT_COND (res) = NULL;
1406 LOOP_VINFO_NITERS (res) = NULL;
1407 LOOP_VINFO_VECTORIZABLE_P (res) = 0;
1408 LOOP_PEELING_FOR_ALIGNMENT (res) = 0;
1409 LOOP_VINFO_VECT_FACTOR (res) = 0;
1410 VARRAY_GENERIC_PTR_INIT (LOOP_VINFO_DATAREF_WRITES (res), 20,
1411 "loop_write_datarefs");
1412 VARRAY_GENERIC_PTR_INIT (LOOP_VINFO_DATAREF_READS (res), 20,
1413 "loop_read_datarefs");
1414 LOOP_VINFO_UNALIGNED_DR (res) = NULL;
1420 /* Function destroy_loop_vec_info.
1422 Free LOOP_VINFO struct, as well as all the stmt_vec_info structs of all the
1423 stmts in the loop. */
1426 destroy_loop_vec_info (loop_vec_info loop_vinfo)
1431 block_stmt_iterator si;
1437 loop = LOOP_VINFO_LOOP (loop_vinfo);
1439 bbs = LOOP_VINFO_BBS (loop_vinfo);
1440 nbbs = loop->num_nodes;
1442 for (j = 0; j < nbbs; j++)
1444 basic_block bb = bbs[j];
1446 stmt_vec_info stmt_info;
1448 for (phi = phi_nodes (bb); phi; phi = PHI_CHAIN (phi))
1450 tree_ann_t ann = get_tree_ann (phi);
1452 stmt_info = vinfo_for_stmt (phi);
1454 set_stmt_info (ann, NULL);
1457 for (si = bsi_start (bb); !bsi_end_p (si); bsi_next (&si))
1459 tree stmt = bsi_stmt (si);
1460 stmt_ann_t ann = stmt_ann (stmt);
1461 stmt_vec_info stmt_info = vinfo_for_stmt (stmt);
1465 VEC_free (dr_p, heap, STMT_VINFO_SAME_ALIGN_REFS (stmt_info));
1467 set_stmt_info ((tree_ann_t)ann, NULL);
1472 free (LOOP_VINFO_BBS (loop_vinfo));
1473 varray_clear (LOOP_VINFO_DATAREF_WRITES (loop_vinfo));
1474 varray_clear (LOOP_VINFO_DATAREF_READS (loop_vinfo));
1480 /* Function vect_strip_conversions
1482 Strip conversions that don't narrow the mode. */
1485 vect_strip_conversion (tree expr)
1487 tree to, ti, oprnd0;
1489 while (TREE_CODE (expr) == NOP_EXPR || TREE_CODE (expr) == CONVERT_EXPR)
1491 to = TREE_TYPE (expr);
1492 oprnd0 = TREE_OPERAND (expr, 0);
1493 ti = TREE_TYPE (oprnd0);
1495 if (!INTEGRAL_TYPE_P (to) || !INTEGRAL_TYPE_P (ti))
1497 if (GET_MODE_SIZE (TYPE_MODE (to)) < GET_MODE_SIZE (TYPE_MODE (ti)))
1506 /* Function vect_force_dr_alignment_p.
1508 Returns whether the alignment of a DECL can be forced to be aligned
1509 on ALIGNMENT bit boundary. */
1512 vect_can_force_dr_alignment_p (tree decl, unsigned int alignment)
1514 if (TREE_CODE (decl) != VAR_DECL)
1517 if (DECL_EXTERNAL (decl))
1520 if (TREE_ASM_WRITTEN (decl))
1523 if (TREE_STATIC (decl))
1524 return (alignment <= MAX_OFILE_ALIGNMENT);
1526 /* This is not 100% correct. The absolute correct stack alignment
1527 is STACK_BOUNDARY. We're supposed to hope, but not assume, that
1528 PREFERRED_STACK_BOUNDARY is honored by all translation units.
1529 However, until someone implements forced stack alignment, SSE
1530 isn't really usable without this. */
1531 return (alignment <= PREFERRED_STACK_BOUNDARY);
1535 /* Function get_vectype_for_scalar_type.
1537 Returns the vector type corresponding to SCALAR_TYPE as supported
1541 get_vectype_for_scalar_type (tree scalar_type)
1543 enum machine_mode inner_mode = TYPE_MODE (scalar_type);
1544 int nbytes = GET_MODE_SIZE (inner_mode);
1548 if (nbytes == 0 || nbytes >= UNITS_PER_SIMD_WORD)
1551 /* FORNOW: Only a single vector size per target (UNITS_PER_SIMD_WORD)
1553 nunits = UNITS_PER_SIMD_WORD / nbytes;
1555 vectype = build_vector_type (scalar_type, nunits);
1556 if (vect_print_dump_info (REPORT_DETAILS))
1558 fprintf (vect_dump, "get vectype with %d units of type ", nunits);
1559 print_generic_expr (vect_dump, scalar_type, TDF_SLIM);
1565 if (vect_print_dump_info (REPORT_DETAILS))
1567 fprintf (vect_dump, "vectype: ");
1568 print_generic_expr (vect_dump, vectype, TDF_SLIM);
1571 if (!VECTOR_MODE_P (TYPE_MODE (vectype))
1572 && !INTEGRAL_MODE_P (TYPE_MODE (vectype)))
1574 if (vect_print_dump_info (REPORT_DETAILS))
1575 fprintf (vect_dump, "mode not supported by target.");
1583 /* Function vect_supportable_dr_alignment
1585 Return whether the data reference DR is supported with respect to its
1588 enum dr_alignment_support
1589 vect_supportable_dr_alignment (struct data_reference *dr)
1591 tree vectype = STMT_VINFO_VECTYPE (vinfo_for_stmt (DR_STMT (dr)));
1592 enum machine_mode mode = (int) TYPE_MODE (vectype);
1594 if (aligned_access_p (dr))
1597 /* Possibly unaligned access. */
1599 if (DR_IS_READ (dr))
1601 if (vec_realign_load_optab->handlers[mode].insn_code != CODE_FOR_nothing
1602 && (!targetm.vectorize.builtin_mask_for_load
1603 || targetm.vectorize.builtin_mask_for_load ()))
1604 return dr_unaligned_software_pipeline;
1606 if (movmisalign_optab->handlers[mode].insn_code != CODE_FOR_nothing)
1607 /* Can't software pipeline the loads, but can at least do them. */
1608 return dr_unaligned_supported;
1612 return dr_unaligned_unsupported;
1616 /* Function vect_is_simple_use.
1619 LOOP - the loop that is being vectorized.
1620 OPERAND - operand of a stmt in LOOP.
1621 DEF - the defining stmt in case OPERAND is an SSA_NAME.
1623 Returns whether a stmt with OPERAND can be vectorized.
1624 Supportable operands are constants, loop invariants, and operands that are
1625 defined by the current iteration of the loop. Unsupportable operands are
1626 those that are defined by a previous iteration of the loop (as is the case
1627 in reduction/induction computations). */
1630 vect_is_simple_use (tree operand, loop_vec_info loop_vinfo, tree *def_stmt,
1631 tree *def, enum vect_def_type *dt)
1634 stmt_vec_info stmt_vinfo;
1635 struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo);
1637 *def_stmt = NULL_TREE;
1640 if (vect_print_dump_info (REPORT_DETAILS))
1642 fprintf (vect_dump, "vect_is_simple_use: operand ");
1643 print_generic_expr (vect_dump, operand, TDF_SLIM);
1646 if (TREE_CODE (operand) == INTEGER_CST || TREE_CODE (operand) == REAL_CST)
1648 *dt = vect_constant_def;
1652 if (TREE_CODE (operand) != SSA_NAME)
1654 if (vect_print_dump_info (REPORT_DETAILS))
1655 fprintf (vect_dump, "not ssa-name.");
1659 *def_stmt = SSA_NAME_DEF_STMT (operand);
1660 if (*def_stmt == NULL_TREE )
1662 if (vect_print_dump_info (REPORT_DETAILS))
1663 fprintf (vect_dump, "no def_stmt.");
1667 if (vect_print_dump_info (REPORT_DETAILS))
1669 fprintf (vect_dump, "def_stmt: ");
1670 print_generic_expr (vect_dump, *def_stmt, TDF_SLIM);
1673 /* empty stmt is expected only in case of a function argument.
1674 (Otherwise - we expect a phi_node or a modify_expr). */
1675 if (IS_EMPTY_STMT (*def_stmt))
1677 tree arg = TREE_OPERAND (*def_stmt, 0);
1678 if (TREE_CODE (arg) == INTEGER_CST || TREE_CODE (arg) == REAL_CST)
1681 *dt = vect_invariant_def;
1685 if (vect_print_dump_info (REPORT_DETAILS))
1686 fprintf (vect_dump, "Unexpected empty stmt.");
1690 bb = bb_for_stmt (*def_stmt);
1691 if (!flow_bb_inside_loop_p (loop, bb))
1692 *dt = vect_invariant_def;
1695 stmt_vinfo = vinfo_for_stmt (*def_stmt);
1696 *dt = STMT_VINFO_DEF_TYPE (stmt_vinfo);
1699 if (*dt == vect_unknown_def_type)
1701 if (vect_print_dump_info (REPORT_DETAILS))
1702 fprintf (vect_dump, "Unsupported pattern.");
1706 /* stmts inside the loop that have been identified as performing
1707 a reduction operation cannot have uses in the loop. */
1708 if (*dt == vect_reduction_def && TREE_CODE (*def_stmt) != PHI_NODE)
1710 if (vect_print_dump_info (REPORT_DETAILS))
1711 fprintf (vect_dump, "reduction used in loop.");
1715 if (vect_print_dump_info (REPORT_DETAILS))
1716 fprintf (vect_dump, "type of def: %d.",*dt);
1718 switch (TREE_CODE (*def_stmt))
1721 *def = PHI_RESULT (*def_stmt);
1722 gcc_assert (*dt == vect_induction_def || *dt == vect_reduction_def
1723 || *dt == vect_invariant_def);
1727 *def = TREE_OPERAND (*def_stmt, 0);
1728 gcc_assert (*dt == vect_loop_def || *dt == vect_invariant_def);
1732 if (vect_print_dump_info (REPORT_DETAILS))
1733 fprintf (vect_dump, "unsupported defining stmt: ");
1737 if (*dt == vect_induction_def)
1739 if (vect_print_dump_info (REPORT_DETAILS))
1740 fprintf (vect_dump, "induction not supported.");
1748 /* Function reduction_code_for_scalar_code
1751 CODE - tree_code of a reduction operations.
1754 REDUC_CODE - the corresponding tree-code to be used to reduce the
1755 vector of partial results into a single scalar result (which
1756 will also reside in a vector).
1758 Return TRUE if a corresponding REDUC_CODE was found, FALSE otherwise. */
1761 reduction_code_for_scalar_code (enum tree_code code,
1762 enum tree_code *reduc_code)
1767 *reduc_code = REDUC_MAX_EXPR;
1771 *reduc_code = REDUC_MIN_EXPR;
1775 *reduc_code = REDUC_PLUS_EXPR;
1784 /* Function vect_is_simple_reduction
1786 Detect a cross-iteration def-use cucle that represents a simple
1787 reduction computation. We look for the following pattern:
1792 a2 = operation (a3, a1)
1795 1. operation is commutative and associative and it is safe to
1796 change the order of the computation.
1797 2. no uses for a2 in the loop (a2 is used out of the loop)
1798 3. no uses of a1 in the loop besides the reduction operation.
1800 Condition 1 is tested here.
1801 Conditions 2,3 are tested in vect_mark_stmts_to_be_vectorized. */
1804 vect_is_simple_reduction (struct loop *loop ATTRIBUTE_UNUSED,
1805 tree phi ATTRIBUTE_UNUSED)
1807 edge latch_e = loop_latch_edge (loop);
1808 tree loop_arg = PHI_ARG_DEF_FROM_EDGE (phi, latch_e);
1809 tree def_stmt, def1, def2;
1810 enum tree_code code;
1812 tree operation, op1, op2;
1815 if (TREE_CODE (loop_arg) != SSA_NAME)
1817 if (vect_print_dump_info (REPORT_DETAILS))
1819 fprintf (vect_dump, "reduction: not ssa_name: ");
1820 print_generic_expr (vect_dump, loop_arg, TDF_SLIM);
1825 def_stmt = SSA_NAME_DEF_STMT (loop_arg);
1828 if (vect_print_dump_info (REPORT_DETAILS))
1829 fprintf (vect_dump, "reduction: no def_stmt.");
1833 if (TREE_CODE (def_stmt) != MODIFY_EXPR)
1835 if (vect_print_dump_info (REPORT_DETAILS))
1837 print_generic_expr (vect_dump, def_stmt, TDF_SLIM);
1842 operation = TREE_OPERAND (def_stmt, 1);
1843 code = TREE_CODE (operation);
1844 if (!commutative_tree_code (code) || !associative_tree_code (code))
1846 if (vect_print_dump_info (REPORT_DETAILS))
1848 fprintf (vect_dump, "reduction: not commutative/associative: ");
1849 print_generic_expr (vect_dump, operation, TDF_SLIM);
1854 op_type = TREE_CODE_LENGTH (code);
1855 if (op_type != binary_op)
1857 if (vect_print_dump_info (REPORT_DETAILS))
1859 fprintf (vect_dump, "reduction: not binary operation: ");
1860 print_generic_expr (vect_dump, operation, TDF_SLIM);
1865 op1 = TREE_OPERAND (operation, 0);
1866 op2 = TREE_OPERAND (operation, 1);
1867 if (TREE_CODE (op1) != SSA_NAME || TREE_CODE (op2) != SSA_NAME)
1869 if (vect_print_dump_info (REPORT_DETAILS))
1871 fprintf (vect_dump, "reduction: uses not ssa_names: ");
1872 print_generic_expr (vect_dump, operation, TDF_SLIM);
1877 /* Check that it's ok to change the order of the computation. */
1878 type = TREE_TYPE (operation);
1879 if (TYPE_MAIN_VARIANT (type) != TYPE_MAIN_VARIANT (TREE_TYPE (op1))
1880 || TYPE_MAIN_VARIANT (type) != TYPE_MAIN_VARIANT (TREE_TYPE (op2)))
1882 if (vect_print_dump_info (REPORT_DETAILS))
1884 fprintf (vect_dump, "reduction: multiple types: operation type: ");
1885 print_generic_expr (vect_dump, type, TDF_SLIM);
1886 fprintf (vect_dump, ", operands types: ");
1887 print_generic_expr (vect_dump, TREE_TYPE (op1), TDF_SLIM);
1888 fprintf (vect_dump, ",");
1889 print_generic_expr (vect_dump, TREE_TYPE (op2), TDF_SLIM);
1894 /* CHECKME: check for !flag_finite_math_only too? */
1895 if (SCALAR_FLOAT_TYPE_P (type) && !flag_unsafe_math_optimizations)
1897 /* Changing the order of operations changes the sematics. */
1898 if (vect_print_dump_info (REPORT_DETAILS))
1900 fprintf (vect_dump, "reduction: unsafe fp math optimization: ");
1901 print_generic_expr (vect_dump, operation, TDF_SLIM);
1905 else if (INTEGRAL_TYPE_P (type) && !TYPE_UNSIGNED (type) && flag_trapv)
1907 /* Changing the order of operations changes the sematics. */
1908 if (vect_print_dump_info (REPORT_DETAILS))
1910 fprintf (vect_dump, "reduction: unsafe int math optimization: ");
1911 print_generic_expr (vect_dump, operation, TDF_SLIM);
1916 /* reduction is safe. we're dealing with one of the following:
1917 1) integer arithmetic and no trapv
1918 2) floating point arithmetic, and special flags permit this optimization.
1920 def1 = SSA_NAME_DEF_STMT (op1);
1921 def2 = SSA_NAME_DEF_STMT (op2);
1924 if (vect_print_dump_info (REPORT_DETAILS))
1926 fprintf (vect_dump, "reduction: no defs for operands: ");
1927 print_generic_expr (vect_dump, operation, TDF_SLIM);
1932 if (TREE_CODE (def1) == MODIFY_EXPR
1933 && flow_bb_inside_loop_p (loop, bb_for_stmt (def1))
1936 if (vect_print_dump_info (REPORT_DETAILS))
1938 fprintf (vect_dump, "detected reduction:");
1939 print_generic_expr (vect_dump, operation, TDF_SLIM);
1943 else if (TREE_CODE (def2) == MODIFY_EXPR
1944 && flow_bb_inside_loop_p (loop, bb_for_stmt (def2))
1950 /* Swap operands (just for simplicity - so that the rest of the code
1951 can assume that the reduction variable is always the last (second)
1953 if (vect_print_dump_info (REPORT_DETAILS))
1955 fprintf (vect_dump, "detected reduction: need to swap operands:");
1956 print_generic_expr (vect_dump, operation, TDF_SLIM);
1960 FOR_EACH_SSA_USE_OPERAND (use, def_stmt, iter, SSA_OP_USE)
1962 tree tuse = USE_FROM_PTR (use);
1965 else if (tuse == op2)
1972 if (vect_print_dump_info (REPORT_DETAILS))
1974 fprintf (vect_dump, "reduction: unknown pattern.");
1975 print_generic_expr (vect_dump, operation, TDF_SLIM);
1982 /* Function vect_is_simple_iv_evolution.
1984 FORNOW: A simple evolution of an induction variables in the loop is
1985 considered a polynomial evolution with constant step. */
1988 vect_is_simple_iv_evolution (unsigned loop_nb, tree access_fn, tree * init,
1994 tree evolution_part = evolution_part_in_loop_num (access_fn, loop_nb);
1996 /* When there is no evolution in this loop, the evolution function
1998 if (evolution_part == NULL_TREE)
2001 /* When the evolution is a polynomial of degree >= 2
2002 the evolution function is not "simple". */
2003 if (tree_is_chrec (evolution_part))
2006 step_expr = evolution_part;
2007 init_expr = unshare_expr (initial_condition_in_loop_num (access_fn,
2010 if (vect_print_dump_info (REPORT_DETAILS))
2012 fprintf (vect_dump, "step: ");
2013 print_generic_expr (vect_dump, step_expr, TDF_SLIM);
2014 fprintf (vect_dump, ", init: ");
2015 print_generic_expr (vect_dump, init_expr, TDF_SLIM);
2021 if (TREE_CODE (step_expr) != INTEGER_CST)
2023 if (vect_print_dump_info (REPORT_DETAILS))
2024 fprintf (vect_dump, "step unknown.");
2032 /* Function vectorize_loops.
2034 Entry Point to loop vectorization phase. */
2037 vectorize_loops (struct loops *loops)
2040 unsigned int num_vectorized_loops = 0;
2042 /* Fix the verbosity level if not defined explicitly by the user. */
2043 vect_set_dump_settings ();
2045 /* ----------- Analyze loops. ----------- */
2047 /* If some loop was duplicated, it gets bigger number
2048 than all previously defined loops. This fact allows us to run
2049 only over initial loops skipping newly generated ones. */
2050 vect_loops_num = loops->num;
2051 for (i = 1; i < vect_loops_num; i++)
2053 loop_vec_info loop_vinfo;
2054 struct loop *loop = loops->parray[i];
2059 vect_loop_location = find_loop_location (loop);
2060 loop_vinfo = vect_analyze_loop (loop);
2061 loop->aux = loop_vinfo;
2063 if (!loop_vinfo || !LOOP_VINFO_VECTORIZABLE_P (loop_vinfo))
2066 vect_transform_loop (loop_vinfo, loops);
2067 num_vectorized_loops++;
2070 if (vect_print_dump_info (REPORT_VECTORIZED_LOOPS))
2071 fprintf (vect_dump, "vectorized %u loops in function.\n",
2072 num_vectorized_loops);
2074 /* ----------- Finalize. ----------- */
2076 for (i = 1; i < vect_loops_num; i++)
2078 struct loop *loop = loops->parray[i];
2079 loop_vec_info loop_vinfo;
2083 loop_vinfo = loop->aux;
2084 destroy_loop_vec_info (loop_vinfo);