Mercurial > hg > CbC > CbC_gcc
diff gcc/tree-vectorizer.h @ 111:04ced10e8804
gcc 7
| author | kono |
|---|---|
| date | Fri, 27 Oct 2017 22:46:09 +0900 |
| parents | f6334be47118 |
| children | 84e7813d76e9 |
line wrap: on
line diff
--- a/gcc/tree-vectorizer.h Sun Aug 21 07:07:55 2011 +0900 +++ b/gcc/tree-vectorizer.h Fri Oct 27 22:46:09 2017 +0900 @@ -1,6 +1,5 @@ /* Vectorizer - Copyright (C) 2003, 2004, 2005, 2006, 2007, 2008, 2009, 2010 - Free Software Foundation, Inc. + Copyright (C) 2003-2017 Free Software Foundation, Inc. Contributed by Dorit Naishlos <dorit@il.ibm.com> This file is part of GCC. @@ -23,18 +22,15 @@ #define GCC_TREE_VECTORIZER_H #include "tree-data-ref.h" - -typedef source_location LOC; -#define UNKNOWN_LOC UNKNOWN_LOCATION -#define EXPR_LOC(e) EXPR_LOCATION(e) -#define LOC_FILE(l) LOCATION_FILE (l) -#define LOC_LINE(l) LOCATION_LINE (l) +#include "tree-hash-traits.h" +#include "target.h" /* Used for naming of new temporaries. */ enum vect_var_kind { vect_simple_var, vect_pointer_var, - vect_scalar_var + vect_scalar_var, + vect_mask_var }; /* Defines type of operation. */ @@ -66,41 +62,62 @@ vect_unknown_def_type }; +/* Define type of reduction. */ +enum vect_reduction_type { + TREE_CODE_REDUCTION, + COND_REDUCTION, + INTEGER_INDUC_COND_REDUCTION, + CONST_COND_REDUCTION +}; + #define VECTORIZABLE_CYCLE_DEF(D) (((D) == vect_reduction_def) \ || ((D) == vect_double_reduction_def) \ || ((D) == vect_nested_cycle)) +/* Structure to encapsulate information about a group of like + instructions to be presented to the target cost model. */ +struct stmt_info_for_cost { + int count; + enum vect_cost_for_stmt kind; + gimple *stmt; + int misalign; +}; + +typedef vec<stmt_info_for_cost> stmt_vector_for_cost; + +/* Maps base addresses to an innermost_loop_behavior that gives the maximum + known alignment for that base. */ +typedef hash_map<tree_operand_hash, + innermost_loop_behavior *> vec_base_alignments; + /************************************************************************ SLP ************************************************************************/ +typedef struct _slp_tree *slp_tree; -/* A computation tree of an SLP instance. Each node corresponds to a group of +/* A computation tree of an SLP instance. Each node corresponds to a group of stmts to be packed in a SIMD stmt. */ -typedef struct _slp_tree { - /* Only binary and unary operations are supported. LEFT child corresponds to - the first operand and RIGHT child to the second if the operation is - binary. */ - struct _slp_tree *left; - struct _slp_tree *right; +struct _slp_tree { + /* Nodes that contain def-stmts of this node statements operands. */ + vec<slp_tree> children; /* A group of scalar stmts to be vectorized together. */ - VEC (gimple, heap) *stmts; + vec<gimple *> stmts; + /* Load permutation relative to the stores, NULL if there is no + permutation. */ + vec<unsigned> load_permutation; /* Vectorized stmt/s. */ - VEC (gimple, heap) *vec_stmts; + vec<gimple *> vec_stmts; /* Number of vector stmts that are created to replace the group of scalar stmts. It is calculated during the transformation phase as the number of scalar elements in one scalar iteration (GROUP_SIZE) multiplied by VF divided by vector size. */ unsigned int vec_stmts_size; - /* Vectorization costs associated with SLP node. */ - struct - { - int outside_of_loop; /* Statements generated outside loop. */ - int inside_of_loop; /* Statements generated inside loop. */ - } cost; -} *slp_tree; + /* Whether the scalar computations use two different operators. */ + bool two_operators; + /* The DEF type of this node. */ + enum vect_def_type def_type; +}; -DEF_VEC_P(slp_tree); -DEF_VEC_ALLOC_P(slp_tree, heap); /* SLP instance is a sequence of stmts in a loop that can be packed into SIMD stmts. */ @@ -114,65 +131,92 @@ /* The unrolling factor required to vectorized this SLP instance. */ unsigned int unrolling_factor; - /* Vectorization costs associated with SLP instance. */ - struct - { - int outside_of_loop; /* Statements generated outside loop. */ - int inside_of_loop; /* Statements generated inside loop. */ - } cost; + /* The group of nodes that contain loads of this SLP instance. */ + vec<slp_tree> loads; - /* Loads permutation relatively to the stores, NULL if there is no - permutation. */ - VEC (int, heap) *load_permutation; - - /* The group of nodes that contain loads of this SLP instance. */ - VEC (slp_tree, heap) *loads; - - /* The first scalar load of the instance. The created vector loads will be - inserted before this statement. */ - gimple first_load; + /* The SLP node containing the reduction PHIs. */ + slp_tree reduc_phis; } *slp_instance; -DEF_VEC_P(slp_instance); -DEF_VEC_ALLOC_P(slp_instance, heap); /* Access Functions. */ #define SLP_INSTANCE_TREE(S) (S)->root #define SLP_INSTANCE_GROUP_SIZE(S) (S)->group_size #define SLP_INSTANCE_UNROLLING_FACTOR(S) (S)->unrolling_factor -#define SLP_INSTANCE_OUTSIDE_OF_LOOP_COST(S) (S)->cost.outside_of_loop -#define SLP_INSTANCE_INSIDE_OF_LOOP_COST(S) (S)->cost.inside_of_loop -#define SLP_INSTANCE_LOAD_PERMUTATION(S) (S)->load_permutation #define SLP_INSTANCE_LOADS(S) (S)->loads -#define SLP_INSTANCE_FIRST_LOAD_STMT(S) (S)->first_load -#define SLP_TREE_LEFT(S) (S)->left -#define SLP_TREE_RIGHT(S) (S)->right +#define SLP_TREE_CHILDREN(S) (S)->children #define SLP_TREE_SCALAR_STMTS(S) (S)->stmts #define SLP_TREE_VEC_STMTS(S) (S)->vec_stmts #define SLP_TREE_NUMBER_OF_VEC_STMTS(S) (S)->vec_stmts_size -#define SLP_TREE_OUTSIDE_OF_LOOP_COST(S) (S)->cost.outside_of_loop -#define SLP_TREE_INSIDE_OF_LOOP_COST(S) (S)->cost.inside_of_loop +#define SLP_TREE_LOAD_PERMUTATION(S) (S)->load_permutation +#define SLP_TREE_TWO_OPERATORS(S) (S)->two_operators +#define SLP_TREE_DEF_TYPE(S) (S)->def_type + -typedef struct _vect_peel_info -{ - int npeel; - struct data_reference *dr; - unsigned int count; -} *vect_peel_info; +/* Describes two objects whose addresses must be unequal for the vectorized + loop to be valid. */ +typedef std::pair<tree, tree> vec_object_pair; + +/* Vectorizer state common between loop and basic-block vectorization. */ +struct vec_info { + enum vec_kind { bb, loop }; + + vec_info (vec_kind, void *); + ~vec_info (); + + /* The type of vectorization. */ + vec_kind kind; + + /* All SLP instances. */ + auto_vec<slp_instance> slp_instances; + + /* All data references. Freed by free_data_refs, so not an auto_vec. */ + vec<data_reference_p> datarefs; + + /* Maps base addresses to an innermost_loop_behavior that gives the maximum + known alignment for that base. */ + vec_base_alignments base_alignments; + + /* All data dependences. Freed by free_dependence_relations, so not + an auto_vec. */ + vec<ddr_p> ddrs; -typedef struct _vect_peel_extended_info + /* All interleaving chains of stores, represented by the first + stmt in the chain. */ + auto_vec<gimple *> grouped_stores; + + /* Cost data used by the target cost model. */ + void *target_cost_data; +}; + +struct _loop_vec_info; +struct _bb_vec_info; + +template<> +template<> +inline bool +is_a_helper <_loop_vec_info *>::test (vec_info *i) { - struct _vect_peel_info peel_info; - unsigned int inside_cost; - unsigned int outside_cost; -} *vect_peel_extended_info; + return i->kind == vec_info::loop; +} + +template<> +template<> +inline bool +is_a_helper <_bb_vec_info *>::test (vec_info *i) +{ + return i->kind == vec_info::bb; +} + /*-----------------------------------------------------------------*/ /* Info on vectorized loops. */ /*-----------------------------------------------------------------*/ -typedef struct _loop_vec_info { +typedef struct _loop_vec_info : public vec_info { + _loop_vec_info (struct loop *); + ~_loop_vec_info (); /* The loop to which this info struct refers to. */ struct loop *loop; @@ -180,25 +224,26 @@ /* The loop basic blocks. */ basic_block *bbs; + /* Number of latch executions. */ + tree num_itersm1; /* Number of iterations. */ tree num_iters; + /* Number of iterations of the original loop. */ tree num_iters_unchanged; + /* Condition under which this loop is analyzed and versioned. */ + tree num_iters_assumptions; - /* Minimum number of iterations below which vectorization is expected to - not be profitable (as estimated by the cost model). - -1 indicates that vectorization will not be profitable. - FORNOW: This field is an int. Will be a tree in the future, to represent - values unknown at compile time. */ - int min_profitable_iters; - - /* Is the loop vectorizable? */ - bool vectorizable; + /* Threshold of number of iterations below which vectorzation will not be + performed. It is calculated from MIN_PROFITABLE_ITERS and + PARAM_MIN_VECT_LOOP_BOUND. */ + unsigned int th; /* Unrolling factor */ int vectorization_factor; - /* The loop location in the source. */ - LOC loop_line_number; + /* Maximum runtime vectorization factor, or MAX_VECTORIZATION_FACTOR + if there is no particular limit. */ + unsigned HOST_WIDE_INT max_vectorization_factor; /* Unknown DRs according to which loop was peeled. */ struct data_reference *unaligned_dr; @@ -217,79 +262,151 @@ int ptr_mask; /* The loop nest in which the data dependences are computed. */ - VEC (loop_p, heap) *loop_nest; - - /* All data references in the loop. */ - VEC (data_reference_p, heap) *datarefs; - - /* All data dependences in the loop. */ - VEC (ddr_p, heap) *ddrs; + auto_vec<loop_p> loop_nest; /* Data Dependence Relations defining address ranges that are candidates for a run-time aliasing check. */ - VEC (ddr_p, heap) *may_alias_ddrs; + auto_vec<ddr_p> may_alias_ddrs; + + /* Data Dependence Relations defining address ranges together with segment + lengths from which the run-time aliasing check is built. */ + auto_vec<dr_with_seg_len_pair_t> comp_alias_ddrs; + + /* Check that the addresses of each pair of objects is unequal. */ + auto_vec<vec_object_pair> check_unequal_addrs; /* Statements in the loop that have data references that are candidates for a runtime (loop versioning) misalignment check. */ - VEC(gimple,heap) *may_misalign_stmts; + auto_vec<gimple *> may_misalign_stmts; - /* All interleaving chains of stores in the loop, represented by the first + /* Reduction cycles detected in the loop. Used in loop-aware SLP. */ + auto_vec<gimple *> reductions; + + /* All reduction chains in the loop, represented by the first stmt in the chain. */ - VEC(gimple, heap) *strided_stores; + auto_vec<gimple *> reduction_chains; - /* All SLP instances in the loop. This is a subset of the set of STRIDED_STORES - of the loop. */ - VEC(slp_instance, heap) *slp_instances; + /* Cost vector for a single scalar iteration. */ + auto_vec<stmt_info_for_cost> scalar_cost_vec; /* The unrolling factor needed to SLP the loop. In case of that pure SLP is applied to the loop, i.e., no unrolling is needed, this is 1. */ unsigned slp_unrolling_factor; - /* Reduction cycles detected in the loop. Used in loop-aware SLP. */ - VEC (gimple, heap) *reductions; + /* Cost of a single scalar iteration. */ + int single_scalar_iteration_cost; + + /* Is the loop vectorizable? */ + bool vectorizable; + + /* When we have grouped data accesses with gaps, we may introduce invalid + memory accesses. We peel the last iteration of the loop to prevent + this. */ + bool peeling_for_gaps; + + /* When the number of iterations is not a multiple of the vector size + we need to peel off iterations at the end to form an epilogue loop. */ + bool peeling_for_niter; + + /* Reductions are canonicalized so that the last operand is the reduction + operand. If this places a constant into RHS1, this decanonicalizes + GIMPLE for other phases, so we must track when this has occurred and + fix it up. */ + bool operands_swapped; - /* Hash table used to choose the best peeling option. */ - htab_t peeling_htab; + /* True if there are no loop carried data dependencies in the loop. + If loop->safelen <= 1, then this is always true, either the loop + didn't have any loop carried data dependencies, or the loop is being + vectorized guarded with some runtime alias checks, or couldn't + be vectorized at all, but then this field shouldn't be used. + For loop->safelen >= 2, the user has asserted that there are no + backward dependencies, but there still could be loop carried forward + dependencies in such loops. This flag will be false if normal + vectorizer data dependency analysis would fail or require versioning + for alias, but because of loop->safelen >= 2 it has been vectorized + even without versioning for alias. E.g. in: + #pragma omp simd + for (int i = 0; i < m; i++) + a[i] = a[i + k] * c; + (or #pragma simd or #pragma ivdep) we can vectorize this and it will + DTRT even for k > 0 && k < m, but without safelen we would not + vectorize this, so this field would be false. */ + bool no_data_dependencies; + + /* Mark loops having masked stores. */ + bool has_mask_store; + + /* If if-conversion versioned this loop before conversion, this is the + loop version without if-conversion. */ + struct loop *scalar_loop; + + /* For loops being epilogues of already vectorized loops + this points to the original vectorized loop. Otherwise NULL. */ + _loop_vec_info *orig_loop_info; } *loop_vec_info; /* Access Functions. */ #define LOOP_VINFO_LOOP(L) (L)->loop #define LOOP_VINFO_BBS(L) (L)->bbs +#define LOOP_VINFO_NITERSM1(L) (L)->num_itersm1 #define LOOP_VINFO_NITERS(L) (L)->num_iters -/* Since LOOP_VINFO_NITERS can change after prologue peeling - retain total unchanged scalar loop iterations for cost model. */ +/* Since LOOP_VINFO_NITERS and LOOP_VINFO_NITERSM1 can change after + prologue peeling retain total unchanged scalar loop iterations for + cost model. */ #define LOOP_VINFO_NITERS_UNCHANGED(L) (L)->num_iters_unchanged -#define LOOP_VINFO_COST_MODEL_MIN_ITERS(L) (L)->min_profitable_iters +#define LOOP_VINFO_NITERS_ASSUMPTIONS(L) (L)->num_iters_assumptions +#define LOOP_VINFO_COST_MODEL_THRESHOLD(L) (L)->th #define LOOP_VINFO_VECTORIZABLE_P(L) (L)->vectorizable #define LOOP_VINFO_VECT_FACTOR(L) (L)->vectorization_factor +#define LOOP_VINFO_MAX_VECT_FACTOR(L) (L)->max_vectorization_factor #define LOOP_VINFO_PTR_MASK(L) (L)->ptr_mask #define LOOP_VINFO_LOOP_NEST(L) (L)->loop_nest #define LOOP_VINFO_DATAREFS(L) (L)->datarefs #define LOOP_VINFO_DDRS(L) (L)->ddrs #define LOOP_VINFO_INT_NITERS(L) (TREE_INT_CST_LOW ((L)->num_iters)) -#define LOOP_PEELING_FOR_ALIGNMENT(L) (L)->peeling_for_alignment +#define LOOP_VINFO_PEELING_FOR_ALIGNMENT(L) (L)->peeling_for_alignment #define LOOP_VINFO_UNALIGNED_DR(L) (L)->unaligned_dr #define LOOP_VINFO_MAY_MISALIGN_STMTS(L) (L)->may_misalign_stmts -#define LOOP_VINFO_LOC(L) (L)->loop_line_number #define LOOP_VINFO_MAY_ALIAS_DDRS(L) (L)->may_alias_ddrs -#define LOOP_VINFO_STRIDED_STORES(L) (L)->strided_stores +#define LOOP_VINFO_COMP_ALIAS_DDRS(L) (L)->comp_alias_ddrs +#define LOOP_VINFO_CHECK_UNEQUAL_ADDRS(L) (L)->check_unequal_addrs +#define LOOP_VINFO_GROUPED_STORES(L) (L)->grouped_stores #define LOOP_VINFO_SLP_INSTANCES(L) (L)->slp_instances #define LOOP_VINFO_SLP_UNROLLING_FACTOR(L) (L)->slp_unrolling_factor #define LOOP_VINFO_REDUCTIONS(L) (L)->reductions -#define LOOP_VINFO_PEELING_HTAB(L) (L)->peeling_htab +#define LOOP_VINFO_REDUCTION_CHAINS(L) (L)->reduction_chains +#define LOOP_VINFO_TARGET_COST_DATA(L) (L)->target_cost_data +#define LOOP_VINFO_PEELING_FOR_GAPS(L) (L)->peeling_for_gaps +#define LOOP_VINFO_OPERANDS_SWAPPED(L) (L)->operands_swapped +#define LOOP_VINFO_PEELING_FOR_NITER(L) (L)->peeling_for_niter +#define LOOP_VINFO_NO_DATA_DEPENDENCIES(L) (L)->no_data_dependencies +#define LOOP_VINFO_SCALAR_LOOP(L) (L)->scalar_loop +#define LOOP_VINFO_HAS_MASK_STORE(L) (L)->has_mask_store +#define LOOP_VINFO_SCALAR_ITERATION_COST(L) (L)->scalar_cost_vec +#define LOOP_VINFO_SINGLE_SCALAR_ITERATION_COST(L) (L)->single_scalar_iteration_cost +#define LOOP_VINFO_ORIG_LOOP_INFO(L) (L)->orig_loop_info -#define LOOP_REQUIRES_VERSIONING_FOR_ALIGNMENT(L) \ -VEC_length (gimple, (L)->may_misalign_stmts) > 0 -#define LOOP_REQUIRES_VERSIONING_FOR_ALIAS(L) \ -VEC_length (ddr_p, (L)->may_alias_ddrs) > 0 - -#define NITERS_KNOWN_P(n) \ -(host_integerp ((n),0) \ -&& TREE_INT_CST_LOW ((n)) > 0) +#define LOOP_REQUIRES_VERSIONING_FOR_ALIGNMENT(L) \ + ((L)->may_misalign_stmts.length () > 0) +#define LOOP_REQUIRES_VERSIONING_FOR_ALIAS(L) \ + ((L)->comp_alias_ddrs.length () > 0 \ + || (L)->check_unequal_addrs.length () > 0) +#define LOOP_REQUIRES_VERSIONING_FOR_NITERS(L) \ + (LOOP_VINFO_NITERS_ASSUMPTIONS (L)) +#define LOOP_REQUIRES_VERSIONING(L) \ + (LOOP_REQUIRES_VERSIONING_FOR_ALIGNMENT (L) \ + || LOOP_REQUIRES_VERSIONING_FOR_ALIAS (L) \ + || LOOP_REQUIRES_VERSIONING_FOR_NITERS (L)) #define LOOP_VINFO_NITERS_KNOWN_P(L) \ -NITERS_KNOWN_P((L)->num_iters) + (tree_fits_shwi_p ((L)->num_iters) && tree_to_shwi ((L)->num_iters) > 0) + +#define LOOP_VINFO_EPILOGUE_P(L) \ + (LOOP_VINFO_ORIG_LOOP_INFO (L) != NULL) + +#define LOOP_VINFO_ORIG_MAX_VECT_FACTOR(L) \ + (LOOP_VINFO_MAX_VECT_FACTOR (LOOP_VINFO_ORIG_LOOP_INFO (L))) static inline loop_vec_info loop_vec_info_for_loop (struct loop *loop) @@ -298,35 +415,28 @@ } static inline bool -nested_in_vect_loop_p (struct loop *loop, gimple stmt) +nested_in_vect_loop_p (struct loop *loop, gimple *stmt) { return (loop->inner && (loop->inner == (gimple_bb (stmt))->loop_father)); } -typedef struct _bb_vec_info { +typedef struct _bb_vec_info : public vec_info +{ + _bb_vec_info (gimple_stmt_iterator, gimple_stmt_iterator); + ~_bb_vec_info (); basic_block bb; - /* All interleaving chains of stores in the basic block, represented by the - first stmt in the chain. */ - VEC(gimple, heap) *strided_stores; - - /* All SLP instances in the basic block. This is a subset of the set of - STRIDED_STORES of the basic block. */ - VEC(slp_instance, heap) *slp_instances; - - /* All data references in the basic block. */ - VEC (data_reference_p, heap) *datarefs; - - /* All data dependences in the basic block. */ - VEC (ddr_p, heap) *ddrs; + gimple_stmt_iterator region_begin; + gimple_stmt_iterator region_end; } *bb_vec_info; -#define BB_VINFO_BB(B) (B)->bb -#define BB_VINFO_STRIDED_STORES(B) (B)->strided_stores -#define BB_VINFO_SLP_INSTANCES(B) (B)->slp_instances -#define BB_VINFO_DATAREFS(B) (B)->datarefs -#define BB_VINFO_DDRS(B) (B)->ddrs +#define BB_VINFO_BB(B) (B)->bb +#define BB_VINFO_GROUPED_STORES(B) (B)->grouped_stores +#define BB_VINFO_SLP_INSTANCES(B) (B)->slp_instances +#define BB_VINFO_DATAREFS(B) (B)->datarefs +#define BB_VINFO_DDRS(B) (B)->ddrs +#define BB_VINFO_TARGET_COST_DATA(B) (B)->target_cost_data static inline bb_vec_info vec_info_for_bb (basic_block bb) @@ -344,8 +454,10 @@ shift_vec_info_type, op_vec_info_type, call_vec_info_type, + call_simd_clone_vec_info_type, assignment_vec_info_type, condition_vec_info_type, + comparison_vec_info_type, reduc_vec_info_type, induc_vec_info_type, type_promotion_vec_info_type, @@ -358,6 +470,9 @@ block. */ enum vect_relevant { vect_unused_in_scope = 0, + + /* The def is only used outside the loop. */ + vect_used_only_live, /* The def is in the inner loop, and the use is in the outer loop, and the use is a reduction stmt. */ vect_used_in_outer_by_reduction, @@ -398,10 +513,47 @@ hybrid }; +/* Describes how we're going to vectorize an individual load or store, + or a group of loads or stores. */ +enum vect_memory_access_type { + /* An access to an invariant address. This is used only for loads. */ + VMAT_INVARIANT, + + /* A simple contiguous access. */ + VMAT_CONTIGUOUS, + + /* A contiguous access that goes down in memory rather than up, + with no additional permutation. This is used only for stores + of invariants. */ + VMAT_CONTIGUOUS_DOWN, + + /* A simple contiguous access in which the elements need to be permuted + after loading or before storing. Only used for loop vectorization; + SLP uses separate permutes. */ + VMAT_CONTIGUOUS_PERMUTE, + + /* A simple contiguous access in which the elements need to be reversed + after loading or before storing. */ + VMAT_CONTIGUOUS_REVERSE, + + /* An access that uses IFN_LOAD_LANES or IFN_STORE_LANES. */ + VMAT_LOAD_STORE_LANES, + + /* An access in which each scalar element is loaded or stored + individually. */ + VMAT_ELEMENTWISE, + + /* A hybrid of VMAT_CONTIGUOUS and VMAT_ELEMENTWISE, used for grouped + SLP accesses. Each unrolled iteration uses a contiguous load + or store for the whole group, but the groups from separate iterations + are combined in the same way as for VMAT_ELEMENTWISE. */ + VMAT_STRIDED_SLP, + + /* The access uses gather loads or scatter stores. */ + VMAT_GATHER_SCATTER +}; typedef struct data_reference *dr_p; -DEF_VEC_P(dr_p); -DEF_VEC_ALLOC_P(dr_p,heap); typedef struct _stmt_vec_info { @@ -414,26 +566,26 @@ /* Stmt is part of some pattern (computation idiom) */ bool in_pattern_p; - /* For loads only, if there is a store with the same location, this field is - TRUE. */ - bool read_write_dep; + /* Is this statement vectorizable or should it be skipped in (partial) + vectorization. */ + bool vectorizable; /* The stmt to which this info struct refers to. */ - gimple stmt; + gimple *stmt; - /* The loop_vec_info with respect to which STMT is vectorized. */ - loop_vec_info loop_vinfo; + /* The vec_info with respect to which STMT is vectorized. */ + vec_info *vinfo; /* The vector type to be used for the LHS of this statement. */ tree vectype; /* The vectorized version of the stmt. */ - gimple vectorized_stmt; + gimple *vectorized_stmt; - /** The following is relevant only for stmts that contain a non-scalar + /* The following is relevant only for stmts that contain a non-scalar data-ref (array/pointer/struct access). A GIMPLE stmt is expected to have - at most one such data-ref. **/ + at most one such data-ref. */ /* Information about the data-ref (access function, etc), relative to the inner-most containing loop. */ @@ -441,11 +593,16 @@ /* Information about the data-ref relative to this loop nest (the loop that is being considered for vectorization). */ - tree dr_base_address; - tree dr_init; - tree dr_offset; - tree dr_step; - tree dr_aligned_to; + innermost_loop_behavior dr_wrt_vec_loop; + + /* For loop PHI nodes, the base and evolution part of it. This makes sure + this information is still available in vect_update_ivs_after_vectorizer + where we may not be able to re-analyze the PHI nodes evolution as + peeling for the prologue loop can make it unanalyzable. The evolution + part is still correct after peeling, but the base may have changed from + the version here. */ + tree loop_phi_evolution_base_unchanged; + tree loop_phi_evolution_part; /* Used for various bookkeeping purposes, generally holding a pointer to some other stmt S that is in some way "related" to this stmt. @@ -456,11 +613,19 @@ related_stmt of the "pattern stmt" points back to this stmt (which is the last stmt in the original sequence of stmts that constitutes the pattern). */ - gimple related_stmt; + gimple *related_stmt; + + /* Used to keep a sequence of def stmts of a pattern stmt if such exists. */ + gimple_seq pattern_def_seq; /* List of datarefs that are known to have the same alignment as the dataref of this stmt. */ - VEC(dr_p,heap) *same_align_refs; + vec<dr_p> same_align_refs; + + /* Selected SIMD clone's function info. First vector element + is SIMD clone's function decl, followed by a pair of trees (base + step) + for linear arguments (pair of NULLs for other arguments). */ + vec<tree> simd_clone_info; /* Classify the def of this stmt. */ enum vect_def_type def_type; @@ -468,15 +633,15 @@ /* Whether the stmt is SLPed, loop-based vectorized, or both. */ enum slp_vect_type slp_type; - /* Interleaving info. */ - /* First data-ref in the interleaving group. */ - gimple first_dr; - /* Pointer to the next data-ref in the group. */ - gimple next_dr; - /* In case that two or more stmts share data-ref, this is the pointer to the - previously detected stmt with the same dr. */ - gimple same_dr_stmt; - /* The size of the interleaving group. */ + /* Interleaving and reduction chains info. */ + /* First element in the group. */ + gimple *first_element; + /* Pointer to the next element in the group. */ + gimple *next_element; + /* For data-refs, in case that two or more stmts share data-ref, this is the + pointer to the previously detected stmt with the same dr. */ + gimple *same_dr_stmt; + /* The size of the group. */ unsigned int size; /* For stores, number of stores from this group seen. We vectorize the last one. */ @@ -485,88 +650,180 @@ is 1. */ unsigned int gap; + /* The minimum negative dependence distance this stmt participates in + or zero if none. */ + unsigned int min_neg_dist; + /* Not all stmts in the loop need to be vectorized. e.g, the increment of the loop induction variable and computation of array indexes. relevant indicates whether the stmt needs to be vectorized. */ enum vect_relevant relevant; - /* Vectorization costs associated with statement. */ - struct - { - int outside_of_loop; /* Statements generated outside loop. */ - int inside_of_loop; /* Statements generated inside loop. */ - } cost; + /* For loads if this is a gather, for stores if this is a scatter. */ + bool gather_scatter_p; + + /* True if this is an access with loop-invariant stride. */ + bool strided_p; + + /* For both loads and stores. */ + bool simd_lane_access_p; + + /* Classifies how the load or store is going to be implemented + for loop vectorization. */ + vect_memory_access_type memory_access_type; + + /* For reduction loops, this is the type of reduction. */ + enum vect_reduction_type v_reduc_type; + + /* For CONST_COND_REDUCTION, record the reduc code. */ + enum tree_code const_cond_reduc_code; + + /* On a reduction PHI the reduction type as detected by + vect_force_simple_reduction. */ + enum vect_reduction_type reduc_type; - /* The bb_vec_info with respect to which STMT is vectorized. */ - bb_vec_info bb_vinfo; + /* On a reduction PHI the def returned by vect_force_simple_reduction. + On the def returned by vect_force_simple_reduction the + corresponding PHI. */ + gimple *reduc_def; + + /* The number of scalar stmt references from active SLP instances. */ + unsigned int num_slp_uses; +} *stmt_vec_info; + +/* Information about a gather/scatter call. */ +struct gather_scatter_info { + /* The FUNCTION_DECL for the built-in gather/scatter function. */ + tree decl; - /* Is this statement vectorizable or should it be skipped in (partial) - vectorization. */ - bool vectorizable; -} *stmt_vec_info; + /* The loop-invariant base value. */ + tree base; + + /* The original scalar offset, which is a non-loop-invariant SSA_NAME. */ + tree offset; + + /* Each offset element should be multiplied by this amount before + being added to the base. */ + int scale; + + /* The definition type for the vectorized offset. */ + enum vect_def_type offset_dt; + + /* The type of the vectorized offset. */ + tree offset_vectype; +}; /* Access Functions. */ #define STMT_VINFO_TYPE(S) (S)->type #define STMT_VINFO_STMT(S) (S)->stmt -#define STMT_VINFO_LOOP_VINFO(S) (S)->loop_vinfo -#define STMT_VINFO_BB_VINFO(S) (S)->bb_vinfo +inline loop_vec_info +STMT_VINFO_LOOP_VINFO (stmt_vec_info stmt_vinfo) +{ + if (loop_vec_info loop_vinfo = dyn_cast <loop_vec_info> (stmt_vinfo->vinfo)) + return loop_vinfo; + return NULL; +} +inline bb_vec_info +STMT_VINFO_BB_VINFO (stmt_vec_info stmt_vinfo) +{ + if (bb_vec_info bb_vinfo = dyn_cast <bb_vec_info> (stmt_vinfo->vinfo)) + return bb_vinfo; + return NULL; +} #define STMT_VINFO_RELEVANT(S) (S)->relevant #define STMT_VINFO_LIVE_P(S) (S)->live #define STMT_VINFO_VECTYPE(S) (S)->vectype #define STMT_VINFO_VEC_STMT(S) (S)->vectorized_stmt #define STMT_VINFO_VECTORIZABLE(S) (S)->vectorizable #define STMT_VINFO_DATA_REF(S) (S)->data_ref_info +#define STMT_VINFO_GATHER_SCATTER_P(S) (S)->gather_scatter_p +#define STMT_VINFO_STRIDED_P(S) (S)->strided_p +#define STMT_VINFO_MEMORY_ACCESS_TYPE(S) (S)->memory_access_type +#define STMT_VINFO_SIMD_LANE_ACCESS_P(S) (S)->simd_lane_access_p +#define STMT_VINFO_VEC_REDUCTION_TYPE(S) (S)->v_reduc_type +#define STMT_VINFO_VEC_CONST_COND_REDUC_CODE(S) (S)->const_cond_reduc_code -#define STMT_VINFO_DR_BASE_ADDRESS(S) (S)->dr_base_address -#define STMT_VINFO_DR_INIT(S) (S)->dr_init -#define STMT_VINFO_DR_OFFSET(S) (S)->dr_offset -#define STMT_VINFO_DR_STEP(S) (S)->dr_step -#define STMT_VINFO_DR_ALIGNED_TO(S) (S)->dr_aligned_to +#define STMT_VINFO_DR_WRT_VEC_LOOP(S) (S)->dr_wrt_vec_loop +#define STMT_VINFO_DR_BASE_ADDRESS(S) (S)->dr_wrt_vec_loop.base_address +#define STMT_VINFO_DR_INIT(S) (S)->dr_wrt_vec_loop.init +#define STMT_VINFO_DR_OFFSET(S) (S)->dr_wrt_vec_loop.offset +#define STMT_VINFO_DR_STEP(S) (S)->dr_wrt_vec_loop.step +#define STMT_VINFO_DR_BASE_ALIGNMENT(S) (S)->dr_wrt_vec_loop.base_alignment +#define STMT_VINFO_DR_BASE_MISALIGNMENT(S) \ + (S)->dr_wrt_vec_loop.base_misalignment +#define STMT_VINFO_DR_OFFSET_ALIGNMENT(S) \ + (S)->dr_wrt_vec_loop.offset_alignment +#define STMT_VINFO_DR_STEP_ALIGNMENT(S) \ + (S)->dr_wrt_vec_loop.step_alignment #define STMT_VINFO_IN_PATTERN_P(S) (S)->in_pattern_p #define STMT_VINFO_RELATED_STMT(S) (S)->related_stmt +#define STMT_VINFO_PATTERN_DEF_SEQ(S) (S)->pattern_def_seq #define STMT_VINFO_SAME_ALIGN_REFS(S) (S)->same_align_refs +#define STMT_VINFO_SIMD_CLONE_INFO(S) (S)->simd_clone_info #define STMT_VINFO_DEF_TYPE(S) (S)->def_type -#define STMT_VINFO_DR_GROUP_FIRST_DR(S) (S)->first_dr -#define STMT_VINFO_DR_GROUP_NEXT_DR(S) (S)->next_dr -#define STMT_VINFO_DR_GROUP_SIZE(S) (S)->size -#define STMT_VINFO_DR_GROUP_STORE_COUNT(S) (S)->store_count -#define STMT_VINFO_DR_GROUP_GAP(S) (S)->gap -#define STMT_VINFO_DR_GROUP_SAME_DR_STMT(S)(S)->same_dr_stmt -#define STMT_VINFO_DR_GROUP_READ_WRITE_DEPENDENCE(S) (S)->read_write_dep -#define STMT_VINFO_STRIDED_ACCESS(S) ((S)->first_dr != NULL) +#define STMT_VINFO_GROUP_FIRST_ELEMENT(S) (S)->first_element +#define STMT_VINFO_GROUP_NEXT_ELEMENT(S) (S)->next_element +#define STMT_VINFO_GROUP_SIZE(S) (S)->size +#define STMT_VINFO_GROUP_STORE_COUNT(S) (S)->store_count +#define STMT_VINFO_GROUP_GAP(S) (S)->gap +#define STMT_VINFO_GROUP_SAME_DR_STMT(S) (S)->same_dr_stmt +#define STMT_VINFO_GROUPED_ACCESS(S) ((S)->first_element != NULL && (S)->data_ref_info) +#define STMT_VINFO_LOOP_PHI_EVOLUTION_BASE_UNCHANGED(S) (S)->loop_phi_evolution_base_unchanged +#define STMT_VINFO_LOOP_PHI_EVOLUTION_PART(S) (S)->loop_phi_evolution_part +#define STMT_VINFO_MIN_NEG_DIST(S) (S)->min_neg_dist +#define STMT_VINFO_NUM_SLP_USES(S) (S)->num_slp_uses +#define STMT_VINFO_REDUC_TYPE(S) (S)->reduc_type +#define STMT_VINFO_REDUC_DEF(S) (S)->reduc_def -#define DR_GROUP_FIRST_DR(S) (S)->first_dr -#define DR_GROUP_NEXT_DR(S) (S)->next_dr -#define DR_GROUP_SIZE(S) (S)->size -#define DR_GROUP_STORE_COUNT(S) (S)->store_count -#define DR_GROUP_GAP(S) (S)->gap -#define DR_GROUP_SAME_DR_STMT(S) (S)->same_dr_stmt -#define DR_GROUP_READ_WRITE_DEPENDENCE(S) (S)->read_write_dep +#define GROUP_FIRST_ELEMENT(S) (S)->first_element +#define GROUP_NEXT_ELEMENT(S) (S)->next_element +#define GROUP_SIZE(S) (S)->size +#define GROUP_STORE_COUNT(S) (S)->store_count +#define GROUP_GAP(S) (S)->gap +#define GROUP_SAME_DR_STMT(S) (S)->same_dr_stmt #define STMT_VINFO_RELEVANT_P(S) ((S)->relevant != vect_unused_in_scope) -#define STMT_VINFO_OUTSIDE_OF_LOOP_COST(S) (S)->cost.outside_of_loop -#define STMT_VINFO_INSIDE_OF_LOOP_COST(S) (S)->cost.inside_of_loop #define HYBRID_SLP_STMT(S) ((S)->slp_type == hybrid) #define PURE_SLP_STMT(S) ((S)->slp_type == pure_slp) #define STMT_SLP_TYPE(S) (S)->slp_type +struct dataref_aux { + /* The misalignment in bytes of the reference, or -1 if not known. */ + int misalignment; + /* The byte alignment that we'd ideally like the reference to have, + and the value that misalignment is measured against. */ + int target_alignment; + /* If true the alignment of base_decl needs to be increased. */ + bool base_misaligned; + tree base_decl; +}; + +#define DR_VECT_AUX(dr) ((dataref_aux *)(dr)->aux) + #define VECT_MAX_COST 1000 /* The maximum number of intermediate steps required in multi-step type conversion. */ #define MAX_INTERM_CVT_STEPS 3 -/* The maximum vectorization factor supported by any target (V32QI). */ -#define MAX_VECTORIZATION_FACTOR 32 +/* The maximum vectorization factor supported by any target (V64QI). */ +#define MAX_VECTORIZATION_FACTOR 64 + +/* Nonzero if TYPE represents a (scalar) boolean type or type + in the middle-end compatible with it (unsigned precision 1 integral + types). Used to determine which types should be vectorized as + VECTOR_BOOLEAN_TYPE_P. */ -/* Avoid GTY(()) on stmt_vec_info. */ -typedef void *vec_void_p; -DEF_VEC_P (vec_void_p); -DEF_VEC_ALLOC_P (vec_void_p, heap); +#define VECT_SCALAR_BOOLEAN_TYPE_P(TYPE) \ + (TREE_CODE (TYPE) == BOOLEAN_TYPE \ + || ((TREE_CODE (TYPE) == INTEGER_TYPE \ + || TREE_CODE (TYPE) == ENUMERAL_TYPE) \ + && TYPE_PRECISION (TYPE) == 1 \ + && TYPE_UNSIGNED (TYPE))) -extern VEC(vec_void_p,heap) *stmt_vec_info_vec; +extern vec<stmt_vec_info> stmt_vec_info_vec; void init_stmt_vec_info_vec (void); void free_stmt_vec_info_vec (void); @@ -574,36 +831,39 @@ /* Return a stmt_vec_info corresponding to STMT. */ static inline stmt_vec_info -vinfo_for_stmt (gimple stmt) +vinfo_for_stmt (gimple *stmt) { - unsigned int uid = gimple_uid (stmt); - if (uid == 0) + int uid = gimple_uid (stmt); + if (uid <= 0) return NULL; - return (stmt_vec_info) VEC_index (vec_void_p, stmt_vec_info_vec, uid - 1); + return stmt_vec_info_vec[uid - 1]; } /* Set vectorizer information INFO for STMT. */ static inline void -set_vinfo_for_stmt (gimple stmt, stmt_vec_info info) +set_vinfo_for_stmt (gimple *stmt, stmt_vec_info info) { unsigned int uid = gimple_uid (stmt); if (uid == 0) { gcc_checking_assert (info); - uid = VEC_length (vec_void_p, stmt_vec_info_vec) + 1; + uid = stmt_vec_info_vec.length () + 1; gimple_set_uid (stmt, uid); - VEC_safe_push (vec_void_p, heap, stmt_vec_info_vec, (vec_void_p) info); + stmt_vec_info_vec.safe_push (info); } else - VEC_replace (vec_void_p, stmt_vec_info_vec, uid - 1, (vec_void_p) info); + { + gcc_checking_assert (info == NULL); + stmt_vec_info_vec[uid - 1] = info; + } } /* Return the earlier statement between STMT1 and STMT2. */ -static inline gimple -get_earlier_stmt (gimple stmt1, gimple stmt2) +static inline gimple * +get_earlier_stmt (gimple *stmt1, gimple *stmt2) { unsigned int uid1, uid2; @@ -619,8 +879,8 @@ if (uid1 == 0 || uid2 == 0) return NULL; - gcc_checking_assert (uid1 <= VEC_length (vec_void_p, stmt_vec_info_vec) - && uid2 <= VEC_length (vec_void_p, stmt_vec_info_vec)); + gcc_checking_assert (uid1 <= stmt_vec_info_vec.length () + && uid2 <= stmt_vec_info_vec.length ()); if (uid1 < uid2) return stmt1; @@ -630,8 +890,8 @@ /* Return the later statement between STMT1 and STMT2. */ -static inline gimple -get_later_stmt (gimple stmt1, gimple stmt2) +static inline gimple * +get_later_stmt (gimple *stmt1, gimple *stmt2) { unsigned int uid1, uid2; @@ -647,8 +907,8 @@ if (uid1 == 0 || uid2 == 0) return NULL; - gcc_assert (uid1 <= VEC_length (vec_void_p, stmt_vec_info_vec)); - gcc_assert (uid2 <= VEC_length (vec_void_p, stmt_vec_info_vec)); + gcc_assert (uid1 <= stmt_vec_info_vec.length ()); + gcc_assert (uid2 <= stmt_vec_info_vec.length ()); if (uid1 > uid2) return stmt1; @@ -662,7 +922,7 @@ static inline bool is_pattern_stmt_p (stmt_vec_info stmt_info) { - gimple related_stmt; + gimple *related_stmt; stmt_vec_info related_stmt_info; related_stmt = STMT_VINFO_RELATED_STMT (stmt_info); @@ -685,30 +945,6 @@ return false; } -/* Set inside loop vectorization cost. */ - -static inline void -stmt_vinfo_set_inside_of_loop_cost (stmt_vec_info stmt_info, slp_tree slp_node, - int cost) -{ - if (slp_node) - SLP_TREE_INSIDE_OF_LOOP_COST (slp_node) = cost; - else - STMT_VINFO_INSIDE_OF_LOOP_COST (stmt_info) = cost; -} - -/* Set inside loop vectorization cost. */ - -static inline void -stmt_vinfo_set_outside_of_loop_cost (stmt_vec_info stmt_info, slp_tree slp_node, - int cost) -{ - if (slp_node) - SLP_TREE_OUTSIDE_OF_LOOP_COST (slp_node) = cost; - else - STMT_VINFO_OUTSIDE_OF_LOOP_COST (stmt_info) = cost; -} - /* Return pow2 (X). */ static inline int @@ -722,16 +958,94 @@ return res; } +/* Alias targetm.vectorize.builtin_vectorization_cost. */ + +static inline int +builtin_vectorization_cost (enum vect_cost_for_stmt type_of_cost, + tree vectype, int misalign) +{ + return targetm.vectorize.builtin_vectorization_cost (type_of_cost, + vectype, misalign); +} + +/* Get cost by calling cost target builtin. */ + +static inline +int vect_get_stmt_cost (enum vect_cost_for_stmt type_of_cost) +{ + return builtin_vectorization_cost (type_of_cost, NULL, 0); +} + +/* Alias targetm.vectorize.init_cost. */ + +static inline void * +init_cost (struct loop *loop_info) +{ + return targetm.vectorize.init_cost (loop_info); +} + +/* Alias targetm.vectorize.add_stmt_cost. */ + +static inline unsigned +add_stmt_cost (void *data, int count, enum vect_cost_for_stmt kind, + stmt_vec_info stmt_info, int misalign, + enum vect_cost_model_location where) +{ + return targetm.vectorize.add_stmt_cost (data, count, kind, + stmt_info, misalign, where); +} + +/* Alias targetm.vectorize.finish_cost. */ + +static inline void +finish_cost (void *data, unsigned *prologue_cost, + unsigned *body_cost, unsigned *epilogue_cost) +{ + targetm.vectorize.finish_cost (data, prologue_cost, body_cost, epilogue_cost); +} + +/* Alias targetm.vectorize.destroy_cost_data. */ + +static inline void +destroy_cost_data (void *data) +{ + targetm.vectorize.destroy_cost_data (data); +} + /*-----------------------------------------------------------------*/ /* Info on data references alignment. */ /*-----------------------------------------------------------------*/ +inline void +set_dr_misalignment (struct data_reference *dr, int val) +{ + dataref_aux *data_aux = DR_VECT_AUX (dr); + + if (!data_aux) + { + data_aux = XCNEW (dataref_aux); + dr->aux = data_aux; + } + + data_aux->misalignment = val; +} + +inline int +dr_misalignment (struct data_reference *dr) +{ + return DR_VECT_AUX (dr)->misalignment; +} /* Reflects actual alignment of first access in the vectorized loop, taking into account peeling/versioning if applied. */ -#define DR_MISALIGNMENT(DR) ((int) (size_t) (DR)->aux) -#define SET_DR_MISALIGNMENT(DR, VAL) ((DR)->aux = (void *) (size_t) (VAL)) +#define DR_MISALIGNMENT(DR) dr_misalignment (DR) +#define SET_DR_MISALIGNMENT(DR, VAL) set_dr_misalignment (DR, VAL) +#define DR_MISALIGNMENT_UNKNOWN (-1) -/* Return TRUE if the data access is aligned, and FALSE otherwise. */ +/* Only defined once DR_MISALIGNMENT is defined. */ +#define DR_TARGET_ALIGNMENT(DR) DR_VECT_AUX (DR)->target_alignment + +/* Return true if data access DR is aligned to its target alignment + (which may be less than a full vector). */ static inline bool aligned_access_p (struct data_reference *data_ref_info) @@ -745,12 +1059,78 @@ static inline bool known_alignment_for_access_p (struct data_reference *data_ref_info) { - return (DR_MISALIGNMENT (data_ref_info) != -1); + return (DR_MISALIGNMENT (data_ref_info) != DR_MISALIGNMENT_UNKNOWN); +} + +/* Return the minimum alignment in bytes that the vectorized version + of DR is guaranteed to have. */ + +static inline unsigned int +vect_known_alignment_in_bytes (struct data_reference *dr) +{ + if (DR_MISALIGNMENT (dr) == DR_MISALIGNMENT_UNKNOWN) + return TYPE_ALIGN_UNIT (TREE_TYPE (DR_REF (dr))); + if (DR_MISALIGNMENT (dr) == 0) + return DR_TARGET_ALIGNMENT (dr); + return DR_MISALIGNMENT (dr) & -DR_MISALIGNMENT (dr); +} + +/* Return the behavior of DR with respect to the vectorization context + (which for outer loop vectorization might not be the behavior recorded + in DR itself). */ + +static inline innermost_loop_behavior * +vect_dr_behavior (data_reference *dr) +{ + gimple *stmt = DR_STMT (dr); + stmt_vec_info stmt_info = vinfo_for_stmt (stmt); + loop_vec_info loop_vinfo = STMT_VINFO_LOOP_VINFO (stmt_info); + if (loop_vinfo == NULL + || !nested_in_vect_loop_p (LOOP_VINFO_LOOP (loop_vinfo), stmt)) + return &DR_INNERMOST (dr); + else + return &STMT_VINFO_DR_WRT_VEC_LOOP (stmt_info); } -/* vect_dump will be set to stderr or dump_file if exist. */ -extern FILE *vect_dump; -extern LOC vect_loop_location; +/* Return true if the vect cost model is unlimited. */ +static inline bool +unlimited_cost_model (loop_p loop) +{ + if (loop != NULL && loop->force_vectorize + && flag_simd_cost_model != VECT_COST_MODEL_DEFAULT) + return flag_simd_cost_model == VECT_COST_MODEL_UNLIMITED; + return (flag_vect_cost_model == VECT_COST_MODEL_UNLIMITED); +} + +/* Return the number of copies needed for loop vectorization when + a statement operates on vectors of type VECTYPE. This is the + vectorization factor divided by the number of elements in + VECTYPE and is always known at compile time. */ + +static inline unsigned int +vect_get_num_copies (loop_vec_info loop_vinfo, tree vectype) +{ + gcc_checking_assert (LOOP_VINFO_VECT_FACTOR (loop_vinfo) + % TYPE_VECTOR_SUBPARTS (vectype) == 0); + return (LOOP_VINFO_VECT_FACTOR (loop_vinfo) + / TYPE_VECTOR_SUBPARTS (vectype)); +} + +/* Return the size of the value accessed by unvectorized data reference DR. + This is only valid once STMT_VINFO_VECTYPE has been calculated for the + associated gimple statement, since that guarantees that DR accesses + either a scalar or a scalar equivalent. ("Scalar equivalent" here + includes things like V1SI, which can be vectorized in the same way + as a plain SI.) */ + +inline unsigned int +vect_get_scalar_dr_size (struct data_reference *dr) +{ + return tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (DR_REF (dr)))); +} + +/* Source location */ +extern source_location vect_location; /*-----------------------------------------------------------------*/ /* Function prototypes. */ @@ -760,136 +1140,167 @@ in tree-vect-loop-manip.c. */ extern void slpeel_make_loop_iterate_ntimes (struct loop *, tree); extern bool slpeel_can_duplicate_loop_p (const struct loop *, const_edge); -extern void vect_loop_versioning (loop_vec_info, bool, tree *, gimple_seq *); -extern void vect_do_peeling_for_loop_bound (loop_vec_info, tree *, - tree, gimple_seq); -extern void vect_do_peeling_for_alignment (loop_vec_info); -extern LOC find_loop_location (struct loop *); +struct loop *slpeel_tree_duplicate_loop_to_edge_cfg (struct loop *, + struct loop *, edge); +extern void vect_loop_versioning (loop_vec_info, unsigned int, bool); +extern struct loop *vect_do_peeling (loop_vec_info, tree, tree, + tree *, int, bool, bool); +extern source_location find_loop_location (struct loop *); extern bool vect_can_advance_ivs_p (loop_vec_info); /* In tree-vect-stmts.c. */ extern unsigned int current_vector_size; extern tree get_vectype_for_scalar_type (tree); +extern tree get_mask_type_for_scalar_type (tree); extern tree get_same_sized_vectype (tree, tree); -extern bool vect_is_simple_use (tree, loop_vec_info, bb_vec_info, gimple *, - tree *, enum vect_def_type *); -extern bool vect_is_simple_use_1 (tree, loop_vec_info, bb_vec_info, gimple *, - tree *, enum vect_def_type *, tree *); -extern bool supportable_widening_operation (enum tree_code, gimple, tree, tree, - tree *, tree *, enum tree_code *, - enum tree_code *, int *, - VEC (tree, heap) **); +extern bool vect_is_simple_use (tree, vec_info *, gimple **, + enum vect_def_type *); +extern bool vect_is_simple_use (tree, vec_info *, gimple **, + enum vect_def_type *, tree *); +extern bool supportable_widening_operation (enum tree_code, gimple *, tree, + tree, enum tree_code *, + enum tree_code *, int *, + vec<tree> *); extern bool supportable_narrowing_operation (enum tree_code, tree, tree, enum tree_code *, - int *, VEC (tree, heap) **); -extern stmt_vec_info new_stmt_vec_info (gimple stmt, loop_vec_info, - bb_vec_info); -extern void free_stmt_vec_info (gimple stmt); -extern tree vectorizable_function (gimple, tree, tree); + int *, vec<tree> *); +extern stmt_vec_info new_stmt_vec_info (gimple *stmt, vec_info *); +extern void free_stmt_vec_info (gimple *stmt); extern void vect_model_simple_cost (stmt_vec_info, int, enum vect_def_type *, - slp_tree); -extern void vect_model_store_cost (stmt_vec_info, int, enum vect_def_type, - slp_tree); -extern void vect_model_load_cost (stmt_vec_info, int, slp_tree); -extern void vect_finish_stmt_generation (gimple, gimple, + int, stmt_vector_for_cost *, + stmt_vector_for_cost *); +extern void vect_model_store_cost (stmt_vec_info, int, vect_memory_access_type, + enum vect_def_type, slp_tree, + stmt_vector_for_cost *, + stmt_vector_for_cost *); +extern void vect_model_load_cost (stmt_vec_info, int, vect_memory_access_type, + slp_tree, stmt_vector_for_cost *, + stmt_vector_for_cost *); +extern unsigned record_stmt_cost (stmt_vector_for_cost *, int, + enum vect_cost_for_stmt, stmt_vec_info, + int, enum vect_cost_model_location); +extern void vect_finish_stmt_generation (gimple *, gimple *, gimple_stmt_iterator *); extern bool vect_mark_stmts_to_be_vectorized (loop_vec_info); -extern int cost_for_stmt (gimple); -extern tree vect_get_vec_def_for_operand (tree, gimple, tree *); -extern tree vect_init_vector (gimple, tree, tree, +extern tree vect_get_vec_def_for_operand_1 (gimple *, enum vect_def_type); +extern tree vect_get_vec_def_for_operand (tree, gimple *, tree = NULL); +extern void vect_get_vec_defs (tree, tree, gimple *, vec<tree> *, + vec<tree> *, slp_tree); +extern void vect_get_vec_defs_for_stmt_copy (enum vect_def_type *, + vec<tree> *, vec<tree> *); +extern tree vect_init_vector (gimple *, tree, tree, gimple_stmt_iterator *); extern tree vect_get_vec_def_for_stmt_copy (enum vect_def_type, tree); -extern bool vect_transform_stmt (gimple, gimple_stmt_iterator *, +extern bool vect_transform_stmt (gimple *, gimple_stmt_iterator *, bool *, slp_tree, slp_instance); -extern void vect_remove_stores (gimple); -extern bool vect_analyze_stmt (gimple, bool *, slp_tree); -extern bool vectorizable_condition (gimple, gimple_stmt_iterator *, gimple *, - tree, int); +extern void vect_remove_stores (gimple *); +extern bool vect_analyze_stmt (gimple *, bool *, slp_tree, slp_instance); +extern bool vectorizable_condition (gimple *, gimple_stmt_iterator *, + gimple **, tree, int, slp_tree); extern void vect_get_load_cost (struct data_reference *, int, bool, - unsigned int *, unsigned int *); -extern void vect_get_store_cost (struct data_reference *, int, unsigned int *); + unsigned int *, unsigned int *, + stmt_vector_for_cost *, + stmt_vector_for_cost *, bool); +extern void vect_get_store_cost (struct data_reference *, int, + unsigned int *, stmt_vector_for_cost *); +extern bool vect_supportable_shift (enum tree_code, tree); +extern tree vect_gen_perm_mask_any (tree, vec_perm_indices); +extern tree vect_gen_perm_mask_checked (tree, vec_perm_indices); +extern void optimize_mask_stores (struct loop*); /* In tree-vect-data-refs.c. */ extern bool vect_can_force_dr_alignment_p (const_tree, unsigned int); extern enum dr_alignment_support vect_supportable_dr_alignment (struct data_reference *, bool); -extern tree vect_get_smallest_scalar_type (gimple, HOST_WIDE_INT *, +extern tree vect_get_smallest_scalar_type (gimple *, HOST_WIDE_INT *, HOST_WIDE_INT *); -extern bool vect_analyze_data_ref_dependences (loop_vec_info, bb_vec_info, - int *, bool *); +extern bool vect_analyze_data_ref_dependences (loop_vec_info, int *); +extern bool vect_slp_analyze_instance_dependence (slp_instance); extern bool vect_enhance_data_refs_alignment (loop_vec_info); -extern bool vect_analyze_data_refs_alignment (loop_vec_info, bb_vec_info); -extern bool vect_verify_datarefs_alignment (loop_vec_info, bb_vec_info); -extern bool vect_analyze_data_ref_accesses (loop_vec_info, bb_vec_info); +extern bool vect_analyze_data_refs_alignment (loop_vec_info); +extern bool vect_verify_datarefs_alignment (loop_vec_info); +extern bool vect_slp_analyze_and_verify_instance_alignment (slp_instance); +extern bool vect_analyze_data_ref_accesses (vec_info *); extern bool vect_prune_runtime_alias_test_list (loop_vec_info); -extern bool vect_analyze_data_refs (loop_vec_info, bb_vec_info, int *); -extern tree vect_create_data_ref_ptr (gimple, struct loop *, tree, tree *, - gimple *, bool, bool *); -extern tree bump_vector_ptr (tree, gimple, gimple_stmt_iterator *, gimple, tree); +extern bool vect_check_gather_scatter (gimple *, loop_vec_info, + gather_scatter_info *); +extern bool vect_analyze_data_refs (vec_info *, int *); +extern void vect_record_base_alignments (vec_info *); +extern tree vect_create_data_ref_ptr (gimple *, tree, struct loop *, tree, + tree *, gimple_stmt_iterator *, + gimple **, bool, bool *, + tree = NULL_TREE); +extern tree bump_vector_ptr (tree, gimple *, gimple_stmt_iterator *, gimple *, + tree); extern tree vect_create_destination_var (tree, tree); -extern bool vect_strided_store_supported (tree); -extern bool vect_strided_load_supported (tree); -extern bool vect_permute_store_chain (VEC(tree,heap) *,unsigned int, gimple, - gimple_stmt_iterator *, VEC(tree,heap) **); -extern tree vect_setup_realignment (gimple, gimple_stmt_iterator *, tree *, +extern bool vect_grouped_store_supported (tree, unsigned HOST_WIDE_INT); +extern bool vect_store_lanes_supported (tree, unsigned HOST_WIDE_INT); +extern bool vect_grouped_load_supported (tree, bool, unsigned HOST_WIDE_INT); +extern bool vect_load_lanes_supported (tree, unsigned HOST_WIDE_INT); +extern void vect_permute_store_chain (vec<tree> ,unsigned int, gimple *, + gimple_stmt_iterator *, vec<tree> *); +extern tree vect_setup_realignment (gimple *, gimple_stmt_iterator *, tree *, enum dr_alignment_support, tree, struct loop **); -extern bool vect_permute_load_chain (VEC(tree,heap) *,unsigned int, gimple, - gimple_stmt_iterator *, VEC(tree,heap) **); -extern bool vect_transform_strided_load (gimple, VEC(tree,heap) *, int, +extern void vect_transform_grouped_load (gimple *, vec<tree> , int, gimple_stmt_iterator *); -extern int vect_get_place_in_interleaving_chain (gimple, gimple); +extern void vect_record_grouped_load_vectors (gimple *, vec<tree> ); extern tree vect_get_new_vect_var (tree, enum vect_var_kind, const char *); -extern tree vect_create_addr_base_for_vector_ref (gimple, gimple_seq *, - tree, struct loop *); +extern tree vect_get_new_ssa_name (tree, enum vect_var_kind, + const char * = NULL); +extern tree vect_create_addr_base_for_vector_ref (gimple *, gimple_seq *, + tree, tree = NULL_TREE); /* In tree-vect-loop.c. */ /* FORNOW: Used in tree-parloops.c. */ -extern void destroy_loop_vec_info (loop_vec_info, bool); -extern gimple vect_force_simple_reduction (loop_vec_info, gimple, bool, bool *); +extern gimple *vect_force_simple_reduction (loop_vec_info, gimple *, + bool *, bool); /* Drive for loop analysis stage. */ -extern loop_vec_info vect_analyze_loop (struct loop *); +extern loop_vec_info vect_analyze_loop (struct loop *, loop_vec_info); +extern tree vect_build_loop_niters (loop_vec_info, bool * = NULL); +extern void vect_gen_vector_loop_niters (loop_vec_info, tree, tree *, bool); /* Drive for loop transformation stage. */ -extern void vect_transform_loop (loop_vec_info); +extern struct loop *vect_transform_loop (loop_vec_info); extern loop_vec_info vect_analyze_loop_form (struct loop *); -extern bool vectorizable_live_operation (gimple, gimple_stmt_iterator *, - gimple *); -extern bool vectorizable_reduction (gimple, gimple_stmt_iterator *, gimple *, - slp_tree); -extern bool vectorizable_induction (gimple, gimple_stmt_iterator *, gimple *); -extern int vect_estimate_min_profitable_iters (loop_vec_info); -extern tree get_initial_def_for_reduction (gimple, tree, tree *); -extern int vect_min_worthwhile_factor (enum tree_code); -extern int vect_get_known_peeling_cost (loop_vec_info, int, int *, int); -extern int vect_get_single_scalar_iteraion_cost (loop_vec_info); +extern bool vectorizable_live_operation (gimple *, gimple_stmt_iterator *, + slp_tree, int, gimple **); +extern bool vectorizable_reduction (gimple *, gimple_stmt_iterator *, + gimple **, slp_tree, slp_instance); +extern bool vectorizable_induction (gimple *, gimple_stmt_iterator *, + gimple **, slp_tree); +extern tree get_initial_def_for_reduction (gimple *, tree, tree *); +extern bool vect_worthwhile_without_simd_p (vec_info *, tree_code); +extern int vect_get_known_peeling_cost (loop_vec_info, int, int *, + stmt_vector_for_cost *, + stmt_vector_for_cost *, + stmt_vector_for_cost *); /* In tree-vect-slp.c. */ extern void vect_free_slp_instance (slp_instance); -extern bool vect_transform_slp_perm_load (gimple, VEC (tree, heap) *, +extern bool vect_transform_slp_perm_load (slp_tree, vec<tree> , gimple_stmt_iterator *, int, - slp_instance, bool); -extern bool vect_schedule_slp (loop_vec_info, bb_vec_info); -extern void vect_update_slp_costs_according_to_vf (loop_vec_info); -extern bool vect_analyze_slp (loop_vec_info, bb_vec_info); -extern void vect_make_slp_decision (loop_vec_info); + slp_instance, bool, unsigned *); +extern bool vect_slp_analyze_operations (vec_info *); +extern bool vect_schedule_slp (vec_info *); +extern bool vect_analyze_slp (vec_info *, unsigned); +extern bool vect_make_slp_decision (loop_vec_info); extern void vect_detect_hybrid_slp (loop_vec_info); -extern void vect_get_slp_defs (tree, tree, slp_tree, VEC (tree,heap) **, - VEC (tree,heap) **, int); -extern LOC find_bb_location (basic_block); -extern bb_vec_info vect_slp_analyze_bb (basic_block); -extern void vect_slp_transform_bb (basic_block); +extern void vect_get_slp_defs (vec<tree> , slp_tree, vec<vec<tree> > *); +extern bool vect_slp_bb (basic_block); +extern gimple *vect_find_last_scalar_stmt_in_slp (slp_tree); +extern bool is_simple_and_all_uses_invariant (gimple *, loop_vec_info); /* In tree-vect-patterns.c. */ /* Pattern recognition functions. Additional pattern recognition functions can (and will) be added in the future. */ -typedef gimple (* vect_recog_func_ptr) (gimple, tree *, tree *); -#define NUM_PATTERNS 4 -void vect_pattern_recog (loop_vec_info); +typedef gimple *(* vect_recog_func_ptr) (vec<gimple *> *, tree *, tree *); +#define NUM_PATTERNS 14 +void vect_pattern_recog (vec_info *); /* In tree-vectorizer.c. */ unsigned vectorize_loops (void); -/* Vectorization debug information */ -extern bool vect_print_dump_info (enum vect_verbosity_levels); +bool vect_stmt_in_region_p (vec_info *, gimple *); +void vect_free_loop_info_assumptions (struct loop *); #endif /* GCC_TREE_VECTORIZER_H */