break;
case store_vec_info_type:
- if (STMT_VINFO_GROUPED_ACCESS (stmt_info)
- && !slp_node
- && (++DR_GROUP_STORE_COUNT (DR_GROUP_FIRST_ELEMENT (stmt_info))
- < DR_GROUP_SIZE (DR_GROUP_FIRST_ELEMENT (stmt_info))))
- /* In case of interleaving, the whole chain is vectorized when the
- last store in the chain is reached. Store stmts before the last
- one are skipped, and there vec_stmt_info shouldn't be freed
- meanwhile. */
- ;
- else
- {
- done = vectorizable_store (vinfo, stmt_info, gsi, slp_node, NULL);
- gcc_assert (done);
- is_store = true;
- }
+ done = vectorizable_store (vinfo, stmt_info, gsi, slp_node, NULL);
+ gcc_assert (done);
+ is_store = true;
break;
case condition_vec_info_type:
stmt_vec_info next_element;
/* The size of the group. */
unsigned int size;
- /* For stores, number of stores from this group seen. We vectorize the last
- one. */
- unsigned int store_count;
/* For loads only, the gap from the previous load. For consecutive loads, GAP
is 1. */
unsigned int gap;
(gcc_checking_assert ((S)->dr_aux.dr), (S)->next_element)
#define DR_GROUP_SIZE(S) \
(gcc_checking_assert ((S)->dr_aux.dr), (S)->size)
-#define DR_GROUP_STORE_COUNT(S) \
- (gcc_checking_assert ((S)->dr_aux.dr), (S)->store_count)
#define DR_GROUP_GAP(S) \
(gcc_checking_assert ((S)->dr_aux.dr), (S)->gap)