Home
last modified time | relevance | path

Searched refs:steps (Results 1 – 25 of 180) sorted by relevance

12345678

/NextBSD/lib/libc/stdlib/
HDtsearch_path.h46 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()
/NextBSD/contrib/llvm/tools/lldb/source/DataFormatters/
HDLibCxxMap.cpp167 size_t steps = 0; in advance() local
171 count--, steps++; in advance()
174 (steps > m_max_depth)) in advance()
191 size_t steps = 0; in next() local
200 steps++; in next()
201 if (steps > m_max_depth) in next()
217 size_t steps = 0; in tree_min() local
227 steps++; in tree_min()
228 if (steps > m_max_depth) in tree_min()
/NextBSD/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/llquantize/
HDtst.steps.d.out1 20 steps:
36 100 steps:
224 1000 steps:
/NextBSD/tools/regression/geom_gpt/
HDgctl.t37 my %steps = (
148 $count = keys (%steps);
153 foreach my $key (sort keys %steps) {
154 my ($action, $args) = split(/ /, $steps{$key}, 2);
/NextBSD/sys/dev/pdq/
HDpdq_ifsubr.c555 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 …]
/NextBSD/sys/dev/nand/
HDnand.c421 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 …]
/NextBSD/contrib/ntp/scripts/
HDsummary-opts36 '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
HDsummary-opts.def57 name = skip-time-steps;
/NextBSD/cddl/usr.sbin/dtrace/tests/common/llquantize/
HDMakefile38 tst.steps.d \
39 tst.steps.d.out \
/NextBSD/contrib/gcc/
HDtree-profile.c143 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()
HDvalue-prof.c649 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()
HDlibgcov.c703 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()
HDvalue-prof.h57 unsigned int steps; /* Number of values in it. */ member
HDlambda-code.c1216 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()
/NextBSD/contrib/gperf/src/
HDsearch.cc1120 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()
/NextBSD/contrib/tcsh/
HDREADME.imake2 If you have imake running on your machine, you may skip steps 1 and 2
/NextBSD/contrib/pjdfstest/
HDREADME3 Few notes on how to use pjdfstest in short steps:
/NextBSD/contrib/ofed/libibcm/
HDREADME8 Typically the autogen and configure steps only need be done the first
/NextBSD/crypto/openssl/
HDREADME66 If you have any problems with OpenSSL then please take the following steps
84 - Problem Description (steps that will reproduce the problem, if known)
/NextBSD/contrib/netbsd-tests/fs/tmpfs/
HDREADME13 remove the need to do the mount/unmount steps in each and every test case.
/NextBSD/bin/pax/
HDtables.c1235 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()
/NextBSD/contrib/ofed/librdmacm/
HDREADME9 Typically the autogen and configure steps only need be done the first
/NextBSD/contrib/groff/contrib/pdfmark/
HDTODO46 takes care of the necessary intermediate steps to handle
/NextBSD/cddl/contrib/dtracetoolkit/Perl/
HDReadme13 To get this and these scripts working, the rough steps are,
/NextBSD/cddl/contrib/dtracetoolkit/Php/
HDReadme13 The steps are roughly,

12345678