| OLD | NEW |
| 1 // Copyright 2011 the V8 project authors. All rights reserved. | 1 // Copyright 2011 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 83 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 94 SafepointTable table_; | 94 SafepointTable table_; |
| 95 // Index of next deoptimization entry. If negative after calling | 95 // Index of next deoptimization entry. If negative after calling |
| 96 // FindNextIndex, there are no more, and Next will return an invalid | 96 // FindNextIndex, there are no more, and Next will return an invalid |
| 97 // SafepointEntry. | 97 // SafepointEntry. |
| 98 int index_; | 98 int index_; |
| 99 // Table length. | 99 // Table length. |
| 100 int limit_; | 100 int limit_; |
| 101 }; | 101 }; |
| 102 | 102 |
| 103 | 103 |
| 104 void Deoptimizer::EnsureRelocSpaceForLazyDeoptimization(Handle<Code> code) { |
| 105 // TODO(1276): Implement. |
| 106 } |
| 107 |
| 108 |
| 104 void Deoptimizer::DeoptimizeFunction(JSFunction* function) { | 109 void Deoptimizer::DeoptimizeFunction(JSFunction* function) { |
| 105 HandleScope scope; | 110 HandleScope scope; |
| 106 AssertNoAllocation no_allocation; | 111 AssertNoAllocation no_allocation; |
| 107 | 112 |
| 108 if (!function->IsOptimized()) return; | 113 if (!function->IsOptimized()) return; |
| 109 | 114 |
| 110 // Get the optimized code. | 115 // Get the optimized code. |
| 111 Code* code = function->code(); | 116 Code* code = function->code(); |
| 112 | 117 |
| 113 // Invalidate the relocation information, as it will become invalid by the | 118 // Invalidate the relocation information, as it will become invalid by the |
| (...skipping 665 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 779 } | 784 } |
| 780 __ bind(&done); | 785 __ bind(&done); |
| 781 } | 786 } |
| 782 | 787 |
| 783 #undef __ | 788 #undef __ |
| 784 | 789 |
| 785 | 790 |
| 786 } } // namespace v8::internal | 791 } } // namespace v8::internal |
| 787 | 792 |
| 788 #endif // V8_TARGET_ARCH_X64 | 793 #endif // V8_TARGET_ARCH_X64 |
| OLD | NEW |