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 323 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
334 | 334 |
335 bool LCodeGen::GenerateDeferredCode() { | 335 bool LCodeGen::GenerateDeferredCode() { |
336 ASSERT(is_generating()); | 336 ASSERT(is_generating()); |
337 for (int i = 0; !is_aborted() && i < deferred_.length(); i++) { | 337 for (int i = 0; !is_aborted() && i < deferred_.length(); i++) { |
338 LDeferredCode* code = deferred_[i]; | 338 LDeferredCode* code = deferred_[i]; |
339 __ bind(code->entry()); | 339 __ bind(code->entry()); |
340 code->Generate(); | 340 code->Generate(); |
341 __ jmp(code->exit()); | 341 __ jmp(code->exit()); |
342 } | 342 } |
343 | 343 |
| 344 // Force constant pool emission at the end of deferred code to make |
| 345 // sure that no constant pools are emitted after the official end of |
| 346 // the instruction sequence. |
| 347 masm()->CheckConstPool(true, false); |
| 348 |
344 // Deferred code is the last part of the instruction sequence. Mark | 349 // Deferred code is the last part of the instruction sequence. Mark |
345 // the generated code as done unless we bailed out. | 350 // the generated code as done unless we bailed out. |
346 if (!is_aborted()) status_ = DONE; | 351 if (!is_aborted()) status_ = DONE; |
347 return !is_aborted(); | 352 return !is_aborted(); |
348 } | 353 } |
349 | 354 |
350 | 355 |
351 bool LCodeGen::GenerateSafepointTable() { | 356 bool LCodeGen::GenerateSafepointTable() { |
352 ASSERT(is_done()); | 357 ASSERT(is_done()); |
353 safepoints_.Emit(masm(), StackSlotCount()); | 358 safepoints_.Emit(masm(), StackSlotCount()); |
(...skipping 2845 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
3199 | 3204 |
3200 | 3205 |
3201 void LCodeGen::DoOsrEntry(LOsrEntry* instr) { | 3206 void LCodeGen::DoOsrEntry(LOsrEntry* instr) { |
3202 Abort("DoOsrEntry unimplemented."); | 3207 Abort("DoOsrEntry unimplemented."); |
3203 } | 3208 } |
3204 | 3209 |
3205 | 3210 |
3206 #undef __ | 3211 #undef __ |
3207 | 3212 |
3208 } } // namespace v8::internal | 3213 } } // namespace v8::internal |
OLD | NEW |