| 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 877 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 888 | 888 |
| 889 // The deoptimization jump table is the last part of the instruction | 889 // The deoptimization jump table is the last part of the instruction |
| 890 // sequence. Mark the generated code as done unless we bailed out. | 890 // sequence. Mark the generated code as done unless we bailed out. |
| 891 if (!is_aborted()) status_ = DONE; | 891 if (!is_aborted()) status_ = DONE; |
| 892 return !is_aborted(); | 892 return !is_aborted(); |
| 893 } | 893 } |
| 894 | 894 |
| 895 | 895 |
| 896 bool LCodeGen::GenerateSafepointTable() { | 896 bool LCodeGen::GenerateSafepointTable() { |
| 897 ASSERT(is_done()); | 897 ASSERT(is_done()); |
| 898 // We do not know how much data will be emitted for the safepoint table, so |
| 899 // force emission of the veneer pool. |
| 900 masm()->CheckVeneerPool(true, true); |
| 898 safepoints_.Emit(masm(), GetStackSlotCount()); | 901 safepoints_.Emit(masm(), GetStackSlotCount()); |
| 899 return !is_aborted(); | 902 return !is_aborted(); |
| 900 } | 903 } |
| 901 | 904 |
| 902 | 905 |
| 903 void LCodeGen::FinishCode(Handle<Code> code) { | 906 void LCodeGen::FinishCode(Handle<Code> code) { |
| 904 ASSERT(is_done()); | 907 ASSERT(is_done()); |
| 905 code->set_stack_slots(GetStackSlotCount()); | 908 code->set_stack_slots(GetStackSlotCount()); |
| 906 code->set_safepoint_table_offset(safepoints_.GetCodeOffset()); | 909 code->set_safepoint_table_offset(safepoints_.GetCodeOffset()); |
| 907 if (code->is_optimized_code()) RegisterWeakObjectsInOptimizedCode(code); | 910 if (code->is_optimized_code()) RegisterWeakObjectsInOptimizedCode(code); |
| (...skipping 4931 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 5839 __ Bind(&out_of_object); | 5842 __ Bind(&out_of_object); |
| 5840 __ Ldr(result, FieldMemOperand(object, JSObject::kPropertiesOffset)); | 5843 __ Ldr(result, FieldMemOperand(object, JSObject::kPropertiesOffset)); |
| 5841 // Index is equal to negated out of object property index plus 1. | 5844 // Index is equal to negated out of object property index plus 1. |
| 5842 __ Sub(result, result, Operand::UntagSmiAndScale(index, kPointerSizeLog2)); | 5845 __ Sub(result, result, Operand::UntagSmiAndScale(index, kPointerSizeLog2)); |
| 5843 __ Ldr(result, FieldMemOperand(result, | 5846 __ Ldr(result, FieldMemOperand(result, |
| 5844 FixedArray::kHeaderSize - kPointerSize)); | 5847 FixedArray::kHeaderSize - kPointerSize)); |
| 5845 __ Bind(&done); | 5848 __ Bind(&done); |
| 5846 } | 5849 } |
| 5847 | 5850 |
| 5848 } } // namespace v8::internal | 5851 } } // namespace v8::internal |
| OLD | NEW |