]>
Commit | Line | Data |
---|---|---|
ebfd146a | 1 | /* SLP - Basic Block Vectorization |
5624e564 | 2 | Copyright (C) 2007-2015 Free Software Foundation, Inc. |
b8698a0f | 3 | Contributed by Dorit Naishlos <dorit@il.ibm.com> |
ebfd146a IR |
4 | and Ira Rosen <irar@il.ibm.com> |
5 | ||
6 | This file is part of GCC. | |
7 | ||
8 | GCC is free software; you can redistribute it and/or modify it under | |
9 | the terms of the GNU General Public License as published by the Free | |
10 | Software Foundation; either version 3, or (at your option) any later | |
11 | version. | |
12 | ||
13 | GCC is distributed in the hope that it will be useful, but WITHOUT ANY | |
14 | WARRANTY; without even the implied warranty of MERCHANTABILITY or | |
15 | FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License | |
16 | for more details. | |
17 | ||
18 | You should have received a copy of the GNU General Public License | |
19 | along with GCC; see the file COPYING3. If not see | |
20 | <http://www.gnu.org/licenses/>. */ | |
21 | ||
22 | #include "config.h" | |
23 | #include "system.h" | |
24 | #include "coretypes.h" | |
78c60e3d | 25 | #include "dumpfile.h" |
ebfd146a | 26 | #include "tm.h" |
40e23961 MC |
27 | #include "alias.h" |
28 | #include "symtab.h" | |
ebfd146a | 29 | #include "tree.h" |
40e23961 | 30 | #include "fold-const.h" |
d8a2d370 | 31 | #include "stor-layout.h" |
ebfd146a | 32 | #include "target.h" |
60393bbc | 33 | #include "predict.h" |
60393bbc | 34 | #include "hard-reg-set.h" |
60393bbc | 35 | #include "function.h" |
ebfd146a | 36 | #include "basic-block.h" |
cf835838 | 37 | #include "gimple-pretty-print.h" |
2fb9a547 AM |
38 | #include "tree-ssa-alias.h" |
39 | #include "internal-fn.h" | |
40 | #include "gimple-expr.h" | |
442b4905 | 41 | #include "gimple.h" |
5be5c238 | 42 | #include "gimple-iterator.h" |
442b4905 AM |
43 | #include "gimple-ssa.h" |
44 | #include "tree-phinodes.h" | |
45 | #include "ssa-iterators.h" | |
d8a2d370 | 46 | #include "stringpool.h" |
442b4905 | 47 | #include "tree-ssanames.h" |
7ee2468b | 48 | #include "tree-pass.h" |
ebfd146a | 49 | #include "cfgloop.h" |
36566b39 PK |
50 | #include "rtl.h" |
51 | #include "flags.h" | |
36566b39 PK |
52 | #include "insn-config.h" |
53 | #include "expmed.h" | |
54 | #include "dojump.h" | |
55 | #include "explow.h" | |
56 | #include "calls.h" | |
57 | #include "emit-rtl.h" | |
58 | #include "varasm.h" | |
59 | #include "stmt.h" | |
ebfd146a | 60 | #include "expr.h" |
7ee2468b | 61 | #include "recog.h" /* FIXME: for insn_data */ |
b0710fe1 | 62 | #include "insn-codes.h" |
ebfd146a IR |
63 | #include "optabs.h" |
64 | #include "tree-vectorizer.h" | |
2635892a | 65 | #include "langhooks.h" |
642fce57 | 66 | #include "gimple-walk.h" |
ebfd146a | 67 | |
a70d6342 IR |
68 | /* Extract the location of the basic block in the source code. |
69 | Return the basic block location if succeed and NULL if not. */ | |
70 | ||
b05e0233 | 71 | source_location |
a70d6342 IR |
72 | find_bb_location (basic_block bb) |
73 | { | |
74 | gimple stmt = NULL; | |
75 | gimple_stmt_iterator si; | |
76 | ||
77 | if (!bb) | |
b05e0233 | 78 | return UNKNOWN_LOCATION; |
a70d6342 IR |
79 | |
80 | for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si)) | |
81 | { | |
82 | stmt = gsi_stmt (si); | |
b05e0233 | 83 | if (gimple_location (stmt) != UNKNOWN_LOCATION) |
a70d6342 IR |
84 | return gimple_location (stmt); |
85 | } | |
86 | ||
b05e0233 | 87 | return UNKNOWN_LOCATION; |
a70d6342 IR |
88 | } |
89 | ||
90 | ||
ebfd146a IR |
91 | /* Recursively free the memory allocated for the SLP tree rooted at NODE. */ |
92 | ||
93 | static void | |
94 | vect_free_slp_tree (slp_tree node) | |
95 | { | |
d092494c | 96 | int i; |
d755c7ef | 97 | slp_tree child; |
d092494c | 98 | |
ebfd146a IR |
99 | if (!node) |
100 | return; | |
101 | ||
9771b263 | 102 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (node), i, child) |
d755c7ef | 103 | vect_free_slp_tree (child); |
b8698a0f | 104 | |
9771b263 DN |
105 | SLP_TREE_CHILDREN (node).release (); |
106 | SLP_TREE_SCALAR_STMTS (node).release (); | |
107 | SLP_TREE_VEC_STMTS (node).release (); | |
01d8bf07 | 108 | SLP_TREE_LOAD_PERMUTATION (node).release (); |
ebfd146a IR |
109 | |
110 | free (node); | |
111 | } | |
112 | ||
113 | ||
114 | /* Free the memory allocated for the SLP instance. */ | |
115 | ||
116 | void | |
117 | vect_free_slp_instance (slp_instance instance) | |
118 | { | |
119 | vect_free_slp_tree (SLP_INSTANCE_TREE (instance)); | |
9771b263 | 120 | SLP_INSTANCE_LOADS (instance).release (); |
c7e62a26 | 121 | free (instance); |
ebfd146a IR |
122 | } |
123 | ||
124 | ||
d092494c IR |
125 | /* Create an SLP node for SCALAR_STMTS. */ |
126 | ||
127 | static slp_tree | |
9771b263 | 128 | vect_create_new_slp_node (vec<gimple> scalar_stmts) |
d092494c | 129 | { |
d3cfd39e | 130 | slp_tree node; |
9771b263 | 131 | gimple stmt = scalar_stmts[0]; |
d092494c IR |
132 | unsigned int nops; |
133 | ||
134 | if (is_gimple_call (stmt)) | |
135 | nops = gimple_call_num_args (stmt); | |
136 | else if (is_gimple_assign (stmt)) | |
f7e531cf IR |
137 | { |
138 | nops = gimple_num_ops (stmt) - 1; | |
139 | if (gimple_assign_rhs_code (stmt) == COND_EXPR) | |
140 | nops++; | |
141 | } | |
d092494c IR |
142 | else |
143 | return NULL; | |
144 | ||
d3cfd39e | 145 | node = XNEW (struct _slp_tree); |
d092494c | 146 | SLP_TREE_SCALAR_STMTS (node) = scalar_stmts; |
9771b263 DN |
147 | SLP_TREE_VEC_STMTS (node).create (0); |
148 | SLP_TREE_CHILDREN (node).create (nops); | |
01d8bf07 | 149 | SLP_TREE_LOAD_PERMUTATION (node) = vNULL; |
6876e5bc | 150 | SLP_TREE_TWO_OPERATORS (node) = false; |
d092494c IR |
151 | |
152 | return node; | |
153 | } | |
154 | ||
155 | ||
156 | /* Allocate operands info for NOPS operands, and GROUP_SIZE def-stmts for each | |
157 | operand. */ | |
9771b263 | 158 | static vec<slp_oprnd_info> |
d092494c IR |
159 | vect_create_oprnd_info (int nops, int group_size) |
160 | { | |
161 | int i; | |
162 | slp_oprnd_info oprnd_info; | |
9771b263 | 163 | vec<slp_oprnd_info> oprnds_info; |
d092494c | 164 | |
9771b263 | 165 | oprnds_info.create (nops); |
d092494c IR |
166 | for (i = 0; i < nops; i++) |
167 | { | |
168 | oprnd_info = XNEW (struct _slp_oprnd_info); | |
9771b263 | 169 | oprnd_info->def_stmts.create (group_size); |
d092494c | 170 | oprnd_info->first_dt = vect_uninitialized_def; |
793d9a16 | 171 | oprnd_info->first_op_type = NULL_TREE; |
d092494c | 172 | oprnd_info->first_pattern = false; |
effb52da | 173 | oprnd_info->second_pattern = false; |
9771b263 | 174 | oprnds_info.quick_push (oprnd_info); |
d092494c IR |
175 | } |
176 | ||
177 | return oprnds_info; | |
178 | } | |
179 | ||
180 | ||
d3cfd39e JJ |
181 | /* Free operands info. */ |
182 | ||
d092494c | 183 | static void |
9771b263 | 184 | vect_free_oprnd_info (vec<slp_oprnd_info> &oprnds_info) |
d092494c IR |
185 | { |
186 | int i; | |
187 | slp_oprnd_info oprnd_info; | |
188 | ||
9771b263 | 189 | FOR_EACH_VEC_ELT (oprnds_info, i, oprnd_info) |
d3cfd39e | 190 | { |
9771b263 | 191 | oprnd_info->def_stmts.release (); |
d3cfd39e JJ |
192 | XDELETE (oprnd_info); |
193 | } | |
d092494c | 194 | |
9771b263 | 195 | oprnds_info.release (); |
d092494c IR |
196 | } |
197 | ||
198 | ||
d755c7ef RB |
199 | /* Find the place of the data-ref in STMT in the interleaving chain that starts |
200 | from FIRST_STMT. Return -1 if the data-ref is not a part of the chain. */ | |
201 | ||
202 | static int | |
203 | vect_get_place_in_interleaving_chain (gimple stmt, gimple first_stmt) | |
204 | { | |
205 | gimple next_stmt = first_stmt; | |
206 | int result = 0; | |
207 | ||
208 | if (first_stmt != GROUP_FIRST_ELEMENT (vinfo_for_stmt (stmt))) | |
209 | return -1; | |
210 | ||
211 | do | |
212 | { | |
213 | if (next_stmt == stmt) | |
214 | return result; | |
d755c7ef | 215 | next_stmt = GROUP_NEXT_ELEMENT (vinfo_for_stmt (next_stmt)); |
c8047699 RB |
216 | if (next_stmt) |
217 | result += GROUP_GAP (vinfo_for_stmt (next_stmt)); | |
d755c7ef RB |
218 | } |
219 | while (next_stmt); | |
220 | ||
221 | return -1; | |
222 | } | |
223 | ||
224 | ||
d092494c IR |
225 | /* Get the defs for the rhs of STMT (collect them in OPRNDS_INFO), check that |
226 | they are of a valid type and that they match the defs of the first stmt of | |
b0b4483e RB |
227 | the SLP group (stored in OPRNDS_INFO). If there was a fatal error |
228 | return -1, if the error could be corrected by swapping operands of the | |
229 | operation return 1, if everything is ok return 0. */ | |
ebfd146a | 230 | |
b0b4483e | 231 | static int |
a70d6342 | 232 | vect_get_and_check_slp_defs (loop_vec_info loop_vinfo, bb_vec_info bb_vinfo, |
effb52da | 233 | gimple stmt, unsigned stmt_num, |
23847df4 | 234 | vec<slp_oprnd_info> *oprnds_info) |
ebfd146a IR |
235 | { |
236 | tree oprnd; | |
237 | unsigned int i, number_of_oprnds; | |
abf9bfbc | 238 | tree def; |
ebfd146a | 239 | gimple def_stmt; |
d092494c | 240 | enum vect_def_type dt = vect_uninitialized_def; |
a70d6342 | 241 | struct loop *loop = NULL; |
d092494c | 242 | bool pattern = false; |
abf9bfbc | 243 | slp_oprnd_info oprnd_info; |
b0b4483e RB |
244 | int first_op_idx = 1; |
245 | bool commutative = false; | |
246 | bool first_op_cond = false; | |
effb52da RB |
247 | bool first = stmt_num == 0; |
248 | bool second = stmt_num == 1; | |
b8698a0f | 249 | |
a70d6342 IR |
250 | if (loop_vinfo) |
251 | loop = LOOP_VINFO_LOOP (loop_vinfo); | |
ebfd146a | 252 | |
d092494c | 253 | if (is_gimple_call (stmt)) |
190c2236 JJ |
254 | { |
255 | number_of_oprnds = gimple_call_num_args (stmt); | |
b0b4483e | 256 | first_op_idx = 3; |
190c2236 | 257 | } |
f7e531cf IR |
258 | else if (is_gimple_assign (stmt)) |
259 | { | |
b0b4483e | 260 | enum tree_code code = gimple_assign_rhs_code (stmt); |
f7e531cf IR |
261 | number_of_oprnds = gimple_num_ops (stmt) - 1; |
262 | if (gimple_assign_rhs_code (stmt) == COND_EXPR) | |
b0b4483e RB |
263 | { |
264 | first_op_cond = true; | |
265 | commutative = true; | |
266 | number_of_oprnds++; | |
267 | } | |
268 | else | |
269 | commutative = commutative_tree_code (code); | |
f7e531cf | 270 | } |
d092494c | 271 | else |
b0b4483e | 272 | return -1; |
ebfd146a | 273 | |
b0b4483e | 274 | bool swapped = false; |
ebfd146a IR |
275 | for (i = 0; i < number_of_oprnds; i++) |
276 | { | |
b0b4483e RB |
277 | again: |
278 | if (first_op_cond) | |
f7e531cf | 279 | { |
b0b4483e RB |
280 | if (i == 0 || i == 1) |
281 | oprnd = TREE_OPERAND (gimple_op (stmt, first_op_idx), | |
282 | swapped ? !i : i); | |
283 | else | |
284 | oprnd = gimple_op (stmt, first_op_idx + i - 1); | |
f7e531cf IR |
285 | } |
286 | else | |
b0b4483e | 287 | oprnd = gimple_op (stmt, first_op_idx + (swapped ? !i : i)); |
f7e531cf | 288 | |
9771b263 | 289 | oprnd_info = (*oprnds_info)[i]; |
ebfd146a | 290 | |
24ee1384 | 291 | if (!vect_is_simple_use (oprnd, NULL, loop_vinfo, bb_vinfo, &def_stmt, |
3fc356dc | 292 | &def, &dt)) |
ebfd146a | 293 | { |
73fbfcad | 294 | if (dump_enabled_p ()) |
ebfd146a | 295 | { |
78c60e3d | 296 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
3fc356dc | 297 | "Build SLP failed: can't analyze def for "); |
78c60e3d | 298 | dump_generic_expr (MSG_MISSED_OPTIMIZATION, TDF_SLIM, oprnd); |
e645e942 | 299 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); |
ebfd146a IR |
300 | } |
301 | ||
b0b4483e | 302 | return -1; |
ebfd146a IR |
303 | } |
304 | ||
a70d6342 | 305 | /* Check if DEF_STMT is a part of a pattern in LOOP and get the def stmt |
ff802fa1 | 306 | from the pattern. Check that all the stmts of the node are in the |
ebfd146a | 307 | pattern. */ |
f5709183 IR |
308 | if (def_stmt && gimple_bb (def_stmt) |
309 | && ((loop && flow_bb_inside_loop_p (loop, gimple_bb (def_stmt))) | |
310 | || (!loop && gimple_bb (def_stmt) == BB_VINFO_BB (bb_vinfo) | |
311 | && gimple_code (def_stmt) != GIMPLE_PHI)) | |
ebfd146a | 312 | && vinfo_for_stmt (def_stmt) |
83197f37 | 313 | && STMT_VINFO_IN_PATTERN_P (vinfo_for_stmt (def_stmt)) |
f5709183 IR |
314 | && !STMT_VINFO_RELEVANT (vinfo_for_stmt (def_stmt)) |
315 | && !STMT_VINFO_LIVE_P (vinfo_for_stmt (def_stmt))) | |
ebfd146a | 316 | { |
d092494c | 317 | pattern = true; |
effb52da RB |
318 | if (!first && !oprnd_info->first_pattern |
319 | /* Allow different pattern state for the defs of the | |
320 | first stmt in reduction chains. */ | |
321 | && (oprnd_info->first_dt != vect_reduction_def | |
322 | || (!second && !oprnd_info->second_pattern))) | |
d092494c | 323 | { |
b0b4483e RB |
324 | if (i == 0 |
325 | && !swapped | |
326 | && commutative) | |
327 | { | |
328 | swapped = true; | |
329 | goto again; | |
330 | } | |
331 | ||
73fbfcad | 332 | if (dump_enabled_p ()) |
d092494c | 333 | { |
78c60e3d SS |
334 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
335 | "Build SLP failed: some of the stmts" | |
336 | " are in a pattern, and others are not "); | |
337 | dump_generic_expr (MSG_MISSED_OPTIMIZATION, TDF_SLIM, oprnd); | |
e645e942 | 338 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); |
d092494c | 339 | } |
ebfd146a | 340 | |
b0b4483e | 341 | return 1; |
ebfd146a IR |
342 | } |
343 | ||
344 | def_stmt = STMT_VINFO_RELATED_STMT (vinfo_for_stmt (def_stmt)); | |
d092494c | 345 | dt = STMT_VINFO_DEF_TYPE (vinfo_for_stmt (def_stmt)); |
ebfd146a | 346 | |
f7e531cf | 347 | if (dt == vect_unknown_def_type) |
ebfd146a | 348 | { |
73fbfcad | 349 | if (dump_enabled_p ()) |
78c60e3d | 350 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
e645e942 | 351 | "Unsupported pattern.\n"); |
b0b4483e | 352 | return -1; |
ebfd146a IR |
353 | } |
354 | ||
355 | switch (gimple_code (def_stmt)) | |
356 | { | |
357 | case GIMPLE_PHI: | |
d092494c | 358 | def = gimple_phi_result (def_stmt); |
ebfd146a IR |
359 | break; |
360 | ||
361 | case GIMPLE_ASSIGN: | |
d092494c | 362 | def = gimple_assign_lhs (def_stmt); |
ebfd146a IR |
363 | break; |
364 | ||
365 | default: | |
73fbfcad | 366 | if (dump_enabled_p ()) |
78c60e3d | 367 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
e645e942 | 368 | "unsupported defining stmt:\n"); |
b0b4483e | 369 | return -1; |
ebfd146a IR |
370 | } |
371 | } | |
372 | ||
effb52da RB |
373 | if (second) |
374 | oprnd_info->second_pattern = pattern; | |
375 | ||
d092494c | 376 | if (first) |
ebfd146a | 377 | { |
d092494c IR |
378 | oprnd_info->first_dt = dt; |
379 | oprnd_info->first_pattern = pattern; | |
793d9a16 | 380 | oprnd_info->first_op_type = TREE_TYPE (oprnd); |
ebfd146a | 381 | } |
ebfd146a IR |
382 | else |
383 | { | |
d092494c IR |
384 | /* Not first stmt of the group, check that the def-stmt/s match |
385 | the def-stmt/s of the first stmt. Allow different definition | |
386 | types for reduction chains: the first stmt must be a | |
387 | vect_reduction_def (a phi node), and the rest | |
388 | vect_internal_def. */ | |
389 | if (((oprnd_info->first_dt != dt | |
390 | && !(oprnd_info->first_dt == vect_reduction_def | |
793d9a16 RB |
391 | && dt == vect_internal_def) |
392 | && !((oprnd_info->first_dt == vect_external_def | |
393 | || oprnd_info->first_dt == vect_constant_def) | |
394 | && (dt == vect_external_def | |
395 | || dt == vect_constant_def))) | |
396 | || !types_compatible_p (oprnd_info->first_op_type, | |
397 | TREE_TYPE (oprnd)))) | |
ebfd146a | 398 | { |
b0b4483e RB |
399 | /* Try swapping operands if we got a mismatch. */ |
400 | if (i == 0 | |
401 | && !swapped | |
402 | && commutative) | |
403 | { | |
404 | swapped = true; | |
405 | goto again; | |
406 | } | |
407 | ||
abf9bfbc RB |
408 | if (dump_enabled_p ()) |
409 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, | |
e645e942 | 410 | "Build SLP failed: different types\n"); |
d092494c | 411 | |
b0b4483e | 412 | return 1; |
ebfd146a IR |
413 | } |
414 | } | |
415 | ||
416 | /* Check the types of the definitions. */ | |
d092494c | 417 | switch (dt) |
ebfd146a IR |
418 | { |
419 | case vect_constant_def: | |
8644a673 | 420 | case vect_external_def: |
d092494c | 421 | case vect_reduction_def: |
ebfd146a | 422 | break; |
b8698a0f | 423 | |
8644a673 | 424 | case vect_internal_def: |
abf9bfbc | 425 | oprnd_info->def_stmts.quick_push (def_stmt); |
ebfd146a IR |
426 | break; |
427 | ||
428 | default: | |
429 | /* FORNOW: Not supported. */ | |
73fbfcad | 430 | if (dump_enabled_p ()) |
ebfd146a | 431 | { |
78c60e3d SS |
432 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
433 | "Build SLP failed: illegal type of def "); | |
434 | dump_generic_expr (MSG_MISSED_OPTIMIZATION, TDF_SLIM, def); | |
e645e942 | 435 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); |
ebfd146a IR |
436 | } |
437 | ||
b0b4483e | 438 | return -1; |
ebfd146a IR |
439 | } |
440 | } | |
441 | ||
b0b4483e RB |
442 | /* Swap operands. */ |
443 | if (swapped) | |
444 | { | |
445 | if (first_op_cond) | |
446 | { | |
447 | tree cond = gimple_assign_rhs1 (stmt); | |
448 | swap_ssa_operands (stmt, &TREE_OPERAND (cond, 0), | |
449 | &TREE_OPERAND (cond, 1)); | |
450 | TREE_SET_CODE (cond, swap_tree_comparison (TREE_CODE (cond))); | |
451 | } | |
452 | else | |
453 | swap_ssa_operands (stmt, gimple_assign_rhs1_ptr (stmt), | |
454 | gimple_assign_rhs2_ptr (stmt)); | |
455 | } | |
456 | ||
457 | return 0; | |
ebfd146a IR |
458 | } |
459 | ||
460 | ||
6983e6b5 RB |
461 | /* Verify if the scalar stmts STMTS are isomorphic, require data |
462 | permutation or are of unsupported types of operation. Return | |
463 | true if they are, otherwise return false and indicate in *MATCHES | |
464 | which stmts are not isomorphic to the first one. If MATCHES[0] | |
465 | is false then this indicates the comparison could not be | |
466 | carried out or the stmts will never be vectorized by SLP. */ | |
ebfd146a IR |
467 | |
468 | static bool | |
6983e6b5 RB |
469 | vect_build_slp_tree_1 (loop_vec_info loop_vinfo, bb_vec_info bb_vinfo, |
470 | vec<gimple> stmts, unsigned int group_size, | |
471 | unsigned nops, unsigned int *max_nunits, | |
6876e5bc RB |
472 | unsigned int vectorization_factor, bool *matches, |
473 | bool *two_operators) | |
ebfd146a | 474 | { |
ebfd146a | 475 | unsigned int i; |
6876e5bc RB |
476 | gimple first_stmt = stmts[0], stmt = stmts[0]; |
477 | enum tree_code first_stmt_code = ERROR_MARK; | |
478 | enum tree_code alt_stmt_code = ERROR_MARK; | |
479 | enum tree_code rhs_code = ERROR_MARK; | |
f7e531cf | 480 | enum tree_code first_cond_code = ERROR_MARK; |
ebfd146a | 481 | tree lhs; |
6983e6b5 | 482 | bool need_same_oprnds = false; |
e00cdb8a | 483 | tree vectype = NULL_TREE, scalar_type, first_op1 = NULL_TREE; |
ebfd146a IR |
484 | optab optab; |
485 | int icode; | |
ef4bddc2 RS |
486 | machine_mode optab_op2_mode; |
487 | machine_mode vec_mode; | |
ebfd146a | 488 | HOST_WIDE_INT dummy; |
91ff1504 | 489 | gimple first_load = NULL, prev_first_load = NULL; |
f7e531cf | 490 | tree cond; |
d092494c | 491 | |
ebfd146a | 492 | /* For every stmt in NODE find its def stmt/s. */ |
9771b263 | 493 | FOR_EACH_VEC_ELT (stmts, i, stmt) |
ebfd146a | 494 | { |
6983e6b5 RB |
495 | matches[i] = false; |
496 | ||
73fbfcad | 497 | if (dump_enabled_p ()) |
ebfd146a | 498 | { |
78c60e3d SS |
499 | dump_printf_loc (MSG_NOTE, vect_location, "Build SLP for "); |
500 | dump_gimple_stmt (MSG_NOTE, TDF_SLIM, stmt, 0); | |
e645e942 | 501 | dump_printf (MSG_NOTE, "\n"); |
ebfd146a IR |
502 | } |
503 | ||
4b5caab7 IR |
504 | /* Fail to vectorize statements marked as unvectorizable. */ |
505 | if (!STMT_VINFO_VECTORIZABLE (vinfo_for_stmt (stmt))) | |
506 | { | |
73fbfcad | 507 | if (dump_enabled_p ()) |
4b5caab7 | 508 | { |
78c60e3d SS |
509 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
510 | "Build SLP failed: unvectorizable statement "); | |
511 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, stmt, 0); | |
e645e942 | 512 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); |
4b5caab7 | 513 | } |
6983e6b5 RB |
514 | /* Fatal mismatch. */ |
515 | matches[0] = false; | |
4b5caab7 IR |
516 | return false; |
517 | } | |
518 | ||
ebfd146a IR |
519 | lhs = gimple_get_lhs (stmt); |
520 | if (lhs == NULL_TREE) | |
521 | { | |
73fbfcad | 522 | if (dump_enabled_p ()) |
ebfd146a | 523 | { |
78c60e3d SS |
524 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
525 | "Build SLP failed: not GIMPLE_ASSIGN nor " | |
526 | "GIMPLE_CALL "); | |
527 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, stmt, 0); | |
e645e942 | 528 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); |
ebfd146a | 529 | } |
6983e6b5 RB |
530 | /* Fatal mismatch. */ |
531 | matches[0] = false; | |
ebfd146a IR |
532 | return false; |
533 | } | |
534 | ||
f7e531cf IR |
535 | if (is_gimple_assign (stmt) |
536 | && gimple_assign_rhs_code (stmt) == COND_EXPR | |
537 | && (cond = gimple_assign_rhs1 (stmt)) | |
538 | && !COMPARISON_CLASS_P (cond)) | |
539 | { | |
73fbfcad | 540 | if (dump_enabled_p ()) |
f7e531cf | 541 | { |
78c60e3d SS |
542 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
543 | "Build SLP failed: condition is not " | |
544 | "comparison "); | |
545 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, stmt, 0); | |
e645e942 | 546 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); |
f7e531cf | 547 | } |
6983e6b5 RB |
548 | /* Fatal mismatch. */ |
549 | matches[0] = false; | |
f7e531cf IR |
550 | return false; |
551 | } | |
552 | ||
b8698a0f | 553 | scalar_type = vect_get_smallest_scalar_type (stmt, &dummy, &dummy); |
ebfd146a IR |
554 | vectype = get_vectype_for_scalar_type (scalar_type); |
555 | if (!vectype) | |
556 | { | |
73fbfcad | 557 | if (dump_enabled_p ()) |
ebfd146a | 558 | { |
78c60e3d SS |
559 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
560 | "Build SLP failed: unsupported data-type "); | |
561 | dump_generic_expr (MSG_MISSED_OPTIMIZATION, TDF_SLIM, | |
562 | scalar_type); | |
e645e942 | 563 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); |
ebfd146a | 564 | } |
6983e6b5 RB |
565 | /* Fatal mismatch. */ |
566 | matches[0] = false; | |
ebfd146a IR |
567 | return false; |
568 | } | |
b8698a0f | 569 | |
dfc55d30 RB |
570 | /* If populating the vector type requires unrolling then fail |
571 | before adjusting *max_nunits for basic-block vectorization. */ | |
572 | if (bb_vinfo | |
573 | && TYPE_VECTOR_SUBPARTS (vectype) > group_size) | |
574 | { | |
575 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, | |
576 | "Build SLP failed: unrolling required " | |
577 | "in basic block SLP\n"); | |
578 | /* Fatal mismatch. */ | |
579 | matches[0] = false; | |
580 | return false; | |
581 | } | |
582 | ||
4ef69dfc IR |
583 | /* In case of multiple types we need to detect the smallest type. */ |
584 | if (*max_nunits < TYPE_VECTOR_SUBPARTS (vectype)) | |
a70d6342 | 585 | { |
4ef69dfc IR |
586 | *max_nunits = TYPE_VECTOR_SUBPARTS (vectype); |
587 | if (bb_vinfo) | |
588 | vectorization_factor = *max_nunits; | |
a70d6342 | 589 | } |
b8698a0f | 590 | |
538dd0b7 | 591 | if (gcall *call_stmt = dyn_cast <gcall *> (stmt)) |
190c2236 JJ |
592 | { |
593 | rhs_code = CALL_EXPR; | |
538dd0b7 DM |
594 | if (gimple_call_internal_p (call_stmt) |
595 | || gimple_call_tail_p (call_stmt) | |
596 | || gimple_call_noreturn_p (call_stmt) | |
597 | || !gimple_call_nothrow_p (call_stmt) | |
598 | || gimple_call_chain (call_stmt)) | |
190c2236 | 599 | { |
73fbfcad | 600 | if (dump_enabled_p ()) |
190c2236 | 601 | { |
78c60e3d SS |
602 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
603 | "Build SLP failed: unsupported call type "); | |
538dd0b7 DM |
604 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, |
605 | call_stmt, 0); | |
e645e942 | 606 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); |
190c2236 | 607 | } |
6983e6b5 RB |
608 | /* Fatal mismatch. */ |
609 | matches[0] = false; | |
190c2236 JJ |
610 | return false; |
611 | } | |
612 | } | |
ebfd146a IR |
613 | else |
614 | rhs_code = gimple_assign_rhs_code (stmt); | |
615 | ||
616 | /* Check the operation. */ | |
617 | if (i == 0) | |
618 | { | |
619 | first_stmt_code = rhs_code; | |
620 | ||
b8698a0f | 621 | /* Shift arguments should be equal in all the packed stmts for a |
ebfd146a IR |
622 | vector shift with scalar shift operand. */ |
623 | if (rhs_code == LSHIFT_EXPR || rhs_code == RSHIFT_EXPR | |
624 | || rhs_code == LROTATE_EXPR | |
625 | || rhs_code == RROTATE_EXPR) | |
626 | { | |
627 | vec_mode = TYPE_MODE (vectype); | |
628 | ||
629 | /* First see if we have a vector/vector shift. */ | |
630 | optab = optab_for_tree_code (rhs_code, vectype, | |
631 | optab_vector); | |
632 | ||
633 | if (!optab | |
947131ba | 634 | || optab_handler (optab, vec_mode) == CODE_FOR_nothing) |
ebfd146a IR |
635 | { |
636 | /* No vector/vector shift, try for a vector/scalar shift. */ | |
637 | optab = optab_for_tree_code (rhs_code, vectype, | |
638 | optab_scalar); | |
639 | ||
640 | if (!optab) | |
641 | { | |
73fbfcad | 642 | if (dump_enabled_p ()) |
78c60e3d | 643 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
e645e942 | 644 | "Build SLP failed: no optab.\n"); |
6983e6b5 RB |
645 | /* Fatal mismatch. */ |
646 | matches[0] = false; | |
ebfd146a IR |
647 | return false; |
648 | } | |
947131ba | 649 | icode = (int) optab_handler (optab, vec_mode); |
ebfd146a IR |
650 | if (icode == CODE_FOR_nothing) |
651 | { | |
73fbfcad | 652 | if (dump_enabled_p ()) |
78c60e3d SS |
653 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
654 | "Build SLP failed: " | |
e645e942 | 655 | "op not supported by target.\n"); |
6983e6b5 RB |
656 | /* Fatal mismatch. */ |
657 | matches[0] = false; | |
ebfd146a IR |
658 | return false; |
659 | } | |
660 | optab_op2_mode = insn_data[icode].operand[2].mode; | |
661 | if (!VECTOR_MODE_P (optab_op2_mode)) | |
662 | { | |
663 | need_same_oprnds = true; | |
664 | first_op1 = gimple_assign_rhs2 (stmt); | |
665 | } | |
666 | } | |
667 | } | |
36ba4aae IR |
668 | else if (rhs_code == WIDEN_LSHIFT_EXPR) |
669 | { | |
670 | need_same_oprnds = true; | |
671 | first_op1 = gimple_assign_rhs2 (stmt); | |
672 | } | |
ebfd146a IR |
673 | } |
674 | else | |
675 | { | |
6876e5bc RB |
676 | if (first_stmt_code != rhs_code |
677 | && alt_stmt_code == ERROR_MARK) | |
678 | alt_stmt_code = rhs_code; | |
ebfd146a IR |
679 | if (first_stmt_code != rhs_code |
680 | && (first_stmt_code != IMAGPART_EXPR | |
681 | || rhs_code != REALPART_EXPR) | |
682 | && (first_stmt_code != REALPART_EXPR | |
69f11a13 | 683 | || rhs_code != IMAGPART_EXPR) |
6876e5bc RB |
684 | /* Handle mismatches in plus/minus by computing both |
685 | and merging the results. */ | |
686 | && !((first_stmt_code == PLUS_EXPR | |
687 | || first_stmt_code == MINUS_EXPR) | |
688 | && (alt_stmt_code == PLUS_EXPR | |
689 | || alt_stmt_code == MINUS_EXPR) | |
690 | && rhs_code == alt_stmt_code) | |
0d0293ac | 691 | && !(STMT_VINFO_GROUPED_ACCESS (vinfo_for_stmt (stmt)) |
69f11a13 | 692 | && (first_stmt_code == ARRAY_REF |
38000232 | 693 | || first_stmt_code == BIT_FIELD_REF |
69f11a13 IR |
694 | || first_stmt_code == INDIRECT_REF |
695 | || first_stmt_code == COMPONENT_REF | |
696 | || first_stmt_code == MEM_REF))) | |
ebfd146a | 697 | { |
73fbfcad | 698 | if (dump_enabled_p ()) |
ebfd146a | 699 | { |
78c60e3d SS |
700 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
701 | "Build SLP failed: different operation " | |
702 | "in stmt "); | |
703 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, stmt, 0); | |
6876e5bc RB |
704 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
705 | "original stmt "); | |
706 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, | |
707 | first_stmt, 0); | |
ebfd146a | 708 | } |
6983e6b5 RB |
709 | /* Mismatch. */ |
710 | continue; | |
ebfd146a | 711 | } |
b8698a0f L |
712 | |
713 | if (need_same_oprnds | |
ebfd146a IR |
714 | && !operand_equal_p (first_op1, gimple_assign_rhs2 (stmt), 0)) |
715 | { | |
73fbfcad | 716 | if (dump_enabled_p ()) |
ebfd146a | 717 | { |
78c60e3d SS |
718 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
719 | "Build SLP failed: different shift " | |
720 | "arguments in "); | |
721 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, stmt, 0); | |
e645e942 | 722 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); |
ebfd146a | 723 | } |
6983e6b5 RB |
724 | /* Mismatch. */ |
725 | continue; | |
ebfd146a | 726 | } |
190c2236 JJ |
727 | |
728 | if (rhs_code == CALL_EXPR) | |
729 | { | |
9771b263 | 730 | gimple first_stmt = stmts[0]; |
190c2236 JJ |
731 | if (gimple_call_num_args (stmt) != nops |
732 | || !operand_equal_p (gimple_call_fn (first_stmt), | |
733 | gimple_call_fn (stmt), 0) | |
734 | || gimple_call_fntype (first_stmt) | |
735 | != gimple_call_fntype (stmt)) | |
736 | { | |
73fbfcad | 737 | if (dump_enabled_p ()) |
190c2236 | 738 | { |
78c60e3d SS |
739 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
740 | "Build SLP failed: different calls in "); | |
741 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, | |
742 | stmt, 0); | |
e645e942 | 743 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); |
190c2236 | 744 | } |
6983e6b5 RB |
745 | /* Mismatch. */ |
746 | continue; | |
190c2236 JJ |
747 | } |
748 | } | |
ebfd146a IR |
749 | } |
750 | ||
0d0293ac MM |
751 | /* Grouped store or load. */ |
752 | if (STMT_VINFO_GROUPED_ACCESS (vinfo_for_stmt (stmt))) | |
ebfd146a IR |
753 | { |
754 | if (REFERENCE_CLASS_P (lhs)) | |
755 | { | |
756 | /* Store. */ | |
6983e6b5 | 757 | ; |
ebfd146a | 758 | } |
b5aeb3bb IR |
759 | else |
760 | { | |
761 | /* Load. */ | |
b5aeb3bb IR |
762 | /* Check that the size of interleaved loads group is not |
763 | greater than the SLP group size. */ | |
314f64eb RB |
764 | unsigned ncopies |
765 | = vectorization_factor / TYPE_VECTOR_SUBPARTS (vectype); | |
6aa904c4 | 766 | if (loop_vinfo |
a64b9c26 RB |
767 | && GROUP_FIRST_ELEMENT (vinfo_for_stmt (stmt)) == stmt |
768 | && ((GROUP_SIZE (vinfo_for_stmt (stmt)) | |
769 | - GROUP_GAP (vinfo_for_stmt (stmt))) | |
770 | > ncopies * group_size)) | |
b5aeb3bb | 771 | { |
73fbfcad | 772 | if (dump_enabled_p ()) |
b5aeb3bb | 773 | { |
78c60e3d SS |
774 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
775 | "Build SLP failed: the number " | |
776 | "of interleaved loads is greater than " | |
777 | "the SLP group size "); | |
778 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, | |
779 | stmt, 0); | |
e645e942 | 780 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); |
b5aeb3bb | 781 | } |
6983e6b5 RB |
782 | /* Fatal mismatch. */ |
783 | matches[0] = false; | |
b5aeb3bb IR |
784 | return false; |
785 | } | |
786 | ||
e14c1050 | 787 | first_load = GROUP_FIRST_ELEMENT (vinfo_for_stmt (stmt)); |
b5aeb3bb IR |
788 | if (prev_first_load) |
789 | { | |
790 | /* Check that there are no loads from different interleaving | |
6983e6b5 RB |
791 | chains in the same node. */ |
792 | if (prev_first_load != first_load) | |
78c60e3d | 793 | { |
73fbfcad | 794 | if (dump_enabled_p ()) |
b5aeb3bb | 795 | { |
78c60e3d SS |
796 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, |
797 | vect_location, | |
798 | "Build SLP failed: different " | |
799 | "interleaving chains in one node "); | |
800 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, | |
801 | stmt, 0); | |
e645e942 | 802 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); |
b5aeb3bb | 803 | } |
6983e6b5 RB |
804 | /* Mismatch. */ |
805 | continue; | |
b5aeb3bb IR |
806 | } |
807 | } | |
808 | else | |
809 | prev_first_load = first_load; | |
ebfd146a | 810 | } |
0d0293ac | 811 | } /* Grouped access. */ |
ebfd146a IR |
812 | else |
813 | { | |
814 | if (TREE_CODE_CLASS (rhs_code) == tcc_reference) | |
815 | { | |
0d0293ac | 816 | /* Not grouped load. */ |
73fbfcad | 817 | if (dump_enabled_p ()) |
ebfd146a | 818 | { |
78c60e3d SS |
819 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
820 | "Build SLP failed: not grouped load "); | |
821 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, stmt, 0); | |
e645e942 | 822 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); |
ebfd146a IR |
823 | } |
824 | ||
0d0293ac | 825 | /* FORNOW: Not grouped loads are not supported. */ |
6983e6b5 RB |
826 | /* Fatal mismatch. */ |
827 | matches[0] = false; | |
ebfd146a IR |
828 | return false; |
829 | } | |
830 | ||
831 | /* Not memory operation. */ | |
832 | if (TREE_CODE_CLASS (rhs_code) != tcc_binary | |
f7e531cf | 833 | && TREE_CODE_CLASS (rhs_code) != tcc_unary |
effb52da | 834 | && TREE_CODE_CLASS (rhs_code) != tcc_expression |
190c2236 | 835 | && rhs_code != CALL_EXPR) |
ebfd146a | 836 | { |
73fbfcad | 837 | if (dump_enabled_p ()) |
ebfd146a | 838 | { |
78c60e3d SS |
839 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
840 | "Build SLP failed: operation"); | |
841 | dump_printf (MSG_MISSED_OPTIMIZATION, " unsupported "); | |
842 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, stmt, 0); | |
e645e942 | 843 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); |
ebfd146a | 844 | } |
6983e6b5 RB |
845 | /* Fatal mismatch. */ |
846 | matches[0] = false; | |
ebfd146a IR |
847 | return false; |
848 | } | |
849 | ||
f7e531cf IR |
850 | if (rhs_code == COND_EXPR) |
851 | { | |
852 | tree cond_expr = gimple_assign_rhs1 (stmt); | |
853 | ||
854 | if (i == 0) | |
855 | first_cond_code = TREE_CODE (cond_expr); | |
856 | else if (first_cond_code != TREE_CODE (cond_expr)) | |
857 | { | |
73fbfcad | 858 | if (dump_enabled_p ()) |
f7e531cf | 859 | { |
78c60e3d SS |
860 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
861 | "Build SLP failed: different" | |
862 | " operation"); | |
863 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, | |
864 | stmt, 0); | |
e645e942 | 865 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); |
f7e531cf | 866 | } |
6983e6b5 RB |
867 | /* Mismatch. */ |
868 | continue; | |
f7e531cf IR |
869 | } |
870 | } | |
ebfd146a | 871 | } |
6983e6b5 RB |
872 | |
873 | matches[i] = true; | |
874 | } | |
875 | ||
876 | for (i = 0; i < group_size; ++i) | |
877 | if (!matches[i]) | |
878 | return false; | |
879 | ||
6876e5bc RB |
880 | /* If we allowed a two-operation SLP node verify the target can cope |
881 | with the permute we are going to use. */ | |
882 | if (alt_stmt_code != ERROR_MARK | |
883 | && TREE_CODE_CLASS (alt_stmt_code) != tcc_reference) | |
884 | { | |
885 | unsigned char *sel | |
886 | = XALLOCAVEC (unsigned char, TYPE_VECTOR_SUBPARTS (vectype)); | |
887 | for (i = 0; i < TYPE_VECTOR_SUBPARTS (vectype); ++i) | |
888 | { | |
889 | sel[i] = i; | |
890 | if (gimple_assign_rhs_code (stmts[i % group_size]) == alt_stmt_code) | |
891 | sel[i] += TYPE_VECTOR_SUBPARTS (vectype); | |
892 | } | |
893 | if (!can_vec_perm_p (TYPE_MODE (vectype), false, sel)) | |
894 | { | |
895 | for (i = 0; i < group_size; ++i) | |
896 | if (gimple_assign_rhs_code (stmts[i]) == alt_stmt_code) | |
897 | { | |
898 | matches[i] = false; | |
899 | if (dump_enabled_p ()) | |
900 | { | |
901 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, | |
902 | "Build SLP failed: different operation " | |
903 | "in stmt "); | |
904 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, | |
905 | stmts[i], 0); | |
906 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, | |
907 | "original stmt "); | |
908 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, | |
909 | first_stmt, 0); | |
910 | } | |
911 | } | |
912 | return false; | |
913 | } | |
914 | *two_operators = true; | |
915 | } | |
916 | ||
6983e6b5 RB |
917 | return true; |
918 | } | |
919 | ||
920 | /* Recursively build an SLP tree starting from NODE. | |
921 | Fail (and return a value not equal to zero) if def-stmts are not | |
922 | isomorphic, require data permutation or are of unsupported types of | |
923 | operation. Otherwise, return 0. | |
924 | The value returned is the depth in the SLP tree where a mismatch | |
925 | was found. */ | |
926 | ||
927 | static bool | |
928 | vect_build_slp_tree (loop_vec_info loop_vinfo, bb_vec_info bb_vinfo, | |
929 | slp_tree *node, unsigned int group_size, | |
930 | unsigned int *max_nunits, | |
931 | vec<slp_tree> *loads, | |
932 | unsigned int vectorization_factor, | |
1428105c RB |
933 | bool *matches, unsigned *npermutes, unsigned *tree_size, |
934 | unsigned max_tree_size) | |
6983e6b5 | 935 | { |
89d390e5 | 936 | unsigned nops, i, this_tree_size = 0; |
6983e6b5 RB |
937 | gimple stmt; |
938 | ||
6983e6b5 RB |
939 | matches[0] = false; |
940 | ||
941 | stmt = SLP_TREE_SCALAR_STMTS (*node)[0]; | |
942 | if (is_gimple_call (stmt)) | |
943 | nops = gimple_call_num_args (stmt); | |
944 | else if (is_gimple_assign (stmt)) | |
945 | { | |
946 | nops = gimple_num_ops (stmt) - 1; | |
947 | if (gimple_assign_rhs_code (stmt) == COND_EXPR) | |
948 | nops++; | |
ebfd146a | 949 | } |
6983e6b5 RB |
950 | else |
951 | return false; | |
952 | ||
6876e5bc | 953 | bool two_operators = false; |
6983e6b5 RB |
954 | if (!vect_build_slp_tree_1 (loop_vinfo, bb_vinfo, |
955 | SLP_TREE_SCALAR_STMTS (*node), group_size, nops, | |
6876e5bc RB |
956 | max_nunits, vectorization_factor, matches, |
957 | &two_operators)) | |
6983e6b5 | 958 | return false; |
6876e5bc | 959 | SLP_TREE_TWO_OPERATORS (*node) = two_operators; |
ebfd146a | 960 | |
6983e6b5 RB |
961 | /* If the SLP node is a load, terminate the recursion. */ |
962 | if (STMT_VINFO_GROUPED_ACCESS (vinfo_for_stmt (stmt)) | |
963 | && DR_IS_READ (STMT_VINFO_DATA_REF (vinfo_for_stmt (stmt)))) | |
ebfd146a | 964 | { |
9771b263 | 965 | loads->safe_push (*node); |
ebfd146a IR |
966 | return true; |
967 | } | |
968 | ||
6983e6b5 RB |
969 | /* Get at the operands, verifying they are compatible. */ |
970 | vec<slp_oprnd_info> oprnds_info = vect_create_oprnd_info (nops, group_size); | |
971 | slp_oprnd_info oprnd_info; | |
972 | FOR_EACH_VEC_ELT (SLP_TREE_SCALAR_STMTS (*node), i, stmt) | |
973 | { | |
b0b4483e | 974 | switch (vect_get_and_check_slp_defs (loop_vinfo, bb_vinfo, |
effb52da | 975 | stmt, i, &oprnds_info)) |
6983e6b5 | 976 | { |
b0b4483e RB |
977 | case 0: |
978 | break; | |
979 | case -1: | |
980 | matches[0] = false; | |
6983e6b5 RB |
981 | vect_free_oprnd_info (oprnds_info); |
982 | return false; | |
b0b4483e RB |
983 | case 1: |
984 | matches[i] = false; | |
985 | break; | |
6983e6b5 RB |
986 | } |
987 | } | |
b0b4483e RB |
988 | for (i = 0; i < group_size; ++i) |
989 | if (!matches[i]) | |
990 | { | |
991 | vect_free_oprnd_info (oprnds_info); | |
992 | return false; | |
993 | } | |
6983e6b5 RB |
994 | |
995 | stmt = SLP_TREE_SCALAR_STMTS (*node)[0]; | |
996 | ||
b8698a0f | 997 | /* Create SLP_TREE nodes for the definition node/s. */ |
9771b263 | 998 | FOR_EACH_VEC_ELT (oprnds_info, i, oprnd_info) |
ebfd146a | 999 | { |
d092494c | 1000 | slp_tree child; |
6983e6b5 RB |
1001 | unsigned old_nloads = loads->length (); |
1002 | unsigned old_max_nunits = *max_nunits; | |
b8698a0f | 1003 | |
d092494c IR |
1004 | if (oprnd_info->first_dt != vect_internal_def) |
1005 | continue; | |
ebfd146a | 1006 | |
1428105c RB |
1007 | if (++this_tree_size > max_tree_size) |
1008 | { | |
1009 | vect_free_oprnd_info (oprnds_info); | |
1010 | return false; | |
1011 | } | |
1012 | ||
d092494c | 1013 | child = vect_create_new_slp_node (oprnd_info->def_stmts); |
6983e6b5 RB |
1014 | if (!child) |
1015 | { | |
9771b263 | 1016 | vect_free_oprnd_info (oprnds_info); |
6983e6b5 | 1017 | return false; |
d092494c | 1018 | } |
b8698a0f | 1019 | |
6983e6b5 RB |
1020 | if (vect_build_slp_tree (loop_vinfo, bb_vinfo, &child, |
1021 | group_size, max_nunits, loads, | |
1428105c RB |
1022 | vectorization_factor, matches, |
1023 | npermutes, &this_tree_size, max_tree_size)) | |
6983e6b5 | 1024 | { |
3fc356dc RB |
1025 | /* If we have all children of child built up from scalars then just |
1026 | throw that away and build it up this node from scalars. */ | |
1027 | if (!SLP_TREE_CHILDREN (child).is_empty ()) | |
1028 | { | |
1029 | unsigned int j; | |
1030 | slp_tree grandchild; | |
1031 | ||
1032 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (child), j, grandchild) | |
1033 | if (grandchild != NULL) | |
1034 | break; | |
1035 | if (!grandchild) | |
1036 | { | |
1037 | /* Roll back. */ | |
1038 | *max_nunits = old_max_nunits; | |
1039 | loads->truncate (old_nloads); | |
1040 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (child), j, grandchild) | |
1041 | vect_free_slp_tree (grandchild); | |
1042 | SLP_TREE_CHILDREN (child).truncate (0); | |
1043 | ||
1044 | dump_printf_loc (MSG_NOTE, vect_location, | |
1045 | "Building parent vector operands from " | |
1046 | "scalars instead\n"); | |
1047 | oprnd_info->def_stmts = vNULL; | |
1048 | vect_free_slp_tree (child); | |
1049 | SLP_TREE_CHILDREN (*node).quick_push (NULL); | |
1050 | continue; | |
1051 | } | |
1052 | } | |
1053 | ||
6983e6b5 RB |
1054 | oprnd_info->def_stmts = vNULL; |
1055 | SLP_TREE_CHILDREN (*node).quick_push (child); | |
1056 | continue; | |
1057 | } | |
1058 | ||
90dd6e3d RB |
1059 | /* If the SLP build failed fatally and we analyze a basic-block |
1060 | simply treat nodes we fail to build as externally defined | |
1061 | (and thus build vectors from the scalar defs). | |
1062 | The cost model will reject outright expensive cases. | |
1063 | ??? This doesn't treat cases where permutation ultimatively | |
1064 | fails (or we don't try permutation below). Ideally we'd | |
1065 | even compute a permutation that will end up with the maximum | |
1066 | SLP tree size... */ | |
1067 | if (bb_vinfo | |
1068 | && !matches[0] | |
1069 | /* ??? Rejecting patterns this way doesn't work. We'd have to | |
1070 | do extra work to cancel the pattern so the uses see the | |
1071 | scalar version. */ | |
1072 | && !is_pattern_stmt_p (vinfo_for_stmt (stmt))) | |
1073 | { | |
9626d143 RB |
1074 | unsigned int j; |
1075 | slp_tree grandchild; | |
1076 | ||
1077 | /* Roll back. */ | |
1078 | *max_nunits = old_max_nunits; | |
1079 | loads->truncate (old_nloads); | |
1080 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (child), j, grandchild) | |
1081 | vect_free_slp_tree (grandchild); | |
1082 | SLP_TREE_CHILDREN (child).truncate (0); | |
1083 | ||
90dd6e3d RB |
1084 | dump_printf_loc (MSG_NOTE, vect_location, |
1085 | "Building vector operands from scalars\n"); | |
1086 | oprnd_info->def_stmts = vNULL; | |
1087 | vect_free_slp_tree (child); | |
1088 | SLP_TREE_CHILDREN (*node).quick_push (NULL); | |
1089 | continue; | |
1090 | } | |
1091 | ||
6983e6b5 RB |
1092 | /* If the SLP build for operand zero failed and operand zero |
1093 | and one can be commutated try that for the scalar stmts | |
1094 | that failed the match. */ | |
1095 | if (i == 0 | |
1096 | /* A first scalar stmt mismatch signals a fatal mismatch. */ | |
1097 | && matches[0] | |
1098 | /* ??? For COND_EXPRs we can swap the comparison operands | |
1099 | as well as the arms under some constraints. */ | |
1100 | && nops == 2 | |
1101 | && oprnds_info[1]->first_dt == vect_internal_def | |
1102 | && is_gimple_assign (stmt) | |
1103 | && commutative_tree_code (gimple_assign_rhs_code (stmt)) | |
1ece8d4c | 1104 | && !SLP_TREE_TWO_OPERATORS (*node) |
6983e6b5 RB |
1105 | /* Do so only if the number of not successful permutes was nor more |
1106 | than a cut-ff as re-trying the recursive match on | |
1107 | possibly each level of the tree would expose exponential | |
1108 | behavior. */ | |
1109 | && *npermutes < 4) | |
1110 | { | |
e72baed7 JJ |
1111 | unsigned int j; |
1112 | slp_tree grandchild; | |
1113 | ||
6983e6b5 RB |
1114 | /* Roll back. */ |
1115 | *max_nunits = old_max_nunits; | |
1116 | loads->truncate (old_nloads); | |
e72baed7 JJ |
1117 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (child), j, grandchild) |
1118 | vect_free_slp_tree (grandchild); | |
1119 | SLP_TREE_CHILDREN (child).truncate (0); | |
1120 | ||
6983e6b5 | 1121 | /* Swap mismatched definition stmts. */ |
b0b4483e RB |
1122 | dump_printf_loc (MSG_NOTE, vect_location, |
1123 | "Re-trying with swapped operands of stmts "); | |
e72baed7 | 1124 | for (j = 0; j < group_size; ++j) |
6983e6b5 RB |
1125 | if (!matches[j]) |
1126 | { | |
6b4db501 MM |
1127 | std::swap (oprnds_info[0]->def_stmts[j], |
1128 | oprnds_info[1]->def_stmts[j]); | |
b0b4483e | 1129 | dump_printf (MSG_NOTE, "%d ", j); |
6983e6b5 | 1130 | } |
b0b4483e | 1131 | dump_printf (MSG_NOTE, "\n"); |
74574669 RB |
1132 | /* And try again with scratch 'matches' ... */ |
1133 | bool *tem = XALLOCAVEC (bool, group_size); | |
6983e6b5 RB |
1134 | if (vect_build_slp_tree (loop_vinfo, bb_vinfo, &child, |
1135 | group_size, max_nunits, loads, | |
1136 | vectorization_factor, | |
74574669 | 1137 | tem, npermutes, &this_tree_size, |
1428105c | 1138 | max_tree_size)) |
6983e6b5 | 1139 | { |
74574669 RB |
1140 | /* ... so if successful we can apply the operand swapping |
1141 | to the GIMPLE IL. This is necessary because for example | |
1142 | vect_get_slp_defs uses operand indexes and thus expects | |
1143 | canonical operand order. */ | |
1144 | for (j = 0; j < group_size; ++j) | |
1145 | if (!matches[j]) | |
1146 | { | |
1147 | gimple stmt = SLP_TREE_SCALAR_STMTS (*node)[j]; | |
1148 | swap_ssa_operands (stmt, gimple_assign_rhs1_ptr (stmt), | |
1149 | gimple_assign_rhs2_ptr (stmt)); | |
1150 | } | |
6983e6b5 RB |
1151 | oprnd_info->def_stmts = vNULL; |
1152 | SLP_TREE_CHILDREN (*node).quick_push (child); | |
1153 | continue; | |
1154 | } | |
1155 | ||
1156 | ++*npermutes; | |
1157 | } | |
1158 | ||
1159 | oprnd_info->def_stmts = vNULL; | |
1160 | vect_free_slp_tree (child); | |
1161 | vect_free_oprnd_info (oprnds_info); | |
1162 | return false; | |
ebfd146a IR |
1163 | } |
1164 | ||
1428105c RB |
1165 | if (tree_size) |
1166 | *tree_size += this_tree_size; | |
1167 | ||
9771b263 | 1168 | vect_free_oprnd_info (oprnds_info); |
ebfd146a IR |
1169 | return true; |
1170 | } | |
1171 | ||
78c60e3d | 1172 | /* Dump a slp tree NODE using flags specified in DUMP_KIND. */ |
ebfd146a IR |
1173 | |
1174 | static void | |
78c60e3d | 1175 | vect_print_slp_tree (int dump_kind, slp_tree node) |
ebfd146a IR |
1176 | { |
1177 | int i; | |
1178 | gimple stmt; | |
d755c7ef | 1179 | slp_tree child; |
ebfd146a IR |
1180 | |
1181 | if (!node) | |
1182 | return; | |
1183 | ||
78c60e3d | 1184 | dump_printf (dump_kind, "node "); |
9771b263 | 1185 | FOR_EACH_VEC_ELT (SLP_TREE_SCALAR_STMTS (node), i, stmt) |
ebfd146a | 1186 | { |
78c60e3d SS |
1187 | dump_printf (dump_kind, "\n\tstmt %d ", i); |
1188 | dump_gimple_stmt (dump_kind, TDF_SLIM, stmt, 0); | |
ebfd146a | 1189 | } |
78c60e3d | 1190 | dump_printf (dump_kind, "\n"); |
ebfd146a | 1191 | |
9771b263 | 1192 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (node), i, child) |
d755c7ef | 1193 | vect_print_slp_tree (dump_kind, child); |
ebfd146a IR |
1194 | } |
1195 | ||
1196 | ||
b8698a0f L |
1197 | /* Mark the tree rooted at NODE with MARK (PURE_SLP or HYBRID). |
1198 | If MARK is HYBRID, it refers to a specific stmt in NODE (the stmt at index | |
ff802fa1 | 1199 | J). Otherwise, MARK is PURE_SLP and J is -1, which indicates that all the |
ebfd146a IR |
1200 | stmts in NODE are to be marked. */ |
1201 | ||
1202 | static void | |
1203 | vect_mark_slp_stmts (slp_tree node, enum slp_vect_type mark, int j) | |
1204 | { | |
1205 | int i; | |
1206 | gimple stmt; | |
d755c7ef | 1207 | slp_tree child; |
ebfd146a IR |
1208 | |
1209 | if (!node) | |
1210 | return; | |
1211 | ||
9771b263 | 1212 | FOR_EACH_VEC_ELT (SLP_TREE_SCALAR_STMTS (node), i, stmt) |
ebfd146a IR |
1213 | if (j < 0 || i == j) |
1214 | STMT_SLP_TYPE (vinfo_for_stmt (stmt)) = mark; | |
1215 | ||
9771b263 | 1216 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (node), i, child) |
d755c7ef | 1217 | vect_mark_slp_stmts (child, mark, j); |
ebfd146a IR |
1218 | } |
1219 | ||
1220 | ||
a70d6342 IR |
1221 | /* Mark the statements of the tree rooted at NODE as relevant (vect_used). */ |
1222 | ||
1223 | static void | |
1224 | vect_mark_slp_stmts_relevant (slp_tree node) | |
1225 | { | |
1226 | int i; | |
1227 | gimple stmt; | |
1228 | stmt_vec_info stmt_info; | |
d755c7ef | 1229 | slp_tree child; |
a70d6342 IR |
1230 | |
1231 | if (!node) | |
1232 | return; | |
1233 | ||
9771b263 | 1234 | FOR_EACH_VEC_ELT (SLP_TREE_SCALAR_STMTS (node), i, stmt) |
a70d6342 IR |
1235 | { |
1236 | stmt_info = vinfo_for_stmt (stmt); | |
b8698a0f | 1237 | gcc_assert (!STMT_VINFO_RELEVANT (stmt_info) |
a70d6342 IR |
1238 | || STMT_VINFO_RELEVANT (stmt_info) == vect_used_in_scope); |
1239 | STMT_VINFO_RELEVANT (stmt_info) = vect_used_in_scope; | |
1240 | } | |
1241 | ||
9771b263 | 1242 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (node), i, child) |
d755c7ef | 1243 | vect_mark_slp_stmts_relevant (child); |
a70d6342 IR |
1244 | } |
1245 | ||
1246 | ||
b5aeb3bb IR |
1247 | /* Rearrange the statements of NODE according to PERMUTATION. */ |
1248 | ||
1249 | static void | |
1250 | vect_slp_rearrange_stmts (slp_tree node, unsigned int group_size, | |
01d8bf07 | 1251 | vec<unsigned> permutation) |
b5aeb3bb IR |
1252 | { |
1253 | gimple stmt; | |
9771b263 | 1254 | vec<gimple> tmp_stmts; |
d755c7ef RB |
1255 | unsigned int i; |
1256 | slp_tree child; | |
b5aeb3bb | 1257 | |
9771b263 | 1258 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (node), i, child) |
d755c7ef | 1259 | vect_slp_rearrange_stmts (child, group_size, permutation); |
b5aeb3bb | 1260 | |
9771b263 DN |
1261 | gcc_assert (group_size == SLP_TREE_SCALAR_STMTS (node).length ()); |
1262 | tmp_stmts.create (group_size); | |
d755c7ef | 1263 | tmp_stmts.quick_grow_cleared (group_size); |
b5aeb3bb | 1264 | |
9771b263 | 1265 | FOR_EACH_VEC_ELT (SLP_TREE_SCALAR_STMTS (node), i, stmt) |
d755c7ef | 1266 | tmp_stmts[permutation[i]] = stmt; |
b5aeb3bb | 1267 | |
9771b263 | 1268 | SLP_TREE_SCALAR_STMTS (node).release (); |
b5aeb3bb IR |
1269 | SLP_TREE_SCALAR_STMTS (node) = tmp_stmts; |
1270 | } | |
1271 | ||
1272 | ||
b266b968 RB |
1273 | /* Attempt to reorder stmts in a reduction chain so that we don't |
1274 | require any load permutation. Return true if that was possible, | |
1275 | otherwise return false. */ | |
1276 | ||
1277 | static bool | |
1278 | vect_attempt_slp_rearrange_stmts (slp_instance slp_instn) | |
1279 | { | |
1280 | unsigned int group_size = SLP_INSTANCE_GROUP_SIZE (slp_instn); | |
1281 | unsigned int i, j; | |
1282 | sbitmap load_index; | |
1283 | unsigned int lidx; | |
1284 | slp_tree node, load; | |
1285 | ||
1286 | /* Compare all the permutation sequences to the first one. We know | |
1287 | that at least one load is permuted. */ | |
1288 | node = SLP_INSTANCE_LOADS (slp_instn)[0]; | |
1289 | if (!node->load_permutation.exists ()) | |
1290 | return false; | |
1291 | for (i = 1; SLP_INSTANCE_LOADS (slp_instn).iterate (i, &load); ++i) | |
1292 | { | |
1293 | if (!load->load_permutation.exists ()) | |
1294 | return false; | |
1295 | FOR_EACH_VEC_ELT (load->load_permutation, j, lidx) | |
1296 | if (lidx != node->load_permutation[j]) | |
1297 | return false; | |
1298 | } | |
1299 | ||
1300 | /* Check that the loads in the first sequence are different and there | |
1301 | are no gaps between them. */ | |
1302 | load_index = sbitmap_alloc (group_size); | |
1303 | bitmap_clear (load_index); | |
1304 | FOR_EACH_VEC_ELT (node->load_permutation, i, lidx) | |
1305 | { | |
1306 | if (bitmap_bit_p (load_index, lidx)) | |
1307 | { | |
1308 | sbitmap_free (load_index); | |
1309 | return false; | |
1310 | } | |
1311 | bitmap_set_bit (load_index, lidx); | |
1312 | } | |
1313 | for (i = 0; i < group_size; i++) | |
1314 | if (!bitmap_bit_p (load_index, i)) | |
1315 | { | |
1316 | sbitmap_free (load_index); | |
1317 | return false; | |
1318 | } | |
1319 | sbitmap_free (load_index); | |
1320 | ||
1321 | /* This permutation is valid for reduction. Since the order of the | |
1322 | statements in the nodes is not important unless they are memory | |
1323 | accesses, we can rearrange the statements in all the nodes | |
1324 | according to the order of the loads. */ | |
1325 | vect_slp_rearrange_stmts (SLP_INSTANCE_TREE (slp_instn), group_size, | |
1326 | node->load_permutation); | |
1327 | ||
1328 | /* We are done, no actual permutations need to be generated. */ | |
1329 | FOR_EACH_VEC_ELT (SLP_INSTANCE_LOADS (slp_instn), i, node) | |
1330 | SLP_TREE_LOAD_PERMUTATION (node).release (); | |
1331 | return true; | |
1332 | } | |
1333 | ||
01d8bf07 RB |
1334 | /* Check if the required load permutations in the SLP instance |
1335 | SLP_INSTN are supported. */ | |
ebfd146a IR |
1336 | |
1337 | static bool | |
01d8bf07 | 1338 | vect_supported_load_permutation_p (slp_instance slp_instn) |
ebfd146a | 1339 | { |
01d8bf07 RB |
1340 | unsigned int group_size = SLP_INSTANCE_GROUP_SIZE (slp_instn); |
1341 | unsigned int i, j, k, next; | |
6983e6b5 RB |
1342 | slp_tree node; |
1343 | gimple stmt, load, next_load, first_load; | |
6aa904c4 | 1344 | struct data_reference *dr; |
ebfd146a | 1345 | |
73fbfcad | 1346 | if (dump_enabled_p ()) |
ebfd146a | 1347 | { |
78c60e3d | 1348 | dump_printf_loc (MSG_NOTE, vect_location, "Load permutation "); |
01d8bf07 RB |
1349 | FOR_EACH_VEC_ELT (SLP_INSTANCE_LOADS (slp_instn), i, node) |
1350 | if (node->load_permutation.exists ()) | |
1351 | FOR_EACH_VEC_ELT (node->load_permutation, j, next) | |
1352 | dump_printf (MSG_NOTE, "%d ", next); | |
1353 | else | |
bddc974e TJ |
1354 | for (k = 0; k < group_size; ++k) |
1355 | dump_printf (MSG_NOTE, "%d ", k); | |
e645e942 | 1356 | dump_printf (MSG_NOTE, "\n"); |
ebfd146a IR |
1357 | } |
1358 | ||
b5aeb3bb IR |
1359 | /* In case of reduction every load permutation is allowed, since the order |
1360 | of the reduction statements is not important (as opposed to the case of | |
0d0293ac | 1361 | grouped stores). The only condition we need to check is that all the |
b5aeb3bb IR |
1362 | load nodes are of the same size and have the same permutation (and then |
1363 | rearrange all the nodes of the SLP instance according to this | |
1364 | permutation). */ | |
1365 | ||
1366 | /* Check that all the load nodes are of the same size. */ | |
01d8bf07 | 1367 | /* ??? Can't we assert this? */ |
9771b263 | 1368 | FOR_EACH_VEC_ELT (SLP_INSTANCE_LOADS (slp_instn), i, node) |
6983e6b5 RB |
1369 | if (SLP_TREE_SCALAR_STMTS (node).length () != (unsigned) group_size) |
1370 | return false; | |
2200fc49 | 1371 | |
b5aeb3bb | 1372 | node = SLP_INSTANCE_TREE (slp_instn); |
9771b263 | 1373 | stmt = SLP_TREE_SCALAR_STMTS (node)[0]; |
b5aeb3bb | 1374 | |
b010117a | 1375 | /* Reduction (there are no data-refs in the root). |
b266b968 | 1376 | In reduction chain the order of the loads is not important. */ |
b010117a IR |
1377 | if (!STMT_VINFO_DATA_REF (vinfo_for_stmt (stmt)) |
1378 | && !GROUP_FIRST_ELEMENT (vinfo_for_stmt (stmt))) | |
b5aeb3bb | 1379 | { |
b266b968 RB |
1380 | if (vect_attempt_slp_rearrange_stmts (slp_instn)) |
1381 | return true; | |
b5aeb3bb | 1382 | |
b266b968 | 1383 | /* Fallthru to general load permutation handling. */ |
b5aeb3bb IR |
1384 | } |
1385 | ||
6aa904c4 IR |
1386 | /* In basic block vectorization we allow any subchain of an interleaving |
1387 | chain. | |
1388 | FORNOW: not supported in loop SLP because of realignment compications. */ | |
01d8bf07 | 1389 | if (STMT_VINFO_BB_VINFO (vinfo_for_stmt (stmt))) |
6aa904c4 | 1390 | { |
240a94da RB |
1391 | /* Check whether the loads in an instance form a subchain and thus |
1392 | no permutation is necessary. */ | |
9771b263 | 1393 | FOR_EACH_VEC_ELT (SLP_INSTANCE_LOADS (slp_instn), i, node) |
6aa904c4 | 1394 | { |
9626d143 RB |
1395 | if (!SLP_TREE_LOAD_PERMUTATION (node).exists ()) |
1396 | continue; | |
240a94da | 1397 | bool subchain_p = true; |
6aa904c4 | 1398 | next_load = NULL; |
9771b263 | 1399 | FOR_EACH_VEC_ELT (SLP_TREE_SCALAR_STMTS (node), j, load) |
6aa904c4 | 1400 | { |
5b5826c4 RB |
1401 | if (j != 0 |
1402 | && (next_load != load | |
1403 | || GROUP_GAP (vinfo_for_stmt (load)) != 1)) | |
240a94da RB |
1404 | { |
1405 | subchain_p = false; | |
1406 | break; | |
1407 | } | |
6aa904c4 IR |
1408 | next_load = GROUP_NEXT_ELEMENT (vinfo_for_stmt (load)); |
1409 | } | |
240a94da RB |
1410 | if (subchain_p) |
1411 | SLP_TREE_LOAD_PERMUTATION (node).release (); | |
1412 | else | |
1413 | { | |
1414 | /* Verify the permutation can be generated. */ | |
1415 | vec<tree> tem; | |
1416 | if (!vect_transform_slp_perm_load (node, tem, NULL, | |
1417 | 1, slp_instn, true)) | |
1418 | { | |
1419 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, | |
1420 | vect_location, | |
1421 | "unsupported load permutation\n"); | |
1422 | return false; | |
1423 | } | |
1424 | } | |
6aa904c4 IR |
1425 | } |
1426 | ||
1427 | /* Check that the alignment of the first load in every subchain, i.e., | |
01d8bf07 RB |
1428 | the first statement in every load node, is supported. |
1429 | ??? This belongs in alignment checking. */ | |
1430 | FOR_EACH_VEC_ELT (SLP_INSTANCE_LOADS (slp_instn), i, node) | |
1431 | { | |
1432 | first_load = SLP_TREE_SCALAR_STMTS (node)[0]; | |
1433 | if (first_load != GROUP_FIRST_ELEMENT (vinfo_for_stmt (first_load))) | |
1434 | { | |
1435 | dr = STMT_VINFO_DATA_REF (vinfo_for_stmt (first_load)); | |
1436 | if (vect_supportable_dr_alignment (dr, false) | |
1437 | == dr_unaligned_unsupported) | |
1438 | { | |
1439 | if (dump_enabled_p ()) | |
1440 | { | |
1441 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, | |
1442 | vect_location, | |
1443 | "unsupported unaligned load "); | |
1444 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, | |
1445 | first_load, 0); | |
e645e942 | 1446 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); |
01d8bf07 RB |
1447 | } |
1448 | return false; | |
1449 | } | |
1450 | } | |
1451 | } | |
6aa904c4 | 1452 | |
01d8bf07 | 1453 | return true; |
6aa904c4 IR |
1454 | } |
1455 | ||
9b999e8c | 1456 | /* For loop vectorization verify we can generate the permutation. */ |
01d8bf07 RB |
1457 | FOR_EACH_VEC_ELT (SLP_INSTANCE_LOADS (slp_instn), i, node) |
1458 | if (node->load_permutation.exists () | |
1459 | && !vect_transform_slp_perm_load | |
1460 | (node, vNULL, NULL, | |
1461 | SLP_INSTANCE_UNROLLING_FACTOR (slp_instn), slp_instn, true)) | |
1462 | return false; | |
9b999e8c | 1463 | |
01d8bf07 | 1464 | return true; |
ebfd146a IR |
1465 | } |
1466 | ||
1467 | ||
e4a707c4 | 1468 | /* Find the last store in SLP INSTANCE. */ |
ff802fa1 | 1469 | |
e4a707c4 | 1470 | static gimple |
2e8ab70c | 1471 | vect_find_last_scalar_stmt_in_slp (slp_tree node) |
e4a707c4 | 1472 | { |
2e8ab70c | 1473 | gimple last = NULL, stmt; |
e4a707c4 | 1474 | |
2e8ab70c RB |
1475 | for (int i = 0; SLP_TREE_SCALAR_STMTS (node).iterate (i, &stmt); i++) |
1476 | { | |
1477 | stmt_vec_info stmt_vinfo = vinfo_for_stmt (stmt); | |
1478 | if (is_pattern_stmt_p (stmt_vinfo)) | |
1479 | last = get_later_stmt (STMT_VINFO_RELATED_STMT (stmt_vinfo), last); | |
1480 | else | |
1481 | last = get_later_stmt (stmt, last); | |
1482 | } | |
e4a707c4 | 1483 | |
2e8ab70c | 1484 | return last; |
e4a707c4 IR |
1485 | } |
1486 | ||
23847df4 RB |
1487 | /* Compute the cost for the SLP node NODE in the SLP instance INSTANCE. */ |
1488 | ||
1489 | static void | |
1a4b99c1 | 1490 | vect_analyze_slp_cost_1 (slp_instance instance, slp_tree node, |
23847df4 | 1491 | stmt_vector_for_cost *prologue_cost_vec, |
1a4b99c1 | 1492 | stmt_vector_for_cost *body_cost_vec, |
23847df4 RB |
1493 | unsigned ncopies_for_cost) |
1494 | { | |
23847df4 RB |
1495 | unsigned i; |
1496 | slp_tree child; | |
1497 | gimple stmt, s; | |
1498 | stmt_vec_info stmt_info; | |
1499 | tree lhs; | |
1500 | unsigned group_size = SLP_INSTANCE_GROUP_SIZE (instance); | |
1501 | ||
1502 | /* Recurse down the SLP tree. */ | |
1503 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (node), i, child) | |
90dd6e3d | 1504 | if (child) |
1a4b99c1 RB |
1505 | vect_analyze_slp_cost_1 (instance, child, prologue_cost_vec, |
1506 | body_cost_vec, ncopies_for_cost); | |
23847df4 RB |
1507 | |
1508 | /* Look at the first scalar stmt to determine the cost. */ | |
1509 | stmt = SLP_TREE_SCALAR_STMTS (node)[0]; | |
1510 | stmt_info = vinfo_for_stmt (stmt); | |
1511 | if (STMT_VINFO_GROUPED_ACCESS (stmt_info)) | |
1512 | { | |
1513 | if (DR_IS_WRITE (STMT_VINFO_DATA_REF (stmt_info))) | |
1514 | vect_model_store_cost (stmt_info, ncopies_for_cost, false, | |
1515 | vect_uninitialized_def, | |
1516 | node, prologue_cost_vec, body_cost_vec); | |
1517 | else | |
1518 | { | |
1519 | int i; | |
1520 | gcc_checking_assert (DR_IS_READ (STMT_VINFO_DATA_REF (stmt_info))); | |
1521 | vect_model_load_cost (stmt_info, ncopies_for_cost, false, | |
1522 | node, prologue_cost_vec, body_cost_vec); | |
1523 | /* If the load is permuted record the cost for the permutation. | |
1524 | ??? Loads from multiple chains are let through here only | |
1525 | for a single special case involving complex numbers where | |
1526 | in the end no permutation is necessary. */ | |
1527 | FOR_EACH_VEC_ELT (SLP_TREE_SCALAR_STMTS (node), i, s) | |
1528 | if ((STMT_VINFO_GROUP_FIRST_ELEMENT (vinfo_for_stmt (s)) | |
1529 | == STMT_VINFO_GROUP_FIRST_ELEMENT (stmt_info)) | |
1530 | && vect_get_place_in_interleaving_chain | |
1531 | (s, STMT_VINFO_GROUP_FIRST_ELEMENT (stmt_info)) != i) | |
1532 | { | |
1533 | record_stmt_cost (body_cost_vec, group_size, vec_perm, | |
1534 | stmt_info, 0, vect_body); | |
1535 | break; | |
1536 | } | |
1537 | } | |
1538 | } | |
1539 | else | |
6876e5bc RB |
1540 | { |
1541 | record_stmt_cost (body_cost_vec, ncopies_for_cost, vector_stmt, | |
1542 | stmt_info, 0, vect_body); | |
1543 | if (SLP_TREE_TWO_OPERATORS (node)) | |
1544 | { | |
1545 | record_stmt_cost (body_cost_vec, ncopies_for_cost, vector_stmt, | |
1546 | stmt_info, 0, vect_body); | |
1547 | record_stmt_cost (body_cost_vec, ncopies_for_cost, vec_perm, | |
1548 | stmt_info, 0, vect_body); | |
1549 | } | |
1550 | } | |
23847df4 RB |
1551 | |
1552 | /* Scan operands and account for prologue cost of constants/externals. | |
1553 | ??? This over-estimates cost for multiple uses and should be | |
1554 | re-engineered. */ | |
1555 | lhs = gimple_get_lhs (stmt); | |
1556 | for (i = 0; i < gimple_num_ops (stmt); ++i) | |
1557 | { | |
1558 | tree def, op = gimple_op (stmt, i); | |
1559 | gimple def_stmt; | |
1560 | enum vect_def_type dt; | |
1561 | if (!op || op == lhs) | |
1562 | continue; | |
1a4b99c1 RB |
1563 | if (vect_is_simple_use (op, NULL, STMT_VINFO_LOOP_VINFO (stmt_info), |
1564 | STMT_VINFO_BB_VINFO (stmt_info), | |
2e8ab70c RB |
1565 | &def_stmt, &def, &dt)) |
1566 | { | |
1567 | /* Without looking at the actual initializer a vector of | |
1568 | constants can be implemented as load from the constant pool. | |
1569 | ??? We need to pass down stmt_info for a vector type | |
1570 | even if it points to the wrong stmt. */ | |
1571 | if (dt == vect_constant_def) | |
1572 | record_stmt_cost (prologue_cost_vec, 1, vector_load, | |
1573 | stmt_info, 0, vect_prologue); | |
1574 | else if (dt == vect_external_def) | |
1575 | record_stmt_cost (prologue_cost_vec, 1, vec_construct, | |
1576 | stmt_info, 0, vect_prologue); | |
1577 | } | |
23847df4 RB |
1578 | } |
1579 | } | |
1580 | ||
1581 | /* Compute the cost for the SLP instance INSTANCE. */ | |
1582 | ||
1583 | static void | |
1a4b99c1 | 1584 | vect_analyze_slp_cost (slp_instance instance, void *data) |
23847df4 RB |
1585 | { |
1586 | stmt_vector_for_cost body_cost_vec, prologue_cost_vec; | |
1587 | unsigned ncopies_for_cost; | |
1588 | stmt_info_for_cost *si; | |
1589 | unsigned i; | |
1590 | ||
1591 | /* Calculate the number of vector stmts to create based on the unrolling | |
1592 | factor (number of vectors is 1 if NUNITS >= GROUP_SIZE, and is | |
1593 | GROUP_SIZE / NUNITS otherwise. */ | |
1594 | unsigned group_size = SLP_INSTANCE_GROUP_SIZE (instance); | |
1a4b99c1 RB |
1595 | slp_tree node = SLP_INSTANCE_TREE (instance); |
1596 | stmt_vec_info stmt_info = vinfo_for_stmt (SLP_TREE_SCALAR_STMTS (node)[0]); | |
1597 | /* Adjust the group_size by the vectorization factor which is always one | |
1598 | for basic-block vectorization. */ | |
1599 | if (STMT_VINFO_LOOP_VINFO (stmt_info)) | |
1600 | group_size *= LOOP_VINFO_VECT_FACTOR (STMT_VINFO_LOOP_VINFO (stmt_info)); | |
1601 | unsigned nunits = TYPE_VECTOR_SUBPARTS (STMT_VINFO_VECTYPE (stmt_info)); | |
1602 | /* For reductions look at a reduction operand in case the reduction | |
1603 | operation is widening like DOT_PROD or SAD. */ | |
1604 | if (!STMT_VINFO_GROUPED_ACCESS (stmt_info)) | |
1605 | { | |
1606 | gimple stmt = SLP_TREE_SCALAR_STMTS (node)[0]; | |
1607 | switch (gimple_assign_rhs_code (stmt)) | |
1608 | { | |
1609 | case DOT_PROD_EXPR: | |
1610 | case SAD_EXPR: | |
1611 | nunits = TYPE_VECTOR_SUBPARTS (get_vectype_for_scalar_type | |
1612 | (TREE_TYPE (gimple_assign_rhs1 (stmt)))); | |
1613 | break; | |
1614 | default:; | |
1615 | } | |
1616 | } | |
23847df4 RB |
1617 | ncopies_for_cost = least_common_multiple (nunits, group_size) / nunits; |
1618 | ||
1619 | prologue_cost_vec.create (10); | |
1620 | body_cost_vec.create (10); | |
1a4b99c1 RB |
1621 | vect_analyze_slp_cost_1 (instance, SLP_INSTANCE_TREE (instance), |
1622 | &prologue_cost_vec, &body_cost_vec, | |
1623 | ncopies_for_cost); | |
23847df4 RB |
1624 | |
1625 | /* Record the prologue costs, which were delayed until we were | |
1a4b99c1 | 1626 | sure that SLP was successful. */ |
23847df4 RB |
1627 | FOR_EACH_VEC_ELT (prologue_cost_vec, i, si) |
1628 | { | |
1629 | struct _stmt_vec_info *stmt_info | |
1630 | = si->stmt ? vinfo_for_stmt (si->stmt) : NULL; | |
1631 | (void) add_stmt_cost (data, si->count, si->kind, stmt_info, | |
1632 | si->misalign, vect_prologue); | |
1633 | } | |
1634 | ||
1a4b99c1 RB |
1635 | /* Record the instance's instructions in the target cost model. */ |
1636 | FOR_EACH_VEC_ELT (body_cost_vec, i, si) | |
1637 | { | |
1638 | struct _stmt_vec_info *stmt_info | |
1639 | = si->stmt ? vinfo_for_stmt (si->stmt) : NULL; | |
1640 | (void) add_stmt_cost (data, si->count, si->kind, stmt_info, | |
1641 | si->misalign, vect_body); | |
1642 | } | |
1643 | ||
23847df4 | 1644 | prologue_cost_vec.release (); |
1a4b99c1 | 1645 | body_cost_vec.release (); |
23847df4 | 1646 | } |
e4a707c4 | 1647 | |
0d0293ac | 1648 | /* Analyze an SLP instance starting from a group of grouped stores. Call |
b8698a0f | 1649 | vect_build_slp_tree to build a tree of packed stmts if possible. |
ebfd146a IR |
1650 | Return FALSE if it's impossible to SLP any stmt in the loop. */ |
1651 | ||
1652 | static bool | |
a70d6342 | 1653 | vect_analyze_slp_instance (loop_vec_info loop_vinfo, bb_vec_info bb_vinfo, |
1428105c | 1654 | gimple stmt, unsigned max_tree_size) |
ebfd146a IR |
1655 | { |
1656 | slp_instance new_instance; | |
d092494c | 1657 | slp_tree node; |
e14c1050 | 1658 | unsigned int group_size = GROUP_SIZE (vinfo_for_stmt (stmt)); |
ebfd146a | 1659 | unsigned int unrolling_factor = 1, nunits; |
b5aeb3bb | 1660 | tree vectype, scalar_type = NULL_TREE; |
ebfd146a | 1661 | gimple next; |
0f900dfa | 1662 | unsigned int vectorization_factor = 0; |
23847df4 | 1663 | int i; |
ebfd146a | 1664 | unsigned int max_nunits = 0; |
9771b263 | 1665 | vec<slp_tree> loads; |
b5aeb3bb | 1666 | struct data_reference *dr = STMT_VINFO_DATA_REF (vinfo_for_stmt (stmt)); |
9771b263 | 1667 | vec<gimple> scalar_stmts; |
b5aeb3bb | 1668 | |
b010117a | 1669 | if (GROUP_FIRST_ELEMENT (vinfo_for_stmt (stmt))) |
b5aeb3bb | 1670 | { |
b010117a IR |
1671 | if (dr) |
1672 | { | |
1673 | scalar_type = TREE_TYPE (DR_REF (dr)); | |
1674 | vectype = get_vectype_for_scalar_type (scalar_type); | |
1675 | } | |
1676 | else | |
1677 | { | |
1678 | gcc_assert (loop_vinfo); | |
1679 | vectype = STMT_VINFO_VECTYPE (vinfo_for_stmt (stmt)); | |
1680 | } | |
1681 | ||
e14c1050 | 1682 | group_size = GROUP_SIZE (vinfo_for_stmt (stmt)); |
b5aeb3bb IR |
1683 | } |
1684 | else | |
1685 | { | |
1686 | gcc_assert (loop_vinfo); | |
1687 | vectype = STMT_VINFO_VECTYPE (vinfo_for_stmt (stmt)); | |
9771b263 | 1688 | group_size = LOOP_VINFO_REDUCTIONS (loop_vinfo).length (); |
b5aeb3bb | 1689 | } |
b8698a0f | 1690 | |
ebfd146a IR |
1691 | if (!vectype) |
1692 | { | |
73fbfcad | 1693 | if (dump_enabled_p ()) |
ebfd146a | 1694 | { |
78c60e3d SS |
1695 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
1696 | "Build SLP failed: unsupported data-type "); | |
1697 | dump_generic_expr (MSG_MISSED_OPTIMIZATION, TDF_SLIM, scalar_type); | |
e645e942 | 1698 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); |
ebfd146a | 1699 | } |
b5aeb3bb | 1700 | |
ebfd146a IR |
1701 | return false; |
1702 | } | |
1703 | ||
1704 | nunits = TYPE_VECTOR_SUBPARTS (vectype); | |
a70d6342 IR |
1705 | if (loop_vinfo) |
1706 | vectorization_factor = LOOP_VINFO_VECT_FACTOR (loop_vinfo); | |
1707 | else | |
a70d6342 IR |
1708 | vectorization_factor = nunits; |
1709 | ||
a70d6342 IR |
1710 | /* Calculate the unrolling factor. */ |
1711 | unrolling_factor = least_common_multiple (nunits, group_size) / group_size; | |
1712 | if (unrolling_factor != 1 && !loop_vinfo) | |
1713 | { | |
73fbfcad | 1714 | if (dump_enabled_p ()) |
e645e942 | 1715 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
78c60e3d | 1716 | "Build SLP failed: unrolling required in basic" |
e645e942 | 1717 | " block SLP\n"); |
b8698a0f | 1718 | |
a70d6342 IR |
1719 | return false; |
1720 | } | |
1721 | ||
0d0293ac | 1722 | /* Create a node (a root of the SLP tree) for the packed grouped stores. */ |
9771b263 | 1723 | scalar_stmts.create (group_size); |
ebfd146a | 1724 | next = stmt; |
b010117a | 1725 | if (GROUP_FIRST_ELEMENT (vinfo_for_stmt (stmt))) |
ebfd146a | 1726 | { |
b5aeb3bb IR |
1727 | /* Collect the stores and store them in SLP_TREE_SCALAR_STMTS. */ |
1728 | while (next) | |
1729 | { | |
f7e531cf IR |
1730 | if (STMT_VINFO_IN_PATTERN_P (vinfo_for_stmt (next)) |
1731 | && STMT_VINFO_RELATED_STMT (vinfo_for_stmt (next))) | |
9771b263 DN |
1732 | scalar_stmts.safe_push ( |
1733 | STMT_VINFO_RELATED_STMT (vinfo_for_stmt (next))); | |
f7e531cf | 1734 | else |
9771b263 | 1735 | scalar_stmts.safe_push (next); |
e14c1050 | 1736 | next = GROUP_NEXT_ELEMENT (vinfo_for_stmt (next)); |
b5aeb3bb | 1737 | } |
14a61437 RB |
1738 | /* Mark the first element of the reduction chain as reduction to properly |
1739 | transform the node. In the reduction analysis phase only the last | |
1740 | element of the chain is marked as reduction. */ | |
1741 | if (!STMT_VINFO_GROUPED_ACCESS (vinfo_for_stmt (stmt))) | |
1742 | STMT_VINFO_DEF_TYPE (vinfo_for_stmt (stmt)) = vect_reduction_def; | |
b5aeb3bb IR |
1743 | } |
1744 | else | |
1745 | { | |
1746 | /* Collect reduction statements. */ | |
9771b263 DN |
1747 | vec<gimple> reductions = LOOP_VINFO_REDUCTIONS (loop_vinfo); |
1748 | for (i = 0; reductions.iterate (i, &next); i++) | |
1749 | scalar_stmts.safe_push (next); | |
ebfd146a IR |
1750 | } |
1751 | ||
d092494c | 1752 | node = vect_create_new_slp_node (scalar_stmts); |
ebfd146a | 1753 | |
9771b263 | 1754 | loads.create (group_size); |
ebfd146a IR |
1755 | |
1756 | /* Build the tree for the SLP instance. */ | |
89d390e5 RB |
1757 | bool *matches = XALLOCAVEC (bool, group_size); |
1758 | unsigned npermutes = 0; | |
b8698a0f | 1759 | if (vect_build_slp_tree (loop_vinfo, bb_vinfo, &node, group_size, |
abf9bfbc | 1760 | &max_nunits, &loads, |
89d390e5 | 1761 | vectorization_factor, matches, &npermutes, NULL, |
1428105c | 1762 | max_tree_size)) |
ebfd146a | 1763 | { |
4ef69dfc | 1764 | /* Calculate the unrolling factor based on the smallest type. */ |
ebfd146a IR |
1765 | if (max_nunits > nunits) |
1766 | unrolling_factor = least_common_multiple (max_nunits, group_size) | |
1767 | / group_size; | |
b8698a0f | 1768 | |
4ef69dfc IR |
1769 | if (unrolling_factor != 1 && !loop_vinfo) |
1770 | { | |
73fbfcad | 1771 | if (dump_enabled_p ()) |
e645e942 | 1772 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
78c60e3d | 1773 | "Build SLP failed: unrolling required in basic" |
e645e942 | 1774 | " block SLP\n"); |
c7e62a26 | 1775 | vect_free_slp_tree (node); |
9771b263 | 1776 | loads.release (); |
4ef69dfc IR |
1777 | return false; |
1778 | } | |
1779 | ||
1780 | /* Create a new SLP instance. */ | |
1781 | new_instance = XNEW (struct _slp_instance); | |
1782 | SLP_INSTANCE_TREE (new_instance) = node; | |
1783 | SLP_INSTANCE_GROUP_SIZE (new_instance) = group_size; | |
ebfd146a | 1784 | SLP_INSTANCE_UNROLLING_FACTOR (new_instance) = unrolling_factor; |
ebfd146a | 1785 | SLP_INSTANCE_LOADS (new_instance) = loads; |
abf9bfbc RB |
1786 | |
1787 | /* Compute the load permutation. */ | |
1788 | slp_tree load_node; | |
1789 | bool loads_permuted = false; | |
abf9bfbc RB |
1790 | FOR_EACH_VEC_ELT (loads, i, load_node) |
1791 | { | |
01d8bf07 | 1792 | vec<unsigned> load_permutation; |
abf9bfbc | 1793 | int j; |
6983e6b5 | 1794 | gimple load, first_stmt; |
01d8bf07 RB |
1795 | bool this_load_permuted = false; |
1796 | load_permutation.create (group_size); | |
6983e6b5 RB |
1797 | first_stmt = GROUP_FIRST_ELEMENT |
1798 | (vinfo_for_stmt (SLP_TREE_SCALAR_STMTS (load_node)[0])); | |
abf9bfbc RB |
1799 | FOR_EACH_VEC_ELT (SLP_TREE_SCALAR_STMTS (load_node), j, load) |
1800 | { | |
6983e6b5 RB |
1801 | int load_place |
1802 | = vect_get_place_in_interleaving_chain (load, first_stmt); | |
1803 | gcc_assert (load_place != -1); | |
1804 | if (load_place != j) | |
01d8bf07 | 1805 | this_load_permuted = true; |
abf9bfbc RB |
1806 | load_permutation.safe_push (load_place); |
1807 | } | |
fe2bef71 RB |
1808 | if (!this_load_permuted |
1809 | /* The load requires permutation when unrolling exposes | |
1810 | a gap either because the group is larger than the SLP | |
1811 | group-size or because there is a gap between the groups. */ | |
1812 | && (unrolling_factor == 1 | |
1813 | || (group_size == GROUP_SIZE (vinfo_for_stmt (first_stmt)) | |
1814 | && GROUP_GAP (vinfo_for_stmt (first_stmt)) == 0))) | |
01d8bf07 RB |
1815 | { |
1816 | load_permutation.release (); | |
1817 | continue; | |
1818 | } | |
1819 | SLP_TREE_LOAD_PERMUTATION (load_node) = load_permutation; | |
1820 | loads_permuted = true; | |
abf9bfbc | 1821 | } |
6aa904c4 IR |
1822 | |
1823 | if (loads_permuted) | |
ebfd146a | 1824 | { |
01d8bf07 | 1825 | if (!vect_supported_load_permutation_p (new_instance)) |
ebfd146a | 1826 | { |
73fbfcad | 1827 | if (dump_enabled_p ()) |
ebfd146a | 1828 | { |
e645e942 | 1829 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
78c60e3d SS |
1830 | "Build SLP failed: unsupported load " |
1831 | "permutation "); | |
1832 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, stmt, 0); | |
e645e942 | 1833 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); |
ebfd146a | 1834 | } |
ebfd146a IR |
1835 | vect_free_slp_instance (new_instance); |
1836 | return false; | |
1837 | } | |
ebfd146a | 1838 | } |
ebfd146a | 1839 | |
92345349 | 1840 | |
a70d6342 | 1841 | if (loop_vinfo) |
1a4b99c1 | 1842 | LOOP_VINFO_SLP_INSTANCES (loop_vinfo).safe_push (new_instance); |
a70d6342 | 1843 | else |
9771b263 | 1844 | BB_VINFO_SLP_INSTANCES (bb_vinfo).safe_push (new_instance); |
b8698a0f | 1845 | |
73fbfcad | 1846 | if (dump_enabled_p ()) |
78c60e3d | 1847 | vect_print_slp_tree (MSG_NOTE, node); |
ebfd146a IR |
1848 | |
1849 | return true; | |
1850 | } | |
1851 | ||
1852 | /* Failed to SLP. */ | |
1853 | /* Free the allocated memory. */ | |
1854 | vect_free_slp_tree (node); | |
9771b263 | 1855 | loads.release (); |
b8698a0f | 1856 | |
a70d6342 | 1857 | return false; |
ebfd146a IR |
1858 | } |
1859 | ||
1860 | ||
ff802fa1 | 1861 | /* Check if there are stmts in the loop can be vectorized using SLP. Build SLP |
ebfd146a IR |
1862 | trees of packed scalar stmts if SLP is possible. */ |
1863 | ||
1864 | bool | |
1428105c RB |
1865 | vect_analyze_slp (loop_vec_info loop_vinfo, bb_vec_info bb_vinfo, |
1866 | unsigned max_tree_size) | |
ebfd146a IR |
1867 | { |
1868 | unsigned int i; | |
9771b263 | 1869 | vec<gimple> grouped_stores; |
6e1aa848 DN |
1870 | vec<gimple> reductions = vNULL; |
1871 | vec<gimple> reduc_chains = vNULL; | |
b010117a | 1872 | gimple first_element; |
a70d6342 | 1873 | bool ok = false; |
ebfd146a | 1874 | |
73fbfcad | 1875 | if (dump_enabled_p ()) |
e645e942 | 1876 | dump_printf_loc (MSG_NOTE, vect_location, "=== vect_analyze_slp ===\n"); |
ebfd146a | 1877 | |
a70d6342 | 1878 | if (loop_vinfo) |
b5aeb3bb | 1879 | { |
0d0293ac | 1880 | grouped_stores = LOOP_VINFO_GROUPED_STORES (loop_vinfo); |
b010117a | 1881 | reduc_chains = LOOP_VINFO_REDUCTION_CHAINS (loop_vinfo); |
b5aeb3bb IR |
1882 | reductions = LOOP_VINFO_REDUCTIONS (loop_vinfo); |
1883 | } | |
a70d6342 | 1884 | else |
0d0293ac | 1885 | grouped_stores = BB_VINFO_GROUPED_STORES (bb_vinfo); |
b8698a0f | 1886 | |
0d0293ac | 1887 | /* Find SLP sequences starting from groups of grouped stores. */ |
9771b263 | 1888 | FOR_EACH_VEC_ELT (grouped_stores, i, first_element) |
1428105c RB |
1889 | if (vect_analyze_slp_instance (loop_vinfo, bb_vinfo, first_element, |
1890 | max_tree_size)) | |
a70d6342 | 1891 | ok = true; |
ebfd146a | 1892 | |
effb52da | 1893 | if (reduc_chains.length () > 0) |
b010117a IR |
1894 | { |
1895 | /* Find SLP sequences starting from reduction chains. */ | |
9771b263 | 1896 | FOR_EACH_VEC_ELT (reduc_chains, i, first_element) |
1428105c RB |
1897 | if (vect_analyze_slp_instance (loop_vinfo, bb_vinfo, first_element, |
1898 | max_tree_size)) | |
b010117a IR |
1899 | ok = true; |
1900 | else | |
1901 | return false; | |
1902 | ||
1903 | /* Don't try to vectorize SLP reductions if reduction chain was | |
1904 | detected. */ | |
1905 | return ok; | |
1906 | } | |
1907 | ||
b5aeb3bb | 1908 | /* Find SLP sequences starting from groups of reductions. */ |
effb52da | 1909 | if (reductions.length () > 1 |
1428105c RB |
1910 | && vect_analyze_slp_instance (loop_vinfo, bb_vinfo, reductions[0], |
1911 | max_tree_size)) | |
b5aeb3bb IR |
1912 | ok = true; |
1913 | ||
ebfd146a IR |
1914 | return true; |
1915 | } | |
1916 | ||
1917 | ||
1918 | /* For each possible SLP instance decide whether to SLP it and calculate overall | |
437f4a00 IR |
1919 | unrolling factor needed to SLP the loop. Return TRUE if decided to SLP at |
1920 | least one instance. */ | |
ebfd146a | 1921 | |
437f4a00 | 1922 | bool |
ebfd146a IR |
1923 | vect_make_slp_decision (loop_vec_info loop_vinfo) |
1924 | { | |
1925 | unsigned int i, unrolling_factor = 1; | |
9771b263 | 1926 | vec<slp_instance> slp_instances = LOOP_VINFO_SLP_INSTANCES (loop_vinfo); |
ebfd146a IR |
1927 | slp_instance instance; |
1928 | int decided_to_slp = 0; | |
1929 | ||
73fbfcad | 1930 | if (dump_enabled_p ()) |
e645e942 TJ |
1931 | dump_printf_loc (MSG_NOTE, vect_location, "=== vect_make_slp_decision ===" |
1932 | "\n"); | |
ebfd146a | 1933 | |
9771b263 | 1934 | FOR_EACH_VEC_ELT (slp_instances, i, instance) |
ebfd146a IR |
1935 | { |
1936 | /* FORNOW: SLP if you can. */ | |
1937 | if (unrolling_factor < SLP_INSTANCE_UNROLLING_FACTOR (instance)) | |
1938 | unrolling_factor = SLP_INSTANCE_UNROLLING_FACTOR (instance); | |
1939 | ||
ff802fa1 | 1940 | /* Mark all the stmts that belong to INSTANCE as PURE_SLP stmts. Later we |
b8698a0f | 1941 | call vect_detect_hybrid_slp () to find stmts that need hybrid SLP and |
ff802fa1 | 1942 | loop-based vectorization. Such stmts will be marked as HYBRID. */ |
ebfd146a IR |
1943 | vect_mark_slp_stmts (SLP_INSTANCE_TREE (instance), pure_slp, -1); |
1944 | decided_to_slp++; | |
1945 | } | |
1946 | ||
1947 | LOOP_VINFO_SLP_UNROLLING_FACTOR (loop_vinfo) = unrolling_factor; | |
1948 | ||
73fbfcad | 1949 | if (decided_to_slp && dump_enabled_p ()) |
ccb3ad87 | 1950 | dump_printf_loc (MSG_NOTE, vect_location, |
e645e942 | 1951 | "Decided to SLP %d instances. Unrolling factor %d\n", |
78c60e3d | 1952 | decided_to_slp, unrolling_factor); |
437f4a00 IR |
1953 | |
1954 | return (decided_to_slp > 0); | |
ebfd146a IR |
1955 | } |
1956 | ||
1957 | ||
1958 | /* Find stmts that must be both vectorized and SLPed (since they feed stmts that | |
ff802fa1 | 1959 | can't be SLPed) in the tree rooted at NODE. Mark such stmts as HYBRID. */ |
ebfd146a IR |
1960 | |
1961 | static void | |
642fce57 | 1962 | vect_detect_hybrid_slp_stmts (slp_tree node, unsigned i, slp_vect_type stype) |
ebfd146a | 1963 | { |
642fce57 | 1964 | gimple stmt = SLP_TREE_SCALAR_STMTS (node)[i]; |
ebfd146a IR |
1965 | imm_use_iterator imm_iter; |
1966 | gimple use_stmt; | |
642fce57 | 1967 | stmt_vec_info use_vinfo, stmt_vinfo = vinfo_for_stmt (stmt); |
d755c7ef | 1968 | slp_tree child; |
f2c74cc4 | 1969 | loop_vec_info loop_vinfo = STMT_VINFO_LOOP_VINFO (stmt_vinfo); |
642fce57 RB |
1970 | struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo); |
1971 | int j; | |
1972 | ||
1973 | /* Propagate hybrid down the SLP tree. */ | |
1974 | if (stype == hybrid) | |
1975 | ; | |
1976 | else if (HYBRID_SLP_STMT (stmt_vinfo)) | |
1977 | stype = hybrid; | |
1978 | else | |
1979 | { | |
1980 | /* Check if a pure SLP stmt has uses in non-SLP stmts. */ | |
1981 | gcc_checking_assert (PURE_SLP_STMT (stmt_vinfo)); | |
29764870 RB |
1982 | /* We always get the pattern stmt here, but for immediate |
1983 | uses we have to use the LHS of the original stmt. */ | |
1984 | gcc_checking_assert (!STMT_VINFO_IN_PATTERN_P (stmt_vinfo)); | |
1985 | if (STMT_VINFO_RELATED_STMT (stmt_vinfo)) | |
1986 | stmt = STMT_VINFO_RELATED_STMT (stmt_vinfo); | |
642fce57 RB |
1987 | if (TREE_CODE (gimple_op (stmt, 0)) == SSA_NAME) |
1988 | FOR_EACH_IMM_USE_STMT (use_stmt, imm_iter, gimple_op (stmt, 0)) | |
29764870 RB |
1989 | { |
1990 | if (!flow_bb_inside_loop_p (loop, gimple_bb (use_stmt))) | |
1991 | continue; | |
1992 | use_vinfo = vinfo_for_stmt (use_stmt); | |
1993 | if (STMT_VINFO_IN_PATTERN_P (use_vinfo) | |
1994 | && STMT_VINFO_RELATED_STMT (use_vinfo)) | |
1995 | use_vinfo = vinfo_for_stmt (STMT_VINFO_RELATED_STMT (use_vinfo)); | |
1996 | if (!STMT_SLP_TYPE (use_vinfo) | |
1997 | && (STMT_VINFO_RELEVANT (use_vinfo) | |
1998 | || VECTORIZABLE_CYCLE_DEF (STMT_VINFO_DEF_TYPE (use_vinfo))) | |
1999 | && !(gimple_code (use_stmt) == GIMPLE_PHI | |
2000 | && STMT_VINFO_DEF_TYPE (use_vinfo) == vect_reduction_def)) | |
502f0263 RB |
2001 | { |
2002 | if (dump_enabled_p ()) | |
2003 | { | |
2004 | dump_printf_loc (MSG_NOTE, vect_location, "use of SLP " | |
2005 | "def in non-SLP stmt: "); | |
2006 | dump_gimple_stmt (MSG_NOTE, TDF_SLIM, use_stmt, 0); | |
2007 | } | |
2008 | stype = hybrid; | |
2009 | } | |
29764870 | 2010 | } |
642fce57 | 2011 | } |
ebfd146a | 2012 | |
502f0263 RB |
2013 | if (stype == hybrid |
2014 | && !HYBRID_SLP_STMT (stmt_vinfo)) | |
b1af7da6 RB |
2015 | { |
2016 | if (dump_enabled_p ()) | |
2017 | { | |
2018 | dump_printf_loc (MSG_NOTE, vect_location, "marking hybrid: "); | |
2019 | dump_gimple_stmt (MSG_NOTE, TDF_SLIM, stmt, 0); | |
2020 | } | |
2021 | STMT_SLP_TYPE (stmt_vinfo) = hybrid; | |
2022 | } | |
ebfd146a | 2023 | |
642fce57 | 2024 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (node), j, child) |
90dd6e3d RB |
2025 | if (child) |
2026 | vect_detect_hybrid_slp_stmts (child, i, stype); | |
642fce57 | 2027 | } |
f2c74cc4 | 2028 | |
642fce57 | 2029 | /* Helpers for vect_detect_hybrid_slp walking pattern stmt uses. */ |
ebfd146a | 2030 | |
642fce57 RB |
2031 | static tree |
2032 | vect_detect_hybrid_slp_1 (tree *tp, int *, void *data) | |
2033 | { | |
2034 | walk_stmt_info *wi = (walk_stmt_info *)data; | |
2035 | struct loop *loopp = (struct loop *)wi->info; | |
2036 | ||
2037 | if (wi->is_lhs) | |
2038 | return NULL_TREE; | |
2039 | ||
2040 | if (TREE_CODE (*tp) == SSA_NAME | |
2041 | && !SSA_NAME_IS_DEFAULT_DEF (*tp)) | |
2042 | { | |
2043 | gimple def_stmt = SSA_NAME_DEF_STMT (*tp); | |
2044 | if (flow_bb_inside_loop_p (loopp, gimple_bb (def_stmt)) | |
2045 | && PURE_SLP_STMT (vinfo_for_stmt (def_stmt))) | |
b1af7da6 RB |
2046 | { |
2047 | if (dump_enabled_p ()) | |
2048 | { | |
2049 | dump_printf_loc (MSG_NOTE, vect_location, "marking hybrid: "); | |
2050 | dump_gimple_stmt (MSG_NOTE, TDF_SLIM, def_stmt, 0); | |
2051 | } | |
2052 | STMT_SLP_TYPE (vinfo_for_stmt (def_stmt)) = hybrid; | |
2053 | } | |
642fce57 RB |
2054 | } |
2055 | ||
2056 | return NULL_TREE; | |
ebfd146a IR |
2057 | } |
2058 | ||
642fce57 RB |
2059 | static tree |
2060 | vect_detect_hybrid_slp_2 (gimple_stmt_iterator *gsi, bool *handled, | |
2061 | walk_stmt_info *) | |
2062 | { | |
2063 | /* If the stmt is in a SLP instance then this isn't a reason | |
2064 | to mark use definitions in other SLP instances as hybrid. */ | |
2065 | if (STMT_SLP_TYPE (vinfo_for_stmt (gsi_stmt (*gsi))) != loop_vect) | |
2066 | *handled = true; | |
2067 | return NULL_TREE; | |
2068 | } | |
ebfd146a IR |
2069 | |
2070 | /* Find stmts that must be both vectorized and SLPed. */ | |
2071 | ||
2072 | void | |
2073 | vect_detect_hybrid_slp (loop_vec_info loop_vinfo) | |
2074 | { | |
2075 | unsigned int i; | |
9771b263 | 2076 | vec<slp_instance> slp_instances = LOOP_VINFO_SLP_INSTANCES (loop_vinfo); |
ebfd146a IR |
2077 | slp_instance instance; |
2078 | ||
73fbfcad | 2079 | if (dump_enabled_p ()) |
e645e942 TJ |
2080 | dump_printf_loc (MSG_NOTE, vect_location, "=== vect_detect_hybrid_slp ===" |
2081 | "\n"); | |
ebfd146a | 2082 | |
642fce57 RB |
2083 | /* First walk all pattern stmt in the loop and mark defs of uses as |
2084 | hybrid because immediate uses in them are not recorded. */ | |
2085 | for (i = 0; i < LOOP_VINFO_LOOP (loop_vinfo)->num_nodes; ++i) | |
2086 | { | |
2087 | basic_block bb = LOOP_VINFO_BBS (loop_vinfo)[i]; | |
2088 | for (gimple_stmt_iterator gsi = gsi_start_bb (bb); !gsi_end_p (gsi); | |
2089 | gsi_next (&gsi)) | |
2090 | { | |
2091 | gimple stmt = gsi_stmt (gsi); | |
2092 | stmt_vec_info stmt_info = vinfo_for_stmt (stmt); | |
2093 | if (STMT_VINFO_IN_PATTERN_P (stmt_info)) | |
2094 | { | |
2095 | walk_stmt_info wi; | |
2096 | memset (&wi, 0, sizeof (wi)); | |
2097 | wi.info = LOOP_VINFO_LOOP (loop_vinfo); | |
2098 | gimple_stmt_iterator gsi2 | |
2099 | = gsi_for_stmt (STMT_VINFO_RELATED_STMT (stmt_info)); | |
2100 | walk_gimple_stmt (&gsi2, vect_detect_hybrid_slp_2, | |
2101 | vect_detect_hybrid_slp_1, &wi); | |
2102 | walk_gimple_seq (STMT_VINFO_PATTERN_DEF_SEQ (stmt_info), | |
2103 | vect_detect_hybrid_slp_2, | |
2104 | vect_detect_hybrid_slp_1, &wi); | |
2105 | } | |
2106 | } | |
2107 | } | |
2108 | ||
2109 | /* Then walk the SLP instance trees marking stmts with uses in | |
2110 | non-SLP stmts as hybrid, also propagating hybrid down the | |
2111 | SLP tree, collecting the above info on-the-fly. */ | |
9771b263 | 2112 | FOR_EACH_VEC_ELT (slp_instances, i, instance) |
642fce57 RB |
2113 | { |
2114 | for (unsigned i = 0; i < SLP_INSTANCE_GROUP_SIZE (instance); ++i) | |
2115 | vect_detect_hybrid_slp_stmts (SLP_INSTANCE_TREE (instance), | |
2116 | i, pure_slp); | |
2117 | } | |
ebfd146a IR |
2118 | } |
2119 | ||
a70d6342 IR |
2120 | |
2121 | /* Create and initialize a new bb_vec_info struct for BB, as well as | |
2122 | stmt_vec_info structs for all the stmts in it. */ | |
b8698a0f | 2123 | |
a70d6342 IR |
2124 | static bb_vec_info |
2125 | new_bb_vec_info (basic_block bb) | |
2126 | { | |
2127 | bb_vec_info res = NULL; | |
2128 | gimple_stmt_iterator gsi; | |
2129 | ||
2130 | res = (bb_vec_info) xcalloc (1, sizeof (struct _bb_vec_info)); | |
2131 | BB_VINFO_BB (res) = bb; | |
2132 | ||
2133 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
2134 | { | |
2135 | gimple stmt = gsi_stmt (gsi); | |
2136 | gimple_set_uid (stmt, 0); | |
2137 | set_vinfo_for_stmt (stmt, new_stmt_vec_info (stmt, NULL, res)); | |
2138 | } | |
2139 | ||
9771b263 DN |
2140 | BB_VINFO_GROUPED_STORES (res).create (10); |
2141 | BB_VINFO_SLP_INSTANCES (res).create (2); | |
c3e7ee41 | 2142 | BB_VINFO_TARGET_COST_DATA (res) = init_cost (NULL); |
a70d6342 IR |
2143 | |
2144 | bb->aux = res; | |
2145 | return res; | |
2146 | } | |
2147 | ||
2148 | ||
2149 | /* Free BB_VINFO struct, as well as all the stmt_vec_info structs of all the | |
2150 | stmts in the basic block. */ | |
2151 | ||
2152 | static void | |
2153 | destroy_bb_vec_info (bb_vec_info bb_vinfo) | |
2154 | { | |
9771b263 | 2155 | vec<slp_instance> slp_instances; |
c7e62a26 | 2156 | slp_instance instance; |
a70d6342 IR |
2157 | basic_block bb; |
2158 | gimple_stmt_iterator si; | |
c7e62a26 | 2159 | unsigned i; |
a70d6342 IR |
2160 | |
2161 | if (!bb_vinfo) | |
2162 | return; | |
2163 | ||
2164 | bb = BB_VINFO_BB (bb_vinfo); | |
2165 | ||
2166 | for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si)) | |
2167 | { | |
2168 | gimple stmt = gsi_stmt (si); | |
2169 | stmt_vec_info stmt_info = vinfo_for_stmt (stmt); | |
2170 | ||
2171 | if (stmt_info) | |
2172 | /* Free stmt_vec_info. */ | |
2173 | free_stmt_vec_info (stmt); | |
2174 | } | |
2175 | ||
c716e67f | 2176 | vect_destroy_datarefs (NULL, bb_vinfo); |
01be8516 | 2177 | free_dependence_relations (BB_VINFO_DDRS (bb_vinfo)); |
9771b263 | 2178 | BB_VINFO_GROUPED_STORES (bb_vinfo).release (); |
c7e62a26 | 2179 | slp_instances = BB_VINFO_SLP_INSTANCES (bb_vinfo); |
9771b263 | 2180 | FOR_EACH_VEC_ELT (slp_instances, i, instance) |
c7e62a26 | 2181 | vect_free_slp_instance (instance); |
9771b263 | 2182 | BB_VINFO_SLP_INSTANCES (bb_vinfo).release (); |
c3e7ee41 | 2183 | destroy_cost_data (BB_VINFO_TARGET_COST_DATA (bb_vinfo)); |
a70d6342 IR |
2184 | free (bb_vinfo); |
2185 | bb->aux = NULL; | |
2186 | } | |
2187 | ||
2188 | ||
2189 | /* Analyze statements contained in SLP tree node after recursively analyzing | |
2190 | the subtree. Return TRUE if the operations are supported. */ | |
2191 | ||
2192 | static bool | |
a12e42fc | 2193 | vect_slp_analyze_node_operations (slp_tree node) |
a70d6342 IR |
2194 | { |
2195 | bool dummy; | |
2196 | int i; | |
2197 | gimple stmt; | |
d755c7ef | 2198 | slp_tree child; |
a70d6342 IR |
2199 | |
2200 | if (!node) | |
2201 | return true; | |
2202 | ||
9771b263 | 2203 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (node), i, child) |
a12e42fc | 2204 | if (!vect_slp_analyze_node_operations (child)) |
d092494c | 2205 | return false; |
a70d6342 | 2206 | |
9771b263 | 2207 | FOR_EACH_VEC_ELT (SLP_TREE_SCALAR_STMTS (node), i, stmt) |
a70d6342 IR |
2208 | { |
2209 | stmt_vec_info stmt_info = vinfo_for_stmt (stmt); | |
2210 | gcc_assert (stmt_info); | |
a12e42fc | 2211 | gcc_assert (STMT_SLP_TYPE (stmt_info) != loop_vect); |
a70d6342 IR |
2212 | |
2213 | if (!vect_analyze_stmt (stmt, &dummy, node)) | |
a12e42fc | 2214 | return false; |
a70d6342 IR |
2215 | } |
2216 | ||
2217 | return true; | |
2218 | } | |
2219 | ||
2220 | ||
ff802fa1 | 2221 | /* Analyze statements in SLP instances of the basic block. Return TRUE if the |
a70d6342 IR |
2222 | operations are supported. */ |
2223 | ||
a12e42fc | 2224 | bool |
1a4b99c1 | 2225 | vect_slp_analyze_operations (vec<slp_instance> slp_instances, void *data) |
a70d6342 | 2226 | { |
a70d6342 IR |
2227 | slp_instance instance; |
2228 | int i; | |
2229 | ||
a12e42fc RB |
2230 | if (dump_enabled_p ()) |
2231 | dump_printf_loc (MSG_NOTE, vect_location, | |
2232 | "=== vect_slp_analyze_operations ===\n"); | |
2233 | ||
9771b263 | 2234 | for (i = 0; slp_instances.iterate (i, &instance); ) |
a70d6342 | 2235 | { |
a12e42fc | 2236 | if (!vect_slp_analyze_node_operations (SLP_INSTANCE_TREE (instance))) |
a70d6342 | 2237 | { |
a12e42fc RB |
2238 | dump_printf_loc (MSG_NOTE, vect_location, |
2239 | "removing SLP instance operations starting from: "); | |
2240 | dump_gimple_stmt (MSG_NOTE, TDF_SLIM, | |
2241 | SLP_TREE_SCALAR_STMTS | |
2242 | (SLP_INSTANCE_TREE (instance))[0], 0); | |
2243 | vect_free_slp_instance (instance); | |
9771b263 | 2244 | slp_instances.ordered_remove (i); |
a70d6342 IR |
2245 | } |
2246 | else | |
1a4b99c1 RB |
2247 | { |
2248 | /* Compute the costs of the SLP instance. */ | |
2249 | vect_analyze_slp_cost (instance, data); | |
2250 | i++; | |
2251 | } | |
b8698a0f L |
2252 | } |
2253 | ||
9771b263 | 2254 | if (!slp_instances.length ()) |
a70d6342 IR |
2255 | return false; |
2256 | ||
2257 | return true; | |
2258 | } | |
2259 | ||
6eddf228 RB |
2260 | |
2261 | /* Compute the scalar cost of the SLP node NODE and its children | |
2262 | and return it. Do not account defs that are marked in LIFE and | |
2263 | update LIFE according to uses of NODE. */ | |
2264 | ||
2265 | static unsigned | |
292cba13 | 2266 | vect_bb_slp_scalar_cost (basic_block bb, |
ff4c81cc | 2267 | slp_tree node, vec<bool, va_heap> *life) |
6eddf228 RB |
2268 | { |
2269 | unsigned scalar_cost = 0; | |
2270 | unsigned i; | |
2271 | gimple stmt; | |
2272 | slp_tree child; | |
2273 | ||
2274 | FOR_EACH_VEC_ELT (SLP_TREE_SCALAR_STMTS (node), i, stmt) | |
2275 | { | |
2276 | unsigned stmt_cost; | |
2277 | ssa_op_iter op_iter; | |
2278 | def_operand_p def_p; | |
2279 | stmt_vec_info stmt_info; | |
2280 | ||
ff4c81cc | 2281 | if ((*life)[i]) |
6eddf228 RB |
2282 | continue; |
2283 | ||
2284 | /* If there is a non-vectorized use of the defs then the scalar | |
2285 | stmt is kept live in which case we do not account it or any | |
2286 | required defs in the SLP children in the scalar cost. This | |
2287 | way we make the vectorization more costly when compared to | |
2288 | the scalar cost. */ | |
2289 | FOR_EACH_SSA_DEF_OPERAND (def_p, stmt, op_iter, SSA_OP_DEF) | |
2290 | { | |
2291 | imm_use_iterator use_iter; | |
2292 | gimple use_stmt; | |
2293 | FOR_EACH_IMM_USE_STMT (use_stmt, use_iter, DEF_FROM_PTR (def_p)) | |
f30a0ba5 RB |
2294 | if (!is_gimple_debug (use_stmt) |
2295 | && (gimple_code (use_stmt) == GIMPLE_PHI | |
2296 | || gimple_bb (use_stmt) != bb | |
2297 | || !STMT_VINFO_VECTORIZABLE (vinfo_for_stmt (use_stmt)))) | |
6eddf228 | 2298 | { |
ff4c81cc | 2299 | (*life)[i] = true; |
6eddf228 RB |
2300 | BREAK_FROM_IMM_USE_STMT (use_iter); |
2301 | } | |
2302 | } | |
ff4c81cc | 2303 | if ((*life)[i]) |
6eddf228 RB |
2304 | continue; |
2305 | ||
2306 | stmt_info = vinfo_for_stmt (stmt); | |
2307 | if (STMT_VINFO_DATA_REF (stmt_info)) | |
2308 | { | |
2309 | if (DR_IS_READ (STMT_VINFO_DATA_REF (stmt_info))) | |
2310 | stmt_cost = vect_get_stmt_cost (scalar_load); | |
2311 | else | |
2312 | stmt_cost = vect_get_stmt_cost (scalar_store); | |
2313 | } | |
2314 | else | |
2315 | stmt_cost = vect_get_stmt_cost (scalar_stmt); | |
2316 | ||
2317 | scalar_cost += stmt_cost; | |
2318 | } | |
2319 | ||
2320 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (node), i, child) | |
90dd6e3d RB |
2321 | if (child) |
2322 | scalar_cost += vect_bb_slp_scalar_cost (bb, child, life); | |
6eddf228 RB |
2323 | |
2324 | return scalar_cost; | |
2325 | } | |
2326 | ||
69f11a13 IR |
2327 | /* Check if vectorization of the basic block is profitable. */ |
2328 | ||
2329 | static bool | |
2330 | vect_bb_vectorization_profitable_p (bb_vec_info bb_vinfo) | |
2331 | { | |
9771b263 | 2332 | vec<slp_instance> slp_instances = BB_VINFO_SLP_INSTANCES (bb_vinfo); |
69f11a13 | 2333 | slp_instance instance; |
1a4b99c1 | 2334 | int i; |
c3e7ee41 | 2335 | unsigned int vec_inside_cost = 0, vec_outside_cost = 0, scalar_cost = 0; |
92345349 | 2336 | unsigned int vec_prologue_cost = 0, vec_epilogue_cost = 0; |
69f11a13 IR |
2337 | |
2338 | /* Calculate scalar cost. */ | |
6eddf228 | 2339 | FOR_EACH_VEC_ELT (slp_instances, i, instance) |
69f11a13 | 2340 | { |
00f96dc9 | 2341 | auto_vec<bool, 20> life; |
ff4c81cc | 2342 | life.safe_grow_cleared (SLP_INSTANCE_GROUP_SIZE (instance)); |
292cba13 RB |
2343 | scalar_cost += vect_bb_slp_scalar_cost (BB_VINFO_BB (bb_vinfo), |
2344 | SLP_INSTANCE_TREE (instance), | |
ff4c81cc | 2345 | &life); |
69f11a13 IR |
2346 | } |
2347 | ||
c3e7ee41 | 2348 | /* Complete the target-specific cost calculation. */ |
92345349 BS |
2349 | finish_cost (BB_VINFO_TARGET_COST_DATA (bb_vinfo), &vec_prologue_cost, |
2350 | &vec_inside_cost, &vec_epilogue_cost); | |
2351 | ||
2352 | vec_outside_cost = vec_prologue_cost + vec_epilogue_cost; | |
c3e7ee41 | 2353 | |
73fbfcad | 2354 | if (dump_enabled_p ()) |
69f11a13 | 2355 | { |
78c60e3d SS |
2356 | dump_printf_loc (MSG_NOTE, vect_location, "Cost model analysis: \n"); |
2357 | dump_printf (MSG_NOTE, " Vector inside of basic block cost: %d\n", | |
2358 | vec_inside_cost); | |
2359 | dump_printf (MSG_NOTE, " Vector prologue cost: %d\n", vec_prologue_cost); | |
2360 | dump_printf (MSG_NOTE, " Vector epilogue cost: %d\n", vec_epilogue_cost); | |
e645e942 | 2361 | dump_printf (MSG_NOTE, " Scalar cost of basic block: %d\n", scalar_cost); |
69f11a13 IR |
2362 | } |
2363 | ||
2364 | /* Vectorization is profitable if its cost is less than the cost of scalar | |
2365 | version. */ | |
2366 | if (vec_outside_cost + vec_inside_cost >= scalar_cost) | |
2367 | return false; | |
2368 | ||
2369 | return true; | |
2370 | } | |
2371 | ||
2372 | /* Check if the basic block can be vectorized. */ | |
a70d6342 | 2373 | |
8e19f5a1 IR |
2374 | static bb_vec_info |
2375 | vect_slp_analyze_bb_1 (basic_block bb) | |
a70d6342 IR |
2376 | { |
2377 | bb_vec_info bb_vinfo; | |
9771b263 | 2378 | vec<slp_instance> slp_instances; |
a70d6342 | 2379 | slp_instance instance; |
8e19f5a1 | 2380 | int i; |
777e1f09 | 2381 | int min_vf = 2; |
1428105c | 2382 | unsigned n_stmts = 0; |
e4a707c4 | 2383 | |
a70d6342 IR |
2384 | bb_vinfo = new_bb_vec_info (bb); |
2385 | if (!bb_vinfo) | |
2386 | return NULL; | |
2387 | ||
1428105c | 2388 | if (!vect_analyze_data_refs (NULL, bb_vinfo, &min_vf, &n_stmts)) |
a70d6342 | 2389 | { |
73fbfcad | 2390 | if (dump_enabled_p ()) |
78c60e3d SS |
2391 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
2392 | "not vectorized: unhandled data-ref in basic " | |
2393 | "block.\n"); | |
b8698a0f | 2394 | |
a70d6342 IR |
2395 | destroy_bb_vec_info (bb_vinfo); |
2396 | return NULL; | |
2397 | } | |
2398 | ||
fcac74a1 | 2399 | if (BB_VINFO_DATAREFS (bb_vinfo).length () < 2) |
a70d6342 | 2400 | { |
73fbfcad | 2401 | if (dump_enabled_p ()) |
78c60e3d SS |
2402 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
2403 | "not vectorized: not enough data-refs in " | |
2404 | "basic block.\n"); | |
a70d6342 IR |
2405 | |
2406 | destroy_bb_vec_info (bb_vinfo); | |
2407 | return NULL; | |
2408 | } | |
2409 | ||
5abe1e05 RB |
2410 | if (!vect_analyze_data_ref_accesses (NULL, bb_vinfo)) |
2411 | { | |
2412 | if (dump_enabled_p ()) | |
2413 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, | |
2414 | "not vectorized: unhandled data access in " | |
2415 | "basic block.\n"); | |
2416 | ||
2417 | destroy_bb_vec_info (bb_vinfo); | |
2418 | return NULL; | |
2419 | } | |
2420 | ||
f5709183 IR |
2421 | vect_pattern_recog (NULL, bb_vinfo); |
2422 | ||
a70d6342 IR |
2423 | if (!vect_analyze_data_refs_alignment (NULL, bb_vinfo)) |
2424 | { | |
73fbfcad | 2425 | if (dump_enabled_p ()) |
78c60e3d SS |
2426 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
2427 | "not vectorized: bad data alignment in basic " | |
2428 | "block.\n"); | |
b8698a0f | 2429 | |
a70d6342 IR |
2430 | destroy_bb_vec_info (bb_vinfo); |
2431 | return NULL; | |
2432 | } | |
b8698a0f | 2433 | |
a70d6342 IR |
2434 | /* Check the SLP opportunities in the basic block, analyze and build SLP |
2435 | trees. */ | |
1428105c | 2436 | if (!vect_analyze_slp (NULL, bb_vinfo, n_stmts)) |
a70d6342 | 2437 | { |
73fbfcad | 2438 | if (dump_enabled_p ()) |
effb52da RB |
2439 | { |
2440 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, | |
2441 | "Failed to SLP the basic block.\n"); | |
2442 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, | |
2443 | "not vectorized: failed to find SLP opportunities " | |
2444 | "in basic block.\n"); | |
2445 | } | |
a70d6342 IR |
2446 | |
2447 | destroy_bb_vec_info (bb_vinfo); | |
2448 | return NULL; | |
2449 | } | |
b8698a0f | 2450 | |
a70d6342 IR |
2451 | slp_instances = BB_VINFO_SLP_INSTANCES (bb_vinfo); |
2452 | ||
2453 | /* Mark all the statements that we want to vectorize as pure SLP and | |
2454 | relevant. */ | |
9771b263 | 2455 | FOR_EACH_VEC_ELT (slp_instances, i, instance) |
a70d6342 IR |
2456 | { |
2457 | vect_mark_slp_stmts (SLP_INSTANCE_TREE (instance), pure_slp, -1); | |
2458 | vect_mark_slp_stmts_relevant (SLP_INSTANCE_TREE (instance)); | |
b8698a0f | 2459 | } |
a70d6342 | 2460 | |
5e6667b2 RB |
2461 | /* Mark all the statements that we do not want to vectorize. */ |
2462 | for (gimple_stmt_iterator gsi = gsi_start_bb (BB_VINFO_BB (bb_vinfo)); | |
2463 | !gsi_end_p (gsi); gsi_next (&gsi)) | |
2464 | { | |
2465 | stmt_vec_info vinfo = vinfo_for_stmt (gsi_stmt (gsi)); | |
2466 | if (STMT_SLP_TYPE (vinfo) != pure_slp) | |
2467 | STMT_VINFO_VECTORIZABLE (vinfo) = false; | |
2468 | } | |
2469 | ||
2470 | /* Analyze dependences. At this point all stmts not participating in | |
2471 | vectorization have to be marked. Dependence analysis assumes | |
2472 | that we either vectorize all SLP instances or none at all. */ | |
2473 | if (!vect_slp_analyze_data_ref_dependences (bb_vinfo)) | |
2474 | { | |
2475 | if (dump_enabled_p ()) | |
2476 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, | |
2477 | "not vectorized: unhandled data dependence " | |
2478 | "in basic block.\n"); | |
2479 | ||
2480 | destroy_bb_vec_info (bb_vinfo); | |
2481 | return NULL; | |
2482 | } | |
2483 | ||
c3e7ee41 | 2484 | if (!vect_verify_datarefs_alignment (NULL, bb_vinfo)) |
38eec4c6 | 2485 | { |
73fbfcad | 2486 | if (dump_enabled_p ()) |
78c60e3d SS |
2487 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
2488 | "not vectorized: unsupported alignment in basic " | |
2489 | "block.\n"); | |
38eec4c6 UW |
2490 | destroy_bb_vec_info (bb_vinfo); |
2491 | return NULL; | |
2492 | } | |
2493 | ||
1a4b99c1 RB |
2494 | if (!vect_slp_analyze_operations (BB_VINFO_SLP_INSTANCES (bb_vinfo), |
2495 | BB_VINFO_TARGET_COST_DATA (bb_vinfo))) | |
a70d6342 | 2496 | { |
73fbfcad | 2497 | if (dump_enabled_p ()) |
e645e942 | 2498 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
78c60e3d | 2499 | "not vectorized: bad operation in basic block.\n"); |
a70d6342 IR |
2500 | |
2501 | destroy_bb_vec_info (bb_vinfo); | |
2502 | return NULL; | |
2503 | } | |
2504 | ||
69f11a13 | 2505 | /* Cost model: check if the vectorization is worthwhile. */ |
8b5e1202 | 2506 | if (!unlimited_cost_model (NULL) |
69f11a13 IR |
2507 | && !vect_bb_vectorization_profitable_p (bb_vinfo)) |
2508 | { | |
73fbfcad | 2509 | if (dump_enabled_p ()) |
78c60e3d SS |
2510 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
2511 | "not vectorized: vectorization is not " | |
2512 | "profitable.\n"); | |
69f11a13 IR |
2513 | |
2514 | destroy_bb_vec_info (bb_vinfo); | |
2515 | return NULL; | |
2516 | } | |
2517 | ||
73fbfcad | 2518 | if (dump_enabled_p ()) |
78c60e3d SS |
2519 | dump_printf_loc (MSG_NOTE, vect_location, |
2520 | "Basic block will be vectorized using SLP\n"); | |
a70d6342 IR |
2521 | |
2522 | return bb_vinfo; | |
2523 | } | |
2524 | ||
2525 | ||
8e19f5a1 IR |
2526 | bb_vec_info |
2527 | vect_slp_analyze_bb (basic_block bb) | |
2528 | { | |
2529 | bb_vec_info bb_vinfo; | |
2530 | int insns = 0; | |
2531 | gimple_stmt_iterator gsi; | |
2532 | unsigned int vector_sizes; | |
2533 | ||
73fbfcad | 2534 | if (dump_enabled_p ()) |
78c60e3d | 2535 | dump_printf_loc (MSG_NOTE, vect_location, "===vect_slp_analyze_bb===\n"); |
8e19f5a1 IR |
2536 | |
2537 | for (gsi = gsi_start_bb (bb); !gsi_end_p (gsi); gsi_next (&gsi)) | |
2538 | { | |
2539 | gimple stmt = gsi_stmt (gsi); | |
2540 | if (!is_gimple_debug (stmt) | |
2541 | && !gimple_nop_p (stmt) | |
2542 | && gimple_code (stmt) != GIMPLE_LABEL) | |
2543 | insns++; | |
2544 | } | |
2545 | ||
2546 | if (insns > PARAM_VALUE (PARAM_SLP_MAX_INSNS_IN_BB)) | |
2547 | { | |
73fbfcad | 2548 | if (dump_enabled_p ()) |
78c60e3d SS |
2549 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
2550 | "not vectorized: too many instructions in " | |
2551 | "basic block.\n"); | |
8e19f5a1 IR |
2552 | |
2553 | return NULL; | |
2554 | } | |
2555 | ||
2556 | /* Autodetect first vector size we try. */ | |
2557 | current_vector_size = 0; | |
2558 | vector_sizes = targetm.vectorize.autovectorize_vector_sizes (); | |
2559 | ||
2560 | while (1) | |
2561 | { | |
2562 | bb_vinfo = vect_slp_analyze_bb_1 (bb); | |
2563 | if (bb_vinfo) | |
2564 | return bb_vinfo; | |
2565 | ||
2566 | destroy_bb_vec_info (bb_vinfo); | |
2567 | ||
2568 | vector_sizes &= ~current_vector_size; | |
2569 | if (vector_sizes == 0 | |
2570 | || current_vector_size == 0) | |
2571 | return NULL; | |
2572 | ||
2573 | /* Try the next biggest vector size. */ | |
2574 | current_vector_size = 1 << floor_log2 (vector_sizes); | |
73fbfcad | 2575 | if (dump_enabled_p ()) |
78c60e3d SS |
2576 | dump_printf_loc (MSG_NOTE, vect_location, |
2577 | "***** Re-trying analysis with " | |
2578 | "vector size %d\n", current_vector_size); | |
8e19f5a1 IR |
2579 | } |
2580 | } | |
2581 | ||
2582 | ||
b8698a0f L |
2583 | /* For constant and loop invariant defs of SLP_NODE this function returns |
2584 | (vector) defs (VEC_OPRNDS) that will be used in the vectorized stmts. | |
d59dc888 IR |
2585 | OP_NUM determines if we gather defs for operand 0 or operand 1 of the RHS of |
2586 | scalar stmts. NUMBER_OF_VECTORS is the number of vector defs to create. | |
b5aeb3bb IR |
2587 | REDUC_INDEX is the index of the reduction operand in the statements, unless |
2588 | it is -1. */ | |
ebfd146a IR |
2589 | |
2590 | static void | |
9dc3f7de | 2591 | vect_get_constant_vectors (tree op, slp_tree slp_node, |
9771b263 | 2592 | vec<tree> *vec_oprnds, |
b5aeb3bb IR |
2593 | unsigned int op_num, unsigned int number_of_vectors, |
2594 | int reduc_index) | |
ebfd146a | 2595 | { |
9771b263 DN |
2596 | vec<gimple> stmts = SLP_TREE_SCALAR_STMTS (slp_node); |
2597 | gimple stmt = stmts[0]; | |
ebfd146a | 2598 | stmt_vec_info stmt_vinfo = vinfo_for_stmt (stmt); |
d2a12ae7 | 2599 | unsigned nunits; |
ebfd146a | 2600 | tree vec_cst; |
d2a12ae7 RG |
2601 | tree *elts; |
2602 | unsigned j, number_of_places_left_in_vector; | |
ebfd146a | 2603 | tree vector_type; |
9dc3f7de | 2604 | tree vop; |
9771b263 | 2605 | int group_size = stmts.length (); |
ebfd146a | 2606 | unsigned int vec_num, i; |
d2a12ae7 | 2607 | unsigned number_of_copies = 1; |
9771b263 DN |
2608 | vec<tree> voprnds; |
2609 | voprnds.create (number_of_vectors); | |
ebfd146a | 2610 | bool constant_p, is_store; |
b5aeb3bb | 2611 | tree neutral_op = NULL; |
bac430c9 | 2612 | enum tree_code code = gimple_expr_code (stmt); |
0e93a64e IR |
2613 | gimple def_stmt; |
2614 | struct loop *loop; | |
13396b6e | 2615 | gimple_seq ctor_seq = NULL; |
b5aeb3bb | 2616 | |
afbe6325 RB |
2617 | vector_type = get_vectype_for_scalar_type (TREE_TYPE (op)); |
2618 | nunits = TYPE_VECTOR_SUBPARTS (vector_type); | |
2619 | ||
29ed4920 IR |
2620 | if (STMT_VINFO_DEF_TYPE (stmt_vinfo) == vect_reduction_def |
2621 | && reduc_index != -1) | |
b5aeb3bb | 2622 | { |
afbe6325 RB |
2623 | op_num = reduc_index; |
2624 | op = gimple_op (stmt, op_num + 1); | |
b5aeb3bb | 2625 | /* For additional copies (see the explanation of NUMBER_OF_COPIES below) |
ff802fa1 | 2626 | we need either neutral operands or the original operands. See |
b5aeb3bb IR |
2627 | get_initial_def_for_reduction() for details. */ |
2628 | switch (code) | |
2629 | { | |
2630 | case WIDEN_SUM_EXPR: | |
2631 | case DOT_PROD_EXPR: | |
afbe6325 | 2632 | case SAD_EXPR: |
b5aeb3bb IR |
2633 | case PLUS_EXPR: |
2634 | case MINUS_EXPR: | |
2635 | case BIT_IOR_EXPR: | |
2636 | case BIT_XOR_EXPR: | |
2637 | if (SCALAR_FLOAT_TYPE_P (TREE_TYPE (op))) | |
2638 | neutral_op = build_real (TREE_TYPE (op), dconst0); | |
2639 | else | |
2640 | neutral_op = build_int_cst (TREE_TYPE (op), 0); | |
2641 | ||
2642 | break; | |
2643 | ||
2644 | case MULT_EXPR: | |
b5aeb3bb IR |
2645 | if (SCALAR_FLOAT_TYPE_P (TREE_TYPE (op))) |
2646 | neutral_op = build_real (TREE_TYPE (op), dconst1); | |
2647 | else | |
2648 | neutral_op = build_int_cst (TREE_TYPE (op), 1); | |
2649 | ||
2650 | break; | |
2651 | ||
c1e822d5 IR |
2652 | case BIT_AND_EXPR: |
2653 | neutral_op = build_int_cst (TREE_TYPE (op), -1); | |
2654 | break; | |
2655 | ||
f1485e5b RB |
2656 | /* For MIN/MAX we don't have an easy neutral operand but |
2657 | the initial values can be used fine here. Only for | |
2658 | a reduction chain we have to force a neutral element. */ | |
2659 | case MAX_EXPR: | |
2660 | case MIN_EXPR: | |
2661 | if (!GROUP_FIRST_ELEMENT (stmt_vinfo)) | |
2662 | neutral_op = NULL; | |
2663 | else | |
2664 | { | |
2665 | def_stmt = SSA_NAME_DEF_STMT (op); | |
2666 | loop = (gimple_bb (stmt))->loop_father; | |
2667 | neutral_op = PHI_ARG_DEF_FROM_EDGE (def_stmt, | |
2668 | loop_preheader_edge (loop)); | |
2669 | } | |
2670 | break; | |
0e93a64e | 2671 | |
b5aeb3bb | 2672 | default: |
afbe6325 | 2673 | gcc_assert (!GROUP_FIRST_ELEMENT (stmt_vinfo)); |
0e93a64e | 2674 | neutral_op = NULL; |
b5aeb3bb IR |
2675 | } |
2676 | } | |
ebfd146a IR |
2677 | |
2678 | if (STMT_VINFO_DATA_REF (stmt_vinfo)) | |
2679 | { | |
2680 | is_store = true; | |
2681 | op = gimple_assign_rhs1 (stmt); | |
2682 | } | |
2683 | else | |
9dc3f7de IR |
2684 | is_store = false; |
2685 | ||
2686 | gcc_assert (op); | |
ebfd146a IR |
2687 | |
2688 | if (CONSTANT_CLASS_P (op)) | |
d59dc888 | 2689 | constant_p = true; |
ebfd146a | 2690 | else |
d59dc888 IR |
2691 | constant_p = false; |
2692 | ||
ebfd146a | 2693 | /* NUMBER_OF_COPIES is the number of times we need to use the same values in |
b8698a0f | 2694 | created vectors. It is greater than 1 if unrolling is performed. |
ebfd146a IR |
2695 | |
2696 | For example, we have two scalar operands, s1 and s2 (e.g., group of | |
2697 | strided accesses of size two), while NUNITS is four (i.e., four scalars | |
f7e531cf IR |
2698 | of this type can be packed in a vector). The output vector will contain |
2699 | two copies of each scalar operand: {s1, s2, s1, s2}. (NUMBER_OF_COPIES | |
ebfd146a IR |
2700 | will be 2). |
2701 | ||
b8698a0f | 2702 | If GROUP_SIZE > NUNITS, the scalars will be split into several vectors |
ebfd146a IR |
2703 | containing the operands. |
2704 | ||
2705 | For example, NUNITS is four as before, and the group size is 8 | |
f7e531cf | 2706 | (s1, s2, ..., s8). We will create two vectors {s1, s2, s3, s4} and |
ebfd146a | 2707 | {s5, s6, s7, s8}. */ |
b8698a0f | 2708 | |
14a61437 | 2709 | number_of_copies = nunits * number_of_vectors / group_size; |
ebfd146a IR |
2710 | |
2711 | number_of_places_left_in_vector = nunits; | |
d2a12ae7 | 2712 | elts = XALLOCAVEC (tree, nunits); |
90dd6e3d | 2713 | bool place_after_defs = false; |
ebfd146a IR |
2714 | for (j = 0; j < number_of_copies; j++) |
2715 | { | |
9771b263 | 2716 | for (i = group_size - 1; stmts.iterate (i, &stmt); i--) |
ebfd146a IR |
2717 | { |
2718 | if (is_store) | |
2719 | op = gimple_assign_rhs1 (stmt); | |
bac430c9 | 2720 | else |
f7e531cf | 2721 | { |
bac430c9 | 2722 | switch (code) |
f7e531cf | 2723 | { |
bac430c9 IR |
2724 | case COND_EXPR: |
2725 | if (op_num == 0 || op_num == 1) | |
2726 | { | |
2727 | tree cond = gimple_assign_rhs1 (stmt); | |
2728 | op = TREE_OPERAND (cond, op_num); | |
2729 | } | |
2730 | else | |
2731 | { | |
2732 | if (op_num == 2) | |
2733 | op = gimple_assign_rhs2 (stmt); | |
2734 | else | |
2735 | op = gimple_assign_rhs3 (stmt); | |
2736 | } | |
2737 | break; | |
2738 | ||
2739 | case CALL_EXPR: | |
2740 | op = gimple_call_arg (stmt, op_num); | |
2741 | break; | |
2742 | ||
b84b294a JJ |
2743 | case LSHIFT_EXPR: |
2744 | case RSHIFT_EXPR: | |
2745 | case LROTATE_EXPR: | |
2746 | case RROTATE_EXPR: | |
2747 | op = gimple_op (stmt, op_num + 1); | |
2748 | /* Unlike the other binary operators, shifts/rotates have | |
2749 | the shift count being int, instead of the same type as | |
2750 | the lhs, so make sure the scalar is the right type if | |
2751 | we are dealing with vectors of | |
2752 | long long/long/short/char. */ | |
793d9a16 | 2753 | if (op_num == 1 && TREE_CODE (op) == INTEGER_CST) |
b84b294a JJ |
2754 | op = fold_convert (TREE_TYPE (vector_type), op); |
2755 | break; | |
2756 | ||
bac430c9 IR |
2757 | default: |
2758 | op = gimple_op (stmt, op_num + 1); | |
b84b294a | 2759 | break; |
f7e531cf IR |
2760 | } |
2761 | } | |
b8698a0f | 2762 | |
b5aeb3bb IR |
2763 | if (reduc_index != -1) |
2764 | { | |
0e93a64e IR |
2765 | loop = (gimple_bb (stmt))->loop_father; |
2766 | def_stmt = SSA_NAME_DEF_STMT (op); | |
b5aeb3bb IR |
2767 | |
2768 | gcc_assert (loop); | |
b010117a IR |
2769 | |
2770 | /* Get the def before the loop. In reduction chain we have only | |
2771 | one initial value. */ | |
2772 | if ((j != (number_of_copies - 1) | |
2773 | || (GROUP_FIRST_ELEMENT (vinfo_for_stmt (stmt)) | |
2774 | && i != 0)) | |
2775 | && neutral_op) | |
b5aeb3bb | 2776 | op = neutral_op; |
b010117a IR |
2777 | else |
2778 | op = PHI_ARG_DEF_FROM_EDGE (def_stmt, | |
2779 | loop_preheader_edge (loop)); | |
b5aeb3bb IR |
2780 | } |
2781 | ||
ebfd146a | 2782 | /* Create 'vect_ = {op0,op1,...,opn}'. */ |
ebfd146a | 2783 | number_of_places_left_in_vector--; |
90dd6e3d | 2784 | tree orig_op = op; |
13396b6e | 2785 | if (!types_compatible_p (TREE_TYPE (vector_type), TREE_TYPE (op))) |
50eeef09 | 2786 | { |
793d9a16 | 2787 | if (CONSTANT_CLASS_P (op)) |
13396b6e JJ |
2788 | { |
2789 | op = fold_unary (VIEW_CONVERT_EXPR, | |
2790 | TREE_TYPE (vector_type), op); | |
2791 | gcc_assert (op && CONSTANT_CLASS_P (op)); | |
2792 | } | |
2793 | else | |
2794 | { | |
b731b390 | 2795 | tree new_temp = make_ssa_name (TREE_TYPE (vector_type)); |
13396b6e | 2796 | gimple init_stmt; |
0d0e4a03 | 2797 | op = build1 (VIEW_CONVERT_EXPR, TREE_TYPE (vector_type), op); |
13396b6e | 2798 | init_stmt |
0d0e4a03 | 2799 | = gimple_build_assign (new_temp, VIEW_CONVERT_EXPR, op); |
13396b6e JJ |
2800 | gimple_seq_add_stmt (&ctor_seq, init_stmt); |
2801 | op = new_temp; | |
2802 | } | |
50eeef09 | 2803 | } |
d2a12ae7 | 2804 | elts[number_of_places_left_in_vector] = op; |
793d9a16 RB |
2805 | if (!CONSTANT_CLASS_P (op)) |
2806 | constant_p = false; | |
90dd6e3d RB |
2807 | if (TREE_CODE (orig_op) == SSA_NAME |
2808 | && !SSA_NAME_IS_DEFAULT_DEF (orig_op) | |
2809 | && STMT_VINFO_BB_VINFO (stmt_vinfo) | |
2810 | && (STMT_VINFO_BB_VINFO (stmt_vinfo)->bb | |
2811 | == gimple_bb (SSA_NAME_DEF_STMT (orig_op)))) | |
2812 | place_after_defs = true; | |
ebfd146a IR |
2813 | |
2814 | if (number_of_places_left_in_vector == 0) | |
2815 | { | |
2816 | number_of_places_left_in_vector = nunits; | |
2817 | ||
2818 | if (constant_p) | |
d2a12ae7 | 2819 | vec_cst = build_vector (vector_type, elts); |
ebfd146a | 2820 | else |
d2a12ae7 | 2821 | { |
9771b263 | 2822 | vec<constructor_elt, va_gc> *v; |
d2a12ae7 | 2823 | unsigned k; |
9771b263 | 2824 | vec_alloc (v, nunits); |
d2a12ae7 RG |
2825 | for (k = 0; k < nunits; ++k) |
2826 | CONSTRUCTOR_APPEND_ELT (v, NULL_TREE, elts[k]); | |
2827 | vec_cst = build_constructor (vector_type, v); | |
2828 | } | |
90dd6e3d RB |
2829 | tree init; |
2830 | gimple_stmt_iterator gsi; | |
2831 | if (place_after_defs) | |
2832 | { | |
2833 | gsi = gsi_for_stmt | |
2834 | (vect_find_last_scalar_stmt_in_slp (slp_node)); | |
2835 | init = vect_init_vector (stmt, vec_cst, vector_type, &gsi); | |
2836 | } | |
2837 | else | |
2838 | init = vect_init_vector (stmt, vec_cst, vector_type, NULL); | |
13396b6e JJ |
2839 | if (ctor_seq != NULL) |
2840 | { | |
90dd6e3d | 2841 | gsi = gsi_for_stmt (SSA_NAME_DEF_STMT (init)); |
13396b6e JJ |
2842 | gsi_insert_seq_before_without_update (&gsi, ctor_seq, |
2843 | GSI_SAME_STMT); | |
2844 | ctor_seq = NULL; | |
2845 | } | |
90dd6e3d RB |
2846 | voprnds.quick_push (init); |
2847 | place_after_defs = false; | |
ebfd146a IR |
2848 | } |
2849 | } | |
2850 | } | |
2851 | ||
b8698a0f | 2852 | /* Since the vectors are created in the reverse order, we should invert |
ebfd146a | 2853 | them. */ |
9771b263 | 2854 | vec_num = voprnds.length (); |
d2a12ae7 | 2855 | for (j = vec_num; j != 0; j--) |
ebfd146a | 2856 | { |
9771b263 DN |
2857 | vop = voprnds[j - 1]; |
2858 | vec_oprnds->quick_push (vop); | |
ebfd146a IR |
2859 | } |
2860 | ||
9771b263 | 2861 | voprnds.release (); |
ebfd146a IR |
2862 | |
2863 | /* In case that VF is greater than the unrolling factor needed for the SLP | |
b8698a0f L |
2864 | group of stmts, NUMBER_OF_VECTORS to be created is greater than |
2865 | NUMBER_OF_SCALARS/NUNITS or NUNITS/NUMBER_OF_SCALARS, and hence we have | |
ebfd146a | 2866 | to replicate the vectors. */ |
9771b263 | 2867 | while (number_of_vectors > vec_oprnds->length ()) |
ebfd146a | 2868 | { |
b5aeb3bb IR |
2869 | tree neutral_vec = NULL; |
2870 | ||
2871 | if (neutral_op) | |
2872 | { | |
2873 | if (!neutral_vec) | |
b9acc9f1 | 2874 | neutral_vec = build_vector_from_val (vector_type, neutral_op); |
b5aeb3bb | 2875 | |
9771b263 | 2876 | vec_oprnds->quick_push (neutral_vec); |
b5aeb3bb IR |
2877 | } |
2878 | else | |
2879 | { | |
9771b263 DN |
2880 | for (i = 0; vec_oprnds->iterate (i, &vop) && i < vec_num; i++) |
2881 | vec_oprnds->quick_push (vop); | |
b5aeb3bb | 2882 | } |
ebfd146a IR |
2883 | } |
2884 | } | |
2885 | ||
2886 | ||
2887 | /* Get vectorized definitions from SLP_NODE that contains corresponding | |
2888 | vectorized def-stmts. */ | |
2889 | ||
2890 | static void | |
9771b263 | 2891 | vect_get_slp_vect_defs (slp_tree slp_node, vec<tree> *vec_oprnds) |
ebfd146a IR |
2892 | { |
2893 | tree vec_oprnd; | |
2894 | gimple vec_def_stmt; | |
2895 | unsigned int i; | |
2896 | ||
9771b263 | 2897 | gcc_assert (SLP_TREE_VEC_STMTS (slp_node).exists ()); |
ebfd146a | 2898 | |
9771b263 | 2899 | FOR_EACH_VEC_ELT (SLP_TREE_VEC_STMTS (slp_node), i, vec_def_stmt) |
ebfd146a IR |
2900 | { |
2901 | gcc_assert (vec_def_stmt); | |
2902 | vec_oprnd = gimple_get_lhs (vec_def_stmt); | |
9771b263 | 2903 | vec_oprnds->quick_push (vec_oprnd); |
ebfd146a IR |
2904 | } |
2905 | } | |
2906 | ||
2907 | ||
b8698a0f L |
2908 | /* Get vectorized definitions for SLP_NODE. |
2909 | If the scalar definitions are loop invariants or constants, collect them and | |
ebfd146a IR |
2910 | call vect_get_constant_vectors() to create vector stmts. |
2911 | Otherwise, the def-stmts must be already vectorized and the vectorized stmts | |
d092494c IR |
2912 | must be stored in the corresponding child of SLP_NODE, and we call |
2913 | vect_get_slp_vect_defs () to retrieve them. */ | |
b8698a0f | 2914 | |
ebfd146a | 2915 | void |
9771b263 | 2916 | vect_get_slp_defs (vec<tree> ops, slp_tree slp_node, |
37b5ec8f | 2917 | vec<vec<tree> > *vec_oprnds, int reduc_index) |
ebfd146a | 2918 | { |
e44978dc | 2919 | gimple first_stmt; |
d092494c IR |
2920 | int number_of_vects = 0, i; |
2921 | unsigned int child_index = 0; | |
b8698a0f | 2922 | HOST_WIDE_INT lhs_size_unit, rhs_size_unit; |
d092494c | 2923 | slp_tree child = NULL; |
37b5ec8f | 2924 | vec<tree> vec_defs; |
e44978dc | 2925 | tree oprnd; |
d092494c | 2926 | bool vectorized_defs; |
ebfd146a | 2927 | |
9771b263 DN |
2928 | first_stmt = SLP_TREE_SCALAR_STMTS (slp_node)[0]; |
2929 | FOR_EACH_VEC_ELT (ops, i, oprnd) | |
ebfd146a | 2930 | { |
d092494c IR |
2931 | /* For each operand we check if it has vectorized definitions in a child |
2932 | node or we need to create them (for invariants and constants). We | |
2933 | check if the LHS of the first stmt of the next child matches OPRND. | |
2934 | If it does, we found the correct child. Otherwise, we call | |
2935 | vect_get_constant_vectors (), and not advance CHILD_INDEX in order | |
2936 | to check this child node for the next operand. */ | |
2937 | vectorized_defs = false; | |
9771b263 | 2938 | if (SLP_TREE_CHILDREN (slp_node).length () > child_index) |
ebfd146a | 2939 | { |
01d8bf07 | 2940 | child = SLP_TREE_CHILDREN (slp_node)[child_index]; |
d092494c | 2941 | |
e44978dc | 2942 | /* We have to check both pattern and original def, if available. */ |
90dd6e3d | 2943 | if (child) |
e44978dc | 2944 | { |
90dd6e3d RB |
2945 | gimple first_def = SLP_TREE_SCALAR_STMTS (child)[0]; |
2946 | gimple related | |
2947 | = STMT_VINFO_RELATED_STMT (vinfo_for_stmt (first_def)); | |
2948 | ||
2949 | if (operand_equal_p (oprnd, gimple_get_lhs (first_def), 0) | |
2950 | || (related | |
2951 | && operand_equal_p (oprnd, gimple_get_lhs (related), 0))) | |
2952 | { | |
2953 | /* The number of vector defs is determined by the number of | |
2954 | vector statements in the node from which we get those | |
2955 | statements. */ | |
2956 | number_of_vects = SLP_TREE_NUMBER_OF_VEC_STMTS (child); | |
2957 | vectorized_defs = true; | |
2958 | child_index++; | |
2959 | } | |
e44978dc | 2960 | } |
90dd6e3d RB |
2961 | else |
2962 | child_index++; | |
d092494c | 2963 | } |
ebfd146a | 2964 | |
d092494c IR |
2965 | if (!vectorized_defs) |
2966 | { | |
2967 | if (i == 0) | |
2968 | { | |
2969 | number_of_vects = SLP_TREE_NUMBER_OF_VEC_STMTS (slp_node); | |
2970 | /* Number of vector stmts was calculated according to LHS in | |
2971 | vect_schedule_slp_instance (), fix it by replacing LHS with | |
2972 | RHS, if necessary. See vect_get_smallest_scalar_type () for | |
2973 | details. */ | |
2974 | vect_get_smallest_scalar_type (first_stmt, &lhs_size_unit, | |
2975 | &rhs_size_unit); | |
2976 | if (rhs_size_unit != lhs_size_unit) | |
2977 | { | |
2978 | number_of_vects *= rhs_size_unit; | |
2979 | number_of_vects /= lhs_size_unit; | |
2980 | } | |
2981 | } | |
2982 | } | |
b5aeb3bb | 2983 | |
d092494c | 2984 | /* Allocate memory for vectorized defs. */ |
37b5ec8f JJ |
2985 | vec_defs = vNULL; |
2986 | vec_defs.create (number_of_vects); | |
ebfd146a | 2987 | |
d092494c IR |
2988 | /* For reduction defs we call vect_get_constant_vectors (), since we are |
2989 | looking for initial loop invariant values. */ | |
2990 | if (vectorized_defs && reduc_index == -1) | |
2991 | /* The defs are already vectorized. */ | |
37b5ec8f | 2992 | vect_get_slp_vect_defs (child, &vec_defs); |
d092494c IR |
2993 | else |
2994 | /* Build vectors from scalar defs. */ | |
37b5ec8f | 2995 | vect_get_constant_vectors (oprnd, slp_node, &vec_defs, i, |
d092494c | 2996 | number_of_vects, reduc_index); |
ebfd146a | 2997 | |
37b5ec8f | 2998 | vec_oprnds->quick_push (vec_defs); |
ebfd146a | 2999 | |
d092494c IR |
3000 | /* For reductions, we only need initial values. */ |
3001 | if (reduc_index != -1) | |
3002 | return; | |
3003 | } | |
ebfd146a IR |
3004 | } |
3005 | ||
a70d6342 | 3006 | |
b8698a0f | 3007 | /* Create NCOPIES permutation statements using the mask MASK_BYTES (by |
ebfd146a IR |
3008 | building a vector of type MASK_TYPE from it) and two input vectors placed in |
3009 | DR_CHAIN at FIRST_VEC_INDX and SECOND_VEC_INDX for the first copy and | |
3010 | shifting by STRIDE elements of DR_CHAIN for every copy. | |
3011 | (STRIDE is the number of vectorized stmts for NODE divided by the number of | |
b8698a0f | 3012 | copies). |
ebfd146a IR |
3013 | VECT_STMTS_COUNTER specifies the index in the vectorized stmts of NODE, where |
3014 | the created stmts must be inserted. */ | |
3015 | ||
3016 | static inline void | |
502f0263 | 3017 | vect_create_mask_and_perm (gimple stmt, |
faf63e39 | 3018 | tree mask, int first_vec_indx, int second_vec_indx, |
b8698a0f | 3019 | gimple_stmt_iterator *gsi, slp_tree node, |
9771b263 | 3020 | tree vectype, vec<tree> dr_chain, |
ebfd146a IR |
3021 | int ncopies, int vect_stmts_counter) |
3022 | { | |
faf63e39 | 3023 | tree perm_dest; |
ebfd146a | 3024 | gimple perm_stmt = NULL; |
0f900dfa | 3025 | int i, stride; |
ebfd146a | 3026 | tree first_vec, second_vec, data_ref; |
ebfd146a | 3027 | |
ebfd146a | 3028 | stride = SLP_TREE_NUMBER_OF_VEC_STMTS (node) / ncopies; |
ebfd146a | 3029 | |
b8698a0f | 3030 | /* Initialize the vect stmts of NODE to properly insert the generated |
ebfd146a | 3031 | stmts later. */ |
9771b263 | 3032 | for (i = SLP_TREE_VEC_STMTS (node).length (); |
ebfd146a | 3033 | i < (int) SLP_TREE_NUMBER_OF_VEC_STMTS (node); i++) |
9771b263 | 3034 | SLP_TREE_VEC_STMTS (node).quick_push (NULL); |
ebfd146a IR |
3035 | |
3036 | perm_dest = vect_create_destination_var (gimple_assign_lhs (stmt), vectype); | |
3037 | for (i = 0; i < ncopies; i++) | |
3038 | { | |
9771b263 DN |
3039 | first_vec = dr_chain[first_vec_indx]; |
3040 | second_vec = dr_chain[second_vec_indx]; | |
ebfd146a | 3041 | |
ebfd146a | 3042 | /* Generate the permute statement. */ |
0d0e4a03 JJ |
3043 | perm_stmt = gimple_build_assign (perm_dest, VEC_PERM_EXPR, |
3044 | first_vec, second_vec, mask); | |
ebfd146a | 3045 | data_ref = make_ssa_name (perm_dest, perm_stmt); |
2635892a | 3046 | gimple_set_lhs (perm_stmt, data_ref); |
ebfd146a | 3047 | vect_finish_stmt_generation (stmt, perm_stmt, gsi); |
ebfd146a | 3048 | |
b8698a0f | 3049 | /* Store the vector statement in NODE. */ |
9771b263 | 3050 | SLP_TREE_VEC_STMTS (node)[stride * i + vect_stmts_counter] = perm_stmt; |
ebfd146a IR |
3051 | |
3052 | first_vec_indx += stride; | |
3053 | second_vec_indx += stride; | |
3054 | } | |
ebfd146a IR |
3055 | } |
3056 | ||
3057 | ||
b8698a0f | 3058 | /* Given FIRST_MASK_ELEMENT - the mask element in element representation, |
ebfd146a | 3059 | return in CURRENT_MASK_ELEMENT its equivalent in target specific |
ff802fa1 | 3060 | representation. Check that the mask is valid and return FALSE if not. |
ebfd146a IR |
3061 | Return TRUE in NEED_NEXT_VECTOR if the permutation requires to move to |
3062 | the next vector, i.e., the current first vector is not needed. */ | |
b8698a0f | 3063 | |
ebfd146a | 3064 | static bool |
b8698a0f | 3065 | vect_get_mask_element (gimple stmt, int first_mask_element, int m, |
ebfd146a | 3066 | int mask_nunits, bool only_one_vec, int index, |
22e4dee7 | 3067 | unsigned char *mask, int *current_mask_element, |
694a4f61 IR |
3068 | bool *need_next_vector, int *number_of_mask_fixes, |
3069 | bool *mask_fixed, bool *needs_first_vector) | |
ebfd146a IR |
3070 | { |
3071 | int i; | |
ebfd146a IR |
3072 | |
3073 | /* Convert to target specific representation. */ | |
3074 | *current_mask_element = first_mask_element + m; | |
3075 | /* Adjust the value in case it's a mask for second and third vectors. */ | |
694a4f61 | 3076 | *current_mask_element -= mask_nunits * (*number_of_mask_fixes - 1); |
ebfd146a | 3077 | |
c8047699 RB |
3078 | if (*current_mask_element < 0) |
3079 | { | |
3080 | if (dump_enabled_p ()) | |
3081 | { | |
3082 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, | |
3083 | "permutation requires past vector "); | |
3084 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, stmt, 0); | |
3085 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); | |
3086 | } | |
3087 | return false; | |
3088 | } | |
3089 | ||
ebfd146a | 3090 | if (*current_mask_element < mask_nunits) |
694a4f61 | 3091 | *needs_first_vector = true; |
ebfd146a IR |
3092 | |
3093 | /* We have only one input vector to permute but the mask accesses values in | |
3094 | the next vector as well. */ | |
3095 | if (only_one_vec && *current_mask_element >= mask_nunits) | |
3096 | { | |
73fbfcad | 3097 | if (dump_enabled_p ()) |
ebfd146a | 3098 | { |
e645e942 | 3099 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
78c60e3d SS |
3100 | "permutation requires at least two vectors "); |
3101 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, stmt, 0); | |
e645e942 | 3102 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); |
ebfd146a IR |
3103 | } |
3104 | ||
3105 | return false; | |
3106 | } | |
3107 | ||
3108 | /* The mask requires the next vector. */ | |
496d3346 | 3109 | while (*current_mask_element >= mask_nunits * 2) |
ebfd146a | 3110 | { |
694a4f61 | 3111 | if (*needs_first_vector || *mask_fixed) |
ebfd146a IR |
3112 | { |
3113 | /* We either need the first vector too or have already moved to the | |
b8698a0f | 3114 | next vector. In both cases, this permutation needs three |
ebfd146a | 3115 | vectors. */ |
73fbfcad | 3116 | if (dump_enabled_p ()) |
ebfd146a | 3117 | { |
78c60e3d SS |
3118 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
3119 | "permutation requires at " | |
3120 | "least three vectors "); | |
3121 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, stmt, 0); | |
e645e942 | 3122 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); |
ebfd146a IR |
3123 | } |
3124 | ||
3125 | return false; | |
3126 | } | |
3127 | ||
3128 | /* We move to the next vector, dropping the first one and working with | |
3129 | the second and the third - we need to adjust the values of the mask | |
3130 | accordingly. */ | |
694a4f61 | 3131 | *current_mask_element -= mask_nunits * *number_of_mask_fixes; |
ebfd146a IR |
3132 | |
3133 | for (i = 0; i < index; i++) | |
694a4f61 | 3134 | mask[i] -= mask_nunits * *number_of_mask_fixes; |
ebfd146a | 3135 | |
694a4f61 IR |
3136 | (*number_of_mask_fixes)++; |
3137 | *mask_fixed = true; | |
ebfd146a IR |
3138 | } |
3139 | ||
694a4f61 | 3140 | *need_next_vector = *mask_fixed; |
ebfd146a IR |
3141 | |
3142 | /* This was the last element of this mask. Start a new one. */ | |
3143 | if (index == mask_nunits - 1) | |
3144 | { | |
694a4f61 IR |
3145 | *number_of_mask_fixes = 1; |
3146 | *mask_fixed = false; | |
3147 | *needs_first_vector = false; | |
ebfd146a IR |
3148 | } |
3149 | ||
3150 | return true; | |
3151 | } | |
3152 | ||
3153 | ||
3154 | /* Generate vector permute statements from a list of loads in DR_CHAIN. | |
3155 | If ANALYZE_ONLY is TRUE, only check that it is possible to create valid | |
01d8bf07 RB |
3156 | permute statements for the SLP node NODE of the SLP instance |
3157 | SLP_NODE_INSTANCE. */ | |
3158 | ||
ebfd146a | 3159 | bool |
01d8bf07 | 3160 | vect_transform_slp_perm_load (slp_tree node, vec<tree> dr_chain, |
ebfd146a IR |
3161 | gimple_stmt_iterator *gsi, int vf, |
3162 | slp_instance slp_node_instance, bool analyze_only) | |
3163 | { | |
01d8bf07 | 3164 | gimple stmt = SLP_TREE_SCALAR_STMTS (node)[0]; |
ebfd146a IR |
3165 | stmt_vec_info stmt_info = vinfo_for_stmt (stmt); |
3166 | tree mask_element_type = NULL_TREE, mask_type; | |
502f0263 | 3167 | int i, j, k, nunits, vec_index = 0; |
2635892a | 3168 | tree vectype = STMT_VINFO_VECTYPE (stmt_info); |
ebfd146a IR |
3169 | int group_size = SLP_INSTANCE_GROUP_SIZE (slp_node_instance); |
3170 | int first_mask_element; | |
22e4dee7 RH |
3171 | int index, unroll_factor, current_mask_element, ncopies; |
3172 | unsigned char *mask; | |
ebfd146a IR |
3173 | bool only_one_vec = false, need_next_vector = false; |
3174 | int first_vec_index, second_vec_index, orig_vec_stmts_num, vect_stmts_counter; | |
694a4f61 IR |
3175 | int number_of_mask_fixes = 1; |
3176 | bool mask_fixed = false; | |
3177 | bool needs_first_vector = false; | |
ef4bddc2 | 3178 | machine_mode mode; |
ebfd146a | 3179 | |
91ff1504 RB |
3180 | if (!STMT_VINFO_GROUPED_ACCESS (stmt_info)) |
3181 | return false; | |
3182 | ||
3183 | stmt_info = vinfo_for_stmt (GROUP_FIRST_ELEMENT (stmt_info)); | |
3184 | ||
22e4dee7 RH |
3185 | mode = TYPE_MODE (vectype); |
3186 | ||
3187 | if (!can_vec_perm_p (mode, false, NULL)) | |
ebfd146a | 3188 | { |
73fbfcad | 3189 | if (dump_enabled_p ()) |
ebfd146a | 3190 | { |
78c60e3d SS |
3191 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
3192 | "no vect permute for "); | |
3193 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, stmt, 0); | |
e645e942 | 3194 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); |
ebfd146a | 3195 | } |
2635892a | 3196 | return false; |
ebfd146a IR |
3197 | } |
3198 | ||
2635892a RH |
3199 | /* The generic VEC_PERM_EXPR code always uses an integral type of the |
3200 | same size as the vector element being permuted. */ | |
96f9265a RG |
3201 | mask_element_type = lang_hooks.types.type_for_mode |
3202 | (int_mode_for_mode (TYPE_MODE (TREE_TYPE (vectype))), 1); | |
ebfd146a | 3203 | mask_type = get_vectype_for_scalar_type (mask_element_type); |
ebfd146a | 3204 | nunits = TYPE_VECTOR_SUBPARTS (vectype); |
22e4dee7 | 3205 | mask = XALLOCAVEC (unsigned char, nunits); |
ebfd146a IR |
3206 | unroll_factor = SLP_INSTANCE_UNROLLING_FACTOR (slp_node_instance); |
3207 | ||
3208 | /* The number of vector stmts to generate based only on SLP_NODE_INSTANCE | |
3209 | unrolling factor. */ | |
91ff1504 RB |
3210 | orig_vec_stmts_num |
3211 | = (STMT_VINFO_GROUP_SIZE (stmt_info) | |
3212 | * SLP_INSTANCE_UNROLLING_FACTOR (slp_node_instance) | |
3213 | + nunits - 1) / nunits; | |
ebfd146a IR |
3214 | if (orig_vec_stmts_num == 1) |
3215 | only_one_vec = true; | |
3216 | ||
b8698a0f | 3217 | /* Number of copies is determined by the final vectorization factor |
ebfd146a | 3218 | relatively to SLP_NODE_INSTANCE unrolling factor. */ |
b8698a0f | 3219 | ncopies = vf / SLP_INSTANCE_UNROLLING_FACTOR (slp_node_instance); |
ebfd146a | 3220 | |
b8698a0f L |
3221 | /* Generate permutation masks for every NODE. Number of masks for each NODE |
3222 | is equal to GROUP_SIZE. | |
3223 | E.g., we have a group of three nodes with three loads from the same | |
3224 | location in each node, and the vector size is 4. I.e., we have a | |
3225 | a0b0c0a1b1c1... sequence and we need to create the following vectors: | |
ebfd146a IR |
3226 | for a's: a0a0a0a1 a1a1a2a2 a2a3a3a3 |
3227 | for b's: b0b0b0b1 b1b1b2b2 b2b3b3b3 | |
3228 | ... | |
3229 | ||
2635892a | 3230 | The masks for a's should be: {0,0,0,3} {3,3,6,6} {6,9,9,9}. |
b8698a0f | 3231 | The last mask is illegal since we assume two operands for permute |
ff802fa1 IR |
3232 | operation, and the mask element values can't be outside that range. |
3233 | Hence, the last mask must be converted into {2,5,5,5}. | |
b8698a0f | 3234 | For the first two permutations we need the first and the second input |
ebfd146a | 3235 | vectors: {a0,b0,c0,a1} and {b1,c1,a2,b2}, and for the last permutation |
b8698a0f | 3236 | we need the second and the third vectors: {b1,c1,a2,b2} and |
ebfd146a IR |
3237 | {c2,a3,b3,c3}. */ |
3238 | ||
21c0a521 | 3239 | { |
ebfd146a IR |
3240 | index = 0; |
3241 | vect_stmts_counter = 0; | |
3242 | vec_index = 0; | |
3243 | first_vec_index = vec_index++; | |
3244 | if (only_one_vec) | |
3245 | second_vec_index = first_vec_index; | |
3246 | else | |
3247 | second_vec_index = vec_index++; | |
3248 | ||
3249 | for (j = 0; j < unroll_factor; j++) | |
3250 | { | |
3251 | for (k = 0; k < group_size; k++) | |
3252 | { | |
01d8bf07 | 3253 | i = SLP_TREE_LOAD_PERMUTATION (node)[k]; |
9b999e8c | 3254 | first_mask_element = i + j * STMT_VINFO_GROUP_SIZE (stmt_info); |
2635892a RH |
3255 | if (!vect_get_mask_element (stmt, first_mask_element, 0, |
3256 | nunits, only_one_vec, index, | |
3257 | mask, ¤t_mask_element, | |
3258 | &need_next_vector, | |
3259 | &number_of_mask_fixes, &mask_fixed, | |
3260 | &needs_first_vector)) | |
3261 | return false; | |
c8047699 RB |
3262 | gcc_assert (current_mask_element >= 0 |
3263 | && current_mask_element < 2 * nunits); | |
2635892a | 3264 | mask[index++] = current_mask_element; |
ebfd146a | 3265 | |
2635892a | 3266 | if (index == nunits) |
ebfd146a | 3267 | { |
01d8bf07 | 3268 | index = 0; |
22e4dee7 RH |
3269 | if (!can_vec_perm_p (mode, false, mask)) |
3270 | { | |
73fbfcad | 3271 | if (dump_enabled_p ()) |
22e4dee7 | 3272 | { |
78c60e3d SS |
3273 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, |
3274 | vect_location, | |
3275 | "unsupported vect permute { "); | |
22e4dee7 | 3276 | for (i = 0; i < nunits; ++i) |
78c60e3d SS |
3277 | dump_printf (MSG_MISSED_OPTIMIZATION, "%d ", |
3278 | mask[i]); | |
3279 | dump_printf (MSG_MISSED_OPTIMIZATION, "}\n"); | |
22e4dee7 RH |
3280 | } |
3281 | return false; | |
3282 | } | |
3283 | ||
ebfd146a IR |
3284 | if (!analyze_only) |
3285 | { | |
01d8bf07 RB |
3286 | int l; |
3287 | tree mask_vec, *mask_elts; | |
3288 | mask_elts = XALLOCAVEC (tree, nunits); | |
3289 | for (l = 0; l < nunits; ++l) | |
3290 | mask_elts[l] = build_int_cst (mask_element_type, | |
3291 | mask[l]); | |
3292 | mask_vec = build_vector (mask_type, mask_elts); | |
3293 | ||
3294 | if (need_next_vector) | |
ebfd146a IR |
3295 | { |
3296 | first_vec_index = second_vec_index; | |
3297 | second_vec_index = vec_index; | |
3298 | } | |
3299 | ||
502f0263 | 3300 | vect_create_mask_and_perm (stmt, |
faf63e39 | 3301 | mask_vec, first_vec_index, second_vec_index, |
2635892a | 3302 | gsi, node, vectype, dr_chain, |
faf63e39 | 3303 | ncopies, vect_stmts_counter++); |
ebfd146a | 3304 | } |
b8698a0f L |
3305 | } |
3306 | } | |
3307 | } | |
3308 | } | |
ebfd146a | 3309 | |
ebfd146a IR |
3310 | return true; |
3311 | } | |
3312 | ||
3313 | ||
3314 | ||
3315 | /* Vectorize SLP instance tree in postorder. */ | |
3316 | ||
3317 | static bool | |
3318 | vect_schedule_slp_instance (slp_tree node, slp_instance instance, | |
a70d6342 | 3319 | unsigned int vectorization_factor) |
ebfd146a IR |
3320 | { |
3321 | gimple stmt; | |
0d0293ac | 3322 | bool grouped_store, is_store; |
ebfd146a IR |
3323 | gimple_stmt_iterator si; |
3324 | stmt_vec_info stmt_info; | |
3325 | unsigned int vec_stmts_size, nunits, group_size; | |
3326 | tree vectype; | |
3327 | int i; | |
d755c7ef | 3328 | slp_tree child; |
ebfd146a IR |
3329 | |
3330 | if (!node) | |
3331 | return false; | |
3332 | ||
9771b263 | 3333 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (node), i, child) |
d755c7ef | 3334 | vect_schedule_slp_instance (child, instance, vectorization_factor); |
b8698a0f | 3335 | |
9771b263 | 3336 | stmt = SLP_TREE_SCALAR_STMTS (node)[0]; |
ebfd146a IR |
3337 | stmt_info = vinfo_for_stmt (stmt); |
3338 | ||
3339 | /* VECTYPE is the type of the destination. */ | |
b690cc0f | 3340 | vectype = STMT_VINFO_VECTYPE (stmt_info); |
ebfd146a IR |
3341 | nunits = (unsigned int) TYPE_VECTOR_SUBPARTS (vectype); |
3342 | group_size = SLP_INSTANCE_GROUP_SIZE (instance); | |
3343 | ||
3344 | /* For each SLP instance calculate number of vector stmts to be created | |
ff802fa1 | 3345 | for the scalar stmts in each node of the SLP tree. Number of vector |
ebfd146a IR |
3346 | elements in one vector iteration is the number of scalar elements in |
3347 | one scalar iteration (GROUP_SIZE) multiplied by VF divided by vector | |
14a61437 RB |
3348 | size. |
3349 | Unless this is a SLP reduction in which case the number of vector | |
3350 | stmts is equal to the number of vector stmts of the children. */ | |
3351 | if (GROUP_FIRST_ELEMENT (stmt_info) | |
3352 | && !STMT_VINFO_GROUPED_ACCESS (stmt_info)) | |
3353 | vec_stmts_size = SLP_TREE_NUMBER_OF_VEC_STMTS (SLP_TREE_CHILDREN (node)[0]); | |
3354 | else | |
3355 | vec_stmts_size = (vectorization_factor * group_size) / nunits; | |
ebfd146a | 3356 | |
9771b263 | 3357 | if (!SLP_TREE_VEC_STMTS (node).exists ()) |
ebfd146a | 3358 | { |
9771b263 | 3359 | SLP_TREE_VEC_STMTS (node).create (vec_stmts_size); |
ebfd146a IR |
3360 | SLP_TREE_NUMBER_OF_VEC_STMTS (node) = vec_stmts_size; |
3361 | } | |
3362 | ||
73fbfcad | 3363 | if (dump_enabled_p ()) |
ebfd146a | 3364 | { |
78c60e3d SS |
3365 | dump_printf_loc (MSG_NOTE,vect_location, |
3366 | "------>vectorizing SLP node starting from: "); | |
3367 | dump_gimple_stmt (MSG_NOTE, TDF_SLIM, stmt, 0); | |
e645e942 | 3368 | dump_printf (MSG_NOTE, "\n"); |
b8698a0f | 3369 | } |
ebfd146a | 3370 | |
2e8ab70c RB |
3371 | /* Vectorized stmts go before the last scalar stmt which is where |
3372 | all uses are ready. */ | |
3373 | si = gsi_for_stmt (vect_find_last_scalar_stmt_in_slp (node)); | |
e4a707c4 | 3374 | |
b010117a IR |
3375 | /* Mark the first element of the reduction chain as reduction to properly |
3376 | transform the node. In the analysis phase only the last element of the | |
3377 | chain is marked as reduction. */ | |
0d0293ac | 3378 | if (GROUP_FIRST_ELEMENT (stmt_info) && !STMT_VINFO_GROUPED_ACCESS (stmt_info) |
b010117a IR |
3379 | && GROUP_FIRST_ELEMENT (stmt_info) == stmt) |
3380 | { | |
3381 | STMT_VINFO_DEF_TYPE (stmt_info) = vect_reduction_def; | |
3382 | STMT_VINFO_TYPE (stmt_info) = reduc_vec_info_type; | |
3383 | } | |
3384 | ||
6876e5bc RB |
3385 | /* Handle two-operation SLP nodes by vectorizing the group with |
3386 | both operations and then performing a merge. */ | |
3387 | if (SLP_TREE_TWO_OPERATORS (node)) | |
3388 | { | |
3389 | enum tree_code code0 = gimple_assign_rhs_code (stmt); | |
3390 | enum tree_code ocode; | |
3391 | gimple ostmt; | |
3392 | unsigned char *mask = XALLOCAVEC (unsigned char, group_size); | |
3393 | bool allsame = true; | |
3394 | FOR_EACH_VEC_ELT (SLP_TREE_SCALAR_STMTS (node), i, ostmt) | |
3395 | if (gimple_assign_rhs_code (ostmt) != code0) | |
3396 | { | |
3397 | mask[i] = 1; | |
3398 | allsame = false; | |
3399 | ocode = gimple_assign_rhs_code (ostmt); | |
3400 | } | |
3401 | else | |
3402 | mask[i] = 0; | |
3403 | if (!allsame) | |
3404 | { | |
3405 | vec<gimple> v0; | |
3406 | vec<gimple> v1; | |
3407 | unsigned j; | |
3408 | tree tmask = NULL_TREE; | |
3409 | vect_transform_stmt (stmt, &si, &grouped_store, node, instance); | |
3410 | v0 = SLP_TREE_VEC_STMTS (node).copy (); | |
3411 | SLP_TREE_VEC_STMTS (node).truncate (0); | |
3412 | gimple_assign_set_rhs_code (stmt, ocode); | |
3413 | vect_transform_stmt (stmt, &si, &grouped_store, node, instance); | |
3414 | gimple_assign_set_rhs_code (stmt, code0); | |
3415 | v1 = SLP_TREE_VEC_STMTS (node).copy (); | |
3416 | SLP_TREE_VEC_STMTS (node).truncate (0); | |
3417 | tree meltype = build_nonstandard_integer_type | |
3418 | (GET_MODE_BITSIZE (TYPE_MODE (TREE_TYPE (vectype))), 1); | |
3419 | tree mvectype = get_same_sized_vectype (meltype, vectype); | |
3420 | unsigned k = 0, l; | |
3421 | for (j = 0; j < v0.length (); ++j) | |
3422 | { | |
3423 | tree *melts = XALLOCAVEC (tree, TYPE_VECTOR_SUBPARTS (vectype)); | |
3424 | for (l = 0; l < TYPE_VECTOR_SUBPARTS (vectype); ++l) | |
3425 | { | |
1ece8d4c | 3426 | if (k >= group_size) |
6876e5bc RB |
3427 | k = 0; |
3428 | melts[l] = build_int_cst | |
3429 | (meltype, mask[k++] * TYPE_VECTOR_SUBPARTS (vectype) + l); | |
3430 | } | |
3431 | tmask = build_vector (mvectype, melts); | |
3432 | ||
3433 | /* ??? Not all targets support a VEC_PERM_EXPR with a | |
3434 | constant mask that would translate to a vec_merge RTX | |
3435 | (with their vec_perm_const_ok). We can either not | |
3436 | vectorize in that case or let veclower do its job. | |
3437 | Unfortunately that isn't too great and at least for | |
3438 | plus/minus we'd eventually like to match targets | |
3439 | vector addsub instructions. */ | |
3440 | gimple vstmt; | |
3441 | vstmt = gimple_build_assign (make_ssa_name (vectype), | |
3442 | VEC_PERM_EXPR, | |
3443 | gimple_assign_lhs (v0[j]), | |
3444 | gimple_assign_lhs (v1[j]), tmask); | |
3445 | vect_finish_stmt_generation (stmt, vstmt, &si); | |
3446 | SLP_TREE_VEC_STMTS (node).quick_push (vstmt); | |
3447 | } | |
3448 | v0.release (); | |
3449 | v1.release (); | |
3450 | return false; | |
3451 | } | |
3452 | } | |
0d0293ac | 3453 | is_store = vect_transform_stmt (stmt, &si, &grouped_store, node, instance); |
b5aeb3bb | 3454 | return is_store; |
ebfd146a IR |
3455 | } |
3456 | ||
dd34c087 JJ |
3457 | /* Replace scalar calls from SLP node NODE with setting of their lhs to zero. |
3458 | For loop vectorization this is done in vectorizable_call, but for SLP | |
3459 | it needs to be deferred until end of vect_schedule_slp, because multiple | |
3460 | SLP instances may refer to the same scalar stmt. */ | |
3461 | ||
3462 | static void | |
3463 | vect_remove_slp_scalar_calls (slp_tree node) | |
3464 | { | |
3465 | gimple stmt, new_stmt; | |
3466 | gimple_stmt_iterator gsi; | |
3467 | int i; | |
d755c7ef | 3468 | slp_tree child; |
dd34c087 JJ |
3469 | tree lhs; |
3470 | stmt_vec_info stmt_info; | |
3471 | ||
3472 | if (!node) | |
3473 | return; | |
3474 | ||
9771b263 | 3475 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (node), i, child) |
d755c7ef | 3476 | vect_remove_slp_scalar_calls (child); |
dd34c087 | 3477 | |
9771b263 | 3478 | FOR_EACH_VEC_ELT (SLP_TREE_SCALAR_STMTS (node), i, stmt) |
dd34c087 JJ |
3479 | { |
3480 | if (!is_gimple_call (stmt) || gimple_bb (stmt) == NULL) | |
3481 | continue; | |
3482 | stmt_info = vinfo_for_stmt (stmt); | |
3483 | if (stmt_info == NULL | |
3484 | || is_pattern_stmt_p (stmt_info) | |
3485 | || !PURE_SLP_STMT (stmt_info)) | |
3486 | continue; | |
3487 | lhs = gimple_call_lhs (stmt); | |
3488 | new_stmt = gimple_build_assign (lhs, build_zero_cst (TREE_TYPE (lhs))); | |
3489 | set_vinfo_for_stmt (new_stmt, stmt_info); | |
3490 | set_vinfo_for_stmt (stmt, NULL); | |
3491 | STMT_VINFO_STMT (stmt_info) = new_stmt; | |
3492 | gsi = gsi_for_stmt (stmt); | |
3493 | gsi_replace (&gsi, new_stmt, false); | |
3494 | SSA_NAME_DEF_STMT (gimple_assign_lhs (new_stmt)) = new_stmt; | |
3495 | } | |
3496 | } | |
ebfd146a | 3497 | |
ff802fa1 IR |
3498 | /* Generate vector code for all SLP instances in the loop/basic block. */ |
3499 | ||
ebfd146a | 3500 | bool |
a70d6342 | 3501 | vect_schedule_slp (loop_vec_info loop_vinfo, bb_vec_info bb_vinfo) |
ebfd146a | 3502 | { |
9771b263 | 3503 | vec<slp_instance> slp_instances; |
ebfd146a | 3504 | slp_instance instance; |
01d8bf07 | 3505 | unsigned int i, vf; |
ebfd146a IR |
3506 | bool is_store = false; |
3507 | ||
a70d6342 IR |
3508 | if (loop_vinfo) |
3509 | { | |
3510 | slp_instances = LOOP_VINFO_SLP_INSTANCES (loop_vinfo); | |
3511 | vf = LOOP_VINFO_VECT_FACTOR (loop_vinfo); | |
b8698a0f | 3512 | } |
a70d6342 IR |
3513 | else |
3514 | { | |
3515 | slp_instances = BB_VINFO_SLP_INSTANCES (bb_vinfo); | |
3516 | vf = 1; | |
b8698a0f | 3517 | } |
a70d6342 | 3518 | |
9771b263 | 3519 | FOR_EACH_VEC_ELT (slp_instances, i, instance) |
ebfd146a IR |
3520 | { |
3521 | /* Schedule the tree of INSTANCE. */ | |
3522 | is_store = vect_schedule_slp_instance (SLP_INSTANCE_TREE (instance), | |
a70d6342 | 3523 | instance, vf); |
73fbfcad | 3524 | if (dump_enabled_p ()) |
78c60e3d | 3525 | dump_printf_loc (MSG_NOTE, vect_location, |
e645e942 | 3526 | "vectorizing stmts using SLP.\n"); |
ebfd146a IR |
3527 | } |
3528 | ||
9771b263 | 3529 | FOR_EACH_VEC_ELT (slp_instances, i, instance) |
b5aeb3bb IR |
3530 | { |
3531 | slp_tree root = SLP_INSTANCE_TREE (instance); | |
3532 | gimple store; | |
3533 | unsigned int j; | |
3534 | gimple_stmt_iterator gsi; | |
3535 | ||
c40eced0 RB |
3536 | /* Remove scalar call stmts. Do not do this for basic-block |
3537 | vectorization as not all uses may be vectorized. | |
3538 | ??? Why should this be necessary? DCE should be able to | |
3539 | remove the stmts itself. | |
3540 | ??? For BB vectorization we can as well remove scalar | |
3541 | stmts starting from the SLP tree root if they have no | |
3542 | uses. */ | |
3543 | if (loop_vinfo) | |
3544 | vect_remove_slp_scalar_calls (root); | |
dd34c087 | 3545 | |
9771b263 | 3546 | for (j = 0; SLP_TREE_SCALAR_STMTS (root).iterate (j, &store) |
b5aeb3bb IR |
3547 | && j < SLP_INSTANCE_GROUP_SIZE (instance); j++) |
3548 | { | |
3549 | if (!STMT_VINFO_DATA_REF (vinfo_for_stmt (store))) | |
3550 | break; | |
3551 | ||
a024e70e IR |
3552 | if (is_pattern_stmt_p (vinfo_for_stmt (store))) |
3553 | store = STMT_VINFO_RELATED_STMT (vinfo_for_stmt (store)); | |
b5aeb3bb IR |
3554 | /* Free the attached stmt_vec_info and remove the stmt. */ |
3555 | gsi = gsi_for_stmt (store); | |
3d3f2249 | 3556 | unlink_stmt_vdef (store); |
b5aeb3bb | 3557 | gsi_remove (&gsi, true); |
3d3f2249 | 3558 | release_defs (store); |
b5aeb3bb IR |
3559 | free_stmt_vec_info (store); |
3560 | } | |
3561 | } | |
3562 | ||
ebfd146a IR |
3563 | return is_store; |
3564 | } | |
a70d6342 IR |
3565 | |
3566 | ||
3567 | /* Vectorize the basic block. */ | |
3568 | ||
3569 | void | |
3570 | vect_slp_transform_bb (basic_block bb) | |
3571 | { | |
3572 | bb_vec_info bb_vinfo = vec_info_for_bb (bb); | |
3573 | gimple_stmt_iterator si; | |
3574 | ||
3575 | gcc_assert (bb_vinfo); | |
3576 | ||
73fbfcad | 3577 | if (dump_enabled_p ()) |
78c60e3d | 3578 | dump_printf_loc (MSG_NOTE, vect_location, "SLPing BB\n"); |
a70d6342 IR |
3579 | |
3580 | for (si = gsi_start_bb (bb); !gsi_end_p (si); gsi_next (&si)) | |
3581 | { | |
3582 | gimple stmt = gsi_stmt (si); | |
3583 | stmt_vec_info stmt_info; | |
3584 | ||
73fbfcad | 3585 | if (dump_enabled_p ()) |
a70d6342 | 3586 | { |
78c60e3d SS |
3587 | dump_printf_loc (MSG_NOTE, vect_location, |
3588 | "------>SLPing statement: "); | |
3589 | dump_gimple_stmt (MSG_NOTE, TDF_SLIM, stmt, 0); | |
e645e942 | 3590 | dump_printf (MSG_NOTE, "\n"); |
a70d6342 IR |
3591 | } |
3592 | ||
3593 | stmt_info = vinfo_for_stmt (stmt); | |
3594 | gcc_assert (stmt_info); | |
3595 | ||
3596 | /* Schedule all the SLP instances when the first SLP stmt is reached. */ | |
3597 | if (STMT_SLP_TYPE (stmt_info)) | |
3598 | { | |
3599 | vect_schedule_slp (NULL, bb_vinfo); | |
3600 | break; | |
3601 | } | |
3602 | } | |
3603 | ||
73fbfcad | 3604 | if (dump_enabled_p ()) |
5d318fd4 | 3605 | dump_printf_loc (MSG_NOTE, vect_location, |
ccb3ad87 | 3606 | "BASIC BLOCK VECTORIZED\n"); |
a70d6342 | 3607 | |
12aaf609 IR |
3608 | destroy_bb_vec_info (bb_vinfo); |
3609 | } |