Attachment #180381 for bug #213922

View | Details | Raw Unified | Return to bug 213922
Collapse All | Expand All

Lines 185-203 loop: SWAPINIT(a, es); Link Here

(-)b/crypto/heimdal/lib/roken/qsort.c (-9 / +25 lines)
185	vecswap(a, pb - r, r);	185	vecswap(a, pb - r, r);
186	r = min(pd - pc, pn - pd - es);	186	r = min(pd - pc, pn - pd - es);
187	vecswap(pb, pn - r, r);	187	vecswap(pb, pn - r, r);
188	if ((r = pb - pa) > es)	188	if ((pb - pa) < (pd - pc)) {
		189	if ((r = pb - pa) > es)
189	#ifdef I_AM_QSORT_R	190	#ifdef I_AM_QSORT_R
190	rk_qsort_r(a, r / es, es, thunk, cmp);	191	rk_qsort_r(a, r / es, es, thunk, cmp);
191	#else	192	#else
192	rk_qsort(a, r / es, es, cmp);	193	rk_qsort(a, r / es, es, cmp);
193	#endif	194	#endif
194	if ((r = pd - pc) > es) {	195	if ((r = pd - pc) > es) {
195	/* Iterate rather than recurse to save stack space */	196	/* Iterate rather than recurse to save stack space */
196	a = pn - r;	197	a = pn - r;
197	n = r / es;	198	n = r / es;
198	goto loop;	199	goto loop;
		200	}
		201	/* rk_qsort(pn - r, r / es, es, cmp);*/
		202	} else {
		203	if ((r = pd - pc) > es)
		204	#ifdef I_AM_QSORT_R
		205	rk_qsort_r(pn - r, r / es, es, thunk, cmp);
		206	#else
		207	rk_qsort(pn - r, r / es, es, cmp);
		208	#endif
		209	if ((r = pb - pa) > es) {
		210	/* Iterate rather than recurse to save stack space */
		211	/* a = a; */
		212	n = r / es;
		213	goto loop;
		214	}
		215	/* rk_qsort(a, r / es, es, cmp);*/
199	}	216	}
200	/* rk_qsort(pn - r, r / es, es, cmp);*/
201	}	217	}
202		218
203	#endif /* NEED_QSORT */	219	#endif /* NEED_QSORT */

Lines 186-202 loop: SWAPINIT(long, a, es); Link Here

(-)b/lib/libc/stdlib/qsort.c (-9 / +25 lines)
186	vecswap(a, pb - r, r);	186	vecswap(a, pb - r, r);
187	r = MIN(pd - pc, pn - pd - es);	187	r = MIN(pd - pc, pn - pd - es);
188	vecswap(pb, pn - r, r);	188	vecswap(pb, pn - r, r);
189	if ((r = pb - pa) > es)	189	if ((pb - pa) < (pd - pc)) {
		190	if ((r = pb - pa) > es)
190	#ifdef I_AM_QSORT_R	191	#ifdef I_AM_QSORT_R
191	qsort_r(a, r / es, es, thunk, cmp);	192	qsort_r(a, r / es, es, thunk, cmp);
192	#else	193	#else
193	qsort(a, r / es, es, cmp);	194	qsort(a, r / es, es, cmp);
194	#endif	195	#endif
195	if ((r = pd - pc) > es) {	196	if ((r = pd - pc) > es) {
196	/* Iterate rather than recurse to save stack space */	197	/* Iterate rather than recurse to save stack space */
197	a = pn - r;	198	a = pn - r;
198	n = r / es;	199	n = r / es;
199	goto loop;	200	goto loop;
		201	}
		202	/* qsort(pn - r, r / es, es, cmp);*/
		203	} else {
		204	if ((r = pd - pc) > es)
		205	#ifdef I_AM_QSORT_R
		206	qsort_r(pn - r, r / es, es, thunk, cmp);
		207	#else
		208	qsort(pn - r, r / es, es, cmp);
		209	#endif
		210	if ((r = pb - pa) > es) {
		211	/* Iterate rather than recurse to save stack space */
		212	/* a = a; */
		213	n = r / es;
		214	goto loop;
		215	}
		216	/* qsort(a, r / es, es, cmp);*/
200	}	217	}
201	/* qsort(pn - r, r / es, es, cmp);*/
202	}	218	}

Lines 171-186 loop: SWAPINIT(a, es); Link Here

(-)b/sys/libkern/qsort.c (-8 / +23 lines)
171	vecswap(a, pb - r, r);	171	vecswap(a, pb - r, r);
172	r = min(pd - pc, pn - pd - es);	172	r = min(pd - pc, pn - pd - es);
173	vecswap(pb, pn - r, r);	173	vecswap(pb, pn - r, r);
174	if ((r = pb - pa) > es)	174	if ((pb - pa) < (pd - pc)) {
		175	if ((r = pb - pa) > es)
175	#ifdef I_AM_QSORT_R	176	#ifdef I_AM_QSORT_R
176	qsort_r(a, r / es, es, thunk, cmp);	177	qsort_r(a, r / es, es, thunk, cmp);
177	#else	178	#else
178	qsort(a, r / es, es, cmp);	179	qsort(a, r / es, es, cmp);
179	#endif	180	#endif
180	if ((r = pd - pc) > es) {	181	if ((r = pd - pc) > es) {
181	/* Iterate rather than recurse to save stack space */	182	/* Iterate rather than recurse to save stack space */
182	a = pn - r;	183	a = pn - r;
183	n = r / es;	184	n = r / es;
184	goto loop;	185	goto loop;
		186	}
		187	} else {
		188	if ((r = pd - pc) > es)
		189	#ifdef I_AM_QSORT_R
		190	qsort_r(pn - r, r / es, es, thunk, cmp);
		191	#else
		192	qsort(pn - r, r / es, es, cmp);
		193	#endif
		194	if ((r = pb - pa) > es) {
		195	/* Iterate rather than recurse to save stack space */
		196	/* a = a; */
		197	n = r / es;
		198	goto loop;
		199	}
185	}	200	}
186	}	201	}

Return to bug 213922