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 |
(...skipping 12 matching lines...) Expand all Loading... |
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 "src/v8.h" | 30 #include "src/v8.h" |
31 | 31 |
32 #include "src/ast/ast.h" | 32 #include "src/ast/ast.h" |
| 33 #include "src/objects-inl.h" |
33 #include "src/zone/accounting-allocator.h" | 34 #include "src/zone/accounting-allocator.h" |
34 #include "test/cctest/cctest.h" | 35 #include "test/cctest/cctest.h" |
35 | 36 |
36 using namespace v8::internal; | 37 using namespace v8::internal; |
37 | 38 |
38 TEST(List) { | 39 TEST(List) { |
39 List<AstNode*>* list = new List<AstNode*>(0); | 40 List<AstNode*>* list = new List<AstNode*>(0); |
40 CHECK_EQ(0, list->length()); | 41 CHECK_EQ(0, list->length()); |
41 | 42 |
42 v8::internal::AccountingAllocator allocator; | 43 v8::internal::AccountingAllocator allocator; |
43 Zone zone(&allocator, ZONE_NAME); | 44 Zone zone(&allocator, ZONE_NAME); |
44 AstValueFactory value_factory(&zone, 0); | 45 AstValueFactory value_factory(&zone, 0); |
45 AstNodeFactory factory(&value_factory); | 46 AstNodeFactory factory(&value_factory); |
46 AstNode* node = factory.NewEmptyStatement(kNoSourcePosition); | 47 AstNode* node = factory.NewEmptyStatement(kNoSourcePosition); |
47 list->Add(node); | 48 list->Add(node); |
48 CHECK_EQ(1, list->length()); | 49 CHECK_EQ(1, list->length()); |
49 CHECK_EQ(node, list->at(0)); | 50 CHECK_EQ(node, list->at(0)); |
50 CHECK_EQ(node, list->last()); | 51 CHECK_EQ(node, list->last()); |
51 | 52 |
52 const int kElements = 100; | 53 const int kElements = 100; |
53 for (int i = 0; i < kElements; i++) { | 54 for (int i = 0; i < kElements; i++) { |
54 list->Add(node); | 55 list->Add(node); |
55 } | 56 } |
56 CHECK_EQ(1 + kElements, list->length()); | 57 CHECK_EQ(1 + kElements, list->length()); |
57 | 58 |
58 list->Clear(); | 59 list->Clear(); |
59 CHECK_EQ(0, list->length()); | 60 CHECK_EQ(0, list->length()); |
60 delete list; | 61 delete list; |
61 } | 62 } |
OLD | NEW |