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 63 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
74 | 74 |
75 CodeStub::GenerateFPStubs(); | 75 CodeStub::GenerateFPStubs(); |
76 | 76 |
77 // Open a frame scope to indicate that there is a frame on the stack. The | 77 // Open a frame scope to indicate that there is a frame on the stack. The |
78 // MANUAL indicates that the scope shouldn't actually generate code to set up | 78 // MANUAL indicates that the scope shouldn't actually generate code to set up |
79 // the frame (that is done in GeneratePrologue). | 79 // the frame (that is done in GeneratePrologue). |
80 FrameScope frame_scope(masm_, StackFrame::MANUAL); | 80 FrameScope frame_scope(masm_, StackFrame::MANUAL); |
81 | 81 |
82 dynamic_frame_alignment_ = (chunk()->num_double_slots() > 2 && | 82 dynamic_frame_alignment_ = (chunk()->num_double_slots() > 2 && |
83 !chunk()->graph()->is_recursive()) || | 83 !chunk()->graph()->is_recursive()) || |
84 info()->osr_ast_id() != AstNode::kNoNumber; | 84 !info()->osr_ast_id().IsNone(); |
85 | 85 |
86 return GeneratePrologue() && | 86 return GeneratePrologue() && |
87 GenerateBody() && | 87 GenerateBody() && |
88 GenerateDeferredCode() && | 88 GenerateDeferredCode() && |
89 GenerateSafepointTable(); | 89 GenerateSafepointTable(); |
90 } | 90 } |
91 | 91 |
92 | 92 |
93 void LCodeGen::FinishCode(Handle<Code> code) { | 93 void LCodeGen::FinishCode(Handle<Code> code) { |
94 ASSERT(is_done()); | 94 ASSERT(is_done()); |
(...skipping 576 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
671 data->SetTranslationByteArray(*translations); | 671 data->SetTranslationByteArray(*translations); |
672 data->SetInlinedFunctionCount(Smi::FromInt(inlined_function_count_)); | 672 data->SetInlinedFunctionCount(Smi::FromInt(inlined_function_count_)); |
673 | 673 |
674 Handle<FixedArray> literals = | 674 Handle<FixedArray> literals = |
675 factory()->NewFixedArray(deoptimization_literals_.length(), TENURED); | 675 factory()->NewFixedArray(deoptimization_literals_.length(), TENURED); |
676 for (int i = 0; i < deoptimization_literals_.length(); i++) { | 676 for (int i = 0; i < deoptimization_literals_.length(); i++) { |
677 literals->set(i, *deoptimization_literals_[i]); | 677 literals->set(i, *deoptimization_literals_[i]); |
678 } | 678 } |
679 data->SetLiteralArray(*literals); | 679 data->SetLiteralArray(*literals); |
680 | 680 |
681 data->SetOsrAstId(Smi::FromInt(info_->osr_ast_id())); | 681 data->SetOsrAstId(Smi::FromInt(info_->osr_ast_id().ToInt())); |
682 data->SetOsrPcOffset(Smi::FromInt(osr_pc_offset_)); | 682 data->SetOsrPcOffset(Smi::FromInt(osr_pc_offset_)); |
683 | 683 |
684 // Populate the deoptimization entries. | 684 // Populate the deoptimization entries. |
685 for (int i = 0; i < length; i++) { | 685 for (int i = 0; i < length; i++) { |
686 LEnvironment* env = deoptimizations_[i]; | 686 LEnvironment* env = deoptimizations_[i]; |
687 data->SetAstId(i, Smi::FromInt(env->ast_id())); | 687 data->SetAstId(i, env->ast_id()); |
688 data->SetTranslationIndex(i, Smi::FromInt(env->translation_index())); | 688 data->SetTranslationIndex(i, Smi::FromInt(env->translation_index())); |
689 data->SetArgumentsStackHeight(i, | 689 data->SetArgumentsStackHeight(i, |
690 Smi::FromInt(env->arguments_stack_height())); | 690 Smi::FromInt(env->arguments_stack_height())); |
691 data->SetPc(i, Smi::FromInt(env->pc_offset())); | 691 data->SetPc(i, Smi::FromInt(env->pc_offset())); |
692 } | 692 } |
693 code->set_deoptimization_data(*data); | 693 code->set_deoptimization_data(*data); |
694 } | 694 } |
695 | 695 |
696 | 696 |
697 int LCodeGen::DefineDeoptimizationLiteral(Handle<Object> literal) { | 697 int LCodeGen::DefineDeoptimizationLiteral(Handle<Object> literal) { |
(...skipping 4662 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
5360 FixedArray::kHeaderSize - kPointerSize)); | 5360 FixedArray::kHeaderSize - kPointerSize)); |
5361 __ bind(&done); | 5361 __ bind(&done); |
5362 } | 5362 } |
5363 | 5363 |
5364 | 5364 |
5365 #undef __ | 5365 #undef __ |
5366 | 5366 |
5367 } } // namespace v8::internal | 5367 } } // namespace v8::internal |
5368 | 5368 |
5369 #endif // V8_TARGET_ARCH_IA32 | 5369 #endif // V8_TARGET_ARCH_IA32 |
OLD | NEW |