Andreas Schlick reported a failure on 64-bit systems; we should simply
test that the number of iterators does not grow on second iteration,
rather than assuming an explicit limit as compilers may vary.
Signed-off-by: Rusty Russell <rusty@rustcorp.com.au>
+ int i, j, sum, max_iters;
sum = 0;
foreach_int(i, 0, 1, 2, 3, 4)
sum = 0;
foreach_int(i, 0, 1, 2, 3, 4)
diag("sum = %i\n", sum);
diag("iters = %i\n", count_iters());
ok1(sum == 160);
diag("sum = %i\n", sum);
diag("iters = %i\n", count_iters());
ok1(sum == 160);
- ok1(count_iters() <= 2 + 2 + 5); /* 5 is max depth of recursion. */
sum = test_ptr_recursion("0");
diag("sum = %i\n", sum);
diag("iters = %i\n", count_iters());
ok1(sum == 160);
sum = test_ptr_recursion("0");
diag("sum = %i\n", sum);
diag("iters = %i\n", count_iters());
ok1(sum == 160);
- ok1(count_iters() <= 2 + 2 + 5);
+ if (i == 0)
+ max_iters = count_iters();
+ else
+ ok1(count_iters() <= max_iters);
}
return exit_status();
}
}
return exit_status();
}