Lines Matching defs:available
716 // available and can be claimed and then filled.
1685 // Find a dense prefix that makes the right amount of space available.
1730 // available.
1943 const size_t available = pointer_delta(dst_space_end, *new_top_addr);
1947 if (live > 0 && live <= available) {
2544 // Find all regions that are available (can be filled immediately) and
2622 dense_prefix_cp->available() ||
2774 // and all Regions between new_top() and top() should be available (i.e.,
2799 if (!c->available()) {
3241 // Regions up to new_top() are enqueued if they become available.
3249 if (cur < enqueue_end && cur->available() && cur->claim()) {