| 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/zone/accounting-allocator.h" |
| 33 #include "test/cctest/cctest.h" | 34 #include "test/cctest/cctest.h" |
| 34 | 35 |
| 35 using namespace v8::internal; | 36 using namespace v8::internal; |
| 36 | 37 |
| 37 TEST(List) { | 38 TEST(List) { |
| 38 List<AstNode*>* list = new List<AstNode*>(0); | 39 List<AstNode*>* list = new List<AstNode*>(0); |
| 39 CHECK_EQ(0, list->length()); | 40 CHECK_EQ(0, list->length()); |
| 40 | 41 |
| 41 v8::base::AccountingAllocator allocator; | 42 v8::internal::AccountingAllocator allocator; |
| 42 Zone zone(&allocator); | 43 Zone zone(&allocator); |
| 43 AstValueFactory value_factory(&zone, 0); | 44 AstValueFactory value_factory(&zone, 0); |
| 44 AstNodeFactory factory(&value_factory); | 45 AstNodeFactory factory(&value_factory); |
| 45 AstNode* node = factory.NewEmptyStatement(kNoSourcePosition); | 46 AstNode* node = factory.NewEmptyStatement(kNoSourcePosition); |
| 46 list->Add(node); | 47 list->Add(node); |
| 47 CHECK_EQ(1, list->length()); | 48 CHECK_EQ(1, list->length()); |
| 48 CHECK_EQ(node, list->at(0)); | 49 CHECK_EQ(node, list->at(0)); |
| 49 CHECK_EQ(node, list->last()); | 50 CHECK_EQ(node, list->last()); |
| 50 | 51 |
| 51 const int kElements = 100; | 52 const int kElements = 100; |
| 52 for (int i = 0; i < kElements; i++) { | 53 for (int i = 0; i < kElements; i++) { |
| 53 list->Add(node); | 54 list->Add(node); |
| 54 } | 55 } |
| 55 CHECK_EQ(1 + kElements, list->length()); | 56 CHECK_EQ(1 + kElements, list->length()); |
| 56 | 57 |
| 57 list->Clear(); | 58 list->Clear(); |
| 58 CHECK_EQ(0, list->length()); | 59 CHECK_EQ(0, list->length()); |
| 59 delete list; | 60 delete list; |
| 60 } | 61 } |
| 61 | 62 |
| 62 TEST(ConcatStrings) { | 63 TEST(ConcatStrings) { |
| 63 v8::base::AccountingAllocator allocator; | 64 v8::internal::AccountingAllocator allocator; |
| 64 Zone zone(&allocator); | 65 Zone zone(&allocator); |
| 65 AstValueFactory value_factory(&zone, 0); | 66 AstValueFactory value_factory(&zone, 0); |
| 66 | 67 |
| 67 const AstRawString* one_byte = value_factory.GetOneByteString("a"); | 68 const AstRawString* one_byte = value_factory.GetOneByteString("a"); |
| 68 | 69 |
| 69 uint16_t two_byte_buffer[] = { | 70 uint16_t two_byte_buffer[] = { |
| 70 0x3b1, | 71 0x3b1, |
| 71 }; | 72 }; |
| 72 const AstRawString* two_byte = value_factory.GetTwoByteString( | 73 const AstRawString* two_byte = value_factory.GetTwoByteString( |
| 73 Vector<const uint16_t>(two_byte_buffer, 1)); | 74 Vector<const uint16_t>(two_byte_buffer, 1)); |
| (...skipping 17 matching lines...) Expand all Loading... |
| 91 CHECK(!result->is_one_byte()); | 92 CHECK(!result->is_one_byte()); |
| 92 CHECK_EQ(expectation, result); | 93 CHECK_EQ(expectation, result); |
| 93 | 94 |
| 94 uint16_t expectation_buffer_two_two[] = {0x3b1, 0x3b1}; | 95 uint16_t expectation_buffer_two_two[] = {0x3b1, 0x3b1}; |
| 95 expectation = value_factory.GetTwoByteString( | 96 expectation = value_factory.GetTwoByteString( |
| 96 Vector<const uint16_t>(expectation_buffer_two_two, 2)); | 97 Vector<const uint16_t>(expectation_buffer_two_two, 2)); |
| 97 result = value_factory.ConcatStrings(two_byte, two_byte); | 98 result = value_factory.ConcatStrings(two_byte, two_byte); |
| 98 CHECK(!result->is_one_byte()); | 99 CHECK(!result->is_one_byte()); |
| 99 CHECK_EQ(expectation, result); | 100 CHECK_EQ(expectation, result); |
| 100 } | 101 } |
| OLD | NEW |