blob: b0b6ba877c883eb2dee9d18075912433940eee56 [file] [log] [blame]
buzbeee88dfbf2012-03-05 11:19:57 -08001/*
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/*
buzbeea7678db2012-03-05 15:35:46 -080018 * This file contains codegen for the X86 ISA and is intended to be
buzbeee88dfbf2012-03-05 11:19:57 -080019 * includes by:
20 *
21 * Codegen-$(TARGET_ARCH_VARIANT).c
22 *
23 */
24
25namespace art {
26
buzbee16da88c2012-03-20 10:38:17 -070027void genSpecialCase(CompilationUnit* cUnit, BasicBlock* bb, MIR* mir,
28 SpecialCaseHandler specialCase)
29{
Bill Buzbeea114add2012-05-03 15:00:40 -070030 // TODO
buzbee16da88c2012-03-20 10:38:17 -070031}
32
buzbeee88dfbf2012-03-05 11:19:57 -080033/*
Ian Rogersb5d09b22012-03-06 22:14:17 -080034 * Perform register memory operation.
35 */
36LIR* genRegMemCheck(CompilationUnit* cUnit, ConditionCode cCode,
buzbee408ad162012-06-06 16:45:18 -070037 int reg1, int base, int offset, ThrowKind kind)
Ian Rogersb5d09b22012-03-06 22:14:17 -080038{
Bill Buzbeea114add2012-05-03 15:00:40 -070039 LIR* tgt = rawLIR(cUnit, 0, kPseudoThrowTarget, kind,
buzbee408ad162012-06-06 16:45:18 -070040 cUnit->currentDalvikOffset, reg1, base, offset);
Bill Buzbeea114add2012-05-03 15:00:40 -070041 opRegMem(cUnit, kOpCmp, reg1, base, offset);
42 LIR* branch = opCondBranch(cUnit, cCode, tgt);
43 // Remember branch target - will process later
44 oatInsertGrowableList(cUnit, &cUnit->throwLaunchpads, (intptr_t)tgt);
45 return branch;
Ian Rogersb5d09b22012-03-06 22:14:17 -080046}
47
48/*
Ian Rogers55bd45f2012-04-04 17:31:20 -070049 * The sparse table in the literal pool is an array of <key,displacement>
50 * pairs.
buzbeee88dfbf2012-03-05 11:19:57 -080051 */
Ian Rogers55bd45f2012-04-04 17:31:20 -070052BasicBlock *findBlock(CompilationUnit* cUnit, unsigned int codeOffset,
53 bool split, bool create, BasicBlock** immedPredBlockP);
buzbee408ad162012-06-06 16:45:18 -070054void genSparseSwitch(CompilationUnit* cUnit, uint32_t tableOffset,
buzbeea1da8a52012-07-09 14:00:21 -070055 RegLocation rlSrc)
Bill Buzbeea114add2012-05-03 15:00:40 -070056{
buzbee408ad162012-06-06 16:45:18 -070057 const u2* table = cUnit->insns + cUnit->currentDalvikOffset + tableOffset;
Ian Rogers55bd45f2012-04-04 17:31:20 -070058 if (cUnit->printMe) {
59 dumpSparseSwitchTable(table);
60 }
61 int entries = table[1];
62 int* keys = (int*)&table[2];
63 int* targets = &keys[entries];
64 rlSrc = loadValue(cUnit, rlSrc, kCoreReg);
65 for (int i = 0; i < entries; i++) {
66 int key = keys[i];
buzbee408ad162012-06-06 16:45:18 -070067 BasicBlock* case_block = findBlock(cUnit,
68 cUnit->currentDalvikOffset + targets[i],
Ian Rogers55bd45f2012-04-04 17:31:20 -070069 false, false, NULL);
buzbeea1da8a52012-07-09 14:00:21 -070070 LIR* labelList = cUnit->blockLabelList;
Bill Buzbeea114add2012-05-03 15:00:40 -070071 opCmpImmBranch(cUnit, kCondEq, rlSrc.lowReg, key,
72 &labelList[case_block->id]);
Ian Rogers55bd45f2012-04-04 17:31:20 -070073 }
buzbeee88dfbf2012-03-05 11:19:57 -080074}
75
76/*
77 * Code pattern will look something like:
78 *
Ian Rogers55bd45f2012-04-04 17:31:20 -070079 * mov rVal, ..
80 * call 0
81 * pop rStartOfMethod
82 * sub rStartOfMethod, ..
83 * mov rKeyReg, rVal
84 * sub rKeyReg, lowKey
85 * cmp rKeyReg, size-1 ; bound check
86 * ja done
87 * mov rDisp, [rStartOfMethod + rKeyReg * 4 + tableOffset]
88 * add rStartOfMethod, rDisp
89 * jmp rStartOfMethod
buzbeee88dfbf2012-03-05 11:19:57 -080090 * done:
91 */
buzbee408ad162012-06-06 16:45:18 -070092void genPackedSwitch(CompilationUnit* cUnit, uint32_t tableOffset,
93 RegLocation rlSrc)
Bill Buzbeea114add2012-05-03 15:00:40 -070094{
buzbee408ad162012-06-06 16:45:18 -070095 const u2* table = cUnit->insns + cUnit->currentDalvikOffset + tableOffset;
Ian Rogers7caad772012-03-30 01:07:54 -070096 if (cUnit->printMe) {
97 dumpPackedSwitchTable(table);
98 }
99 // Add the table to the list - we'll process it later
100 SwitchTable *tabRec = (SwitchTable *)oatNew(cUnit, sizeof(SwitchTable),
101 true, kAllocData);
102 tabRec->table = table;
buzbee408ad162012-06-06 16:45:18 -0700103 tabRec->vaddr = cUnit->currentDalvikOffset;
Ian Rogers7caad772012-03-30 01:07:54 -0700104 int size = table[1];
105 tabRec->targets = (LIR* *)oatNew(cUnit, size * sizeof(LIR*), true,
106 kAllocLIR);
107 oatInsertGrowableList(cUnit, &cUnit->switchTables, (intptr_t)tabRec);
buzbeee88dfbf2012-03-05 11:19:57 -0800108
Ian Rogers7caad772012-03-30 01:07:54 -0700109 // Get the switch value
110 rlSrc = loadValue(cUnit, rlSrc, kCoreReg);
111 int startOfMethodReg = oatAllocTemp(cUnit);
112 // Materialize a pointer to the switch table
113 //newLIR0(cUnit, kX86Bkpt);
114 newLIR1(cUnit, kX86StartOfMethod, startOfMethodReg);
115 int lowKey = s4FromSwitchData(&table[2]);
116 int keyReg;
117 // Remove the bias, if necessary
118 if (lowKey == 0) {
119 keyReg = rlSrc.lowReg;
120 } else {
121 keyReg = oatAllocTemp(cUnit);
122 opRegRegImm(cUnit, kOpSub, keyReg, rlSrc.lowReg, lowKey);
123 }
124 // Bounds check - if < 0 or >= size continue following switch
125 opRegImm(cUnit, kOpCmp, keyReg, size-1);
126 LIR* branchOver = opCondBranch(cUnit, kCondHi, NULL);
buzbeee88dfbf2012-03-05 11:19:57 -0800127
Ian Rogers7caad772012-03-30 01:07:54 -0700128 // Load the displacement from the switch table
129 int dispReg = oatAllocTemp(cUnit);
Bill Buzbeea114add2012-05-03 15:00:40 -0700130 newLIR5(cUnit, kX86PcRelLoadRA, dispReg, startOfMethodReg, keyReg, 2,
131 (intptr_t)tabRec);
Ian Rogers7caad772012-03-30 01:07:54 -0700132 // Add displacement to start of method
133 opRegReg(cUnit, kOpAdd, startOfMethodReg, dispReg);
134 // ..and go!
135 LIR* switchBranch = newLIR1(cUnit, kX86JmpR, startOfMethodReg);
136 tabRec->anchor = switchBranch;
buzbeee88dfbf2012-03-05 11:19:57 -0800137
Ian Rogers7caad772012-03-30 01:07:54 -0700138 /* branchOver target here */
139 LIR* target = newLIR0(cUnit, kPseudoTargetLabel);
140 branchOver->target = (LIR*)target;
buzbeee88dfbf2012-03-05 11:19:57 -0800141}
142
Bill Buzbeea114add2012-05-03 15:00:40 -0700143void callRuntimeHelperRegReg(CompilationUnit* cUnit, int helperOffset,
144 int arg0, int arg1);
buzbeee88dfbf2012-03-05 11:19:57 -0800145/*
146 * Array data table format:
147 * ushort ident = 0x0300 magic value
148 * ushort width width of each element in the table
149 * uint size number of elements in the table
150 * ubyte data[size*width] table of data values (may contain a single-byte
151 * padding at the end)
152 *
153 * Total size is 4+(width * size + 1)/2 16-bit code units.
154 */
buzbee408ad162012-06-06 16:45:18 -0700155void genFillArrayData(CompilationUnit* cUnit, uint32_t tableOffset,
156 RegLocation rlSrc)
buzbeee88dfbf2012-03-05 11:19:57 -0800157{
buzbee408ad162012-06-06 16:45:18 -0700158 const u2* table = cUnit->insns + cUnit->currentDalvikOffset + tableOffset;
Ian Rogers7caad772012-03-30 01:07:54 -0700159 // Add the table to the list - we'll process it later
Bill Buzbeea114add2012-05-03 15:00:40 -0700160 FillArrayData *tabRec = (FillArrayData *)oatNew(cUnit, sizeof(FillArrayData),
161 true, kAllocData);
Ian Rogers7caad772012-03-30 01:07:54 -0700162 tabRec->table = table;
buzbee408ad162012-06-06 16:45:18 -0700163 tabRec->vaddr = cUnit->currentDalvikOffset;
Ian Rogers7caad772012-03-30 01:07:54 -0700164 u2 width = tabRec->table[1];
165 u4 size = tabRec->table[2] | (((u4)tabRec->table[3]) << 16);
166 tabRec->size = (size * width) + 8;
buzbeee88dfbf2012-03-05 11:19:57 -0800167
Ian Rogers7caad772012-03-30 01:07:54 -0700168 oatInsertGrowableList(cUnit, &cUnit->fillArrayData, (intptr_t)tabRec);
buzbeee88dfbf2012-03-05 11:19:57 -0800169
Ian Rogers7caad772012-03-30 01:07:54 -0700170 // Making a call - use explicit registers
171 oatFlushAllRegs(cUnit); /* Everything to home location */
172 loadValueDirectFixed(cUnit, rlSrc, rARG0);
173 // Materialize a pointer to the fill data image
174 newLIR1(cUnit, kX86StartOfMethod, rARG2);
175 newLIR2(cUnit, kX86PcRelAdr, rARG1, (intptr_t)tabRec);
176 newLIR2(cUnit, kX86Add32RR, rARG1, rARG2);
Bill Buzbeea114add2012-05-03 15:00:40 -0700177 callRuntimeHelperRegReg(cUnit,
178 ENTRYPOINT_OFFSET(pHandleFillArrayDataFromCode),
179 rARG0, rARG1);
buzbeee88dfbf2012-03-05 11:19:57 -0800180}
181
182void genNegFloat(CompilationUnit *cUnit, RegLocation rlDest, RegLocation rlSrc)
183{
Bill Buzbeea114add2012-05-03 15:00:40 -0700184 UNIMPLEMENTED(WARNING) << "genNegFloat "
185 << PrettyMethod(cUnit->method_idx, *cUnit->dex_file);
186 newLIR0(cUnit, kX86Bkpt);
buzbeea7678db2012-03-05 15:35:46 -0800187#if 0
Bill Buzbeea114add2012-05-03 15:00:40 -0700188 RegLocation rlResult;
189 rlSrc = loadValue(cUnit, rlSrc, kCoreReg);
190 rlResult = oatEvalLoc(cUnit, rlDest, kCoreReg, true);
191 opRegRegImm(cUnit, kOpAdd, rlResult.lowReg, rlSrc.lowReg, 0x80000000);
192 storeValue(cUnit, rlDest, rlResult);
buzbeee88dfbf2012-03-05 11:19:57 -0800193#endif
194}
195
196void genNegDouble(CompilationUnit *cUnit, RegLocation rlDest, RegLocation rlSrc)
197{
Bill Buzbeea114add2012-05-03 15:00:40 -0700198 UNIMPLEMENTED(WARNING) << "genNegDouble"
199 << PrettyMethod(cUnit->method_idx, *cUnit->dex_file);
200 newLIR0(cUnit, kX86Bkpt);
buzbeee88dfbf2012-03-05 11:19:57 -0800201#if 0
Bill Buzbeea114add2012-05-03 15:00:40 -0700202 RegLocation rlResult;
203 rlSrc = loadValueWide(cUnit, rlSrc, kCoreReg);
204 rlResult = oatEvalLoc(cUnit, rlDest, kCoreReg, true);
205 opRegRegImm(cUnit, kOpAdd, rlResult.highReg, rlSrc.highReg, 0x80000000);
206 opRegCopy(cUnit, rlResult.lowReg, rlSrc.lowReg);
207 storeValueWide(cUnit, rlDest, rlResult);
buzbeee88dfbf2012-03-05 11:19:57 -0800208#endif
209}
210
buzbee408ad162012-06-06 16:45:18 -0700211LIR* genNullCheck(CompilationUnit* cUnit, int sReg, int mReg, int optFlags);
Ian Rogers7caad772012-03-30 01:07:54 -0700212void callRuntimeHelperReg(CompilationUnit* cUnit, int helperOffset, int arg0);
213
buzbeee88dfbf2012-03-05 11:19:57 -0800214/*
215 * TODO: implement fast path to short-circuit thin-lock case
216 */
buzbee408ad162012-06-06 16:45:18 -0700217void genMonitorEnter(CompilationUnit* cUnit, int optFlags, RegLocation rlSrc)
buzbeee88dfbf2012-03-05 11:19:57 -0800218{
Bill Buzbeea114add2012-05-03 15:00:40 -0700219 oatFlushAllRegs(cUnit);
220 loadValueDirectFixed(cUnit, rlSrc, rARG0); // Get obj
221 oatLockCallTemps(cUnit); // Prepare for explicit register usage
buzbee408ad162012-06-06 16:45:18 -0700222 genNullCheck(cUnit, rlSrc.sRegLow, rARG0, optFlags);
Bill Buzbeea114add2012-05-03 15:00:40 -0700223 // Go expensive route - artLockObjectFromCode(self, obj);
224 callRuntimeHelperReg(cUnit, ENTRYPOINT_OFFSET(pLockObjectFromCode), rARG0);
buzbeee88dfbf2012-03-05 11:19:57 -0800225}
226
227/*
228 * TODO: implement fast path to short-circuit thin-lock case
229 */
buzbee408ad162012-06-06 16:45:18 -0700230void genMonitorExit(CompilationUnit* cUnit, int optFlags, RegLocation rlSrc)
buzbeee88dfbf2012-03-05 11:19:57 -0800231{
Bill Buzbeea114add2012-05-03 15:00:40 -0700232 oatFlushAllRegs(cUnit);
233 loadValueDirectFixed(cUnit, rlSrc, rARG0); // Get obj
234 oatLockCallTemps(cUnit); // Prepare for explicit register usage
buzbee408ad162012-06-06 16:45:18 -0700235 genNullCheck(cUnit, rlSrc.sRegLow, rARG0, optFlags);
Bill Buzbeea114add2012-05-03 15:00:40 -0700236 // Go expensive route - UnlockObjectFromCode(obj);
237 callRuntimeHelperReg(cUnit, ENTRYPOINT_OFFSET(pUnlockObjectFromCode), rARG0);
buzbeee88dfbf2012-03-05 11:19:57 -0800238}
239
240/*
241 * Compare two 64-bit values
242 * x = y return 0
243 * x < y return -1
244 * x > y return 1
245 *
246 * slt t0, x.hi, y.hi; # (x.hi < y.hi) ? 1:0
247 * sgt t1, x.hi, y.hi; # (y.hi > x.hi) ? 1:0
248 * subu res, t0, t1 # res = -1:1:0 for [ < > = ]
249 * bnez res, finish
250 * sltu t0, x.lo, y.lo
251 * sgtu r1, x.lo, y.lo
252 * subu res, t0, t1
253 * finish:
254 *
255 */
buzbee408ad162012-06-06 16:45:18 -0700256void genCmpLong(CompilationUnit* cUnit, RegLocation rlDest,
buzbeee88dfbf2012-03-05 11:19:57 -0800257 RegLocation rlSrc1, RegLocation rlSrc2)
258{
Bill Buzbeea114add2012-05-03 15:00:40 -0700259 oatFlushAllRegs(cUnit);
260 oatLockCallTemps(cUnit); // Prepare for explicit register usage
261 loadValueDirectWideFixed(cUnit, rlSrc1, r0, r1);
jeffhao644d5312012-05-03 19:04:49 -0700262 loadValueDirectWideFixed(cUnit, rlSrc2, r2, r3);
263 // Compute (r1:r0) = (r1:r0) - (r3:r2)
Bill Buzbeea114add2012-05-03 15:00:40 -0700264 opRegReg(cUnit, kOpSub, r0, r2); // r0 = r0 - r2
265 opRegReg(cUnit, kOpSbc, r1, r3); // r1 = r1 - r3 - CF
jeffhao1395b1e2012-06-13 18:05:13 -0700266 newLIR2(cUnit, kX86Set8R, r2, kX86CondL); // r2 = (r1:r0) < (r3:r2) ? 1 : 0
267 newLIR2(cUnit, kX86Movzx8RR, r2, r2);
268 opReg(cUnit, kOpNeg, r2); // r2 = -r2
Bill Buzbeea114add2012-05-03 15:00:40 -0700269 opRegReg(cUnit, kOpOr, r0, r1); // r0 = high | low - sets ZF
jeffhao644d5312012-05-03 19:04:49 -0700270 newLIR2(cUnit, kX86Set8R, r0, kX86CondNz); // r0 = (r1:r0) != (r3:r2) ? 1 : 0
Bill Buzbeea114add2012-05-03 15:00:40 -0700271 newLIR2(cUnit, kX86Movzx8RR, r0, r0);
jeffhao1395b1e2012-06-13 18:05:13 -0700272 opRegReg(cUnit, kOpOr, r0, r2); // r0 = r0 | r2
Bill Buzbeea114add2012-05-03 15:00:40 -0700273 RegLocation rlResult = LOC_C_RETURN;
274 storeValue(cUnit, rlDest, rlResult);
buzbeee88dfbf2012-03-05 11:19:57 -0800275}
276
Ian Rogersb5d09b22012-03-06 22:14:17 -0800277X86ConditionCode oatX86ConditionEncoding(ConditionCode cond) {
Elliott Hughesb25c3f62012-03-26 16:35:06 -0700278 switch (cond) {
Ian Rogersb5d09b22012-03-06 22:14:17 -0800279 case kCondEq: return kX86CondEq;
280 case kCondNe: return kX86CondNe;
281 case kCondCs: return kX86CondC;
282 case kCondCc: return kX86CondNc;
283 case kCondMi: return kX86CondS;
284 case kCondPl: return kX86CondNs;
285 case kCondVs: return kX86CondO;
286 case kCondVc: return kX86CondNo;
287 case kCondHi: return kX86CondA;
288 case kCondLs: return kX86CondBe;
289 case kCondGe: return kX86CondGe;
290 case kCondLt: return kX86CondL;
291 case kCondGt: return kX86CondG;
292 case kCondLe: return kX86CondLe;
293 case kCondAl:
294 case kCondNv: LOG(FATAL) << "Should not reach here";
295 }
296 return kX86CondO;
297}
298
Bill Buzbeea114add2012-05-03 15:00:40 -0700299LIR* opCmpBranch(CompilationUnit* cUnit, ConditionCode cond, int src1,
300 int src2, LIR* target)
buzbeee88dfbf2012-03-05 11:19:57 -0800301{
Ian Rogersb5d09b22012-03-06 22:14:17 -0800302 newLIR2(cUnit, kX86Cmp32RR, src1, src2);
303 X86ConditionCode cc = oatX86ConditionEncoding(cond);
Bill Buzbeea114add2012-05-03 15:00:40 -0700304 LIR* branch = newLIR2(cUnit, kX86Jcc8, 0 /* lir operand for Jcc offset */ ,
305 cc);
Ian Rogersb5d09b22012-03-06 22:14:17 -0800306 branch->target = target;
307 return branch;
buzbeee88dfbf2012-03-05 11:19:57 -0800308}
309
310LIR* opCmpImmBranch(CompilationUnit* cUnit, ConditionCode cond, int reg,
311 int checkValue, LIR* target)
312{
Ian Rogers7caad772012-03-30 01:07:54 -0700313 if (false && (checkValue == 0) && (cond == kCondEq || cond == kCondNe)) {
314 // TODO: when checkValue == 0 and reg is rCX, use the jcxz/nz opcode
315 // newLIR2(cUnit, kX86Test32RR, reg, reg);
316 } else {
317 newLIR2(cUnit, kX86Cmp32RI, reg, checkValue);
318 }
Ian Rogersb5d09b22012-03-06 22:14:17 -0800319 X86ConditionCode cc = oatX86ConditionEncoding(cond);
Ian Rogersb41b33b2012-03-20 14:22:54 -0700320 LIR* branch = newLIR2(cUnit, kX86Jcc8, 0 /* lir operand for Jcc offset */ , cc);
Ian Rogersb5d09b22012-03-06 22:14:17 -0800321 branch->target = target;
322 return branch;
buzbeee88dfbf2012-03-05 11:19:57 -0800323}
324
325LIR* opRegCopyNoInsert(CompilationUnit *cUnit, int rDest, int rSrc)
326{
Bill Buzbeea114add2012-05-03 15:00:40 -0700327 if (FPREG(rDest) || FPREG(rSrc))
328 return fpRegCopy(cUnit, rDest, rSrc);
329 LIR* res = rawLIR(cUnit, cUnit->currentDalvikOffset, kX86Mov32RR,
330 rDest, rSrc);
331 if (rDest == rSrc) {
332 res->flags.isNop = true;
333 }
334 return res;
buzbeee88dfbf2012-03-05 11:19:57 -0800335}
336
337LIR* opRegCopy(CompilationUnit *cUnit, int rDest, int rSrc)
338{
Bill Buzbeea114add2012-05-03 15:00:40 -0700339 LIR *res = opRegCopyNoInsert(cUnit, rDest, rSrc);
340 oatAppendLIR(cUnit, res);
341 return res;
buzbeee88dfbf2012-03-05 11:19:57 -0800342}
343
344void opRegCopyWide(CompilationUnit *cUnit, int destLo, int destHi,
Bill Buzbeea114add2012-05-03 15:00:40 -0700345 int srcLo, int srcHi)
346{
Ian Rogersf7d9ad32012-03-13 18:45:39 -0700347 bool destFP = FPREG(destLo) && FPREG(destHi);
348 bool srcFP = FPREG(srcLo) && FPREG(srcHi);
349 assert(FPREG(srcLo) == FPREG(srcHi));
350 assert(FPREG(destLo) == FPREG(destHi));
Ian Rogersf7d9ad32012-03-13 18:45:39 -0700351 if (destFP) {
352 if (srcFP) {
353 opRegCopy(cUnit, S2D(destLo, destHi), S2D(srcLo, srcHi));
buzbeee88dfbf2012-03-05 11:19:57 -0800354 } else {
Ian Rogersf7d9ad32012-03-13 18:45:39 -0700355 UNIMPLEMENTED(WARNING);
Ian Rogers7caad772012-03-30 01:07:54 -0700356 newLIR0(cUnit, kX86Bkpt);
buzbeee88dfbf2012-03-05 11:19:57 -0800357 }
Ian Rogersf7d9ad32012-03-13 18:45:39 -0700358 } else {
359 if (srcFP) {
360 UNIMPLEMENTED(WARNING);
Ian Rogers7caad772012-03-30 01:07:54 -0700361 newLIR0(cUnit, kX86Bkpt);
Ian Rogersf7d9ad32012-03-13 18:45:39 -0700362 } else {
363 // Handle overlap
364 if (srcHi == destLo) {
buzbeee88dfbf2012-03-05 11:19:57 -0800365 opRegCopy(cUnit, destHi, srcHi);
366 opRegCopy(cUnit, destLo, srcLo);
Ian Rogersf7d9ad32012-03-13 18:45:39 -0700367 } else {
buzbeee88dfbf2012-03-05 11:19:57 -0800368 opRegCopy(cUnit, destLo, srcLo);
369 opRegCopy(cUnit, destHi, srcHi);
Ian Rogersf7d9ad32012-03-13 18:45:39 -0700370 }
buzbeee88dfbf2012-03-05 11:19:57 -0800371 }
Ian Rogersf7d9ad32012-03-13 18:45:39 -0700372 }
buzbeee88dfbf2012-03-05 11:19:57 -0800373}
374
375} // namespace art