ext/libelf/elf_queue.h

43  * added to the list after an existing element or at the head of the list.
54  * to the list after an existing element, at the head of the list, or at the
63  * so that an arbitrary element can be removed without a need to
65  * or after an existing element or at the head of the list. A list
70  * linked so that an arbitrary element can be removed without a need to
72  * after an existing element, at the head of the list, or at the end of
102 /* Store the last 2 places the queue element or head was altered */
139         struct type *slh_first;	/* first element */			\
147         struct type *sle_next;	/* next element */			\
211         struct type *stqh_first;/* first element */			\
212         struct type **stqh_last;/* addr of last next element */		\
220         struct type *stqe_next;	/* next element */			\
306         struct type *lh_first;	/* first element */			\
314         struct type *le_next;	/* next element */			\
315         struct type **le_prev;	/* address of previous next element */	\
408         struct type *tqh_first;	/* first element */			\
409         struct type **tqh_last;	/* addr of last next element */		\
418         struct type *tqe_next;	/* next element */			\
419         struct type **tqe_prev;	/* address of previous next element */	\
588         struct quehead *element = (struct quehead *)a,
591         element->qh_link = head->qh_link;
592         element->qh_rlink = head;
593         head->qh_link = element;
594         element->qh_link->qh_rlink = element;
600         struct quehead *element = (struct quehead *)a;
602         element->qh_link->qh_rlink = element->qh_rlink;
603         element->qh_rlink->qh_link = element->qh_link;
604         element->qh_rlink = 0;