OLD | NEW |
1 // Copyright 2013 the V8 project authors. All rights reserved. | 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. |
2 | 27 |
3 // Check that we can traverse very deep stacks of ConsStrings using | 28 // Check that we can traverse very deep stacks of ConsStrings using |
4 // StringCharacterStram. Check that Get(int) works on very deep stacks | 29 // StringCharacterStram. Check that Get(int) works on very deep stacks |
5 // of ConsStrings. These operations may not be very fast, but they | 30 // of ConsStrings. These operations may not be very fast, but they |
6 // should be possible without getting errors due to too deep recursion. | 31 // should be possible without getting errors due to too deep recursion. |
7 | 32 |
8 #include "src/v8.h" | 33 #include "src/v8.h" |
9 | 34 |
10 #include "src/objects.h" | 35 #include "src/objects.h" |
11 #include "src/ostreams.h" | 36 #include "src/ostreams.h" |
(...skipping 30 matching lines...) Expand all Loading... |
42 CcTest::heap()->CollectAllGarbage(Heap::kNoGCFlags); | 67 CcTest::heap()->CollectAllGarbage(Heap::kNoGCFlags); |
43 | 68 |
44 // All symbols should be distinct. | 69 // All symbols should be distinct. |
45 for (int i = 0; i < kNumSymbols; ++i) { | 70 for (int i = 0; i < kNumSymbols; ++i) { |
46 CHECK(symbols[i]->SameValue(*symbols[i])); | 71 CHECK(symbols[i]->SameValue(*symbols[i])); |
47 for (int j = i + 1; j < kNumSymbols; ++j) { | 72 for (int j = i + 1; j < kNumSymbols; ++j) { |
48 CHECK(!symbols[i]->SameValue(*symbols[j])); | 73 CHECK(!symbols[i]->SameValue(*symbols[j])); |
49 } | 74 } |
50 } | 75 } |
51 } | 76 } |
OLD | NEW |