1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
|
// |reftest| skip-if(!Object.prototype.toSource)
/* -*- tab-width: 2; indent-tabs-mode: nil; js-indent-level: 2 -*- */
/* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/. */
/*
*
* Date: 10 February 2003
* SUMMARY: Object.toSource() recursion should check stack overflow
*
* See http://bugzilla.mozilla.org/show_bug.cgi?id=192465
*
* MODIFIED: 27 February 2003
*
* We are adding an early return to this testcase, since it is causing
* big problems on Linux RedHat8! For a discussion of this issue, see
* http://bugzilla.mozilla.org/show_bug.cgi?id=174341#c24 and following.
*
*
* MODIFIED: 20 March 2003
*
* Removed the early return and changed |N| below from 1000 to 90.
* Note |make_deep_nest(N)| returns an object graph of length N(N+1).
* So the graph has now been reduced from 1,001,000 to 8190.
*
* With this reduction, the bug still manifests on my WinNT and Linux
* boxes (crash due to stack overflow). So the testcase is again of use
* on those boxes. At the same time, Linux RedHat8 boxes can now run
* the test in a reasonable amount of time.
*/
//-----------------------------------------------------------------------------
var UBound = 0;
var BUGNUMBER = 192465;
var summary = 'Object.toSource() recursion should check stack overflow';
var status = '';
var statusitems = [];
var actual = '';
var actualvalues = [];
var expect= '';
var expectedvalues = [];
/*
* We're just testing that this script will compile and run.
* Set both |actual| and |expect| to a dummy value.
*/
status = inSection(1);
var N = 90;
try
{
make_deep_nest(N);
}
catch (e)
{
// An exception is OK, as the runtime can throw one in response to too deep
// recursion. We haven't crashed; good! Continue on to set the dummy values -
}
actual = 1;
expect = 1;
addThis();
//-----------------------------------------------------------------------------
test();
//-----------------------------------------------------------------------------
/*
* EXAMPLE:
*
* If the global variable |N| is 2, then for |level| == 0, 1, 2, the return
* value of this function will be toSource() of these objects, respectively:
*
* {next:{next:END}}
* {next:{next:{next:{next:END}}}}
* {next:{next:{next:{next:{next:{next:END}}}}}}
*
*/
function make_deep_nest(level)
{
var head = {};
var cursor = head;
for (var i=0; i!=N; ++i)
{
cursor.next = {};
cursor = cursor.next;
}
cursor.toSource = function()
{
if (level != 0)
return make_deep_nest(level - 1);
return "END";
}
return head.toSource();
}
function addThis()
{
statusitems[UBound] = status;
actualvalues[UBound] = actual;
expectedvalues[UBound] = expect;
UBound++;
}
function test()
{
printBugNumber(BUGNUMBER);
printStatus(summary);
for (var i=0; i<UBound; i++)
{
reportCompare(expectedvalues[i], actualvalues[i], statusitems[i]);
}
}
|
