From e1f83aa39dd5d4dbfd1045786e87bcac0b6561aa Mon Sep 17 00:00:00 2001 From: Aldy Hernandez Date: Tue, 24 Jan 2023 19:28:59 +0100 Subject: Remove irange::{min,max,kind}. gcc/ChangeLog: * tree-ssa-loop-niter.cc (refine_value_range_using_guard): Remove kind() call. (determine_value_range): Same. (record_nonwrapping_iv): Same. (infer_loop_bounds_from_signedness): Same. (scev_var_range_cant_overflow): Same. * tree-vrp.cc (operand_less_p): Delete. * tree-vrp.h (operand_less_p): Delete. * value-range.cc (get_legacy_range): Remove uses of deprecated API. (irange::value_inside_range): Delete. * value-range.h (vrange::kind): Delete. (irange::num_pairs): Remove check of m_kind. (irange::min): Delete. (irange::max): Delete. --- gcc/value-range.cc | 49 ------------------------------------------------- 1 file changed, 49 deletions(-) (limited to 'gcc/value-range.cc') diff --git a/gcc/value-range.cc b/gcc/value-range.cc index c11c3f5..ee43efa 100644 --- a/gcc/value-range.cc +++ b/gcc/value-range.cc @@ -907,15 +907,10 @@ irange::operator= (const irange &src) value_range_kind get_legacy_range (const irange &r, tree &min, tree &max) { - value_range_kind old_kind = r.kind (); - tree old_min = r.min (); - tree old_max = r.max (); - if (r.undefined_p ()) { min = NULL_TREE; max = NULL_TREE; - gcc_checking_assert (old_kind == VR_UNDEFINED); return VR_UNDEFINED; } @@ -924,9 +919,6 @@ get_legacy_range (const irange &r, tree &min, tree &max) { min = wide_int_to_tree (type, r.lower_bound ()); max = wide_int_to_tree (type, r.upper_bound ()); - gcc_checking_assert (old_kind == VR_VARYING); - gcc_checking_assert (vrp_operand_equal_p (old_min, min)); - gcc_checking_assert (vrp_operand_equal_p (old_max, max)); return VR_VARYING; } @@ -946,9 +938,6 @@ get_legacy_range (const irange &r, tree &min, tree &max) min = wide_int_to_tree (type, r.lower_bound ()); max = wide_int_to_tree (type, r.upper_bound ()); - gcc_checking_assert (old_kind == VR_RANGE); - gcc_checking_assert (vrp_operand_equal_p (old_min, min)); - gcc_checking_assert (vrp_operand_equal_p (old_max, max)); return VR_RANGE; } @@ -1165,44 +1154,6 @@ irange::singleton_p (tree *result) const return false; } -/* Return 1 if VAL is inside value range. - 0 if VAL is not inside value range. - -2 if we cannot tell either way. - - Benchmark compile/20001226-1.c compilation time after changing this - function. */ - -int -irange::value_inside_range (tree val) const -{ - if (varying_p ()) - return 1; - - if (undefined_p ()) - return 0; - - gcc_checking_assert (TREE_CODE (val) == INTEGER_CST); - - // FIXME: - if (TREE_CODE (val) == INTEGER_CST) - return contains_p (val); - - int cmp1 = operand_less_p (val, min ()); - if (cmp1 == -2) - return -2; - if (cmp1 == 1) - return m_kind != VR_RANGE; - - int cmp2 = operand_less_p (max (), val); - if (cmp2 == -2) - return -2; - - if (m_kind == VR_RANGE) - return !cmp2; - else - return !!cmp2; -} - /* Return TRUE if range contains INTEGER_CST. */ /* Return 1 if VAL is inside value range. 0 if VAL is not inside value range. -- cgit v1.1