]>
Commit | Line | Data |
---|---|---|
ebfd146a | 1 | /* SLP - Basic Block Vectorization |
85ec4feb | 2 | Copyright (C) 2007-2018 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" | |
c7131fb2 | 25 | #include "backend.h" |
957060b5 AM |
26 | #include "target.h" |
27 | #include "rtl.h" | |
ebfd146a | 28 | #include "tree.h" |
c7131fb2 | 29 | #include "gimple.h" |
957060b5 | 30 | #include "tree-pass.h" |
c7131fb2 | 31 | #include "ssa.h" |
957060b5 AM |
32 | #include "optabs-tree.h" |
33 | #include "insn-config.h" | |
34 | #include "recog.h" /* FIXME: for insn_data */ | |
957060b5 | 35 | #include "params.h" |
40e23961 | 36 | #include "fold-const.h" |
d8a2d370 | 37 | #include "stor-layout.h" |
5be5c238 | 38 | #include "gimple-iterator.h" |
ebfd146a | 39 | #include "cfgloop.h" |
ebfd146a | 40 | #include "tree-vectorizer.h" |
2635892a | 41 | #include "langhooks.h" |
642fce57 | 42 | #include "gimple-walk.h" |
428db0ba | 43 | #include "dbgcnt.h" |
5ebaa477 | 44 | #include "tree-vector-builder.h" |
f151c9e1 | 45 | #include "vec-perm-indices.h" |
018b2744 RS |
46 | #include "gimple-fold.h" |
47 | #include "internal-fn.h" | |
a70d6342 IR |
48 | |
49 | ||
ebfd146a IR |
50 | /* Recursively free the memory allocated for the SLP tree rooted at NODE. */ |
51 | ||
52 | static void | |
53 | vect_free_slp_tree (slp_tree node) | |
54 | { | |
d092494c | 55 | int i; |
d755c7ef | 56 | slp_tree child; |
d092494c | 57 | |
9771b263 | 58 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (node), i, child) |
d755c7ef | 59 | vect_free_slp_tree (child); |
b8698a0f | 60 | |
78810bd3 RB |
61 | gimple *stmt; |
62 | FOR_EACH_VEC_ELT (SLP_TREE_SCALAR_STMTS (node), i, stmt) | |
63 | /* After transform some stmts are removed and thus their vinfo is gone. */ | |
64 | if (vinfo_for_stmt (stmt)) | |
65 | { | |
66 | gcc_assert (STMT_VINFO_NUM_SLP_USES (vinfo_for_stmt (stmt)) > 0); | |
67 | STMT_VINFO_NUM_SLP_USES (vinfo_for_stmt (stmt))--; | |
68 | } | |
69 | ||
9771b263 DN |
70 | SLP_TREE_CHILDREN (node).release (); |
71 | SLP_TREE_SCALAR_STMTS (node).release (); | |
72 | SLP_TREE_VEC_STMTS (node).release (); | |
01d8bf07 | 73 | SLP_TREE_LOAD_PERMUTATION (node).release (); |
ebfd146a IR |
74 | |
75 | free (node); | |
76 | } | |
77 | ||
78 | ||
79 | /* Free the memory allocated for the SLP instance. */ | |
80 | ||
81 | void | |
82 | vect_free_slp_instance (slp_instance instance) | |
83 | { | |
84 | vect_free_slp_tree (SLP_INSTANCE_TREE (instance)); | |
9771b263 | 85 | SLP_INSTANCE_LOADS (instance).release (); |
c7e62a26 | 86 | free (instance); |
ebfd146a IR |
87 | } |
88 | ||
89 | ||
d092494c IR |
90 | /* Create an SLP node for SCALAR_STMTS. */ |
91 | ||
92 | static slp_tree | |
355fe088 | 93 | vect_create_new_slp_node (vec<gimple *> scalar_stmts) |
d092494c | 94 | { |
d3cfd39e | 95 | slp_tree node; |
355fe088 | 96 | gimple *stmt = scalar_stmts[0]; |
d092494c IR |
97 | unsigned int nops; |
98 | ||
99 | if (is_gimple_call (stmt)) | |
100 | nops = gimple_call_num_args (stmt); | |
101 | else if (is_gimple_assign (stmt)) | |
f7e531cf IR |
102 | { |
103 | nops = gimple_num_ops (stmt) - 1; | |
104 | if (gimple_assign_rhs_code (stmt) == COND_EXPR) | |
105 | nops++; | |
106 | } | |
e7baeb39 RB |
107 | else if (gimple_code (stmt) == GIMPLE_PHI) |
108 | nops = 0; | |
d092494c IR |
109 | else |
110 | return NULL; | |
111 | ||
d3cfd39e | 112 | node = XNEW (struct _slp_tree); |
d092494c | 113 | SLP_TREE_SCALAR_STMTS (node) = scalar_stmts; |
9771b263 | 114 | SLP_TREE_VEC_STMTS (node).create (0); |
68435eb2 | 115 | SLP_TREE_NUMBER_OF_VEC_STMTS (node) = 0; |
9771b263 | 116 | SLP_TREE_CHILDREN (node).create (nops); |
01d8bf07 | 117 | SLP_TREE_LOAD_PERMUTATION (node) = vNULL; |
6876e5bc | 118 | SLP_TREE_TWO_OPERATORS (node) = false; |
603cca93 | 119 | SLP_TREE_DEF_TYPE (node) = vect_internal_def; |
d092494c | 120 | |
78810bd3 RB |
121 | unsigned i; |
122 | FOR_EACH_VEC_ELT (scalar_stmts, i, stmt) | |
123 | STMT_VINFO_NUM_SLP_USES (vinfo_for_stmt (stmt))++; | |
124 | ||
d092494c IR |
125 | return node; |
126 | } | |
127 | ||
128 | ||
ddf56386 RB |
129 | /* This structure is used in creation of an SLP tree. Each instance |
130 | corresponds to the same operand in a group of scalar stmts in an SLP | |
131 | node. */ | |
132 | typedef struct _slp_oprnd_info | |
133 | { | |
134 | /* Def-stmts for the operands. */ | |
135 | vec<gimple *> def_stmts; | |
136 | /* Information about the first statement, its vector def-type, type, the | |
137 | operand itself in case it's constant, and an indication if it's a pattern | |
138 | stmt. */ | |
ddf56386 | 139 | tree first_op_type; |
34e82342 | 140 | enum vect_def_type first_dt; |
ddf56386 RB |
141 | bool first_pattern; |
142 | bool second_pattern; | |
143 | } *slp_oprnd_info; | |
144 | ||
145 | ||
d092494c IR |
146 | /* Allocate operands info for NOPS operands, and GROUP_SIZE def-stmts for each |
147 | operand. */ | |
9771b263 | 148 | static vec<slp_oprnd_info> |
d092494c IR |
149 | vect_create_oprnd_info (int nops, int group_size) |
150 | { | |
151 | int i; | |
152 | slp_oprnd_info oprnd_info; | |
9771b263 | 153 | vec<slp_oprnd_info> oprnds_info; |
d092494c | 154 | |
9771b263 | 155 | oprnds_info.create (nops); |
d092494c IR |
156 | for (i = 0; i < nops; i++) |
157 | { | |
158 | oprnd_info = XNEW (struct _slp_oprnd_info); | |
9771b263 | 159 | oprnd_info->def_stmts.create (group_size); |
d092494c | 160 | oprnd_info->first_dt = vect_uninitialized_def; |
793d9a16 | 161 | oprnd_info->first_op_type = NULL_TREE; |
d092494c | 162 | oprnd_info->first_pattern = false; |
effb52da | 163 | oprnd_info->second_pattern = false; |
9771b263 | 164 | oprnds_info.quick_push (oprnd_info); |
d092494c IR |
165 | } |
166 | ||
167 | return oprnds_info; | |
168 | } | |
169 | ||
170 | ||
d3cfd39e JJ |
171 | /* Free operands info. */ |
172 | ||
d092494c | 173 | static void |
9771b263 | 174 | vect_free_oprnd_info (vec<slp_oprnd_info> &oprnds_info) |
d092494c IR |
175 | { |
176 | int i; | |
177 | slp_oprnd_info oprnd_info; | |
178 | ||
9771b263 | 179 | FOR_EACH_VEC_ELT (oprnds_info, i, oprnd_info) |
d3cfd39e | 180 | { |
9771b263 | 181 | oprnd_info->def_stmts.release (); |
d3cfd39e JJ |
182 | XDELETE (oprnd_info); |
183 | } | |
d092494c | 184 | |
9771b263 | 185 | oprnds_info.release (); |
d092494c IR |
186 | } |
187 | ||
188 | ||
d755c7ef RB |
189 | /* Find the place of the data-ref in STMT in the interleaving chain that starts |
190 | from FIRST_STMT. Return -1 if the data-ref is not a part of the chain. */ | |
191 | ||
b210f45f | 192 | int |
355fe088 | 193 | vect_get_place_in_interleaving_chain (gimple *stmt, gimple *first_stmt) |
d755c7ef | 194 | { |
355fe088 | 195 | gimple *next_stmt = first_stmt; |
d755c7ef RB |
196 | int result = 0; |
197 | ||
198 | if (first_stmt != GROUP_FIRST_ELEMENT (vinfo_for_stmt (stmt))) | |
199 | return -1; | |
200 | ||
201 | do | |
202 | { | |
203 | if (next_stmt == stmt) | |
204 | return result; | |
d755c7ef | 205 | next_stmt = GROUP_NEXT_ELEMENT (vinfo_for_stmt (next_stmt)); |
c8047699 RB |
206 | if (next_stmt) |
207 | result += GROUP_GAP (vinfo_for_stmt (next_stmt)); | |
d755c7ef RB |
208 | } |
209 | while (next_stmt); | |
210 | ||
211 | return -1; | |
212 | } | |
213 | ||
018b2744 RS |
214 | /* Check whether it is possible to load COUNT elements of type ELT_MODE |
215 | using the method implemented by duplicate_and_interleave. Return true | |
216 | if so, returning the number of intermediate vectors in *NVECTORS_OUT | |
217 | (if nonnull) and the type of each intermediate vector in *VECTOR_TYPE_OUT | |
218 | (if nonnull). */ | |
219 | ||
f1739b48 | 220 | bool |
018b2744 | 221 | can_duplicate_and_interleave_p (unsigned int count, machine_mode elt_mode, |
f1739b48 RS |
222 | unsigned int *nvectors_out, |
223 | tree *vector_type_out, | |
224 | tree *permutes) | |
018b2744 RS |
225 | { |
226 | poly_int64 elt_bytes = count * GET_MODE_SIZE (elt_mode); | |
227 | poly_int64 nelts; | |
228 | unsigned int nvectors = 1; | |
229 | for (;;) | |
230 | { | |
231 | scalar_int_mode int_mode; | |
232 | poly_int64 elt_bits = elt_bytes * BITS_PER_UNIT; | |
233 | if (multiple_p (current_vector_size, elt_bytes, &nelts) | |
234 | && int_mode_for_size (elt_bits, 0).exists (&int_mode)) | |
235 | { | |
236 | tree int_type = build_nonstandard_integer_type | |
237 | (GET_MODE_BITSIZE (int_mode), 1); | |
238 | tree vector_type = build_vector_type (int_type, nelts); | |
239 | if (VECTOR_MODE_P (TYPE_MODE (vector_type))) | |
240 | { | |
241 | vec_perm_builder sel1 (nelts, 2, 3); | |
242 | vec_perm_builder sel2 (nelts, 2, 3); | |
243 | poly_int64 half_nelts = exact_div (nelts, 2); | |
244 | for (unsigned int i = 0; i < 3; ++i) | |
245 | { | |
246 | sel1.quick_push (i); | |
247 | sel1.quick_push (i + nelts); | |
248 | sel2.quick_push (half_nelts + i); | |
249 | sel2.quick_push (half_nelts + i + nelts); | |
250 | } | |
251 | vec_perm_indices indices1 (sel1, 2, nelts); | |
252 | vec_perm_indices indices2 (sel2, 2, nelts); | |
253 | if (can_vec_perm_const_p (TYPE_MODE (vector_type), indices1) | |
254 | && can_vec_perm_const_p (TYPE_MODE (vector_type), indices2)) | |
255 | { | |
256 | if (nvectors_out) | |
257 | *nvectors_out = nvectors; | |
258 | if (vector_type_out) | |
259 | *vector_type_out = vector_type; | |
260 | if (permutes) | |
261 | { | |
262 | permutes[0] = vect_gen_perm_mask_checked (vector_type, | |
263 | indices1); | |
264 | permutes[1] = vect_gen_perm_mask_checked (vector_type, | |
265 | indices2); | |
266 | } | |
267 | return true; | |
268 | } | |
269 | } | |
270 | } | |
271 | if (!multiple_p (elt_bytes, 2, &elt_bytes)) | |
272 | return false; | |
273 | nvectors *= 2; | |
274 | } | |
275 | } | |
d755c7ef | 276 | |
d092494c IR |
277 | /* Get the defs for the rhs of STMT (collect them in OPRNDS_INFO), check that |
278 | they are of a valid type and that they match the defs of the first stmt of | |
4cecd659 | 279 | the SLP group (stored in OPRNDS_INFO). This function tries to match stmts |
018b2744 RS |
280 | by swapping operands of STMTS[STMT_NUM] when possible. Non-zero *SWAP |
281 | indicates swap is required for cond_expr stmts. Specifically, *SWAP | |
282 | is 1 if STMT is cond and operands of comparison need to be swapped; | |
283 | *SWAP is 2 if STMT is cond and code of comparison needs to be inverted. | |
284 | If there is any operand swap in this function, *SWAP is set to non-zero | |
285 | value. | |
4cecd659 BC |
286 | If there was a fatal error return -1; if the error could be corrected by |
287 | swapping operands of father node of this one, return 1; if everything is | |
288 | ok return 0. */ | |
4cecd659 BC |
289 | static int |
290 | vect_get_and_check_slp_defs (vec_info *vinfo, unsigned char *swap, | |
018b2744 | 291 | vec<gimple *> stmts, unsigned stmt_num, |
4cecd659 | 292 | vec<slp_oprnd_info> *oprnds_info) |
ebfd146a | 293 | { |
018b2744 | 294 | gimple *stmt = stmts[stmt_num]; |
ebfd146a IR |
295 | tree oprnd; |
296 | unsigned int i, number_of_oprnds; | |
355fe088 | 297 | gimple *def_stmt; |
d092494c | 298 | enum vect_def_type dt = vect_uninitialized_def; |
d092494c | 299 | bool pattern = false; |
abf9bfbc | 300 | slp_oprnd_info oprnd_info; |
b0b4483e RB |
301 | int first_op_idx = 1; |
302 | bool commutative = false; | |
303 | bool first_op_cond = false; | |
effb52da RB |
304 | bool first = stmt_num == 0; |
305 | bool second = stmt_num == 1; | |
b8698a0f | 306 | |
d092494c | 307 | if (is_gimple_call (stmt)) |
190c2236 JJ |
308 | { |
309 | number_of_oprnds = gimple_call_num_args (stmt); | |
b0b4483e | 310 | first_op_idx = 3; |
190c2236 | 311 | } |
f7e531cf IR |
312 | else if (is_gimple_assign (stmt)) |
313 | { | |
b0b4483e | 314 | enum tree_code code = gimple_assign_rhs_code (stmt); |
f7e531cf | 315 | number_of_oprnds = gimple_num_ops (stmt) - 1; |
4cecd659 BC |
316 | /* Swap can only be done for cond_expr if asked to, otherwise we |
317 | could result in different comparison code to the first stmt. */ | |
a414c77f IE |
318 | if (gimple_assign_rhs_code (stmt) == COND_EXPR |
319 | && COMPARISON_CLASS_P (gimple_assign_rhs1 (stmt))) | |
b0b4483e RB |
320 | { |
321 | first_op_cond = true; | |
b0b4483e RB |
322 | number_of_oprnds++; |
323 | } | |
324 | else | |
325 | commutative = commutative_tree_code (code); | |
f7e531cf | 326 | } |
d092494c | 327 | else |
b0b4483e | 328 | return -1; |
ebfd146a | 329 | |
4cecd659 BC |
330 | bool swapped = (*swap != 0); |
331 | gcc_assert (!swapped || first_op_cond); | |
ebfd146a IR |
332 | for (i = 0; i < number_of_oprnds; i++) |
333 | { | |
b0b4483e RB |
334 | again: |
335 | if (first_op_cond) | |
f7e531cf | 336 | { |
4cecd659 BC |
337 | /* Map indicating how operands of cond_expr should be swapped. */ |
338 | int maps[3][4] = {{0, 1, 2, 3}, {1, 0, 2, 3}, {0, 1, 3, 2}}; | |
339 | int *map = maps[*swap]; | |
340 | ||
341 | if (i < 2) | |
342 | oprnd = TREE_OPERAND (gimple_op (stmt, first_op_idx), map[i]); | |
b0b4483e | 343 | else |
4cecd659 | 344 | oprnd = gimple_op (stmt, map[i]); |
f7e531cf IR |
345 | } |
346 | else | |
4cecd659 | 347 | oprnd = gimple_op (stmt, first_op_idx + (swapped ? !i : i)); |
f7e531cf | 348 | |
9771b263 | 349 | oprnd_info = (*oprnds_info)[i]; |
ebfd146a | 350 | |
81c40241 | 351 | if (!vect_is_simple_use (oprnd, vinfo, &def_stmt, &dt)) |
ebfd146a | 352 | { |
73fbfcad | 353 | if (dump_enabled_p ()) |
ebfd146a | 354 | { |
78c60e3d | 355 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
3fc356dc | 356 | "Build SLP failed: can't analyze def for "); |
78c60e3d | 357 | dump_generic_expr (MSG_MISSED_OPTIMIZATION, TDF_SLIM, oprnd); |
e645e942 | 358 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); |
ebfd146a IR |
359 | } |
360 | ||
b0b4483e | 361 | return -1; |
ebfd146a IR |
362 | } |
363 | ||
a70d6342 | 364 | /* Check if DEF_STMT is a part of a pattern in LOOP and get the def stmt |
ff802fa1 | 365 | from the pattern. Check that all the stmts of the node are in the |
ebfd146a | 366 | pattern. */ |
f5709183 | 367 | if (def_stmt && gimple_bb (def_stmt) |
61d371eb | 368 | && vect_stmt_in_region_p (vinfo, def_stmt) |
ebfd146a | 369 | && vinfo_for_stmt (def_stmt) |
83197f37 | 370 | && STMT_VINFO_IN_PATTERN_P (vinfo_for_stmt (def_stmt)) |
f5709183 IR |
371 | && !STMT_VINFO_RELEVANT (vinfo_for_stmt (def_stmt)) |
372 | && !STMT_VINFO_LIVE_P (vinfo_for_stmt (def_stmt))) | |
ebfd146a | 373 | { |
d092494c | 374 | pattern = true; |
effb52da RB |
375 | if (!first && !oprnd_info->first_pattern |
376 | /* Allow different pattern state for the defs of the | |
377 | first stmt in reduction chains. */ | |
378 | && (oprnd_info->first_dt != vect_reduction_def | |
379 | || (!second && !oprnd_info->second_pattern))) | |
d092494c | 380 | { |
b0b4483e RB |
381 | if (i == 0 |
382 | && !swapped | |
383 | && commutative) | |
384 | { | |
385 | swapped = true; | |
386 | goto again; | |
387 | } | |
388 | ||
73fbfcad | 389 | if (dump_enabled_p ()) |
d092494c | 390 | { |
78c60e3d SS |
391 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
392 | "Build SLP failed: some of the stmts" | |
393 | " are in a pattern, and others are not "); | |
394 | dump_generic_expr (MSG_MISSED_OPTIMIZATION, TDF_SLIM, oprnd); | |
e645e942 | 395 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); |
d092494c | 396 | } |
ebfd146a | 397 | |
b0b4483e | 398 | return 1; |
ebfd146a IR |
399 | } |
400 | ||
401 | def_stmt = STMT_VINFO_RELATED_STMT (vinfo_for_stmt (def_stmt)); | |
d092494c | 402 | dt = STMT_VINFO_DEF_TYPE (vinfo_for_stmt (def_stmt)); |
ebfd146a | 403 | |
f7e531cf | 404 | if (dt == vect_unknown_def_type) |
ebfd146a | 405 | { |
73fbfcad | 406 | if (dump_enabled_p ()) |
78c60e3d | 407 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
e645e942 | 408 | "Unsupported pattern.\n"); |
b0b4483e | 409 | return -1; |
ebfd146a IR |
410 | } |
411 | ||
412 | switch (gimple_code (def_stmt)) | |
413 | { | |
81c40241 RB |
414 | case GIMPLE_PHI: |
415 | case GIMPLE_ASSIGN: | |
416 | break; | |
417 | ||
418 | default: | |
419 | if (dump_enabled_p ()) | |
420 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, | |
421 | "unsupported defining stmt:\n"); | |
422 | return -1; | |
ebfd146a IR |
423 | } |
424 | } | |
425 | ||
effb52da RB |
426 | if (second) |
427 | oprnd_info->second_pattern = pattern; | |
428 | ||
d092494c | 429 | if (first) |
ebfd146a | 430 | { |
d092494c IR |
431 | oprnd_info->first_dt = dt; |
432 | oprnd_info->first_pattern = pattern; | |
793d9a16 | 433 | oprnd_info->first_op_type = TREE_TYPE (oprnd); |
ebfd146a | 434 | } |
ebfd146a IR |
435 | else |
436 | { | |
d092494c IR |
437 | /* Not first stmt of the group, check that the def-stmt/s match |
438 | the def-stmt/s of the first stmt. Allow different definition | |
439 | types for reduction chains: the first stmt must be a | |
440 | vect_reduction_def (a phi node), and the rest | |
441 | vect_internal_def. */ | |
018b2744 RS |
442 | tree type = TREE_TYPE (oprnd); |
443 | if ((oprnd_info->first_dt != dt | |
444 | && !(oprnd_info->first_dt == vect_reduction_def | |
445 | && dt == vect_internal_def) | |
446 | && !((oprnd_info->first_dt == vect_external_def | |
447 | || oprnd_info->first_dt == vect_constant_def) | |
448 | && (dt == vect_external_def | |
449 | || dt == vect_constant_def))) | |
450 | || !types_compatible_p (oprnd_info->first_op_type, type)) | |
ebfd146a | 451 | { |
b0b4483e RB |
452 | /* Try swapping operands if we got a mismatch. */ |
453 | if (i == 0 | |
454 | && !swapped | |
455 | && commutative) | |
456 | { | |
457 | swapped = true; | |
458 | goto again; | |
459 | } | |
460 | ||
abf9bfbc RB |
461 | if (dump_enabled_p ()) |
462 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, | |
e645e942 | 463 | "Build SLP failed: different types\n"); |
d092494c | 464 | |
b0b4483e | 465 | return 1; |
ebfd146a | 466 | } |
018b2744 RS |
467 | if ((dt == vect_constant_def |
468 | || dt == vect_external_def) | |
469 | && !current_vector_size.is_constant () | |
470 | && (TREE_CODE (type) == BOOLEAN_TYPE | |
471 | || !can_duplicate_and_interleave_p (stmts.length (), | |
472 | TYPE_MODE (type)))) | |
a23644f2 RS |
473 | { |
474 | if (dump_enabled_p ()) | |
475 | { | |
476 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, | |
477 | "Build SLP failed: invalid type of def " | |
478 | "for variable-length SLP "); | |
479 | dump_generic_expr (MSG_MISSED_OPTIMIZATION, TDF_SLIM, oprnd); | |
480 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); | |
481 | } | |
482 | return -1; | |
483 | } | |
018b2744 RS |
484 | } |
485 | ||
486 | /* Check the types of the definitions. */ | |
487 | switch (dt) | |
488 | { | |
489 | case vect_constant_def: | |
490 | case vect_external_def: | |
ebfd146a | 491 | break; |
b8698a0f | 492 | |
c78e3652 | 493 | case vect_reduction_def: |
e7baeb39 | 494 | case vect_induction_def: |
8644a673 | 495 | case vect_internal_def: |
abf9bfbc | 496 | oprnd_info->def_stmts.quick_push (def_stmt); |
ebfd146a IR |
497 | break; |
498 | ||
499 | default: | |
500 | /* FORNOW: Not supported. */ | |
73fbfcad | 501 | if (dump_enabled_p ()) |
ebfd146a | 502 | { |
78c60e3d SS |
503 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
504 | "Build SLP failed: illegal type of def "); | |
81c40241 | 505 | dump_generic_expr (MSG_MISSED_OPTIMIZATION, TDF_SLIM, oprnd); |
e645e942 | 506 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); |
ebfd146a IR |
507 | } |
508 | ||
b0b4483e | 509 | return -1; |
ebfd146a IR |
510 | } |
511 | } | |
512 | ||
b0b4483e RB |
513 | /* Swap operands. */ |
514 | if (swapped) | |
515 | { | |
78810bd3 RB |
516 | /* If there are already uses of this stmt in a SLP instance then |
517 | we've committed to the operand order and can't swap it. */ | |
518 | if (STMT_VINFO_NUM_SLP_USES (vinfo_for_stmt (stmt)) != 0) | |
519 | { | |
520 | if (dump_enabled_p ()) | |
521 | { | |
522 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, | |
523 | "Build SLP failed: cannot swap operands of " | |
524 | "shared stmt "); | |
525 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, stmt, 0); | |
526 | } | |
527 | return -1; | |
528 | } | |
529 | ||
b0b4483e RB |
530 | if (first_op_cond) |
531 | { | |
532 | tree cond = gimple_assign_rhs1 (stmt); | |
4cecd659 BC |
533 | enum tree_code code = TREE_CODE (cond); |
534 | ||
535 | /* Swap. */ | |
536 | if (*swap == 1) | |
537 | { | |
538 | swap_ssa_operands (stmt, &TREE_OPERAND (cond, 0), | |
539 | &TREE_OPERAND (cond, 1)); | |
540 | TREE_SET_CODE (cond, swap_tree_comparison (code)); | |
541 | } | |
542 | /* Invert. */ | |
543 | else | |
544 | { | |
545 | swap_ssa_operands (stmt, gimple_assign_rhs2_ptr (stmt), | |
546 | gimple_assign_rhs3_ptr (stmt)); | |
547 | bool honor_nans = HONOR_NANS (TREE_OPERAND (cond, 0)); | |
548 | code = invert_tree_comparison (TREE_CODE (cond), honor_nans); | |
549 | gcc_assert (code != ERROR_MARK); | |
550 | TREE_SET_CODE (cond, code); | |
551 | } | |
b0b4483e RB |
552 | } |
553 | else | |
554 | swap_ssa_operands (stmt, gimple_assign_rhs1_ptr (stmt), | |
555 | gimple_assign_rhs2_ptr (stmt)); | |
78810bd3 RB |
556 | if (dump_enabled_p ()) |
557 | { | |
558 | dump_printf_loc (MSG_NOTE, vect_location, | |
559 | "swapped operands to match def types in "); | |
560 | dump_gimple_stmt (MSG_NOTE, TDF_SLIM, stmt, 0); | |
561 | } | |
b0b4483e RB |
562 | } |
563 | ||
4cecd659 | 564 | *swap = swapped; |
b0b4483e | 565 | return 0; |
ebfd146a IR |
566 | } |
567 | ||
b161f2c9 RS |
568 | /* A subroutine of vect_build_slp_tree for checking VECTYPE, which is the |
569 | caller's attempt to find the vector type in STMT with the narrowest | |
570 | element type. Return true if VECTYPE is nonnull and if it is valid | |
571 | for VINFO. When returning true, update MAX_NUNITS to reflect the | |
572 | number of units in VECTYPE. VINFO, GORUP_SIZE and MAX_NUNITS are | |
573 | as for vect_build_slp_tree. */ | |
574 | ||
575 | static bool | |
576 | vect_record_max_nunits (vec_info *vinfo, gimple *stmt, unsigned int group_size, | |
4b6068ea | 577 | tree vectype, poly_uint64 *max_nunits) |
b161f2c9 RS |
578 | { |
579 | if (!vectype) | |
580 | { | |
581 | if (dump_enabled_p ()) | |
582 | { | |
583 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, | |
584 | "Build SLP failed: unsupported data-type in "); | |
585 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, stmt, 0); | |
586 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); | |
587 | } | |
588 | /* Fatal mismatch. */ | |
589 | return false; | |
590 | } | |
591 | ||
592 | /* If populating the vector type requires unrolling then fail | |
593 | before adjusting *max_nunits for basic-block vectorization. */ | |
4b6068ea RS |
594 | poly_uint64 nunits = TYPE_VECTOR_SUBPARTS (vectype); |
595 | unsigned HOST_WIDE_INT const_nunits; | |
b161f2c9 | 596 | if (is_a <bb_vec_info> (vinfo) |
4b6068ea RS |
597 | && (!nunits.is_constant (&const_nunits) |
598 | || const_nunits > group_size)) | |
b161f2c9 RS |
599 | { |
600 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, | |
601 | "Build SLP failed: unrolling required " | |
602 | "in basic block SLP\n"); | |
603 | /* Fatal mismatch. */ | |
604 | return false; | |
605 | } | |
606 | ||
607 | /* In case of multiple types we need to detect the smallest type. */ | |
4b6068ea | 608 | vect_update_max_nunits (max_nunits, vectype); |
b161f2c9 RS |
609 | return true; |
610 | } | |
ebfd146a | 611 | |
1f3cb663 RS |
612 | /* STMTS is a group of GROUP_SIZE SLP statements in which some |
613 | statements do the same operation as the first statement and in which | |
614 | the others do ALT_STMT_CODE. Return true if we can take one vector | |
615 | of the first operation and one vector of the second and permute them | |
616 | to get the required result. VECTYPE is the type of the vector that | |
617 | would be permuted. */ | |
618 | ||
619 | static bool | |
620 | vect_two_operations_perm_ok_p (vec<gimple *> stmts, unsigned int group_size, | |
621 | tree vectype, tree_code alt_stmt_code) | |
622 | { | |
623 | unsigned HOST_WIDE_INT count; | |
624 | if (!TYPE_VECTOR_SUBPARTS (vectype).is_constant (&count)) | |
625 | return false; | |
626 | ||
627 | vec_perm_builder sel (count, count, 1); | |
628 | for (unsigned int i = 0; i < count; ++i) | |
629 | { | |
630 | unsigned int elt = i; | |
631 | if (gimple_assign_rhs_code (stmts[i % group_size]) == alt_stmt_code) | |
632 | elt += count; | |
633 | sel.quick_push (elt); | |
634 | } | |
635 | vec_perm_indices indices (sel, 2, count); | |
636 | return can_vec_perm_const_p (TYPE_MODE (vectype), indices); | |
637 | } | |
638 | ||
6983e6b5 RB |
639 | /* Verify if the scalar stmts STMTS are isomorphic, require data |
640 | permutation or are of unsupported types of operation. Return | |
641 | true if they are, otherwise return false and indicate in *MATCHES | |
642 | which stmts are not isomorphic to the first one. If MATCHES[0] | |
643 | is false then this indicates the comparison could not be | |
4cecd659 BC |
644 | carried out or the stmts will never be vectorized by SLP. |
645 | ||
646 | Note COND_EXPR is possibly ismorphic to another one after swapping its | |
647 | operands. Set SWAP[i] to 1 if stmt I is COND_EXPR and isomorphic to | |
648 | the first stmt by swapping the two operands of comparison; set SWAP[i] | |
649 | to 2 if stmt I is isormorphic to the first stmt by inverting the code | |
650 | of comparison. Take A1 >= B1 ? X1 : Y1 as an exmple, it can be swapped | |
651 | to (B1 <= A1 ? X1 : Y1); or be inverted to (A1 < B1) ? Y1 : X1. */ | |
ebfd146a IR |
652 | |
653 | static bool | |
4cecd659 | 654 | vect_build_slp_tree_1 (vec_info *vinfo, unsigned char *swap, |
355fe088 | 655 | vec<gimple *> stmts, unsigned int group_size, |
4b6068ea | 656 | unsigned nops, poly_uint64 *max_nunits, |
97a1a642 | 657 | bool *matches, bool *two_operators) |
ebfd146a | 658 | { |
ebfd146a | 659 | unsigned int i; |
355fe088 | 660 | gimple *first_stmt = stmts[0], *stmt = stmts[0]; |
6876e5bc RB |
661 | enum tree_code first_stmt_code = ERROR_MARK; |
662 | enum tree_code alt_stmt_code = ERROR_MARK; | |
663 | enum tree_code rhs_code = ERROR_MARK; | |
f7e531cf | 664 | enum tree_code first_cond_code = ERROR_MARK; |
ebfd146a | 665 | tree lhs; |
6983e6b5 | 666 | bool need_same_oprnds = false; |
1f3cb663 | 667 | tree vectype = NULL_TREE, first_op1 = NULL_TREE; |
ebfd146a IR |
668 | optab optab; |
669 | int icode; | |
ef4bddc2 RS |
670 | machine_mode optab_op2_mode; |
671 | machine_mode vec_mode; | |
355fe088 | 672 | gimple *first_load = NULL, *prev_first_load = NULL; |
d092494c | 673 | |
ebfd146a | 674 | /* For every stmt in NODE find its def stmt/s. */ |
9771b263 | 675 | FOR_EACH_VEC_ELT (stmts, i, stmt) |
ebfd146a | 676 | { |
1f3cb663 | 677 | stmt_vec_info stmt_info = vinfo_for_stmt (stmt); |
4cecd659 | 678 | swap[i] = 0; |
6983e6b5 RB |
679 | matches[i] = false; |
680 | ||
73fbfcad | 681 | if (dump_enabled_p ()) |
ebfd146a | 682 | { |
78c60e3d SS |
683 | dump_printf_loc (MSG_NOTE, vect_location, "Build SLP for "); |
684 | dump_gimple_stmt (MSG_NOTE, TDF_SLIM, stmt, 0); | |
ebfd146a IR |
685 | } |
686 | ||
4b5caab7 IR |
687 | /* Fail to vectorize statements marked as unvectorizable. */ |
688 | if (!STMT_VINFO_VECTORIZABLE (vinfo_for_stmt (stmt))) | |
689 | { | |
73fbfcad | 690 | if (dump_enabled_p ()) |
4b5caab7 | 691 | { |
78c60e3d SS |
692 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
693 | "Build SLP failed: unvectorizable statement "); | |
694 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, stmt, 0); | |
4b5caab7 | 695 | } |
6983e6b5 RB |
696 | /* Fatal mismatch. */ |
697 | matches[0] = false; | |
4b5caab7 IR |
698 | return false; |
699 | } | |
700 | ||
ebfd146a IR |
701 | lhs = gimple_get_lhs (stmt); |
702 | if (lhs == NULL_TREE) | |
703 | { | |
73fbfcad | 704 | if (dump_enabled_p ()) |
ebfd146a | 705 | { |
78c60e3d SS |
706 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
707 | "Build SLP failed: not GIMPLE_ASSIGN nor " | |
708 | "GIMPLE_CALL "); | |
709 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, stmt, 0); | |
ebfd146a | 710 | } |
6983e6b5 RB |
711 | /* Fatal mismatch. */ |
712 | matches[0] = false; | |
ebfd146a IR |
713 | return false; |
714 | } | |
715 | ||
1f3cb663 RS |
716 | tree nunits_vectype; |
717 | if (!vect_get_vector_types_for_stmt (stmt_info, &vectype, | |
718 | &nunits_vectype) | |
719 | || (nunits_vectype | |
720 | && !vect_record_max_nunits (vinfo, stmt, group_size, | |
721 | nunits_vectype, max_nunits))) | |
b161f2c9 | 722 | { |
6983e6b5 RB |
723 | /* Fatal mismatch. */ |
724 | matches[0] = false; | |
1f3cb663 RS |
725 | return false; |
726 | } | |
727 | ||
728 | gcc_assert (vectype); | |
b8698a0f | 729 | |
538dd0b7 | 730 | if (gcall *call_stmt = dyn_cast <gcall *> (stmt)) |
190c2236 JJ |
731 | { |
732 | rhs_code = CALL_EXPR; | |
538dd0b7 DM |
733 | if (gimple_call_internal_p (call_stmt) |
734 | || gimple_call_tail_p (call_stmt) | |
735 | || gimple_call_noreturn_p (call_stmt) | |
736 | || !gimple_call_nothrow_p (call_stmt) | |
737 | || gimple_call_chain (call_stmt)) | |
190c2236 | 738 | { |
73fbfcad | 739 | if (dump_enabled_p ()) |
190c2236 | 740 | { |
78c60e3d SS |
741 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
742 | "Build SLP failed: unsupported call type "); | |
538dd0b7 DM |
743 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, |
744 | call_stmt, 0); | |
190c2236 | 745 | } |
6983e6b5 RB |
746 | /* Fatal mismatch. */ |
747 | matches[0] = false; | |
190c2236 JJ |
748 | return false; |
749 | } | |
750 | } | |
ebfd146a IR |
751 | else |
752 | rhs_code = gimple_assign_rhs_code (stmt); | |
753 | ||
754 | /* Check the operation. */ | |
755 | if (i == 0) | |
756 | { | |
757 | first_stmt_code = rhs_code; | |
758 | ||
b8698a0f | 759 | /* Shift arguments should be equal in all the packed stmts for a |
ebfd146a IR |
760 | vector shift with scalar shift operand. */ |
761 | if (rhs_code == LSHIFT_EXPR || rhs_code == RSHIFT_EXPR | |
762 | || rhs_code == LROTATE_EXPR | |
763 | || rhs_code == RROTATE_EXPR) | |
764 | { | |
1f3cb663 RS |
765 | if (vectype == boolean_type_node) |
766 | { | |
767 | if (dump_enabled_p ()) | |
768 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, | |
769 | "Build SLP failed: shift of a" | |
770 | " boolean.\n"); | |
771 | /* Fatal mismatch. */ | |
772 | matches[0] = false; | |
773 | return false; | |
774 | } | |
775 | ||
ebfd146a IR |
776 | vec_mode = TYPE_MODE (vectype); |
777 | ||
778 | /* First see if we have a vector/vector shift. */ | |
779 | optab = optab_for_tree_code (rhs_code, vectype, | |
780 | optab_vector); | |
781 | ||
782 | if (!optab | |
947131ba | 783 | || optab_handler (optab, vec_mode) == CODE_FOR_nothing) |
ebfd146a IR |
784 | { |
785 | /* No vector/vector shift, try for a vector/scalar shift. */ | |
786 | optab = optab_for_tree_code (rhs_code, vectype, | |
787 | optab_scalar); | |
788 | ||
789 | if (!optab) | |
790 | { | |
73fbfcad | 791 | if (dump_enabled_p ()) |
78c60e3d | 792 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
e645e942 | 793 | "Build SLP failed: no optab.\n"); |
6983e6b5 RB |
794 | /* Fatal mismatch. */ |
795 | matches[0] = false; | |
ebfd146a IR |
796 | return false; |
797 | } | |
947131ba | 798 | icode = (int) optab_handler (optab, vec_mode); |
ebfd146a IR |
799 | if (icode == CODE_FOR_nothing) |
800 | { | |
73fbfcad | 801 | if (dump_enabled_p ()) |
78c60e3d SS |
802 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
803 | "Build SLP failed: " | |
e645e942 | 804 | "op not supported by target.\n"); |
6983e6b5 RB |
805 | /* Fatal mismatch. */ |
806 | matches[0] = false; | |
ebfd146a IR |
807 | return false; |
808 | } | |
809 | optab_op2_mode = insn_data[icode].operand[2].mode; | |
810 | if (!VECTOR_MODE_P (optab_op2_mode)) | |
811 | { | |
812 | need_same_oprnds = true; | |
813 | first_op1 = gimple_assign_rhs2 (stmt); | |
814 | } | |
815 | } | |
816 | } | |
36ba4aae IR |
817 | else if (rhs_code == WIDEN_LSHIFT_EXPR) |
818 | { | |
819 | need_same_oprnds = true; | |
820 | first_op1 = gimple_assign_rhs2 (stmt); | |
821 | } | |
ebfd146a IR |
822 | } |
823 | else | |
824 | { | |
6876e5bc RB |
825 | if (first_stmt_code != rhs_code |
826 | && alt_stmt_code == ERROR_MARK) | |
827 | alt_stmt_code = rhs_code; | |
ebfd146a IR |
828 | if (first_stmt_code != rhs_code |
829 | && (first_stmt_code != IMAGPART_EXPR | |
830 | || rhs_code != REALPART_EXPR) | |
831 | && (first_stmt_code != REALPART_EXPR | |
69f11a13 | 832 | || rhs_code != IMAGPART_EXPR) |
6876e5bc RB |
833 | /* Handle mismatches in plus/minus by computing both |
834 | and merging the results. */ | |
835 | && !((first_stmt_code == PLUS_EXPR | |
836 | || first_stmt_code == MINUS_EXPR) | |
837 | && (alt_stmt_code == PLUS_EXPR | |
838 | || alt_stmt_code == MINUS_EXPR) | |
839 | && rhs_code == alt_stmt_code) | |
0d0293ac | 840 | && !(STMT_VINFO_GROUPED_ACCESS (vinfo_for_stmt (stmt)) |
69f11a13 | 841 | && (first_stmt_code == ARRAY_REF |
38000232 | 842 | || first_stmt_code == BIT_FIELD_REF |
69f11a13 IR |
843 | || first_stmt_code == INDIRECT_REF |
844 | || first_stmt_code == COMPONENT_REF | |
845 | || first_stmt_code == MEM_REF))) | |
ebfd146a | 846 | { |
73fbfcad | 847 | if (dump_enabled_p ()) |
ebfd146a | 848 | { |
78c60e3d SS |
849 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
850 | "Build SLP failed: different operation " | |
851 | "in stmt "); | |
852 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, stmt, 0); | |
6876e5bc RB |
853 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
854 | "original stmt "); | |
855 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, | |
856 | first_stmt, 0); | |
ebfd146a | 857 | } |
6983e6b5 RB |
858 | /* Mismatch. */ |
859 | continue; | |
ebfd146a | 860 | } |
b8698a0f L |
861 | |
862 | if (need_same_oprnds | |
ebfd146a IR |
863 | && !operand_equal_p (first_op1, gimple_assign_rhs2 (stmt), 0)) |
864 | { | |
73fbfcad | 865 | if (dump_enabled_p ()) |
ebfd146a | 866 | { |
78c60e3d SS |
867 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
868 | "Build SLP failed: different shift " | |
869 | "arguments in "); | |
870 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, stmt, 0); | |
ebfd146a | 871 | } |
6983e6b5 RB |
872 | /* Mismatch. */ |
873 | continue; | |
ebfd146a | 874 | } |
190c2236 JJ |
875 | |
876 | if (rhs_code == CALL_EXPR) | |
877 | { | |
355fe088 | 878 | gimple *first_stmt = stmts[0]; |
190c2236 JJ |
879 | if (gimple_call_num_args (stmt) != nops |
880 | || !operand_equal_p (gimple_call_fn (first_stmt), | |
881 | gimple_call_fn (stmt), 0) | |
882 | || gimple_call_fntype (first_stmt) | |
883 | != gimple_call_fntype (stmt)) | |
884 | { | |
73fbfcad | 885 | if (dump_enabled_p ()) |
190c2236 | 886 | { |
78c60e3d SS |
887 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
888 | "Build SLP failed: different calls in "); | |
889 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, | |
890 | stmt, 0); | |
190c2236 | 891 | } |
6983e6b5 RB |
892 | /* Mismatch. */ |
893 | continue; | |
190c2236 JJ |
894 | } |
895 | } | |
ebfd146a IR |
896 | } |
897 | ||
0d0293ac MM |
898 | /* Grouped store or load. */ |
899 | if (STMT_VINFO_GROUPED_ACCESS (vinfo_for_stmt (stmt))) | |
ebfd146a IR |
900 | { |
901 | if (REFERENCE_CLASS_P (lhs)) | |
902 | { | |
903 | /* Store. */ | |
6983e6b5 | 904 | ; |
ebfd146a | 905 | } |
b5aeb3bb IR |
906 | else |
907 | { | |
908 | /* Load. */ | |
e14c1050 | 909 | first_load = GROUP_FIRST_ELEMENT (vinfo_for_stmt (stmt)); |
b5aeb3bb IR |
910 | if (prev_first_load) |
911 | { | |
912 | /* Check that there are no loads from different interleaving | |
6983e6b5 RB |
913 | chains in the same node. */ |
914 | if (prev_first_load != first_load) | |
78c60e3d | 915 | { |
73fbfcad | 916 | if (dump_enabled_p ()) |
b5aeb3bb | 917 | { |
78c60e3d SS |
918 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, |
919 | vect_location, | |
920 | "Build SLP failed: different " | |
921 | "interleaving chains in one node "); | |
922 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, | |
923 | stmt, 0); | |
b5aeb3bb | 924 | } |
6983e6b5 RB |
925 | /* Mismatch. */ |
926 | continue; | |
b5aeb3bb IR |
927 | } |
928 | } | |
929 | else | |
930 | prev_first_load = first_load; | |
ebfd146a | 931 | } |
0d0293ac | 932 | } /* Grouped access. */ |
ebfd146a IR |
933 | else |
934 | { | |
935 | if (TREE_CODE_CLASS (rhs_code) == tcc_reference) | |
936 | { | |
0d0293ac | 937 | /* Not grouped load. */ |
73fbfcad | 938 | if (dump_enabled_p ()) |
ebfd146a | 939 | { |
78c60e3d SS |
940 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
941 | "Build SLP failed: not grouped load "); | |
942 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, stmt, 0); | |
ebfd146a IR |
943 | } |
944 | ||
0d0293ac | 945 | /* FORNOW: Not grouped loads are not supported. */ |
6983e6b5 RB |
946 | /* Fatal mismatch. */ |
947 | matches[0] = false; | |
ebfd146a IR |
948 | return false; |
949 | } | |
950 | ||
951 | /* Not memory operation. */ | |
952 | if (TREE_CODE_CLASS (rhs_code) != tcc_binary | |
f7e531cf | 953 | && TREE_CODE_CLASS (rhs_code) != tcc_unary |
effb52da | 954 | && TREE_CODE_CLASS (rhs_code) != tcc_expression |
42fd8198 | 955 | && TREE_CODE_CLASS (rhs_code) != tcc_comparison |
190c2236 | 956 | && rhs_code != CALL_EXPR) |
ebfd146a | 957 | { |
73fbfcad | 958 | if (dump_enabled_p ()) |
ebfd146a | 959 | { |
78c60e3d SS |
960 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
961 | "Build SLP failed: operation"); | |
962 | dump_printf (MSG_MISSED_OPTIMIZATION, " unsupported "); | |
963 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, stmt, 0); | |
ebfd146a | 964 | } |
6983e6b5 RB |
965 | /* Fatal mismatch. */ |
966 | matches[0] = false; | |
ebfd146a IR |
967 | return false; |
968 | } | |
969 | ||
4cecd659 BC |
970 | if (rhs_code == COND_EXPR) |
971 | { | |
972 | tree cond_expr = gimple_assign_rhs1 (stmt); | |
973 | enum tree_code cond_code = TREE_CODE (cond_expr); | |
974 | enum tree_code swap_code = ERROR_MARK; | |
975 | enum tree_code invert_code = ERROR_MARK; | |
f7e531cf IR |
976 | |
977 | if (i == 0) | |
978 | first_cond_code = TREE_CODE (cond_expr); | |
4cecd659 BC |
979 | else if (TREE_CODE_CLASS (cond_code) == tcc_comparison) |
980 | { | |
981 | bool honor_nans = HONOR_NANS (TREE_OPERAND (cond_expr, 0)); | |
982 | swap_code = swap_tree_comparison (cond_code); | |
983 | invert_code = invert_tree_comparison (cond_code, honor_nans); | |
984 | } | |
985 | ||
986 | if (first_cond_code == cond_code) | |
987 | ; | |
988 | /* Isomorphic can be achieved by swapping. */ | |
989 | else if (first_cond_code == swap_code) | |
990 | swap[i] = 1; | |
991 | /* Isomorphic can be achieved by inverting. */ | |
992 | else if (first_cond_code == invert_code) | |
993 | swap[i] = 2; | |
994 | else | |
995 | { | |
996 | if (dump_enabled_p ()) | |
997 | { | |
998 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, | |
78c60e3d SS |
999 | "Build SLP failed: different" |
1000 | " operation"); | |
4cecd659 | 1001 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, |
78c60e3d | 1002 | stmt, 0); |
4cecd659 | 1003 | } |
6983e6b5 RB |
1004 | /* Mismatch. */ |
1005 | continue; | |
f7e531cf | 1006 | } |
4cecd659 | 1007 | } |
ebfd146a | 1008 | } |
6983e6b5 RB |
1009 | |
1010 | matches[i] = true; | |
1011 | } | |
1012 | ||
1013 | for (i = 0; i < group_size; ++i) | |
1014 | if (!matches[i]) | |
1015 | return false; | |
1016 | ||
6876e5bc RB |
1017 | /* If we allowed a two-operation SLP node verify the target can cope |
1018 | with the permute we are going to use. */ | |
1019 | if (alt_stmt_code != ERROR_MARK | |
1020 | && TREE_CODE_CLASS (alt_stmt_code) != tcc_reference) | |
1021 | { | |
1f3cb663 RS |
1022 | if (vectype == boolean_type_node |
1023 | || !vect_two_operations_perm_ok_p (stmts, group_size, | |
1024 | vectype, alt_stmt_code)) | |
6876e5bc RB |
1025 | { |
1026 | for (i = 0; i < group_size; ++i) | |
1027 | if (gimple_assign_rhs_code (stmts[i]) == alt_stmt_code) | |
1028 | { | |
1029 | matches[i] = false; | |
1030 | if (dump_enabled_p ()) | |
1031 | { | |
1032 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, | |
1033 | "Build SLP failed: different operation " | |
1034 | "in stmt "); | |
1035 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, | |
1036 | stmts[i], 0); | |
1037 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, | |
1038 | "original stmt "); | |
1039 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, | |
1040 | first_stmt, 0); | |
1041 | } | |
1042 | } | |
1043 | return false; | |
1044 | } | |
1045 | *two_operators = true; | |
1046 | } | |
1047 | ||
6983e6b5 RB |
1048 | return true; |
1049 | } | |
1050 | ||
26d66f28 RB |
1051 | /* Traits for the hash_set to record failed SLP builds for a stmt set. |
1052 | Note we never remove apart from at destruction time so we do not | |
1053 | need a special value for deleted that differs from empty. */ | |
1054 | struct bst_traits | |
1055 | { | |
1056 | typedef vec <gimple *> value_type; | |
1057 | typedef vec <gimple *> compare_type; | |
1058 | static inline hashval_t hash (value_type); | |
1059 | static inline bool equal (value_type existing, value_type candidate); | |
1060 | static inline bool is_empty (value_type x) { return !x.exists (); } | |
1061 | static inline bool is_deleted (value_type x) { return !x.exists (); } | |
1062 | static inline void mark_empty (value_type &x) { x.release (); } | |
1063 | static inline void mark_deleted (value_type &x) { x.release (); } | |
1064 | static inline void remove (value_type &x) { x.release (); } | |
1065 | }; | |
1066 | inline hashval_t | |
1067 | bst_traits::hash (value_type x) | |
1068 | { | |
1069 | inchash::hash h; | |
1070 | for (unsigned i = 0; i < x.length (); ++i) | |
1071 | h.add_int (gimple_uid (x[i])); | |
1072 | return h.end (); | |
1073 | } | |
1074 | inline bool | |
1075 | bst_traits::equal (value_type existing, value_type candidate) | |
1076 | { | |
1077 | if (existing.length () != candidate.length ()) | |
1078 | return false; | |
1079 | for (unsigned i = 0; i < existing.length (); ++i) | |
1080 | if (existing[i] != candidate[i]) | |
1081 | return false; | |
1082 | return true; | |
1083 | } | |
1084 | ||
f7300fff RB |
1085 | typedef hash_set <vec <gimple *>, bst_traits> scalar_stmts_set_t; |
1086 | static scalar_stmts_set_t *bst_fail; | |
26d66f28 | 1087 | |
68435eb2 RB |
1088 | typedef hash_map <vec <gimple *>, slp_tree, |
1089 | simple_hashmap_traits <bst_traits, slp_tree> > | |
1090 | scalar_stmts_to_slp_tree_map_t; | |
1091 | ||
26d66f28 RB |
1092 | static slp_tree |
1093 | vect_build_slp_tree_2 (vec_info *vinfo, | |
1094 | vec<gimple *> stmts, unsigned int group_size, | |
4b6068ea | 1095 | poly_uint64 *max_nunits, |
26d66f28 RB |
1096 | vec<slp_tree> *loads, |
1097 | bool *matches, unsigned *npermutes, unsigned *tree_size, | |
1098 | unsigned max_tree_size); | |
6983e6b5 | 1099 | |
e403d17e | 1100 | static slp_tree |
310213d4 | 1101 | vect_build_slp_tree (vec_info *vinfo, |
4b6068ea RS |
1102 | vec<gimple *> stmts, unsigned int group_size, |
1103 | poly_uint64 *max_nunits, vec<slp_tree> *loads, | |
1428105c RB |
1104 | bool *matches, unsigned *npermutes, unsigned *tree_size, |
1105 | unsigned max_tree_size) | |
26d66f28 RB |
1106 | { |
1107 | if (bst_fail->contains (stmts)) | |
1108 | return NULL; | |
1109 | slp_tree res = vect_build_slp_tree_2 (vinfo, stmts, group_size, max_nunits, | |
1110 | loads, matches, npermutes, tree_size, | |
1111 | max_tree_size); | |
1112 | /* When SLP build fails for stmts record this, otherwise SLP build | |
1113 | can be exponential in time when we allow to construct parts from | |
1114 | scalars, see PR81723. */ | |
1115 | if (! res) | |
1116 | { | |
1117 | vec <gimple *> x; | |
1118 | x.create (stmts.length ()); | |
1119 | x.splice (stmts); | |
1120 | bst_fail->add (x); | |
1121 | } | |
1122 | return res; | |
1123 | } | |
1124 | ||
1125 | /* Recursively build an SLP tree starting from NODE. | |
1126 | Fail (and return a value not equal to zero) if def-stmts are not | |
1127 | isomorphic, require data permutation or are of unsupported types of | |
1128 | operation. Otherwise, return 0. | |
1129 | The value returned is the depth in the SLP tree where a mismatch | |
1130 | was found. */ | |
1131 | ||
1132 | static slp_tree | |
1133 | vect_build_slp_tree_2 (vec_info *vinfo, | |
1134 | vec<gimple *> stmts, unsigned int group_size, | |
4b6068ea | 1135 | poly_uint64 *max_nunits, |
26d66f28 RB |
1136 | vec<slp_tree> *loads, |
1137 | bool *matches, unsigned *npermutes, unsigned *tree_size, | |
1138 | unsigned max_tree_size) | |
6983e6b5 | 1139 | { |
4b6068ea RS |
1140 | unsigned nops, i, this_tree_size = 0; |
1141 | poly_uint64 this_max_nunits = *max_nunits; | |
355fe088 | 1142 | gimple *stmt; |
e403d17e | 1143 | slp_tree node; |
6983e6b5 | 1144 | |
6983e6b5 RB |
1145 | matches[0] = false; |
1146 | ||
e403d17e | 1147 | stmt = stmts[0]; |
6983e6b5 RB |
1148 | if (is_gimple_call (stmt)) |
1149 | nops = gimple_call_num_args (stmt); | |
1150 | else if (is_gimple_assign (stmt)) | |
1151 | { | |
1152 | nops = gimple_num_ops (stmt) - 1; | |
1153 | if (gimple_assign_rhs_code (stmt) == COND_EXPR) | |
1154 | nops++; | |
ebfd146a | 1155 | } |
e7baeb39 RB |
1156 | else if (gimple_code (stmt) == GIMPLE_PHI) |
1157 | nops = 0; | |
6983e6b5 | 1158 | else |
e403d17e | 1159 | return NULL; |
6983e6b5 | 1160 | |
c78e3652 RB |
1161 | /* If the SLP node is a PHI (induction or reduction), terminate |
1162 | the recursion. */ | |
e7baeb39 RB |
1163 | if (gimple_code (stmt) == GIMPLE_PHI) |
1164 | { | |
b161f2c9 RS |
1165 | tree scalar_type = TREE_TYPE (PHI_RESULT (stmt)); |
1166 | tree vectype = get_vectype_for_scalar_type (scalar_type); | |
1167 | if (!vect_record_max_nunits (vinfo, stmt, group_size, vectype, | |
1168 | max_nunits)) | |
1169 | return NULL; | |
1170 | ||
719488f8 | 1171 | vect_def_type def_type = STMT_VINFO_DEF_TYPE (vinfo_for_stmt (stmt)); |
c78e3652 | 1172 | /* Induction from different IVs is not supported. */ |
719488f8 RB |
1173 | if (def_type == vect_induction_def) |
1174 | { | |
1175 | FOR_EACH_VEC_ELT (stmts, i, stmt) | |
1176 | if (stmt != stmts[0]) | |
1177 | return NULL; | |
1178 | } | |
1179 | else | |
1180 | { | |
1181 | /* Else def types have to match. */ | |
1182 | FOR_EACH_VEC_ELT (stmts, i, stmt) | |
1183 | { | |
1184 | /* But for reduction chains only check on the first stmt. */ | |
1185 | if (GROUP_FIRST_ELEMENT (vinfo_for_stmt (stmt)) | |
1186 | && GROUP_FIRST_ELEMENT (vinfo_for_stmt (stmt)) != stmt) | |
1187 | continue; | |
1188 | if (STMT_VINFO_DEF_TYPE (vinfo_for_stmt (stmt)) != def_type) | |
1189 | return NULL; | |
1190 | } | |
1191 | } | |
e7baeb39 RB |
1192 | node = vect_create_new_slp_node (stmts); |
1193 | return node; | |
1194 | } | |
1195 | ||
1196 | ||
6876e5bc | 1197 | bool two_operators = false; |
4cecd659 BC |
1198 | unsigned char *swap = XALLOCAVEC (unsigned char, group_size); |
1199 | if (!vect_build_slp_tree_1 (vinfo, swap, | |
e403d17e RB |
1200 | stmts, group_size, nops, |
1201 | &this_max_nunits, matches, &two_operators)) | |
1202 | return NULL; | |
ebfd146a | 1203 | |
6983e6b5 RB |
1204 | /* If the SLP node is a load, terminate the recursion. */ |
1205 | if (STMT_VINFO_GROUPED_ACCESS (vinfo_for_stmt (stmt)) | |
1206 | && DR_IS_READ (STMT_VINFO_DATA_REF (vinfo_for_stmt (stmt)))) | |
ebfd146a | 1207 | { |
e403d17e RB |
1208 | *max_nunits = this_max_nunits; |
1209 | node = vect_create_new_slp_node (stmts); | |
1210 | loads->safe_push (node); | |
1211 | return node; | |
ebfd146a IR |
1212 | } |
1213 | ||
6983e6b5 RB |
1214 | /* Get at the operands, verifying they are compatible. */ |
1215 | vec<slp_oprnd_info> oprnds_info = vect_create_oprnd_info (nops, group_size); | |
1216 | slp_oprnd_info oprnd_info; | |
e403d17e | 1217 | FOR_EACH_VEC_ELT (stmts, i, stmt) |
6983e6b5 | 1218 | { |
4cecd659 | 1219 | int res = vect_get_and_check_slp_defs (vinfo, &swap[i], |
018b2744 | 1220 | stmts, i, &oprnds_info); |
4cecd659 BC |
1221 | if (res != 0) |
1222 | matches[(res == -1) ? 0 : i] = false; | |
1223 | if (!matches[0]) | |
1224 | break; | |
6983e6b5 | 1225 | } |
b0b4483e RB |
1226 | for (i = 0; i < group_size; ++i) |
1227 | if (!matches[i]) | |
1228 | { | |
1229 | vect_free_oprnd_info (oprnds_info); | |
e403d17e | 1230 | return NULL; |
b0b4483e | 1231 | } |
6983e6b5 | 1232 | |
e403d17e RB |
1233 | auto_vec<slp_tree, 4> children; |
1234 | auto_vec<slp_tree> this_loads; | |
1235 | ||
1236 | stmt = stmts[0]; | |
6983e6b5 | 1237 | |
26d66f28 RB |
1238 | if (tree_size) |
1239 | max_tree_size -= *tree_size; | |
1240 | ||
b8698a0f | 1241 | /* Create SLP_TREE nodes for the definition node/s. */ |
9771b263 | 1242 | FOR_EACH_VEC_ELT (oprnds_info, i, oprnd_info) |
ebfd146a | 1243 | { |
d092494c | 1244 | slp_tree child; |
e403d17e RB |
1245 | unsigned old_nloads = this_loads.length (); |
1246 | unsigned old_tree_size = this_tree_size; | |
1247 | unsigned int j; | |
b8698a0f | 1248 | |
e7baeb39 | 1249 | if (oprnd_info->first_dt != vect_internal_def |
c78e3652 | 1250 | && oprnd_info->first_dt != vect_reduction_def |
e7baeb39 | 1251 | && oprnd_info->first_dt != vect_induction_def) |
d092494c | 1252 | continue; |
ebfd146a | 1253 | |
1428105c RB |
1254 | if (++this_tree_size > max_tree_size) |
1255 | { | |
e403d17e RB |
1256 | FOR_EACH_VEC_ELT (children, j, child) |
1257 | vect_free_slp_tree (child); | |
1428105c | 1258 | vect_free_oprnd_info (oprnds_info); |
e403d17e | 1259 | return NULL; |
1428105c RB |
1260 | } |
1261 | ||
e403d17e RB |
1262 | if ((child = vect_build_slp_tree (vinfo, oprnd_info->def_stmts, |
1263 | group_size, &this_max_nunits, | |
1264 | &this_loads, matches, npermutes, | |
1265 | &this_tree_size, | |
1266 | max_tree_size)) != NULL) | |
6983e6b5 | 1267 | { |
3fc356dc RB |
1268 | /* If we have all children of child built up from scalars then just |
1269 | throw that away and build it up this node from scalars. */ | |
995b6fe0 RB |
1270 | if (!SLP_TREE_CHILDREN (child).is_empty () |
1271 | /* ??? Rejecting patterns this way doesn't work. We'd have to | |
1272 | do extra work to cancel the pattern so the uses see the | |
1273 | scalar version. */ | |
1274 | && !is_pattern_stmt_p | |
1275 | (vinfo_for_stmt (SLP_TREE_SCALAR_STMTS (child)[0]))) | |
3fc356dc | 1276 | { |
3fc356dc RB |
1277 | slp_tree grandchild; |
1278 | ||
1279 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (child), j, grandchild) | |
603cca93 | 1280 | if (SLP_TREE_DEF_TYPE (grandchild) == vect_internal_def) |
3fc356dc RB |
1281 | break; |
1282 | if (!grandchild) | |
1283 | { | |
1284 | /* Roll back. */ | |
e403d17e RB |
1285 | this_loads.truncate (old_nloads); |
1286 | this_tree_size = old_tree_size; | |
3fc356dc | 1287 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (child), j, grandchild) |
603cca93 | 1288 | vect_free_slp_tree (grandchild); |
3fc356dc RB |
1289 | SLP_TREE_CHILDREN (child).truncate (0); |
1290 | ||
1291 | dump_printf_loc (MSG_NOTE, vect_location, | |
1292 | "Building parent vector operands from " | |
1293 | "scalars instead\n"); | |
1294 | oprnd_info->def_stmts = vNULL; | |
603cca93 | 1295 | SLP_TREE_DEF_TYPE (child) = vect_external_def; |
e403d17e | 1296 | children.safe_push (child); |
3fc356dc RB |
1297 | continue; |
1298 | } | |
1299 | } | |
1300 | ||
6983e6b5 | 1301 | oprnd_info->def_stmts = vNULL; |
e403d17e | 1302 | children.safe_push (child); |
6983e6b5 RB |
1303 | continue; |
1304 | } | |
1305 | ||
90dd6e3d RB |
1306 | /* If the SLP build failed fatally and we analyze a basic-block |
1307 | simply treat nodes we fail to build as externally defined | |
1308 | (and thus build vectors from the scalar defs). | |
1309 | The cost model will reject outright expensive cases. | |
1310 | ??? This doesn't treat cases where permutation ultimatively | |
1311 | fails (or we don't try permutation below). Ideally we'd | |
1312 | even compute a permutation that will end up with the maximum | |
1313 | SLP tree size... */ | |
310213d4 | 1314 | if (is_a <bb_vec_info> (vinfo) |
90dd6e3d RB |
1315 | && !matches[0] |
1316 | /* ??? Rejecting patterns this way doesn't work. We'd have to | |
1317 | do extra work to cancel the pattern so the uses see the | |
1318 | scalar version. */ | |
1319 | && !is_pattern_stmt_p (vinfo_for_stmt (stmt))) | |
1320 | { | |
1321 | dump_printf_loc (MSG_NOTE, vect_location, | |
1322 | "Building vector operands from scalars\n"); | |
e403d17e | 1323 | child = vect_create_new_slp_node (oprnd_info->def_stmts); |
603cca93 | 1324 | SLP_TREE_DEF_TYPE (child) = vect_external_def; |
e403d17e RB |
1325 | children.safe_push (child); |
1326 | oprnd_info->def_stmts = vNULL; | |
90dd6e3d RB |
1327 | continue; |
1328 | } | |
1329 | ||
6983e6b5 RB |
1330 | /* If the SLP build for operand zero failed and operand zero |
1331 | and one can be commutated try that for the scalar stmts | |
1332 | that failed the match. */ | |
1333 | if (i == 0 | |
1334 | /* A first scalar stmt mismatch signals a fatal mismatch. */ | |
1335 | && matches[0] | |
1336 | /* ??? For COND_EXPRs we can swap the comparison operands | |
1337 | as well as the arms under some constraints. */ | |
1338 | && nops == 2 | |
1339 | && oprnds_info[1]->first_dt == vect_internal_def | |
1340 | && is_gimple_assign (stmt) | |
6983e6b5 RB |
1341 | /* Do so only if the number of not successful permutes was nor more |
1342 | than a cut-ff as re-trying the recursive match on | |
1343 | possibly each level of the tree would expose exponential | |
1344 | behavior. */ | |
1345 | && *npermutes < 4) | |
1346 | { | |
85c5e2f5 RB |
1347 | /* See whether we can swap the matching or the non-matching |
1348 | stmt operands. */ | |
1349 | bool swap_not_matching = true; | |
1350 | do | |
1351 | { | |
1352 | for (j = 0; j < group_size; ++j) | |
1353 | { | |
1354 | if (matches[j] != !swap_not_matching) | |
1355 | continue; | |
1356 | gimple *stmt = stmts[j]; | |
1357 | /* Verify if we can swap operands of this stmt. */ | |
1358 | if (!is_gimple_assign (stmt) | |
1359 | || !commutative_tree_code (gimple_assign_rhs_code (stmt))) | |
1360 | { | |
1361 | if (!swap_not_matching) | |
1362 | goto fail; | |
1363 | swap_not_matching = false; | |
1364 | break; | |
1365 | } | |
1366 | /* Verify if we can safely swap or if we committed to a | |
1367 | specific operand order already. | |
1368 | ??? Instead of modifying GIMPLE stmts here we could | |
1369 | record whether we want to swap operands in the SLP | |
1370 | node and temporarily do that when processing it | |
1371 | (or wrap operand accessors in a helper). */ | |
1372 | else if (swap[j] != 0 | |
1373 | || STMT_VINFO_NUM_SLP_USES (vinfo_for_stmt (stmt))) | |
1374 | { | |
1375 | if (!swap_not_matching) | |
1376 | { | |
1377 | if (dump_enabled_p ()) | |
1378 | { | |
1379 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, | |
1380 | vect_location, | |
1381 | "Build SLP failed: cannot swap " | |
1382 | "operands of shared stmt "); | |
1383 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, | |
1384 | TDF_SLIM, stmts[j], 0); | |
1385 | } | |
1386 | goto fail; | |
1387 | } | |
1388 | swap_not_matching = false; | |
1389 | break; | |
1390 | } | |
1391 | } | |
1392 | } | |
1393 | while (j != group_size); | |
78810bd3 | 1394 | |
6983e6b5 | 1395 | /* Swap mismatched definition stmts. */ |
b0b4483e RB |
1396 | dump_printf_loc (MSG_NOTE, vect_location, |
1397 | "Re-trying with swapped operands of stmts "); | |
e72baed7 | 1398 | for (j = 0; j < group_size; ++j) |
85c5e2f5 | 1399 | if (matches[j] == !swap_not_matching) |
6983e6b5 | 1400 | { |
6b4db501 MM |
1401 | std::swap (oprnds_info[0]->def_stmts[j], |
1402 | oprnds_info[1]->def_stmts[j]); | |
b0b4483e | 1403 | dump_printf (MSG_NOTE, "%d ", j); |
6983e6b5 | 1404 | } |
b0b4483e | 1405 | dump_printf (MSG_NOTE, "\n"); |
74574669 RB |
1406 | /* And try again with scratch 'matches' ... */ |
1407 | bool *tem = XALLOCAVEC (bool, group_size); | |
e403d17e RB |
1408 | if ((child = vect_build_slp_tree (vinfo, oprnd_info->def_stmts, |
1409 | group_size, &this_max_nunits, | |
1410 | &this_loads, tem, npermutes, | |
1411 | &this_tree_size, | |
1412 | max_tree_size)) != NULL) | |
6983e6b5 | 1413 | { |
60f2b864 RB |
1414 | /* ... so if successful we can apply the operand swapping |
1415 | to the GIMPLE IL. This is necessary because for example | |
1416 | vect_get_slp_defs uses operand indexes and thus expects | |
1417 | canonical operand order. This is also necessary even | |
1418 | if we end up building the operand from scalars as | |
1419 | we'll continue to process swapped operand two. */ | |
1420 | for (j = 0; j < group_size; ++j) | |
f47cda24 | 1421 | { |
e403d17e | 1422 | gimple *stmt = stmts[j]; |
f47cda24 RB |
1423 | gimple_set_plf (stmt, GF_PLF_1, false); |
1424 | } | |
1425 | for (j = 0; j < group_size; ++j) | |
1426 | { | |
e403d17e | 1427 | gimple *stmt = stmts[j]; |
85c5e2f5 | 1428 | if (matches[j] == !swap_not_matching) |
f47cda24 RB |
1429 | { |
1430 | /* Avoid swapping operands twice. */ | |
1431 | if (gimple_plf (stmt, GF_PLF_1)) | |
1432 | continue; | |
1433 | swap_ssa_operands (stmt, gimple_assign_rhs1_ptr (stmt), | |
1434 | gimple_assign_rhs2_ptr (stmt)); | |
1435 | gimple_set_plf (stmt, GF_PLF_1, true); | |
1436 | } | |
1437 | } | |
1438 | /* Verify we swap all duplicates or none. */ | |
1439 | if (flag_checking) | |
1440 | for (j = 0; j < group_size; ++j) | |
60f2b864 | 1441 | { |
e403d17e | 1442 | gimple *stmt = stmts[j]; |
85c5e2f5 RB |
1443 | gcc_assert (gimple_plf (stmt, GF_PLF_1) |
1444 | == (matches[j] == !swap_not_matching)); | |
60f2b864 RB |
1445 | } |
1446 | ||
85c69b0b RB |
1447 | /* If we have all children of child built up from scalars then |
1448 | just throw that away and build it up this node from scalars. */ | |
995b6fe0 RB |
1449 | if (!SLP_TREE_CHILDREN (child).is_empty () |
1450 | /* ??? Rejecting patterns this way doesn't work. We'd have | |
1451 | to do extra work to cancel the pattern so the uses see the | |
1452 | scalar version. */ | |
1453 | && !is_pattern_stmt_p | |
1454 | (vinfo_for_stmt (SLP_TREE_SCALAR_STMTS (child)[0]))) | |
85c69b0b RB |
1455 | { |
1456 | unsigned int j; | |
1457 | slp_tree grandchild; | |
1458 | ||
1459 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (child), j, grandchild) | |
603cca93 | 1460 | if (SLP_TREE_DEF_TYPE (grandchild) == vect_internal_def) |
85c69b0b RB |
1461 | break; |
1462 | if (!grandchild) | |
1463 | { | |
1464 | /* Roll back. */ | |
e403d17e RB |
1465 | this_loads.truncate (old_nloads); |
1466 | this_tree_size = old_tree_size; | |
85c69b0b RB |
1467 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (child), j, grandchild) |
1468 | vect_free_slp_tree (grandchild); | |
1469 | SLP_TREE_CHILDREN (child).truncate (0); | |
1470 | ||
1471 | dump_printf_loc (MSG_NOTE, vect_location, | |
1472 | "Building parent vector operands from " | |
1473 | "scalars instead\n"); | |
1474 | oprnd_info->def_stmts = vNULL; | |
603cca93 | 1475 | SLP_TREE_DEF_TYPE (child) = vect_external_def; |
e403d17e | 1476 | children.safe_push (child); |
85c69b0b RB |
1477 | continue; |
1478 | } | |
1479 | } | |
1480 | ||
6983e6b5 | 1481 | oprnd_info->def_stmts = vNULL; |
e403d17e | 1482 | children.safe_push (child); |
6983e6b5 RB |
1483 | continue; |
1484 | } | |
1485 | ||
1486 | ++*npermutes; | |
1487 | } | |
1488 | ||
78810bd3 | 1489 | fail: |
e403d17e RB |
1490 | gcc_assert (child == NULL); |
1491 | FOR_EACH_VEC_ELT (children, j, child) | |
1492 | vect_free_slp_tree (child); | |
6983e6b5 | 1493 | vect_free_oprnd_info (oprnds_info); |
e403d17e | 1494 | return NULL; |
ebfd146a IR |
1495 | } |
1496 | ||
e403d17e RB |
1497 | vect_free_oprnd_info (oprnds_info); |
1498 | ||
1428105c RB |
1499 | if (tree_size) |
1500 | *tree_size += this_tree_size; | |
e403d17e RB |
1501 | *max_nunits = this_max_nunits; |
1502 | loads->safe_splice (this_loads); | |
1428105c | 1503 | |
e403d17e RB |
1504 | node = vect_create_new_slp_node (stmts); |
1505 | SLP_TREE_TWO_OPERATORS (node) = two_operators; | |
1506 | SLP_TREE_CHILDREN (node).splice (children); | |
1507 | return node; | |
ebfd146a IR |
1508 | } |
1509 | ||
78c60e3d | 1510 | /* Dump a slp tree NODE using flags specified in DUMP_KIND. */ |
ebfd146a IR |
1511 | |
1512 | static void | |
1a817418 | 1513 | vect_print_slp_tree (dump_flags_t dump_kind, location_t loc, slp_tree node) |
ebfd146a IR |
1514 | { |
1515 | int i; | |
355fe088 | 1516 | gimple *stmt; |
d755c7ef | 1517 | slp_tree child; |
ebfd146a | 1518 | |
603cca93 RB |
1519 | dump_printf_loc (dump_kind, loc, "node%s\n", |
1520 | SLP_TREE_DEF_TYPE (node) != vect_internal_def | |
1521 | ? " (external)" : ""); | |
9771b263 | 1522 | FOR_EACH_VEC_ELT (SLP_TREE_SCALAR_STMTS (node), i, stmt) |
ebfd146a | 1523 | { |
c2a12ca0 | 1524 | dump_printf_loc (dump_kind, loc, "\tstmt %d ", i); |
78c60e3d | 1525 | dump_gimple_stmt (dump_kind, TDF_SLIM, stmt, 0); |
ebfd146a | 1526 | } |
9771b263 | 1527 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (node), i, child) |
c2a12ca0 | 1528 | vect_print_slp_tree (dump_kind, loc, child); |
ebfd146a IR |
1529 | } |
1530 | ||
1531 | ||
b8698a0f L |
1532 | /* Mark the tree rooted at NODE with MARK (PURE_SLP or HYBRID). |
1533 | If MARK is HYBRID, it refers to a specific stmt in NODE (the stmt at index | |
ff802fa1 | 1534 | J). Otherwise, MARK is PURE_SLP and J is -1, which indicates that all the |
ebfd146a IR |
1535 | stmts in NODE are to be marked. */ |
1536 | ||
1537 | static void | |
1538 | vect_mark_slp_stmts (slp_tree node, enum slp_vect_type mark, int j) | |
1539 | { | |
1540 | int i; | |
355fe088 | 1541 | gimple *stmt; |
d755c7ef | 1542 | slp_tree child; |
ebfd146a | 1543 | |
603cca93 | 1544 | if (SLP_TREE_DEF_TYPE (node) != vect_internal_def) |
ebfd146a IR |
1545 | return; |
1546 | ||
9771b263 | 1547 | FOR_EACH_VEC_ELT (SLP_TREE_SCALAR_STMTS (node), i, stmt) |
ebfd146a IR |
1548 | if (j < 0 || i == j) |
1549 | STMT_SLP_TYPE (vinfo_for_stmt (stmt)) = mark; | |
1550 | ||
9771b263 | 1551 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (node), i, child) |
d755c7ef | 1552 | vect_mark_slp_stmts (child, mark, j); |
ebfd146a IR |
1553 | } |
1554 | ||
1555 | ||
a70d6342 IR |
1556 | /* Mark the statements of the tree rooted at NODE as relevant (vect_used). */ |
1557 | ||
1558 | static void | |
1559 | vect_mark_slp_stmts_relevant (slp_tree node) | |
1560 | { | |
1561 | int i; | |
355fe088 | 1562 | gimple *stmt; |
a70d6342 | 1563 | stmt_vec_info stmt_info; |
d755c7ef | 1564 | slp_tree child; |
a70d6342 | 1565 | |
603cca93 | 1566 | if (SLP_TREE_DEF_TYPE (node) != vect_internal_def) |
a70d6342 IR |
1567 | return; |
1568 | ||
9771b263 | 1569 | FOR_EACH_VEC_ELT (SLP_TREE_SCALAR_STMTS (node), i, stmt) |
a70d6342 IR |
1570 | { |
1571 | stmt_info = vinfo_for_stmt (stmt); | |
b8698a0f | 1572 | gcc_assert (!STMT_VINFO_RELEVANT (stmt_info) |
a70d6342 IR |
1573 | || STMT_VINFO_RELEVANT (stmt_info) == vect_used_in_scope); |
1574 | STMT_VINFO_RELEVANT (stmt_info) = vect_used_in_scope; | |
1575 | } | |
1576 | ||
9771b263 | 1577 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (node), i, child) |
d755c7ef | 1578 | vect_mark_slp_stmts_relevant (child); |
a70d6342 IR |
1579 | } |
1580 | ||
1581 | ||
b5aeb3bb IR |
1582 | /* Rearrange the statements of NODE according to PERMUTATION. */ |
1583 | ||
1584 | static void | |
1585 | vect_slp_rearrange_stmts (slp_tree node, unsigned int group_size, | |
01d8bf07 | 1586 | vec<unsigned> permutation) |
b5aeb3bb | 1587 | { |
355fe088 TS |
1588 | gimple *stmt; |
1589 | vec<gimple *> tmp_stmts; | |
d755c7ef RB |
1590 | unsigned int i; |
1591 | slp_tree child; | |
b5aeb3bb | 1592 | |
9771b263 | 1593 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (node), i, child) |
d755c7ef | 1594 | vect_slp_rearrange_stmts (child, group_size, permutation); |
b5aeb3bb | 1595 | |
9771b263 DN |
1596 | gcc_assert (group_size == SLP_TREE_SCALAR_STMTS (node).length ()); |
1597 | tmp_stmts.create (group_size); | |
d755c7ef | 1598 | tmp_stmts.quick_grow_cleared (group_size); |
b5aeb3bb | 1599 | |
9771b263 | 1600 | FOR_EACH_VEC_ELT (SLP_TREE_SCALAR_STMTS (node), i, stmt) |
d755c7ef | 1601 | tmp_stmts[permutation[i]] = stmt; |
b5aeb3bb | 1602 | |
9771b263 | 1603 | SLP_TREE_SCALAR_STMTS (node).release (); |
b5aeb3bb IR |
1604 | SLP_TREE_SCALAR_STMTS (node) = tmp_stmts; |
1605 | } | |
1606 | ||
1607 | ||
b266b968 RB |
1608 | /* Attempt to reorder stmts in a reduction chain so that we don't |
1609 | require any load permutation. Return true if that was possible, | |
1610 | otherwise return false. */ | |
1611 | ||
1612 | static bool | |
1613 | vect_attempt_slp_rearrange_stmts (slp_instance slp_instn) | |
1614 | { | |
1615 | unsigned int group_size = SLP_INSTANCE_GROUP_SIZE (slp_instn); | |
1616 | unsigned int i, j; | |
b266b968 RB |
1617 | unsigned int lidx; |
1618 | slp_tree node, load; | |
1619 | ||
1620 | /* Compare all the permutation sequences to the first one. We know | |
1621 | that at least one load is permuted. */ | |
1622 | node = SLP_INSTANCE_LOADS (slp_instn)[0]; | |
1623 | if (!node->load_permutation.exists ()) | |
1624 | return false; | |
1625 | for (i = 1; SLP_INSTANCE_LOADS (slp_instn).iterate (i, &load); ++i) | |
1626 | { | |
1627 | if (!load->load_permutation.exists ()) | |
1628 | return false; | |
1629 | FOR_EACH_VEC_ELT (load->load_permutation, j, lidx) | |
1630 | if (lidx != node->load_permutation[j]) | |
1631 | return false; | |
1632 | } | |
1633 | ||
1634 | /* Check that the loads in the first sequence are different and there | |
1635 | are no gaps between them. */ | |
7ba9e72d | 1636 | auto_sbitmap load_index (group_size); |
b266b968 RB |
1637 | bitmap_clear (load_index); |
1638 | FOR_EACH_VEC_ELT (node->load_permutation, i, lidx) | |
1639 | { | |
41eefe13 | 1640 | if (lidx >= group_size) |
7ba9e72d | 1641 | return false; |
b266b968 | 1642 | if (bitmap_bit_p (load_index, lidx)) |
7ba9e72d TS |
1643 | return false; |
1644 | ||
b266b968 RB |
1645 | bitmap_set_bit (load_index, lidx); |
1646 | } | |
1647 | for (i = 0; i < group_size; i++) | |
1648 | if (!bitmap_bit_p (load_index, i)) | |
7ba9e72d | 1649 | return false; |
b266b968 RB |
1650 | |
1651 | /* This permutation is valid for reduction. Since the order of the | |
1652 | statements in the nodes is not important unless they are memory | |
1653 | accesses, we can rearrange the statements in all the nodes | |
1654 | according to the order of the loads. */ | |
1655 | vect_slp_rearrange_stmts (SLP_INSTANCE_TREE (slp_instn), group_size, | |
1656 | node->load_permutation); | |
1657 | ||
1658 | /* We are done, no actual permutations need to be generated. */ | |
d9f21f6a | 1659 | poly_uint64 unrolling_factor = SLP_INSTANCE_UNROLLING_FACTOR (slp_instn); |
b266b968 | 1660 | FOR_EACH_VEC_ELT (SLP_INSTANCE_LOADS (slp_instn), i, node) |
c4e360f4 RB |
1661 | { |
1662 | gimple *first_stmt = SLP_TREE_SCALAR_STMTS (node)[0]; | |
1663 | first_stmt = GROUP_FIRST_ELEMENT (vinfo_for_stmt (first_stmt)); | |
1664 | /* But we have to keep those permutations that are required because | |
1665 | of handling of gaps. */ | |
d9f21f6a | 1666 | if (known_eq (unrolling_factor, 1U) |
c4e360f4 RB |
1667 | || (group_size == GROUP_SIZE (vinfo_for_stmt (first_stmt)) |
1668 | && GROUP_GAP (vinfo_for_stmt (first_stmt)) == 0)) | |
1669 | SLP_TREE_LOAD_PERMUTATION (node).release (); | |
cbd400b4 RB |
1670 | else |
1671 | for (j = 0; j < SLP_TREE_LOAD_PERMUTATION (node).length (); ++j) | |
1672 | SLP_TREE_LOAD_PERMUTATION (node)[j] = j; | |
c4e360f4 RB |
1673 | } |
1674 | ||
b266b968 RB |
1675 | return true; |
1676 | } | |
1677 | ||
01d8bf07 RB |
1678 | /* Check if the required load permutations in the SLP instance |
1679 | SLP_INSTN are supported. */ | |
ebfd146a IR |
1680 | |
1681 | static bool | |
01d8bf07 | 1682 | vect_supported_load_permutation_p (slp_instance slp_instn) |
ebfd146a | 1683 | { |
01d8bf07 RB |
1684 | unsigned int group_size = SLP_INSTANCE_GROUP_SIZE (slp_instn); |
1685 | unsigned int i, j, k, next; | |
6983e6b5 | 1686 | slp_tree node; |
a5b50aa1 | 1687 | gimple *stmt, *load, *next_load; |
ebfd146a | 1688 | |
73fbfcad | 1689 | if (dump_enabled_p ()) |
ebfd146a | 1690 | { |
78c60e3d | 1691 | dump_printf_loc (MSG_NOTE, vect_location, "Load permutation "); |
01d8bf07 RB |
1692 | FOR_EACH_VEC_ELT (SLP_INSTANCE_LOADS (slp_instn), i, node) |
1693 | if (node->load_permutation.exists ()) | |
1694 | FOR_EACH_VEC_ELT (node->load_permutation, j, next) | |
1695 | dump_printf (MSG_NOTE, "%d ", next); | |
1696 | else | |
bddc974e TJ |
1697 | for (k = 0; k < group_size; ++k) |
1698 | dump_printf (MSG_NOTE, "%d ", k); | |
e645e942 | 1699 | dump_printf (MSG_NOTE, "\n"); |
ebfd146a IR |
1700 | } |
1701 | ||
b5aeb3bb IR |
1702 | /* In case of reduction every load permutation is allowed, since the order |
1703 | of the reduction statements is not important (as opposed to the case of | |
0d0293ac | 1704 | grouped stores). The only condition we need to check is that all the |
b5aeb3bb IR |
1705 | load nodes are of the same size and have the same permutation (and then |
1706 | rearrange all the nodes of the SLP instance according to this | |
1707 | permutation). */ | |
1708 | ||
1709 | /* Check that all the load nodes are of the same size. */ | |
01d8bf07 | 1710 | /* ??? Can't we assert this? */ |
9771b263 | 1711 | FOR_EACH_VEC_ELT (SLP_INSTANCE_LOADS (slp_instn), i, node) |
6983e6b5 RB |
1712 | if (SLP_TREE_SCALAR_STMTS (node).length () != (unsigned) group_size) |
1713 | return false; | |
2200fc49 | 1714 | |
b5aeb3bb | 1715 | node = SLP_INSTANCE_TREE (slp_instn); |
9771b263 | 1716 | stmt = SLP_TREE_SCALAR_STMTS (node)[0]; |
b5aeb3bb | 1717 | |
b010117a | 1718 | /* Reduction (there are no data-refs in the root). |
b266b968 | 1719 | In reduction chain the order of the loads is not important. */ |
b010117a IR |
1720 | if (!STMT_VINFO_DATA_REF (vinfo_for_stmt (stmt)) |
1721 | && !GROUP_FIRST_ELEMENT (vinfo_for_stmt (stmt))) | |
c4e360f4 | 1722 | vect_attempt_slp_rearrange_stmts (slp_instn); |
b5aeb3bb | 1723 | |
6aa904c4 IR |
1724 | /* In basic block vectorization we allow any subchain of an interleaving |
1725 | chain. | |
1726 | FORNOW: not supported in loop SLP because of realignment compications. */ | |
01d8bf07 | 1727 | if (STMT_VINFO_BB_VINFO (vinfo_for_stmt (stmt))) |
6aa904c4 | 1728 | { |
240a94da RB |
1729 | /* Check whether the loads in an instance form a subchain and thus |
1730 | no permutation is necessary. */ | |
9771b263 | 1731 | FOR_EACH_VEC_ELT (SLP_INSTANCE_LOADS (slp_instn), i, node) |
6aa904c4 | 1732 | { |
9626d143 RB |
1733 | if (!SLP_TREE_LOAD_PERMUTATION (node).exists ()) |
1734 | continue; | |
240a94da | 1735 | bool subchain_p = true; |
6aa904c4 | 1736 | next_load = NULL; |
9771b263 | 1737 | FOR_EACH_VEC_ELT (SLP_TREE_SCALAR_STMTS (node), j, load) |
6aa904c4 | 1738 | { |
5b5826c4 RB |
1739 | if (j != 0 |
1740 | && (next_load != load | |
1741 | || GROUP_GAP (vinfo_for_stmt (load)) != 1)) | |
240a94da RB |
1742 | { |
1743 | subchain_p = false; | |
1744 | break; | |
1745 | } | |
6aa904c4 IR |
1746 | next_load = GROUP_NEXT_ELEMENT (vinfo_for_stmt (load)); |
1747 | } | |
240a94da RB |
1748 | if (subchain_p) |
1749 | SLP_TREE_LOAD_PERMUTATION (node).release (); | |
1750 | else | |
1751 | { | |
fe73a332 RB |
1752 | stmt_vec_info group_info |
1753 | = vinfo_for_stmt (SLP_TREE_SCALAR_STMTS (node)[0]); | |
1754 | group_info = vinfo_for_stmt (GROUP_FIRST_ELEMENT (group_info)); | |
928686b1 | 1755 | unsigned HOST_WIDE_INT nunits; |
fe73a332 RB |
1756 | unsigned k, maxk = 0; |
1757 | FOR_EACH_VEC_ELT (SLP_TREE_LOAD_PERMUTATION (node), j, k) | |
1758 | if (k > maxk) | |
1759 | maxk = k; | |
1760 | /* In BB vectorization we may not actually use a loaded vector | |
1761 | accessing elements in excess of GROUP_SIZE. */ | |
928686b1 RS |
1762 | tree vectype = STMT_VINFO_VECTYPE (group_info); |
1763 | if (!TYPE_VECTOR_SUBPARTS (vectype).is_constant (&nunits) | |
1764 | || maxk >= (GROUP_SIZE (group_info) & ~(nunits - 1))) | |
fe73a332 RB |
1765 | { |
1766 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, | |
1767 | "BB vectorization with gaps at the end of " | |
1768 | "a load is not supported\n"); | |
1769 | return false; | |
1770 | } | |
1771 | ||
240a94da RB |
1772 | /* Verify the permutation can be generated. */ |
1773 | vec<tree> tem; | |
29afecdf | 1774 | unsigned n_perms; |
240a94da | 1775 | if (!vect_transform_slp_perm_load (node, tem, NULL, |
29afecdf | 1776 | 1, slp_instn, true, &n_perms)) |
240a94da RB |
1777 | { |
1778 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, | |
1779 | vect_location, | |
1780 | "unsupported load permutation\n"); | |
1781 | return false; | |
1782 | } | |
1783 | } | |
6aa904c4 | 1784 | } |
01d8bf07 | 1785 | return true; |
6aa904c4 IR |
1786 | } |
1787 | ||
31bee964 RB |
1788 | /* For loop vectorization verify we can generate the permutation. Be |
1789 | conservative about the vectorization factor, there are permutations | |
1790 | that will use three vector inputs only starting from a specific factor | |
1791 | and the vectorization factor is not yet final. | |
1792 | ??? The SLP instance unrolling factor might not be the maximum one. */ | |
29afecdf | 1793 | unsigned n_perms; |
d9f21f6a RS |
1794 | poly_uint64 test_vf |
1795 | = force_common_multiple (SLP_INSTANCE_UNROLLING_FACTOR (slp_instn), | |
31bee964 | 1796 | LOOP_VINFO_VECT_FACTOR |
d9f21f6a | 1797 | (STMT_VINFO_LOOP_VINFO (vinfo_for_stmt (stmt)))); |
01d8bf07 RB |
1798 | FOR_EACH_VEC_ELT (SLP_INSTANCE_LOADS (slp_instn), i, node) |
1799 | if (node->load_permutation.exists () | |
31bee964 RB |
1800 | && !vect_transform_slp_perm_load (node, vNULL, NULL, test_vf, |
1801 | slp_instn, true, &n_perms)) | |
01d8bf07 | 1802 | return false; |
9b999e8c | 1803 | |
01d8bf07 | 1804 | return true; |
ebfd146a IR |
1805 | } |
1806 | ||
1807 | ||
e4a707c4 | 1808 | /* Find the last store in SLP INSTANCE. */ |
ff802fa1 | 1809 | |
64900538 | 1810 | gimple * |
2e8ab70c | 1811 | vect_find_last_scalar_stmt_in_slp (slp_tree node) |
e4a707c4 | 1812 | { |
355fe088 | 1813 | gimple *last = NULL, *stmt; |
e4a707c4 | 1814 | |
2e8ab70c RB |
1815 | for (int i = 0; SLP_TREE_SCALAR_STMTS (node).iterate (i, &stmt); i++) |
1816 | { | |
1817 | stmt_vec_info stmt_vinfo = vinfo_for_stmt (stmt); | |
1818 | if (is_pattern_stmt_p (stmt_vinfo)) | |
1819 | last = get_later_stmt (STMT_VINFO_RELATED_STMT (stmt_vinfo), last); | |
1820 | else | |
1821 | last = get_later_stmt (stmt, last); | |
1822 | } | |
e4a707c4 | 1823 | |
2e8ab70c | 1824 | return last; |
e4a707c4 IR |
1825 | } |
1826 | ||
1ba91a49 AL |
1827 | /* Splits a group of stores, currently beginning at FIRST_STMT, into two groups: |
1828 | one (still beginning at FIRST_STMT) of size GROUP1_SIZE (also containing | |
1829 | the first GROUP1_SIZE stmts, since stores are consecutive), the second | |
1830 | containing the remainder. | |
1831 | Return the first stmt in the second group. */ | |
1832 | ||
1833 | static gimple * | |
1834 | vect_split_slp_store_group (gimple *first_stmt, unsigned group1_size) | |
1835 | { | |
1836 | stmt_vec_info first_vinfo = vinfo_for_stmt (first_stmt); | |
1837 | gcc_assert (GROUP_FIRST_ELEMENT (first_vinfo) == first_stmt); | |
1838 | gcc_assert (group1_size > 0); | |
1839 | int group2_size = GROUP_SIZE (first_vinfo) - group1_size; | |
1840 | gcc_assert (group2_size > 0); | |
1841 | GROUP_SIZE (first_vinfo) = group1_size; | |
1842 | ||
1843 | gimple *stmt = first_stmt; | |
1844 | for (unsigned i = group1_size; i > 1; i--) | |
1845 | { | |
1846 | stmt = GROUP_NEXT_ELEMENT (vinfo_for_stmt (stmt)); | |
1847 | gcc_assert (GROUP_GAP (vinfo_for_stmt (stmt)) == 1); | |
1848 | } | |
1849 | /* STMT is now the last element of the first group. */ | |
1850 | gimple *group2 = GROUP_NEXT_ELEMENT (vinfo_for_stmt (stmt)); | |
1851 | GROUP_NEXT_ELEMENT (vinfo_for_stmt (stmt)) = 0; | |
1852 | ||
1853 | GROUP_SIZE (vinfo_for_stmt (group2)) = group2_size; | |
1854 | for (stmt = group2; stmt; stmt = GROUP_NEXT_ELEMENT (vinfo_for_stmt (stmt))) | |
1855 | { | |
1856 | GROUP_FIRST_ELEMENT (vinfo_for_stmt (stmt)) = group2; | |
1857 | gcc_assert (GROUP_GAP (vinfo_for_stmt (stmt)) == 1); | |
1858 | } | |
1859 | ||
1860 | /* For the second group, the GROUP_GAP is that before the original group, | |
1861 | plus skipping over the first vector. */ | |
1862 | GROUP_GAP (vinfo_for_stmt (group2)) = | |
1863 | GROUP_GAP (first_vinfo) + group1_size; | |
1864 | ||
1865 | /* GROUP_GAP of the first group now has to skip over the second group too. */ | |
1866 | GROUP_GAP (first_vinfo) += group2_size; | |
1867 | ||
1868 | if (dump_enabled_p ()) | |
1869 | dump_printf_loc (MSG_NOTE, vect_location, "Split group into %d and %d\n", | |
1870 | group1_size, group2_size); | |
1871 | ||
1872 | return group2; | |
1873 | } | |
1874 | ||
4b6068ea RS |
1875 | /* Calculate the unrolling factor for an SLP instance with GROUP_SIZE |
1876 | statements and a vector of NUNITS elements. */ | |
1877 | ||
1878 | static poly_uint64 | |
1879 | calculate_unrolling_factor (poly_uint64 nunits, unsigned int group_size) | |
1880 | { | |
1881 | return exact_div (common_multiple (nunits, group_size), group_size); | |
1882 | } | |
1883 | ||
0d0293ac | 1884 | /* Analyze an SLP instance starting from a group of grouped stores. Call |
b8698a0f | 1885 | vect_build_slp_tree to build a tree of packed stmts if possible. |
ebfd146a IR |
1886 | Return FALSE if it's impossible to SLP any stmt in the loop. */ |
1887 | ||
1888 | static bool | |
310213d4 | 1889 | vect_analyze_slp_instance (vec_info *vinfo, |
355fe088 | 1890 | gimple *stmt, unsigned max_tree_size) |
ebfd146a IR |
1891 | { |
1892 | slp_instance new_instance; | |
d092494c | 1893 | slp_tree node; |
e14c1050 | 1894 | unsigned int group_size = GROUP_SIZE (vinfo_for_stmt (stmt)); |
b5aeb3bb | 1895 | tree vectype, scalar_type = NULL_TREE; |
355fe088 | 1896 | gimple *next; |
1ba91a49 | 1897 | unsigned int i; |
9771b263 | 1898 | vec<slp_tree> loads; |
b5aeb3bb | 1899 | struct data_reference *dr = STMT_VINFO_DATA_REF (vinfo_for_stmt (stmt)); |
355fe088 | 1900 | vec<gimple *> scalar_stmts; |
b5aeb3bb | 1901 | |
b010117a | 1902 | if (GROUP_FIRST_ELEMENT (vinfo_for_stmt (stmt))) |
b5aeb3bb | 1903 | { |
b010117a IR |
1904 | if (dr) |
1905 | { | |
1906 | scalar_type = TREE_TYPE (DR_REF (dr)); | |
1907 | vectype = get_vectype_for_scalar_type (scalar_type); | |
1908 | } | |
1909 | else | |
1910 | { | |
310213d4 | 1911 | gcc_assert (is_a <loop_vec_info> (vinfo)); |
b010117a IR |
1912 | vectype = STMT_VINFO_VECTYPE (vinfo_for_stmt (stmt)); |
1913 | } | |
1914 | ||
e14c1050 | 1915 | group_size = GROUP_SIZE (vinfo_for_stmt (stmt)); |
b5aeb3bb IR |
1916 | } |
1917 | else | |
1918 | { | |
310213d4 | 1919 | gcc_assert (is_a <loop_vec_info> (vinfo)); |
b5aeb3bb | 1920 | vectype = STMT_VINFO_VECTYPE (vinfo_for_stmt (stmt)); |
310213d4 | 1921 | group_size = as_a <loop_vec_info> (vinfo)->reductions.length (); |
b5aeb3bb | 1922 | } |
b8698a0f | 1923 | |
ebfd146a IR |
1924 | if (!vectype) |
1925 | { | |
73fbfcad | 1926 | if (dump_enabled_p ()) |
ebfd146a | 1927 | { |
78c60e3d SS |
1928 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
1929 | "Build SLP failed: unsupported data-type "); | |
1930 | dump_generic_expr (MSG_MISSED_OPTIMIZATION, TDF_SLIM, scalar_type); | |
e645e942 | 1931 | dump_printf (MSG_MISSED_OPTIMIZATION, "\n"); |
ebfd146a | 1932 | } |
b5aeb3bb | 1933 | |
ebfd146a IR |
1934 | return false; |
1935 | } | |
4b6068ea | 1936 | poly_uint64 nunits = TYPE_VECTOR_SUBPARTS (vectype); |
a70d6342 | 1937 | |
0d0293ac | 1938 | /* Create a node (a root of the SLP tree) for the packed grouped stores. */ |
9771b263 | 1939 | scalar_stmts.create (group_size); |
ebfd146a | 1940 | next = stmt; |
b010117a | 1941 | if (GROUP_FIRST_ELEMENT (vinfo_for_stmt (stmt))) |
ebfd146a | 1942 | { |
b5aeb3bb IR |
1943 | /* Collect the stores and store them in SLP_TREE_SCALAR_STMTS. */ |
1944 | while (next) | |
1945 | { | |
f7e531cf IR |
1946 | if (STMT_VINFO_IN_PATTERN_P (vinfo_for_stmt (next)) |
1947 | && STMT_VINFO_RELATED_STMT (vinfo_for_stmt (next))) | |
9771b263 DN |
1948 | scalar_stmts.safe_push ( |
1949 | STMT_VINFO_RELATED_STMT (vinfo_for_stmt (next))); | |
f7e531cf | 1950 | else |
9771b263 | 1951 | scalar_stmts.safe_push (next); |
e14c1050 | 1952 | next = GROUP_NEXT_ELEMENT (vinfo_for_stmt (next)); |
b5aeb3bb | 1953 | } |
14a61437 RB |
1954 | /* Mark the first element of the reduction chain as reduction to properly |
1955 | transform the node. In the reduction analysis phase only the last | |
1956 | element of the chain is marked as reduction. */ | |
1957 | if (!STMT_VINFO_GROUPED_ACCESS (vinfo_for_stmt (stmt))) | |
1958 | STMT_VINFO_DEF_TYPE (vinfo_for_stmt (stmt)) = vect_reduction_def; | |
b5aeb3bb IR |
1959 | } |
1960 | else | |
1961 | { | |
1962 | /* Collect reduction statements. */ | |
310213d4 | 1963 | vec<gimple *> reductions = as_a <loop_vec_info> (vinfo)->reductions; |
9771b263 DN |
1964 | for (i = 0; reductions.iterate (i, &next); i++) |
1965 | scalar_stmts.safe_push (next); | |
ebfd146a IR |
1966 | } |
1967 | ||
9771b263 | 1968 | loads.create (group_size); |
ebfd146a IR |
1969 | |
1970 | /* Build the tree for the SLP instance. */ | |
89d390e5 RB |
1971 | bool *matches = XALLOCAVEC (bool, group_size); |
1972 | unsigned npermutes = 0; | |
f7300fff | 1973 | bst_fail = new scalar_stmts_set_t (); |
4b6068ea | 1974 | poly_uint64 max_nunits = nunits; |
e569db5f | 1975 | node = vect_build_slp_tree (vinfo, scalar_stmts, group_size, |
4b6068ea | 1976 | &max_nunits, &loads, matches, &npermutes, |
e569db5f | 1977 | NULL, max_tree_size); |
26d66f28 | 1978 | delete bst_fail; |
e569db5f | 1979 | if (node != NULL) |
ebfd146a | 1980 | { |
4ef69dfc | 1981 | /* Calculate the unrolling factor based on the smallest type. */ |
d9f21f6a | 1982 | poly_uint64 unrolling_factor |
4b6068ea | 1983 | = calculate_unrolling_factor (max_nunits, group_size); |
b8698a0f | 1984 | |
d9f21f6a | 1985 | if (maybe_ne (unrolling_factor, 1U) |
e569db5f VK |
1986 | && is_a <bb_vec_info> (vinfo)) |
1987 | { | |
4b6068ea RS |
1988 | unsigned HOST_WIDE_INT const_max_nunits; |
1989 | if (!max_nunits.is_constant (&const_max_nunits) | |
1990 | || const_max_nunits > group_size) | |
1991 | { | |
1992 | if (dump_enabled_p ()) | |
1993 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, | |
1994 | "Build SLP failed: store group " | |
1995 | "size not a multiple of the vector size " | |
1996 | "in basic block SLP\n"); | |
1997 | vect_free_slp_tree (node); | |
1998 | loads.release (); | |
1999 | return false; | |
2000 | } | |
e569db5f | 2001 | /* Fatal mismatch. */ |
4b6068ea | 2002 | matches[group_size / const_max_nunits * const_max_nunits] = false; |
e569db5f VK |
2003 | vect_free_slp_tree (node); |
2004 | loads.release (); | |
2005 | } | |
2006 | else | |
2007 | { | |
4ef69dfc IR |
2008 | /* Create a new SLP instance. */ |
2009 | new_instance = XNEW (struct _slp_instance); | |
2010 | SLP_INSTANCE_TREE (new_instance) = node; | |
2011 | SLP_INSTANCE_GROUP_SIZE (new_instance) = group_size; | |
ebfd146a | 2012 | SLP_INSTANCE_UNROLLING_FACTOR (new_instance) = unrolling_factor; |
ebfd146a | 2013 | SLP_INSTANCE_LOADS (new_instance) = loads; |
abf9bfbc RB |
2014 | |
2015 | /* Compute the load permutation. */ | |
2016 | slp_tree load_node; | |
2017 | bool loads_permuted = false; | |
abf9bfbc RB |
2018 | FOR_EACH_VEC_ELT (loads, i, load_node) |
2019 | { | |
01d8bf07 | 2020 | vec<unsigned> load_permutation; |
abf9bfbc | 2021 | int j; |
355fe088 | 2022 | gimple *load, *first_stmt; |
01d8bf07 RB |
2023 | bool this_load_permuted = false; |
2024 | load_permutation.create (group_size); | |
6983e6b5 RB |
2025 | first_stmt = GROUP_FIRST_ELEMENT |
2026 | (vinfo_for_stmt (SLP_TREE_SCALAR_STMTS (load_node)[0])); | |
abf9bfbc RB |
2027 | FOR_EACH_VEC_ELT (SLP_TREE_SCALAR_STMTS (load_node), j, load) |
2028 | { | |
e569db5f VK |
2029 | int load_place = vect_get_place_in_interleaving_chain |
2030 | (load, first_stmt); | |
6983e6b5 RB |
2031 | gcc_assert (load_place != -1); |
2032 | if (load_place != j) | |
01d8bf07 | 2033 | this_load_permuted = true; |
abf9bfbc RB |
2034 | load_permutation.safe_push (load_place); |
2035 | } | |
fe2bef71 RB |
2036 | if (!this_load_permuted |
2037 | /* The load requires permutation when unrolling exposes | |
2038 | a gap either because the group is larger than the SLP | |
2039 | group-size or because there is a gap between the groups. */ | |
d9f21f6a | 2040 | && (known_eq (unrolling_factor, 1U) |
fe2bef71 RB |
2041 | || (group_size == GROUP_SIZE (vinfo_for_stmt (first_stmt)) |
2042 | && GROUP_GAP (vinfo_for_stmt (first_stmt)) == 0))) | |
01d8bf07 RB |
2043 | { |
2044 | load_permutation.release (); | |
2045 | continue; | |
2046 | } | |
2047 | SLP_TREE_LOAD_PERMUTATION (load_node) = load_permutation; | |
2048 | loads_permuted = true; | |
abf9bfbc | 2049 | } |
6aa904c4 IR |
2050 | |
2051 | if (loads_permuted) | |
ebfd146a | 2052 | { |
01d8bf07 | 2053 | if (!vect_supported_load_permutation_p (new_instance)) |
ebfd146a | 2054 | { |
73fbfcad | 2055 | if (dump_enabled_p ()) |
ebfd146a | 2056 | { |
e645e942 | 2057 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
78c60e3d SS |
2058 | "Build SLP failed: unsupported load " |
2059 | "permutation "); | |
e569db5f VK |
2060 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, |
2061 | TDF_SLIM, stmt, 0); | |
ebfd146a | 2062 | } |
ebfd146a IR |
2063 | vect_free_slp_instance (new_instance); |
2064 | return false; | |
2065 | } | |
ebfd146a | 2066 | } |
ebfd146a | 2067 | |
e569db5f | 2068 | /* If the loads and stores can be handled with load/store-lan |
bb0f5ca7 AL |
2069 | instructions do not generate this SLP instance. */ |
2070 | if (is_a <loop_vec_info> (vinfo) | |
2071 | && loads_permuted | |
7e11fc7f | 2072 | && dr && vect_store_lanes_supported (vectype, group_size, false)) |
bb0f5ca7 AL |
2073 | { |
2074 | slp_tree load_node; | |
2075 | FOR_EACH_VEC_ELT (loads, i, load_node) | |
2076 | { | |
2077 | gimple *first_stmt = GROUP_FIRST_ELEMENT | |
2078 | (vinfo_for_stmt (SLP_TREE_SCALAR_STMTS (load_node)[0])); | |
2079 | stmt_vec_info stmt_vinfo = vinfo_for_stmt (first_stmt); | |
e569db5f VK |
2080 | /* Use SLP for strided accesses (or if we |
2081 | can't load-lanes). */ | |
bb0f5ca7 AL |
2082 | if (STMT_VINFO_STRIDED_P (stmt_vinfo) |
2083 | || ! vect_load_lanes_supported | |
2084 | (STMT_VINFO_VECTYPE (stmt_vinfo), | |
7e11fc7f | 2085 | GROUP_SIZE (stmt_vinfo), false)) |
bb0f5ca7 AL |
2086 | break; |
2087 | } | |
2088 | if (i == loads.length ()) | |
2089 | { | |
2090 | if (dump_enabled_p ()) | |
2091 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, | |
2092 | "Built SLP cancelled: can use " | |
2093 | "load/store-lanes\n"); | |
2094 | vect_free_slp_instance (new_instance); | |
2095 | return false; | |
2096 | } | |
2097 | } | |
2098 | ||
310213d4 | 2099 | vinfo->slp_instances.safe_push (new_instance); |
b8698a0f | 2100 | |
73fbfcad | 2101 | if (dump_enabled_p ()) |
c2a12ca0 RB |
2102 | { |
2103 | dump_printf_loc (MSG_NOTE, vect_location, | |
2104 | "Final SLP tree for instance:\n"); | |
2105 | vect_print_slp_tree (MSG_NOTE, vect_location, node); | |
2106 | } | |
ebfd146a IR |
2107 | |
2108 | return true; | |
2109 | } | |
e569db5f VK |
2110 | } |
2111 | else | |
2112 | { | |
ebfd146a IR |
2113 | /* Failed to SLP. */ |
2114 | /* Free the allocated memory. */ | |
e403d17e | 2115 | scalar_stmts.release (); |
9771b263 | 2116 | loads.release (); |
e569db5f | 2117 | } |
b8698a0f | 2118 | |
1ba91a49 | 2119 | /* For basic block SLP, try to break the group up into multiples of the |
97a1a642 | 2120 | vector size. */ |
4b6068ea | 2121 | unsigned HOST_WIDE_INT const_nunits; |
1ba91a49 AL |
2122 | if (is_a <bb_vec_info> (vinfo) |
2123 | && GROUP_FIRST_ELEMENT (vinfo_for_stmt (stmt)) | |
4b6068ea RS |
2124 | && STMT_VINFO_GROUPED_ACCESS (vinfo_for_stmt (stmt)) |
2125 | && nunits.is_constant (&const_nunits)) | |
1ba91a49 AL |
2126 | { |
2127 | /* We consider breaking the group only on VF boundaries from the existing | |
2128 | start. */ | |
2129 | for (i = 0; i < group_size; i++) | |
2130 | if (!matches[i]) break; | |
2131 | ||
4b6068ea | 2132 | if (i >= const_nunits && i < group_size) |
1ba91a49 AL |
2133 | { |
2134 | /* Split into two groups at the first vector boundary before i. */ | |
4b6068ea RS |
2135 | gcc_assert ((const_nunits & (const_nunits - 1)) == 0); |
2136 | unsigned group1_size = i & ~(const_nunits - 1); | |
1ba91a49 AL |
2137 | |
2138 | gimple *rest = vect_split_slp_store_group (stmt, group1_size); | |
2139 | bool res = vect_analyze_slp_instance (vinfo, stmt, max_tree_size); | |
2140 | /* If the first non-match was in the middle of a vector, | |
2141 | skip the rest of that vector. */ | |
2142 | if (group1_size < i) | |
2143 | { | |
4b6068ea | 2144 | i = group1_size + const_nunits; |
1ba91a49 | 2145 | if (i < group_size) |
4b6068ea | 2146 | rest = vect_split_slp_store_group (rest, const_nunits); |
1ba91a49 AL |
2147 | } |
2148 | if (i < group_size) | |
2149 | res |= vect_analyze_slp_instance (vinfo, rest, max_tree_size); | |
2150 | return res; | |
2151 | } | |
2152 | /* Even though the first vector did not all match, we might be able to SLP | |
2153 | (some) of the remainder. FORNOW ignore this possibility. */ | |
2154 | } | |
2155 | ||
a70d6342 | 2156 | return false; |
ebfd146a IR |
2157 | } |
2158 | ||
2159 | ||
ff802fa1 | 2160 | /* Check if there are stmts in the loop can be vectorized using SLP. Build SLP |
ebfd146a IR |
2161 | trees of packed scalar stmts if SLP is possible. */ |
2162 | ||
2163 | bool | |
310213d4 | 2164 | vect_analyze_slp (vec_info *vinfo, unsigned max_tree_size) |
ebfd146a IR |
2165 | { |
2166 | unsigned int i; | |
355fe088 | 2167 | gimple *first_element; |
ebfd146a | 2168 | |
73fbfcad | 2169 | if (dump_enabled_p ()) |
e645e942 | 2170 | dump_printf_loc (MSG_NOTE, vect_location, "=== vect_analyze_slp ===\n"); |
ebfd146a | 2171 | |
0d0293ac | 2172 | /* Find SLP sequences starting from groups of grouped stores. */ |
310213d4 | 2173 | FOR_EACH_VEC_ELT (vinfo->grouped_stores, i, first_element) |
0630a4ec | 2174 | vect_analyze_slp_instance (vinfo, first_element, max_tree_size); |
ebfd146a | 2175 | |
310213d4 | 2176 | if (loop_vec_info loop_vinfo = dyn_cast <loop_vec_info> (vinfo)) |
b010117a | 2177 | { |
310213d4 RB |
2178 | if (loop_vinfo->reduction_chains.length () > 0) |
2179 | { | |
2180 | /* Find SLP sequences starting from reduction chains. */ | |
2181 | FOR_EACH_VEC_ELT (loop_vinfo->reduction_chains, i, first_element) | |
0630a4ec | 2182 | if (! vect_analyze_slp_instance (vinfo, first_element, |
310213d4 | 2183 | max_tree_size)) |
6b5e165b RB |
2184 | { |
2185 | /* Dissolve reduction chain group. */ | |
2186 | gimple *next, *stmt = first_element; | |
2187 | while (stmt) | |
2188 | { | |
2189 | stmt_vec_info vinfo = vinfo_for_stmt (stmt); | |
2190 | next = GROUP_NEXT_ELEMENT (vinfo); | |
2191 | GROUP_FIRST_ELEMENT (vinfo) = NULL; | |
2192 | GROUP_NEXT_ELEMENT (vinfo) = NULL; | |
2193 | stmt = next; | |
2194 | } | |
2195 | STMT_VINFO_DEF_TYPE (vinfo_for_stmt (first_element)) | |
2196 | = vect_internal_def; | |
2197 | } | |
310213d4 | 2198 | } |
b010117a | 2199 | |
310213d4 | 2200 | /* Find SLP sequences starting from groups of reductions. */ |
0630a4ec RB |
2201 | if (loop_vinfo->reductions.length () > 1) |
2202 | vect_analyze_slp_instance (vinfo, loop_vinfo->reductions[0], | |
2203 | max_tree_size); | |
310213d4 | 2204 | } |
b5aeb3bb | 2205 | |
ebfd146a IR |
2206 | return true; |
2207 | } | |
2208 | ||
2209 | ||
2210 | /* For each possible SLP instance decide whether to SLP it and calculate overall | |
437f4a00 IR |
2211 | unrolling factor needed to SLP the loop. Return TRUE if decided to SLP at |
2212 | least one instance. */ | |
ebfd146a | 2213 | |
437f4a00 | 2214 | bool |
ebfd146a IR |
2215 | vect_make_slp_decision (loop_vec_info loop_vinfo) |
2216 | { | |
d9f21f6a RS |
2217 | unsigned int i; |
2218 | poly_uint64 unrolling_factor = 1; | |
9771b263 | 2219 | vec<slp_instance> slp_instances = LOOP_VINFO_SLP_INSTANCES (loop_vinfo); |
ebfd146a IR |
2220 | slp_instance instance; |
2221 | int decided_to_slp = 0; | |
2222 | ||
73fbfcad | 2223 | if (dump_enabled_p ()) |
e645e942 TJ |
2224 | dump_printf_loc (MSG_NOTE, vect_location, "=== vect_make_slp_decision ===" |
2225 | "\n"); | |
ebfd146a | 2226 | |
9771b263 | 2227 | FOR_EACH_VEC_ELT (slp_instances, i, instance) |
ebfd146a IR |
2228 | { |
2229 | /* FORNOW: SLP if you can. */ | |
d9f21f6a RS |
2230 | /* All unroll factors have the form current_vector_size * X for some |
2231 | rational X, so they must have a common multiple. */ | |
2232 | unrolling_factor | |
2233 | = force_common_multiple (unrolling_factor, | |
2234 | SLP_INSTANCE_UNROLLING_FACTOR (instance)); | |
ebfd146a | 2235 | |
ff802fa1 | 2236 | /* Mark all the stmts that belong to INSTANCE as PURE_SLP stmts. Later we |
b8698a0f | 2237 | call vect_detect_hybrid_slp () to find stmts that need hybrid SLP and |
ff802fa1 | 2238 | loop-based vectorization. Such stmts will be marked as HYBRID. */ |
ebfd146a IR |
2239 | vect_mark_slp_stmts (SLP_INSTANCE_TREE (instance), pure_slp, -1); |
2240 | decided_to_slp++; | |
2241 | } | |
2242 | ||
2243 | LOOP_VINFO_SLP_UNROLLING_FACTOR (loop_vinfo) = unrolling_factor; | |
2244 | ||
73fbfcad | 2245 | if (decided_to_slp && dump_enabled_p ()) |
d9f21f6a RS |
2246 | { |
2247 | dump_printf_loc (MSG_NOTE, vect_location, | |
2248 | "Decided to SLP %d instances. Unrolling factor ", | |
2249 | decided_to_slp); | |
2250 | dump_dec (MSG_NOTE, unrolling_factor); | |
2251 | dump_printf (MSG_NOTE, "\n"); | |
2252 | } | |
437f4a00 IR |
2253 | |
2254 | return (decided_to_slp > 0); | |
ebfd146a IR |
2255 | } |
2256 | ||
2257 | ||
2258 | /* Find stmts that must be both vectorized and SLPed (since they feed stmts that | |
ff802fa1 | 2259 | can't be SLPed) in the tree rooted at NODE. Mark such stmts as HYBRID. */ |
ebfd146a IR |
2260 | |
2261 | static void | |
642fce57 | 2262 | vect_detect_hybrid_slp_stmts (slp_tree node, unsigned i, slp_vect_type stype) |
ebfd146a | 2263 | { |
355fe088 | 2264 | gimple *stmt = SLP_TREE_SCALAR_STMTS (node)[i]; |
ebfd146a | 2265 | imm_use_iterator imm_iter; |
355fe088 | 2266 | gimple *use_stmt; |
642fce57 | 2267 | stmt_vec_info use_vinfo, stmt_vinfo = vinfo_for_stmt (stmt); |
d755c7ef | 2268 | slp_tree child; |
f2c74cc4 | 2269 | loop_vec_info loop_vinfo = STMT_VINFO_LOOP_VINFO (stmt_vinfo); |
642fce57 RB |
2270 | struct loop *loop = LOOP_VINFO_LOOP (loop_vinfo); |
2271 | int j; | |
2272 | ||
2273 | /* Propagate hybrid down the SLP tree. */ | |
2274 | if (stype == hybrid) | |
2275 | ; | |
2276 | else if (HYBRID_SLP_STMT (stmt_vinfo)) | |
2277 | stype = hybrid; | |
2278 | else | |
2279 | { | |
2280 | /* Check if a pure SLP stmt has uses in non-SLP stmts. */ | |
2281 | gcc_checking_assert (PURE_SLP_STMT (stmt_vinfo)); | |
2935d994 RB |
2282 | /* If we get a pattern stmt here we have to use the LHS of the |
2283 | original stmt for immediate uses. */ | |
2284 | if (! STMT_VINFO_IN_PATTERN_P (stmt_vinfo) | |
2285 | && STMT_VINFO_RELATED_STMT (stmt_vinfo)) | |
29764870 | 2286 | stmt = STMT_VINFO_RELATED_STMT (stmt_vinfo); |
e7baeb39 RB |
2287 | tree def; |
2288 | if (gimple_code (stmt) == GIMPLE_PHI) | |
2289 | def = gimple_phi_result (stmt); | |
2290 | else | |
2291 | def = SINGLE_SSA_TREE_OPERAND (stmt, SSA_OP_DEF); | |
2292 | if (def) | |
2293 | FOR_EACH_IMM_USE_STMT (use_stmt, imm_iter, def) | |
29764870 RB |
2294 | { |
2295 | if (!flow_bb_inside_loop_p (loop, gimple_bb (use_stmt))) | |
2296 | continue; | |
2297 | use_vinfo = vinfo_for_stmt (use_stmt); | |
2298 | if (STMT_VINFO_IN_PATTERN_P (use_vinfo) | |
2299 | && STMT_VINFO_RELATED_STMT (use_vinfo)) | |
2300 | use_vinfo = vinfo_for_stmt (STMT_VINFO_RELATED_STMT (use_vinfo)); | |
2301 | if (!STMT_SLP_TYPE (use_vinfo) | |
2302 | && (STMT_VINFO_RELEVANT (use_vinfo) | |
2303 | || VECTORIZABLE_CYCLE_DEF (STMT_VINFO_DEF_TYPE (use_vinfo))) | |
2304 | && !(gimple_code (use_stmt) == GIMPLE_PHI | |
2305 | && STMT_VINFO_DEF_TYPE (use_vinfo) == vect_reduction_def)) | |
502f0263 RB |
2306 | { |
2307 | if (dump_enabled_p ()) | |
2308 | { | |
2309 | dump_printf_loc (MSG_NOTE, vect_location, "use of SLP " | |
2310 | "def in non-SLP stmt: "); | |
2311 | dump_gimple_stmt (MSG_NOTE, TDF_SLIM, use_stmt, 0); | |
2312 | } | |
2313 | stype = hybrid; | |
2314 | } | |
29764870 | 2315 | } |
642fce57 | 2316 | } |
ebfd146a | 2317 | |
502f0263 RB |
2318 | if (stype == hybrid |
2319 | && !HYBRID_SLP_STMT (stmt_vinfo)) | |
b1af7da6 RB |
2320 | { |
2321 | if (dump_enabled_p ()) | |
2322 | { | |
2323 | dump_printf_loc (MSG_NOTE, vect_location, "marking hybrid: "); | |
2324 | dump_gimple_stmt (MSG_NOTE, TDF_SLIM, stmt, 0); | |
2325 | } | |
2326 | STMT_SLP_TYPE (stmt_vinfo) = hybrid; | |
2327 | } | |
ebfd146a | 2328 | |
642fce57 | 2329 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (node), j, child) |
603cca93 | 2330 | if (SLP_TREE_DEF_TYPE (child) != vect_external_def) |
90dd6e3d | 2331 | vect_detect_hybrid_slp_stmts (child, i, stype); |
642fce57 | 2332 | } |
f2c74cc4 | 2333 | |
642fce57 | 2334 | /* Helpers for vect_detect_hybrid_slp walking pattern stmt uses. */ |
ebfd146a | 2335 | |
642fce57 RB |
2336 | static tree |
2337 | vect_detect_hybrid_slp_1 (tree *tp, int *, void *data) | |
2338 | { | |
2339 | walk_stmt_info *wi = (walk_stmt_info *)data; | |
2340 | struct loop *loopp = (struct loop *)wi->info; | |
2341 | ||
2342 | if (wi->is_lhs) | |
2343 | return NULL_TREE; | |
2344 | ||
2345 | if (TREE_CODE (*tp) == SSA_NAME | |
2346 | && !SSA_NAME_IS_DEFAULT_DEF (*tp)) | |
2347 | { | |
355fe088 | 2348 | gimple *def_stmt = SSA_NAME_DEF_STMT (*tp); |
642fce57 RB |
2349 | if (flow_bb_inside_loop_p (loopp, gimple_bb (def_stmt)) |
2350 | && PURE_SLP_STMT (vinfo_for_stmt (def_stmt))) | |
b1af7da6 RB |
2351 | { |
2352 | if (dump_enabled_p ()) | |
2353 | { | |
2354 | dump_printf_loc (MSG_NOTE, vect_location, "marking hybrid: "); | |
2355 | dump_gimple_stmt (MSG_NOTE, TDF_SLIM, def_stmt, 0); | |
2356 | } | |
2357 | STMT_SLP_TYPE (vinfo_for_stmt (def_stmt)) = hybrid; | |
2358 | } | |
642fce57 RB |
2359 | } |
2360 | ||
2361 | return NULL_TREE; | |
ebfd146a IR |
2362 | } |
2363 | ||
642fce57 RB |
2364 | static tree |
2365 | vect_detect_hybrid_slp_2 (gimple_stmt_iterator *gsi, bool *handled, | |
2366 | walk_stmt_info *) | |
2367 | { | |
9186a9d3 | 2368 | stmt_vec_info use_vinfo = vinfo_for_stmt (gsi_stmt (*gsi)); |
642fce57 RB |
2369 | /* If the stmt is in a SLP instance then this isn't a reason |
2370 | to mark use definitions in other SLP instances as hybrid. */ | |
9186a9d3 RB |
2371 | if (! STMT_SLP_TYPE (use_vinfo) |
2372 | && (STMT_VINFO_RELEVANT (use_vinfo) | |
2373 | || VECTORIZABLE_CYCLE_DEF (STMT_VINFO_DEF_TYPE (use_vinfo))) | |
2374 | && ! (gimple_code (gsi_stmt (*gsi)) == GIMPLE_PHI | |
2375 | && STMT_VINFO_DEF_TYPE (use_vinfo) == vect_reduction_def)) | |
2376 | ; | |
2377 | else | |
642fce57 RB |
2378 | *handled = true; |
2379 | return NULL_TREE; | |
2380 | } | |
ebfd146a IR |
2381 | |
2382 | /* Find stmts that must be both vectorized and SLPed. */ | |
2383 | ||
2384 | void | |
2385 | vect_detect_hybrid_slp (loop_vec_info loop_vinfo) | |
2386 | { | |
2387 | unsigned int i; | |
9771b263 | 2388 | vec<slp_instance> slp_instances = LOOP_VINFO_SLP_INSTANCES (loop_vinfo); |
ebfd146a IR |
2389 | slp_instance instance; |
2390 | ||
73fbfcad | 2391 | if (dump_enabled_p ()) |
e645e942 TJ |
2392 | dump_printf_loc (MSG_NOTE, vect_location, "=== vect_detect_hybrid_slp ===" |
2393 | "\n"); | |
ebfd146a | 2394 | |
642fce57 RB |
2395 | /* First walk all pattern stmt in the loop and mark defs of uses as |
2396 | hybrid because immediate uses in them are not recorded. */ | |
2397 | for (i = 0; i < LOOP_VINFO_LOOP (loop_vinfo)->num_nodes; ++i) | |
2398 | { | |
2399 | basic_block bb = LOOP_VINFO_BBS (loop_vinfo)[i]; | |
2400 | for (gimple_stmt_iterator gsi = gsi_start_bb (bb); !gsi_end_p (gsi); | |
2401 | gsi_next (&gsi)) | |
2402 | { | |
355fe088 | 2403 | gimple *stmt = gsi_stmt (gsi); |
642fce57 RB |
2404 | stmt_vec_info stmt_info = vinfo_for_stmt (stmt); |
2405 | if (STMT_VINFO_IN_PATTERN_P (stmt_info)) | |
2406 | { | |
2407 | walk_stmt_info wi; | |
2408 | memset (&wi, 0, sizeof (wi)); | |
2409 | wi.info = LOOP_VINFO_LOOP (loop_vinfo); | |
2410 | gimple_stmt_iterator gsi2 | |
2411 | = gsi_for_stmt (STMT_VINFO_RELATED_STMT (stmt_info)); | |
2412 | walk_gimple_stmt (&gsi2, vect_detect_hybrid_slp_2, | |
2413 | vect_detect_hybrid_slp_1, &wi); | |
2414 | walk_gimple_seq (STMT_VINFO_PATTERN_DEF_SEQ (stmt_info), | |
2415 | vect_detect_hybrid_slp_2, | |
2416 | vect_detect_hybrid_slp_1, &wi); | |
2417 | } | |
2418 | } | |
2419 | } | |
2420 | ||
2421 | /* Then walk the SLP instance trees marking stmts with uses in | |
2422 | non-SLP stmts as hybrid, also propagating hybrid down the | |
2423 | SLP tree, collecting the above info on-the-fly. */ | |
9771b263 | 2424 | FOR_EACH_VEC_ELT (slp_instances, i, instance) |
642fce57 RB |
2425 | { |
2426 | for (unsigned i = 0; i < SLP_INSTANCE_GROUP_SIZE (instance); ++i) | |
2427 | vect_detect_hybrid_slp_stmts (SLP_INSTANCE_TREE (instance), | |
2428 | i, pure_slp); | |
2429 | } | |
ebfd146a IR |
2430 | } |
2431 | ||
a70d6342 | 2432 | |
2c515559 RS |
2433 | /* Initialize a bb_vec_info struct for the statements between |
2434 | REGION_BEGIN_IN (inclusive) and REGION_END_IN (exclusive). */ | |
2435 | ||
2436 | _bb_vec_info::_bb_vec_info (gimple_stmt_iterator region_begin_in, | |
2437 | gimple_stmt_iterator region_end_in) | |
2438 | : vec_info (vec_info::bb, init_cost (NULL)), | |
2439 | bb (gsi_bb (region_begin_in)), | |
2440 | region_begin (region_begin_in), | |
2441 | region_end (region_end_in) | |
a70d6342 | 2442 | { |
a70d6342 IR |
2443 | gimple_stmt_iterator gsi; |
2444 | ||
61d371eb RB |
2445 | for (gsi = region_begin; gsi_stmt (gsi) != gsi_stmt (region_end); |
2446 | gsi_next (&gsi)) | |
a70d6342 | 2447 | { |
355fe088 | 2448 | gimple *stmt = gsi_stmt (gsi); |
a70d6342 | 2449 | gimple_set_uid (stmt, 0); |
2c515559 | 2450 | set_vinfo_for_stmt (stmt, new_stmt_vec_info (stmt, this)); |
a70d6342 IR |
2451 | } |
2452 | ||
2c515559 | 2453 | bb->aux = this; |
a70d6342 IR |
2454 | } |
2455 | ||
2456 | ||
2457 | /* Free BB_VINFO struct, as well as all the stmt_vec_info structs of all the | |
2458 | stmts in the basic block. */ | |
2459 | ||
2c515559 | 2460 | _bb_vec_info::~_bb_vec_info () |
a70d6342 | 2461 | { |
2c515559 RS |
2462 | for (gimple_stmt_iterator si = region_begin; |
2463 | gsi_stmt (si) != gsi_stmt (region_end); gsi_next (&si)) | |
a70d6342 | 2464 | { |
355fe088 | 2465 | gimple *stmt = gsi_stmt (si); |
a70d6342 IR |
2466 | stmt_vec_info stmt_info = vinfo_for_stmt (stmt); |
2467 | ||
2468 | if (stmt_info) | |
2469 | /* Free stmt_vec_info. */ | |
2470 | free_stmt_vec_info (stmt); | |
61d371eb RB |
2471 | |
2472 | /* Reset region marker. */ | |
2473 | gimple_set_uid (stmt, -1); | |
a70d6342 IR |
2474 | } |
2475 | ||
2c515559 | 2476 | bb->aux = NULL; |
a70d6342 IR |
2477 | } |
2478 | ||
2479 | ||
8b7e9dba RS |
2480 | /* Analyze statements contained in SLP tree NODE after recursively analyzing |
2481 | the subtree. NODE_INSTANCE contains NODE and VINFO contains INSTANCE. | |
2482 | ||
2483 | Return true if the operations are supported. */ | |
a70d6342 IR |
2484 | |
2485 | static bool | |
8b7e9dba | 2486 | vect_slp_analyze_node_operations (vec_info *vinfo, slp_tree node, |
68435eb2 RB |
2487 | slp_instance node_instance, |
2488 | scalar_stmts_to_slp_tree_map_t *visited, | |
2489 | scalar_stmts_to_slp_tree_map_t *lvisited, | |
2490 | stmt_vector_for_cost *cost_vec) | |
a70d6342 IR |
2491 | { |
2492 | bool dummy; | |
603cca93 | 2493 | int i, j; |
355fe088 | 2494 | gimple *stmt; |
d755c7ef | 2495 | slp_tree child; |
a70d6342 | 2496 | |
603cca93 | 2497 | if (SLP_TREE_DEF_TYPE (node) != vect_internal_def) |
a70d6342 IR |
2498 | return true; |
2499 | ||
68435eb2 RB |
2500 | /* If we already analyzed the exact same set of scalar stmts we're done. |
2501 | We share the generated vector stmts for those. */ | |
2502 | slp_tree *leader; | |
2503 | if ((leader = visited->get (SLP_TREE_SCALAR_STMTS (node))) | |
2504 | || (leader = lvisited->get (SLP_TREE_SCALAR_STMTS (node)))) | |
2505 | { | |
2506 | SLP_TREE_NUMBER_OF_VEC_STMTS (node) | |
2507 | = SLP_TREE_NUMBER_OF_VEC_STMTS (*leader); | |
2508 | return true; | |
2509 | } | |
2510 | ||
2511 | /* The SLP graph is acyclic so not caching whether we failed or succeeded | |
2512 | doesn't result in any issue since we throw away the lvisited set | |
2513 | when we fail. */ | |
2514 | lvisited->put (SLP_TREE_SCALAR_STMTS (node).copy (), node); | |
2515 | ||
9771b263 | 2516 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (node), i, child) |
68435eb2 RB |
2517 | if (!vect_slp_analyze_node_operations (vinfo, child, node_instance, |
2518 | visited, lvisited, cost_vec)) | |
d092494c | 2519 | return false; |
a70d6342 | 2520 | |
bd2f172f RB |
2521 | stmt = SLP_TREE_SCALAR_STMTS (node)[0]; |
2522 | stmt_vec_info stmt_info = vinfo_for_stmt (stmt); | |
2523 | gcc_assert (stmt_info); | |
2524 | gcc_assert (STMT_SLP_TYPE (stmt_info) != loop_vect); | |
2525 | ||
2526 | /* For BB vectorization vector types are assigned here. | |
2527 | Memory accesses already got their vector type assigned | |
2528 | in vect_analyze_data_refs. */ | |
2529 | bb_vec_info bb_vinfo = STMT_VINFO_BB_VINFO (stmt_info); | |
2530 | if (bb_vinfo | |
2531 | && ! STMT_VINFO_DATA_REF (stmt_info)) | |
a70d6342 | 2532 | { |
1f3cb663 RS |
2533 | tree vectype, nunits_vectype; |
2534 | if (!vect_get_vector_types_for_stmt (stmt_info, &vectype, | |
2535 | &nunits_vectype)) | |
2536 | /* We checked this when building the node. */ | |
2537 | gcc_unreachable (); | |
2538 | if (vectype == boolean_type_node) | |
bd2f172f | 2539 | { |
1f3cb663 RS |
2540 | vectype = vect_get_mask_type_for_stmt (stmt_info); |
2541 | if (!vectype) | |
2542 | /* vect_get_mask_type_for_stmt has already explained the | |
2543 | failure. */ | |
2544 | return false; | |
bd2f172f RB |
2545 | } |
2546 | ||
2547 | gimple *sstmt; | |
2548 | FOR_EACH_VEC_ELT (SLP_TREE_SCALAR_STMTS (node), i, sstmt) | |
2549 | STMT_VINFO_VECTYPE (vinfo_for_stmt (sstmt)) = vectype; | |
a70d6342 IR |
2550 | } |
2551 | ||
8b7e9dba RS |
2552 | /* Calculate the number of vector statements to be created for the |
2553 | scalar stmts in this node. For SLP reductions it is equal to the | |
2554 | number of vector statements in the children (which has already been | |
2555 | calculated by the recursive call). Otherwise it is the number of | |
2556 | scalar elements in one scalar iteration (GROUP_SIZE) multiplied by | |
2557 | VF divided by the number of elements in a vector. */ | |
2558 | if (GROUP_FIRST_ELEMENT (stmt_info) | |
2559 | && !STMT_VINFO_GROUPED_ACCESS (stmt_info)) | |
2560 | SLP_TREE_NUMBER_OF_VEC_STMTS (node) | |
2561 | = SLP_TREE_NUMBER_OF_VEC_STMTS (SLP_TREE_CHILDREN (node)[0]); | |
2562 | else | |
2563 | { | |
d9f21f6a | 2564 | poly_uint64 vf; |
8b7e9dba RS |
2565 | if (loop_vec_info loop_vinfo = dyn_cast <loop_vec_info> (vinfo)) |
2566 | vf = loop_vinfo->vectorization_factor; | |
2567 | else | |
2568 | vf = 1; | |
2569 | unsigned int group_size = SLP_INSTANCE_GROUP_SIZE (node_instance); | |
2570 | tree vectype = STMT_VINFO_VECTYPE (stmt_info); | |
2571 | SLP_TREE_NUMBER_OF_VEC_STMTS (node) | |
d9f21f6a | 2572 | = vect_get_num_vectors (vf * group_size, vectype); |
8b7e9dba RS |
2573 | } |
2574 | ||
bd2f172f RB |
2575 | /* Push SLP node def-type to stmt operands. */ |
2576 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (node), j, child) | |
2577 | if (SLP_TREE_DEF_TYPE (child) != vect_internal_def) | |
2578 | STMT_VINFO_DEF_TYPE (vinfo_for_stmt (SLP_TREE_SCALAR_STMTS (child)[0])) | |
2579 | = SLP_TREE_DEF_TYPE (child); | |
68435eb2 | 2580 | bool res = vect_analyze_stmt (stmt, &dummy, node, node_instance, cost_vec); |
bd2f172f RB |
2581 | /* Restore def-types. */ |
2582 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (node), j, child) | |
2583 | if (SLP_TREE_DEF_TYPE (child) != vect_internal_def) | |
2584 | STMT_VINFO_DEF_TYPE (vinfo_for_stmt (SLP_TREE_SCALAR_STMTS (child)[0])) | |
2585 | = vect_internal_def; | |
2586 | if (! res) | |
2587 | return false; | |
2588 | ||
2589 | return true; | |
a70d6342 IR |
2590 | } |
2591 | ||
2592 | ||
8b7e9dba | 2593 | /* Analyze statements in SLP instances of VINFO. Return true if the |
a70d6342 IR |
2594 | operations are supported. */ |
2595 | ||
a12e42fc | 2596 | bool |
8b7e9dba | 2597 | vect_slp_analyze_operations (vec_info *vinfo) |
a70d6342 | 2598 | { |
a70d6342 IR |
2599 | slp_instance instance; |
2600 | int i; | |
2601 | ||
a12e42fc RB |
2602 | if (dump_enabled_p ()) |
2603 | dump_printf_loc (MSG_NOTE, vect_location, | |
2604 | "=== vect_slp_analyze_operations ===\n"); | |
2605 | ||
68435eb2 RB |
2606 | scalar_stmts_to_slp_tree_map_t *visited |
2607 | = new scalar_stmts_to_slp_tree_map_t (); | |
8b7e9dba | 2608 | for (i = 0; vinfo->slp_instances.iterate (i, &instance); ) |
a70d6342 | 2609 | { |
68435eb2 RB |
2610 | scalar_stmts_to_slp_tree_map_t lvisited; |
2611 | stmt_vector_for_cost cost_vec; | |
2612 | cost_vec.create (2); | |
8b7e9dba RS |
2613 | if (!vect_slp_analyze_node_operations (vinfo, |
2614 | SLP_INSTANCE_TREE (instance), | |
68435eb2 RB |
2615 | instance, visited, &lvisited, |
2616 | &cost_vec)) | |
a70d6342 | 2617 | { |
a12e42fc RB |
2618 | dump_printf_loc (MSG_NOTE, vect_location, |
2619 | "removing SLP instance operations starting from: "); | |
2620 | dump_gimple_stmt (MSG_NOTE, TDF_SLIM, | |
2621 | SLP_TREE_SCALAR_STMTS | |
2622 | (SLP_INSTANCE_TREE (instance))[0], 0); | |
2623 | vect_free_slp_instance (instance); | |
8b7e9dba | 2624 | vinfo->slp_instances.ordered_remove (i); |
68435eb2 | 2625 | cost_vec.release (); |
a70d6342 IR |
2626 | } |
2627 | else | |
68435eb2 RB |
2628 | { |
2629 | for (scalar_stmts_to_slp_tree_map_t::iterator x = lvisited.begin(); | |
2630 | x != lvisited.end(); ++x) | |
2631 | visited->put ((*x).first.copy (), (*x).second); | |
2632 | i++; | |
78604de0 | 2633 | |
68435eb2 RB |
2634 | add_stmt_costs (vinfo->target_cost_data, &cost_vec); |
2635 | cost_vec.release (); | |
2636 | } | |
2637 | } | |
78604de0 RB |
2638 | delete visited; |
2639 | ||
8b7e9dba | 2640 | return !vinfo->slp_instances.is_empty (); |
a70d6342 IR |
2641 | } |
2642 | ||
6eddf228 RB |
2643 | |
2644 | /* Compute the scalar cost of the SLP node NODE and its children | |
2645 | and return it. Do not account defs that are marked in LIFE and | |
2646 | update LIFE according to uses of NODE. */ | |
2647 | ||
a296d6d3 | 2648 | static void |
292cba13 | 2649 | vect_bb_slp_scalar_cost (basic_block bb, |
a296d6d3 RB |
2650 | slp_tree node, vec<bool, va_heap> *life, |
2651 | stmt_vector_for_cost *cost_vec) | |
6eddf228 | 2652 | { |
6eddf228 | 2653 | unsigned i; |
355fe088 | 2654 | gimple *stmt; |
6eddf228 RB |
2655 | slp_tree child; |
2656 | ||
2657 | FOR_EACH_VEC_ELT (SLP_TREE_SCALAR_STMTS (node), i, stmt) | |
2658 | { | |
6eddf228 RB |
2659 | ssa_op_iter op_iter; |
2660 | def_operand_p def_p; | |
2661 | stmt_vec_info stmt_info; | |
2662 | ||
ff4c81cc | 2663 | if ((*life)[i]) |
6eddf228 RB |
2664 | continue; |
2665 | ||
2666 | /* If there is a non-vectorized use of the defs then the scalar | |
2667 | stmt is kept live in which case we do not account it or any | |
2668 | required defs in the SLP children in the scalar cost. This | |
2669 | way we make the vectorization more costly when compared to | |
2670 | the scalar cost. */ | |
2671 | FOR_EACH_SSA_DEF_OPERAND (def_p, stmt, op_iter, SSA_OP_DEF) | |
2672 | { | |
2673 | imm_use_iterator use_iter; | |
355fe088 | 2674 | gimple *use_stmt; |
6eddf228 | 2675 | FOR_EACH_IMM_USE_STMT (use_stmt, use_iter, DEF_FROM_PTR (def_p)) |
f30a0ba5 | 2676 | if (!is_gimple_debug (use_stmt) |
61d371eb RB |
2677 | && (! vect_stmt_in_region_p (vinfo_for_stmt (stmt)->vinfo, |
2678 | use_stmt) | |
603cca93 | 2679 | || ! PURE_SLP_STMT (vinfo_for_stmt (use_stmt)))) |
6eddf228 | 2680 | { |
ff4c81cc | 2681 | (*life)[i] = true; |
6eddf228 RB |
2682 | BREAK_FROM_IMM_USE_STMT (use_iter); |
2683 | } | |
2684 | } | |
ff4c81cc | 2685 | if ((*life)[i]) |
6eddf228 RB |
2686 | continue; |
2687 | ||
b555a2e4 RB |
2688 | /* Count scalar stmts only once. */ |
2689 | if (gimple_visited_p (stmt)) | |
2690 | continue; | |
2691 | gimple_set_visited (stmt, true); | |
2692 | ||
6eddf228 | 2693 | stmt_info = vinfo_for_stmt (stmt); |
a296d6d3 | 2694 | vect_cost_for_stmt kind; |
6eddf228 RB |
2695 | if (STMT_VINFO_DATA_REF (stmt_info)) |
2696 | { | |
2697 | if (DR_IS_READ (STMT_VINFO_DATA_REF (stmt_info))) | |
a296d6d3 | 2698 | kind = scalar_load; |
6eddf228 | 2699 | else |
a296d6d3 | 2700 | kind = scalar_store; |
6eddf228 RB |
2701 | } |
2702 | else | |
a296d6d3 RB |
2703 | kind = scalar_stmt; |
2704 | record_stmt_cost (cost_vec, 1, kind, stmt_info, 0, vect_body); | |
6eddf228 RB |
2705 | } |
2706 | ||
faa5399b | 2707 | auto_vec<bool, 20> subtree_life; |
6eddf228 | 2708 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (node), i, child) |
faa5399b RB |
2709 | { |
2710 | if (SLP_TREE_DEF_TYPE (child) == vect_internal_def) | |
2711 | { | |
2712 | /* Do not directly pass LIFE to the recursive call, copy it to | |
2713 | confine changes in the callee to the current child/subtree. */ | |
2714 | subtree_life.safe_splice (*life); | |
a296d6d3 | 2715 | vect_bb_slp_scalar_cost (bb, child, &subtree_life, cost_vec); |
faa5399b RB |
2716 | subtree_life.truncate (0); |
2717 | } | |
2718 | } | |
6eddf228 RB |
2719 | } |
2720 | ||
69f11a13 IR |
2721 | /* Check if vectorization of the basic block is profitable. */ |
2722 | ||
2723 | static bool | |
2724 | vect_bb_vectorization_profitable_p (bb_vec_info bb_vinfo) | |
2725 | { | |
9771b263 | 2726 | vec<slp_instance> slp_instances = BB_VINFO_SLP_INSTANCES (bb_vinfo); |
69f11a13 | 2727 | slp_instance instance; |
1a4b99c1 | 2728 | int i; |
c3e7ee41 | 2729 | unsigned int vec_inside_cost = 0, vec_outside_cost = 0, scalar_cost = 0; |
92345349 | 2730 | unsigned int vec_prologue_cost = 0, vec_epilogue_cost = 0; |
69f11a13 IR |
2731 | |
2732 | /* Calculate scalar cost. */ | |
a296d6d3 RB |
2733 | stmt_vector_for_cost scalar_costs; |
2734 | scalar_costs.create (0); | |
6eddf228 | 2735 | FOR_EACH_VEC_ELT (slp_instances, i, instance) |
69f11a13 | 2736 | { |
00f96dc9 | 2737 | auto_vec<bool, 20> life; |
ff4c81cc | 2738 | life.safe_grow_cleared (SLP_INSTANCE_GROUP_SIZE (instance)); |
a296d6d3 RB |
2739 | vect_bb_slp_scalar_cost (BB_VINFO_BB (bb_vinfo), |
2740 | SLP_INSTANCE_TREE (instance), | |
2741 | &life, &scalar_costs); | |
2742 | } | |
2743 | void *target_cost_data = init_cost (NULL); | |
68435eb2 | 2744 | add_stmt_costs (target_cost_data, &scalar_costs); |
a296d6d3 RB |
2745 | scalar_costs.release (); |
2746 | unsigned dummy; | |
2747 | finish_cost (target_cost_data, &dummy, &scalar_cost, &dummy); | |
2748 | destroy_cost_data (target_cost_data); | |
69f11a13 | 2749 | |
b555a2e4 RB |
2750 | /* Unset visited flag. */ |
2751 | for (gimple_stmt_iterator gsi = bb_vinfo->region_begin; | |
2752 | gsi_stmt (gsi) != gsi_stmt (bb_vinfo->region_end); gsi_next (&gsi)) | |
2753 | gimple_set_visited (gsi_stmt (gsi), false); | |
2754 | ||
c3e7ee41 | 2755 | /* Complete the target-specific cost calculation. */ |
92345349 BS |
2756 | finish_cost (BB_VINFO_TARGET_COST_DATA (bb_vinfo), &vec_prologue_cost, |
2757 | &vec_inside_cost, &vec_epilogue_cost); | |
2758 | ||
2759 | vec_outside_cost = vec_prologue_cost + vec_epilogue_cost; | |
c3e7ee41 | 2760 | |
73fbfcad | 2761 | if (dump_enabled_p ()) |
69f11a13 | 2762 | { |
78c60e3d SS |
2763 | dump_printf_loc (MSG_NOTE, vect_location, "Cost model analysis: \n"); |
2764 | dump_printf (MSG_NOTE, " Vector inside of basic block cost: %d\n", | |
2765 | vec_inside_cost); | |
2766 | dump_printf (MSG_NOTE, " Vector prologue cost: %d\n", vec_prologue_cost); | |
2767 | dump_printf (MSG_NOTE, " Vector epilogue cost: %d\n", vec_epilogue_cost); | |
e645e942 | 2768 | dump_printf (MSG_NOTE, " Scalar cost of basic block: %d\n", scalar_cost); |
69f11a13 IR |
2769 | } |
2770 | ||
a6524bba RB |
2771 | /* Vectorization is profitable if its cost is more than the cost of scalar |
2772 | version. Note that we err on the vector side for equal cost because | |
2773 | the cost estimate is otherwise quite pessimistic (constant uses are | |
2774 | free on the scalar side but cost a load on the vector side for | |
2775 | example). */ | |
2776 | if (vec_outside_cost + vec_inside_cost > scalar_cost) | |
69f11a13 IR |
2777 | return false; |
2778 | ||
2779 | return true; | |
2780 | } | |
2781 | ||
a5b50aa1 RB |
2782 | /* Check if the basic block can be vectorized. Returns a bb_vec_info |
2783 | if so and sets fatal to true if failure is independent of | |
2784 | current_vector_size. */ | |
a70d6342 | 2785 | |
8e19f5a1 | 2786 | static bb_vec_info |
61d371eb RB |
2787 | vect_slp_analyze_bb_1 (gimple_stmt_iterator region_begin, |
2788 | gimple_stmt_iterator region_end, | |
a5b50aa1 RB |
2789 | vec<data_reference_p> datarefs, int n_stmts, |
2790 | bool &fatal) | |
a70d6342 IR |
2791 | { |
2792 | bb_vec_info bb_vinfo; | |
a70d6342 | 2793 | slp_instance instance; |
8e19f5a1 | 2794 | int i; |
d9f21f6a | 2795 | poly_uint64 min_vf = 2; |
e4a707c4 | 2796 | |
a5b50aa1 RB |
2797 | /* The first group of checks is independent of the vector size. */ |
2798 | fatal = true; | |
2799 | ||
61d371eb RB |
2800 | if (n_stmts > PARAM_VALUE (PARAM_SLP_MAX_INSNS_IN_BB)) |
2801 | { | |
2802 | if (dump_enabled_p ()) | |
2803 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, | |
2804 | "not vectorized: too many instructions in " | |
2805 | "basic block.\n"); | |
2806 | free_data_refs (datarefs); | |
2807 | return NULL; | |
2808 | } | |
2809 | ||
2c515559 | 2810 | bb_vinfo = new _bb_vec_info (region_begin, region_end); |
a70d6342 IR |
2811 | if (!bb_vinfo) |
2812 | return NULL; | |
2813 | ||
61d371eb | 2814 | BB_VINFO_DATAREFS (bb_vinfo) = datarefs; |
428db0ba RB |
2815 | |
2816 | /* Analyze the data references. */ | |
2817 | ||
2818 | if (!vect_analyze_data_refs (bb_vinfo, &min_vf)) | |
a70d6342 | 2819 | { |
73fbfcad | 2820 | if (dump_enabled_p ()) |
78c60e3d SS |
2821 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
2822 | "not vectorized: unhandled data-ref in basic " | |
2823 | "block.\n"); | |
b8698a0f | 2824 | |
2c515559 | 2825 | delete bb_vinfo; |
a70d6342 IR |
2826 | return NULL; |
2827 | } | |
2828 | ||
fcac74a1 | 2829 | if (BB_VINFO_DATAREFS (bb_vinfo).length () < 2) |
a70d6342 | 2830 | { |
73fbfcad | 2831 | if (dump_enabled_p ()) |
78c60e3d SS |
2832 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
2833 | "not vectorized: not enough data-refs in " | |
2834 | "basic block.\n"); | |
a70d6342 | 2835 | |
2c515559 | 2836 | delete bb_vinfo; |
a70d6342 IR |
2837 | return NULL; |
2838 | } | |
2839 | ||
310213d4 | 2840 | if (!vect_analyze_data_ref_accesses (bb_vinfo)) |
5abe1e05 RB |
2841 | { |
2842 | if (dump_enabled_p ()) | |
2843 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, | |
2844 | "not vectorized: unhandled data access in " | |
2845 | "basic block.\n"); | |
2846 | ||
2c515559 | 2847 | delete bb_vinfo; |
5abe1e05 RB |
2848 | return NULL; |
2849 | } | |
2850 | ||
a5b50aa1 RB |
2851 | /* If there are no grouped stores in the region there is no need |
2852 | to continue with pattern recog as vect_analyze_slp will fail | |
2853 | anyway. */ | |
2854 | if (bb_vinfo->grouped_stores.is_empty ()) | |
a70d6342 | 2855 | { |
73fbfcad | 2856 | if (dump_enabled_p ()) |
a5b50aa1 RB |
2857 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
2858 | "not vectorized: no grouped stores in " | |
2859 | "basic block.\n"); | |
b8698a0f | 2860 | |
2c515559 | 2861 | delete bb_vinfo; |
a70d6342 IR |
2862 | return NULL; |
2863 | } | |
b8698a0f | 2864 | |
a5b50aa1 RB |
2865 | /* While the rest of the analysis below depends on it in some way. */ |
2866 | fatal = false; | |
2867 | ||
2868 | vect_pattern_recog (bb_vinfo); | |
2869 | ||
a70d6342 IR |
2870 | /* Check the SLP opportunities in the basic block, analyze and build SLP |
2871 | trees. */ | |
310213d4 | 2872 | if (!vect_analyze_slp (bb_vinfo, n_stmts)) |
a70d6342 | 2873 | { |
73fbfcad | 2874 | if (dump_enabled_p ()) |
effb52da RB |
2875 | { |
2876 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, | |
2877 | "Failed to SLP the basic block.\n"); | |
2878 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, | |
2879 | "not vectorized: failed to find SLP opportunities " | |
2880 | "in basic block.\n"); | |
2881 | } | |
a70d6342 | 2882 | |
2c515559 | 2883 | delete bb_vinfo; |
a70d6342 IR |
2884 | return NULL; |
2885 | } | |
b8698a0f | 2886 | |
62c8a2cf RS |
2887 | vect_record_base_alignments (bb_vinfo); |
2888 | ||
c2a12ca0 RB |
2889 | /* Analyze and verify the alignment of data references and the |
2890 | dependence in the SLP instances. */ | |
a5b50aa1 RB |
2891 | for (i = 0; BB_VINFO_SLP_INSTANCES (bb_vinfo).iterate (i, &instance); ) |
2892 | { | |
c2a12ca0 RB |
2893 | if (! vect_slp_analyze_and_verify_instance_alignment (instance) |
2894 | || ! vect_slp_analyze_instance_dependence (instance)) | |
a5b50aa1 RB |
2895 | { |
2896 | dump_printf_loc (MSG_NOTE, vect_location, | |
2897 | "removing SLP instance operations starting from: "); | |
2898 | dump_gimple_stmt (MSG_NOTE, TDF_SLIM, | |
2899 | SLP_TREE_SCALAR_STMTS | |
2900 | (SLP_INSTANCE_TREE (instance))[0], 0); | |
2901 | vect_free_slp_instance (instance); | |
2902 | BB_VINFO_SLP_INSTANCES (bb_vinfo).ordered_remove (i); | |
2903 | continue; | |
2904 | } | |
c2a12ca0 RB |
2905 | |
2906 | /* Mark all the statements that we want to vectorize as pure SLP and | |
2907 | relevant. */ | |
2908 | vect_mark_slp_stmts (SLP_INSTANCE_TREE (instance), pure_slp, -1); | |
2909 | vect_mark_slp_stmts_relevant (SLP_INSTANCE_TREE (instance)); | |
2910 | ||
a5b50aa1 RB |
2911 | i++; |
2912 | } | |
a5b50aa1 RB |
2913 | if (! BB_VINFO_SLP_INSTANCES (bb_vinfo).length ()) |
2914 | { | |
2c515559 | 2915 | delete bb_vinfo; |
a5b50aa1 RB |
2916 | return NULL; |
2917 | } | |
2918 | ||
8b7e9dba | 2919 | if (!vect_slp_analyze_operations (bb_vinfo)) |
a70d6342 | 2920 | { |
73fbfcad | 2921 | if (dump_enabled_p ()) |
e645e942 | 2922 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
78c60e3d | 2923 | "not vectorized: bad operation in basic block.\n"); |
a70d6342 | 2924 | |
2c515559 | 2925 | delete bb_vinfo; |
a70d6342 IR |
2926 | return NULL; |
2927 | } | |
2928 | ||
69f11a13 | 2929 | /* Cost model: check if the vectorization is worthwhile. */ |
8b5e1202 | 2930 | if (!unlimited_cost_model (NULL) |
69f11a13 IR |
2931 | && !vect_bb_vectorization_profitable_p (bb_vinfo)) |
2932 | { | |
73fbfcad | 2933 | if (dump_enabled_p ()) |
78c60e3d SS |
2934 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, |
2935 | "not vectorized: vectorization is not " | |
2936 | "profitable.\n"); | |
69f11a13 | 2937 | |
2c515559 | 2938 | delete bb_vinfo; |
69f11a13 IR |
2939 | return NULL; |
2940 | } | |
2941 | ||
73fbfcad | 2942 | if (dump_enabled_p ()) |
78c60e3d SS |
2943 | dump_printf_loc (MSG_NOTE, vect_location, |
2944 | "Basic block will be vectorized using SLP\n"); | |
a70d6342 IR |
2945 | |
2946 | return bb_vinfo; | |
2947 | } | |
2948 | ||
2949 | ||
428db0ba RB |
2950 | /* Main entry for the BB vectorizer. Analyze and transform BB, returns |
2951 | true if anything in the basic-block was vectorized. */ | |
2952 | ||
2953 | bool | |
2954 | vect_slp_bb (basic_block bb) | |
8e19f5a1 IR |
2955 | { |
2956 | bb_vec_info bb_vinfo; | |
8e19f5a1 | 2957 | gimple_stmt_iterator gsi; |
61d371eb | 2958 | bool any_vectorized = false; |
86e36728 | 2959 | auto_vector_sizes vector_sizes; |
8e19f5a1 | 2960 | |
73fbfcad | 2961 | if (dump_enabled_p ()) |
78c60e3d | 2962 | dump_printf_loc (MSG_NOTE, vect_location, "===vect_slp_analyze_bb===\n"); |
8e19f5a1 | 2963 | |
8e19f5a1 IR |
2964 | /* Autodetect first vector size we try. */ |
2965 | current_vector_size = 0; | |
86e36728 RS |
2966 | targetm.vectorize.autovectorize_vector_sizes (&vector_sizes); |
2967 | unsigned int next_size = 0; | |
8e19f5a1 | 2968 | |
61d371eb RB |
2969 | gsi = gsi_start_bb (bb); |
2970 | ||
86e36728 | 2971 | poly_uint64 autodetected_vector_size = 0; |
8e19f5a1 IR |
2972 | while (1) |
2973 | { | |
61d371eb RB |
2974 | if (gsi_end_p (gsi)) |
2975 | break; | |
2976 | ||
2977 | gimple_stmt_iterator region_begin = gsi; | |
2978 | vec<data_reference_p> datarefs = vNULL; | |
2979 | int insns = 0; | |
2980 | ||
2981 | for (; !gsi_end_p (gsi); gsi_next (&gsi)) | |
428db0ba | 2982 | { |
61d371eb RB |
2983 | gimple *stmt = gsi_stmt (gsi); |
2984 | if (is_gimple_debug (stmt)) | |
2985 | continue; | |
2986 | insns++; | |
2987 | ||
2988 | if (gimple_location (stmt) != UNKNOWN_LOCATION) | |
2989 | vect_location = gimple_location (stmt); | |
2990 | ||
2991 | if (!find_data_references_in_stmt (NULL, stmt, &datarefs)) | |
2992 | break; | |
2993 | } | |
2994 | ||
2995 | /* Skip leading unhandled stmts. */ | |
2996 | if (gsi_stmt (region_begin) == gsi_stmt (gsi)) | |
2997 | { | |
2998 | gsi_next (&gsi); | |
2999 | continue; | |
3000 | } | |
428db0ba | 3001 | |
61d371eb RB |
3002 | gimple_stmt_iterator region_end = gsi; |
3003 | ||
3004 | bool vectorized = false; | |
a5b50aa1 | 3005 | bool fatal = false; |
61d371eb | 3006 | bb_vinfo = vect_slp_analyze_bb_1 (region_begin, region_end, |
a5b50aa1 | 3007 | datarefs, insns, fatal); |
61d371eb RB |
3008 | if (bb_vinfo |
3009 | && dbg_cnt (vect_slp)) | |
3010 | { | |
428db0ba | 3011 | if (dump_enabled_p ()) |
61d371eb | 3012 | dump_printf_loc (MSG_NOTE, vect_location, "SLPing BB part\n"); |
428db0ba RB |
3013 | |
3014 | vect_schedule_slp (bb_vinfo); | |
3015 | ||
3016 | if (dump_enabled_p ()) | |
3017 | dump_printf_loc (MSG_NOTE, vect_location, | |
61d371eb | 3018 | "basic block part vectorized\n"); |
428db0ba | 3019 | |
61d371eb | 3020 | vectorized = true; |
428db0ba | 3021 | } |
2c515559 | 3022 | delete bb_vinfo; |
8e19f5a1 | 3023 | |
61d371eb | 3024 | any_vectorized |= vectorized; |
8e19f5a1 | 3025 | |
86e36728 RS |
3026 | if (next_size == 0) |
3027 | autodetected_vector_size = current_vector_size; | |
3028 | ||
3029 | if (next_size < vector_sizes.length () | |
3030 | && known_eq (vector_sizes[next_size], autodetected_vector_size)) | |
3031 | next_size += 1; | |
3032 | ||
61d371eb | 3033 | if (vectorized |
86e36728 RS |
3034 | || next_size == vector_sizes.length () |
3035 | || known_eq (current_vector_size, 0U) | |
a5b50aa1 RB |
3036 | /* If vect_slp_analyze_bb_1 signaled that analysis for all |
3037 | vector sizes will fail do not bother iterating. */ | |
3038 | || fatal) | |
61d371eb RB |
3039 | { |
3040 | if (gsi_end_p (region_end)) | |
3041 | break; | |
8e19f5a1 | 3042 | |
61d371eb RB |
3043 | /* Skip the unhandled stmt. */ |
3044 | gsi_next (&gsi); | |
3045 | ||
3046 | /* And reset vector sizes. */ | |
3047 | current_vector_size = 0; | |
86e36728 | 3048 | next_size = 0; |
61d371eb RB |
3049 | } |
3050 | else | |
3051 | { | |
3052 | /* Try the next biggest vector size. */ | |
86e36728 | 3053 | current_vector_size = vector_sizes[next_size++]; |
61d371eb | 3054 | if (dump_enabled_p ()) |
86e36728 RS |
3055 | { |
3056 | dump_printf_loc (MSG_NOTE, vect_location, | |
3057 | "***** Re-trying analysis with " | |
3058 | "vector size "); | |
3059 | dump_dec (MSG_NOTE, current_vector_size); | |
3060 | dump_printf (MSG_NOTE, "\n"); | |
3061 | } | |
61d371eb RB |
3062 | |
3063 | /* Start over. */ | |
3064 | gsi = region_begin; | |
3065 | } | |
8e19f5a1 | 3066 | } |
61d371eb RB |
3067 | |
3068 | return any_vectorized; | |
8e19f5a1 IR |
3069 | } |
3070 | ||
3071 | ||
e4af0bc4 IE |
3072 | /* Return 1 if vector type of boolean constant which is OPNUM |
3073 | operand in statement STMT is a boolean vector. */ | |
3074 | ||
3075 | static bool | |
3076 | vect_mask_constant_operand_p (gimple *stmt, int opnum) | |
3077 | { | |
3078 | stmt_vec_info stmt_vinfo = vinfo_for_stmt (stmt); | |
3079 | enum tree_code code = gimple_expr_code (stmt); | |
3080 | tree op, vectype; | |
3081 | gimple *def_stmt; | |
3082 | enum vect_def_type dt; | |
3083 | ||
3084 | /* For comparison and COND_EXPR type is chosen depending | |
3085 | on the other comparison operand. */ | |
3086 | if (TREE_CODE_CLASS (code) == tcc_comparison) | |
3087 | { | |
3088 | if (opnum) | |
3089 | op = gimple_assign_rhs1 (stmt); | |
3090 | else | |
3091 | op = gimple_assign_rhs2 (stmt); | |
3092 | ||
3093 | if (!vect_is_simple_use (op, stmt_vinfo->vinfo, &def_stmt, | |
3094 | &dt, &vectype)) | |
3095 | gcc_unreachable (); | |
3096 | ||
3097 | return !vectype || VECTOR_BOOLEAN_TYPE_P (vectype); | |
3098 | } | |
3099 | ||
3100 | if (code == COND_EXPR) | |
3101 | { | |
3102 | tree cond = gimple_assign_rhs1 (stmt); | |
3103 | ||
3104 | if (TREE_CODE (cond) == SSA_NAME) | |
7b1b0cc1 RB |
3105 | op = cond; |
3106 | else if (opnum) | |
e4af0bc4 IE |
3107 | op = TREE_OPERAND (cond, 1); |
3108 | else | |
3109 | op = TREE_OPERAND (cond, 0); | |
3110 | ||
3111 | if (!vect_is_simple_use (op, stmt_vinfo->vinfo, &def_stmt, | |
3112 | &dt, &vectype)) | |
3113 | gcc_unreachable (); | |
3114 | ||
3115 | return !vectype || VECTOR_BOOLEAN_TYPE_P (vectype); | |
3116 | } | |
3117 | ||
3118 | return VECTOR_BOOLEAN_TYPE_P (STMT_VINFO_VECTYPE (stmt_vinfo)); | |
3119 | } | |
3120 | ||
018b2744 RS |
3121 | /* Build a variable-length vector in which the elements in ELTS are repeated |
3122 | to a fill NRESULTS vectors of type VECTOR_TYPE. Store the vectors in | |
3123 | RESULTS and add any new instructions to SEQ. | |
3124 | ||
3125 | The approach we use is: | |
3126 | ||
3127 | (1) Find a vector mode VM with integer elements of mode IM. | |
3128 | ||
3129 | (2) Replace ELTS[0:NELTS] with ELTS'[0:NELTS'], where each element of | |
3130 | ELTS' has mode IM. This involves creating NELTS' VIEW_CONVERT_EXPRs | |
3131 | from small vectors to IM. | |
3132 | ||
3133 | (3) Duplicate each ELTS'[I] into a vector of mode VM. | |
3134 | ||
3135 | (4) Use a tree of interleaving VEC_PERM_EXPRs to create VMs with the | |
3136 | correct byte contents. | |
3137 | ||
3138 | (5) Use VIEW_CONVERT_EXPR to cast the final VMs to the required type. | |
3139 | ||
3140 | We try to find the largest IM for which this sequence works, in order | |
3141 | to cut down on the number of interleaves. */ | |
3142 | ||
f1739b48 | 3143 | void |
018b2744 RS |
3144 | duplicate_and_interleave (gimple_seq *seq, tree vector_type, vec<tree> elts, |
3145 | unsigned int nresults, vec<tree> &results) | |
3146 | { | |
3147 | unsigned int nelts = elts.length (); | |
3148 | tree element_type = TREE_TYPE (vector_type); | |
3149 | ||
3150 | /* (1) Find a vector mode VM with integer elements of mode IM. */ | |
3151 | unsigned int nvectors = 1; | |
3152 | tree new_vector_type; | |
3153 | tree permutes[2]; | |
3154 | if (!can_duplicate_and_interleave_p (nelts, TYPE_MODE (element_type), | |
3155 | &nvectors, &new_vector_type, | |
3156 | permutes)) | |
3157 | gcc_unreachable (); | |
3158 | ||
3159 | /* Get a vector type that holds ELTS[0:NELTS/NELTS']. */ | |
3160 | unsigned int partial_nelts = nelts / nvectors; | |
3161 | tree partial_vector_type = build_vector_type (element_type, partial_nelts); | |
3162 | ||
3163 | tree_vector_builder partial_elts; | |
3164 | auto_vec<tree, 32> pieces (nvectors * 2); | |
3165 | pieces.quick_grow (nvectors * 2); | |
3166 | for (unsigned int i = 0; i < nvectors; ++i) | |
3167 | { | |
3168 | /* (2) Replace ELTS[0:NELTS] with ELTS'[0:NELTS'], where each element of | |
3169 | ELTS' has mode IM. */ | |
3170 | partial_elts.new_vector (partial_vector_type, partial_nelts, 1); | |
3171 | for (unsigned int j = 0; j < partial_nelts; ++j) | |
3172 | partial_elts.quick_push (elts[i * partial_nelts + j]); | |
3173 | tree t = gimple_build_vector (seq, &partial_elts); | |
3174 | t = gimple_build (seq, VIEW_CONVERT_EXPR, | |
3175 | TREE_TYPE (new_vector_type), t); | |
3176 | ||
3177 | /* (3) Duplicate each ELTS'[I] into a vector of mode VM. */ | |
3178 | pieces[i] = gimple_build_vector_from_val (seq, new_vector_type, t); | |
3179 | } | |
3180 | ||
3181 | /* (4) Use a tree of VEC_PERM_EXPRs to create a single VM with the | |
3182 | correct byte contents. | |
3183 | ||
3184 | We need to repeat the following operation log2(nvectors) times: | |
3185 | ||
3186 | out[i * 2] = VEC_PERM_EXPR (in[i], in[i + hi_start], lo_permute); | |
3187 | out[i * 2 + 1] = VEC_PERM_EXPR (in[i], in[i + hi_start], hi_permute); | |
3188 | ||
3189 | However, if each input repeats every N elements and the VF is | |
3190 | a multiple of N * 2, the HI result is the same as the LO. */ | |
3191 | unsigned int in_start = 0; | |
3192 | unsigned int out_start = nvectors; | |
3193 | unsigned int hi_start = nvectors / 2; | |
3194 | /* A bound on the number of outputs needed to produce NRESULTS results | |
3195 | in the final iteration. */ | |
3196 | unsigned int noutputs_bound = nvectors * nresults; | |
3197 | for (unsigned int in_repeat = 1; in_repeat < nvectors; in_repeat *= 2) | |
3198 | { | |
3199 | noutputs_bound /= 2; | |
3200 | unsigned int limit = MIN (noutputs_bound, nvectors); | |
3201 | for (unsigned int i = 0; i < limit; ++i) | |
3202 | { | |
3203 | if ((i & 1) != 0 | |
3204 | && multiple_p (TYPE_VECTOR_SUBPARTS (new_vector_type), | |
3205 | 2 * in_repeat)) | |
3206 | { | |
3207 | pieces[out_start + i] = pieces[out_start + i - 1]; | |
3208 | continue; | |
3209 | } | |
3210 | ||
3211 | tree output = make_ssa_name (new_vector_type); | |
3212 | tree input1 = pieces[in_start + (i / 2)]; | |
3213 | tree input2 = pieces[in_start + (i / 2) + hi_start]; | |
3214 | gassign *stmt = gimple_build_assign (output, VEC_PERM_EXPR, | |
3215 | input1, input2, | |
3216 | permutes[i & 1]); | |
3217 | gimple_seq_add_stmt (seq, stmt); | |
3218 | pieces[out_start + i] = output; | |
3219 | } | |
3220 | std::swap (in_start, out_start); | |
3221 | } | |
3222 | ||
3223 | /* (5) Use VIEW_CONVERT_EXPR to cast the final VM to the required type. */ | |
3224 | results.reserve (nresults); | |
3225 | for (unsigned int i = 0; i < nresults; ++i) | |
3226 | if (i < nvectors) | |
3227 | results.quick_push (gimple_build (seq, VIEW_CONVERT_EXPR, vector_type, | |
3228 | pieces[in_start + i])); | |
3229 | else | |
3230 | results.quick_push (results[i - nvectors]); | |
3231 | } | |
3232 | ||
e4af0bc4 | 3233 | |
b8698a0f L |
3234 | /* For constant and loop invariant defs of SLP_NODE this function returns |
3235 | (vector) defs (VEC_OPRNDS) that will be used in the vectorized stmts. | |
d59dc888 IR |
3236 | OP_NUM determines if we gather defs for operand 0 or operand 1 of the RHS of |
3237 | scalar stmts. NUMBER_OF_VECTORS is the number of vector defs to create. | |
b5aeb3bb IR |
3238 | REDUC_INDEX is the index of the reduction operand in the statements, unless |
3239 | it is -1. */ | |
ebfd146a IR |
3240 | |
3241 | static void | |
9dc3f7de | 3242 | vect_get_constant_vectors (tree op, slp_tree slp_node, |
9771b263 | 3243 | vec<tree> *vec_oprnds, |
306b0c92 | 3244 | unsigned int op_num, unsigned int number_of_vectors) |
ebfd146a | 3245 | { |
355fe088 TS |
3246 | vec<gimple *> stmts = SLP_TREE_SCALAR_STMTS (slp_node); |
3247 | gimple *stmt = stmts[0]; | |
ebfd146a | 3248 | stmt_vec_info stmt_vinfo = vinfo_for_stmt (stmt); |
018b2744 | 3249 | unsigned HOST_WIDE_INT nunits; |
ebfd146a | 3250 | tree vec_cst; |
d2a12ae7 | 3251 | unsigned j, number_of_places_left_in_vector; |
ebfd146a | 3252 | tree vector_type; |
9dc3f7de | 3253 | tree vop; |
9771b263 | 3254 | int group_size = stmts.length (); |
ebfd146a | 3255 | unsigned int vec_num, i; |
d2a12ae7 | 3256 | unsigned number_of_copies = 1; |
9771b263 DN |
3257 | vec<tree> voprnds; |
3258 | voprnds.create (number_of_vectors); | |
ebfd146a | 3259 | bool constant_p, is_store; |
b5aeb3bb | 3260 | tree neutral_op = NULL; |
bac430c9 | 3261 | enum tree_code code = gimple_expr_code (stmt); |
13396b6e | 3262 | gimple_seq ctor_seq = NULL; |
018b2744 | 3263 | auto_vec<tree, 16> permute_results; |
b5aeb3bb | 3264 | |
42fd8198 | 3265 | /* Check if vector type is a boolean vector. */ |
2568d8a1 | 3266 | if (VECT_SCALAR_BOOLEAN_TYPE_P (TREE_TYPE (op)) |
e4af0bc4 | 3267 | && vect_mask_constant_operand_p (stmt, op_num)) |
42fd8198 IE |
3268 | vector_type |
3269 | = build_same_sized_truth_vector_type (STMT_VINFO_VECTYPE (stmt_vinfo)); | |
3270 | else | |
3271 | vector_type = get_vectype_for_scalar_type (TREE_TYPE (op)); | |
afbe6325 | 3272 | |
ebfd146a IR |
3273 | if (STMT_VINFO_DATA_REF (stmt_vinfo)) |
3274 | { | |
3275 | is_store = true; | |
3276 | op = gimple_assign_rhs1 (stmt); | |
3277 | } | |
3278 | else | |
9dc3f7de IR |
3279 | is_store = false; |
3280 | ||
3281 | gcc_assert (op); | |
ebfd146a | 3282 | |
ebfd146a | 3283 | /* NUMBER_OF_COPIES is the number of times we need to use the same values in |
b8698a0f | 3284 | created vectors. It is greater than 1 if unrolling is performed. |
ebfd146a IR |
3285 | |
3286 | For example, we have two scalar operands, s1 and s2 (e.g., group of | |
3287 | strided accesses of size two), while NUNITS is four (i.e., four scalars | |
f7e531cf IR |
3288 | of this type can be packed in a vector). The output vector will contain |
3289 | two copies of each scalar operand: {s1, s2, s1, s2}. (NUMBER_OF_COPIES | |
ebfd146a IR |
3290 | will be 2). |
3291 | ||
b8698a0f | 3292 | If GROUP_SIZE > NUNITS, the scalars will be split into several vectors |
ebfd146a IR |
3293 | containing the operands. |
3294 | ||
3295 | For example, NUNITS is four as before, and the group size is 8 | |
f7e531cf | 3296 | (s1, s2, ..., s8). We will create two vectors {s1, s2, s3, s4} and |
ebfd146a | 3297 | {s5, s6, s7, s8}. */ |
b8698a0f | 3298 | |
018b2744 RS |
3299 | /* When using duplicate_and_interleave, we just need one element for |
3300 | each scalar statement. */ | |
3301 | if (!TYPE_VECTOR_SUBPARTS (vector_type).is_constant (&nunits)) | |
3302 | nunits = group_size; | |
3303 | ||
14a61437 | 3304 | number_of_copies = nunits * number_of_vectors / group_size; |
ebfd146a IR |
3305 | |
3306 | number_of_places_left_in_vector = nunits; | |
62cf7335 | 3307 | constant_p = true; |
5ebaa477 | 3308 | tree_vector_builder elts (vector_type, nunits, 1); |
794e3180 | 3309 | elts.quick_grow (nunits); |
90dd6e3d | 3310 | bool place_after_defs = false; |
ebfd146a IR |
3311 | for (j = 0; j < number_of_copies; j++) |
3312 | { | |
9771b263 | 3313 | for (i = group_size - 1; stmts.iterate (i, &stmt); i--) |
ebfd146a IR |
3314 | { |
3315 | if (is_store) | |
3316 | op = gimple_assign_rhs1 (stmt); | |
bac430c9 | 3317 | else |
f7e531cf | 3318 | { |
bac430c9 | 3319 | switch (code) |
f7e531cf | 3320 | { |
bac430c9 | 3321 | case COND_EXPR: |
a989bcc3 IE |
3322 | { |
3323 | tree cond = gimple_assign_rhs1 (stmt); | |
3324 | if (TREE_CODE (cond) == SSA_NAME) | |
3325 | op = gimple_op (stmt, op_num + 1); | |
3326 | else if (op_num == 0 || op_num == 1) | |
bac430c9 | 3327 | op = TREE_OPERAND (cond, op_num); |
a989bcc3 IE |
3328 | else |
3329 | { | |
3330 | if (op_num == 2) | |
3331 | op = gimple_assign_rhs2 (stmt); | |
3332 | else | |
3333 | op = gimple_assign_rhs3 (stmt); | |
3334 | } | |
3335 | } | |
bac430c9 IR |
3336 | break; |
3337 | ||
3338 | case CALL_EXPR: | |
3339 | op = gimple_call_arg (stmt, op_num); | |
3340 | break; | |
3341 | ||
b84b294a JJ |
3342 | case LSHIFT_EXPR: |
3343 | case RSHIFT_EXPR: | |
3344 | case LROTATE_EXPR: | |
3345 | case RROTATE_EXPR: | |
3346 | op = gimple_op (stmt, op_num + 1); | |
3347 | /* Unlike the other binary operators, shifts/rotates have | |
3348 | the shift count being int, instead of the same type as | |
3349 | the lhs, so make sure the scalar is the right type if | |
3350 | we are dealing with vectors of | |
3351 | long long/long/short/char. */ | |
793d9a16 | 3352 | if (op_num == 1 && TREE_CODE (op) == INTEGER_CST) |
b84b294a JJ |
3353 | op = fold_convert (TREE_TYPE (vector_type), op); |
3354 | break; | |
3355 | ||
bac430c9 IR |
3356 | default: |
3357 | op = gimple_op (stmt, op_num + 1); | |
b84b294a | 3358 | break; |
f7e531cf IR |
3359 | } |
3360 | } | |
b8698a0f | 3361 | |
ebfd146a | 3362 | /* Create 'vect_ = {op0,op1,...,opn}'. */ |
ebfd146a | 3363 | number_of_places_left_in_vector--; |
90dd6e3d | 3364 | tree orig_op = op; |
13396b6e | 3365 | if (!types_compatible_p (TREE_TYPE (vector_type), TREE_TYPE (op))) |
50eeef09 | 3366 | { |
793d9a16 | 3367 | if (CONSTANT_CLASS_P (op)) |
13396b6e | 3368 | { |
42fd8198 IE |
3369 | if (VECTOR_BOOLEAN_TYPE_P (vector_type)) |
3370 | { | |
3371 | /* Can't use VIEW_CONVERT_EXPR for booleans because | |
3372 | of possibly different sizes of scalar value and | |
3373 | vector element. */ | |
3374 | if (integer_zerop (op)) | |
3375 | op = build_int_cst (TREE_TYPE (vector_type), 0); | |
3376 | else if (integer_onep (op)) | |
158beb4a | 3377 | op = build_all_ones_cst (TREE_TYPE (vector_type)); |
42fd8198 IE |
3378 | else |
3379 | gcc_unreachable (); | |
3380 | } | |
3381 | else | |
3382 | op = fold_unary (VIEW_CONVERT_EXPR, | |
3383 | TREE_TYPE (vector_type), op); | |
13396b6e JJ |
3384 | gcc_assert (op && CONSTANT_CLASS_P (op)); |
3385 | } | |
3386 | else | |
3387 | { | |
b731b390 | 3388 | tree new_temp = make_ssa_name (TREE_TYPE (vector_type)); |
355fe088 | 3389 | gimple *init_stmt; |
262a363f JJ |
3390 | if (VECTOR_BOOLEAN_TYPE_P (vector_type)) |
3391 | { | |
158beb4a JJ |
3392 | tree true_val |
3393 | = build_all_ones_cst (TREE_TYPE (vector_type)); | |
3394 | tree false_val | |
3395 | = build_zero_cst (TREE_TYPE (vector_type)); | |
7c285ab9 | 3396 | gcc_assert (INTEGRAL_TYPE_P (TREE_TYPE (op))); |
158beb4a JJ |
3397 | init_stmt = gimple_build_assign (new_temp, COND_EXPR, |
3398 | op, true_val, | |
3399 | false_val); | |
262a363f | 3400 | } |
262a363f JJ |
3401 | else |
3402 | { | |
3403 | op = build1 (VIEW_CONVERT_EXPR, TREE_TYPE (vector_type), | |
3404 | op); | |
3405 | init_stmt | |
3406 | = gimple_build_assign (new_temp, VIEW_CONVERT_EXPR, | |
3407 | op); | |
3408 | } | |
13396b6e JJ |
3409 | gimple_seq_add_stmt (&ctor_seq, init_stmt); |
3410 | op = new_temp; | |
3411 | } | |
50eeef09 | 3412 | } |
d2a12ae7 | 3413 | elts[number_of_places_left_in_vector] = op; |
793d9a16 RB |
3414 | if (!CONSTANT_CLASS_P (op)) |
3415 | constant_p = false; | |
90dd6e3d RB |
3416 | if (TREE_CODE (orig_op) == SSA_NAME |
3417 | && !SSA_NAME_IS_DEFAULT_DEF (orig_op) | |
3418 | && STMT_VINFO_BB_VINFO (stmt_vinfo) | |
3419 | && (STMT_VINFO_BB_VINFO (stmt_vinfo)->bb | |
3420 | == gimple_bb (SSA_NAME_DEF_STMT (orig_op)))) | |
3421 | place_after_defs = true; | |
ebfd146a IR |
3422 | |
3423 | if (number_of_places_left_in_vector == 0) | |
3424 | { | |
018b2744 RS |
3425 | if (constant_p |
3426 | ? multiple_p (TYPE_VECTOR_SUBPARTS (vector_type), nunits) | |
3427 | : known_eq (TYPE_VECTOR_SUBPARTS (vector_type), nunits)) | |
3428 | vec_cst = gimple_build_vector (&ctor_seq, &elts); | |
ebfd146a | 3429 | else |
d2a12ae7 | 3430 | { |
018b2744 RS |
3431 | if (vec_oprnds->is_empty ()) |
3432 | duplicate_and_interleave (&ctor_seq, vector_type, elts, | |
3433 | number_of_vectors, | |
3434 | permute_results); | |
3435 | vec_cst = permute_results[number_of_vectors - j - 1]; | |
d2a12ae7 | 3436 | } |
90dd6e3d RB |
3437 | tree init; |
3438 | gimple_stmt_iterator gsi; | |
3439 | if (place_after_defs) | |
3440 | { | |
3441 | gsi = gsi_for_stmt | |
3442 | (vect_find_last_scalar_stmt_in_slp (slp_node)); | |
3443 | init = vect_init_vector (stmt, vec_cst, vector_type, &gsi); | |
3444 | } | |
3445 | else | |
3446 | init = vect_init_vector (stmt, vec_cst, vector_type, NULL); | |
13396b6e JJ |
3447 | if (ctor_seq != NULL) |
3448 | { | |
90dd6e3d | 3449 | gsi = gsi_for_stmt (SSA_NAME_DEF_STMT (init)); |
018b2744 | 3450 | gsi_insert_seq_before (&gsi, ctor_seq, GSI_SAME_STMT); |
13396b6e JJ |
3451 | ctor_seq = NULL; |
3452 | } | |
90dd6e3d RB |
3453 | voprnds.quick_push (init); |
3454 | place_after_defs = false; | |
62cf7335 RB |
3455 | number_of_places_left_in_vector = nunits; |
3456 | constant_p = true; | |
5ebaa477 RS |
3457 | elts.new_vector (vector_type, nunits, 1); |
3458 | elts.quick_grow (nunits); | |
ebfd146a IR |
3459 | } |
3460 | } | |
3461 | } | |
3462 | ||
b8698a0f | 3463 | /* Since the vectors are created in the reverse order, we should invert |
ebfd146a | 3464 | them. */ |
9771b263 | 3465 | vec_num = voprnds.length (); |
d2a12ae7 | 3466 | for (j = vec_num; j != 0; j--) |
ebfd146a | 3467 | { |
9771b263 DN |
3468 | vop = voprnds[j - 1]; |
3469 | vec_oprnds->quick_push (vop); | |
ebfd146a IR |
3470 | } |
3471 | ||
9771b263 | 3472 | voprnds.release (); |
ebfd146a IR |
3473 | |
3474 | /* In case that VF is greater than the unrolling factor needed for the SLP | |
b8698a0f L |
3475 | group of stmts, NUMBER_OF_VECTORS to be created is greater than |
3476 | NUMBER_OF_SCALARS/NUNITS or NUNITS/NUMBER_OF_SCALARS, and hence we have | |
ebfd146a | 3477 | to replicate the vectors. */ |
9771b263 | 3478 | while (number_of_vectors > vec_oprnds->length ()) |
ebfd146a | 3479 | { |
b5aeb3bb IR |
3480 | tree neutral_vec = NULL; |
3481 | ||
3482 | if (neutral_op) | |
3483 | { | |
3484 | if (!neutral_vec) | |
b9acc9f1 | 3485 | neutral_vec = build_vector_from_val (vector_type, neutral_op); |
b5aeb3bb | 3486 | |
9771b263 | 3487 | vec_oprnds->quick_push (neutral_vec); |
b5aeb3bb IR |
3488 | } |
3489 | else | |
3490 | { | |
9771b263 DN |
3491 | for (i = 0; vec_oprnds->iterate (i, &vop) && i < vec_num; i++) |
3492 | vec_oprnds->quick_push (vop); | |
b5aeb3bb | 3493 | } |
ebfd146a IR |
3494 | } |
3495 | } | |
3496 | ||
3497 | ||
3498 | /* Get vectorized definitions from SLP_NODE that contains corresponding | |
3499 | vectorized def-stmts. */ | |
3500 | ||
3501 | static void | |
9771b263 | 3502 | vect_get_slp_vect_defs (slp_tree slp_node, vec<tree> *vec_oprnds) |
ebfd146a IR |
3503 | { |
3504 | tree vec_oprnd; | |
355fe088 | 3505 | gimple *vec_def_stmt; |
ebfd146a IR |
3506 | unsigned int i; |
3507 | ||
9771b263 | 3508 | gcc_assert (SLP_TREE_VEC_STMTS (slp_node).exists ()); |
ebfd146a | 3509 | |
9771b263 | 3510 | FOR_EACH_VEC_ELT (SLP_TREE_VEC_STMTS (slp_node), i, vec_def_stmt) |
ebfd146a IR |
3511 | { |
3512 | gcc_assert (vec_def_stmt); | |
e7baeb39 RB |
3513 | if (gimple_code (vec_def_stmt) == GIMPLE_PHI) |
3514 | vec_oprnd = gimple_phi_result (vec_def_stmt); | |
3515 | else | |
3516 | vec_oprnd = gimple_get_lhs (vec_def_stmt); | |
9771b263 | 3517 | vec_oprnds->quick_push (vec_oprnd); |
ebfd146a IR |
3518 | } |
3519 | } | |
3520 | ||
3521 | ||
b8698a0f L |
3522 | /* Get vectorized definitions for SLP_NODE. |
3523 | If the scalar definitions are loop invariants or constants, collect them and | |
ebfd146a IR |
3524 | call vect_get_constant_vectors() to create vector stmts. |
3525 | Otherwise, the def-stmts must be already vectorized and the vectorized stmts | |
d092494c IR |
3526 | must be stored in the corresponding child of SLP_NODE, and we call |
3527 | vect_get_slp_vect_defs () to retrieve them. */ | |
b8698a0f | 3528 | |
ebfd146a | 3529 | void |
9771b263 | 3530 | vect_get_slp_defs (vec<tree> ops, slp_tree slp_node, |
306b0c92 | 3531 | vec<vec<tree> > *vec_oprnds) |
ebfd146a | 3532 | { |
355fe088 | 3533 | gimple *first_stmt; |
d092494c | 3534 | int number_of_vects = 0, i; |
77eefb71 | 3535 | unsigned int child_index = 0; |
b8698a0f | 3536 | HOST_WIDE_INT lhs_size_unit, rhs_size_unit; |
d092494c | 3537 | slp_tree child = NULL; |
37b5ec8f | 3538 | vec<tree> vec_defs; |
e44978dc | 3539 | tree oprnd; |
77eefb71 | 3540 | bool vectorized_defs; |
ebfd146a | 3541 | |
9771b263 DN |
3542 | first_stmt = SLP_TREE_SCALAR_STMTS (slp_node)[0]; |
3543 | FOR_EACH_VEC_ELT (ops, i, oprnd) | |
ebfd146a | 3544 | { |
d092494c IR |
3545 | /* For each operand we check if it has vectorized definitions in a child |
3546 | node or we need to create them (for invariants and constants). We | |
3547 | check if the LHS of the first stmt of the next child matches OPRND. | |
3548 | If it does, we found the correct child. Otherwise, we call | |
77eefb71 RB |
3549 | vect_get_constant_vectors (), and not advance CHILD_INDEX in order |
3550 | to check this child node for the next operand. */ | |
3551 | vectorized_defs = false; | |
3552 | if (SLP_TREE_CHILDREN (slp_node).length () > child_index) | |
ebfd146a | 3553 | { |
01d8bf07 | 3554 | child = SLP_TREE_CHILDREN (slp_node)[child_index]; |
d092494c | 3555 | |
e44978dc | 3556 | /* We have to check both pattern and original def, if available. */ |
603cca93 | 3557 | if (SLP_TREE_DEF_TYPE (child) == vect_internal_def) |
e44978dc | 3558 | { |
355fe088 TS |
3559 | gimple *first_def = SLP_TREE_SCALAR_STMTS (child)[0]; |
3560 | gimple *related | |
90dd6e3d | 3561 | = STMT_VINFO_RELATED_STMT (vinfo_for_stmt (first_def)); |
e7baeb39 | 3562 | tree first_def_op; |
90dd6e3d | 3563 | |
e7baeb39 RB |
3564 | if (gimple_code (first_def) == GIMPLE_PHI) |
3565 | first_def_op = gimple_phi_result (first_def); | |
3566 | else | |
3567 | first_def_op = gimple_get_lhs (first_def); | |
3568 | if (operand_equal_p (oprnd, first_def_op, 0) | |
90dd6e3d RB |
3569 | || (related |
3570 | && operand_equal_p (oprnd, gimple_get_lhs (related), 0))) | |
3571 | { | |
3572 | /* The number of vector defs is determined by the number of | |
3573 | vector statements in the node from which we get those | |
3574 | statements. */ | |
3575 | number_of_vects = SLP_TREE_NUMBER_OF_VEC_STMTS (child); | |
3576 | vectorized_defs = true; | |
77eefb71 | 3577 | child_index++; |
90dd6e3d | 3578 | } |
e44978dc | 3579 | } |
77eefb71 RB |
3580 | else |
3581 | child_index++; | |
d092494c | 3582 | } |
ebfd146a | 3583 | |
77eefb71 RB |
3584 | if (!vectorized_defs) |
3585 | { | |
3586 | if (i == 0) | |
3587 | { | |
3588 | number_of_vects = SLP_TREE_NUMBER_OF_VEC_STMTS (slp_node); | |
3589 | /* Number of vector stmts was calculated according to LHS in | |
3590 | vect_schedule_slp_instance (), fix it by replacing LHS with | |
3591 | RHS, if necessary. See vect_get_smallest_scalar_type () for | |
3592 | details. */ | |
3593 | vect_get_smallest_scalar_type (first_stmt, &lhs_size_unit, | |
3594 | &rhs_size_unit); | |
3595 | if (rhs_size_unit != lhs_size_unit) | |
3596 | { | |
3597 | number_of_vects *= rhs_size_unit; | |
3598 | number_of_vects /= lhs_size_unit; | |
3599 | } | |
3600 | } | |
d092494c | 3601 | } |
b5aeb3bb | 3602 | |
d092494c | 3603 | /* Allocate memory for vectorized defs. */ |
37b5ec8f JJ |
3604 | vec_defs = vNULL; |
3605 | vec_defs.create (number_of_vects); | |
ebfd146a | 3606 | |
d092494c IR |
3607 | /* For reduction defs we call vect_get_constant_vectors (), since we are |
3608 | looking for initial loop invariant values. */ | |
306b0c92 | 3609 | if (vectorized_defs) |
d092494c | 3610 | /* The defs are already vectorized. */ |
37b5ec8f | 3611 | vect_get_slp_vect_defs (child, &vec_defs); |
d092494c | 3612 | else |
e7baeb39 | 3613 | /* Build vectors from scalar defs. */ |
37b5ec8f | 3614 | vect_get_constant_vectors (oprnd, slp_node, &vec_defs, i, |
306b0c92 | 3615 | number_of_vects); |
ebfd146a | 3616 | |
37b5ec8f | 3617 | vec_oprnds->quick_push (vec_defs); |
d092494c | 3618 | } |
ebfd146a IR |
3619 | } |
3620 | ||
ebfd146a IR |
3621 | /* Generate vector permute statements from a list of loads in DR_CHAIN. |
3622 | If ANALYZE_ONLY is TRUE, only check that it is possible to create valid | |
01d8bf07 RB |
3623 | permute statements for the SLP node NODE of the SLP instance |
3624 | SLP_NODE_INSTANCE. */ | |
3625 | ||
ebfd146a | 3626 | bool |
01d8bf07 | 3627 | vect_transform_slp_perm_load (slp_tree node, vec<tree> dr_chain, |
d9f21f6a RS |
3628 | gimple_stmt_iterator *gsi, poly_uint64 vf, |
3629 | slp_instance slp_node_instance, bool analyze_only, | |
29afecdf | 3630 | unsigned *n_perms) |
ebfd146a | 3631 | { |
355fe088 | 3632 | gimple *stmt = SLP_TREE_SCALAR_STMTS (node)[0]; |
ebfd146a IR |
3633 | stmt_vec_info stmt_info = vinfo_for_stmt (stmt); |
3634 | tree mask_element_type = NULL_TREE, mask_type; | |
928686b1 | 3635 | int vec_index = 0; |
2635892a | 3636 | tree vectype = STMT_VINFO_VECTYPE (stmt_info); |
ebfd146a | 3637 | int group_size = SLP_INSTANCE_GROUP_SIZE (slp_node_instance); |
928686b1 | 3638 | unsigned int mask_element; |
ef4bddc2 | 3639 | machine_mode mode; |
928686b1 | 3640 | unsigned HOST_WIDE_INT nunits, const_vf; |
ebfd146a | 3641 | |
91ff1504 RB |
3642 | if (!STMT_VINFO_GROUPED_ACCESS (stmt_info)) |
3643 | return false; | |
3644 | ||
3645 | stmt_info = vinfo_for_stmt (GROUP_FIRST_ELEMENT (stmt_info)); | |
3646 | ||
22e4dee7 RH |
3647 | mode = TYPE_MODE (vectype); |
3648 | ||
d9f21f6a | 3649 | /* At the moment, all permutations are represented using per-element |
928686b1 RS |
3650 | indices, so we can't cope with variable vector lengths or |
3651 | vectorization factors. */ | |
3652 | if (!TYPE_VECTOR_SUBPARTS (vectype).is_constant (&nunits) | |
3653 | || !vf.is_constant (&const_vf)) | |
d9f21f6a RS |
3654 | return false; |
3655 | ||
2635892a RH |
3656 | /* The generic VEC_PERM_EXPR code always uses an integral type of the |
3657 | same size as the vector element being permuted. */ | |
96f9265a | 3658 | mask_element_type = lang_hooks.types.type_for_mode |
304b9962 | 3659 | (int_mode_for_mode (TYPE_MODE (TREE_TYPE (vectype))).require (), 1); |
ebfd146a | 3660 | mask_type = get_vectype_for_scalar_type (mask_element_type); |
e3342de4 | 3661 | vec_perm_builder mask (nunits, nunits, 1); |
908a1a16 | 3662 | mask.quick_grow (nunits); |
e3342de4 | 3663 | vec_perm_indices indices; |
ebfd146a | 3664 | |
61fdfd8c RB |
3665 | /* Initialize the vect stmts of NODE to properly insert the generated |
3666 | stmts later. */ | |
3667 | if (! analyze_only) | |
3668 | for (unsigned i = SLP_TREE_VEC_STMTS (node).length (); | |
3669 | i < SLP_TREE_NUMBER_OF_VEC_STMTS (node); i++) | |
3670 | SLP_TREE_VEC_STMTS (node).quick_push (NULL); | |
ebfd146a | 3671 | |
b8698a0f L |
3672 | /* Generate permutation masks for every NODE. Number of masks for each NODE |
3673 | is equal to GROUP_SIZE. | |
3674 | E.g., we have a group of three nodes with three loads from the same | |
3675 | location in each node, and the vector size is 4. I.e., we have a | |
3676 | a0b0c0a1b1c1... sequence and we need to create the following vectors: | |
ebfd146a IR |
3677 | for a's: a0a0a0a1 a1a1a2a2 a2a3a3a3 |
3678 | for b's: b0b0b0b1 b1b1b2b2 b2b3b3b3 | |
3679 | ... | |
3680 | ||
2635892a | 3681 | The masks for a's should be: {0,0,0,3} {3,3,6,6} {6,9,9,9}. |
b8698a0f | 3682 | The last mask is illegal since we assume two operands for permute |
ff802fa1 IR |
3683 | operation, and the mask element values can't be outside that range. |
3684 | Hence, the last mask must be converted into {2,5,5,5}. | |
b8698a0f | 3685 | For the first two permutations we need the first and the second input |
ebfd146a | 3686 | vectors: {a0,b0,c0,a1} and {b1,c1,a2,b2}, and for the last permutation |
b8698a0f | 3687 | we need the second and the third vectors: {b1,c1,a2,b2} and |
ebfd146a IR |
3688 | {c2,a3,b3,c3}. */ |
3689 | ||
2ce27200 | 3690 | int vect_stmts_counter = 0; |
928686b1 | 3691 | unsigned int index = 0; |
2ce27200 RB |
3692 | int first_vec_index = -1; |
3693 | int second_vec_index = -1; | |
be377c80 | 3694 | bool noop_p = true; |
29afecdf | 3695 | *n_perms = 0; |
ebfd146a | 3696 | |
d9f21f6a | 3697 | for (unsigned int j = 0; j < const_vf; j++) |
2ce27200 RB |
3698 | { |
3699 | for (int k = 0; k < group_size; k++) | |
3700 | { | |
928686b1 RS |
3701 | unsigned int i = (SLP_TREE_LOAD_PERMUTATION (node)[k] |
3702 | + j * STMT_VINFO_GROUP_SIZE (stmt_info)); | |
2ce27200 RB |
3703 | vec_index = i / nunits; |
3704 | mask_element = i % nunits; | |
3705 | if (vec_index == first_vec_index | |
3706 | || first_vec_index == -1) | |
3707 | { | |
3708 | first_vec_index = vec_index; | |
3709 | } | |
3710 | else if (vec_index == second_vec_index | |
3711 | || second_vec_index == -1) | |
3712 | { | |
3713 | second_vec_index = vec_index; | |
3714 | mask_element += nunits; | |
3715 | } | |
3716 | else | |
3717 | { | |
3718 | if (dump_enabled_p ()) | |
3719 | { | |
3720 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, vect_location, | |
3721 | "permutation requires at " | |
3722 | "least three vectors "); | |
3723 | dump_gimple_stmt (MSG_MISSED_OPTIMIZATION, TDF_SLIM, | |
3724 | stmt, 0); | |
2ce27200 | 3725 | } |
31bee964 | 3726 | gcc_assert (analyze_only); |
2ce27200 RB |
3727 | return false; |
3728 | } | |
ebfd146a | 3729 | |
928686b1 | 3730 | gcc_assert (mask_element < 2 * nunits); |
be377c80 RB |
3731 | if (mask_element != index) |
3732 | noop_p = false; | |
2ce27200 RB |
3733 | mask[index++] = mask_element; |
3734 | ||
e3342de4 | 3735 | if (index == nunits && !noop_p) |
2ce27200 | 3736 | { |
e3342de4 RS |
3737 | indices.new_vector (mask, 2, nunits); |
3738 | if (!can_vec_perm_const_p (mode, indices)) | |
2ce27200 RB |
3739 | { |
3740 | if (dump_enabled_p ()) | |
22e4dee7 | 3741 | { |
2ce27200 RB |
3742 | dump_printf_loc (MSG_MISSED_OPTIMIZATION, |
3743 | vect_location, | |
3744 | "unsupported vect permute { "); | |
3745 | for (i = 0; i < nunits; ++i) | |
6b0630fb RS |
3746 | { |
3747 | dump_dec (MSG_MISSED_OPTIMIZATION, mask[i]); | |
3748 | dump_printf (MSG_MISSED_OPTIMIZATION, " "); | |
3749 | } | |
2ce27200 | 3750 | dump_printf (MSG_MISSED_OPTIMIZATION, "}\n"); |
22e4dee7 | 3751 | } |
31bee964 | 3752 | gcc_assert (analyze_only); |
2ce27200 RB |
3753 | return false; |
3754 | } | |
22e4dee7 | 3755 | |
e3342de4 RS |
3756 | ++*n_perms; |
3757 | } | |
29afecdf | 3758 | |
e3342de4 RS |
3759 | if (index == nunits) |
3760 | { | |
2ce27200 RB |
3761 | if (!analyze_only) |
3762 | { | |
be377c80 RB |
3763 | tree mask_vec = NULL_TREE; |
3764 | ||
3765 | if (! noop_p) | |
736d0f28 | 3766 | mask_vec = vec_perm_indices_to_tree (mask_type, indices); |
2ce27200 RB |
3767 | |
3768 | if (second_vec_index == -1) | |
3769 | second_vec_index = first_vec_index; | |
61fdfd8c RB |
3770 | |
3771 | /* Generate the permute statement if necessary. */ | |
3772 | tree first_vec = dr_chain[first_vec_index]; | |
3773 | tree second_vec = dr_chain[second_vec_index]; | |
3774 | gimple *perm_stmt; | |
3775 | if (! noop_p) | |
3776 | { | |
3777 | tree perm_dest | |
3778 | = vect_create_destination_var (gimple_assign_lhs (stmt), | |
3779 | vectype); | |
3780 | perm_dest = make_ssa_name (perm_dest); | |
3781 | perm_stmt = gimple_build_assign (perm_dest, | |
3782 | VEC_PERM_EXPR, | |
3783 | first_vec, second_vec, | |
3784 | mask_vec); | |
3785 | vect_finish_stmt_generation (stmt, perm_stmt, gsi); | |
3786 | } | |
3787 | else | |
3788 | /* If mask was NULL_TREE generate the requested | |
3789 | identity transform. */ | |
3790 | perm_stmt = SSA_NAME_DEF_STMT (first_vec); | |
3791 | ||
3792 | /* Store the vector statement in NODE. */ | |
3793 | SLP_TREE_VEC_STMTS (node)[vect_stmts_counter++] = perm_stmt; | |
2ce27200 | 3794 | } |
ebfd146a | 3795 | |
2ce27200 RB |
3796 | index = 0; |
3797 | first_vec_index = -1; | |
3798 | second_vec_index = -1; | |
be377c80 | 3799 | noop_p = true; |
2ce27200 RB |
3800 | } |
3801 | } | |
b8698a0f | 3802 | } |
ebfd146a | 3803 | |
ebfd146a IR |
3804 | return true; |
3805 | } | |
3806 | ||
ebfd146a IR |
3807 | /* Vectorize SLP instance tree in postorder. */ |
3808 | ||
3809 | static bool | |
f7300fff RB |
3810 | vect_schedule_slp_instance (slp_tree node, slp_instance instance, |
3811 | scalar_stmts_to_slp_tree_map_t *bst_map) | |
ebfd146a | 3812 | { |
355fe088 | 3813 | gimple *stmt; |
0d0293ac | 3814 | bool grouped_store, is_store; |
ebfd146a IR |
3815 | gimple_stmt_iterator si; |
3816 | stmt_vec_info stmt_info; | |
8b7e9dba | 3817 | unsigned int group_size; |
ebfd146a | 3818 | tree vectype; |
603cca93 | 3819 | int i, j; |
d755c7ef | 3820 | slp_tree child; |
ebfd146a | 3821 | |
603cca93 | 3822 | if (SLP_TREE_DEF_TYPE (node) != vect_internal_def) |
ebfd146a IR |
3823 | return false; |
3824 | ||
f7300fff RB |
3825 | /* See if we have already vectorized the same set of stmts and reuse their |
3826 | vectorized stmts. */ | |
dd172744 | 3827 | if (slp_tree *leader = bst_map->get (SLP_TREE_SCALAR_STMTS (node))) |
f7300fff | 3828 | { |
dd172744 | 3829 | SLP_TREE_VEC_STMTS (node).safe_splice (SLP_TREE_VEC_STMTS (*leader)); |
f7300fff RB |
3830 | return false; |
3831 | } | |
3832 | ||
dd172744 | 3833 | bst_map->put (SLP_TREE_SCALAR_STMTS (node).copy (), node); |
9771b263 | 3834 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (node), i, child) |
f7300fff | 3835 | vect_schedule_slp_instance (child, instance, bst_map); |
b8698a0f | 3836 | |
603cca93 RB |
3837 | /* Push SLP node def-type to stmts. */ |
3838 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (node), i, child) | |
3839 | if (SLP_TREE_DEF_TYPE (child) != vect_internal_def) | |
3840 | FOR_EACH_VEC_ELT (SLP_TREE_SCALAR_STMTS (child), j, stmt) | |
3841 | STMT_VINFO_DEF_TYPE (vinfo_for_stmt (stmt)) = SLP_TREE_DEF_TYPE (child); | |
3842 | ||
9771b263 | 3843 | stmt = SLP_TREE_SCALAR_STMTS (node)[0]; |
ebfd146a IR |
3844 | stmt_info = vinfo_for_stmt (stmt); |
3845 | ||
3846 | /* VECTYPE is the type of the destination. */ | |
b690cc0f | 3847 | vectype = STMT_VINFO_VECTYPE (stmt_info); |
dad55d70 | 3848 | poly_uint64 nunits = TYPE_VECTOR_SUBPARTS (vectype); |
ebfd146a IR |
3849 | group_size = SLP_INSTANCE_GROUP_SIZE (instance); |
3850 | ||
68435eb2 | 3851 | gcc_assert (SLP_TREE_NUMBER_OF_VEC_STMTS (node) != 0); |
9771b263 | 3852 | if (!SLP_TREE_VEC_STMTS (node).exists ()) |
8b7e9dba | 3853 | SLP_TREE_VEC_STMTS (node).create (SLP_TREE_NUMBER_OF_VEC_STMTS (node)); |
ebfd146a | 3854 | |
73fbfcad | 3855 | if (dump_enabled_p ()) |
ebfd146a | 3856 | { |
78c60e3d SS |
3857 | dump_printf_loc (MSG_NOTE,vect_location, |
3858 | "------>vectorizing SLP node starting from: "); | |
3859 | dump_gimple_stmt (MSG_NOTE, TDF_SLIM, stmt, 0); | |
b8698a0f | 3860 | } |
ebfd146a | 3861 | |
2e8ab70c RB |
3862 | /* Vectorized stmts go before the last scalar stmt which is where |
3863 | all uses are ready. */ | |
3864 | si = gsi_for_stmt (vect_find_last_scalar_stmt_in_slp (node)); | |
e4a707c4 | 3865 | |
b010117a IR |
3866 | /* Mark the first element of the reduction chain as reduction to properly |
3867 | transform the node. In the analysis phase only the last element of the | |
3868 | chain is marked as reduction. */ | |
0d0293ac | 3869 | if (GROUP_FIRST_ELEMENT (stmt_info) && !STMT_VINFO_GROUPED_ACCESS (stmt_info) |
b010117a IR |
3870 | && GROUP_FIRST_ELEMENT (stmt_info) == stmt) |
3871 | { | |
3872 | STMT_VINFO_DEF_TYPE (stmt_info) = vect_reduction_def; | |
3873 | STMT_VINFO_TYPE (stmt_info) = reduc_vec_info_type; | |
3874 | } | |
3875 | ||
6876e5bc RB |
3876 | /* Handle two-operation SLP nodes by vectorizing the group with |
3877 | both operations and then performing a merge. */ | |
3878 | if (SLP_TREE_TWO_OPERATORS (node)) | |
3879 | { | |
3880 | enum tree_code code0 = gimple_assign_rhs_code (stmt); | |
567a3691 | 3881 | enum tree_code ocode = ERROR_MARK; |
355fe088 | 3882 | gimple *ostmt; |
e3342de4 | 3883 | vec_perm_builder mask (group_size, group_size, 1); |
6876e5bc RB |
3884 | FOR_EACH_VEC_ELT (SLP_TREE_SCALAR_STMTS (node), i, ostmt) |
3885 | if (gimple_assign_rhs_code (ostmt) != code0) | |
3886 | { | |
908a1a16 | 3887 | mask.quick_push (1); |
6876e5bc RB |
3888 | ocode = gimple_assign_rhs_code (ostmt); |
3889 | } | |
3890 | else | |
908a1a16 | 3891 | mask.quick_push (0); |
567a3691 | 3892 | if (ocode != ERROR_MARK) |
6876e5bc | 3893 | { |
355fe088 TS |
3894 | vec<gimple *> v0; |
3895 | vec<gimple *> v1; | |
6876e5bc RB |
3896 | unsigned j; |
3897 | tree tmask = NULL_TREE; | |
3898 | vect_transform_stmt (stmt, &si, &grouped_store, node, instance); | |
3899 | v0 = SLP_TREE_VEC_STMTS (node).copy (); | |
3900 | SLP_TREE_VEC_STMTS (node).truncate (0); | |
3901 | gimple_assign_set_rhs_code (stmt, ocode); | |
3902 | vect_transform_stmt (stmt, &si, &grouped_store, node, instance); | |
3903 | gimple_assign_set_rhs_code (stmt, code0); | |
3904 | v1 = SLP_TREE_VEC_STMTS (node).copy (); | |
3905 | SLP_TREE_VEC_STMTS (node).truncate (0); | |
3906 | tree meltype = build_nonstandard_integer_type | |
b397965c | 3907 | (GET_MODE_BITSIZE (SCALAR_TYPE_MODE (TREE_TYPE (vectype))), 1); |
6876e5bc RB |
3908 | tree mvectype = get_same_sized_vectype (meltype, vectype); |
3909 | unsigned k = 0, l; | |
3910 | for (j = 0; j < v0.length (); ++j) | |
3911 | { | |
dad55d70 RS |
3912 | /* Enforced by vect_build_slp_tree, which rejects variable-length |
3913 | vectors for SLP_TREE_TWO_OPERATORS. */ | |
3914 | unsigned int const_nunits = nunits.to_constant (); | |
3915 | tree_vector_builder melts (mvectype, const_nunits, 1); | |
3916 | for (l = 0; l < const_nunits; ++l) | |
6876e5bc | 3917 | { |
1ece8d4c | 3918 | if (k >= group_size) |
6876e5bc | 3919 | k = 0; |
dad55d70 RS |
3920 | tree t = build_int_cst (meltype, |
3921 | mask[k++] * const_nunits + l); | |
794e3180 | 3922 | melts.quick_push (t); |
6876e5bc | 3923 | } |
5ebaa477 | 3924 | tmask = melts.build (); |
6876e5bc RB |
3925 | |
3926 | /* ??? Not all targets support a VEC_PERM_EXPR with a | |
3927 | constant mask that would translate to a vec_merge RTX | |
3928 | (with their vec_perm_const_ok). We can either not | |
3929 | vectorize in that case or let veclower do its job. | |
3930 | Unfortunately that isn't too great and at least for | |
3931 | plus/minus we'd eventually like to match targets | |
3932 | vector addsub instructions. */ | |
355fe088 | 3933 | gimple *vstmt; |
6876e5bc RB |
3934 | vstmt = gimple_build_assign (make_ssa_name (vectype), |
3935 | VEC_PERM_EXPR, | |
3936 | gimple_assign_lhs (v0[j]), | |
3937 | gimple_assign_lhs (v1[j]), tmask); | |
3938 | vect_finish_stmt_generation (stmt, vstmt, &si); | |
3939 | SLP_TREE_VEC_STMTS (node).quick_push (vstmt); | |
3940 | } | |
3941 | v0.release (); | |
3942 | v1.release (); | |
3943 | return false; | |
3944 | } | |
3945 | } | |
0d0293ac | 3946 | is_store = vect_transform_stmt (stmt, &si, &grouped_store, node, instance); |
603cca93 RB |
3947 | |
3948 | /* Restore stmt def-types. */ | |
3949 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (node), i, child) | |
3950 | if (SLP_TREE_DEF_TYPE (child) != vect_internal_def) | |
3951 | FOR_EACH_VEC_ELT (SLP_TREE_SCALAR_STMTS (child), j, stmt) | |
3952 | STMT_VINFO_DEF_TYPE (vinfo_for_stmt (stmt)) = vect_internal_def; | |
3953 | ||
b5aeb3bb | 3954 | return is_store; |
ebfd146a IR |
3955 | } |
3956 | ||
dd34c087 JJ |
3957 | /* Replace scalar calls from SLP node NODE with setting of their lhs to zero. |
3958 | For loop vectorization this is done in vectorizable_call, but for SLP | |
3959 | it needs to be deferred until end of vect_schedule_slp, because multiple | |
3960 | SLP instances may refer to the same scalar stmt. */ | |
3961 | ||
3962 | static void | |
3963 | vect_remove_slp_scalar_calls (slp_tree node) | |
3964 | { | |
355fe088 | 3965 | gimple *stmt, *new_stmt; |
dd34c087 JJ |
3966 | gimple_stmt_iterator gsi; |
3967 | int i; | |
d755c7ef | 3968 | slp_tree child; |
dd34c087 JJ |
3969 | tree lhs; |
3970 | stmt_vec_info stmt_info; | |
3971 | ||
603cca93 | 3972 | if (SLP_TREE_DEF_TYPE (node) != vect_internal_def) |
dd34c087 JJ |
3973 | return; |
3974 | ||
9771b263 | 3975 | FOR_EACH_VEC_ELT (SLP_TREE_CHILDREN (node), i, child) |
d755c7ef | 3976 | vect_remove_slp_scalar_calls (child); |
dd34c087 | 3977 | |
9771b263 | 3978 | FOR_EACH_VEC_ELT (SLP_TREE_SCALAR_STMTS (node), i, stmt) |
dd34c087 JJ |
3979 | { |
3980 | if (!is_gimple_call (stmt) || gimple_bb (stmt) == NULL) | |
3981 | continue; | |
3982 | stmt_info = vinfo_for_stmt (stmt); | |
3983 | if (stmt_info == NULL | |
3984 | || is_pattern_stmt_p (stmt_info) | |
3985 | || !PURE_SLP_STMT (stmt_info)) | |
3986 | continue; | |
3987 | lhs = gimple_call_lhs (stmt); | |
3988 | new_stmt = gimple_build_assign (lhs, build_zero_cst (TREE_TYPE (lhs))); | |
3989 | set_vinfo_for_stmt (new_stmt, stmt_info); | |
3990 | set_vinfo_for_stmt (stmt, NULL); | |
3991 | STMT_VINFO_STMT (stmt_info) = new_stmt; | |
3992 | gsi = gsi_for_stmt (stmt); | |
3993 | gsi_replace (&gsi, new_stmt, false); | |
3994 | SSA_NAME_DEF_STMT (gimple_assign_lhs (new_stmt)) = new_stmt; | |
3995 | } | |
3996 | } | |
ebfd146a | 3997 | |
ff802fa1 IR |
3998 | /* Generate vector code for all SLP instances in the loop/basic block. */ |
3999 | ||
ebfd146a | 4000 | bool |
310213d4 | 4001 | vect_schedule_slp (vec_info *vinfo) |
ebfd146a | 4002 | { |
9771b263 | 4003 | vec<slp_instance> slp_instances; |
ebfd146a | 4004 | slp_instance instance; |
8b7e9dba | 4005 | unsigned int i; |
ebfd146a IR |
4006 | bool is_store = false; |
4007 | ||
78604de0 RB |
4008 | |
4009 | scalar_stmts_to_slp_tree_map_t *bst_map | |
4010 | = new scalar_stmts_to_slp_tree_map_t (); | |
310213d4 | 4011 | slp_instances = vinfo->slp_instances; |
9771b263 | 4012 | FOR_EACH_VEC_ELT (slp_instances, i, instance) |
ebfd146a IR |
4013 | { |
4014 | /* Schedule the tree of INSTANCE. */ | |
4015 | is_store = vect_schedule_slp_instance (SLP_INSTANCE_TREE (instance), | |
f7300fff | 4016 | instance, bst_map); |
73fbfcad | 4017 | if (dump_enabled_p ()) |
78c60e3d | 4018 | dump_printf_loc (MSG_NOTE, vect_location, |
e645e942 | 4019 | "vectorizing stmts using SLP.\n"); |
ebfd146a | 4020 | } |
78604de0 | 4021 | delete bst_map; |
ebfd146a | 4022 | |
9771b263 | 4023 | FOR_EACH_VEC_ELT (slp_instances, i, instance) |
b5aeb3bb IR |
4024 | { |
4025 | slp_tree root = SLP_INSTANCE_TREE (instance); | |
355fe088 | 4026 | gimple *store; |
b5aeb3bb IR |
4027 | unsigned int j; |
4028 | gimple_stmt_iterator gsi; | |
4029 | ||
c40eced0 RB |
4030 | /* Remove scalar call stmts. Do not do this for basic-block |
4031 | vectorization as not all uses may be vectorized. | |
4032 | ??? Why should this be necessary? DCE should be able to | |
4033 | remove the stmts itself. | |
4034 | ??? For BB vectorization we can as well remove scalar | |
4035 | stmts starting from the SLP tree root if they have no | |
4036 | uses. */ | |
310213d4 | 4037 | if (is_a <loop_vec_info> (vinfo)) |
c40eced0 | 4038 | vect_remove_slp_scalar_calls (root); |
dd34c087 | 4039 | |
9771b263 | 4040 | for (j = 0; SLP_TREE_SCALAR_STMTS (root).iterate (j, &store) |
b5aeb3bb IR |
4041 | && j < SLP_INSTANCE_GROUP_SIZE (instance); j++) |
4042 | { | |
4043 | if (!STMT_VINFO_DATA_REF (vinfo_for_stmt (store))) | |
4044 | break; | |
4045 | ||
a024e70e IR |
4046 | if (is_pattern_stmt_p (vinfo_for_stmt (store))) |
4047 | store = STMT_VINFO_RELATED_STMT (vinfo_for_stmt (store)); | |
b5aeb3bb IR |
4048 | /* Free the attached stmt_vec_info and remove the stmt. */ |
4049 | gsi = gsi_for_stmt (store); | |
3d3f2249 | 4050 | unlink_stmt_vdef (store); |
b5aeb3bb | 4051 | gsi_remove (&gsi, true); |
3d3f2249 | 4052 | release_defs (store); |
b5aeb3bb IR |
4053 | free_stmt_vec_info (store); |
4054 | } | |
4055 | } | |
4056 | ||
ebfd146a IR |
4057 | return is_store; |
4058 | } |