| OLD | NEW |
| 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/compiler/bytecode-graph-builder.h" | 5 #include "src/compiler/bytecode-graph-builder.h" |
| 6 | 6 |
| 7 #include "src/compiler/linkage.h" | 7 #include "src/compiler/linkage.h" |
| 8 #include "src/compiler/operator-properties.h" | 8 #include "src/compiler/operator-properties.h" |
| 9 #include "src/interpreter/bytecode-array-iterator.h" | 9 #include "src/interpreter/bytecode-array-iterator.h" |
| 10 | 10 |
| (...skipping 237 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 248 environment()->BindRegister(iterator.GetRegisterOperand(0), value); | 248 environment()->BindRegister(iterator.GetRegisterOperand(0), value); |
| 249 } | 249 } |
| 250 | 250 |
| 251 | 251 |
| 252 void BytecodeGraphBuilder::VisitLdaGlobal( | 252 void BytecodeGraphBuilder::VisitLdaGlobal( |
| 253 const interpreter::BytecodeArrayIterator& iterator) { | 253 const interpreter::BytecodeArrayIterator& iterator) { |
| 254 UNIMPLEMENTED(); | 254 UNIMPLEMENTED(); |
| 255 } | 255 } |
| 256 | 256 |
| 257 | 257 |
| 258 void BytecodeGraphBuilder::VisitLoadIC( | 258 void BytecodeGraphBuilder::VisitLoadICSloppy( |
| 259 const interpreter::BytecodeArrayIterator& iterator) { | 259 const interpreter::BytecodeArrayIterator& iterator) { |
| 260 UNIMPLEMENTED(); | 260 UNIMPLEMENTED(); |
| 261 } | 261 } |
| 262 | 262 |
| 263 | 263 |
| 264 void BytecodeGraphBuilder::VisitKeyedLoadIC( | 264 void BytecodeGraphBuilder::VisitLoadICStrict( |
| 265 const interpreter::BytecodeArrayIterator& iterator) { | 265 const interpreter::BytecodeArrayIterator& iterator) { |
| 266 UNIMPLEMENTED(); | 266 UNIMPLEMENTED(); |
| 267 } | 267 } |
| 268 | 268 |
| 269 | 269 |
| 270 void BytecodeGraphBuilder::VisitStoreIC( | 270 void BytecodeGraphBuilder::VisitKeyedLoadICSloppy( |
| 271 const interpreter::BytecodeArrayIterator& iterator) { | 271 const interpreter::BytecodeArrayIterator& iterator) { |
| 272 UNIMPLEMENTED(); | 272 UNIMPLEMENTED(); |
| 273 } | 273 } |
| 274 | 274 |
| 275 | 275 |
| 276 void BytecodeGraphBuilder::VisitKeyedStoreIC( | 276 void BytecodeGraphBuilder::VisitKeyedLoadICStrict( |
| 277 const interpreter::BytecodeArrayIterator& iterator) { | 277 const interpreter::BytecodeArrayIterator& iterator) { |
| 278 UNIMPLEMENTED(); | 278 UNIMPLEMENTED(); |
| 279 } | 279 } |
| 280 |
| 281 |
| 282 void BytecodeGraphBuilder::VisitStoreICSloppy( |
| 283 const interpreter::BytecodeArrayIterator& iterator) { |
| 284 UNIMPLEMENTED(); |
| 285 } |
| 286 |
| 287 |
| 288 void BytecodeGraphBuilder::VisitStoreICStrict( |
| 289 const interpreter::BytecodeArrayIterator& iterator) { |
| 290 UNIMPLEMENTED(); |
| 291 } |
| 292 |
| 293 |
| 294 void BytecodeGraphBuilder::VisitKeyedStoreICSloppy( |
| 295 const interpreter::BytecodeArrayIterator& iterator) { |
| 296 UNIMPLEMENTED(); |
| 297 } |
| 298 |
| 299 |
| 300 void BytecodeGraphBuilder::VisitKeyedStoreICStrict( |
| 301 const interpreter::BytecodeArrayIterator& iterator) { |
| 302 UNIMPLEMENTED(); |
| 303 } |
| 280 | 304 |
| 281 | 305 |
| 282 void BytecodeGraphBuilder::VisitCall( | 306 void BytecodeGraphBuilder::VisitCall( |
| 283 const interpreter::BytecodeArrayIterator& iterator) { | 307 const interpreter::BytecodeArrayIterator& iterator) { |
| 284 UNIMPLEMENTED(); | 308 UNIMPLEMENTED(); |
| 285 } | 309 } |
| 286 | 310 |
| 287 | 311 |
| 288 void BytecodeGraphBuilder::VisitCallRuntime( | 312 void BytecodeGraphBuilder::VisitCallRuntime( |
| 289 const interpreter::BytecodeArrayIterator& iterator) { | 313 const interpreter::BytecodeArrayIterator& iterator) { |
| (...skipping 266 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 556 | 580 |
| 557 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { | 581 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { |
| 558 if (environment()->IsMarkedAsUnreachable()) return; | 582 if (environment()->IsMarkedAsUnreachable()) return; |
| 559 environment()->MarkAsUnreachable(); | 583 environment()->MarkAsUnreachable(); |
| 560 exit_controls_.push_back(exit); | 584 exit_controls_.push_back(exit); |
| 561 } | 585 } |
| 562 | 586 |
| 563 } // namespace compiler | 587 } // namespace compiler |
| 564 } // namespace internal | 588 } // namespace internal |
| 565 } // namespace v8 | 589 } // namespace v8 |
| OLD | NEW |