22 	size_t sizeOfElement)  in sort_r_swap()  argument
25 	char* end = itemA + sizeOfElement;  in sort_r_swap()
35 	size_t sizeOfElement, _compare_function_qsort_r cmpFunc, void* cookie)  in sort_r_cmpswap()  argument
38 		sort_r_swap(itemA, itemB, sizeOfElement);  in sort_r_cmpswap()
69 sort_r_simple(char* base, size_t numElements, size_t sizeOfElement,  in sort_r_simple()  argument
72 	char* end = base + (numElements * sizeOfElement);  in sort_r_simple()
79 		for (pivIndexA = base + sizeOfElement; pivIndexA < end;  in sort_r_simple()
80 			pivIndexA += sizeOfElement) {  in sort_r_simple()
83 				&& sort_r_cmpswap(pivIndexB - sizeOfElement , pivIndexB,  in sort_r_simple()
84 						sizeOfElement, cmpFunc, cookie)) {  in sort_r_simple()
85 				pivIndexB -= sizeOfElement;  in sort_r_simple()
97 		char* last = base + sizeOfElement * (numElements - 1);  in sort_r_simple()
104 		pivList[0] = base + sizeOfElement;  in sort_r_simple()
105 		pivList[1] = base + sizeOfElement * (numElements / 2);  in sort_r_simple()
106 		pivList[2] = last - sizeOfElement;  in sort_r_simple()
119 			sort_r_swap(pivList[1], last, sizeOfElement);  in sort_r_simple()
142 				nextPivCmpItem += sizeOfElement) {  in sort_r_simple()
149 							sizeOfElement);  in sort_r_simple()
151 					nextPivEqualsPos += sizeOfElement;  in sort_r_simple()
162 				lastPivCmpItem -= sizeOfElement;  in sort_r_simple()
166 					lastPivEqualsPos -= sizeOfElement;  in sort_r_simple()
169 							sizeOfElement);  in sort_r_simple()
174 							sizeOfElement);  in sort_r_simple()
176 					nextPivCmpItem += sizeOfElement;  in sort_r_simple()
195 		sort_r_simple(base, (nextPivCmpItem - nextPivEqualsPos) / sizeOfElement,  in sort_r_simple()
196 			sizeOfElement, cmpFunc, cookie);  in sort_r_simple()
198 			(lastPivEqualsPos - lastPivCmpItem) / sizeOfElement, sizeOfElement,  in sort_r_simple()
205 qsort_r(void* base, size_t numElements, size_t sizeOfElement,  in qsort_r()  argument
208 	sort_r_simple((char*)base, numElements, sizeOfElement,  in qsort_r()