Lines Matching full:entries

264 Entries can be added at the end of a list.
320 Entries can be added at the end of a list.
418 removing all entries from the former.
550 	SLIST_ENTRY(entry) entries;	/* Singly-linked List. */
557 SLIST_INSERT_HEAD(&head, n1, entries);
560 SLIST_INSERT_AFTER(n1, n2, entries);
562 SLIST_REMOVE(&head, n2, entry, entries);/* Deletion. */
566 SLIST_REMOVE_HEAD(&head, entries);	/* Deletion from the head. */
569 SLIST_FOREACH(np, &head, entries)
572 SLIST_FOREACH_SAFE(np, &head, entries, np_temp) {
575 	SLIST_REMOVE(&head, np, entry, entries);
581 	SLIST_REMOVE_HEAD(&head, entries);
631 removing all entries from the former.
769 	STAILQ_ENTRY(entry) entries;	/* Tail queue. */
776 STAILQ_INSERT_HEAD(&head, n1, entries);
779 STAILQ_INSERT_TAIL(&head, n1, entries);
782 STAILQ_INSERT_AFTER(&head, n1, n2, entries);
784 STAILQ_REMOVE(&head, n2, entry, entries);
788 STAILQ_REMOVE_HEAD(&head, entries);
791 STAILQ_FOREACH(np, &head, entries)
794 STAILQ_FOREACH_SAFE(np, &head, entries, np_temp) {
797 	STAILQ_REMOVE(&head, np, entry, entries);
803 	STAILQ_REMOVE_HEAD(&head, entries);
809 	n2 = STAILQ_NEXT(n1, entries);
859 removing all entries from the former.
993 	LIST_ENTRY(entry) entries;	/* List. */
1000 LIST_INSERT_HEAD(&head, n1, entries);
1003 LIST_INSERT_AFTER(n1, n2, entries);
1006 LIST_INSERT_BEFORE(n2, n3, entries);
1008 LIST_REMOVE(n2, entries);		/* Deletion. */
1011 LIST_FOREACH(np, &head, entries)
1015 LIST_FOREACH_SAFE(np, &head, entries, np_temp) {
1018 	LIST_REMOVE(np, entries);
1024 	LIST_REMOVE(n1, entries);
1030 	n2 = LIST_NEXT(n1, entries);
1082 removing all entries from the former.
1262 	TAILQ_ENTRY(entry) entries;	/* Tail queue. */
1269 TAILQ_INSERT_HEAD(&head, n1, entries);
1272 TAILQ_INSERT_TAIL(&head, n1, entries);
1275 TAILQ_INSERT_AFTER(&head, n1, n2, entries);
1278 TAILQ_INSERT_BEFORE(n2, n3, entries);
1280 TAILQ_REMOVE(&head, n2, entries);	/* Deletion. */
1284 TAILQ_REPLACE(&head, n3, n4, entries);
1287 TAILQ_FOREACH(np, &head, entries)
1290 TAILQ_FOREACH_SAFE(np, &head, entries, np_temp) {
1293 	TAILQ_REMOVE(&head, np, entries);
1297 TAILQ_FOREACH_REVERSE(np, &head, tailhead, entries)
1302 	TAILQ_REMOVE(&head, n1, entries);
1308 	n2 = TAILQ_NEXT(n1, entries);