1 // Same thing but nested trees, each reconstructing one or more stack frames
2 // (so, several functions with loops, such that the loops end up being
3 // nested though they are not lexically nested)
5 function testSlowArrayPopNestedTrees() {
7 for (var i = 0; i < RUNLOOP; i++)
9 a[RUNLOOP-1].__defineGetter__("0", function () { return 3.14159 });
11 function child(a, i, j, k) {
13 for (var l = 0; l < RUNLOOP; l++)
14 if (i == RUNLOOP-1 && j == RUNLOOP-1 && k == RUNLOOP-1)
15 last = a[l].pop(); // reenters interpreter in getter
18 function parent(a, i, j) {
20 for (var k = 0; k < RUNLOOP; k++)
21 last = child(a, i, j, k);
24 function gramps(a, i) {
26 for (var j = 0; j < RUNLOOP; j++)
27 last = parent(a, i, j);
32 for (var i = 0; i < RUNLOOP; i++)
36 assertEq(testSlowArrayPopNestedTrees(), 3.14159);