OLD | NEW |
1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 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 179 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
190 | 190 |
191 // Continue with next deoptimization entry. | 191 // Continue with next deoptimization entry. |
192 current_entry = next_entry; | 192 current_entry = next_entry; |
193 entry_pc = next_pc; | 193 entry_pc = next_pc; |
194 } | 194 } |
195 | 195 |
196 #ifdef DEBUG | 196 #ifdef DEBUG |
197 // Destroy the code which is not supposed to run again. | 197 // Destroy the code which is not supposed to run again. |
198 ZapCodeRange(previous_pc, jump_table_address); | 198 ZapCodeRange(previous_pc, jump_table_address); |
199 #endif | 199 #endif |
| 200 Isolate* isolate = code->GetIsolate(); |
200 | 201 |
201 // Add the deoptimizing code to the list. | 202 // Add the deoptimizing code to the list. |
202 DeoptimizingCodeListNode* node = new DeoptimizingCodeListNode(code); | 203 DeoptimizingCodeListNode* node = new DeoptimizingCodeListNode(code); |
203 DeoptimizerData* data = code->GetIsolate()->deoptimizer_data(); | 204 DeoptimizerData* data = isolate->deoptimizer_data(); |
204 node->set_next(data->deoptimizing_code_list_); | 205 node->set_next(data->deoptimizing_code_list_); |
205 data->deoptimizing_code_list_ = node; | 206 data->deoptimizing_code_list_ = node; |
206 | 207 |
207 // We might be in the middle of incremental marking with compaction. | 208 // We might be in the middle of incremental marking with compaction. |
208 // Tell collector to treat this code object in a special way and | 209 // Tell collector to treat this code object in a special way and |
209 // ignore all slots that might have been recorded on it. | 210 // ignore all slots that might have been recorded on it. |
210 isolate->heap()->mark_compact_collector()->InvalidateCode(code); | 211 isolate->heap()->mark_compact_collector()->InvalidateCode(code); |
211 | 212 |
212 // Set the code for the function to non-optimized version. | 213 // Set the code for the function to non-optimized version. |
213 function->ReplaceCode(function->shared()->code()); | 214 function->ReplaceCode(function->shared()->code()); |
(...skipping 645 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
859 } | 860 } |
860 __ bind(&done); | 861 __ bind(&done); |
861 } | 862 } |
862 | 863 |
863 #undef __ | 864 #undef __ |
864 | 865 |
865 | 866 |
866 } } // namespace v8::internal | 867 } } // namespace v8::internal |
867 | 868 |
868 #endif // V8_TARGET_ARCH_X64 | 869 #endif // V8_TARGET_ARCH_X64 |
OLD | NEW |