Lines Matching refs:element
69 * added to the list after an existing element or at the head of the list.
80 * to the list after an existing element, at the head of the list, or at the
89 * so that an arbitrary element can be removed without a need to
91 * or after an existing element or at the head of the list. A list
96 * linked so that an arbitrary element can be removed without a need to
98 * after an existing element, at the head of the list, or at the end of
103 * linked so that an arbitrary element can be removed without a need to
105 * an existing element, at the head of the list, or at the end of the list.
141 /* Store the last 2 places the queue element or head was altered */
178 struct type *slh_first; /* first element */ \
186 struct type *sle_next; /* next element */ \
250 struct type *stqh_first;/* first element */ \
251 struct type **stqh_last;/* addr of last next element */ \
259 struct type *stqe_next; /* next element */ \
350 struct type *lh_first; /* first element */ \
358 struct type *le_next; /* next element */ \
359 struct type **le_prev; /* address of previous next element */ \
452 struct type *tqh_first; /* first element */ \
453 struct type **tqh_last; /* addr of last next element */ \
462 struct type *tqe_next; /* next element */ \
463 struct type **tqe_prev; /* address of previous next element */ \
582 struct type *cqh_first; /* first element */ \
583 struct type *cqh_last; /* last element */ \
588 struct type *cqe_next; /* next element */ \
589 struct type *cqe_prev; /* previous element */ \
687 struct quehead *element = (struct quehead *)a,
690 element->qh_link = head->qh_link;
691 element->qh_rlink = head;
692 head->qh_link = element;
693 element->qh_link->qh_rlink = element;
699 struct quehead *element = (struct quehead *)a;
701 element->qh_link->qh_rlink = element->qh_rlink;
702 element->qh_rlink->qh_link = element->qh_link;
703 element->qh_rlink = 0;