2 Copyright (C) 2003, 2004, 2005, 2006, 2007 Free Software Foundation, Inc.
3 Contributed by Dorit Naishlos <dorit@il.ibm.com>
5 This file is part of GCC.
7 GCC is free software; you can redistribute it and/or modify it under
8 the terms of the GNU General Public License as published by the Free
9 Software Foundation; either version 3, or (at your option) any later
12 GCC is distributed in the hope that it will be useful, but WITHOUT ANY
13 WARRANTY; without even the implied warranty of MERCHANTABILITY or
14 FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
17 You should have received a copy of the GNU General Public License
18 along with GCC; see the file COPYING3. If not see
19 <http://www.gnu.org/licenses/>. */
21 #ifndef GCC_TREE_VECTORIZER_H
22 #define GCC_TREE_VECTORIZER_H
24 #ifdef USE_MAPPED_LOCATION
25 typedef source_location LOC;
26 #define UNKNOWN_LOC UNKNOWN_LOCATION
27 #define EXPR_LOC(e) EXPR_LOCATION(e)
28 #define LOC_FILE(l) LOCATION_FILE (l)
29 #define LOC_LINE(l) LOCATION_LINE (l)
31 typedef source_locus LOC;
32 #define UNKNOWN_LOC NULL
33 #define EXPR_LOC(e) EXPR_LOCUS(e)
34 #define LOC_FILE(l) (l)->file
35 #define LOC_LINE(l) (l)->line
38 /* Used for naming of new temporaries. */
45 /* Defines type of operation. */
52 /* Define type of available alignment support. */
53 enum dr_alignment_support {
54 dr_unaligned_unsupported,
55 dr_unaligned_supported,
57 dr_explicit_realign_optimized,
61 /* Define type of def-use cross-iteration cycle. */
63 vect_constant_def = 1,
71 /* Define verbosity levels. */
72 enum verbosity_levels {
74 REPORT_VECTORIZED_LOOPS,
75 REPORT_UNVECTORIZED_LOOPS,
78 REPORT_BAD_FORM_LOOPS,
82 /* New verbosity levels should be added before this one. */
86 /************************************************************************
88 ************************************************************************/
90 /* A computation tree of an SLP instance. Each node corresponds to a group of
91 stmts to be packed in a SIMD stmt. */
92 typedef struct _slp_tree {
93 /* Only binary and unary operations are supported. LEFT child corresponds to
94 the first operand and RIGHT child to the second if the operation is
96 struct _slp_tree *left;
97 struct _slp_tree *right;
98 /* A group of scalar stmts to be vectorized together. */
99 VEC (tree, heap) *stmts;
100 /* Vectorized stmt/s. */
101 VEC (tree, heap) *vec_stmts;
102 /* Number of vector stmts that are created to replace the group of scalar
103 stmts. It is calculated during the transformation phase as the number of
104 scalar elements in one scalar iteration (GROUP_SIZE) multiplied by VF
105 divided by vector size. */
106 unsigned int vec_stmts_size;
107 /* Vectorization costs associated with SLP node. */
110 int outside_of_loop; /* Statements generated outside loop. */
111 int inside_of_loop; /* Statements generated inside loop. */
116 /* SLP instance is a sequence of stmts in a loop that can be packed into
118 typedef struct _slp_instance {
119 /* The root of SLP tree. */
122 /* Size of groups of scalar stmts that will be replaced by SIMD stmt/s. */
123 unsigned int group_size;
125 /* The unrolling factor required to vectorized this SLP instance. */
126 unsigned int unrolling_factor;
128 /* Vectorization costs associated with SLP instance. */
131 int outside_of_loop; /* Statements generated outside loop. */
132 int inside_of_loop; /* Statements generated inside loop. */
136 DEF_VEC_P(slp_instance);
137 DEF_VEC_ALLOC_P(slp_instance, heap);
139 /* Access Functions. */
140 #define SLP_INSTANCE_TREE(S) (S)->root
141 #define SLP_INSTANCE_GROUP_SIZE(S) (S)->group_size
142 #define SLP_INSTANCE_UNROLLING_FACTOR(S) (S)->unrolling_factor
143 #define SLP_INSTANCE_OUTSIDE_OF_LOOP_COST(S) (S)->cost.outside_of_loop
144 #define SLP_INSTANCE_INSIDE_OF_LOOP_COST(S) (S)->cost.inside_of_loop
146 #define SLP_TREE_LEFT(S) (S)->left
147 #define SLP_TREE_RIGHT(S) (S)->right
148 #define SLP_TREE_SCALAR_STMTS(S) (S)->stmts
149 #define SLP_TREE_VEC_STMTS(S) (S)->vec_stmts
150 #define SLP_TREE_NUMBER_OF_VEC_STMTS(S) (S)->vec_stmts_size
151 #define SLP_TREE_OUTSIDE_OF_LOOP_COST(S) (S)->cost.outside_of_loop
152 #define SLP_TREE_INSIDE_OF_LOOP_COST(S) (S)->cost.inside_of_loop
154 /*-----------------------------------------------------------------*/
155 /* Info on vectorized loops. */
156 /*-----------------------------------------------------------------*/
157 typedef struct _loop_vec_info {
159 /* The loop to which this info struct refers to. */
162 /* The loop basic blocks. */
165 /* Number of iterations. */
168 /* Minimum number of iterations below which vectorization is expected to
169 not be profitable (as estimated by the cost model).
170 -1 indicates that vectorization will not be profitable.
171 FORNOW: This field is an int. Will be a tree in the future, to represent
172 values unknown at compile time. */
173 int min_profitable_iters;
175 /* Is the loop vectorizable? */
178 /* Unrolling factor */
179 int vectorization_factor;
181 /* Unknown DRs according to which loop was peeled. */
182 struct data_reference *unaligned_dr;
184 /* peeling_for_alignment indicates whether peeling for alignment will take
185 place, and what the peeling factor should be:
186 peeling_for_alignment = X means:
187 If X=0: Peeling for alignment will not be applied.
188 If X>0: Peel first X iterations.
189 If X=-1: Generate a runtime test to calculate the number of iterations
190 to be peeled, using the dataref recorded in the field
192 int peeling_for_alignment;
194 /* The mask used to check the alignment of pointers or arrays. */
197 /* All data references in the loop. */
198 VEC (data_reference_p, heap) *datarefs;
200 /* All data dependences in the loop. */
201 VEC (ddr_p, heap) *ddrs;
203 /* Data Dependence Relations defining address ranges that are candidates
204 for a run-time aliasing check. */
205 VEC (ddr_p, heap) *may_alias_ddrs;
207 /* Statements in the loop that have data references that are candidates for a
208 runtime (loop versioning) misalignment check. */
209 VEC(tree,heap) *may_misalign_stmts;
211 /* The loop location in the source. */
212 LOC loop_line_number;
214 /* All interleaving chains of stores in the loop, represented by the first
215 stmt in the chain. */
216 VEC(tree, heap) *strided_stores;
218 /* All SLP instances in the loop. This is a subset of the set of STRIDED_STORES
220 VEC(slp_instance, heap) *slp_instances;
222 /* The unrolling factor needed to SLP the loop. In case of that pure SLP is
223 applied to the loop, i.e., no unrolling is needed, this is 1. */
224 unsigned slp_unrolling_factor;
227 /* Access Functions. */
228 #define LOOP_VINFO_LOOP(L) (L)->loop
229 #define LOOP_VINFO_BBS(L) (L)->bbs
230 #define LOOP_VINFO_NITERS(L) (L)->num_iters
231 /* Since LOOP_VINFO_NITERS can change after prologue peeling
232 retain total unchanged scalar loop iterations for cost model. */
233 #define LOOP_VINFO_NITERS_UNCHANGED(L) (L)->num_iters
234 #define LOOP_VINFO_COST_MODEL_MIN_ITERS(L) (L)->min_profitable_iters
235 #define LOOP_VINFO_VECTORIZABLE_P(L) (L)->vectorizable
236 #define LOOP_VINFO_VECT_FACTOR(L) (L)->vectorization_factor
237 #define LOOP_VINFO_PTR_MASK(L) (L)->ptr_mask
238 #define LOOP_VINFO_DATAREFS(L) (L)->datarefs
239 #define LOOP_VINFO_DDRS(L) (L)->ddrs
240 #define LOOP_VINFO_INT_NITERS(L) (TREE_INT_CST_LOW ((L)->num_iters))
241 #define LOOP_PEELING_FOR_ALIGNMENT(L) (L)->peeling_for_alignment
242 #define LOOP_VINFO_UNALIGNED_DR(L) (L)->unaligned_dr
243 #define LOOP_VINFO_MAY_MISALIGN_STMTS(L) (L)->may_misalign_stmts
244 #define LOOP_VINFO_LOC(L) (L)->loop_line_number
245 #define LOOP_VINFO_MAY_ALIAS_DDRS(L) (L)->may_alias_ddrs
246 #define LOOP_VINFO_STRIDED_STORES(L) (L)->strided_stores
247 #define LOOP_VINFO_SLP_INSTANCES(L) (L)->slp_instances
248 #define LOOP_VINFO_SLP_UNROLLING_FACTOR(L) (L)->slp_unrolling_factor
250 #define NITERS_KNOWN_P(n) \
251 (host_integerp ((n),0) \
252 && TREE_INT_CST_LOW ((n)) > 0)
254 #define LOOP_VINFO_NITERS_KNOWN_P(L) \
255 NITERS_KNOWN_P((L)->num_iters)
257 static inline loop_vec_info
258 loop_vec_info_for_loop (struct loop *loop)
260 return (loop_vec_info) loop->aux;
264 nested_in_vect_loop_p (struct loop *loop, tree stmt)
267 && (loop->inner == (bb_for_stmt (stmt))->loop_father));
270 /*-----------------------------------------------------------------*/
271 /* Info on vectorized defs. */
272 /*-----------------------------------------------------------------*/
273 enum stmt_vec_info_type {
274 undef_vec_info_type = 0,
279 assignment_vec_info_type,
280 condition_vec_info_type,
283 type_promotion_vec_info_type,
284 type_demotion_vec_info_type,
285 type_conversion_vec_info_type,
286 loop_exit_ctrl_vec_info_type
289 /* Indicates whether/how a variable is used in the loop. */
291 vect_unused_in_loop = 0,
292 vect_used_in_outer_by_reduction,
295 /* defs that feed computations that end up (only) in a reduction. These
296 defs may be used by non-reduction stmts, but eventually, any
297 computations/values that are affected by these defs are used to compute
298 a reduction (i.e. don't get stored to memory, for example). We use this
299 to identify computations that we can change the order in which they are
301 vect_used_by_reduction,
306 /* The type of vectorization that can be applied to the stmt: regular loop-based
307 vectorization; pure SLP - the stmt is a part of SLP instances and does not
308 have uses outside SLP instances; or hybrid SLP and loop-based - the stmt is
309 a part of SLP instance and also must be loop-based vectorized, since it has
310 uses outside SLP sequences.
312 In the loop context the meanings of pure and hybrid SLP are slightly
313 different. By saying that pure SLP is applied to the loop, we mean that we
314 exploit only intra-iteration parallelism in the loop; i.e., the loop can be
315 vectorized without doing any conceptual unrolling, cause we don't pack
316 together stmts from different iterations, only within a single iteration.
317 Loop hybrid SLP means that we exploit both intra-iteration and
318 inter-iteration parallelism (e.g., number of elements in the vector is 4
319 and the slp-group-size is 2, in which case we don't have enough parallelism
320 within an iteration, so we obtain the rest of the parallelism from subsequent
321 iterations by unrolling the loop by 2). */
329 typedef struct data_reference *dr_p;
331 DEF_VEC_ALLOC_P(dr_p,heap);
333 typedef struct _stmt_vec_info {
335 enum stmt_vec_info_type type;
337 /* The stmt to which this info struct refers to. */
340 /* The loop_vec_info with respect to which STMT is vectorized. */
341 loop_vec_info loop_vinfo;
343 /* Not all stmts in the loop need to be vectorized. e.g, the increment
344 of the loop induction variable and computation of array indexes. relevant
345 indicates whether the stmt needs to be vectorized. */
346 enum vect_relevant relevant;
348 /* Indicates whether this stmts is part of a computation whose result is
349 used outside the loop. */
352 /* The vector type to be used. */
355 /* The vectorized version of the stmt. */
356 tree vectorized_stmt;
359 /** The following is relevant only for stmts that contain a non-scalar
360 data-ref (array/pointer/struct access). A GIMPLE stmt is expected to have
361 at most one such data-ref. **/
363 /* Information about the data-ref (access function, etc),
364 relative to the inner-most containing loop. */
365 struct data_reference *data_ref_info;
367 /* Information about the data-ref relative to this loop
368 nest (the loop that is being considered for vectorization). */
369 tree dr_base_address;
375 /* Stmt is part of some pattern (computation idiom) */
378 /* Used for various bookkeeping purposes, generally holding a pointer to
379 some other stmt S that is in some way "related" to this stmt.
380 Current use of this field is:
381 If this stmt is part of a pattern (i.e. the field 'in_pattern_p' is
382 true): S is the "pattern stmt" that represents (and replaces) the
383 sequence of stmts that constitutes the pattern. Similarly, the
384 related_stmt of the "pattern stmt" points back to this stmt (which is
385 the last stmt in the original sequence of stmts that constitutes the
389 /* List of datarefs that are known to have the same alignment as the dataref
391 VEC(dr_p,heap) *same_align_refs;
393 /* Classify the def of this stmt. */
394 enum vect_def_type def_type;
396 /* Interleaving info. */
397 /* First data-ref in the interleaving group. */
399 /* Pointer to the next data-ref in the group. */
401 /* The size of the interleaving group. */
403 /* For stores, number of stores from this group seen. We vectorize the last
405 unsigned int store_count;
406 /* For loads only, the gap from the previous load. For consecutive loads, GAP
409 /* In case that two or more stmts share data-ref, this is the pointer to the
410 previously detected stmt with the same dr. */
412 /* For loads only, if there is a store with the same location, this field is
416 /* Vectorization costs associated with statement. */
419 int outside_of_loop; /* Statements generated outside loop. */
420 int inside_of_loop; /* Statements generated inside loop. */
423 /* Whether the stmt is SLPed, loop-based vectorized, or both. */
424 enum slp_vect_type slp_type;
427 /* Access Functions. */
428 #define STMT_VINFO_TYPE(S) (S)->type
429 #define STMT_VINFO_STMT(S) (S)->stmt
430 #define STMT_VINFO_LOOP_VINFO(S) (S)->loop_vinfo
431 #define STMT_VINFO_RELEVANT(S) (S)->relevant
432 #define STMT_VINFO_LIVE_P(S) (S)->live
433 #define STMT_VINFO_VECTYPE(S) (S)->vectype
434 #define STMT_VINFO_VEC_STMT(S) (S)->vectorized_stmt
435 #define STMT_VINFO_DATA_REF(S) (S)->data_ref_info
437 #define STMT_VINFO_DR_BASE_ADDRESS(S) (S)->dr_base_address
438 #define STMT_VINFO_DR_INIT(S) (S)->dr_init
439 #define STMT_VINFO_DR_OFFSET(S) (S)->dr_offset
440 #define STMT_VINFO_DR_STEP(S) (S)->dr_step
441 #define STMT_VINFO_DR_ALIGNED_TO(S) (S)->dr_aligned_to
443 #define STMT_VINFO_IN_PATTERN_P(S) (S)->in_pattern_p
444 #define STMT_VINFO_RELATED_STMT(S) (S)->related_stmt
445 #define STMT_VINFO_SAME_ALIGN_REFS(S) (S)->same_align_refs
446 #define STMT_VINFO_DEF_TYPE(S) (S)->def_type
447 #define STMT_VINFO_DR_GROUP_FIRST_DR(S) (S)->first_dr
448 #define STMT_VINFO_DR_GROUP_NEXT_DR(S) (S)->next_dr
449 #define STMT_VINFO_DR_GROUP_SIZE(S) (S)->size
450 #define STMT_VINFO_DR_GROUP_STORE_COUNT(S) (S)->store_count
451 #define STMT_VINFO_DR_GROUP_GAP(S) (S)->gap
452 #define STMT_VINFO_DR_GROUP_SAME_DR_STMT(S)(S)->same_dr_stmt
453 #define STMT_VINFO_DR_GROUP_READ_WRITE_DEPENDENCE(S) (S)->read_write_dep
454 #define STMT_VINFO_STRIDED_ACCESS(S) ((S)->first_dr != NULL)
456 #define DR_GROUP_FIRST_DR(S) (S)->first_dr
457 #define DR_GROUP_NEXT_DR(S) (S)->next_dr
458 #define DR_GROUP_SIZE(S) (S)->size
459 #define DR_GROUP_STORE_COUNT(S) (S)->store_count
460 #define DR_GROUP_GAP(S) (S)->gap
461 #define DR_GROUP_SAME_DR_STMT(S) (S)->same_dr_stmt
462 #define DR_GROUP_READ_WRITE_DEPENDENCE(S) (S)->read_write_dep
464 #define STMT_VINFO_RELEVANT_P(S) ((S)->relevant != vect_unused_in_loop)
465 #define STMT_VINFO_OUTSIDE_OF_LOOP_COST(S) (S)->cost.outside_of_loop
466 #define STMT_VINFO_INSIDE_OF_LOOP_COST(S) (S)->cost.inside_of_loop
468 #define HYBRID_SLP_STMT(S) ((S)->slp_type == hybrid)
469 #define PURE_SLP_STMT(S) ((S)->slp_type == pure_slp)
470 #define STMT_SLP_TYPE(S) (S)->slp_type
472 /* These are some defines for the initial implementation of the vectorizer's
473 cost model. These will later be target specific hooks. */
475 /* Cost of conditional taken branch. */
476 #ifndef TARG_COND_TAKEN_BRANCH_COST
477 #define TARG_COND_TAKEN_BRANCH_COST 3
480 /* Cost of conditional not taken branch. */
481 #ifndef TARG_COND_NOT_TAKEN_BRANCH_COST
482 #define TARG_COND_NOT_TAKEN_BRANCH_COST 1
485 /* Cost of any scalar operation, excluding load and store. */
486 #ifndef TARG_SCALAR_STMT_COST
487 #define TARG_SCALAR_STMT_COST 1
490 /* Cost of scalar load. */
491 #ifndef TARG_SCALAR_LOAD_COST
492 #define TARG_SCALAR_LOAD_COST 1
495 /* Cost of scalar store. */
496 #ifndef TARG_SCALAR_STORE_COST
497 #define TARG_SCALAR_STORE_COST 1
500 /* Cost of any vector operation, excluding load, store or vector to scalar
502 #ifndef TARG_VEC_STMT_COST
503 #define TARG_VEC_STMT_COST 1
506 /* Cost of vector to scalar operation. */
507 #ifndef TARG_VEC_TO_SCALAR_COST
508 #define TARG_VEC_TO_SCALAR_COST 1
511 /* Cost of scalar to vector operation. */
512 #ifndef TARG_SCALAR_TO_VEC_COST
513 #define TARG_SCALAR_TO_VEC_COST 1
516 /* Cost of aligned vector load. */
517 #ifndef TARG_VEC_LOAD_COST
518 #define TARG_VEC_LOAD_COST 1
521 /* Cost of misaligned vector load. */
522 #ifndef TARG_VEC_UNALIGNED_LOAD_COST
523 #define TARG_VEC_UNALIGNED_LOAD_COST 2
526 /* Cost of vector store. */
527 #ifndef TARG_VEC_STORE_COST
528 #define TARG_VEC_STORE_COST 1
531 static inline void set_stmt_info (stmt_ann_t ann, stmt_vec_info stmt_info);
532 static inline stmt_vec_info vinfo_for_stmt (tree stmt);
535 set_stmt_info (stmt_ann_t ann, stmt_vec_info stmt_info)
538 ann->common.aux = (char *) stmt_info;
541 static inline stmt_vec_info
542 vinfo_for_stmt (tree stmt)
544 stmt_ann_t ann = stmt_ann (stmt);
545 return ann ? (stmt_vec_info) ann->common.aux : NULL;
549 is_pattern_stmt_p (stmt_vec_info stmt_info)
552 stmt_vec_info related_stmt_info;
554 related_stmt = STMT_VINFO_RELATED_STMT (stmt_info);
556 && (related_stmt_info = vinfo_for_stmt (related_stmt))
557 && STMT_VINFO_IN_PATTERN_P (related_stmt_info))
564 is_loop_header_bb_p (basic_block bb)
566 if (bb == (bb->loop_father)->header)
568 gcc_assert (EDGE_COUNT (bb->preds) == 1);
573 stmt_vinfo_set_inside_of_loop_cost (stmt_vec_info stmt_info, slp_tree slp_node,
577 SLP_TREE_INSIDE_OF_LOOP_COST (slp_node) = cost;
579 STMT_VINFO_INSIDE_OF_LOOP_COST (stmt_info) = cost;
583 stmt_vinfo_set_outside_of_loop_cost (stmt_vec_info stmt_info, slp_tree slp_node,
587 SLP_TREE_OUTSIDE_OF_LOOP_COST (slp_node) = cost;
589 STMT_VINFO_OUTSIDE_OF_LOOP_COST (stmt_info) = cost;
593 /*-----------------------------------------------------------------*/
594 /* Info on data references alignment. */
595 /*-----------------------------------------------------------------*/
597 /* Reflects actual alignment of first access in the vectorized loop,
598 taking into account peeling/versioning if applied. */
599 #define DR_MISALIGNMENT(DR) ((int) (size_t) (DR)->aux)
600 #define SET_DR_MISALIGNMENT(DR, VAL) ((DR)->aux = (void *) (size_t) (VAL))
603 aligned_access_p (struct data_reference *data_ref_info)
605 return (DR_MISALIGNMENT (data_ref_info) == 0);
609 known_alignment_for_access_p (struct data_reference *data_ref_info)
611 return (DR_MISALIGNMENT (data_ref_info) != -1);
614 /* vect_dump will be set to stderr or dump_file if exist. */
615 extern FILE *vect_dump;
616 extern enum verbosity_levels vect_verbosity_level;
618 /* Bitmap of virtual variables to be renamed. */
619 extern bitmap vect_memsyms_to_rename;
621 /*-----------------------------------------------------------------*/
622 /* Function prototypes. */
623 /*-----------------------------------------------------------------*/
625 /*************************************************************************
626 Simple Loop Peeling Utilities - in tree-vectorizer.c
627 *************************************************************************/
628 /* Entry point for peeling of simple loops.
629 Peel the first/last iterations of a loop.
630 It can be used outside of the vectorizer for loops that are simple enough
631 (see function documentation). In the vectorizer it is used to peel the
632 last few iterations when the loop bound is unknown or does not evenly
633 divide by the vectorization factor, and to peel the first few iterations
634 to force the alignment of data references in the loop. */
635 extern struct loop *slpeel_tree_peel_loop_to_edge
636 (struct loop *, edge, tree, tree, bool, unsigned int, bool);
637 extern void set_prologue_iterations (basic_block, tree,
638 struct loop *, unsigned int);
639 extern void slpeel_make_loop_iterate_ntimes (struct loop *, tree);
640 extern bool slpeel_can_duplicate_loop_p (const struct loop *, const_edge);
641 #ifdef ENABLE_CHECKING
642 extern void slpeel_verify_cfg_after_peeling (struct loop *, struct loop *);
646 /*************************************************************************
647 General Vectorization Utilities
648 *************************************************************************/
649 /** In tree-vectorizer.c **/
650 extern tree get_vectype_for_scalar_type (tree);
651 extern bool vect_is_simple_use (tree, loop_vec_info, tree *, tree *,
652 enum vect_def_type *);
653 extern bool vect_is_simple_iv_evolution (unsigned, tree, tree *, tree *);
654 extern tree vect_is_simple_reduction (loop_vec_info, tree);
655 extern bool vect_can_force_dr_alignment_p (const_tree, unsigned int);
656 extern enum dr_alignment_support vect_supportable_dr_alignment
657 (struct data_reference *);
658 extern bool reduction_code_for_scalar_code (enum tree_code, enum tree_code *);
659 extern bool supportable_widening_operation (enum tree_code, tree, tree,
660 tree *, tree *, enum tree_code *, enum tree_code *);
661 extern bool supportable_narrowing_operation (enum tree_code, const_tree,
662 const_tree, enum tree_code *);
664 /* Creation and deletion of loop and stmt info structs. */
665 extern loop_vec_info new_loop_vec_info (struct loop *loop);
666 extern void destroy_loop_vec_info (loop_vec_info, bool);
667 extern stmt_vec_info new_stmt_vec_info (tree stmt, loop_vec_info);
670 /** In tree-vect-analyze.c **/
671 /* Driver for analysis stage. */
672 extern loop_vec_info vect_analyze_loop (struct loop *);
673 extern void vect_free_slp_tree (slp_tree);
674 extern loop_vec_info vect_analyze_loop_form (struct loop *);
676 /** In tree-vect-patterns.c **/
677 /* Pattern recognition functions.
678 Additional pattern recognition functions can (and will) be added
680 typedef tree (* vect_recog_func_ptr) (tree, tree *, tree *);
681 #define NUM_PATTERNS 4
682 void vect_pattern_recog (loop_vec_info);
685 /** In tree-vect-transform.c **/
686 extern bool vectorizable_load (tree, block_stmt_iterator *, tree *, slp_tree);
687 extern bool vectorizable_store (tree, block_stmt_iterator *, tree *, slp_tree);
688 extern bool vectorizable_operation (tree, block_stmt_iterator *, tree *,
690 extern bool vectorizable_type_promotion (tree, block_stmt_iterator *, tree *);
691 extern bool vectorizable_type_demotion (tree, block_stmt_iterator *, tree *);
692 extern bool vectorizable_conversion (tree, block_stmt_iterator *,
694 extern bool vectorizable_assignment (tree, block_stmt_iterator *, tree *,
696 extern tree vectorizable_function (tree, tree, tree);
697 extern bool vectorizable_call (tree, block_stmt_iterator *, tree *);
698 extern bool vectorizable_condition (tree, block_stmt_iterator *, tree *);
699 extern bool vectorizable_live_operation (tree, block_stmt_iterator *, tree *);
700 extern bool vectorizable_reduction (tree, block_stmt_iterator *, tree *);
701 extern bool vectorizable_induction (tree, block_stmt_iterator *, tree *);
702 extern int vect_estimate_min_profitable_iters (loop_vec_info);
703 extern void vect_model_simple_cost (stmt_vec_info, int, enum vect_def_type *,
705 extern void vect_model_store_cost (stmt_vec_info, int, enum vect_def_type,
707 extern void vect_model_load_cost (stmt_vec_info, int, slp_tree);
708 /* Driver for transformation stage. */
709 extern void vect_transform_loop (loop_vec_info);
711 /*************************************************************************
712 Vectorization Debug Information - in tree-vectorizer.c
713 *************************************************************************/
714 extern bool vect_print_dump_info (enum verbosity_levels);
715 extern void vect_set_verbosity_level (const char *);
716 extern LOC find_loop_location (struct loop *);
718 #endif /* GCC_TREE_VECTORIZER_H */