@@ -95,7 +95,8 @@ static void test_file_write_bytes(mpack_writer_t* writer, mpack_tag_t tag) {
95
95
96
96
static void test_file_write_elements (mpack_writer_t * writer , mpack_tag_t tag ) {
97
97
mpack_write_tag (writer , tag );
98
- for (size_t i = 0 ; i < tag .v .n ; ++ i ) {
98
+ size_t i ;
99
+ for (i = 0 ; i < tag .v .n ; ++ i ) {
99
100
if (tag .type == mpack_type_map )
100
101
mpack_write_nil (writer );
101
102
mpack_write_nil (writer );
@@ -160,10 +161,11 @@ static void test_file_write_contents(mpack_writer_t* writer) {
160
161
mpack_finish_array (writer );
161
162
162
163
// test deep nesting
163
- for (int i = 0 ; i < nesting_depth ; ++ i )
164
+ int i ;
165
+ for (i = 0 ; i < nesting_depth ; ++ i )
164
166
mpack_start_array (writer , 1 );
165
167
mpack_write_nil (writer );
166
- for (int i = 0 ; i < nesting_depth ; ++ i )
168
+ for (i = 0 ; i < nesting_depth ; ++ i )
167
169
mpack_finish_array (writer );
168
170
169
171
mpack_finish_array (writer );
@@ -188,7 +190,8 @@ static void test_file_write_failures(void) {
188
190
int count = UINT16_MAX / 20 ;
189
191
mpack_writer_init_filename (& writer , "/dev/full" );
190
192
mpack_start_array (& writer , (uint32_t )count );
191
- for (int i = 0 ; i < count ; ++ i )
193
+ int i ;
194
+ for (i = 0 ; i < count ; ++ i )
192
195
mpack_write_cstr (& writer , quick_brown_fox );
193
196
mpack_finish_array (& writer );
194
197
TEST_WRITER_DESTROY_ERROR (& writer , mpack_error_io );
@@ -257,10 +260,11 @@ static bool test_file_write_failure(void) {
257
260
mpack_finish_array (& writer );
258
261
259
262
// test deep nesting
260
- for (int i = 0 ; i < nesting_depth ; ++ i )
263
+ int i ;
264
+ for (i = 0 ; i < nesting_depth ; ++ i )
261
265
mpack_start_array (& writer , 1 );
262
266
mpack_write_nil (& writer );
263
- for (int i = 0 ; i < nesting_depth ; ++ i )
267
+ for (i = 0 ; i < nesting_depth ; ++ i )
264
268
mpack_finish_array (& writer );
265
269
266
270
mpack_finish_array (& writer );
@@ -390,7 +394,8 @@ static void test_file_expect_bytes(mpack_reader_t* reader, mpack_tag_t tag) {
390
394
391
395
static void test_file_expect_elements (mpack_reader_t * reader , mpack_tag_t tag ) {
392
396
mpack_expect_tag (reader , tag );
393
- for (size_t i = 0 ; i < tag .v .n ; ++ i ) {
397
+ size_t i ;
398
+ for (i = 0 ; i < tag .v .n ; ++ i ) {
394
399
if (tag .type == mpack_type_map )
395
400
mpack_expect_nil (reader );
396
401
mpack_expect_nil (reader );
@@ -457,10 +462,11 @@ static void test_file_read_contents(mpack_reader_t* reader) {
457
462
test_file_expect_elements (reader , mpack_tag_map (UINT16_MAX + 1 ));
458
463
mpack_done_array (reader );
459
464
460
- for (int i = 0 ; i < nesting_depth ; ++ i )
465
+ int i ;
466
+ for (i = 0 ; i < nesting_depth ; ++ i )
461
467
mpack_expect_array_match (reader , 1 );
462
468
mpack_expect_nil (reader );
463
- for (int i = 0 ; i < nesting_depth ; ++ i )
469
+ for (i = 0 ; i < nesting_depth ; ++ i )
464
470
mpack_done_array (reader );
465
471
466
472
mpack_done_array (reader );
@@ -529,7 +535,8 @@ static void test_file_read_streaming(void) {
529
535
// than read by a single call to the fill function.
530
536
531
537
size_t sizes [] = {1 , 2 , 3 , 5 , 7 , 11 };
532
- for (size_t i = 0 ; i < sizeof (sizes ) / sizeof (* sizes ); ++ i ) {
538
+ size_t i ;
539
+ for (i = 0 ; i < sizeof (sizes ) / sizeof (* sizes ); ++ i ) {
533
540
534
541
FILE * file = fopen (test_filename , "rb" );
535
542
TEST_TRUE (file != NULL , "failed to open file! filename %s" , test_filename );
@@ -657,7 +664,8 @@ static void test_file_node_bytes(mpack_node_t node, mpack_tag_t tag) {
657
664
658
665
static void test_file_node_elements (mpack_node_t node , mpack_tag_t tag ) {
659
666
TEST_TRUE (mpack_tag_equal (tag , mpack_node_tag (node )));
660
- for (size_t i = 0 ; i < tag .v .n ; ++ i ) {
667
+ size_t i ;
668
+ for (i = 0 ; i < tag .v .n ; ++ i ) {
661
669
if (tag .type == mpack_type_map ) {
662
670
mpack_node_nil (mpack_node_map_key_at (node , i ));
663
671
mpack_node_nil (mpack_node_map_value_at (node , i ));
@@ -728,7 +736,8 @@ static void test_file_node_contents(mpack_node_t root) {
728
736
test_file_node_elements (mpack_node_array_at (node , 4 ), mpack_tag_map (UINT16_MAX + 1 ));
729
737
730
738
node = mpack_node_array_at (root , 6 );
731
- for (int i = 0 ; i < nesting_depth ; ++ i )
739
+ int i ;
740
+ for (i = 0 ; i < nesting_depth ; ++ i )
732
741
node = mpack_node_array_at (node , 0 );
733
742
TEST_TRUE (mpack_ok == mpack_node_error (node ));
734
743
mpack_node_nil (node );
@@ -825,7 +834,8 @@ static void test_file_node_stream() {
825
834
826
835
size_t steps [] = {11 , 23 , 32 , 127 , 369 , 4096 , SIZE_MAX };
827
836
828
- for (size_t i = 0 ; i < sizeof (steps ) / sizeof (steps [0 ]); ++ i ) {
837
+ size_t i ;
838
+ for (i = 0 ; i < sizeof (steps ) / sizeof (steps [0 ]); ++ i ) {
829
839
stream .pos = 0 ;
830
840
stream .step = steps [i ];
831
841
@@ -839,7 +849,8 @@ static void test_file_node_stream() {
839
849
mpack_error_to_string (mpack_tree_error (& tree )));
840
850
841
851
// We try parsing the same tree a dozen times repeatedly with this step size.
842
- for (int j = 0 ; j < 12 ; ++ j ) {
852
+ int j ;
853
+ for (j = 0 ; j < 12 ; ++ j ) {
843
854
mpack_tree_parse (& tree );
844
855
TEST_TRUE (mpack_tree_error (& tree ) == mpack_ok , "tree parsing failed: %s" ,
845
856
mpack_error_to_string (mpack_tree_error (& tree )));
@@ -921,7 +932,8 @@ static bool test_file_node_failure(void) {
921
932
}
922
933
923
934
node = mpack_node_array_at (root , 1 );
924
- for (int i = 0 ; i < nesting_depth ; ++ i )
935
+ int i ;
936
+ for (i = 0 ; i < nesting_depth ; ++ i )
925
937
node = mpack_node_array_at (node , 0 );
926
938
TEST_TRUE (mpack_ok == mpack_node_error (node ));
927
939
mpack_node_nil (node );
0 commit comments