Searched refs:step (Results 51 - 75 of 183) sorted by relevance

12345678

/freebsd-current/contrib/ncurses/ncurses/tty/
H A Dlib_twait.c319 int step = (milliseconds < 0) ? 0 : 5000; local
327 for (d = 0; d < useconds; d += step) {
334 if (useconds > 1 && step > 0) {
335 snooze(step);
336 milliseconds -= (step / 1000);
/freebsd-current/cddl/contrib/opensolaris/cmd/dtrace/test/tst/common/java_api/src/
H A DTestBean.java253 int step = 10;
256 for (int i = base; i < (n * step); i += step) {
257 bucket = new Distribution.Bucket(i, (i + (step - 1)),
258 ((i - 1) / step));
261 bucket = new Distribution.Bucket((n * step) + 1, Long.MAX_VALUE, 0);
263 LinearDistribution d = new LinearDistribution(base, step, buckets);
/freebsd-current/contrib/libarchive/libarchive/
H A Darchive_read_support_format_iso9660.c73 * sector. At each step, I look for the earliest dir entry that
960 size_t step, skip_size; local
993 step = (size_t)(((parent->size + iso9660->logical_block_size -1) /
995 b = __archive_read_ahead(a, step, NULL);
1002 iso9660->current_position += step;
1004 skip_size = step;
1005 while (step) {
1008 step -= iso9660->logical_block_size;
1673 int64_t step; local
1675 step
2393 size_t step; local
2709 int64_t step; local
[all...]
/freebsd-current/contrib/libucl/klib/
H A Dkhash.h233 khint_t k, i, last, mask, step = 0; \
238 i = (i + (++step)) & mask; \
278 khint_t k, i, step = 0; \
281 while (!__ac_isempty(new_flags, i)) i = (i + (++step)) & new_mask; \
320 khint_t k, i, site, last, mask = h->n_buckets - 1, step = 0; \
327 i = (i + (++step)) & mask; \
/freebsd-current/sys/contrib/openzfs/module/zstd/lib/compress/
H A Dfse_compress.c76 U32 const step = FSE_TABLESTEP(tableSize); local
116 position = (position + step) & tableMask;
118 position = (position + step) & tableMask; /* Low proba area */
447 U64 const step = ((U64)1<<62) / total; /* <== here, one division ! */ local
462 short proba = (short)((count[s]*step) >> scale);
465 proba += (count[s]*step) - ((U64)proba<<scale) > restToBeat;
/freebsd-current/tests/atf_python/sys/netlink/
H A Dmessage.py143 step = 16
145 for i in range(step):
149 off += step
/freebsd-current/lib/libc/regex/
H A Dengine.c51 #define step sstep macro
62 #define step lstep macro
73 #define step mstep macro
107 static states step(struct re_guts *g, sopno start, sopno stop, states bef, wint_t ch, states aft, int sflags);
148 * Given a multibyte string pointed to by start, step back nchar characters
837 - walk - step through the string either quickly or slowly
862 st = step(m->g, startst, stopst, st, NOTHING, st, sflags);
914 st = step(m->g, startst, stopst, st, flagch, st,
929 st = step(m->g, startst, stopst, st, flagch, st, sflags);
940 st = step(
993 step(struct re_guts *g, function
1210 #undef step macro
[all...]
/freebsd-current/sys/compat/linuxkpi/common/src/
H A Dlinux_radix.c104 unsigned long step = 1UL << (RADIX_TREE_MAP_SHIFT * height); local
113 index += step;
114 index &= -step;
/freebsd-current/contrib/ntp/libntp/
H A Dsystime.c397 * Write old and new time entries in utmp and wtmp if step
512 * step_systime - step the system clock.
517 double step
526 * Get pivot time for NTP era unfolding. Since we don't step
545 DTOLFP(step, &fp_ofs);
564 msyslog(LOG_ERR, "step-systime: %m");
574 lamport_violated = (step < 0);
/freebsd-current/contrib/dialog/
H A Dcalendar.c717 int step; local
930 step = 0;
940 step = (key
943 DLG_TRACE(("# mouseclick decoded %d\n", step));
948 step = next_or_previous(key, (obj == &dy_box));
950 if (step != 0) {
955 now_time += ONE_DAY * step;
957 if (step > 0)
964 if (step > 0)
H A Dtimebox.c375 int step = next_or_previous(key); local
376 if (step != 0) {
377 obj->value += step;
/freebsd-current/contrib/llvm-project/compiler-rt/lib/builtins/sparc64/
H A Ddivsi3.S82 ! as our usual 4-at-a-shot divide step will cause overflow and havoc.
112 ! %o5 > %o3: went too far: back up 1 step
118 ! first divide step without thinking. BUT, the others are conditional,
120 ! order bit set in the first step, just falling into the regular
H A Dmodsi3.S82 ! as our usual 4-at-a-shot divide step will cause overflow and havoc.
112 ! %o5 > %o3: went too far: back up 1 step
118 ! first divide step without thinking. BUT, the others are conditional,
120 ! order bit set in the first step, just falling into the regular
/freebsd-current/sys/contrib/zstd/lib/compress/
H A Dzstd_fast.c56 * from the previous step. This means these steps must be sequenced and their
133 * matching the behavior of #1562. step therefore represents the gap
135 size_t step; local
151 step = stepSize;
154 /* calculate positions, ip0 - anchor == 0, so we skip step calc */
156 ip2 = ip0 + step;
240 ip2 = ip0 + step;
241 ip3 = ip1 + step;
243 /* calculate step */
245 step
[all...]
H A Dfse_compress.c77 U32 const step = FSE_TABLESTEP(tableSize); local
146 size_t const uPosition = (position + (u * step)) & tableMask;
149 position = (position + (unroll * step)) & tableMask;
161 position = (position + step) & tableMask;
163 position = (position + step) & tableMask; /* Low proba area */
486 U64 const step = ZSTD_div64((U64)1<<62, (U32)total); /* <== here, one division ! */ local
501 short proba = (short)((count[s]*step) >> scale);
504 proba += (count[s]*step) - ((U64)proba<<scale) > restToBeat;
/freebsd-current/sys/dev/ath/ath_hal/
H A Dah_regdomain.c471 int maxchans, int *nchans, uint16_t freq_lo, uint16_t freq_hi, int step,
481 "%s: freq=%d..%d, flags=0x%08x, step=%d\n", __func__,
482 (int) freq_lo, (int) freq_hi, flags, step);
485 for (freq += step; freq <= freq_hi && error == 0; freq += step)
542 int step; local
598 step = fband->channelSep;
600 step = roundup(channelSep, fband->channelSep);
604 "bandlo=%d, bandhi=%d, bfreqlo=%d, bfreqhi=%d, step=%d, "
615 step,
470 add_chanlist_band(struct ath_hal *ah, struct ieee80211_channel chans[], int maxchans, int *nchans, uint16_t freq_lo, uint16_t freq_hi, int step, uint32_t flags, REG_DMN_FREQ_BAND *fband, REG_DOMAIN *rd) argument
[all...]
/freebsd-current/lib/libthread_db/arch/arm/
H A Dlibpthread_md.c114 pt_reg_sstep(struct reg *reg __unused, int step __unused)
/freebsd-current/lib/libthread_db/arch/riscv/
H A Dlibpthread_md.c103 pt_reg_sstep(struct reg *reg __unused, int step __unused)
/freebsd-current/contrib/lua/src/
H A Dlvm.c168 ** (The following explanation assumes a positive step; it is valid for
181 lua_Integer *p, lua_Integer step) {
182 if (!luaV_tointeger(lim, p, (step < 0 ? F2Iceil : F2Ifloor))) {
189 if (step < 0) return 1; /* initial value must be less than it */
193 if (step > 0) return 1; /* initial value must be greater than it */
197 return (step > 0 ? init > *p : init < *p); /* not to run? */
207 ** ra + 2 : step
216 lua_Integer step = ivalue(pstep); local
218 if (step == 0)
219 luaG_runerror(L, "'for' step i
180 forlimit(lua_State *L, lua_Integer init, const TValue *lim, lua_Integer *p, lua_Integer step) argument
241 lua_Number init; lua_Number limit; lua_Number step; local
271 lua_Number step = fltvalue(s2v(ra + 2)); local
1795 lua_Integer step = ivalue(s2v(ra + 2)); local
[all...]
/freebsd-current/contrib/googletest/googletest/include/gtest/
H A Dgtest-param-test.h81 // Range(begin, end [, step]) - Yields values {begin, begin+step,
82 // begin+step+step, ...}. The values do not
83 // include end. step defaults to 1.
211 // Range(start, end, step)
212 // - returns a generator producing a sequence of values {start, start+step,
213 // start+step+step, ..., }.
229 internal::ParamGenerator<T> Range(T start, T end, IncrementT step) { argument
[all...]
/freebsd-current/crypto/openssl/crypto/camellia/asm/
H A Dcmll-x86.pl557 { my $step=0;
612 &mov ($idx,&DWP($step*8,$key)); # prefetch SIGMA[0]
617 &Camellia_Feistel($step++);
618 &Camellia_Feistel($step++);
628 &mov ($idx,&DWP($step*8,$key)); # prefetch SIGMA[4]
633 &Camellia_Feistel($step++);
634 &Camellia_Feistel($step++);
679 &mov ($idx,&DWP($step*8,$key)); # prefetch SIGMA[8]
684 &Camellia_Feistel($step++);
685 &Camellia_Feistel($step
[all...]
/freebsd-current/cddl/contrib/opensolaris/lib/libdtrace/common/
H A Ddt_consume.c58 #define lquantize_step u.lquantize.step
62 uint16_t step; member in struct:dt_prepare_args::__anon3::lquantize_args
67 #define llquantize_step u.llquantize.step
76 int64_t step; member in struct:dt_prepare_args::__anon3::llquantize_args
320 * 3. Subtract the result of the previous step (2 or 4, depending) and
323 * x such that 2 * R * 10 * x + x^2 is less than the result from step 3.
345 * only possible non-zero value for x in step 4 is 1, so step 4 becomes a
960 uint16_t step, levels; local
971 step
1014 uint16_t step, levels; local
1059 uint16_t step, levels; local
1116 uint16_t step, levels; local
1167 int64_t value = 1, next, step; local
1244 int64_t value = 1, next, step; local
1319 int64_t value = 1, next, step; local
[all...]
/freebsd-current/contrib/googletest/googletest/include/gtest/internal/
H A Dgtest-param-util.h213 RangeGenerator(T begin, T end, IncrementT step) argument
216 step_(step),
217 end_index_(CalculateEndIndex(begin, end, step)) {}
231 IncrementT step)
232 : base_(base), value_(value), index_(index), step_(step) {}
275 const IncrementT& step) {
277 for (T i = begin; i < end; i = static_cast<T>(i + step)) end_index++;
230 Iterator(const ParamGeneratorInterface<T>* base, T value, int index, IncrementT step) argument
274 CalculateEndIndex(const T& begin, const T& end, const IncrementT& step) argument
/freebsd-current/sys/contrib/zstd/programs/
H A Ddibio.c211 size_t const step = 8 MB; local
215 requiredMem += step;
220 requiredMem -= step;
/freebsd-current/crypto/openssl/crypto/poly1305/asm/
H A Dpoly1305-sparcv9.pl256 srl $h4,2,$t0 ! final reduction step
352 srlx $D2,2,$T0 ! final reduction step
448 my ($i1,$step,$shr,$shl) = map("%l$_",(0..7));
449 my $i2=$step;
644 mov 16,$step
651 ldxa [$inp+$step]0x88,$in4
664 movrz $len,0,$step
666 add $step,$inp,$inp ! conditional advance
692 movrz $len,0,$step
712 add $step,
[all...]

Completed in 220 milliseconds

12345678