Branch data Line data Source code
1 : : /* Vectorizer
2 : : Copyright (C) 2003-2025 Free Software Foundation, Inc.
3 : : Contributed by Dorit Naishlos <dorit@il.ibm.com>
4 : :
5 : : This file is part of GCC.
6 : :
7 : : GCC is free software; you can redistribute it and/or modify it under
8 : : the terms of the GNU General Public License as published by the Free
9 : : Software Foundation; either version 3, or (at your option) any later
10 : : version.
11 : :
12 : : GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 : : WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 : : FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
15 : : for more details.
16 : :
17 : : You should have received a copy of the GNU General Public License
18 : : along with GCC; see the file COPYING3. If not see
19 : : <http://www.gnu.org/licenses/>. */
20 : :
21 : : #ifndef GCC_TREE_VECTORIZER_H
22 : : #define GCC_TREE_VECTORIZER_H
23 : :
24 : : typedef class _stmt_vec_info *stmt_vec_info;
25 : : typedef struct _slp_tree *slp_tree;
26 : :
27 : : #include "tree-data-ref.h"
28 : : #include "tree-hash-traits.h"
29 : : #include "target.h"
30 : : #include "internal-fn.h"
31 : : #include "tree-ssa-operands.h"
32 : : #include "gimple-match.h"
33 : : #include "dominance.h"
34 : :
35 : : /* Used for naming of new temporaries. */
36 : : enum vect_var_kind {
37 : : vect_simple_var,
38 : : vect_pointer_var,
39 : : vect_scalar_var,
40 : : vect_mask_var
41 : : };
42 : :
43 : : /* Defines type of operation. */
44 : : enum operation_type {
45 : : unary_op = 1,
46 : : binary_op,
47 : : ternary_op
48 : : };
49 : :
50 : : /* Define type of available alignment support. */
51 : : enum dr_alignment_support {
52 : : dr_unaligned_unsupported,
53 : : dr_unaligned_supported,
54 : : dr_explicit_realign,
55 : : dr_explicit_realign_optimized,
56 : : dr_aligned
57 : : };
58 : :
59 : : /* Define type of peeling support to indicate how peeling for alignment can help
60 : : make vectorization supported. */
61 : : enum peeling_support {
62 : : peeling_known_supported,
63 : : peeling_maybe_supported,
64 : : peeling_unsupported
65 : : };
66 : :
67 : : /* Define type of def-use cross-iteration cycle. */
68 : : enum vect_def_type {
69 : : vect_uninitialized_def = 0,
70 : : vect_constant_def = 1,
71 : : vect_external_def,
72 : : vect_internal_def,
73 : : vect_induction_def,
74 : : vect_reduction_def,
75 : : vect_double_reduction_def,
76 : : vect_nested_cycle,
77 : : vect_first_order_recurrence,
78 : : vect_condition_def,
79 : : vect_unknown_def_type
80 : : };
81 : :
82 : : /* Define operation type of linear/non-linear induction variable. */
83 : : enum vect_induction_op_type {
84 : : vect_step_op_add = 0,
85 : : vect_step_op_neg,
86 : : vect_step_op_mul,
87 : : vect_step_op_shl,
88 : : vect_step_op_shr
89 : : };
90 : :
91 : : /* Define type of reduction. */
92 : : enum vect_reduction_type {
93 : : TREE_CODE_REDUCTION,
94 : : COND_REDUCTION,
95 : : INTEGER_INDUC_COND_REDUCTION,
96 : : CONST_COND_REDUCTION,
97 : :
98 : : /* Retain a scalar phi and use a FOLD_EXTRACT_LAST within the loop
99 : : to implement:
100 : :
101 : : for (int i = 0; i < VF; ++i)
102 : : res = cond[i] ? val[i] : res; */
103 : : EXTRACT_LAST_REDUCTION,
104 : :
105 : : /* Use a folding reduction within the loop to implement:
106 : :
107 : : for (int i = 0; i < VF; ++i)
108 : : res = res OP val[i];
109 : :
110 : : (with no reassocation). */
111 : : FOLD_LEFT_REDUCTION
112 : : };
113 : :
114 : : #define VECTORIZABLE_CYCLE_DEF(D) (((D) == vect_reduction_def) \
115 : : || ((D) == vect_double_reduction_def) \
116 : : || ((D) == vect_nested_cycle))
117 : :
118 : : /* Structure to encapsulate information about a group of like
119 : : instructions to be presented to the target cost model. */
120 : : struct stmt_info_for_cost {
121 : : int count;
122 : : enum vect_cost_for_stmt kind;
123 : : enum vect_cost_model_location where;
124 : : stmt_vec_info stmt_info;
125 : : slp_tree node;
126 : : tree vectype;
127 : : int misalign;
128 : : };
129 : :
130 : : typedef vec<stmt_info_for_cost> stmt_vector_for_cost;
131 : :
132 : : /* Maps base addresses to an innermost_loop_behavior and the stmt it was
133 : : derived from that gives the maximum known alignment for that base. */
134 : : typedef hash_map<tree_operand_hash,
135 : : std::pair<stmt_vec_info, innermost_loop_behavior *> >
136 : : vec_base_alignments;
137 : :
138 : : /* Represents elements [START, START + LENGTH) of cyclical array OPS*
139 : : (i.e. OPS repeated to give at least START + LENGTH elements) */
140 : : struct vect_scalar_ops_slice
141 : : {
142 : : tree op (unsigned int i) const;
143 : : bool all_same_p () const;
144 : :
145 : : vec<tree> *ops;
146 : : unsigned int start;
147 : : unsigned int length;
148 : : };
149 : :
150 : : /* Return element I of the slice. */
151 : : inline tree
152 : 2700548 : vect_scalar_ops_slice::op (unsigned int i) const
153 : : {
154 : 5401096 : return (*ops)[(i + start) % ops->length ()];
155 : : }
156 : :
157 : : /* Hash traits for vect_scalar_ops_slice. */
158 : : struct vect_scalar_ops_slice_hash : typed_noop_remove<vect_scalar_ops_slice>
159 : : {
160 : : typedef vect_scalar_ops_slice value_type;
161 : : typedef vect_scalar_ops_slice compare_type;
162 : :
163 : : static const bool empty_zero_p = true;
164 : :
165 : : static void mark_deleted (value_type &s) { s.length = ~0U; }
166 : 0 : static void mark_empty (value_type &s) { s.length = 0; }
167 : 439998 : static bool is_deleted (const value_type &s) { return s.length == ~0U; }
168 : 4143208 : static bool is_empty (const value_type &s) { return s.length == 0; }
169 : : static hashval_t hash (const value_type &);
170 : : static bool equal (const value_type &, const compare_type &);
171 : : };
172 : :
173 : : /* Describes how we're going to vectorize an individual load or store,
174 : : or a group of loads or stores. */
175 : : enum vect_memory_access_type {
176 : : VMAT_UNINITIALIZED,
177 : :
178 : : /* An access to an invariant address. This is used only for loads. */
179 : : VMAT_INVARIANT,
180 : :
181 : : /* A simple contiguous access. */
182 : : VMAT_CONTIGUOUS,
183 : :
184 : : /* A contiguous access that goes down in memory rather than up,
185 : : with no additional permutation. This is used only for stores
186 : : of invariants. */
187 : : VMAT_CONTIGUOUS_DOWN,
188 : :
189 : : /* A simple contiguous access in which the elements need to be reversed
190 : : after loading or before storing. */
191 : : VMAT_CONTIGUOUS_REVERSE,
192 : :
193 : : /* An access that uses IFN_LOAD_LANES or IFN_STORE_LANES. */
194 : : VMAT_LOAD_STORE_LANES,
195 : :
196 : : /* An access in which each scalar element is loaded or stored
197 : : individually. */
198 : : VMAT_ELEMENTWISE,
199 : :
200 : : /* A hybrid of VMAT_CONTIGUOUS and VMAT_ELEMENTWISE, used for grouped
201 : : SLP accesses. Each unrolled iteration uses a contiguous load
202 : : or store for the whole group, but the groups from separate iterations
203 : : are combined in the same way as for VMAT_ELEMENTWISE. */
204 : : VMAT_STRIDED_SLP,
205 : :
206 : : /* The access uses gather loads or scatter stores. */
207 : : VMAT_GATHER_SCATTER_LEGACY,
208 : : VMAT_GATHER_SCATTER_IFN,
209 : : VMAT_GATHER_SCATTER_EMULATED
210 : : };
211 : :
212 : : /* Returns whether MAT is any of the VMAT_GATHER_SCATTER_* kinds. */
213 : :
214 : : inline bool
215 : 5824554 : mat_gather_scatter_p (vect_memory_access_type mat)
216 : : {
217 : 5824554 : return (mat == VMAT_GATHER_SCATTER_LEGACY
218 : : || mat == VMAT_GATHER_SCATTER_IFN
219 : 5824554 : || mat == VMAT_GATHER_SCATTER_EMULATED);
220 : : }
221 : :
222 : : /*-----------------------------------------------------------------*/
223 : : /* Info on vectorized defs. */
224 : : /*-----------------------------------------------------------------*/
225 : : enum stmt_vec_info_type {
226 : : undef_vec_info_type = 0,
227 : : load_vec_info_type,
228 : : store_vec_info_type,
229 : : shift_vec_info_type,
230 : : op_vec_info_type,
231 : : call_vec_info_type,
232 : : call_simd_clone_vec_info_type,
233 : : assignment_vec_info_type,
234 : : condition_vec_info_type,
235 : : comparison_vec_info_type,
236 : : reduc_vec_info_type,
237 : : induc_vec_info_type,
238 : : type_promotion_vec_info_type,
239 : : type_demotion_vec_info_type,
240 : : type_conversion_vec_info_type,
241 : : cycle_phi_info_type,
242 : : lc_phi_info_type,
243 : : phi_info_type,
244 : : recurr_info_type,
245 : : loop_exit_ctrl_vec_info_type,
246 : : permute_info_type
247 : : };
248 : :
249 : : /************************************************************************
250 : : SLP
251 : : ************************************************************************/
252 : : typedef vec<std::pair<unsigned, unsigned> > lane_permutation_t;
253 : : typedef auto_vec<std::pair<unsigned, unsigned>, 16> auto_lane_permutation_t;
254 : : typedef vec<unsigned> load_permutation_t;
255 : : typedef auto_vec<unsigned, 16> auto_load_permutation_t;
256 : :
257 : 3105378 : struct vect_data {
258 : 1951952 : virtual ~vect_data () = default;
259 : : };
260 : :
261 : : /* Analysis data from vectorizable_simd_clone_call for
262 : : call_simd_clone_vec_info_type. */
263 : : struct vect_simd_clone_data : vect_data {
264 : 1779 : virtual ~vect_simd_clone_data () = default;
265 : 1340 : vect_simd_clone_data () = default;
266 : 439 : vect_simd_clone_data (vect_simd_clone_data &&other) = default;
267 : :
268 : : /* Selected SIMD clone's function info. First vector element
269 : : is SIMD clone's function decl, followed by a pair of trees (base + step)
270 : : for linear arguments (pair of NULLs for other arguments). */
271 : : auto_vec<tree> simd_clone_info;
272 : : };
273 : :
274 : : /* Analysis data from vectorizable_load and vectorizable_store for
275 : : load_vec_info_type and store_vec_info_type. */
276 : : struct vect_load_store_data : vect_data {
277 : 1151647 : vect_load_store_data (vect_load_store_data &&other) = default;
278 : 1951952 : vect_load_store_data () = default;
279 : 3099702 : virtual ~vect_load_store_data () = default;
280 : :
281 : : vect_memory_access_type memory_access_type;
282 : : dr_alignment_support alignment_support_scheme;
283 : : int misalignment;
284 : : internal_fn lanes_ifn; // VMAT_LOAD_STORE_LANES
285 : : poly_int64 poffset;
286 : : union {
287 : : internal_fn ifn; // VMAT_GATHER_SCATTER_IFN
288 : : tree decl; // VMAT_GATHER_SCATTER_DECL
289 : : } gs;
290 : : tree strided_offset_vectype; // VMAT_GATHER_SCATTER_IFN, originally strided
291 : : auto_vec<int> elsvals;
292 : : unsigned n_perms; // SLP_TREE_LOAD_PERMUTATION
293 : : };
294 : :
295 : : /* A computation tree of an SLP instance. Each node corresponds to a group of
296 : : stmts to be packed in a SIMD stmt. */
297 : : struct _slp_tree {
298 : : _slp_tree ();
299 : : ~_slp_tree ();
300 : :
301 : : void push_vec_def (gimple *def);
302 : 7663 : void push_vec_def (tree def) { vec_defs.quick_push (def); }
303 : :
304 : : /* Nodes that contain def-stmts of this node statements operands. */
305 : : vec<slp_tree> children;
306 : :
307 : : /* A group of scalar stmts to be vectorized together. */
308 : : vec<stmt_vec_info> stmts;
309 : : /* A group of scalar operands to be vectorized together. */
310 : : vec<tree> ops;
311 : : /* The representative that should be used for analysis and
312 : : code generation. */
313 : : stmt_vec_info representative;
314 : :
315 : : struct {
316 : : /* SLP cycle the node resides in, or -1. */
317 : : int id;
318 : : /* The SLP operand index with the edge on the SLP cycle, or -1. */
319 : : int reduc_idx;
320 : : } cycle_info;
321 : :
322 : : /* Load permutation relative to the stores, NULL if there is no
323 : : permutation. */
324 : : load_permutation_t load_permutation;
325 : : /* Lane permutation of the operands scalar lanes encoded as pairs
326 : : of { operand number, lane number }. The number of elements
327 : : denotes the number of output lanes. */
328 : : lane_permutation_t lane_permutation;
329 : :
330 : : tree vectype;
331 : : /* Vectorized defs. */
332 : : vec<tree> vec_defs;
333 : :
334 : : /* Reference count in the SLP graph. */
335 : : unsigned int refcnt;
336 : : /* The maximum number of vector elements for the subtree rooted
337 : : at this node. */
338 : : poly_uint64 max_nunits;
339 : : /* The DEF type of this node. */
340 : : enum vect_def_type def_type;
341 : : /* The number of scalar lanes produced by this node. */
342 : : unsigned int lanes;
343 : : /* The operation of this node. */
344 : : enum tree_code code;
345 : : /* For gather/scatter memory operations the scale each offset element
346 : : should be multiplied by before being added to the base. */
347 : : int gs_scale;
348 : : /* For gather/scatter memory operations the loop-invariant base value. */
349 : : tree gs_base;
350 : : /* Whether uses of this load or feeders of this store are suitable
351 : : for load/store-lanes. */
352 : : bool ldst_lanes;
353 : : /* For BB vect, flag to indicate this load node should be vectorized
354 : : as to avoid STLF fails because of related stores. */
355 : : bool avoid_stlf_fail;
356 : :
357 : : int vertex;
358 : :
359 : : /* The kind of operation as determined by analysis and optional
360 : : kind specific data. */
361 : : enum stmt_vec_info_type type;
362 : : vect_data *data;
363 : :
364 : : template <class T>
365 : 1953292 : T& get_data (T& else_) { return data ? *static_cast <T *> (data) : else_; }
366 : :
367 : : /* If not NULL this is a cached failed SLP discovery attempt with
368 : : the lanes that failed during SLP discovery as 'false'. This is
369 : : a copy of the matches array. */
370 : : bool *failed;
371 : :
372 : : /* Allocate from slp_tree_pool. */
373 : : static void *operator new (size_t);
374 : :
375 : : /* Return memory to slp_tree_pool. */
376 : : static void operator delete (void *, size_t);
377 : :
378 : : /* Linked list of nodes to release when we free the slp_tree_pool. */
379 : : slp_tree next_node;
380 : : slp_tree prev_node;
381 : : };
382 : :
383 : : /* The enum describes the type of operations that an SLP instance
384 : : can perform. */
385 : :
386 : : enum slp_instance_kind {
387 : : slp_inst_kind_store,
388 : : slp_inst_kind_reduc_group,
389 : : slp_inst_kind_reduc_chain,
390 : : slp_inst_kind_bb_reduc,
391 : : slp_inst_kind_ctor,
392 : : slp_inst_kind_gcond
393 : : };
394 : :
395 : : /* SLP instance is a sequence of stmts in a loop that can be packed into
396 : : SIMD stmts. */
397 : : typedef class _slp_instance {
398 : : public:
399 : : /* The root of SLP tree. */
400 : : slp_tree root;
401 : :
402 : : /* For vector constructors, the constructor stmt that the SLP tree is built
403 : : from, NULL otherwise. */
404 : : vec<stmt_vec_info> root_stmts;
405 : :
406 : : /* For slp_inst_kind_bb_reduc the defs that were not vectorized, NULL
407 : : otherwise. */
408 : : vec<tree> remain_defs;
409 : :
410 : : /* The group of nodes that contain loads of this SLP instance. */
411 : : vec<slp_tree> loads;
412 : :
413 : : /* The SLP node containing the reduction PHIs. */
414 : : slp_tree reduc_phis;
415 : :
416 : : /* Vector cost of this entry to the SLP graph. */
417 : : stmt_vector_for_cost cost_vec;
418 : :
419 : : /* If this instance is the main entry of a subgraph the set of
420 : : entries into the same subgraph, including itself. */
421 : : vec<_slp_instance *> subgraph_entries;
422 : :
423 : : /* The type of operation the SLP instance is performing. */
424 : : slp_instance_kind kind;
425 : :
426 : : dump_user_location_t location () const;
427 : : } *slp_instance;
428 : :
429 : :
430 : : /* Access Functions. */
431 : : #define SLP_INSTANCE_TREE(S) (S)->root
432 : : #define SLP_INSTANCE_LOADS(S) (S)->loads
433 : : #define SLP_INSTANCE_ROOT_STMTS(S) (S)->root_stmts
434 : : #define SLP_INSTANCE_REMAIN_DEFS(S) (S)->remain_defs
435 : : #define SLP_INSTANCE_KIND(S) (S)->kind
436 : :
437 : : #define SLP_TREE_CHILDREN(S) (S)->children
438 : : #define SLP_TREE_SCALAR_STMTS(S) (S)->stmts
439 : : #define SLP_TREE_SCALAR_OPS(S) (S)->ops
440 : : #define SLP_TREE_REF_COUNT(S) (S)->refcnt
441 : : #define SLP_TREE_VEC_DEFS(S) (S)->vec_defs
442 : : #define SLP_TREE_LOAD_PERMUTATION(S) (S)->load_permutation
443 : : #define SLP_TREE_LANE_PERMUTATION(S) (S)->lane_permutation
444 : : #define SLP_TREE_DEF_TYPE(S) (S)->def_type
445 : : #define SLP_TREE_VECTYPE(S) (S)->vectype
446 : : #define SLP_TREE_REPRESENTATIVE(S) (S)->representative
447 : : #define SLP_TREE_LANES(S) (S)->lanes
448 : : #define SLP_TREE_CODE(S) (S)->code
449 : : #define SLP_TREE_TYPE(S) (S)->type
450 : : #define SLP_TREE_GS_SCALE(S) (S)->gs_scale
451 : : #define SLP_TREE_GS_BASE(S) (S)->gs_base
452 : : #define SLP_TREE_REDUC_IDX(S) (S)->cycle_info.reduc_idx
453 : : #define SLP_TREE_PERMUTE_P(S) ((S)->code == VEC_PERM_EXPR)
454 : :
455 : : inline vect_memory_access_type
456 : 1266369 : SLP_TREE_MEMORY_ACCESS_TYPE (slp_tree node)
457 : : {
458 : 496688 : if (SLP_TREE_TYPE (node) == load_vec_info_type
459 : 432231 : || SLP_TREE_TYPE (node) == store_vec_info_type)
460 : 254019 : return static_cast<vect_load_store_data *> (node->data)->memory_access_type;
461 : : return VMAT_UNINITIALIZED;
462 : : }
463 : :
464 : : enum vect_partial_vector_style {
465 : : vect_partial_vectors_none,
466 : : vect_partial_vectors_while_ult,
467 : : vect_partial_vectors_avx512,
468 : : vect_partial_vectors_len
469 : : };
470 : :
471 : : /* Key for map that records association between
472 : : scalar conditions and corresponding loop mask, and
473 : : is populated by vect_record_loop_mask. */
474 : :
475 : : struct scalar_cond_masked_key
476 : : {
477 : 50912 : scalar_cond_masked_key (tree t, unsigned ncopies_)
478 : 50912 : : ncopies (ncopies_)
479 : : {
480 : 50912 : get_cond_ops_from_tree (t);
481 : : }
482 : :
483 : : void get_cond_ops_from_tree (tree);
484 : :
485 : : unsigned ncopies;
486 : : bool inverted_p;
487 : : tree_code code;
488 : : tree op0;
489 : : tree op1;
490 : : };
491 : :
492 : : template<>
493 : : struct default_hash_traits<scalar_cond_masked_key>
494 : : {
495 : : typedef scalar_cond_masked_key compare_type;
496 : : typedef scalar_cond_masked_key value_type;
497 : :
498 : : static inline hashval_t
499 : 58709 : hash (value_type v)
500 : : {
501 : 58709 : inchash::hash h;
502 : 58709 : h.add_int (v.code);
503 : 58709 : inchash::add_expr (v.op0, h, 0);
504 : 58709 : inchash::add_expr (v.op1, h, 0);
505 : 58709 : h.add_int (v.ncopies);
506 : 58709 : h.add_flag (v.inverted_p);
507 : 58709 : return h.end ();
508 : : }
509 : :
510 : : static inline bool
511 : 8854 : equal (value_type existing, value_type candidate)
512 : : {
513 : 8854 : return (existing.ncopies == candidate.ncopies
514 : 8834 : && existing.code == candidate.code
515 : 5080 : && existing.inverted_p == candidate.inverted_p
516 : 3529 : && operand_equal_p (existing.op0, candidate.op0, 0)
517 : 10800 : && operand_equal_p (existing.op1, candidate.op1, 0));
518 : : }
519 : :
520 : : static const bool empty_zero_p = true;
521 : :
522 : : static inline void
523 : 0 : mark_empty (value_type &v)
524 : : {
525 : 0 : v.ncopies = 0;
526 : 0 : v.inverted_p = false;
527 : : }
528 : :
529 : : static inline bool
530 : 6775095 : is_empty (value_type v)
531 : : {
532 : 6724196 : return v.ncopies == 0;
533 : : }
534 : :
535 : : static inline void mark_deleted (value_type &) {}
536 : :
537 : : static inline bool is_deleted (const value_type &)
538 : : {
539 : : return false;
540 : : }
541 : :
542 : 44167 : static inline void remove (value_type &) {}
543 : : };
544 : :
545 : : typedef hash_set<scalar_cond_masked_key> scalar_cond_masked_set_type;
546 : :
547 : : /* Key and map that records association between vector conditions and
548 : : corresponding loop mask, and is populated by prepare_vec_mask. */
549 : :
550 : : typedef pair_hash<tree_operand_hash, tree_operand_hash> tree_cond_mask_hash;
551 : : typedef hash_set<tree_cond_mask_hash> vec_cond_masked_set_type;
552 : :
553 : : /* Describes two objects whose addresses must be unequal for the vectorized
554 : : loop to be valid. */
555 : : typedef std::pair<tree, tree> vec_object_pair;
556 : :
557 : : /* Records that vectorization is only possible if abs (EXPR) >= MIN_VALUE.
558 : : UNSIGNED_P is true if we can assume that abs (EXPR) == EXPR. */
559 : : class vec_lower_bound {
560 : : public:
561 : : vec_lower_bound () {}
562 : 1478 : vec_lower_bound (tree e, bool u, poly_uint64 m)
563 : 1478 : : expr (e), unsigned_p (u), min_value (m) {}
564 : :
565 : : tree expr;
566 : : bool unsigned_p;
567 : : poly_uint64 min_value;
568 : : };
569 : :
570 : : /* Vectorizer state shared between different analyses like vector sizes
571 : : of the same CFG region. */
572 : : class vec_info_shared {
573 : : public:
574 : : vec_info_shared();
575 : : ~vec_info_shared();
576 : :
577 : : void save_datarefs();
578 : : void check_datarefs();
579 : :
580 : : /* All data references. Freed by free_data_refs, so not an auto_vec. */
581 : : vec<data_reference_p> datarefs;
582 : : vec<data_reference> datarefs_copy;
583 : :
584 : : /* The loop nest in which the data dependences are computed. */
585 : : auto_vec<loop_p> loop_nest;
586 : :
587 : : /* All data dependences. Freed by free_dependence_relations, so not
588 : : an auto_vec. */
589 : : vec<ddr_p> ddrs;
590 : : };
591 : :
592 : : /* Vectorizer state common between loop and basic-block vectorization. */
593 : : class vec_info {
594 : : public:
595 : : typedef hash_set<int_hash<machine_mode, E_VOIDmode, E_BLKmode> > mode_set;
596 : : enum vec_kind { bb, loop };
597 : :
598 : : vec_info (vec_kind, vec_info_shared *);
599 : : ~vec_info ();
600 : :
601 : : stmt_vec_info add_stmt (gimple *);
602 : : stmt_vec_info add_pattern_stmt (gimple *, stmt_vec_info);
603 : : stmt_vec_info resync_stmt_addr (gimple *);
604 : : stmt_vec_info lookup_stmt (gimple *);
605 : : stmt_vec_info lookup_def (tree);
606 : : stmt_vec_info lookup_single_use (tree);
607 : : class dr_vec_info *lookup_dr (data_reference *);
608 : : void move_dr (stmt_vec_info, stmt_vec_info);
609 : : void remove_stmt (stmt_vec_info);
610 : : void replace_stmt (gimple_stmt_iterator *, stmt_vec_info, gimple *);
611 : : void insert_on_entry (stmt_vec_info, gimple *);
612 : : void insert_seq_on_entry (stmt_vec_info, gimple_seq);
613 : :
614 : : /* The type of vectorization. */
615 : : vec_kind kind;
616 : :
617 : : /* Shared vectorizer state. */
618 : : vec_info_shared *shared;
619 : :
620 : : /* The mapping of GIMPLE UID to stmt_vec_info. */
621 : : vec<stmt_vec_info> stmt_vec_infos;
622 : : /* Whether the above mapping is complete. */
623 : : bool stmt_vec_info_ro;
624 : :
625 : : /* Whether we've done a transform we think OK to not update virtual
626 : : SSA form. */
627 : : bool any_known_not_updated_vssa;
628 : :
629 : : /* The SLP graph. */
630 : : auto_vec<slp_instance> slp_instances;
631 : :
632 : : /* Maps base addresses to an innermost_loop_behavior that gives the maximum
633 : : known alignment for that base. */
634 : : vec_base_alignments base_alignments;
635 : :
636 : : /* All interleaving chains of stores, represented by the first
637 : : stmt in the chain. */
638 : : auto_vec<stmt_vec_info> grouped_stores;
639 : :
640 : : /* The set of vector modes used in the vectorized region. */
641 : : mode_set used_vector_modes;
642 : :
643 : : /* The argument we should pass to related_vector_mode when looking up
644 : : the vector mode for a scalar mode, or VOIDmode if we haven't yet
645 : : made any decisions about which vector modes to use. */
646 : : machine_mode vector_mode;
647 : :
648 : : /* The basic blocks in the vectorization region. For _loop_vec_info,
649 : : the memory is internally managed, while for _bb_vec_info, it points
650 : : to element space of an external auto_vec<>. This inconsistency is
651 : : not a good class design pattern. TODO: improve it with an unified
652 : : auto_vec<> whose lifetime is confined to vec_info object. */
653 : : basic_block *bbs;
654 : :
655 : : /* The count of the basic blocks in the vectorization region. */
656 : : unsigned int nbbs;
657 : :
658 : : /* Used to keep a sequence of def stmts of a pattern stmt that are loop
659 : : invariant if they exists.
660 : : The sequence is emitted in the loop preheader should the loop be vectorized
661 : : and are reset when undoing patterns. */
662 : : gimple_seq inv_pattern_def_seq;
663 : :
664 : : private:
665 : : stmt_vec_info new_stmt_vec_info (gimple *stmt);
666 : : void set_vinfo_for_stmt (gimple *, stmt_vec_info, bool = true);
667 : : void free_stmt_vec_infos ();
668 : : void free_stmt_vec_info (stmt_vec_info);
669 : : };
670 : :
671 : : class _loop_vec_info;
672 : : class _bb_vec_info;
673 : :
674 : : template<>
675 : : template<>
676 : : inline bool
677 : 357679739 : is_a_helper <_loop_vec_info *>::test (vec_info *i)
678 : : {
679 : 357042919 : return i->kind == vec_info::loop;
680 : : }
681 : :
682 : : template<>
683 : : template<>
684 : : inline bool
685 : 71518315 : is_a_helper <_bb_vec_info *>::test (vec_info *i)
686 : : {
687 : 71518315 : return i->kind == vec_info::bb;
688 : : }
689 : :
690 : : /* In general, we can divide the vector statements in a vectorized loop
691 : : into related groups ("rgroups") and say that for each rgroup there is
692 : : some nS such that the rgroup operates on nS values from one scalar
693 : : iteration followed by nS values from the next. That is, if VF is the
694 : : vectorization factor of the loop, the rgroup operates on a sequence:
695 : :
696 : : (1,1) (1,2) ... (1,nS) (2,1) ... (2,nS) ... (VF,1) ... (VF,nS)
697 : :
698 : : where (i,j) represents a scalar value with index j in a scalar
699 : : iteration with index i.
700 : :
701 : : [ We use the term "rgroup" to emphasise that this grouping isn't
702 : : necessarily the same as the grouping of statements used elsewhere.
703 : : For example, if we implement a group of scalar loads using gather
704 : : loads, we'll use a separate gather load for each scalar load, and
705 : : thus each gather load will belong to its own rgroup. ]
706 : :
707 : : In general this sequence will occupy nV vectors concatenated
708 : : together. If these vectors have nL lanes each, the total number
709 : : of scalar values N is given by:
710 : :
711 : : N = nS * VF = nV * nL
712 : :
713 : : None of nS, VF, nV and nL are required to be a power of 2. nS and nV
714 : : are compile-time constants but VF and nL can be variable (if the target
715 : : supports variable-length vectors).
716 : :
717 : : In classical vectorization, each iteration of the vector loop would
718 : : handle exactly VF iterations of the original scalar loop. However,
719 : : in vector loops that are able to operate on partial vectors, a
720 : : particular iteration of the vector loop might handle fewer than VF
721 : : iterations of the scalar loop. The vector lanes that correspond to
722 : : iterations of the scalar loop are said to be "active" and the other
723 : : lanes are said to be "inactive".
724 : :
725 : : In such vector loops, many rgroups need to be controlled to ensure
726 : : that they have no effect for the inactive lanes. Conceptually, each
727 : : such rgroup needs a sequence of booleans in the same order as above,
728 : : but with each (i,j) replaced by a boolean that indicates whether
729 : : iteration i is active. This sequence occupies nV vector controls
730 : : that again have nL lanes each. Thus the control sequence as a whole
731 : : consists of VF independent booleans that are each repeated nS times.
732 : :
733 : : Taking mask-based approach as a partially-populated vectors example.
734 : : We make the simplifying assumption that if a sequence of nV masks is
735 : : suitable for one (nS,nL) pair, we can reuse it for (nS/2,nL/2) by
736 : : VIEW_CONVERTing it. This holds for all current targets that support
737 : : fully-masked loops. For example, suppose the scalar loop is:
738 : :
739 : : float *f;
740 : : double *d;
741 : : for (int i = 0; i < n; ++i)
742 : : {
743 : : f[i * 2 + 0] += 1.0f;
744 : : f[i * 2 + 1] += 2.0f;
745 : : d[i] += 3.0;
746 : : }
747 : :
748 : : and suppose that vectors have 256 bits. The vectorized f accesses
749 : : will belong to one rgroup and the vectorized d access to another:
750 : :
751 : : f rgroup: nS = 2, nV = 1, nL = 8
752 : : d rgroup: nS = 1, nV = 1, nL = 4
753 : : VF = 4
754 : :
755 : : [ In this simple example the rgroups do correspond to the normal
756 : : SLP grouping scheme. ]
757 : :
758 : : If only the first three lanes are active, the masks we need are:
759 : :
760 : : f rgroup: 1 1 | 1 1 | 1 1 | 0 0
761 : : d rgroup: 1 | 1 | 1 | 0
762 : :
763 : : Here we can use a mask calculated for f's rgroup for d's, but not
764 : : vice versa.
765 : :
766 : : Thus for each value of nV, it is enough to provide nV masks, with the
767 : : mask being calculated based on the highest nL (or, equivalently, based
768 : : on the highest nS) required by any rgroup with that nV. We therefore
769 : : represent the entire collection of masks as a two-level table, with the
770 : : first level being indexed by nV - 1 (since nV == 0 doesn't exist) and
771 : : the second being indexed by the mask index 0 <= i < nV. */
772 : :
773 : : /* The controls (like masks or lengths) needed by rgroups with nV vectors,
774 : : according to the description above. */
775 : : struct rgroup_controls {
776 : : /* The largest nS for all rgroups that use these controls.
777 : : For vect_partial_vectors_avx512 this is the constant nscalars_per_iter
778 : : for all members of the group. */
779 : : unsigned int max_nscalars_per_iter;
780 : :
781 : : /* For the largest nS recorded above, the loop controls divide each scalar
782 : : into FACTOR equal-sized pieces. This is useful if we need to split
783 : : element-based accesses into byte-based accesses.
784 : : For vect_partial_vectors_avx512 this records nV instead. */
785 : : unsigned int factor;
786 : :
787 : : /* This is a vector type with MAX_NSCALARS_PER_ITER * VF / nV elements.
788 : : For mask-based controls, it is the type of the masks in CONTROLS.
789 : : For length-based controls, it can be any vector type that has the
790 : : specified number of elements; the type of the elements doesn't matter. */
791 : : tree type;
792 : :
793 : : /* When there is no uniformly used LOOP_VINFO_RGROUP_COMPARE_TYPE this
794 : : is the rgroup specific type used. */
795 : : tree compare_type;
796 : :
797 : : /* A vector of nV controls, in iteration order. */
798 : : vec<tree> controls;
799 : :
800 : : /* In case of len_load and len_store with a bias there is only one
801 : : rgroup. This holds the adjusted loop length for the this rgroup. */
802 : : tree bias_adjusted_ctrl;
803 : : };
804 : :
805 : 414444 : struct vec_loop_masks
806 : : {
807 : 342372 : bool is_empty () const { return mask_set.is_empty (); }
808 : :
809 : : /* Set to record vectype, nvector pairs. */
810 : : hash_set<pair_hash <nofree_ptr_hash <tree_node>,
811 : : int_hash<unsigned, 0>>> mask_set;
812 : :
813 : : /* rgroup_controls used for the partial vector scheme. */
814 : : auto_vec<rgroup_controls> rgc_vec;
815 : : };
816 : :
817 : : typedef auto_vec<rgroup_controls> vec_loop_lens;
818 : :
819 : : typedef auto_vec<std::pair<data_reference*, tree> > drs_init_vec;
820 : :
821 : : /* Abstraction around info on reductions which is still in stmt_vec_info
822 : : but will be duplicated or moved elsewhere. */
823 : 130850 : class vect_reduc_info_s
824 : : {
825 : : public:
826 : : /* The def type of the main reduction PHI, vect_reduction_def or
827 : : vect_double_reduction_def. */
828 : : enum vect_def_type def_type;
829 : :
830 : : /* The reduction type as detected by
831 : : vect_is_simple_reduction and vectorizable_reduction. */
832 : : enum vect_reduction_type reduc_type;
833 : :
834 : : /* The original scalar reduction code, to be used in the epilogue. */
835 : : code_helper reduc_code;
836 : :
837 : : /* A vector internal function we should use in the epilogue. */
838 : : internal_fn reduc_fn;
839 : :
840 : : /* For loop reduction with multiple vectorized results (ncopies > 1), a
841 : : lane-reducing operation participating in it may not use all of those
842 : : results, this field specifies result index starting from which any
843 : : following land-reducing operation would be assigned to. */
844 : : unsigned int reduc_result_pos;
845 : :
846 : : /* Whether we force a single cycle PHI during reduction vectorization. */
847 : : bool force_single_cycle;
848 : :
849 : : /* The vector type for performing the actual reduction operation. */
850 : : tree reduc_vectype;
851 : :
852 : : /* For INTEGER_INDUC_COND_REDUCTION, the initial value to be used. */
853 : : tree induc_cond_initial_val;
854 : :
855 : : /* If not NULL the value to be added to compute final reduction value. */
856 : : tree reduc_epilogue_adjustment;
857 : :
858 : : /* If non-null, the reduction is being performed by an epilogue loop
859 : : and we have decided to reuse this accumulator from the main loop. */
860 : : struct vect_reusable_accumulator *reused_accumulator;
861 : :
862 : : /* If the vector code is performing N scalar reductions in parallel,
863 : : this variable gives the initial scalar values of those N reductions. */
864 : : auto_vec<tree> reduc_initial_values;
865 : :
866 : : /* If the vector code is performing N scalar reductions in parallel, this
867 : : variable gives the vectorized code's final (scalar) result for each of
868 : : those N reductions. In other words, REDUC_SCALAR_RESULTS[I] replaces
869 : : the original scalar code's loop-closed SSA PHI for reduction number I. */
870 : : auto_vec<tree> reduc_scalar_results;
871 : : };
872 : :
873 : : typedef class vect_reduc_info_s *vect_reduc_info;
874 : :
875 : : #define VECT_REDUC_INFO_DEF_TYPE(I) ((I)->def_type)
876 : : #define VECT_REDUC_INFO_TYPE(I) ((I)->reduc_type)
877 : : #define VECT_REDUC_INFO_CODE(I) ((I)->reduc_code)
878 : : #define VECT_REDUC_INFO_FN(I) ((I)->reduc_fn)
879 : : #define VECT_REDUC_INFO_SCALAR_RESULTS(I) ((I)->reduc_scalar_results)
880 : : #define VECT_REDUC_INFO_INITIAL_VALUES(I) ((I)->reduc_initial_values)
881 : : #define VECT_REDUC_INFO_REUSED_ACCUMULATOR(I) ((I)->reused_accumulator)
882 : : #define VECT_REDUC_INFO_INDUC_COND_INITIAL_VAL(I) ((I)->induc_cond_initial_val)
883 : : #define VECT_REDUC_INFO_EPILOGUE_ADJUSTMENT(I) ((I)->reduc_epilogue_adjustment)
884 : : #define VECT_REDUC_INFO_VECTYPE(I) ((I)->reduc_vectype)
885 : : #define VECT_REDUC_INFO_FORCE_SINGLE_CYCLE(I) ((I)->force_single_cycle)
886 : : #define VECT_REDUC_INFO_RESULT_POS(I) ((I)->reduc_result_pos)
887 : :
888 : : /* Information about a reduction accumulator from the main loop that could
889 : : conceivably be reused as the input to a reduction in an epilogue loop. */
890 : : struct vect_reusable_accumulator {
891 : : /* The final value of the accumulator, which forms the input to the
892 : : reduction operation. */
893 : : tree reduc_input;
894 : :
895 : : /* The stmt_vec_info that describes the reduction (i.e. the one for
896 : : which is_reduc_info is true). */
897 : : vect_reduc_info reduc_info;
898 : : };
899 : :
900 : : /*-----------------------------------------------------------------*/
901 : : /* Info on vectorized loops. */
902 : : /*-----------------------------------------------------------------*/
903 : : typedef class _loop_vec_info : public vec_info {
904 : : public:
905 : : _loop_vec_info (class loop *, vec_info_shared *);
906 : : ~_loop_vec_info ();
907 : :
908 : : /* The loop to which this info struct refers to. */
909 : : class loop *loop;
910 : :
911 : : /* Number of latch executions. */
912 : : tree num_itersm1;
913 : : /* Number of iterations. */
914 : : tree num_iters;
915 : : /* Number of iterations of the original loop. */
916 : : tree num_iters_unchanged;
917 : : /* Condition under which this loop is analyzed and versioned. */
918 : : tree num_iters_assumptions;
919 : :
920 : : /* The cost of the vector code. */
921 : : class vector_costs *vector_costs;
922 : :
923 : : /* The cost of the scalar code. */
924 : : class vector_costs *scalar_costs;
925 : :
926 : : /* Threshold of number of iterations below which vectorization will not be
927 : : performed. It is calculated from MIN_PROFITABLE_ITERS and
928 : : param_min_vect_loop_bound. */
929 : : unsigned int th;
930 : :
931 : : /* When applying loop versioning, the vector form should only be used
932 : : if the number of scalar iterations is >= this value, on top of all
933 : : the other requirements. Ignored when loop versioning is not being
934 : : used. */
935 : : poly_uint64 versioning_threshold;
936 : :
937 : : /* Unrolling factor */
938 : : poly_uint64 vectorization_factor;
939 : :
940 : : /* If this loop is an epilogue loop whose main loop can be skipped,
941 : : MAIN_LOOP_EDGE is the edge from the main loop to this loop's
942 : : preheader. SKIP_MAIN_LOOP_EDGE is then the edge that skips the
943 : : main loop and goes straight to this loop's preheader.
944 : :
945 : : Both fields are null otherwise. */
946 : : edge main_loop_edge;
947 : : edge skip_main_loop_edge;
948 : :
949 : : /* If this loop is an epilogue loop that might be skipped after executing
950 : : the main loop, this edge is the one that skips the epilogue. */
951 : : edge skip_this_loop_edge;
952 : :
953 : : /* Reduction descriptors of this loop. Referenced to from SLP nodes
954 : : by index. */
955 : : auto_vec<vect_reduc_info> reduc_infos;
956 : :
957 : : /* The vectorized form of a standard reduction replaces the original
958 : : scalar code's final result (a loop-closed SSA PHI) with the result
959 : : of a vector-to-scalar reduction operation. After vectorization,
960 : : this variable maps these vector-to-scalar results to information
961 : : about the reductions that generated them. */
962 : : hash_map<tree, vect_reusable_accumulator> reusable_accumulators;
963 : :
964 : : /* The number of times that the target suggested we unroll the vector loop
965 : : in order to promote more ILP. This value will be used to re-analyze the
966 : : loop for vectorization and if successful the value will be folded into
967 : : vectorization_factor (and therefore exactly divides
968 : : vectorization_factor). */
969 : : unsigned int suggested_unroll_factor;
970 : :
971 : : /* Maximum runtime vectorization factor, or MAX_VECTORIZATION_FACTOR
972 : : if there is no particular limit. */
973 : : unsigned HOST_WIDE_INT max_vectorization_factor;
974 : :
975 : : /* The masks that a fully-masked loop should use to avoid operating
976 : : on inactive scalars. */
977 : : vec_loop_masks masks;
978 : :
979 : : /* The lengths that a loop with length should use to avoid operating
980 : : on inactive scalars. */
981 : : vec_loop_lens lens;
982 : :
983 : : /* Set of scalar conditions that have loop mask applied. */
984 : : scalar_cond_masked_set_type scalar_cond_masked_set;
985 : :
986 : : /* Set of vector conditions that have loop mask applied. */
987 : : vec_cond_masked_set_type vec_cond_masked_set;
988 : :
989 : : /* If we are using a loop mask to align memory addresses, this variable
990 : : contains the number of vector elements that we should skip in the
991 : : first iteration of the vector loop (i.e. the number of leading
992 : : elements that should be false in the first mask). */
993 : : tree mask_skip_niters;
994 : :
995 : : /* If we are using a loop mask to align memory addresses and we're in an
996 : : early break loop then this variable contains the number of elements that
997 : : were skipped during the initial iteration of the loop. */
998 : : tree mask_skip_niters_pfa_offset;
999 : :
1000 : : /* The type that the loop control IV should be converted to before
1001 : : testing which of the VF scalars are active and inactive.
1002 : : Only meaningful if LOOP_VINFO_USING_PARTIAL_VECTORS_P. */
1003 : : tree rgroup_compare_type;
1004 : :
1005 : : /* For #pragma omp simd if (x) loops the x expression. If constant 0,
1006 : : the loop should not be vectorized, if constant non-zero, simd_if_cond
1007 : : shouldn't be set and loop vectorized normally, if SSA_NAME, the loop
1008 : : should be versioned on that condition, using scalar loop if the condition
1009 : : is false and vectorized loop otherwise. */
1010 : : tree simd_if_cond;
1011 : :
1012 : : /* The type that the vector loop control IV should have when
1013 : : LOOP_VINFO_USING_PARTIAL_VECTORS_P is true. */
1014 : : tree rgroup_iv_type;
1015 : :
1016 : : /* The style used for implementing partial vectors when
1017 : : LOOP_VINFO_USING_PARTIAL_VECTORS_P is true. */
1018 : : vect_partial_vector_style partial_vector_style;
1019 : :
1020 : : /* Unknown DRs according to which loop was peeled. */
1021 : : class dr_vec_info *unaligned_dr;
1022 : :
1023 : : /* peeling_for_alignment indicates whether peeling for alignment will take
1024 : : place, and what the peeling factor should be:
1025 : : peeling_for_alignment = X means:
1026 : : If X=0: Peeling for alignment will not be applied.
1027 : : If X>0: Peel first X iterations.
1028 : : If X=-1: Generate a runtime test to calculate the number of iterations
1029 : : to be peeled, using the dataref recorded in the field
1030 : : unaligned_dr. */
1031 : : int peeling_for_alignment;
1032 : :
1033 : : /* The mask used to check the alignment of pointers or arrays. */
1034 : : poly_uint64 ptr_mask;
1035 : :
1036 : : /* The maximum speculative read amount in VLA modes for runtime check. */
1037 : : poly_uint64 max_spec_read_amount;
1038 : :
1039 : : /* Indicates whether the loop has any non-linear IV. */
1040 : : bool nonlinear_iv;
1041 : :
1042 : : /* Data Dependence Relations defining address ranges that are candidates
1043 : : for a run-time aliasing check. */
1044 : : auto_vec<ddr_p> may_alias_ddrs;
1045 : :
1046 : : /* Data Dependence Relations defining address ranges together with segment
1047 : : lengths from which the run-time aliasing check is built. */
1048 : : auto_vec<dr_with_seg_len_pair_t> comp_alias_ddrs;
1049 : :
1050 : : /* Check that the addresses of each pair of objects is unequal. */
1051 : : auto_vec<vec_object_pair> check_unequal_addrs;
1052 : :
1053 : : /* List of values that are required to be nonzero. This is used to check
1054 : : whether things like "x[i * n] += 1;" are safe and eventually gets added
1055 : : to the checks for lower bounds below. */
1056 : : auto_vec<tree> check_nonzero;
1057 : :
1058 : : /* List of values that need to be checked for a minimum value. */
1059 : : auto_vec<vec_lower_bound> lower_bounds;
1060 : :
1061 : : /* Statements in the loop that have data references that are candidates for a
1062 : : runtime (loop versioning) misalignment check. */
1063 : : auto_vec<stmt_vec_info> may_misalign_stmts;
1064 : :
1065 : : /* Reduction cycles detected in the loop. Used in loop-aware SLP. */
1066 : : auto_vec<stmt_vec_info> reductions;
1067 : :
1068 : : /* All reduction chains in the loop, represented by the first
1069 : : stmt in the chain. */
1070 : : auto_vec<stmt_vec_info> reduction_chains;
1071 : :
1072 : : /* Defs that could not be analyzed such as OMP SIMD calls without
1073 : : a LHS. */
1074 : : auto_vec<stmt_vec_info> alternate_defs;
1075 : :
1076 : : /* Cost vector for a single scalar iteration. */
1077 : : auto_vec<stmt_info_for_cost> scalar_cost_vec;
1078 : :
1079 : : /* Map of IV base/step expressions to inserted name in the preheader. */
1080 : : hash_map<tree_operand_hash, tree> *ivexpr_map;
1081 : :
1082 : : /* Map of OpenMP "omp simd array" scan variables to corresponding
1083 : : rhs of the store of the initializer. */
1084 : : hash_map<tree, tree> *scan_map;
1085 : :
1086 : : /* The unrolling factor needed to SLP the loop. In case of that pure SLP is
1087 : : applied to the loop, i.e., no unrolling is needed, this is 1. */
1088 : : poly_uint64 slp_unrolling_factor;
1089 : :
1090 : : /* The factor used to over weight those statements in an inner loop
1091 : : relative to the loop being vectorized. */
1092 : : unsigned int inner_loop_cost_factor;
1093 : :
1094 : : /* Is the loop vectorizable? */
1095 : : bool vectorizable;
1096 : :
1097 : : /* Records whether we still have the option of vectorizing this loop
1098 : : using partially-populated vectors; in other words, whether it is
1099 : : still possible for one iteration of the vector loop to handle
1100 : : fewer than VF scalars. */
1101 : : bool can_use_partial_vectors_p;
1102 : :
1103 : : /* Records whether we must use niter masking for correctness reasons. */
1104 : : bool must_use_partial_vectors_p;
1105 : :
1106 : : /* True if we've decided to use partially-populated vectors, so that
1107 : : the vector loop can handle fewer than VF scalars. */
1108 : : bool using_partial_vectors_p;
1109 : :
1110 : : /* True if we've decided to use a decrementing loop control IV that counts
1111 : : scalars. This can be done for any loop that:
1112 : :
1113 : : (a) uses length "controls"; and
1114 : : (b) can iterate more than once. */
1115 : : bool using_decrementing_iv_p;
1116 : :
1117 : : /* True if we've decided to use output of select_vl to adjust IV of
1118 : : both loop control and data reference pointer. This is only true
1119 : : for single-rgroup control. */
1120 : : bool using_select_vl_p;
1121 : :
1122 : : /* True if we've decided to use partially-populated vectors for the
1123 : : epilogue of loop. */
1124 : : bool epil_using_partial_vectors_p;
1125 : :
1126 : : /* True if we've decided to use peeling with versioning together, which allows
1127 : : unaligned unsupported data refs to be uniformly aligned after a certain
1128 : : amount of peeling (mutual alignment). Otherwise, we use versioning alone
1129 : : so these data refs must be already aligned to a power-of-two boundary
1130 : : without peeling. */
1131 : : bool allow_mutual_alignment;
1132 : :
1133 : : /* The bias for len_load and len_store. For now, only 0 and -1 are
1134 : : supported. -1 must be used when a backend does not support
1135 : : len_load/len_store with a length of zero. */
1136 : : signed char partial_load_store_bias;
1137 : :
1138 : : /* When we have grouped data accesses with gaps, we may introduce invalid
1139 : : memory accesses. We peel the last iteration of the loop to prevent
1140 : : this. */
1141 : : bool peeling_for_gaps;
1142 : :
1143 : : /* When the number of iterations is not a multiple of the vector size
1144 : : we need to peel off iterations at the end to form an epilogue loop. */
1145 : : bool peeling_for_niter;
1146 : :
1147 : : /* When the loop has early breaks that we can vectorize we need to peel
1148 : : the loop for the break finding loop. */
1149 : : bool early_breaks;
1150 : :
1151 : : /* List of loop additional IV conditionals found in the loop. */
1152 : : auto_vec<gcond *> conds;
1153 : :
1154 : : /* Main loop IV cond. */
1155 : : gcond* loop_iv_cond;
1156 : :
1157 : : /* True if we have an unroll factor requested by the user through pragma GCC
1158 : : unroll. */
1159 : : bool user_unroll;
1160 : :
1161 : : /* True if there are no loop carried data dependencies in the loop.
1162 : : If loop->safelen <= 1, then this is always true, either the loop
1163 : : didn't have any loop carried data dependencies, or the loop is being
1164 : : vectorized guarded with some runtime alias checks, or couldn't
1165 : : be vectorized at all, but then this field shouldn't be used.
1166 : : For loop->safelen >= 2, the user has asserted that there are no
1167 : : backward dependencies, but there still could be loop carried forward
1168 : : dependencies in such loops. This flag will be false if normal
1169 : : vectorizer data dependency analysis would fail or require versioning
1170 : : for alias, but because of loop->safelen >= 2 it has been vectorized
1171 : : even without versioning for alias. E.g. in:
1172 : : #pragma omp simd
1173 : : for (int i = 0; i < m; i++)
1174 : : a[i] = a[i + k] * c;
1175 : : (or #pragma simd or #pragma ivdep) we can vectorize this and it will
1176 : : DTRT even for k > 0 && k < m, but without safelen we would not
1177 : : vectorize this, so this field would be false. */
1178 : : bool no_data_dependencies;
1179 : :
1180 : : /* Mark loops having masked stores. */
1181 : : bool has_mask_store;
1182 : :
1183 : : /* Queued scaling factor for the scalar loop. */
1184 : : profile_probability scalar_loop_scaling;
1185 : :
1186 : : /* If if-conversion versioned this loop before conversion, this is the
1187 : : loop version without if-conversion. */
1188 : : class loop *scalar_loop;
1189 : :
1190 : : /* For loops being epilogues of already vectorized loops
1191 : : this points to the main vectorized loop. Otherwise NULL. */
1192 : : _loop_vec_info *main_loop_info;
1193 : :
1194 : : /* For loops being epilogues of already vectorized loops
1195 : : this points to the preceeding vectorized (possibly epilogue) loop.
1196 : : Otherwise NULL. */
1197 : : _loop_vec_info *orig_loop_info;
1198 : :
1199 : : /* Used to store loop_vec_infos of the epilogue of this loop during
1200 : : analysis. */
1201 : : _loop_vec_info *epilogue_vinfo;
1202 : :
1203 : : /* If this is an epilogue loop the DR advancement applied. */
1204 : : tree drs_advanced_by;
1205 : :
1206 : : /* The controlling loop IV for the current loop when vectorizing. This IV
1207 : : controls the natural exits of the loop. */
1208 : : edge vec_loop_iv_exit;
1209 : :
1210 : : /* The controlling loop IV for the epilogue loop when vectorizing. This IV
1211 : : controls the natural exits of the loop. */
1212 : : edge vec_epilogue_loop_iv_exit;
1213 : :
1214 : : /* The controlling loop IV for the scalar loop being vectorized. This IV
1215 : : controls the natural exits of the loop. */
1216 : : edge scalar_loop_iv_exit;
1217 : :
1218 : : /* Used to store the list of stores needing to be moved if doing early
1219 : : break vectorization as they would violate the scalar loop semantics if
1220 : : vectorized in their current location. These are stored in order that they
1221 : : need to be moved. */
1222 : : auto_vec<gimple *> early_break_stores;
1223 : :
1224 : : /* The final basic block where to move statements to. In the case of
1225 : : multiple exits this could be pretty far away. */
1226 : : basic_block early_break_dest_bb;
1227 : :
1228 : : /* Statements whose VUSES need updating if early break vectorization is to
1229 : : happen. */
1230 : : auto_vec<gimple*> early_break_vuses;
1231 : :
1232 : : /* Record statements that are needed to be live for early break vectorization
1233 : : but may not have an LC PHI node materialized yet in the exits. */
1234 : : auto_vec<stmt_vec_info> early_break_live_ivs;
1235 : : } *loop_vec_info;
1236 : :
1237 : : /* Access Functions. */
1238 : : #define LOOP_VINFO_LOOP(L) (L)->loop
1239 : : #define LOOP_VINFO_IV_EXIT(L) (L)->vec_loop_iv_exit
1240 : : #define LOOP_VINFO_EPILOGUE_IV_EXIT(L) (L)->vec_epilogue_loop_iv_exit
1241 : : #define LOOP_VINFO_SCALAR_IV_EXIT(L) (L)->scalar_loop_iv_exit
1242 : : #define LOOP_VINFO_BBS(L) (L)->bbs
1243 : : #define LOOP_VINFO_NBBS(L) (L)->nbbs
1244 : : #define LOOP_VINFO_NITERSM1(L) (L)->num_itersm1
1245 : : #define LOOP_VINFO_NITERS(L) (L)->num_iters
1246 : : /* Since LOOP_VINFO_NITERS and LOOP_VINFO_NITERSM1 can change after
1247 : : prologue peeling retain total unchanged scalar loop iterations for
1248 : : cost model. */
1249 : : #define LOOP_VINFO_NITERS_UNCHANGED(L) (L)->num_iters_unchanged
1250 : : #define LOOP_VINFO_NITERS_ASSUMPTIONS(L) (L)->num_iters_assumptions
1251 : : #define LOOP_VINFO_COST_MODEL_THRESHOLD(L) (L)->th
1252 : : #define LOOP_VINFO_VERSIONING_THRESHOLD(L) (L)->versioning_threshold
1253 : : #define LOOP_VINFO_VECTORIZABLE_P(L) (L)->vectorizable
1254 : : #define LOOP_VINFO_CAN_USE_PARTIAL_VECTORS_P(L) (L)->can_use_partial_vectors_p
1255 : : #define LOOP_VINFO_MUST_USE_PARTIAL_VECTORS_P(L) (L)->must_use_partial_vectors_p
1256 : : #define LOOP_VINFO_USING_PARTIAL_VECTORS_P(L) (L)->using_partial_vectors_p
1257 : : #define LOOP_VINFO_USING_DECREMENTING_IV_P(L) (L)->using_decrementing_iv_p
1258 : : #define LOOP_VINFO_USING_SELECT_VL_P(L) (L)->using_select_vl_p
1259 : : #define LOOP_VINFO_EPIL_USING_PARTIAL_VECTORS_P(L) \
1260 : : (L)->epil_using_partial_vectors_p
1261 : : #define LOOP_VINFO_ALLOW_MUTUAL_ALIGNMENT(L) (L)->allow_mutual_alignment
1262 : : #define LOOP_VINFO_PARTIAL_LOAD_STORE_BIAS(L) (L)->partial_load_store_bias
1263 : : #define LOOP_VINFO_VECT_FACTOR(L) (L)->vectorization_factor
1264 : : #define LOOP_VINFO_MAX_VECT_FACTOR(L) (L)->max_vectorization_factor
1265 : : #define LOOP_VINFO_MASKS(L) (L)->masks
1266 : : #define LOOP_VINFO_LENS(L) (L)->lens
1267 : : #define LOOP_VINFO_MASK_SKIP_NITERS(L) (L)->mask_skip_niters
1268 : : #define LOOP_VINFO_MASK_NITERS_PFA_OFFSET(L) (L)->mask_skip_niters_pfa_offset
1269 : : #define LOOP_VINFO_RGROUP_COMPARE_TYPE(L) (L)->rgroup_compare_type
1270 : : #define LOOP_VINFO_RGROUP_IV_TYPE(L) (L)->rgroup_iv_type
1271 : : #define LOOP_VINFO_PARTIAL_VECTORS_STYLE(L) (L)->partial_vector_style
1272 : : #define LOOP_VINFO_PTR_MASK(L) (L)->ptr_mask
1273 : : #define LOOP_VINFO_MAX_SPEC_READ_AMOUNT(L) (L)->max_spec_read_amount
1274 : : #define LOOP_VINFO_LOOP_NEST(L) (L)->shared->loop_nest
1275 : : #define LOOP_VINFO_DATAREFS(L) (L)->shared->datarefs
1276 : : #define LOOP_VINFO_DDRS(L) (L)->shared->ddrs
1277 : : #define LOOP_VINFO_INT_NITERS(L) (TREE_INT_CST_LOW ((L)->num_iters))
1278 : : #define LOOP_VINFO_PEELING_FOR_ALIGNMENT(L) (L)->peeling_for_alignment
1279 : : #define LOOP_VINFO_NON_LINEAR_IV(L) (L)->nonlinear_iv
1280 : : #define LOOP_VINFO_UNALIGNED_DR(L) (L)->unaligned_dr
1281 : : #define LOOP_VINFO_MAY_MISALIGN_STMTS(L) (L)->may_misalign_stmts
1282 : : #define LOOP_VINFO_MAY_ALIAS_DDRS(L) (L)->may_alias_ddrs
1283 : : #define LOOP_VINFO_COMP_ALIAS_DDRS(L) (L)->comp_alias_ddrs
1284 : : #define LOOP_VINFO_CHECK_UNEQUAL_ADDRS(L) (L)->check_unequal_addrs
1285 : : #define LOOP_VINFO_CHECK_NONZERO(L) (L)->check_nonzero
1286 : : #define LOOP_VINFO_LOWER_BOUNDS(L) (L)->lower_bounds
1287 : : #define LOOP_VINFO_USER_UNROLL(L) (L)->user_unroll
1288 : : #define LOOP_VINFO_GROUPED_STORES(L) (L)->grouped_stores
1289 : : #define LOOP_VINFO_SLP_INSTANCES(L) (L)->slp_instances
1290 : : #define LOOP_VINFO_SLP_UNROLLING_FACTOR(L) (L)->slp_unrolling_factor
1291 : : #define LOOP_VINFO_REDUCTIONS(L) (L)->reductions
1292 : : #define LOOP_VINFO_REDUCTION_CHAINS(L) (L)->reduction_chains
1293 : : #define LOOP_VINFO_PEELING_FOR_GAPS(L) (L)->peeling_for_gaps
1294 : : #define LOOP_VINFO_PEELING_FOR_NITER(L) (L)->peeling_for_niter
1295 : : #define LOOP_VINFO_EARLY_BREAKS(L) (L)->early_breaks
1296 : : #define LOOP_VINFO_EARLY_BRK_STORES(L) (L)->early_break_stores
1297 : : #define LOOP_VINFO_EARLY_BREAKS_VECT_PEELED(L) \
1298 : : (single_pred ((L)->loop->latch) != (L)->vec_loop_iv_exit->src)
1299 : : #define LOOP_VINFO_EARLY_BREAKS_LIVE_IVS(L) \
1300 : : (L)->early_break_live_ivs
1301 : : #define LOOP_VINFO_EARLY_BRK_DEST_BB(L) (L)->early_break_dest_bb
1302 : : #define LOOP_VINFO_EARLY_BRK_VUSES(L) (L)->early_break_vuses
1303 : : #define LOOP_VINFO_LOOP_CONDS(L) (L)->conds
1304 : : #define LOOP_VINFO_LOOP_IV_COND(L) (L)->loop_iv_cond
1305 : : #define LOOP_VINFO_NO_DATA_DEPENDENCIES(L) (L)->no_data_dependencies
1306 : : #define LOOP_VINFO_SCALAR_LOOP(L) (L)->scalar_loop
1307 : : #define LOOP_VINFO_SCALAR_LOOP_SCALING(L) (L)->scalar_loop_scaling
1308 : : #define LOOP_VINFO_HAS_MASK_STORE(L) (L)->has_mask_store
1309 : : #define LOOP_VINFO_SCALAR_ITERATION_COST(L) (L)->scalar_cost_vec
1310 : : #define LOOP_VINFO_MAIN_LOOP_INFO(L) (L)->main_loop_info
1311 : : #define LOOP_VINFO_ORIG_LOOP_INFO(L) (L)->orig_loop_info
1312 : : #define LOOP_VINFO_SIMD_IF_COND(L) (L)->simd_if_cond
1313 : : #define LOOP_VINFO_INNER_LOOP_COST_FACTOR(L) (L)->inner_loop_cost_factor
1314 : : #define LOOP_VINFO_INV_PATTERN_DEF_SEQ(L) (L)->inv_pattern_def_seq
1315 : : #define LOOP_VINFO_DRS_ADVANCED_BY(L) (L)->drs_advanced_by
1316 : : #define LOOP_VINFO_ALTERNATE_DEFS(L) (L)->alternate_defs
1317 : :
1318 : : #define LOOP_VINFO_FULLY_MASKED_P(L) \
1319 : : (LOOP_VINFO_USING_PARTIAL_VECTORS_P (L) \
1320 : : && !LOOP_VINFO_MASKS (L).is_empty ())
1321 : :
1322 : : #define LOOP_VINFO_FULLY_WITH_LENGTH_P(L) \
1323 : : (LOOP_VINFO_USING_PARTIAL_VECTORS_P (L) \
1324 : : && !LOOP_VINFO_LENS (L).is_empty ())
1325 : :
1326 : : #define LOOP_REQUIRES_VERSIONING_FOR_ALIGNMENT(L) \
1327 : : ((L)->may_misalign_stmts.length () > 0)
1328 : : #define LOOP_REQUIRES_VERSIONING_FOR_SPEC_READ(L) \
1329 : : (maybe_gt ((L)->max_spec_read_amount, 0U))
1330 : : #define LOOP_REQUIRES_VERSIONING_FOR_ALIAS(L) \
1331 : : ((L)->comp_alias_ddrs.length () > 0 \
1332 : : || (L)->check_unequal_addrs.length () > 0 \
1333 : : || (L)->lower_bounds.length () > 0)
1334 : : #define LOOP_REQUIRES_VERSIONING_FOR_NITERS(L) \
1335 : : (LOOP_VINFO_NITERS_ASSUMPTIONS (L))
1336 : : #define LOOP_REQUIRES_VERSIONING_FOR_SIMD_IF_COND(L) \
1337 : : (LOOP_VINFO_SIMD_IF_COND (L))
1338 : : #define LOOP_REQUIRES_VERSIONING(L) \
1339 : : (LOOP_REQUIRES_VERSIONING_FOR_ALIGNMENT (L) \
1340 : : || LOOP_REQUIRES_VERSIONING_FOR_SPEC_READ (L) \
1341 : : || LOOP_REQUIRES_VERSIONING_FOR_ALIAS (L) \
1342 : : || LOOP_REQUIRES_VERSIONING_FOR_NITERS (L) \
1343 : : || LOOP_REQUIRES_VERSIONING_FOR_SIMD_IF_COND (L))
1344 : :
1345 : : #define LOOP_VINFO_USE_VERSIONING_WITHOUT_PEELING(L) \
1346 : : ((L)->may_misalign_stmts.length () > 0 \
1347 : : && !LOOP_VINFO_ALLOW_MUTUAL_ALIGNMENT (L))
1348 : :
1349 : : #define LOOP_VINFO_NITERS_KNOWN_P(L) \
1350 : : (tree_fits_shwi_p ((L)->num_iters) && tree_to_shwi ((L)->num_iters) > 0)
1351 : :
1352 : : #define LOOP_VINFO_EPILOGUE_P(L) \
1353 : : (LOOP_VINFO_ORIG_LOOP_INFO (L) != NULL)
1354 : :
1355 : : #define LOOP_VINFO_ORIG_MAX_VECT_FACTOR(L) \
1356 : : (LOOP_VINFO_MAX_VECT_FACTOR (LOOP_VINFO_ORIG_LOOP_INFO (L)))
1357 : :
1358 : : /* Wrapper for loop_vec_info, for tracking success/failure, where a non-NULL
1359 : : value signifies success, and a NULL value signifies failure, supporting
1360 : : propagating an opt_problem * describing the failure back up the call
1361 : : stack. */
1362 : : typedef opt_pointer_wrapper <loop_vec_info> opt_loop_vec_info;
1363 : :
1364 : : inline loop_vec_info
1365 : 539363 : loop_vec_info_for_loop (class loop *loop)
1366 : : {
1367 : 539363 : return (loop_vec_info) loop->aux;
1368 : : }
1369 : :
1370 : : struct slp_root
1371 : : {
1372 : 1209848 : slp_root (slp_instance_kind kind_, vec<stmt_vec_info> stmts_,
1373 : 11599 : vec<stmt_vec_info> roots_, vec<tree> remain_ = vNULL)
1374 : 1209848 : : kind(kind_), stmts(stmts_), roots(roots_), remain(remain_) {}
1375 : : slp_instance_kind kind;
1376 : : vec<stmt_vec_info> stmts;
1377 : : vec<stmt_vec_info> roots;
1378 : : vec<tree> remain;
1379 : : };
1380 : :
1381 : : typedef class _bb_vec_info : public vec_info
1382 : : {
1383 : : public:
1384 : : _bb_vec_info (vec<basic_block> bbs, vec_info_shared *);
1385 : : ~_bb_vec_info ();
1386 : :
1387 : : vec<slp_root> roots;
1388 : : } *bb_vec_info;
1389 : :
1390 : : #define BB_VINFO_BBS(B) (B)->bbs
1391 : : #define BB_VINFO_NBBS(B) (B)->nbbs
1392 : : #define BB_VINFO_GROUPED_STORES(B) (B)->grouped_stores
1393 : : #define BB_VINFO_SLP_INSTANCES(B) (B)->slp_instances
1394 : : #define BB_VINFO_DATAREFS(B) (B)->shared->datarefs
1395 : : #define BB_VINFO_DDRS(B) (B)->shared->ddrs
1396 : :
1397 : : /* Indicates whether/how a variable is used in the scope of loop/basic
1398 : : block. */
1399 : : enum vect_relevant {
1400 : : vect_unused_in_scope = 0,
1401 : :
1402 : : /* The def is only used outside the loop. */
1403 : : vect_used_only_live,
1404 : : /* The def is in the inner loop, and the use is in the outer loop, and the
1405 : : use is a reduction stmt. */
1406 : : vect_used_in_outer_by_reduction,
1407 : : /* The def is in the inner loop, and the use is in the outer loop (and is
1408 : : not part of reduction). */
1409 : : vect_used_in_outer,
1410 : :
1411 : : /* defs that feed computations that end up (only) in a reduction. These
1412 : : defs may be used by non-reduction stmts, but eventually, any
1413 : : computations/values that are affected by these defs are used to compute
1414 : : a reduction (i.e. don't get stored to memory, for example). We use this
1415 : : to identify computations that we can change the order in which they are
1416 : : computed. */
1417 : : vect_used_by_reduction,
1418 : :
1419 : : vect_used_in_scope
1420 : : };
1421 : :
1422 : : /* The type of vectorization. pure_slp means the stmt is covered by the
1423 : : SLP graph, not_vect means it is not. This is mostly used by BB
1424 : : vectorization. */
1425 : : enum slp_vect_type {
1426 : : not_vect = 0,
1427 : : pure_slp,
1428 : : };
1429 : :
1430 : : /* Says whether a statement is a load, a store of a vectorized statement
1431 : : result, or a store of an invariant value. */
1432 : : enum vec_load_store_type {
1433 : : VLS_LOAD,
1434 : : VLS_STORE,
1435 : : VLS_STORE_INVARIANT
1436 : : };
1437 : :
1438 : : class dr_vec_info {
1439 : : public:
1440 : : /* The data reference itself. */
1441 : : data_reference *dr;
1442 : : /* The statement that contains the data reference. */
1443 : : stmt_vec_info stmt;
1444 : : /* The analysis group this DR belongs to when doing BB vectorization.
1445 : : DRs of the same group belong to the same conditional execution context. */
1446 : : unsigned group;
1447 : : /* The misalignment in bytes of the reference, or -1 if not known. */
1448 : : int misalignment;
1449 : : /* The byte alignment that we'd ideally like the reference to have,
1450 : : and the value that misalignment is measured against. */
1451 : : poly_uint64 target_alignment;
1452 : : /* If true the alignment of base_decl needs to be increased. */
1453 : : bool base_misaligned;
1454 : :
1455 : : /* Set by early break vectorization when this DR needs peeling for alignment
1456 : : for correctness. */
1457 : : bool safe_speculative_read_required;
1458 : :
1459 : : /* Set by early break vectorization when this DR's scalar accesses are known
1460 : : to be inbounds of a known bounds loop. */
1461 : : bool scalar_access_known_in_bounds;
1462 : :
1463 : : tree base_decl;
1464 : :
1465 : : /* Stores current vectorized loop's offset. To be added to the DR's
1466 : : offset to calculate current offset of data reference. */
1467 : : tree offset;
1468 : : };
1469 : :
1470 : : typedef struct data_reference *dr_p;
1471 : :
1472 : : class _stmt_vec_info {
1473 : : public:
1474 : :
1475 : : /* Indicates whether this stmts is part of a computation whose result is
1476 : : used outside the loop. */
1477 : : bool live;
1478 : :
1479 : : /* Stmt is part of some pattern (computation idiom) */
1480 : : bool in_pattern_p;
1481 : :
1482 : : /* True if the statement was created during pattern recognition as
1483 : : part of the replacement for RELATED_STMT. This implies that the
1484 : : statement isn't part of any basic block, although for convenience
1485 : : its gimple_bb is the same as for RELATED_STMT. */
1486 : : bool pattern_stmt_p;
1487 : :
1488 : : /* Is this statement vectorizable or should it be skipped in (partial)
1489 : : vectorization. */
1490 : : bool vectorizable;
1491 : :
1492 : : /* The stmt to which this info struct refers to. */
1493 : : gimple *stmt;
1494 : :
1495 : : /* The vector type to be used for the LHS of this statement. */
1496 : : tree vectype;
1497 : :
1498 : : /* The following is relevant only for stmts that contain a non-scalar
1499 : : data-ref (array/pointer/struct access). A GIMPLE stmt is expected to have
1500 : : at most one such data-ref. */
1501 : :
1502 : : dr_vec_info dr_aux;
1503 : :
1504 : : /* Information about the data-ref relative to this loop
1505 : : nest (the loop that is being considered for vectorization). */
1506 : : innermost_loop_behavior dr_wrt_vec_loop;
1507 : :
1508 : : /* For loop PHI nodes, the base and evolution part of it. This makes sure
1509 : : this information is still available in vect_update_ivs_after_vectorizer
1510 : : where we may not be able to re-analyze the PHI nodes evolution as
1511 : : peeling for the prologue loop can make it unanalyzable. The evolution
1512 : : part is still correct after peeling, but the base may have changed from
1513 : : the version here. */
1514 : : tree loop_phi_evolution_base_unchanged;
1515 : : tree loop_phi_evolution_part;
1516 : : enum vect_induction_op_type loop_phi_evolution_type;
1517 : :
1518 : : /* Used for various bookkeeping purposes, generally holding a pointer to
1519 : : some other stmt S that is in some way "related" to this stmt.
1520 : : Current use of this field is:
1521 : : If this stmt is part of a pattern (i.e. the field 'in_pattern_p' is
1522 : : true): S is the "pattern stmt" that represents (and replaces) the
1523 : : sequence of stmts that constitutes the pattern. Similarly, the
1524 : : related_stmt of the "pattern stmt" points back to this stmt (which is
1525 : : the last stmt in the original sequence of stmts that constitutes the
1526 : : pattern). */
1527 : : stmt_vec_info related_stmt;
1528 : :
1529 : : /* Used to keep a sequence of def stmts of a pattern stmt if such exists.
1530 : : The sequence is attached to the original statement rather than the
1531 : : pattern statement. */
1532 : : gimple_seq pattern_def_seq;
1533 : :
1534 : : /* Classify the def of this stmt. */
1535 : : enum vect_def_type def_type;
1536 : :
1537 : : /* Whether the stmt is SLPed, loop-based vectorized, or both. */
1538 : : enum slp_vect_type slp_type;
1539 : :
1540 : : /* Interleaving and reduction chains info. */
1541 : : /* First element in the group. */
1542 : : stmt_vec_info first_element;
1543 : : /* Pointer to the next element in the group. */
1544 : : stmt_vec_info next_element;
1545 : : /* The size of the group. */
1546 : : unsigned int size;
1547 : : /* For loads only, the gap from the previous load. For consecutive loads, GAP
1548 : : is 1. */
1549 : : unsigned int gap;
1550 : :
1551 : : /* The minimum negative dependence distance this stmt participates in
1552 : : or zero if none. */
1553 : : unsigned int min_neg_dist;
1554 : :
1555 : : /* Not all stmts in the loop need to be vectorized. e.g, the increment
1556 : : of the loop induction variable and computation of array indexes. relevant
1557 : : indicates whether the stmt needs to be vectorized. */
1558 : : enum vect_relevant relevant;
1559 : :
1560 : : /* For loads if this is a gather, for stores if this is a scatter. */
1561 : : bool gather_scatter_p;
1562 : :
1563 : : /* True if this is an access with loop-invariant stride. */
1564 : : bool strided_p;
1565 : :
1566 : : /* For both loads and stores. */
1567 : : unsigned simd_lane_access_p : 3;
1568 : :
1569 : : /* On a reduction PHI the reduction type as detected by
1570 : : vect_is_simple_reduction. */
1571 : : enum vect_reduction_type reduc_type;
1572 : :
1573 : : /* On a reduction PHI, the original reduction code as detected by
1574 : : vect_is_simple_reduction. */
1575 : : code_helper reduc_code;
1576 : :
1577 : : /* On a stmt participating in a reduction the index of the operand
1578 : : on the reduction SSA cycle. */
1579 : : int reduc_idx;
1580 : :
1581 : : /* On a reduction PHI the def returned by vect_is_simple_reduction.
1582 : : On the def returned by vect_is_simple_reduction the corresponding PHI. */
1583 : : stmt_vec_info reduc_def;
1584 : :
1585 : : /* If nonzero, the lhs of the statement could be truncated to this
1586 : : many bits without affecting any users of the result. */
1587 : : unsigned int min_output_precision;
1588 : :
1589 : : /* If nonzero, all non-boolean input operands have the same precision,
1590 : : and they could each be truncated to this many bits without changing
1591 : : the result. */
1592 : : unsigned int min_input_precision;
1593 : :
1594 : : /* If OPERATION_BITS is nonzero, the statement could be performed on
1595 : : an integer with the sign and number of bits given by OPERATION_SIGN
1596 : : and OPERATION_BITS without changing the result. */
1597 : : unsigned int operation_precision;
1598 : : signop operation_sign;
1599 : :
1600 : : /* If the statement produces a boolean result, this value describes
1601 : : how we should choose the associated vector type. The possible
1602 : : values are:
1603 : :
1604 : : - an integer precision N if we should use the vector mask type
1605 : : associated with N-bit integers. This is only used if all relevant
1606 : : input booleans also want the vector mask type for N-bit integers,
1607 : : or if we can convert them into that form by pattern-matching.
1608 : :
1609 : : - ~0U if we considered choosing a vector mask type but decided
1610 : : to treat the boolean as a normal integer type instead.
1611 : :
1612 : : - 0 otherwise. This means either that the operation isn't one that
1613 : : could have a vector mask type (and so should have a normal vector
1614 : : type instead) or that we simply haven't made a choice either way. */
1615 : : unsigned int mask_precision;
1616 : :
1617 : : /* True if this is only suitable for SLP vectorization. */
1618 : : bool slp_vect_only_p;
1619 : :
1620 : : /* True if this is a pattern that can only be handled by SLP
1621 : : vectorization. */
1622 : : bool slp_vect_pattern_only_p;
1623 : : };
1624 : :
1625 : : /* Information about a gather/scatter call. */
1626 : : struct gather_scatter_info {
1627 : : /* The internal function to use for the gather/scatter operation,
1628 : : or IFN_LAST if a built-in function should be used instead. */
1629 : : internal_fn ifn;
1630 : :
1631 : : /* The FUNCTION_DECL for the built-in gather/scatter function,
1632 : : or null if an internal function should be used instead. */
1633 : : tree decl;
1634 : :
1635 : : /* The loop-invariant base value. */
1636 : : tree base;
1637 : :
1638 : : /* The TBBA alias pointer the value of which determines the alignment
1639 : : of the scalar accesses. */
1640 : : tree alias_ptr;
1641 : :
1642 : : /* The original scalar offset, which is a non-loop-invariant SSA_NAME. */
1643 : : tree offset;
1644 : :
1645 : : /* Each offset element should be multiplied by this amount before
1646 : : being added to the base. */
1647 : : int scale;
1648 : :
1649 : : /* The type of the vectorized offset. */
1650 : : tree offset_vectype;
1651 : :
1652 : : /* The type of the scalar elements after loading or before storing. */
1653 : : tree element_type;
1654 : :
1655 : : /* The type of the scalar elements being loaded or stored. */
1656 : : tree memory_type;
1657 : : };
1658 : :
1659 : : /* Access Functions. */
1660 : : #define STMT_VINFO_STMT(S) (S)->stmt
1661 : : #define STMT_VINFO_RELEVANT(S) (S)->relevant
1662 : : #define STMT_VINFO_LIVE_P(S) (S)->live
1663 : : #define STMT_VINFO_VECTYPE(S) (S)->vectype
1664 : : #define STMT_VINFO_VECTORIZABLE(S) (S)->vectorizable
1665 : : #define STMT_VINFO_DATA_REF(S) ((S)->dr_aux.dr + 0)
1666 : : #define STMT_VINFO_GATHER_SCATTER_P(S) (S)->gather_scatter_p
1667 : : #define STMT_VINFO_STRIDED_P(S) (S)->strided_p
1668 : : #define STMT_VINFO_SIMD_LANE_ACCESS_P(S) (S)->simd_lane_access_p
1669 : : #define STMT_VINFO_REDUC_IDX(S) (S)->reduc_idx
1670 : :
1671 : : #define STMT_VINFO_DR_WRT_VEC_LOOP(S) (S)->dr_wrt_vec_loop
1672 : : #define STMT_VINFO_DR_BASE_ADDRESS(S) (S)->dr_wrt_vec_loop.base_address
1673 : : #define STMT_VINFO_DR_INIT(S) (S)->dr_wrt_vec_loop.init
1674 : : #define STMT_VINFO_DR_OFFSET(S) (S)->dr_wrt_vec_loop.offset
1675 : : #define STMT_VINFO_DR_STEP(S) (S)->dr_wrt_vec_loop.step
1676 : : #define STMT_VINFO_DR_BASE_ALIGNMENT(S) (S)->dr_wrt_vec_loop.base_alignment
1677 : : #define STMT_VINFO_DR_BASE_MISALIGNMENT(S) \
1678 : : (S)->dr_wrt_vec_loop.base_misalignment
1679 : : #define STMT_VINFO_DR_OFFSET_ALIGNMENT(S) \
1680 : : (S)->dr_wrt_vec_loop.offset_alignment
1681 : : #define STMT_VINFO_DR_STEP_ALIGNMENT(S) \
1682 : : (S)->dr_wrt_vec_loop.step_alignment
1683 : :
1684 : : #define STMT_VINFO_DR_INFO(S) \
1685 : : (gcc_checking_assert ((S)->dr_aux.stmt == (S)), &(S)->dr_aux)
1686 : :
1687 : : #define STMT_VINFO_IN_PATTERN_P(S) (S)->in_pattern_p
1688 : : #define STMT_VINFO_RELATED_STMT(S) (S)->related_stmt
1689 : : #define STMT_VINFO_PATTERN_DEF_SEQ(S) (S)->pattern_def_seq
1690 : : #define STMT_VINFO_DEF_TYPE(S) (S)->def_type
1691 : : #define STMT_VINFO_GROUPED_ACCESS(S) \
1692 : : ((S)->dr_aux.dr && DR_GROUP_FIRST_ELEMENT(S))
1693 : : #define STMT_VINFO_LOOP_PHI_EVOLUTION_BASE_UNCHANGED(S) (S)->loop_phi_evolution_base_unchanged
1694 : : #define STMT_VINFO_LOOP_PHI_EVOLUTION_PART(S) (S)->loop_phi_evolution_part
1695 : : #define STMT_VINFO_LOOP_PHI_EVOLUTION_TYPE(S) (S)->loop_phi_evolution_type
1696 : : #define STMT_VINFO_MIN_NEG_DIST(S) (S)->min_neg_dist
1697 : : #define STMT_VINFO_REDUC_TYPE(S) (S)->reduc_type
1698 : : #define STMT_VINFO_REDUC_CODE(S) (S)->reduc_code
1699 : : #define STMT_VINFO_REDUC_DEF(S) (S)->reduc_def
1700 : : #define STMT_VINFO_SLP_VECT_ONLY(S) (S)->slp_vect_only_p
1701 : : #define STMT_VINFO_SLP_VECT_ONLY_PATTERN(S) (S)->slp_vect_pattern_only_p
1702 : : #define STMT_VINFO_REDUC_VECTYPE_IN(S) (S)->reduc_vectype_in
1703 : :
1704 : : #define DR_GROUP_FIRST_ELEMENT(S) \
1705 : : (gcc_checking_assert ((S)->dr_aux.dr), (S)->first_element)
1706 : : #define DR_GROUP_NEXT_ELEMENT(S) \
1707 : : (gcc_checking_assert ((S)->dr_aux.dr), (S)->next_element)
1708 : : #define DR_GROUP_SIZE(S) \
1709 : : (gcc_checking_assert ((S)->dr_aux.dr), (S)->size)
1710 : : #define DR_GROUP_GAP(S) \
1711 : : (gcc_checking_assert ((S)->dr_aux.dr), (S)->gap)
1712 : :
1713 : : #define REDUC_GROUP_FIRST_ELEMENT(S) \
1714 : : (gcc_checking_assert (!(S)->dr_aux.dr), (S)->first_element)
1715 : : #define REDUC_GROUP_NEXT_ELEMENT(S) \
1716 : : (gcc_checking_assert (!(S)->dr_aux.dr), (S)->next_element)
1717 : : #define REDUC_GROUP_SIZE(S) \
1718 : : (gcc_checking_assert (!(S)->dr_aux.dr), (S)->size)
1719 : :
1720 : : #define STMT_VINFO_RELEVANT_P(S) ((S)->relevant != vect_unused_in_scope)
1721 : :
1722 : : #define PURE_SLP_STMT(S) ((S)->slp_type == pure_slp)
1723 : : #define STMT_SLP_TYPE(S) (S)->slp_type
1724 : :
1725 : :
1726 : : /* Contains the scalar or vector costs for a vec_info. */
1727 : : class vector_costs
1728 : : {
1729 : : public:
1730 : : vector_costs (vec_info *, bool);
1731 : 0 : virtual ~vector_costs () {}
1732 : :
1733 : : /* Update the costs in response to adding COUNT copies of a statement.
1734 : :
1735 : : - WHERE specifies whether the cost occurs in the loop prologue,
1736 : : the loop body, or the loop epilogue.
1737 : : - KIND is the kind of statement, which is always meaningful.
1738 : : - STMT_INFO or NODE, if nonnull, describe the statement that will be
1739 : : vectorized.
1740 : : - VECTYPE, if nonnull, is the vector type that the vectorized
1741 : : statement will operate on. Note that this should be used in
1742 : : preference to STMT_VINFO_VECTYPE (STMT_INFO) since the latter
1743 : : is not correct for SLP.
1744 : : - for unaligned_load and unaligned_store statements, MISALIGN is
1745 : : the byte misalignment of the load or store relative to the target's
1746 : : preferred alignment for VECTYPE, or DR_MISALIGNMENT_UNKNOWN
1747 : : if the misalignment is not known.
1748 : :
1749 : : Return the calculated cost as well as recording it. The return
1750 : : value is used for dumping purposes. */
1751 : : virtual unsigned int add_stmt_cost (int count, vect_cost_for_stmt kind,
1752 : : stmt_vec_info stmt_info,
1753 : : slp_tree node,
1754 : : tree vectype, int misalign,
1755 : : vect_cost_model_location where);
1756 : :
1757 : : /* Finish calculating the cost of the code. The results can be
1758 : : read back using the functions below.
1759 : :
1760 : : If the costs describe vector code, SCALAR_COSTS gives the costs
1761 : : of the corresponding scalar code, otherwise it is null. */
1762 : : virtual void finish_cost (const vector_costs *scalar_costs);
1763 : :
1764 : : /* The costs in THIS and OTHER both describe ways of vectorizing
1765 : : a main loop. Return true if the costs described by THIS are
1766 : : cheaper than the costs described by OTHER. Return false if any
1767 : : of the following are true:
1768 : :
1769 : : - THIS and OTHER are of equal cost
1770 : : - OTHER is better than THIS
1771 : : - we can't be sure about the relative costs of THIS and OTHER. */
1772 : : virtual bool better_main_loop_than_p (const vector_costs *other) const;
1773 : :
1774 : : /* Likewise, but the costs in THIS and OTHER both describe ways of
1775 : : vectorizing an epilogue loop of MAIN_LOOP. */
1776 : : virtual bool better_epilogue_loop_than_p (const vector_costs *other,
1777 : : loop_vec_info main_loop) const;
1778 : :
1779 : : unsigned int prologue_cost () const;
1780 : : unsigned int body_cost () const;
1781 : : unsigned int epilogue_cost () const;
1782 : : unsigned int outside_cost () const;
1783 : : unsigned int total_cost () const;
1784 : : unsigned int suggested_unroll_factor () const;
1785 : : machine_mode suggested_epilogue_mode (int &masked) const;
1786 : 6742992 : bool costing_for_scalar () const { return m_costing_for_scalar; }
1787 : :
1788 : : protected:
1789 : : unsigned int record_stmt_cost (stmt_vec_info, vect_cost_model_location,
1790 : : unsigned int);
1791 : : unsigned int adjust_cost_for_freq (stmt_vec_info, vect_cost_model_location,
1792 : : unsigned int);
1793 : : int compare_inside_loop_cost (const vector_costs *) const;
1794 : : int compare_outside_loop_cost (const vector_costs *) const;
1795 : :
1796 : : /* The region of code that we're considering vectorizing. */
1797 : : vec_info *m_vinfo;
1798 : :
1799 : : /* True if we're costing the scalar code, false if we're costing
1800 : : the vector code. */
1801 : : bool m_costing_for_scalar;
1802 : :
1803 : : /* The costs of the three regions, indexed by vect_cost_model_location. */
1804 : : unsigned int m_costs[3];
1805 : :
1806 : : /* The suggested unrolling factor determined at finish_cost. */
1807 : : unsigned int m_suggested_unroll_factor;
1808 : :
1809 : : /* The suggested mode to be used for a vectorized epilogue or VOIDmode,
1810 : : determined at finish_cost. m_masked_epilogue specifies whether the
1811 : : epilogue should use masked vectorization, regardless of the
1812 : : --param vect-partial-vector-usage default. If -1 then the
1813 : : --param setting takes precedence. If the user explicitly specified
1814 : : --param vect-partial-vector-usage then that takes precedence. */
1815 : : machine_mode m_suggested_epilogue_mode;
1816 : : int m_masked_epilogue;
1817 : :
1818 : : /* True if finish_cost has been called. */
1819 : : bool m_finished;
1820 : : };
1821 : :
1822 : : /* Create costs for VINFO. COSTING_FOR_SCALAR is true if the costs
1823 : : are for scalar code, false if they are for vector code. */
1824 : :
1825 : : inline
1826 : 1958007 : vector_costs::vector_costs (vec_info *vinfo, bool costing_for_scalar)
1827 : 1958007 : : m_vinfo (vinfo),
1828 : 1958007 : m_costing_for_scalar (costing_for_scalar),
1829 : 1958007 : m_costs (),
1830 : 1958007 : m_suggested_unroll_factor(1),
1831 : 1958007 : m_suggested_epilogue_mode(VOIDmode),
1832 : 1958007 : m_masked_epilogue (-1),
1833 : 1958007 : m_finished (false)
1834 : : {
1835 : : }
1836 : :
1837 : : /* Return the cost of the prologue code (in abstract units). */
1838 : :
1839 : : inline unsigned int
1840 : 825405 : vector_costs::prologue_cost () const
1841 : : {
1842 : 825405 : gcc_checking_assert (m_finished);
1843 : 825405 : return m_costs[vect_prologue];
1844 : : }
1845 : :
1846 : : /* Return the cost of the body code (in abstract units). */
1847 : :
1848 : : inline unsigned int
1849 : 1491044 : vector_costs::body_cost () const
1850 : : {
1851 : 1491044 : gcc_checking_assert (m_finished);
1852 : 1491044 : return m_costs[vect_body];
1853 : : }
1854 : :
1855 : : /* Return the cost of the epilogue code (in abstract units). */
1856 : :
1857 : : inline unsigned int
1858 : 825405 : vector_costs::epilogue_cost () const
1859 : : {
1860 : 825405 : gcc_checking_assert (m_finished);
1861 : 825405 : return m_costs[vect_epilogue];
1862 : : }
1863 : :
1864 : : /* Return the cost of the prologue and epilogue code (in abstract units). */
1865 : :
1866 : : inline unsigned int
1867 : 79883 : vector_costs::outside_cost () const
1868 : : {
1869 : 79883 : return prologue_cost () + epilogue_cost ();
1870 : : }
1871 : :
1872 : : /* Return the cost of the prologue, body and epilogue code
1873 : : (in abstract units). */
1874 : :
1875 : : inline unsigned int
1876 : 79883 : vector_costs::total_cost () const
1877 : : {
1878 : 79883 : return body_cost () + outside_cost ();
1879 : : }
1880 : :
1881 : : /* Return the suggested unroll factor. */
1882 : :
1883 : : inline unsigned int
1884 : 79704 : vector_costs::suggested_unroll_factor () const
1885 : : {
1886 : 79704 : gcc_checking_assert (m_finished);
1887 : 79704 : return m_suggested_unroll_factor;
1888 : : }
1889 : :
1890 : : /* Return the suggested epilogue mode. */
1891 : :
1892 : : inline machine_mode
1893 : 12566 : vector_costs::suggested_epilogue_mode (int &masked_p) const
1894 : : {
1895 : 12566 : gcc_checking_assert (m_finished);
1896 : 12566 : masked_p = m_masked_epilogue;
1897 : 12566 : return m_suggested_epilogue_mode;
1898 : : }
1899 : :
1900 : : #define VECT_MAX_COST 1000
1901 : :
1902 : : /* The maximum number of intermediate steps required in multi-step type
1903 : : conversion. */
1904 : : #define MAX_INTERM_CVT_STEPS 3
1905 : :
1906 : : #define MAX_VECTORIZATION_FACTOR INT_MAX
1907 : :
1908 : : /* Nonzero if TYPE represents a (scalar) boolean type or type
1909 : : in the middle-end compatible with it (unsigned precision 1 integral
1910 : : types). Used to determine which types should be vectorized as
1911 : : VECTOR_BOOLEAN_TYPE_P. */
1912 : :
1913 : : #define VECT_SCALAR_BOOLEAN_TYPE_P(TYPE) \
1914 : : (TREE_CODE (TYPE) == BOOLEAN_TYPE \
1915 : : || ((TREE_CODE (TYPE) == INTEGER_TYPE \
1916 : : || TREE_CODE (TYPE) == ENUMERAL_TYPE) \
1917 : : && TYPE_PRECISION (TYPE) == 1 \
1918 : : && TYPE_UNSIGNED (TYPE)))
1919 : :
1920 : : inline bool
1921 : 9348892 : nested_in_vect_loop_p (class loop *loop, stmt_vec_info stmt_info)
1922 : : {
1923 : 9348892 : return (loop->inner
1924 : 7509932 : && (loop->inner == (gimple_bb (stmt_info->stmt))->loop_father));
1925 : : }
1926 : :
1927 : : /* PHI is either a scalar reduction phi or a scalar induction phi.
1928 : : Return the initial value of the variable on entry to the containing
1929 : : loop. */
1930 : :
1931 : : inline tree
1932 : 34081 : vect_phi_initial_value (gphi *phi)
1933 : : {
1934 : 34081 : basic_block bb = gimple_bb (phi);
1935 : 34081 : edge pe = loop_preheader_edge (bb->loop_father);
1936 : 34081 : gcc_assert (pe->dest == bb);
1937 : 34081 : return PHI_ARG_DEF_FROM_EDGE (phi, pe);
1938 : : }
1939 : :
1940 : : /* Return true if STMT_INFO should produce a vector mask type rather than
1941 : : a normal nonmask type. */
1942 : :
1943 : : inline bool
1944 : 6535613 : vect_use_mask_type_p (stmt_vec_info stmt_info)
1945 : : {
1946 : 6535613 : return stmt_info->mask_precision && stmt_info->mask_precision != ~0U;
1947 : : }
1948 : :
1949 : : /* Return TRUE if a statement represented by STMT_INFO is a part of a
1950 : : pattern. */
1951 : :
1952 : : inline bool
1953 : 123009854 : is_pattern_stmt_p (stmt_vec_info stmt_info)
1954 : : {
1955 : 78029707 : return stmt_info->pattern_stmt_p;
1956 : : }
1957 : :
1958 : : /* If STMT_INFO is a pattern statement, return the statement that it
1959 : : replaces, otherwise return STMT_INFO itself. */
1960 : :
1961 : : inline stmt_vec_info
1962 : 48994586 : vect_orig_stmt (stmt_vec_info stmt_info)
1963 : : {
1964 : 36750696 : if (is_pattern_stmt_p (stmt_info))
1965 : 2890702 : return STMT_VINFO_RELATED_STMT (stmt_info);
1966 : : return stmt_info;
1967 : : }
1968 : :
1969 : : /* Return the later statement between STMT1_INFO and STMT2_INFO. */
1970 : :
1971 : : inline stmt_vec_info
1972 : 6001598 : get_later_stmt (stmt_vec_info stmt1_info, stmt_vec_info stmt2_info)
1973 : : {
1974 : 6001598 : gimple *stmt1 = vect_orig_stmt (stmt1_info)->stmt;
1975 : 6001598 : gimple *stmt2 = vect_orig_stmt (stmt2_info)->stmt;
1976 : 6001598 : if (gimple_bb (stmt1) == gimple_bb (stmt2))
1977 : : {
1978 : 5973918 : if (gimple_uid (stmt1) > gimple_uid (stmt2))
1979 : : return stmt1_info;
1980 : : else
1981 : : return stmt2_info;
1982 : : }
1983 : : /* ??? We should be really calling this function only with stmts
1984 : : in the same BB but we can recover if there's a domination
1985 : : relationship between them. */
1986 : 27680 : else if (dominated_by_p (CDI_DOMINATORS,
1987 : 27680 : gimple_bb (stmt1), gimple_bb (stmt2)))
1988 : : return stmt1_info;
1989 : 8191 : else if (dominated_by_p (CDI_DOMINATORS,
1990 : 8191 : gimple_bb (stmt2), gimple_bb (stmt1)))
1991 : : return stmt2_info;
1992 : 0 : gcc_unreachable ();
1993 : : }
1994 : :
1995 : : /* If STMT_INFO has been replaced by a pattern statement, return the
1996 : : replacement statement, otherwise return STMT_INFO itself. */
1997 : :
1998 : : inline stmt_vec_info
1999 : 48699271 : vect_stmt_to_vectorize (stmt_vec_info stmt_info)
2000 : : {
2001 : 48699271 : if (STMT_VINFO_IN_PATTERN_P (stmt_info))
2002 : 1358037 : return STMT_VINFO_RELATED_STMT (stmt_info);
2003 : : return stmt_info;
2004 : : }
2005 : :
2006 : : /* Return true if BB is a loop header. */
2007 : :
2008 : : inline bool
2009 : 1118729 : is_loop_header_bb_p (basic_block bb)
2010 : : {
2011 : 1118729 : if (bb == (bb->loop_father)->header)
2012 : 1108845 : return true;
2013 : :
2014 : : return false;
2015 : : }
2016 : :
2017 : : /* Return pow2 (X). */
2018 : :
2019 : : inline int
2020 : : vect_pow2 (int x)
2021 : : {
2022 : : int i, res = 1;
2023 : :
2024 : : for (i = 0; i < x; i++)
2025 : : res *= 2;
2026 : :
2027 : : return res;
2028 : : }
2029 : :
2030 : : /* Alias targetm.vectorize.builtin_vectorization_cost. */
2031 : :
2032 : : inline int
2033 : 9617324 : builtin_vectorization_cost (enum vect_cost_for_stmt type_of_cost,
2034 : : tree vectype, int misalign)
2035 : : {
2036 : 9617324 : return targetm.vectorize.builtin_vectorization_cost (type_of_cost,
2037 : : vectype, misalign);
2038 : : }
2039 : :
2040 : : /* Get cost by calling cost target builtin. */
2041 : :
2042 : : inline
2043 : 26 : int vect_get_stmt_cost (enum vect_cost_for_stmt type_of_cost)
2044 : : {
2045 : 48038 : return builtin_vectorization_cost (type_of_cost, NULL, 0);
2046 : : }
2047 : :
2048 : : /* Alias targetm.vectorize.init_cost. */
2049 : :
2050 : : inline vector_costs *
2051 : 1958007 : init_cost (vec_info *vinfo, bool costing_for_scalar)
2052 : : {
2053 : 1958007 : return targetm.vectorize.create_costs (vinfo, costing_for_scalar);
2054 : : }
2055 : :
2056 : : extern void dump_stmt_cost (FILE *, int, enum vect_cost_for_stmt,
2057 : : stmt_vec_info, slp_tree, tree, int, unsigned,
2058 : : enum vect_cost_model_location);
2059 : :
2060 : : /* Dump and add costs. */
2061 : :
2062 : : inline unsigned
2063 : 6742992 : add_stmt_cost (vector_costs *costs, int count,
2064 : : enum vect_cost_for_stmt kind,
2065 : : stmt_vec_info stmt_info, slp_tree node,
2066 : : tree vectype, int misalign,
2067 : : enum vect_cost_model_location where)
2068 : : {
2069 : : /* Even though a vector type might be set on stmt do not pass that on when
2070 : : costing the scalar IL. A SLP node shouldn't have been recorded. */
2071 : 6742992 : if (costs->costing_for_scalar ())
2072 : : {
2073 : 3711065 : vectype = NULL_TREE;
2074 : 3711065 : gcc_checking_assert (node == NULL);
2075 : : }
2076 : 6742992 : unsigned cost = costs->add_stmt_cost (count, kind, stmt_info, node, vectype,
2077 : : misalign, where);
2078 : 6742992 : if (dump_file && (dump_flags & TDF_DETAILS))
2079 : 203690 : dump_stmt_cost (dump_file, count, kind, stmt_info, node, vectype, misalign,
2080 : : cost, where);
2081 : 6742992 : return cost;
2082 : : }
2083 : :
2084 : : inline unsigned
2085 : 57420 : add_stmt_cost (vector_costs *costs, int count, enum vect_cost_for_stmt kind,
2086 : : enum vect_cost_model_location where)
2087 : : {
2088 : 57420 : gcc_assert (kind == cond_branch_taken || kind == cond_branch_not_taken
2089 : : || kind == scalar_stmt);
2090 : 57420 : return add_stmt_cost (costs, count, kind, NULL, NULL, NULL_TREE, 0, where);
2091 : : }
2092 : :
2093 : : inline unsigned
2094 : 3892245 : add_stmt_cost (vector_costs *costs, stmt_info_for_cost *i)
2095 : : {
2096 : 3892245 : return add_stmt_cost (costs, i->count, i->kind, i->stmt_info, i->node,
2097 : 3892245 : i->vectype, i->misalign, i->where);
2098 : : }
2099 : :
2100 : : inline void
2101 : 488563 : add_stmt_costs (vector_costs *costs, stmt_vector_for_cost *cost_vec)
2102 : : {
2103 : 488563 : stmt_info_for_cost *cost;
2104 : 488563 : unsigned i;
2105 : 3065638 : FOR_EACH_VEC_ELT (*cost_vec, i, cost)
2106 : 2577075 : add_stmt_cost (costs, cost->count, cost->kind, cost->stmt_info,
2107 : : cost->node, cost->vectype, cost->misalign, cost->where);
2108 : 488563 : }
2109 : :
2110 : : /*-----------------------------------------------------------------*/
2111 : : /* Info on data references alignment. */
2112 : : /*-----------------------------------------------------------------*/
2113 : : #define DR_MISALIGNMENT_UNKNOWN (-1)
2114 : : #define DR_MISALIGNMENT_UNINITIALIZED (-2)
2115 : :
2116 : : inline void
2117 : 2371944 : set_dr_misalignment (dr_vec_info *dr_info, int val)
2118 : : {
2119 : 2371944 : dr_info->misalignment = val;
2120 : : }
2121 : :
2122 : : extern int dr_misalignment (dr_vec_info *dr_info, tree vectype,
2123 : : poly_int64 offset = 0);
2124 : :
2125 : : #define SET_DR_MISALIGNMENT(DR, VAL) set_dr_misalignment (DR, VAL)
2126 : :
2127 : : /* Only defined once DR_MISALIGNMENT is defined. */
2128 : : inline const poly_uint64
2129 : 6291503 : dr_target_alignment (dr_vec_info *dr_info)
2130 : : {
2131 : 6291503 : if (STMT_VINFO_GROUPED_ACCESS (dr_info->stmt))
2132 : 4615128 : dr_info = STMT_VINFO_DR_INFO (DR_GROUP_FIRST_ELEMENT (dr_info->stmt));
2133 : 6291503 : return dr_info->target_alignment;
2134 : : }
2135 : : #define DR_TARGET_ALIGNMENT(DR) dr_target_alignment (DR)
2136 : : #define DR_SCALAR_KNOWN_BOUNDS(DR) (DR)->scalar_access_known_in_bounds
2137 : :
2138 : : /* Return if the stmt_vec_info requires peeling for alignment. */
2139 : : inline bool
2140 : 3800787 : dr_safe_speculative_read_required (stmt_vec_info stmt_info)
2141 : : {
2142 : 3800787 : dr_vec_info *dr_info;
2143 : 3800787 : if (STMT_VINFO_GROUPED_ACCESS (stmt_info))
2144 : 1629786 : dr_info = STMT_VINFO_DR_INFO (DR_GROUP_FIRST_ELEMENT (stmt_info));
2145 : : else
2146 : 2171001 : dr_info = STMT_VINFO_DR_INFO (stmt_info);
2147 : :
2148 : 3800787 : return dr_info->safe_speculative_read_required;
2149 : : }
2150 : :
2151 : : /* Set the safe_speculative_read_required for the the stmt_vec_info, if group
2152 : : access then set on the fist element otherwise set on DR directly. */
2153 : : inline void
2154 : 208173 : dr_set_safe_speculative_read_required (stmt_vec_info stmt_info,
2155 : : bool requires_alignment)
2156 : : {
2157 : 208173 : dr_vec_info *dr_info;
2158 : 208173 : if (STMT_VINFO_GROUPED_ACCESS (stmt_info))
2159 : 67808 : dr_info = STMT_VINFO_DR_INFO (DR_GROUP_FIRST_ELEMENT (stmt_info));
2160 : : else
2161 : 140365 : dr_info = STMT_VINFO_DR_INFO (stmt_info);
2162 : :
2163 : 208173 : dr_info->safe_speculative_read_required = requires_alignment;
2164 : 208173 : }
2165 : :
2166 : : inline void
2167 : 1453539 : set_dr_target_alignment (dr_vec_info *dr_info, poly_uint64 val)
2168 : : {
2169 : 1453539 : dr_info->target_alignment = val;
2170 : : }
2171 : : #define SET_DR_TARGET_ALIGNMENT(DR, VAL) set_dr_target_alignment (DR, VAL)
2172 : :
2173 : : /* Return true if data access DR_INFO is aligned to the targets
2174 : : preferred alignment for VECTYPE (which may be less than a full vector). */
2175 : :
2176 : : inline bool
2177 : 305973 : aligned_access_p (dr_vec_info *dr_info, tree vectype)
2178 : : {
2179 : 305973 : return (dr_misalignment (dr_info, vectype) == 0);
2180 : : }
2181 : :
2182 : : /* Return TRUE if the (mis-)alignment of the data access is known with
2183 : : respect to the targets preferred alignment for VECTYPE, and FALSE
2184 : : otherwise. */
2185 : :
2186 : : inline bool
2187 : 1774805 : known_alignment_for_access_p (dr_vec_info *dr_info, tree vectype)
2188 : : {
2189 : 1591428 : return (dr_misalignment (dr_info, vectype) != DR_MISALIGNMENT_UNKNOWN);
2190 : : }
2191 : :
2192 : : /* Return the minimum alignment in bytes that the vectorized version
2193 : : of DR_INFO is guaranteed to have. */
2194 : :
2195 : : inline unsigned int
2196 : 238258 : vect_known_alignment_in_bytes (dr_vec_info *dr_info, tree vectype,
2197 : : poly_int64 offset = 0)
2198 : : {
2199 : 238258 : int misalignment = dr_misalignment (dr_info, vectype, offset);
2200 : 238258 : if (misalignment == DR_MISALIGNMENT_UNKNOWN)
2201 : 117670 : return TYPE_ALIGN_UNIT (TREE_TYPE (DR_REF (dr_info->dr)));
2202 : 120588 : else if (misalignment == 0)
2203 : 91915 : return known_alignment (DR_TARGET_ALIGNMENT (dr_info));
2204 : 28673 : return misalignment & -misalignment;
2205 : : }
2206 : :
2207 : : /* Return the behavior of DR_INFO with respect to the vectorization context
2208 : : (which for outer loop vectorization might not be the behavior recorded
2209 : : in DR_INFO itself). */
2210 : :
2211 : : inline innermost_loop_behavior *
2212 : 5321929 : vect_dr_behavior (vec_info *vinfo, dr_vec_info *dr_info)
2213 : : {
2214 : 5321929 : stmt_vec_info stmt_info = dr_info->stmt;
2215 : 5321929 : loop_vec_info loop_vinfo = dyn_cast<loop_vec_info> (vinfo);
2216 : 1845467 : if (loop_vinfo == NULL
2217 : 1845467 : || !nested_in_vect_loop_p (LOOP_VINFO_LOOP (loop_vinfo), stmt_info))
2218 : 5318194 : return &DR_INNERMOST (dr_info->dr);
2219 : : else
2220 : 3735 : return &STMT_VINFO_DR_WRT_VEC_LOOP (stmt_info);
2221 : : }
2222 : :
2223 : : /* Return the offset calculated by adding the offset of this DR_INFO to the
2224 : : corresponding data_reference's offset. If CHECK_OUTER then use
2225 : : vect_dr_behavior to select the appropriate data_reference to use. */
2226 : :
2227 : : inline tree
2228 : 733817 : get_dr_vinfo_offset (vec_info *vinfo,
2229 : : dr_vec_info *dr_info, bool check_outer = false)
2230 : : {
2231 : 733817 : innermost_loop_behavior *base;
2232 : 733817 : if (check_outer)
2233 : 694827 : base = vect_dr_behavior (vinfo, dr_info);
2234 : : else
2235 : 38990 : base = &dr_info->dr->innermost;
2236 : :
2237 : 733817 : tree offset = base->offset;
2238 : :
2239 : 733817 : if (!dr_info->offset)
2240 : : return offset;
2241 : :
2242 : 19466 : offset = fold_convert (sizetype, offset);
2243 : 19466 : return fold_build2 (PLUS_EXPR, TREE_TYPE (dr_info->offset), offset,
2244 : : dr_info->offset);
2245 : : }
2246 : :
2247 : :
2248 : : /* Return the vect cost model for LOOP. */
2249 : : inline enum vect_cost_model
2250 : 1806520 : loop_cost_model (loop_p loop)
2251 : : {
2252 : 1806520 : if (loop != NULL
2253 : 1140911 : && loop->force_vectorize
2254 : 69761 : && flag_simd_cost_model != VECT_COST_MODEL_DEFAULT)
2255 : : return flag_simd_cost_model;
2256 : 1736759 : return flag_vect_cost_model;
2257 : : }
2258 : :
2259 : : /* Return true if the vect cost model is unlimited. */
2260 : : inline bool
2261 : 1253791 : unlimited_cost_model (loop_p loop)
2262 : : {
2263 : 1253791 : return loop_cost_model (loop) == VECT_COST_MODEL_UNLIMITED;
2264 : : }
2265 : :
2266 : : /* Return true if the loop described by LOOP_VINFO is fully-masked and
2267 : : if the first iteration should use a partial mask in order to achieve
2268 : : alignment. */
2269 : :
2270 : : inline bool
2271 : 207165 : vect_use_loop_mask_for_alignment_p (loop_vec_info loop_vinfo)
2272 : : {
2273 : : /* With early break vectorization we don't know whether the accesses will stay
2274 : : inside the loop or not. TODO: The early break adjustment code can be
2275 : : implemented the same way as vectorizable_linear_induction. However we
2276 : : can't test this today so reject it. */
2277 : 66 : return (LOOP_VINFO_FULLY_MASKED_P (loop_vinfo)
2278 : 66 : && LOOP_VINFO_PEELING_FOR_ALIGNMENT (loop_vinfo)
2279 : 207169 : && !(LOOP_VINFO_NON_LINEAR_IV (loop_vinfo)
2280 : 0 : && LOOP_VINFO_EARLY_BREAKS (loop_vinfo)));
2281 : : }
2282 : :
2283 : : /* Return the number of vectors of type VECTYPE that are needed to get
2284 : : NUNITS elements. NUNITS should be based on the vectorization factor,
2285 : : so it is always a known multiple of the number of elements in VECTYPE. */
2286 : :
2287 : : inline unsigned int
2288 : 6323063 : vect_get_num_vectors (poly_uint64 nunits, tree vectype)
2289 : : {
2290 : 6323063 : return exact_div (nunits, TYPE_VECTOR_SUBPARTS (vectype)).to_constant ();
2291 : : }
2292 : :
2293 : : /* Return the number of vectors in the context of vectorization region VINFO,
2294 : : needed for a group of statements and a vector type as specified by NODE. */
2295 : :
2296 : : inline unsigned int
2297 : 6323063 : vect_get_num_copies (vec_info *vinfo, slp_tree node)
2298 : : {
2299 : 6323063 : poly_uint64 vf;
2300 : :
2301 : 6323063 : if (loop_vec_info loop_vinfo = dyn_cast <loop_vec_info> (vinfo))
2302 : 2430725 : vf = LOOP_VINFO_VECT_FACTOR (loop_vinfo);
2303 : : else
2304 : : vf = 1;
2305 : :
2306 : 6323063 : vf *= SLP_TREE_LANES (node);
2307 : 6323063 : tree vectype = SLP_TREE_VECTYPE (node);
2308 : :
2309 : 6323063 : return vect_get_num_vectors (vf, vectype);
2310 : : }
2311 : :
2312 : : /* Update maximum unit count *MAX_NUNITS so that it accounts for
2313 : : NUNITS. *MAX_NUNITS can be 1 if we haven't yet recorded anything. */
2314 : :
2315 : : inline void
2316 : 9750157 : vect_update_max_nunits (poly_uint64 *max_nunits, poly_uint64 nunits)
2317 : : {
2318 : : /* All unit counts have the form vec_info::vector_size * X for some
2319 : : rational X, so two unit sizes must have a common multiple.
2320 : : Everything is a multiple of the initial value of 1. */
2321 : 4250583 : *max_nunits = force_common_multiple (*max_nunits, nunits);
2322 : : }
2323 : :
2324 : : /* Update maximum unit count *MAX_NUNITS so that it accounts for
2325 : : the number of units in vector type VECTYPE. *MAX_NUNITS can be 1
2326 : : if we haven't yet recorded any vector types. */
2327 : :
2328 : : inline void
2329 : 5499574 : vect_update_max_nunits (poly_uint64 *max_nunits, tree vectype)
2330 : : {
2331 : 5499574 : vect_update_max_nunits (max_nunits, TYPE_VECTOR_SUBPARTS (vectype));
2332 : 5499574 : }
2333 : :
2334 : : /* Return the vectorization factor that should be used for costing
2335 : : purposes while vectorizing the loop described by LOOP_VINFO.
2336 : : Pick a reasonable estimate if the vectorization factor isn't
2337 : : known at compile time. */
2338 : :
2339 : : inline unsigned int
2340 : 929142 : vect_vf_for_cost (loop_vec_info loop_vinfo)
2341 : : {
2342 : 929142 : return estimated_poly_value (LOOP_VINFO_VECT_FACTOR (loop_vinfo));
2343 : : }
2344 : :
2345 : : /* Estimate the number of elements in VEC_TYPE for costing purposes.
2346 : : Pick a reasonable estimate if the exact number isn't known at
2347 : : compile time. */
2348 : :
2349 : : inline unsigned int
2350 : 30793 : vect_nunits_for_cost (tree vec_type)
2351 : : {
2352 : 30793 : return estimated_poly_value (TYPE_VECTOR_SUBPARTS (vec_type));
2353 : : }
2354 : :
2355 : : /* Return the maximum possible vectorization factor for LOOP_VINFO. */
2356 : :
2357 : : inline unsigned HOST_WIDE_INT
2358 : 29912 : vect_max_vf (loop_vec_info loop_vinfo)
2359 : : {
2360 : 29912 : unsigned HOST_WIDE_INT vf;
2361 : 29912 : if (LOOP_VINFO_VECT_FACTOR (loop_vinfo).is_constant (&vf))
2362 : 29912 : return vf;
2363 : : return MAX_VECTORIZATION_FACTOR;
2364 : : }
2365 : :
2366 : : /* Return the size of the value accessed by unvectorized data reference
2367 : : DR_INFO. This is only valid once STMT_VINFO_VECTYPE has been calculated
2368 : : for the associated gimple statement, since that guarantees that DR_INFO
2369 : : accesses either a scalar or a scalar equivalent. ("Scalar equivalent"
2370 : : here includes things like V1SI, which can be vectorized in the same way
2371 : : as a plain SI.) */
2372 : :
2373 : : inline unsigned int
2374 : 1724287 : vect_get_scalar_dr_size (dr_vec_info *dr_info)
2375 : : {
2376 : 1724287 : return tree_to_uhwi (TYPE_SIZE_UNIT (TREE_TYPE (DR_REF (dr_info->dr))));
2377 : : }
2378 : :
2379 : : /* Return true if LOOP_VINFO requires a runtime check for whether the
2380 : : vector loop is profitable. */
2381 : :
2382 : : inline bool
2383 : 63537 : vect_apply_runtime_profitability_check_p (loop_vec_info loop_vinfo)
2384 : : {
2385 : 63537 : unsigned int th = LOOP_VINFO_COST_MODEL_THRESHOLD (loop_vinfo);
2386 : 34464 : return (!LOOP_VINFO_NITERS_KNOWN_P (loop_vinfo)
2387 : 63537 : && th >= vect_vf_for_cost (loop_vinfo));
2388 : : }
2389 : :
2390 : : /* Return true if CODE is a lane-reducing opcode. */
2391 : :
2392 : : inline bool
2393 : 282405 : lane_reducing_op_p (code_helper code)
2394 : : {
2395 : 282405 : return code == DOT_PROD_EXPR || code == WIDEN_SUM_EXPR || code == SAD_EXPR;
2396 : : }
2397 : :
2398 : : /* Return true if STMT is a lane-reducing statement. */
2399 : :
2400 : : inline bool
2401 : 364791 : lane_reducing_stmt_p (gimple *stmt)
2402 : : {
2403 : 364791 : if (auto *assign = dyn_cast <gassign *> (stmt))
2404 : 266039 : return lane_reducing_op_p (gimple_assign_rhs_code (assign));
2405 : : return false;
2406 : : }
2407 : :
2408 : : /* Source location + hotness information. */
2409 : : extern dump_user_location_t vect_location;
2410 : :
2411 : : /* A macro for calling:
2412 : : dump_begin_scope (MSG, vect_location);
2413 : : via an RAII object, thus printing "=== MSG ===\n" to the dumpfile etc,
2414 : : and then calling
2415 : : dump_end_scope ();
2416 : : once the object goes out of scope, thus capturing the nesting of
2417 : : the scopes.
2418 : :
2419 : : These scopes affect dump messages within them: dump messages at the
2420 : : top level implicitly default to MSG_PRIORITY_USER_FACING, whereas those
2421 : : in a nested scope implicitly default to MSG_PRIORITY_INTERNALS. */
2422 : :
2423 : : #define DUMP_VECT_SCOPE(MSG) \
2424 : : AUTO_DUMP_SCOPE (MSG, vect_location)
2425 : :
2426 : : /* A sentinel class for ensuring that the "vect_location" global gets
2427 : : reset at the end of a scope.
2428 : :
2429 : : The "vect_location" global is used during dumping and contains a
2430 : : location_t, which could contain references to a tree block via the
2431 : : ad-hoc data. This data is used for tracking inlining information,
2432 : : but it's not a GC root; it's simply assumed that such locations never
2433 : : get accessed if the blocks are optimized away.
2434 : :
2435 : : Hence we need to ensure that such locations are purged at the end
2436 : : of any operations using them (e.g. via this class). */
2437 : :
2438 : : class auto_purge_vect_location
2439 : : {
2440 : : public:
2441 : : ~auto_purge_vect_location ();
2442 : : };
2443 : :
2444 : : /*-----------------------------------------------------------------*/
2445 : : /* Function prototypes. */
2446 : : /*-----------------------------------------------------------------*/
2447 : :
2448 : : /* Simple loop peeling and versioning utilities for vectorizer's purposes -
2449 : : in tree-vect-loop-manip.cc. */
2450 : : extern void vect_set_loop_condition (class loop *, edge, loop_vec_info,
2451 : : tree, tree, tree, bool);
2452 : : extern bool slpeel_can_duplicate_loop_p (const class loop *, const_edge,
2453 : : const_edge);
2454 : : class loop *slpeel_tree_duplicate_loop_to_edge_cfg (class loop *, edge,
2455 : : class loop *, edge,
2456 : : edge, edge *, bool = true,
2457 : : vec<basic_block> * = NULL);
2458 : : class loop *vect_loop_versioning (loop_vec_info, gimple *);
2459 : : extern class loop *vect_do_peeling (loop_vec_info, tree, tree,
2460 : : tree *, tree *, tree *, int, bool, bool,
2461 : : tree *);
2462 : : extern tree vect_get_main_loop_result (loop_vec_info, tree, tree);
2463 : : extern void vect_prepare_for_masked_peels (loop_vec_info);
2464 : : extern dump_user_location_t find_loop_location (class loop *);
2465 : : extern bool vect_can_advance_ivs_p (loop_vec_info);
2466 : : extern void vect_update_inits_of_drs (loop_vec_info, tree, tree_code);
2467 : : extern edge vec_init_loop_exit_info (class loop *);
2468 : : extern void vect_iv_increment_position (edge, gimple_stmt_iterator *, bool *);
2469 : :
2470 : : /* In tree-vect-stmts.cc. */
2471 : : extern tree get_related_vectype_for_scalar_type (machine_mode, tree,
2472 : : poly_uint64 = 0);
2473 : : extern tree get_vectype_for_scalar_type (vec_info *, tree, unsigned int = 0);
2474 : : extern tree get_vectype_for_scalar_type (vec_info *, tree, slp_tree);
2475 : : extern tree get_mask_type_for_scalar_type (vec_info *, tree, unsigned int = 0);
2476 : : extern tree get_mask_type_for_scalar_type (vec_info *, tree, slp_tree);
2477 : : extern tree get_same_sized_vectype (tree, tree);
2478 : : extern bool vect_chooses_same_modes_p (vec_info *, machine_mode);
2479 : : extern bool vect_chooses_same_modes_p (machine_mode, machine_mode);
2480 : : extern bool vect_get_loop_mask_type (loop_vec_info);
2481 : : extern bool vect_is_simple_use (tree, vec_info *, enum vect_def_type *,
2482 : : stmt_vec_info * = NULL, gimple ** = NULL);
2483 : : extern bool vect_is_simple_use (vec_info *, slp_tree,
2484 : : unsigned, tree *, slp_tree *,
2485 : : enum vect_def_type *,
2486 : : tree *, stmt_vec_info * = NULL);
2487 : : extern bool vect_maybe_update_slp_op_vectype (slp_tree, tree);
2488 : : extern tree perm_mask_for_reverse (tree);
2489 : : extern bool supportable_widening_operation (vec_info*, code_helper,
2490 : : stmt_vec_info, tree, tree,
2491 : : code_helper*, code_helper*,
2492 : : int*, vec<tree> *);
2493 : : extern bool supportable_narrowing_operation (code_helper, tree, tree,
2494 : : code_helper *, int *,
2495 : : vec<tree> *);
2496 : : extern bool supportable_indirect_convert_operation (code_helper,
2497 : : tree, tree,
2498 : : vec<std::pair<tree, tree_code> > &,
2499 : : tree = NULL_TREE,
2500 : : slp_tree = NULL);
2501 : : extern int compare_step_with_zero (vec_info *, stmt_vec_info);
2502 : :
2503 : : extern unsigned record_stmt_cost (stmt_vector_for_cost *, int,
2504 : : enum vect_cost_for_stmt, stmt_vec_info,
2505 : : tree, int, enum vect_cost_model_location);
2506 : : extern unsigned record_stmt_cost (stmt_vector_for_cost *, int,
2507 : : enum vect_cost_for_stmt, slp_tree,
2508 : : tree, int, enum vect_cost_model_location);
2509 : : extern unsigned record_stmt_cost (stmt_vector_for_cost *, int,
2510 : : enum vect_cost_for_stmt,
2511 : : enum vect_cost_model_location);
2512 : : extern unsigned record_stmt_cost (stmt_vector_for_cost *, int,
2513 : : enum vect_cost_for_stmt, stmt_vec_info,
2514 : : slp_tree, tree, int,
2515 : : enum vect_cost_model_location);
2516 : :
2517 : : /* Overload of record_stmt_cost with VECTYPE derived from STMT_INFO. */
2518 : :
2519 : : inline unsigned
2520 : 3032364 : record_stmt_cost (stmt_vector_for_cost *body_cost_vec, int count,
2521 : : enum vect_cost_for_stmt kind, stmt_vec_info stmt_info,
2522 : : int misalign, enum vect_cost_model_location where)
2523 : : {
2524 : 3031635 : return record_stmt_cost (body_cost_vec, count, kind, stmt_info,
2525 : 1592394 : STMT_VINFO_VECTYPE (stmt_info), misalign, where);
2526 : : }
2527 : :
2528 : : /* Overload of record_stmt_cost with VECTYPE derived from SLP node. */
2529 : :
2530 : : inline unsigned
2531 : 1331313 : record_stmt_cost (stmt_vector_for_cost *body_cost_vec, int count,
2532 : : enum vect_cost_for_stmt kind, slp_tree node,
2533 : : int misalign, enum vect_cost_model_location where)
2534 : : {
2535 : 1171098 : return record_stmt_cost (body_cost_vec, count, kind, node,
2536 : 94050 : SLP_TREE_VECTYPE (node), misalign, where);
2537 : : }
2538 : :
2539 : : extern void vect_finish_replace_stmt (vec_info *, stmt_vec_info, gimple *);
2540 : : extern void vect_finish_stmt_generation (vec_info *, stmt_vec_info, gimple *,
2541 : : gimple_stmt_iterator *);
2542 : : extern opt_result vect_mark_stmts_to_be_vectorized (loop_vec_info, bool *);
2543 : : extern tree vect_get_store_rhs (stmt_vec_info);
2544 : : void vect_get_vec_defs (vec_info *, slp_tree,
2545 : : tree, vec<tree> *,
2546 : : tree = NULL, vec<tree> * = NULL,
2547 : : tree = NULL, vec<tree> * = NULL,
2548 : : tree = NULL, vec<tree> * = NULL);
2549 : : extern tree vect_init_vector (vec_info *, stmt_vec_info, tree, tree,
2550 : : gimple_stmt_iterator *);
2551 : : extern tree vect_get_slp_vect_def (slp_tree, unsigned);
2552 : : extern bool vect_transform_stmt (vec_info *, stmt_vec_info,
2553 : : gimple_stmt_iterator *,
2554 : : slp_tree, slp_instance);
2555 : : extern void vect_remove_stores (vec_info *, stmt_vec_info);
2556 : : extern bool vect_nop_conversion_p (stmt_vec_info);
2557 : : extern opt_result vect_analyze_stmt (vec_info *, slp_tree,
2558 : : slp_instance, stmt_vector_for_cost *);
2559 : : extern void vect_get_load_cost (vec_info *, stmt_vec_info, slp_tree, int,
2560 : : dr_alignment_support, int, bool,
2561 : : unsigned int *, unsigned int *,
2562 : : stmt_vector_for_cost *,
2563 : : stmt_vector_for_cost *, bool);
2564 : : extern void vect_get_store_cost (vec_info *, stmt_vec_info, slp_tree, int,
2565 : : dr_alignment_support, int,
2566 : : unsigned int *, stmt_vector_for_cost *);
2567 : : extern bool vect_supportable_shift (vec_info *, enum tree_code, tree);
2568 : : extern tree vect_gen_perm_mask_any (tree, const vec_perm_indices &);
2569 : : extern tree vect_gen_perm_mask_checked (tree, const vec_perm_indices &);
2570 : : extern void optimize_mask_stores (class loop*);
2571 : : extern tree vect_gen_while (gimple_seq *, tree, tree, tree,
2572 : : const char * = nullptr);
2573 : : extern tree vect_gen_while_not (gimple_seq *, tree, tree, tree);
2574 : : extern opt_result vect_get_vector_types_for_stmt (vec_info *,
2575 : : stmt_vec_info, tree *,
2576 : : tree *, unsigned int = 0);
2577 : : extern opt_tree vect_get_mask_type_for_stmt (stmt_vec_info, unsigned int = 0);
2578 : :
2579 : : /* In tree-if-conv.cc. */
2580 : : extern bool ref_within_array_bound (gimple *, tree);
2581 : :
2582 : : /* In tree-vect-data-refs.cc. */
2583 : : extern bool vect_can_force_dr_alignment_p (const_tree, poly_uint64);
2584 : : extern enum dr_alignment_support vect_supportable_dr_alignment
2585 : : (vec_info *, dr_vec_info *, tree, int,
2586 : : bool = false);
2587 : : extern tree vect_get_smallest_scalar_type (stmt_vec_info, tree);
2588 : : extern opt_result vect_analyze_data_ref_dependences (loop_vec_info, unsigned int *);
2589 : : extern bool vect_slp_analyze_instance_dependence (vec_info *, slp_instance);
2590 : : extern opt_result vect_enhance_data_refs_alignment (loop_vec_info);
2591 : : extern opt_result vect_analyze_data_refs_alignment (loop_vec_info);
2592 : : extern bool vect_slp_analyze_instance_alignment (vec_info *, slp_instance);
2593 : : extern opt_result vect_analyze_data_ref_accesses (vec_info *, vec<int> *);
2594 : : extern opt_result vect_prune_runtime_alias_test_list (loop_vec_info);
2595 : : extern bool vect_gather_scatter_fn_p (vec_info *, bool, bool, tree, tree,
2596 : : tree, int, internal_fn *, tree *,
2597 : : vec<int> * = nullptr);
2598 : : extern bool vect_check_gather_scatter (stmt_vec_info, tree,
2599 : : loop_vec_info, gather_scatter_info *,
2600 : : vec<int> * = nullptr);
2601 : : extern void vect_describe_gather_scatter_call (stmt_vec_info,
2602 : : gather_scatter_info *);
2603 : : extern opt_result vect_find_stmt_data_reference (loop_p, gimple *,
2604 : : vec<data_reference_p> *,
2605 : : vec<int> *, int);
2606 : : extern opt_result vect_analyze_data_refs (vec_info *, bool *);
2607 : : extern void vect_record_base_alignments (vec_info *);
2608 : : extern tree vect_create_data_ref_ptr (vec_info *,
2609 : : stmt_vec_info, tree, class loop *, tree,
2610 : : tree *, gimple_stmt_iterator *,
2611 : : gimple **, bool,
2612 : : tree = NULL_TREE);
2613 : : extern tree bump_vector_ptr (vec_info *, tree, gimple *, gimple_stmt_iterator *,
2614 : : stmt_vec_info, tree);
2615 : : extern void vect_copy_ref_info (tree, tree);
2616 : : extern tree vect_create_destination_var (tree, tree);
2617 : : extern bool vect_grouped_store_supported (tree, unsigned HOST_WIDE_INT);
2618 : : extern internal_fn vect_store_lanes_supported (tree, unsigned HOST_WIDE_INT, bool);
2619 : : extern bool vect_grouped_load_supported (tree, bool, unsigned HOST_WIDE_INT);
2620 : : extern internal_fn vect_load_lanes_supported (tree, unsigned HOST_WIDE_INT,
2621 : : bool, vec<int> * = nullptr);
2622 : : extern tree vect_setup_realignment (vec_info *,
2623 : : stmt_vec_info, tree, gimple_stmt_iterator *,
2624 : : tree *, enum dr_alignment_support, tree,
2625 : : class loop **);
2626 : : extern tree vect_get_new_vect_var (tree, enum vect_var_kind, const char *);
2627 : : extern tree vect_get_new_ssa_name (tree, enum vect_var_kind,
2628 : : const char * = NULL);
2629 : : extern tree vect_create_addr_base_for_vector_ref (vec_info *,
2630 : : stmt_vec_info, gimple_seq *,
2631 : : tree);
2632 : :
2633 : : /* In tree-vect-loop.cc. */
2634 : : extern tree neutral_op_for_reduction (tree, code_helper, tree, bool = true);
2635 : : extern widest_int vect_iv_limit_for_partial_vectors (loop_vec_info loop_vinfo);
2636 : : bool vect_rgroup_iv_might_wrap_p (loop_vec_info, rgroup_controls *);
2637 : : /* Used in tree-vect-loop-manip.cc */
2638 : : extern opt_result vect_determine_partial_vectors_and_peeling (loop_vec_info);
2639 : : /* Used in gimple-loop-interchange.c and tree-parloops.cc. */
2640 : : extern bool check_reduction_path (dump_user_location_t, loop_p, gphi *, tree,
2641 : : enum tree_code);
2642 : : extern bool needs_fold_left_reduction_p (tree, code_helper);
2643 : : /* Drive for loop analysis stage. */
2644 : : extern opt_loop_vec_info vect_analyze_loop (class loop *, gimple *,
2645 : : vec_info_shared *);
2646 : : extern tree vect_build_loop_niters (loop_vec_info, bool * = NULL);
2647 : : extern void vect_gen_vector_loop_niters (loop_vec_info, tree, tree *,
2648 : : tree *, bool);
2649 : : extern tree vect_halve_mask_nunits (tree, machine_mode);
2650 : : extern tree vect_double_mask_nunits (tree, machine_mode);
2651 : : extern void vect_record_loop_mask (loop_vec_info, vec_loop_masks *,
2652 : : unsigned int, tree, tree);
2653 : : extern tree vect_get_loop_mask (loop_vec_info, gimple_stmt_iterator *,
2654 : : vec_loop_masks *,
2655 : : unsigned int, tree, unsigned int);
2656 : : extern void vect_record_loop_len (loop_vec_info, vec_loop_lens *, unsigned int,
2657 : : tree, unsigned int);
2658 : : extern tree vect_get_loop_len (loop_vec_info, gimple_stmt_iterator *,
2659 : : vec_loop_lens *, unsigned int, tree,
2660 : : unsigned int, unsigned int);
2661 : : extern tree vect_gen_loop_len_mask (loop_vec_info, gimple_stmt_iterator *,
2662 : : gimple_stmt_iterator *, vec_loop_lens *,
2663 : : unsigned int, tree, tree, unsigned int,
2664 : : unsigned int);
2665 : : extern gimple_seq vect_gen_len (tree, tree, tree, tree);
2666 : : extern vect_reduc_info info_for_reduction (loop_vec_info, slp_tree);
2667 : : extern bool reduction_fn_for_scalar_code (code_helper, internal_fn *);
2668 : :
2669 : : /* Drive for loop transformation stage. */
2670 : : extern class loop *vect_transform_loop (loop_vec_info, gimple *);
2671 : 928504 : struct vect_loop_form_info
2672 : : {
2673 : : tree number_of_iterations;
2674 : : tree number_of_iterationsm1;
2675 : : tree assumptions;
2676 : : auto_vec<gcond *> conds;
2677 : : gcond *inner_loop_cond;
2678 : : edge loop_exit;
2679 : : };
2680 : : extern opt_result vect_analyze_loop_form (class loop *, gimple *,
2681 : : vect_loop_form_info *);
2682 : : extern loop_vec_info vect_create_loop_vinfo (class loop *, vec_info_shared *,
2683 : : const vect_loop_form_info *,
2684 : : loop_vec_info = nullptr);
2685 : : extern bool vectorizable_live_operation (vec_info *, stmt_vec_info,
2686 : : slp_tree, slp_instance, int,
2687 : : bool, stmt_vector_for_cost *);
2688 : : extern bool vectorizable_lane_reducing (loop_vec_info, stmt_vec_info,
2689 : : slp_tree, stmt_vector_for_cost *);
2690 : : extern bool vectorizable_reduction (loop_vec_info, stmt_vec_info,
2691 : : slp_tree, slp_instance,
2692 : : stmt_vector_for_cost *);
2693 : : extern bool vectorizable_induction (loop_vec_info, stmt_vec_info,
2694 : : slp_tree, stmt_vector_for_cost *);
2695 : : extern bool vect_transform_reduction (loop_vec_info, stmt_vec_info,
2696 : : gimple_stmt_iterator *,
2697 : : slp_tree);
2698 : : extern bool vect_transform_cycle_phi (loop_vec_info, stmt_vec_info,
2699 : : slp_tree, slp_instance);
2700 : : extern bool vectorizable_lc_phi (loop_vec_info, stmt_vec_info, slp_tree);
2701 : : extern bool vect_transform_lc_phi (loop_vec_info, stmt_vec_info, slp_tree);
2702 : : extern bool vectorizable_phi (bb_vec_info, stmt_vec_info, slp_tree,
2703 : : stmt_vector_for_cost *);
2704 : : extern bool vectorizable_recurr (loop_vec_info, stmt_vec_info,
2705 : : slp_tree, stmt_vector_for_cost *);
2706 : : extern bool vectorizable_early_exit (loop_vec_info, stmt_vec_info,
2707 : : gimple_stmt_iterator *,
2708 : : slp_tree, stmt_vector_for_cost *);
2709 : : extern bool vect_emulated_vector_p (tree);
2710 : : extern bool vect_can_vectorize_without_simd_p (tree_code);
2711 : : extern bool vect_can_vectorize_without_simd_p (code_helper);
2712 : : extern int vect_get_known_peeling_cost (loop_vec_info, int, int *,
2713 : : stmt_vector_for_cost *,
2714 : : stmt_vector_for_cost *,
2715 : : stmt_vector_for_cost *);
2716 : : extern tree cse_and_gimplify_to_preheader (loop_vec_info, tree);
2717 : :
2718 : : /* Nonlinear induction. */
2719 : : extern tree vect_peel_nonlinear_iv_init (gimple_seq*, tree, tree,
2720 : : tree, enum vect_induction_op_type);
2721 : :
2722 : : /* In tree-vect-slp.cc. */
2723 : : extern void vect_slp_init (void);
2724 : : extern void vect_slp_fini (void);
2725 : : extern void vect_free_slp_instance (slp_instance);
2726 : : extern bool vect_transform_slp_perm_load (vec_info *, slp_tree, const vec<tree> &,
2727 : : gimple_stmt_iterator *, poly_uint64,
2728 : : bool, unsigned *,
2729 : : unsigned * = nullptr, bool = false);
2730 : : extern bool vectorizable_slp_permutation (vec_info *, gimple_stmt_iterator *,
2731 : : slp_tree, stmt_vector_for_cost *);
2732 : : extern bool vect_slp_analyze_operations (vec_info *);
2733 : : extern void vect_schedule_slp (vec_info *, const vec<slp_instance> &);
2734 : : extern opt_result vect_analyze_slp (vec_info *, unsigned, bool);
2735 : : extern bool vect_make_slp_decision (loop_vec_info);
2736 : : extern bool vect_detect_hybrid_slp (loop_vec_info);
2737 : : extern void vect_optimize_slp (vec_info *);
2738 : : extern void vect_gather_slp_loads (vec_info *);
2739 : : extern tree vect_get_slp_scalar_def (slp_tree, unsigned);
2740 : : extern void vect_get_slp_defs (slp_tree, vec<tree> *);
2741 : : extern void vect_get_slp_defs (vec_info *, slp_tree, vec<vec<tree> > *,
2742 : : unsigned n = -1U);
2743 : : extern bool vect_slp_if_converted_bb (basic_block bb, loop_p orig_loop);
2744 : : extern bool vect_slp_function (function *);
2745 : : extern stmt_vec_info vect_find_last_scalar_stmt_in_slp (slp_tree);
2746 : : extern stmt_vec_info vect_find_first_scalar_stmt_in_slp (slp_tree);
2747 : : extern bool is_simple_and_all_uses_invariant (stmt_vec_info, loop_vec_info);
2748 : : extern bool can_duplicate_and_interleave_p (vec_info *, unsigned int, tree,
2749 : : unsigned int * = NULL,
2750 : : tree * = NULL, tree * = NULL);
2751 : : extern void duplicate_and_interleave (vec_info *, gimple_seq *, tree,
2752 : : const vec<tree> &, unsigned int, vec<tree> &);
2753 : : extern int vect_get_place_in_interleaving_chain (stmt_vec_info, stmt_vec_info);
2754 : : extern slp_tree vect_create_new_slp_node (unsigned, tree_code);
2755 : : extern void vect_free_slp_tree (slp_tree);
2756 : : extern bool compatible_calls_p (gcall *, gcall *, bool);
2757 : : extern int vect_slp_child_index_for_operand (const gimple *, int op, bool);
2758 : :
2759 : : extern tree prepare_vec_mask (loop_vec_info, tree, tree, tree,
2760 : : gimple_stmt_iterator *);
2761 : : extern tree vect_get_mask_load_else (int, tree);
2762 : :
2763 : : /* In tree-vect-patterns.cc. */
2764 : : extern void
2765 : : vect_mark_pattern_stmts (vec_info *, stmt_vec_info, gimple *, tree);
2766 : : extern bool vect_get_range_info (tree, wide_int*, wide_int*);
2767 : :
2768 : : /* Pattern recognition functions.
2769 : : Additional pattern recognition functions can (and will) be added
2770 : : in the future. */
2771 : : void vect_pattern_recog (vec_info *);
2772 : :
2773 : : /* In tree-vectorizer.cc. */
2774 : : unsigned vectorize_loops (void);
2775 : : void vect_free_loop_info_assumptions (class loop *);
2776 : : gimple *vect_loop_vectorized_call (class loop *, gcond **cond = NULL);
2777 : : bool vect_stmt_dominates_stmt_p (gimple *, gimple *);
2778 : :
2779 : : /* SLP Pattern matcher types, tree-vect-slp-patterns.cc. */
2780 : :
2781 : : /* Forward declaration of possible two operands operation that can be matched
2782 : : by the complex numbers pattern matchers. */
2783 : : enum _complex_operation : unsigned;
2784 : :
2785 : : /* All possible load permute values that could result from the partial data-flow
2786 : : analysis. */
2787 : : typedef enum _complex_perm_kinds {
2788 : : PERM_UNKNOWN,
2789 : : PERM_EVENODD,
2790 : : PERM_ODDEVEN,
2791 : : PERM_ODDODD,
2792 : : PERM_EVENEVEN,
2793 : : /* Can be combined with any other PERM values. */
2794 : : PERM_TOP
2795 : : } complex_perm_kinds_t;
2796 : :
2797 : : /* Cache from nodes to the load permutation they represent. */
2798 : : typedef hash_map <slp_tree, complex_perm_kinds_t>
2799 : : slp_tree_to_load_perm_map_t;
2800 : :
2801 : : /* Cache from nodes pair to being compatible or not. */
2802 : : typedef pair_hash <nofree_ptr_hash <_slp_tree>,
2803 : : nofree_ptr_hash <_slp_tree>> slp_node_hash;
2804 : : typedef hash_map <slp_node_hash, bool> slp_compat_nodes_map_t;
2805 : :
2806 : :
2807 : : /* Vector pattern matcher base class. All SLP pattern matchers must inherit
2808 : : from this type. */
2809 : :
2810 : : class vect_pattern
2811 : : {
2812 : : protected:
2813 : : /* The number of arguments that the IFN requires. */
2814 : : unsigned m_num_args;
2815 : :
2816 : : /* The internal function that will be used when a pattern is created. */
2817 : : internal_fn m_ifn;
2818 : :
2819 : : /* The current node being inspected. */
2820 : : slp_tree *m_node;
2821 : :
2822 : : /* The list of operands to be the children for the node produced when the
2823 : : internal function is created. */
2824 : : vec<slp_tree> m_ops;
2825 : :
2826 : : /* Default constructor where NODE is the root of the tree to inspect. */
2827 : 1159 : vect_pattern (slp_tree *node, vec<slp_tree> *m_ops, internal_fn ifn)
2828 : 1159 : {
2829 : 1159 : this->m_ifn = ifn;
2830 : 1159 : this->m_node = node;
2831 : 1159 : this->m_ops.create (0);
2832 : 1159 : if (m_ops)
2833 : 20 : this->m_ops.safe_splice (*m_ops);
2834 : : }
2835 : :
2836 : : public:
2837 : :
2838 : : /* Create a new instance of the pattern matcher class of the given type. */
2839 : : static vect_pattern* recognize (slp_tree_to_load_perm_map_t *,
2840 : : slp_compat_nodes_map_t *, slp_tree *);
2841 : :
2842 : : /* Build the pattern from the data collected so far. */
2843 : : virtual void build (vec_info *) = 0;
2844 : :
2845 : : /* Default destructor. */
2846 : : virtual ~vect_pattern ()
2847 : : {
2848 : : this->m_ops.release ();
2849 : : }
2850 : : };
2851 : :
2852 : : /* Function pointer to create a new pattern matcher from a generic type. */
2853 : : typedef vect_pattern* (*vect_pattern_decl_t) (slp_tree_to_load_perm_map_t *,
2854 : : slp_compat_nodes_map_t *,
2855 : : slp_tree *);
2856 : :
2857 : : /* List of supported pattern matchers. */
2858 : : extern vect_pattern_decl_t slp_patterns[];
2859 : :
2860 : : /* Number of supported pattern matchers. */
2861 : : extern size_t num__slp_patterns;
2862 : :
2863 : : /* ----------------------------------------------------------------------
2864 : : Target support routines
2865 : : -----------------------------------------------------------------------
2866 : : The following routines are provided to simplify costing decisions in
2867 : : target code. Please add more as needed. */
2868 : :
2869 : : /* Return true if an operaton of kind KIND for STMT_INFO represents
2870 : : the extraction of an element from a vector in preparation for
2871 : : storing the element to memory. */
2872 : : inline bool
2873 : : vect_is_store_elt_extraction (vect_cost_for_stmt kind, stmt_vec_info stmt_info)
2874 : : {
2875 : : return (kind == vec_to_scalar
2876 : : && STMT_VINFO_DATA_REF (stmt_info)
2877 : : && DR_IS_WRITE (STMT_VINFO_DATA_REF (stmt_info)));
2878 : : }
2879 : :
2880 : : /* Return true if STMT_INFO represents part of a reduction. */
2881 : : inline bool
2882 : 41581718 : vect_is_reduction (stmt_vec_info stmt_info)
2883 : : {
2884 : 41581718 : return STMT_VINFO_REDUC_IDX (stmt_info) != -1;
2885 : : }
2886 : :
2887 : : /* Return true if SLP_NODE represents part of a reduction. */
2888 : : inline bool
2889 : 274274 : vect_is_reduction (slp_tree slp_node)
2890 : : {
2891 : 274274 : return SLP_TREE_REDUC_IDX (slp_node) != -1;
2892 : : }
2893 : :
2894 : : /* If STMT_INFO describes a reduction, return the vect_reduction_type
2895 : : of the reduction it describes, otherwise return -1. */
2896 : : inline int
2897 : : vect_reduc_type (vec_info *vinfo, slp_tree node)
2898 : : {
2899 : : if (loop_vec_info loop_vinfo = dyn_cast<loop_vec_info> (vinfo))
2900 : : {
2901 : : vect_reduc_info reduc_info = info_for_reduction (loop_vinfo, node);
2902 : : if (reduc_info)
2903 : : return int (VECT_REDUC_INFO_TYPE (reduc_info));
2904 : : }
2905 : : return -1;
2906 : : }
2907 : :
2908 : : /* If STMT_INFO is a COND_EXPR that includes an embedded comparison, return the
2909 : : scalar type of the values being compared. Return null otherwise. */
2910 : : inline tree
2911 : : vect_embedded_comparison_type (stmt_vec_info stmt_info)
2912 : : {
2913 : : if (auto *assign = dyn_cast<gassign *> (stmt_info->stmt))
2914 : : if (gimple_assign_rhs_code (assign) == COND_EXPR)
2915 : : {
2916 : : tree cond = gimple_assign_rhs1 (assign);
2917 : : if (COMPARISON_CLASS_P (cond))
2918 : : return TREE_TYPE (TREE_OPERAND (cond, 0));
2919 : : }
2920 : : return NULL_TREE;
2921 : : }
2922 : :
2923 : : /* If STMT_INFO is a comparison or contains an embedded comparison, return the
2924 : : scalar type of the values being compared. Return null otherwise. */
2925 : : inline tree
2926 : : vect_comparison_type (stmt_vec_info stmt_info)
2927 : : {
2928 : : if (auto *assign = dyn_cast<gassign *> (stmt_info->stmt))
2929 : : if (TREE_CODE_CLASS (gimple_assign_rhs_code (assign)) == tcc_comparison)
2930 : : return TREE_TYPE (gimple_assign_rhs1 (assign));
2931 : : return vect_embedded_comparison_type (stmt_info);
2932 : : }
2933 : :
2934 : : /* Return true if STMT_INFO extends the result of a load. */
2935 : : inline bool
2936 : : vect_is_extending_load (class vec_info *vinfo, stmt_vec_info stmt_info)
2937 : : {
2938 : : /* Although this is quite large for an inline function, this part
2939 : : at least should be inline. */
2940 : : gassign *assign = dyn_cast <gassign *> (stmt_info->stmt);
2941 : : if (!assign || !CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (assign)))
2942 : : return false;
2943 : :
2944 : : tree rhs = gimple_assign_rhs1 (stmt_info->stmt);
2945 : : tree lhs_type = TREE_TYPE (gimple_assign_lhs (assign));
2946 : : tree rhs_type = TREE_TYPE (rhs);
2947 : : if (!INTEGRAL_TYPE_P (lhs_type)
2948 : : || !INTEGRAL_TYPE_P (rhs_type)
2949 : : || TYPE_PRECISION (lhs_type) <= TYPE_PRECISION (rhs_type))
2950 : : return false;
2951 : :
2952 : : stmt_vec_info def_stmt_info = vinfo->lookup_def (rhs);
2953 : : return (def_stmt_info
2954 : : && STMT_VINFO_DATA_REF (def_stmt_info)
2955 : : && DR_IS_READ (STMT_VINFO_DATA_REF (def_stmt_info)));
2956 : : }
2957 : :
2958 : : /* Return true if STMT_INFO is an integer truncation. */
2959 : : inline bool
2960 : : vect_is_integer_truncation (stmt_vec_info stmt_info)
2961 : : {
2962 : : gassign *assign = dyn_cast <gassign *> (stmt_info->stmt);
2963 : : if (!assign || !CONVERT_EXPR_CODE_P (gimple_assign_rhs_code (assign)))
2964 : : return false;
2965 : :
2966 : : tree lhs_type = TREE_TYPE (gimple_assign_lhs (assign));
2967 : : tree rhs_type = TREE_TYPE (gimple_assign_rhs1 (assign));
2968 : : return (INTEGRAL_TYPE_P (lhs_type)
2969 : : && INTEGRAL_TYPE_P (rhs_type)
2970 : : && TYPE_PRECISION (lhs_type) < TYPE_PRECISION (rhs_type));
2971 : : }
2972 : :
2973 : : /* Build a GIMPLE_ASSIGN or GIMPLE_CALL with the tree_code,
2974 : : or internal_fn contained in ch, respectively. */
2975 : : gimple * vect_gimple_build (tree, code_helper, tree, tree = NULL_TREE);
2976 : : #endif /* GCC_TREE_VECTORIZER_H */
|
