CbC/CbC_gcc: gcc/tree-vectorizer.h comparison

comparison gcc/tree-vectorizer.h @ 131:84e7813d76e9

gcc-8.2

author	mir3636
date	Thu, 25 Oct 2018 07:37:49 +0900
parents	04ced10e8804
children	1830386684a0

comparison

equal deleted inserted replaced

-:04ced10e8804
+:84e7813d76e9
 /* Vectorizer
-Copyright (C) 2003-2017 Free Software Foundation, Inc.
+Copyright (C) 2003-2018 Free Software Foundation, Inc.
 Contributed by Dorit Naishlos <dorit@il.ibm.com>
 This file is part of GCC.
 GCC is free software; you can redistribute it and/or modify it under
 along with GCC; see the file COPYING3.  If not see
 <http://www.gnu.org/licenses/>.  */
 #ifndef GCC_TREE_VECTORIZER_H
 #define GCC_TREE_VECTORIZER_H
+typedef struct _stmt_vec_info *stmt_vec_info;
 #include "tree-data-ref.h"
 #include "tree-hash-traits.h"
 #include "target.h"
 /* Define type of reduction.  */
 enum vect_reduction_type {
 TREE_CODE_REDUCTION,
 COND_REDUCTION,
 INTEGER_INDUC_COND_REDUCTION,
-CONST_COND_REDUCTION
+CONST_COND_REDUCTION,
+/* Retain a scalar phi and use a FOLD_EXTRACT_LAST within the loop
+to implement:
+for (int i = 0; i < VF; ++i)
+res = cond[i] ? val[i] : res;  */
+EXTRACT_LAST_REDUCTION,
+/* Use a folding reduction within the loop to implement:
+for (int i = 0; i < VF; ++i)
+	 res = res OP val[i];
+(with no reassocation).  */
+FOLD_LEFT_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;
+enum vect_cost_model_location where;
+stmt_vec_info stmt_info;
 int misalign;
 };
 typedef vec<stmt_info_for_cost> stmt_vector_for_cost;
 stmts to be packed in a SIMD stmt.  */
 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 *> stmts;
+vec<stmt_vec_info> stmts;
 /* Load permutation relative to the stores, NULL if there is no
 permutation.  */
 vec<unsigned> load_permutation;
 /* Vectorized stmt/s.  */
-vec<gimple *> vec_stmts;
+vec<stmt_vec_info> 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;
 /* Size of groups of scalar stmts that will be replaced by SIMD stmt/s.  */
 unsigned int group_size;
 /* The unrolling factor required to vectorized this SLP instance.  */
-unsigned int unrolling_factor;
+poly_uint64 unrolling_factor;
 /* The group of nodes that contain loads of this SLP instance.  */
 vec<slp_tree> loads;
 /* The SLP node containing the reduction PHIs.  */
 /* Describes two objects whose addresses must be unequal for the vectorized
 loop to be valid.  */
 typedef std::pair<tree, tree> vec_object_pair;
+/* Records that vectorization is only possible if abs (EXPR) >= MIN_VALUE.
+UNSIGNED_P is true if we can assume that abs (EXPR) == EXPR.  */
+struct vec_lower_bound {
+vec_lower_bound () {}
+vec_lower_bound (tree e, bool u, poly_uint64 m)
+: expr (e), unsigned_p (u), min_value (m) {}
+tree expr;
+bool unsigned_p;
+poly_uint64 min_value;
+};
+/* Vectorizer state shared between different analyses like vector sizes
+of the same CFG region.  */
+struct vec_info_shared {
+vec_info_shared();
+~vec_info_shared();
+void save_datarefs();
+void check_datarefs();
+/* All data references.  Freed by free_data_refs, so not an auto_vec.  */
+vec<data_reference_p> datarefs;
+vec<data_reference> datarefs_copy;
+/* The loop nest in which the data dependences are computed.  */
+auto_vec<loop_p> loop_nest;
+/* All data dependences.  Freed by free_dependence_relations, so not
+an auto_vec.  */
+vec<ddr_p> ddrs;
+};
 /* Vectorizer state common between loop and basic-block vectorization.  */
 struct vec_info {
 enum vec_kind { bb, loop };
-vec_info (vec_kind, void *);
+vec_info (vec_kind, void *, vec_info_shared *);
 ~vec_info ();
+stmt_vec_info add_stmt (gimple *);
+stmt_vec_info lookup_stmt (gimple *);
+stmt_vec_info lookup_def (tree);
+stmt_vec_info lookup_single_use (tree);
+struct dr_vec_info *lookup_dr (data_reference *);
+void move_dr (stmt_vec_info, stmt_vec_info);
+void remove_stmt (stmt_vec_info);
+void replace_stmt (gimple_stmt_iterator *, stmt_vec_info, gimple *);
 /* The type of vectorization.  */
 vec_kind kind;
+/* Shared vectorizer state.  */
+vec_info_shared *shared;
+/* The mapping of GIMPLE UID to stmt_vec_info.  */
+vec<stmt_vec_info> stmt_vec_infos;
 /* 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;
 /* All interleaving chains of stores, represented by the first
 stmt in the chain.  */
-auto_vec<gimple *> grouped_stores;
+auto_vec<stmt_vec_info> grouped_stores;
 /* Cost data used by the target cost model.  */
 void *target_cost_data;
+private:
+stmt_vec_info new_stmt_vec_info (gimple *stmt);
+void set_vinfo_for_stmt (gimple *, stmt_vec_info);
+void free_stmt_vec_infos ();
+void free_stmt_vec_info (stmt_vec_info);
 };
 struct _loop_vec_info;
 struct _bb_vec_info;
 {
 return i->kind == vec_info::bb;
 }
