Lines Matching full:entry
31 …Entry* oldEntry, Entry* newEntry, uint32_t oldHash, uint32_t newHash, uint32_t hashShift, Indirect… in Expand()
35 // Store the old entry in the overflow list of the new entry, and then store in Expand()
36 // the new entry. in Expand()
95 for (Entry* currentEntry = node->AsEntry(); currentEntry != nullptr; in Load()
150 // Entry, Search in overflow in LoadOrStore()
156 for (Entry* currentEntry = node->AsEntry(); currentEntry != nullptr; in LoadOrStore()
204 Entry* oldEntry = nullptr; in LoadOrStore()
208 for (Entry* currentEntry = oldEntry; currentEntry; in LoadOrStore()
231 Entry* newEntry = new Entry(value); in LoadOrStore()
234 // The simple case: Create a new entry and store it. in LoadOrStore()
237 // Expand an existing entry to one or more new nodes. in LoadOrStore()
278 // Entry, Search in overflow in LoadOrStoreForJit()
284 for (Entry* currentEntry = node->AsEntry(); currentEntry != nullptr; in LoadOrStoreForJit()
319 Entry* oldEntry = nullptr; in LoadOrStoreForJit()
323 for (Entry* currentEntry = oldEntry; currentEntry; in LoadOrStoreForJit()
343 Entry* newEntry = new Entry(value); in LoadOrStoreForJit()
346 // The simple case: Create a new entry and store it. in LoadOrStoreForJit()
349 // Expand an existing entry to one or more new nodes. in LoadOrStoreForJit()
395 // Entry, Search in overflow in StoreOrLoad()
397 for (Entry* currentEntry = node->AsEntry(); currentEntry != nullptr; in StoreOrLoad()
429 Entry* oldEntry = nullptr; in StoreOrLoad()
433 for (Entry* currentEntry = oldEntry; currentEntry != nullptr; in StoreOrLoad()
454 Entry* newEntry = new Entry(value); in StoreOrLoad()
457 // The simple case: Create a new entry and store it. in StoreOrLoad()
460 // Expand an existing entry to one or more new nodes. in StoreOrLoad()
489 for (Entry* currentEntry = node->AsEntry(); currentEntry != nullptr; in Load()
531 for (Entry* currentEntry = node->AsEntry(); currentEntry != nullptr; in Load()
586 // Entry, Search in overflow in StoreOrLoad()
592 for (Entry* currentEntry = node->AsEntry(); currentEntry != nullptr; in StoreOrLoad()
628 Entry* oldEntry = nullptr; in StoreOrLoad()
632 for (Entry* currentEntry = oldEntry; currentEntry != nullptr; in StoreOrLoad()
653 Entry* newEntry = new Entry(value); in StoreOrLoad()
656 // The simple case: Create a new entry and store it. in StoreOrLoad()
659 // Expand an existing entry to one or more new nodes. in StoreOrLoad()
671 …ieMap<Mutex, ThreadHolder, SlotBarrier>::CheckWeakRef(const WeakRootVisitor& visitor, Entry* entry) in CheckWeakRef() argument
673 …ecmascript::TaggedObject* object = reinterpret_cast<panda::ecmascript::TaggedObject*>(entry->Value< in CheckWeakRef()
680 entry->SetValue(reinterpret_cast<BaseString*>(fwd)); in CheckWeakRef()
724 …for (Entry *e = childNode->AsEntry(); e != nullptr; e = e->Overflow().load(std::memory_order_acqui… in Iter()
735 HashTrieMap::Entry* entry) in CheckWeakRef() argument
737 …// RefField only support 64-bit value, so could not cirectly pass `Entry::Value` to WeakRefFieldVi… in CheckWeakRef()
740 … uint64_t str = static_cast<uint64_t>(reinterpret_cast<uintptr_t>(entry->Value<SlotBarrier>())); in CheckWeakRef()
742 entry->SetValue(reinterpret_cast<BaseString*>(static_cast<uintptr_t>(str))); in CheckWeakRef()
745 uint64_t str = static_cast<uint64_t>(reinterpret_cast<uintptr_t>(entry->Value<SlotBarrier>())); in CheckWeakRef()
750 entry->SetValue(reinterpret_cast<BaseString*>(static_cast<uintptr_t>(str))); in CheckWeakRef()
758 … std::vector<Entry*>& waitDeleteEntries) in ClearNodeFromGC()
767 … for (Entry *prev = nullptr, *current = child->AsEntry(); current != nullptr; current = current-> in ClearNodeFromGC()
801 Entry* entry = child->AsEntry(); in ClearNodeFromGC() local
803 …for (Entry *prev = nullptr, *current = entry->Overflow().load(std::memory_order_relaxed); current … in ClearNodeFromGC()
805 Entry* next = current->Overflow().load(std::memory_order_relaxed); in ClearNodeFromGC()
811 entry->Overflow().store(next, std::memory_order_relaxed); in ClearNodeFromGC()
819 // processing entry node in ClearNodeFromGC()
820 if (CheckWeakRef(visitor, entry)) { in ClearNodeFromGC()
821 Entry* e = entry->Overflow().load(std::memory_order_relaxed); in ClearNodeFromGC()
823 // Delete the empty Entry node and update the parent reference in ClearNodeFromGC()
824 delete entry; in ClearNodeFromGC() local
828 // Delete the Entry node and update the parent reference in ClearNodeFromGC()
829 delete entry; in ClearNodeFromGC() local
864 Entry* entry = child->AsEntry(); in ClearNodeFromGC() local
866 …for (Entry *prev = nullptr, *current = entry->Overflow().load(std::memory_order_relaxed); current … in ClearNodeFromGC()
867 Entry* next = current->Overflow().load(std::memory_order_relaxed); in ClearNodeFromGC()
873 entry->Overflow().store(next, std::memory_order_relaxed); in ClearNodeFromGC()
881 // processing entry node in ClearNodeFromGC()
882 if (CheckWeakRef(visitor, entry)) { in ClearNodeFromGC()
883 Entry* e = entry->Overflow().load(std::memory_order_relaxed); in ClearNodeFromGC()
885 // Delete the empty Entry node and update the parent reference in ClearNodeFromGC()
886 delete entry; in ClearNodeFromGC() local
890 // Delete the Entry node and update the parent reference in ClearNodeFromGC()
891 delete entry; in ClearNodeFromGC() local