| OLD | NEW |
| 1 // Copyright 2013 the V8 project authors. All rights reserved. | 1 // Copyright 2013 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 1629 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1640 StubFailureTailCallTrampolineStub().FindCodeInCache(&trampoline, isolate_); | 1640 StubFailureTailCallTrampolineStub().FindCodeInCache(&trampoline, isolate_); |
| 1641 } else { | 1641 } else { |
| 1642 StubFunctionMode function_mode = descriptor->function_mode_; | 1642 StubFunctionMode function_mode = descriptor->function_mode_; |
| 1643 StubFailureTrampolineStub(function_mode).FindCodeInCache(&trampoline, | 1643 StubFailureTrampolineStub(function_mode).FindCodeInCache(&trampoline, |
| 1644 isolate_); | 1644 isolate_); |
| 1645 } | 1645 } |
| 1646 ASSERT(trampoline != NULL); | 1646 ASSERT(trampoline != NULL); |
| 1647 output_frame->SetPc(reinterpret_cast<intptr_t>( | 1647 output_frame->SetPc(reinterpret_cast<intptr_t>( |
| 1648 trampoline->instruction_start())); | 1648 trampoline->instruction_start())); |
| 1649 output_frame->SetState(Smi::FromInt(FullCodeGenerator::NO_REGISTERS)); | 1649 output_frame->SetState(Smi::FromInt(FullCodeGenerator::NO_REGISTERS)); |
| 1650 Code* notify_failure = | 1650 Code* notify_failure = NotifyStubFailureBuiltin(); |
| 1651 isolate_->builtins()->builtin(Builtins::kNotifyStubFailure); | |
| 1652 output_frame->SetContinuation( | 1651 output_frame->SetContinuation( |
| 1653 reinterpret_cast<intptr_t>(notify_failure->entry())); | 1652 reinterpret_cast<intptr_t>(notify_failure->entry())); |
| 1654 } | 1653 } |
| 1655 | 1654 |
| 1656 | 1655 |
| 1657 Handle<Object> Deoptimizer::MaterializeNextHeapObject() { | 1656 Handle<Object> Deoptimizer::MaterializeNextHeapObject() { |
| 1658 int object_index = materialization_object_index_++; | 1657 int object_index = materialization_object_index_++; |
| 1659 ObjectMaterializationDescriptor desc = deferred_objects_[object_index]; | 1658 ObjectMaterializationDescriptor desc = deferred_objects_[object_index]; |
| 1660 const int length = desc.object_length(); | 1659 const int length = desc.object_length(); |
| 1661 | 1660 |
| (...skipping 1390 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 3052 | 3051 |
| 3053 void DeoptimizedFrameInfo::Iterate(ObjectVisitor* v) { | 3052 void DeoptimizedFrameInfo::Iterate(ObjectVisitor* v) { |
| 3054 v->VisitPointer(BitCast<Object**>(&function_)); | 3053 v->VisitPointer(BitCast<Object**>(&function_)); |
| 3055 v->VisitPointers(parameters_, parameters_ + parameters_count_); | 3054 v->VisitPointers(parameters_, parameters_ + parameters_count_); |
| 3056 v->VisitPointers(expression_stack_, expression_stack_ + expression_count_); | 3055 v->VisitPointers(expression_stack_, expression_stack_ + expression_count_); |
| 3057 } | 3056 } |
| 3058 | 3057 |
| 3059 #endif // ENABLE_DEBUGGER_SUPPORT | 3058 #endif // ENABLE_DEBUGGER_SUPPORT |
| 3060 | 3059 |
| 3061 } } // namespace v8::internal | 3060 } } // namespace v8::internal |
| OLD | NEW |