Lines Matching defs:st_idx
195 int i, j, k, st_idx;
231 st_idx = state_index;
255 * state[st_idx], ..., state[(st_idx + num - 1) % STATE_SIZE] are what we
271 k = (st_idx + j) - STATE_SIZE;
273 MD_Update(&m, &(state[st_idx]), j - k);
276 MD_Update(&m, &(state[st_idx]), j);
303 state[st_idx++] ^= local_md[k];
304 if (st_idx >= STATE_SIZE)
305 st_idx = 0;
339 int i, j, k, st_num, st_idx;
446 st_idx = state_index;
457 * state[st_idx], ..., state[(st_idx + num_ceil - 1) % st_num] are now
493 k = (st_idx + MD_DIGEST_LENGTH / 2) - st_num;
495 MD_Update(&m, &(state[st_idx]), MD_DIGEST_LENGTH / 2 - k);
498 MD_Update(&m, &(state[st_idx]), MD_DIGEST_LENGTH / 2);
503 state[st_idx++] ^= local_md[i];
504 if (st_idx >= st_num)
505 st_idx = 0;