Lines Matching +full:0 +full:xb
39 * will contain the comparison result, as 0x00000000 (value is in br_i32_decode_mod()
40 * equal to the modulus), 0x00000001 (value is greater than the in br_i32_decode_mod()
41 * modulus), or 0xFFFFFFFF (value is lower than the modulus). in br_i32_decode_mod()
43 mlen = (m[0] + 7) >> 3; in br_i32_decode_mod()
44 r = 0; in br_i32_decode_mod()
45 for (u = (mlen > len) ? mlen : len; u > 0; u --) { in br_i32_decode_mod()
46 uint32_t mb, xb; in br_i32_decode_mod() local
50 mb = 0; in br_i32_decode_mod()
52 mb = (m[1 + (v >> 2)] >> ((v & 3) << 3)) & 0xFF; in br_i32_decode_mod()
55 xb = 0; in br_i32_decode_mod()
57 xb = buf[len - u]; in br_i32_decode_mod()
59 r = MUX(EQ(r, 0), (uint32_t)CMP(xb, mb), r); in br_i32_decode_mod()
63 * Only r == 0xFFFFFFFF is acceptable. We want to set r to 0xFF if in br_i32_decode_mod()
64 * the value fits, 0x00 otherwise. in br_i32_decode_mod()
67 br_i32_zero(x, m[0]); in br_i32_decode_mod()
69 while (u > 0) { in br_i32_decode_mod()
70 uint32_t xb; in br_i32_decode_mod() local
72 xb = buf[len - u] & r; in br_i32_decode_mod()
74 x[1 + (u >> 2)] |= xb << ((u & 3) << 3); in br_i32_decode_mod()