| 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 1570 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1581 if (max_entry_id < entry_count) return; | 1581 if (max_entry_id < entry_count) return; |
| 1582 entry_count = Max(entry_count, Deoptimizer::kMinNumberOfEntries); | 1582 entry_count = Max(entry_count, Deoptimizer::kMinNumberOfEntries); |
| 1583 while (max_entry_id >= entry_count) entry_count *= 2; | 1583 while (max_entry_id >= entry_count) entry_count *= 2; |
| 1584 ASSERT(entry_count <= Deoptimizer::kMaxNumberOfEntries); | 1584 ASSERT(entry_count <= Deoptimizer::kMaxNumberOfEntries); |
| 1585 | 1585 |
| 1586 MacroAssembler masm(Isolate::Current(), NULL, 16 * KB); | 1586 MacroAssembler masm(Isolate::Current(), NULL, 16 * KB); |
| 1587 masm.set_emit_debug_code(false); | 1587 masm.set_emit_debug_code(false); |
| 1588 GenerateDeoptimizationEntries(&masm, entry_count, type); | 1588 GenerateDeoptimizationEntries(&masm, entry_count, type); |
| 1589 CodeDesc desc; | 1589 CodeDesc desc; |
| 1590 masm.GetCode(&desc); | 1590 masm.GetCode(&desc); |
| 1591 ASSERT(!RelocInfo::RequiresRelocation(desc)); |
| 1591 | 1592 |
| 1592 MemoryChunk* chunk = type == EAGER | 1593 MemoryChunk* chunk = type == EAGER |
| 1593 ? data->eager_deoptimization_entry_code_ | 1594 ? data->eager_deoptimization_entry_code_ |
| 1594 : data->lazy_deoptimization_entry_code_; | 1595 : data->lazy_deoptimization_entry_code_; |
| 1595 ASSERT(static_cast<int>(Deoptimizer::GetMaxDeoptTableSize()) >= | 1596 ASSERT(static_cast<int>(Deoptimizer::GetMaxDeoptTableSize()) >= |
| 1596 desc.instr_size); | 1597 desc.instr_size); |
| 1597 chunk->CommitArea(desc.instr_size); | 1598 chunk->CommitArea(desc.instr_size); |
| 1598 memcpy(chunk->area_start(), desc.buffer, desc.instr_size); | 1599 memcpy(chunk->area_start(), desc.buffer, desc.instr_size); |
| 1599 CPU::FlushICache(chunk->area_start(), desc.instr_size); | 1600 CPU::FlushICache(chunk->area_start(), desc.instr_size); |
| 1600 | 1601 |
| (...skipping 533 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 2134 | 2135 |
| 2135 void DeoptimizedFrameInfo::Iterate(ObjectVisitor* v) { | 2136 void DeoptimizedFrameInfo::Iterate(ObjectVisitor* v) { |
| 2136 v->VisitPointer(BitCast<Object**>(&function_)); | 2137 v->VisitPointer(BitCast<Object**>(&function_)); |
| 2137 v->VisitPointers(parameters_, parameters_ + parameters_count_); | 2138 v->VisitPointers(parameters_, parameters_ + parameters_count_); |
| 2138 v->VisitPointers(expression_stack_, expression_stack_ + expression_count_); | 2139 v->VisitPointers(expression_stack_, expression_stack_ + expression_count_); |
| 2139 } | 2140 } |
| 2140 | 2141 |
| 2141 #endif // ENABLE_DEBUGGER_SUPPORT | 2142 #endif // ENABLE_DEBUGGER_SUPPORT |
| 2142 | 2143 |
| 2143 } } // namespace v8::internal | 2144 } } // namespace v8::internal |
| OLD | NEW |