| /art/runtime/gc/ |
| D | reference_queue_test.cc | 37 ASSERT_TRUE(queue.IsEmpty()); in TEST_F()
48 ASSERT_TRUE(!queue.IsEmpty()); in TEST_F()
51 ASSERT_TRUE(!queue.IsEmpty()); in TEST_F()
57 ASSERT_TRUE(!queue.IsEmpty()); in TEST_F()
61 ASSERT_TRUE(queue.IsEmpty()); in TEST_F()
|
| D | reference_processor.cc | 172 DCHECK(soft_reference_queue_.IsEmpty()); in ProcessReferences()
173 DCHECK(weak_reference_queue_.IsEmpty()); in ProcessReferences()
174 DCHECK(finalizer_reference_queue_.IsEmpty()); in ProcessReferences()
175 DCHECK(phantom_reference_queue_.IsEmpty()); in ProcessReferences()
214 DCHECK(soft_reference_queue_.IsEmpty()); in ProcessReferences()
215 DCHECK(weak_reference_queue_.IsEmpty()); in ProcessReferences()
216 DCHECK(finalizer_reference_queue_.IsEmpty()); in ProcessReferences()
217 DCHECK(phantom_reference_queue_.IsEmpty()); in ProcessReferences()
299 if (!cleared_references_.IsEmpty()) { in CollectClearedReferences()
|
| D | reference_queue.cc | 45 if (IsEmpty()) { in EnqueueReference()
60 DCHECK(!IsEmpty()); in DequeuePendingReference()
135 while (!IsEmpty()) { in ClearWhiteReferences()
157 while (!IsEmpty()) { in EnqueueFinalizerReferences()
181 if (UNLIKELY(IsEmpty())) { in ForwardSoftReferences()
|
| D | reference_queue.h | 101 bool IsEmpty() const { in IsEmpty() function
|
| /art/libdexfile/dex/ |
| D | type_lookup_table.cc | 55 if (entries[pos].IsEmpty()) { in Create()
71 DCHECK(!entries[tail_pos].IsEmpty()); in Create()
74 DCHECK(!entries[tail_pos].IsEmpty()); in Create()
80 } while (!entries[insert_pos].IsEmpty()); in Create()
106 if (entry->IsEmpty()) { in Lookup()
117 DCHECK(!entry->IsEmpty()); in Lookup()
137 DCHECK(!entry->IsEmpty()); in Lookup()
|
| D | type_lookup_table.h | 126 bool IsEmpty() const { in IsEmpty() function
|
| D | dex_file_verifier.h | 224 bool IsEmpty(const std::pair<uint32_t, uint16_t>& pair) const { in IsEmpty() function
|
| /art/compiler/utils/arm64/ |
| D | assembler_arm64.cc | 135 if (!registers.IsEmpty()) { in SpillRegisters()
140 DCHECK(registers.IsEmpty()); in SpillRegisters()
161 if (!registers.IsEmpty()) { in UnspillRegisters()
166 DCHECK(registers.IsEmpty()); in UnspillRegisters()
|
| /art/libartbase/base/ |
| D | hash_set.h | 120 bool IsEmpty(const T& item) const { in IsEmpty() function
131 bool IsEmpty(T* const& item) const { in IsEmpty() function
376 if (emptyfn_.IsEmpty(next_element)) { in erase()
510 if (!emptyfn_.IsEmpty(element)) { in TotalProbeDistance()
532 if (!emptyfn_.IsEmpty(element)) { in Verify()
622 if (emptyfn_.IsEmpty(slot)) { in FindIndex()
633 return emptyfn_.IsEmpty(ElementForIndex(index)); in IsFreeSlot()
681 if (!emptyfn_.IsEmpty(element)) { in Resize()
699 while (!emptyfn_.IsEmpty(data_[index])) { in FirstAvailableSlot()
|
| D | bit_string.h | 61 bool IsEmpty() const { in IsEmpty() function
248 bool IsEmpty() const { in IsEmpty() function
|
| D | hiddenapi_flags.h | 212 if (current.IsEmpty() || !api_list.CanCombineWith(current)) { in FromNames()
276 bool IsEmpty() const { return (GetValue() == Value::kInvalid) && (GetDomainApis() == 0); } in IsEmpty() function
301 DCHECK_EQ(IsEmpty(), is_first); in Dump()
|
| D | hash_set_test.cc | 37 bool IsEmpty(const std::string& item) const { in IsEmpty() function
266 bool IsEmpty(const std::pair<std::string, int>& pair) const { in IsEmpty() function
287 bool IsEmpty(const std::vector<int>& item) const { in IsEmpty() function
|
| /art/compiler/optimizing/ |
| D | gvn.cc | 143 if (IsEmpty()) { in IntersectWith()
145 } else if (predecessor->IsEmpty()) { in IntersectWith()
156 bool IsEmpty() const { return num_entries_ == 0; } in IsEmpty() function in art::ValueSet
445 if (!set->IsEmpty()) { in VisitBasicBlock()
463 if (set->IsEmpty()) { in VisitBasicBlock()
|
| D | dead_code_elimination.cc | 249 block->GetPhis().IsEmpty() && in SimplifyAlwaysThrows()
261 succ->GetPhis().IsEmpty()) { in SimplifyAlwaysThrows()
|
| D | select_generator.cc | 41 DCHECK(block->GetPhis().IsEmpty()); in IsSimpleBlock()
|
| /art/tools/veridex/ |
| D | hidden_api.h | 44 return !GetApiList(name).IsEmpty(); in IsInAnyList()
|
| /art/compiler/utils/ |
| D | dedupe_set-inl.h | 127 bool IsEmpty() const {
142 bool IsEmpty(const HashedKey<StoreKey>& key) const {
143 return key.IsEmpty();
|
| /art/runtime/ |
| D | class_table.h | 126 DCHECK(IsEmpty(item)); in MakeEmpty()
128 bool IsEmpty(const TableSlot& item) const NO_THREAD_SAFETY_ANALYSIS { in IsEmpty() function
|
| D | subtype_check_info.h | 275 if (GetBitString().IsEmpty()) { in GetState()
|
| D | intern_table.h | 99 bool IsEmpty(const GcRoot<mirror::String>& item) const { in IsEmpty() function
|
| /art/runtime/gc/space/ |
| D | bump_pointer_space.h | 123 bool IsEmpty() const { in IsEmpty() function
|
| /art/runtime/gc/collector/ |
| D | semi_space.cc | 655 DCHECK(mark_stack_->IsEmpty()); in Sweep()
750 while (!mark_stack_->IsEmpty()) { in ProcessMarkStack()
818 CHECK(mark_stack_->IsEmpty()); in FinishPhase()
|
| D | mark_sweep.cc | 1318 DCHECK(mark_stack_->IsEmpty()); in Sweep()
1428 while (!mark_stack_->IsEmpty() && prefetch_fifo.size() < kFifoSize) { in ProcessMarkStack()
1440 if (mark_stack_->IsEmpty()) { in ProcessMarkStack()
1493 CHECK(mark_stack_->IsEmpty()); // Ensure that the mark stack is empty. in FinishPhase()
|
| /art/runtime/gc/accounting/ |
| D | atomic_stack.h | 165 bool IsEmpty() const { in IsEmpty() function
|
| /art/cmdline/ |
| D | token_range.h | 161 bool IsEmpty() const { in IsEmpty() function
|