Lines Matching defs:list
8 #include <linux/list.h>
11 * Returns a list organized in an intermediate format suited
45 * Combine final list merge with restoration of standard doubly-linked
46 * list structure. This approach duplicates code from merge(), but
79 /* Finish linking remainder of list b on to tail */
96 /* And the final links to make a circular doubly-linked list */
102 * list_sort - sort a list
104 * @head: the list to sort
131 * merged to a size-2^(k+1) list as soon as we have 2^k following elements.
145 * size 2^k into one list of size 2^(k+1).
152 * which will be merged into a list of size 2^(k+2) before we create
153 * a third list of size 2^(k+1), so there are never more than two pending.
176 * so there is one list of each smaller size.
180 * 5 above, you can see that the number of elements we merge with a list
187 struct list_head *list = head->next, *pending = NULL;
190 if (list == head->prev) /* Zero or one elements */
193 /* Convert to a null-terminated singly-linked list. */
200 * - pending is a prev-linked "list of lists" of sorted
231 /* Move one element from input list to pending */
232 list->prev = pending;
233 pending = list;
234 list = list->next;
237 } while (list);
240 list = pending;
247 list = merge(priv, cmp, pending, list);
251 merge_final(priv, cmp, head, pending, list);