78 struct exec_node {  struct
79    struct exec_node *next;  argument
80    struct exec_node *prev;  argument
102    exec_node() : next(NULL), prev(NULL)  in exec_node()  function
107    const exec_node *get_next() const  in get_next()  argument
112    exec_node *get_next()  in get_next()  argument
117    const exec_node *get_prev() const  in get_prev()  argument
122    exec_node *get_prev()  in get_prev()  argument
149    void insert_after(exec_node *after)  in insert_after()  argument
160    void insert_before(exec_node *before)  in insert_before()  argument
177    void replace_with(exec_node *replacement)  in replace_with()  argument
229 struct exec_node;
250    exec_list_iterator(exec_node *n) : node(n), _next(n->next)  in exec_list_iterator()
266    exec_node *get()  in get()
277    exec_node *node;
278    exec_node *_next;
287    struct exec_node *head;
288    struct exec_node *tail;
289    struct exec_node *tail_pred;
318       head = (exec_node *) & tail;  in make_empty()
320       tail_pred = (exec_node *) & head;  in make_empty()
335       return head == (exec_node *) &tail;  in is_empty()
338    const exec_node *get_head() const  in get_head()
343    exec_node *get_head()  in get_head()
348    const exec_node *get_tail() const  in get_tail()
353    exec_node *get_tail()  in get_tail()
358    void push_head(exec_node *n)  in push_head()
361       n->prev = (exec_node *) &head;  in push_head()
367    void push_tail(exec_node *n)  in push_tail()
369       n->next = (exec_node *) &tail;  in push_tail()
376    void push_degenerate_list_at_head(exec_node *n)  in push_degenerate_list_at_head()
382       n->prev = (exec_node *) &head;  in push_degenerate_list_at_head()
394    exec_node *pop_head()  in pop_head()
396       exec_node *const n = this->get_head();  in pop_head()
415 	 target->head->prev = (exec_node *) &target->head;  in move_nodes_to()
416 	 target->tail_pred->next = (exec_node *) &target->tail;  in move_nodes_to()
439       this->tail_pred->next = (exec_node *) &this->tail;  in append_list()
453       return exec_list_iterator((exec_node *) head);  in iterator()
460 inline void exec_node::insert_before(exec_list *before)  in insert_before()
479    for (exec_node * __node = (__list)->head, * __next = __node->next \
484    for (exec_node * __node = (__list)->head		\
489    for (const exec_node * __node = (__list)->head	\