Lines Matching defs:step
169 /* if not zero goto step 4 */
1739 /* step 3. for i from n down to (t + 1) */
1745 /* step 3.1 if xi == yt then set q{i-t-1} to b-1,
1784 /* step 3.3 x = x - q{i-t-1} * y * b**{i-t-1} */
3832 /* if not zero goto step 4 */
4017 /* step 1. if a == 0, return 0 */
4023 /* step 2. if a == 1, return 1 */
4032 /* step 3. write a = a1 * 2**k */
4047 /* step 4. if e is even set s=1 */
4061 /* step 5. if p == 3 (mod 4) *and* a1 == 3 (mod 4) then s = -s */
5312 * each step involves a fair bit. This is not meant to
5861 mp_digit res_tab[PRIME_SIZE], step, kstep;
5944 step = 0;
5949 /* increase step to next candidate */
5950 step += kstep;
5954 /* add the step to each residue */
5967 } while (y == 1 && step < ((((mp_digit)1)<<DIGIT_BIT) - kstep));
5969 /* add the step */
5970 if ((err = mp_add_d(a, step, a)) != MP_OKAY) {
5974 /* if didn't pass sieve and step == MAX then skip test */
5975 if (y == 1 && step >= ((((mp_digit)1)<<DIGIT_BIT) - kstep)) {
