Lines Matching defs:bits
129 int i, bits, ret = 0;
153 bits = BN_num_bits(p);
165 for (i = 1; i < bits; i++) {
393 * For window size 'w' (w >= 2) and a random 'b' bits exponent, the number of
421 int i, j, bits, ret = 0, wstart, window;
434 bits = BN_num_bits(p);
436 if (bits == 0) {
473 window = BN_window_bits_for_exponent_size(bits);
490 wstart = bits - 1; /* The top bit of the window */
574 * 4096, 8192 bits], compared to the running time of the
585 * at 2048 and more bitsbits, it was
606 int i, j, bits, ret = 0, wstart, window;
622 bits = BN_num_bits(p);
623 if (bits == 0) {
668 window = BN_window_bits_for_exponent_size(bits);
685 wstart = bits - 1; /* The top bit of the window */
855 int i, bits, ret = 0, window, wvalue;
872 bits = BN_num_bits(p);
873 if (bits == 0) {
920 window = BN_window_bits_for_ctime_exponent_size(bits);
1060 bits--;
1061 for (wvalue = 0, i = bits % 5; i >= 0; i--, bits--) {
1062 wvalue = (wvalue << 1) + BN_is_bit_set(p, bits);
1066 /* At this point |bits| is 4 mod 5 and at least -1. (|bits| is the first bit
1068 assert(bits >= -1 && (bits == -1 || bits % 5 == 4));
1071 * significant bits.
1074 while (bits >= 0) {
1075 for (wvalue = 0, i = 0; i < 5; i++, bits--) {
1076 wvalue = (wvalue << 1) + BN_is_bit_set(p, bits);
1089 assert(bits < max_bits);
1096 * iteration, we are guaranteed to be past the last byte.) Note |bits|
1098 if (bits - 4 >= max_bits - 8) {
1099 /* Read five bits from |bits-4| through |bits|, inclusive. */
1101 wvalue >>= (bits - 4) & 7;
1103 bits -= 5;
1106 while (bits >= 0) {
1107 /* Read five bits from |bits-4| through |bits|, inclusive. */
1108 int first_bit = bits - 4;
1112 bits -= 5;
1153 bits--;
1154 for (wvalue = 0, i = bits % window; i >= 0; i--, bits--) {
1155 wvalue = (wvalue << 1) + BN_is_bit_set(p, bits);
1162 * significant bits.
1164 while (bits >= 0) {
1168 for (i = 0; i < window; i++, bits--) {
1172 wvalue = (wvalue << 1) + BN_is_bit_set(p, bits);
1207 int b, bits, ret = 0;
1240 bits = BN_num_bits(p);
1241 if (bits == 0) {
1276 /* bits-1 >= 0 */
1279 w = a; /* bit 'bits-1' of 'p' is always set */
1280 for (b = bits - 2; b >= 0; b--) {
1365 int i, j, bits, b, bits1, bits2, ret = 0, wpos1, wpos2, window1, window2,
1385 bits = (bits1 > bits2) ? bits1 : bits2;
1492 for (b = bits - 1; b >= 0; b--) {
1500 /* consider bits b-window1+1 .. b for this window */
1517 /* consider bits b-window2+1 .. b for this window */
