| 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 91 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 102 ASSERT(is_done()); | 102 ASSERT(is_done()); |
| 103 code->set_stack_slots(GetStackSlotCount()); | 103 code->set_stack_slots(GetStackSlotCount()); |
| 104 code->set_safepoint_table_offset(safepoints_.GetCodeOffset()); | 104 code->set_safepoint_table_offset(safepoints_.GetCodeOffset()); |
| 105 if (FLAG_weak_embedded_maps_in_optimized_code) { | 105 if (FLAG_weak_embedded_maps_in_optimized_code) { |
| 106 RegisterDependentCodeForEmbeddedMaps(code); | 106 RegisterDependentCodeForEmbeddedMaps(code); |
| 107 } | 107 } |
| 108 PopulateDeoptimizationData(code); | 108 PopulateDeoptimizationData(code); |
| 109 if (!info()->IsStub()) { | 109 if (!info()->IsStub()) { |
| 110 Deoptimizer::EnsureRelocSpaceForLazyDeoptimization(code); | 110 Deoptimizer::EnsureRelocSpaceForLazyDeoptimization(code); |
| 111 } | 111 } |
| 112 info()->CommitDependentMaps(code); | 112 info()->CommitDependencies(code); |
| 113 } | 113 } |
| 114 | 114 |
| 115 | 115 |
| 116 void LCodeGen::Abort(const char* reason) { | 116 void LCodeGen::Abort(const char* reason) { |
| 117 info()->set_bailout_reason(reason); | 117 info()->set_bailout_reason(reason); |
| 118 status_ = ABORTED; | 118 status_ = ABORTED; |
| 119 } | 119 } |
| 120 | 120 |
| 121 | 121 |
| 122 void LCodeGen::Comment(const char* format, ...) { | 122 void LCodeGen::Comment(const char* format, ...) { |
| (...skipping 6437 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 6560 FixedArray::kHeaderSize - kPointerSize)); | 6560 FixedArray::kHeaderSize - kPointerSize)); |
| 6561 __ bind(&done); | 6561 __ bind(&done); |
| 6562 } | 6562 } |
| 6563 | 6563 |
| 6564 | 6564 |
| 6565 #undef __ | 6565 #undef __ |
| 6566 | 6566 |
| 6567 } } // namespace v8::internal | 6567 } } // namespace v8::internal |
| 6568 | 6568 |
| 6569 #endif // V8_TARGET_ARCH_IA32 | 6569 #endif // V8_TARGET_ARCH_IA32 |
| OLD | NEW |