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 2112 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2123 CodeDesc desc; | 2123 CodeDesc desc; |
2124 masm.GetCode(&desc); | 2124 masm.GetCode(&desc); |
2125 ASSERT(!RelocInfo::RequiresRelocation(desc)); | 2125 ASSERT(!RelocInfo::RequiresRelocation(desc)); |
2126 | 2126 |
2127 MemoryChunk* chunk = (type == EAGER) | 2127 MemoryChunk* chunk = (type == EAGER) |
2128 ? data->eager_deoptimization_entry_code_ | 2128 ? data->eager_deoptimization_entry_code_ |
2129 : data->lazy_deoptimization_entry_code_; | 2129 : data->lazy_deoptimization_entry_code_; |
2130 ASSERT(static_cast<int>(Deoptimizer::GetMaxDeoptTableSize()) >= | 2130 ASSERT(static_cast<int>(Deoptimizer::GetMaxDeoptTableSize()) >= |
2131 desc.instr_size); | 2131 desc.instr_size); |
2132 chunk->CommitArea(desc.instr_size); | 2132 chunk->CommitArea(desc.instr_size); |
2133 memcpy(chunk->area_start(), desc.buffer, desc.instr_size); | 2133 CopyBytes(chunk->area_start(), desc.buffer, desc.instr_size); |
2134 CPU::FlushICache(chunk->area_start(), desc.instr_size); | 2134 CPU::FlushICache(chunk->area_start(), desc.instr_size); |
2135 | 2135 |
2136 if (type == EAGER) { | 2136 if (type == EAGER) { |
2137 data->eager_deoptimization_entry_code_entries_ = entry_count; | 2137 data->eager_deoptimization_entry_code_entries_ = entry_count; |
2138 } else { | 2138 } else { |
2139 data->lazy_deoptimization_entry_code_entries_ = entry_count; | 2139 data->lazy_deoptimization_entry_code_entries_ = entry_count; |
2140 } | 2140 } |
2141 } | 2141 } |
2142 | 2142 |
2143 | 2143 |
(...skipping 528 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
2672 | 2672 |
2673 void DeoptimizedFrameInfo::Iterate(ObjectVisitor* v) { | 2673 void DeoptimizedFrameInfo::Iterate(ObjectVisitor* v) { |
2674 v->VisitPointer(BitCast<Object**>(&function_)); | 2674 v->VisitPointer(BitCast<Object**>(&function_)); |
2675 v->VisitPointers(parameters_, parameters_ + parameters_count_); | 2675 v->VisitPointers(parameters_, parameters_ + parameters_count_); |
2676 v->VisitPointers(expression_stack_, expression_stack_ + expression_count_); | 2676 v->VisitPointers(expression_stack_, expression_stack_ + expression_count_); |
2677 } | 2677 } |
2678 | 2678 |
2679 #endif // ENABLE_DEBUGGER_SUPPORT | 2679 #endif // ENABLE_DEBUGGER_SUPPORT |
2680 | 2680 |
2681 } } // namespace v8::internal | 2681 } } // namespace v8::internal |
OLD | NEW |