| OLD | NEW |
| 1 // Copyright 2010 the V8 project authors. All rights reserved. | 1 // Copyright 2010 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 116 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 127 JSObject* object, OptimizedFunctionVisitor* visitor); | 127 JSObject* object, OptimizedFunctionVisitor* visitor); |
| 128 | 128 |
| 129 static void VisitAllOptimizedFunctions(OptimizedFunctionVisitor* visitor); | 129 static void VisitAllOptimizedFunctions(OptimizedFunctionVisitor* visitor); |
| 130 | 130 |
| 131 // Patch all stack guard checks in the unoptimized code to | 131 // Patch all stack guard checks in the unoptimized code to |
| 132 // unconditionally call replacement_code. | 132 // unconditionally call replacement_code. |
| 133 static void PatchStackCheckCode(Code* unoptimized_code, | 133 static void PatchStackCheckCode(Code* unoptimized_code, |
| 134 Code* check_code, | 134 Code* check_code, |
| 135 Code* replacement_code); | 135 Code* replacement_code); |
| 136 | 136 |
| 137 // Patch stack guard check at instruction before pc_after in |
| 138 // the unoptimized code to unconditionally call replacement_code. |
| 139 static void PatchStackCheckAt(Address pc_after, |
| 140 Code* check_code, |
| 141 Code* replacement_code); |
| 142 |
| 137 // Change all patched stack guard checks in the unoptimized code | 143 // Change all patched stack guard checks in the unoptimized code |
| 138 // back to a normal stack guard check. | 144 // back to a normal stack guard check. |
| 139 static void RevertStackCheckCode(Code* unoptimized_code, | 145 static void RevertStackCheckCode(Code* unoptimized_code, |
| 140 Code* check_code, | 146 Code* check_code, |
| 141 Code* replacement_code); | 147 Code* replacement_code); |
| 142 | 148 |
| 143 ~Deoptimizer(); | 149 ~Deoptimizer(); |
| 144 | 150 |
| 145 void InsertHeapNumberValues(int index, JavaScriptFrame* frame); | 151 void InsertHeapNumberValues(int index, JavaScriptFrame* frame); |
| 146 | 152 |
| (...skipping 358 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 505 Handle<Code> code_; | 511 Handle<Code> code_; |
| 506 | 512 |
| 507 // Next pointer for linked list. | 513 // Next pointer for linked list. |
| 508 DeoptimizingCodeListNode* next_; | 514 DeoptimizingCodeListNode* next_; |
| 509 }; | 515 }; |
| 510 | 516 |
| 511 | 517 |
| 512 } } // namespace v8::internal | 518 } } // namespace v8::internal |
| 513 | 519 |
| 514 #endif // V8_DEOPTIMIZER_H_ | 520 #endif // V8_DEOPTIMIZER_H_ |
| OLD | NEW |