Fixes for pre c99.

blitz.mod/blitz_debug.c

@@ -36,7 +36,8 @@ static void swap(BBSource* a, BBSource* b) {
 static int partition (BBSource arr[], int low, int high) {
 	BBULONG pivot = arr[high].id;
 	int i = (low - 1);
-	for (int j = low; j <= high- 1; j++) {
+	int j;
+	for (j = low; j <= high- 1; j++) {
 		if (arr[j].id < pivot) {
 			i++;
 			swap(&arr[i], &arr[j]);
@@ -111,7 +112,8 @@ BBSource * bbSourceForName(BBString * filename) {
 		bbStringToUTF8StringBuffer(filename, path, &len);
 		path[len] = 0;
 		
-		for (int i = 0; i < bpCount; i++) {
+		int i;
+		for (i = 0; i < bpCount; i++) {
 			if (strcmp(path, sources[i].file) == 0) {
 				return &sources[i];
 			}

blitz.mod/blitz_enum.c

@@ -68,9 +68,10 @@ ENUM_TO_STRING(BBSIZET,t)
 #define TRY_ENUM_CONVERT(type,chr)\
 int bbEnumTryConvert_##chr(BBEnum * bbEnum, type ordinalValue, type * ordinalResult) {\
 	type * value = (type*)bbEnum->values;\
+	int i;\
 	if (bbEnum->flags) {\
 		if (ordinalValue == 0) {\
-			for (int i = 0; i < bbEnum->length; i++) {\
+			for (i = 0; i < bbEnum->length; i++) {\
 				if (*value++ == 0) {\
 					return 1;\
 				}\
@@ -78,7 +79,7 @@ int bbEnumTryConvert_##chr(BBEnum * bbEnum, type ordinalValue, type * ordinalRes
 			return 0;\
 		}\
 		type val = ordinalValue;\
-		for (int i = 0; i < bbEnum->length; i++) {\
+		for (i = 0; i < bbEnum->length; i++) {\
 			val ^= *value++;\
 		}\
 		if (val == 0) {\
@@ -89,7 +90,7 @@ int bbEnumTryConvert_##chr(BBEnum * bbEnum, type ordinalValue, type * ordinalRes
 		if (ordinalValue < *value || ordinalValue > ((type*)bbEnum->values)[bbEnum->length - 1]) {\
 			return 0;\
 		}\
-		for (int i = 0; i < bbEnum->length; i++) {\
+		for (i = 0; i < bbEnum->length; i++) {\
 			if (*value++ == ordinalValue) {\
 				*ordinalResult = ordinalValue;\
 				return 1;\

blitz.mod/tree/tree.h

@@ -27,6 +27,7 @@
 #define _ULIB_TREE_H
 
 #include <stddef.h>
+#include <stdint.h>
 
 #ifdef __cplusplus
 #define new _new_

stringbuilder.mod/glue.c

@@ -627,7 +627,8 @@ int bmx_stringbuilder_compare(struct MaxStringBuilder * buf1, struct MaxStringBu
 	
 	int c = buf1->count < buf2->count ? buf1->count : buf2->count;
 	int n = 0;
-	for (int i=0; i < c; ++i) {
+	int i;
+	for (i=0; i < c; ++i) {
 		if ((n = buf1->buffer[i] - buf2->buffer[i])) {
 			return n;
 		}
@@ -653,8 +654,8 @@ void bmx_stringbuilder_leftalign(struct MaxStringBuilder * buf, int length) {
 		int c = length - buf->count;
 
 		BBChar * p = buf->buffer + buf->count;
-
-		for (int i=0; i < c; ++i) {
+		int i;
+		for (i=0; i < c; ++i) {
 			*p++ = (BBChar)' ';
 		}
 	}
@@ -681,8 +682,8 @@ void bmx_stringbuilder_rightalign(struct MaxStringBuilder * buf, int length) {
 		memmove(buf->buffer + offset, buf->buffer, buf->count * sizeof(BBChar));
 
 		BBChar * p = buf->buffer;
-
-		for (int i=0; i < offset; ++i) {
+		int i;
+		for (i=0; i < offset; ++i) {
 			*p++ = (BBChar)' ';
 		}
 	}