Searched refs:steps (Results 1 - 22 of 22) sorted by relevance

/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/
H A Dpr64705.c6 int foo(char *flags, long len, long i, long steps) argument
15 steps++;
19 g = 5.0*(double)steps;
/haiku-buildtools/gcc/gcc/config/sh/
H A Ddivtab.c137 int steps = N_ENTRIES / 2; local
138 double step = 1. / steps;
143 double x_low = (i < steps ? 1. : -3.) + i * step;
183 calc_defect (-2., constants[steps], factors[steps]));
187 for (i = steps; i < 2 * steps; i++)
190 for (i = steps; i < 2*steps; i++)
192 printf ("\t.skip %d\n", steps);
[all...]
/haiku-buildtools/gcc/libgcc/
H A Dlibgcov-profiler.c37 int start, unsigned steps)
41 counters[steps + 1]++;
42 else if (delta >= steps)
43 counters[steps]++;
36 __gcov_interval_profiler(gcov_type *counters, gcov_type value, int start, unsigned steps) argument
/haiku-buildtools/gcc/gcc/
H A Dvalue-prof.h67 unsigned int steps; /* Number of values in it. */
66 unsigned int steps; /* Number of values in it. */ member in struct:histogram_value_t::__anon1940::__anon1941
H A Dvalue-prof.c293 + hist->hdata.intvl.steps - 1));
298 for (i = 0; i < hist->hdata.intvl.steps; i++)
428 streamer_write_uhwi (ob, hist->hdata.intvl.steps);
461 new_val->hdata.intvl.steps = streamer_read_uhwi (ib);
462 ncounters = new_val->hdata.intvl.steps + 2;
1178 unsigned int i, steps; local
1201 for (i = 0; i < histogram->hdata.intvl.steps; i++)
1206 steps = histogram->hdata.intvl.steps;
1226 for (i = 0; i < histogram->hdata.intvl.steps;
[all...]
H A Dtree-profile.c317 tree steps = build_int_cst_type (unsigned_type_node, local
318 value->hdata.intvl.steps);
325 ref_ptr, val, start, steps);
/haiku-buildtools/gcc/libgcc/config/epiphany/
H A Ddivsi3.S84 sub r0,r0,1 ; mask result bits from steps ...
H A Ddivsi3-float.S69 .L0step:sub r1,TMP0,1 ; mask result bits from steps ...
H A Dudivsi3-float.S75 .L0step:sub r1,TMP0,1 ; mask result bits from steps ...
H A Dudivsi3.S78 sub r2,r2,1 ; mask result bits from steps ...
/haiku-buildtools/isl/
H A Disl_transitive_closure.c149 * If "project" is set and if "steps" can only result in acyclic paths,
203 /* Given a set of n offsets v_i (the rows of "steps"), construct a relation
206 * by taking a non-negative number of steps along any of
212 * For any element in this relation, the number of steps taken
216 __isl_keep isl_mat *steps)
224 if (!dim || !steps)
228 n = steps->n_row;
237 isl_assert(steps->ctx, i == k, goto error);
254 steps->row[j][i]);
509 * by taking a non-negative number of steps alon
215 path_along_steps(__isl_take isl_space *dim, __isl_keep isl_mat *steps) argument
751 struct isl_mat *steps = NULL; local
[all...]
/haiku-buildtools/autoconf/lib/Autom4te/
H A DGeneral.pm129 users, and typically make explicit the steps being performed.
/haiku-buildtools/legacy/gcc/gcc/config/sparc/
H A Dlb1spc.asm205 ! do single-bit divide steps
552 ! do single-bit divide steps
/haiku-buildtools/gcc/libgcc/config/sparc/
H A Dlb1spc.S205 ! do single-bit divide steps
552 ! do single-bit divide steps
/haiku-buildtools/gcc/gcc/doc/
H A Dmakefile.texi83 the various steps of the build, including bootstrapping the compiler
/haiku-buildtools/legacy/gcc/gcc/ch/
H A Dloop.c320 above loop steps must act upon all iterators. For example,
H A Dnloop.c330 above loop steps must act upon all iterators. For example,
/haiku-buildtools/gcc/libgcc/config/c6x/
H A Dlib1funcs.S177 ;; The loop performs a maximum of 28 steps, so we do the
/haiku-buildtools/gcc/gmp/mpn/x86/k7/mmx/
H A Ddivrem_1.asm55 C For the last and second last steps q1==0xFFFFFFFF is instead handled by an
/haiku-buildtools/legacy/gcc/gcc/
H A Dcpplib.c1550 * 4) clean up the mess left from steps 1 and 2.
/haiku-buildtools/legacy/gcc/gcc/config/c4x/
H A Dlibgcc.S581 ; A 32-bit by 32-bit multiplication thus requires a number of steps.
/haiku-buildtools/isl/doc/
H A Dimplementation.tex608 When a new constraint is added to the context, the first steps

Completed in 306 milliseconds