| OLD | NEW |
| 1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 622 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 633 // TODO(plind): The Arm port is a little different here, due to their | 633 // TODO(plind): The Arm port is a little different here, due to their |
| 634 // DeOpt jump table, which is not used for Mips yet. | 634 // DeOpt jump table, which is not used for Mips yet. |
| 635 __ Jump(entry, RelocInfo::RUNTIME_ENTRY, cc, src1, src2); | 635 __ Jump(entry, RelocInfo::RUNTIME_ENTRY, cc, src1, src2); |
| 636 } | 636 } |
| 637 } | 637 } |
| 638 | 638 |
| 639 | 639 |
| 640 void LCodeGen::PopulateDeoptimizationData(Handle<Code> code) { | 640 void LCodeGen::PopulateDeoptimizationData(Handle<Code> code) { |
| 641 int length = deoptimizations_.length(); | 641 int length = deoptimizations_.length(); |
| 642 if (length == 0) return; | 642 if (length == 0) return; |
| 643 ASSERT(FLAG_deopt); | |
| 644 Handle<DeoptimizationInputData> data = | 643 Handle<DeoptimizationInputData> data = |
| 645 factory()->NewDeoptimizationInputData(length, TENURED); | 644 factory()->NewDeoptimizationInputData(length, TENURED); |
| 646 | 645 |
| 647 Handle<ByteArray> translations = translations_.CreateByteArray(); | 646 Handle<ByteArray> translations = translations_.CreateByteArray(); |
| 648 data->SetTranslationByteArray(*translations); | 647 data->SetTranslationByteArray(*translations); |
| 649 data->SetInlinedFunctionCount(Smi::FromInt(inlined_function_count_)); | 648 data->SetInlinedFunctionCount(Smi::FromInt(inlined_function_count_)); |
| 650 | 649 |
| 651 Handle<FixedArray> literals = | 650 Handle<FixedArray> literals = |
| 652 factory()->NewFixedArray(deoptimization_literals_.length(), TENURED); | 651 factory()->NewFixedArray(deoptimization_literals_.length(), TENURED); |
| 653 for (int i = 0; i < deoptimization_literals_.length(); i++) { | 652 for (int i = 0; i < deoptimization_literals_.length(); i++) { |
| (...skipping 4083 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 4737 ASSERT(!environment->HasBeenRegistered()); | 4736 ASSERT(!environment->HasBeenRegistered()); |
| 4738 RegisterEnvironmentForDeoptimization(environment, Safepoint::kNoLazyDeopt); | 4737 RegisterEnvironmentForDeoptimization(environment, Safepoint::kNoLazyDeopt); |
| 4739 ASSERT(osr_pc_offset_ == -1); | 4738 ASSERT(osr_pc_offset_ == -1); |
| 4740 osr_pc_offset_ = masm()->pc_offset(); | 4739 osr_pc_offset_ = masm()->pc_offset(); |
| 4741 } | 4740 } |
| 4742 | 4741 |
| 4743 | 4742 |
| 4744 #undef __ | 4743 #undef __ |
| 4745 | 4744 |
| 4746 } } // namespace v8::internal | 4745 } } // namespace v8::internal |
| OLD | NEW |