Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(181)

Side by Side Diff: src/interpreter/bytecode-array-builder.cc

Issue 1321663003: [Interpreter] Add support for loading literals from the constant pool. (Closed) Base URL: https://chromium.googlesource.com/v8/v8.git@int_const_pool_1
Patch Set: Created 5 years, 3 months ago
Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.
Jump to:
View unified diff | Download patch
OLDNEW
1 // Copyright 2015 the V8 project authors. All rights reserved. 1 // Copyright 2015 the V8 project authors. All rights reserved.
2 // Use of this source code is governed by a BSD-style license that can be 2 // Use of this source code is governed by a BSD-style license that can be
3 // found in the LICENSE file. 3 // found in the LICENSE file.
4 4
5 #include "src/interpreter/bytecode-array-builder.h" 5 #include "src/interpreter/bytecode-array-builder.h"
6 6
7 namespace v8 { 7 namespace v8 {
8 namespace internal { 8 namespace internal {
9 namespace interpreter { 9 namespace interpreter {
10 10
11 BytecodeArrayBuilder::BytecodeArrayBuilder(Isolate* isolate) 11 BytecodeArrayBuilder::BytecodeArrayBuilder(Isolate* isolate, Zone* zone)
12 : isolate_(isolate), 12 : isolate_(isolate),
13 bytecode_generated_(false), 13 bytecode_generated_(false),
14 constants_map_(isolate->heap(), zone),
14 parameter_count_(-1), 15 parameter_count_(-1),
15 local_register_count_(-1), 16 local_register_count_(-1),
16 temporary_register_count_(0), 17 temporary_register_count_(0),
17 temporary_register_next_(0) {} 18 temporary_register_next_(0) {}
18 19
19 20
20 void BytecodeArrayBuilder::set_locals_count(int number_of_locals) { 21 void BytecodeArrayBuilder::set_locals_count(int number_of_locals) {
21 local_register_count_ = number_of_locals; 22 local_register_count_ = number_of_locals;
22 temporary_register_next_ = local_register_count_; 23 temporary_register_next_ = local_register_count_;
23 } 24 }
(...skipping 17 matching lines...) Expand all
41 } 42 }
42 43
43 44
44 Handle<BytecodeArray> BytecodeArrayBuilder::ToBytecodeArray() { 45 Handle<BytecodeArray> BytecodeArrayBuilder::ToBytecodeArray() {
45 DCHECK_EQ(bytecode_generated_, false); 46 DCHECK_EQ(bytecode_generated_, false);
46 DCHECK_GE(parameter_count_, 0); 47 DCHECK_GE(parameter_count_, 0);
47 DCHECK_GE(local_register_count_, 0); 48 DCHECK_GE(local_register_count_, 0);
48 int bytecode_size = static_cast<int>(bytecodes_.size()); 49 int bytecode_size = static_cast<int>(bytecodes_.size());
49 int register_count = local_register_count_ + temporary_register_count_; 50 int register_count = local_register_count_ + temporary_register_count_;
50 int frame_size = register_count * kPointerSize; 51 int frame_size = register_count * kPointerSize;
52
51 Factory* factory = isolate_->factory(); 53 Factory* factory = isolate_->factory();
54 Handle<FixedArray> constant_pool;
55 if (constants_.size() == 0) {
Michael Starzinger 2015/08/28 12:21:04 This special-casing is already part of Factory::Ne
rmcilroy 2015/08/28 14:42:05 Perfect! thanks, done.
56 constant_pool = factory->empty_fixed_array();
57 } else {
58 int constants_count = static_cast<int>(constants_.size());
59 constant_pool = factory->NewFixedArray(constants_count, TENURED);
60 for (int i = 0; i < constants_count; i++) {
61 constant_pool->set(i, *constants_[i]);
62 }
63 }
64
52 Handle<BytecodeArray> output = 65 Handle<BytecodeArray> output =
53 factory->NewBytecodeArray(bytecode_size, &bytecodes_.front(), frame_size, 66 factory->NewBytecodeArray(bytecode_size, &bytecodes_.front(), frame_size,
54 parameter_count_, factory->empty_fixed_array()); 67 parameter_count_, constant_pool);
55 bytecode_generated_ = true; 68 bytecode_generated_ = true;
56 return output; 69 return output;
57 } 70 }
58 71
59 72
60 BytecodeArrayBuilder& BytecodeArrayBuilder::BinaryOperation(Token::Value binop, 73 BytecodeArrayBuilder& BytecodeArrayBuilder::BinaryOperation(Token::Value binop,
61 Register reg) { 74 Register reg) {
62 Output(BytecodeForBinaryOperation(binop), reg.ToOperand()); 75 Output(BytecodeForBinaryOperation(binop), reg.ToOperand());
63 return *this; 76 return *this;
64 } 77 }
65 78
66 79
67 BytecodeArrayBuilder& BytecodeArrayBuilder::LoadLiteral( 80 BytecodeArrayBuilder& BytecodeArrayBuilder::LoadLiteral(
68 v8::internal::Smi* smi) { 81 v8::internal::Smi* smi) {
69 int32_t raw_smi = smi->value(); 82 int32_t raw_smi = smi->value();
70 if (raw_smi == 0) { 83 if (raw_smi == 0) {
71 Output(Bytecode::kLdaZero); 84 Output(Bytecode::kLdaZero);
72 } else if (raw_smi >= -128 && raw_smi <= 127) { 85 } else if (raw_smi >= -128 && raw_smi <= 127) {
73 Output(Bytecode::kLdaSmi8, static_cast<uint8_t>(raw_smi)); 86 Output(Bytecode::kLdaSmi8, static_cast<uint8_t>(raw_smi));
74 } else { 87 } else {
75 // TODO(oth): Put Smi in constant pool. 88 LoadLiteral(Handle<Object>(smi, isolate_));
89 }
90 return *this;
91 }
92
93
94 BytecodeArrayBuilder& BytecodeArrayBuilder::LoadLiteral(Handle<Object> object) {
95 size_t entry = GetConstantPoolEntry(object);
96 if (entry <= 255) {
97 Output(Bytecode::kLdaConstant, static_cast<uint8_t>(entry));
98 } else {
76 UNIMPLEMENTED(); 99 UNIMPLEMENTED();
77 } 100 }
78 return *this; 101 return *this;
79 } 102 }
80 103
81 104
82 BytecodeArrayBuilder& BytecodeArrayBuilder::LoadUndefined() { 105 BytecodeArrayBuilder& BytecodeArrayBuilder::LoadUndefined() {
83 Output(Bytecode::kLdaUndefined); 106 Output(Bytecode::kLdaUndefined);
84 return *this; 107 return *this;
85 } 108 }
(...skipping 36 matching lines...) Expand 10 before | Expand all | Expand 10 after
122 return *this; 145 return *this;
123 } 146 }
124 147
125 148
126 BytecodeArrayBuilder& BytecodeArrayBuilder::Return() { 149 BytecodeArrayBuilder& BytecodeArrayBuilder::Return() {
127 Output(Bytecode::kReturn); 150 Output(Bytecode::kReturn);
128 return *this; 151 return *this;
129 } 152 }
130 153
131 154
155 size_t BytecodeArrayBuilder::GetConstantPoolEntry(Handle<Object> object) {
156 // These constants shouldn't be added to the constant pool, the should use
157 // specialzed bytecodes instead.
158 DCHECK(!object.is_identical_to(isolate_->factory()->undefined_value()));
159 DCHECK(!object.is_identical_to(isolate_->factory()->null_value()));
160 DCHECK(!object.is_identical_to(isolate_->factory()->the_hole_value()));
161 DCHECK(!object.is_identical_to(isolate_->factory()->true_value()));
162 DCHECK(!object.is_identical_to(isolate_->factory()->false_value()));
163
164 size_t* entry = constants_map_.Find(object);
165 if (!entry) {
166 entry = constants_map_.Get(object);
167 *entry = constants_.size();
168 constants_.push_back(object);
169 }
170 DCHECK(constants_[*entry].is_identical_to(object));
171 return *entry;
172 }
173
174
132 int BytecodeArrayBuilder::BorrowTemporaryRegister() { 175 int BytecodeArrayBuilder::BorrowTemporaryRegister() {
133 DCHECK_GE(local_register_count_, 0); 176 DCHECK_GE(local_register_count_, 0);
134 int temporary_reg_index = temporary_register_next_++; 177 int temporary_reg_index = temporary_register_next_++;
135 int count = temporary_register_next_ - local_register_count_; 178 int count = temporary_register_next_ - local_register_count_;
136 if (count > temporary_register_count_) { 179 if (count > temporary_register_count_) {
137 temporary_register_count_ = count; 180 temporary_register_count_ = count;
138 } 181 }
139 return temporary_reg_index; 182 return temporary_reg_index;
140 } 183 }
141 184
142 185
143 void BytecodeArrayBuilder::ReturnTemporaryRegister(int reg_index) { 186 void BytecodeArrayBuilder::ReturnTemporaryRegister(int reg_index) {
144 DCHECK_EQ(reg_index, temporary_register_next_ - 1); 187 DCHECK_EQ(reg_index, temporary_register_next_ - 1);
145 temporary_register_next_ = reg_index; 188 temporary_register_next_ = reg_index;
146 } 189 }
147 190
148 191
149 bool BytecodeArrayBuilder::OperandIsValid(Bytecode bytecode, int operand_index, 192 bool BytecodeArrayBuilder::OperandIsValid(Bytecode bytecode, int operand_index,
150 uint8_t operand_value) const { 193 uint8_t operand_value) const {
151 OperandType operand_type = Bytecodes::GetOperandType(bytecode, operand_index); 194 OperandType operand_type = Bytecodes::GetOperandType(bytecode, operand_index);
152 switch (operand_type) { 195 switch (operand_type) {
153 case OperandType::kNone: 196 case OperandType::kNone:
154 return false; 197 return false;
155 case OperandType::kImm8: 198 case OperandType::kImm8:
156 return true; 199 return true;
200 case OperandType::kIdx:
201 return operand_value < constants_.size();
157 case OperandType::kReg: { 202 case OperandType::kReg: {
158 int reg_index = Register::FromOperand(operand_value).index(); 203 int reg_index = Register::FromOperand(operand_value).index();
159 return (reg_index >= 0 && reg_index < temporary_register_next_) || 204 return (reg_index >= 0 && reg_index < temporary_register_next_) ||
160 (reg_index <= kLastParamRegisterIndex && 205 (reg_index <= kLastParamRegisterIndex &&
161 reg_index > kLastParamRegisterIndex - parameter_count_); 206 reg_index > kLastParamRegisterIndex - parameter_count_);
162 } 207 }
163 } 208 }
164 UNREACHABLE(); 209 UNREACHABLE();
165 return false; 210 return false;
166 } 211 }
(...skipping 70 matching lines...) Expand 10 before | Expand all | Expand 10 after
237 282
238 Register TemporaryRegisterScope::NewRegister() { 283 Register TemporaryRegisterScope::NewRegister() {
239 count_++; 284 count_++;
240 last_register_index_ = builder_->BorrowTemporaryRegister(); 285 last_register_index_ = builder_->BorrowTemporaryRegister();
241 return Register(last_register_index_); 286 return Register(last_register_index_);
242 } 287 }
243 288
244 } // namespace interpreter 289 } // namespace interpreter
245 } // namespace internal 290 } // namespace internal
246 } // namespace v8 291 } // namespace v8
OLDNEW

Powered by Google App Engine
This is Rietveld 408576698