Searched refs:steps (Results 1 - 10 of 10) 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/cmd/perl/5.8.4/distrib/lib/
H A Dautouse.pm129 Using C<autouse> will move important steps of your program's execution
H A Dperl5db.pl6759 B<n> [I<expr>] Next, steps over subroutine calls [in I<expr>].
6915 B<v> [I<line>] View around line B<n> [I<expr>] Next, steps over subs
6945 B<n> [I<expr>] Next, steps over subroutine calls [in I<expr>].
7090 B<w> [I<line>] List around line B<n> [I<expr>] Next, steps over subs
/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
/osnet-11/usr/src/lib/libc/sparc/gen/
H A Dascii_strcasecmp.s119 ! a word boundary. During these steps, the bytes are translated to
/osnet-11/usr/src/lib/libc/sparcv9/gen/
H A Dascii_strcasecmp.s119 ! a word boundary. During these steps, the bytes are translated to
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/ext/Devel/PPPort/
H A DPPPort.pm241 * across differing versions of Perl itself, certain steps need to be taken.
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/Math/
H A DBigFloat.pm868 # This takes much more steps to calculate the result and is thus not used
887 my $steps = 0 if DEBUG;
922 $steps++; print "step $steps = $x\n" if $steps % 10 == 0;
926 print "took $steps steps\n" if DEBUG;
1669 # The following steps will transform 123.456 (in $x) into 123456 (in $y1)
1683 # Multiply in steps of 100, by shifting left two times the "missing" digits
1688 # because we always must multiply by steps o
[all...]
/osnet-11/usr/src/cmd/perl/5.8.4/distrib/lib/ExtUtils/
H A DMakeMaker.pm1167 An extension that is built with the above steps is ready to use on

Completed in 66 milliseconds