Lines Matching refs:r10
45 STMFD r13!,{r10,r11,r14}
53 LDR r10,[r3] @ r10= ptr[0]
57 MOV r10,r10,LSR r14 @ r10= ptr[0]>>(32-bitsLeftInWord)
60 ORRLT r10,r10,r11,LSL r14 @ r10= Next 32 bits.
63 AND r0,r10,r14
64 LDMFD r13!,{r10,r11,PC}
68 ADDS r10,r2,r1 @ r10= bitsLeftInSegment + bits (i.e.
70 @ r10 = bitsLeftInSegment (initial)
73 MOV r5,r10 @ r5 = bitsLeftInSegment (initial)
75 BEQ look_next_segment @ r10= r12 = 0, if we branch
76 CMP r12,r10 @ If bitsLeftInWord < bitsLeftInSeg
78 LDR r10,[r3],#4 @ r10= ptr[0]
81 MOV r10,r10,LSR r14 @ r10= first bitsLeftInWord bits
82 ORRLT r10,r10,r6,LSL r12 @ r10= first bitsLeftInSeg bits+crap
84 AND r10,r10,r11 @ r10= first r5 bits
87 @ At this point, r10 contains the first r5 bits of the result
108 ORR r10,r10,r12,LSL r5 @ r10= first r5+8 bits
115 AND r0,r10,r14
116 LDMFD r13!,{r5,r6,r10,r11,PC}
124 AND r0,r10,r14
125 LDMFD r13!,{r5,r6,r10,r11,PC}
130 LDMFD r13!,{r5,r6,r10,r11,PC}
133 @ We had overrun when we started, so we need to skip -r10 bits.
151 ADDS r14,r14,r10 @ r14= length in bits-bits to skip
152 MOVLE r10,r14
154 RSB r10,r10,#0 @ r10= bits to skip
155 ADD r6,r10,r10,LSR #3 @ r6 = pointer to data
156 MOV r10,#0
174 STMFD r13!,{r10,r14}
180 LDR r10,[r14,#8] @ r10= head->length
183 ADD r1,r1,r10 @ r1 = count += head->length
188 LDMIA r14,{r3,r10,r12} @ r3 = buffer
189 @ r10= begin
192 ADD r3,r3,r10 @ r3 = Pointer to start (byte)
193 AND r10,r3,#3 @ r10= bytes to backtrk to word align
194 MOV r10,r10,LSL #3 @ r10= bits to backtrk to word align
195 RSB r10,r10,#32 @ r10= bits left in word
196 ADDS r10,r10,r2 @ r10= bits left in word after skip
197 ADDLE r10,r10,#32
202 STMIA r0,{r2,r3,r10}
204 LDMFD r13!,{r10,PC}
210 LDMFD r13!,{r10,PC}
235 STMFD r13!,{r10,r11,r14}
243 LDR r10,[r3] @ r10= ptr[0]
248 MOV r10,r10,LSR r14 @ r10= ptr[0]>>(32-bitsLeftInWord)
251 ORRLT r10,r10,r11,LSL r14 @ r10= Next 32 bits.
255 AND r0,r10,r14
256 LDMFD r13!,{r10,r11,PC}
260 ADDS r10,r2,r1 @ r10= bitsLeftInSegment + bits (i.e.
262 @ r10 = bitsLeftInSegment (initial)
265 MOV r5,r10 @ r5 = bitsLeftInSegment (initial)
267 BEQ read_next_segment @ r10= r12 = 0, if we branch
268 CMP r12,r10 @ If bitsLeftInWord < bitsLeftInSeg
270 LDR r10,[r3],#4 @ r10= ptr[0]
273 MOV r10,r10,LSR r14 @ r10= first bitsLeftInWord bits
274 ORRLT r10,r10,r6,LSL r12 @ r10= first bitsLeftInSeg bits+crap
276 AND r10,r10,r11 @ r10= first r5 bits
279 @ At this point, r10 contains the first r5 bits of the result
304 ORR r10,r10,r12,LSL r5 @ r10= first r5+8 bits
333 AND r0,r10,r12
334 LDMFD r13!,{r5,r6,r10,r11,PC}
370 LDMFD r13!,{r5,r6,r10,r11,PC}
373 @ We had overrun when we started, so we need to skip -r10 bits.
391 ADDS r14,r14,r10 @ r14= length in bits-bits to skip
392 MOVLE r10,r14
394 RSB r10,r10,#0 @ r10= bits to skip
395 ADD r6,r10,r10,LSR #3 @ r6 = pointer to data
396 MOV r10,#0