Lines Matching defs:window_val
187 int window_val;
232 window_val = scalar->d[0] & mask;
234 while ((window_val != 0) || (j + w + 1 < len)) { /* if j+w+1 >= len,
235 * window_val will not
239 /* 0 <= window_val <= 2^(w+1) */
241 if (window_val & 1) {
242 /* 0 < window_val < 2^(w+1) */
244 if (window_val & bit) {
245 digit = window_val - next_bit; /* -2^w < digit < 0 */
251 * bits will be added into window_val, so using a
256 digit = window_val & (mask >> 1); /* 0 < digit < 2^w */
260 digit = window_val; /* 0 < digit < 2^w */
268 window_val -= digit;
271 * now window_val is 0 or 2^(w+1) in standard wNAF generation;
274 if (window_val != 0 && window_val != next_bit
275 && window_val != bit) {
283 window_val >>= 1;
284 window_val += bit * BN_is_bit_set(scalar, j + w);
286 if (window_val > next_bit) {