michael@0: // Same thing but nested trees, each reconstructing one or more stack frames 
michael@0: // (so, several functions with loops, such that the loops end up being
michael@0: // nested though they are not lexically nested)
michael@0: 
michael@0: function testSlowArrayPopNestedTrees() {    
michael@0:     var a = [];
michael@0:     for (var i = 0; i < 9; i++)
michael@0:         a[i] = [0];
michael@0:     a[8].__defineGetter__("0", function () { return 3.14159 });
michael@0: 
michael@0:     function child(a, i, j, k) {
michael@0:         var last = 2.71828;
michael@0:         for (var l = 0; l < 9; l++)
michael@0:             if (i == 8 && j == 8 && k == 8)
michael@0:                 last = a[l].pop();  // reenters interpreter in getter
michael@0:         return last;
michael@0:     }
michael@0:     function parent(a, i, j) {
michael@0:         var last;
michael@0:         for (var k = 0; k < 9; k++)
michael@0:             last = child(a, i, j, k);
michael@0:         return last;
michael@0:     }
michael@0:     function gramps(a, i) { 
michael@0:         var last;
michael@0:         for (var j = 0; j < 9; j++)
michael@0:             last = parent(a, i, j);
michael@0:         return last;
michael@0:     }
michael@0: 
michael@0:     var last;
michael@0:     for (var i = 0; i < 9; i++)
michael@0:         last = gramps(a, i);
michael@0:     return last;
michael@0: }
michael@0: assertEq(testSlowArrayPopNestedTrees(), 3.14159);