48 	MUST_HAVE((in1->wlen >= (in2->wlen + shift)), ret, err);  in _nn_cmp_shift()
52 	for (i = in2->wlen; i > 0; i--) {  in _nn_cmp_shift()
83 	MUST_HAVE((out->wlen >= (in->wlen + shift)), ret, err);  in _nn_cnd_sub_shift()
90 	for (i = 0; i < in->wlen; i++) {  in _nn_cnd_sub_shift()
121 	MUST_HAVE((out->wlen >= (in->wlen + shift)), ret, err);  in _nn_submul_word_shift()
124 	for (i = 0; i < in->wlen; i++) {  in _nn_submul_word_shift()
201 	MUST_HAVE(!(b->wlen <= 0), ret, err);  in _nn_divrem_normalized()
202 	MUST_HAVE(!(a->wlen <= b->wlen), ret, err);  in _nn_divrem_normalized()
203 	MUST_HAVE(!(!((b->val[b->wlen - 1] >> (WORD_BITS - 1)) == WORD(1))), ret, err);  in _nn_divrem_normalized()
204 	MUST_HAVE(!_nn_cmp_shift(a, b, (u8)(a->wlen - b->wlen), &cmp) && (cmp < 0), ret, err);  in _nn_divrem_normalized()
208 		ret = nn_set_wlen(r, a->wlen); EG(ret, err);  in _nn_divrem_normalized()
212 	ret = nn_set_wlen(q, (u8)(r->wlen - b->wlen)); EG(ret, err);  in _nn_divrem_normalized()
219 	for (i = r->wlen; i > b->wlen; i--) {  in _nn_divrem_normalized()
220 		u8 shift = (u8)(i - b->wlen - 1);  in _nn_divrem_normalized()
270 		MUST_HAVE(!(r->val[r->wlen - 1] != WORD(0)), ret, err);  in _nn_divrem_normalized()
275 		ret = nn_set_wlen(r, (u8)(r->wlen - 1)); EG(ret, err);  in _nn_divrem_normalized()
419 	MUST_HAVE(((a->wlen + BIT_LEN_WORDS(cnt)) < NN_MAX_WORD_LEN), ret, err);  in _nn_divrem_unshifted()
422 	new_wlen = (u8)(a->wlen + (u8)BIT_LEN_WORDS(cnt));  in _nn_divrem_unshifted()
424 	b_wlen = b_norm->wlen;  in _nn_divrem_unshifted()
817 	if (p.wlen < 2) {  in nn_compute_div_coefs()
825 	p_rounded_bitlen = (bitcnt_t)(WORD_BITS * p.wlen);  in nn_compute_div_coefs()
887 	if (b->wlen == 1) {  in _nn_divrem()
902 	MUST_HAVE(!(ptr->wlen < 2), ret, err);  in _nn_divrem()
904 	ret = nn_init(&b_normalized, (u16)((ptr->wlen) * WORD_BYTES)); EG(ret, err);  in _nn_divrem()
907 	ret = wreciprocal(b_normalized.val[ptr->wlen - 1],  in _nn_divrem()
908 			  b_normalized.val[ptr->wlen - 2],  in _nn_divrem()