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