| /src/external/lgpl3/mpfr/dist/src/ |
| scale2.c | 62 double factor;
74 factor = 0.5;
79 factor = 2.0;
84 d *= factor;
86 factor *= factor;
|
| /src/games/factor/ |
| Makefile | 8 PROG= factor
9 SRCS= factor.c pr_tbl.c
16 COPTS.factor.c+= -Wno-error=deprecated-declarations
18 MAN= factor.6
|
| /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/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/gpl3/gcc/dist/gcc/ |
| tree-vector-builder.cc | 27 /* Return a vector element with the value BASE + FACTOR * STEP. */
30 tree_vector_builder::apply_step (tree base, unsigned int factor,
34 wi::to_wide (base) + factor * step);
|
| vec-perm-indices.cc | 81 as ORIG, but with each element split into FACTOR pieces. For example,
82 if ORIG is { 1, 2, 0, 3 } and FACTOR is 2, the new permutation is
87 unsigned int factor)
90 m_nelts_per_input = orig.m_nelts_per_input * factor;
91 m_encoding.new_vector (orig.m_encoding.full_nelts () * factor,
92 orig.m_encoding.npatterns () * factor,
97 element_type base = orig.m_encoding[i] * factor;
98 for (unsigned int j = 0; j < factor; ++j)
106 built up from FACTOR pieces. Return true if yes, otherwise
107 return false. Every FACTOR permutation indexes should b
[all...] |
| int-vector-builder.h | 84 /* Return a vector element with the value BASE + FACTOR * STEP. */
88 int_vector_builder<T>::apply_step (T base, unsigned int factor, T step) const
90 return base + factor * step;
|
| rtx-vector-builder.cc | 45 /* Return a vector element with the value BASE + FACTOR * STEP. */
48 rtx_vector_builder::apply_step (rtx base, unsigned int factor,
53 + factor * step,
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| tree-vector-builder.cc | 27 /* Return a vector element with the value BASE + FACTOR * STEP. */
30 tree_vector_builder::apply_step (tree base, unsigned int factor,
34 wi::to_wide (base) + factor * step);
|
| vec-perm-indices.cc | 81 as ORIG, but with each element split into FACTOR pieces. For example,
82 if ORIG is { 1, 2, 0, 3 } and FACTOR is 2, the new permutation is
87 unsigned int factor)
90 m_nelts_per_input = orig.m_nelts_per_input * factor;
91 m_encoding.new_vector (orig.m_encoding.full_nelts () * factor,
92 orig.m_encoding.npatterns () * factor,
97 element_type base = orig.m_encoding[i] * factor;
98 for (unsigned int j = 0; j < factor; ++j)
106 built up from FACTOR pieces. Return true if yes, otherwise
107 return false. Every FACTOR permutation indexes should b
[all...] |
| int-vector-builder.h | 84 /* Return a vector element with the value BASE + FACTOR * STEP. */
88 int_vector_builder<T>::apply_step (T base, unsigned int factor, T step) const
90 return base + factor * step;
|
| rtx-vector-builder.cc | 45 /* Return a vector element with the value BASE + FACTOR * STEP. */
48 rtx_vector_builder::apply_step (rtx base, unsigned int factor,
53 + factor * step,
|
| /src/external/lgpl3/gmp/dist/ |
| gen-psqr.c | 129 struct factor_t *factor; variable in typeref:struct:factor_t
130 int nfactor; /* entries in use in factor array */
131 int factor_alloc; /* entries allocated to factor array */
246 factor = (struct factor_t *) xmalloc (factor_alloc * sizeof (*factor));
300 /* if a repeated prime is found it's used as an i^n in one factor */
328 sprintf (mod34_excuse, "only %d small factor%s",
385 /* start the factor array */
390 factor[nfactor].divisor = 1;
392 factor[nfactor].divisor *= rawfactor[i].divisor
[all...] |
| /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/external/gpl3/gcc.old/dist/gcc/config/sh/ |
| divtab.cc | 85 calc_defect (double x, int constant, int factor)
87 double y0 = (constant - (int) floor ((x * factor * 64.))) / 16384.;
146 int factor, constant; local
149 factor = (1./x_low- 1./x_high) / step * 256. + 0.5;
150 if (factor == 256)
151 factor = 255;
152 factors[i] = factor;
154 x_med = sqrt (256./factor);
157 low_defect = 1. / x_low + x_low * factor / 256.;
158 high_defect = 1. / x_high + x_high * factor / 256.
[all...] |
| /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/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/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/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.threads/ |
| watchpoint-fork.exp | 59 set factor 20
61 set factor 1
86 with_timeout_factor $factor {
|
| /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.threads/ |
| watchpoint-fork.exp | 61 set factor 20
63 set factor 1
88 with_timeout_factor $factor {
|
| /src/games/trek/ |
| schedule.c | 142 ** Parameters are the event index and a factor for the time
147 xsched(int ev1, int factor, int x, int y, int z)
153 when = -Param.eventdly[ev] * Param.time * log(franf()) / factor;
162 ** division factor. Look at the code to see what really happens.
166 xresched(struct event *e1, int ev1, int factor)
174 when = -Param.eventdly[ev] * Param.time * log(franf()) / factor;
|
| /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/bsd/unbound/dist/testdata/ip_ratelimit.tdir/ |
| ip_ratelimit.conf | 15 ip-ratelimit-factor: 0
|
| /src/external/bsd/unbound/dist/testdata/ratelimit.tdir/ |
| ratelimit.conf | 14 ratelimit-factor: 0
|
