Home | History | Annotate | Download | only in gcc

Lines Matching refs:group_size

264 /* Allocate operands info for NOPS operands, and GROUP_SIZE def-stmts for each
267 vect_create_oprnd_info (int nops, int group_size)
277 oprnd_info->def_stmts.create (group_size);
278 oprnd_info->ops.create (group_size);
857 number of units in VECTYPE. GROUP_SIZE and MAX_NUNITS are as for
862 unsigned int group_size,
878 && !multiple_p (group_size, TYPE_VECTOR_SUBPARTS (vectype)))
909 vec<stmt_vec_info> stmts, unsigned int group_size,
976 &nunits_vectype, group_size))
988 && !vect_record_max_nunits (vinfo, stmt_info, group_size,
1321 for (i = 0; i < group_size; ++i)
1339 || const_nunits > group_size)
1345 unsigned tail = group_size & (const_nunits - 1);
1346 memset (&matches[group_size - tail], 0, sizeof (bool) * tail);
1493 vec<stmt_vec_info> stmts, unsigned int group_size,
1500 vec<stmt_vec_info> stmts, unsigned int group_size,
1517 memcpy (matches, (*leader)->failed, sizeof (bool) * group_size);
1537 res->failed = XNEWVEC (bool, group_size);
1538 memset (res->failed, 0, sizeof (bool) * group_size);
1539 memset (matches, 0, sizeof (bool) * group_size);
1549 slp_tree res_ = vect_build_slp_tree_2 (vinfo, res, stmts, group_size,
1561 res->failed = XNEWVEC (bool, group_size);
1565 for (i = 0; i < group_size; ++i)
1568 gcc_assert (i < group_size);
1570 memcpy (res->failed, matches, sizeof (bool) * group_size);
1594 unsigned group_size = SLP_TREE_LANES (op1);
1599 SLP_TREE_LANES (child1) = group_size;
1608 SLP_TREE_LANES (child2) = group_size;
1619 SLP_TREE_LANES (perm) = group_size;
1636 vec<stmt_vec_info> stmts, unsigned int group_size,
1665 group_size);
1666 if (!vect_record_max_nunits (vinfo, stmt_info, group_size, vectype,
1714 unsigned char *swap = XALLOCAVEC (unsigned char, group_size);
1716 if (!vect_build_slp_tree_1 (vinfo, swap, stmts, group_size,
1739 load_permutation.create (group_size);
1761 && DR_GROUP_SIZE (first_stmt_info) != group_size)
1848 auto_vec<vec<chain_op_t> > chains (group_size);
1851 for (unsigned lane = 0; lane < group_size; ++lane)
1876 if (lane != group_size - 1)
1888 if (lane != group_size - 1)
1895 if (chains.length () == group_size)
1905 for (unsigned lane = 0; lane < group_size; ++lane)
1912 for (unsigned lane = 0; lane < group_size; ++lane)
1926 for (lane = 0; lane < group_size; ++lane)
1938 if (lane != group_size)
1945 if (lane != group_size - 1)
1957 || !can_duplicate_and_interleave_p (vinfo, group_size,
1964 ops.create (group_size);
1965 for (lane = 0; lane < group_size; ++lane)
1984 op_stmts.create (group_size);
1990 unsigned *perms = XALLOCAVEC (unsigned, group_size);
1991 memset (perms, 0, sizeof (unsigned) * group_size);
1995 for (lane = 0; lane < group_size; ++lane)
1999 group_size, &this_max_nunits,
2012 for (lane = 1; lane < group_size; ++lane)
2034 if (lane != group_size - 1)
2050 for (unsigned lane = 0; lane < group_size; ++lane)
2057 for (lane = 0; lane < group_size; ++lane)
2060 if (lane == group_size)
2067 for (lane = 0; lane < group_size; ++lane)
2085 for (lane = 0; lane < group_size; ++lane)
2089 zero_ops.create (group_size);
2091 for (lane = 1; lane < group_size; ++lane)
2104 for (unsigned lane = 0; lane < group_size; ++lane)
2118 lperm.create (group_size);
2119 for (unsigned lane = 0; lane < group_size; ++lane)
2135 SLP_TREE_LANES (child) = group_size;
2163 vec<slp_oprnd_info> oprnds_info = vect_create_oprnd_info (nops, group_size);
2174 for (i = 0; i < group_size; ++i)
2216 for (j = 1; j < group_size; ++j)
2219 if (j == group_size
2245 group_size, &this_max_nunits,
2274 for (j = 0; j < group_size; ++j)
2291 while (j != group_size);
2297 for (j = 0; j < group_size; ++j)
2314 bool *tem = XALLOCAVEC (bool, group_size);
2316 group_size, &this_max_nunits,
2347 for (j = 0; j < group_size; ++j)
2801 /* Calculate the unrolling factor for an SLP instance with GROUP_SIZE
2805 calculate_unrolling_factor (poly_uint64 nunits, unsigned int group_size)
2807 return exact_div (common_multiple (nunits, group_size), group_size);
2826 vec_info *vinfo, unsigned int group_size,
2866 bool *matches = XALLOCAVEC (bool, group_size);
2869 node = vect_build_slp_tree (vinfo, stmts, group_size, &max_nunits,
2884 = optimize_load_redistribution_1 (bst_map, vinfo, group_size, load_map,
2911 vec_info *vinfo, unsigned int group_size,
2921 = optimize_load_redistribution_1 (bst_map, vinfo, group_size, load_map,
3002 /* STMT_INFO is a store group of size GROUP_SIZE that we are considering
3009 unsigned int group_size,
3024 if (multiple_p (group_size - new_group_size, TYPE_VECTOR_SUBPARTS (vectype))
3027 return vect_store_lanes_supported (vectype, group_size, false);
3063 unsigned int group_size = scalar_stmts.length ();
3064 bool *matches = XALLOCAVEC (bool, group_size);
3068 slp_tree node = vect_build_slp_tree (vinfo, scalar_stmts, group_size,
3075 = calculate_unrolling_factor (max_nunits, group_size);
3082 || const_max_nunits > group_size)
3097 memset (matches, true, group_size);
3098 matches[group_size / const_max_nunits * const_max_nunits] = false;
3125 = vect_orig_stmt (scalar_stmts[group_size - 1])->stmt;
3137 scalar_stmts.create (group_size);
3138 for (unsigned i = 0; i < group_size; ++i)
3164 auto_vec<stmt_vec_info, 64> phis (group_size);
3167 for (unsigned i = 0; i < group_size; ++i)
3183 .length () == group_size);
3210 for (i = 0; i < group_size; i++)
3217 && (i > 1 && i < group_size))
3243 && (i + 1 < group_size
3255 if (i + 1 < group_size)
3265 && (i > 1 && i < group_size)
3266 && !vect_slp_prefer_store_lanes_p (vinfo, stmt_info, group_size, i))
3285 if (i + 1 < group_size)
4548 unsigned int group_size = SLP_TREE_LANES (node);
4551 = vect_get_num_vectors (vf * group_size, vectype);
4602 unsigned int group_size = SLP_TREE_LANES (node);
4604 SLP_TREE_SCALAR_OPS (node).safe_grow (group_size, true);
4660 unsigned group_size = SLP_TREE_SCALAR_OPS (node).length ();
4666 && ! multiple_p (const_nunits, group_size))
4679 nelt_limit = group_size;
4801 unsigned group_size = SLP_TREE_LANES (child);
4806 = vect_get_num_vectors (vf * group_size, vector_type);
6462 int group_size = op_node->ops.length ();
6485 If GROUP_SIZE > NUNITS, the scalars will be split into several vectors
6495 nunits = group_size;
6497 number_of_copies = nunits * number_of_vectors / group_size;
6507 for (i = group_size - 1; op_node->ops.iterate (i, &op); i--)
6717 unsigned int group_size = SLP_TREE_SCALAR_STMTS (node).length ();
6737 is equal to GROUP_SIZE.
6765 bool repeating_p = (group_size == DR_GROUP_SIZE (stmt_info)
6766 && multiple_p (nunits, group_size));
6772 mask.new_vector (nunits, group_size, 3);
6785 nelts_to_build = const_vf * group_size;
6799 unsigned int iter_num = j / group_size;
6800 unsigned int stmt_num = j % group_size;