blob: be10d93a97d0a12bf06828a7bbf18f5bd3c84453 [file] [log] [blame]
Brian Carlstrom7940e442013-07-12 13:46:57 -07001/*
2 * Copyright (C) 2012 The Android Open Source Project
3 *
4 * Licensed under the Apache License, Version 2.0 (the "License");
5 * you may not use this file except in compliance with the License.
6 * You may obtain a copy of the License at
7 *
8 * http://www.apache.org/licenses/LICENSE-2.0
9 *
10 * Unless required by applicable law or agreed to in writing, software
11 * distributed under the License is distributed on an "AS IS" BASIS,
12 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
13 * See the License for the specific language governing permissions and
14 * limitations under the License.
15 */
16
17/* This file contains codegen for the X86 ISA */
18
19#include "codegen_x86.h"
20#include "dex/quick/mir_to_lir-inl.h"
Ian Rogers576ca0c2014-06-06 15:58:22 -070021#include "gc/accounting/card_table.h"
Vladimir Markof4da6752014-08-01 19:04:18 +010022#include "mirror/art_method.h"
23#include "mirror/object_array-inl.h"
Brian Carlstrom7940e442013-07-12 13:46:57 -070024#include "x86_lir.h"
25
26namespace art {
27
Brian Carlstrom7940e442013-07-12 13:46:57 -070028/*
29 * The sparse table in the literal pool is an array of <key,displacement>
30 * pairs.
31 */
Andreas Gampe48971b32014-08-06 10:09:01 -070032void X86Mir2Lir::GenLargeSparseSwitch(MIR* mir, DexOffset table_offset, RegLocation rl_src) {
Chao-ying Fuda96aed2014-10-27 14:42:00 -070033 GenSmallSparseSwitch(mir, table_offset, rl_src);
34}
35
36/*
37 * We override InsertCaseLabel, because the first parameter represents
38 * a basic block id, instead of a dex offset.
39 */
40LIR* X86Mir2Lir::InsertCaseLabel(DexOffset bbid, int keyVal) {
41 LIR* boundary_lir = &block_label_list_[bbid];
42 LIR* res = boundary_lir;
Brian Carlstrom7940e442013-07-12 13:46:57 -070043 if (cu_->verbose) {
Chao-ying Fuda96aed2014-10-27 14:42:00 -070044 // Only pay the expense if we're pretty-printing.
45 LIR* new_label = static_cast<LIR*>(arena_->Alloc(sizeof(LIR), kArenaAllocLIR));
46 BasicBlock* bb = mir_graph_->GetBasicBlock(bbid);
47 DCHECK(bb != nullptr);
48 new_label->dalvik_offset = bb->start_offset;;
49 new_label->opcode = kPseudoCaseLabel;
50 new_label->operands[0] = keyVal;
51 new_label->flags.fixup = kFixupLabel;
52 DCHECK(!new_label->flags.use_def_invalid);
53 new_label->u.m.def_mask = &kEncodeAll;
54 InsertLIRAfter(boundary_lir, new_label);
55 res = new_label;
Brian Carlstrom7940e442013-07-12 13:46:57 -070056 }
Chao-ying Fuda96aed2014-10-27 14:42:00 -070057 return res;
58}
59
60void X86Mir2Lir::MarkPackedCaseLabels(Mir2Lir::SwitchTable* tab_rec) {
61 const uint16_t* table = tab_rec->table;
62 const int32_t *targets = reinterpret_cast<const int32_t*>(&table[4]);
Brian Carlstrom7940e442013-07-12 13:46:57 -070063 int entries = table[1];
Chao-ying Fuda96aed2014-10-27 14:42:00 -070064 int low_key = s4FromSwitchData(&table[2]);
Brian Carlstrom7940e442013-07-12 13:46:57 -070065 for (int i = 0; i < entries; i++) {
Chao-ying Fuda96aed2014-10-27 14:42:00 -070066 // The value at targets[i] is a basic block id, instead of a dex offset.
67 tab_rec->targets[i] = InsertCaseLabel(targets[i], i + low_key);
Brian Carlstrom7940e442013-07-12 13:46:57 -070068 }
69}
70
71/*
Chao-ying Fuda96aed2014-10-27 14:42:00 -070072 * We convert and create a new packed switch table that stores
73 * basic block ids to targets[] by examining successor blocks.
74 * Note that the original packed switch table stores dex offsets to targets[].
75 */
76const uint16_t* X86Mir2Lir::ConvertPackedSwitchTable(MIR* mir, const uint16_t* table) {
77 /*
78 * The original packed switch data format:
79 * ushort ident = 0x0100 magic value
80 * ushort size number of entries in the table
81 * int first_key first (and lowest) switch case value
82 * int targets[size] branch targets, relative to switch opcode
83 *
84 * Total size is (4+size*2) 16-bit code units.
85 *
86 * Note that the new packed switch data format is the same as the original
87 * format, except that targets[] are basic block ids.
88 *
89 */
90 BasicBlock* bb = mir_graph_->GetBasicBlock(mir->bb);
91 DCHECK(bb != nullptr);
92 // Get the number of entries.
93 int entries = table[1];
94 const int32_t* as_int32 = reinterpret_cast<const int32_t*>(&table[2]);
95 int32_t starting_key = as_int32[0];
96 // Create a new table.
97 int size = sizeof(uint16_t) * (4 + entries * 2);
98 uint16_t* new_table = reinterpret_cast<uint16_t*>(arena_->Alloc(size, kArenaAllocMisc));
99 // Copy ident, size, and first_key to the new table.
100 memcpy(new_table, table, sizeof(uint16_t) * 4);
101 // Get the new targets.
102 int32_t* new_targets = reinterpret_cast<int32_t*>(&new_table[4]);
103 // Find out targets for each entry.
104 int i = 0;
105 for (SuccessorBlockInfo* successor_block_info : bb->successor_blocks) {
106 DCHECK_EQ(starting_key + i, successor_block_info->key);
107 // Save target basic block id.
108 new_targets[i++] = successor_block_info->block;
109 }
110 DCHECK_EQ(i, entries);
111 return new_table;
112}
113
114/*
Brian Carlstrom7940e442013-07-12 13:46:57 -0700115 * Code pattern will look something like:
116 *
117 * mov r_val, ..
118 * call 0
119 * pop r_start_of_method
120 * sub r_start_of_method, ..
121 * mov r_key_reg, r_val
122 * sub r_key_reg, low_key
123 * cmp r_key_reg, size-1 ; bound check
124 * ja done
125 * mov r_disp, [r_start_of_method + r_key_reg * 4 + table_offset]
126 * add r_start_of_method, r_disp
127 * jmp r_start_of_method
128 * done:
129 */
Andreas Gampe48971b32014-08-06 10:09:01 -0700130void X86Mir2Lir::GenLargePackedSwitch(MIR* mir, DexOffset table_offset, RegLocation rl_src) {
Chao-ying Fuda96aed2014-10-27 14:42:00 -0700131 const uint16_t* old_table = mir_graph_->GetTable(mir, table_offset);
132 const uint16_t* table = ConvertPackedSwitchTable(mir, old_table);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700133 // Add the table to the list - we'll process it later
buzbee0d829482013-10-11 15:24:55 -0700134 SwitchTable* tab_rec =
Vladimir Marko83cc7ae2014-02-12 18:02:05 +0000135 static_cast<SwitchTable*>(arena_->Alloc(sizeof(SwitchTable), kArenaAllocData));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700136 tab_rec->table = table;
137 tab_rec->vaddr = current_dalvik_offset_;
138 int size = table[1];
Mathieu Chartierf6c4b3b2013-08-24 16:11:37 -0700139 tab_rec->targets = static_cast<LIR**>(arena_->Alloc(size * sizeof(LIR*),
Vladimir Marko83cc7ae2014-02-12 18:02:05 +0000140 kArenaAllocLIR));
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100141 switch_tables_.push_back(tab_rec);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700142
143 // Get the switch value
144 rl_src = LoadValue(rl_src, kCoreReg);
Brian Carlstrom7934ac22013-07-26 10:54:15 -0700145 // NewLIR0(kX86Bkpt);
Mark Mendell67c39c42014-01-31 17:28:00 -0800146
147 // Materialize a pointer to the switch table
buzbee2700f7e2014-03-07 09:46:20 -0800148 RegStorage start_of_method_reg;
Mark Mendell67c39c42014-01-31 17:28:00 -0800149 if (base_of_code_ != nullptr) {
150 // We can use the saved value.
151 RegLocation rl_method = mir_graph_->GetRegLocation(base_of_code_->s_reg_low);
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700152 if (rl_method.wide) {
153 rl_method = LoadValueWide(rl_method, kCoreReg);
154 } else {
155 rl_method = LoadValue(rl_method, kCoreReg);
156 }
buzbee2700f7e2014-03-07 09:46:20 -0800157 start_of_method_reg = rl_method.reg;
Mark Mendell55d0eac2014-02-06 11:02:52 -0800158 store_method_addr_used_ = true;
Mark Mendell67c39c42014-01-31 17:28:00 -0800159 } else {
Serguei Katkov407a9d22014-07-05 03:09:32 +0700160 start_of_method_reg = AllocTempRef();
buzbee2700f7e2014-03-07 09:46:20 -0800161 NewLIR1(kX86StartOfMethod, start_of_method_reg.GetReg());
Mark Mendell67c39c42014-01-31 17:28:00 -0800162 }
Serguei Katkov407a9d22014-07-05 03:09:32 +0700163 DCHECK_EQ(start_of_method_reg.Is64Bit(), cu_->target64);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700164 int low_key = s4FromSwitchData(&table[2]);
buzbee2700f7e2014-03-07 09:46:20 -0800165 RegStorage keyReg;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700166 // Remove the bias, if necessary
167 if (low_key == 0) {
buzbee2700f7e2014-03-07 09:46:20 -0800168 keyReg = rl_src.reg;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700169 } else {
170 keyReg = AllocTemp();
buzbee2700f7e2014-03-07 09:46:20 -0800171 OpRegRegImm(kOpSub, keyReg, rl_src.reg, low_key);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700172 }
173 // Bounds check - if < 0 or >= size continue following switch
Serguei Katkov407a9d22014-07-05 03:09:32 +0700174 OpRegImm(kOpCmp, keyReg, size - 1);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700175 LIR* branch_over = OpCondBranch(kCondHi, NULL);
176
177 // Load the displacement from the switch table
buzbee2700f7e2014-03-07 09:46:20 -0800178 RegStorage disp_reg = AllocTemp();
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700179 NewLIR5(kX86PcRelLoadRA, disp_reg.GetReg(), start_of_method_reg.GetReg(), keyReg.GetReg(),
180 2, WrapPointer(tab_rec));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700181 // Add displacement to start of method
Serguei Katkov407a9d22014-07-05 03:09:32 +0700182 OpRegReg(kOpAdd, start_of_method_reg, cu_->target64 ? As64BitReg(disp_reg) : disp_reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700183 // ..and go!
buzbee2700f7e2014-03-07 09:46:20 -0800184 LIR* switch_branch = NewLIR1(kX86JmpR, start_of_method_reg.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700185 tab_rec->anchor = switch_branch;
186
187 /* branch_over target here */
188 LIR* target = NewLIR0(kPseudoTargetLabel);
189 branch_over->target = target;
190}
191
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700192void X86Mir2Lir::GenMoveException(RegLocation rl_dest) {
buzbee33ae5582014-06-12 14:56:32 -0700193 int ex_offset = cu_->target64 ?
Andreas Gampe2f244e92014-05-08 03:35:25 -0700194 Thread::ExceptionOffset<8>().Int32Value() :
195 Thread::ExceptionOffset<4>().Int32Value();
buzbeea0cd2d72014-06-01 09:33:49 -0700196 RegLocation rl_result = EvalLoc(rl_dest, kRefReg, true);
Serguei Katkov407a9d22014-07-05 03:09:32 +0700197 NewLIR2(cu_->target64 ? kX86Mov64RT : kX86Mov32RT, rl_result.reg.GetReg(), ex_offset);
198 NewLIR2(cu_->target64 ? kX86Mov64TI : kX86Mov32TI, ex_offset, 0);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700199 StoreValue(rl_dest, rl_result);
200}
201
Vladimir Markobf535be2014-11-19 18:52:35 +0000202void X86Mir2Lir::UnconditionallyMarkGCCard(RegStorage tgt_addr_reg) {
Serguei Katkov407a9d22014-07-05 03:09:32 +0700203 DCHECK_EQ(tgt_addr_reg.Is64Bit(), cu_->target64);
Serguei Katkov407a9d22014-07-05 03:09:32 +0700204 RegStorage reg_card_base = AllocTempRef();
205 RegStorage reg_card_no = AllocTempRef();
buzbee33ae5582014-06-12 14:56:32 -0700206 int ct_offset = cu_->target64 ?
Andreas Gampe2f244e92014-05-08 03:35:25 -0700207 Thread::CardTableOffset<8>().Int32Value() :
208 Thread::CardTableOffset<4>().Int32Value();
Serguei Katkov407a9d22014-07-05 03:09:32 +0700209 NewLIR2(cu_->target64 ? kX86Mov64RT : kX86Mov32RT, reg_card_base.GetReg(), ct_offset);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700210 OpRegRegImm(kOpLsr, reg_card_no, tgt_addr_reg, gc::accounting::CardTable::kCardShift);
buzbee2700f7e2014-03-07 09:46:20 -0800211 StoreBaseIndexed(reg_card_base, reg_card_no, reg_card_base, 0, kUnsignedByte);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700212 FreeTemp(reg_card_base);
213 FreeTemp(reg_card_no);
214}
215
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700216void X86Mir2Lir::GenEntrySequence(RegLocation* ArgLocs, RegLocation rl_method) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700217 /*
218 * On entry, rX86_ARG0, rX86_ARG1, rX86_ARG2 are live. Let the register
219 * allocation mechanism know so it doesn't try to use any of them when
220 * expanding the frame or flushing. This leaves the utility
221 * code with no spare temps.
222 */
Ian Rogersb28c1c02014-11-08 11:21:21 -0800223 const RegStorage arg0 = TargetReg32(kArg0);
224 const RegStorage arg1 = TargetReg32(kArg1);
225 const RegStorage arg2 = TargetReg32(kArg2);
226 LockTemp(arg0);
227 LockTemp(arg1);
228 LockTemp(arg2);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700229
Brian Carlstrom7940e442013-07-12 13:46:57 -0700230 /*
231 * We can safely skip the stack overflow check if we're
232 * a leaf *and* our frame size < fudge factor.
233 */
Ian Rogersb28c1c02014-11-08 11:21:21 -0800234 const InstructionSet isa = cu_->target64 ? kX86_64 : kX86;
Dave Allison648d7112014-07-25 16:15:27 -0700235 bool skip_overflow_check = mir_graph_->MethodIsLeaf() && !FrameNeedsStackCheck(frame_size_, isa);
Ian Rogersb28c1c02014-11-08 11:21:21 -0800236 const RegStorage rs_rSP = cu_->target64 ? rs_rX86_SP_64 : rs_rX86_SP_32;
Dave Allison69dfe512014-07-11 17:11:58 +0000237
238 // If we doing an implicit stack overflow check, perform the load immediately
239 // before the stack pointer is decremented and anything is saved.
240 if (!skip_overflow_check &&
241 cu_->compiler_driver->GetCompilerOptions().GetImplicitStackOverflowChecks()) {
242 // Implicit stack overflow check.
243 // test eax,[esp + -overflow]
244 int overflow = GetStackOverflowReservedBytes(isa);
Ian Rogersb28c1c02014-11-08 11:21:21 -0800245 NewLIR3(kX86Test32RM, rs_rAX.GetReg(), rs_rSP.GetReg(), -overflow);
Dave Allison69dfe512014-07-11 17:11:58 +0000246 MarkPossibleStackOverflowException();
247 }
248
249 /* Build frame, return address already on stack */
Ian Rogersb28c1c02014-11-08 11:21:21 -0800250 stack_decrement_ = OpRegImm(kOpSub, rs_rSP, frame_size_ -
Dave Allison69dfe512014-07-11 17:11:58 +0000251 GetInstructionSetPointerSize(cu_->instruction_set));
252
Brian Carlstrom7940e442013-07-12 13:46:57 -0700253 NewLIR0(kPseudoMethodEntry);
254 /* Spill core callee saves */
255 SpillCoreRegs();
Serguei Katkovc3801912014-07-08 17:21:53 +0700256 SpillFPRegs();
Brian Carlstrom7940e442013-07-12 13:46:57 -0700257 if (!skip_overflow_check) {
Mathieu Chartier0d507d12014-03-19 10:17:28 -0700258 class StackOverflowSlowPath : public LIRSlowPath {
259 public:
260 StackOverflowSlowPath(Mir2Lir* m2l, LIR* branch, size_t sp_displace)
261 : LIRSlowPath(m2l, m2l->GetCurrentDexPc(), branch, nullptr), sp_displace_(sp_displace) {
262 }
263 void Compile() OVERRIDE {
264 m2l_->ResetRegPool();
265 m2l_->ResetDefTracking();
Mingyao Yang6ffcfa02014-04-25 11:06:00 -0700266 GenerateTargetLabel(kPseudoThrowTarget);
Ian Rogersb28c1c02014-11-08 11:21:21 -0800267 const RegStorage local_rs_rSP = cu_->target64 ? rs_rX86_SP_64 : rs_rX86_SP_32;
268 m2l_->OpRegImm(kOpAdd, local_rs_rSP, sp_displace_);
Mathieu Chartier0d507d12014-03-19 10:17:28 -0700269 m2l_->ClobberCallerSave();
Mathieu Chartier0d507d12014-03-19 10:17:28 -0700270 // Assumes codegen and target are in thumb2 mode.
Andreas Gampe98430592014-07-27 19:44:50 -0700271 m2l_->CallHelper(RegStorage::InvalidReg(), kQuickThrowStackOverflow,
272 false /* MarkSafepointPC */, false /* UseLink */);
Mathieu Chartier0d507d12014-03-19 10:17:28 -0700273 }
274
275 private:
276 const size_t sp_displace_;
277 };
Dave Allison69dfe512014-07-11 17:11:58 +0000278 if (!cu_->compiler_driver->GetCompilerOptions().GetImplicitStackOverflowChecks()) {
279 // TODO: for large frames we should do something like:
280 // spill ebp
281 // lea ebp, [esp + frame_size]
282 // cmp ebp, fs:[stack_end_]
283 // jcc stack_overflow_exception
284 // mov esp, ebp
285 // in case a signal comes in that's not using an alternate signal stack and the large frame
286 // may have moved us outside of the reserved area at the end of the stack.
287 // cmp rs_rX86_SP, fs:[stack_end_]; jcc throw_slowpath
288 if (cu_->target64) {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800289 OpRegThreadMem(kOpCmp, rs_rX86_SP_64, Thread::StackEndOffset<8>());
Dave Allison69dfe512014-07-11 17:11:58 +0000290 } else {
Ian Rogersb28c1c02014-11-08 11:21:21 -0800291 OpRegThreadMem(kOpCmp, rs_rX86_SP_32, Thread::StackEndOffset<4>());
Dave Allison69dfe512014-07-11 17:11:58 +0000292 }
293 LIR* branch = OpCondBranch(kCondUlt, nullptr);
294 AddSlowPath(
Chao-ying Fue0ccdc02014-06-06 17:32:37 -0700295 new(arena_)StackOverflowSlowPath(this, branch,
296 frame_size_ -
297 GetInstructionSetPointerSize(cu_->instruction_set)));
Dave Allison69dfe512014-07-11 17:11:58 +0000298 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700299 }
300
301 FlushIns(ArgLocs, rl_method);
302
Mark Mendell67c39c42014-01-31 17:28:00 -0800303 if (base_of_code_ != nullptr) {
Chao-ying Fua77ee512014-07-01 17:43:41 -0700304 RegStorage method_start = TargetPtrReg(kArg0);
Mark Mendell67c39c42014-01-31 17:28:00 -0800305 // We have been asked to save the address of the method start for later use.
Chao-ying Fua77ee512014-07-01 17:43:41 -0700306 setup_method_address_[0] = NewLIR1(kX86StartOfMethod, method_start.GetReg());
Mark Mendell67c39c42014-01-31 17:28:00 -0800307 int displacement = SRegOffset(base_of_code_->s_reg_low);
buzbee695d13a2014-04-19 13:32:20 -0700308 // Native pointer - must be natural word size.
Ian Rogersb28c1c02014-11-08 11:21:21 -0800309 setup_method_address_[1] = StoreBaseDisp(rs_rSP, displacement, method_start,
Elena Sayapinadd644502014-07-01 18:39:52 +0700310 cu_->target64 ? k64 : k32, kNotVolatile);
Mark Mendell67c39c42014-01-31 17:28:00 -0800311 }
312
Ian Rogersb28c1c02014-11-08 11:21:21 -0800313 FreeTemp(arg0);
314 FreeTemp(arg1);
315 FreeTemp(arg2);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700316}
317
318void X86Mir2Lir::GenExitSequence() {
319 /*
320 * In the exit path, rX86_RET0/rX86_RET1 are live - make sure they aren't
321 * allocated by the register utilities as temps.
322 */
buzbee091cc402014-03-31 10:14:40 -0700323 LockTemp(rs_rX86_RET0);
324 LockTemp(rs_rX86_RET1);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700325
326 NewLIR0(kPseudoMethodExit);
327 UnSpillCoreRegs();
Serguei Katkovc3801912014-07-08 17:21:53 +0700328 UnSpillFPRegs();
Brian Carlstrom7940e442013-07-12 13:46:57 -0700329 /* Remove frame except for return address */
Ian Rogersb28c1c02014-11-08 11:21:21 -0800330 const RegStorage rs_rSP = cu_->target64 ? rs_rX86_SP_64 : rs_rX86_SP_32;
331 stack_increment_ = OpRegImm(kOpAdd, rs_rSP,
332 frame_size_ - GetInstructionSetPointerSize(cu_->instruction_set));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700333 NewLIR0(kX86Ret);
334}
335
Razvan A Lupusoru3bc01742014-02-06 13:18:43 -0800336void X86Mir2Lir::GenSpecialExitSequence() {
337 NewLIR0(kX86Ret);
338}
339
Dave Allison69dfe512014-07-11 17:11:58 +0000340void X86Mir2Lir::GenImplicitNullCheck(RegStorage reg, int opt_flags) {
341 if (!(cu_->disable_opt & (1 << kNullCheckElimination)) && (opt_flags & MIR_IGNORE_NULL_CHECK)) {
342 return;
343 }
344 // Implicit null pointer check.
345 // test eax,[arg1+0]
346 NewLIR3(kX86Test32RM, rs_rAX.GetReg(), reg.GetReg(), 0);
347 MarkPossibleNullPointerException(opt_flags);
348}
349
Vladimir Markof4da6752014-08-01 19:04:18 +0100350/*
351 * Bit of a hack here - in the absence of a real scheduling pass,
352 * emit the next instruction in static & direct invoke sequences.
353 */
354static int X86NextSDCallInsn(CompilationUnit* cu, CallInfo* info,
355 int state, const MethodReference& target_method,
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700356 uint32_t,
Vladimir Markof4da6752014-08-01 19:04:18 +0100357 uintptr_t direct_code, uintptr_t direct_method,
358 InvokeType type) {
Ian Rogers6a3c1fc2014-10-31 00:33:20 -0700359 UNUSED(info, direct_code);
Vladimir Markof4da6752014-08-01 19:04:18 +0100360 Mir2Lir* cg = static_cast<Mir2Lir*>(cu->cg.get());
361 if (direct_method != 0) {
362 switch (state) {
363 case 0: // Get the current Method* [sets kArg0]
364 if (direct_method != static_cast<uintptr_t>(-1)) {
365 cg->LoadConstant(cg->TargetReg(kArg0, kRef), direct_method);
366 } else {
367 cg->LoadMethodAddress(target_method, type, kArg0);
368 }
369 break;
370 default:
371 return -1;
372 }
373 } else {
374 RegStorage arg0_ref = cg->TargetReg(kArg0, kRef);
375 switch (state) {
376 case 0: // Get the current Method* [sets kArg0]
377 // TUNING: we can save a reg copy if Method* has been promoted.
378 cg->LoadCurrMethodDirect(arg0_ref);
379 break;
380 case 1: // Get method->dex_cache_resolved_methods_
381 cg->LoadRefDisp(arg0_ref,
382 mirror::ArtMethod::DexCacheResolvedMethodsOffset().Int32Value(),
383 arg0_ref,
384 kNotVolatile);
385 break;
386 case 2: // Grab target method*
387 CHECK_EQ(cu->dex_file, target_method.dex_file);
388 cg->LoadRefDisp(arg0_ref,
389 mirror::ObjectArray<mirror::Object>::OffsetOfElement(
390 target_method.dex_method_index).Int32Value(),
391 arg0_ref,
392 kNotVolatile);
393 break;
394 default:
395 return -1;
396 }
397 }
398 return state + 1;
399}
400
401NextCallInsn X86Mir2Lir::GetNextSDCallInsn() {
402 return X86NextSDCallInsn;
403}
404
Brian Carlstrom7940e442013-07-12 13:46:57 -0700405} // namespace art