From: Richard Biener Date: Tue, 9 Feb 2021 09:11:35 +0000 (+0100) Subject: tree-optimization/99017 - be more forgiving in BB vect costing X-Git-Tag: basepoints/gcc-12~1113 X-Git-Url: http://git.ipfire.org/?a=commitdiff_plain;h=283653f45595f53db486cbc2f1f10091cb45ea3b;p=thirdparty%2Fgcc.git tree-optimization/99017 - be more forgiving in BB vect costing This works around a SLP graph partitioning or cost collecting issue by being more forgiving in vect_bb_vectorization_profitable_p. 2021-02-09 Richard Biener PR tree-optimization/99017 * tree-vect-slp.c (vect_bb_vectorization_profitable_p): Allow zero vector cost entries. --- diff --git a/gcc/tree-vect-slp.c b/gcc/tree-vect-slp.c index b9f12c30fb83..ea8a97b01c63 100644 --- a/gcc/tree-vect-slp.c +++ b/gcc/tree-vect-slp.c @@ -4427,7 +4427,8 @@ vect_bb_vectorization_profitable_p (bb_vec_info bb_vinfo, /* Now cost the portions individually. */ unsigned vi = 0; unsigned si = 0; - do + while (si < li_scalar_costs.length () + && vi < li_vector_costs.length ()) { unsigned sl = li_scalar_costs[si].first; unsigned vl = li_vector_costs[vi].first; @@ -4497,8 +4498,6 @@ vect_bb_vectorization_profitable_p (bb_vec_info bb_vinfo, return false; } } - while (si < li_scalar_costs.length () - && vi < li_vector_costs.length ()); if (vi < li_vector_costs.length ()) { if (dump_enabled_p ())