+/* In general, we can divide the vector statements in a vectorized loop
+into related groups ("rgroups") and say that for each rgroup there is
+some nS such that the rgroup operates on nS values from one scalar
+iteration followed by nS values from the next.  That is, if VF is the
+vectorization factor of the loop, the rgroup operates on a sequence:
+(1,1) (1,2) ... (1,nS) (2,1) ... (2,nS) ... (VF,1) ... (VF,nS)
+where (i,j) represents a scalar value with index j in a scalar
+iteration with index i.
+[ We use the term "rgroup" to emphasise that this grouping isn't
+necessarily the same as the grouping of statements used elsewhere.
+For example, if we implement a group of scalar loads using gather
+loads, we'll use a separate gather load for each scalar load, and
+thus each gather load will belong to its own rgroup. ]
+In general this sequence will occupy nV vectors concatenated
+together.  If these vectors have nL lanes each, the total number
+of scalar values N is given by:
+N = nS * VF = nV * nL
+None of nS, VF, nV and nL are required to be a power of 2.  nS and nV
+are compile-time constants but VF and nL can be variable (if the target
+supports variable-length vectors).
+In classical vectorization, each iteration of the vector loop would
+handle exactly VF iterations of the original scalar loop.  However,
+in a fully-masked loop, a particular iteration of the vector loop
+might handle fewer than VF iterations of the scalar loop.  The vector
+lanes that correspond to iterations of the scalar loop are said to be
+"active" and the other lanes are said to be "inactive".
+In a fully-masked loop, many rgroups need to be masked to ensure that
+they have no effect for the inactive lanes.  Each such rgroup needs a
+sequence of booleans in the same order as above, but with each (i,j)
+replaced by a boolean that indicates whether iteration i is active.
+This sequence occupies nV vector masks that again have nL lanes each.
+Thus the mask sequence as a whole consists of VF independent booleans
+that are each repeated nS times.
+We make the simplifying assumption that if a sequence of nV masks is
+suitable for one (nS,nL) pair, we can reuse it for (nS/2,nL/2) by
+VIEW_CONVERTing it.  This holds for all current targets that support
+fully-masked loops.  For example, suppose the scalar loop is:
+float *f;
+double *d;
+for (int i = 0; i < n; ++i)
+{
+	 f[i * 2 + 0] += 1.0f;
+	 f[i * 2 + 1] += 2.0f;
+	 d[i] += 3.0;
+}
+and suppose that vectors have 256 bits.  The vectorized f accesses
+will belong to one rgroup and the vectorized d access to another:
+f rgroup: nS = 2, nV = 1, nL = 8
+d rgroup: nS = 1, nV = 1, nL = 4
+	       VF = 4
+[ In this simple example the rgroups do correspond to the normal
+SLP grouping scheme. ]
+If only the first three lanes are active, the masks we need are:
+f rgroup: 1 1 | 1 1 | 1 1 | 0 0
+d rgroup:  1  |  1  |  1  |  0
+Here we can use a mask calculated for f's rgroup for d's, but not
+vice versa.
+Thus for each value of nV, it is enough to provide nV masks, with the
+mask being calculated based on the highest nL (or, equivalently, based
+on the highest nS) required by any rgroup with that nV.  We therefore
+represent the entire collection of masks as a two-level table, with the
+first level being indexed by nV - 1 (since nV == 0 doesn't exist) and
+the second being indexed by the mask index 0 <= i < nV.  */
+/* The masks needed by rgroups with nV vectors, according to the
+description above.  */
+struct rgroup_masks {
+/* The largest nS for all rgroups that use these masks.  */
+unsigned int max_nscalars_per_iter;
+/* The type of mask to use, based on the highest nS recorded above.  */
+tree mask_type;
+/* A vector of nV masks, in iteration order.  */
+vec<tree> masks;
+};
+typedef auto_vec<rgroup_masks> vec_loop_masks;
 /*-----------------------------------------------------------------*/
 /* Info on vectorized loops.                                       */
 /*-----------------------------------------------------------------*/
 typedef struct _loop_vec_info : public vec_info {
-_loop_vec_info (struct loop *);
+_loop_vec_info (struct loop *, vec_info_shared *);
 ~_loop_vec_info ();
 /* The loop to which this info struct refers to.  */
 struct loop *loop;
 /* 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;
+/* When applying loop versioning, the vector form should only be used
+if the number of scalar iterations is >= this value, on top of all
+the other requirements.  Ignored when loop versioning is not being
+used.  */
+poly_uint64 versioning_threshold;
 /* Unrolling factor  */
-int vectorization_factor;
+poly_uint64 vectorization_factor;
 /* Maximum runtime vectorization factor, or MAX_VECTORIZATION_FACTOR
 if there is no particular limit.  */
 unsigned HOST_WIDE_INT max_vectorization_factor;
+/* The masks that a fully-masked loop should use to avoid operating
+on inactive scalars.  */
+vec_loop_masks masks;
+/* If we are using a loop mask to align memory addresses, this variable
+contains the number of vector elements that we should skip in the
+first iteration of the vector loop (i.e. the number of leading
+elements that should be false in the first mask).  */
+tree mask_skip_niters;
+/* Type of the variables to use in the WHILE_ULT call for fully-masked
+loops.  */
+tree mask_compare_type;
 /* Unknown DRs according to which loop was peeled.  */
-struct data_reference *unaligned_dr;
+struct dr_vec_info *unaligned_dr;
 /* peeling_for_alignment indicates whether peeling for alignment will take
 place, and what the peeling factor should be:
 peeling_for_alignment = X means:
 If X=0: Peeling for alignment will not be applied.
 int peeling_for_alignment;
 /* The mask used to check the alignment of pointers or arrays.  */
 int ptr_mask;
-/* The loop nest in which the data dependences are computed.  */
-auto_vec<loop_p> loop_nest;
 /* Data Dependence Relations defining address ranges that are candidates
 for a run-time aliasing check.  */
 auto_vec<ddr_p> may_alias_ddrs;
 /* Data Dependence Relations defining address ranges together with segment
 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;
+/* List of values that are required to be nonzero.  This is used to check
+whether things like "x[i * n] += 1;" are safe and eventually gets added
+to the checks for lower bounds below.  */
+auto_vec<tree> check_nonzero;
+/* List of values that need to be checked for a minimum value.  */
+auto_vec<vec_lower_bound> lower_bounds;
 /* Statements in the loop that have data references that are candidates for a
 runtime (loop versioning) misalignment check.  */
-auto_vec<gimple *> may_misalign_stmts;
+auto_vec<stmt_vec_info> may_misalign_stmts;
 /* Reduction cycles detected in the loop. Used in loop-aware SLP.  */
-auto_vec<gimple *> reductions;
+auto_vec<stmt_vec_info> reductions;
 /* All reduction chains in the loop, represented by the first
 stmt in the chain.  */
-auto_vec<gimple *> reduction_chains;
+auto_vec<stmt_vec_info> reduction_chains;
 /* Cost vector for a single scalar iteration.  */
 auto_vec<stmt_info_for_cost> scalar_cost_vec;
+/* Map of IV base/step expressions to inserted name in the preheader.  */
+hash_map<tree_operand_hash, tree> *ivexpr_map;
 /* 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;
+poly_uint64 slp_unrolling_factor;
 /* Cost of a single scalar iteration.  */
 int single_scalar_iteration_cost;
 /* Is the loop vectorizable? */
 bool vectorizable;
+/* Records whether we still have the option of using a fully-masked loop.  */
+bool can_fully_mask_p;
+/* True if have decided to use a fully-masked loop.  */
+bool fully_masked_p;
 /* 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;
 prologue peeling retain total unchanged scalar loop iterations for
 cost model.  */
 #define LOOP_VINFO_NITERS_UNCHANGED(L)     (L)->num_iters_unchanged
 #define LOOP_VINFO_NITERS_ASSUMPTIONS(L)   (L)->num_iters_assumptions
 #define LOOP_VINFO_COST_MODEL_THRESHOLD(L) (L)->th
+#define LOOP_VINFO_VERSIONING_THRESHOLD(L) (L)->versioning_threshold
 #define LOOP_VINFO_VECTORIZABLE_P(L)       (L)->vectorizable
+#define LOOP_VINFO_CAN_FULLY_MASK_P(L)     (L)->can_fully_mask_p
+#define LOOP_VINFO_FULLY_MASKED_P(L)       (L)->fully_masked_p
 #define LOOP_VINFO_VECT_FACTOR(L)          (L)->vectorization_factor
 #define LOOP_VINFO_MAX_VECT_FACTOR(L)      (L)->max_vectorization_factor
+#define LOOP_VINFO_MASKS(L)                (L)->masks
+#define LOOP_VINFO_MASK_SKIP_NITERS(L)     (L)->mask_skip_niters
+#define LOOP_VINFO_MASK_COMPARE_TYPE(L)    (L)->mask_compare_type
 #define LOOP_VINFO_PTR_MASK(L)             (L)->ptr_mask
-#define LOOP_VINFO_LOOP_NEST(L)            (L)->loop_nest
+#define LOOP_VINFO_LOOP_NEST(L)            (L)->shared->loop_nest
-#define LOOP_VINFO_DATAREFS(L)             (L)->datarefs
+#define LOOP_VINFO_DATAREFS(L)             (L)->shared->datarefs
-#define LOOP_VINFO_DDRS(L)                 (L)->ddrs
+#define LOOP_VINFO_DDRS(L)                 (L)->shared->ddrs
 #define LOOP_VINFO_INT_NITERS(L)           (TREE_INT_CST_LOW ((L)->num_iters))
 #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_MAY_ALIAS_DDRS(L)       (L)->may_alias_ddrs
 #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_CHECK_NONZERO(L)        (L)->check_nonzero
+#define LOOP_VINFO_LOWER_BOUNDS(L)         (L)->lower_bounds
 #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_REDUCTION_CHAINS(L)     (L)->reduction_chains
 #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)
+|| (L)->check_unequal_addrs.length () > 0 \
+|| (L)->lower_bounds.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_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)))
+/* Wrapper for loop_vec_info, for tracking success/failure, where a non-NULL
+value signifies success, and a NULL value signifies failure, supporting
+propagating an opt_problem * describing the failure back up the call
+stack.  */
+typedef opt_pointer_wrapper <loop_vec_info> opt_loop_vec_info;
 static inline loop_vec_info
 loop_vec_info_for_loop (struct loop *loop)
 {
 return (loop_vec_info) loop->aux;
 }
