Lines Matching refs:c1
178 int n = n2 / 2, c1, c2; in bn_mul_recursive() local
208 c1 = bn_cmp_part_words(a, &(a[n]), tna, n - tna); in bn_mul_recursive()
211 switch (c1 * 3 + c2) { in bn_mul_recursive()
281 c1 = (int)(bn_add_words(t, r, &(r[n2]), n2)); in bn_mul_recursive()
284 c1 -= (int)(bn_sub_words(&(t[n2]), t, &(t[n2]), n2)); in bn_mul_recursive()
287 c1 += (int)(bn_add_words(&(t[n2]), &(t[n2]), t, n2)); in bn_mul_recursive()
296 c1 += (int)(bn_add_words(&(r[n]), &(r[n]), &(t[n2]), n2)); in bn_mul_recursive()
297 if (c1) { in bn_mul_recursive()
300 ln = (lo + c1) & BN_MASK2; in bn_mul_recursive()
307 if (ln < (BN_ULONG)c1) { in bn_mul_recursive()
326 int c1, c2, neg; in bn_mul_part_recursive() local
335 c1 = bn_cmp_part_words(a, &(a[n]), tna, n - tna); in bn_mul_part_recursive()
338 switch (c1 * 3 + c2) { in bn_mul_part_recursive()
436 c1 = (int)(bn_add_words(t, r, &(r[n2]), n2)); in bn_mul_part_recursive()
439 c1 -= (int)(bn_sub_words(&(t[n2]), t, &(t[n2]), n2)); in bn_mul_part_recursive()
442 c1 += (int)(bn_add_words(&(t[n2]), &(t[n2]), t, n2)); in bn_mul_part_recursive()
451 c1 += (int)(bn_add_words(&(r[n]), &(r[n]), &(t[n2]), n2)); in bn_mul_part_recursive()
452 if (c1) { in bn_mul_part_recursive()
455 ln = (lo + c1) & BN_MASK2; in bn_mul_part_recursive()
462 if (ln < (BN_ULONG)c1) { in bn_mul_part_recursive()
