Lines Matching defs:bits
51 int i, bits, ret = 0;
69 bits = BN_num_bits(p);
79 for (i = 1; i < bits; i++) {
118 * 4096, 8192 bits], compared to the running time of the
129 * at 2048 and more bits, but at 512 and 1024 bits, it was
172 int i, j, bits, ret = 0, wstart, wend, window, wvalue;
187 bits = BN_num_bits(p);
188 if (bits == 0) {
227 window = BN_window_bits_for_exponent_size(bits);
243 wstart = bits - 1; /* The top bit of the window */
307 int i, j, bits, ret = 0, wstart, wend, window, wvalue;
331 bits = BN_num_bits(p);
332 if (bits == 0) {
372 window = BN_window_bits_for_exponent_size(bits);
388 wstart = bits - 1; /* The top bit of the window */
605 int i, bits, ret = 0, window, wvalue, wmask, window0;
635 * Use all bits stored in |p|, rather than |BN_num_bits|, so we do not leak
636 * whether the top bits are zero.
638 bits = p->top * BN_BITS2;
639 if (bits == 0) {
704 window = BN_window_bits_for_ctime_exponent_size(bits);
781 int power, int bits);
784 int power, int bits);
787 int power, int bits);
790 int power, int bits);
793 int power, int bits);
871 * full-window-size bits such that what remains is always a whole
874 window0 = (bits - 1) % 5 + 1;
876 bits -= window0;
877 wvalue = bn_get_bits(p, bits) & wmask;
882 * significant bits.
884 while (bits > 0) {
885 if (bits < stride)
886 stride = bits;
887 bits -= stride;
888 wvalue = bn_get_bits(p, bits);
896 bits += stride - 5;
1003 * full-window-size bits such that what remains is always a whole
1006 window0 = (bits - 1) % 5 + 1;
1008 bits -= window0;
1009 wvalue = bn_get_bits(p, bits) & wmask;
1014 * significant bits.
1017 while (bits > 0) {
1024 bn_get_bits5(p->d, bits -= 5));
1027 while (bits > 0) {
1029 bn_get_bits5(p->d, bits -= 5));
1079 * full-window-size bits such that what remains is always a whole
1082 window0 = (bits - 1) % window + 1;
1084 bits -= window0;
1085 wvalue = bn_get_bits(p, bits) & wmask;
1093 * significant bits.
1095 while (bits > 0) {
1103 * Get a window's worth of bits from the exponent
1112 bits -= window;
1113 wvalue = bn_get_bits(p, bits) & wmask;
1159 int b, bits, ret = 0;
1198 bits = BN_num_bits(p);
1199 if (bits == 0) {
1232 /* bits-1 >= 0 */
1235 w = a; /* bit 'bits-1' of 'p' is always set */
1236 for (b = bits - 2; b >= 0; b--) {
1306 int i, j, bits, ret = 0, wstart, wend, window, wvalue;
1320 bits = BN_num_bits(p);
1321 if (bits == 0) {
1346 window = BN_window_bits_for_exponent_size(bits);
1362 wstart = bits - 1; /* The top bit of the window */