Lines Matching defs:es

56 swapfunc(char *a, char *b, size_t es)
64 	} while (--es > 0);
104 local_qsort(void *a, size_t n, size_t es, cmp_t *cmp, void *thunk)
115 		for (pm = (char *)a + es; pm < (char *)a + n * es; pm += es)
117 			     pl > (char *)a && CMP(thunk, pl - es, pl) > 0;
118 			     pl -= es)
119 				swapfunc(pl, pl - es, es);
122 	pm = (char *)a + (n / 2) * es;
125 		pn = (char *)a + (n - 1) * es;
127 			size_t d = (n / 8) * es;
135 	swapfunc(a, pm, es);
136 	pa = pb = (char *)a + es;
138 	pc = pd = (char *)a + (n - 1) * es;
142 				swapfunc(pa, pb, es);
143 				pa += es;
145 			pb += es;
149 				swapfunc(pc, pd, es);
150 				pd -= es;
152 			pc -= es;
156 		swapfunc(pb, pc, es);
157 		pb += es;
158 		pc -= es;
161 	pn = (char *)a + n * es;
165 	 * Cast es to preserve signedness of right-hand side of MIN()
166 	 * expression, to avoid sign ambiguity in the implied comparison.  es
169 	d1 = MIN(pd - pc, pn - pd - (ssize_t)es);
176 		if (d1 > es) {
177 			local_qsort(a, d1 / es, es, cmp, thunk);
179 		if (d2 > es) {
181 			/* qsort(pn - d2, d2 / es, es, cmp); */
183 			n = d2 / es;
188 		if (d2 > es) {
189 			local_qsort(pn - d2, d2 / es, es, cmp, thunk);
191 		if (d1 > es) {
193 			/* qsort(a, d1 / es, es, cmp); */
194 			n = d1 / es;
202 (qsort_r)(void *a, size_t n, size_t es, cmp_t *cmp, void *thunk)
204 	local_qsort_r(a, n, es, cmp, thunk);
208 __qsort_r_compat(void *a, size_t n, size_t es, void *thunk, cmp_t *cmp)
210 	local_qsort_r_compat(a, n, es, cmp, thunk);
214 qsort_s(void *a, rsize_t n, rsize_t es, cmp_t *cmp, void *thunk)
219 	} else if (es > RSIZE_MAX) {
220 		__throw_constraint_handler_s("qsort_s : es > RSIZE_MAX",
232 		} else if (es <= 0) {
233 			__throw_constraint_handler_s("qsort_s : es <= 0",
239 	local_qsort_s(a, n, es, cmp, thunk);
244 qsort(void *a, size_t n, size_t es, cmp_t *cmp)
246 	local_qsort(a, n, es, cmp, NULL);