Lines Matching defs:list
7 #include <linux/list.h>
10 * Returns a list organized in an intermediate format suited
44 * Combine final list merge with restoration of standard doubly-linked
45 * list structure. This approach duplicates code from merge(), but
78 /* Finish linking remainder of list b on to tail */
95 /* And the final links to make a circular doubly-linked list */
101 * list_sort - sort a list
103 * @head: the list to sort
130 * merged to a size-2^(k+1) list as soon as we have 2^k following elements.
144 * size 2^k into one list of size 2^(k+1).
151 * which will be merged into a list of size 2^(k+2) before we create
152 * a third list of size 2^(k+1), so there are never more than two pending.
175 * so there is one list of each smaller size.
179 * 5 above, you can see that the number of elements we merge with a list
186 struct list_head *list = head->next, *pending = NULL;
189 if (list == head->prev) /* Zero or one elements */
192 /* Convert to a null-terminated singly-linked list. */
199 * - pending is a prev-linked "list of lists" of sorted
230 /* Move one element from input list to pending */
231 list->prev = pending;
232 pending = list;
233 list = list->next;
236 } while (list);
239 list = pending;
246 list = merge(priv, cmp, pending, list);
250 merge_final(priv, cmp, head, pending, list);