Lines Matching refs:top
157 int i = a->top - 1;
180 int i = a->top - 1;
287 assert(b->top <= words);
288 if (b->top > 0)
289 memcpy(a, b->d, sizeof(*a) * b->top);
342 bn_words = BN_get_flags(b, BN_FLG_CONSTTIME) ? b->dmax : b->top;
349 if (b->top > 0)
353 a->top = b->top;
378 tmp_top = a->top;
383 a->top = b->top;
388 b->top = tmp_top;
406 a->top = 0;
412 if (a->top > 1)
414 else if (a->top == 1)
416 /* a->top == 0 */
427 a->top = (w ? 1 : 0);
450 ret->top = 0;
459 ret->top = i;
471 * need to call this due to clear byte at top if avoiding having the top
489 * In case |a| is fixed-top, BN_num_bytes can return bogus length,
490 * but it's assumed that fixed-top inputs ought to be "nominated"
514 atop = a->top * BN_BYTES;
562 ret->top = 0;
571 ret->top = i;
584 * need to call this due to clear byte at top if avoiding having the top
624 i = a->top - b->top;
629 for (i = a->top - 1; i >= 0; i--) {
670 if (a->top > b->top)
672 if (a->top < b->top)
674 for (i = a->top - 1; i >= 0; i--) {
694 if (a->top <= i) {
697 for (k = a->top; k < i + 1; k++)
699 a->top = i + 1;
718 if (a->top <= i)
735 if (a->top <= i)
750 if (w >= a->top)
753 a->top = w;
755 a->top = w + 1;
840 t = (a->top ^ b->top) & condition;
841 a->top ^= t;
842 b->top ^= t;
866 * top could be greater than the minimal value that it could be). We should
914 a->top = 0;
920 return ((a->top == 1) && (a->d[0] == w)) || ((w == 0) && (a->top == 0));
925 return a->top == 0;
940 return (a->top > 0) && (a->d[0] & 1);
957 dest->top = b->top;
1036 mask &= constant_time_msb(j - a->top);
1041 a->top = atop;
1049 int tmp_top = a->top;
1057 a->top = tmp_top;
1059 if (a->top == 0)