Searched refs:nb_loops (Results 1 – 9 of 9) sorted by relevance
| /dragonfly/contrib/gcc-4.7/gcc/ |
| HD | graphite-poly.h | 1049 lst_create_nest (int nb_loops, lst_p lst) in lst_create_nest() argument 1054 if (nb_loops == 0) in lst_create_nest() 1058 loop = lst_create_nest (nb_loops - 1, lst); in lst_create_nest() 1271 int nb_loops = depth - loop_depth; in lst_distribute_lst() local 1273 gcc_assert (lst && loop && LST_LOOP_P (loop) && nb_loops > 0); in lst_distribute_lst() 1276 lst_insert_in_sequence (lst_create_nest (nb_loops, lst), loop, before); in lst_distribute_lst()
|
| HD | tree-parloops.c | 306 int nb_loops, in lambda_transform_legal_p() argument 313 gcc_assert (LTM_COLSIZE (trans) == nb_loops in lambda_transform_legal_p() 314 && LTM_ROWSIZE (trans) == nb_loops); in lambda_transform_legal_p() 329 distres = lambda_vector_new (nb_loops); in lambda_transform_legal_p() 353 lambda_matrix_vector_mult (LTM_MATRIX (trans), nb_loops, nb_loops, in lambda_transform_legal_p() 356 if (!lambda_vector_lexico_pos (distres, nb_loops)) in lambda_transform_legal_p()
|
| HD | graphite-clast-to-gimple.c | 1020 int i, nb_loops; in translate_clast_user() local 1029 nb_loops = number_of_loops (); in translate_clast_user() 1030 iv_map = VEC_alloc (tree, heap, nb_loops); in translate_clast_user() 1031 for (i = 0; i < nb_loops; i++) in translate_clast_user()
|
| HD | predict.c | 1805 unsigned nb_loops; in tree_estimate_probability_driver() local 1813 nb_loops = number_of_loops (); in tree_estimate_probability_driver() 1814 if (nb_loops > 1) in tree_estimate_probability_driver() 1819 if (nb_loops > 1) in tree_estimate_probability_driver()
|
| HD | graphite-poly.c | 54 int nb_loops = pbb_dim_iter_domain (pbb); in scop_max_loop_depth() local 55 if (max_nb_loops < nb_loops) in scop_max_loop_depth() 56 max_nb_loops = nb_loops; in scop_max_loop_depth()
|
| HD | graphite-sese-to-poly.c | 1507 int nb_loops = number_of_loops (); in build_scop_iteration_domain() local 1509 = XNEWVEC (ppl_Pointset_Powerset_C_Polyhedron_t, nb_loops); in build_scop_iteration_domain() 1511 for (i = 0; i < nb_loops; i++) in build_scop_iteration_domain() 1529 for (i = 0; i < nb_loops; i++) in build_scop_iteration_domain()
|
| HD | tree-data-ref.c | 3871 unsigned nb_loops = DDR_NB_LOOPS (ddr); in init_omega_for_ddr_1() local 3903 pb->geqs[ineq].coef[i + nb_loops + 1] = 1; in init_omega_for_ddr_1() 3907 pb->geqs[ineq].coef[i + nb_loops + 1] = 1; in init_omega_for_ddr_1() 3914 pb->geqs[ineq].coef[i + nb_loops + 1] = -1; in init_omega_for_ddr_1() 3919 pb->geqs[ineq].coef[i + nb_loops + 1] = -1; in init_omega_for_ddr_1()
|
| /dragonfly/contrib/gcc-8.0/gcc/ |
| HD | tree-parloops.c | 353 int nb_loops, in lambda_transform_legal_p() argument 360 gcc_assert (LTM_COLSIZE (trans) == nb_loops in lambda_transform_legal_p() 361 && LTM_ROWSIZE (trans) == nb_loops); in lambda_transform_legal_p() 376 distres = lambda_vector_new (nb_loops); in lambda_transform_legal_p() 400 lambda_matrix_vector_mult (LTM_MATRIX (trans), nb_loops, nb_loops, in lambda_transform_legal_p() 403 if (!lambda_vector_lexico_pos (distres, nb_loops)) in lambda_transform_legal_p()
|
| HD | predict.c | 3829 unsigned nb_loops; in execute() local 3840 nb_loops = number_of_loops (fun); in execute() 3841 if (nb_loops > 1) in execute() 3846 if (nb_loops > 1) in execute() 4015 unsigned nb_loops; in report_predictor_hitrates() local 4023 nb_loops = number_of_loops (cfun); in report_predictor_hitrates() 4024 if (nb_loops > 1) in report_predictor_hitrates() 4029 if (nb_loops > 1) in report_predictor_hitrates()
|