michael@0: var a = [1,2,3,4];
michael@0: 
michael@0: // Basic constants.
michael@0: function foo(x) {
michael@0:   return x[0] + x[1] + x[2] + x[3];
michael@0: }
michael@0: for (var i = 0; i < 100; i++)
michael@0:   assertEq(foo(a), 10);
michael@0: assertEq(foo([1,2,3]), NaN);
michael@0: 
michael@0: // Basic terms.
michael@0: function foo2(x, n) {
michael@0:   return x[n] + x[n + 1] + x[n + 2];
michael@0: }
michael@0: for (var i = 0; i < 100; i++)
michael@0:   assertEq(foo2(a, 1), 9);
michael@0: assertEq(foo2(a, 2), NaN);
michael@0: 
michael@0: // Term underflow.
michael@0: function foo3(x, n) {
michael@0:   return x[n] + x[n + 1] + x[n + 2];
michael@0: }
michael@0: for (var i = 0; i < 100; i++)
michael@0:   assertEq(foo3(a, 1), 9);
michael@0: assertEq(foo3(a, -1), NaN);
michael@0: 
michael@0: // Integer overflow computing bound.
michael@0: function foo4(x, n) {
michael@0:   return x[n] + x[n + 1] + x[n + 2];
michael@0: }
michael@0: for (var i = 0; i < 45; i++)
michael@0:   assertEq(foo4(a, 1), 9);
michael@0: assertEq(foo4(a, 0x7fffffff), NaN);
michael@0: 
michael@0: // Underflow at an offset.
michael@0: function foo5(x, n) {
michael@0:   return x[n + 10] + x[n + 11] + x[n + 12];
michael@0: }
michael@0: for (var i = 0; i < 45; i++)
michael@0:   assertEq(foo5(a, -9), 9);
michael@0: assertEq(foo5(a, -11), NaN);
michael@0: 
michael@0: // Overflow at offset.
michael@0: function foo6(x, n) {
michael@0:   return x[n - 10] + x[n - 11] + x[n - 12];
michael@0: }
michael@0: for (var i = 0; i < 45; i++)
michael@0:   assertEq(foo6(a, 13), 9);
michael@0: assertEq(foo6(a, 14), NaN);