80    struct exec_node *prev;  member
102    exec_node() : next(NULL), prev(NULL)  in exec_node()
119       return prev;  in get_prev()
124       return prev;  in get_prev()
129       next->prev = prev;  in remove()
130       prev->next = next;  in remove()
132       prev = NULL;  in remove()
143       prev = this;  in self_link()
152       after->prev = this;  in insert_after()
154       this->next->prev = after;  in insert_after()
163       before->prev = this->prev;  in insert_before()
165       this->prev->next = before;  in insert_before()
166       this->prev = before;  in insert_before()
179       replacement->prev = this->prev;  in replace_with()
182       this->prev->next = replacement;  in replace_with()
183       this->next->prev = replacement;  in replace_with()
199       return this->prev == NULL;  in is_head_sentinel()
361       n->prev = (exec_node *) &head;  in push_head()
363       n->next->prev = n;  in push_head()
370       n->prev = tail_pred;  in push_tail()
372       n->prev->next = n;  in push_tail()
378       assert(n->prev->next == n);  in push_degenerate_list_at_head()
380       n->prev->next = head;  in push_degenerate_list_at_head()
381       head->prev = n->prev;  in push_degenerate_list_at_head()
382       n->prev = (exec_node *) &head;  in push_degenerate_list_at_head()
415 	 target->head->prev = (exec_node *) &target->head;  in move_nodes_to()
434       source->head->prev = this->tail_pred;  in append_list()
466    before->head->prev = this->prev;  in insert_before()
468    this->prev->next = before->head;  in insert_before()
469    this->prev = before->tail_pred;  in insert_before()