/freebsd-11-stable/contrib/libarchive/libarchive/ |
H A D | archive_read_support_format_iso9660.c | 74 * sector. At each step, I look for the earliest dir entry that 961 size_t step, skip_size; local 994 step = (size_t)(((parent->size + iso9660->logical_block_size -1) / 996 b = __archive_read_ahead(a, step, NULL); 1003 iso9660->current_position += step; 1005 skip_size = step; 1006 while (step) { 1009 step -= iso9660->logical_block_size; 1673 int64_t step; local 1675 step 2393 size_t step; local 2709 int64_t step; local [all...] |
/freebsd-11-stable/contrib/libucl/klib/ |
H A D | khash.h | 233 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-11-stable/contrib/dialog/ |
H A D | timebox.c | 362 int step = next_or_previous(key); local 363 if (step != 0) { 364 obj->value += step;
|
/freebsd-11-stable/contrib/lua/src/ |
H A D | lstring.c | 51 size_t step = (l >> LUAI_HASHLIMIT) + 1; local 52 for (; l >= step; l -= step)
|
/freebsd-11-stable/contrib/ntp/libntp/ |
H A D | systime.c | 398 * Write old and new time entries in utmp and wtmp if step 513 * step_systime - step the system clock. 518 double step 527 * Get pivot time for NTP era unfolding. Since we don't step 546 DTOLFP(step, &fp_ofs); 565 msyslog(LOG_ERR, "step-systime: %m"); 575 lamport_violated = (step < 0);
|
/freebsd-11-stable/sys/compat/linuxkpi/common/src/ |
H A D | linux_radix.c | 107 unsigned long step = 1UL << (RADIX_TREE_MAP_SHIFT * height); local 116 index += step; 117 index &= -step;
|
/freebsd-11-stable/contrib/apr-util/dbd/ |
H A D | apr_dbd_odbc.c | 87 static void check_error(apr_dbd_t *a, const char *step, SQLRETURN rc, 928 static void check_error(apr_dbd_t *dbc, const char *step, SQLRETURN rc, argument 945 apr_cpystrn(dbc->lastError + successMsgLen, step, 980 step, res, rc, SOURCE_FILE, line - 1); 1018 char *step; local 1037 step = "SQLAllocHandle (SQL_HANDLE_ENV)"; 1041 step = "SQLSetEnvAttr"; 1051 CHECK_ERROR(&tmp_dbc, step, rc, SQL_HANDLE_ENV, err_h);
|
/freebsd-11-stable/contrib/gdb/gdb/ |
H A D | abug-rom.c | 117 abug_cmds.step = "t\r"; /* single step */
|
H A D | cpu32bug-rom.c | 115 cpu32bug_cmds.step = "t\r"; /* single step */
|
H A D | dbug-rom.c | 113 dbug_cmds.step = "trace\r"; /* single step */
|
H A D | dink32-rom.c | 140 dink32_cmds.step = "tr +\r";
|
H A D | ocd.h | 58 #define OCD_STEP 0x25 /* Single step */ 99 void ocd_resume (ptid_t ptid, int step, enum target_signal siggnal);
|
H A D | remote-est.c | 121 est_cmds.step = "sidr\r"; /* single step */
|
H A D | remote-hms.c | 92 hms_cmds.step = "s\r"; /* single step */
|
H A D | remote-sim.c | 94 static void gdbsim_resume (ptid_t ptid, int step, enum target_signal siggnal); 595 /* Resume execution of the target process. STEP says whether to single-step 603 gdbsim_resume (ptid_t ptid, int step, enum target_signal siggnal) argument 609 printf_filtered ("gdbsim_resume: step %d, signal %d\n", step, siggnal); 612 resume_step = step;
|
H A D | infrun.c | 87 /* When set, stop the 'step' command if we enter a function which has 88 no line number information. The normal behavior is that we step 121 The simple approach is to single-step until control leaves the 127 running. In this case, we use a step-resume breakpoint to get us 128 past the dynamic linker, as if we were using "next" to step over a 132 linker code or not. Normally, this means we single-step. However, 134 address where we can place a step-resume breakpoint to get past the 169 should ignore (i.e. step over) this function call. */ 176 we find ourselves in such a state, then we step the target beyond the 184 /* We can't step of 535 resume(int step, enum target_signal sig) argument 732 proceed(CORE_ADDR addr, enum target_signal siggnal, int step) argument [all...] |
/freebsd-11-stable/lib/libthread_db/arch/arm/ |
H A D | libpthread_md.c | 112 pt_reg_sstep(struct reg *reg __unused, int step __unused)
|
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/builtins/sparc64/ |
H A D | divsi3.S | 82 ! 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 D | modsi3.S | 82 ! 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-11-stable/contrib/llvm-project/compiler-rt/lib/hwasan/ |
H A D | hwasan_linux.cpp | 84 uptr step = GetMmapGranularity(); local 85 while (size > step) { 86 addr += step; 87 size -= step;
|
/freebsd-11-stable/contrib/gcc/ |
H A D | lambda-code.c | 60 bounds is a point in the iteration space. Every loop with a step of 1 63 for i = 1 to 3, step 1 is a dense iteration space. 68 for i = 1 to 3, step 2 is a sparse iteration space, because the integer point 86 The gaps in the target space (IE the new loop step sizes) will be the 89 Sparse source spaces require another step, because you can't directly compute 301 int step; local 307 step = LL_STEP (loop); 308 fprintf (outfile, " step size = %d \n", step); 387 int i, j, step; local 1221 tree step; local 2125 tree step = NULL_TREE; local 2327 tree step = evolution_part_in_loop_num (scev, loop->num); local [all...] |
H A D | omp-low.c | 101 tree v, n1, n2, step, chunk_size, for_stmt; member in struct:omp_for_data 197 fd->step = TREE_OPERAND (t, 1); 200 fd->step = TREE_OPERAND (t, 1); 201 fd->step = fold_build1 (NEGATE_EXPR, TREE_TYPE (fd->step), fd->step); 306 || !is_gimple_min_invariant (fd.step) 337 t = fold_convert (long_integer_type_node, fd.step); 2647 t = fold_convert (long_integer_type_node, fd->step); 2693 t = build2 (PLUS_EXPR, type, fd->v, fd->step); 4016 HOST_WIDE_INT step = TREE_INT_CST_LOW (fd->step); local [all...] |
H A D | tree-data-ref.h | 28 in the loop, and step is the stride of data-ref in the loop in bytes; 38 step D_j 4 51 tree step; member in struct:first_location_in_loop 127 #define DR_STEP(DR) (DR)->first_location.step
|
/freebsd-11-stable/lib/libc/regex/ |
H A D | engine.c | 53 #define step sstep macro 63 #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); 758 - walk - step through the string either quickly or slowly 782 st = step(m->g, startst, stopst, st, NOTHING, st); 823 st = step(m->g, startst, stopst, st, flagch, st); 837 st = step(m->g, startst, stopst, st, flagch, st); 858 st = step(m->g, startst, stopst, tmp, c, st); 860 assert(EQ(step( 889 step(struct re_guts *g, function 1088 #undef step macro [all...] |
/freebsd-11-stable/contrib/ncurses/progs/ |
H A D | tabs.c | 125 int step = value; local 129 value += step;
|