Lines Matching defs:element

70  * added to the list after an existing element or at the head of the list.
81 * to the list after an existing element, at the head of the list, or at the
90 * so that an arbitrary element can be removed without a need to
92 * or after an existing element or at the head of the list. A list
97 * linked so that an arbitrary element can be removed without a need to
99 * after an existing element, at the head of the list, or at the end of
129 /* Store the last 2 places the queue element or head was altered */
166 struct type *slh_first; /* first element */ \
174 struct type *sle_next; /* next element */ \
238 struct type *stqh_first;/* first element */ \
239 struct type **stqh_last;/* addr of last next element */ \
247 struct type *stqe_next; /* next element */ \
333 struct type *lh_first; /* first element */ \
341 struct type *le_next; /* next element */ \
342 struct type **le_prev; /* address of previous next element */ \
435 struct type *tqh_first; /* first element */ \
436 struct type **tqh_last; /* addr of last next element */ \
445 struct type *tqe_next; /* next element */ \
446 struct type **tqe_prev; /* address of previous next element */ \
615 struct quehead *element = (struct quehead *)a,
618 element->qh_link = head->qh_link;
619 element->qh_rlink = head;
620 head->qh_link = element;
621 element->qh_link->qh_rlink = element;
627 struct quehead *element = (struct quehead *)a;
629 element->qh_link->qh_rlink = element->qh_rlink;
630 element->qh_rlink->qh_link = element->qh_link;
631 element->qh_rlink = 0;