Ben Murdoch | 8b112d2 | 2011-06-08 16:22:53 +0100 | [diff] [blame] | 1 | // Copyright 2011 the V8 project authors. All rights reserved. |
Steve Block | a7e24c1 | 2009-10-30 11:49:00 +0000 | [diff] [blame] | 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 | |
Steve Block | 053d10c | 2011-06-13 19:13:29 +0100 | [diff] [blame] | 28 | // Flags: --expose-gc |
| 29 | |
| 30 | // Create array large enough to span several page regions. |
| 31 | var a = new Array(500); |
| 32 | |
| 33 | // Fill it with values. |
| 34 | for (var i = 0; i < a.length; i++) a[i] = {idx:i}; |
| 35 | |
| 36 | // Force it into oldspace. |
| 37 | gc(); |
| 38 | gc(); |
| 39 | |
| 40 | // Array should be in old space now. Store young object into array. |
| 41 | // Region will be marked. |
| 42 | a[0] = {idx:0}; |
| 43 | |
| 44 | // Delete elements a[2] .. a[201]. Internally we will use |
| 45 | // trimming of backing store. a[0] a[1] will be moved to |
| 46 | // memory location previously occupied by a[200] a[201]. |
| 47 | a.splice(2, 200); |
| 48 | |
| 49 | // Force gc and heap verification. |
| 50 | gc(); |
| 51 | |
| 52 | // Try accessing a[0].idx. It will segfault if write-barrier was accidentally |
| 53 | // omitted. |
| 54 | assertEquals(0, a[0].idx); |
| 55 | assertEquals(1, a[1].idx); |
| 56 | assertEquals(202, a[2].idx); |