-static inline bool
-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 : public vec_info
 {
-_bb_vec_info (gimple_stmt_iterator, gimple_stmt_iterator);
+_bb_vec_info (gimple_stmt_iterator, gimple_stmt_iterator, vec_info_shared *);
 ~_bb_vec_info ();
 basic_block bb;
 gimple_stmt_iterator region_begin;
 gimple_stmt_iterator region_end;
 } *bb_vec_info;
 #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_DATAREFS(B)         (B)->shared->datarefs
-#define BB_VINFO_DDRS(B)             (B)->ddrs
+#define BB_VINFO_DDRS(B)             (B)->shared->ddrs
 #define BB_VINFO_TARGET_COST_DATA(B) (B)->target_cost_data
 static inline bb_vec_info
 vec_info_for_bb (basic_block bb)
 {
 loop_vect = 0,
 pure_slp,
 hybrid
 };
+/* Says whether a statement is a load, a store of a vectorized statement
+result, or a store of an invariant value.  */
+enum vec_load_store_type {
+VLS_LOAD,
+VLS_STORE,
+VLS_STORE_INVARIANT
+};
 /* 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,
 /* The access uses gather loads or scatter stores.  */
 VMAT_GATHER_SCATTER
 };
+struct dr_vec_info {
+/* The data reference itself.  */
+data_reference *dr;
+/* The statement that contains the data reference.  */
+stmt_vec_info stmt;
+/* 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;
+};
 typedef struct data_reference *dr_p;
-typedef struct _stmt_vec_info {
+struct _stmt_vec_info {
 enum stmt_vec_info_type type;
 /* Indicates whether this stmts is part of a computation whose result is
 used outside the loop.  */
 bool live;
 /* Stmt is part of some pattern (computation idiom)  */
 bool in_pattern_p;
+/* True if the statement was created during pattern recognition as
+part of the replacement for RELATED_STMT.  This implies that the
+statement isn't part of any basic block, although for convenience
+its gimple_bb is the same as for RELATED_STMT.  */
+bool pattern_stmt_p;
 /* Is this statement vectorizable or should it be skipped in (partial)
 vectorization.  */
 bool vectorizable;
 /* The stmt to which this info struct refers to.  */
 /* The vector type to be used for the LHS of this statement.  */
 tree vectype;
 /* The vectorized version of the stmt.  */
-gimple *vectorized_stmt;
+stmt_vec_info vectorized_stmt;
 /* 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.  */
-/* Information about the data-ref (access function, etc),
+dr_vec_info dr_aux;
-relative to the inner-most containing loop.  */
-struct data_reference *data_ref_info;
 /* Information about the data-ref relative to this loop
 nest (the loop that is being considered for vectorization).  */
 innermost_loop_behavior dr_wrt_vec_loop;
 true): S is the "pattern stmt" that represents (and replaces) the
 sequence of stmts that constitutes the pattern.  Similarly, the
 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;
+stmt_vec_info related_stmt;
-/* Used to keep a sequence of def stmts of a pattern stmt if such exists.  */
+/* Used to keep a sequence of def stmts of a pattern stmt if such exists.
+The sequence is attached to the original statement rather than the
+pattern statement.  */
 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> same_align_refs;
 /*  Whether the stmt is SLPed, loop-based vectorized, or both.  */
 enum slp_vect_type slp_type;
 /* Interleaving and reduction chains info.  */
 /* First element in the group.  */
-gimple *first_element;
+stmt_vec_info first_element;
 /* Pointer to the next element in the group.  */
-gimple *next_element;
+stmt_vec_info 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;
+stmt_vec_info 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.  */
 unsigned int store_count;
 enum vect_reduction_type reduc_type;
 /* 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;
+stmt_vec_info reduc_def;
 /* The number of scalar stmt references from active SLP instances.  */
 unsigned int num_slp_uses;
