d0p1/ack
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

fixed problem with qsort(): did not work for objects whose size did not

Browse source 
fit in an int
This commit is contained in:
ceriel 1991-01-29 14:37:37 +00:00
parent ff766530eb
commit 48e0d9825a
1 changed files with 10 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

12
lang/cem/libcc/gen/qsort.c
View file

@ -9,7 +9,10 @@ qsort(base, nel, width, compar)
int (*compar)();
{
qcompar = compar;
qsort1(base, base + (nel - 1) * width, width);
if (sizeof(int) < sizeof(char *)) {
qsort1(base, base + (nel - 1) * (long) width, width);
}
else qsort1(base, base + (nel - 1) * width, width);
}
static
@ -25,7 +28,12 @@ qsort1(a1, a2, width)
if (a2 <= a1) return;
left = a1;
right = a2;
lefteq = righteq = a1 + width * (((a2-a1)+width)/(2*width));
if (sizeof(int) < sizeof(char *)) {
lefteq = righteq = a1 + width *
((((long)a2-(long)a1)+width)/(2*width));
}
else lefteq = righteq = a1 + width *
(((a2-a1)+width)/(2*width));
/*
Pick an element in the middle of the array.
We will collect the equals around it.