gcc/tree-vectorizer.h

   1 /* Loop Vectorization
   2    Copyright (C) 2003, 2004, 2005, 2006 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 2, 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 COPYING.  If not, write to the Free
  19 Software Foundation, 51 Franklin Street, Fifth Floor, Boston, MA
  20 02110-1301, USA.  */
  21
  22 #ifndef GCC_TREE_VECTORIZER_H
  23 #define GCC_TREE_VECTORIZER_H
  24
  25 #ifdef USE_MAPPED_LOCATION
  26   typedef source_location LOC;
  27   #define UNKNOWN_LOC UNKNOWN_LOCATION
  28   #define EXPR_LOC(e) EXPR_LOCATION(e)
  29   #define LOC_FILE(l) LOCATION_FILE (l)
  30   #define LOC_LINE(l) LOCATION_LINE (l)
  31 #else
  32   typedef source_locus LOC;
  33   #define UNKNOWN_LOC NULL
  34   #define EXPR_LOC(e) EXPR_LOCUS(e)
  35   #define LOC_FILE(l) (l)->file
  36   #define LOC_LINE(l) (l)->line
  37 #endif
  38
  39 /* Used for naming of new temporaries.  */
  40 enum vect_var_kind {
  41   vect_simple_var,
  42   vect_pointer_var,
  43   vect_scalar_var
  44 };
  45
  46 /* Defines type of operation.  */
  47 enum operation_type {
  48   unary_op = 1,
  49   binary_op,
  50   ternary_op
  51 };
  52
  53 /* Define type of available alignment support.  */
  54 enum dr_alignment_support {
  55   dr_unaligned_unsupported,
  56   dr_unaligned_supported,
  57   dr_unaligned_software_pipeline,
  58   dr_aligned
  59 };
  60
  61 /* Define type of def-use cross-iteration cycle.  */
  62 enum vect_def_type {
  63   vect_constant_def,
  64   vect_invariant_def,
  65   vect_loop_def,
  66   vect_induction_def,
  67   vect_reduction_def,
  68   vect_unknown_def_type
  69 };
  70
  71 /* Define verbosity levels.  */
  72 enum verbosity_levels {
  73   REPORT_NONE,
  74   REPORT_VECTORIZED_LOOPS,
  75   REPORT_UNVECTORIZED_LOOPS,
  76   REPORT_ALIGNMENT,
  77   REPORT_DR_DETAILS,
  78   REPORT_BAD_FORM_LOOPS,
  79   REPORT_OUTER_LOOPS,
  80   REPORT_DETAILS,
  81   /* New verbosity levels should be added before this one.  */
  82   MAX_VERBOSITY_LEVEL
  83 };
  84
  85 /*-----------------------------------------------------------------*/
  86 /* Info on vectorized loops.                                       */
  87 /*-----------------------------------------------------------------*/
  88 typedef struct _loop_vec_info {
  89
  90   /* The loop to which this info struct refers to.  */
  91   struct loop *loop;
  92
  93   /* The loop basic blocks.  */
  94   basic_block *bbs;
  95
  96   /* The loop exit_condition.  */
  97   tree exit_cond;
  98
  99   /* Number of iterations.  */
 100   tree num_iters;
 101
 102   /* Is the loop vectorizable? */
 103   bool vectorizable;
 104
 105   /* Unrolling factor  */
 106   int vectorization_factor;
 107
 108   /* Unknown DRs according to which loop was peeled.  */
 109   struct data_reference *unaligned_dr;
 110
 111   /* peeling_for_alignment indicates whether peeling for alignment will take
 112      place, and what the peeling factor should be:
 113      peeling_for_alignment = X means:
 114         If X=0: Peeling for alignment will not be applied.
 115         If X>0: Peel first X iterations.
 116         If X=-1: Generate a runtime test to calculate the number of iterations
 117                  to be peeled, using the dataref recorded in the field
 118                  unaligned_dr.  */
 119   int peeling_for_alignment;
 120
 121   /* The mask used to check the alignment of pointers or arrays.  */
 122   int ptr_mask;
 123
 124   /* All data references in the loop.  */
 125   VEC (data_reference_p, heap) *datarefs;
 126
 127   /* All data dependences in the loop.  */
 128   VEC (ddr_p, heap) *ddrs;
 129
 130   /* Statements in the loop that have data references that are candidates for a
 131      runtime (loop versioning) misalignment check.  */
 132   VEC(tree,heap) *may_misalign_stmts;
 133
 134   /* The loop location in the source.  */
 135   LOC loop_line_number;
 136 } *loop_vec_info;
 137
 138 /* Access Functions.  */
 139 #define LOOP_VINFO_LOOP(L)            (L)->loop
 140 #define LOOP_VINFO_BBS(L)             (L)->bbs
 141 #define LOOP_VINFO_EXIT_COND(L)       (L)->exit_cond
 142 #define LOOP_VINFO_NITERS(L)          (L)->num_iters
 143 #define LOOP_VINFO_VECTORIZABLE_P(L)  (L)->vectorizable
 144 #define LOOP_VINFO_VECT_FACTOR(L)     (L)->vectorization_factor
 145 #define LOOP_VINFO_PTR_MASK(L)        (L)->ptr_mask
 146 #define LOOP_VINFO_DATAREFS(L)        (L)->datarefs
 147 #define LOOP_VINFO_DDRS(L)            (L)->ddrs
 148 #define LOOP_VINFO_INT_NITERS(L)      (TREE_INT_CST_LOW ((L)->num_iters))
 149 #define LOOP_PEELING_FOR_ALIGNMENT(L) (L)->peeling_for_alignment
 150 #define LOOP_VINFO_UNALIGNED_DR(L)    (L)->unaligned_dr
 151 #define LOOP_VINFO_MAY_MISALIGN_STMTS(L) (L)->may_misalign_stmts
 152 #define LOOP_VINFO_LOC(L)             (L)->loop_line_number
 153
 154 #define LOOP_VINFO_NITERS_KNOWN_P(L)                     \
 155 (host_integerp ((L)->num_iters,0)                        \
 156 && TREE_INT_CST_LOW ((L)->num_iters) > 0)
 157
 158 /*-----------------------------------------------------------------*/
 159 /* Info on vectorized defs.                                        */
 160 /*-----------------------------------------------------------------*/
 161 enum stmt_vec_info_type {
 162   undef_vec_info_type = 0,
 163   load_vec_info_type,
 164   store_vec_info_type,
 165   op_vec_info_type,
 166   assignment_vec_info_type,
 167   condition_vec_info_type,
 168   reduc_vec_info_type,
 169   type_promotion_vec_info_type,
 170   type_demotion_vec_info_type
 171 };
 172
 173 /* Indicates whether/how a variable is used in the loop.  */
 174 enum vect_relevant {
 175   vect_unused_in_loop = 0,
 176   vect_used_by_reduction,
 177   vect_used_in_loop
 178 };
 179
 180 typedef struct data_reference *dr_p;
 181 DEF_VEC_P(dr_p);
 182 DEF_VEC_ALLOC_P(dr_p,heap);
 183
 184 typedef struct _stmt_vec_info {
 185
 186   enum stmt_vec_info_type type;
 187
 188   /* The stmt to which this info struct refers to.  */
 189   tree stmt;
 190
 191   /* The loop_vec_info with respect to which STMT is vectorized.  */
 192   loop_vec_info loop_vinfo;
 193
 194   /* Not all stmts in the loop need to be vectorized. e.g, the increment
 195      of the loop induction variable and computation of array indexes. relevant
 196      indicates whether the stmt needs to be vectorized.  */
 197   enum vect_relevant relevant;
 198
 199   /* Indicates whether this stmts is part of a computation whose result is
 200      used outside the loop.  */
 201   bool live;
 202
 203   /* The vector type to be used.  */
 204   tree vectype;
 205
 206   /* The vectorized version of the stmt.  */
 207   tree vectorized_stmt;
 208
 209
 210   /** The following is relevant only for stmts that contain a non-scalar
 211      data-ref (array/pointer/struct access). A GIMPLE stmt is expected to have
 212      at most one such data-ref.  **/
 213
 214   /* Information about the data-ref (access function, etc).  */
 215   struct data_reference *data_ref_info;
 216
 217   /* Stmt is part of some pattern (computation idiom)  */
 218   bool in_pattern_p;
 219
 220   /* Used for various bookkeeping purposes, generally holding a pointer to
 221      some other stmt S that is in some way "related" to this stmt.
 222      Current use of this field is:
 223         If this stmt is part of a pattern (i.e. the field 'in_pattern_p' is
 224         true): S is the "pattern stmt" that represents (and replaces) the
 225         sequence of stmts that constitutes the pattern.  Similarly, the
 226         related_stmt of the "pattern stmt" points back to this stmt (which is
 227         the last stmt in the original sequence of stmts that constitutes the
 228         pattern).  */
 229   tree related_stmt;
 230
 231   /* List of datarefs that are known to have the same alignment as the dataref
 232      of this stmt.  */
 233   VEC(dr_p,heap) *same_align_refs;
 234
 235   /* Classify the def of this stmt.  */
 236   enum vect_def_type def_type;
 237
 238   /* Interleaving info.  */
 239   /* First data-ref in the interleaving group.  */
 240   tree first_dr;
 241   /* Pointer to the next data-ref in the group.  */
 242   tree next_dr;
 243   /* The size of the interleaving group.  */
 244   unsigned int size;
 245   /* For stores, number of stores from this group seen. We vectorize the last
 246      one.  */
 247   unsigned int store_count;
 248   /* For loads only, the gap from the previous load. For consecutive loads, GAP
 249      is 1.  */
 250   unsigned int gap;
 251   /* In case that two or more stmts share data-ref, this is the pointer to the
 252      previously detected stmt with the same dr.  */
 253   tree same_dr_stmt;
 254 } *stmt_vec_info;
 255
 256 /* Access Functions.  */
 257 #define STMT_VINFO_TYPE(S)                 (S)->type
 258 #define STMT_VINFO_STMT(S)                 (S)->stmt
 259 #define STMT_VINFO_LOOP_VINFO(S)           (S)->loop_vinfo
 260 #define STMT_VINFO_RELEVANT(S)             (S)->relevant
 261 #define STMT_VINFO_LIVE_P(S)               (S)->live
 262 #define STMT_VINFO_VECTYPE(S)              (S)->vectype
 263 #define STMT_VINFO_VEC_STMT(S)             (S)->vectorized_stmt
 264 #define STMT_VINFO_DATA_REF(S)             (S)->data_ref_info
 265 #define STMT_VINFO_IN_PATTERN_P(S)         (S)->in_pattern_p
 266 #define STMT_VINFO_RELATED_STMT(S)         (S)->related_stmt
 267 #define STMT_VINFO_SAME_ALIGN_REFS(S)      (S)->same_align_refs
 268 #define STMT_VINFO_DEF_TYPE(S)             (S)->def_type
 269 #define STMT_VINFO_DR_GROUP_FIRST_DR(S)    (S)->first_dr
 270 #define STMT_VINFO_DR_GROUP_NEXT_DR(S)     (S)->next_dr
 271 #define STMT_VINFO_DR_GROUP_SIZE(S)        (S)->size
 272 #define STMT_VINFO_DR_GROUP_STORE_COUNT(S) (S)->store_count
 273 #define STMT_VINFO_DR_GROUP_GAP(S)         (S)->gap
 274 #define STMT_VINFO_DR_GROUP_SAME_DR_STMT(S)(S)->same_dr_stmt
 275
 276 #define DR_GROUP_FIRST_DR(S)               (S)->first_dr
 277 #define DR_GROUP_NEXT_DR(S)                (S)->next_dr
 278 #define DR_GROUP_SIZE(S)                   (S)->size
 279 #define DR_GROUP_STORE_COUNT(S)            (S)->store_count
 280 #define DR_GROUP_GAP(S)                    (S)->gap
 281 #define DR_GROUP_SAME_DR_STMT(S)           (S)->same_dr_stmt
 282
 283 #define STMT_VINFO_RELEVANT_P(S)          ((S)->relevant != vect_unused_in_loop)
 284
 285 static inline void set_stmt_info (stmt_ann_t ann, stmt_vec_info stmt_info);
 286 static inline stmt_vec_info vinfo_for_stmt (tree stmt);
 287
 288 static inline void
 289 set_stmt_info (stmt_ann_t ann, stmt_vec_info stmt_info)
 290 {
 291   if (ann)
 292     ann->common.aux = (char *) stmt_info;
 293 }
 294
 295 static inline stmt_vec_info
 296 vinfo_for_stmt (tree stmt)
 297 {
 298   stmt_ann_t ann = stmt_ann (stmt);
 299   return ann ? (stmt_vec_info) ann->common.aux : NULL;
 300 }
 301
 302 /*-----------------------------------------------------------------*/
 303 /* Info on data references alignment.                              */
 304 /*-----------------------------------------------------------------*/
 305
 306 /* Reflects actual alignment of first access in the vectorized loop,
 307    taking into account peeling/versioning if applied.  */
 308 #define DR_MISALIGNMENT(DR)   (DR)->aux
 309
 310 static inline bool
 311 aligned_access_p (struct data_reference *data_ref_info)
 312 {
 313   return (DR_MISALIGNMENT (data_ref_info) == 0);
 314 }
 315
 316 static inline bool
 317 known_alignment_for_access_p (struct data_reference *data_ref_info)
 318 {
 319   return (DR_MISALIGNMENT (data_ref_info) != -1);
 320 }
 321
 322 /* Perform signed modulo, always returning a non-negative value.  */
 323 #define VECT_SMODULO(x,y) ((x) % (y) < 0 ? ((x) % (y) + (y)) : (x) % (y))
 324
 325 /* vect_dump will be set to stderr or dump_file if exist.  */
 326 extern FILE *vect_dump;
 327 extern enum verbosity_levels vect_verbosity_level;
 328
 329 /* Number of loops, at the beginning of vectorization.  */
 330 extern unsigned int vect_loops_num;
 331
 332 /* Bitmap of virtual variables to be renamed.  */
 333 extern bitmap vect_vnames_to_rename;
 334
 335 /*-----------------------------------------------------------------*/
 336 /* Function prototypes.                                            */
 337 /*-----------------------------------------------------------------*/
 338
 339 /*************************************************************************
 340   Simple Loop Peeling Utilities - in tree-vectorizer.c
 341  *************************************************************************/
 342 /* Entry point for peeling of simple loops.
 343    Peel the first/last iterations of a loop.
 344    It can be used outside of the vectorizer for loops that are simple enough
 345    (see function documentation).  In the vectorizer it is used to peel the
 346    last few iterations when the loop bound is unknown or does not evenly
 347    divide by the vectorization factor, and to peel the first few iterations
 348    to force the alignment of data references in the loop.  */
 349 extern struct loop *slpeel_tree_peel_loop_to_edge
 350   (struct loop *, edge, tree, tree, bool);
 351 extern void slpeel_make_loop_iterate_ntimes (struct loop *, tree);
 352 extern bool slpeel_can_duplicate_loop_p (struct loop *, edge);
 353 #ifdef ENABLE_CHECKING
 354 extern void slpeel_verify_cfg_after_peeling (struct loop *, struct loop *);
 355 #endif
 356
 357
 358 /*************************************************************************
 359   General Vectorization Utilities
 360  *************************************************************************/
 361 /** In tree-vectorizer.c **/
 362 extern tree get_vectype_for_scalar_type (tree);
 363 extern bool vect_is_simple_use (tree, loop_vec_info, tree *, tree *,
 364                                 enum vect_def_type *);
 365 extern bool vect_is_simple_iv_evolution (unsigned, tree, tree *, tree *);
 366 extern tree vect_is_simple_reduction (struct loop *, tree);
 367 extern bool vect_can_force_dr_alignment_p (tree, unsigned int);
 368 extern enum dr_alignment_support vect_supportable_dr_alignment
 369   (struct data_reference *);
 370 extern bool reduction_code_for_scalar_code (enum tree_code, enum tree_code *);
 371 extern bool supportable_widening_operation (enum tree_code, tree, tree,
 372   tree *, tree *, enum tree_code *, enum tree_code *);
 373 /* Creation and deletion of loop and stmt info structs.  */
 374 extern loop_vec_info new_loop_vec_info (struct loop *loop);
 375 extern void destroy_loop_vec_info (loop_vec_info);
 376 extern stmt_vec_info new_stmt_vec_info (tree stmt, loop_vec_info);
 377
 378
 379 /** In tree-vect-analyze.c  **/
 380 /* Driver for analysis stage.  */
 381 extern loop_vec_info vect_analyze_loop (struct loop *);
 382
 383
 384 /** In tree-vect-patterns.c  **/
 385 /* Pattern recognition functions.
 386    Additional pattern recognition functions can (and will) be added
 387    in the future.  */
 388 typedef tree (* vect_recog_func_ptr) (tree, tree *, tree *);
 389 #define NUM_PATTERNS 4
 390 void vect_pattern_recog (loop_vec_info);
 391
 392
 393 /** In tree-vect-transform.c  **/
 394 extern bool vectorizable_load (tree, block_stmt_iterator *, tree *);
 395 extern bool vectorizable_store (tree, block_stmt_iterator *, tree *);
 396 extern bool vectorizable_operation (tree, block_stmt_iterator *, tree *);
 397 extern bool vectorizable_type_promotion (tree, block_stmt_iterator *, tree *);
 398 extern bool vectorizable_type_demotion (tree, block_stmt_iterator *, tree *);
 399 extern bool vectorizable_assignment (tree, block_stmt_iterator *, tree *);
 400 extern bool vectorizable_condition (tree, block_stmt_iterator *, tree *);
 401 extern bool vectorizable_live_operation (tree, block_stmt_iterator *, tree *);
 402 extern bool vectorizable_reduction (tree, block_stmt_iterator *, tree *);
 403 /* Driver for transformation stage.  */
 404 extern void vect_transform_loop (loop_vec_info);
 405
 406 /*************************************************************************
 407   Vectorization Debug Information - in tree-vectorizer.c
 408  *************************************************************************/
 409 extern bool vect_print_dump_info (enum verbosity_levels);
 410 extern void vect_set_verbosity_level (const char *);
 411 extern LOC find_loop_location (struct loop *);
 412
 413 #endif  /* GCC_TREE_VECTORIZER_H  */