Searched refs:step (Results 26 - 50 of 183) sorted by relevance

12345678

/freebsd-current/contrib/llvm-project/llvm/lib/Support/
H A Dregengine.inc51 #define step sstep
64 #define step lstep
97 static states step(struct re_guts *, sopno, sopno, states, int, states);
301 /* Always step back at least one character. */
722 - fast - step through the string at top speed
740 st = step(m->g, startst, stopst, st, NOTHING, st);
766 st = step(m->g, startst, stopst, st, flagch, st);
780 st = step(m->g, startst, stopst, st, flagch, st);
792 st = step(m->g, startst, stopst, tmp, c, st);
794 assert(EQ(step(
[all...]
/freebsd-current/contrib/kyua/store/
H A Dwrite_transaction_test.cpp90 ATF_REQUIRE(stmt.step());
97 ATF_REQUIRE(!stmt.step());
198 ATF_REQUIRE(stmt.step());
206 ATF_REQUIRE(!stmt.step());
253 ATF_REQUIRE(!stmt.step());
281 ATF_REQUIRE(stmt.step());
287 ATF_REQUIRE(!stmt.step());
309 ATF_REQUIRE(!stmt.step());
H A Dmigrate.cpp84 /// Performs a single migration step.
90 /// \param file Database on which to apply the migration step.
168 while (actions_stmt.step()) {
176 if (!start_time_stmt.step()) {
258 /// The algorithm implemented here performs a migration step for every
H A Dwrite_backend_test.cpp72 ATF_REQUIRE(stmt.step());
74 ATF_REQUIRE(!stmt.step());
H A Dwrite_backend.cpp78 return !stmt.step();
/freebsd-current/contrib/kyua/cli/
H A Dcmd_db_exec.cpp184 if (stmt.step()) {
189 while (stmt.step());
/freebsd-current/crypto/heimdal/lib/krb5/
H A Dtest_crypto_wrapping.c41 size_t step,
69 for (size = min_size; size < max_size; size += step) {
38 test_wrapping(krb5_context context, size_t min_size, size_t max_size, size_t step, krb5_enctype etype) argument
/freebsd-current/contrib/libarchive/libarchive/
H A Darchive_blake2sp_ref.c302 size_t i, step; local
323 for(step = 1; step < BLAKE2S_BLOCKBYTES; ++step) {
335 while (mlen >= step) {
336 if ( (err = blake2sp_update(&S, p, step)) < 0 ) {
339 mlen -= step;
340 p += step;
/freebsd-current/contrib/dialog/
H A Dpause.c68 int i, x, y, step; local
190 for (step = 0;
191 (result == DLG_EXIT_UNKNOWN) && (step < 1000);
192 step += MY_TIMEOUT) {
H A Dbuttons.c284 dlg_button_x_step(const char **labels, int limit, int *gap, int *margin, int *step) argument
307 *step = *gap + (used + count - 1) / count;
321 int gap, margin, step; local
326 while (!dlg_button_x_step(labels, width, &gap, &margin, &step))
348 int step = 0; local
365 step = 1;
367 dlg_button_x_step(labels, limit, &gap, &margin, &step);
402 if ((y += step) > limit)
405 if ((x += step) > limit)
/freebsd-current/sys/dev/sound/pci/hda/
H A Dhdaa.h140 int mute, step, size, offset; member in struct:hdaa_audio_ctl
248 (((ctl)->step - (ctl)->offset) * ((ctl)->size + 1))
251 ((ctl)->step * ((ctl)->size + 1))
258 ((ctl)->size + 1) + (ctl)->offset), (ctl)->step), 0)
/freebsd-current/sys/dev/qlxgbe/
H A Dql_misc.c102 uint32_t data, step = 0; local
109 step = 1;
115 step = 2;
121 step = 3;
128 step = 4;
134 step = 5;
140 step = 6;
146 step = 7;
152 step = 7;
158 step
[all...]
/freebsd-current/lib/libthread_db/arch/powerpc/
H A Dlibpthread_md.c77 pt_reg_sstep(struct reg *reg __unused, int step __unused)
/freebsd-current/lib/libthread_db/arch/aarch64/
H A Dlibpthread_md.c89 pt_reg_sstep(struct reg *reg __unused, int step __unused)
/freebsd-current/usr.bin/seq/
H A Dseq.c89 double first, last, incr, prev, cur, step; local
182 for (step = 1, cur = first; incr > 0 ? cur <= last : cur >= last;
183 cur = first + incr * step++) {
184 if (step > 1)
/freebsd-current/contrib/kyua/admin/
H A Dtravis-build.sh93 for step in ${DO}; do
/freebsd-current/sys/contrib/zstd/lib/common/
H A Dfse_decompress.c107 size_t const step = FSE_TABLESTEP(tableSize); local
143 size_t const uPosition = (position + (u * step)) & tableMask;
146 position = (position + (unroll * step)) & tableMask;
152 U32 const step = FSE_TABLESTEP(tableSize); local
158 position = (position + step) & tableMask;
159 while (position > highThreshold) position = (position + step) & tableMask; /* lowprob area */
/freebsd-current/lib/libthread_db/arch/amd64/
H A Dlibpthread_md.c114 pt_reg_sstep(struct reg *reg, int step) argument
119 if (step)
/freebsd-current/sys/contrib/zlib/test/
H A Dinfcover.c276 text to include in an error message, step is how much input data to feed
284 local void inf(char *hex, char *what, unsigned step, int win, unsigned len, argument
312 if (step == 0 || step > have)
313 step = have;
314 strm.avail_in = step;
315 have -= step;
339 strm.avail_in = step > have ? have : step;
/freebsd-current/contrib/llvm-project/compiler-rt/lib/builtins/
H A Dint_to_fp_impl.inc50 ++a; // round - this step may add a significant bit
/freebsd-current/contrib/llvm-project/openmp/runtime/src/
H A Dkmp_collapse.h35 // Type of bounds and step, after usual promotions
87 ST step; // signed even if bounds type is unsigned member in union:bounds_infoXX_template::__anon3068
132 // by steps). For those we need to be careful with the types, as step can be
224 // important on the left side, to hit the lower bounds and not step over), and
H A Dkmp_collapse.cpp81 if (bounds->step == 0) {
88 // We can convert this to < or >, depends on the sign of the step:
89 if (bounds->step > 0) {
166 __kmp_abs(bounds->step) +
179 __kmp_abs(bounds->step) +
344 temp = bounds->lb0 + bounds->lb1 * outer_iv + iteration * bounds->step;
409 iteration * bounds->step;
563 // We can't adjust the upper bound with respect to step, because
582 // Here it's safe to reduce the space to the multiply of step.
586 (static_cast<UT>(bbounds.ub0 - bbounds.lb0)) % bbounds.step; // ab
[all...]
/freebsd-current/sys/contrib/openzfs/module/lua/
H A Dlstring.c52 size_t step = (l >> LUAI_HASHLIMIT) + 1; local
53 for (l1 = l; l1 >= step; l1 -= step)
/freebsd-current/sys/contrib/openzfs/module/zstd/lib/common/
H A Dfse_decompress.c92 U32 const step = FSE_TABLESTEP(tableSize); local
98 position = (position + step) & tableMask;
99 while (position > highThreshold) position = (position + step) & tableMask; /* lowprob area */
/freebsd-current/contrib/nvi/regex/
H A Dengine.c51 #define step sstep macro
62 #define step lstep macro
96 static states step(struct re_guts *g, sopno start, sopno stop, states bef, int flag, RCHAR_T ch, states aft);
677 - fast - step through the string at top speed
695 st = step(m->g, startst, stopst, st, NOTHING, OUT, st);
721 st = step(m->g, startst, stopst, st, flag, OUT, st);
735 st = step(m->g, startst, stopst, st, flag, OUT, st);
747 st = step(m->g, startst, stopst, tmp, 0, c, st);
749 assert(EQ(step(m->g, startst, stopst, st, NOTHING, OUT, st), st));
762 - slow - step throug
846 step(struct re_guts *g, function
1033 #undef step macro
[all...]

Completed in 320 milliseconds

12345678