Lines Matching defs:bits
122 int i,bits,ret=0;
140 bits=BN_num_bits(p);
146 for (i=1; i<bits; i++)
183 * 4096, 8192 bits], compared to the running time of the
194 * at 2048 and more bits, but at 512 and 1024 bits, it was
241 int i,j,bits,ret=0,wstart,wend,window,wvalue;
255 bits=BN_num_bits(p);
257 if (bits == 0)
289 window = BN_window_bits_for_exponent_size(bits);
308 wstart=bits-1; /* The top bit of the window */
374 int i,j,bits,ret=0,wstart,wend,window,wvalue;
396 bits=BN_num_bits(p);
397 if (bits == 0)
436 window = BN_window_bits_for_exponent_size(bits);
454 wstart=bits-1; /* The top bit of the window */
574 int i,bits,ret=0,idx,window,wvalue;
597 bits=BN_num_bits(p);
598 if (bits == 0)
621 window = BN_window_bits_for_ctime_exponent_size(bits);
673 /* Adjust the number of bits up to a multiple of the window size.
675 * this pads the most significant bits with zeros to normalize the
679 * * word size ensures that the padded bits won't go past the last
684 bits = ((bits+window-1)/window)*window;
685 idx=bits-1; /* The top bit of the window */
688 * significant bits.
728 int b, bits, ret=0;
766 bits = BN_num_bits(p);
767 if (bits == 0)
795 /* bits-1 >= 0 */
798 w = a; /* bit 'bits-1' of 'p' is always set */
799 for (b = bits-2; b >= 0; b--)
878 int i,j,bits,ret=0,wstart,wend,window,wvalue;
891 bits=BN_num_bits(p);
893 if (bits == 0)
912 window = BN_window_bits_for_exponent_size(bits);
930 wstart=bits-1; /* The top bit of the window */