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 143 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
154 __ stm(db_w, sp, cp.bit() | fp.bit() | lr.bit()); | 154 __ stm(db_w, sp, cp.bit() | fp.bit() | lr.bit()); |
155 __ Push(Smi::FromInt(StackFrame::STUB)); | 155 __ Push(Smi::FromInt(StackFrame::STUB)); |
156 // Adjust FP to point to saved FP. | 156 // Adjust FP to point to saved FP. |
157 __ add(fp, sp, Operand(2 * kPointerSize)); | 157 __ add(fp, sp, Operand(2 * kPointerSize)); |
158 } else { | 158 } else { |
159 PredictableCodeSizeScope predictible_code_size_scope( | 159 PredictableCodeSizeScope predictible_code_size_scope( |
160 masm_, kNoCodeAgeSequenceLength * Assembler::kInstrSize); | 160 masm_, kNoCodeAgeSequenceLength * Assembler::kInstrSize); |
161 // The following three instructions must remain together and unmodified | 161 // The following three instructions must remain together and unmodified |
162 // for code aging to work properly. | 162 // for code aging to work properly. |
163 __ stm(db_w, sp, r1.bit() | cp.bit() | fp.bit() | lr.bit()); | 163 __ stm(db_w, sp, r1.bit() | cp.bit() | fp.bit() | lr.bit()); |
164 // Load undefined value here, so the value is ready for the loop | 164 __ nop(ip.code()); |
165 // below. | |
166 __ LoadRoot(ip, Heap::kUndefinedValueRootIndex); | |
167 // Adjust FP to point to saved FP. | 165 // Adjust FP to point to saved FP. |
168 __ add(fp, sp, Operand(2 * kPointerSize)); | 166 __ add(fp, sp, Operand(2 * kPointerSize)); |
169 } | 167 } |
170 frame_is_built_ = true; | 168 frame_is_built_ = true; |
171 info_->AddNoFrameRange(0, masm_->pc_offset()); | 169 info_->AddNoFrameRange(0, masm_->pc_offset()); |
172 } | 170 } |
173 | 171 |
174 // Reserve space for the stack slots needed by the code. | 172 // Reserve space for the stack slots needed by the code. |
175 int slots = GetStackSlotCount(); | 173 int slots = GetStackSlotCount(); |
176 if (slots > 0) { | 174 if (slots > 0) { |
(...skipping 5619 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
5796 __ sub(scratch, result, Operand::PointerOffsetFromSmiKey(index)); | 5794 __ sub(scratch, result, Operand::PointerOffsetFromSmiKey(index)); |
5797 __ ldr(result, FieldMemOperand(scratch, | 5795 __ ldr(result, FieldMemOperand(scratch, |
5798 FixedArray::kHeaderSize - kPointerSize)); | 5796 FixedArray::kHeaderSize - kPointerSize)); |
5799 __ bind(&done); | 5797 __ bind(&done); |
5800 } | 5798 } |
5801 | 5799 |
5802 | 5800 |
5803 #undef __ | 5801 #undef __ |
5804 | 5802 |
5805 } } // namespace v8::internal | 5803 } } // namespace v8::internal |
OLD | NEW |