20 void WaiterList::AddNode(WaiterListNode *node)  in AddNode()  argument
22     ASSERT(node->prev_ == nullptr);  in AddNode()
23     ASSERT(node->next_ == nullptr);  in AddNode()
24     auto iter = locationListMap_.find(node->waitPointer_);  in AddNode()
26         iter->second.pTail->next_ = node;  in AddNode()
27         node->prev_ = iter->second.pTail;  in AddNode()
28         iter->second.pTail = node;  in AddNode()
30         locationListMap_.emplace(node->waitPointer_, HeadAndTail {node, node});  in AddNode()
34 void WaiterList::DeleteNode(WaiterListNode *node)  in DeleteNode()  argument
36     auto iter = locationListMap_.find(node->waitPointer_);  in DeleteNode()
41         if (temp == node) {  in DeleteNode()
48     if (node == iter->second.pHead && node == iter->second.pTail) {  in DeleteNode()
53     if (node == iter->second.pHead) {  in DeleteNode()
54         iter->second.pHead = node->next_;  in DeleteNode()
56         ASSERT(node->prev_);  in DeleteNode()
57         node->prev_->next_ = node->next_;  in DeleteNode()
60     if (node == iter->second.pTail) {  in DeleteNode()
61         iter->second.pTail = node->prev_;  in DeleteNode()
63         ASSERT(node->next_);  in DeleteNode()
64         node->next_->prev_ = node->prev_;  in DeleteNode()
67     node->prev_ = node->next_ = nullptr;  in DeleteNode()