OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
11 // with the distribution. | 11 // with the distribution. |
12 // * Neither the name of Google Inc. nor the names of its | 12 // * Neither the name of Google Inc. nor the names of its |
13 // contributors may be used to endorse or promote products derived | 13 // contributors may be used to endorse or promote products derived |
14 // from this software without specific prior written permission. | 14 // from this software without specific prior written permission. |
15 // | 15 // |
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
27 | 27 |
28 // Test that we correctly restore the stack when continuing from a | 28 // Ensure extending an empty packed smi array with a double initializes the |
29 // finally block inside a for-in. | 29 // array with holes. |
| 30 var a = [1,2,3]; |
| 31 a.length = 0; |
| 32 a[0] = 1.4; |
| 33 assertEquals(undefined, a[1]); |
| 34 assertEquals(undefined, a[2]); |
| 35 assertEquals(undefined, a[3]); |
30 | 36 |
31 var f = 0; | 37 // Ensure the double array growstub initializes the array with holes. |
32 var a = [1, 2, 3]; | 38 function grow_store(a,i,v) { |
| 39 a[i] = v; |
| 40 } |
33 | 41 |
34 for (x in a) { | 42 var a2 = [1.3]; |
35 try{ | 43 grow_store(a2,1,1.4); |
36 throw 'error'; | 44 a2.length = 0; |
37 } finally { | 45 grow_store(a2,0,1.5); |
38 f++; | 46 assertEquals(undefined, a2[1]); |
39 continue; | 47 assertEquals(undefined, a2[2]); |
40 } | 48 assertEquals(undefined, a2[3]); |
41 } | |
42 assertEquals(3, f); | |
43 | 49 |
44 f = 0; | 50 // Check storing objects using the double grow stub. |
45 for (x in a) { | 51 var a3 = [1.3]; |
46 try { | 52 var o = {}; |
47 f++; | 53 grow_store(a3, 1, o); |
48 } finally { | 54 assertEquals(1.3, a3[0]); |
49 f++; | 55 assertEquals(o, a3[1]); |
50 continue; | |
51 } | |
52 } | |
53 assertEquals(6, f); | |
54 | |
55 f = 0; | |
56 for (x in a) { | |
57 try { | |
58 f++; | |
59 } finally { | |
60 try { | |
61 throw 'error' | |
62 } finally { | |
63 try { | |
64 f++; | |
65 } finally { | |
66 f++; | |
67 continue; | |
68 } | |
69 } | |
70 } | |
71 } | |
72 assertEquals(9, f); | |
OLD | NEW |