73   void SetNext(Node* x) {  in SetNext()
76     next_.store(x, std::memory_order_release);  in SetNext()
83   void NoBarrier_SetNext(Node* x) { next_.store(x, std::memory_order_relaxed); }  in NoBarrier_SetNext()
524   Node* x = new (mem) Node();  in Allocate()  local
525   *buf = x->key;  in Allocate()
526   return static_cast<void*>(x);  in Allocate()
572   Node* x = static_cast<Node*>(handle);  in Insert()  local
573   assert(!Contains(x->key));  in Insert()
574   Slice internal_key = GetLengthPrefixedSlice(x->key);  in Insert()
584     x->NoBarrier_SetNext(nullptr);  in Insert()
585     bucket.store(x, std::memory_order_release);  in Insert()
612       skip_list_bucket_header->skip_list.Insert(x->key);  in Insert()
624          GetLengthPrefixedSlice(x->key).ToString(true).c_str());  in Insert()
644     skip_list.Insert(x->key);  in Insert()
679     assert(cur == nullptr || !Equal(x->key, cur->key));  in Insert()
683     x->NoBarrier_SetNext(cur);  in Insert()
686       prev->SetNext(x);  in Insert()
688       header->next.store(static_cast<void*>(x), std::memory_order_release);  in Insert()
798   Node* x = FindGreaterOrEqualInBucket(head, user_key);  in LinkListContains()  local
799   return (x != nullptr && Equal(user_key, x->key));  in LinkListContains()
804   Node* x = head;  in FindGreaterOrEqualInBucket()  local
806     if (x == nullptr) {  in FindGreaterOrEqualInBucket()
807       return x;  in FindGreaterOrEqualInBucket()
809     Node* next = x->Next();  in FindGreaterOrEqualInBucket()
812     assert((x == head) || (next == nullptr) || KeyIsAfterNode(next->key, x));  in FindGreaterOrEqualInBucket()
813     if (KeyIsAfterNode(key, x)) {  in FindGreaterOrEqualInBucket()
815       x = next;  in FindGreaterOrEqualInBucket()
820   return x;  in FindGreaterOrEqualInBucket()