74 struct exec_node {  struct
75    struct exec_node *next;  argument
76    struct exec_node *prev;  argument
98    exec_node() : next(NULL), prev(NULL)  in exec_node()  argument
103    const exec_node *get_next() const  in get_next()  argument
108    exec_node *get_next()  in get_next()  argument
113    const exec_node *get_prev() const  in get_prev()  argument
118    exec_node *get_prev()  in get_prev()  argument
145    void insert_after(exec_node *after)  in insert_after()  argument
156    void insert_before(exec_node *before)  in insert_before()  argument
173    void replace_with(exec_node *replacement)  in replace_with()  argument
225 struct exec_node;
246    exec_list_iterator(exec_node *n) : node(n), _next(n->next)  in exec_list_iterator()
262    exec_node *get()  in get()
273    exec_node *node;
274    exec_node *_next;
283    struct exec_node *head;
284    struct exec_node *tail;
285    struct exec_node *tail_pred;
314       head = (exec_node *) & tail;  in make_empty()
316       tail_pred = (exec_node *) & head;  in make_empty()
331       return head == (exec_node *) &tail;  in is_empty()
334    const exec_node *get_head() const  in get_head()
339    exec_node *get_head()  in get_head()
344    const exec_node *get_tail() const  in get_tail()
349    exec_node *get_tail()  in get_tail()
354    void push_head(exec_node *n)  in push_head()
357       n->prev = (exec_node *) &head;  in push_head()
363    void push_tail(exec_node *n)  in push_tail()
365       n->next = (exec_node *) &tail;  in push_tail()
372    void push_degenerate_list_at_head(exec_node *n)  in push_degenerate_list_at_head()
378       n->prev = (exec_node *) &head;  in push_degenerate_list_at_head()
390    exec_node *pop_head()  in pop_head()
392       exec_node *const n = this->get_head();  in pop_head()
411 	 target->head->prev = (exec_node *) &target->head;  in move_nodes_to()
412 	 target->tail_pred->next = (exec_node *) &target->tail;  in move_nodes_to()
435       this->tail_pred->next = (exec_node *) &this->tail;  in append_list()
449       return exec_list_iterator((exec_node *) head);  in iterator()
456 inline void exec_node::insert_before(exec_list *before)  in insert_before()
475    for (exec_node * __node = (__list)->head, * __next = __node->next \
480    for (exec_node * __node = (__list)->head		\
485    for (const exec_node * __node = (__list)->head	\