2 Copyright (C) 2003-2024 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 #ifndef GCC_TREE_VECTORIZER_H
22 #define GCC_TREE_VECTORIZER_H
24 typedef class _stmt_vec_info
*stmt_vec_info
;
25 typedef struct _slp_tree
*slp_tree
;
27 #include "tree-data-ref.h"
28 #include "tree-hash-traits.h"
30 #include "internal-fn.h"
31 #include "tree-ssa-operands.h"
32 #include "gimple-match.h"
34 /* Used for naming of new temporaries. */
42 /* Defines type of operation. */
49 /* Define type of available alignment support. */
50 enum dr_alignment_support
{
51 dr_unaligned_unsupported
,
52 dr_unaligned_supported
,
54 dr_explicit_realign_optimized
,
58 /* Define type of def-use cross-iteration cycle. */
60 vect_uninitialized_def
= 0,
61 vect_constant_def
= 1,
66 vect_double_reduction_def
,
68 vect_first_order_recurrence
,
73 /* Define operation type of linear/non-linear induction variable. */
74 enum vect_induction_op_type
{
82 /* Define type of reduction. */
83 enum vect_reduction_type
{
86 INTEGER_INDUC_COND_REDUCTION
,
89 /* Retain a scalar phi and use a FOLD_EXTRACT_LAST within the loop
92 for (int i = 0; i < VF; ++i)
93 res = cond[i] ? val[i] : res; */
94 EXTRACT_LAST_REDUCTION
,
96 /* Use a folding reduction within the loop to implement:
98 for (int i = 0; i < VF; ++i)
101 (with no reassocation). */
105 #define VECTORIZABLE_CYCLE_DEF(D) (((D) == vect_reduction_def) \
106 || ((D) == vect_double_reduction_def) \
107 || ((D) == vect_nested_cycle))
109 /* Structure to encapsulate information about a group of like
110 instructions to be presented to the target cost model. */
111 struct stmt_info_for_cost
{
113 enum vect_cost_for_stmt kind
;
114 enum vect_cost_model_location where
;
115 stmt_vec_info stmt_info
;
121 typedef vec
<stmt_info_for_cost
> stmt_vector_for_cost
;
123 /* Maps base addresses to an innermost_loop_behavior and the stmt it was
124 derived from that gives the maximum known alignment for that base. */
125 typedef hash_map
<tree_operand_hash
,
126 std::pair
<stmt_vec_info
, innermost_loop_behavior
*> >
129 /* Represents elements [START, START + LENGTH) of cyclical array OPS*
130 (i.e. OPS repeated to give at least START + LENGTH elements) */
131 struct vect_scalar_ops_slice
133 tree
op (unsigned int i
) const;
134 bool all_same_p () const;
141 /* Return element I of the slice. */
143 vect_scalar_ops_slice::op (unsigned int i
) const
145 return (*ops
)[(i
+ start
) % ops
->length ()];
148 /* Hash traits for vect_scalar_ops_slice. */
149 struct vect_scalar_ops_slice_hash
: typed_noop_remove
<vect_scalar_ops_slice
>
151 typedef vect_scalar_ops_slice value_type
;
152 typedef vect_scalar_ops_slice compare_type
;
154 static const bool empty_zero_p
= true;
156 static void mark_deleted (value_type
&s
) { s
.length
= ~0U; }
157 static void mark_empty (value_type
&s
) { s
.length
= 0; }
158 static bool is_deleted (const value_type
&s
) { return s
.length
== ~0U; }
159 static bool is_empty (const value_type
&s
) { return s
.length
== 0; }
160 static hashval_t
hash (const value_type
&);
161 static bool equal (const value_type
&, const compare_type
&);
164 /************************************************************************
166 ************************************************************************/
167 typedef vec
<std::pair
<unsigned, unsigned> > lane_permutation_t
;
168 typedef auto_vec
<std::pair
<unsigned, unsigned>, 16> auto_lane_permutation_t
;
169 typedef vec
<unsigned> load_permutation_t
;
170 typedef auto_vec
<unsigned, 16> auto_load_permutation_t
;
172 /* A computation tree of an SLP instance. Each node corresponds to a group of
173 stmts to be packed in a SIMD stmt. */
178 void push_vec_def (gimple
*def
);
179 void push_vec_def (tree def
) { vec_defs
.quick_push (def
); }
181 /* Nodes that contain def-stmts of this node statements operands. */
182 vec
<slp_tree
> children
;
184 /* A group of scalar stmts to be vectorized together. */
185 vec
<stmt_vec_info
> stmts
;
186 /* A group of scalar operands to be vectorized together. */
188 /* The representative that should be used for analysis and
190 stmt_vec_info representative
;
192 /* Load permutation relative to the stores, NULL if there is no
194 load_permutation_t load_permutation
;
195 /* Lane permutation of the operands scalar lanes encoded as pairs
196 of { operand number, lane number }. The number of elements
197 denotes the number of output lanes. */
198 lane_permutation_t lane_permutation
;
200 /* Selected SIMD clone's function info. First vector element
201 is SIMD clone's function decl, followed by a pair of trees (base + step)
202 for linear arguments (pair of NULLs for other arguments). */
203 vec
<tree
> simd_clone_info
;
206 /* Vectorized defs. */
208 /* Number of vector stmts that are created to replace the group of scalar
209 stmts. It is calculated during the transformation phase as the number of
210 scalar elements in one scalar iteration (GROUP_SIZE) multiplied by VF
211 divided by vector size. */
212 unsigned int vec_stmts_size
;
214 /* Reference count in the SLP graph. */
216 /* The maximum number of vector elements for the subtree rooted
218 poly_uint64 max_nunits
;
219 /* The DEF type of this node. */
220 enum vect_def_type def_type
;
221 /* The number of scalar lanes produced by this node. */
223 /* The operation of this node. */
228 /* If not NULL this is a cached failed SLP discovery attempt with
229 the lanes that failed during SLP discovery as 'false'. This is
230 a copy of the matches array. */
233 /* Allocate from slp_tree_pool. */
234 static void *operator new (size_t);
236 /* Return memory to slp_tree_pool. */
237 static void operator delete (void *, size_t);
239 /* Linked list of nodes to release when we free the slp_tree_pool. */
244 /* The enum describes the type of operations that an SLP instance
247 enum slp_instance_kind
{
249 slp_inst_kind_reduc_group
,
250 slp_inst_kind_reduc_chain
,
251 slp_inst_kind_bb_reduc
,
255 /* SLP instance is a sequence of stmts in a loop that can be packed into
257 typedef class _slp_instance
{
259 /* The root of SLP tree. */
262 /* For vector constructors, the constructor stmt that the SLP tree is built
263 from, NULL otherwise. */
264 vec
<stmt_vec_info
> root_stmts
;
266 /* For slp_inst_kind_bb_reduc the defs that were not vectorized, NULL
268 vec
<tree
> remain_defs
;
270 /* The unrolling factor required to vectorized this SLP instance. */
271 poly_uint64 unrolling_factor
;
273 /* The group of nodes that contain loads of this SLP instance. */
276 /* The SLP node containing the reduction PHIs. */
279 /* Vector cost of this entry to the SLP graph. */
280 stmt_vector_for_cost cost_vec
;
282 /* If this instance is the main entry of a subgraph the set of
283 entries into the same subgraph, including itself. */
284 vec
<_slp_instance
*> subgraph_entries
;
286 /* The type of operation the SLP instance is performing. */
287 slp_instance_kind kind
;
289 dump_user_location_t
location () const;
293 /* Access Functions. */
294 #define SLP_INSTANCE_TREE(S) (S)->root
295 #define SLP_INSTANCE_UNROLLING_FACTOR(S) (S)->unrolling_factor
296 #define SLP_INSTANCE_LOADS(S) (S)->loads
297 #define SLP_INSTANCE_ROOT_STMTS(S) (S)->root_stmts
298 #define SLP_INSTANCE_REMAIN_DEFS(S) (S)->remain_defs
299 #define SLP_INSTANCE_KIND(S) (S)->kind
301 #define SLP_TREE_CHILDREN(S) (S)->children
302 #define SLP_TREE_SCALAR_STMTS(S) (S)->stmts
303 #define SLP_TREE_SCALAR_OPS(S) (S)->ops
304 #define SLP_TREE_REF_COUNT(S) (S)->refcnt
305 #define SLP_TREE_VEC_DEFS(S) (S)->vec_defs
306 #define SLP_TREE_NUMBER_OF_VEC_STMTS(S) (S)->vec_stmts_size
307 #define SLP_TREE_LOAD_PERMUTATION(S) (S)->load_permutation
308 #define SLP_TREE_LANE_PERMUTATION(S) (S)->lane_permutation
309 #define SLP_TREE_SIMD_CLONE_INFO(S) (S)->simd_clone_info
310 #define SLP_TREE_DEF_TYPE(S) (S)->def_type
311 #define SLP_TREE_VECTYPE(S) (S)->vectype
312 #define SLP_TREE_REPRESENTATIVE(S) (S)->representative
313 #define SLP_TREE_LANES(S) (S)->lanes
314 #define SLP_TREE_CODE(S) (S)->code
316 enum vect_partial_vector_style
{
317 vect_partial_vectors_none
,
318 vect_partial_vectors_while_ult
,
319 vect_partial_vectors_avx512
,
320 vect_partial_vectors_len
323 /* Key for map that records association between
324 scalar conditions and corresponding loop mask, and
325 is populated by vect_record_loop_mask. */
327 struct scalar_cond_masked_key
329 scalar_cond_masked_key (tree t
, unsigned ncopies_
)
332 get_cond_ops_from_tree (t
);
335 void get_cond_ops_from_tree (tree
);
345 struct default_hash_traits
<scalar_cond_masked_key
>
347 typedef scalar_cond_masked_key compare_type
;
348 typedef scalar_cond_masked_key value_type
;
350 static inline hashval_t
355 inchash::add_expr (v
.op0
, h
, 0);
356 inchash::add_expr (v
.op1
, h
, 0);
357 h
.add_int (v
.ncopies
);
358 h
.add_flag (v
.inverted_p
);
363 equal (value_type existing
, value_type candidate
)
365 return (existing
.ncopies
== candidate
.ncopies
366 && existing
.code
== candidate
.code
367 && existing
.inverted_p
== candidate
.inverted_p
368 && operand_equal_p (existing
.op0
, candidate
.op0
, 0)
369 && operand_equal_p (existing
.op1
, candidate
.op1
, 0));
372 static const bool empty_zero_p
= true;
375 mark_empty (value_type
&v
)
378 v
.inverted_p
= false;
382 is_empty (value_type v
)
384 return v
.ncopies
== 0;
387 static inline void mark_deleted (value_type
&) {}
389 static inline bool is_deleted (const value_type
&)
394 static inline void remove (value_type
&) {}
397 typedef hash_set
<scalar_cond_masked_key
> scalar_cond_masked_set_type
;
399 /* Key and map that records association between vector conditions and
400 corresponding loop mask, and is populated by prepare_vec_mask. */
402 typedef pair_hash
<tree_operand_hash
, tree_operand_hash
> tree_cond_mask_hash
;
403 typedef hash_set
<tree_cond_mask_hash
> vec_cond_masked_set_type
;
405 /* Describes two objects whose addresses must be unequal for the vectorized
407 typedef std::pair
<tree
, tree
> vec_object_pair
;
409 /* Records that vectorization is only possible if abs (EXPR) >= MIN_VALUE.
410 UNSIGNED_P is true if we can assume that abs (EXPR) == EXPR. */
411 class vec_lower_bound
{
413 vec_lower_bound () {}
414 vec_lower_bound (tree e
, bool u
, poly_uint64 m
)
415 : expr (e
), unsigned_p (u
), min_value (m
) {}
419 poly_uint64 min_value
;
422 /* Vectorizer state shared between different analyses like vector sizes
423 of the same CFG region. */
424 class vec_info_shared
{
429 void save_datarefs();
430 void check_datarefs();
432 /* The number of scalar stmts. */
435 /* All data references. Freed by free_data_refs, so not an auto_vec. */
436 vec
<data_reference_p
> datarefs
;
437 vec
<data_reference
> datarefs_copy
;
439 /* The loop nest in which the data dependences are computed. */
440 auto_vec
<loop_p
> loop_nest
;
442 /* All data dependences. Freed by free_dependence_relations, so not
447 /* Vectorizer state common between loop and basic-block vectorization. */
450 typedef hash_set
<int_hash
<machine_mode
, E_VOIDmode
, E_BLKmode
> > mode_set
;
451 enum vec_kind
{ bb
, loop
};
453 vec_info (vec_kind
, vec_info_shared
*);
456 stmt_vec_info
add_stmt (gimple
*);
457 stmt_vec_info
add_pattern_stmt (gimple
*, stmt_vec_info
);
458 stmt_vec_info
lookup_stmt (gimple
*);
459 stmt_vec_info
lookup_def (tree
);
460 stmt_vec_info
lookup_single_use (tree
);
461 class dr_vec_info
*lookup_dr (data_reference
*);
462 void move_dr (stmt_vec_info
, stmt_vec_info
);
463 void remove_stmt (stmt_vec_info
);
464 void replace_stmt (gimple_stmt_iterator
*, stmt_vec_info
, gimple
*);
465 void insert_on_entry (stmt_vec_info
, gimple
*);
466 void insert_seq_on_entry (stmt_vec_info
, gimple_seq
);
468 /* The type of vectorization. */
471 /* Shared vectorizer state. */
472 vec_info_shared
*shared
;
474 /* The mapping of GIMPLE UID to stmt_vec_info. */
475 vec
<stmt_vec_info
> stmt_vec_infos
;
476 /* Whether the above mapping is complete. */
477 bool stmt_vec_info_ro
;
479 /* Whether we've done a transform we think OK to not update virtual
481 bool any_known_not_updated_vssa
;
484 auto_vec
<slp_instance
> slp_instances
;
486 /* Maps base addresses to an innermost_loop_behavior that gives the maximum
487 known alignment for that base. */
488 vec_base_alignments base_alignments
;
490 /* All interleaving chains of stores, represented by the first
491 stmt in the chain. */
492 auto_vec
<stmt_vec_info
> grouped_stores
;
494 /* The set of vector modes used in the vectorized region. */
495 mode_set used_vector_modes
;
497 /* The argument we should pass to related_vector_mode when looking up
498 the vector mode for a scalar mode, or VOIDmode if we haven't yet
499 made any decisions about which vector modes to use. */
500 machine_mode vector_mode
;
502 /* The basic blocks in the vectorization region. For _loop_vec_info,
503 the memory is internally managed, while for _bb_vec_info, it points
504 to element space of an external auto_vec<>. This inconsistency is
505 not a good class design pattern. TODO: improve it with an unified
506 auto_vec<> whose lifetime is confined to vec_info object. */
509 /* The count of the basic blocks in the vectorization region. */
513 stmt_vec_info
new_stmt_vec_info (gimple
*stmt
);
514 void set_vinfo_for_stmt (gimple
*, stmt_vec_info
, bool = true);
515 void free_stmt_vec_infos ();
516 void free_stmt_vec_info (stmt_vec_info
);
519 class _loop_vec_info
;
525 is_a_helper
<_loop_vec_info
*>::test (vec_info
*i
)
527 return i
->kind
== vec_info::loop
;
533 is_a_helper
<_bb_vec_info
*>::test (vec_info
*i
)
535 return i
->kind
== vec_info::bb
;
538 /* In general, we can divide the vector statements in a vectorized loop
539 into related groups ("rgroups") and say that for each rgroup there is
540 some nS such that the rgroup operates on nS values from one scalar
541 iteration followed by nS values from the next. That is, if VF is the
542 vectorization factor of the loop, the rgroup operates on a sequence:
544 (1,1) (1,2) ... (1,nS) (2,1) ... (2,nS) ... (VF,1) ... (VF,nS)
546 where (i,j) represents a scalar value with index j in a scalar
547 iteration with index i.
549 [ We use the term "rgroup" to emphasise that this grouping isn't
550 necessarily the same as the grouping of statements used elsewhere.
551 For example, if we implement a group of scalar loads using gather
552 loads, we'll use a separate gather load for each scalar load, and
553 thus each gather load will belong to its own rgroup. ]
555 In general this sequence will occupy nV vectors concatenated
556 together. If these vectors have nL lanes each, the total number
557 of scalar values N is given by:
559 N = nS * VF = nV * nL
561 None of nS, VF, nV and nL are required to be a power of 2. nS and nV
562 are compile-time constants but VF and nL can be variable (if the target
563 supports variable-length vectors).
565 In classical vectorization, each iteration of the vector loop would
566 handle exactly VF iterations of the original scalar loop. However,
567 in vector loops that are able to operate on partial vectors, a
568 particular iteration of the vector loop might handle fewer than VF
569 iterations of the scalar loop. The vector lanes that correspond to
570 iterations of the scalar loop are said to be "active" and the other
571 lanes are said to be "inactive".
573 In such vector loops, many rgroups need to be controlled to ensure
574 that they have no effect for the inactive lanes. Conceptually, each
575 such rgroup needs a sequence of booleans in the same order as above,
576 but with each (i,j) replaced by a boolean that indicates whether
577 iteration i is active. This sequence occupies nV vector controls
578 that again have nL lanes each. Thus the control sequence as a whole
579 consists of VF independent booleans that are each repeated nS times.
581 Taking mask-based approach as a partially-populated vectors example.
582 We make the simplifying assumption that if a sequence of nV masks is
583 suitable for one (nS,nL) pair, we can reuse it for (nS/2,nL/2) by
584 VIEW_CONVERTing it. This holds for all current targets that support
585 fully-masked loops. For example, suppose the scalar loop is:
589 for (int i = 0; i < n; ++i)
591 f[i * 2 + 0] += 1.0f;
592 f[i * 2 + 1] += 2.0f;
596 and suppose that vectors have 256 bits. The vectorized f accesses
597 will belong to one rgroup and the vectorized d access to another:
599 f rgroup: nS = 2, nV = 1, nL = 8
600 d rgroup: nS = 1, nV = 1, nL = 4
603 [ In this simple example the rgroups do correspond to the normal
604 SLP grouping scheme. ]
606 If only the first three lanes are active, the masks we need are:
608 f rgroup: 1 1 | 1 1 | 1 1 | 0 0
609 d rgroup: 1 | 1 | 1 | 0
611 Here we can use a mask calculated for f's rgroup for d's, but not
614 Thus for each value of nV, it is enough to provide nV masks, with the
615 mask being calculated based on the highest nL (or, equivalently, based
616 on the highest nS) required by any rgroup with that nV. We therefore
617 represent the entire collection of masks as a two-level table, with the
618 first level being indexed by nV - 1 (since nV == 0 doesn't exist) and
619 the second being indexed by the mask index 0 <= i < nV. */
621 /* The controls (like masks or lengths) needed by rgroups with nV vectors,
622 according to the description above. */
623 struct rgroup_controls
{
624 /* The largest nS for all rgroups that use these controls.
625 For vect_partial_vectors_avx512 this is the constant nscalars_per_iter
626 for all members of the group. */
627 unsigned int max_nscalars_per_iter
;
629 /* For the largest nS recorded above, the loop controls divide each scalar
630 into FACTOR equal-sized pieces. This is useful if we need to split
631 element-based accesses into byte-based accesses.
632 For vect_partial_vectors_avx512 this records nV instead. */
635 /* This is a vector type with MAX_NSCALARS_PER_ITER * VF / nV elements.
636 For mask-based controls, it is the type of the masks in CONTROLS.
637 For length-based controls, it can be any vector type that has the
638 specified number of elements; the type of the elements doesn't matter. */
641 /* When there is no uniformly used LOOP_VINFO_RGROUP_COMPARE_TYPE this
642 is the rgroup specific type used. */
645 /* A vector of nV controls, in iteration order. */
648 /* In case of len_load and len_store with a bias there is only one
649 rgroup. This holds the adjusted loop length for the this rgroup. */
650 tree bias_adjusted_ctrl
;
653 struct vec_loop_masks
655 bool is_empty () const { return mask_set
.is_empty (); }
657 /* Set to record vectype, nvector pairs. */
658 hash_set
<pair_hash
<nofree_ptr_hash
<tree_node
>,
659 int_hash
<unsigned, 0>>> mask_set
;
661 /* rgroup_controls used for the partial vector scheme. */
662 auto_vec
<rgroup_controls
> rgc_vec
;
665 typedef auto_vec
<rgroup_controls
> vec_loop_lens
;
667 typedef auto_vec
<std::pair
<data_reference
*, tree
> > drs_init_vec
;
669 /* Information about a reduction accumulator from the main loop that could
670 conceivably be reused as the input to a reduction in an epilogue loop. */
671 struct vect_reusable_accumulator
{
672 /* The final value of the accumulator, which forms the input to the
673 reduction operation. */
676 /* The stmt_vec_info that describes the reduction (i.e. the one for
677 which is_reduc_info is true). */
678 stmt_vec_info reduc_info
;
681 /*-----------------------------------------------------------------*/
682 /* Info on vectorized loops. */
683 /*-----------------------------------------------------------------*/
684 typedef class _loop_vec_info
: public vec_info
{
686 _loop_vec_info (class loop
*, vec_info_shared
*);
689 /* The loop to which this info struct refers to. */
692 /* Number of latch executions. */
694 /* Number of iterations. */
696 /* Number of iterations of the original loop. */
697 tree num_iters_unchanged
;
698 /* Condition under which this loop is analyzed and versioned. */
699 tree num_iters_assumptions
;
701 /* The cost of the vector code. */
702 class vector_costs
*vector_costs
;
704 /* The cost of the scalar code. */
705 class vector_costs
*scalar_costs
;
707 /* Threshold of number of iterations below which vectorization will not be
708 performed. It is calculated from MIN_PROFITABLE_ITERS and
709 param_min_vect_loop_bound. */
712 /* When applying loop versioning, the vector form should only be used
713 if the number of scalar iterations is >= this value, on top of all
714 the other requirements. Ignored when loop versioning is not being
716 poly_uint64 versioning_threshold
;
718 /* Unrolling factor */
719 poly_uint64 vectorization_factor
;
721 /* If this loop is an epilogue loop whose main loop can be skipped,
722 MAIN_LOOP_EDGE is the edge from the main loop to this loop's
723 preheader. SKIP_MAIN_LOOP_EDGE is then the edge that skips the
724 main loop and goes straight to this loop's preheader.
726 Both fields are null otherwise. */
728 edge skip_main_loop_edge
;
730 /* If this loop is an epilogue loop that might be skipped after executing
731 the main loop, this edge is the one that skips the epilogue. */
732 edge skip_this_loop_edge
;
734 /* The vectorized form of a standard reduction replaces the original
735 scalar code's final result (a loop-closed SSA PHI) with the result
736 of a vector-to-scalar reduction operation. After vectorization,
737 this variable maps these vector-to-scalar results to information
738 about the reductions that generated them. */
739 hash_map
<tree
, vect_reusable_accumulator
> reusable_accumulators
;
741 /* The number of times that the target suggested we unroll the vector loop
742 in order to promote more ILP. This value will be used to re-analyze the
743 loop for vectorization and if successful the value will be folded into
744 vectorization_factor (and therefore exactly divides
745 vectorization_factor). */
746 unsigned int suggested_unroll_factor
;
748 /* Maximum runtime vectorization factor, or MAX_VECTORIZATION_FACTOR
749 if there is no particular limit. */
750 unsigned HOST_WIDE_INT max_vectorization_factor
;
752 /* The masks that a fully-masked loop should use to avoid operating
753 on inactive scalars. */
754 vec_loop_masks masks
;
756 /* The lengths that a loop with length should use to avoid operating
757 on inactive scalars. */
760 /* Set of scalar conditions that have loop mask applied. */
761 scalar_cond_masked_set_type scalar_cond_masked_set
;
763 /* Set of vector conditions that have loop mask applied. */
764 vec_cond_masked_set_type vec_cond_masked_set
;
766 /* If we are using a loop mask to align memory addresses, this variable
767 contains the number of vector elements that we should skip in the
768 first iteration of the vector loop (i.e. the number of leading
769 elements that should be false in the first mask). */
770 tree mask_skip_niters
;
772 /* The type that the loop control IV should be converted to before
773 testing which of the VF scalars are active and inactive.
774 Only meaningful if LOOP_VINFO_USING_PARTIAL_VECTORS_P. */
775 tree rgroup_compare_type
;
777 /* For #pragma omp simd if (x) loops the x expression. If constant 0,
778 the loop should not be vectorized, if constant non-zero, simd_if_cond
779 shouldn't be set and loop vectorized normally, if SSA_NAME, the loop
780 should be versioned on that condition, using scalar loop if the condition
781 is false and vectorized loop otherwise. */
784 /* The type that the vector loop control IV should have when
785 LOOP_VINFO_USING_PARTIAL_VECTORS_P is true. */
788 /* The style used for implementing partial vectors when
789 LOOP_VINFO_USING_PARTIAL_VECTORS_P is true. */
790 vect_partial_vector_style partial_vector_style
;
792 /* Unknown DRs according to which loop was peeled. */
793 class dr_vec_info
*unaligned_dr
;
795 /* peeling_for_alignment indicates whether peeling for alignment will take
796 place, and what the peeling factor should be:
797 peeling_for_alignment = X means:
798 If X=0: Peeling for alignment will not be applied.
799 If X>0: Peel first X iterations.
800 If X=-1: Generate a runtime test to calculate the number of iterations
801 to be peeled, using the dataref recorded in the field
803 int peeling_for_alignment
;
805 /* The mask used to check the alignment of pointers or arrays. */
808 /* Data Dependence Relations defining address ranges that are candidates
809 for a run-time aliasing check. */
810 auto_vec
<ddr_p
> may_alias_ddrs
;
812 /* Data Dependence Relations defining address ranges together with segment
813 lengths from which the run-time aliasing check is built. */
814 auto_vec
<dr_with_seg_len_pair_t
> comp_alias_ddrs
;
816 /* Check that the addresses of each pair of objects is unequal. */
817 auto_vec
<vec_object_pair
> check_unequal_addrs
;
819 /* List of values that are required to be nonzero. This is used to check
820 whether things like "x[i * n] += 1;" are safe and eventually gets added
821 to the checks for lower bounds below. */
822 auto_vec
<tree
> check_nonzero
;
824 /* List of values that need to be checked for a minimum value. */
825 auto_vec
<vec_lower_bound
> lower_bounds
;
827 /* Statements in the loop that have data references that are candidates for a
828 runtime (loop versioning) misalignment check. */
829 auto_vec
<stmt_vec_info
> may_misalign_stmts
;
831 /* Reduction cycles detected in the loop. Used in loop-aware SLP. */
832 auto_vec
<stmt_vec_info
> reductions
;
834 /* All reduction chains in the loop, represented by the first
835 stmt in the chain. */
836 auto_vec
<stmt_vec_info
> reduction_chains
;
838 /* Cost vector for a single scalar iteration. */
839 auto_vec
<stmt_info_for_cost
> scalar_cost_vec
;
841 /* Map of IV base/step expressions to inserted name in the preheader. */
842 hash_map
<tree_operand_hash
, tree
> *ivexpr_map
;
844 /* Map of OpenMP "omp simd array" scan variables to corresponding
845 rhs of the store of the initializer. */
846 hash_map
<tree
, tree
> *scan_map
;
848 /* The unrolling factor needed to SLP the loop. In case of that pure SLP is
849 applied to the loop, i.e., no unrolling is needed, this is 1. */
850 poly_uint64 slp_unrolling_factor
;
852 /* The factor used to over weight those statements in an inner loop
853 relative to the loop being vectorized. */
854 unsigned int inner_loop_cost_factor
;
856 /* Is the loop vectorizable? */
859 /* Records whether we still have the option of vectorizing this loop
860 using partially-populated vectors; in other words, whether it is
861 still possible for one iteration of the vector loop to handle
862 fewer than VF scalars. */
863 bool can_use_partial_vectors_p
;
865 /* True if we've decided to use partially-populated vectors, so that
866 the vector loop can handle fewer than VF scalars. */
867 bool using_partial_vectors_p
;
869 /* True if we've decided to use a decrementing loop control IV that counts
870 scalars. This can be done for any loop that:
872 (a) uses length "controls"; and
873 (b) can iterate more than once. */
874 bool using_decrementing_iv_p
;
876 /* True if we've decided to use output of select_vl to adjust IV of
877 both loop control and data reference pointer. This is only true
878 for single-rgroup control. */
879 bool using_select_vl_p
;
881 /* True if we've decided to use partially-populated vectors for the
883 bool epil_using_partial_vectors_p
;
885 /* The bias for len_load and len_store. For now, only 0 and -1 are
886 supported. -1 must be used when a backend does not support
887 len_load/len_store with a length of zero. */
888 signed char partial_load_store_bias
;
890 /* When we have grouped data accesses with gaps, we may introduce invalid
891 memory accesses. We peel the last iteration of the loop to prevent
893 bool peeling_for_gaps
;
895 /* When the number of iterations is not a multiple of the vector size
896 we need to peel off iterations at the end to form an epilogue loop. */
897 bool peeling_for_niter
;
899 /* When the loop has early breaks that we can vectorize we need to peel
900 the loop for the break finding loop. */
903 /* List of loop additional IV conditionals found in the loop. */
904 auto_vec
<gcond
*> conds
;
906 /* Main loop IV cond. */
909 /* True if there are no loop carried data dependencies in the loop.
910 If loop->safelen <= 1, then this is always true, either the loop
911 didn't have any loop carried data dependencies, or the loop is being
912 vectorized guarded with some runtime alias checks, or couldn't
913 be vectorized at all, but then this field shouldn't be used.
914 For loop->safelen >= 2, the user has asserted that there are no
915 backward dependencies, but there still could be loop carried forward
916 dependencies in such loops. This flag will be false if normal
917 vectorizer data dependency analysis would fail or require versioning
918 for alias, but because of loop->safelen >= 2 it has been vectorized
919 even without versioning for alias. E.g. in:
921 for (int i = 0; i < m; i++)
923 (or #pragma simd or #pragma ivdep) we can vectorize this and it will
924 DTRT even for k > 0 && k < m, but without safelen we would not
925 vectorize this, so this field would be false. */
926 bool no_data_dependencies
;
928 /* Mark loops having masked stores. */
931 /* Queued scaling factor for the scalar loop. */
932 profile_probability scalar_loop_scaling
;
934 /* If if-conversion versioned this loop before conversion, this is the
935 loop version without if-conversion. */
936 class loop
*scalar_loop
;
938 /* For loops being epilogues of already vectorized loops
939 this points to the original vectorized loop. Otherwise NULL. */
940 _loop_vec_info
*orig_loop_info
;
942 /* Used to store loop_vec_infos of epilogues of this loop during
944 vec
<_loop_vec_info
*> epilogue_vinfos
;
946 /* The controlling loop IV for the current loop when vectorizing. This IV
947 controls the natural exits of the loop. */
948 edge vec_loop_iv_exit
;
950 /* The controlling loop IV for the epilogue loop when vectorizing. This IV
951 controls the natural exits of the loop. */
952 edge vec_epilogue_loop_iv_exit
;
954 /* The controlling loop IV for the scalar loop being vectorized. This IV
955 controls the natural exits of the loop. */
956 edge scalar_loop_iv_exit
;
958 /* Used to store the list of stores needing to be moved if doing early
959 break vectorization as they would violate the scalar loop semantics if
960 vectorized in their current location. These are stored in order that they
962 auto_vec
<gimple
*> early_break_stores
;
964 /* The final basic block where to move statements to. In the case of
965 multiple exits this could be pretty far away. */
966 basic_block early_break_dest_bb
;
968 /* Statements whose VUSES need updating if early break vectorization is to
970 auto_vec
<gimple
*> early_break_vuses
;
973 /* Access Functions. */
974 #define LOOP_VINFO_LOOP(L) (L)->loop
975 #define LOOP_VINFO_IV_EXIT(L) (L)->vec_loop_iv_exit
976 #define LOOP_VINFO_EPILOGUE_IV_EXIT(L) (L)->vec_epilogue_loop_iv_exit
977 #define LOOP_VINFO_SCALAR_IV_EXIT(L) (L)->scalar_loop_iv_exit
978 #define LOOP_VINFO_BBS(L) (L)->bbs
979 #define LOOP_VINFO_NBBS(L) (L)->nbbs
980 #define LOOP_VINFO_NITERSM1(L) (L)->num_itersm1
981 #define LOOP_VINFO_NITERS(L) (L)->num_iters
982 /* Since LOOP_VINFO_NITERS and LOOP_VINFO_NITERSM1 can change after
983 prologue peeling retain total unchanged scalar loop iterations for
985 #define LOOP_VINFO_NITERS_UNCHANGED(L) (L)->num_iters_unchanged
986 #define LOOP_VINFO_NITERS_ASSUMPTIONS(L) (L)->num_iters_assumptions
987 #define LOOP_VINFO_COST_MODEL_THRESHOLD(L) (L)->th
988 #define LOOP_VINFO_VERSIONING_THRESHOLD(L) (L)->versioning_threshold
989 #define LOOP_VINFO_VECTORIZABLE_P(L) (L)->vectorizable
990 #define LOOP_VINFO_CAN_USE_PARTIAL_VECTORS_P(L) (L)->can_use_partial_vectors_p
991 #define LOOP_VINFO_USING_PARTIAL_VECTORS_P(L) (L)->using_partial_vectors_p
992 #define LOOP_VINFO_USING_DECREMENTING_IV_P(L) (L)->using_decrementing_iv_p
993 #define LOOP_VINFO_USING_SELECT_VL_P(L) (L)->using_select_vl_p
994 #define LOOP_VINFO_EPIL_USING_PARTIAL_VECTORS_P(L) \
995 (L)->epil_using_partial_vectors_p
996 #define LOOP_VINFO_PARTIAL_LOAD_STORE_BIAS(L) (L)->partial_load_store_bias
997 #define LOOP_VINFO_VECT_FACTOR(L) (L)->vectorization_factor
998 #define LOOP_VINFO_MAX_VECT_FACTOR(L) (L)->max_vectorization_factor
999 #define LOOP_VINFO_MASKS(L) (L)->masks
1000 #define LOOP_VINFO_LENS(L) (L)->lens
1001 #define LOOP_VINFO_MASK_SKIP_NITERS(L) (L)->mask_skip_niters
1002 #define LOOP_VINFO_RGROUP_COMPARE_TYPE(L) (L)->rgroup_compare_type
1003 #define LOOP_VINFO_RGROUP_IV_TYPE(L) (L)->rgroup_iv_type
1004 #define LOOP_VINFO_PARTIAL_VECTORS_STYLE(L) (L)->partial_vector_style
1005 #define LOOP_VINFO_PTR_MASK(L) (L)->ptr_mask
1006 #define LOOP_VINFO_N_STMTS(L) (L)->shared->n_stmts
1007 #define LOOP_VINFO_LOOP_NEST(L) (L)->shared->loop_nest
1008 #define LOOP_VINFO_DATAREFS(L) (L)->shared->datarefs
1009 #define LOOP_VINFO_DDRS(L) (L)->shared->ddrs
1010 #define LOOP_VINFO_INT_NITERS(L) (TREE_INT_CST_LOW ((L)->num_iters))
1011 #define LOOP_VINFO_PEELING_FOR_ALIGNMENT(L) (L)->peeling_for_alignment
1012 #define LOOP_VINFO_UNALIGNED_DR(L) (L)->unaligned_dr
1013 #define LOOP_VINFO_MAY_MISALIGN_STMTS(L) (L)->may_misalign_stmts
1014 #define LOOP_VINFO_MAY_ALIAS_DDRS(L) (L)->may_alias_ddrs
1015 #define LOOP_VINFO_COMP_ALIAS_DDRS(L) (L)->comp_alias_ddrs
1016 #define LOOP_VINFO_CHECK_UNEQUAL_ADDRS(L) (L)->check_unequal_addrs
1017 #define LOOP_VINFO_CHECK_NONZERO(L) (L)->check_nonzero
1018 #define LOOP_VINFO_LOWER_BOUNDS(L) (L)->lower_bounds
1019 #define LOOP_VINFO_GROUPED_STORES(L) (L)->grouped_stores
1020 #define LOOP_VINFO_SLP_INSTANCES(L) (L)->slp_instances
1021 #define LOOP_VINFO_SLP_UNROLLING_FACTOR(L) (L)->slp_unrolling_factor
1022 #define LOOP_VINFO_REDUCTIONS(L) (L)->reductions
1023 #define LOOP_VINFO_REDUCTION_CHAINS(L) (L)->reduction_chains
1024 #define LOOP_VINFO_PEELING_FOR_GAPS(L) (L)->peeling_for_gaps
1025 #define LOOP_VINFO_PEELING_FOR_NITER(L) (L)->peeling_for_niter
1026 #define LOOP_VINFO_EARLY_BREAKS(L) (L)->early_breaks
1027 #define LOOP_VINFO_EARLY_BRK_STORES(L) (L)->early_break_stores
1028 #define LOOP_VINFO_EARLY_BREAKS_VECT_PEELED(L) \
1029 (single_pred ((L)->loop->latch) != (L)->vec_loop_iv_exit->src)
1030 #define LOOP_VINFO_EARLY_BRK_DEST_BB(L) (L)->early_break_dest_bb
1031 #define LOOP_VINFO_EARLY_BRK_VUSES(L) (L)->early_break_vuses
1032 #define LOOP_VINFO_LOOP_CONDS(L) (L)->conds
1033 #define LOOP_VINFO_LOOP_IV_COND(L) (L)->loop_iv_cond
1034 #define LOOP_VINFO_NO_DATA_DEPENDENCIES(L) (L)->no_data_dependencies
1035 #define LOOP_VINFO_SCALAR_LOOP(L) (L)->scalar_loop
1036 #define LOOP_VINFO_SCALAR_LOOP_SCALING(L) (L)->scalar_loop_scaling
1037 #define LOOP_VINFO_HAS_MASK_STORE(L) (L)->has_mask_store
1038 #define LOOP_VINFO_SCALAR_ITERATION_COST(L) (L)->scalar_cost_vec
1039 #define LOOP_VINFO_ORIG_LOOP_INFO(L) (L)->orig_loop_info
1040 #define LOOP_VINFO_SIMD_IF_COND(L) (L)->simd_if_cond
1041 #define LOOP_VINFO_INNER_LOOP_COST_FACTOR(L) (L)->inner_loop_cost_factor
1043 #define LOOP_VINFO_FULLY_MASKED_P(L) \
1044 (LOOP_VINFO_USING_PARTIAL_VECTORS_P (L) \
1045 && !LOOP_VINFO_MASKS (L).is_empty ())
1047 #define LOOP_VINFO_FULLY_WITH_LENGTH_P(L) \
1048 (LOOP_VINFO_USING_PARTIAL_VECTORS_P (L) \
1049 && !LOOP_VINFO_LENS (L).is_empty ())
1051 #define LOOP_REQUIRES_VERSIONING_FOR_ALIGNMENT(L) \
1052 ((L)->may_misalign_stmts.length () > 0)
1053 #define LOOP_REQUIRES_VERSIONING_FOR_ALIAS(L) \
1054 ((L)->comp_alias_ddrs.length () > 0 \
1055 || (L)->check_unequal_addrs.length () > 0 \
1056 || (L)->lower_bounds.length () > 0)
1057 #define LOOP_REQUIRES_VERSIONING_FOR_NITERS(L) \
1058 (LOOP_VINFO_NITERS_ASSUMPTIONS (L))
1059 #define LOOP_REQUIRES_VERSIONING_FOR_SIMD_IF_COND(L) \
1060 (LOOP_VINFO_SIMD_IF_COND (L))
1061 #define LOOP_REQUIRES_VERSIONING(L) \
1062 (LOOP_REQUIRES_VERSIONING_FOR_ALIGNMENT (L) \
1063 || LOOP_REQUIRES_VERSIONING_FOR_ALIAS (L) \
1064 || LOOP_REQUIRES_VERSIONING_FOR_NITERS (L) \
1065 || LOOP_REQUIRES_VERSIONING_FOR_SIMD_IF_COND (L))
1067 #define LOOP_VINFO_NITERS_KNOWN_P(L) \
1068 (tree_fits_shwi_p ((L)->num_iters) && tree_to_shwi ((L)->num_iters) > 0)
1070 #define LOOP_VINFO_EPILOGUE_P(L) \
1071 (LOOP_VINFO_ORIG_LOOP_INFO (L) != NULL)
1073 #define LOOP_VINFO_ORIG_MAX_VECT_FACTOR(L) \
1074 (LOOP_VINFO_MAX_VECT_FACTOR (LOOP_VINFO_ORIG_LOOP_INFO (L)))
1076 /* Wrapper for loop_vec_info, for tracking success/failure, where a non-NULL
1077 value signifies success, and a NULL value signifies failure, supporting
1078 propagating an opt_problem * describing the failure back up the call
1080 typedef opt_pointer_wrapper
<loop_vec_info
> opt_loop_vec_info
;
1082 inline loop_vec_info
1083 loop_vec_info_for_loop (class loop
*loop
)
1085 return (loop_vec_info
) loop
->aux
;
1090 slp_root (slp_instance_kind kind_
, vec
<stmt_vec_info
> stmts_
,
1091 vec
<stmt_vec_info
> roots_
, vec
<tree
> remain_
= vNULL
)
1092 : kind(kind_
), stmts(stmts_
), roots(roots_
), remain(remain_
) {}
1093 slp_instance_kind kind
;
1094 vec
<stmt_vec_info
> stmts
;
1095 vec
<stmt_vec_info
> roots
;
1099 typedef class _bb_vec_info
: public vec_info
1102 _bb_vec_info (vec
<basic_block
> bbs
, vec_info_shared
*);
1105 vec
<slp_root
> roots
;
1108 #define BB_VINFO_BBS(B) (B)->bbs
1109 #define BB_VINFO_NBBS(B) (B)->nbbs
1110 #define BB_VINFO_GROUPED_STORES(B) (B)->grouped_stores
1111 #define BB_VINFO_SLP_INSTANCES(B) (B)->slp_instances
1112 #define BB_VINFO_DATAREFS(B) (B)->shared->datarefs
1113 #define BB_VINFO_DDRS(B) (B)->shared->ddrs
1115 /*-----------------------------------------------------------------*/
1116 /* Info on vectorized defs. */
1117 /*-----------------------------------------------------------------*/
1118 enum stmt_vec_info_type
{
1119 undef_vec_info_type
= 0,
1121 store_vec_info_type
,
1122 shift_vec_info_type
,
1125 call_simd_clone_vec_info_type
,
1126 assignment_vec_info_type
,
1127 condition_vec_info_type
,
1128 comparison_vec_info_type
,
1129 reduc_vec_info_type
,
1130 induc_vec_info_type
,
1131 type_promotion_vec_info_type
,
1132 type_demotion_vec_info_type
,
1133 type_conversion_vec_info_type
,
1134 cycle_phi_info_type
,
1138 loop_exit_ctrl_vec_info_type
1141 /* Indicates whether/how a variable is used in the scope of loop/basic
1143 enum vect_relevant
{
1144 vect_unused_in_scope
= 0,
1146 /* The def is only used outside the loop. */
1147 vect_used_only_live
,
1148 /* The def is in the inner loop, and the use is in the outer loop, and the
1149 use is a reduction stmt. */
1150 vect_used_in_outer_by_reduction
,
1151 /* The def is in the inner loop, and the use is in the outer loop (and is
1152 not part of reduction). */
1155 /* defs that feed computations that end up (only) in a reduction. These
1156 defs may be used by non-reduction stmts, but eventually, any
1157 computations/values that are affected by these defs are used to compute
1158 a reduction (i.e. don't get stored to memory, for example). We use this
1159 to identify computations that we can change the order in which they are
1161 vect_used_by_reduction
,
1166 /* The type of vectorization that can be applied to the stmt: regular loop-based
1167 vectorization; pure SLP - the stmt is a part of SLP instances and does not
1168 have uses outside SLP instances; or hybrid SLP and loop-based - the stmt is
1169 a part of SLP instance and also must be loop-based vectorized, since it has
1170 uses outside SLP sequences.
1172 In the loop context the meanings of pure and hybrid SLP are slightly
1173 different. By saying that pure SLP is applied to the loop, we mean that we
1174 exploit only intra-iteration parallelism in the loop; i.e., the loop can be
1175 vectorized without doing any conceptual unrolling, cause we don't pack
1176 together stmts from different iterations, only within a single iteration.
1177 Loop hybrid SLP means that we exploit both intra-iteration and
1178 inter-iteration parallelism (e.g., number of elements in the vector is 4
1179 and the slp-group-size is 2, in which case we don't have enough parallelism
1180 within an iteration, so we obtain the rest of the parallelism from subsequent
1181 iterations by unrolling the loop by 2). */
1182 enum slp_vect_type
{
1188 /* Says whether a statement is a load, a store of a vectorized statement
1189 result, or a store of an invariant value. */
1190 enum vec_load_store_type
{
1196 /* Describes how we're going to vectorize an individual load or store,
1197 or a group of loads or stores. */
1198 enum vect_memory_access_type
{
1199 /* An access to an invariant address. This is used only for loads. */
1202 /* A simple contiguous access. */
1205 /* A contiguous access that goes down in memory rather than up,
1206 with no additional permutation. This is used only for stores
1208 VMAT_CONTIGUOUS_DOWN
,
1210 /* A simple contiguous access in which the elements need to be permuted
1211 after loading or before storing. Only used for loop vectorization;
1212 SLP uses separate permutes. */
1213 VMAT_CONTIGUOUS_PERMUTE
,
1215 /* A simple contiguous access in which the elements need to be reversed
1216 after loading or before storing. */
1217 VMAT_CONTIGUOUS_REVERSE
,
1219 /* An access that uses IFN_LOAD_LANES or IFN_STORE_LANES. */
1220 VMAT_LOAD_STORE_LANES
,
1222 /* An access in which each scalar element is loaded or stored
1226 /* A hybrid of VMAT_CONTIGUOUS and VMAT_ELEMENTWISE, used for grouped
1227 SLP accesses. Each unrolled iteration uses a contiguous load
1228 or store for the whole group, but the groups from separate iterations
1229 are combined in the same way as for VMAT_ELEMENTWISE. */
1232 /* The access uses gather loads or scatter stores. */
1238 /* The data reference itself. */
1240 /* The statement that contains the data reference. */
1242 /* The analysis group this DR belongs to when doing BB vectorization.
1243 DRs of the same group belong to the same conditional execution context. */
1245 /* The misalignment in bytes of the reference, or -1 if not known. */
1247 /* The byte alignment that we'd ideally like the reference to have,
1248 and the value that misalignment is measured against. */
1249 poly_uint64 target_alignment
;
1250 /* If true the alignment of base_decl needs to be increased. */
1251 bool base_misaligned
;
1254 /* Stores current vectorized loop's offset. To be added to the DR's
1255 offset to calculate current offset of data reference. */
1259 typedef struct data_reference
*dr_p
;
1261 class _stmt_vec_info
{
1264 enum stmt_vec_info_type type
;
1266 /* Indicates whether this stmts is part of a computation whose result is
1267 used outside the loop. */
1270 /* Stmt is part of some pattern (computation idiom) */
1273 /* True if the statement was created during pattern recognition as
1274 part of the replacement for RELATED_STMT. This implies that the
1275 statement isn't part of any basic block, although for convenience
1276 its gimple_bb is the same as for RELATED_STMT. */
1277 bool pattern_stmt_p
;
1279 /* Is this statement vectorizable or should it be skipped in (partial)
1283 /* The stmt to which this info struct refers to. */
1286 /* The vector type to be used for the LHS of this statement. */
1289 /* The vectorized stmts. */
1290 vec
<gimple
*> vec_stmts
;
1292 /* The following is relevant only for stmts that contain a non-scalar
1293 data-ref (array/pointer/struct access). A GIMPLE stmt is expected to have
1294 at most one such data-ref. */
1298 /* Information about the data-ref relative to this loop
1299 nest (the loop that is being considered for vectorization). */
1300 innermost_loop_behavior dr_wrt_vec_loop
;
1302 /* For loop PHI nodes, the base and evolution part of it. This makes sure
1303 this information is still available in vect_update_ivs_after_vectorizer
1304 where we may not be able to re-analyze the PHI nodes evolution as
1305 peeling for the prologue loop can make it unanalyzable. The evolution
1306 part is still correct after peeling, but the base may have changed from
1307 the version here. */
1308 tree loop_phi_evolution_base_unchanged
;
1309 tree loop_phi_evolution_part
;
1310 enum vect_induction_op_type loop_phi_evolution_type
;
1312 /* Used for various bookkeeping purposes, generally holding a pointer to
1313 some other stmt S that is in some way "related" to this stmt.
1314 Current use of this field is:
1315 If this stmt is part of a pattern (i.e. the field 'in_pattern_p' is
1316 true): S is the "pattern stmt" that represents (and replaces) the
1317 sequence of stmts that constitutes the pattern. Similarly, the
1318 related_stmt of the "pattern stmt" points back to this stmt (which is
1319 the last stmt in the original sequence of stmts that constitutes the
1321 stmt_vec_info related_stmt
;
1323 /* Used to keep a sequence of def stmts of a pattern stmt if such exists.
1324 The sequence is attached to the original statement rather than the
1325 pattern statement. */
1326 gimple_seq pattern_def_seq
;
1328 /* Selected SIMD clone's function info. First vector element
1329 is SIMD clone's function decl, followed by a pair of trees (base + step)
1330 for linear arguments (pair of NULLs for other arguments). */
1331 vec
<tree
> simd_clone_info
;
1333 /* Classify the def of this stmt. */
1334 enum vect_def_type def_type
;
1336 /* Whether the stmt is SLPed, loop-based vectorized, or both. */
1337 enum slp_vect_type slp_type
;
1339 /* Interleaving and reduction chains info. */
1340 /* First element in the group. */
1341 stmt_vec_info first_element
;
1342 /* Pointer to the next element in the group. */
1343 stmt_vec_info next_element
;
1344 /* The size of the group. */
1346 /* For stores, number of stores from this group seen. We vectorize the last
1348 unsigned int store_count
;
1349 /* For loads only, the gap from the previous load. For consecutive loads, GAP
1353 /* The minimum negative dependence distance this stmt participates in
1355 unsigned int min_neg_dist
;
1357 /* Not all stmts in the loop need to be vectorized. e.g, the increment
1358 of the loop induction variable and computation of array indexes. relevant
1359 indicates whether the stmt needs to be vectorized. */
1360 enum vect_relevant relevant
;
1362 /* For loads if this is a gather, for stores if this is a scatter. */
1363 bool gather_scatter_p
;
1365 /* True if this is an access with loop-invariant stride. */
1368 /* For both loads and stores. */
1369 unsigned simd_lane_access_p
: 3;
1371 /* Classifies how the load or store is going to be implemented
1372 for loop vectorization. */
1373 vect_memory_access_type memory_access_type
;
1375 /* For INTEGER_INDUC_COND_REDUCTION, the initial value to be used. */
1376 tree induc_cond_initial_val
;
1378 /* If not NULL the value to be added to compute final reduction value. */
1379 tree reduc_epilogue_adjustment
;
1381 /* On a reduction PHI the reduction type as detected by
1382 vect_is_simple_reduction and vectorizable_reduction. */
1383 enum vect_reduction_type reduc_type
;
1385 /* The original reduction code, to be used in the epilogue. */
1386 code_helper reduc_code
;
1387 /* An internal function we should use in the epilogue. */
1388 internal_fn reduc_fn
;
1390 /* On a stmt participating in the reduction the index of the operand
1391 on the reduction SSA cycle. */
1394 /* On a reduction PHI the def returned by vect_force_simple_reduction.
1395 On the def returned by vect_force_simple_reduction the
1396 corresponding PHI. */
1397 stmt_vec_info reduc_def
;
1399 /* The vector input type relevant for reduction vectorization. */
1400 tree reduc_vectype_in
;
1402 /* The vector type for performing the actual reduction. */
1405 /* For loop reduction with multiple vectorized results (ncopies > 1), a
1406 lane-reducing operation participating in it may not use all of those
1407 results, this field specifies result index starting from which any
1408 following land-reducing operation would be assigned to. */
1409 unsigned int reduc_result_pos
;
1411 /* If IS_REDUC_INFO is true and if the vector code is performing
1412 N scalar reductions in parallel, this variable gives the initial
1413 scalar values of those N reductions. */
1414 vec
<tree
> reduc_initial_values
;
1416 /* If IS_REDUC_INFO is true and if the vector code is performing
1417 N scalar reductions in parallel, this variable gives the vectorized code's
1418 final (scalar) result for each of those N reductions. In other words,
1419 REDUC_SCALAR_RESULTS[I] replaces the original scalar code's loop-closed
1420 SSA PHI for reduction number I. */
1421 vec
<tree
> reduc_scalar_results
;
1423 /* Only meaningful if IS_REDUC_INFO. If non-null, the reduction is
1424 being performed by an epilogue loop and we have decided to reuse
1425 this accumulator from the main loop. */
1426 vect_reusable_accumulator
*reused_accumulator
;
1428 /* Whether we force a single cycle PHI during reduction vectorization. */
1429 bool force_single_cycle
;
1431 /* Whether on this stmt reduction meta is recorded. */
1434 /* If nonzero, the lhs of the statement could be truncated to this
1435 many bits without affecting any users of the result. */
1436 unsigned int min_output_precision
;
1438 /* If nonzero, all non-boolean input operands have the same precision,
1439 and they could each be truncated to this many bits without changing
1441 unsigned int min_input_precision
;
1443 /* If OPERATION_BITS is nonzero, the statement could be performed on
1444 an integer with the sign and number of bits given by OPERATION_SIGN
1445 and OPERATION_BITS without changing the result. */
1446 unsigned int operation_precision
;
1447 signop operation_sign
;
1449 /* If the statement produces a boolean result, this value describes
1450 how we should choose the associated vector type. The possible
1453 - an integer precision N if we should use the vector mask type
1454 associated with N-bit integers. This is only used if all relevant
1455 input booleans also want the vector mask type for N-bit integers,
1456 or if we can convert them into that form by pattern-matching.
1458 - ~0U if we considered choosing a vector mask type but decided
1459 to treat the boolean as a normal integer type instead.
1461 - 0 otherwise. This means either that the operation isn't one that
1462 could have a vector mask type (and so should have a normal vector
1463 type instead) or that we simply haven't made a choice either way. */
1464 unsigned int mask_precision
;
1466 /* True if this is only suitable for SLP vectorization. */
1467 bool slp_vect_only_p
;
1469 /* True if this is a pattern that can only be handled by SLP
1471 bool slp_vect_pattern_only_p
;
1474 /* Information about a gather/scatter call. */
1475 struct gather_scatter_info
{
1476 /* The internal function to use for the gather/scatter operation,
1477 or IFN_LAST if a built-in function should be used instead. */
1480 /* The FUNCTION_DECL for the built-in gather/scatter function,
1481 or null if an internal function should be used instead. */
1484 /* The loop-invariant base value. */
1487 /* The original scalar offset, which is a non-loop-invariant SSA_NAME. */
1490 /* Each offset element should be multiplied by this amount before
1491 being added to the base. */
1494 /* The definition type for the vectorized offset. */
1495 enum vect_def_type offset_dt
;
1497 /* The type of the vectorized offset. */
1498 tree offset_vectype
;
1500 /* The type of the scalar elements after loading or before storing. */
1503 /* The type of the scalar elements being loaded or stored. */
1507 /* Access Functions. */
1508 #define STMT_VINFO_TYPE(S) (S)->type
1509 #define STMT_VINFO_STMT(S) (S)->stmt
1510 #define STMT_VINFO_RELEVANT(S) (S)->relevant
1511 #define STMT_VINFO_LIVE_P(S) (S)->live
1512 #define STMT_VINFO_VECTYPE(S) (S)->vectype
1513 #define STMT_VINFO_VEC_STMTS(S) (S)->vec_stmts
1514 #define STMT_VINFO_VECTORIZABLE(S) (S)->vectorizable
1515 #define STMT_VINFO_DATA_REF(S) ((S)->dr_aux.dr + 0)
1516 #define STMT_VINFO_GATHER_SCATTER_P(S) (S)->gather_scatter_p
1517 #define STMT_VINFO_STRIDED_P(S) (S)->strided_p
1518 #define STMT_VINFO_MEMORY_ACCESS_TYPE(S) (S)->memory_access_type
1519 #define STMT_VINFO_SIMD_LANE_ACCESS_P(S) (S)->simd_lane_access_p
1520 #define STMT_VINFO_VEC_INDUC_COND_INITIAL_VAL(S) (S)->induc_cond_initial_val
1521 #define STMT_VINFO_REDUC_EPILOGUE_ADJUSTMENT(S) (S)->reduc_epilogue_adjustment
1522 #define STMT_VINFO_REDUC_IDX(S) (S)->reduc_idx
1523 #define STMT_VINFO_FORCE_SINGLE_CYCLE(S) (S)->force_single_cycle
1525 #define STMT_VINFO_DR_WRT_VEC_LOOP(S) (S)->dr_wrt_vec_loop
1526 #define STMT_VINFO_DR_BASE_ADDRESS(S) (S)->dr_wrt_vec_loop.base_address
1527 #define STMT_VINFO_DR_INIT(S) (S)->dr_wrt_vec_loop.init
1528 #define STMT_VINFO_DR_OFFSET(S) (S)->dr_wrt_vec_loop.offset
1529 #define STMT_VINFO_DR_STEP(S) (S)->dr_wrt_vec_loop.step
1530 #define STMT_VINFO_DR_BASE_ALIGNMENT(S) (S)->dr_wrt_vec_loop.base_alignment
1531 #define STMT_VINFO_DR_BASE_MISALIGNMENT(S) \
1532 (S)->dr_wrt_vec_loop.base_misalignment
1533 #define STMT_VINFO_DR_OFFSET_ALIGNMENT(S) \
1534 (S)->dr_wrt_vec_loop.offset_alignment
1535 #define STMT_VINFO_DR_STEP_ALIGNMENT(S) \
1536 (S)->dr_wrt_vec_loop.step_alignment
1538 #define STMT_VINFO_DR_INFO(S) \
1539 (gcc_checking_assert ((S)->dr_aux.stmt == (S)), &(S)->dr_aux)
1541 #define STMT_VINFO_IN_PATTERN_P(S) (S)->in_pattern_p
1542 #define STMT_VINFO_RELATED_STMT(S) (S)->related_stmt
1543 #define STMT_VINFO_PATTERN_DEF_SEQ(S) (S)->pattern_def_seq
1544 #define STMT_VINFO_SIMD_CLONE_INFO(S) (S)->simd_clone_info
1545 #define STMT_VINFO_DEF_TYPE(S) (S)->def_type
1546 #define STMT_VINFO_GROUPED_ACCESS(S) \
1547 ((S)->dr_aux.dr && DR_GROUP_FIRST_ELEMENT(S))
1548 #define STMT_VINFO_LOOP_PHI_EVOLUTION_BASE_UNCHANGED(S) (S)->loop_phi_evolution_base_unchanged
1549 #define STMT_VINFO_LOOP_PHI_EVOLUTION_PART(S) (S)->loop_phi_evolution_part
1550 #define STMT_VINFO_LOOP_PHI_EVOLUTION_TYPE(S) (S)->loop_phi_evolution_type
1551 #define STMT_VINFO_MIN_NEG_DIST(S) (S)->min_neg_dist
1552 #define STMT_VINFO_REDUC_TYPE(S) (S)->reduc_type
1553 #define STMT_VINFO_REDUC_CODE(S) (S)->reduc_code
1554 #define STMT_VINFO_REDUC_FN(S) (S)->reduc_fn
1555 #define STMT_VINFO_REDUC_DEF(S) (S)->reduc_def
1556 #define STMT_VINFO_REDUC_VECTYPE(S) (S)->reduc_vectype
1557 #define STMT_VINFO_REDUC_VECTYPE_IN(S) (S)->reduc_vectype_in
1558 #define STMT_VINFO_SLP_VECT_ONLY(S) (S)->slp_vect_only_p
1559 #define STMT_VINFO_SLP_VECT_ONLY_PATTERN(S) (S)->slp_vect_pattern_only_p
1561 #define DR_GROUP_FIRST_ELEMENT(S) \
1562 (gcc_checking_assert ((S)->dr_aux.dr), (S)->first_element)
1563 #define DR_GROUP_NEXT_ELEMENT(S) \
1564 (gcc_checking_assert ((S)->dr_aux.dr), (S)->next_element)
1565 #define DR_GROUP_SIZE(S) \
1566 (gcc_checking_assert ((S)->dr_aux.dr), (S)->size)
1567 #define DR_GROUP_STORE_COUNT(S) \
1568 (gcc_checking_assert ((S)->dr_aux.dr), (S)->store_count)
1569 #define DR_GROUP_GAP(S) \
1570 (gcc_checking_assert ((S)->dr_aux.dr), (S)->gap)
1572 #define REDUC_GROUP_FIRST_ELEMENT(S) \
1573 (gcc_checking_assert (!(S)->dr_aux.dr), (S)->first_element)
1574 #define REDUC_GROUP_NEXT_ELEMENT(S) \
1575 (gcc_checking_assert (!(S)->dr_aux.dr), (S)->next_element)
1576 #define REDUC_GROUP_SIZE(S) \
1577 (gcc_checking_assert (!(S)->dr_aux.dr), (S)->size)
1579 #define STMT_VINFO_RELEVANT_P(S) ((S)->relevant != vect_unused_in_scope)
1581 #define HYBRID_SLP_STMT(S) ((S)->slp_type == hybrid)
1582 #define PURE_SLP_STMT(S) ((S)->slp_type == pure_slp)
1583 #define STMT_SLP_TYPE(S) (S)->slp_type
1585 /* Contains the scalar or vector costs for a vec_info. */
1589 vector_costs (vec_info
*, bool);
1590 virtual ~vector_costs () {}
1592 /* Update the costs in response to adding COUNT copies of a statement.
1594 - WHERE specifies whether the cost occurs in the loop prologue,
1595 the loop body, or the loop epilogue.
1596 - KIND is the kind of statement, which is always meaningful.
1597 - STMT_INFO or NODE, if nonnull, describe the statement that will be
1599 - VECTYPE, if nonnull, is the vector type that the vectorized
1600 statement will operate on. Note that this should be used in
1601 preference to STMT_VINFO_VECTYPE (STMT_INFO) since the latter
1602 is not correct for SLP.
1603 - for unaligned_load and unaligned_store statements, MISALIGN is
1604 the byte misalignment of the load or store relative to the target's
1605 preferred alignment for VECTYPE, or DR_MISALIGNMENT_UNKNOWN
1606 if the misalignment is not known.
1608 Return the calculated cost as well as recording it. The return
1609 value is used for dumping purposes. */
1610 virtual unsigned int add_stmt_cost (int count
, vect_cost_for_stmt kind
,
1611 stmt_vec_info stmt_info
,
1613 tree vectype
, int misalign
,
1614 vect_cost_model_location where
);
1616 /* Finish calculating the cost of the code. The results can be
1617 read back using the functions below.
1619 If the costs describe vector code, SCALAR_COSTS gives the costs
1620 of the corresponding scalar code, otherwise it is null. */
1621 virtual void finish_cost (const vector_costs
*scalar_costs
);
1623 /* The costs in THIS and OTHER both describe ways of vectorizing
1624 a main loop. Return true if the costs described by THIS are
1625 cheaper than the costs described by OTHER. Return false if any
1626 of the following are true:
1628 - THIS and OTHER are of equal cost
1629 - OTHER is better than THIS
1630 - we can't be sure about the relative costs of THIS and OTHER. */
1631 virtual bool better_main_loop_than_p (const vector_costs
*other
) const;
1633 /* Likewise, but the costs in THIS and OTHER both describe ways of
1634 vectorizing an epilogue loop of MAIN_LOOP. */
1635 virtual bool better_epilogue_loop_than_p (const vector_costs
*other
,
1636 loop_vec_info main_loop
) const;
1638 unsigned int prologue_cost () const;
1639 unsigned int body_cost () const;
1640 unsigned int epilogue_cost () const;
1641 unsigned int outside_cost () const;
1642 unsigned int total_cost () const;
1643 unsigned int suggested_unroll_factor () const;
1646 unsigned int record_stmt_cost (stmt_vec_info
, vect_cost_model_location
,
1648 unsigned int adjust_cost_for_freq (stmt_vec_info
, vect_cost_model_location
,
1650 int compare_inside_loop_cost (const vector_costs
*) const;
1651 int compare_outside_loop_cost (const vector_costs
*) const;
1653 /* The region of code that we're considering vectorizing. */
1656 /* True if we're costing the scalar code, false if we're costing
1658 bool m_costing_for_scalar
;
1660 /* The costs of the three regions, indexed by vect_cost_model_location. */
1661 unsigned int m_costs
[3];
1663 /* The suggested unrolling factor determined at finish_cost. */
1664 unsigned int m_suggested_unroll_factor
;
1666 /* True if finish_cost has been called. */
1670 /* Create costs for VINFO. COSTING_FOR_SCALAR is true if the costs
1671 are for scalar code, false if they are for vector code. */
1674 vector_costs::vector_costs (vec_info
*vinfo
, bool costing_for_scalar
)
1676 m_costing_for_scalar (costing_for_scalar
),
1678 m_suggested_unroll_factor(1),
1683 /* Return the cost of the prologue code (in abstract units). */
1686 vector_costs::prologue_cost () const
1688 gcc_checking_assert (m_finished
);
1689 return m_costs
[vect_prologue
];
1692 /* Return the cost of the body code (in abstract units). */
1695 vector_costs::body_cost () const
1697 gcc_checking_assert (m_finished
);
1698 return m_costs
[vect_body
];
1701 /* Return the cost of the epilogue code (in abstract units). */
1704 vector_costs::epilogue_cost () const
1706 gcc_checking_assert (m_finished
);
1707 return m_costs
[vect_epilogue
];
1710 /* Return the cost of the prologue and epilogue code (in abstract units). */
1713 vector_costs::outside_cost () const
1715 return prologue_cost () + epilogue_cost ();
1718 /* Return the cost of the prologue, body and epilogue code
1719 (in abstract units). */
1722 vector_costs::total_cost () const
1724 return body_cost () + outside_cost ();
1727 /* Return the suggested unroll factor. */
1730 vector_costs::suggested_unroll_factor () const
1732 gcc_checking_assert (m_finished
);
1733 return m_suggested_unroll_factor
;
1736 #define VECT_MAX_COST 1000
1738 /* The maximum number of intermediate steps required in multi-step type
1740 #define MAX_INTERM_CVT_STEPS 3
1742 #define MAX_VECTORIZATION_FACTOR INT_MAX
1744 /* Nonzero if TYPE represents a (scalar) boolean type or type
1745 in the middle-end compatible with it (unsigned precision 1 integral
1746 types). Used to determine which types should be vectorized as
1747 VECTOR_BOOLEAN_TYPE_P. */
1749 #define VECT_SCALAR_BOOLEAN_TYPE_P(TYPE) \
1750 (TREE_CODE (TYPE) == BOOLEAN_TYPE \
1751 || ((TREE_CODE (TYPE) == INTEGER_TYPE \
1752 || TREE_CODE (TYPE) == ENUMERAL_TYPE) \
1753 && TYPE_PRECISION (TYPE) == 1 \
1754 && TYPE_UNSIGNED (TYPE)))
1757 nested_in_vect_loop_p (class loop
*loop
, stmt_vec_info stmt_info
)
1760 && (loop
->inner
== (gimple_bb (stmt_info
->stmt
))->loop_father
));
1763 /* PHI is either a scalar reduction phi or a scalar induction phi.
1764 Return the initial value of the variable on entry to the containing
1768 vect_phi_initial_value (gphi
*phi
)
1770 basic_block bb
= gimple_bb (phi
);
1771 edge pe
= loop_preheader_edge (bb
->loop_father
);
1772 gcc_assert (pe
->dest
== bb
);
1773 return PHI_ARG_DEF_FROM_EDGE (phi
, pe
);
1776 /* Return true if STMT_INFO should produce a vector mask type rather than
1777 a normal nonmask type. */
1780 vect_use_mask_type_p (stmt_vec_info stmt_info
)
1782 return stmt_info
->mask_precision
&& stmt_info
->mask_precision
!= ~0U;
1785 /* Return TRUE if a statement represented by STMT_INFO is a part of a
1789 is_pattern_stmt_p (stmt_vec_info stmt_info
)
1791 return stmt_info
->pattern_stmt_p
;
1794 /* If STMT_INFO is a pattern statement, return the statement that it
1795 replaces, otherwise return STMT_INFO itself. */
1797 inline stmt_vec_info
1798 vect_orig_stmt (stmt_vec_info stmt_info
)
1800 if (is_pattern_stmt_p (stmt_info
))
1801 return STMT_VINFO_RELATED_STMT (stmt_info
);
1805 /* Return the later statement between STMT1_INFO and STMT2_INFO. */
1807 inline stmt_vec_info
1808 get_later_stmt (stmt_vec_info stmt1_info
, stmt_vec_info stmt2_info
)
1810 if (gimple_uid (vect_orig_stmt (stmt1_info
)->stmt
)
1811 > gimple_uid (vect_orig_stmt (stmt2_info
)->stmt
))
1817 /* If STMT_INFO has been replaced by a pattern statement, return the
1818 replacement statement, otherwise return STMT_INFO itself. */
1820 inline stmt_vec_info
1821 vect_stmt_to_vectorize (stmt_vec_info stmt_info
)
1823 if (STMT_VINFO_IN_PATTERN_P (stmt_info
))
1824 return STMT_VINFO_RELATED_STMT (stmt_info
);
1828 /* Return true if BB is a loop header. */
1831 is_loop_header_bb_p (basic_block bb
)
1833 if (bb
== (bb
->loop_father
)->header
)
1839 /* Return pow2 (X). */
1846 for (i
= 0; i
< x
; i
++)
1852 /* Alias targetm.vectorize.builtin_vectorization_cost. */
1855 builtin_vectorization_cost (enum vect_cost_for_stmt type_of_cost
,
1856 tree vectype
, int misalign
)
1858 return targetm
.vectorize
.builtin_vectorization_cost (type_of_cost
,
1862 /* Get cost by calling cost target builtin. */
1865 int vect_get_stmt_cost (enum vect_cost_for_stmt type_of_cost
)
1867 return builtin_vectorization_cost (type_of_cost
, NULL
, 0);
1870 /* Alias targetm.vectorize.init_cost. */
1872 inline vector_costs
*
1873 init_cost (vec_info
*vinfo
, bool costing_for_scalar
)
1875 return targetm
.vectorize
.create_costs (vinfo
, costing_for_scalar
);
1878 extern void dump_stmt_cost (FILE *, int, enum vect_cost_for_stmt
,
1879 stmt_vec_info
, slp_tree
, tree
, int, unsigned,
1880 enum vect_cost_model_location
);
1882 /* Alias targetm.vectorize.add_stmt_cost. */
1885 add_stmt_cost (vector_costs
*costs
, int count
,
1886 enum vect_cost_for_stmt kind
,
1887 stmt_vec_info stmt_info
, slp_tree node
,
1888 tree vectype
, int misalign
,
1889 enum vect_cost_model_location where
)
1891 unsigned cost
= costs
->add_stmt_cost (count
, kind
, stmt_info
, node
, vectype
,
1893 if (dump_file
&& (dump_flags
& TDF_DETAILS
))
1894 dump_stmt_cost (dump_file
, count
, kind
, stmt_info
, node
, vectype
, misalign
,
1900 add_stmt_cost (vector_costs
*costs
, int count
, enum vect_cost_for_stmt kind
,
1901 enum vect_cost_model_location where
)
1903 gcc_assert (kind
== cond_branch_taken
|| kind
== cond_branch_not_taken
1904 || kind
== scalar_stmt
);
1905 return add_stmt_cost (costs
, count
, kind
, NULL
, NULL
, NULL_TREE
, 0, where
);
1908 /* Alias targetm.vectorize.add_stmt_cost. */
1911 add_stmt_cost (vector_costs
*costs
, stmt_info_for_cost
*i
)
1913 return add_stmt_cost (costs
, i
->count
, i
->kind
, i
->stmt_info
, i
->node
,
1914 i
->vectype
, i
->misalign
, i
->where
);
1917 /* Alias targetm.vectorize.finish_cost. */
1920 finish_cost (vector_costs
*costs
, const vector_costs
*scalar_costs
,
1921 unsigned *prologue_cost
, unsigned *body_cost
,
1922 unsigned *epilogue_cost
, unsigned *suggested_unroll_factor
= NULL
)
1924 costs
->finish_cost (scalar_costs
);
1925 *prologue_cost
= costs
->prologue_cost ();
1926 *body_cost
= costs
->body_cost ();
1927 *epilogue_cost
= costs
->epilogue_cost ();
1928 if (suggested_unroll_factor
)
1929 *suggested_unroll_factor
= costs
->suggested_unroll_factor ();
1933 add_stmt_costs (vector_costs
*costs
, stmt_vector_for_cost
*cost_vec
)
1935 stmt_info_for_cost
*cost
;
1937 FOR_EACH_VEC_ELT (*cost_vec
, i
, cost
)
1938 add_stmt_cost (costs
, cost
->count
, cost
->kind
, cost
->stmt_info
,
1939 cost
->node
, cost
->vectype
, cost
->misalign
, cost
->where
);
1942 /*-----------------------------------------------------------------*/
1943 /* Info on data references alignment. */
1944 /*-----------------------------------------------------------------*/
1945 #define DR_MISALIGNMENT_UNKNOWN (-1)
1946 #define DR_MISALIGNMENT_UNINITIALIZED (-2)
1949 set_dr_misalignment (dr_vec_info
*dr_info
, int val
)
1951 dr_info
->misalignment
= val
;
1954 extern int dr_misalignment (dr_vec_info
*dr_info
, tree vectype
,
1955 poly_int64 offset
= 0);
1957 #define SET_DR_MISALIGNMENT(DR, VAL) set_dr_misalignment (DR, VAL)
1959 /* Only defined once DR_MISALIGNMENT is defined. */
1960 inline const poly_uint64
1961 dr_target_alignment (dr_vec_info
*dr_info
)
1963 if (STMT_VINFO_GROUPED_ACCESS (dr_info
->stmt
))
1964 dr_info
= STMT_VINFO_DR_INFO (DR_GROUP_FIRST_ELEMENT (dr_info
->stmt
));
1965 return dr_info
->target_alignment
;
1967 #define DR_TARGET_ALIGNMENT(DR) dr_target_alignment (DR)
1970 set_dr_target_alignment (dr_vec_info
*dr_info
, poly_uint64 val
)
1972 dr_info
->target_alignment
= val
;
1974 #define SET_DR_TARGET_ALIGNMENT(DR, VAL) set_dr_target_alignment (DR, VAL)
1976 /* Return true if data access DR_INFO is aligned to the targets
1977 preferred alignment for VECTYPE (which may be less than a full vector). */
1980 aligned_access_p (dr_vec_info
*dr_info
, tree vectype
)
1982 return (dr_misalignment (dr_info
, vectype
) == 0);
1985 /* Return TRUE if the (mis-)alignment of the data access is known with
1986 respect to the targets preferred alignment for VECTYPE, and FALSE
1990 known_alignment_for_access_p (dr_vec_info
*dr_info
, tree vectype
)
1992 return (dr_misalignment (dr_info
, vectype
) != DR_MISALIGNMENT_UNKNOWN
);
1995 /* Return the minimum alignment in bytes that the vectorized version
1996 of DR_INFO is guaranteed to have. */
1999 vect_known_alignment_in_bytes (dr_vec_info
*dr_info
, tree vectype
)
2001 int misalignment
= dr_misalignment (dr_info
, vectype
);
2002 if (misalignment
== DR_MISALIGNMENT_UNKNOWN
)
2003 return TYPE_ALIGN_UNIT (TREE_TYPE (DR_REF (dr_info
->dr
)));
2004 else if (misalignment
== 0)
2005 return known_alignment (DR_TARGET_ALIGNMENT (dr_info
));
2006 return misalignment
& -misalignment
;
2009 /* Return the behavior of DR_INFO with respect to the vectorization context
2010 (which for outer loop vectorization might not be the behavior recorded
2011 in DR_INFO itself). */
2013 inline innermost_loop_behavior
*
2014 vect_dr_behavior (vec_info
*vinfo
, dr_vec_info
*dr_info
)
2016 stmt_vec_info stmt_info
= dr_info
->stmt
;
2017 loop_vec_info loop_vinfo
= dyn_cast
<loop_vec_info
> (vinfo
);
2018 if (loop_vinfo
== NULL
2019 || !nested_in_vect_loop_p (LOOP_VINFO_LOOP (loop_vinfo
), stmt_info
))
2020 return &DR_INNERMOST (dr_info
->dr
);
2022 return &STMT_VINFO_DR_WRT_VEC_LOOP (stmt_info
);
2025 /* Return the offset calculated by adding the offset of this DR_INFO to the
2026 corresponding data_reference's offset. If CHECK_OUTER then use
2027 vect_dr_behavior to select the appropriate data_reference to use. */
2030 get_dr_vinfo_offset (vec_info
*vinfo
,
2031 dr_vec_info
*dr_info
, bool check_outer
= false)
2033 innermost_loop_behavior
*base
;
2035 base
= vect_dr_behavior (vinfo
, dr_info
);
2037 base
= &dr_info
->dr
->innermost
;
2039 tree offset
= base
->offset
;
2041 if (!dr_info
->offset
)
2044 offset
= fold_convert (sizetype
, offset
);
2045 return fold_build2 (PLUS_EXPR
, TREE_TYPE (dr_info
->offset
), offset
,
2050 /* Return the vect cost model for LOOP. */
2051 inline enum vect_cost_model
2052 loop_cost_model (loop_p loop
)
2055 && loop
->force_vectorize
2056 && flag_simd_cost_model
!= VECT_COST_MODEL_DEFAULT
)
2057 return flag_simd_cost_model
;
2058 return flag_vect_cost_model
;
2061 /* Return true if the vect cost model is unlimited. */
2063 unlimited_cost_model (loop_p loop
)
2065 return loop_cost_model (loop
) == VECT_COST_MODEL_UNLIMITED
;
2068 /* Return true if the loop described by LOOP_VINFO is fully-masked and
2069 if the first iteration should use a partial mask in order to achieve
2073 vect_use_loop_mask_for_alignment_p (loop_vec_info loop_vinfo
)
2075 return (LOOP_VINFO_FULLY_MASKED_P (loop_vinfo
)
2076 && LOOP_VINFO_PEELING_FOR_ALIGNMENT (loop_vinfo
));
2079 /* Return the number of vectors of type VECTYPE that are needed to get
2080 NUNITS elements. NUNITS should be based on the vectorization factor,
2081 so it is always a known multiple of the number of elements in VECTYPE. */
2084 vect_get_num_vectors (poly_uint64 nunits
, tree vectype
)
2086 return exact_div (nunits
, TYPE_VECTOR_SUBPARTS (vectype
)).to_constant ();
2089 /* Return the number of vectors in the context of vectorization region VINFO,
2090 needed for a group of statements, whose size is specified by lanes of NODE,
2091 if NULL, it is 1. The statements are supposed to be interleaved together
2092 with no gap, and all operate on vectors of type VECTYPE, if NULL, the
2093 vectype of NODE is used. */
2096 vect_get_num_copies (vec_info
*vinfo
, slp_tree node
, tree vectype
= NULL
)
2100 if (loop_vec_info loop_vinfo
= dyn_cast
<loop_vec_info
> (vinfo
))
2101 vf
= LOOP_VINFO_VECT_FACTOR (loop_vinfo
);
2107 vf
*= SLP_TREE_LANES (node
);
2109 vectype
= SLP_TREE_VECTYPE (node
);
2112 return vect_get_num_vectors (vf
, vectype
);
2115 /* Return the number of copies needed for loop vectorization when
2116 a statement operates on vectors of type VECTYPE. This is the
2117 vectorization factor divided by the number of elements in
2118 VECTYPE and is always known at compile time. */
2121 vect_get_num_copies (loop_vec_info loop_vinfo
, tree vectype
)
2123 return vect_get_num_copies (loop_vinfo
, NULL
, vectype
);
2126 /* Update maximum unit count *MAX_NUNITS so that it accounts for
2127 NUNITS. *MAX_NUNITS can be 1 if we haven't yet recorded anything. */
2130 vect_update_max_nunits (poly_uint64
*max_nunits
, poly_uint64 nunits
)
2132 /* All unit counts have the form vec_info::vector_size * X for some
2133 rational X, so two unit sizes must have a common multiple.
2134 Everything is a multiple of the initial value of 1. */
2135 *max_nunits
= force_common_multiple (*max_nunits
, nunits
);
2138 /* Update maximum unit count *MAX_NUNITS so that it accounts for
2139 the number of units in vector type VECTYPE. *MAX_NUNITS can be 1
2140 if we haven't yet recorded any vector types. */
2143 vect_update_max_nunits (poly_uint64
*max_nunits
, tree vectype
)
2145 vect_update_max_nunits (max_nunits
, TYPE_VECTOR_SUBPARTS (vectype
));
2148 /* Return the vectorization factor that should be used for costing
2149 purposes while vectorizing the loop described by LOOP_VINFO.
2150 Pick a reasonable estimate if the vectorization factor isn't
2151 known at compile time. */
2154 vect_vf_for_cost (loop_vec_info loop_vinfo
)
2156 return estimated_poly_value (LOOP_VINFO_VECT_FACTOR (loop_vinfo
));
2159 /* Estimate the number of elements in VEC_TYPE for costing purposes.
2160 Pick a reasonable estimate if the exact number isn't known at
2164 vect_nunits_for_cost (tree vec_type
)
2166 return estimated_poly_value (TYPE_VECTOR_SUBPARTS (vec_type
));
2169 /* Return the maximum possible vectorization factor for LOOP_VINFO. */
2171 inline unsigned HOST_WIDE_INT
2172 vect_max_vf (loop_vec_info loop_vinfo
)
2174 unsigned HOST_WIDE_INT vf
;
2175 if (LOOP_VINFO_VECT_FACTOR (loop_vinfo
).is_constant (&vf
))
2177 return MAX_VECTORIZATION_FACTOR
;
2180 /* Return the size of the value accessed by unvectorized data reference
2181 DR_INFO. This is only valid once STMT_VINFO_VECTYPE has been calculated
2182 for the associated gimple statement, since that guarantees that DR_INFO
2183 accesses either a scalar or a scalar equivalent. ("Scalar equivalent"
2184 here includes things like V1SI, which can be vectorized in the same way
2188 vect_get_scalar_dr_size (dr_vec_info
*dr_info
)
2190 return tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (DR_REF (dr_info
->dr
))));
2193 /* Return true if LOOP_VINFO requires a runtime check for whether the
2194 vector loop is profitable. */
2197 vect_apply_runtime_profitability_check_p (loop_vec_info loop_vinfo
)
2199 unsigned int th
= LOOP_VINFO_COST_MODEL_THRESHOLD (loop_vinfo
);
2200 return (!LOOP_VINFO_NITERS_KNOWN_P (loop_vinfo
)
2201 && th
>= vect_vf_for_cost (loop_vinfo
));
2204 /* Return true if CODE is a lane-reducing opcode. */
2207 lane_reducing_op_p (code_helper code
)
2209 return code
== DOT_PROD_EXPR
|| code
== WIDEN_SUM_EXPR
|| code
== SAD_EXPR
;
2212 /* Return true if STMT is a lane-reducing statement. */
2215 lane_reducing_stmt_p (gimple
*stmt
)
2217 if (auto *assign
= dyn_cast
<gassign
*> (stmt
))
2218 return lane_reducing_op_p (gimple_assign_rhs_code (assign
));
2222 /* Source location + hotness information. */
2223 extern dump_user_location_t vect_location
;
2225 /* A macro for calling:
2226 dump_begin_scope (MSG, vect_location);
2227 via an RAII object, thus printing "=== MSG ===\n" to the dumpfile etc,
2230 once the object goes out of scope, thus capturing the nesting of
2233 These scopes affect dump messages within them: dump messages at the
2234 top level implicitly default to MSG_PRIORITY_USER_FACING, whereas those
2235 in a nested scope implicitly default to MSG_PRIORITY_INTERNALS. */
2237 #define DUMP_VECT_SCOPE(MSG) \
2238 AUTO_DUMP_SCOPE (MSG, vect_location)
2240 /* A sentinel class for ensuring that the "vect_location" global gets
2241 reset at the end of a scope.
2243 The "vect_location" global is used during dumping and contains a
2244 location_t, which could contain references to a tree block via the
2245 ad-hoc data. This data is used for tracking inlining information,
2246 but it's not a GC root; it's simply assumed that such locations never
2247 get accessed if the blocks are optimized away.
2249 Hence we need to ensure that such locations are purged at the end
2250 of any operations using them (e.g. via this class). */
2252 class auto_purge_vect_location
2255 ~auto_purge_vect_location ();
2258 /*-----------------------------------------------------------------*/
2259 /* Function prototypes. */
2260 /*-----------------------------------------------------------------*/
2262 /* Simple loop peeling and versioning utilities for vectorizer's purposes -
2263 in tree-vect-loop-manip.cc. */
2264 extern void vect_set_loop_condition (class loop
*, edge
, loop_vec_info
,
2265 tree
, tree
, tree
, bool);
2266 extern bool slpeel_can_duplicate_loop_p (const class loop
*, const_edge
,
2268 class loop
*slpeel_tree_duplicate_loop_to_edge_cfg (class loop
*, edge
,
2270 edge
, edge
*, bool = true,
2271 vec
<basic_block
> * = NULL
);
2272 class loop
*vect_loop_versioning (loop_vec_info
, gimple
*);
2273 extern class loop
*vect_do_peeling (loop_vec_info
, tree
, tree
,
2274 tree
*, tree
*, tree
*, int, bool, bool,
2276 extern tree
vect_get_main_loop_result (loop_vec_info
, tree
, tree
);
2277 extern void vect_prepare_for_masked_peels (loop_vec_info
);
2278 extern dump_user_location_t
find_loop_location (class loop
*);
2279 extern bool vect_can_advance_ivs_p (loop_vec_info
);
2280 extern void vect_update_inits_of_drs (loop_vec_info
, tree
, tree_code
);
2281 extern edge
vec_init_loop_exit_info (class loop
*);
2282 extern void vect_iv_increment_position (edge
, gimple_stmt_iterator
*, bool *);
2284 /* In tree-vect-stmts.cc. */
2285 extern tree
get_related_vectype_for_scalar_type (machine_mode
, tree
,
2287 extern tree
get_vectype_for_scalar_type (vec_info
*, tree
, unsigned int = 0);
2288 extern tree
get_vectype_for_scalar_type (vec_info
*, tree
, slp_tree
);
2289 extern tree
get_mask_type_for_scalar_type (vec_info
*, tree
, unsigned int = 0);
2290 extern tree
get_mask_type_for_scalar_type (vec_info
*, tree
, slp_tree
);
2291 extern tree
get_same_sized_vectype (tree
, tree
);
2292 extern bool vect_chooses_same_modes_p (vec_info
*, machine_mode
);
2293 extern bool vect_get_loop_mask_type (loop_vec_info
);
2294 extern bool vect_is_simple_use (tree
, vec_info
*, enum vect_def_type
*,
2295 stmt_vec_info
* = NULL
, gimple
** = NULL
);
2296 extern bool vect_is_simple_use (tree
, vec_info
*, enum vect_def_type
*,
2297 tree
*, stmt_vec_info
* = NULL
,
2299 extern bool vect_is_simple_use (vec_info
*, stmt_vec_info
, slp_tree
,
2300 unsigned, tree
*, slp_tree
*,
2301 enum vect_def_type
*,
2302 tree
*, stmt_vec_info
* = NULL
);
2303 extern bool vect_maybe_update_slp_op_vectype (slp_tree
, tree
);
2304 extern tree
perm_mask_for_reverse (tree
);
2305 extern bool supportable_widening_operation (vec_info
*, code_helper
,
2306 stmt_vec_info
, tree
, tree
,
2307 code_helper
*, code_helper
*,
2309 extern bool supportable_narrowing_operation (code_helper
, tree
, tree
,
2310 code_helper
*, int *,
2312 extern bool supportable_indirect_convert_operation (code_helper
,
2314 vec
<std::pair
<tree
, tree_code
> > *,
2317 extern unsigned record_stmt_cost (stmt_vector_for_cost
*, int,
2318 enum vect_cost_for_stmt
, stmt_vec_info
,
2319 tree
, int, enum vect_cost_model_location
);
2320 extern unsigned record_stmt_cost (stmt_vector_for_cost
*, int,
2321 enum vect_cost_for_stmt
, slp_tree
,
2322 tree
, int, enum vect_cost_model_location
);
2323 extern unsigned record_stmt_cost (stmt_vector_for_cost
*, int,
2324 enum vect_cost_for_stmt
,
2325 enum vect_cost_model_location
);
2327 /* Overload of record_stmt_cost with VECTYPE derived from STMT_INFO. */
2330 record_stmt_cost (stmt_vector_for_cost
*body_cost_vec
, int count
,
2331 enum vect_cost_for_stmt kind
, stmt_vec_info stmt_info
,
2332 int misalign
, enum vect_cost_model_location where
)
2334 return record_stmt_cost (body_cost_vec
, count
, kind
, stmt_info
,
2335 STMT_VINFO_VECTYPE (stmt_info
), misalign
, where
);
2338 extern void vect_finish_replace_stmt (vec_info
*, stmt_vec_info
, gimple
*);
2339 extern void vect_finish_stmt_generation (vec_info
*, stmt_vec_info
, gimple
*,
2340 gimple_stmt_iterator
*);
2341 extern opt_result
vect_mark_stmts_to_be_vectorized (loop_vec_info
, bool *);
2342 extern tree
vect_get_store_rhs (stmt_vec_info
);
2343 void vect_get_vec_defs_for_operand (vec_info
*vinfo
, stmt_vec_info
, unsigned,
2344 tree op
, vec
<tree
> *, tree
= NULL
);
2345 void vect_get_vec_defs (vec_info
*, stmt_vec_info
, slp_tree
, unsigned,
2347 tree
= NULL
, vec
<tree
> * = NULL
,
2348 tree
= NULL
, vec
<tree
> * = NULL
,
2349 tree
= NULL
, vec
<tree
> * = NULL
);
2350 void vect_get_vec_defs (vec_info
*, stmt_vec_info
, slp_tree
, unsigned,
2351 tree
, tree
, vec
<tree
> *,
2352 tree
= NULL
, tree
= NULL
, vec
<tree
> * = NULL
,
2353 tree
= NULL
, tree
= NULL
, vec
<tree
> * = NULL
,
2354 tree
= NULL
, tree
= NULL
, vec
<tree
> * = NULL
);
2355 extern tree
vect_init_vector (vec_info
*, stmt_vec_info
, tree
, tree
,
2356 gimple_stmt_iterator
*);
2357 extern tree
vect_get_slp_vect_def (slp_tree
, unsigned);
2358 extern bool vect_transform_stmt (vec_info
*, stmt_vec_info
,
2359 gimple_stmt_iterator
*,
2360 slp_tree
, slp_instance
);
2361 extern void vect_remove_stores (vec_info
*, stmt_vec_info
);
2362 extern bool vect_nop_conversion_p (stmt_vec_info
);
2363 extern opt_result
vect_analyze_stmt (vec_info
*, stmt_vec_info
, bool *,
2365 slp_instance
, stmt_vector_for_cost
*);
2366 extern void vect_get_load_cost (vec_info
*, stmt_vec_info
, int,
2367 dr_alignment_support
, int, bool,
2368 unsigned int *, unsigned int *,
2369 stmt_vector_for_cost
*,
2370 stmt_vector_for_cost
*, bool);
2371 extern void vect_get_store_cost (vec_info
*, stmt_vec_info
, int,
2372 dr_alignment_support
, int,
2373 unsigned int *, stmt_vector_for_cost
*);
2374 extern bool vect_supportable_shift (vec_info
*, enum tree_code
, tree
);
2375 extern tree
vect_gen_perm_mask_any (tree
, const vec_perm_indices
&);
2376 extern tree
vect_gen_perm_mask_checked (tree
, const vec_perm_indices
&);
2377 extern void optimize_mask_stores (class loop
*);
2378 extern tree
vect_gen_while (gimple_seq
*, tree
, tree
, tree
,
2379 const char * = nullptr);
2380 extern tree
vect_gen_while_not (gimple_seq
*, tree
, tree
, tree
);
2381 extern opt_result
vect_get_vector_types_for_stmt (vec_info
*,
2382 stmt_vec_info
, tree
*,
2383 tree
*, unsigned int = 0);
2384 extern opt_tree
vect_get_mask_type_for_stmt (stmt_vec_info
, unsigned int = 0);
2386 /* In tree-if-conv.cc. */
2387 extern bool ref_within_array_bound (gimple
*, tree
);
2389 /* In tree-vect-data-refs.cc. */
2390 extern bool vect_can_force_dr_alignment_p (const_tree
, poly_uint64
);
2391 extern enum dr_alignment_support vect_supportable_dr_alignment
2392 (vec_info
*, dr_vec_info
*, tree
, int);
2393 extern tree
vect_get_smallest_scalar_type (stmt_vec_info
, tree
);
2394 extern opt_result
vect_analyze_data_ref_dependences (loop_vec_info
, unsigned int *);
2395 extern bool vect_slp_analyze_instance_dependence (vec_info
*, slp_instance
);
2396 extern opt_result
vect_enhance_data_refs_alignment (loop_vec_info
);
2397 extern opt_result
vect_analyze_data_refs_alignment (loop_vec_info
);
2398 extern bool vect_slp_analyze_instance_alignment (vec_info
*, slp_instance
);
2399 extern opt_result
vect_analyze_data_ref_accesses (vec_info
*, vec
<int> *);
2400 extern opt_result
vect_prune_runtime_alias_test_list (loop_vec_info
);
2401 extern bool vect_gather_scatter_fn_p (vec_info
*, bool, bool, tree
, tree
,
2402 tree
, int, internal_fn
*, tree
*);
2403 extern bool vect_check_gather_scatter (stmt_vec_info
, loop_vec_info
,
2404 gather_scatter_info
*);
2405 extern opt_result
vect_find_stmt_data_reference (loop_p
, gimple
*,
2406 vec
<data_reference_p
> *,
2408 extern opt_result
vect_analyze_data_refs (vec_info
*, poly_uint64
*, bool *);
2409 extern void vect_record_base_alignments (vec_info
*);
2410 extern tree
vect_create_data_ref_ptr (vec_info
*,
2411 stmt_vec_info
, tree
, class loop
*, tree
,
2412 tree
*, gimple_stmt_iterator
*,
2415 extern tree
bump_vector_ptr (vec_info
*, tree
, gimple
*, gimple_stmt_iterator
*,
2416 stmt_vec_info
, tree
);
2417 extern void vect_copy_ref_info (tree
, tree
);
2418 extern tree
vect_create_destination_var (tree
, tree
);
2419 extern bool vect_grouped_store_supported (tree
, unsigned HOST_WIDE_INT
);
2420 extern internal_fn
vect_store_lanes_supported (tree
, unsigned HOST_WIDE_INT
, bool);
2421 extern bool vect_grouped_load_supported (tree
, bool, unsigned HOST_WIDE_INT
);
2422 extern internal_fn
vect_load_lanes_supported (tree
, unsigned HOST_WIDE_INT
, bool);
2423 extern void vect_permute_store_chain (vec_info
*, vec
<tree
> &,
2424 unsigned int, stmt_vec_info
,
2425 gimple_stmt_iterator
*, vec
<tree
> *);
2426 extern tree
vect_setup_realignment (vec_info
*,
2427 stmt_vec_info
, gimple_stmt_iterator
*,
2428 tree
*, enum dr_alignment_support
, tree
,
2430 extern void vect_transform_grouped_load (vec_info
*, stmt_vec_info
, vec
<tree
>,
2431 int, gimple_stmt_iterator
*);
2432 extern void vect_record_grouped_load_vectors (vec_info
*,
2433 stmt_vec_info
, vec
<tree
>);
2434 extern tree
vect_get_new_vect_var (tree
, enum vect_var_kind
, const char *);
2435 extern tree
vect_get_new_ssa_name (tree
, enum vect_var_kind
,
2436 const char * = NULL
);
2437 extern tree
vect_create_addr_base_for_vector_ref (vec_info
*,
2438 stmt_vec_info
, gimple_seq
*,
2441 /* In tree-vect-loop.cc. */
2442 extern tree
neutral_op_for_reduction (tree
, code_helper
, tree
, bool = true);
2443 extern widest_int
vect_iv_limit_for_partial_vectors (loop_vec_info loop_vinfo
);
2444 bool vect_rgroup_iv_might_wrap_p (loop_vec_info
, rgroup_controls
*);
2445 /* Used in tree-vect-loop-manip.cc */
2446 extern opt_result
vect_determine_partial_vectors_and_peeling (loop_vec_info
);
2447 /* Used in gimple-loop-interchange.c and tree-parloops.cc. */
2448 extern bool check_reduction_path (dump_user_location_t
, loop_p
, gphi
*, tree
,
2450 extern bool needs_fold_left_reduction_p (tree
, code_helper
);
2451 /* Drive for loop analysis stage. */
2452 extern opt_loop_vec_info
vect_analyze_loop (class loop
*, vec_info_shared
*);
2453 extern tree
vect_build_loop_niters (loop_vec_info
, bool * = NULL
);
2454 extern void vect_gen_vector_loop_niters (loop_vec_info
, tree
, tree
*,
2456 extern tree
vect_halve_mask_nunits (tree
, machine_mode
);
2457 extern tree
vect_double_mask_nunits (tree
, machine_mode
);
2458 extern void vect_record_loop_mask (loop_vec_info
, vec_loop_masks
*,
2459 unsigned int, tree
, tree
);
2460 extern tree
vect_get_loop_mask (loop_vec_info
, gimple_stmt_iterator
*,
2462 unsigned int, tree
, unsigned int);
2463 extern void vect_record_loop_len (loop_vec_info
, vec_loop_lens
*, unsigned int,
2464 tree
, unsigned int);
2465 extern tree
vect_get_loop_len (loop_vec_info
, gimple_stmt_iterator
*,
2466 vec_loop_lens
*, unsigned int, tree
,
2467 unsigned int, unsigned int);
2468 extern tree
vect_gen_loop_len_mask (loop_vec_info
, gimple_stmt_iterator
*,
2469 gimple_stmt_iterator
*, vec_loop_lens
*,
2470 unsigned int, tree
, tree
, unsigned int,
2472 extern gimple_seq
vect_gen_len (tree
, tree
, tree
, tree
);
2473 extern stmt_vec_info
info_for_reduction (vec_info
*, stmt_vec_info
);
2474 extern bool reduction_fn_for_scalar_code (code_helper
, internal_fn
*);
2476 /* Drive for loop transformation stage. */
2477 extern class loop
*vect_transform_loop (loop_vec_info
, gimple
*);
2478 struct vect_loop_form_info
2480 tree number_of_iterations
;
2481 tree number_of_iterationsm1
;
2483 auto_vec
<gcond
*> conds
;
2484 gcond
*inner_loop_cond
;
2487 extern opt_result
vect_analyze_loop_form (class loop
*, vect_loop_form_info
*);
2488 extern loop_vec_info
vect_create_loop_vinfo (class loop
*, vec_info_shared
*,
2489 const vect_loop_form_info
*,
2490 loop_vec_info
= nullptr);
2491 extern bool vectorizable_live_operation (vec_info
*, stmt_vec_info
,
2492 slp_tree
, slp_instance
, int,
2493 bool, stmt_vector_for_cost
*);
2494 extern bool vectorizable_lane_reducing (loop_vec_info
, stmt_vec_info
,
2495 slp_tree
, stmt_vector_for_cost
*);
2496 extern bool vectorizable_reduction (loop_vec_info
, stmt_vec_info
,
2497 slp_tree
, slp_instance
,
2498 stmt_vector_for_cost
*);
2499 extern bool vectorizable_induction (loop_vec_info
, stmt_vec_info
,
2500 gimple
**, slp_tree
,
2501 stmt_vector_for_cost
*);
2502 extern bool vect_transform_reduction (loop_vec_info
, stmt_vec_info
,
2503 gimple_stmt_iterator
*,
2504 gimple
**, slp_tree
);
2505 extern bool vect_transform_cycle_phi (loop_vec_info
, stmt_vec_info
,
2507 slp_tree
, slp_instance
);
2508 extern bool vectorizable_lc_phi (loop_vec_info
, stmt_vec_info
,
2509 gimple
**, slp_tree
);
2510 extern bool vectorizable_phi (vec_info
*, stmt_vec_info
, gimple
**, slp_tree
,
2511 stmt_vector_for_cost
*);
2512 extern bool vectorizable_recurr (loop_vec_info
, stmt_vec_info
,
2513 gimple
**, slp_tree
, stmt_vector_for_cost
*);
2514 extern bool vect_emulated_vector_p (tree
);
2515 extern bool vect_can_vectorize_without_simd_p (tree_code
);
2516 extern bool vect_can_vectorize_without_simd_p (code_helper
);
2517 extern int vect_get_known_peeling_cost (loop_vec_info
, int, int *,
2518 stmt_vector_for_cost
*,
2519 stmt_vector_for_cost
*,
2520 stmt_vector_for_cost
*);
2521 extern tree
cse_and_gimplify_to_preheader (loop_vec_info
, tree
);
2523 /* Nonlinear induction. */
2524 extern tree
vect_peel_nonlinear_iv_init (gimple_seq
*, tree
, tree
,
2525 tree
, enum vect_induction_op_type
);
2527 /* In tree-vect-slp.cc. */
2528 extern void vect_slp_init (void);
2529 extern void vect_slp_fini (void);
2530 extern void vect_free_slp_instance (slp_instance
);
2531 extern bool vect_transform_slp_perm_load (vec_info
*, slp_tree
, const vec
<tree
> &,
2532 gimple_stmt_iterator
*, poly_uint64
,
2534 unsigned * = nullptr, bool = false);
2535 extern bool vect_slp_analyze_operations (vec_info
*);
2536 extern void vect_schedule_slp (vec_info
*, const vec
<slp_instance
> &);
2537 extern opt_result
vect_analyze_slp (vec_info
*, unsigned);
2538 extern bool vect_make_slp_decision (loop_vec_info
);
2539 extern void vect_detect_hybrid_slp (loop_vec_info
);
2540 extern void vect_optimize_slp (vec_info
*);
2541 extern void vect_gather_slp_loads (vec_info
*);
2542 extern void vect_get_slp_defs (slp_tree
, vec
<tree
> *);
2543 extern void vect_get_slp_defs (vec_info
*, slp_tree
, vec
<vec
<tree
> > *,
2545 extern bool vect_slp_if_converted_bb (basic_block bb
, loop_p orig_loop
);
2546 extern bool vect_slp_function (function
*);
2547 extern stmt_vec_info
vect_find_last_scalar_stmt_in_slp (slp_tree
);
2548 extern stmt_vec_info
vect_find_first_scalar_stmt_in_slp (slp_tree
);
2549 extern bool is_simple_and_all_uses_invariant (stmt_vec_info
, loop_vec_info
);
2550 extern bool can_duplicate_and_interleave_p (vec_info
*, unsigned int, tree
,
2551 unsigned int * = NULL
,
2552 tree
* = NULL
, tree
* = NULL
);
2553 extern void duplicate_and_interleave (vec_info
*, gimple_seq
*, tree
,
2554 const vec
<tree
> &, unsigned int, vec
<tree
> &);
2555 extern int vect_get_place_in_interleaving_chain (stmt_vec_info
, stmt_vec_info
);
2556 extern slp_tree
vect_create_new_slp_node (unsigned, tree_code
);
2557 extern void vect_free_slp_tree (slp_tree
);
2558 extern bool compatible_calls_p (gcall
*, gcall
*);
2559 extern int vect_slp_child_index_for_operand (const gimple
*, int op
, bool);
2561 extern tree
prepare_vec_mask (loop_vec_info
, tree
, tree
, tree
,
2562 gimple_stmt_iterator
*);
2564 /* In tree-vect-patterns.cc. */
2566 vect_mark_pattern_stmts (vec_info
*, stmt_vec_info
, gimple
*, tree
);
2567 extern bool vect_get_range_info (tree
, wide_int
*, wide_int
*);
2569 /* Pattern recognition functions.
2570 Additional pattern recognition functions can (and will) be added
2572 void vect_pattern_recog (vec_info
*);
2574 /* In tree-vectorizer.cc. */
2575 unsigned vectorize_loops (void);
2576 void vect_free_loop_info_assumptions (class loop
*);
2577 gimple
*vect_loop_vectorized_call (class loop
*, gcond
**cond
= NULL
);
2578 bool vect_stmt_dominates_stmt_p (gimple
*, gimple
*);
2580 /* SLP Pattern matcher types, tree-vect-slp-patterns.cc. */
2582 /* Forward declaration of possible two operands operation that can be matched
2583 by the complex numbers pattern matchers. */
2584 enum _complex_operation
: unsigned;
2586 /* All possible load permute values that could result from the partial data-flow
2588 typedef enum _complex_perm_kinds
{
2594 /* Can be combined with any other PERM values. */
2596 } complex_perm_kinds_t
;
2598 /* Cache from nodes to the load permutation they represent. */
2599 typedef hash_map
<slp_tree
, complex_perm_kinds_t
>
2600 slp_tree_to_load_perm_map_t
;
2602 /* Cache from nodes pair to being compatible or not. */
2603 typedef pair_hash
<nofree_ptr_hash
<_slp_tree
>,
2604 nofree_ptr_hash
<_slp_tree
>> slp_node_hash
;
2605 typedef hash_map
<slp_node_hash
, bool> slp_compat_nodes_map_t
;
2608 /* Vector pattern matcher base class. All SLP pattern matchers must inherit
2614 /* The number of arguments that the IFN requires. */
2615 unsigned m_num_args
;
2617 /* The internal function that will be used when a pattern is created. */
2620 /* The current node being inspected. */
2623 /* The list of operands to be the children for the node produced when the
2624 internal function is created. */
2625 vec
<slp_tree
> m_ops
;
2627 /* Default constructor where NODE is the root of the tree to inspect. */
2628 vect_pattern (slp_tree
*node
, vec
<slp_tree
> *m_ops
, internal_fn ifn
)
2631 this->m_node
= node
;
2632 this->m_ops
.create (0);
2634 this->m_ops
.safe_splice (*m_ops
);
2639 /* Create a new instance of the pattern matcher class of the given type. */
2640 static vect_pattern
* recognize (slp_tree_to_load_perm_map_t
*,
2641 slp_compat_nodes_map_t
*, slp_tree
*);
2643 /* Build the pattern from the data collected so far. */
2644 virtual void build (vec_info
*) = 0;
2646 /* Default destructor. */
2647 virtual ~vect_pattern ()
2649 this->m_ops
.release ();
2653 /* Function pointer to create a new pattern matcher from a generic type. */
2654 typedef vect_pattern
* (*vect_pattern_decl_t
) (slp_tree_to_load_perm_map_t
*,
2655 slp_compat_nodes_map_t
*,
2658 /* List of supported pattern matchers. */
2659 extern vect_pattern_decl_t slp_patterns
[];
2661 /* Number of supported pattern matchers. */
2662 extern size_t num__slp_patterns
;
2664 /* ----------------------------------------------------------------------
2665 Target support routines
2666 -----------------------------------------------------------------------
2667 The following routines are provided to simplify costing decisions in
2668 target code. Please add more as needed. */
2670 /* Return true if an operaton of kind KIND for STMT_INFO represents
2671 the extraction of an element from a vector in preparation for
2672 storing the element to memory. */
2674 vect_is_store_elt_extraction (vect_cost_for_stmt kind
, stmt_vec_info stmt_info
)
2676 return (kind
== vec_to_scalar
2677 && STMT_VINFO_DATA_REF (stmt_info
)
2678 && DR_IS_WRITE (STMT_VINFO_DATA_REF (stmt_info
)));
2681 /* Return true if STMT_INFO represents part of a reduction. */
2683 vect_is_reduction (stmt_vec_info stmt_info
)
2685 return STMT_VINFO_REDUC_IDX (stmt_info
) >= 0;
2688 /* If STMT_INFO describes a reduction, return the vect_reduction_type
2689 of the reduction it describes, otherwise return -1. */
2691 vect_reduc_type (vec_info
*vinfo
, stmt_vec_info stmt_info
)
2693 if (loop_vec_info loop_vinfo
= dyn_cast
<loop_vec_info
> (vinfo
))
2694 if (STMT_VINFO_REDUC_DEF (stmt_info
))
2696 stmt_vec_info reduc_info
= info_for_reduction (loop_vinfo
, stmt_info
);
2697 return int (STMT_VINFO_REDUC_TYPE (reduc_info
));
2702 /* If STMT_INFO is a COND_EXPR that includes an embedded comparison, return the
2703 scalar type of the values being compared. Return null otherwise. */
2705 vect_embedded_comparison_type (stmt_vec_info stmt_info
)
2707 if (auto *assign
= dyn_cast
<gassign
*> (stmt_info
->stmt
))
2708 if (gimple_assign_rhs_code (assign
) == COND_EXPR
)
2710 tree cond
= gimple_assign_rhs1 (assign
);
2711 if (COMPARISON_CLASS_P (cond
))
2712 return TREE_TYPE (TREE_OPERAND (cond
, 0));
2717 /* If STMT_INFO is a comparison or contains an embedded comparison, return the
2718 scalar type of the values being compared. Return null otherwise. */
2720 vect_comparison_type (stmt_vec_info stmt_info
)
2722 if (auto *assign
= dyn_cast
<gassign
*> (stmt_info
->stmt
))
2723 if (TREE_CODE_CLASS (gimple_assign_rhs_code (assign
)) == tcc_comparison
)
2724 return TREE_TYPE (gimple_assign_rhs1 (assign
));
2725 return vect_embedded_comparison_type (stmt_info
);
2728 /* Return true if STMT_INFO extends the result of a load. */
2730 vect_is_extending_load (class vec_info
*vinfo
, stmt_vec_info stmt_info
)
2732 /* Although this is quite large for an inline function, this part
2733 at least should be inline. */
2734 gassign
*assign
= dyn_cast
<gassign
*> (stmt_info
->stmt
);
2735 if (!assign
|| !CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (assign
)))
2738 tree rhs
= gimple_assign_rhs1 (stmt_info
->stmt
);
2739 tree lhs_type
= TREE_TYPE (gimple_assign_lhs (assign
));
2740 tree rhs_type
= TREE_TYPE (rhs
);
2741 if (!INTEGRAL_TYPE_P (lhs_type
)
2742 || !INTEGRAL_TYPE_P (rhs_type
)
2743 || TYPE_PRECISION (lhs_type
) <= TYPE_PRECISION (rhs_type
))
2746 stmt_vec_info def_stmt_info
= vinfo
->lookup_def (rhs
);
2747 return (def_stmt_info
2748 && STMT_VINFO_DATA_REF (def_stmt_info
)
2749 && DR_IS_READ (STMT_VINFO_DATA_REF (def_stmt_info
)));
2752 /* Return true if STMT_INFO is an integer truncation. */
2754 vect_is_integer_truncation (stmt_vec_info stmt_info
)
2756 gassign
*assign
= dyn_cast
<gassign
*> (stmt_info
->stmt
);
2757 if (!assign
|| !CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (assign
)))
2760 tree lhs_type
= TREE_TYPE (gimple_assign_lhs (assign
));
2761 tree rhs_type
= TREE_TYPE (gimple_assign_rhs1 (assign
));
2762 return (INTEGRAL_TYPE_P (lhs_type
)
2763 && INTEGRAL_TYPE_P (rhs_type
)
2764 && TYPE_PRECISION (lhs_type
) < TYPE_PRECISION (rhs_type
));
2767 /* Build a GIMPLE_ASSIGN or GIMPLE_CALL with the tree_code,
2768 or internal_fn contained in ch, respectively. */
2769 gimple
* vect_gimple_build (tree
, code_helper
, tree
, tree
= NULL_TREE
);
2770 #endif /* GCC_TREE_VECTORIZER_H */