blob: fc0b305fc34aa1cce5f8dea91687fc24860a3d18 [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"
Brian Carlstrom7940e442013-07-12 13:46:57 -070022#include "x86_lir.h"
23
24namespace art {
25
Brian Carlstrom7940e442013-07-12 13:46:57 -070026/*
27 * The sparse table in the literal pool is an array of <key,displacement>
28 * pairs.
29 */
buzbee0d829482013-10-11 15:24:55 -070030void X86Mir2Lir::GenSparseSwitch(MIR* mir, DexOffset table_offset,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -070031 RegLocation rl_src) {
Brian Carlstrom7940e442013-07-12 13:46:57 -070032 const uint16_t* table = cu_->insns + current_dalvik_offset_ + table_offset;
33 if (cu_->verbose) {
34 DumpSparseSwitchTable(table);
35 }
36 int entries = table[1];
buzbee0d829482013-10-11 15:24:55 -070037 const int32_t* keys = reinterpret_cast<const int32_t*>(&table[2]);
38 const int32_t* targets = &keys[entries];
Brian Carlstrom7940e442013-07-12 13:46:57 -070039 rl_src = LoadValue(rl_src, kCoreReg);
40 for (int i = 0; i < entries; i++) {
41 int key = keys[i];
42 BasicBlock* case_block =
43 mir_graph_->FindBlock(current_dalvik_offset_ + targets[i]);
buzbee2700f7e2014-03-07 09:46:20 -080044 OpCmpImmBranch(kCondEq, rl_src.reg, key, &block_label_list_[case_block->id]);
Brian Carlstrom7940e442013-07-12 13:46:57 -070045 }
46}
47
48/*
49 * Code pattern will look something like:
50 *
51 * mov r_val, ..
52 * call 0
53 * pop r_start_of_method
54 * sub r_start_of_method, ..
55 * mov r_key_reg, r_val
56 * sub r_key_reg, low_key
57 * cmp r_key_reg, size-1 ; bound check
58 * ja done
59 * mov r_disp, [r_start_of_method + r_key_reg * 4 + table_offset]
60 * add r_start_of_method, r_disp
61 * jmp r_start_of_method
62 * done:
63 */
buzbee0d829482013-10-11 15:24:55 -070064void X86Mir2Lir::GenPackedSwitch(MIR* mir, DexOffset table_offset,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -070065 RegLocation rl_src) {
Brian Carlstrom7940e442013-07-12 13:46:57 -070066 const uint16_t* table = cu_->insns + current_dalvik_offset_ + table_offset;
67 if (cu_->verbose) {
68 DumpPackedSwitchTable(table);
69 }
70 // Add the table to the list - we'll process it later
buzbee0d829482013-10-11 15:24:55 -070071 SwitchTable* tab_rec =
Vladimir Marko83cc7ae2014-02-12 18:02:05 +000072 static_cast<SwitchTable*>(arena_->Alloc(sizeof(SwitchTable), kArenaAllocData));
Brian Carlstrom7940e442013-07-12 13:46:57 -070073 tab_rec->table = table;
74 tab_rec->vaddr = current_dalvik_offset_;
75 int size = table[1];
Mathieu Chartierf6c4b3b2013-08-24 16:11:37 -070076 tab_rec->targets = static_cast<LIR**>(arena_->Alloc(size * sizeof(LIR*),
Vladimir Marko83cc7ae2014-02-12 18:02:05 +000077 kArenaAllocLIR));
Brian Carlstrom7940e442013-07-12 13:46:57 -070078 switch_tables_.Insert(tab_rec);
79
80 // Get the switch value
81 rl_src = LoadValue(rl_src, kCoreReg);
Brian Carlstrom7934ac22013-07-26 10:54:15 -070082 // NewLIR0(kX86Bkpt);
Mark Mendell67c39c42014-01-31 17:28:00 -080083
84 // Materialize a pointer to the switch table
buzbee2700f7e2014-03-07 09:46:20 -080085 RegStorage start_of_method_reg;
Mark Mendell67c39c42014-01-31 17:28:00 -080086 if (base_of_code_ != nullptr) {
87 // We can use the saved value.
88 RegLocation rl_method = mir_graph_->GetRegLocation(base_of_code_->s_reg_low);
89 rl_method = LoadValue(rl_method, kCoreReg);
buzbee2700f7e2014-03-07 09:46:20 -080090 start_of_method_reg = rl_method.reg;
Mark Mendell55d0eac2014-02-06 11:02:52 -080091 store_method_addr_used_ = true;
Mark Mendell67c39c42014-01-31 17:28:00 -080092 } else {
93 start_of_method_reg = AllocTemp();
buzbee2700f7e2014-03-07 09:46:20 -080094 NewLIR1(kX86StartOfMethod, start_of_method_reg.GetReg());
Mark Mendell67c39c42014-01-31 17:28:00 -080095 }
Brian Carlstrom7940e442013-07-12 13:46:57 -070096 int low_key = s4FromSwitchData(&table[2]);
buzbee2700f7e2014-03-07 09:46:20 -080097 RegStorage keyReg;
Brian Carlstrom7940e442013-07-12 13:46:57 -070098 // Remove the bias, if necessary
99 if (low_key == 0) {
buzbee2700f7e2014-03-07 09:46:20 -0800100 keyReg = rl_src.reg;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700101 } else {
102 keyReg = AllocTemp();
buzbee2700f7e2014-03-07 09:46:20 -0800103 OpRegRegImm(kOpSub, keyReg, rl_src.reg, low_key);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700104 }
105 // Bounds check - if < 0 or >= size continue following switch
106 OpRegImm(kOpCmp, keyReg, size-1);
107 LIR* branch_over = OpCondBranch(kCondHi, NULL);
108
109 // Load the displacement from the switch table
buzbee2700f7e2014-03-07 09:46:20 -0800110 RegStorage disp_reg = AllocTemp();
111 NewLIR5(kX86PcRelLoadRA, disp_reg.GetReg(), start_of_method_reg.GetReg(), keyReg.GetReg(), 2, WrapPointer(tab_rec));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700112 // Add displacement to start of method
113 OpRegReg(kOpAdd, start_of_method_reg, disp_reg);
114 // ..and go!
buzbee2700f7e2014-03-07 09:46:20 -0800115 LIR* switch_branch = NewLIR1(kX86JmpR, start_of_method_reg.GetReg());
Brian Carlstrom7940e442013-07-12 13:46:57 -0700116 tab_rec->anchor = switch_branch;
117
118 /* branch_over target here */
119 LIR* target = NewLIR0(kPseudoTargetLabel);
120 branch_over->target = target;
121}
122
123/*
124 * Array data table format:
125 * ushort ident = 0x0300 magic value
126 * ushort width width of each element in the table
127 * uint size number of elements in the table
128 * ubyte data[size*width] table of data values (may contain a single-byte
129 * padding at the end)
130 *
131 * Total size is 4+(width * size + 1)/2 16-bit code units.
132 */
buzbee0d829482013-10-11 15:24:55 -0700133void X86Mir2Lir::GenFillArrayData(DexOffset table_offset, RegLocation rl_src) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700134 const uint16_t* table = cu_->insns + current_dalvik_offset_ + table_offset;
135 // Add the table to the list - we'll process it later
buzbee0d829482013-10-11 15:24:55 -0700136 FillArrayData* tab_rec =
Vladimir Marko83cc7ae2014-02-12 18:02:05 +0000137 static_cast<FillArrayData*>(arena_->Alloc(sizeof(FillArrayData), kArenaAllocData));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700138 tab_rec->table = table;
139 tab_rec->vaddr = current_dalvik_offset_;
140 uint16_t width = tab_rec->table[1];
141 uint32_t size = tab_rec->table[2] | ((static_cast<uint32_t>(tab_rec->table[3])) << 16);
142 tab_rec->size = (size * width) + 8;
143
144 fill_array_data_.Insert(tab_rec);
145
146 // Making a call - use explicit registers
147 FlushAllRegs(); /* Everything to home location */
buzbee2700f7e2014-03-07 09:46:20 -0800148 LoadValueDirectFixed(rl_src, rs_rX86_ARG0);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700149 // Materialize a pointer to the fill data image
Mark Mendell67c39c42014-01-31 17:28:00 -0800150 if (base_of_code_ != nullptr) {
151 // We can use the saved value.
152 RegLocation rl_method = mir_graph_->GetRegLocation(base_of_code_->s_reg_low);
buzbee2700f7e2014-03-07 09:46:20 -0800153 LoadValueDirect(rl_method, rs_rX86_ARG2);
Mark Mendell55d0eac2014-02-06 11:02:52 -0800154 store_method_addr_used_ = true;
Mark Mendell67c39c42014-01-31 17:28:00 -0800155 } else {
buzbee091cc402014-03-31 10:14:40 -0700156 NewLIR1(kX86StartOfMethod, rs_rX86_ARG2.GetReg());
Mark Mendell67c39c42014-01-31 17:28:00 -0800157 }
buzbee091cc402014-03-31 10:14:40 -0700158 NewLIR2(kX86PcRelAdr, rs_rX86_ARG1.GetReg(), WrapPointer(tab_rec));
159 NewLIR2(kX86Add32RR, rs_rX86_ARG1.GetReg(), rs_rX86_ARG2.GetReg());
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700160 if (Is64BitInstructionSet(cu_->instruction_set)) {
161 CallRuntimeHelperRegReg(QUICK_ENTRYPOINT_OFFSET(8, pHandleFillArrayData), rs_rX86_ARG0,
162 rs_rX86_ARG1, true);
163 } else {
164 CallRuntimeHelperRegReg(QUICK_ENTRYPOINT_OFFSET(4, pHandleFillArrayData), rs_rX86_ARG0,
165 rs_rX86_ARG1, true);
166 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700167}
168
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700169void X86Mir2Lir::GenMoveException(RegLocation rl_dest) {
Andreas Gampe2f244e92014-05-08 03:35:25 -0700170 int ex_offset = Is64BitInstructionSet(cu_->instruction_set) ?
171 Thread::ExceptionOffset<8>().Int32Value() :
172 Thread::ExceptionOffset<4>().Int32Value();
buzbeea0cd2d72014-06-01 09:33:49 -0700173 RegLocation rl_result = EvalLoc(rl_dest, kRefReg, true);
Bill Buzbee00e1ec62014-02-27 23:44:13 +0000174 NewLIR2(kX86Mov32RT, rl_result.reg.GetReg(), ex_offset);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700175 NewLIR2(kX86Mov32TI, ex_offset, 0);
176 StoreValue(rl_dest, rl_result);
177}
178
179/*
180 * Mark garbage collection card. Skip if the value we're storing is null.
181 */
buzbee2700f7e2014-03-07 09:46:20 -0800182void X86Mir2Lir::MarkGCCard(RegStorage val_reg, RegStorage tgt_addr_reg) {
183 RegStorage reg_card_base = AllocTemp();
184 RegStorage reg_card_no = AllocTemp();
Brian Carlstrom7940e442013-07-12 13:46:57 -0700185 LIR* branch_over = OpCmpImmBranch(kCondEq, val_reg, 0, NULL);
Andreas Gampe2f244e92014-05-08 03:35:25 -0700186 int ct_offset = Is64BitInstructionSet(cu_->instruction_set) ?
187 Thread::CardTableOffset<8>().Int32Value() :
188 Thread::CardTableOffset<4>().Int32Value();
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700189 if (Gen64Bit()) {
190 NewLIR2(kX86Mov64RT, reg_card_base.GetReg(), ct_offset);
191 } else {
192 NewLIR2(kX86Mov32RT, reg_card_base.GetReg(), ct_offset);
193 }
Brian Carlstrom7940e442013-07-12 13:46:57 -0700194 OpRegRegImm(kOpLsr, reg_card_no, tgt_addr_reg, gc::accounting::CardTable::kCardShift);
buzbee2700f7e2014-03-07 09:46:20 -0800195 StoreBaseIndexed(reg_card_base, reg_card_no, reg_card_base, 0, kUnsignedByte);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700196 LIR* target = NewLIR0(kPseudoTargetLabel);
197 branch_over->target = target;
198 FreeTemp(reg_card_base);
199 FreeTemp(reg_card_no);
200}
201
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700202void X86Mir2Lir::GenEntrySequence(RegLocation* ArgLocs, RegLocation rl_method) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700203 /*
204 * On entry, rX86_ARG0, rX86_ARG1, rX86_ARG2 are live. Let the register
205 * allocation mechanism know so it doesn't try to use any of them when
206 * expanding the frame or flushing. This leaves the utility
207 * code with no spare temps.
208 */
buzbee091cc402014-03-31 10:14:40 -0700209 LockTemp(rs_rX86_ARG0);
210 LockTemp(rs_rX86_ARG1);
211 LockTemp(rs_rX86_ARG2);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700212
213 /* Build frame, return address already on stack */
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700214 stack_decrement_ = OpRegImm(kOpSub, rs_rX86_SP, frame_size_ - GetInstructionSetPointerSize(cu_->instruction_set));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700215
216 /*
217 * We can safely skip the stack overflow check if we're
218 * a leaf *and* our frame size < fudge factor.
219 */
Brian Carlstrom60d7a652014-03-13 18:10:08 -0700220 const bool skip_overflow_check = (mir_graph_->MethodIsLeaf() &&
221 (static_cast<size_t>(frame_size_) < Thread::kStackOverflowReservedBytes));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700222 NewLIR0(kPseudoMethodEntry);
223 /* Spill core callee saves */
224 SpillCoreRegs();
225 /* NOTE: promotion of FP regs currently unsupported, thus no FP spill */
226 DCHECK_EQ(num_fp_spills_, 0);
227 if (!skip_overflow_check) {
Mathieu Chartier0d507d12014-03-19 10:17:28 -0700228 class StackOverflowSlowPath : public LIRSlowPath {
229 public:
230 StackOverflowSlowPath(Mir2Lir* m2l, LIR* branch, size_t sp_displace)
231 : LIRSlowPath(m2l, m2l->GetCurrentDexPc(), branch, nullptr), sp_displace_(sp_displace) {
232 }
233 void Compile() OVERRIDE {
234 m2l_->ResetRegPool();
235 m2l_->ResetDefTracking();
Mingyao Yang6ffcfa02014-04-25 11:06:00 -0700236 GenerateTargetLabel(kPseudoThrowTarget);
buzbee2700f7e2014-03-07 09:46:20 -0800237 m2l_->OpRegImm(kOpAdd, rs_rX86_SP, sp_displace_);
Mathieu Chartier0d507d12014-03-19 10:17:28 -0700238 m2l_->ClobberCallerSave();
Mathieu Chartier0d507d12014-03-19 10:17:28 -0700239 // Assumes codegen and target are in thumb2 mode.
Andreas Gampe2f244e92014-05-08 03:35:25 -0700240 if (Is64BitInstructionSet(cu_->instruction_set)) {
241 m2l_->CallHelper(RegStorage::InvalidReg(), QUICK_ENTRYPOINT_OFFSET(8, pThrowStackOverflow),
242 false /* MarkSafepointPC */, false /* UseLink */);
243 } else {
244 m2l_->CallHelper(RegStorage::InvalidReg(), QUICK_ENTRYPOINT_OFFSET(4, pThrowStackOverflow),
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700245 false /* MarkSafepointPC */, false /* UseLink */);
Andreas Gampe2f244e92014-05-08 03:35:25 -0700246 }
Mathieu Chartier0d507d12014-03-19 10:17:28 -0700247 }
248
249 private:
250 const size_t sp_displace_;
251 };
252 // TODO: for large frames we should do something like:
253 // spill ebp
254 // lea ebp, [esp + frame_size]
255 // cmp ebp, fs:[stack_end_]
256 // jcc stack_overflow_exception
257 // mov esp, ebp
258 // in case a signal comes in that's not using an alternate signal stack and the large frame may
259 // have moved us outside of the reserved area at the end of the stack.
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700260 // cmp rs_rX86_SP, fs:[stack_end_]; jcc throw_slowpath
Andreas Gampe2f244e92014-05-08 03:35:25 -0700261 if (Is64BitInstructionSet(cu_->instruction_set)) {
262 OpRegThreadMem(kOpCmp, rs_rX86_SP, Thread::StackEndOffset<8>());
263 } else {
264 OpRegThreadMem(kOpCmp, rs_rX86_SP, Thread::StackEndOffset<4>());
265 }
Mathieu Chartier0d507d12014-03-19 10:17:28 -0700266 LIR* branch = OpCondBranch(kCondUlt, nullptr);
Andreas Gampe2f244e92014-05-08 03:35:25 -0700267 AddSlowPath(new(arena_)StackOverflowSlowPath(this, branch,
268 frame_size_ -
269 GetInstructionSetPointerSize(cu_->instruction_set)));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700270 }
271
272 FlushIns(ArgLocs, rl_method);
273
Mark Mendell67c39c42014-01-31 17:28:00 -0800274 if (base_of_code_ != nullptr) {
275 // We have been asked to save the address of the method start for later use.
buzbee091cc402014-03-31 10:14:40 -0700276 setup_method_address_[0] = NewLIR1(kX86StartOfMethod, rs_rX86_ARG0.GetReg());
Mark Mendell67c39c42014-01-31 17:28:00 -0800277 int displacement = SRegOffset(base_of_code_->s_reg_low);
buzbee695d13a2014-04-19 13:32:20 -0700278 // Native pointer - must be natural word size.
279 setup_method_address_[1] = StoreWordDisp(rs_rX86_SP, displacement, rs_rX86_ARG0);
Mark Mendell67c39c42014-01-31 17:28:00 -0800280 }
281
buzbee091cc402014-03-31 10:14:40 -0700282 FreeTemp(rs_rX86_ARG0);
283 FreeTemp(rs_rX86_ARG1);
284 FreeTemp(rs_rX86_ARG2);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700285}
286
287void X86Mir2Lir::GenExitSequence() {
288 /*
289 * In the exit path, rX86_RET0/rX86_RET1 are live - make sure they aren't
290 * allocated by the register utilities as temps.
291 */
buzbee091cc402014-03-31 10:14:40 -0700292 LockTemp(rs_rX86_RET0);
293 LockTemp(rs_rX86_RET1);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700294
295 NewLIR0(kPseudoMethodExit);
296 UnSpillCoreRegs();
297 /* Remove frame except for return address */
Dmitry Petrochenko9ee801f2014-05-12 11:31:37 +0700298 stack_increment_ = OpRegImm(kOpAdd, rs_rX86_SP, frame_size_ - GetInstructionSetPointerSize(cu_->instruction_set));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700299 NewLIR0(kX86Ret);
300}
301
Razvan A Lupusoru3bc01742014-02-06 13:18:43 -0800302void X86Mir2Lir::GenSpecialExitSequence() {
303 NewLIR0(kX86Ret);
304}
305
Brian Carlstrom7940e442013-07-12 13:46:57 -0700306} // namespace art