| 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: --expose-gc --allow-natives-syntax | |
| 29 | |
| 30 function test() { | |
| 31 var s1 = %NewString(26, true); | |
| 32 for (i = 0; i < 26; i++) %_OneByteSeqStringSetChar(i, 65, s1); | |
| 33 assertEquals("AAAAAAAAAAAAAAAAAAAAAAAAAA", s1); | |
| 34 %_OneByteSeqStringSetChar(25, 66, s1); | |
| 35 assertEquals("AAAAAAAAAAAAAAAAAAAAAAAAAB", s1); | |
| 36 for (i = 0; i < 26; i++) %_OneByteSeqStringSetChar(i, i+65, s1); | |
| 37 assertEquals("ABCDEFGHIJKLMNOPQRSTUVWXYZ", s1); | |
| 38 s1 = %TruncateString(s1, 13); | |
| 39 assertEquals("ABCDEFGHIJKLM", s1); | |
| 40 | |
| 41 var s2 = %NewString(26, false); | |
| 42 for (i = 0; i < 26; i++) %_TwoByteSeqStringSetChar(i, 65, s2); | |
| 43 assertEquals("AAAAAAAAAAAAAAAAAAAAAAAAAA", s2); | |
| 44 %_TwoByteSeqStringSetChar(25, 66, s2); | |
| 45 assertEquals("AAAAAAAAAAAAAAAAAAAAAAAAAB", s2); | |
| 46 for (i = 0; i < 26; i++) %_TwoByteSeqStringSetChar(i, i+65, s2); | |
| 47 assertEquals("ABCDEFGHIJKLMNOPQRSTUVWXYZ", s2); | |
| 48 s2 = %TruncateString(s2, 13); | |
| 49 assertEquals("ABCDEFGHIJKLM", s2); | |
| 50 | |
| 51 var s3 = %NewString(26, false); | |
| 52 for (i = 0; i < 26; i++) %_TwoByteSeqStringSetChar(i, i+1000, s3); | |
| 53 for (i = 0; i < 26; i++) assertEquals(s3[i], String.fromCharCode(i+1000)); | |
| 54 | |
| 55 var a = []; | |
| 56 for (var i = 0; i < 1000; i++) { | |
| 57 var s = %NewString(10000, i % 2 == 1); | |
| 58 a.push(s); | |
| 59 } | |
| 60 | |
| 61 gc(); | |
| 62 | |
| 63 for (var i = 0; i < 1000; i++) { | |
| 64 assertEquals(10000, a[i].length); | |
| 65 a[i] = %TruncateString(a[i], 5000); | |
| 66 } | |
| 67 | |
| 68 gc(); | |
| 69 | |
| 70 for (var i = 0; i < 1000; i++) { | |
| 71 assertEquals(5000, a[i].length); | |
| 72 } | |
| 73 } | |
| 74 | |
| 75 | |
| 76 test(); | |
| 77 test(); | |
| 78 %OptimizeFunctionOnNextCall(test); | |
| 79 test(); | |
| OLD | NEW |