X-Git-Url: https://pd.if.org/git/?p=pdclib.old;a=blobdiff_plain;f=functions%2Fstdlib%2Fqsort.c;h=c37760f546fa47a089b913cff22d47e084f7d13f;hp=6bb636f5631d5c50a51f9052c9b947f61507fb49;hb=0d54a75af25ca44411e7c4190cc2a93a390e61a2;hpb=18af9d0a4cd252433e0cbd5daf4640e325c9d0ab

diff --git a/functions/stdlib/qsort.c b/functions/stdlib/qsort.c
index 6bb636f..c37760f 100644
--- a/functions/stdlib/qsort.c
+++ b/functions/stdlib/qsort.c
@@ -41,14 +41,14 @@ void qsort( void * base, size_t nmemb, size_t size, int (*compar)( const void *,
 {
     char * i;
     char * j;
-    _PDCLIB_ptrdiff_t thresh  = T * size;
-    char * base_              = (char *)base;
-    char * limit              = base_ + nmemb * size;
+    _PDCLIB_size_t thresh = T * size;
+    char * base_          = (char *)base;
+    char * limit          = base_ + nmemb * size;
     PREPARE_STACK;
 
     for ( ;; )
     {
-        if ( limit - base_ > thresh ) /* QSort for more than T elements. */
+        if ( (size_t)( limit - base_ ) > thresh ) /* QSort for more than T elements. */
         {
             /* We work from second to last - first will be pivot element. */
             i = base_ + size;