| /freebsd-10-stable/contrib/llvm/tools/lldb/source/DataFormatters/ |
| H A D | LibCxxMap.cpp | 131 size_t steps = 0; local
140 steps++;
141 if (steps > m_max_depth)
161 size_t steps = 0; local
171 steps++;
172 if (steps > m_max_depth)
185 size_t steps = 0; local
192 steps++;
193 if (steps > m_max_depth)
219 size_t steps
[all...] |
| /freebsd-10-stable/cddl/usr.sbin/dtrace/tests/common/llquantize/ |
| H A D | Makefile | 38 tst.steps.d \
39 tst.steps.d.out \
|
| /freebsd-10-stable/tools/regression/geom_gpt/ |
| H A D | 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-10-stable/contrib/gcc/ |
| H A D | value-prof.h | 57 unsigned int steps; /* Number of values in it. */ member in struct:histogram_value_t::__anon1224::__anon1225
|
| H A D | tree-profile.c | 144 tree steps = build_int_cst_type (unsigned_type_node, value->hdata.intvl.steps);
153 tree_cons (NULL_TREE, steps,
143 tree steps = build_int_cst_type (unsigned_type_node, value->hdata.intvl.steps); local
|
| H A D | libgcov.c | 703 int start, unsigned steps)
707 counters[steps + 1]++;
708 else if (delta >= steps)
709 counters[steps]++;
702 __gcov_interval_profiler(gcov_type *counters, gcov_type value, int start, unsigned steps) argument
|
| H A D | value-prof.c | 649 for (i = 0; i < histogram->hdata.intvl.steps; i++)
663 for (i = 0; i < histogram->hdata.intvl.steps; i++)
669 if (i == histogram->hdata.intvl.steps)
682 /* In practice, "steps" is always 2. This interface reflects this,
683 and will need to be changed if "steps" can change. */
763 hist->hdata.intvl.steps = 2;
809 + hist->hdata.intvl.steps - 1));
811 hist->n_counters = hist->hdata.intvl.steps + 2;
|
| H A D | lambda-code.c | 764 the loop steps (positive or negative) is then used to swap the bounds if
1043 /* Keep track of the signs of the loop steps. */
1216 VEC(int,heap) ** steps)
1401 VEC_safe_push (int, heap, *steps, stepint);
1472 VEC(int,heap) *steps = NULL;
1485 &steps);
1497 lboundvars, uboundvars, steps, *inductionvars))
1518 VEC_free (int, heap, steps);
2446 VEC(int,heap) *steps,
2536 build_int_cst (TREE_TYPE (oldivvar), VEC_index (int, steps,
1210 gcc_loop_to_lambda_loop(struct loop *loop, int depth, VEC(tree,heap) ** invariants, tree * ourinductionvar, VEC(tree,heap) * outerinductionvars, VEC(tree,heap) ** lboundvars, VEC(tree,heap) ** uboundvars, VEC(int,heap) ** steps) argument
2442 perfect_nestify(struct loops *loops, struct loop *loop, VEC(tree,heap) *lbounds, VEC(tree,heap) *ubounds, VEC(int,heap) *steps, VEC(tree,heap) *loopivs) argument
[all...] |
| /freebsd-10-stable/sys/dev/nand/ |
| H A D | nand.c | 430 int steps = pagesize / SOFTECC_SIZE; local
433 for (; i < (steps * SOFTECC_BYTES);
445 int steps = pagesize / SOFTECC_SIZE; local
448 for (i = 0; i < (steps * SOFTECC_BYTES);
476 uint32_t page, num, steps = 0; local
486 steps = cg->page_size / eccd->eccsize;
513 for (i = 0; i < (eccd->eccbytes * steps); i++)
523 for (i = 0; i < (eccd->eccbytes * steps); i++)
528 for (i = 0; i < (eccd->eccbytes * steps); i++)
630 int steps local
[all...] |
| /freebsd-10-stable/sys/dev/pdq/ |
| H A D | pdq_ifsubr.c | 560 int steps = 0;
568 steps = 1;
574 steps = 2;
579 steps = 3;
585 steps = 4;
592 steps = 5;
599 steps = 6;
605 steps = 7;
611 steps = 8;
621 steps
554 int steps = 0; local
[all...] |
| /freebsd-10-stable/contrib/ntp/scripts/ |
| H A D | summary-opts.def | 57 name = skip-time-steps;
|
| /freebsd-10-stable/contrib/gperf/src/ |
| H A D | search.cc | 84 Based on these three facts, we find the hash function in three steps:
905 means that we split the work into several steps. Each step chooses
923 We choose the steps in such a way that the partition really becomes
1117 Step *steps; local
1119 /* Determine the steps, starting with the last one. */
1124 steps = NULL;
1230 step->_next = steps;
1231 steps = step;
1241 for (Step *step = steps; step; step = step->_next)
1274 for (Step *step = steps; ste
[all...] |
| /freebsd-10-stable/bin/pax/ |
| H A D | tables.c | 1235 int steps; local
1251 * calculate the number of u_int size steps in the string and if
1254 steps = len/sizeof(u_int);
1262 for (i = 0; i < steps; ++i) {
|
| /freebsd-10-stable/contrib/compiler-rt/lib/sparc64/ |
| H A D | divmod.m4 | 174 ! do single-bit divide steps
|
| H A D | divsi3.S | 115 ! do single-bit divide steps
|
| H A D | modsi3.S | 115 ! do single-bit divide steps
|
| /freebsd-10-stable/contrib/less/ |
| H A D | search.c | 442 int steps = 0; local
467 if (steps >= HILITE_LOOKASIDE_STEPS)
469 steps++;
|
| /freebsd-10-stable/contrib/gcc/config/sparc/ |
| H A D | lb1spc.asm | 205 ! do single-bit divide steps
552 ! do single-bit divide steps
|
| /freebsd-10-stable/sys/dev/aic7xxx/ |
| H A D | aic7xxx.c | 1429 int steps; local
1437 steps = 0;
1463 if (steps > AHC_MAX_STEPS) {
1470 steps++;
|
| H A D | aic79xx.c | 2596 int steps; local
2610 steps = 0;
2638 if (steps > AHD_MAX_STEPS) {
2648 steps++;
|