52 	for (i = A->wlen; i < NN_MAX_WORD_LEN; i++) {  in __nn_is_wlen_consistent()
70 	MUST_HAVE((A->wlen <= NN_MAX_WORD_LEN), ret, err);  in nn_check_initialized()
91 	A->wlen = (u8)BYTE_LEN_WORDS(len);  in nn_init()
119 		A->wlen = 0;  in nn_uninit()
152 	A->wlen = 1;  in nn_set_word_value()
185 	MUST_HAVE((in1->wlen <= NN_MAX_WORD_LEN), ret, err);  in nn_cnd_swap()
186 	MUST_HAVE((in2->wlen <= NN_MAX_WORD_LEN), ret, err);  in nn_cnd_swap()
188 	len = (in1->wlen >= in2->wlen) ? in1->wlen : in2->wlen;  in nn_cnd_swap()
205 	t = (word_t)(((in1->wlen ^ in2->wlen) & mask) ^ r_mask);  in nn_cnd_swap()
206 	in1->wlen ^= (u8)(t ^ r_mask);  in nn_cnd_swap()
207 	in2->wlen ^= (u8)(t ^ r_mask);  in nn_cnd_swap()
228 	MUST_HAVE((A->wlen <= NN_MAX_WORD_LEN), ret, err);  in nn_set_wlen()
235 	A->wlen = new_wlen;  in nn_set_wlen()
253 	MUST_HAVE((A->wlen <= NN_MAX_WORD_LEN), ret, err);  in nn_iszero()
258 		int mask = ((i < A->wlen) ? 1 : 0);  in nn_iszero()
280 	MUST_HAVE(!(A->wlen > NN_MAX_WORD_LEN), ret, err);  in nn_isone()
286 		int mask = ((i < A->wlen) ? 1 : 0);  in nn_isone()
308 	*isodd = (A->wlen != 0) && (A->val[0] & 1);  in nn_isodd()
331 	if (in->wlen == 0) {  in nn_cmp_word()
341 	for (i = (u8)(in->wlen - 1); i > 0; i--) {  in nn_cmp_word()
378 	cmp_len = (A->wlen >= B->wlen) ? A->wlen : B->wlen;  in nn_cmp()
412 	dst_nn->wlen = src_nn->wlen;  in nn_copy()
430 	while ((in1->wlen > 0) && (in1->val[in1->wlen - 1] == 0)) {  in nn_normalize()
431 		in1->wlen--;  in nn_normalize()
544 	for (i = 0; remain && (i < in_nn->wlen); i++) {  in nn_export_to_buf()
591 	out->wlen = 0;  in nn_tabselect()
599 		out->wlen = (u8)(out->wlen | ((tab[k]->wlen) & mask));  in nn_tabselect()