-} *stmt_vec_info;
+/* If nonzero, the lhs of the statement could be truncated to this
+many bits without affecting any users of the result.  */
+unsigned int min_output_precision;
+/* If nonzero, all non-boolean input operands have the same precision,
+and they could each be truncated to this many bits without changing
+the result.  */
+unsigned int min_input_precision;
+/* If OPERATION_BITS is nonzero, the statement could be performed on
+an integer with the sign and number of bits given by OPERATION_SIGN
+and OPERATION_BITS without changing the result.  */
+unsigned int operation_precision;
+signop operation_sign;
+};
 /* Information about a gather/scatter call.  */
 struct gather_scatter_info {
-/* The FUNCTION_DECL for the built-in gather/scatter function.  */
+/* The internal function to use for the gather/scatter operation,
+or IFN_LAST if a built-in function should be used instead.  */
+internal_fn ifn;
+/* The FUNCTION_DECL for the built-in gather/scatter function,
+or null if an internal function should be used instead.  */
 tree decl;
 /* The loop-invariant base value.  */
 tree base;
 /* The definition type for the vectorized offset.  */
 enum vect_def_type offset_dt;
 /* The type of the vectorized offset.  */
 tree offset_vectype;
+/* The type of the scalar elements after loading or before storing.  */
+tree element_type;
+/* The type of the scalar elements being loaded or stored.  */
+tree memory_type;
 };
 /* Access Functions.  */
 #define STMT_VINFO_TYPE(S)                 (S)->type
 #define STMT_VINFO_STMT(S)                 (S)->stmt
 #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_DATA_REF(S)             ((S)->dr_aux.dr + 0)
 #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_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_DR_INFO(S) \
+(gcc_checking_assert ((S)->dr_aux.stmt == (S)), &(S)->dr_aux)
 #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_GROUP_FIRST_ELEMENT(S)  (S)->first_element
+#define STMT_VINFO_GROUPED_ACCESS(S) \
-#define STMT_VINFO_GROUP_NEXT_ELEMENT(S)   (S)->next_element
+((S)->dr_aux.dr && DR_GROUP_FIRST_ELEMENT(S))
-#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 GROUP_FIRST_ELEMENT(S)          (S)->first_element
+#define DR_GROUP_FIRST_ELEMENT(S) \
-#define GROUP_NEXT_ELEMENT(S)           (S)->next_element
+(gcc_checking_assert ((S)->dr_aux.dr), (S)->first_element)
-#define GROUP_SIZE(S)                   (S)->size
+#define DR_GROUP_NEXT_ELEMENT(S) \
-#define GROUP_STORE_COUNT(S)            (S)->store_count
+(gcc_checking_assert ((S)->dr_aux.dr), (S)->next_element)
-#define GROUP_GAP(S)                    (S)->gap
+#define DR_GROUP_SIZE(S) \
-#define GROUP_SAME_DR_STMT(S)           (S)->same_dr_stmt
+(gcc_checking_assert ((S)->dr_aux.dr), (S)->size)
+#define DR_GROUP_STORE_COUNT(S) \
+(gcc_checking_assert ((S)->dr_aux.dr), (S)->store_count)
+#define DR_GROUP_GAP(S) \
+(gcc_checking_assert ((S)->dr_aux.dr), (S)->gap)
+#define DR_GROUP_SAME_DR_STMT(S) \
+(gcc_checking_assert ((S)->dr_aux.dr), (S)->same_dr_stmt)
+#define REDUC_GROUP_FIRST_ELEMENT(S) \
+(gcc_checking_assert (!(S)->dr_aux.dr), (S)->first_element)
+#define REDUC_GROUP_NEXT_ELEMENT(S) \
+(gcc_checking_assert (!(S)->dr_aux.dr), (S)->next_element)
+#define REDUC_GROUP_SIZE(S) \
+(gcc_checking_assert (!(S)->dr_aux.dr), (S)->size)
 #define STMT_VINFO_RELEVANT_P(S)          ((S)->relevant != vect_unused_in_scope)
 #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 (V64QI).  */
+#define MAX_VECTORIZATION_FACTOR INT_MAX
-#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.  */
 || ((TREE_CODE (TYPE) == INTEGER_TYPE	\
 	|| TREE_CODE (TYPE) == ENUMERAL_TYPE)	\
 && TYPE_PRECISION (TYPE) == 1		\
 && TYPE_UNSIGNED (TYPE)))
-extern vec<stmt_vec_info> stmt_vec_info_vec;
+static inline bool
+nested_in_vect_loop_p (struct loop *loop, stmt_vec_info stmt_info)
-void init_stmt_vec_info_vec (void);
+{
-void free_stmt_vec_info_vec (void);
+return (loop->inner
+	  && (loop->inner == (gimple_bb (stmt_info->stmt))->loop_father));
-/* Return a stmt_vec_info corresponding to STMT.  */
+}
+/* Return the earlier statement between STMT1_INFO and STMT2_INFO.  */
 static inline stmt_vec_info
