| /src/sys/external/bsd/drm2/include/linux/ |
| hash.h | 41 const unsigned long factor = (sizeof(factor) > 4? local
44 return ((value * factor) >> ((CHAR_BIT * sizeof(value)) - bits));
|
| /src/usr.sbin/sysinst/ |
| factor.c | 1 /* $NetBSD: factor.c,v 1.2 2021/01/31 20:51:04 rillig Exp $ */
52 void factor (long val, long *fact_list, int fact_size, int *num_fact);
81 /* factor: prepare a list of prime factors of val.
82 The last number may not be a prime factor if the list is not
86 factor(long val, long *fact_list, int fact_size, int *num_fact) function
128 /* Factor each arg! */
132 factor (val, facts, 30, &nfact);
|
| /src/games/primes/ |
| primes.c | 212 uint64_t factor; /* index and factor */ local
249 for (p = &prime[0], factor = prime[0];
250 factor < stop && p <= pr_limit; factor = *(++p)) {
251 if (factor >= start) {
252 printf(hflag ? "%" PRIx64 : "%" PRIu64, factor);
254 printf(" (%" PRIu64 ")", factor - prev);
258 prev = factor;
273 * factor out 3, 5, 7, 11 and 1
[all...] |
| /src/external/gpl2/groff/dist/src/roff/troff/ |
| dictionary.h | 48 double factor; member in class:dictionary
|
| /src/bin/ksh/ |
| c_ulimit.c | 59 int factor; /* multiply by to get rlim_{cur,max} values */ member in struct:limits
197 val = (u_long)rval * l->factor;
229 val /= l->factor;
285 val /= l->factor;
|
| /src/games/ching/printching/ |
| printching.c | 162 int factor[3]; local
164 factor[0] = 1;
165 factor[1] = 10;
166 factor[2] = 100;
174 code += factor[i%3]*7;
179 code += factor[i%3]*8;
|
| /src/usr.bin/rump_dhcpclient/ |
| common.c | 109 static double factor = 0.0; local
115 factor = (double)info.numer / (double)info.denom;
121 if ((info.denom != 1 || info.numer != 1) && factor != 0.0)
122 nano *= factor;
|
| /src/external/apache2/llvm/dist/libcxx/src/ |
| chrono.cpp | 171 static const double factor = compute_steady_factor(); local
172 return static_cast<steady_clock::rep>(mach_absolute_time() * factor);
|
| /src/external/gpl3/gcc/dist/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/ |
| resize_policy.hpp | 58 factor = 2 enumerator in enum:__gnu_pbds::detail::resize_policy::__anon14751
157 { return m_grow_size * factor; }
164 const size_type half_size = m_grow_size / factor;
175 ret *= factor;
186 m_grow_size *= factor;
197 m_shrink_size /= factor;
200 m_grow_size = std::max(m_grow_size / factor, min_size);
|
| /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/ext/pb_ds/detail/binary_heap_/ |
| resize_policy.hpp | 58 factor = 2 enumerator in enum:__gnu_pbds::detail::resize_policy::__anon17142
157 { return m_grow_size * factor; }
164 const size_type half_size = m_grow_size / factor;
175 ret *= factor;
186 m_grow_size *= factor;
197 m_shrink_size /= factor;
200 m_grow_size = std::max(m_grow_size / factor, min_size);
|
| /src/usr.bin/systat/ |
| iostat.c | 325 int factor = 1; local
330 factor *= 10;
335 if (factor != 1)
336 mvwprintw(wnd, y, x + colwidth + 1, "* %d ", factor);
|
| pigs.c | 98 int factor; local
113 factor = 50.0/total;
139 mvwhline(wnd, y, 25, 'X', pt[k].pt_pctcpu*factor + 0.5);
|
| /src/external/bsd/jemalloc/dist/test/include/test/ |
| math.h | 46 double acu, factor, oflo, gin, term, rn, a, b, an, dif; local
60 factor = exp(p * log(x) - x - ln_gamma_p);
73 gin *= factor / p;
100 gin = 1.0 - factor * gin;
|
| /src/external/bsd/jemalloc.old/dist/test/include/test/ |
| math.h | 46 double acu, factor, oflo, gin, term, rn, a, b, an, dif; local
60 factor = exp(p * log(x) - x - ln_gamma_p);
73 gin *= factor / p;
100 gin = 1.0 - factor * gin;
|
| /src/external/bsd/openldap/dist/servers/lloadd/ |
| tier_bestof.c | 70 float a = l->b_fitness, b = r->b_fitness, factor = 1; local
74 factor = 1 / ( pow( ( 1 / factor ) + 1, now.tv_usec / 1000000.0 ) - 1 );
79 a = ( a * factor + (float)diff * l->b_weight / count ) / ( factor + 1 );
85 b = ( b * factor + (float)diff * r->b_weight / count ) / ( factor + 1 );
188 float factor = 1; local
199 /* Stretch factor accordingly favouring the latest value */
201 factor = 0; /* No recent data *
[all...] |
| /src/external/lgpl3/gmp/dist/demos/ |
| factorize.c | 48 void factor (mpz_t, struct factors *);
217 /* Factor n-1 for Lucas. */
219 factor (tmp, &factors);
342 printf ("[composite factor--restarting pollard-rho] ");
366 factor (mpz_t t, struct factors *factors) function
416 factor (t, &factors);
435 factor (t, &factors);
|
| /src/external/lgpl3/gmp/dist/mpn/generic/ |
| perfpow.c | 244 mp_limb_t *nc, factor, g; local
293 factor = mpn_trialdiv (np, n, nrtrial[trial], &where);
295 if (factor != 0)
307 binvert_limb (d, factor);
330 factor = mpn_trialdiv (np, n, nrtrial[trial], &where);
332 while (factor != 0);
|
| /src/sys/dev/pci/ |
| autrivar.h | 57 u_int factor; /* byte per sample */ member in struct:autri_chstatus
|
| voyager.c | 447 int ifreq, factor, bit, steps; local
455 factor = 96000000 / ifreq;
456 bit = fls32(factor);
457 factor = 1 << bit;
458 steps = 96000000 / (factor * freq);
473 DPRINTF("%d hz -> %d, %d, %d / %d\n", freq, factor, steps, lo, hi);
|
| ydsvar.h | 83 u_int factor; /* byte per sample */ member in struct:yds_softc::__anon3597
|
| /src/sys/external/bsd/drm2/dist/drm/radeon/ |
| radeon_rv740_dpm.c | 102 u32 factor; local
106 factor = 4;
108 factor = 2;
110 data_rate = (u16)(memory_clock * factor / 1000);
|
| /src/sys/ufs/ext2fs/ |
| ext2fs_inode.c | 507 long blkcount, factor; local
516 factor = 1;
518 factor *= EXT2_NINDIR(fs);
521 last /= factor;
569 nlbn = lbn + 1 - i * factor; i > last;
570 i--, nlbn += factor) {
591 last = lastbn % factor;
|
| /src/sys/ufs/ffs/ |
| ffs_inode.c | 637 int64_t factor; local
659 factor = 1;
661 factor *= FFS_NINDIR(fs);
664 last /= factor;
730 for (i = FFS_NINDIR(fs) - 1, nlbn = lbn + 1 - i * factor; i > last;
731 i--, nlbn += factor) {
773 last = lastbn % factor;
|
| /src/usr.sbin/screenblank/ |
| screenblank.c | 405 int seconds, nanoseconds, factor; local
407 factor = 1000000000;
423 if (factor > 1) {
425 factor /= 10;
432 if (factor > 1)
433 nanoseconds *= factor;
|
| /src/crypto/external/apache2/openssl/dist/crypto/rsa/ |
| rsa_gen.c | 89 BIGNUM *factor = NULL, *newpp = NULL, *newpd = NULL; local
153 factor = sk_BIGNUM_value(factors, i);
155 if (!BN_mul(r1, r1, factor, ctx))
176 factor = sk_BIGNUM_value(factors, i);
181 if (!BN_sub(dval, factor, BN_value_one()))
478 * For keys with more than 4 primes, we attempt longer factor to
531 /* mirror this in our factor stack */
|
