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 240 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
251 if (current_instruction_ < instructions_->length() - 1) { | 251 if (current_instruction_ < instructions_->length() - 1) { |
252 return instructions_->at(current_instruction_ + 1); | 252 return instructions_->at(current_instruction_ + 1); |
253 } else { | 253 } else { |
254 return NULL; | 254 return NULL; |
255 } | 255 } |
256 } | 256 } |
257 | 257 |
258 | 258 |
259 bool LCodeGen::GenerateJumpTable() { | 259 bool LCodeGen::GenerateJumpTable() { |
260 for (int i = 0; i < jump_table_.length(); i++) { | 260 for (int i = 0; i < jump_table_.length(); i++) { |
261 JumpTableEntry* info = &jump_table_[i]; | |
262 __ bind(&jump_table_[i].label); | 261 __ bind(&jump_table_[i].label); |
263 __ Jump(info->address, RelocInfo::RUNTIME_ENTRY); | 262 __ Jump(jump_table_[i].address, RelocInfo::RUNTIME_ENTRY); |
264 } | 263 } |
265 return !is_aborted(); | 264 return !is_aborted(); |
266 } | 265 } |
267 | 266 |
268 | 267 |
269 bool LCodeGen::GenerateDeferredCode() { | 268 bool LCodeGen::GenerateDeferredCode() { |
270 ASSERT(is_generating()); | 269 ASSERT(is_generating()); |
271 for (int i = 0; !is_aborted() && i < deferred_.length(); i++) { | 270 for (int i = 0; !is_aborted() && i < deferred_.length(); i++) { |
272 LDeferredCode* code = deferred_[i]; | 271 LDeferredCode* code = deferred_[i]; |
273 __ bind(code->entry()); | 272 __ bind(code->entry()); |
(...skipping 3380 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
3654 RegisterEnvironmentForDeoptimization(environment); | 3653 RegisterEnvironmentForDeoptimization(environment); |
3655 ASSERT(osr_pc_offset_ == -1); | 3654 ASSERT(osr_pc_offset_ == -1); |
3656 osr_pc_offset_ = masm()->pc_offset(); | 3655 osr_pc_offset_ = masm()->pc_offset(); |
3657 } | 3656 } |
3658 | 3657 |
3659 #undef __ | 3658 #undef __ |
3660 | 3659 |
3661 } } // namespace v8::internal | 3660 } } // namespace v8::internal |
3662 | 3661 |
3663 #endif // V8_TARGET_ARCH_X64 | 3662 #endif // V8_TARGET_ARCH_X64 |
OLD | NEW |