| /freebsd-11-stable/lib/libc/stdlib/ |
| HD | tsearch_path.h | 46 uintptr_t steps[2]; member
65 p->steps[p->nsteps / STEPS_BIT] |= in path_taking_left()
75 p->steps[p->nsteps / STEPS_BIT] &= in path_taking_right()
89 result = p->steps[0] & 0x1; in path_took_left()
90 p->steps[0] = (p->steps[0] >> 1) | (p->steps[1] << (STEPS_BIT - 1)); in path_took_left()
91 p->steps[1] >>= 1; in path_took_left()
|
| /freebsd-11-stable/sys/contrib/ck/include/ |
| HD | ck_brlock.h | 111 unsigned int steps = 0; in ck_brlock_write_trylock() local
114 if (++steps >= factor) in ck_brlock_write_trylock()
128 if (++steps >= factor) { in ck_brlock_write_trylock()
224 unsigned int steps = 0; in ck_brlock_read_trylock() local
233 if (++steps >= factor) in ck_brlock_read_trylock()
262 if (++steps >= factor) in ck_brlock_read_trylock()
|
| /freebsd-11-stable/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/llquantize/ |
| HD | tst.steps.d.out | 1 20 steps:
36 100 steps:
224 1000 steps:
|
| /freebsd-11-stable/tools/regression/geom_gpt/ |
| HD | gctl_test.t | 37 my %steps = (
161 my $count = keys (%steps);
166 foreach my $key (sort keys %steps) {
167 my ($action, $args) = split(/ /, $steps{$key}, 2);
|
| /freebsd-11-stable/contrib/llvm-project/lldb/source/Plugins/Language/CPlusPlus/ |
| HD | LibCxxMap.cpp | 105 size_t steps = 0; in advance() local
108 count--, steps++; in advance()
109 if (m_error || m_entry.null() || (steps > m_max_depth)) in advance()
124 size_t steps = 0; in next() local
131 steps++; in next()
132 if (steps > m_max_depth) { in next()
145 size_t steps = 0; in tree_min() local
153 steps++; in tree_min()
154 if (steps > m_max_depth) in tree_min()
|
| /freebsd-11-stable/sys/dev/pdq/ |
| HD | pdq_ifsubr.c | 555 int steps = 0; in pdq_os_memalloc_contig() local
563 steps = 1; in pdq_os_memalloc_contig()
569 steps = 2; in pdq_os_memalloc_contig()
574 steps = 3; in pdq_os_memalloc_contig()
580 steps = 4; in pdq_os_memalloc_contig()
587 steps = 5; in pdq_os_memalloc_contig()
594 steps = 6; in pdq_os_memalloc_contig()
600 steps = 7; in pdq_os_memalloc_contig()
606 steps = 8; in pdq_os_memalloc_contig()
616 steps = 9; in pdq_os_memalloc_contig()
[all …]
|
| /freebsd-11-stable/sys/dev/nand/ |
| HD | nand.c | 421 int steps = pagesize / SOFTECC_SIZE; in nand_softecc_get() local
424 for (; i < (steps * SOFTECC_BYTES); in nand_softecc_get()
436 int steps = pagesize / SOFTECC_SIZE; in nand_softecc_correct() local
439 for (i = 0; i < (steps * SOFTECC_BYTES); in nand_softecc_correct()
467 uint32_t page, num, steps = 0; in nand_read_pages() local
477 steps = cg->page_size / eccd->eccsize; in nand_read_pages()
504 for (i = 0; i < (eccd->eccbytes * steps); i++) in nand_read_pages()
514 for (i = 0; i < (eccd->eccbytes * steps); i++) in nand_read_pages()
519 for (i = 0; i < (eccd->eccbytes * steps); i++) in nand_read_pages()
621 int steps = 0, i, needwrite, err = 0; in nand_prog_pages() local
[all …]
|
| /freebsd-11-stable/contrib/ntp/scripts/ |
| HD | summary-opts | 36 'skip-time-steps' => '3600',
43 'peer-dist-limit=f', 'skip-time-steps=f', 'start-date=i',
54 --skip-time-steps=float Ignore time offsets larger that this
|
| HD | summary-opts.def | 57 name = skip-time-steps;
|
| /freebsd-11-stable/cddl/usr.sbin/dtrace/tests/common/llquantize/ |
| HD | Makefile | 41 tst.steps.d \
42 tst.steps.d.out \
|
| /freebsd-11-stable/contrib/gcc/ |
| HD | tree-profile.c | 143 tree steps = build_int_cst_type (unsigned_type_node, value->hdata.intvl.steps); in tree_gen_interval_profiler() local
152 tree_cons (NULL_TREE, steps, in tree_gen_interval_profiler()
|
| HD | value-prof.c | 649 for (i = 0; i < histogram->hdata.intvl.steps; i++) in tree_mod_subtract_transform()
663 for (i = 0; i < histogram->hdata.intvl.steps; i++) in tree_mod_subtract_transform()
669 if (i == histogram->hdata.intvl.steps) in tree_mod_subtract_transform()
762 hist->hdata.intvl.steps = 2; in tree_divmod_values_to_profile()
808 + hist->hdata.intvl.steps - 1)); in tree_find_values_to_profile()
810 hist->n_counters = hist->hdata.intvl.steps + 2; in tree_find_values_to_profile()
|
| HD | libgcov.c | 703 int start, unsigned steps) in __gcov_interval_profiler() argument
707 counters[steps + 1]++; in __gcov_interval_profiler()
708 else if (delta >= steps) in __gcov_interval_profiler()
709 counters[steps]++; in __gcov_interval_profiler()
|
| HD | value-prof.h | 57 unsigned int steps; /* Number of values in it. */ member
|
| HD | lambda-code.c | 1216 VEC(int,heap) ** steps) in gcc_loop_to_lambda_loop()
1401 VEC_safe_push (int, heap, *steps, stepint); in gcc_loop_to_lambda_loop()
1472 VEC(int,heap) *steps = NULL; in gcc_loopnest_to_lambda_loopnest()
1485 &steps); in gcc_loopnest_to_lambda_loopnest()
1497 lboundvars, uboundvars, steps, *inductionvars)) in gcc_loopnest_to_lambda_loopnest()
1518 VEC_free (int, heap, steps); in gcc_loopnest_to_lambda_loopnest()
2446 VEC(int,heap) *steps, in perfect_nestify()
2536 build_int_cst (TREE_TYPE (oldivvar), VEC_index (int, steps, 0)), in perfect_nestify()
2622 (loop, stmt, oldivvar, VEC_index (int, steps, 0), ivvar, in perfect_nestify()
|
| /freebsd-11-stable/contrib/gperf/src/ |
| HD | search.cc | 1120 Step *steps; in find_asso_values() local
1127 steps = NULL; in find_asso_values()
1233 step->_next = steps; in find_asso_values()
1234 steps = step; in find_asso_values()
1244 for (Step *step = steps; step; step = step->_next) in find_asso_values()
1277 for (Step *step = steps; step; step = step->_next) in find_asso_values()
1461 while (steps != NULL) in find_asso_values()
1463 Step *step = steps; in find_asso_values()
1464 steps = step->_next; in find_asso_values()
|
| /freebsd-11-stable/crypto/openssl/ |
| HD | README | 66 If you have any problems with OpenSSL then please take the following steps
84 - Problem Description (steps that will reproduce the problem, if known)
|
| /freebsd-11-stable/contrib/pjdfstest/ |
| HD | README | 3 Few notes on how to use pjdfstest in short steps:
|
| /freebsd-11-stable/contrib/netbsd-tests/fs/tmpfs/ |
| HD | README | 13 remove the need to do the mount/unmount steps in each and every test case.
|
| /freebsd-11-stable/bin/pax/ |
| HD | tables.c | 1235 int steps; in st_hash() local
1254 steps = len/sizeof(u_int); in st_hash()
1262 for (i = 0; i < steps; ++i) { in st_hash()
|
| /freebsd-11-stable/contrib/groff/contrib/pdfmark/ |
| HD | TODO | 46 takes care of the necessary intermediate steps to handle
|
| /freebsd-11-stable/crypto/heimdal/lib/wind/ |
| HD | rfc4518.txt | 103 approach. Each algorithm involves two additional preparation steps.
105 a) Prior to applying the Unicode string preparation steps outlined in
108 b) After applying the Unicode string preparation steps outlined in
120 [X.501] involves the following steps:
129 These steps are described in Section 2.
320 NOTE - The previous steps ensure that the string cannot contain
345 string is exactly one SPACE. Otherwise, the following steps are
|
| /freebsd-11-stable/contrib/libpcap/ |
| HD | CONTRIBUTING.md | 22 * steps to reproduce
|
| /freebsd-11-stable/usr.bin/bmake/tests/ |
| HD | README | 26 So a full test consists of the following steps:
47 Each of these steps can independently be invoked with the test script
|
| /freebsd-11-stable/contrib/sendmail/ |
| HD | INSTALL | 6 See steps 4 and 6 in this document. We also strongly recommend reading
|