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

  /src/external/gpl3/gcc.old/dist/gcc/
tree-ssa-loop-niter.cc 3437 if (!loop->nb_iterations
3438 || TREE_CODE (loop->nb_iterations) != INTEGER_CST
3447 || wi::cmpu (i_bound, wi::to_widest (loop->nb_iterations)) >= 0
3458 print_dec (i_bound, buf, TYPE_UNSIGNED (TREE_TYPE (loop->nb_iterations))
3504 || loop->nb_iterations == NULL_TREE
3505 || TREE_CODE (loop->nb_iterations) != INTEGER_CST))
4385 /* Ensure that loop->nb_iterations is computed if possible. If it turns out
4439 if (loop->nb_iterations
4440 && TREE_CODE (loop->nb_iterations) == INTEGER_CST)
4443 loop->nb_iterations_upper_bound = wi::to_widest (loop->nb_iterations);
    [all...]
cfgloop.cc 1570 if (loop->nb_iterations
1571 && (ref = walk_tree (&loop->nb_iterations,
1575 " released SSA name %qE", i, loop->nb_iterations, ref);
cfgloop.h 160 tree nb_iterations; variable
162 /* An integer guaranteed to be greater or equal to nb_iterations. Only
168 /* An integer giving an estimate on nb_iterations. Unlike
170 nb_iterations. */
174 I in [ 0, nb_iterations ) and for any J in
175 [ I, min ( I + safelen, nb_iterations ) ), the Ith and Jth iterations
tree-scalar-evolution.cc 2806 res = loop->nb_iterations;
2844 loop->nb_iterations = res;
2992 loop->nb_iterations = NULL_TREE;
3016 in the hash table and in the loop->nb_iterations. */
3024 loop->nb_iterations = NULL_TREE;
tree-vect-loop-manip.cc 785 loop->nb_iterations = fold_build2 (TRUNC_DIV_EXPR, compare_type,
912 loop->nb_iterations = fold_build2 (MINUS_EXPR, niters_type, niters,
917 loop->nb_iterations = fold_build2 (TRUNC_DIV_EXPR, niters_type,
tree-ssa-sccvn.cc 7476 if (bb->loop_father->nb_iterations)
7477 bb->loop_father->nb_iterations
7478 = simplify_replace_tree (bb->loop_father->nb_iterations,
tree-cfg.cc 7740 /* Avoid the need to remap SSA names used in nb_iterations. */
8399 print_generic_expr (file, loop->nb_iterations);
  /src/external/gpl3/gcc/dist/gcc/
tree-ssa-loop-niter.cc 3844 if (!loop->nb_iterations
3845 || TREE_CODE (loop->nb_iterations) != INTEGER_CST
3854 || wi::cmpu (i_bound, wi::to_widest (loop->nb_iterations)) >= 0
3866 if (print_dec_buf_size (i_bound, TYPE_SIGN (TREE_TYPE (loop->nb_iterations)),
3871 print_dec (i_bound, p, TYPE_SIGN (TREE_TYPE (loop->nb_iterations)));
3919 || loop->nb_iterations == NULL_TREE
3920 || TREE_CODE (loop->nb_iterations) != INTEGER_CST))
4819 /* Ensure that loop->nb_iterations is computed if possible. If it turns out
4873 if (loop->nb_iterations
4874 && TREE_CODE (loop->nb_iterations) == INTEGER_CS
    [all...]
cfgloop.cc 1563 if (loop->nb_iterations
1564 && (ref = walk_tree (&loop->nb_iterations,
1568 " released SSA name %qE", i, loop->nb_iterations, ref);
cfgloop.h 163 tree nb_iterations; variable
165 /* An integer guaranteed to be greater or equal to nb_iterations. Only
171 /* An integer giving an estimate on nb_iterations. Unlike
173 nb_iterations. */
177 I in [ 0, nb_iterations ) and for any J in
178 [ I, min ( I + safelen, nb_iterations ) ), the Ith and Jth iterations
tree-scalar-evolution.cc 2831 res = loop->nb_iterations;
2869 loop->nb_iterations = res;
3018 loop->nb_iterations = NULL_TREE;
3042 in the hash table and in the loop->nb_iterations. */
3050 loop->nb_iterations = NULL_TREE;
tree-vect-loop-manip.cc 949 loop->nb_iterations = fold_build2 (TRUNC_DIV_EXPR, compare_type,
1201 loop->nb_iterations = fold_build2 (TRUNC_DIV_EXPR, iv_type,
1340 loop->nb_iterations = fold_build2 (MINUS_EXPR, niters_type, niters,
1345 loop->nb_iterations = fold_build2 (TRUNC_DIV_EXPR, niters_type,
tree-ssa-sccvn.cc 7996 if (bb->loop_father->nb_iterations)
7997 bb->loop_father->nb_iterations
7998 = simplify_replace_tree (bb->loop_father->nb_iterations,
tree-cfg.cc 7959 /* Avoid the need to remap SSA names used in nb_iterations. */
8616 if (loop->nb_iterations)
8619 print_generic_expr (file, loop->nb_iterations);

Completed in 59 milliseconds