Lines Matching defs:top
248 uint32_t top = a[7] >> 28;
251 // top < 2**4
252 // Constant-time: mask = (top != 0) ? 0xffffffff : 0
253 uint32_t mask = top;
259 // Eliminate top while maintaining the same value mod p.
260 a[0] -= top;
261 a[3] += top << 12;
334 uint32_t top = out[7] >> 28;
337 // Eliminate top while maintaining the same value mod p.
338 out[0] -= top;
339 out[3] += top << 12;
356 top = out[7] >> 28;
359 // Eliminate top while maintaining the same value mod p.
360 out[0] -= top;
361 out[3] += top << 12;
364 // 1) The first time that we eliminated top, we didn't push out[3] over
366 // and top is zero.
367 // 2) We did push out[3] over 2**28 the first time that we eliminated top.
368 // The first value of top was in [0..16), therefore, prior to eliminating
369 // the first top, 0xfff1000 <= out[3] <= 0xfffffff. Therefore, after
371 // 0xf000. Thus it cannot have overflowed when we eliminated top for the
386 // First we build a mask from the top four limbs, which must all be