Lines Matching +defs:start +defs:window
242 int i,j,bits,ret=0,wstart,wend,window,wvalue;
243 int start=1;
290 window = BN_window_bits_for_exponent_size(bits);
291 if (window > 1)
295 j=1<<(window-1);
305 start=1; /* This is used to avoid multiplication etc
308 wvalue=0; /* The 'value' of the window */
309 wstart=bits-1; /* The top bit of the window */
310 wend=0; /* The bottom bit of the window */
318 if (!start)
326 * how bit a window to do. To do this we need to scan
328 * window */
332 for (i=1; i<window; i++)
343 /* wend is the size of the current window */
346 if (!start)
353 /* wvalue will be an odd number < 2^window */
357 /* move the 'window' down further */
360 start=0;
375 int i,j,bits,ret=0,wstart,wend,window,wvalue;
376 int start=1;
437 window = BN_window_bits_for_exponent_size(bits);
438 if (window > 1)
441 j=1<<(window-1);
451 start=1; /* This is used to avoid multiplication etc
454 wvalue=0; /* The 'value' of the window */
455 wstart=bits-1; /* The top bit of the window */
456 wend=0; /* The bottom bit of the window */
463 if (!start)
473 * how bit a window to do. To do this we need to scan
475 * window */
479 for (i=1; i<window; i++)
490 /* wend is the size of the current window */
493 if (!start)
500 /* wvalue will be an odd number < 2^window */
504 /* move the 'window' down further */
507 start=0;
575 int i,bits,ret=0,idx,window,wvalue;
621 /* Get the window size to use with size of p. */
622 window = BN_window_bits_for_ctime_exponent_size(bits);
627 numPowers = 1 << window;
658 /* If the window size is greater than 1, then calculate
663 if (window > 1)
674 /* Adjust the number of bits up to a multiple of the window size.
675 * If the exponent length is not a multiple of the window size, then
679 * * NOTE: Making the window size a power of two less than the native
685 bits = ((bits+window-1)/window)*window;
686 idx=bits-1; /* The top bit of the window */
688 /* Scan the exponent one window at a time starting from the most
693 wvalue=0; /* The 'value' of the window */
695 /* Scan the window, squaring the result as we go */
696 for (i=0; i<window; i++,idx--)
879 int i,j,bits,ret=0,wstart,wend,window,wvalue;
880 int start=1;
913 window = BN_window_bits_for_exponent_size(bits);
914 if (window > 1)
918 j=1<<(window-1);
927 start=1; /* This is used to avoid multiplication etc
930 wvalue=0; /* The 'value' of the window */
931 wstart=bits-1; /* The top bit of the window */
932 wend=0; /* The bottom bit of the window */
940 if (!start)
948 * how bit a window to do. To do this we need to scan
950 * window */
954 for (i=1; i<window; i++)
965 /* wend is the size of the current window */
968 if (!start)
975 /* wvalue will be an odd number < 2^window */
979 /* move the 'window' down further */
982 start=0;