Searched refs:trial (Results 1 - 6 of 6) sorted by relevance
| /opensolaris-onvv-gate/usr/src/cmd/cmd-inet/usr.bin/ftp/ |
| H A D | auth.c | 89 int comcode, trial; local
120 for (trial = 0; trial < n_gss_trials; trial++) {
124 gss_trials[trial], hostname);
175 if (strcmp(gss_trials[trial], "ftp"))
189 verbose = (trial == n_gss_trials-1)?0:-1;
208 if (trial == n_gss_trials-1) {
255 trial = n_gss_trials-1;
|
| /opensolaris-onvv-gate/usr/src/common/mpi/ |
| H A D | mpprime.h | 73 mp_err mpp_sieve(mp_int *trial, const mp_digit *primes, mp_size nPrimes,
|
| /opensolaris-onvv-gate/usr/src/cmd/perl/5.8.4/distrib/lib/Math/BigInt/ |
| H A D | Calc.pm | 1390 # this trial multiplication is very fast, even for large counts (like for
1396 my $trial = _copy($c,$base);
1406 $trial = _pow ($c, _copy($c, $base), $x);
1407 my $a = _acmp($x,$trial,$x_org);
1412 _mul($c,$trial,$base); _add($c, $x, [1]);
1417 _div($c,$trial,$base); _sub($c, $x, [1]);
1420 $a = _acmp($x,$trial,$x_org);
1425 _div($c,$trial,$base); _sub($c, $x, [1]);
1435 while (($a = _acmp($c,$trial,$x_org)) < 0)
1437 _mul($c,$trial,
[all...] |
| /opensolaris-onvv-gate/usr/src/common/net/patricia/ |
| H A D | radix.c | 121 rn_satisfies_leaf(char *trial, struct radix_node *leaf,
269 * Returns true if address 'trial' has no bits differing from the
271 * returns true when 'trial' matches leaf.
277 rn_satisfies_leaf(trial, leaf, skip, rn_leaf_fn, rn_leaf_arg)
278 caddr_t trial;
284 char *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask;
|
| /opensolaris-onvv-gate/usr/src/cmd/perl/5.8.4/distrib/ext/Encode/lib/Encode/ |
| H A D | Guess.pm | 293 The reason is that Encode::Guess guesses encoding by trial and error.
|
| /opensolaris-onvv-gate/usr/src/cmd/cmd-inet/usr.sbin/in.routed/ |
| H A D | radix.c | 191 * Returns true if address 'trial' has no bits differing from the
193 * returns true when 'trial' matches leaf.
196 rn_satisfies_leaf(uint8_t *trial, argument
200 uint8_t *cp = trial, *cp2 = leaf->rn_key, *cp3 = leaf->rn_mask;
|
Completed in 106 milliseconds