76    struct exec_node *prev;  member
98    exec_node() : next(NULL), prev(NULL)  in exec_node()
115       return prev;  in get_prev()
120       return prev;  in get_prev()
125       next->prev = prev;  in remove()
126       prev->next = next;  in remove()
128       prev = NULL;  in remove()
139       prev = this;  in self_link()
148       after->prev = this;  in insert_after()
150       this->next->prev = after;  in insert_after()
159       before->prev = this->prev;  in insert_before()
161       this->prev->next = before;  in insert_before()
162       this->prev = before;  in insert_before()
175       replacement->prev = this->prev;  in replace_with()
178       this->prev->next = replacement;  in replace_with()
179       this->next->prev = replacement;  in replace_with()
195       return this->prev == NULL;  in is_head_sentinel()
357       n->prev = (exec_node *) &head;  in push_head()
359       n->next->prev = n;  in push_head()
366       n->prev = tail_pred;  in push_tail()
368       n->prev->next = n;  in push_tail()
374       assert(n->prev->next == n);  in push_degenerate_list_at_head()
376       n->prev->next = head;  in push_degenerate_list_at_head()
377       head->prev = n->prev;  in push_degenerate_list_at_head()
378       n->prev = (exec_node *) &head;  in push_degenerate_list_at_head()
411 	 target->head->prev = (exec_node *) &target->head;  in move_nodes_to()
430       source->head->prev = this->tail_pred;  in append_list()
462    before->head->prev = this->prev;  in insert_before()
464    this->prev->next = before->head;  in insert_before()
465    this->prev = before->tail_pred;  in insert_before()