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
|
/* -*- 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/. */
//-----------------------------------------------------------------------------
var BUGNUMBER = 203278;
var summary = 'Don\'t crash in recursive js_MarkGCThing';
var actual = 'FAIL';
var expect = 'PASS';
printBugNumber(BUGNUMBER);
printStatus (summary);
// Prepare array to test DeutschSchorrWaite implementation
// and its reverse pointer scanning performance
var a = new Array(1000 * 1000);
var i = a.length;
while (i-- != 0) {
switch (i % 11) {
case 0:
a[i] = { };
break;
case 1:
a[i] = { a: true, b: false, c: 0 };
break;
case 2:
a[i] = { 0: true, 1: {}, 2: false };
break;
case 3:
a[i] = { a: 1.2, b: "", c: [] };
break;
case 4:
a[i] = [ false ];
break;
case 6:
a[i] = [];
break;
case 7:
a[i] = false;
break;
case 8:
a[i] = "x";
break;
case 9:
a[i] = new String("x");
break;
case 10:
a[i] = 1.1;
break;
case 10:
a[i] = new Boolean();
break;
}
}
printStatus("DSF is prepared");
// Prepare linked list that causes recursion during GC with
// depth O(list size)
// Note: pass "-S 500000" option to the shell to limit stack quota
// available for recursion
for (i = 0; i != 50*1000; ++i) {
a = [a, a, {}];
a = [a, {}, a];
}
printStatus("Linked list is prepared");
gc();
actual = 'PASS';
reportCompare(expect, actual, summary);
|
