Lines Matching full:element

239 Insertion of a new entry after any element in the list.
289 Insertion of a new entry before any element in the list.
296 Each element requires two pointers rather than one.
378 This structure contains a single pointer to the first element
382 New elements can be added to the list after an existing element or
436 returns the first element in the list or NULL if the list is empty.
442 in the forward direction, assigning each element in
454 as a previously found SLIST element and begins the loop at
456 instead of the first element in the SLIST referenced by
463 in the forward direction, assigning each element in
481 as a previously found SLIST element and begins the loop at
483 instead of the first element in the SLIST referenced by
493 inserts the new element
499 inserts the new element
501 after the element
506 returns the next element in the list.
510 removes the element after
519 removes the element
530 removes the element
590 one to the first element in the tail queue and the other to
591 the last element in the tail queue.
595 New elements can be added to the tail queue after an existing element,
651 in the forward direction, assigning each element
663 as a previously found STAILQ element and begins the loop at
665 instead of the first element in the STAILQ referenced by
672 in the forward direction, assigning each element
690 as a previously found STAILQ element and begins the loop at
692 instead of the first element in the STAILQ referenced by
702 inserts the new element
708 inserts the new element
714 inserts the new element
716 after the element
731 removes the element after
740 removes the element at the head of the tail queue.
749 removes the element
819 This structure contains a single pointer to the first element
821 The elements are doubly linked so that an arbitrary element can be
823 New elements can be added to the list after an existing element,
824 before an existing element, or at the head of the list.
877 returns the first element in the list or NULL if the list
884 in the forward direction, assigning each element in turn to
895 as a previously found LIST element and begins the loop at
897 instead of the first element in the LIST referenced by
904 in the forward direction, assigning each element in turn to
921 as a previously found LIST element and begins the loop at
923 instead of the first element in the LIST referenced by
933 inserts the new element
939 inserts the new element
941 after the element
946 inserts the new element
948 before the element
953 returns the next element in the list, or NULL if this is the last.
957 returns the previous element in the list, or NULL if this is the first.
960 must contain element
965 removes the element
971 replaces the element
976 The element
1041 one to the first element in the tail queue and the other to
1042 the last element in the tail queue.
1043 The elements are doubly linked so that an arbitrary element can be
1045 New elements can be added to the tail queue after an existing element,
1046 before an existing element, at the head of the tail queue,
1102 in the forward direction, assigning each element in turn to
1117 as a previously found TAILQ element and begins the loop at
1119 instead of the first element in the TAILQ referenced by
1126 in the reverse direction, assigning each element in turn to
1137 as a previously found TAILQ element and begins the reverse loop at
1139 instead of the last element in the TAILQ referenced by
1149 assigning each element in turn to
1168 as a previously found TAILQ element and begins the loop at
1170 instead of the first element in the TAILQ referenced by
1181 as a previously found TAILQ element and begins the reverse loop at
1183 instead of the last element in the TAILQ referenced by
1193 inserts the new element
1199 inserts the new element
1205 inserts the new element
1207 after the element
1212 inserts the new element
1214 before the element
1234 removes the element
1240 replaces the element
1245 The element
1345 which must directly follow the element whose