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