Searched refs:step (Results 1 - 25 of 198) sorted by relevance

12345678

/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/usr.bin/ctags/
H A Dctags.c94 int step; /* step through args */ local
149 for (exit_val = step = 0; step < argc; ++step)
150 if (!(inf = fopen(argv[step], "r"))) {
151 warn("%s", argv[step]);
155 curfile = argv[step];
156 find_entries(argv[step]);
176 for (step
[all...]
/freebsd-11-stable/contrib/gcc/
H A Dtree-ssa-loop-prefetch.c179 HOST_WIDE_INT step; /* Step of the reference. */ member in struct:mem_ref_group
216 fprintf (file, ", step ");
217 fprintf (file, HOST_WIDE_INT_PRINT_DEC, ref->group->step);
234 HOST_WIDE_INT step)
240 if ((*groups)->step == step
244 /* Keep the list of groups sorted by decreasing step. */
245 if ((*groups)->step < step)
251 group->step
233 find_or_create_group(struct mem_ref_group **groups, tree base, HOST_WIDE_INT step) argument
327 HOST_WIDE_INT *step; /* Step of the memory reference. */ member in struct:ar_data
338 tree ibase, step, stepsize; local
396 analyze_ref(struct loop *loop, tree *ref_p, tree *base, HOST_WIDE_INT *step, HOST_WIDE_INT *delta, tree stmt) argument
440 HOST_WIDE_INT step, delta; local
497 HOST_WIDE_INT step = ref->group->step; local
543 HOST_WIDE_INT step = ref->group->step; local
[all...]
H A Dtree-ssa-address.c76 rtx * GTY ((skip)) step_p; /* The point in template where the step should be
95 STEP and OFFSET to *ADDR. Stores pointers to where step is placed to
99 gen_addr_rtx (rtx symbol, rtx base, rtx index, rtx step, rtx offset, argument
113 if (step)
115 act_elem = gen_rtx_MULT (Pmode, act_elem, step);
180 if (addr->step && !integer_onep (addr->step))
181 st = immed_double_const (TREE_INT_CST_LOW (addr->step),
182 TREE_INT_CST_HIGH (addr->step), Pmode);
248 tree step local
[all...]
H A Dtree-ssa-loop-niter.c149 if (tree_int_cst_sign_bit (iv->step))
152 fold_build1 (NEGATE_EXPR, type, iv->step));
159 s = fold_convert (niter_type, iv->step);
165 /* First the trivial cases -- when the step is 1. */
172 /* Let nsd (step, size of mode) = d. If d does not divide c, the loop
205 of the step. The assumptions necessary to ensure that the computation
213 tree *delta, tree step)
215 tree niter_type = TREE_TYPE (step);
216 tree mod = fold_build2 (FLOOR_MOD_EXPR, niter_type, *delta, step);
223 mod = fold_build2 (MINUS_EXPR, niter_type, step, mo
211 number_of_iterations_lt_to_ne(tree type, affine_iv *iv0, affine_iv *iv1, struct tree_niter_desc *niter, tree *delta, tree step) argument
283 assert_no_overflow_lt(tree type, affine_iv *iv0, affine_iv *iv1, struct tree_niter_desc *niter, tree step) argument
415 tree delta, step, s; local
1782 tree init, step, diff, estimation; local
2000 scev_probably_wraps_p(tree base, tree step, tree at_stmt, struct loop *loop, bool use_overflow_semantics) argument
[all...]
H A Dloop-iv.c132 if (iv->step == const0_rtx
137 if (iv->step != const0_rtx)
140 print_rtl (file, iv->step);
368 iv->step = const0_rtx;
384 if (iv->step == const0_rtx
410 iv->step = simplify_gen_binary (MULT, iv->extend_mode, iv->step, iv->mult);
424 if (iv->step == const0_rtx
459 iv->step = simplify_gen_unary (NEG, iv->extend_mode,
460 iv->step, i
1992 rtx op0, op1, delta, step, bound, may_xform, tmp, tmp0, tmp1; local
[all...]
H A Dtree-ssa-loop-manip.c51 create_iv (tree base, tree step, tree var, struct loop *loop, argument
75 if (TREE_CODE (step) == INTEGER_CST)
77 if (TYPE_UNSIGNED (TREE_TYPE (step)))
79 step1 = fold_build1 (NEGATE_EXPR, TREE_TYPE (step), step);
80 if (tree_int_cst_lt (step1, step))
83 step = step1;
90 if (!tree_expr_nonnegative_warnv_p (step, &ovf)
91 && may_negate_without_overflow_p (step))
94 step
694 tree step = desc->control.step; local
[all...]
H A Dtree-ssa-loop-ivopts.c106 tree step; /* Step of the iv (constant only). */ member in struct:iv
187 bitmap depends_on; /* The list of invariants that are used in step of the
380 if (iv->step)
386 fprintf (file, " step ");
387 print_generic_expr (file, iv->step, TDF_SLIM);
886 /* Allocates an induction variable with given initial value BASE and step STEP
890 alloc_iv (tree base, tree step) argument
894 if (step && integer_zerop (step))
895 step
911 set_iv(struct ivopts_data *data, tree iv, tree base, tree step) argument
965 tree phi, step, type, base; local
1344 tree step, iv_base, iv_step, lbound, off; local
1507 tree base = *op_p, step = NULL; local
1791 tree op0 = NULL_TREE, op1 = NULL_TREE, tmp, step; local
1976 add_candidate_1(struct ivopts_data *data, tree base, tree step, bool important, enum iv_position pos, struct iv_use *use, tree incremented_at) argument
2107 add_candidate(struct ivopts_data *data, tree base, tree step, bool important, struct iv_use *use) argument
4093 tree step = iv->step, period, type; local
5374 tree step, ctype, utype; local
[all...]
/freebsd-11-stable/contrib/gdb/gdb/
H A Di386fbsd-nat.c36 If STEP is nonzero, single-step it.
40 child_resume (ptid_t ptid, int step, enum target_signal signal) argument
51 if (!step)
/freebsd-11-stable/contrib/gperf/src/
H A Dsearch.cc101 In other words, each step finds a projection that is injective on the
908 means that we split the work into several steps. Each step chooses
912 Look at this partitioning: After every step, the _asso_values[] of a
924 The partition before a step is always a refinement of the partition
925 after the step.
927 broader at each step. (A step that only chooses an _asso_values[c]
928 without changing the partition is better merged with the previous step,
948 /* The characters whose values are being determined in this step. */
951 /* Exclusive upper bound for the _asso_values[c] of this step
1176 Step *step = new Step(); local
1463 Step *step = steps; local
[all...]
/freebsd-11-stable/lib/libnv/
H A Dmsgio.c358 unsigned int i, step, j; local
366 ret = i = step = 0;
369 step = PKG_MAX_SIZE;
371 step = nfds - i;
372 ret = fd_package_recv(sock, fds + i, step);
381 i += step;
390 unsigned int i, step; local
398 ret = i = step = 0;
401 step = PKG_MAX_SIZE;
403 step
[all...]
/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/dialog/
H A Dpause.c68 int i, x, y, step; local
183 for (step = 0;
184 (result == DLG_EXIT_UNKNOWN) && (step < 1000);
185 step += MY_TIMEOUT) {
H A Dbuttons.c270 dlg_button_x_step(const char **labels, int limit, int *gap, int *margin, int *step) argument
292 *step = *gap + (used + count - 1) / count;
307 int gap, margin, step; local
310 while (!dlg_button_x_step(labels, width, &gap, &margin, &step))
333 int step = 0; local
351 step = 1;
353 dlg_button_x_step(labels, limit, &gap, &margin, &step);
383 if ((y += step) > limit)
386 if ((x += step) > limit)
/freebsd-11-stable/lib/libthread_db/
H A Dlibpthread_db.h92 int pt_reg_sstep(struct reg *reg, int step);
/freebsd-11-stable/contrib/gdb/gdb/gdbserver/
H A Dserver.c174 default_action.step = 0;
186 resume_info[i].step = 1;
188 resume_info[i].step = 0;
278 myresume (int step, int sig) argument
283 if (step || sig || cont_thread > 0)
287 resume_info[0].step = step;
293 resume_info[n].step = 0;
/freebsd-11-stable/contrib/libarchive/libarchive/
H A Darchive_blake2s_ref.c308 size_t i, step; local
329 for(step = 1; step < BLAKE2S_BLOCKBYTES; ++step) {
341 while (mlen >= step) {
342 if ( (err = blake2s_update(&S, p, step)) < 0 ) {
345 mlen -= step;
346 p += step;
/freebsd-11-stable/lib/libvgl/
H A Dsimple.c224 int sign_x, sign_y, step, reverse, i; local
230 step = 1;
232 step = -1;
287 plot(object, ++x, y += step, reverse,
291 plot(object, --x1, y1 -= step, reverse,
295 plot(object, x, y += step, reverse, color);
298 plot(object, x1, y1 -= step, reverse,
318 plot(object, ++x, y += step, reverse, color);
323 plot(object, ++x, y += step, reverse, color);
327 plot(object, --x1, y1 -= step, revers
[all...]
/freebsd-11-stable/tools/regression/kgssapi/
H A Dgsstest.c45 int step; /* test step number */ member in struct:gsstest_2_args
187 args.step = 1;
214 args.step = 2;
240 args.step = 3;
267 args.step = 4;
285 args.step = 5;
/freebsd-11-stable/gnu/usr.bin/gdb/gdbserver/
H A Dfbsd-low.c58 int step, int signal);
95 with hardware or kernel single-step:
96 If we single-step over a breakpoint instruction, our PC will
334 is now gone. We were told to continue (or step...) all threads,
335 so GDB isn't trying to single-step past this breakpoint.
561 mark it for reinsertion, and single-step.
583 SIGTRAP. The single-step operation has completed, so also
643 resume_info.step = resume_info.sig = resume_info.leave_stopped = 0;
771 If STEP is nonzero, single-step it.
776 int step, in
775 fbsd_resume_one_process(struct inferior_list_entry *entry, int step, int signal) argument
903 int step; local
[all...]
/freebsd-11-stable/usr.sbin/diskinfo/
H A Ddiskinfo.c408 off_t b0, b1, sectorcount, step; local
414 step = 1ULL << (flsll(sectorcount / (4 * 200)) - 1);
415 if (step > 16384)
416 step = 16384;
424 b1 = sectorcount - step;
428 b0 += step;
430 b1 -= step;
440 b0 += step;
442 b1 += step;
451 b0 += step;
[all...]
/freebsd-11-stable/usr.bin/last/
H A Dlast.c440 ARG *step; local
448 for (step = arglist; step; step = step->next)
449 switch(step->type) {
456 if (!strcasecmp(step->name, bp->ut_host))
460 if (!strcmp(step->name, bp->ut_line))
464 if (!strcmp(step->name, bp->ut_user))
/freebsd-11-stable/sys/crypto/skein/
H A Dskein_debug.c19 static void Show64_step(size_t cnt,const u64b_t *X,size_t step) argument
22 for (i=j=0;i < cnt;i++,j+=step)
36 size_t step = (xptr & 1) ? 2 : 1; local
37 if (step != 1)
41 Show64_step(cnt,X,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...]
/freebsd-11-stable/lib/libthread_db/arch/i386/
H A Dlibpthread_md.c107 pt_reg_sstep(struct reg *reg, int step) argument
112 if (step)

Completed in 277 milliseconds

12345678