HomeSort by: relevance | last modified time | path
    Searched refs:num_pairs (Results 1 - 14 of 14) sorted by relevancy

  /src/external/gpl3/gcc.old/dist/gcc/
value-range.h 60 unsigned num_pairs () const;
85 bool fits_p (const irange &r) { return m_max_ranges >= r.num_pairs (); }
212 irange::num_pairs () const function in class:irange
521 gcc_checking_assert (pair + 1 <= num_pairs ());
534 gcc_checking_assert (pair + 1 <= num_pairs ());
543 unsigned pairs = num_pairs ();
660 // Return a new range with NUM_PAIRS.
661 irange *allocate (unsigned num_pairs);
691 // Return a new range with NUM_PAIRS.
694 irange_allocator::allocate (unsigned num_pairs)
    [all...]
value-range.cc 76 return (num_pairs () > 1
419 gcc_checking_assert (pair + 1 <= num_pairs ());
446 gcc_checking_assert (pair + 1 <= num_pairs ());
537 if (num_pairs () == 1 && (wi::to_wide (tree_lower_bound ())
558 if (num_pairs () == 1)
1655 if (r.num_pairs () == 1)
1666 unsigned r2_lim = r2.num_pairs ();
1668 for (unsigned i = 0; i < r.num_pairs (); )
1759 unsigned pair_lim = num_pairs ();
1885 if (orig_range.num_pairs () > 1
    [all...]
range-op.cc 206 unsigned num_lh = lh.num_pairs ();
207 unsigned num_rh = rh.num_pairs ();
2354 gcc_checking_assert (inner.num_pairs () > 0);
2360 for (unsigned x = 1; x < inner.num_pairs (); ++x)
2945 for (unsigned i = 0; i < lhs.num_pairs (); ++i)
3694 for (unsigned i = 0; i < positives.num_pairs (); ++i)
4324 ASSERT_TRUE (op1.num_pairs () == 2);
4327 ASSERT_TRUE (op1.num_pairs () == 1);
4347 ASSERT_TRUE (op1.num_pairs () == 2);
4350 ASSERT_TRUE (op1.num_pairs () == 1)
    [all...]
vr-values.cc 4199 if ((vr.num_pairs () == 1 && vr.upper_bound () - vr.lower_bound () == 1)
4200 || (vr.num_pairs () == 2
tree-data-ref.cc 649 if (wide_range.num_pairs () != 1 || !range_int_cst_p (&wide_range))
  /src/external/gpl3/gcc/dist/gcc/
value-range-storage.cc 259 : m_max_ranges (r.num_pairs ())
293 m_num_ranges = r.num_pairs ();
299 for (unsigned i = 0; i < r.num_pairs (); ++i)
411 unsigned n = r.num_pairs () * 2 + 2;
423 return m_max_ranges >= r.num_pairs ();
value-range.cc 291 for (unsigned i = 0; i < r.num_pairs (); ++i)
345 return m_max_ranges >= as_a <irange> (r).num_pairs ();
947 int needed = src.num_pairs ();
993 if (r.num_pairs () > 1
1177 if (num_pairs () == 1 && lower_bound () == upper_bound ())
1189 if (num_pairs () == 1 && lower_bound () == upper_bound ())
1496 if (++ri >= r.num_pairs ())
1506 if (++i >= num_pairs ())
1542 if (r.num_pairs () == 1)
1560 int needed = num_pairs () + r.num_pairs ()
    [all...]
data-streamer-in.cc 236 unsigned HOST_WIDE_INT num_pairs = streamer_read_uhwi (ib); local
237 for (unsigned i = 0; i < num_pairs; ++i)
value-range-pretty-print.cc 66 for (unsigned i = 0; i < r.num_pairs (); ++i)
data-streamer-out.cc 420 streamer_write_uhwi (ob, r.num_pairs ());
421 for (unsigned i = 0; i < r.num_pairs (); ++i)
value-range.h 296 unsigned num_pairs () const;
646 unsigned n = num_pairs () * 2;
880 irange::num_pairs () const function in class:irange
1098 gcc_checking_assert (pair + 1 <= num_pairs ());
1109 gcc_checking_assert (pair + 1 <= num_pairs ());
1118 unsigned pairs = num_pairs ();
range-op.cc 620 unsigned num_lh = lh.num_pairs ();
621 unsigned num_rh = rh.num_pairs ();
632 unsigned limit = (r.num_pairs () > 32) ? 0 : 8;
2952 gcc_checking_assert (inner.num_pairs () > 0);
2958 for (unsigned x = 1; x < inner.num_pairs (); ++x)
3551 for (unsigned i = 0; i < lhs.num_pairs (); ++i)
4299 for (unsigned i = 0; i < positives.num_pairs (); ++i)
4745 ASSERT_TRUE (op1.num_pairs () == 2);
4748 ASSERT_TRUE (op1.num_pairs () == 1);
4768 ASSERT_TRUE (op1.num_pairs () == 2)
    [all...]
vr-values.cc 1823 if ((vr.num_pairs () == 1 && vr.upper_bound () - vr.lower_bound () == 1)
1824 || (vr.num_pairs () == 2
tree-data-ref.cc 652 if (wide_range.num_pairs () != 1

Completed in 71 milliseconds