65 struct Node {  struct
68   Node* Next() {  in Next()  argument
73   void SetNext(Node* x) {  in SetNext()  argument
79   Node* NoBarrier_Next() {  in NoBarrier_Next()  argument
83   void NoBarrier_SetNext(Node* x) { next_.store(x, std::memory_order_relaxed); }  in NoBarrier_SetNext()  argument
86   Node() {}  in Node()  function
89   std::atomic<Node*> next_;  argument
92   Node(const Node&) = delete;
93   Node& operator=(const Node&) = delete;
209   bool LinkListContains(Node* head, const Slice& key) const;
214   Node* GetLinkListFirstNode(Pointer* first_next_pointer) const;
238   bool KeyIsAfterNode(const Slice& internal_key, const Node* n) const {  in KeyIsAfterNode()
243   bool KeyIsAfterNode(const Key& key, const Node* n) const {  in KeyIsAfterNode()
248   bool KeyIsAfterOrAtNode(const Slice& internal_key, const Node* n) const {  in KeyIsAfterOrAtNode()
253   bool KeyIsAfterOrAtNode(const Key& key, const Node* n) const {  in KeyIsAfterOrAtNode()
258   Node* FindGreaterOrEqualInBucket(Node* head, const Slice& key) const;
259   Node* FindLessOrEqualInBucket(Node* head, const Slice& key) const;
328                               Node* head)  in LinkListIterator()
392     void Reset(Node* head) {  in Reset()
399     Node* head_;
400     Node* node_;
523   char* mem = allocator_->AllocateAligned(sizeof(Node) + len);  in Allocate()
524   Node* x = new (mem) Node();  in Allocate()
552 Node* HashLinkListRep::GetLinkListFirstNode(Pointer* first_next_pointer) const {  in GetLinkListFirstNode()
558     return reinterpret_cast<Node*>(first_next_pointer);  in GetLinkListFirstNode()
564     return reinterpret_cast<Node*>(  in GetLinkListFirstNode()
572   Node* x = static_cast<Node*>(handle);  in Insert()
593     Node* first = reinterpret_cast<Node*>(first_next_pointer);  in Insert()
631         this, reinterpret_cast<Node*>(  in Insert()
650     Node* first =  in Insert()
651         reinterpret_cast<Node*>(header->next.load(std::memory_order_relaxed));  in Insert()
658     Node* cur = first;  in Insert()
659     Node* prev = nullptr;  in Insert()
664       Node* next = cur->Next();  in Insert()
796 bool HashLinkListRep::LinkListContains(Node* head,  in LinkListContains()
798   Node* x = FindGreaterOrEqualInBucket(head, user_key);  in LinkListContains()
802 Node* HashLinkListRep::FindGreaterOrEqualInBucket(Node* head,  in FindGreaterOrEqualInBucket()
804   Node* x = head;  in FindGreaterOrEqualInBucket()
809     Node* next = x->Next();  in FindGreaterOrEqualInBucket()