2 Copyright (C) 2003-2021 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 3, 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 COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
21 /* Loop and basic block vectorizer.
23 This file contains drivers for the three vectorizers:
24 (1) loop vectorizer (inter-iteration parallelism),
25 (2) loop-aware SLP (intra-iteration parallelism) (invoked by the loop
27 (3) BB vectorizer (out-of-loops), aka SLP
29 The rest of the vectorizer's code is organized as follows:
30 - tree-vect-loop.c - loop specific parts such as reductions, etc. These are
31 used by drivers (1) and (2).
32 - tree-vect-loop-manip.c - vectorizer's loop control-flow utilities, used by
34 - tree-vect-slp.c - BB vectorization specific analysis and transformation,
35 used by drivers (2) and (3).
36 - tree-vect-stmts.c - statements analysis and transformation (used by all).
37 - tree-vect-data-refs.c - vectorizer specific data-refs analysis and
38 manipulations (used by all).
39 - tree-vect-patterns.c - vectorizable code patterns detector (used by all)
41 Here's a poor attempt at illustrating that:
44 loop_vect() loop_aware_slp() slp_vect()
47 tree-vect-loop.c tree-vect-slp.c
52 tree-vect-stmts.c tree-vect-data-refs.c
59 #include "coretypes.h"
64 #include "tree-pass.h"
67 #include "fold-const.h"
68 #include "stor-layout.h"
69 #include "gimple-iterator.h"
70 #include "gimple-walk.h"
71 #include "tree-ssa-loop-manip.h"
72 #include "tree-ssa-loop-niter.h"
75 #include "tree-vectorizer.h"
76 #include "tree-ssa-propagate.h"
78 #include "tree-scalar-evolution.h"
79 #include "stringpool.h"
81 #include "gimple-pretty-print.h"
82 #include "opt-problem.h"
83 #include "internal-fn.h"
86 /* Loop or bb location, with hotness information. */
87 dump_user_location_t vect_location
;
89 /* auto_purge_vect_location's dtor: reset the vect_location
90 global, to avoid stale location_t values that could reference
93 auto_purge_vect_location::~auto_purge_vect_location ()
95 vect_location
= dump_user_location_t ();
98 /* Dump a cost entry according to args to F. */
101 dump_stmt_cost (FILE *f
, void *data
, int count
, enum vect_cost_for_stmt kind
,
102 stmt_vec_info stmt_info
, tree
, int misalign
, unsigned cost
,
103 enum vect_cost_model_location where
)
105 fprintf (f
, "%p ", data
);
108 print_gimple_expr (f
, STMT_VINFO_STMT (stmt_info
), 0, TDF_SLIM
);
112 fprintf (f
, "<unknown> ");
113 fprintf (f
, "%d times ", count
);
114 const char *ks
= "unknown";
132 case vector_gather_load
:
133 ks
= "vector_gather_load";
136 ks
= "unaligned_load";
138 case unaligned_store
:
139 ks
= "unaligned_store";
144 case vector_scatter_store
:
145 ks
= "vector_scatter_store";
148 ks
= "vec_to_scalar";
151 ks
= "scalar_to_vec";
153 case cond_branch_not_taken
:
154 ks
= "cond_branch_not_taken";
156 case cond_branch_taken
:
157 ks
= "cond_branch_taken";
162 case vec_promote_demote
:
163 ks
= "vec_promote_demote";
166 ks
= "vec_construct";
169 fprintf (f
, "%s ", ks
);
170 if (kind
== unaligned_load
|| kind
== unaligned_store
)
171 fprintf (f
, "(misalign %d) ", misalign
);
172 fprintf (f
, "costs %u ", cost
);
173 const char *ws
= "unknown";
186 fprintf (f
, "in %s\n", ws
);
189 /* For mapping simduid to vectorization factor. */
191 class simduid_to_vf
: public free_ptr_hash
<simduid_to_vf
>
194 unsigned int simduid
;
197 /* hash_table support. */
198 static inline hashval_t
hash (const simduid_to_vf
*);
199 static inline int equal (const simduid_to_vf
*, const simduid_to_vf
*);
203 simduid_to_vf::hash (const simduid_to_vf
*p
)
209 simduid_to_vf::equal (const simduid_to_vf
*p1
, const simduid_to_vf
*p2
)
211 return p1
->simduid
== p2
->simduid
;
214 /* This hash maps the OMP simd array to the corresponding simduid used
215 to index into it. Like thus,
217 _7 = GOMP_SIMD_LANE (simduid.0)
223 This hash maps from the OMP simd array (D.1737[]) to DECL_UID of
226 struct simd_array_to_simduid
: free_ptr_hash
<simd_array_to_simduid
>
229 unsigned int simduid
;
231 /* hash_table support. */
232 static inline hashval_t
hash (const simd_array_to_simduid
*);
233 static inline int equal (const simd_array_to_simduid
*,
234 const simd_array_to_simduid
*);
238 simd_array_to_simduid::hash (const simd_array_to_simduid
*p
)
240 return DECL_UID (p
->decl
);
244 simd_array_to_simduid::equal (const simd_array_to_simduid
*p1
,
245 const simd_array_to_simduid
*p2
)
247 return p1
->decl
== p2
->decl
;
250 /* Fold IFN_GOMP_SIMD_LANE, IFN_GOMP_SIMD_VF, IFN_GOMP_SIMD_LAST_LANE,
251 into their corresponding constants and remove
252 IFN_GOMP_SIMD_ORDERED_{START,END}. */
255 adjust_simduid_builtins (hash_table
<simduid_to_vf
> *htab
)
259 FOR_EACH_BB_FN (bb
, cfun
)
261 gimple_stmt_iterator i
;
263 for (i
= gsi_start_bb (bb
); !gsi_end_p (i
); )
266 enum internal_fn ifn
;
267 gimple
*stmt
= gsi_stmt (i
);
269 if (!is_gimple_call (stmt
)
270 || !gimple_call_internal_p (stmt
))
275 ifn
= gimple_call_internal_fn (stmt
);
278 case IFN_GOMP_SIMD_LANE
:
279 case IFN_GOMP_SIMD_VF
:
280 case IFN_GOMP_SIMD_LAST_LANE
:
282 case IFN_GOMP_SIMD_ORDERED_START
:
283 case IFN_GOMP_SIMD_ORDERED_END
:
284 if (integer_onep (gimple_call_arg (stmt
, 0)))
286 enum built_in_function bcode
287 = (ifn
== IFN_GOMP_SIMD_ORDERED_START
288 ? BUILT_IN_GOMP_ORDERED_START
289 : BUILT_IN_GOMP_ORDERED_END
);
291 = gimple_build_call (builtin_decl_explicit (bcode
), 0);
292 gimple_move_vops (g
, stmt
);
293 gsi_replace (&i
, g
, true);
296 gsi_remove (&i
, true);
297 unlink_stmt_vdef (stmt
);
303 tree arg
= gimple_call_arg (stmt
, 0);
304 gcc_assert (arg
!= NULL_TREE
);
305 gcc_assert (TREE_CODE (arg
) == SSA_NAME
);
306 simduid_to_vf
*p
= NULL
, data
;
307 data
.simduid
= DECL_UID (SSA_NAME_VAR (arg
));
308 /* Need to nullify loop safelen field since it's value is not
309 valid after transformation. */
310 if (bb
->loop_father
&& bb
->loop_father
->safelen
> 0)
311 bb
->loop_father
->safelen
= 0;
314 p
= htab
->find (&data
);
320 case IFN_GOMP_SIMD_VF
:
321 t
= build_int_cst (unsigned_type_node
, vf
);
323 case IFN_GOMP_SIMD_LANE
:
324 t
= build_int_cst (unsigned_type_node
, 0);
326 case IFN_GOMP_SIMD_LAST_LANE
:
327 t
= gimple_call_arg (stmt
, 1);
332 tree lhs
= gimple_call_lhs (stmt
);
334 replace_uses_by (lhs
, t
);
336 gsi_remove (&i
, true);
341 /* Helper structure for note_simd_array_uses. */
343 struct note_simd_array_uses_struct
345 hash_table
<simd_array_to_simduid
> **htab
;
346 unsigned int simduid
;
349 /* Callback for note_simd_array_uses, called through walk_gimple_op. */
352 note_simd_array_uses_cb (tree
*tp
, int *walk_subtrees
, void *data
)
354 struct walk_stmt_info
*wi
= (struct walk_stmt_info
*) data
;
355 struct note_simd_array_uses_struct
*ns
356 = (struct note_simd_array_uses_struct
*) wi
->info
;
361 && lookup_attribute ("omp simd array", DECL_ATTRIBUTES (*tp
))
362 && DECL_CONTEXT (*tp
) == current_function_decl
)
364 simd_array_to_simduid data
;
366 *ns
->htab
= new hash_table
<simd_array_to_simduid
> (15);
368 data
.simduid
= ns
->simduid
;
369 simd_array_to_simduid
**slot
= (*ns
->htab
)->find_slot (&data
, INSERT
);
372 simd_array_to_simduid
*p
= XNEW (simd_array_to_simduid
);
376 else if ((*slot
)->simduid
!= ns
->simduid
)
377 (*slot
)->simduid
= -1U;
383 /* Find "omp simd array" temporaries and map them to corresponding
387 note_simd_array_uses (hash_table
<simd_array_to_simduid
> **htab
)
390 gimple_stmt_iterator gsi
;
391 struct walk_stmt_info wi
;
392 struct note_simd_array_uses_struct ns
;
394 memset (&wi
, 0, sizeof (wi
));
398 FOR_EACH_BB_FN (bb
, cfun
)
399 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
401 gimple
*stmt
= gsi_stmt (gsi
);
402 if (!is_gimple_call (stmt
) || !gimple_call_internal_p (stmt
))
404 switch (gimple_call_internal_fn (stmt
))
406 case IFN_GOMP_SIMD_LANE
:
407 case IFN_GOMP_SIMD_VF
:
408 case IFN_GOMP_SIMD_LAST_LANE
:
413 tree lhs
= gimple_call_lhs (stmt
);
414 if (lhs
== NULL_TREE
)
416 imm_use_iterator use_iter
;
418 ns
.simduid
= DECL_UID (SSA_NAME_VAR (gimple_call_arg (stmt
, 0)));
419 FOR_EACH_IMM_USE_STMT (use_stmt
, use_iter
, lhs
)
420 if (!is_gimple_debug (use_stmt
))
421 walk_gimple_op (use_stmt
, note_simd_array_uses_cb
, &wi
);
425 /* Shrink arrays with "omp simd array" attribute to the corresponding
426 vectorization factor. */
430 (hash_table
<simd_array_to_simduid
> *simd_array_to_simduid_htab
,
431 hash_table
<simduid_to_vf
> *simduid_to_vf_htab
)
433 for (hash_table
<simd_array_to_simduid
>::iterator iter
434 = simd_array_to_simduid_htab
->begin ();
435 iter
!= simd_array_to_simduid_htab
->end (); ++iter
)
436 if ((*iter
)->simduid
!= -1U)
438 tree decl
= (*iter
)->decl
;
440 if (simduid_to_vf_htab
)
442 simduid_to_vf
*p
= NULL
, data
;
443 data
.simduid
= (*iter
)->simduid
;
444 p
= simduid_to_vf_htab
->find (&data
);
449 = build_array_type_nelts (TREE_TYPE (TREE_TYPE (decl
)), vf
);
450 TREE_TYPE (decl
) = atype
;
451 relayout_decl (decl
);
454 delete simd_array_to_simduid_htab
;
457 /* Initialize the vec_info with kind KIND_IN and target cost data
458 TARGET_COST_DATA_IN. */
460 vec_info::vec_info (vec_info::vec_kind kind_in
, void *target_cost_data_in
,
461 vec_info_shared
*shared_
)
464 stmt_vec_info_ro (false),
465 target_cost_data (target_cost_data_in
)
467 stmt_vec_infos
.create (50);
470 vec_info::~vec_info ()
472 for (slp_instance
&instance
: slp_instances
)
473 vect_free_slp_instance (instance
);
475 destroy_cost_data (target_cost_data
);
476 free_stmt_vec_infos ();
479 vec_info_shared::vec_info_shared ()
481 datarefs_copy (vNULL
),
486 vec_info_shared::~vec_info_shared ()
488 free_data_refs (datarefs
);
489 free_dependence_relations (ddrs
);
490 datarefs_copy
.release ();
494 vec_info_shared::save_datarefs ()
498 datarefs_copy
.reserve_exact (datarefs
.length ());
499 for (unsigned i
= 0; i
< datarefs
.length (); ++i
)
500 datarefs_copy
.quick_push (*datarefs
[i
]);
504 vec_info_shared::check_datarefs ()
508 gcc_assert (datarefs
.length () == datarefs_copy
.length ());
509 for (unsigned i
= 0; i
< datarefs
.length (); ++i
)
510 if (memcmp (&datarefs_copy
[i
], datarefs
[i
],
511 offsetof (data_reference
, alt_indices
)) != 0)
515 /* Record that STMT belongs to the vectorizable region. Create and return
516 an associated stmt_vec_info. */
519 vec_info::add_stmt (gimple
*stmt
)
521 stmt_vec_info res
= new_stmt_vec_info (stmt
);
522 set_vinfo_for_stmt (stmt
, res
);
526 /* Record that STMT belongs to the vectorizable region. Create a new
527 stmt_vec_info and mark VECINFO as being related and return the new
531 vec_info::add_pattern_stmt (gimple
*stmt
, stmt_vec_info stmt_info
)
533 stmt_vec_info res
= new_stmt_vec_info (stmt
);
534 set_vinfo_for_stmt (stmt
, res
, false);
535 STMT_VINFO_RELATED_STMT (res
) = stmt_info
;
539 /* If STMT has an associated stmt_vec_info, return that vec_info, otherwise
540 return null. It is safe to call this function on any statement, even if
541 it might not be part of the vectorizable region. */
544 vec_info::lookup_stmt (gimple
*stmt
)
546 unsigned int uid
= gimple_uid (stmt
);
547 if (uid
> 0 && uid
- 1 < stmt_vec_infos
.length ())
549 stmt_vec_info res
= stmt_vec_infos
[uid
- 1];
550 if (res
&& res
->stmt
== stmt
)
556 /* If NAME is an SSA_NAME and its definition has an associated stmt_vec_info,
557 return that stmt_vec_info, otherwise return null. It is safe to call
558 this on arbitrary operands. */
561 vec_info::lookup_def (tree name
)
563 if (TREE_CODE (name
) == SSA_NAME
564 && !SSA_NAME_IS_DEFAULT_DEF (name
))
565 return lookup_stmt (SSA_NAME_DEF_STMT (name
));
569 /* See whether there is a single non-debug statement that uses LHS and
570 whether that statement has an associated stmt_vec_info. Return the
571 stmt_vec_info if so, otherwise return null. */
574 vec_info::lookup_single_use (tree lhs
)
578 if (single_imm_use (lhs
, &dummy
, &use_stmt
))
579 return lookup_stmt (use_stmt
);
583 /* Return vectorization information about DR. */
586 vec_info::lookup_dr (data_reference
*dr
)
588 stmt_vec_info stmt_info
= lookup_stmt (DR_STMT (dr
));
589 /* DR_STMT should never refer to a stmt in a pattern replacement. */
590 gcc_checking_assert (!is_pattern_stmt_p (stmt_info
));
591 return STMT_VINFO_DR_INFO (stmt_info
->dr_aux
.stmt
);
594 /* Record that NEW_STMT_INFO now implements the same data reference
598 vec_info::move_dr (stmt_vec_info new_stmt_info
, stmt_vec_info old_stmt_info
)
600 gcc_assert (!is_pattern_stmt_p (old_stmt_info
));
601 STMT_VINFO_DR_INFO (old_stmt_info
)->stmt
= new_stmt_info
;
602 new_stmt_info
->dr_aux
= old_stmt_info
->dr_aux
;
603 STMT_VINFO_DR_WRT_VEC_LOOP (new_stmt_info
)
604 = STMT_VINFO_DR_WRT_VEC_LOOP (old_stmt_info
);
605 STMT_VINFO_GATHER_SCATTER_P (new_stmt_info
)
606 = STMT_VINFO_GATHER_SCATTER_P (old_stmt_info
);
609 /* Permanently remove the statement described by STMT_INFO from the
613 vec_info::remove_stmt (stmt_vec_info stmt_info
)
615 gcc_assert (!stmt_info
->pattern_stmt_p
);
616 set_vinfo_for_stmt (stmt_info
->stmt
, NULL
);
617 unlink_stmt_vdef (stmt_info
->stmt
);
618 gimple_stmt_iterator si
= gsi_for_stmt (stmt_info
->stmt
);
619 gsi_remove (&si
, true);
620 release_defs (stmt_info
->stmt
);
621 free_stmt_vec_info (stmt_info
);
624 /* Replace the statement at GSI by NEW_STMT, both the vectorization
625 information and the function itself. STMT_INFO describes the statement
629 vec_info::replace_stmt (gimple_stmt_iterator
*gsi
, stmt_vec_info stmt_info
,
632 gimple
*old_stmt
= stmt_info
->stmt
;
633 gcc_assert (!stmt_info
->pattern_stmt_p
&& old_stmt
== gsi_stmt (*gsi
));
634 gimple_set_uid (new_stmt
, gimple_uid (old_stmt
));
635 stmt_info
->stmt
= new_stmt
;
636 gsi_replace (gsi
, new_stmt
, true);
639 /* Insert stmts in SEQ on the VEC_INFO region entry. If CONTEXT is
640 not NULL it specifies whether to use the sub-region entry
641 determined by it, currently used for loop vectorization to insert
642 on the inner loop entry vs. the outer loop entry. */
645 vec_info::insert_seq_on_entry (stmt_vec_info context
, gimple_seq seq
)
647 if (loop_vec_info loop_vinfo
= dyn_cast
<loop_vec_info
> (this))
649 class loop
*loop
= LOOP_VINFO_LOOP (loop_vinfo
);
653 if (context
&& nested_in_vect_loop_p (loop
, context
))
656 pe
= loop_preheader_edge (loop
);
657 new_bb
= gsi_insert_seq_on_edge_immediate (pe
, seq
);
658 gcc_assert (!new_bb
);
662 bb_vec_info bb_vinfo
= as_a
<bb_vec_info
> (this);
663 gimple_stmt_iterator gsi_region_begin
664 = gsi_after_labels (bb_vinfo
->bbs
[0]);
665 gsi_insert_seq_before (&gsi_region_begin
, seq
, GSI_SAME_STMT
);
669 /* Like insert_seq_on_entry but just inserts the single stmt NEW_STMT. */
672 vec_info::insert_on_entry (stmt_vec_info context
, gimple
*new_stmt
)
674 gimple_seq seq
= NULL
;
675 gimple_stmt_iterator gsi
= gsi_start (seq
);
676 gsi_insert_before_without_update (&gsi
, new_stmt
, GSI_SAME_STMT
);
677 insert_seq_on_entry (context
, seq
);
680 /* Create and initialize a new stmt_vec_info struct for STMT. */
683 vec_info::new_stmt_vec_info (gimple
*stmt
)
685 stmt_vec_info res
= XCNEW (class _stmt_vec_info
);
688 STMT_VINFO_TYPE (res
) = undef_vec_info_type
;
689 STMT_VINFO_RELEVANT (res
) = vect_unused_in_scope
;
690 STMT_VINFO_VECTORIZABLE (res
) = true;
691 STMT_VINFO_REDUC_TYPE (res
) = TREE_CODE_REDUCTION
;
692 STMT_VINFO_REDUC_CODE (res
) = ERROR_MARK
;
693 STMT_VINFO_REDUC_FN (res
) = IFN_LAST
;
694 STMT_VINFO_REDUC_IDX (res
) = -1;
695 STMT_VINFO_SLP_VECT_ONLY (res
) = false;
696 STMT_VINFO_SLP_VECT_ONLY_PATTERN (res
) = false;
697 STMT_VINFO_VEC_STMTS (res
) = vNULL
;
698 res
->reduc_initial_values
= vNULL
;
699 res
->reduc_scalar_results
= vNULL
;
701 if (is_a
<loop_vec_info
> (this)
702 && gimple_code (stmt
) == GIMPLE_PHI
703 && is_loop_header_bb_p (gimple_bb (stmt
)))
704 STMT_VINFO_DEF_TYPE (res
) = vect_unknown_def_type
;
706 STMT_VINFO_DEF_TYPE (res
) = vect_internal_def
;
708 STMT_SLP_TYPE (res
) = loop_vect
;
710 /* This is really "uninitialized" until vect_compute_data_ref_alignment. */
711 res
->dr_aux
.misalignment
= DR_MISALIGNMENT_UNINITIALIZED
;
716 /* Associate STMT with INFO. */
719 vec_info::set_vinfo_for_stmt (gimple
*stmt
, stmt_vec_info info
, bool check_ro
)
721 unsigned int uid
= gimple_uid (stmt
);
724 gcc_assert (!check_ro
|| !stmt_vec_info_ro
);
725 gcc_checking_assert (info
);
726 uid
= stmt_vec_infos
.length () + 1;
727 gimple_set_uid (stmt
, uid
);
728 stmt_vec_infos
.safe_push (info
);
732 gcc_checking_assert (info
== NULL
);
733 stmt_vec_infos
[uid
- 1] = info
;
737 /* Free the contents of stmt_vec_infos. */
740 vec_info::free_stmt_vec_infos (void)
742 for (stmt_vec_info
&info
: stmt_vec_infos
)
744 free_stmt_vec_info (info
);
745 stmt_vec_infos
.release ();
748 /* Free STMT_INFO. */
751 vec_info::free_stmt_vec_info (stmt_vec_info stmt_info
)
753 if (stmt_info
->pattern_stmt_p
)
755 gimple_set_bb (stmt_info
->stmt
, NULL
);
756 tree lhs
= gimple_get_lhs (stmt_info
->stmt
);
757 if (lhs
&& TREE_CODE (lhs
) == SSA_NAME
)
758 release_ssa_name (lhs
);
761 stmt_info
->reduc_initial_values
.release ();
762 stmt_info
->reduc_scalar_results
.release ();
763 STMT_VINFO_SIMD_CLONE_INFO (stmt_info
).release ();
764 STMT_VINFO_VEC_STMTS (stmt_info
).release ();
768 /* Returns true if S1 dominates S2. */
771 vect_stmt_dominates_stmt_p (gimple
*s1
, gimple
*s2
)
773 basic_block bb1
= gimple_bb (s1
), bb2
= gimple_bb (s2
);
775 /* If bb1 is NULL, it should be a GIMPLE_NOP def stmt of an (D)
776 SSA_NAME. Assume it lives at the beginning of function and
777 thus dominates everything. */
778 if (!bb1
|| s1
== s2
)
781 /* If bb2 is NULL, it doesn't dominate any stmt with a bb. */
786 return dominated_by_p (CDI_DOMINATORS
, bb2
, bb1
);
788 /* PHIs in the same basic block are assumed to be
789 executed all in parallel, if only one stmt is a PHI,
790 it dominates the other stmt in the same basic block. */
791 if (gimple_code (s1
) == GIMPLE_PHI
)
794 if (gimple_code (s2
) == GIMPLE_PHI
)
797 /* Inserted vectorized stmts all have UID 0 while the original stmts
798 in the IL have UID increasing within a BB. Walk from both sides
799 until we find the other stmt or a stmt with UID != 0. */
800 gimple_stmt_iterator gsi1
= gsi_for_stmt (s1
);
801 while (gimple_uid (gsi_stmt (gsi1
)) == 0)
804 if (gsi_end_p (gsi1
))
806 if (gsi_stmt (gsi1
) == s2
)
809 if (gimple_uid (gsi_stmt (gsi1
)) == -1u)
812 gimple_stmt_iterator gsi2
= gsi_for_stmt (s2
);
813 while (gimple_uid (gsi_stmt (gsi2
)) == 0)
816 if (gsi_end_p (gsi2
))
818 if (gsi_stmt (gsi2
) == s1
)
821 if (gimple_uid (gsi_stmt (gsi2
)) == -1u)
824 if (gimple_uid (gsi_stmt (gsi1
)) <= gimple_uid (gsi_stmt (gsi2
)))
829 /* A helper function to free scev and LOOP niter information, as well as
830 clear loop constraint LOOP_C_FINITE. */
833 vect_free_loop_info_assumptions (class loop
*loop
)
836 /* We need to explicitly reset upper bound information since they are
837 used even after free_numbers_of_iterations_estimates. */
838 loop
->any_upper_bound
= false;
839 loop
->any_likely_upper_bound
= false;
840 free_numbers_of_iterations_estimates (loop
);
841 loop_constraint_clear (loop
, LOOP_C_FINITE
);
844 /* If LOOP has been versioned during ifcvt, return the internal call
848 vect_loop_vectorized_call (class loop
*loop
, gcond
**cond
)
850 basic_block bb
= loop_preheader_edge (loop
)->src
;
855 if ((g
&& gimple_code (g
) == GIMPLE_COND
)
856 || !single_succ_p (bb
))
858 if (!single_pred_p (bb
))
860 bb
= single_pred (bb
);
863 if (g
&& gimple_code (g
) == GIMPLE_COND
)
866 *cond
= as_a
<gcond
*> (g
);
867 gimple_stmt_iterator gsi
= gsi_for_stmt (g
);
869 if (!gsi_end_p (gsi
))
872 if (gimple_call_internal_p (g
, IFN_LOOP_VECTORIZED
)
873 && (tree_to_shwi (gimple_call_arg (g
, 0)) == loop
->num
874 || tree_to_shwi (gimple_call_arg (g
, 1)) == loop
->num
))
881 /* If LOOP has been versioned during loop distribution, return the gurading
885 vect_loop_dist_alias_call (class loop
*loop
)
889 class loop
*outer
, *orig
;
890 gimple_stmt_iterator gsi
;
893 if (loop
->orig_loop_num
== 0)
896 orig
= get_loop (cfun
, loop
->orig_loop_num
);
899 /* The original loop is somehow destroyed. Clear the information. */
900 loop
->orig_loop_num
= 0;
905 bb
= nearest_common_dominator (CDI_DOMINATORS
, loop
->header
, orig
->header
);
907 bb
= loop_preheader_edge (loop
)->src
;
909 outer
= bb
->loop_father
;
910 entry
= ENTRY_BLOCK_PTR_FOR_FN (cfun
);
912 /* Look upward in dominance tree. */
913 for (; bb
!= entry
&& flow_bb_inside_loop_p (outer
, bb
);
914 bb
= get_immediate_dominator (CDI_DOMINATORS
, bb
))
917 if (g
== NULL
|| gimple_code (g
) != GIMPLE_COND
)
920 gsi
= gsi_for_stmt (g
);
926 /* The guarding internal function call must have the same distribution
928 if (gimple_call_internal_p (g
, IFN_LOOP_DIST_ALIAS
)
929 && (tree_to_shwi (gimple_call_arg (g
, 0)) == loop
->orig_loop_num
))
935 /* Set the uids of all the statements in basic blocks inside loop
936 represented by LOOP_VINFO. LOOP_VECTORIZED_CALL is the internal
937 call guarding the loop which has been if converted. */
939 set_uid_loop_bbs (loop_vec_info loop_vinfo
, gimple
*loop_vectorized_call
)
941 tree arg
= gimple_call_arg (loop_vectorized_call
, 1);
944 class loop
*scalar_loop
= get_loop (cfun
, tree_to_shwi (arg
));
946 LOOP_VINFO_SCALAR_LOOP (loop_vinfo
) = scalar_loop
;
947 gcc_checking_assert (vect_loop_vectorized_call (scalar_loop
)
948 == loop_vectorized_call
);
949 /* If we are going to vectorize outer loop, prevent vectorization
950 of the inner loop in the scalar loop - either the scalar loop is
951 thrown away, so it is a wasted work, or is used only for
953 if (scalar_loop
->inner
)
955 gimple
*g
= vect_loop_vectorized_call (scalar_loop
->inner
);
958 arg
= gimple_call_arg (g
, 0);
959 get_loop (cfun
, tree_to_shwi (arg
))->dont_vectorize
= true;
960 fold_loop_internal_call (g
, boolean_false_node
);
963 bbs
= get_loop_body (scalar_loop
);
964 for (i
= 0; i
< scalar_loop
->num_nodes
; i
++)
966 basic_block bb
= bbs
[i
];
967 gimple_stmt_iterator gsi
;
968 for (gsi
= gsi_start_phis (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
970 gimple
*phi
= gsi_stmt (gsi
);
971 gimple_set_uid (phi
, 0);
973 for (gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
); gsi_next (&gsi
))
975 gimple
*stmt
= gsi_stmt (gsi
);
976 gimple_set_uid (stmt
, 0);
982 /* Generate vectorized code for LOOP and its epilogues. */
985 vect_transform_loops (hash_table
<simduid_to_vf
> *&simduid_to_vf_htab
,
986 loop_p loop
, gimple
*loop_vectorized_call
)
988 loop_vec_info loop_vinfo
= loop_vec_info_for_loop (loop
);
990 if (loop_vectorized_call
)
991 set_uid_loop_bbs (loop_vinfo
, loop_vectorized_call
);
993 unsigned HOST_WIDE_INT bytes
;
994 if (dump_enabled_p ())
996 if (GET_MODE_SIZE (loop_vinfo
->vector_mode
).is_constant (&bytes
))
997 dump_printf_loc (MSG_OPTIMIZED_LOCATIONS
, vect_location
,
998 "loop vectorized using %wu byte vectors\n", bytes
);
1000 dump_printf_loc (MSG_OPTIMIZED_LOCATIONS
, vect_location
,
1001 "loop vectorized using variable length vectors\n");
1004 loop_p new_loop
= vect_transform_loop (loop_vinfo
,
1005 loop_vectorized_call
);
1006 /* Now that the loop has been vectorized, allow it to be unrolled
1008 loop
->force_vectorize
= false;
1012 simduid_to_vf
*simduid_to_vf_data
= XNEW (simduid_to_vf
);
1013 if (!simduid_to_vf_htab
)
1014 simduid_to_vf_htab
= new hash_table
<simduid_to_vf
> (15);
1015 simduid_to_vf_data
->simduid
= DECL_UID (loop
->simduid
);
1016 simduid_to_vf_data
->vf
= loop_vinfo
->vectorization_factor
;
1017 *simduid_to_vf_htab
->find_slot (simduid_to_vf_data
, INSERT
)
1018 = simduid_to_vf_data
;
1021 /* Epilogue of vectorized loop must be vectorized too. */
1023 vect_transform_loops (simduid_to_vf_htab
, new_loop
, NULL
);
1026 /* Try to vectorize LOOP. */
1029 try_vectorize_loop_1 (hash_table
<simduid_to_vf
> *&simduid_to_vf_htab
,
1030 unsigned *num_vectorized_loops
, loop_p loop
,
1031 gimple
*loop_vectorized_call
,
1032 gimple
*loop_dist_alias_call
)
1035 vec_info_shared shared
;
1036 auto_purge_vect_location sentinel
;
1037 vect_location
= find_loop_location (loop
);
1039 if (LOCATION_LOCUS (vect_location
.get_location_t ()) != UNKNOWN_LOCATION
1040 && dump_enabled_p ())
1041 dump_printf (MSG_NOTE
| MSG_PRIORITY_INTERNALS
,
1042 "\nAnalyzing loop at %s:%d\n",
1043 LOCATION_FILE (vect_location
.get_location_t ()),
1044 LOCATION_LINE (vect_location
.get_location_t ()));
1046 /* Try to analyze the loop, retaining an opt_problem if dump_enabled_p. */
1047 opt_loop_vec_info loop_vinfo
= vect_analyze_loop (loop
, &shared
);
1048 loop
->aux
= loop_vinfo
;
1051 if (dump_enabled_p ())
1052 if (opt_problem
*problem
= loop_vinfo
.get_problem ())
1054 dump_printf_loc (MSG_MISSED_OPTIMIZATION
, vect_location
,
1055 "couldn't vectorize loop\n");
1056 problem
->emit_and_clear ();
1059 if (!loop_vinfo
|| !LOOP_VINFO_VECTORIZABLE_P (loop_vinfo
))
1061 /* Free existing information if loop is analyzed with some
1063 if (loop_constraint_set_p (loop
, LOOP_C_FINITE
))
1064 vect_free_loop_info_assumptions (loop
);
1066 /* If we applied if-conversion then try to vectorize the
1067 BB of innermost loops.
1068 ??? Ideally BB vectorization would learn to vectorize
1069 control flow by applying if-conversion on-the-fly, the
1070 following retains the if-converted loop body even when
1071 only non-if-converted parts took part in BB vectorization. */
1072 if (flag_tree_slp_vectorize
!= 0
1073 && loop_vectorized_call
1076 basic_block bb
= loop
->header
;
1077 bool require_loop_vectorize
= false;
1078 for (gimple_stmt_iterator gsi
= gsi_start_bb (bb
);
1079 !gsi_end_p (gsi
); gsi_next (&gsi
))
1081 gimple
*stmt
= gsi_stmt (gsi
);
1082 gcall
*call
= dyn_cast
<gcall
*> (stmt
);
1083 if (call
&& gimple_call_internal_p (call
))
1085 internal_fn ifn
= gimple_call_internal_fn (call
);
1086 if (ifn
== IFN_MASK_LOAD
|| ifn
== IFN_MASK_STORE
1087 /* Don't keep the if-converted parts when the ifn with
1088 specifc type is not supported by the backend. */
1089 || (direct_internal_fn_p (ifn
)
1090 && !direct_internal_fn_supported_p
1091 (call
, OPTIMIZE_FOR_SPEED
)))
1093 require_loop_vectorize
= true;
1097 gimple_set_uid (stmt
, -1);
1098 gimple_set_visited (stmt
, false);
1100 if (!require_loop_vectorize
)
1102 tree arg
= gimple_call_arg (loop_vectorized_call
, 1);
1103 class loop
*scalar_loop
= get_loop (cfun
, tree_to_shwi (arg
));
1104 if (vect_slp_if_converted_bb (bb
, scalar_loop
))
1106 fold_loop_internal_call (loop_vectorized_call
,
1108 loop_vectorized_call
= NULL
;
1109 ret
|= TODO_cleanup_cfg
| TODO_update_ssa_only_virtuals
;
1113 /* If outer loop vectorization fails for LOOP_VECTORIZED guarded
1114 loop, don't vectorize its inner loop; we'll attempt to
1115 vectorize LOOP_VECTORIZED guarded inner loop of the scalar
1117 if (loop_vectorized_call
&& loop
->inner
)
1118 loop
->inner
->dont_vectorize
= true;
1122 if (!dbg_cnt (vect_loop
))
1124 /* Free existing information if loop is analyzed with some
1126 if (loop_constraint_set_p (loop
, LOOP_C_FINITE
))
1127 vect_free_loop_info_assumptions (loop
);
1131 (*num_vectorized_loops
)++;
1132 /* Transform LOOP and its epilogues. */
1133 vect_transform_loops (simduid_to_vf_htab
, loop
, loop_vectorized_call
);
1135 if (loop_vectorized_call
)
1137 fold_loop_internal_call (loop_vectorized_call
, boolean_true_node
);
1138 ret
|= TODO_cleanup_cfg
;
1140 if (loop_dist_alias_call
)
1142 tree value
= gimple_call_arg (loop_dist_alias_call
, 1);
1143 fold_loop_internal_call (loop_dist_alias_call
, value
);
1144 ret
|= TODO_cleanup_cfg
;
1150 /* Try to vectorize LOOP. */
1153 try_vectorize_loop (hash_table
<simduid_to_vf
> *&simduid_to_vf_htab
,
1154 unsigned *num_vectorized_loops
, loop_p loop
)
1156 if (!((flag_tree_loop_vectorize
1157 && optimize_loop_nest_for_speed_p (loop
))
1158 || loop
->force_vectorize
))
1161 return try_vectorize_loop_1 (simduid_to_vf_htab
, num_vectorized_loops
, loop
,
1162 vect_loop_vectorized_call (loop
),
1163 vect_loop_dist_alias_call (loop
));
1167 /* Function vectorize_loops.
1169 Entry point to loop vectorization phase. */
1172 vectorize_loops (void)
1175 unsigned int num_vectorized_loops
= 0;
1176 unsigned int vect_loops_num
;
1178 hash_table
<simduid_to_vf
> *simduid_to_vf_htab
= NULL
;
1179 hash_table
<simd_array_to_simduid
> *simd_array_to_simduid_htab
= NULL
;
1180 bool any_ifcvt_loops
= false;
1183 vect_loops_num
= number_of_loops (cfun
);
1185 /* Bail out if there are no loops. */
1186 if (vect_loops_num
<= 1)
1191 if (cfun
->has_simduid_loops
)
1192 note_simd_array_uses (&simd_array_to_simduid_htab
);
1194 /* ----------- Analyze loops. ----------- */
1196 /* If some loop was duplicated, it gets bigger number
1197 than all previously defined loops. This fact allows us to run
1198 only over initial loops skipping newly generated ones. */
1199 for (auto loop
: loops_list (cfun
, 0))
1200 if (loop
->dont_vectorize
)
1202 any_ifcvt_loops
= true;
1203 /* If-conversion sometimes versions both the outer loop
1204 (for the case when outer loop vectorization might be
1205 desirable) as well as the inner loop in the scalar version
1206 of the loop. So we have:
1207 if (LOOP_VECTORIZED (1, 3))
1213 loop3 (copy of loop1)
1214 if (LOOP_VECTORIZED (4, 5))
1215 loop4 (copy of loop2)
1217 loop5 (copy of loop4)
1218 If loops' iteration gives us loop3 first (which has
1219 dont_vectorize set), make sure to process loop1 before loop4;
1220 so that we can prevent vectorization of loop4 if loop1
1221 is successfully vectorized. */
1224 gimple
*loop_vectorized_call
1225 = vect_loop_vectorized_call (loop
);
1226 if (loop_vectorized_call
1227 && vect_loop_vectorized_call (loop
->inner
))
1229 tree arg
= gimple_call_arg (loop_vectorized_call
, 0);
1230 class loop
*vector_loop
1231 = get_loop (cfun
, tree_to_shwi (arg
));
1232 if (vector_loop
&& vector_loop
!= loop
)
1234 /* Make sure we don't vectorize it twice. */
1235 vector_loop
->dont_vectorize
= true;
1236 ret
|= try_vectorize_loop (simduid_to_vf_htab
,
1237 &num_vectorized_loops
,
1244 ret
|= try_vectorize_loop (simduid_to_vf_htab
, &num_vectorized_loops
,
1247 vect_location
= dump_user_location_t ();
1249 statistics_counter_event (cfun
, "Vectorized loops", num_vectorized_loops
);
1250 if (dump_enabled_p ()
1251 || (num_vectorized_loops
> 0 && dump_enabled_p ()))
1252 dump_printf_loc (MSG_NOTE
, vect_location
,
1253 "vectorized %u loops in function.\n",
1254 num_vectorized_loops
);
1256 /* ----------- Finalize. ----------- */
1258 if (any_ifcvt_loops
)
1259 for (i
= 1; i
< number_of_loops (cfun
); i
++)
1261 loop
= get_loop (cfun
, i
);
1262 if (loop
&& loop
->dont_vectorize
)
1264 gimple
*g
= vect_loop_vectorized_call (loop
);
1267 fold_loop_internal_call (g
, boolean_false_node
);
1268 ret
|= TODO_cleanup_cfg
;
1272 g
= vect_loop_dist_alias_call (loop
);
1276 fold_loop_internal_call (g
, boolean_false_node
);
1277 ret
|= TODO_cleanup_cfg
;
1282 for (i
= 1; i
< number_of_loops (cfun
); i
++)
1284 loop_vec_info loop_vinfo
;
1285 bool has_mask_store
;
1287 loop
= get_loop (cfun
, i
);
1288 if (!loop
|| !loop
->aux
)
1290 loop_vinfo
= (loop_vec_info
) loop
->aux
;
1291 has_mask_store
= LOOP_VINFO_HAS_MASK_STORE (loop_vinfo
);
1294 && targetm
.vectorize
.empty_mask_is_expensive (IFN_MASK_STORE
))
1295 optimize_mask_stores (loop
);
1299 /* Fold IFN_GOMP_SIMD_{VF,LANE,LAST_LANE,ORDERED_{START,END}} builtins. */
1300 if (cfun
->has_simduid_loops
)
1302 adjust_simduid_builtins (simduid_to_vf_htab
);
1303 /* Avoid stale SCEV cache entries for the SIMD_LANE defs. */
1307 /* Shrink any "omp array simd" temporary arrays to the
1308 actual vectorization factors. */
1309 if (simd_array_to_simduid_htab
)
1310 shrink_simd_arrays (simd_array_to_simduid_htab
, simduid_to_vf_htab
);
1311 delete simduid_to_vf_htab
;
1312 cfun
->has_simduid_loops
= false;
1315 if (num_vectorized_loops
> 0)
1317 /* If we vectorized any loop only virtual SSA form needs to be updated.
1318 ??? Also while we try hard to update loop-closed SSA form we fail
1319 to properly do this in some corner-cases (see PR56286). */
1320 rewrite_into_loop_closed_ssa (NULL
, TODO_update_ssa_only_virtuals
);
1321 return TODO_cleanup_cfg
;
1328 /* Entry point to the simduid cleanup pass. */
1332 const pass_data pass_data_simduid_cleanup
=
1334 GIMPLE_PASS
, /* type */
1335 "simduid", /* name */
1336 OPTGROUP_NONE
, /* optinfo_flags */
1337 TV_NONE
, /* tv_id */
1338 ( PROP_ssa
| PROP_cfg
), /* properties_required */
1339 0, /* properties_provided */
1340 0, /* properties_destroyed */
1341 0, /* todo_flags_start */
1342 0, /* todo_flags_finish */
1345 class pass_simduid_cleanup
: public gimple_opt_pass
1348 pass_simduid_cleanup (gcc::context
*ctxt
)
1349 : gimple_opt_pass (pass_data_simduid_cleanup
, ctxt
)
1352 /* opt_pass methods: */
1353 opt_pass
* clone () { return new pass_simduid_cleanup (m_ctxt
); }
1354 virtual bool gate (function
*fun
) { return fun
->has_simduid_loops
; }
1355 virtual unsigned int execute (function
*);
1357 }; // class pass_simduid_cleanup
1360 pass_simduid_cleanup::execute (function
*fun
)
1362 hash_table
<simd_array_to_simduid
> *simd_array_to_simduid_htab
= NULL
;
1364 note_simd_array_uses (&simd_array_to_simduid_htab
);
1366 /* Fold IFN_GOMP_SIMD_{VF,LANE,LAST_LANE,ORDERED_{START,END}} builtins. */
1367 adjust_simduid_builtins (NULL
);
1369 /* Shrink any "omp array simd" temporary arrays to the
1370 actual vectorization factors. */
1371 if (simd_array_to_simduid_htab
)
1372 shrink_simd_arrays (simd_array_to_simduid_htab
, NULL
);
1373 fun
->has_simduid_loops
= false;
1380 make_pass_simduid_cleanup (gcc::context
*ctxt
)
1382 return new pass_simduid_cleanup (ctxt
);
1386 /* Entry point to basic block SLP phase. */
1390 const pass_data pass_data_slp_vectorize
=
1392 GIMPLE_PASS
, /* type */
1394 OPTGROUP_LOOP
| OPTGROUP_VEC
, /* optinfo_flags */
1395 TV_TREE_SLP_VECTORIZATION
, /* tv_id */
1396 ( PROP_ssa
| PROP_cfg
), /* properties_required */
1397 0, /* properties_provided */
1398 0, /* properties_destroyed */
1399 0, /* todo_flags_start */
1400 TODO_update_ssa
, /* todo_flags_finish */
1403 class pass_slp_vectorize
: public gimple_opt_pass
1406 pass_slp_vectorize (gcc::context
*ctxt
)
1407 : gimple_opt_pass (pass_data_slp_vectorize
, ctxt
)
1410 /* opt_pass methods: */
1411 opt_pass
* clone () { return new pass_slp_vectorize (m_ctxt
); }
1412 virtual bool gate (function
*) { return flag_tree_slp_vectorize
!= 0; }
1413 virtual unsigned int execute (function
*);
1415 }; // class pass_slp_vectorize
1418 pass_slp_vectorize::execute (function
*fun
)
1420 auto_purge_vect_location sentinel
;
1423 bool in_loop_pipeline
= scev_initialized_p ();
1424 if (!in_loop_pipeline
)
1426 loop_optimizer_init (LOOPS_NORMAL
);
1430 /* Mark all stmts as not belonging to the current region and unvisited. */
1431 FOR_EACH_BB_FN (bb
, fun
)
1433 for (gphi_iterator gsi
= gsi_start_phis (bb
); !gsi_end_p (gsi
);
1436 gphi
*stmt
= gsi
.phi ();
1437 gimple_set_uid (stmt
, -1);
1438 gimple_set_visited (stmt
, false);
1440 for (gimple_stmt_iterator gsi
= gsi_start_bb (bb
); !gsi_end_p (gsi
);
1443 gimple
*stmt
= gsi_stmt (gsi
);
1444 gimple_set_uid (stmt
, -1);
1445 gimple_set_visited (stmt
, false);
1451 vect_slp_function (fun
);
1455 if (!in_loop_pipeline
)
1458 loop_optimizer_finalize ();
1467 make_pass_slp_vectorize (gcc::context
*ctxt
)
1469 return new pass_slp_vectorize (ctxt
);
1473 /* Increase alignment of global arrays to improve vectorization potential.
1475 - Consider also structs that have an array field.
1476 - Use ipa analysis to prune arrays that can't be vectorized?
1477 This should involve global alignment analysis and in the future also
1480 static unsigned get_vec_alignment_for_type (tree
);
1481 static hash_map
<tree
, unsigned> *type_align_map
;
1483 /* Return alignment of array's vector type corresponding to scalar type.
1484 0 if no vector type exists. */
1486 get_vec_alignment_for_array_type (tree type
)
1488 gcc_assert (TREE_CODE (type
) == ARRAY_TYPE
);
1489 poly_uint64 array_size
, vector_size
;
1491 tree scalar_type
= strip_array_types (type
);
1492 tree vectype
= get_related_vectype_for_scalar_type (VOIDmode
, scalar_type
);
1494 || !poly_int_tree_p (TYPE_SIZE (type
), &array_size
)
1495 || !poly_int_tree_p (TYPE_SIZE (vectype
), &vector_size
)
1496 || maybe_lt (array_size
, vector_size
))
1499 return TYPE_ALIGN (vectype
);
1502 /* Return alignment of field having maximum alignment of vector type
1503 corresponding to it's scalar type. For now, we only consider fields whose
1504 offset is a multiple of it's vector alignment.
1505 0 if no suitable field is found. */
1507 get_vec_alignment_for_record_type (tree type
)
1509 gcc_assert (TREE_CODE (type
) == RECORD_TYPE
);
1511 unsigned max_align
= 0, alignment
;
1512 HOST_WIDE_INT offset
;
1515 if (TYPE_PACKED (type
))
1518 unsigned *slot
= type_align_map
->get (type
);
1522 for (tree field
= first_field (type
);
1524 field
= DECL_CHAIN (field
))
1526 /* Skip if not FIELD_DECL or if alignment is set by user. */
1527 if (TREE_CODE (field
) != FIELD_DECL
1528 || DECL_USER_ALIGN (field
)
1529 || DECL_ARTIFICIAL (field
))
1532 /* We don't need to process the type further if offset is variable,
1533 since the offsets of remaining members will also be variable. */
1534 if (TREE_CODE (DECL_FIELD_OFFSET (field
)) != INTEGER_CST
1535 || TREE_CODE (DECL_FIELD_BIT_OFFSET (field
)) != INTEGER_CST
)
1538 /* Similarly stop processing the type if offset_tree
1539 does not fit in unsigned HOST_WIDE_INT. */
1540 offset_tree
= bit_position (field
);
1541 if (!tree_fits_uhwi_p (offset_tree
))
1544 offset
= tree_to_uhwi (offset_tree
);
1545 alignment
= get_vec_alignment_for_type (TREE_TYPE (field
));
1547 /* Get maximum alignment of vectorized field/array among those members
1548 whose offset is multiple of the vector alignment. */
1550 && (offset
% alignment
== 0)
1551 && (alignment
> max_align
))
1552 max_align
= alignment
;
1555 type_align_map
->put (type
, max_align
);
1559 /* Return alignment of vector type corresponding to decl's scalar type
1560 or 0 if it doesn't exist or the vector alignment is lesser than
1561 decl's alignment. */
1563 get_vec_alignment_for_type (tree type
)
1565 if (type
== NULL_TREE
)
1568 gcc_assert (TYPE_P (type
));
1570 static unsigned alignment
= 0;
1571 switch (TREE_CODE (type
))
1574 alignment
= get_vec_alignment_for_array_type (type
);
1577 alignment
= get_vec_alignment_for_record_type (type
);
1584 return (alignment
> TYPE_ALIGN (type
)) ? alignment
: 0;
1587 /* Entry point to increase_alignment pass. */
1589 increase_alignment (void)
1591 varpool_node
*vnode
;
1593 vect_location
= dump_user_location_t ();
1594 type_align_map
= new hash_map
<tree
, unsigned>;
1596 /* Increase the alignment of all global arrays for vectorization. */
1597 FOR_EACH_DEFINED_VARIABLE (vnode
)
1599 tree decl
= vnode
->decl
;
1600 unsigned int alignment
;
1602 if ((decl_in_symtab_p (decl
)
1603 && !symtab_node::get (decl
)->can_increase_alignment_p ())
1604 || DECL_USER_ALIGN (decl
) || DECL_ARTIFICIAL (decl
))
1607 alignment
= get_vec_alignment_for_type (TREE_TYPE (decl
));
1608 if (alignment
&& vect_can_force_dr_alignment_p (decl
, alignment
))
1610 vnode
->increase_alignment (alignment
);
1611 if (dump_enabled_p ())
1612 dump_printf (MSG_NOTE
, "Increasing alignment of decl: %T\n", decl
);
1616 delete type_align_map
;
1623 const pass_data pass_data_ipa_increase_alignment
=
1625 SIMPLE_IPA_PASS
, /* type */
1626 "increase_alignment", /* name */
1627 OPTGROUP_LOOP
| OPTGROUP_VEC
, /* optinfo_flags */
1628 TV_IPA_OPT
, /* tv_id */
1629 0, /* properties_required */
1630 0, /* properties_provided */
1631 0, /* properties_destroyed */
1632 0, /* todo_flags_start */
1633 0, /* todo_flags_finish */
1636 class pass_ipa_increase_alignment
: public simple_ipa_opt_pass
1639 pass_ipa_increase_alignment (gcc::context
*ctxt
)
1640 : simple_ipa_opt_pass (pass_data_ipa_increase_alignment
, ctxt
)
1643 /* opt_pass methods: */
1644 virtual bool gate (function
*)
1646 return flag_section_anchors
&& flag_tree_loop_vectorize
;
1649 virtual unsigned int execute (function
*) { return increase_alignment (); }
1651 }; // class pass_ipa_increase_alignment
1655 simple_ipa_opt_pass
*
1656 make_pass_ipa_increase_alignment (gcc::context
*ctxt
)
1658 return new pass_ipa_increase_alignment (ctxt
);
1661 /* If the condition represented by T is a comparison or the SSA name
1662 result of a comparison, extract the comparison's operands. Represent
1663 T as NE_EXPR <T, 0> otherwise. */
1666 scalar_cond_masked_key::get_cond_ops_from_tree (tree t
)
1668 if (TREE_CODE_CLASS (TREE_CODE (t
)) == tcc_comparison
)
1670 this->code
= TREE_CODE (t
);
1671 this->op0
= TREE_OPERAND (t
, 0);
1672 this->op1
= TREE_OPERAND (t
, 1);
1676 if (TREE_CODE (t
) == SSA_NAME
)
1677 if (gassign
*stmt
= dyn_cast
<gassign
*> (SSA_NAME_DEF_STMT (t
)))
1679 tree_code code
= gimple_assign_rhs_code (stmt
);
1680 if (TREE_CODE_CLASS (code
) == tcc_comparison
)
1683 this->op0
= gimple_assign_rhs1 (stmt
);
1684 this->op1
= gimple_assign_rhs2 (stmt
);
1689 this->code
= NE_EXPR
;
1691 this->op1
= build_zero_cst (TREE_TYPE (t
));