Lines Matching full:entries
272 Entries can be added at the end of a list.
328 Entries can be added at the end of a list.
426 removing all entries from the former.
562 SLIST_ENTRY(entry) entries; /* Singly-linked List. */
569 SLIST_INSERT_HEAD(&head, n1, entries);
572 SLIST_INSERT_AFTER(n1, n2, entries);
574 SLIST_REMOVE(&head, n2, entry, entries);/* Deletion. */
578 SLIST_REMOVE_HEAD(&head, entries); /* Deletion from the head. */
581 SLIST_FOREACH(np, &head, entries)
584 SLIST_FOREACH_SAFE(np, &head, entries, np_temp) {
587 SLIST_REMOVE(&head, np, entry, entries);
593 SLIST_REMOVE_HEAD(&head, entries);
643 removing all entries from the former.
785 STAILQ_ENTRY(entry) entries; /* Tail queue. */
792 STAILQ_INSERT_HEAD(&head, n1, entries);
795 STAILQ_INSERT_TAIL(&head, n1, entries);
798 STAILQ_INSERT_AFTER(&head, n1, n2, entries);
800 STAILQ_REMOVE(&head, n2, entry, entries);
804 STAILQ_REMOVE_HEAD(&head, entries);
807 STAILQ_FOREACH(np, &head, entries)
810 STAILQ_FOREACH_SAFE(np, &head, entries, np_temp) {
813 STAILQ_REMOVE(&head, np, entry, entries);
819 STAILQ_REMOVE_HEAD(&head, entries);
825 n2 = STAILQ_NEXT(n1, entries);
875 removing all entries from the former.
1013 LIST_ENTRY(entry) entries; /* List. */
1020 LIST_INSERT_HEAD(&head, n1, entries);
1023 LIST_INSERT_AFTER(n1, n2, entries);
1026 LIST_INSERT_BEFORE(n2, n3, entries);
1028 LIST_REMOVE(n2, entries); /* Deletion. */
1031 LIST_FOREACH(np, &head, entries)
1035 LIST_FOREACH_SAFE(np, &head, entries, np_temp) {
1038 LIST_REMOVE(np, entries);
1044 LIST_REMOVE(n1, entries);
1050 n2 = LIST_NEXT(n1, entries);
1102 removing all entries from the former.
1286 TAILQ_ENTRY(entry) entries; /* Tail queue. */
1293 TAILQ_INSERT_HEAD(&head, n1, entries);
1296 TAILQ_INSERT_TAIL(&head, n1, entries);
1299 TAILQ_INSERT_AFTER(&head, n1, n2, entries);
1302 TAILQ_INSERT_BEFORE(n2, n3, entries);
1304 TAILQ_REMOVE(&head, n2, entries); /* Deletion. */
1308 TAILQ_REPLACE(&head, n3, n4, entries);
1311 TAILQ_FOREACH(np, &head, entries)
1314 TAILQ_FOREACH_SAFE(np, &head, entries, np_temp) {
1317 TAILQ_REMOVE(&head, np, entries);
1321 TAILQ_FOREACH_REVERSE(np, &head, tailhead, entries)
1326 TAILQ_REMOVE(&head, n1, entries);
1332 n2 = TAILQ_NEXT(n1, entries);