| OLD | NEW |
| 1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 the V8 project authors. All rights reserved. |
| 2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
| 3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
| 4 // met: | 4 // met: |
| 5 // | 5 // |
| 6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
| 7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
| 8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
| 9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
| 10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
| 11 // with the distribution. | 11 // with the distribution. |
| 12 // * Neither the name of Google Inc. nor the names of its | 12 // * Neither the name of Google Inc. nor the names of its |
| 13 // contributors may be used to endorse or promote products derived | 13 // contributors may be used to endorse or promote products derived |
| 14 // from this software without specific prior written permission. | 14 // from this software without specific prior written permission. |
| 15 // | 15 // |
| 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | 16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
| 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | 17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
| 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | 18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR |
| 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | 19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT |
| 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | 20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, |
| 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | 21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT |
| 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | 22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, |
| 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | 23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY |
| 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | 24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
| 25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | 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. | 26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
| 27 | 27 |
| 28 #include <stdlib.h> | 28 #include <stdlib.h> |
| 29 | 29 |
| 30 #include "v8.h" | 30 #include "src/v8.h" |
| 31 | 31 |
| 32 #include "ast.h" | 32 #include "src/ast.h" |
| 33 #include "cctest.h" | 33 #include "test/cctest/cctest.h" |
| 34 | 34 |
| 35 using namespace v8::internal; | 35 using namespace v8::internal; |
| 36 | 36 |
| 37 TEST(List) { | 37 TEST(List) { |
| 38 v8::internal::V8::Initialize(NULL); | 38 v8::internal::V8::Initialize(NULL); |
| 39 List<AstNode*>* list = new List<AstNode*>(0); | 39 List<AstNode*>* list = new List<AstNode*>(0); |
| 40 CHECK_EQ(0, list->length()); | 40 CHECK_EQ(0, list->length()); |
| 41 | 41 |
| 42 Isolate* isolate = CcTest::i_isolate(); | 42 Isolate* isolate = CcTest::i_isolate(); |
| 43 Zone zone(isolate); | 43 Zone zone(isolate); |
| 44 AstNodeFactory<AstNullVisitor> factory(&zone); | 44 AstNodeFactory<AstNullVisitor> factory(&zone); |
| 45 AstNode* node = factory.NewEmptyStatement(RelocInfo::kNoPosition); | 45 AstNode* node = factory.NewEmptyStatement(RelocInfo::kNoPosition); |
| 46 list->Add(node); | 46 list->Add(node); |
| 47 CHECK_EQ(1, list->length()); | 47 CHECK_EQ(1, list->length()); |
| 48 CHECK_EQ(node, list->at(0)); | 48 CHECK_EQ(node, list->at(0)); |
| 49 CHECK_EQ(node, list->last()); | 49 CHECK_EQ(node, list->last()); |
| 50 | 50 |
| 51 const int kElements = 100; | 51 const int kElements = 100; |
| 52 for (int i = 0; i < kElements; i++) { | 52 for (int i = 0; i < kElements; i++) { |
| 53 list->Add(node); | 53 list->Add(node); |
| 54 } | 54 } |
| 55 CHECK_EQ(1 + kElements, list->length()); | 55 CHECK_EQ(1 + kElements, list->length()); |
| 56 | 56 |
| 57 list->Clear(); | 57 list->Clear(); |
| 58 CHECK_EQ(0, list->length()); | 58 CHECK_EQ(0, list->length()); |
| 59 delete list; | 59 delete list; |
| 60 } | 60 } |
| OLD | NEW |