Lines Matching refs:and
20 * A bunch of instructions got moved and temp registers were changed
22 * branches, and to provide longer code sequences to enable better scheduling.
53 and a0, 7, t3 # E : find dest misalignment
56 /* Are source and destination co-aligned? */
65 and t4, 7, t4 # E : misalignment between the two
67 and a3, 7, t6 # E : number of tail bytes
84 /* Create the 1st output word and detect 0's in the 1st input word. */
104 * in clear_user.S and copy_user.S.
105 * Presumably, since (a0) and (a1) do not overlap (by C definition)
136 and t8, t12, t12 # E :
138 /* We're doing a partial word store and so need to combine
139 our source and original destination words. */
162 /* The source and destination are not co-aligned. Align the destination
163 and cope. We have to be very careful about not reading too much and
203 of and we can set up to enter the main loop. */
218 iteration out into the head and half into the tail, but it does
258 word to write out, and if it resides in the upper half, we
259 have one full and one partial word left to write out.
290 and t6, t8, t12 # E :
323 and a0, 7, t4 # E : find dest misalignment
324 and a1, 7, t5 # E : find src misalignment
327 /* Conditionally load the first destination word and a bytemask
365 the source. We need to isolate the valid source data and mask
372 and t6, t8, t12 # E :
380 or t0, t1, t0 # E : and put it there
387 and t12, 0xf0, t3 # E : binary search for the address of the
391 and t12, 0xcc, t2 # E : last byte written
392 and t12, 0xaa, t1 # E :