Lines Matching +full:no +full:- +full:bf
29 * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS
44 * Input: r3 - destination address
45 * r4 - source address
46 * r5 - byte count
47 * Output: r11 - destination address
73 l.addi r4, r4, -4 /* Back up src and dst pointers */
74 l.addi r3, r3, -4 /* due to auto-update of 'load' */
78 l.bf .Llast1 /* Handle byte by byte if < 4 */
95 l.addi r13, r13, -1
97 l.bf .Llast /* Dec cnt, and branch if just */
104 l.addi r13, r13, -1 /* Decrement count */
106 l.bnf .Lg0 /* no, loop, more words */
109 l.or r7, r6, r0 /* If word count -> 0, then... */
116 .Llast1: /* Byte-by-byte copy */
120 l.bf .Ldone /* yes, we're done */
121 l.nop /* -- delay slot -- */
124 l.sb 4(r3), r6 /* since we pre-adjusted by 4 */
127 l.addi r5, r5, -1 /* decrement count */
129 l.bf .Ldone /* yes, we're done */
130 l.nop /* -- delay slot -- */
138 l.addi r5, r5, -1 /* decrement count */
141 l.nop /* -- delay slot -- */
144 l.nop /* -- delay slot -- */
155 l.bf .Lrlast1 /* Handle byte by byte if < 4 */
159 l.lwz r7, -4(r4) /* Preload first word */
160 l.addi r4, r4, -4 /* update pointer */
166 l.lwz r7, -4(r4) /* Load a new word */
167 l.sw -4(r3), r6 /* Store previous word */
168 l.addi r4, r4, -4
169 l.addi r3, r3, -4
173 l.addi r13, r13, -1 /* decrement count */
175 l.bf .Lrlast /* yes, deal with it */
177 l.lwz r6, -4(r4) /* Load another word */
178 l.sw -4(r3), r7 /* Store previous word */
179 l.addi r4, r4, -4
180 l.addi r3, r3, -4
182 l.addi r13, r13, -1 /* decrement count */
184 l.bnf .Lrg0 /* no, loop again more words */
187 l.or r7, r6, r0 /* If word count -> 0, then... */
191 l.sw -4(r3), r7 /* ... store last word */
192 l.addi r3, r3, -4 /* update pointer */
194 .Lrlast1: /* Byte-by-byte copy */
198 l.bf .Lrdone
202 l.lbz r6, -1(r4) /* Handle the rest, byte by */
203 l.sb -1(r3), r6 /* byte */
204 l.addi r4, r4, -1
205 l.addi r3, r3, -1
206 l.addi r5, r5, -1 /* decrement count */
208 l.bnf .Lrlast2 /* no, loop again */