| 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 94 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 105 function->ReplaceCode(function->shared()->code()); | 105 function->ReplaceCode(function->shared()->code()); |
| 106 | 106 |
| 107 if (FLAG_trace_deopt) { | 107 if (FLAG_trace_deopt) { |
| 108 PrintF("[forced deoptimization: "); | 108 PrintF("[forced deoptimization: "); |
| 109 function->PrintName(); | 109 function->PrintName(); |
| 110 PrintF(" / %x]\n", reinterpret_cast<uint32_t>(function)); | 110 PrintF(" / %x]\n", reinterpret_cast<uint32_t>(function)); |
| 111 } | 111 } |
| 112 } | 112 } |
| 113 | 113 |
| 114 | 114 |
| 115 void Deoptimizer::PatchStackCheckCode(Code* unoptimized_code, | 115 void Deoptimizer::PatchStackCheckAt(Address pc_after, |
| 116 Code* check_code, | 116 Code* check_code, |
| 117 Code* replacement_code) { | 117 Code* replacement_code) { |
| 118 UNIMPLEMENTED(); | 118 UNIMPLEMENTED(); |
| 119 } | 119 } |
| 120 | 120 |
| 121 | 121 |
| 122 void Deoptimizer::RevertStackCheckCode(Code* unoptimized_code, | 122 void Deoptimizer::RevertStackCheckCode(Code* unoptimized_code, |
| 123 Code* check_code, | 123 Code* check_code, |
| 124 Code* replacement_code) { | 124 Code* replacement_code) { |
| 125 UNIMPLEMENTED(); | 125 UNIMPLEMENTED(); |
| 126 } | 126 } |
| 127 | 127 |
| (...skipping 370 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 498 __ push(ip); | 498 __ push(ip); |
| 499 __ b(&done); | 499 __ b(&done); |
| 500 ASSERT(masm()->pc_offset() - start == table_entry_size_); | 500 ASSERT(masm()->pc_offset() - start == table_entry_size_); |
| 501 } | 501 } |
| 502 __ bind(&done); | 502 __ bind(&done); |
| 503 } | 503 } |
| 504 | 504 |
| 505 #undef __ | 505 #undef __ |
| 506 | 506 |
| 507 } } // namespace v8::internal | 507 } } // namespace v8::internal |
| OLD | NEW |