Lines Matching refs:m_max
54 m_min = m_max = NULL; in set_undefined()
64 m_max = vrp_val_max (type); in set_varying()
68 m_min = m_max = error_mark_node; in set_varying()
118 m_max = max; in set()
226 m_max = max; in set()
267 gcc_assert (m_min && m_max); in check()
268 gcc_assert (!TREE_OVERFLOW_P (m_min) && !TREE_OVERFLOW_P (m_max)); in check()
273 gcc_assert (!vrp_val_is_min (m_min) || !vrp_val_is_max (m_max)); in check()
275 int cmp = compare_values (m_min, m_max); in check()
283 gcc_assert (m_min && m_max); in check()
309 if (vrp_val_is_min (m_min) || vrp_val_is_max (m_max)) in num_pairs()
336 t = wide_int_to_tree (typ, wi::to_wide (m_max) + 1); in lower_bound()
370 t = m_max; in upper_bound()
393 && vrp_operand_equal_p (m_max, other.m_max)); in equal_p()
413 || !is_gimple_min_invariant (m_max))); in symbolic_p()
427 && TREE_CODE (m_max) == INTEGER_CST); in constant_p()
440 *result = m_max; in singleton_p()
487 cmp2 = operand_less_p (m_max, val); in value_inside_range()
534 || TREE_CODE (m_max) == ADDR_EXPR); in normalize_addresses()
1373 *this = value_range (m_min, m_max, VR_ANTI_RANGE); in invert()
1375 *this = value_range (m_min, m_max); in invert()