From: Simon Armstrong <Simon Armstrong>
Date: Sat, 21 Jan 2017 22:39:01 +0000 (+1300)
Subject: fix compilation issue with mingw gcc 6.3.0
X-Git-Url: https://jcornell.net/gitweb/gitweb.cgi?a=commitdiff_plain;h=6ed48c5290c828e858b31c692467eb4d61a7885d;p=blitzmax.git

fix compilation issue with mingw gcc 6.3.0
---

diff --git a/mod/brl.mod/blitz.mod/blitz_array.c b/mod/brl.mod/blitz.mod/blitz_array.c
index 27269e6..e729f81 100644
--- a/mod/brl.mod/blitz.mod/blitz_array.c
+++ b/mod/brl.mod/blitz.mod/blitz_array.c
@@ -349,7 +349,7 @@ static void IDENT( TYPE *lo,TYPE *hi ){\
 #undef LESSTHAN
 #define LESSTHAN(X,Y) (*(X)<*(Y))
 QSORTARRAY( unsigned char,_qsort_b )
-QSORTARRAY( unsigned short,qsort_s )
+QSORTARRAY( unsigned short,_qsort_s )
 QSORTARRAY( int,qsort_i )
 QSORTARRAY( BBInt64,qsort_l );
 QSORTARRAY( float,qsort_f );
@@ -378,7 +378,7 @@ void bbArraySort( BBArray *arr,int ascending ){
 	if( ascending ){
 		switch( arr->type[0] ){
 		case 'b':_qsort_b( (unsigned char*)p,(unsigned char*)p+n );break;
-		case 's':qsort_s( (unsigned short*)p,(unsigned short*)p+n );break;
+		case 's':_qsort_s( (unsigned short*)p,(unsigned short*)p+n );break;
 		case 'i':qsort_i( (int*)p,(int*)p+n );break;
 		case 'l':qsort_l( (BBInt64*)p,(BBInt64*)p+n );break;
 		case 'f':qsort_f( (float*)p,(float*)p+n );break;