/freebsd-11-stable/usr.bin/factor/ |
H A D | Makefile | 2 # $FreeBSD: stable/11/usr.bin/factor/Makefile 319186 2017-05-30 04:27:05Z ngie $ 6 PROG= factor 7 SRCS= factor.c pr_tbl.c 15 MAN= factor.6 16 MLINKS+=factor.6 primes.6
|
/freebsd-11-stable/usr.bin/primes/ |
H A D | primes.c | 206 ubig factor; /* index and factor */ local 242 for (p = &prime[0], factor = prime[0]; 243 factor < stop && p <= pr_limit; factor = *(++p)) { 244 if (factor >= start) { 245 printf(hflag ? "%" PRIx64 "\n" : "%" PRIu64 "\n", factor); 261 * factor out 3, 5, 7, 11 and 13 264 factor = (start%(2*3*5*7*11*13))/2; /* starting copy spot */ 265 memcpy(table, &pattern[factor], pattern_siz [all...] |
/freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/detail/binary_heap_/ |
H A D | resize_policy.hpp | 123 factor = 2 enumerator in enum:pb_ds::detail::resize_policy::__anon2051 170 { return m_next_grow_size* factor; } 177 const size_type half_size = m_next_grow_size / factor; 188 ret *= factor; 199 m_next_grow_size *= factor; 210 m_next_shrink_size /= factor; 215 std::max(m_next_grow_size / factor, static_cast<size_type>(min_size));
|
/freebsd-11-stable/contrib/netbsd-tests/games/ |
H A D | t_factor.sh | 30 ncrypt=$( ldd /usr/games/factor | grep -c -- -lcrypt ) 34 atf_check -s eq:0 -o file:expout -e empty /usr/games/factor ${1} 40 atf_set "require.progs" "/usr/games/factor" 49 atf_set "require.progs" "/usr/games/factor" 59 atf_set "require.progs" "/usr/games/factor" 69 atf_set "require.progs" "/usr/games/factor"
|
/freebsd-11-stable/sys/contrib/ck/include/ |
H A D | ck_brlock.h | 108 ck_brlock_write_trylock(struct ck_brlock *br, unsigned int factor) argument 114 if (++steps >= factor) 128 if (++steps >= factor) { 222 unsigned int factor) 233 if (++steps >= factor) 262 if (++steps >= factor) 220 ck_brlock_read_trylock(struct ck_brlock *br, struct ck_brlock_reader *reader, unsigned int factor) argument
|
/freebsd-11-stable/targets/pseudo/userland/games/ |
H A D | Makefile.depend | 7 usr.bin/factor \
|
/freebsd-11-stable/contrib/gcc/ |
H A D | lambda-mat.c | 379 int factor; local 381 factor = -1 * row[i]; 383 factor /= row[j]; 385 lambda_matrix_col_add (temp, n, j, i, factor); 386 lambda_matrix_col_add (inv, n, j, i, factor); 426 int factor = -row[i]; local 427 lambda_matrix_col_add (temp, n, j, i, factor); 428 lambda_matrix_col_add (inv, n, j, i, factor); 446 int i, j, factor, minimum_col; local 474 factor 507 int sigma, factor, a, b; local 552 int sigma, factor, a, b; local [all...] |
H A D | tree-ssa-loop-prefetch.c | 751 time). UNROLL_FACTOR is the factor by that the loop is going to be 817 is the factor by which LOOP was unrolled. */ 858 factor by that LOOP was unrolled. */ 878 unsigned factor) 880 if (!can_unroll_loop_p (loop, factor, desc)) 906 unsigned factor, max_mod_constraint, ahead_factor; local 939 factor = ahead_factor; 941 factor = constraint_factor; 942 if (factor > upper_bound) 943 factor 877 should_unroll_loop_p(struct loop *loop, struct tree_niter_desc *desc, unsigned factor) argument [all...] |
H A D | tree-ssa-loop-manip.c | 640 can_unroll_loop_p (struct loop *loop, unsigned factor, argument 673 if (tree_num_loop_insns (loop) * factor 688 unsigned factor, tree *enter_cond, 745 build_int_cst_type (type, factor)); 840 tree_unroll_loop (struct loops *loops, struct loop *loop, unsigned factor, argument 859 determine_exit_conditions (loop, desc, factor, 883 wont_exit = sbitmap_alloc (factor); 886 (loop, loop_latch_edge (loop), loops, factor - 1, 900 est_niter = est_niter / factor + 1; 687 determine_exit_conditions(struct loop *loop, struct tree_niter_desc *desc, unsigned factor, tree *enter_cond, tree *exit_base, tree *exit_step, enum tree_code *exit_cmp, tree *exit_bound) argument
|
/freebsd-11-stable/usr.bin/units/ |
H A D | units.c | 60 double factor; member in struct:unittype 229 theunit->factor = 1.0; 259 printf(numfmt, theunit->factor); 361 theunit->factor *= num; 364 theunit->factor /= num; 374 theunit->factor /= num; 377 theunit->factor *= num; 389 theunit->factor *= num; 392 theunit->factor /= num; 683 (have->factor [all...] |
/freebsd-11-stable/sys/dev/acpica/ |
H A D | acpi_smbat.c | 348 uint32_t factor; local 366 factor = 10; 368 factor = 1; 389 sc->bst.rate = val * factor; 393 sc->bst.rate = (-val) * factor; 399 sc->bst.cap = val * factor; 420 uint32_t factor; local 444 factor = 10; 447 factor = 1; 453 sc->bix.dcap = val * factor; [all...] |
/freebsd-11-stable/contrib/wpa/src/ap/ |
H A D | acs.c | 42 * 2. interference factor is calculated for each channel 66 * Survey interference factor implementation details 70 * The survey interference factor is defined as the ratio of the 106 * All this "interference factor" is purely subjective and only time 109 * of the interference factor then is dependent on what the card itself 115 * The above channel interference factor is calculated with no respect to 124 * interference factor is computed by summing up interferences of each channel 127 * Note: This implies base channel interference factor must be non-negative 140 * ACS: * interference factor average: 0.0557166 147 * ACS: * interference factor averag 296 long double factor, busy, total; local 579 long double factor, ideal_factor = 0; local [all...] |
/freebsd-11-stable/contrib/llvm-project/openmp/runtime/src/ |
H A D | kmp_str.cpp | 549 int result, factor; local 562 factor = 1; 567 factor = 1; 572 factor = 1024; 577 factor = (1024 * 1024); 583 factor = 1; 586 if (result > (INT_MAX / factor)) 589 result *= factor; 605 size_t dfactor, // I: The factor if none of the letters specified. 610 size_t factor local [all...] |
H A D | kmp_stats.cpp | 127 void statistic::scale(double factor) { argument 128 minVal = minVal * factor; 129 maxVal = maxVal * factor; 130 meanVal = meanVal * factor; 131 m2 = m2 * factor * factor;
|
/freebsd-11-stable/contrib/groff/src/roff/troff/ |
H A D | dictionary.h | 46 double factor; member in class:dictionary
|
H A D | dictionary.cpp | 41 dictionary::dictionary(int n) : size(n), used(0), threshold(0.5), factor(1.5) 71 size = int(size*factor);
|
/freebsd-11-stable/contrib/llvm-project/libcxx/src/ |
H A D | chrono.cpp | 157 static const double factor = compute_steady_factor(); local 158 return static_cast<steady_clock::rep>(mach_absolute_time() * factor);
|
/freebsd-11-stable/bin/sh/ |
H A D | miscbltin.c | 442 int factor; /* multiply by to get rlim_{cur,max} values */ member in struct:limits 511 val /= l->factor; 565 if (uval > UINTMAX_MAX / l->factor) 567 uval *= l->factor;
|
/freebsd-11-stable/sys/fs/ext2fs/ |
H A D | ext2_inode.c | 387 e4fs_daddr_t blkcount, factor, blocksreleased = 0; local 394 factor = 1; 396 factor *= NINDIR(fs); 399 last /= factor; 445 for (i = NINDIR(fs) - 1, nlbn = lbn + 1 - i * factor; i > last; 446 i--, nlbn += factor) { 464 last = lastbn % factor;
|
/freebsd-11-stable/sys/fs/nandfs/ |
H A D | bmap.c | 304 nandfs_lbn_t i, lbn, nlbn, factor, tosub; local 315 factor = lbn_offset(fsdev, level); 334 for (nlbn = lbn + 1 - i * factor; i >= 0 && *left > 0; i--, 335 nlbn += factor) {
|
/freebsd-11-stable/contrib/subversion/subversion/libsvn_fs_x/ |
H A D | dag_cache.c | 318 /* "randomizing" / distributing factor used in our hash function */ 319 const apr_uint32_t factor = 0xd1f3da69; 345 hash_value = hash_value * factor * factor 346 + ( *(const apr_uint32_t*)(path->data + i) * factor 317 const apr_uint32_t factor = 0xd1f3da69; local
|
/freebsd-11-stable/sys/ufs/ffs/ |
H A D | ffs_inode.c | 661 ufs2_daddr_t blkcount, factor, blocksreleased = 0; local 673 factor = lbn_offset(fs, level); 676 last /= factor; 742 for (i = NINDIR(fs) - 1, nlbn = lbn + 1 - i * factor; i > last; 743 i--, nlbn += factor) { 762 last = lastbn % factor;
|
/freebsd-11-stable/contrib/file/src/ |
H A D | apprentice.c | 986 val += m->factor; 989 val -= m->factor; 992 val *= m->factor; 995 val /= m->factor; 2273 unsigned long factor; local 2279 m->factor_op, m->factor); 2297 file_magwarn(ms, "Unknown factor op `%c'", *l); 2301 factor = strtoul(l, &el, 0); 2302 if (factor > 255) { 2303 file_magwarn(ms, "Too large factor ` [all...] |
/freebsd-11-stable/sys/dev/mlx4/mlx4_en/ |
H A D | mlx4_en_tx.c | 362 int factor = priv->cqe_factor; local 368 cqe = &buf[(index << factor) + factor]; 407 cqe = &buf[(index << factor) + factor];
|
H A D | mlx4_en_rx.c | 735 * The following calc ensures that when factor==1, it means we are aligned to 64B 737 #define CQE_FACTOR_INDEX(index, factor) (((index) << (factor)) + (factor)) 754 int factor = priv->cqe_factor; local 764 cqe = &buf[CQE_FACTOR_INDEX(index, factor)]; 846 cqe = &buf[CQE_FACTOR_INDEX(index, factor)];
|