/freebsd-10-stable/games/factor/ |
H A D | Makefile | 6 PROG= factor 7 SRCS= factor.c pr_tbl.c 16 MAN= factor.6 17 MLINKS+=factor.6 primes.6
|
/freebsd-10-stable/games/primes/ |
H A D | primes.c | 205 ubig factor; /* index and factor */ local 241 for (p = &prime[0], factor = prime[0]; 242 factor < stop && p <= pr_limit; factor = *(++p)) { 243 if (factor >= start) { 244 printf(hflag ? "0x%lx\n" : "%lu\n", factor); 260 * factor out 3, 5, 7, 11 and 13 263 factor = (start%(2*3*5*7*11*13))/2; /* starting copy spot */ 264 memcpy(table, &pattern[factor], pattern_siz [all...] |
/freebsd-10-stable/games/ |
H A D | Makefile | 8 factor \
|
/freebsd-10-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::__anon1834 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-10-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-10-stable/usr.bin/units/ |
H A D | units.c | 55 double factor; member in struct:unittype 213 theunit->factor = 1.0; 243 printf("\t%.8g", theunit->factor); 344 theunit->factor *= num; 347 theunit->factor /= num; 356 theunit->factor /= num; 359 theunit->factor *= num; 370 theunit->factor *= num; 373 theunit->factor /= num; 649 (have->factor [all...] |
/freebsd-10-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
|
H A D | lambda-code.c | 775 int factor; local 835 factor = LTM_MATRIX (H)[i][i]; 849 factor); local 851 LLE_CONSTANT (target_expr) = LLE_CONSTANT (auxillary_expr) * factor; 857 invariants, factor); local 906 factor); local 907 LLE_CONSTANT (target_expr) = LLE_CONSTANT (auxillary_expr) * factor; 913 invariants, factor); local 976 int i, j, factor, minimum_column; local 1006 factor [all...] |
/freebsd-10-stable/sys/dev/acpica/ |
H A D | acpi_smbat.c | 348 uint32_t cap_units, factor; local 366 factor = 10; 369 factor = 1; 392 sc->bst.rate = val * factor; 396 sc->bst.rate = (-val) * factor; 402 sc->bst.cap = val * factor; 423 uint32_t factor; local 441 factor = 10; 444 factor = 1; 450 sc->bif.dcap = val * factor; [all...] |
/freebsd-10-stable/contrib/libc++/src/ |
H A D | chrono.cpp | 85 static const double factor = compute_steady_factor(); local 86 return static_cast<steady_clock::rep>(mach_absolute_time() * factor);
|
/freebsd-10-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);
|
H A D | env.cpp | 3190 int factor = 1; local 3193 factor *= 2; 3195 factor *= 5; 3196 if (factor == 1 || sp <= INT_MAX/factor) 3197 return if_to_a(sp*factor, decimal_point); 3201 double factor = 10.0; local 3205 double v = ceil(s*factor); 3209 factor *= 10.0;
|
/freebsd-10-stable/bin/sh/ |
H A D | miscbltin.c | 364 int factor; /* multiply by to get rlim_{cur,max} values */ member in struct:limits 463 val *= l->factor; 487 val /= l->factor; 513 val /= l->factor;
|
/freebsd-10-stable/sys/fs/ext2fs/ |
H A D | ext2_inode.c | 382 e4fs_daddr_t blkcount, factor, blocksreleased = 0; local 389 factor = 1; 391 factor *= NINDIR(fs); 394 last /= factor; 440 for (i = NINDIR(fs) - 1, nlbn = lbn + 1 - i * factor; i > last; 441 i--, nlbn += factor) { 459 last = lastbn % factor;
|
/freebsd-10-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); 333 for (nlbn = lbn + 1 - i * factor; i >= 0 && *left > 0; i--, 334 nlbn += factor) {
|
/freebsd-10-stable/sys/ufs/ffs/ |
H A D | ffs_inode.c | 589 ufs2_daddr_t blkcount, factor, blocksreleased = 0; local 599 factor = lbn_offset(fs, level); 602 last /= factor; 661 for (i = NINDIR(fs) - 1, nlbn = lbn + 1 - i * factor; i > last; 662 i--, nlbn += factor) { 681 last = lastbn % factor;
|
/freebsd-10-stable/sys/ofed/drivers/net/mlx4/ |
H A D | en_rx.c | 561 * The following calc ensures that when factor==1, it means we are alligned to 64B 563 #define CQE_FACTOR_INDEX(index, factor) ((index << factor) + factor) 583 int factor = priv->cqe_factor; local 592 cqe = &buf[CQE_FACTOR_INDEX(index, factor)]; 675 cqe = &buf[CQE_FACTOR_INDEX(index, factor)];
|
H A D | en_tx.c | 388 int factor = priv->cqe_factor; local 394 cqe = &buf[(index << factor) + factor]; 433 cqe = &buf[(index << factor) + factor];
|
/freebsd-10-stable/contrib/file/src/ |
H A D | apprentice.c | 953 val += m->factor; 956 val -= m->factor; 959 val *= m->factor; 962 val /= m->factor; 2213 unsigned long factor; local 2219 m->factor_op, m->factor); 2237 file_magwarn(ms, "Unknown factor op `%c'", *l); 2241 factor = strtoul(l, &el, 0); 2242 if (factor > 255) { 2243 file_magwarn(ms, "Too large factor ` [all...] |
/freebsd-10-stable/sys/dev/ie/ |
H A D | if_ie.c | 263 int error, factor; local 280 factor = rman_get_size(sc->mem_res) / 8192; 281 sc->nframes = factor * NFRAMES; 282 sc->nrxbufs = factor * NRXBUFS; 283 sc->ntxbufs = factor * NTXBUFS;
|
/freebsd-10-stable/cddl/contrib/opensolaris/lib/libdtrace/common/ |
H A D | dt_aggregate.c | 228 uint16_t factor = DTRACE_LLQUANTIZE_FACTOR(arg); local 236 assert(nsteps >= factor); 237 assert(nsteps % factor == 0); 240 value *= factor; 244 next = value * factor; 254 next = value * factor;
|
/freebsd-10-stable/contrib/subversion/subversion/libsvn_subr/ |
H A D | string.c | 1265 apr_uint64_t factor = 1; 1297 result += factor * (apr_uint64_t)digits[--i]; 1298 factor *= 36; 1260 apr_uint64_t factor = 1; local
|