Lines Matching refs:k
120 uint32_t k, c; in BIT_LENGTH() local
122 k = NEQ(x, 0); in BIT_LENGTH()
123 c = GT(x, 0xFFFF); x = MUX(c, x >> 16, x); k += c << 4; in BIT_LENGTH()
124 c = GT(x, 0x00FF); x = MUX(c, x >> 8, x); k += c << 3; in BIT_LENGTH()
125 c = GT(x, 0x000F); x = MUX(c, x >> 4, x); k += c << 2; in BIT_LENGTH()
126 c = GT(x, 0x0003); x = MUX(c, x >> 2, x); k += c << 1; in BIT_LENGTH()
127 k += GT(x, 0x0001); in BIT_LENGTH()
128 return k; in BIT_LENGTH()
262 size_t k; in br_i32_encode() local
270 k = (x[0] + 7) >> 3; in br_i32_encode()
271 while (len > k) { in br_i32_encode()
281 k = (len + 3) >> 2; in br_i32_encode()
284 *buf ++ = x[k] >> 16; in br_i32_encode()
287 *buf ++ = x[k] >> 8; in br_i32_encode()
290 *buf ++ = x[k]; in br_i32_encode()
291 k --; in br_i32_encode()
297 while (k > 0) { in br_i32_encode()
298 br_enc32be(buf, x[k]); in br_i32_encode()
299 k --; in br_i32_encode()
401 int k; in br_divrem() local
406 for (k = 31; k > 0; k --) { in br_divrem()
410 j = 32 - k; in br_divrem()
411 w = (hi << j) | (lo >> k); in br_divrem()
412 ctl = GE(w, d) | (hi >> k); in br_divrem()
414 lo2 = lo - (d << k); in br_divrem()
417 q |= ctl << k; in br_divrem()