| /art/runtime/gc/ |
| D | reference_queue_test.cc | 36 ASSERT_TRUE(queue.IsEmpty()); in TEST_F()
47 ASSERT_TRUE(!queue.IsEmpty()); in TEST_F()
50 ASSERT_TRUE(!queue.IsEmpty()); in TEST_F()
56 ASSERT_TRUE(!queue.IsEmpty()); in TEST_F()
60 ASSERT_TRUE(queue.IsEmpty()); in TEST_F()
|
| D | reference_processor.cc | 147 DCHECK(soft_reference_queue_.IsEmpty()); in ProcessReferences()
148 DCHECK(weak_reference_queue_.IsEmpty()); in ProcessReferences()
149 DCHECK(finalizer_reference_queue_.IsEmpty()); in ProcessReferences()
150 DCHECK(phantom_reference_queue_.IsEmpty()); in ProcessReferences()
189 DCHECK(soft_reference_queue_.IsEmpty()); in ProcessReferences()
190 DCHECK(weak_reference_queue_.IsEmpty()); in ProcessReferences()
191 DCHECK(finalizer_reference_queue_.IsEmpty()); in ProcessReferences()
192 DCHECK(phantom_reference_queue_.IsEmpty()); in ProcessReferences()
271 if (!cleared_references_.IsEmpty()) { in EnqueueClearedReferences()
|
| D | reference_queue.cc | 44 if (IsEmpty()) { in EnqueueReference()
59 DCHECK(!IsEmpty()); in DequeuePendingReference()
134 while (!IsEmpty()) { in ClearWhiteReferences()
156 while (!IsEmpty()) { in EnqueueFinalizerReferences()
180 if (UNLIKELY(IsEmpty())) { in ForwardSoftReferences()
|
| D | reference_queue.h | 98 bool IsEmpty() const { in IsEmpty() function
|
| /art/compiler/utils/arm64/ |
| D | assembler_arm64.cc | 103 if (!registers.IsEmpty()) { in SpillRegisters()
108 DCHECK(registers.IsEmpty()); in SpillRegisters()
129 if (!registers.IsEmpty()) { in UnspillRegisters()
134 DCHECK(registers.IsEmpty()); in UnspillRegisters()
|
| /art/libartbase/base/ |
| D | hash_set.h | 42 bool IsEmpty(const T& item) const { in IsEmpty() function
53 bool IsEmpty(T* const& item) const { in IsEmpty() function
330 if (emptyfn_.IsEmpty(next_element)) { in Erase()
455 if (!emptyfn_.IsEmpty(element)) { in TotalProbeDistance()
477 if (!emptyfn_.IsEmpty(element)) { in Verify()
567 if (emptyfn_.IsEmpty(slot)) { in FindIndex()
578 return emptyfn_.IsEmpty(ElementForIndex(index)); in IsFreeSlot()
626 if (!emptyfn_.IsEmpty(element)) { in Resize()
644 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 | hash_set_test.cc | 35 bool IsEmpty(const std::string& item) const { in IsEmpty() function
264 bool IsEmpty(const std::pair<std::string, int>& pair) const { in IsEmpty() function
285 bool IsEmpty(const std::vector<int>& item) const { in IsEmpty() function
|
| /art/runtime/ |
| D | type_lookup_table.h | 51 while (!entry->IsEmpty()) { in Lookup()
109 bool IsEmpty() const { in IsEmpty() function
|
| D | type_lookup_table.cc | 117 if (!entries_[pos].IsEmpty()) { in SetOnInitialPos()
128 while (!entries_[next_pos].IsEmpty()) { in Insert()
|
| 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()
|
| /art/compiler/optimizing/ |
| D | gvn.cc | 146 if (IsEmpty()) { in IntersectWith()
148 } else if (predecessor->IsEmpty()) { in IntersectWith()
159 bool IsEmpty() const { return num_entries_ == 0; } in IsEmpty() function in art::ValueSet
447 if (!set->IsEmpty()) { in VisitBasicBlock()
465 if (set->IsEmpty()) { in VisitBasicBlock()
|
| D | select_generator.cc | 40 DCHECK(block->GetPhis().IsEmpty()); in IsSimpleBlock()
|
| D | nodes.cc | 149 DCHECK(block->GetPhis().IsEmpty()) << "Phis are not inserted at this stage"; in RemoveInstructionsAsUsersFromDeadBlocks()
451 if (header->GetPhis().IsEmpty()) { in TransformLoopToSinglePreheaderFormat()
1929 return block.GetPhis().IsEmpty() in HasOnlyOneInstruction()
1930 && !block.GetInstructions().IsEmpty() in HasOnlyOneInstruction()
1952 return !GetInstructions().IsEmpty() && GetLastInstruction()->IsControlFlow(); in EndsWithControlFlowInstruction()
1956 return !GetInstructions().IsEmpty() && GetLastInstruction()->IsIf(); in EndsWithIf()
1960 return !GetInstructions().IsEmpty() && GetLastInstruction()->IsTryBoundary(); in EndsWithTryBoundary()
1964 return !GetPhis().IsEmpty() && GetFirstPhi()->GetNext() == nullptr; in HasSinglePhi()
2024 if (!instruction_list.IsEmpty()) { in AddAfter()
2038 if (!instruction_list.IsEmpty()) { in AddBefore()
[all …]
|
| D | dead_code_elimination.cc | 249 block->GetPhis().IsEmpty() && in SimplifyAlwaysThrows()
261 succ->GetPhis().IsEmpty()) { in SimplifyAlwaysThrows()
|
| D | stack_map_stream.h | 37 bool IsEmpty(const std::pair<DexRegisterLocation, size_t>& item) const { in IsEmpty() function
|
| /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/gc/space/ |
| D | bump_pointer_space.h | 121 bool IsEmpty() const { in IsEmpty() function
|
| /art/runtime/gc/collector/ |
| D | mark_compact.cc | 535 DCHECK(mark_stack_->IsEmpty()); in Sweep()
610 while (!mark_stack_->IsEmpty()) { in ProcessMarkStack()
625 CHECK(mark_stack_->IsEmpty()); in FinishPhase()
|
| D | semi_space.cc | 653 DCHECK(mark_stack_->IsEmpty()); in Sweep()
747 while (!mark_stack_->IsEmpty()) { in ProcessMarkStack()
815 CHECK(mark_stack_->IsEmpty()); in FinishPhase()
|
| D | mark_sweep.cc | 1317 DCHECK(mark_stack_->IsEmpty()); in Sweep()
1427 while (!mark_stack_->IsEmpty() && prefetch_fifo.size() < kFifoSize) { in ProcessMarkStack()
1439 if (mark_stack_->IsEmpty()) { in ProcessMarkStack()
1488 CHECK(mark_stack_->IsEmpty()); // Ensure that the mark stack is empty. in FinishPhase()
|
| /art/libdexfile/dex/ |
| D | dex_file_verifier.h | 215 bool IsEmpty(const std::pair<uint32_t, uint16_t>& pair) const { in IsEmpty() function
|
| /art/runtime/jit/ |
| D | profile_compilation_info_test.cc | 314 ASSERT_TRUE(loaded_info.IsEmpty()); in TestProfileLoadFromZip()
321 bool IsEmpty(const ProfileCompilationInfo& info) { in IsEmpty() function in art::ProfileCompilationInfoTest
322 return info.IsEmpty(); in IsEmpty()
1259 ASSERT_TRUE(IsEmpty(loaded_info)); in TEST_F()
1348 ASSERT_FALSE(IsEmpty(info)); in TEST_F()
1350 ASSERT_TRUE(IsEmpty(info)); in TEST_F()
|
| /art/runtime/gc/accounting/ |
| D | atomic_stack.h | 164 bool IsEmpty() const { in IsEmpty() function
|