| /src/external/bsd/zstd/dist/lib/ |
| zdict.h | 192 * Redirect towards ZDICT_optimizeTrainFromBuffer_fastCover() single-threaded, with d=8, steps=4,
308 unsigned steps; /* Number of steps : Only used for optimization : 0 means default (40) : Higher means more parameters checked */ member in struct:__anon8832
320 unsigned steps; /* Number of steps : Only used for optimization : 0 means default (40) : Higher means more parameters checked */ member in struct:__anon8833
355 * All of the parameters d, k, steps are optional.
357 * if steps is zero it defaults to its default value.
358 * If k is non-zero then we don't check multiple values of k, otherwise we check steps values in [50, 2000].
397 * All of the parameters d, k, steps, f, and accel are optional.
399 * if steps is zero it defaults to its default value
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| value-prof.h | 62 unsigned int steps; /* Number of values in it. */
61 unsigned int steps; \/* Number of values in it. *\/ member in struct:histogram_value_t::__anon14014::__anon14015
|
| value-prof.cc | 235 + hist->hdata.intvl.steps - 1));
238 for (i = 0; i < hist->hdata.intvl.steps; i++)
243 if (i != hist->hdata.intvl.steps - 1)
324 streamer_write_uhwi (ob, hist->hdata.intvl.steps);
363 new_val->hdata.intvl.steps = streamer_read_uhwi (ib);
364 ncounters = new_val->hdata.intvl.steps + 2;
1124 unsigned int i, steps; local
1146 for (i = 0; i < histogram->hdata.intvl.steps; i++)
1151 steps = histogram->hdata.intvl.steps;
[all...] |
| tree-profile.cc | 1474 tree steps = build_int_cst_type (unsigned_type_node, local
1475 value->hdata.intvl.steps);
1482 ref_ptr, val, start, steps);
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| value-prof.h | 62 unsigned int steps; /* Number of values in it. */
61 unsigned int steps; \/* Number of values in it. *\/ member in struct:histogram_value_t::__anon16437::__anon16438
|
| tree-profile.cc | 307 tree steps = build_int_cst_type (unsigned_type_node, local
308 value->hdata.intvl.steps);
315 ref_ptr, val, start, steps);
|
| value-prof.cc | 235 + hist->hdata.intvl.steps - 1));
238 for (i = 0; i < hist->hdata.intvl.steps; i++)
243 if (i != hist->hdata.intvl.steps - 1)
324 streamer_write_uhwi (ob, hist->hdata.intvl.steps);
375 new_val->hdata.intvl.steps = streamer_read_uhwi (ib);
376 ncounters = new_val->hdata.intvl.steps + 2;
1136 unsigned int i, steps; local
1158 for (i = 0; i < histogram->hdata.intvl.steps; i++)
1163 steps = histogram->hdata.intvl.steps;
[all...] |
| /src/external/ibm-public/postfix/dist/src/smtp/ |
| smtp_sasl_glue.c | 323 int steps = 0; local
406 if (++steps > 100) {
|
| /src/external/bsd/openldap/dist/servers/lloadd/ |
| tier_bestof.c | 182 int steps; local
185 steps = now - b->b_last_update;
186 if ( b->b_weight && steps > 0 ) {
200 if ( steps > 10 ) {
202 } else if ( steps > 1 ) {
203 factor = 1 / ( pow( ( 1 / factor ) + 1, steps ) - 1 );
|
| /src/external/bsd/tre/dist/tests/ |
| bench.c | 145 int steps = 20; local
164 steps = atoi(optarg);
197 len = len + (max_len/steps);
217 len = len + (max_len/steps);
236 len = len + (max_len/steps);
256 len = len + (max_len/steps);
288 len = len + (max_len/steps);
317 len = len + (max_len/steps);
343 len = len + (max_len/steps);
373 len = len + (max_len/steps);
[all...] |
| /src/bin/pax/ |
| tables.c | 1328 int steps; local
1344 * calculate the number of u_int size steps in the string and if
1347 steps = len/sizeof(u_int);
1355 for (i = 0; i < steps; ++i) {
|
| /src/sys/dev/pci/ |
| voyager.c | 447 int ifreq, factor, bit, steps; local
451 * find the smallest divider that gets us within 4096 steps of the
458 steps = 96000000 / (factor * freq);
465 hi = steps * duty_cycle / 1000;
468 lo = steps - hi;
470 hi = steps - 1;
473 DPRINTF("%d hz -> %d, %d, %d / %d\n", freq, factor, steps, lo, hi);
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/ |
| HexagonISelDAGToDAGHVX.cpp | 42 // Forward delta network consists of log(N) steps, where N is the number
55 // Steps:
91 // Reverse delta network is same as delta network, with the steps in
369 unsigned steps() const { function in namespace:__anon4879
|
| /src/external/gpl3/gcc.old/dist/gcc/config/sh/ |
| divtab.cc | 137 int steps = N_ENTRIES / 2; local
138 double step = 1. / steps;
143 double x_low = (i < steps ? 1. : -3.) + i * step;
183 calc_defect (-2., constants[steps], factors[steps]));
187 for (i = steps; i < 2 * steps; i++)
190 for (i = steps; i < 2*steps; i++)
192 printf ("\t.skip %d\n", steps);
[all...] |
| /src/games/adventure/ |
| init.c | 109 int keys, lamp, grate, cage, rod, rod2, steps, /* mnemonics */ variable
192 steps = vocab(DECR('s', 't', 'e', 'p', 's'), 1, 0);
|
| /src/sys/arch/mac68k/obio/ |
| iwm_fd.c | 1750 int steps; local
1812 steps = loc->track - loc->oldTrack;
1814 if (steps != 0)
1815 ierr = iwmSeek(steps);
|
| /src/usr.sbin/installboot/ |
| evboards.c | 196 * -- board uses a single set of steps for all boot media
206 * -- These installation steps will be selectable using
232 * The installation objects provide a description of the steps needed
267 * Some installations require multiple steps with special handling.
395 * may be the case that two media types have identical steps. It
412 * <-- Steps for eMMC are identical to SDMMC on this board. -->
642 * over the steps.)
1491 * Get the install steps for a given install object.
1506 evb_ubsteps_next_step(ib_params *params, evb_ubsteps steps)
1508 prop_dictionary_t step = prop_object_iterator_next(steps);
1888 evb_ubsteps steps; local
[all...] |
| /src/external/bsd/less/dist/ |
| search.c | 406 int steps = 0; local
431 if (steps >= HILITE_LOOKASIDE_STEPS)
433 steps++;
|
| /src/sys/external/bsd/drm2/dist/drm/radeon/ |
| radeon_rv770_dpm.c | 1240 u32 steps = 0; local
1248 steps = (max - min) / step + 1;
1250 if (steps > MAX_NO_VREG_STEPS)
1253 for (i = 0; i < steps; i++) {
1274 pi->valid_vddc_entries = (u8)steps;
|
| /src/external/apache2/llvm/dist/clang/include/clang/Sema/ |
| Initialization.h | 967 /// Steps taken by this initialization.
968 SmallVector<Step, 4> Steps;
1131 /// record of the steps required to perform the initialization.
1211 step_iterator step_begin() const { return Steps.begin(); }
1212 step_iterator step_end() const { return Steps.end(); }
1216 step_range steps() const { return {step_begin(), step_end()}; } function in class:clang::InitializationSequence
1354 /// Add steps to unwrap a initializer list for a reference around a
|
| /src/external/mit/isl/dist/ |
| isl_transitive_closure.c | 156 * If "project" is set and if "steps" can only result in acyclic paths,
212 /* Given a set of n offsets v_i (the rows of "steps"), construct a relation
215 * by taking a non-negative number of steps along any of
221 * For any element in this relation, the number of steps taken
225 __isl_keep isl_mat *steps)
236 if (d < 0 || nparam < 0 || !steps)
239 n = steps->n_row;
247 isl_assert(steps->ctx, i == k, goto error);
267 steps->row[j][i]);
524 * by taking a non-negative number of steps along any o
776 struct isl_mat *steps = NULL; local
[all...] |
| /src/external/gpl3/gdb.old/dist/gdb/ |
| btrace.c | 2458 unsigned int index, steps; local
2461 steps = 0;
2481 steps += 1;
2499 steps += adv;
2514 steps -= 1;
2531 return steps;
2540 unsigned int index, steps; local
2543 steps = 0;
2568 steps += 1;
2579 steps += adv
2769 int steps = 0; local
[all...] |
| record-btrace.c | 2076 /* GDB stores the current frame_id when stepping in order to detects steps
2101 unsigned int steps; local
2103 steps = btrace_insn_prev (replay, 1);
2104 if (steps == 0)
2403 unsigned int steps; local
2407 steps = btrace_insn_next (replay, 1);
2408 if (steps == 0)
2467 unsigned int steps; local
2469 steps = btrace_insn_prev (replay, 1);
2470 if (steps == 0
2887 unsigned int steps; local
[all...] |
| /src/external/gpl3/gdb.old/dist/gdb/mi/ |
| mi-main.c | 1565 size_t len_hex, len_bytes, len_units, i, steps, remaining_units; local
1608 steps = count_units / len_units;
1611 for (i = 0; i < steps; i++)
1615 memcpy (&data[steps * len_bytes], &databuf[0],
|
| /src/external/gpl3/gdb/dist/gdb/ |
| btrace.c | 2458 unsigned int index, steps; local
2461 steps = 0;
2481 steps += 1;
2499 steps += adv;
2514 steps -= 1;
2531 return steps;
2540 unsigned int index, steps; local
2543 steps = 0;
2568 steps += 1;
2579 steps += adv
2769 int steps = 0; local
[all...] |
