blob: a938478b3d2fe5adec7cb95f73ad1e3f70875589 [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"
20#include "dex/quick/mir_to_lir-inl.h"
Ian Rogers166db042013-07-26 12:05:57 -070021#include "entrypoints/quick/quick_entrypoints.h"
Brian Carlstrom7940e442013-07-12 13:46:57 -070022#include "mips_lir.h"
Brian Carlstrom7940e442013-07-12 13:46:57 -070023
24namespace art {
25
Razvan A Lupusoru3bc01742014-02-06 13:18:43 -080026bool MipsMir2Lir::GenSpecialCase(BasicBlock* bb, MIR* mir,
Vladimir Marko5816ed42013-11-27 17:04:20 +000027 const InlineMethod& special) {
Razvan A Lupusoru3bc01742014-02-06 13:18:43 -080028 // TODO
29 return false;
Brian Carlstrom7940e442013-07-12 13:46:57 -070030}
31
32/*
33 * The lack of pc-relative loads on Mips presents somewhat of a challenge
34 * for our PIC switch table strategy. To materialize the current location
buzbee2700f7e2014-03-07 09:46:20 -080035 * we'll do a dummy JAL and reference our tables using rRA as the
36 * base register. Note that rRA will be used both as the base to
Brian Carlstrom7940e442013-07-12 13:46:57 -070037 * locate the switch table data and as the reference base for the switch
38 * target offsets stored in the table. We'll use a special pseudo-instruction
39 * to represent the jal and trigger the construction of the
40 * switch table offsets (which will happen after final assembly and all
41 * labels are fixed).
42 *
43 * The test loop will look something like:
44 *
buzbee2700f7e2014-03-07 09:46:20 -080045 * ori r_end, rZERO, #table_size ; size in bytes
46 * jal BaseLabel ; stores "return address" (BaseLabel) in rRA
Brian Carlstrom7940e442013-07-12 13:46:57 -070047 * nop ; opportunistically fill
48 * BaseLabel:
buzbee2700f7e2014-03-07 09:46:20 -080049 * addiu r_base, rRA, <table> - <BaseLabel> ; table relative to BaseLabel
50 addu r_end, r_end, r_base ; end of table
Brian Carlstrom7940e442013-07-12 13:46:57 -070051 * lw r_val, [rSP, v_reg_off] ; Test Value
52 * loop:
buzbee2700f7e2014-03-07 09:46:20 -080053 * beq r_base, r_end, done
54 * lw r_key, 0(r_base)
55 * addu r_base, 8
Brian Carlstrom7940e442013-07-12 13:46:57 -070056 * bne r_val, r_key, loop
buzbee2700f7e2014-03-07 09:46:20 -080057 * lw r_disp, -4(r_base)
58 * addu rRA, r_disp
59 * jr rRA
Brian Carlstrom7940e442013-07-12 13:46:57 -070060 * done:
61 *
62 */
buzbee0d829482013-10-11 15:24:55 -070063void MipsMir2Lir::GenSparseSwitch(MIR* mir, DexOffset table_offset,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -070064 RegLocation rl_src) {
Brian Carlstrom7940e442013-07-12 13:46:57 -070065 const uint16_t* table = cu_->insns + current_dalvik_offset_ + table_offset;
66 if (cu_->verbose) {
67 DumpSparseSwitchTable(table);
68 }
69 // Add the table to the list - we'll process it later
buzbee0d829482013-10-11 15:24:55 -070070 SwitchTable* tab_rec =
Vladimir Marko83cc7ae2014-02-12 18:02:05 +000071 static_cast<SwitchTable*>(arena_->Alloc(sizeof(SwitchTable), kArenaAllocData));
Brian Carlstrom7940e442013-07-12 13:46:57 -070072 tab_rec->table = table;
73 tab_rec->vaddr = current_dalvik_offset_;
74 int elements = table[1];
75 tab_rec->targets =
Vladimir Marko83cc7ae2014-02-12 18:02:05 +000076 static_cast<LIR**>(arena_->Alloc(elements * sizeof(LIR*), kArenaAllocLIR));
Brian Carlstrom7940e442013-07-12 13:46:57 -070077 switch_tables_.Insert(tab_rec);
78
79 // The table is composed of 8-byte key/disp pairs
80 int byte_size = elements * 8;
81
82 int size_hi = byte_size >> 16;
83 int size_lo = byte_size & 0xffff;
84
buzbee2700f7e2014-03-07 09:46:20 -080085 RegStorage r_end = AllocTemp();
Brian Carlstrom7940e442013-07-12 13:46:57 -070086 if (size_hi) {
buzbee2700f7e2014-03-07 09:46:20 -080087 NewLIR2(kMipsLui, r_end.GetReg(), size_hi);
Brian Carlstrom7940e442013-07-12 13:46:57 -070088 }
89 // Must prevent code motion for the curr pc pair
90 GenBarrier(); // Scheduling barrier
91 NewLIR0(kMipsCurrPC); // Really a jal to .+8
92 // Now, fill the branch delay slot
93 if (size_hi) {
buzbee2700f7e2014-03-07 09:46:20 -080094 NewLIR3(kMipsOri, r_end.GetReg(), r_end.GetReg(), size_lo);
Brian Carlstrom7940e442013-07-12 13:46:57 -070095 } else {
buzbee2700f7e2014-03-07 09:46:20 -080096 NewLIR3(kMipsOri, r_end.GetReg(), rZERO, size_lo);
Brian Carlstrom7940e442013-07-12 13:46:57 -070097 }
98 GenBarrier(); // Scheduling barrier
99
100 // Construct BaseLabel and set up table base register
101 LIR* base_label = NewLIR0(kPseudoTargetLabel);
102 // Remember base label so offsets can be computed later
103 tab_rec->anchor = base_label;
buzbee2700f7e2014-03-07 09:46:20 -0800104 RegStorage r_base = AllocTemp();
105 NewLIR4(kMipsDelta, r_base.GetReg(), 0, WrapPointer(base_label), WrapPointer(tab_rec));
106 OpRegRegReg(kOpAdd, r_end, r_end, r_base);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700107
108 // Grab switch test value
109 rl_src = LoadValue(rl_src, kCoreReg);
110
111 // Test loop
buzbee2700f7e2014-03-07 09:46:20 -0800112 RegStorage r_key = AllocTemp();
Brian Carlstrom7940e442013-07-12 13:46:57 -0700113 LIR* loop_label = NewLIR0(kPseudoTargetLabel);
buzbee2700f7e2014-03-07 09:46:20 -0800114 LIR* exit_branch = OpCmpBranch(kCondEq, r_base, r_end, NULL);
115 LoadWordDisp(r_base, 0, r_key);
116 OpRegImm(kOpAdd, r_base, 8);
117 OpCmpBranch(kCondNe, rl_src.reg, r_key, loop_label);
118 RegStorage r_disp = AllocTemp();
119 LoadWordDisp(r_base, -4, r_disp);
120 OpRegRegReg(kOpAdd, rs_rRA, rs_rRA, r_disp);
121 OpReg(kOpBx, rs_rRA);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700122
123 // Loop exit
124 LIR* exit_label = NewLIR0(kPseudoTargetLabel);
125 exit_branch->target = exit_label;
126}
127
128/*
129 * Code pattern will look something like:
130 *
131 * lw r_val
buzbee2700f7e2014-03-07 09:46:20 -0800132 * jal BaseLabel ; stores "return address" (BaseLabel) in rRA
Brian Carlstrom7940e442013-07-12 13:46:57 -0700133 * nop ; opportunistically fill
134 * [subiu r_val, bias] ; Remove bias if low_val != 0
135 * bound check -> done
buzbee2700f7e2014-03-07 09:46:20 -0800136 * lw r_disp, [rRA, r_val]
137 * addu rRA, r_disp
138 * jr rRA
Brian Carlstrom7940e442013-07-12 13:46:57 -0700139 * done:
140 */
buzbee0d829482013-10-11 15:24:55 -0700141void MipsMir2Lir::GenPackedSwitch(MIR* mir, DexOffset table_offset,
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700142 RegLocation rl_src) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700143 const uint16_t* table = cu_->insns + current_dalvik_offset_ + table_offset;
144 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));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700155 switch_tables_.Insert(tab_rec);
156
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();
203 LoadBaseIndexed(r_base, r_key, r_disp, 2, kWord);
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
214/*
215 * Array data table format:
216 * ushort ident = 0x0300 magic value
217 * ushort width width of each element in the table
218 * uint size number of elements in the table
219 * ubyte data[size*width] table of data values (may contain a single-byte
220 * padding at the end)
221 *
222 * Total size is 4+(width * size + 1)/2 16-bit code units.
223 */
buzbee0d829482013-10-11 15:24:55 -0700224void MipsMir2Lir::GenFillArrayData(DexOffset table_offset, RegLocation rl_src) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700225 const uint16_t* table = cu_->insns + current_dalvik_offset_ + table_offset;
226 // Add the table to the list - we'll process it later
buzbee0d829482013-10-11 15:24:55 -0700227 FillArrayData* tab_rec =
Mathieu Chartierf6c4b3b2013-08-24 16:11:37 -0700228 reinterpret_cast<FillArrayData*>(arena_->Alloc(sizeof(FillArrayData),
Vladimir Marko83cc7ae2014-02-12 18:02:05 +0000229 kArenaAllocData));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700230 tab_rec->table = table;
231 tab_rec->vaddr = current_dalvik_offset_;
232 uint16_t width = tab_rec->table[1];
233 uint32_t size = tab_rec->table[2] | ((static_cast<uint32_t>(tab_rec->table[3])) << 16);
234 tab_rec->size = (size * width) + 8;
235
236 fill_array_data_.Insert(tab_rec);
237
238 // Making a call - use explicit registers
239 FlushAllRegs(); /* Everything to home location */
240 LockCallTemps();
buzbee2700f7e2014-03-07 09:46:20 -0800241 LoadValueDirectFixed(rl_src, rs_rMIPS_ARG0);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700242
243 // Must prevent code motion for the curr pc pair
244 GenBarrier();
245 NewLIR0(kMipsCurrPC); // Really a jal to .+8
246 // Now, fill the branch delay slot with the helper load
Ian Rogersdd7624d2014-03-14 17:43:00 -0700247 RegStorage r_tgt = LoadHelper(QUICK_ENTRYPOINT_OFFSET(4, pHandleFillArrayData));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700248 GenBarrier(); // Scheduling barrier
249
250 // Construct BaseLabel and set up table base register
251 LIR* base_label = NewLIR0(kPseudoTargetLabel);
252
253 // Materialize a pointer to the fill data image
buzbee0d829482013-10-11 15:24:55 -0700254 NewLIR4(kMipsDelta, rMIPS_ARG1, 0, WrapPointer(base_label), WrapPointer(tab_rec));
Brian Carlstrom7940e442013-07-12 13:46:57 -0700255
256 // And go...
Vladimir Marko31c2aac2013-12-09 16:31:19 +0000257 ClobberCallerSave();
Brian Carlstrom7934ac22013-07-26 10:54:15 -0700258 LIR* call_inst = OpReg(kOpBlx, r_tgt); // ( array*, fill_data* )
Brian Carlstrom7940e442013-07-12 13:46:57 -0700259 MarkSafepointPC(call_inst);
260}
261
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700262void MipsMir2Lir::GenMoveException(RegLocation rl_dest) {
Ian Rogersdd7624d2014-03-14 17:43:00 -0700263 int ex_offset = Thread::ExceptionOffset<4>().Int32Value();
Brian Carlstrom7940e442013-07-12 13:46:57 -0700264 RegLocation rl_result = EvalLoc(rl_dest, kCoreReg, true);
buzbee2700f7e2014-03-07 09:46:20 -0800265 RegStorage reset_reg = AllocTemp();
266 LoadWordDisp(rs_rMIPS_SELF, ex_offset, rl_result.reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700267 LoadConstant(reset_reg, 0);
buzbee2700f7e2014-03-07 09:46:20 -0800268 StoreWordDisp(rs_rMIPS_SELF, ex_offset, reset_reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700269 FreeTemp(reset_reg);
270 StoreValue(rl_dest, rl_result);
271}
272
273/*
274 * Mark garbage collection card. Skip if the value we're storing is null.
275 */
buzbee2700f7e2014-03-07 09:46:20 -0800276void MipsMir2Lir::MarkGCCard(RegStorage val_reg, RegStorage tgt_addr_reg) {
277 RegStorage reg_card_base = AllocTemp();
278 RegStorage reg_card_no = AllocTemp();
Brian Carlstrom7940e442013-07-12 13:46:57 -0700279 LIR* branch_over = OpCmpImmBranch(kCondEq, val_reg, 0, NULL);
Ian Rogersdd7624d2014-03-14 17:43:00 -0700280 LoadWordDisp(rs_rMIPS_SELF, Thread::CardTableOffset<4>().Int32Value(), reg_card_base);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700281 OpRegRegImm(kOpLsr, reg_card_no, tgt_addr_reg, gc::accounting::CardTable::kCardShift);
buzbee2700f7e2014-03-07 09:46:20 -0800282 StoreBaseIndexed(reg_card_base, reg_card_no, reg_card_base, 0, kUnsignedByte);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700283 LIR* target = NewLIR0(kPseudoTargetLabel);
284 branch_over->target = target;
285 FreeTemp(reg_card_base);
286 FreeTemp(reg_card_no);
287}
Ian Rogersd9c4fc92013-10-01 19:45:43 -0700288
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700289void MipsMir2Lir::GenEntrySequence(RegLocation* ArgLocs, RegLocation rl_method) {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700290 int spill_count = num_core_spills_ + num_fp_spills_;
291 /*
292 * On entry, rMIPS_ARG0, rMIPS_ARG1, rMIPS_ARG2 & rMIPS_ARG3 are live. Let the register
293 * allocation mechanism know so it doesn't try to use any of them when
294 * expanding the frame or flushing. This leaves the utility
295 * code with a single temp: r12. This should be enough.
296 */
297 LockTemp(rMIPS_ARG0);
298 LockTemp(rMIPS_ARG1);
299 LockTemp(rMIPS_ARG2);
300 LockTemp(rMIPS_ARG3);
301
302 /*
303 * We can safely skip the stack overflow check if we're
304 * a leaf *and* our frame size < fudge factor.
305 */
306 bool skip_overflow_check = (mir_graph_->MethodIsLeaf() &&
307 (static_cast<size_t>(frame_size_) < Thread::kStackOverflowReservedBytes));
308 NewLIR0(kPseudoMethodEntry);
buzbee2700f7e2014-03-07 09:46:20 -0800309 RegStorage check_reg = AllocTemp();
310 RegStorage new_sp = AllocTemp();
Brian Carlstrom7940e442013-07-12 13:46:57 -0700311 if (!skip_overflow_check) {
312 /* Load stack limit */
Ian Rogersdd7624d2014-03-14 17:43:00 -0700313 LoadWordDisp(rs_rMIPS_SELF, Thread::StackEndOffset<4>().Int32Value(), check_reg);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700314 }
315 /* Spill core callee saves */
316 SpillCoreRegs();
317 /* NOTE: promotion of FP regs currently unsupported, thus no FP spill */
318 DCHECK_EQ(num_fp_spills_, 0);
Mathieu Chartier0d507d12014-03-19 10:17:28 -0700319 const int frame_sub = frame_size_ - spill_count * 4;
Brian Carlstrom7940e442013-07-12 13:46:57 -0700320 if (!skip_overflow_check) {
Mathieu Chartier0d507d12014-03-19 10:17:28 -0700321 class StackOverflowSlowPath : public LIRSlowPath {
322 public:
323 StackOverflowSlowPath(Mir2Lir* m2l, LIR* branch, size_t sp_displace)
324 : LIRSlowPath(m2l, m2l->GetCurrentDexPc(), branch, nullptr), sp_displace_(sp_displace) {
325 }
326 void Compile() OVERRIDE {
327 m2l_->ResetRegPool();
328 m2l_->ResetDefTracking();
329 GenerateTargetLabel();
330 // LR is offset 0 since we push in reverse order.
buzbee2700f7e2014-03-07 09:46:20 -0800331 m2l_->LoadWordDisp(rs_rMIPS_SP, 0, rs_rRA);
332 m2l_->OpRegImm(kOpAdd, rs_rMIPS_SP, sp_displace_);
Mathieu Chartier0d507d12014-03-19 10:17:28 -0700333 m2l_->ClobberCallerSave();
Ian Rogersdd7624d2014-03-14 17:43:00 -0700334 ThreadOffset<4> func_offset = QUICK_ENTRYPOINT_OFFSET(4, pThrowStackOverflow);
buzbee2700f7e2014-03-07 09:46:20 -0800335 RegStorage r_tgt = m2l_->CallHelperSetup(func_offset); // Doesn't clobber LR.
Mathieu Chartier0d507d12014-03-19 10:17:28 -0700336 m2l_->CallHelper(r_tgt, func_offset, false /* MarkSafepointPC */, false /* UseLink */);
337 }
338
339 private:
340 const size_t sp_displace_;
341 };
buzbee2700f7e2014-03-07 09:46:20 -0800342 OpRegRegImm(kOpSub, new_sp, rs_rMIPS_SP, frame_sub);
Mathieu Chartier0d507d12014-03-19 10:17:28 -0700343 LIR* branch = OpCmpBranch(kCondUlt, new_sp, check_reg, nullptr);
344 AddSlowPath(new(arena_)StackOverflowSlowPath(this, branch, spill_count * 4));
345 // TODO: avoid copy for small frame sizes.
buzbee2700f7e2014-03-07 09:46:20 -0800346 OpRegCopy(rs_rMIPS_SP, new_sp); // Establish stack
Brian Carlstrom7940e442013-07-12 13:46:57 -0700347 } else {
buzbee2700f7e2014-03-07 09:46:20 -0800348 OpRegImm(kOpSub, rs_rMIPS_SP, frame_sub);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700349 }
350
351 FlushIns(ArgLocs, rl_method);
352
353 FreeTemp(rMIPS_ARG0);
354 FreeTemp(rMIPS_ARG1);
355 FreeTemp(rMIPS_ARG2);
356 FreeTemp(rMIPS_ARG3);
357}
358
Brian Carlstrom2ce745c2013-07-17 17:44:30 -0700359void MipsMir2Lir::GenExitSequence() {
Brian Carlstrom7940e442013-07-12 13:46:57 -0700360 /*
361 * In the exit path, rMIPS_RET0/rMIPS_RET1 are live - make sure they aren't
362 * allocated by the register utilities as temps.
363 */
364 LockTemp(rMIPS_RET0);
365 LockTemp(rMIPS_RET1);
366
367 NewLIR0(kPseudoMethodExit);
368 UnSpillCoreRegs();
buzbee2700f7e2014-03-07 09:46:20 -0800369 OpReg(kOpBx, rs_rRA);
Brian Carlstrom7940e442013-07-12 13:46:57 -0700370}
371
Razvan A Lupusoru3bc01742014-02-06 13:18:43 -0800372void MipsMir2Lir::GenSpecialExitSequence() {
buzbee2700f7e2014-03-07 09:46:20 -0800373 OpReg(kOpBx, rs_rRA);
Razvan A Lupusoru3bc01742014-02-06 13:18:43 -0800374}
375
Brian Carlstrom7940e442013-07-12 13:46:57 -0700376} // namespace art