-vinfo_for_stmt (gimple *stmt)
+get_earlier_stmt (stmt_vec_info stmt1_info, stmt_vec_info stmt2_info)
 {
-int uid = gimple_uid (stmt);
+gcc_checking_assert ((STMT_VINFO_IN_PATTERN_P (stmt1_info)
-if (uid <= 0)
+			|| !STMT_VINFO_RELATED_STMT (stmt1_info))
-return NULL;
+		       && (STMT_VINFO_IN_PATTERN_P (stmt2_info)
+			   || !STMT_VINFO_RELATED_STMT (stmt2_info)));
-return stmt_vec_info_vec[uid - 1];
-}
+if (gimple_uid (stmt1_info->stmt) < gimple_uid (stmt2_info->stmt))
+return stmt1_info;
-/* Set vectorizer information INFO for STMT.  */
-static inline void
-set_vinfo_for_stmt (gimple *stmt, stmt_vec_info info)
-{
-unsigned int uid = gimple_uid (stmt);
-if (uid == 0)
-{
-gcc_checking_assert (info);
-uid = stmt_vec_info_vec.length () + 1;
-gimple_set_uid (stmt, uid);
-stmt_vec_info_vec.safe_push (info);
-}
 else
-{
+return stmt2_info;
-gcc_checking_assert (info == NULL);
+}
-stmt_vec_info_vec[uid - 1] = info;
-}
+/* Return the later statement between STMT1_INFO and STMT2_INFO.  */
-}
+static inline stmt_vec_info
-/* Return the earlier statement between STMT1 and STMT2.  */
+get_later_stmt (stmt_vec_info stmt1_info, stmt_vec_info stmt2_info)
+{
-static inline gimple *
+gcc_checking_assert ((STMT_VINFO_IN_PATTERN_P (stmt1_info)
-get_earlier_stmt (gimple *stmt1, gimple *stmt2)
+			|| !STMT_VINFO_RELATED_STMT (stmt1_info))
-{
+		       && (STMT_VINFO_IN_PATTERN_P (stmt2_info)
-unsigned int uid1, uid2;
+			   || !STMT_VINFO_RELATED_STMT (stmt2_info)));
-if (stmt1 == NULL)
+if (gimple_uid (stmt1_info->stmt) > gimple_uid (stmt2_info->stmt))
-return stmt2;
+return stmt1_info;
-if (stmt2 == NULL)
-return stmt1;
-uid1 = gimple_uid (stmt1);
-uid2 = gimple_uid (stmt2);
-if (uid1 == 0 || uid2 == 0)
-return NULL;
-gcc_checking_assert (uid1 <= stmt_vec_info_vec.length ()
-		       && uid2 <= stmt_vec_info_vec.length ());
-if (uid1 < uid2)
-return stmt1;
 else
-return stmt2;
+return stmt2_info;
-}
-/* Return the later statement between STMT1 and STMT2.  */
-static inline gimple *
-get_later_stmt (gimple *stmt1, gimple *stmt2)
-{
-unsigned int uid1, uid2;
-if (stmt1 == NULL)
-return stmt2;
-if (stmt2 == NULL)
-return stmt1;
-uid1 = gimple_uid (stmt1);
-uid2 = gimple_uid (stmt2);
-if (uid1 == 0 || uid2 == 0)
-return NULL;
-gcc_assert (uid1 <= stmt_vec_info_vec.length ());
-gcc_assert (uid2 <= stmt_vec_info_vec.length ());
-if (uid1 > uid2)
-return stmt1;
-else
-return stmt2;
 }
 /* Return TRUE if a statement represented by STMT_INFO is a part of a
 pattern.  */
 static inline bool
 is_pattern_stmt_p (stmt_vec_info stmt_info)
 {
-gimple *related_stmt;
+return stmt_info->pattern_stmt_p;
-stmt_vec_info related_stmt_info;
+}
-related_stmt = STMT_VINFO_RELATED_STMT (stmt_info);
+/* If STMT_INFO is a pattern statement, return the statement that it
-if (related_stmt
+replaces, otherwise return STMT_INFO itself.  */
-&& (related_stmt_info = vinfo_for_stmt (related_stmt))
-&& STMT_VINFO_IN_PATTERN_P (related_stmt_info))
+inline stmt_vec_info
-return true;
+vect_orig_stmt (stmt_vec_info stmt_info)
+{
-return false;
+if (is_pattern_stmt_p (stmt_info))
+return STMT_VINFO_RELATED_STMT (stmt_info);
+return stmt_info;
+}
+/* If STMT_INFO has been replaced by a pattern statement, return the
+replacement statement, otherwise return STMT_INFO itself.  */
+inline stmt_vec_info
+vect_stmt_to_vectorize (stmt_vec_info stmt_info)
+{
+if (STMT_VINFO_IN_PATTERN_P (stmt_info))
+return STMT_VINFO_RELATED_STMT (stmt_info);
+return stmt_info;
 }
 /* Return true if BB is a loop header.  */
 static inline bool
 init_cost (struct loop *loop_info)
 {
 return targetm.vectorize.init_cost (loop_info);
 }
+extern void dump_stmt_cost (FILE *, void *, int, enum vect_cost_for_stmt,
+			    stmt_vec_info, int, unsigned,
+			    enum vect_cost_model_location);
 /* 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,
+unsigned cost = targetm.vectorize.add_stmt_cost (data, count, kind,
-					  stmt_info, misalign, where);
+						   stmt_info, misalign, where);
+if (dump_file && (dump_flags & TDF_DETAILS))
+dump_stmt_cost (dump_file, data, count, kind, stmt_info, misalign,
+		    cost, where);
+return cost;
 }
 /* Alias targetm.vectorize.finish_cost.  */
 static inline void
 destroy_cost_data (void *data)
 {
 targetm.vectorize.destroy_cost_data (data);
 }
+inline void
+add_stmt_costs (void *data, stmt_vector_for_cost *cost_vec)
+{
+stmt_info_for_cost *cost;
+unsigned i;
+FOR_EACH_VEC_ELT (*cost_vec, i, cost)
+add_stmt_cost (data, cost->count, cost->kind, cost->stmt_info,
+		   cost->misalign, cost->where);
+}
 /*-----------------------------------------------------------------*/
 /* Info on data references alignment.                              */
 /*-----------------------------------------------------------------*/
+#define DR_MISALIGNMENT_UNKNOWN (-1)
+#define DR_MISALIGNMENT_UNINITIALIZED (-2)
 inline void
-set_dr_misalignment (struct data_reference *dr, int val)
+set_dr_misalignment (dr_vec_info *dr_info, int val)
 {
-dataref_aux *data_aux = DR_VECT_AUX (dr);
+dr_info->misalignment = val;
-if (!data_aux)
-{
-data_aux = XCNEW (dataref_aux);
-dr->aux = data_aux;
-}
-data_aux->misalignment = val;
 }
 inline int
-dr_misalignment (struct data_reference *dr)
+dr_misalignment (dr_vec_info *dr_info)
 {
-return DR_VECT_AUX (dr)->misalignment;
+int misalign = dr_info->misalignment;
+gcc_assert (misalign != DR_MISALIGNMENT_UNINITIALIZED);
+return misalign;
 }
 /* Reflects actual alignment of first access in the vectorized loop,
 taking into account peeling/versioning if applied.  */
 #define DR_MISALIGNMENT(DR) dr_misalignment (DR)
 #define SET_DR_MISALIGNMENT(DR, VAL) set_dr_misalignment (DR, VAL)
-#define DR_MISALIGNMENT_UNKNOWN (-1)
 /* Only defined once DR_MISALIGNMENT is defined.  */
-#define DR_TARGET_ALIGNMENT(DR) DR_VECT_AUX (DR)->target_alignment
+#define DR_TARGET_ALIGNMENT(DR) ((DR)->target_alignment)
-/* Return true if data access DR is aligned to its target alignment
+/* Return true if data access DR_INFO 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)
+aligned_access_p (dr_vec_info *dr_info)
 {
-return (DR_MISALIGNMENT (data_ref_info) == 0);
+return (DR_MISALIGNMENT (dr_info) == 0);
 }
 /* Return TRUE if the alignment of the data access is known, and FALSE
 otherwise.  */
 static inline bool
-known_alignment_for_access_p (struct data_reference *data_ref_info)
+known_alignment_for_access_p (dr_vec_info *dr_info)
 {
-return (DR_MISALIGNMENT (data_ref_info) != DR_MISALIGNMENT_UNKNOWN);
+return (DR_MISALIGNMENT (dr_info) != DR_MISALIGNMENT_UNKNOWN);
 }
 /* Return the minimum alignment in bytes that the vectorized version
-of DR is guaranteed to have.  */
+of DR_INFO is guaranteed to have.  */
 static inline unsigned int
-vect_known_alignment_in_bytes (struct data_reference *dr)
+vect_known_alignment_in_bytes (dr_vec_info *dr_info)
 {
-if (DR_MISALIGNMENT (dr) == DR_MISALIGNMENT_UNKNOWN)
+if (DR_MISALIGNMENT (dr_info) == DR_MISALIGNMENT_UNKNOWN)
-return TYPE_ALIGN_UNIT (TREE_TYPE (DR_REF (dr)));
+return TYPE_ALIGN_UNIT (TREE_TYPE (DR_REF (dr_info->dr)));
-if (DR_MISALIGNMENT (dr) == 0)
+if (DR_MISALIGNMENT (dr_info) == 0)
-return DR_TARGET_ALIGNMENT (dr);
+return DR_TARGET_ALIGNMENT (dr_info);
-return DR_MISALIGNMENT (dr) & -DR_MISALIGNMENT (dr);
+return DR_MISALIGNMENT (dr_info) & -DR_MISALIGNMENT (dr_info);
 }
