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 537 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
548 jump_table_.Add(JumpTableEntry(entry)); | 548 jump_table_.Add(JumpTableEntry(entry)); |
549 } | 549 } |
550 __ j(cc, &jump_table_.last().label); | 550 __ j(cc, &jump_table_.last().label); |
551 } | 551 } |
552 } | 552 } |
553 | 553 |
554 | 554 |
555 void LCodeGen::PopulateDeoptimizationData(Handle<Code> code) { | 555 void LCodeGen::PopulateDeoptimizationData(Handle<Code> code) { |
556 int length = deoptimizations_.length(); | 556 int length = deoptimizations_.length(); |
557 if (length == 0) return; | 557 if (length == 0) return; |
558 ASSERT(FLAG_deopt); | |
559 Handle<DeoptimizationInputData> data = | 558 Handle<DeoptimizationInputData> data = |
560 factory()->NewDeoptimizationInputData(length, TENURED); | 559 factory()->NewDeoptimizationInputData(length, TENURED); |
561 | 560 |
562 Handle<ByteArray> translations = translations_.CreateByteArray(); | 561 Handle<ByteArray> translations = translations_.CreateByteArray(); |
563 data->SetTranslationByteArray(*translations); | 562 data->SetTranslationByteArray(*translations); |
564 data->SetInlinedFunctionCount(Smi::FromInt(inlined_function_count_)); | 563 data->SetInlinedFunctionCount(Smi::FromInt(inlined_function_count_)); |
565 | 564 |
566 Handle<FixedArray> literals = | 565 Handle<FixedArray> literals = |
567 factory()->NewFixedArray(deoptimization_literals_.length(), TENURED); | 566 factory()->NewFixedArray(deoptimization_literals_.length(), TENURED); |
568 for (int i = 0; i < deoptimization_literals_.length(); i++) { | 567 for (int i = 0; i < deoptimization_literals_.length(); i++) { |
(...skipping 3836 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
4405 RegisterEnvironmentForDeoptimization(environment, Safepoint::kNoLazyDeopt); | 4404 RegisterEnvironmentForDeoptimization(environment, Safepoint::kNoLazyDeopt); |
4406 ASSERT(osr_pc_offset_ == -1); | 4405 ASSERT(osr_pc_offset_ == -1); |
4407 osr_pc_offset_ = masm()->pc_offset(); | 4406 osr_pc_offset_ = masm()->pc_offset(); |
4408 } | 4407 } |
4409 | 4408 |
4410 #undef __ | 4409 #undef __ |
4411 | 4410 |
4412 } } // namespace v8::internal | 4411 } } // namespace v8::internal |
4413 | 4412 |
4414 #endif // V8_TARGET_ARCH_X64 | 4413 #endif // V8_TARGET_ARCH_X64 |
OLD | NEW |