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 250 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
261 UNIMPLEMENTED(); | 261 UNIMPLEMENTED(); |
262 } | 262 } |
263 | 263 |
264 | 264 |
265 void BytecodeGraphBuilder::VisitLdaGlobalStrict( | 265 void BytecodeGraphBuilder::VisitLdaGlobalStrict( |
266 const interpreter::BytecodeArrayIterator& iterator) { | 266 const interpreter::BytecodeArrayIterator& iterator) { |
267 UNIMPLEMENTED(); | 267 UNIMPLEMENTED(); |
268 } | 268 } |
269 | 269 |
270 | 270 |
| 271 void BytecodeGraphBuilder::VisitLdaGlobalInsideTypeofSloppy( |
| 272 const interpreter::BytecodeArrayIterator& iterator) { |
| 273 UNIMPLEMENTED(); |
| 274 } |
| 275 |
| 276 |
| 277 void BytecodeGraphBuilder::VisitLdaGlobalInsideTypeofStrict( |
| 278 const interpreter::BytecodeArrayIterator& iterator) { |
| 279 UNIMPLEMENTED(); |
| 280 } |
| 281 |
| 282 |
271 void BytecodeGraphBuilder::VisitLdaGlobalSloppyWide( | 283 void BytecodeGraphBuilder::VisitLdaGlobalSloppyWide( |
272 const interpreter::BytecodeArrayIterator& iterator) { | 284 const interpreter::BytecodeArrayIterator& iterator) { |
273 UNIMPLEMENTED(); | 285 UNIMPLEMENTED(); |
274 } | 286 } |
275 | 287 |
276 | 288 |
277 void BytecodeGraphBuilder::VisitLdaGlobalStrictWide( | 289 void BytecodeGraphBuilder::VisitLdaGlobalStrictWide( |
278 const interpreter::BytecodeArrayIterator& iterator) { | 290 const interpreter::BytecodeArrayIterator& iterator) { |
279 UNIMPLEMENTED(); | 291 UNIMPLEMENTED(); |
280 } | 292 } |
281 | 293 |
282 | 294 |
| 295 void BytecodeGraphBuilder::VisitLdaGlobalInsideTypeofSloppyWide( |
| 296 const interpreter::BytecodeArrayIterator& iterator) { |
| 297 UNIMPLEMENTED(); |
| 298 } |
| 299 |
| 300 |
| 301 void BytecodeGraphBuilder::VisitLdaGlobalInsideTypeofStrictWide( |
| 302 const interpreter::BytecodeArrayIterator& iterator) { |
| 303 UNIMPLEMENTED(); |
| 304 } |
| 305 |
| 306 |
283 void BytecodeGraphBuilder::VisitStaGlobalSloppy( | 307 void BytecodeGraphBuilder::VisitStaGlobalSloppy( |
284 const interpreter::BytecodeArrayIterator& iterator) { | 308 const interpreter::BytecodeArrayIterator& iterator) { |
285 UNIMPLEMENTED(); | 309 UNIMPLEMENTED(); |
286 } | 310 } |
287 | 311 |
288 | 312 |
289 void BytecodeGraphBuilder::VisitStaGlobalStrict( | 313 void BytecodeGraphBuilder::VisitStaGlobalStrict( |
290 const interpreter::BytecodeArrayIterator& iterator) { | 314 const interpreter::BytecodeArrayIterator& iterator) { |
291 UNIMPLEMENTED(); | 315 UNIMPLEMENTED(); |
292 } | 316 } |
(...skipping 599 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
892 | 916 |
893 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { | 917 void BytecodeGraphBuilder::UpdateControlDependencyToLeaveFunction(Node* exit) { |
894 if (environment()->IsMarkedAsUnreachable()) return; | 918 if (environment()->IsMarkedAsUnreachable()) return; |
895 environment()->MarkAsUnreachable(); | 919 environment()->MarkAsUnreachable(); |
896 exit_controls_.push_back(exit); | 920 exit_controls_.push_back(exit); |
897 } | 921 } |
898 | 922 |
899 } // namespace compiler | 923 } // namespace compiler |
900 } // namespace internal | 924 } // namespace internal |
901 } // namespace v8 | 925 } // namespace v8 |
OLD | NEW |