linux-5.10/lib/sort.c

22  * @size: size of each element
46  * @a: pointer to the first element to swap
47  * @b: pointer to the second element to swap
48  * @n: element size (must be a multiple of 4)
69  * @a: pointer to the first element to swap
70  * @b: pointer to the second element to swap
71  * @n: element size (must be a multiple of 8)
105  * @a: pointer to the first element to swap
106  * @b: pointer to the second element to swap
107  * @n: element size
156  * @i: the offset of the heap element whose parent is sought.  Non-zero.
158  * @size: size of each element
160  * In terms of array indexes, the parent of element j = @i/@size is simply
184  * @size: size of each element
238 		 * Sift element at "a" down into heap.  This is the  in sort_r()
242 		 * backtrack to find where to insert the target element.  in sort_r()