| OLD | NEW |
| (Empty) | |
| 1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file |
| 2 // for details. All rights reserved. Use of this source code is governed by a |
| 3 // BSD-style license that can be found in the LICENSE file. |
| 4 |
| 5 #include "platform/assert.h" |
| 6 #include "vm/globals.h" |
| 7 #if defined(TARGET_ARCH_IA32) || defined(TARGET_ARCH_X64) |
| 8 |
| 9 #include "vm/ast.h" |
| 10 #include "vm/assembler.h" |
| 11 #include "vm/code_descriptors.h" |
| 12 #include "vm/code_generator.h" |
| 13 #include "vm/dart_entry.h" |
| 14 #include "vm/unit_test.h" |
| 15 |
| 16 namespace dart { |
| 17 |
| 18 static const intptr_t kPos = Scanner::kDummyTokenIndex; |
| 19 |
| 20 |
| 21 CODEGEN_TEST_GENERATE(StackmapCodegen, test) { |
| 22 Assembler assembler; |
| 23 const String& function_name = String::ZoneHandle(String::NewSymbol("test")); |
| 24 const Function& function = Function::Handle( |
| 25 Function::New(function_name, RawFunction::kFunction, true, false, 0)); |
| 26 function.set_result_type(Type::Handle(Type::DynamicType())); |
| 27 Class& cls = Class::ZoneHandle(); |
| 28 const Script& script = Script::Handle(); |
| 29 cls = Class::New(function_name, script, Scanner::kDummyTokenIndex); |
| 30 const Array& functions = Array::Handle(Array::New(1)); |
| 31 functions.SetAt(0, function); |
| 32 cls.SetFunctions(functions); |
| 33 Library& lib = Library::Handle(Library::CoreLibrary()); |
| 34 lib.AddClass(cls); |
| 35 ParsedFunction parsed_function(function); |
| 36 LiteralNode* l = new LiteralNode(kPos, Smi::ZoneHandle(Smi::New(1))); |
| 37 test->node_sequence()->Add(new ReturnNode(kPos, l)); |
| 38 l = new LiteralNode(kPos, Smi::ZoneHandle(Smi::New(2))); |
| 39 test->node_sequence()->Add(new ReturnNode(kPos, l)); |
| 40 l = new LiteralNode(kPos, Smi::ZoneHandle(Smi::New(3))); |
| 41 test->node_sequence()->Add(new ReturnNode(kPos, l)); |
| 42 parsed_function.set_node_sequence(test->node_sequence()); |
| 43 parsed_function.set_instantiator(NULL); |
| 44 parsed_function.set_default_parameter_values(Array::Handle()); |
| 45 parsed_function.AllocateVariables(); |
| 46 bool retval; |
| 47 Isolate* isolate = Isolate::Current(); |
| 48 EXPECT(isolate != NULL); |
| 49 LongJump* base = isolate->long_jump_base(); |
| 50 LongJump jump; |
| 51 isolate->set_long_jump_base(&jump); |
| 52 if (setjmp(*jump.Set()) == 0) { |
| 53 CodeGenerator code_gen(&assembler, parsed_function); |
| 54 |
| 55 // Build some stack map entries. |
| 56 StackmapBuilder* builder = new StackmapBuilder(); |
| 57 EXPECT(builder != NULL); |
| 58 builder->SetSlotAsObject(0); |
| 59 EXPECT(builder->IsSlotObject(0)); |
| 60 builder->AddEntry(0); // Add a stack map entry at pc offset 0. |
| 61 builder->SetSlotAsValue(1); |
| 62 EXPECT(!builder->IsSlotObject(1)); |
| 63 builder->SetSlotAsObject(2); |
| 64 builder->AddEntry(1); // Add a stack map entry at pc offset 1. |
| 65 EXPECT(builder->IsSlotObject(2)); |
| 66 builder->SetSlotRangeAsObject(3, 5); |
| 67 for (intptr_t i = 3; i <= 5; i++) { |
| 68 EXPECT(builder->IsSlotObject(i)); |
| 69 } |
| 70 builder->AddEntry(2); // Add a stack map entry at pc offset 2. |
| 71 builder->SetSlotRangeAsValue(6, 9); |
| 72 for (intptr_t i = 6; i <= 9; i++) { |
| 73 EXPECT(!builder->IsSlotObject(i)); |
| 74 } |
| 75 builder->SetSlotAsObject(10); |
| 76 builder->AddEntry(3); // Add a stack map entry at pc offset 3. |
| 77 code_gen.GenerateCode(); |
| 78 const char* function_fullname = function.ToFullyQualifiedCString(); |
| 79 const Code& code = |
| 80 Code::Handle(Code::FinalizeCode(function_fullname, &assembler)); |
| 81 const Array& stack_maps = Array::Handle(builder->FinalizeStackmaps(code)); |
| 82 code.set_stackmaps(stack_maps); |
| 83 function.SetCode(code); |
| 84 const Array& stack_map_list = Array::Handle(code.stackmaps()); |
| 85 EXPECT(!stack_map_list.IsNull()); |
| 86 Stackmap& stack_map = Stackmap::Handle(); |
| 87 EXPECT_EQ(4, stack_map_list.Length()); |
| 88 |
| 89 // Validate the first stack map entry. |
| 90 stack_map ^= stack_map_list.At(0); |
| 91 EXPECT(stack_map.IsObject(0)); |
| 92 EXPECT_EQ(0, stack_map.Minimum()); |
| 93 EXPECT_EQ(0, stack_map.Maximum()); |
| 94 |
| 95 // Validate the second stack map entry. |
| 96 stack_map ^= stack_map_list.At(1); |
| 97 EXPECT(stack_map.IsObject(0)); |
| 98 EXPECT(!stack_map.IsObject(1)); |
| 99 EXPECT(stack_map.IsObject(2)); |
| 100 EXPECT_EQ(0, stack_map.Minimum()); |
| 101 EXPECT_EQ(2, stack_map.Maximum()); |
| 102 |
| 103 // Validate the third stack map entry. |
| 104 stack_map ^= stack_map_list.At(2); |
| 105 EXPECT(stack_map.IsObject(0)); |
| 106 EXPECT(!stack_map.IsObject(1)); |
| 107 for (intptr_t i = 2; i <= 5; i++) { |
| 108 EXPECT(stack_map.IsObject(i)); |
| 109 } |
| 110 EXPECT_EQ(0, stack_map.Minimum()); |
| 111 EXPECT_EQ(5, stack_map.Maximum()); |
| 112 |
| 113 // Validate the fourth stack map entry. |
| 114 stack_map ^= stack_map_list.At(3); |
| 115 EXPECT(stack_map.IsObject(0)); |
| 116 EXPECT(!stack_map.IsObject(1)); |
| 117 for (intptr_t i = 2; i <= 5; i++) { |
| 118 EXPECT(stack_map.IsObject(i)); |
| 119 } |
| 120 for (intptr_t i = 6; i <= 9; i++) { |
| 121 EXPECT(!stack_map.IsObject(i)); |
| 122 } |
| 123 EXPECT(stack_map.IsObject(10)); |
| 124 EXPECT_EQ(0, stack_map.Minimum()); |
| 125 EXPECT_EQ(10, stack_map.Maximum()); |
| 126 retval = true; |
| 127 } else { |
| 128 retval = false; |
| 129 } |
| 130 EXPECT(retval); |
| 131 isolate->set_long_jump_base(base); |
| 132 } |
| 133 CODEGEN_TEST_RUN(StackmapCodegen, Smi::New(1)) |
| 134 |
| 135 } // namespace dart |
| 136 |
| 137 #endif // defined TARGET_ARCH_IA32 || defined(TARGET_ARCH_X64) |
| OLD | NEW |