Lines Matching +full:0 +full:x11
14 * (x8, x9) to the stack and swap them out with (x10, x11). This adds one
24 * similarly for row 'd'. (brot, drot) start out as (0, 0) but we make it such
38 X9_X11 .req r9 // shared by x9 and x11
109 // save (x8, x9); restore (x10, x11)
110 __strd X8_X10, X9_X11, sp, 0
113 // quarterrounds: (x2, x6, x10, x14) and (x3, x7, x11, x15)
121 // quarterrounds: (x0, x5, x10, x15) and (x1, x6, x11, x12)
124 // save (x10, x11); restore (x8, x9)
126 __ldrd X8_X10, X9_X11, sp, 0
133 .set brot, 0
134 .set drot, 0
143 // Stack: unused0-unused1 x10-x11 x0-x15 OUT IN LEN
150 // Stack: x10-x11 orig_x0-orig_x15 OUT IN LEN
175 // Stack: x8-x9 x12-x15 x10-x11 orig_x0-orig_x15 OUT IN LEN
210 pop {r0-r7} // (x8-x9,x12-x15,x10-x11)
216 add r7, r7, r11 // x11
222 eor r7, r7, r11 // x11
262 ldmia r14!, {r0-r11} // load x0-x11
263 __strd r10, r11, sp, 8 // store x10-x11 before state
276 // Stack: ks0-ks15 x8-x9 x12-x15 x10-x11 orig_x0-orig_x15 OUT IN LEN
302 ldm r8, {r0-r7} // (x8-x9,x12-x15,x10-x11)
308 add r7, r7, r11 // x11
373 cmp r2, #0 // len == 0?
382 // Also store an extra copy of x10-x11 just before the state.
402 0: add sp, #76
406 b 0b
418 ldmia r14!, {r0-r11} // load x0-x11
419 push {r10-r11} // store x10-x11 to stack
426 // Skip over (unused0-unused1, x10-x11)
427 0: add sp, #16
442 b 0b