Lines Matching defs:winsize
3252 int err, bitbuf, bitcpy, bitcnt, mode, digidx, x, y, winsize;
3255 winsize = find_window_size(X);
3264 for (x = 1<<(winsize-1); x < (1 << winsize); x++) {
3266 for (y = 1<<(winsize-1); y < x; y++) {
3303 /* compute the value at M[1<<(winsize-1)] by squaring
3304 * M[1] (winsize-1) times
3306 if ((err = mp_copy( &M[1], &M[1 << (winsize - 1)])) != MP_OKAY) {
3310 for (x = 0; x < (winsize - 1); x++) {
3312 if ((err = square(&M[1 << (winsize - 1)],
3313 &M[1 << (winsize - 1)])) != MP_OKAY) {
3318 if ((err = redux(&M[1 << (winsize - 1)], P, &mu)) != MP_OKAY) {
3324 * for x = (2**(winsize - 1) + 1) to (2**winsize - 1)
3326 for (x = (1 << (winsize - 1)) + 1; x < (1 << winsize); x++) {
3386 bitbuf |= (y << (winsize - ++bitcpy));
3389 if (bitcpy == winsize) {
3392 for (x = 0; x < winsize; x++) {
3428 if ((bitbuf & (1 << winsize)) != 0) {
3448 for (x = 1<<(winsize-1); x < (1 << winsize); x++) {
4061 int err, bitbuf, bitcpy, bitcnt, mode, digidx, x, y, winsize;
4069 winsize = find_window_size(X);
4078 for (x = 1<<(winsize-1); x < (1 << winsize); x++) {
4080 for (y = 1<<(winsize-1); y < x; y++) {
4143 /* compute the value at M[1<<(winsize-1)] by squaring M[1] (winsize-1) times */
4144 if ((err = mp_copy( &M[1], &M[1 << (winsize - 1)])) != MP_OKAY) {
4148 for (x = 0; x < (winsize - 1); x++) {
4149 if ((err = square(&M[1 << (winsize - 1)], &M[1 << (winsize - 1)])) != MP_OKAY) {
4152 if ((err = (*redux)(&M[1 << (winsize - 1)], P, mp)) != MP_OKAY) {
4158 for (x = (1 << (winsize - 1)) + 1; x < (1 << winsize); x++) {
4212 bitbuf |= (y << (winsize - ++bitcpy));
4215 if (bitcpy == winsize) {
4218 for (x = 0; x < winsize; x++) {
4255 if ((bitbuf & (1 << winsize)) != 0) {
4286 for (x = 1<<(winsize-1); x < (1 << winsize); x++) {
Indexes created Sun Sep 28 16:09:52 GMT 2025