Lines Matching refs:maj
341 int i, maj, min, chunks; in b2n_lshift() local
348 maj = s >> CHUNK_SHIFTS; in b2n_lshift()
354 if (b2n_resize(d, chunks + maj + add)) in b2n_lshift()
356 memmove(d->limp + maj, n->limp, CHUNK_BYTES * chunks); in b2n_lshift()
358 if (maj) in b2n_lshift()
359 bzero(d->limp, CHUNK_BYTES * maj); in b2n_lshift()
368 for (i = d->chunks - 2; i >= maj; i--) { in b2n_lshift()
376 d->bits = bits + (maj << CHUNK_SHIFTS) + min; in b2n_lshift()
384 int maj, min, size = n->chunks, newsize; in b2n_rshift() local
390 maj = s >> CHUNK_SHIFTS; in b2n_rshift()
392 newsize = size - maj; in b2n_rshift()
394 if (size < maj) in b2n_rshift()
408 memmove(d->limp, tmp->limp + maj + (min ? 1 : 0), in b2n_rshift()
413 d->bits = tmp->bits - ((maj + (min ? 1 : 0)) << CHUNK_SHIFTS); in b2n_rshift()
474 int i, j, maj, min, bits, chunk; in b2n_square() local
477 maj = b2n_sigbit(n); in b2n_square()
478 min = maj & CHUNK_MASK; in b2n_square()
479 maj = (maj + CHUNK_MASK) >> CHUNK_SHIFTS; in b2n_square()
483 2 * maj + ((CHUNK_MASK + 2 * min) >> CHUNK_SHIFTS))) { in b2n_square()
490 for (i = 0; i < maj; i++) in b2n_square()