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 57 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
68 // For each LLazyBailout instruction insert a call to the corresponding | 68 // For each LLazyBailout instruction insert a call to the corresponding |
69 // deoptimization entry. | 69 // deoptimization entry. |
70 DeoptimizationInputData* deopt_data = | 70 DeoptimizationInputData* deopt_data = |
71 DeoptimizationInputData::cast(code->deoptimization_data()); | 71 DeoptimizationInputData::cast(code->deoptimization_data()); |
72 #ifdef DEBUG | 72 #ifdef DEBUG |
73 Address prev_call_address = NULL; | 73 Address prev_call_address = NULL; |
74 #endif | 74 #endif |
75 for (int i = 0; i < deopt_data->DeoptCount(); i++) { | 75 for (int i = 0; i < deopt_data->DeoptCount(); i++) { |
76 if (deopt_data->Pc(i)->value() == -1) continue; | 76 if (deopt_data->Pc(i)->value() == -1) continue; |
77 Address call_address = code_start_address + deopt_data->Pc(i)->value(); | 77 Address call_address = code_start_address + deopt_data->Pc(i)->value(); |
78 Address deopt_entry = GetDeoptimizationEntry(i, LAZY); | 78 Address deopt_entry = GetDeoptimizationEntry(isolate, i, LAZY); |
79 // We need calls to have a predictable size in the unoptimized code, but | 79 // We need calls to have a predictable size in the unoptimized code, but |
80 // this is optimized code, so we don't have to have a predictable size. | 80 // this is optimized code, so we don't have to have a predictable size. |
81 int call_size_in_bytes = | 81 int call_size_in_bytes = |
82 MacroAssembler::CallSizeNotPredictableCodeSize(deopt_entry, | 82 MacroAssembler::CallSizeNotPredictableCodeSize(deopt_entry, |
83 RelocInfo::NONE32); | 83 RelocInfo::NONE32); |
84 int call_size_in_words = call_size_in_bytes / Assembler::kInstrSize; | 84 int call_size_in_words = call_size_in_bytes / Assembler::kInstrSize; |
85 ASSERT(call_size_in_bytes % Assembler::kInstrSize == 0); | 85 ASSERT(call_size_in_bytes % Assembler::kInstrSize == 0); |
86 ASSERT(call_size_in_bytes <= patch_size()); | 86 ASSERT(call_size_in_bytes <= patch_size()); |
87 CodePatcher patcher(call_address, call_size_in_words); | 87 CodePatcher patcher(call_address, call_size_in_words); |
88 patcher.masm()->Call(deopt_entry, RelocInfo::NONE32); | 88 patcher.masm()->Call(deopt_entry, RelocInfo::NONE32); |
(...skipping 1222 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1311 __ push(ip); | 1311 __ push(ip); |
1312 __ b(&done); | 1312 __ b(&done); |
1313 ASSERT(masm()->pc_offset() - start == table_entry_size_); | 1313 ASSERT(masm()->pc_offset() - start == table_entry_size_); |
1314 } | 1314 } |
1315 __ bind(&done); | 1315 __ bind(&done); |
1316 } | 1316 } |
1317 | 1317 |
1318 #undef __ | 1318 #undef __ |
1319 | 1319 |
1320 } } // namespace v8::internal | 1320 } } // namespace v8::internal |
OLD | NEW |