blob: ed73ef0a00e1927acb2ffcc83629ba34f9d21050 [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 Mips ISA */
18
19#include "codegen_mips.h"
Ian Rogersd582fa42014-11-05 23:46:43 -080020
Brian Carlstrom7940e442013-07-12 13:46:57 -070021#include "dex/quick/mir_to_lir-inl.h"
Ian Rogers166db042013-07-26 12:05:57 -070022#include "entrypoints/quick/quick_entrypoints.h"
Ian Rogers576ca0c2014-06-06 15:58:22 -070023#include "gc/accounting/card_table.h"
Brian Carlstrom7940e442013-07-12 13:46:57 -070024#include "mips_lir.h"
Brian Carlstrom7940e442013-07-12 13:46:57 -070025
26namespace art {
27
Ian Rogers6a3c1fc2014-10-31 00:33:20 -070028bool MipsMir2Lir::GenSpecialCase(BasicBlock* bb, MIR* mir, const InlineMethod& special) {
Razvan A Lupusoru3bc01742014-02-06 13:18:43 -080029 // TODO
Ian Rogers6a3c1fc2014-10-31 00:33:20 -070030 UNUSED(bb, mir, special);
Razvan A Lupusoru3bc01742014-02-06 13:18:43 -080031 return false;
Brian Carlstrom7940e442013-07-12 13:46:57 -070032}
33
34/*
35 * The lack of pc-relative loads on Mips presents somewhat of a challenge
36 * for our PIC switch table strategy. To materialize the current location
buzbee2700f7e2014-03-07 09:46:20 -080037 * we'll do a dummy JAL and reference our tables using rRA as the
38 * base register. Note that rRA will be used both as the base to
Brian Carlstrom7940e442013-07-12 13:46:57 -070039 * locate the switch table data and as the reference base for the switch
40 * target offsets stored in the table. We'll use a special pseudo-instruction
41 * to represent the jal and trigger the construction of the
42 * switch table offsets (which will happen after final assembly and all
43 * labels are fixed).
44 *
45 * The test loop will look something like:
46 *
buzbee2700f7e2014-03-07 09:46:20 -080047 * ori r_end, rZERO, #table_size ; size in bytes
48 * jal BaseLabel ; stores "return address" (BaseLabel) in rRA
Brian Carlstrom7940e442013-07-12 13:46:57 -070049 * nop ; opportunistically fill
50 * BaseLabel:
buzbee2700f7e2014-03-07 09:46:20 -080051 * addiu r_base, rRA, <table> - <BaseLabel> ; table relative to BaseLabel
52 addu r_end, r_end, r_base ; end of table
Brian Carlstrom7940e442013-07-12 13:46:57 -070053 * lw r_val, [rSP, v_reg_off] ; Test Value
54 * loop:
buzbee2700f7e2014-03-07 09:46:20 -080055 * beq r_base, r_end, done
56 * lw r_key, 0(r_base)
57 * addu r_base, 8
Brian Carlstrom7940e442013-07-12 13:46:57 -070058 * bne r_val, r_key, loop
buzbee2700f7e2014-03-07 09:46:20 -080059 * lw r_disp, -4(r_base)
60 * addu rRA, r_disp
61 * jr rRA
Brian Carlstrom7940e442013-07-12 13:46:57 -070062 * done:
63 *
64 */
Andreas Gampe48971b32014-08-06 10:09:01 -070065void MipsMir2Lir::GenLargeSparseSwitch(MIR* mir, DexOffset table_offset, RegLocation rl_src) {
Razvan A Lupusoru8d0d03e2014-06-06 17:04:52 -070066 const uint16_t* table = mir_graph_->GetTable(mir, table_offset);
Brian Carlstrom7940e442013-07-12 13:46:57 -070067 if (cu_->verbose) {
68 DumpSparseSwitchTable(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 elements = table[1];
76 tab_rec->targets =
Vladimir Marko83cc7ae2014-02-12 18:02:05 +000077 static_cast<LIR**>(arena_->Alloc(elements * sizeof(LIR*), kArenaAllocLIR));
Vladimir Markoe39c54e2014-09-22 14:50:02 +010078 switch_tables_.push_back(tab_rec);
Brian Carlstrom7940e442013-07-12 13:46:57 -070079
80 // The table is composed of 8-byte key/disp pairs
81 int byte_size = elements * 8;
82
83 int size_hi = byte_size >> 16;
84 int size_lo = byte_size & 0xffff;
85
buzbee2700f7e2014-03-07 09:46:20 -080086 RegStorage r_end = AllocTemp();
Brian Carlstrom7940e442013-07-12 13:46:57 -070087 if (size_hi) {
buzbee2700f7e2014-03-07 09:46:20 -080088 NewLIR2(kMipsLui, r_end.GetReg(), size_hi);
Brian Carlstrom7940e442013-07-12 13:46:57 -070089 }
90 // Must prevent code motion for the curr pc pair
91 GenBarrier(); // Scheduling barrier
92 NewLIR0(kMipsCurrPC); // Really a jal to .+8
93 // Now, fill the branch delay slot
94 if (size_hi) {
buzbee2700f7e2014-03-07 09:46:20 -080095 NewLIR3(kMipsOri, r_end.GetReg(), r_end.GetReg(), size_lo);
Brian Carlstrom7940e442013-07-12 13:46:57 -070096 } else {
buzbee2700f7e2014-03-07 09:46:20 -080097 NewLIR3(kMipsOri, r_end.GetReg(), rZERO, size_lo);
Brian Carlstrom7940e442013-07-12 13:46:57 -070098 }
99 GenBarrier(); // Scheduling barrier
100
101 // Construct BaseLabel and set up table base register
102 LIR* base_label = NewLIR0(kPseudoTargetLabel);
103 // Remember base label so offsets can be computed later
104 tab_rec->anchor = base_label;
buzbee2700f7e2014-03-07 09:46:20 -0800105 RegStorage r_base = AllocTemp();
106 NewLIR4(kMipsDelta, r_base.GetReg(), 0, WrapPointer(base_label), WrapPointer(tab_rec));
107 OpRegRegReg(kOpAdd, r_end, r_end, r_base);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700108
109 // Grab switch test value
110 rl_src = LoadValue(rl_src, kCoreReg);
111
112 // Test loop
buzbee2700f7e2014-03-07 09:46:20 -0800113 RegStorage r_key = AllocTemp();
Brian Carlstrom7940e442013-07-12 13:46:57 -0700114 LIR* loop_label = NewLIR0(kPseudoTargetLabel);
buzbee2700f7e2014-03-07 09:46:20 -0800115 LIR* exit_branch = OpCmpBranch(kCondEq, r_base, r_end, NULL);
buzbee695d13a2014-04-19 13:32:20 -0700116 Load32Disp(r_base, 0, r_key);
buzbee2700f7e2014-03-07 09:46:20 -0800117 OpRegImm(kOpAdd, r_base, 8);
118 OpCmpBranch(kCondNe, rl_src.reg, r_key, loop_label);
119 RegStorage r_disp = AllocTemp();
buzbee695d13a2014-04-19 13:32:20 -0700120 Load32Disp(r_base, -4, r_disp);
buzbee2700f7e2014-03-07 09:46:20 -0800121 OpRegRegReg(kOpAdd, rs_rRA, rs_rRA, r_disp);
122 OpReg(kOpBx, rs_rRA);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700123
124 // Loop exit
125 LIR* exit_label = NewLIR0(kPseudoTargetLabel);
126 exit_branch->target = exit_label;
127}
128
129/*
130 * Code pattern will look something like:
131 *
132 * lw r_val
buzbee2700f7e2014-03-07 09:46:20 -0800133 * jal BaseLabel ; stores "return address" (BaseLabel) in rRA
Brian Carlstrom7940e442013-07-12 13:46:57 -0700134 * nop ; opportunistically fill
135 * [subiu r_val, bias] ; Remove bias if low_val != 0
136 * bound check -> done
buzbee2700f7e2014-03-07 09:46:20 -0800137 * lw r_disp, [rRA, r_val]
138 * addu rRA, r_disp
139 * jr rRA
Brian Carlstrom7940e442013-07-12 13:46:57 -0700140 * done:
141 */
Andreas Gampe48971b32014-08-06 10:09:01 -0700142void MipsMir2Lir::GenLargePackedSwitch(MIR* mir, DexOffset table_offset, RegLocation rl_src) {
Razvan A Lupusoru8d0d03e2014-06-06 17:04:52 -0700143 const uint16_t* table = mir_graph_->GetTable(mir, table_offset);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700144 if (cu_->verbose) {
145 DumpPackedSwitchTable(table);
146 }
147 // Add the table to the list - we'll process it later
buzbee0d829482013-10-11 15:24:55 -0700148 SwitchTable* tab_rec =
Vladimir Marko83cc7ae2014-02-12 18:02:05 +0000149 static_cast<SwitchTable*>(arena_->Alloc(sizeof(SwitchTable), kArenaAllocData));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700150 tab_rec->table = table;
151 tab_rec->vaddr = current_dalvik_offset_;
152 int size = table[1];
Mathieu Chartierf6c4b3b2013-08-24 16:11:37 -0700153 tab_rec->targets = static_cast<LIR**>(arena_->Alloc(size * sizeof(LIR*),
Vladimir Marko83cc7ae2014-02-12 18:02:05 +0000154 kArenaAllocLIR));
Vladimir Markoe39c54e2014-09-22 14:50:02 +0100155 switch_tables_.push_back(tab_rec);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700156
157 // Get the switch value
158 rl_src = LoadValue(rl_src, kCoreReg);
159
160 // Prepare the bias. If too big, handle 1st stage here
161 int low_key = s4FromSwitchData(&table[2]);
162 bool large_bias = false;
buzbee2700f7e2014-03-07 09:46:20 -0800163 RegStorage r_key;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700164 if (low_key == 0) {
buzbee2700f7e2014-03-07 09:46:20 -0800165 r_key = rl_src.reg;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700166 } else if ((low_key & 0xffff) != low_key) {
167 r_key = AllocTemp();
168 LoadConstant(r_key, low_key);
169 large_bias = true;
170 } else {
171 r_key = AllocTemp();
172 }
173
174 // Must prevent code motion for the curr pc pair
175 GenBarrier();
176 NewLIR0(kMipsCurrPC); // Really a jal to .+8
177 // Now, fill the branch delay slot with bias strip
178 if (low_key == 0) {
179 NewLIR0(kMipsNop);
180 } else {
181 if (large_bias) {
buzbee2700f7e2014-03-07 09:46:20 -0800182 OpRegRegReg(kOpSub, r_key, rl_src.reg, r_key);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700183 } else {
buzbee2700f7e2014-03-07 09:46:20 -0800184 OpRegRegImm(kOpSub, r_key, rl_src.reg, low_key);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700185 }
186 }
187 GenBarrier(); // Scheduling barrier
188
189 // Construct BaseLabel and set up table base register
190 LIR* base_label = NewLIR0(kPseudoTargetLabel);
191 // Remember base label so offsets can be computed later
192 tab_rec->anchor = base_label;
193
194 // Bounds check - if < 0 or >= size continue following switch
195 LIR* branch_over = OpCmpImmBranch(kCondHi, r_key, size-1, NULL);
196
197 // Materialize the table base pointer
buzbee2700f7e2014-03-07 09:46:20 -0800198 RegStorage r_base = AllocTemp();
199 NewLIR4(kMipsDelta, r_base.GetReg(), 0, WrapPointer(base_label), WrapPointer(tab_rec));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700200
201 // Load the displacement from the switch table
buzbee2700f7e2014-03-07 09:46:20 -0800202 RegStorage r_disp = AllocTemp();
buzbee695d13a2014-04-19 13:32:20 -0700203 LoadBaseIndexed(r_base, r_key, r_disp, 2, k32);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700204
buzbee2700f7e2014-03-07 09:46:20 -0800205 // Add to rAP and go
206 OpRegRegReg(kOpAdd, rs_rRA, rs_rRA, r_disp);
207 OpReg(kOpBx, rs_rRA);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700208
209 /* branch_over target here */
210 LIR* target = NewLIR0(kPseudoTargetLabel);
211 branch_over->target = target;
212}
213
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700214void MipsMir2Lir::GenMoveException(RegLocation rl_dest) {
Ian Rogersdd7624d2014-03-14 17:43:00 -0700215 int ex_offset = Thread::ExceptionOffset<4>().Int32Value();
buzbeea0cd2d72014-06-01 09:33:49 -0700216 RegLocation rl_result = EvalLoc(rl_dest, kRefReg, true);
217 RegStorage reset_reg = AllocTempRef();
Andreas Gampe3c12c512014-06-24 18:46:29 +0000218 LoadRefDisp(rs_rMIPS_SELF, ex_offset, rl_result.reg, kNotVolatile);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700219 LoadConstant(reset_reg, 0);
Andreas Gampe3c12c512014-06-24 18:46:29 +0000220 StoreRefDisp(rs_rMIPS_SELF, ex_offset, reset_reg, kNotVolatile);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700221 FreeTemp(reset_reg);
222 StoreValue(rl_dest, rl_result);
223}
224
225/*
226 * Mark garbage collection card. Skip if the value we're storing is null.
227 */
buzbee2700f7e2014-03-07 09:46:20 -0800228void MipsMir2Lir::MarkGCCard(RegStorage val_reg, RegStorage tgt_addr_reg) {
229 RegStorage reg_card_base = AllocTemp();
230 RegStorage reg_card_no = AllocTemp();
Brian Carlstrom7940e442013-07-12 13:46:57 -0700231 LIR* branch_over = OpCmpImmBranch(kCondEq, val_reg, 0, NULL);
buzbee695d13a2014-04-19 13:32:20 -0700232 // NOTE: native pointer.
Ian Rogersdd7624d2014-03-14 17:43:00 -0700233 LoadWordDisp(rs_rMIPS_SELF, Thread::CardTableOffset<4>().Int32Value(), reg_card_base);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700234 OpRegRegImm(kOpLsr, reg_card_no, tgt_addr_reg, gc::accounting::CardTable::kCardShift);
buzbee2700f7e2014-03-07 09:46:20 -0800235 StoreBaseIndexed(reg_card_base, reg_card_no, reg_card_base, 0, kUnsignedByte);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700236 LIR* target = NewLIR0(kPseudoTargetLabel);
237 branch_over->target = target;
238 FreeTemp(reg_card_base);
239 FreeTemp(reg_card_no);
240}
Ian Rogersd9c4fc92013-10-01 19:45:43 -0700241
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700242void MipsMir2Lir::GenEntrySequence(RegLocation* ArgLocs, RegLocation rl_method) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700243 int spill_count = num_core_spills_ + num_fp_spills_;
244 /*
245 * On entry, rMIPS_ARG0, rMIPS_ARG1, rMIPS_ARG2 & rMIPS_ARG3 are live. Let the register
246 * allocation mechanism know so it doesn't try to use any of them when
247 * expanding the frame or flushing. This leaves the utility
248 * code with a single temp: r12. This should be enough.
249 */
buzbee091cc402014-03-31 10:14:40 -0700250 LockTemp(rs_rMIPS_ARG0);
251 LockTemp(rs_rMIPS_ARG1);
252 LockTemp(rs_rMIPS_ARG2);
253 LockTemp(rs_rMIPS_ARG3);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700254
255 /*
256 * We can safely skip the stack overflow check if we're
257 * a leaf *and* our frame size < fudge factor.
258 */
Dave Allison648d7112014-07-25 16:15:27 -0700259 bool skip_overflow_check = mir_graph_->MethodIsLeaf() && !FrameNeedsStackCheck(frame_size_, kMips);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700260 NewLIR0(kPseudoMethodEntry);
buzbee2700f7e2014-03-07 09:46:20 -0800261 RegStorage check_reg = AllocTemp();
262 RegStorage new_sp = AllocTemp();
Brian Carlstrom7940e442013-07-12 13:46:57 -0700263 if (!skip_overflow_check) {
264 /* Load stack limit */
buzbee695d13a2014-04-19 13:32:20 -0700265 Load32Disp(rs_rMIPS_SELF, Thread::StackEndOffset<4>().Int32Value(), check_reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700266 }
267 /* Spill core callee saves */
268 SpillCoreRegs();
269 /* NOTE: promotion of FP regs currently unsupported, thus no FP spill */
270 DCHECK_EQ(num_fp_spills_, 0);
Mathieu Chartier0d507d12014-03-19 10:17:28 -0700271 const int frame_sub = frame_size_ - spill_count * 4;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700272 if (!skip_overflow_check) {
Mathieu Chartier0d507d12014-03-19 10:17:28 -0700273 class StackOverflowSlowPath : public LIRSlowPath {
274 public:
275 StackOverflowSlowPath(Mir2Lir* m2l, LIR* branch, size_t sp_displace)
276 : LIRSlowPath(m2l, m2l->GetCurrentDexPc(), branch, nullptr), sp_displace_(sp_displace) {
277 }
278 void Compile() OVERRIDE {
279 m2l_->ResetRegPool();
280 m2l_->ResetDefTracking();
Mingyao Yang6ffcfa02014-04-25 11:06:00 -0700281 GenerateTargetLabel(kPseudoThrowTarget);
Mathieu Chartier0d507d12014-03-19 10:17:28 -0700282 // LR is offset 0 since we push in reverse order.
buzbee695d13a2014-04-19 13:32:20 -0700283 m2l_->Load32Disp(rs_rMIPS_SP, 0, rs_rRA);
buzbee2700f7e2014-03-07 09:46:20 -0800284 m2l_->OpRegImm(kOpAdd, rs_rMIPS_SP, sp_displace_);
Mathieu Chartier0d507d12014-03-19 10:17:28 -0700285 m2l_->ClobberCallerSave();
Andreas Gampe98430592014-07-27 19:44:50 -0700286 RegStorage r_tgt = m2l_->CallHelperSetup(kQuickThrowStackOverflow); // Doesn't clobber LR.
287 m2l_->CallHelper(r_tgt, kQuickThrowStackOverflow, false /* MarkSafepointPC */,
288 false /* UseLink */);
Mathieu Chartier0d507d12014-03-19 10:17:28 -0700289 }
290
291 private:
292 const size_t sp_displace_;
293 };
buzbee2700f7e2014-03-07 09:46:20 -0800294 OpRegRegImm(kOpSub, new_sp, rs_rMIPS_SP, frame_sub);
Mathieu Chartier0d507d12014-03-19 10:17:28 -0700295 LIR* branch = OpCmpBranch(kCondUlt, new_sp, check_reg, nullptr);
296 AddSlowPath(new(arena_)StackOverflowSlowPath(this, branch, spill_count * 4));
297 // TODO: avoid copy for small frame sizes.
buzbee2700f7e2014-03-07 09:46:20 -0800298 OpRegCopy(rs_rMIPS_SP, new_sp); // Establish stack
Brian Carlstrom7940e442013-07-12 13:46:57 -0700299 } else {
buzbee2700f7e2014-03-07 09:46:20 -0800300 OpRegImm(kOpSub, rs_rMIPS_SP, frame_sub);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700301 }
302
303 FlushIns(ArgLocs, rl_method);
304
buzbee091cc402014-03-31 10:14:40 -0700305 FreeTemp(rs_rMIPS_ARG0);
306 FreeTemp(rs_rMIPS_ARG1);
307 FreeTemp(rs_rMIPS_ARG2);
308 FreeTemp(rs_rMIPS_ARG3);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700309}
310
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700311void MipsMir2Lir::GenExitSequence() {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700312 /*
313 * In the exit path, rMIPS_RET0/rMIPS_RET1 are live - make sure they aren't
314 * allocated by the register utilities as temps.
315 */
buzbee091cc402014-03-31 10:14:40 -0700316 LockTemp(rs_rMIPS_RET0);
317 LockTemp(rs_rMIPS_RET1);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700318
319 NewLIR0(kPseudoMethodExit);
320 UnSpillCoreRegs();
buzbee2700f7e2014-03-07 09:46:20 -0800321 OpReg(kOpBx, rs_rRA);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700322}
323
Razvan A Lupusoru3bc01742014-02-06 13:18:43 -0800324void MipsMir2Lir::GenSpecialExitSequence() {
buzbee2700f7e2014-03-07 09:46:20 -0800325 OpReg(kOpBx, rs_rRA);
Razvan A Lupusoru3bc01742014-02-06 13:18:43 -0800326}
327
Brian Carlstrom7940e442013-07-12 13:46:57 -0700328} // namespace art