OLD | NEW |
---|---|
(Empty) | |
1 // Copyright 2012 the V8 project authors. All rights reserved. | |
2 // Redistribution and use in source and binary forms, with or without | |
3 // modification, are permitted provided that the following conditions are | |
4 // met: | |
5 // | |
6 // * Redistributions of source code must retain the above copyright | |
7 // notice, this list of conditions and the following disclaimer. | |
8 // * Redistributions in binary form must reproduce the above | |
9 // copyright notice, this list of conditions and the following | |
10 // disclaimer in the documentation and/or other materials provided | |
11 // with the distribution. | |
12 // * Neither the name of Google Inc. nor the names of its | |
13 // contributors may be used to endorse or promote products derived | |
14 // from this software without specific prior written permission. | |
15 // | |
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
27 | |
28 // Flags: --allow-natives-syntax --smi-only-arrays | |
Jakob Kummerow
2012/05/13 21:55:27
Might want to specify --packed-arrays here too ;-)
danno
2012/05/22 11:05:21
Done.
| |
29 | |
30 var has_packed_elements = !%HasFastHoleyElements([]); | |
31 | |
32 function test1() { | |
33 var a = Array(8); | |
34 assertTrue(%HasFastSmiOrObjectElements(a)); | |
35 assertTrue(%HasFastHoleyElements(a)); | |
36 } | |
37 | |
38 function test2() { | |
39 var a = Array(); | |
40 assertTrue(%HasFastSmiOrObjectElements(a)); | |
41 assertFalse(%HasFastHoleyElements(a)); | |
42 } | |
43 | |
44 function test3() { | |
45 var a = Array(1,2,3,4,5,6,7); | |
46 assertTrue(%HasFastSmiOrObjectElements(a)); | |
47 assertFalse(%HasFastHoleyElements(a)); | |
48 } | |
49 | |
50 function test4() { | |
51 var a = [1, 2, 3, 4]; | |
52 assertTrue(%HasFastSmiElements(a)); | |
53 assertFalse(%HasFastHoleyElements(a)); | |
54 var b = [1, 2,, 4]; | |
55 assertTrue(%HasFastSmiElements(b)); | |
56 assertTrue(%HasFastHoleyElements(b)); | |
57 } | |
58 | |
59 function test5() { | |
60 var a = [1, 2, 3, 4.5]; | |
61 assertTrue(%HasFastDoubleElements(a)); | |
62 assertFalse(%HasFastHoleyElements(a)); | |
63 var b = [1,, 3.5, 4]; | |
64 assertTrue(%HasFastDoubleElements(b)); | |
65 assertTrue(%HasFastHoleyElements(b)); | |
66 var c = [1, 3.5,, 4]; | |
67 assertTrue(%HasFastDoubleElements(c)); | |
68 assertTrue(%HasFastHoleyElements(c)); | |
69 } | |
70 | |
71 function test6() { | |
72 var x = new Object(); | |
73 var a = [1, 2, 3.5, x]; | |
74 assertTrue(%HasFastObjectElements(a)); | |
75 assertFalse(%HasFastHoleyElements(a)); | |
76 assertEquals(1, a[0]); | |
77 assertEquals(2, a[1]); | |
78 assertEquals(3.5, a[2]); | |
79 assertEquals(x, a[3]); | |
80 var b = [1,, 3.5, x]; | |
81 assertTrue(%HasFastObjectElements(b)); | |
82 assertTrue(%HasFastHoleyElements(b)); | |
83 assertEquals(1, b[0]); | |
84 assertEquals(undefined, b[1]); | |
85 assertEquals(3.5, b[2]); | |
86 assertEquals(x, b[3]); | |
87 var c = [1, 3.5, x,,]; | |
88 assertTrue(%HasFastObjectElements(c)); | |
89 assertTrue(%HasFastHoleyElements(c)); | |
90 assertEquals(1, c[0]); | |
91 assertEquals(3.5, c[1]); | |
92 assertEquals(x, c[2]); | |
93 assertEquals(undefined, c[3]); | |
94 } | |
95 | |
96 function test_with_optimization(f) { | |
97 // Run tests in a loop to make sure that inlined Array() constructor runs out | |
98 // of new space memory and must fall back on runtime impl. | |
99 for (i = 0; i < 250000; ++i) f(); | |
100 %OptimizeFunctionOnNextCall(f); | |
101 for (i = 0; i < 250000; ++i) f(); // Make sure GC happens | |
102 } | |
103 | |
104 if (has_packed_elements) { | |
105 test_with_optimization(test1); | |
106 test_with_optimization(test2); | |
107 test_with_optimization(test3); | |
108 test_with_optimization(test4); | |
109 test_with_optimization(test5); | |
110 test_with_optimization(test6); | |
111 } | |
112 | |
OLD | NEW |