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 53 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
64 DeoptimizationInputData* deopt_data = | 64 DeoptimizationInputData* deopt_data = |
65 DeoptimizationInputData::cast(code->deoptimization_data()); | 65 DeoptimizationInputData::cast(code->deoptimization_data()); |
66 for (int i = 0; i < deopt_data->DeoptCount(); i++) { | 66 for (int i = 0; i < deopt_data->DeoptCount(); i++) { |
67 if (deopt_data->Pc(i)->value() == -1) continue; | 67 if (deopt_data->Pc(i)->value() == -1) continue; |
68 // Position where Call will be patched in. | 68 // Position where Call will be patched in. |
69 Address call_address = instruction_start + deopt_data->Pc(i)->value(); | 69 Address call_address = instruction_start + deopt_data->Pc(i)->value(); |
70 // There is room enough to write a long call instruction because we pad | 70 // There is room enough to write a long call instruction because we pad |
71 // LLazyBailout instructions with nops if necessary. | 71 // LLazyBailout instructions with nops if necessary. |
72 CodePatcher patcher(call_address, Assembler::kCallSequenceLength); | 72 CodePatcher patcher(call_address, Assembler::kCallSequenceLength); |
73 patcher.masm()->Call(GetDeoptimizationEntry(isolate, i, LAZY), | 73 patcher.masm()->Call(GetDeoptimizationEntry(isolate, i, LAZY), |
74 RelocInfo::NONE64); | 74 Assembler::RelocInfoNone()); |
75 ASSERT(prev_call_address == NULL || | 75 ASSERT(prev_call_address == NULL || |
76 call_address >= prev_call_address + patch_size()); | 76 call_address >= prev_call_address + patch_size()); |
77 ASSERT(call_address + patch_size() <= code->instruction_end()); | 77 ASSERT(call_address + patch_size() <= code->instruction_end()); |
78 #ifdef DEBUG | 78 #ifdef DEBUG |
79 prev_call_address = call_address; | 79 prev_call_address = call_address; |
80 #endif | 80 #endif |
81 } | 81 } |
82 } | 82 } |
83 | 83 |
84 | 84 |
(...skipping 249 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
334 SetFrameSlot(offset, value); | 334 SetFrameSlot(offset, value); |
335 } | 335 } |
336 | 336 |
337 | 337 |
338 #undef __ | 338 #undef __ |
339 | 339 |
340 | 340 |
341 } } // namespace v8::internal | 341 } } // namespace v8::internal |
342 | 342 |
343 #endif // V8_TARGET_ARCH_X64 | 343 #endif // V8_TARGET_ARCH_X64 |
OLD | NEW |