156 				const uECC_word_t *right,  in uECC_vli_cmp_unsafe()  argument
162 		if (left[i] > right[i]) {  in uECC_vli_cmp_unsafe()
164 		} else if (left[i] < right[i]) {  in uECC_vli_cmp_unsafe()
171 uECC_word_t uECC_vli_equal(const uECC_word_t *left, const uECC_word_t *right,  in uECC_vli_equal()  argument
179 		diff |= (left[i] ^ right[i]);  in uECC_vli_equal()
192 			 const uECC_word_t *right, wordcount_t num_words)  in uECC_vli_sub()  argument
197 		uECC_word_t diff = left[i] - right[i] - borrow;  in uECC_vli_sub()
209 				const uECC_word_t *right, wordcount_t num_words)  in uECC_vli_add()  argument
214 		uECC_word_t sum = left[i] + right[i] + carry;  in uECC_vli_add()
222 cmpresult_t uECC_vli_cmp(const uECC_word_t *left, const uECC_word_t *right,  in uECC_vli_cmp()  argument
226 	uECC_word_t neg = !!uECC_vli_sub(tmp, left, right, num_words);  in uECC_vli_cmp()
260 			  const uECC_word_t *right, wordcount_t num_words)  in uECC_vli_mult()  argument
272 			muladd(left[i], right[k - i], &r0, &r1, &r2);  in uECC_vli_mult()
284 			muladd(left[i], right[k - i], &r0, &r1, &r2);  in uECC_vli_mult()
295 		     const uECC_word_t *right, const uECC_word_t *mod,  in uECC_vli_modAdd()  argument
298 	uECC_word_t carry = uECC_vli_add(result, left, right, num_words);  in uECC_vli_modAdd()
307 		     const uECC_word_t *right, const uECC_word_t *mod,  in uECC_vli_modSub()  argument
310 	uECC_word_t l_borrow = uECC_vli_sub(result, left, right, num_words);  in uECC_vli_modSub()
365 		      const uECC_word_t *right, const uECC_word_t *mod,  in uECC_vli_modMult()  argument
369 	uECC_vli_mult(product, left, right, num_words);  in uECC_vli_modMult()
374 			   const uECC_word_t *right, uECC_Curve curve)  in uECC_vli_modMult_fast()  argument
377 	uECC_vli_mult(product, left, right, curve->num_words);  in uECC_vli_modMult_fast()