Searched refs:num_slots (Results 1 – 3 of 3) sorted by relevance
97 bool AtomicBumpBack(size_t num_slots, StackReference<T>** start_address, in AtomicBumpBack() argument107 new_index = index + num_slots; in AtomicBumpBack()
969 size_t num_slots = numOfSlots[idx]; in InspectAllSlots() local971 DCHECK_EQ(slot_base + num_slots * bracket_size, in InspectAllSlots()975 std::unique_ptr<bool[]> is_free(new bool[num_slots]()); // zero initialized in InspectAllSlots()978 DCHECK_LT(slot_idx, num_slots); in InspectAllSlots()984 DCHECK_LT(slot_idx, num_slots); in InspectAllSlots()988 for (size_t slot_idx = 0; slot_idx < num_slots; ++slot_idx) { in InspectAllSlots()1874 const size_t num_slots = numOfSlots[idx]; in Verify() local1876 CHECK_EQ(slot_base + num_slots * bracket_size, in Verify()1948 std::unique_ptr<bool[]> is_free(new bool[num_slots]()); // zero initialized in Verify()1952 DCHECK_LT(slot_idx, num_slots); in Verify()[all …]
46 size_t num_slots = shorty_len + 1; // +1 in case of receiver. in ArgArray() local47 if (LIKELY((num_slots * 2) < kSmallArgArraySize)) { in ArgArray()55 num_slots++; in ArgArray()58 if (num_slots <= kSmallArgArraySize) { in ArgArray()61 large_arg_array_.reset(new uint32_t[num_slots]); in ArgArray()