-/* Return the behavior of DR with respect to the vectorization context
+/* Return the behavior of DR_INFO with respect to the vectorization context
 (which for outer loop vectorization might not be the behavior recorded
-in DR itself).  */
+in DR_INFO itself).  */
 static inline innermost_loop_behavior *
-vect_dr_behavior (data_reference *dr)
+vect_dr_behavior (dr_vec_info *dr_info)
 {
-gimple *stmt = DR_STMT (dr);
+stmt_vec_info stmt_info = dr_info->stmt;
-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))
+|| !nested_in_vect_loop_p (LOOP_VINFO_LOOP (loop_vinfo), stmt_info))
-return &DR_INNERMOST (dr);
+return &DR_INNERMOST (dr_info->dr);
 else
 return &STMT_VINFO_DR_WRT_VEC_LOOP (stmt_info);
 }
 /* Return true if the vect cost model is unlimited.  */
 && 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 true if the loop described by LOOP_VINFO is fully-masked and
+if the first iteration should use a partial mask in order to achieve
+alignment.  */
+static inline bool
+vect_use_loop_mask_for_alignment_p (loop_vec_info loop_vinfo)
+{
+return (LOOP_VINFO_FULLY_MASKED_P (loop_vinfo)
+	  && LOOP_VINFO_PEELING_FOR_ALIGNMENT (loop_vinfo));
+}
+/* Return the number of vectors of type VECTYPE that are needed to get
+NUNITS elements.  NUNITS should be based on the vectorization factor,
+so it is always a known multiple of the number of elements in VECTYPE.  */
+static inline unsigned int
+vect_get_num_vectors (poly_uint64 nunits, tree vectype)
+{
+return exact_div (nunits, TYPE_VECTOR_SUBPARTS (vectype)).to_constant ();
+}
 /* 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)
+return vect_get_num_vectors (LOOP_VINFO_VECT_FACTOR (loop_vinfo), vectype);
-		       % TYPE_VECTOR_SUBPARTS (vectype) == 0);
+}
-return (LOOP_VINFO_VECT_FACTOR (loop_vinfo)
-	  / TYPE_VECTOR_SUBPARTS (vectype));
+/* Update maximum unit count *MAX_NUNITS so that it accounts for
-}
+the number of units in vector type VECTYPE.  *MAX_NUNITS can be 1
+if we haven't yet recorded any vector types.  */
-/* 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
+static inline void
-associated gimple statement, since that guarantees that DR accesses
+vect_update_max_nunits (poly_uint64 *max_nunits, tree vectype)
-either a scalar or a scalar equivalent.  ("Scalar equivalent" here
+{
-includes things like V1SI, which can be vectorized in the same way
+/* All unit counts have the form current_vector_size * X for some
+rational X, so two unit sizes must have a common multiple.
+Everything is a multiple of the initial value of 1.  */
+poly_uint64 nunits = TYPE_VECTOR_SUBPARTS (vectype);
+*max_nunits = force_common_multiple (*max_nunits, nunits);
+}
+/* Return the vectorization factor that should be used for costing
+purposes while vectorizing the loop described by LOOP_VINFO.
+Pick a reasonable estimate if the vectorization factor isn't
+known at compile time.  */
+static inline unsigned int
+vect_vf_for_cost (loop_vec_info loop_vinfo)
+{
+return estimated_poly_value (LOOP_VINFO_VECT_FACTOR (loop_vinfo));
+}
+/* Estimate the number of elements in VEC_TYPE for costing purposes.
+Pick a reasonable estimate if the exact number isn't known at
+compile time.  */
+static inline unsigned int
+vect_nunits_for_cost (tree vec_type)
+{
+return estimated_poly_value (TYPE_VECTOR_SUBPARTS (vec_type));
+}
+/* Return the maximum possible vectorization factor for LOOP_VINFO.  */
+static inline unsigned HOST_WIDE_INT
+vect_max_vf (loop_vec_info loop_vinfo)
+{
+unsigned HOST_WIDE_INT vf;
+if (LOOP_VINFO_VECT_FACTOR (loop_vinfo).is_constant (&vf))
+return vf;
+return MAX_VECTORIZATION_FACTOR;
+}
+/* Return the size of the value accessed by unvectorized data reference
+DR_INFO.  This is only valid once STMT_VINFO_VECTYPE has been calculated
+for the associated gimple statement, since that guarantees that DR_INFO
+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)
+vect_get_scalar_dr_size (dr_vec_info *dr_info)
 {
-return tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (DR_REF (dr))));
+return tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (DR_REF (dr_info->dr))));
 }
-/* Source location */
+/* Source location + hotness information. */
-extern source_location vect_location;
+extern dump_user_location_t vect_location;
+/* A macro for calling:
+dump_begin_scope (MSG, vect_location);
+via an RAII object, thus printing "=== MSG ===\n" to the dumpfile etc,
+and then calling
+dump_end_scope ();
+once the object goes out of scope, thus capturing the nesting of
+the scopes.
+These scopes affect dump messages within them: dump messages at the
+top level implicitly default to MSG_PRIORITY_USER_FACING, whereas those
+in a nested scope implicitly default to MSG_PRIORITY_INTERNALS.  */
+#define DUMP_VECT_SCOPE(MSG) \
+AUTO_DUMP_SCOPE (MSG, vect_location)
 /*-----------------------------------------------------------------*/
 /* Function prototypes.                                            */
 /*-----------------------------------------------------------------*/
 /* Simple loop peeling and versioning utilities for vectorizer's purposes -
 in tree-vect-loop-manip.c.  */
-extern void slpeel_make_loop_iterate_ntimes (struct loop *, tree);
+extern void vect_set_loop_condition (struct loop *, loop_vec_info,
+				     tree, tree, tree, bool);
 extern bool slpeel_can_duplicate_loop_p (const struct loop *, const_edge);
 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 void vect_loop_versioning (loop_vec_info, unsigned int, bool,
+				  poly_uint64);
 extern struct loop *vect_do_peeling (loop_vec_info, tree, tree,
-				     tree *, int, bool, bool);
+				     tree *, tree *, tree *, int, bool, bool);
-extern source_location find_loop_location (struct loop *);
+extern void vect_prepare_for_masked_peels (loop_vec_info);
+extern dump_user_location_t 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 poly_uint64 current_vector_size;
 extern tree get_vectype_for_scalar_type (tree);
