Lines Matching full:lists

140  * pending lists.  This is beautifully simple code, but rather subtle.
144  * for each bit, when count increments to 2^k), we merge two lists of
148  * 2^k, which is when we have 2^k elements pending in smaller lists,
149  * so it's safe to merge away two lists of size 2^k.
151  * After this happens twice, we have created two lists of size 2^(k+1),
155  * The number of pending lists of size 2^k is determined by the
172  * We gain lists of size 2^k in the 2->3 and 4->5 transitions (because
179  * lists, from smallest to largest.  If you work through cases 2 to
198 	 * - All lists are singly linked and null-terminated; prev  in list_sort()
200 	 * - pending is a prev-linked "list of lists" of sorted  in list_sort()
239 	/* End of input; merge together all the pending lists. */  in list_sort()