Searched defs:steps (Results 1 - 3 of 3) sorted by relevance

/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Math/BigInt/
H A DCalc.pm1296 # limit is either $x steps (steps == 100 means a result always too high) or
1298 my $steps = 100; $steps = $cx->[0] if @$cx == 1;
1300 while ($r*$cf < $BASE && $step < $steps)
1311 # now we must do the left over steps
1312 my $n; # steps still to do
1325 # do left-over steps fit into a scalar?
1391 # 2 ** 1024, since this still requires only 1024 very fast steps
1459 my $steps
1460 sub steps { $steps }; subroutine
[all...]
/osnet-11/usr/src/grub/grub2/grub-core/lib/libgcrypt/cipher/
H A Dprimegen.c39 static int is_prime (gcry_mpi_t n, int steps, unsigned int *count);
916 is_prime (gcry_mpi_t n, int steps, unsigned int *count)
928 if (steps < 5) /* Make sure that we do at least 5 rounds. */
929 steps = 5;
938 for (i=0 ; i < steps; i++ )
914 is_prime(gcry_mpi_t n, int steps, unsigned int *count) argument
/osnet-11/usr/src/grub/grub2/grub-core/lib/libgcrypt-grub/cipher/
H A Dprimegen.c38 static int is_prime (gcry_mpi_t n, int steps, unsigned int *count);
915 is_prime (gcry_mpi_t n, int steps, unsigned int *count)
927 if (steps < 5) /* Make sure that we do at least 5 rounds. */
928 steps = 5;
937 for (i=0 ; i < steps; i++ )
913 is_prime(gcry_mpi_t n, int steps, unsigned int *count) argument

Completed in 31 milliseconds