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

1234567

/freebsd-9.3-release/contrib/ipfilter/ipsend/
H A Din_var.h145 * Macro to step through all of the in_multi records, one at a time.
146 * The current position is remembered in "step", which the caller must
147 * provide. IN_FIRST_MULTI(), below, must be called to initialize "step"
151 #define IN_NEXT_MULTI(step, inm) \
152 /* struct in_multistep step; */ \
155 if (((inm) = (step).i_inm) != NULL) { \
156 (step).i_inm = (inm)->inm_next; \
158 else while ((step).i_ia != NULL) { \
159 (inm) = (step).i_ia->ia_multiaddrs; \
160 (step)
[all...]
/freebsd-9.3-release/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-9.3-release/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-9.3-release/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-9.3-release/contrib/gperf/src/
H A Dsearch.cc98 In other words, each step finds a projection that is injective on the
905 means that we split the work into several steps. Each step chooses
909 Look at this partitioning: After every step, the _asso_values[] of a
921 The partition before a step is always a refinement of the partition
922 after the step.
924 broader at each step. (A step that only chooses an _asso_values[c]
925 without changing the partition is better merged with the previous step,
945 /* The characters whose values are being determined in this step. */
948 /* Exclusive upper bound for the _asso_values[c] of this step
1173 Step *step = new Step(); local
1460 Step *step = steps; local
[all...]
/freebsd-9.3-release/usr.sbin/diskinfo/
H A Ddiskinfo.c237 off_t b0, b1, sectorcount, step; local
240 step = 1ULL << (flsll(sectorcount / (4 * 200)) - 1);
241 if (step > 16384)
242 step = 16384;
250 b1 = sectorcount - step;
254 b0 += step;
256 b1 -= step;
266 b0 += step;
268 b1 += step;
277 b0 += step;
[all...]
/freebsd-9.3-release/lib/libstand/
H A Dif_ether.h210 * Macro to step through all of the ether_multi records, one at a time.
211 * The current position is remembered in "step", which the caller must
212 * provide. ETHER_FIRST_MULTI(), below, must be called to initialize "step"
216 #define ETHER_NEXT_MULTI(step, enm) \
217 /* struct ether_multistep step; */ \
220 if (((enm) = (step).e_enm) != NULL) \
221 (step).e_enm = (enm)->enm_list.le_next; \
224 #define ETHER_FIRST_MULTI(step, ac, enm) \
225 /* struct ether_multistep step; */ \
229 (step)
[all...]
/freebsd-9.3-release/lib/libthread_db/arch/ia64/
H A Dlibpthread_md.c62 pt_reg_sstep(struct reg *reg __unused, int step __unused)
/freebsd-9.3-release/crypto/openssl/fips/des/
H A Dfips_desmovs.c273 int dir = -1, err = 0, step = 0; local
313 /* printf("step=%d ibuf=%s",step,ibuf); */
314 if (step == 3 && !strcmp(amode, "ECB")) {
316 step = (dir) ? 4 : 5; /* no ivec for ECB */
318 switch (step) {
326 ++step;
371 ++step;
386 step = 2;
416 ++step;
[all...]
/freebsd-9.3-release/contrib/dialog/
H A Dpause.c74 int i, x, y, step; local
180 for (step = 0;
181 (result == DLG_EXIT_UNKNOWN) && (step < 1000);
182 step += MY_TIMEOUT) {
H A Dbuttons.c199 dlg_button_x_step(const char **labels, int limit, int *gap, int *margin, int *step) argument
220 *step = *gap + (used + count - 1) / count;
231 int gap, margin, step; local
234 while (!dlg_button_x_step(labels, width, &gap, &margin, &step))
257 int step = 0; local
275 step = 1;
277 dlg_button_x_step(labels, limit, &gap, &margin, &step);
303 if ((y += step) > limit)
306 if ((x += step) > limit)
/freebsd-9.3-release/lib/libthread_db/
H A Dlibpthread_db.h92 int pt_reg_sstep(struct reg *reg, int step);
/freebsd-9.3-release/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-9.3-release/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-9.3-release/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-9.3-release/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-9.3-release/usr.bin/last/
H A Dlast.c384 ARG *step; local
392 for (step = arglist; step; step = step->next)
393 switch(step->type) {
395 if (!strcasecmp(step->name, bp->ut_host))
399 if (!strcmp(step->name, bp->ut_line))
403 if (!strcmp(step->name, bp->ut_user))
/freebsd-9.3-release/contrib/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-9.3-release/contrib/compiler-rt/lib/sparc64/
H A Ddivmod.m4141 ! as our usual N-at-a-shot divide step will cause overflow and havoc.
171 ! V > R: went too far: back up 1 step
177 ! first divide step without thinking. BUT, the others are conditional,
179 ! order bit set in the first step, just falling into the regular
/freebsd-9.3-release/crypto/heimdal/lib/krb5/
H A Dtest_crypto_wrapping.c43 size_t step,
71 for (size = min_size; size < max_size; size += step) {
40 test_wrapping(krb5_context context, size_t min_size, size_t max_size, size_t step, krb5_enctype etype) argument

Completed in 288 milliseconds

1234567