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 646 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
657 data->SetTranslationByteArray(*translations); | 657 data->SetTranslationByteArray(*translations); |
658 data->SetInlinedFunctionCount(Smi::FromInt(inlined_function_count_)); | 658 data->SetInlinedFunctionCount(Smi::FromInt(inlined_function_count_)); |
659 | 659 |
660 Handle<FixedArray> literals = | 660 Handle<FixedArray> literals = |
661 factory()->NewFixedArray(deoptimization_literals_.length(), TENURED); | 661 factory()->NewFixedArray(deoptimization_literals_.length(), TENURED); |
662 for (int i = 0; i < deoptimization_literals_.length(); i++) { | 662 for (int i = 0; i < deoptimization_literals_.length(); i++) { |
663 literals->set(i, *deoptimization_literals_[i]); | 663 literals->set(i, *deoptimization_literals_[i]); |
664 } | 664 } |
665 data->SetLiteralArray(*literals); | 665 data->SetLiteralArray(*literals); |
666 | 666 |
667 data->SetOsrAstId(Smi::FromInt(info_->osr_ast_id())); | 667 data->SetOsrAstId(Smi::FromInt(info_->osr_ast_id().ToInt())); |
668 data->SetOsrPcOffset(Smi::FromInt(osr_pc_offset_)); | 668 data->SetOsrPcOffset(Smi::FromInt(osr_pc_offset_)); |
669 | 669 |
670 // Populate the deoptimization entries. | 670 // Populate the deoptimization entries. |
671 for (int i = 0; i < length; i++) { | 671 for (int i = 0; i < length; i++) { |
672 LEnvironment* env = deoptimizations_[i]; | 672 LEnvironment* env = deoptimizations_[i]; |
673 data->SetAstId(i, Smi::FromInt(env->ast_id())); | 673 data->SetAstId(i, env->ast_id()); |
674 data->SetTranslationIndex(i, Smi::FromInt(env->translation_index())); | 674 data->SetTranslationIndex(i, Smi::FromInt(env->translation_index())); |
675 data->SetArgumentsStackHeight(i, | 675 data->SetArgumentsStackHeight(i, |
676 Smi::FromInt(env->arguments_stack_height())); | 676 Smi::FromInt(env->arguments_stack_height())); |
677 data->SetPc(i, Smi::FromInt(env->pc_offset())); | 677 data->SetPc(i, Smi::FromInt(env->pc_offset())); |
678 } | 678 } |
679 code->set_deoptimization_data(*data); | 679 code->set_deoptimization_data(*data); |
680 } | 680 } |
681 | 681 |
682 | 682 |
683 int LCodeGen::DefineDeoptimizationLiteral(Handle<Object> literal) { | 683 int LCodeGen::DefineDeoptimizationLiteral(Handle<Object> literal) { |
(...skipping 4555 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
5239 __ Subu(scratch, result, scratch); | 5239 __ Subu(scratch, result, scratch); |
5240 __ lw(result, FieldMemOperand(scratch, | 5240 __ lw(result, FieldMemOperand(scratch, |
5241 FixedArray::kHeaderSize - kPointerSize)); | 5241 FixedArray::kHeaderSize - kPointerSize)); |
5242 __ bind(&done); | 5242 __ bind(&done); |
5243 } | 5243 } |
5244 | 5244 |
5245 | 5245 |
5246 #undef __ | 5246 #undef __ |
5247 | 5247 |
5248 } } // namespace v8::internal | 5248 } } // namespace v8::internal |
OLD | NEW |