40         constexpr base_node(base_node* n, base_node* p) : next(n), prev(p) {}  in base_node()
57     inline void add( base_node* n ) {  in add()  argument
59         n->prev = head.prev;  in add()
60         n->next = &head;  in add()
61         head.prev->next = n;  in add()
62         head.prev = n;  in add()
66     inline void remove( base_node& n ) {  in remove()  argument
69         n.prev->next = n.next;  in remove()
70         n.next->prev = n.prev;  in remove()
285         base_node* n;  in notify_one_relaxed()  local
290             n = my_waitset.front();  in notify_one_relaxed()
291             if (n != end) {  in notify_one_relaxed()
292                 my_waitset.remove(*n);  in notify_one_relaxed()
300                 to_wait_node(n)->my_is_in_list.store(false, std::memory_order_relaxed);  in notify_one_relaxed()
307         if (n != end) {  in notify_one_relaxed()
308             to_wait_node(n)->notify();  in notify_one_relaxed()
332             for (base_node* n = temp.front(); n != end; n = n->next) {  in notify_all_relaxed()  local
333                 to_wait_node(n)->my_is_in_list.store(false, std::memory_order_relaxed);  in notify_all_relaxed()
338         for (base_node* n = temp.front(); n != end; n=nxt) {  in notify_all_relaxed()  local
339             nxt = n->next;  in notify_all_relaxed()
340             to_wait_node(n)->notify();  in notify_all_relaxed()
368             for (base_node* n = my_waitset.last(); n != end; n = nxt) {  in notify_relaxed()  local
369                 nxt = n->prev;  in notify_relaxed()
370                 auto* node = static_cast<wait_node<Context>*>(n);  in notify_relaxed()
372                     my_waitset.remove(*n);  in notify_relaxed()
374                     temp.add(n);  in notify_relaxed()
380         for (base_node* n=temp.front(); n != end; n = nxt) {  in notify_relaxed()  local
381             nxt = n->next;  in notify_relaxed()
382             to_wait_node(n)->notify();  in notify_relaxed()
403             for (base_node* n = my_waitset.last(); n != end; n = next) {  in notify_one_relaxed()  local
404                 next = n->prev;  in notify_one_relaxed()
405                 auto* node = static_cast<wait_node<Context>*>(n);  in notify_one_relaxed()
407                     my_waitset.remove(*n);  in notify_one_relaxed()
409                     tmp = n;  in notify_one_relaxed()
439             for (base_node* n = temp.front(); n != end; n = n->next) {  in abort_all_relaxed()  local
440                 to_wait_node(n)->my_is_in_list.store(false, std::memory_order_relaxed);  in abort_all_relaxed()
445         for (base_node* n = temp.front(); n != end; n = nxt) {  in abort_all_relaxed()  local
446             nxt = n->next;  in abort_all_relaxed()
447             to_wait_node(n)->my_aborted = true;  in abort_all_relaxed()
448             to_wait_node(n)->notify();  in abort_all_relaxed()