HomeSort by: relevance | last modified time | path
    Searched refs:udiv_floor (Results 1 - 10 of 10) sorted by relevancy

  /src/external/gpl3/gcc/dist/gcc/
profile-count.cc 271 tmp = wi::udiv_floor (wi::umul (tmp, b, &overflow) + (c / 2), c);
tree-ssa-loop-manip.cc 1290 loop->nb_iterations_upper_bound = wi::udiv_floor
1293 loop->nb_iterations_likely_upper_bound = wi::udiv_floor
1296 loop->nb_iterations_estimate = wi::udiv_floor
wide-int.h 640 BINARY_FUNCTION udiv_floor (const T1 &, const T2 &);
3207 wi::udiv_floor (const T1 &x, const T2 &y)
tree-ssa-loop-niter.cc 1527 niter->max = wi::udiv_floor (delta, s);
3817 return wi::udiv_floor (bnd, wi::to_widest (op1));
tree-vect-loop.cc 12228 : wi::udiv_floor (loop->nb_iterations_upper_bound + bias_for_lowest,
12256 : wi::udiv_floor (loop->nb_iterations_likely_upper_bound
12263 : wi::udiv_floor (loop->nb_iterations_estimate + bias_for_assumed,
  /src/external/gpl3/gcc.old/dist/gcc/
profile-count.cc 274 tmp = wi::udiv_floor (wi::umul (tmp, b, &overflow) + (c / 2), c);
tree-ssa-loop-manip.cc 1176 widest_int bound = wi::udiv_floor (loop->nb_iterations_upper_bound,
tree-ssa-loop-niter.cc 1545 niter->max = wi::udiv_floor (delta, s);
3410 return wi::udiv_floor (bnd, wi::to_widest (op1));
wide-int.h 579 BINARY_FUNCTION udiv_floor (const T1 &, const T2 &);
2732 wi::udiv_floor (const T1 &x, const T2 &y) function in class:wi
tree-vect-loop.cc 9997 : wi::udiv_floor (loop->nb_iterations_upper_bound + bias_for_lowest,
10025 : wi::udiv_floor (loop->nb_iterations_likely_upper_bound
10032 : wi::udiv_floor (loop->nb_iterations_estimate + bias_for_assumed,

Completed in 87 milliseconds