/freebsd-11-stable/contrib/gcc/ |
H A D | tree-ssa-loop-ivcanon.c | 73 create_canonical_iv (struct loop *loop, edge exit, tree niter) argument 83 print_generic_expr (dump_file, niter, TDF_SLIM); 93 type of niter is always unsigned and all comparisons are 97 type = TREE_TYPE (niter); 98 niter = fold_build2 (PLUS_EXPR, type, 99 niter, 102 create_iv (niter, 164 edge exit, tree niter, 173 if (!host_integerp (niter, 1)) 175 n_unroll = tree_low_cst (niter, 162 try_unroll_loop_completely(struct loops *loops ATTRIBUTE_UNUSED, struct loop *loop, edge exit, tree niter, enum unroll_level ul) argument 281 tree niter; local 402 struct tree_niter_desc niter; local [all...] |
H A D | tree-ssa-loop-niter.c | 138 struct tree_niter_desc *niter, bool never_infinite) 143 niter->control = *iv; 144 niter->bound = final; 145 niter->cmp = NE_EXPR; 168 niter->niter = c; 192 niter->assumptions = fold_build2 (TRUTH_AND_EXPR, boolean_type_node, 193 niter->assumptions, assumption); 198 niter->niter 137 number_of_iterations_ne(tree type, affine_iv *iv, tree final, struct tree_niter_desc *niter, bool never_infinite) argument 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 351 assert_loop_rolls_lt(tree type, affine_iv *iv0, affine_iv *iv1, struct tree_niter_desc *niter) argument 410 number_of_iterations_lt(tree type, affine_iv *iv0, affine_iv *iv1, struct tree_niter_desc *niter, bool never_infinite ATTRIBUTE_UNUSED) argument 500 number_of_iterations_le(tree type, affine_iv *iv0, affine_iv *iv1, struct tree_niter_desc *niter, bool never_infinite) argument 553 number_of_iterations_cond(tree type, affine_iv *iv0, enum tree_code code, affine_iv *iv1, struct tree_niter_desc *niter, bool only_exit) argument 1045 number_of_iterations_exit(struct loop *loop, edge exit, struct tree_niter_desc *niter, bool warn) argument 1182 tree niter = NULL_TREE, aniter; local 1476 tree niter = NULL_TREE, aniter; local 1854 tree niter, type; local 1943 n_of_executions_at_most(tree stmt, struct nb_iter_bound *niter_bound, tree niter) argument [all...] |
H A D | loop-unroll.c | 368 || desc->niter != 0) 445 if (desc->niter > npeel - 1) 451 fprintf (dump_file, HOST_WIDEST_INT_PRINT_DEC, desc->niter); 487 npeel = desc->niter; 592 if (desc->niter < 2 * nunroll) 606 if (i - 1 >= desc->niter) 607 i = desc->niter - 2; 611 unsigned exit_mod = desc->niter % (i + 1); 663 unsigned HOST_WIDE_INT niter; local 674 niter 936 rtx old_niter, niter, init_code, branch_code, tmp; local 1215 unsigned niter = expected_loop_iterations (loop); local [all...] |
H A D | predict.c | 650 unsigned HOST_WIDE_INT niter; local 663 niter = desc.niter + 1; 664 if (niter == 0) /* We might overflow here. */ 665 niter = desc.niter; 666 if (niter 668 niter = PARAM_VALUE (PARAM_MAX_PREDICTED_ITERATIONS); 671 - (REG_BR_PROB_BASE + niter /2) / niter); 686 tree niter = NULL; local [all...] |
H A D | loop-iv.c | 1269 rtx niter = desc->niter_expr; local 1273 if (GET_CODE (niter) == AND 1274 && GET_CODE (XEXP (niter, 0)) == CONST_INT) 1276 nmax = INTVAL (XEXP (niter, 0)); 1287 if (GET_CODE (niter) == UDIV) 1289 if (GET_CODE (XEXP (niter, 1)) != CONST_INT) 1294 inc = INTVAL (XEXP (niter, 1)); 1295 niter = XEXP (niter, 0); 1300 if (GET_CODE (niter) [all...] |
H A D | tree-ssa-loop-manip.c | 641 struct tree_niter_desc *niter) 655 if (!number_of_iterations_exit (loop, exit, niter, false) 656 || niter->cmp == ERROR_MARK 662 || contains_abnormal_ssa_name_p (niter->may_be_zero) 663 || contains_abnormal_ssa_name_p (niter->control.base) 664 || contains_abnormal_ssa_name_p (niter->control.step) 665 || contains_abnormal_ssa_name_p (niter->bound)) 640 can_unroll_loop_p(struct loop *loop, unsigned factor, struct tree_niter_desc *niter) argument
|
H A D | cfgloop.h | 324 unsigned HOST_WIDEST_INT niter; member in struct:niter_desc
|
H A D | tree-data-ref.c | 2643 compute_overlap_steps_for_affine_univar (int niter, int step_a, int step_b, 2657 tau2 = FLOOR_DIV (niter, step_overlaps_a); 2658 tau2 = MIN (tau2, FLOOR_DIV (niter, step_overlaps_b)); 2701 int niter_x, niter_y, niter_z, niter; 2731 niter = MIN (niter_x, niter_z); 2732 compute_overlap_steps_for_affine_univar (niter, step_x, step_z, 2736 niter = MIN (niter_y, niter_z); 2737 compute_overlap_steps_for_affine_univar (niter, step_y, step_z, 2741 niter = MIN (niter_x, niter_z); 2742 niter 2639 compute_overlap_steps_for_affine_univar(int niter, int step_a, int step_b, tree *overlaps_a, tree *overlaps_b, tree *last_conflicts, int dim) argument 2697 int niter_x, niter_y, niter_z, niter; local 2878 int niter, niter_a, niter_b; local 2985 int niter, niter_a, niter_b; local [all...] |
H A D | tree-flow.h | 773 its latch will not be executed), even if the niter 775 tree niter; /* The expression giving the number of iterations of member in struct:tree_niter_desc 786 is (n <= 0) and niter is (unsigned) n, we know 821 struct tree_niter_desc *niter, bool); 858 struct tree_niter_desc *niter);
|
H A D | loop-doloop.c | 309 fprintf (dump_file, HOST_WIDEST_INT_PRINT_DEC, desc->niter); 513 est_niter = desc->niter;
|
H A D | tree-scalar-evolution.c | 2500 type = TREE_TYPE (niter_desc.niter); 2504 res = niter_desc.niter; 2961 tree def, rslt, ass, niter; 2974 niter = number_of_iterations_in_loop (loop); 2975 if (niter == chrec_dont_know 2978 || expression_expensive_p (niter)) 2954 tree def, rslt, ass, niter; local
|
H A D | tree-ssa-loop-prefetch.c | 986 && cst_and_fits_in_hwi (desc.niter) 987 && (unsigned HOST_WIDE_INT) int_cst_value (desc.niter) < unroll_factor)
|
H A D | tree-ssa-loop-ivopts.c | 736 tree niter; member in struct:nfe_cache_elt 786 && !contains_abnormal_ssa_name_p (desc.niter)) 787 nfe_desc->niter = desc.niter; 789 nfe_desc->niter = NULL_TREE; 794 return nfe_desc->niter; 1113 tree niter = niter_for_single_dom_exit (data); local 1115 if (niter) 1118 print_generic_expr (dump_file, niter, TDF_SLIM); 4063 iv_value (struct iv *iv, tree niter) argument 4077 cand_value_at(struct loop *loop, struct iv_cand *cand, tree at, tree niter) argument [all...] |
H A D | Makefile.in | 991 tree-vect-generic.o tree-ssa-loop.o tree-ssa-loop-niter.o \ 2004 tree-ssa-loop-niter.o : tree-ssa-loop-niter.c $(TREE_FLOW_H) $(CONFIG_H) \
|
/freebsd-11-stable/contrib/libucl/tests/ |
H A D | test_msgpack.c | 29 static const int niter = 20; variable 126 for (i = 0; i < niter; i ++) {
|
/freebsd-11-stable/sys/dev/mlx5/mlx5_core/ |
H A D | mlx5_main.c | 1716 const int niter = 100; local 1723 for (i = 0; i < niter; i++) { 1735 if (i == niter) 1738 for (i = 0; i < niter; i++) { 1748 if (i == niter)
|
/freebsd-11-stable/gnu/usr.bin/cc/cc_int/ |
H A D | Makefile | 31 tree-vect-generic.o tree-ssa-loop.o tree-ssa-loop-niter.o \
|