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 655 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
666 deopt_jump_table_.Add(JumpTableEntry(entry)); | 666 deopt_jump_table_.Add(JumpTableEntry(entry)); |
667 } | 667 } |
668 __ b(cc, &deopt_jump_table_.last().label); | 668 __ b(cc, &deopt_jump_table_.last().label); |
669 } | 669 } |
670 } | 670 } |
671 | 671 |
672 | 672 |
673 void LCodeGen::PopulateDeoptimizationData(Handle<Code> code) { | 673 void LCodeGen::PopulateDeoptimizationData(Handle<Code> code) { |
674 int length = deoptimizations_.length(); | 674 int length = deoptimizations_.length(); |
675 if (length == 0) return; | 675 if (length == 0) return; |
676 ASSERT(FLAG_deopt); | |
677 Handle<DeoptimizationInputData> data = | 676 Handle<DeoptimizationInputData> data = |
678 factory()->NewDeoptimizationInputData(length, TENURED); | 677 factory()->NewDeoptimizationInputData(length, TENURED); |
679 | 678 |
680 Handle<ByteArray> translations = translations_.CreateByteArray(); | 679 Handle<ByteArray> translations = translations_.CreateByteArray(); |
681 data->SetTranslationByteArray(*translations); | 680 data->SetTranslationByteArray(*translations); |
682 data->SetInlinedFunctionCount(Smi::FromInt(inlined_function_count_)); | 681 data->SetInlinedFunctionCount(Smi::FromInt(inlined_function_count_)); |
683 | 682 |
684 Handle<FixedArray> literals = | 683 Handle<FixedArray> literals = |
685 factory()->NewFixedArray(deoptimization_literals_.length(), TENURED); | 684 factory()->NewFixedArray(deoptimization_literals_.length(), TENURED); |
686 for (int i = 0; i < deoptimization_literals_.length(); i++) { | 685 for (int i = 0; i < deoptimization_literals_.length(); i++) { |
(...skipping 4111 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
4798 ASSERT(osr_pc_offset_ == -1); | 4797 ASSERT(osr_pc_offset_ == -1); |
4799 osr_pc_offset_ = masm()->pc_offset(); | 4798 osr_pc_offset_ = masm()->pc_offset(); |
4800 } | 4799 } |
4801 | 4800 |
4802 | 4801 |
4803 | 4802 |
4804 | 4803 |
4805 #undef __ | 4804 #undef __ |
4806 | 4805 |
4807 } } // namespace v8::internal | 4806 } } // namespace v8::internal |
OLD | NEW |