Searched refs:IsEmpty (Results 1 - 25 of 33) sorted by relevance

12

/art/runtime/gc/
H A Dreference_queue_test.cc34 ASSERT_TRUE(queue.IsEmpty());
45 ASSERT_TRUE(!queue.IsEmpty());
48 ASSERT_TRUE(!queue.IsEmpty());
54 ASSERT_TRUE(!queue.IsEmpty());
58 ASSERT_TRUE(queue.IsEmpty());
H A Dreference_processor.cc171 DCHECK(soft_reference_queue_.IsEmpty());
172 DCHECK(weak_reference_queue_.IsEmpty());
173 DCHECK(finalizer_reference_queue_.IsEmpty());
174 DCHECK(phantom_reference_queue_.IsEmpty());
241 if (!cleared_references_.IsEmpty()) {
H A Dreference_queue.cc43 if (IsEmpty()) {
56 DCHECK(!IsEmpty());
139 while (!IsEmpty()) {
157 while (!IsEmpty()) {
177 if (UNLIKELY(IsEmpty())) {
H A Dreference_queue.h88 bool IsEmpty() const { function in class:art::gc::ReferenceQueue
/art/runtime/
H A Dtype_lookup_table.h49 while (!entry->IsEmpty()) {
106 bool IsEmpty() const { function in struct:art::TypeLookupTable::Entry
H A Dtype_lookup_table.cc117 if (!entries_[pos].IsEmpty()) {
128 while (!entries_[next_pos].IsEmpty()) {
H A Dclass_table.h60 bool IsEmpty(const GcRoot<mirror::Class>& item) const { function in class:art::ClassTable::GcRootEmptyFn
H A Ddex_file_verifier.h189 bool IsEmpty(const std::pair<uint32_t, uint16_t>& pair) const { function in struct:art::DexFileVerifier::OffsetTypeMapEmptyFn
H A Dintern_table.h174 bool IsEmpty(const GcRoot<mirror::String>& item) const { function in class:art::InternTable::GcRootEmptyFn
/art/runtime/base/
H A Dhash_set.h38 bool IsEmpty(const T& item) const { function in class:art::DefaultEmptyFn
49 bool IsEmpty(T* const& item) const { function in class:art::DefaultEmptyFn
56 // EmptyFn needs to implement two functions MakeEmpty(T& item) and IsEmpty(const T& item).
326 if (emptyfn_.IsEmpty(next_element)) {
449 if (!emptyfn_.IsEmpty(element)) {
471 if (!emptyfn_.IsEmpty(element)) {
561 if (emptyfn_.IsEmpty(slot)) {
572 return emptyfn_.IsEmpty(ElementForIndex(index));
620 if (!emptyfn_.IsEmpty(element)) {
638 while (!emptyfn_.IsEmpty(data
[all...]
H A Dhash_set_test.cc35 bool IsEmpty(const std::string& item) const { function in struct:art::IsEmptyFnString
264 bool IsEmpty(const std::pair<std::string, int>& pair) const { function in struct:art::IsEmptyStringPair
285 bool IsEmpty(const std::vector<int>& item) const { function in struct:art::IsEmptyFnVectorInt
/art/runtime/lambda/
H A Dbox_table.h108 bool IsEmpty(const std::pair<UnorderedMapKeyType, ValueType>& item) const;
H A Dbox_table.cc292 bool BoxTable::EmptyFn::IsEmpty(const std::pair<UnorderedMapKeyType, ValueType>& item) const { function in class:art::lambda::BoxTable::EmptyFn
/art/compiler/optimizing/
H A Dgvn.cc144 if (IsEmpty()) {
146 } else if (predecessor->IsEmpty()) {
157 bool IsEmpty() const { return num_entries_ == 0; } function in class:art::ValueSet
455 if (!set->IsEmpty()) {
473 if (set->IsEmpty()) {
H A Dselect_generator.cc30 DCHECK(block->GetPhis().IsEmpty());
H A Dstack_map_stream.h36 bool IsEmpty(const std::pair<DexRegisterLocation, size_t>& item) const { function in class:art::LocationCatalogEntriesIndicesEmptyFn
H A Dnodes.cc116 DCHECK(block->GetPhis().IsEmpty()) << "Phis are not inserted at this stage";
1563 return block.GetPhis().IsEmpty()
1564 && !block.GetInstructions().IsEmpty()
1577 return !GetInstructions().IsEmpty() && GetLastInstruction()->IsControlFlow();
1581 return !GetInstructions().IsEmpty() && GetLastInstruction()->IsIf();
1585 return !GetInstructions().IsEmpty() && GetLastInstruction()->IsTryBoundary();
1589 return !GetPhis().IsEmpty() && GetFirstPhi()->GetNext() == nullptr;
1649 if (!instruction_list.IsEmpty()) {
1663 if (!instruction_list.IsEmpty()) {
1676 if (IsEmpty()) {
[all...]
/art/compiler/utils/
H A Ddedupe_set-inl.h125 bool IsEmpty() const { function in class:art::DedupeSet::Shard::HashedKey
140 bool IsEmpty(const HashedKey<StoreKey>& key) const { function in class:art::DedupeSet::Shard::ShardEmptyFn
141 return key.IsEmpty();
/art/runtime/gc/collector/
H A Dmark_compact.cc546 DCHECK(mark_stack_->IsEmpty());
618 while (!mark_stack_->IsEmpty()) {
633 CHECK(mark_stack_->IsEmpty());
H A Dsemi_space.cc668 DCHECK(mark_stack_->IsEmpty());
760 while (!mark_stack_->IsEmpty()) {
819 CHECK(mark_stack_->IsEmpty());
H A Dconcurrent_copying.cc615 DCHECK(new_tl_mark_stack->IsEmpty());
980 while (!gc_mark_stack_->IsEmpty()) {
997 if (gc_mark_stack_->IsEmpty()) {
1019 while (!gc_mark_stack_->IsEmpty()) {
1170 while (!mark_stack->IsEmpty()) {
1187 CHECK(gc_mark_stack_->IsEmpty());
/art/runtime/gc/accounting/
H A Datomic_stack.h154 bool IsEmpty() const { function in class:art::gc::accounting::AtomicStack
/art/runtime/gc/space/
H A Dbump_pointer_space.h117 bool IsEmpty() const { function in class:art::gc::space::FINAL
/art/cmdline/
H A Dtoken_range.h159 bool IsEmpty() const { function in struct:art::TokenRange
/art/compiler/utils/arm64/
H A Dassembler_arm64.cc659 if (!registers.IsEmpty()) {
664 DCHECK(registers.IsEmpty());
678 if (!registers.IsEmpty()) {
683 DCHECK(registers.IsEmpty());

Completed in 567 milliseconds

12