• Home
  • History
  • Annotate
  • Raw
  • Download
  • only in /asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/openssl/crypto/bn/

Lines Matching refs:window

271     int i, j, bits, ret = 0, wstart, wend, window, wvalue;
318 window = BN_window_bits_for_exponent_size(bits);
319 if (window > 1) {
322 j = 1 << (window - 1);
333 wvalue = 0; /* The 'value' of the window */
334 wstart = bits - 1; /* The top bit of the window */
335 wend = 0; /* The bottom bit of the window */
352 * a window to do. To do this we need to scan forward until the last
353 * set bit before the end of the window
358 for (i = 1; i < window; i++) {
368 /* wend is the size of the current window */
377 /* wvalue will be an odd number < 2^window */
381 /* move the 'window' down further */
399 int i, j, bits, ret = 0, wstart, wend, window, wvalue;
459 window = BN_window_bits_for_exponent_size(bits);
460 if (window > 1) {
463 j = 1 << (window - 1);
474 wvalue = 0; /* The 'value' of the window */
475 wstart = bits - 1; /* The top bit of the window */
476 wend = 0; /* The bottom bit of the window */
510 * a window to do. To do this we need to scan forward until the last
511 * set bit before the end of the window
516 for (i = 1; i < window; i++) {
526 /* wend is the size of the current window */
535 /* wvalue will be an odd number < 2^window */
539 /* move the 'window' down further */
648 int i, bits, ret = 0, window, wvalue;
721 /* Get the window size to use with size of p. */
722 window = BN_window_bits_for_ctime_exponent_size(bits);
724 if (window >= 5 && (top & 15) == 0 && top <= 64 &&
727 window = 5;
731 if (window >= 5) {
732 window = 5; /* ~5% improvement for RSA2048 sign, and even
744 numPowers = 1 << window;
895 * Scan the exponent one window at a time starting from the most
931 if (window == 5 && top > 1) {
939 * Dedicated window==4 case improves 512-bit RSA sign by ~15%, but as
1016 * Scan the exponent one window at a time starting from the most
1056 * If the window size is greater than 1, then calculate
1061 if (window > 1) {
1078 for (wvalue = 0, i = bits % window; i >= 0; i--, bits--)
1085 * Scan the exponent one window at a time starting from the most
1089 wvalue = 0; /* The 'value' of the window */
1091 /* Scan the window, squaring the result as we go */
1092 for (i = 0; i < window; i++, bits--) {
1286 int i, j, bits, ret = 0, wstart, wend, window, wvalue;
1319 window = BN_window_bits_for_exponent_size(bits);
1320 if (window > 1) {
1323 j = 1 << (window - 1);
1334 wvalue = 0; /* The 'value' of the window */
1335 wstart = bits - 1; /* The top bit of the window */
1336 wend = 0; /* The bottom bit of the window */
1353 * a window to do. To do this we need to scan forward until the last
1354 * set bit before the end of the window
1359 for (i = 1; i < window; i++) {
1369 /* wend is the size of the current window */
1378 /* wvalue will be an odd number < 2^window */
1382 /* move the 'window' down further */