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 14 matching lines...) Expand all Loading... |
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 // TODO(jochen): Remove this after the setting is turned on globally. | 28 // TODO(jochen): Remove this after the setting is turned on globally. |
29 #define V8_IMMINENT_DEPRECATION_WARNINGS | 29 #define V8_IMMINENT_DEPRECATION_WARNINGS |
30 | 30 |
31 #include <stdlib.h> | 31 #include <stdlib.h> |
32 | 32 |
33 #include "src/v8.h" | 33 #include "src/v8.h" |
34 | 34 |
35 #include "src/ast.h" | 35 #include "src/ast/ast.h" |
36 #include "test/cctest/cctest.h" | 36 #include "test/cctest/cctest.h" |
37 | 37 |
38 using namespace v8::internal; | 38 using namespace v8::internal; |
39 | 39 |
40 TEST(List) { | 40 TEST(List) { |
41 List<AstNode*>* list = new List<AstNode*>(0); | 41 List<AstNode*>* list = new List<AstNode*>(0); |
42 CHECK_EQ(0, list->length()); | 42 CHECK_EQ(0, list->length()); |
43 | 43 |
44 Zone zone; | 44 Zone zone; |
45 AstValueFactory value_factory(&zone, 0); | 45 AstValueFactory value_factory(&zone, 0); |
46 AstNodeFactory factory(&value_factory); | 46 AstNodeFactory factory(&value_factory); |
47 AstNode* node = factory.NewEmptyStatement(RelocInfo::kNoPosition); | 47 AstNode* node = factory.NewEmptyStatement(RelocInfo::kNoPosition); |
48 list->Add(node); | 48 list->Add(node); |
49 CHECK_EQ(1, list->length()); | 49 CHECK_EQ(1, list->length()); |
50 CHECK_EQ(node, list->at(0)); | 50 CHECK_EQ(node, list->at(0)); |
51 CHECK_EQ(node, list->last()); | 51 CHECK_EQ(node, list->last()); |
52 | 52 |
53 const int kElements = 100; | 53 const int kElements = 100; |
54 for (int i = 0; i < kElements; i++) { | 54 for (int i = 0; i < kElements; i++) { |
55 list->Add(node); | 55 list->Add(node); |
56 } | 56 } |
57 CHECK_EQ(1 + kElements, list->length()); | 57 CHECK_EQ(1 + kElements, list->length()); |
58 | 58 |
59 list->Clear(); | 59 list->Clear(); |
60 CHECK_EQ(0, list->length()); | 60 CHECK_EQ(0, list->length()); |
61 delete list; | 61 delete list; |
62 } | 62 } |
OLD | NEW |