Searched refs:step (Results 1 - 25 of 198) sorted by last modified time

12345678

/freebsd-11-stable/contrib/libarchive/libarchive/
H A Darchive_read_support_format_7zip.c507 int step = check_7zip_header_in_sfx(p); local
508 if (step == 0)
510 p += step;
586 int step = check_7zip_header_in_sfx(p); local
587 if (step == 0) {
595 p += step;
H A Darchive_ppmd7.c95 unsigned step = (i >= 12 ? 4 : (i >> 2) + 1); local
96 do { p->Units2Indx[k++] = (Byte)i; } while(--step);
/freebsd-11-stable/contrib/sqlite3/
H A Dsqlite3ext.h138 int (*step)(sqlite3_stmt*); member in struct:sqlite3_api_routines
467 #define sqlite3_step sqlite3_api->step
H A Dsqlite3.c3298 ** errors. This step is only necessary if the application desires to keep
4869 ** to step 2. Do this zero or more times.
5792 ** where it always returns zero since each step of that multi-step
7939 ** sorting step is required.
14758 ** implementation of an SQL aggregate step callback may not use the
15862 #define OP_AggStep 157 /* synopsis: accum=r[P3] step(r[P2@P5]) */
15863 #define OP_AggStep1 158 /* synopsis: accum=r[P3] step(r[P2@P5]) */
17253 void (*xSFunc)(sqlite3_context*,int,sqlite3_value**); /* func or agg-step */
17256 void (*xInverse)(sqlite3_context*,int,sqlite3_value**); /* inverse agg-step */
[all...]
/freebsd-11-stable/contrib/subversion/subversion/libsvn_repos/
H A Dauthz.c562 const node_segment_pair_t *step
567 if ( !step->node
569 || step->segment->kind != acl->rule.path[i].kind
570 || step->segment->pattern.data != acl->rule.path[i].pattern.data)
577 node = step->node;
558 const node_segment_pair_t *step local
/freebsd-11-stable/contrib/ipfilter/lib/
H A Dinterror.c528 int l = -1, r = IPF_NUM_ERRORS + 1, step; local
529 step = (r - l) / 2;;
531 while (step != 0) {
532 ie = ipf_errors + l + step;
535 step = l + step;
537 r = step;
539 l = step;
540 step = (r - l) / 2;;
/freebsd-11-stable/sys/dev/mlx5/mlx5_ib/
H A Dmlx5_ib.h894 void mlx5_ib_copy_pas(u64 *old, u64 *new, int step, int num);
/freebsd-11-stable/contrib/llvm-project/openmp/runtime/src/
H A Dkmp_gsupport.cpp1652 T step) {
1670 "priority:%%d start:%%%s end:%%%s step:%%%s\n",
1673 gomp_flags, num_tasks, priority, start, end, step));
1687 // Negative step flag
1689 // If step is flagged as negative, but isn't properly sign extended
1692 if (step > 0) {
1695 if (step & ((T)1 << i))
1697 step |= ((T)1 << i);
1734 (kmp_uint64 *)&(loop_bounds[1]), (kmp_int64)step, nogroup,
1791 int priority, long start, long end, long step) {
1648 __GOMP_taskloop(void (*func)(void *), void *data, void (*copy_func)(void *, void *), long arg_size, long arg_align, unsigned gomp_flags, unsigned long num_tasks, int priority, T start, T end, T step) argument
1788 KMP_API_NAME_GOMP_TASKLOOP( void (*func)(void *), void *data, void (*copy_func)(void *, void *), long arg_size, long arg_align, unsigned gomp_flags, unsigned long num_tasks, int priority, long start, long end, long step) argument
1796 KMP_API_NAME_GOMP_TASKLOOP_ULL( void (*func)(void *), void *data, void (*copy_func)(void *, void *), long arg_size, long arg_align, unsigned gomp_flags, unsigned long num_tasks, int priority, unsigned long long start, unsigned long long end, unsigned long long step) argument
[all...]
H A Dkmp_lock.h1260 kmp_uint32 step; // current step member in struct:__anon2967
H A Dkmp_lock.cpp2685 for (i = boff->step; i > 0; i--) {
2691 boff->step = (boff->step << 1 | 1) & (boff->max_backoff - 1);
/freebsd-11-stable/sys/compat/linuxkpi/common/src/
H A Dlinux_radix.c107 unsigned long step = 1UL << (RADIX_TREE_MAP_SHIFT * height); local
116 index += step;
117 index &= -step;
/freebsd-11-stable/contrib/ntp/
H A Dconfigure1825 --enable-step-slew s step and slew the time
1826 --enable-ntpdate-step s if ntpdate should step the time
12976 # Ok, now we have the path, separated by spaces, we can step through it
31873 { $as_echo "$as_me:${as_lineno-$LINENO}: checking if we should step and slew the time" >&5
31874 $as_echo_n "checking if we should step and slew the time... " >&6; }
31902 # Check whether --enable-step-slew was given.
31919 { $as_echo "$as_me:${as_lineno-$LINENO}: checking if ntpdate should step the time" >&5
31920 $as_echo_n "checking if ntpdate should step th
[all...]
/freebsd-11-stable/contrib/subversion/subversion/svnsync/
H A Dsvnsync.c1641 svn_revnum_t step = 1;
1668 step = (baton->start_rev > baton->end_rev) ? -1 : 1;
1669 for (i = baton->start_rev; i != baton->end_rev + step; i = i + step)
1637 svn_revnum_t step = 1; local
/freebsd-11-stable/contrib/subversion/subversion/libsvn_subr/lz4/
H A Dlz4.c531 unsigned step = 1; local
536 forwardIp += step;
537 step = (searchMatchNb++ >> LZ4_skipTrigger);
774 unsigned step = 1; local
780 forwardIp += step;
781 step = (searchMatchNb++ >> LZ4_skipTrigger);
/freebsd-11-stable/contrib/apr/
H A Dlibapr.mak272 echo Helper for Post-build step > "$(DS_POSTBUILD_DEP)"
516 echo Helper for Post-build step > "$(DS_POSTBUILD_DEP)"
760 echo Helper for Post-build step > "$(DS_POSTBUILD_DEP)"
1004 echo Helper for Post-build step > "$(DS_POSTBUILD_DEP)"
/freebsd-11-stable/contrib/llvm-project/lld/ELF/
H A DSyntheticSections.cpp2253 // making each step faster by using hash tables substiantially
2887 uint32_t step = ((h * 17) & mask) | 1; local
2890 i = (i + step) & mask;
H A DICF.cpp37 // relocations. During this step, relocation targets are not taken into
47 // 3. If we split an equivalence class in step 2, two relocations
49 // different equivalence classes. Therefore, we repeat step 2 until a
61 // We parallelize each step so that multiple threads can work on different
416 size_t step = sections.size() / numShards; local
422 boundaries[i] = findBoundary((i - 1) * step, sections.size());
/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/dtrace/
H A Ddtrace.c2255 uint16_t step = DTRACE_LQUANTIZE_STEP(arg); local
2259 ASSERT(step != 0);
2270 level = (val - base) / step;
11209 uint16_t step = DTRACE_LQUANTIZE_STEP(desc->dtad_arg);
11215 if (step == 0 || levels == 0)
/freebsd-11-stable/contrib/llvm-project/lld/COFF/
H A DICF.cpp225 size_t step = chunks.size() / numShards; local
230 boundaries[i] = findBoundary((i - 1) * step, chunks.size());
/freebsd-11-stable/contrib/llvm-project/libunwind/src/
H A Dlibunwind.cpp163 return co->step();
H A DUnwindCursor.hpp431 virtual int step() { _LIBUNWIND_ABORT("step not implemented"); } function in class:libunwind::AbstractUnwindCursor
471 virtual int step();
890 virtual int step();
1974 int UnwindCursor<A, R>::step() { function in class:libunwind::UnwindCursor
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/tsan/rtl/
H A Dtsan_rtl.h731 uptr size, uptr step, bool is_write);
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/hwasan/
H A Dhwasan_linux.cpp84 uptr step = GetMmapGranularity(); local
85 while (size > step) {
86 addr += step;
87 size -= step;
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/asan/
H A Dasan_shadow_setup.cpp66 uptr step = GetMmapGranularity(); local
67 while (size > step && addr < kZeroBaseMaxShadowStart) {
68 addr += step;
69 size -= step;
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/
H A Dregengine.inc51 #define step sstep
63 #define step lstep
95 static states step(struct re_guts *, sopno, sopno, states, int, states);
680 - fast - step through the string at top speed
698 st = step(m->g, startst, stopst, st, NOTHING, st);
724 st = step(m->g, startst, stopst, st, flagch, st);
738 st = step(m->g, startst, stopst, st, flagch, st);
750 st = step(m->g, startst, stopst, tmp, c, st);
752 assert(EQ(step(m->g, startst, stopst, st, NOTHING, st), st));
765 - slow - step throug
[all...]

Completed in 963 milliseconds

12345678