crypto/bn/bn_exp.c

249     int i, j, bits, ret = 0, wstart, wend, window, wvalue;
296     window = BN_window_bits_for_exponent_size(bits);
297     if (window > 1) {
300         j = 1 << (window - 1);
311     wvalue = 0;                 /* The 'value' of the window */
312     wstart = bits - 1;          /* The top bit of the window */
313     wend = 0;                   /* The bottom bit of the window */
330          * a window to do.  To do this we need to scan forward until the last
331          * set bit before the end of the window
336         for (i = 1; i < window; i++) {
346         /* wend is the size of the current window */
355         /* wvalue will be an odd number < 2^window */
359         /* move the 'window' down further */
377     int i, j, bits, ret = 0, wstart, wend, window, wvalue;
437     window = BN_window_bits_for_exponent_size(bits);
438     if (window > 1) {
441         j = 1 << (window - 1);
452     wvalue = 0;                 /* The 'value' of the window */
453     wstart = bits - 1;          /* The top bit of the window */
454     wend = 0;                   /* The bottom bit of the window */
471          * a window to do.  To do this we need to scan forward until the last
472          * set bit before the end of the window
477         for (i = 1; i < window; i++) {
487         /* wend is the size of the current window */
496         /* wvalue will be an odd number < 2^window */
500         /* move the 'window' down further */
527                                         int window)
530     int width = 1 << window;
549                                           int window)
552     int width = 1 << window;
558     if (window <= 3) {
570         int xstride = 1 << (window - 2);
573         i = idx >> (window - 2);        /* equivalent of idx / xstride */
619     int i, bits, ret = 0, idx, window, wvalue;
666     /* Get the window size to use with size of p. */
667     window = BN_window_bits_for_ctime_exponent_size(bits);
673     numPowers = 1 << window;
690     if (!MOD_EXP_CTIME_COPY_TO_PREBUF(r, top, powerbuf, 0, window))
709     if (!MOD_EXP_CTIME_COPY_TO_PREBUF(am, top, powerbuf, 1, window))
713      * If the window size is greater than 1, then calculate
718     if (window > 1) {
725                                               window))
731      * Adjust the number of bits up to a multiple of the window size. If the
732      * exponent length is not a multiple of the window size, then this pads
734      * there's no special cases. * NOTE: Making the window size a power of
740     bits = ((bits + window - 1) / window) * window;
741     idx = bits - 1;             /* The top bit of the window */
744      * Scan the exponent one window at a time starting from the most
748         wvalue = 0;             /* The 'value' of the window */
750         /* Scan the window, squaring the result as we go */
751         for (i = 0; i < window; i++, idx--) {
761             (computeTemp, top, powerbuf, wvalue, window))
938     int i, j, bits, ret = 0, wstart, wend, window, wvalue;
971     window = BN_window_bits_for_exponent_size(bits);
972     if (window > 1) {
975         j = 1 << (window - 1);
986     wvalue = 0;                 /* The 'value' of the window */
987     wstart = bits - 1;          /* The top bit of the window */
988     wend = 0;                   /* The bottom bit of the window */
1005          * a window to do.  To do this we need to scan forward until the last
1006          * set bit before the end of the window
1011         for (i = 1; i < window; i++) {
1021         /* wend is the size of the current window */
1030         /* wvalue will be an odd number < 2^window */
1034         /* move the 'window' down further */