Lines Matching refs:cc
125 uint64_t cc;
213 cc = 0;
217 w = t[i] + cc;
219 cc = w >> 30;
221 d[17] = (uint32_t)cc;
232 uint64_t cc;
284 cc = 0;
288 w = t[i] + cc;
290 cc = w >> 30;
292 d[17] = (uint32_t)cc;
320 uint32_t w, cc;
323 cc = 0;
325 w = a[i] + b[i] + cc;
327 cc = w >> 30;
334 cc = w;
336 w = d[i] + cc;
338 cc = ARSH(w, 30);
349 uint32_t w, cc;
379 cc = w;
381 w = d[i] + cc;
383 cc = ARSH(w, 30);
396 uint64_t cc, x;
448 cc = 0;
450 x = s[i] + cc;
452 cc = ARSHW(x, 30);
460 * 256 bits, and the (signed) carry (beyond 2^256) is in cc. The
461 * significant length of cc is less than 24 bits, so we will be
464 cc = ARSHW(x, 16);
468 * One extra round of reduction, for cc*2^256, which means
469 * adding cc*(2^224-2^192-2^96+1) to a 256-bit (nonnegative)
470 * value. If cc is negative, then it may happen (rarely, but
472 * order to avoid that, if cc is negative, then we add the
473 * modulus once. Note that if cc is negative, then propagating
478 z = (uint32_t)cc;
508 uint64_t cc, x;
560 cc = 0;
562 x = s[i] + cc;
564 cc = ARSHW(x, 30);
572 * 256 bits, and the (signed) carry (beyond 2^256) is in cc. The
573 * significant length of cc is less than 24 bits, so we will be
576 cc = ARSHW(x, 16);
580 * One extra round of reduction, for cc*2^256, which means
581 * adding cc*(2^224-2^192-2^96+1) to a 256-bit (nonnegative)
582 * value. If cc is negative, then it may happen (rarely, but
584 * order to avoid that, if cc is negative, then we add the
585 * modulus once. Note that if cc is negative, then propagating
590 z = (uint32_t)cc;
622 uint32_t cc;
625 cc = 0;
629 w = d[i] - F256[i] - cc;
630 cc = w >> 31;
633 cc ^= 1;
634 CCOPY(cc, d, t, sizeof t);
635 return cc;