OLD | NEW |
1 // Copyright 2006-2008 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2008 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 99 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
110 // held by them. It will be impossible to emit a (correct) jump | 110 // held by them. It will be impossible to emit a (correct) jump |
111 // into or out of the deferred code after clearing. | 111 // into or out of the deferred code after clearing. |
112 void Clear() { | 112 void Clear() { |
113 enter_.Unuse(); | 113 enter_.Unuse(); |
114 exit_.Unuse(); | 114 exit_.Unuse(); |
115 } | 115 } |
116 | 116 |
117 MacroAssembler* masm() const { return masm_; } | 117 MacroAssembler* masm() const { return masm_; } |
118 CodeGenerator* generator() const { return generator_; } | 118 CodeGenerator* generator() const { return generator_; } |
119 | 119 |
| 120 // Set the virtual frame for entry to the deferred code as a |
| 121 // snapshot of the code generator's current frame (plus additional |
| 122 // results). This is optional, but should be done before branching |
| 123 // or jumping to the deferred code. |
| 124 inline void SetEntryFrame(Result* arg); |
| 125 |
120 JumpTarget* enter() { return &enter_; } | 126 JumpTarget* enter() { return &enter_; } |
| 127 |
121 void BindExit() { exit_.Bind(0); } | 128 void BindExit() { exit_.Bind(0); } |
122 void BindExit(Result* result) { exit_.Bind(result, 1); } | 129 void BindExit(Result* result) { exit_.Bind(result, 1); } |
123 void BindExit(Result* result0, Result* result1) { | 130 void BindExit(Result* result0, Result* result1) { |
124 exit_.Bind(result0, result1, 2); | 131 exit_.Bind(result0, result1, 2); |
125 } | 132 } |
126 void BindExit(Result* result0, Result* result1, Result* result2) { | 133 void BindExit(Result* result0, Result* result1, Result* result2) { |
127 exit_.Bind(result0, result1, result2, 3); | 134 exit_.Bind(result0, result1, result2, 3); |
128 } | 135 } |
129 | 136 |
130 int statement_position() const { return statement_position_; } | 137 int statement_position() const { return statement_position_; } |
(...skipping 183 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
314 PrintF("ArgumentsAccessStub (type %d)\n", type_); | 321 PrintF("ArgumentsAccessStub (type %d)\n", type_); |
315 } | 322 } |
316 #endif | 323 #endif |
317 }; | 324 }; |
318 | 325 |
319 | 326 |
320 } // namespace internal | 327 } // namespace internal |
321 } // namespace v8 | 328 } // namespace v8 |
322 | 329 |
323 #endif // V8_CODEGEN_H_ | 330 #endif // V8_CODEGEN_H_ |
OLD | NEW |