/haiku-buildtools/gcc/gcc/testsuite/gcc.dg/tree-ssa/ |
H A D | pr64705.c | 6 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 D | divtab.c | 137 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 D | libgcov-profiler.c | 37 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 D | value-prof.h | 67 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 D | value-prof.c | 293 + 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 D | tree-profile.c | 317 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 D | divsi3.S | 84 sub r0,r0,1 ; mask result bits from steps ...
|
H A D | divsi3-float.S | 69 .L0step:sub r1,TMP0,1 ; mask result bits from steps ...
|
H A D | udivsi3-float.S | 75 .L0step:sub r1,TMP0,1 ; mask result bits from steps ...
|
H A D | udivsi3.S | 78 sub r2,r2,1 ; mask result bits from steps ...
|
/haiku-buildtools/isl/ |
H A D | isl_transitive_closure.c | 149 * 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 D | General.pm | 129 users, and typically make explicit the steps being performed.
|
/haiku-buildtools/legacy/gcc/gcc/config/sparc/ |
H A D | lb1spc.asm | 205 ! do single-bit divide steps 552 ! do single-bit divide steps
|
/haiku-buildtools/gcc/libgcc/config/sparc/ |
H A D | lb1spc.S | 205 ! do single-bit divide steps 552 ! do single-bit divide steps
|
/haiku-buildtools/gcc/gcc/doc/ |
H A D | makefile.texi | 83 the various steps of the build, including bootstrapping the compiler
|
/haiku-buildtools/legacy/gcc/gcc/ch/ |
H A D | loop.c | 320 above loop steps must act upon all iterators. For example,
|
H A D | nloop.c | 330 above loop steps must act upon all iterators. For example,
|
/haiku-buildtools/gcc/libgcc/config/c6x/ |
H A D | lib1funcs.S | 177 ;; The loop performs a maximum of 28 steps, so we do the
|
/haiku-buildtools/gcc/gmp/mpn/x86/k7/mmx/ |
H A D | divrem_1.asm | 55 C For the last and second last steps q1==0xFFFFFFFF is instead handled by an
|
/haiku-buildtools/legacy/gcc/gcc/ |
H A D | cpplib.c | 1550 * 4) clean up the mess left from steps 1 and 2.
|
/haiku-buildtools/legacy/gcc/gcc/config/c4x/ |
H A D | libgcc.S | 581 ; A 32-bit by 32-bit multiplication thus requires a number of steps.
|
/haiku-buildtools/isl/doc/ |
H A D | implementation.tex | 608 When a new constraint is added to the context, the first steps
|