Lines Matching refs:r2
91 * r2 arg info
175 teq r2, #0
187 * r2 arg info
196 @ count of double-words from r2, multiply it by 8, and subtract that
198 and ip, r2, #0x0f000000 @ ip<- double-words required
199 mov r6, r2, lsr #28 @ r6<- return type
204 @ held in r2-r3. It's possible r3 will hold a pad, so check the
205 @ bit in r2. We do this by ignoring the first bit (which would
206 @ indicate a pad in r2) and shifting the second into the carry flag.
211 movs r2, r2, lsr #2
212 addcc r7, r7, #8 @ skip past 2 words, for r2 and r3
214 addcs r7, r7, #4 @ skip past 1 word, for r2
225 movs r2, r2, lsr #1
245 * and tuck them into r2/r3. If the first arg is 32-bit and the second
254 ldmia r9, {r2-r3} @ r2/r3<- argv[0]/argv[1]
305 * r2 (available)
313 mov ip, r2, lsr #28 @ ip<- return type
316 mov r2, #0 @ r2<- word count, init to zero
322 add r2, r2, #1 @ count++
328 tst r2, #1 @ odd after initial incr?
329 addne r2, #1 @ no, add 1 more to cover 64 bits
330 addeq r2, #2 @ yes, treat prev as pad, incr 2 now
334 @ We have the padded-out word count in r2. We subtract 2 from it
336 @ destined for r2/r3). Pushing them on and popping them off would be
338 subs r2, r2, #2 @ subtract 2 (for contents of r2/r3)
339 movmis r2, #0 @ if negative, peg at zero, set Z-flag
347 sub sp, sp, r2, asl #2 @ sp<- sp - r2*4
357 add r7, r7, #8 @ r7<- r7+8 (assume argv 0/1 in r2/r3)
359 @ Eat first arg or two, for the stuff that goes into r2/r3.
363 beq .Lstack_copy_loop @ 64-bit arg fills r2+r3
399 ldr r2, [r7], #4
401 str r2, [r8], #4
416 stmfd sp!, {r0, r1, r2, r3, ip, lr}
421 ldmfd sp!, {r0, r1, r2, r3, ip, pc}
423 ldmfd sp!, {r0, r1, r2, r3, ip, lr}
