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 104 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
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 | 120 // Set the virtual frame for entry to the deferred code as a |
121 // snapshot of the code generator's current frame (plus additional | 121 // snapshot of the code generator's current frame (plus additional |
122 // results). This is optional, but should be done before branching | 122 // results). This is optional, but should be done before branching |
123 // or jumping to the deferred code. | 123 // or jumping to the deferred code. |
124 inline void SetEntryFrame(Result* arg); | 124 inline void SetEntryFrame(Result* arg); |
| 125 inline void SetEntryFrame(Result* arg0, Result* arg1); |
125 | 126 |
126 JumpTarget* enter() { return &enter_; } | 127 JumpTarget* enter() { return &enter_; } |
127 | 128 |
128 void BindExit() { exit_.Bind(0); } | 129 void BindExit() { exit_.Bind(0); } |
129 void BindExit(Result* result) { exit_.Bind(result, 1); } | 130 void BindExit(Result* result) { exit_.Bind(result, 1); } |
130 void BindExit(Result* result0, Result* result1) { | 131 void BindExit(Result* result0, Result* result1) { |
131 exit_.Bind(result0, result1, 2); | 132 exit_.Bind(result0, result1, 2); |
132 } | 133 } |
133 void BindExit(Result* result0, Result* result1, Result* result2) { | 134 void BindExit(Result* result0, Result* result1, Result* result2) { |
134 exit_.Bind(result0, result1, result2, 3); | 135 exit_.Bind(result0, result1, result2, 3); |
(...skipping 186 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
321 PrintF("ArgumentsAccessStub (type %d)\n", type_); | 322 PrintF("ArgumentsAccessStub (type %d)\n", type_); |
322 } | 323 } |
323 #endif | 324 #endif |
324 }; | 325 }; |
325 | 326 |
326 | 327 |
327 } // namespace internal | 328 } // namespace internal |
328 } // namespace v8 | 329 } // namespace v8 |
329 | 330 |
330 #endif // V8_CODEGEN_H_ | 331 #endif // V8_CODEGEN_H_ |
OLD | NEW |