Home | History | Annotate | Download | only in mjsunit
      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(s1, i, i+65);
     33   assertEquals("ABCDEFGHIJKLMNOPQRSTUVWXYZ", s1);
     34   s1 = %TruncateString(s1, 13);
     35   assertEquals("ABCDEFGHIJKLM", s1);
     36 
     37   var s2 = %NewString(26, false);
     38   for (i = 0; i < 26; i++) %_TwoByteSeqStringSetChar(s2, i, i+65);
     39   assertEquals("ABCDEFGHIJKLMNOPQRSTUVWXYZ", s2);
     40   s2 = %TruncateString(s1, 13);
     41   assertEquals("ABCDEFGHIJKLM", s2);
     42 
     43   var s3 = %NewString(26, false);
     44   for (i = 0; i < 26; i++) %_TwoByteSeqStringSetChar(s3, i, i+1000);
     45   for (i = 0; i < 26; i++) assertEquals(s3[i], String.fromCharCode(i+1000));
     46 
     47   var a = [];
     48   for (var i = 0; i < 1000; i++) {
     49     var s = %NewString(10000, i % 2 == 1);
     50     a.push(s);
     51   }
     52 
     53   gc();
     54 
     55   for (var i = 0; i < 1000; i++) {
     56     assertEquals(10000, a[i].length);
     57     a[i] = %TruncateString(a[i], 5000);
     58   }
     59 
     60   gc();
     61 
     62   for (var i = 0; i < 1000; i++) {
     63     assertEquals(5000, a[i].length);
     64   }
     65 }
     66 
     67 
     68 test();
     69 test();
     70 %OptimizeFunctionOnNextCall(test);
     71 test();
     72 
     73