| /art/runtime/gc/ |
| D | reference_queue_test.cc | 33 ASSERT_TRUE(queue.IsEmpty()); in TEST_F()
46 ASSERT_TRUE(!queue.IsEmpty()); in TEST_F()
49 ASSERT_TRUE(!queue.IsEmpty()); in TEST_F()
52 ASSERT_TRUE(!queue.IsEmpty()); in TEST_F()
56 ASSERT_TRUE(queue.IsEmpty()); in TEST_F()
|
| D | reference_queue.cc | 47 if (IsEmpty()) { in EnqueuePendingReference()
66 DCHECK(!IsEmpty()); in DequeuePendingReference()
142 while (!IsEmpty()) { in ClearWhiteReferences()
163 while (!IsEmpty()) { in EnqueueFinalizerReferences()
185 if (UNLIKELY(IsEmpty())) { in ForwardSoftReferences()
|
| D | reference_processor.cc | 170 DCHECK(soft_reference_queue_.IsEmpty()); in ProcessReferences()
171 DCHECK(weak_reference_queue_.IsEmpty()); in ProcessReferences()
172 DCHECK(finalizer_reference_queue_.IsEmpty()); in ProcessReferences()
173 DCHECK(phantom_reference_queue_.IsEmpty()); in ProcessReferences()
241 if (!cleared_references_.IsEmpty()) { in EnqueueClearedReferences()
|
| D | reference_queue.h | 87 bool IsEmpty() const { in IsEmpty() function
|
| /art/runtime/base/ |
| D | hash_set.h | 37 bool IsEmpty(const T& item) const { in IsEmpty() function
48 bool IsEmpty(const T*& item) const { in IsEmpty() function
261 if (emptyfn_.IsEmpty(next_element)) { in Erase()
351 if (!emptyfn_.IsEmpty(element)) { in TotalProbeDistance()
373 if (!emptyfn_.IsEmpty(element)) { in Verify()
421 if (emptyfn_.IsEmpty(slot)) { in FindIndex()
432 return emptyfn_.IsEmpty(ElementForIndex(index)); in IsFreeSlot()
486 if (!emptyfn_.IsEmpty(element)) { in Resize()
499 while (!emptyfn_.IsEmpty(data_[index])) { in FirstAvailableSlot()
|
| D | hash_set_test.cc | 33 bool IsEmpty(const std::string& item) const { in IsEmpty() function
206 bool IsEmpty(const std::pair<std::string, int>& pair) const { in IsEmpty() function
|
| /art/compiler/optimizing/ |
| D | nodes.cc | 57 DCHECK(block->GetPhis().IsEmpty()) << "Phis are not inserted at this stage"; in RemoveInstructionsAsUsersFromDeadBlocks()
136 DCHECK(reverse_post_order_.IsEmpty()); in ComputeDominanceInformation()
186 DCHECK(!reverse_post_order_.IsEmpty()); in TransformToSsa()
403 if (back_edges_.IsEmpty()) { in Update()
536 DCHECK(instruction->GetUses().IsEmpty()); in Remove()
537 DCHECK(instruction->GetEnvUses().IsEmpty()); in Remove()
959 && GetPhis().IsEmpty() in IsSingleGoto()
967 return !GetInstructions().IsEmpty() && GetLastInstruction()->IsControlFlow(); in EndsWithControlFlowInstruction()
971 return !GetInstructions().IsEmpty() && GetLastInstruction()->IsIf(); in EndsWithIf()
975 return !GetPhis().IsEmpty() && GetFirstPhi()->GetNext() == nullptr; in HasSinglePhi()
[all …]
|
| D | gvn.cc | 129 if (IsEmpty()) { in IntersectWith()
131 } else if (predecessor->IsEmpty()) { in IntersectWith()
142 bool IsEmpty() const { return num_entries_ == 0; } in IsEmpty() function in art::ValueSet
360 if (!set->IsEmpty()) { in VisitBasicBlock()
367 if (set->IsEmpty()) { in VisitBasicBlock()
|
| D | pretty_printer.h | 75 if (!predecessors.IsEmpty()) { in VisitBasicBlock()
84 if (!successors.IsEmpty()) { in VisitBasicBlock()
|
| D | ssa_phi_elimination.cc | 47 while (!worklist_.IsEmpty()) { in MarkDeadPhis()
109 while (!worklist_.IsEmpty()) { in Run()
|
| D | prepare_for_register_allocation.cc | 63 if (!condition->GetUses().HasOnlyOneUse() || !condition->GetEnvUses().IsEmpty()) { in VisitCondition()
|
| D | parallel_move_resolver.cc | 37 DCHECK(moves_.IsEmpty()); in EmitNativeCode()
291 DCHECK(moves_.IsEmpty()); in EmitNativeCode()
292 DCHECK(scratches_.IsEmpty()); in EmitNativeCode()
|
| D | primitive_type_propagation.cc | 111 while (!worklist_.IsEmpty()) { in ProcessWorklist()
|
| D | stack_map_stream.h | 36 bool IsEmpty(const std::pair<DexRegisterLocation, size_t>& item) const { in IsEmpty() function
|
| /art/runtime/gc/collector/ |
| D | immune_region.cc | 43 if (IsEmpty()) { in AddContinuousSpace()
|
| D | immune_region.h | 68 bool IsEmpty() const { in IsEmpty() function
|
| D | mark_compact.cc | 569 DCHECK(mark_stack_->IsEmpty()); in Sweep()
629 while (!mark_stack_->IsEmpty()) { in ProcessMarkStack()
644 CHECK(mark_stack_->IsEmpty()); in FinishPhase()
|
| D | semi_space.cc | 662 DCHECK(mark_stack_->IsEmpty()); in Sweep()
737 while (!mark_stack_->IsEmpty()) { in ProcessMarkStack()
782 CHECK(mark_stack_->IsEmpty()); in FinishPhase()
|
| D | concurrent_copying.cc | 135 CHECK(mark_queue_.IsEmpty()); in InitializePhase()
758 if (!mark_queue_.IsEmpty()) { in CheckEmptyMarkQueue()
759 while (!mark_queue_.IsEmpty()) { in CheckEmptyMarkQueue()
790 CHECK(mark_queue_.IsEmpty()); in Sweep()
1634 CHECK(mark_queue_.IsEmpty()); in FinishPhase()
|
| /art/compiler/utils/ |
| D | growable_array.h | 146 bool IsEmpty() const { return num_used_ == 0; } in IsEmpty() function
|
| /art/runtime/gc/space/ |
| D | bump_pointer_space.h | 115 bool IsEmpty() const { in IsEmpty() function
|
| /art/compiler/utils/arm64/ |
| D | assembler_arm64.cc | 663 if (!registers.IsEmpty()) { in SpillRegisters()
668 DCHECK(registers.IsEmpty()); in SpillRegisters()
682 if (!registers.IsEmpty()) { in UnspillRegisters()
687 DCHECK(registers.IsEmpty()); in UnspillRegisters()
|
| /art/runtime/gc/accounting/ |
| D | atomic_stack.h | 155 bool IsEmpty() const { in IsEmpty() function
|
| /art/compiler/ |
| D | elf_builder.h | 191 bool IsEmpty() const { in IsEmpty() function
317 bool IsEmpty() const { in IsEmpty() function
618 if (!symtab_.IsEmpty()) { in Write()
|
| /art/runtime/ |
| D | intern_table.h | 126 bool IsEmpty(const GcRoot<mirror::String>& item) const { in IsEmpty() function
|