Line data    Source code

       1             : // Copyright 2013 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             : // Check that we can traverse very deep stacks of ConsStrings using
      29             : // StringCharacterStram.  Check that Get(int) works on very deep stacks
      30             : // of ConsStrings.  These operations may not be very fast, but they
      31             : // should be possible without getting errors due to too deep recursion.
      32             : 
      33             : #include "src/heap/factory.h"
      34             : #include "src/isolate.h"
      35             : #include "src/objects.h"
      36             : #include "src/objects/name-inl.h"
      37             : #include "src/ostreams.h"
      38             : #include "test/cctest/cctest.h"
      39             : 
      40             : namespace v8 {
      41             : namespace internal {
      42             : 
      43       28342 : TEST(Create) {
      44           5 :   CcTest::InitializeVM();
      45             :   Isolate* isolate = CcTest::i_isolate();
      46             :   HandleScope scope(isolate);
      47             : 
      48             :   const int kNumSymbols = 30;
      49         155 :   Handle<Symbol> symbols[kNumSymbols];
      50             : 
      51          10 :   StdoutStream os;
      52         155 :   for (int i = 0; i < kNumSymbols; ++i) {
      53         150 :     symbols[i] = isolate->factory()->NewSymbol();
      54         450 :     CHECK(symbols[i]->IsName());
      55         300 :     CHECK(symbols[i]->IsSymbol());
      56         150 :     CHECK(symbols[i]->HasHashCode());
      57         150 :     CHECK_GT(symbols[i]->Hash(), 0u);
      58         150 :     os << Brief(*symbols[i]) << "\n";
      59             : #if OBJECT_PRINT
      60             :     symbols[i]->Print(os);
      61             : #endif
      62             : #if VERIFY_HEAP
      63             :     symbols[i]->ObjectVerify(isolate);
      64             : #endif
      65             :   }
      66             : 
      67           5 :   CcTest::CollectGarbage(i::NEW_SPACE);
      68           5 :   CcTest::CollectAllGarbage();
      69             : 
      70             :   // All symbols should be distinct.
      71         160 :   for (int i = 0; i < kNumSymbols; ++i) {
      72         450 :     CHECK(symbols[i]->SameValue(*symbols[i]));
      73        2325 :     for (int j = i + 1; j < kNumSymbols; ++j) {
      74        6525 :       CHECK(!symbols[i]->SameValue(*symbols[j]));
      75             :     }
      76             :   }
      77           5 : }
      78             : 
      79             : }  // namespace internal
      80       85011 : }  // namespace v8