+extern tree get_vectype_for_scalar_type_and_size (tree, poly_uint64);
 extern tree get_mask_type_for_scalar_type (tree);
 extern tree get_same_sized_vectype (tree, tree);
-extern bool vect_is_simple_use (tree, vec_info *, gimple **,
+extern bool vect_get_loop_mask_type (loop_vec_info);
-enum vect_def_type *);
+extern bool vect_is_simple_use (tree, vec_info *, enum vect_def_type *,
-extern bool vect_is_simple_use (tree, vec_info *, gimple **,
+				stmt_vec_info * = NULL, gimple ** = NULL);
-				enum vect_def_type *, tree *);
+extern bool vect_is_simple_use (tree, vec_info *, enum vect_def_type *,
-extern bool supportable_widening_operation (enum tree_code, gimple *, tree,
+				tree *, stmt_vec_info * = NULL,
-					    tree, enum tree_code *,
+				gimple ** = NULL);
+extern bool supportable_widening_operation (enum tree_code, stmt_vec_info,
+					    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> *);
-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 *,
-				    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 *,
+extern stmt_vec_info vect_finish_replace_stmt (stmt_vec_info, gimple *);
-gimple_stmt_iterator *);
+extern stmt_vec_info vect_finish_stmt_generation (stmt_vec_info, gimple *,
-extern bool vect_mark_stmts_to_be_vectorized (loop_vec_info);
+						  gimple_stmt_iterator *);
-extern tree vect_get_vec_def_for_operand_1 (gimple *, enum vect_def_type);
+extern opt_result vect_mark_stmts_to_be_vectorized (loop_vec_info);
-extern tree vect_get_vec_def_for_operand (tree, gimple *, tree = NULL);
+extern tree vect_get_store_rhs (stmt_vec_info);
-extern void vect_get_vec_defs (tree, tree, gimple *, vec<tree> *,
+extern tree vect_get_vec_def_for_operand_1 (stmt_vec_info, enum vect_def_type);
+extern tree vect_get_vec_def_for_operand (tree, stmt_vec_info, tree = NULL);
+extern void vect_get_vec_defs (tree, tree, stmt_vec_info, vec<tree> *,
 			       vec<tree> *, slp_tree);
-extern void vect_get_vec_defs_for_stmt_copy (enum vect_def_type *,
+extern void vect_get_vec_defs_for_stmt_copy (vec_info *,
 					     vec<tree> *, vec<tree> *);
-extern tree vect_init_vector (gimple *, tree, tree,
+extern tree vect_init_vector (stmt_vec_info, tree, tree,
 gimple_stmt_iterator *);
-extern tree vect_get_vec_def_for_stmt_copy (enum vect_def_type, tree);
+extern tree vect_get_vec_def_for_stmt_copy (vec_info *, tree);
-extern bool vect_transform_stmt (gimple *, gimple_stmt_iterator *,
+extern bool vect_transform_stmt (stmt_vec_info, gimple_stmt_iterator *,
-bool *, slp_tree, slp_instance);
+				 slp_tree, slp_instance);
-extern void vect_remove_stores (gimple *);
+extern void vect_remove_stores (stmt_vec_info);
-extern bool vect_analyze_stmt (gimple *, bool *, slp_tree, slp_instance);
+extern opt_result vect_analyze_stmt (stmt_vec_info, bool *, slp_tree,
-extern bool vectorizable_condition (gimple *, gimple_stmt_iterator *,
+				     slp_instance, stmt_vector_for_cost *);
-				    gimple **, tree, int, slp_tree);
+extern bool vectorizable_condition (stmt_vec_info, gimple_stmt_iterator *,
-extern void vect_get_load_cost (struct data_reference *, int, bool,
+				    stmt_vec_info *, tree, int, slp_tree,
+				    stmt_vector_for_cost *);
+extern void vect_get_load_cost (stmt_vec_info, int, bool,
 				unsigned int *, unsigned int *,
 				stmt_vector_for_cost *,
 				stmt_vector_for_cost *, bool);
-extern void vect_get_store_cost (struct data_reference *, int,
+extern void vect_get_store_cost (stmt_vec_info, 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_any (tree, const vec_perm_indices &);
-extern tree vect_gen_perm_mask_checked (tree, vec_perm_indices);
+extern tree vect_gen_perm_mask_checked (tree, const vec_perm_indices &);
 extern void optimize_mask_stores (struct loop*);
+extern gcall *vect_gen_while (tree, tree, tree);
+extern tree vect_gen_while_not (gimple_seq *, tree, tree, tree);
+extern opt_result vect_get_vector_types_for_stmt (stmt_vec_info, tree *,
+						  tree *);
+extern opt_tree vect_get_mask_type_for_stmt (stmt_vec_info);
 /* 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);
+(dr_vec_info *, bool);
-extern tree vect_get_smallest_scalar_type (gimple *, HOST_WIDE_INT *,
+extern tree vect_get_smallest_scalar_type (stmt_vec_info, HOST_WIDE_INT *,
 HOST_WIDE_INT *);
-extern bool vect_analyze_data_ref_dependences (loop_vec_info, int *);
+extern opt_result vect_analyze_data_ref_dependences (loop_vec_info, unsigned int *);
 extern bool vect_slp_analyze_instance_dependence (slp_instance);
-extern bool vect_enhance_data_refs_alignment (loop_vec_info);
+extern opt_result vect_enhance_data_refs_alignment (loop_vec_info);
-extern bool vect_analyze_data_refs_alignment (loop_vec_info);
+extern opt_result vect_analyze_data_refs_alignment (loop_vec_info);
-extern bool vect_verify_datarefs_alignment (loop_vec_info);
+extern opt_result 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 opt_result vect_analyze_data_ref_accesses (vec_info *);
-extern bool vect_prune_runtime_alias_test_list (loop_vec_info);
+extern opt_result vect_prune_runtime_alias_test_list (loop_vec_info);
-extern bool vect_check_gather_scatter (gimple *, loop_vec_info,
+extern bool vect_gather_scatter_fn_p (bool, bool, tree, tree, unsigned int,
+				      signop, int, internal_fn *, tree *);
+extern bool vect_check_gather_scatter (stmt_vec_info, loop_vec_info,
 				       gather_scatter_info *);
-extern bool vect_analyze_data_refs (vec_info *, int *);
+extern opt_result vect_find_stmt_data_reference (loop_p, gimple *,
+						 vec<data_reference_p> *);
+extern opt_result vect_analyze_data_refs (vec_info *, poly_uint64 *);
 extern void vect_record_base_alignments (vec_info *);
-extern tree vect_create_data_ref_ptr (gimple *, tree, struct loop *, tree,
+extern tree vect_create_data_ref_ptr (stmt_vec_info, tree, struct loop *, tree,
 				      tree *, gimple_stmt_iterator *,
-				      gimple **, bool, bool *,
+				      gimple **, bool,
-				      tree = NULL_TREE);
+				      tree = NULL_TREE, tree = NULL_TREE);
-extern tree bump_vector_ptr (tree, gimple *, gimple_stmt_iterator *, gimple *,
+extern tree bump_vector_ptr (tree, gimple *, gimple_stmt_iterator *,
-			     tree);
+			     stmt_vec_info, tree);
+extern void vect_copy_ref_info (tree, tree);
 extern tree vect_create_destination_var (tree, 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_store_lanes_supported (tree, unsigned HOST_WIDE_INT, bool);
 extern bool vect_grouped_load_supported (tree, bool, unsigned HOST_WIDE_INT);
-extern bool vect_load_lanes_supported (tree, unsigned HOST_WIDE_INT);
+extern bool vect_load_lanes_supported (tree, unsigned HOST_WIDE_INT, bool);
-extern void vect_permute_store_chain (vec<tree> ,unsigned int, gimple *,
+extern void vect_permute_store_chain (vec<tree> ,unsigned int, stmt_vec_info,
 gimple_stmt_iterator *, vec<tree> *);
-extern tree vect_setup_realignment (gimple *, gimple_stmt_iterator *, tree *,
+extern tree vect_setup_realignment (stmt_vec_info, gimple_stmt_iterator *,
-enum dr_alignment_support, tree,
+				    tree *, enum dr_alignment_support, tree,
 struct loop **);
-extern void vect_transform_grouped_load (gimple *, vec<tree> , int,
+extern void vect_transform_grouped_load (stmt_vec_info, vec<tree> , int,
 gimple_stmt_iterator *);
-extern void vect_record_grouped_load_vectors (gimple *, vec<tree> );
+extern void vect_record_grouped_load_vectors (stmt_vec_info, vec<tree>);
 extern tree vect_get_new_vect_var (tree, enum vect_var_kind, const char *);
 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 *,
+extern tree vect_create_addr_base_for_vector_ref (stmt_vec_info, gimple_seq *,
 						  tree, tree = NULL_TREE);
 /* In tree-vect-loop.c.  */
 /* FORNOW: Used in tree-parloops.c.  */
-extern gimple *vect_force_simple_reduction (loop_vec_info, gimple *,
+extern stmt_vec_info vect_force_simple_reduction (loop_vec_info, stmt_vec_info,
-					    bool *, bool);
+						  bool *, bool);
+/* Used in gimple-loop-interchange.c.  */
+extern bool check_reduction_path (dump_user_location_t, loop_p, gphi *, tree,
+				  enum tree_code);
 /* Drive for loop analysis stage.  */
-extern loop_vec_info vect_analyze_loop (struct loop *, loop_vec_info);
+extern opt_loop_vec_info vect_analyze_loop (struct loop *,
+					    loop_vec_info,
+					    vec_info_shared *);
 extern tree vect_build_loop_niters (loop_vec_info, bool * = NULL);
-extern void vect_gen_vector_loop_niters (loop_vec_info, tree, tree *, bool);
+extern void vect_gen_vector_loop_niters (loop_vec_info, tree, tree *,
+					 tree *, bool);
+extern tree vect_halve_mask_nunits (tree);
+extern tree vect_double_mask_nunits (tree);
+extern void vect_record_loop_mask (loop_vec_info, vec_loop_masks *,
+				   unsigned int, tree);
+extern tree vect_get_loop_mask (gimple_stmt_iterator *, vec_loop_masks *,
+				unsigned int, tree, unsigned int);
 /* Drive for loop transformation stage.  */
 extern struct loop *vect_transform_loop (loop_vec_info);
-extern loop_vec_info vect_analyze_loop_form (struct loop *);
+extern opt_loop_vec_info vect_analyze_loop_form (struct loop *,
-extern bool vectorizable_live_operation (gimple *, gimple_stmt_iterator *,
+						 vec_info_shared *);
-					 slp_tree, int, gimple **);
+extern bool vectorizable_live_operation (stmt_vec_info, gimple_stmt_iterator *,
-extern bool vectorizable_reduction (gimple *, gimple_stmt_iterator *,
+					 slp_tree, int, stmt_vec_info *,
-				    gimple **, slp_tree, slp_instance);
+					 stmt_vector_for_cost *);
-extern bool vectorizable_induction (gimple *, gimple_stmt_iterator *,
+extern bool vectorizable_reduction (stmt_vec_info, gimple_stmt_iterator *,
-				    gimple **, slp_tree);
+				    stmt_vec_info *, slp_tree, slp_instance,
-extern tree get_initial_def_for_reduction (gimple *, tree, tree *);
+				    stmt_vector_for_cost *);
+extern bool vectorizable_induction (stmt_vec_info, gimple_stmt_iterator *,
+				    stmt_vec_info *, slp_tree,
+				    stmt_vector_for_cost *);
+extern tree get_initial_def_for_reduction (stmt_vec_info, 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 *);
+extern tree cse_and_gimplify_to_preheader (loop_vec_info, tree);
 /* In tree-vect-slp.c.  */
-extern void vect_free_slp_instance (slp_instance);
+extern void vect_free_slp_instance (slp_instance, bool);
 extern bool vect_transform_slp_perm_load (slp_tree, vec<tree> ,
-gimple_stmt_iterator *, int,
+					  gimple_stmt_iterator *, poly_uint64,
-slp_instance, bool, unsigned *);
+					  slp_instance, bool, unsigned *);
 extern bool vect_slp_analyze_operations (vec_info *);
-extern bool vect_schedule_slp (vec_info *);
+extern void vect_schedule_slp (vec_info *);
-extern bool vect_analyze_slp (vec_info *, unsigned);
+extern opt_result 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 (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 stmt_vec_info vect_find_last_scalar_stmt_in_slp (slp_tree);
-extern bool is_simple_and_all_uses_invariant (gimple *, loop_vec_info);
+extern bool is_simple_and_all_uses_invariant (stmt_vec_info, loop_vec_info);
+extern bool can_duplicate_and_interleave_p (unsigned int, machine_mode,
+					    unsigned int * = NULL,
+					    tree * = NULL, tree * = NULL);
+extern void duplicate_and_interleave (gimple_seq *, tree, vec<tree>,
+				      unsigned int, vec<tree> &);
+extern int vect_get_place_in_interleaving_chain (stmt_vec_info, stmt_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) (vec<gimple *> *, tree *, tree *);
-#define NUM_PATTERNS 14
 void vect_pattern_recog (vec_info *);
 /* In tree-vectorizer.c.  */
 unsigned vectorize_loops (void);
-bool vect_stmt_in_region_p (vec_info *, gimple *);
 void vect_free_loop_info_assumptions (struct loop *);
 #endif  /* GCC_TREE_VECTORIZER_H  */

Mercurial > hg > CbC > CbC_gcc

comparison gcc/tree-vectorizer.h @ 131:84e7813d76e9