| 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 630 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 641 // For now, we are relying on the fact that make_code_young doesn't do any | 641 // For now, we are relying on the fact that make_code_young doesn't do any |
| 642 // garbage collection which allows us to save/restore the registers without | 642 // garbage collection which allows us to save/restore the registers without |
| 643 // worrying about which of them contain pointers. We also don't build an | 643 // worrying about which of them contain pointers. We also don't build an |
| 644 // internal frame to make the code faster, since we shouldn't have to do stack | 644 // internal frame to make the code faster, since we shouldn't have to do stack |
| 645 // crawls in MakeCodeYoung. This seems a bit fragile. | 645 // crawls in MakeCodeYoung. This seems a bit fragile. |
| 646 | 646 |
| 647 // Re-execute the code that was patched back to the young age when | 647 // Re-execute the code that was patched back to the young age when |
| 648 // the stub returns. | 648 // the stub returns. |
| 649 __ subq(Operand(rsp, 0), Immediate(5)); | 649 __ subq(Operand(rsp, 0), Immediate(5)); |
| 650 __ Pushad(); | 650 __ Pushad(); |
| 651 #ifdef _WIN64 | 651 __ movq(arg_reg_1, Operand(rsp, kNumSafepointRegisters * kPointerSize)); |
| 652 __ movq(rcx, Operand(rsp, kNumSafepointRegisters * kPointerSize)); | |
| 653 #else | |
| 654 __ movq(rdi, Operand(rsp, kNumSafepointRegisters * kPointerSize)); | |
| 655 #endif | |
| 656 { // NOLINT | 652 { // NOLINT |
| 657 FrameScope scope(masm, StackFrame::MANUAL); | 653 FrameScope scope(masm, StackFrame::MANUAL); |
| 658 __ PrepareCallCFunction(1); | 654 __ PrepareCallCFunction(1); |
| 659 __ CallCFunction( | 655 __ CallCFunction( |
| 660 ExternalReference::get_make_code_young_function(masm->isolate()), 1); | 656 ExternalReference::get_make_code_young_function(masm->isolate()), 1); |
| 661 } | 657 } |
| 662 __ Popad(); | 658 __ Popad(); |
| 663 __ ret(0); | 659 __ ret(0); |
| 664 } | 660 } |
| 665 | 661 |
| (...skipping 1198 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 1864 Deoptimizer::EntryGenerator generator(masm, Deoptimizer::OSR); | 1860 Deoptimizer::EntryGenerator generator(masm, Deoptimizer::OSR); |
| 1865 generator.Generate(); | 1861 generator.Generate(); |
| 1866 } | 1862 } |
| 1867 | 1863 |
| 1868 | 1864 |
| 1869 #undef __ | 1865 #undef __ |
| 1870 | 1866 |
| 1871 } } // namespace v8::internal | 1867 } } // namespace v8::internal |
| 1872 | 1868 |
| 1873 #endif // V8_TARGET_ARCH_X64 | 1869 #endif // V8_TARGET_ARCH_X64 |
| OLD | NEW |