Lines Matching full:overflow
35 // Store the old entry in the overflow list of the new entry, and then store in Expand()
37 newEntry->Overflow().store(oldEntry, std::memory_order_release); in Expand()
96 currentEntry = currentEntry->Overflow().load(std::memory_order_acquire)) { in Load()
150 // Entry, Search in overflow in LoadOrStore()
157 currentEntry = currentEntry->Overflow().load(std::memory_order_acquire)) { in LoadOrStore()
209 currentEntry = currentEntry->Overflow().load(std::memory_order_acquire)) { in LoadOrStore()
278 // Entry, Search in overflow in LoadOrStoreForJit()
285 currentEntry = currentEntry->Overflow().load(std::memory_order_acquire)) { in LoadOrStoreForJit()
324 currentEntry = currentEntry->Overflow().load(std::memory_order_acquire)) { in LoadOrStoreForJit()
395 // Entry, Search in overflow in StoreOrLoad()
398 currentEntry = currentEntry->Overflow().load(std::memory_order_acquire)) { in StoreOrLoad()
434 currentEntry = currentEntry->Overflow().load(std::memory_order_acquire)) { in StoreOrLoad()
490 currentEntry = currentEntry->Overflow().load(std::memory_order_acquire)) { in Load()
532 currentEntry = currentEntry->Overflow().load(std::memory_order_acquire)) { in Load()
586 // Entry, Search in overflow in StoreOrLoad()
593 currentEntry = currentEntry->Overflow().load(std::memory_order_acquire)) { in StoreOrLoad()
633 currentEntry = currentEntry->Overflow().load(std::memory_order_acquire)) { in StoreOrLoad()
724 …for (Entry *e = childNode->AsEntry(); e != nullptr; e = e->Overflow().load(std::memory_order_acqui… in Iter()
766 // Processing the overflow linked list in ClearNodeFromGC()
768 Overflow().load(std::memory_order_acquire)) { in ClearNodeFromGC()
770 …prev->Overflow().store(current->Overflow().load(std::memory_order_acquire), std::memory_order_rele… in ClearNodeFromGC()
802 // Processing the overflow linked list in ClearNodeFromGC()
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()
809 prev->Overflow().store(next, std::memory_order_relaxed); in ClearNodeFromGC()
811 entry->Overflow().store(next, std::memory_order_relaxed); in ClearNodeFromGC()
821 Entry* e = entry->Overflow().load(std::memory_order_relaxed); in ClearNodeFromGC()
865 // Processing the overflow linked list in ClearNodeFromGC()
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()
871 prev->Overflow().store(next, std::memory_order_relaxed); in ClearNodeFromGC()
873 entry->Overflow().store(next, std::memory_order_relaxed); in ClearNodeFromGC()
883 Entry* e = entry->Overflow().load(std::memory_order_relaxed); in ClearNodeFromGC()