X-Git-Url: http://nsz.repo.hu/git/?a=blobdiff_plain;f=src%2Fstdlib%2Fqsort.c;h=434d9350726df8413295db92846d37ac7f63a2f4;hb=f0f17b5b70f700f83d6ee838458d52d94d4e7ac0;hp=866af0ecd6c2a394f896a8e3d8a0403e9da94577;hpb=22263709eda9f7d692a0f484fd759f757418dbd7;p=musl

diff --git a/src/stdlib/qsort.c b/src/stdlib/qsort.c
index 866af0ec..434d9350 100644
--- a/src/stdlib/qsort.c
+++ b/src/stdlib/qsort.c
@@ -155,12 +155,16 @@ void qsort(void *base, size_t nel, size_t width, cmpfun cmp)
 {
 	size_t lp[12*sizeof(size_t)];
 	size_t i, size = width * nel;
-	unsigned char *head = base,
-	              *high = head + size - width;
+	unsigned char *head, *high;
 	size_t p[2] = {1, 0};
 	int pshift = 1;
 	int trail;
 
+	if (!size) return;
+
+	head = base;
+	high = head + size - width;
+
 	/* Precompute Leonardo numbers, scaled by element width */
 	for(lp[0]=lp[1]=width, i=2; (lp[i]=lp[i-2]+lp[i-1]+width) < size; i++);