Home
last modified time | relevance | path

Searched refs:loop_p (Results 1 – 25 of 92) sorted by relevance

1234

/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dsese.h105 extern tree scalar_evolution_in_region (const sese_l &, loop_p, tree);
189 sese_loop_depth (const sese_l &region, loop_p loop) in sese_loop_depth()
284 static inline loop_p
287 loop_p loop = gbb_loop (gbb); in gbb_loop_at_index()
303 loop_p l1 = gbb_loop (gbb1); in nb_common_loops()
304 loop_p l2 = gbb_loop (gbb2); in nb_common_loops()
305 loop_p common = find_common_loop (l1, l2); in nb_common_loops()
H A Dgraphite-sese-to-poly.cc317 create_pw_aff_from_tree (poly_bb_p pbb, loop_p loop, tree t) in create_pw_aff_from_tree()
336 loop_p loop = gimple_bb (stmt)->loop_father; in add_condition_to_pbb()
721 add_iter_domain_dimension (__isl_take isl_set *domain, loop_p loop, scop_p scop) in add_iter_domain_dimension()
734 add_loop_constraints (scop_p scop, __isl_take isl_set *domain, loop_p loop, in add_loop_constraints()
735 loop_p context) in add_loop_constraints()
841 int index, loop_p context_loop) in build_iteration_domains()
843 loop_p current = pbb_loop (scop->pbbs[index]); in build_iteration_domains()
852 loop_p loop = pbb_loop (pbb); in build_iteration_domains()
915 nested_in (loop_p a, loop_p b) in nested_in()
921 static loop_p
[all …]
H A Dtree-data-ref.h443 vec<loop_p> loop_nest;
525 vec<loop_p> *,
547 extern bool graphite_find_data_references_in_stmt (edge, loop_p, gimple *,
550 bool loop_nest_has_data_refs (loop_p loop);
551 struct data_reference *create_data_ref (edge, loop_p, tree, gimple *, bool,
553 extern bool find_loop_nest (class loop *, vec<loop_p> *);
555 (struct data_reference *, struct data_reference *, vec<loop_p>);
557 loop_p);
561 const vec<loop_p> &, bool);
676 index_in_loop_nest (int var, const vec<loop_p> &loop_nest) in index_in_loop_nest()
H A Dgraphite-scop-detection.cc309 sese_l get_sese (loop_p loop);
318 void build_scop_depth (loop_p loop);
381 static bool graphite_can_represent_expr (sese_l scop, loop_p loop,
398 static bool can_represent_loop (loop_p loop, sese_l scop);
413 scop_detection::get_sese (loop_p loop) in get_sese()
512 scop_detection::build_scop_depth (loop_p loop) in build_scop_depth()
552 scop_detection::can_represent_loop (loop_p loop, sese_l scop) in can_represent_loop()
683 loop_p loop = bb->loop_father; in harmful_loop_in_region()
706 loop_p loop = (*current_loops->larray)[j]; in harmful_loop_in_region()
921 scop_detection::graphite_can_represent_expr (sese_l scop, loop_p loop, in graphite_can_represent_expr()
[all …]
H A Dgraphite-isl-ast-to-gimple.cc133 edge translate_isl_ast (loop_p context_loop, __isl_keep isl_ast_node *node,
135 edge translate_isl_ast_node_for (loop_p context_loop,
138 edge translate_isl_ast_for_loop (loop_p context_loop,
143 edge translate_isl_ast_node_if (loop_p context_loop,
148 edge translate_isl_ast_node_block (loop_p context_loop,
173 loop_p outer, tree type,
186 tree get_rename_from_scev (tree old_name, gimple_seq *stmts, loop_p loop,
570 loop_p outer, tree type, tree lb, tree ub, in graphite_create_new_loop()
582 loop_p loop = create_empty_loop_on_edge in graphite_create_new_loop()
600 translate_isl_ast_for_loop (loop_p context_loop, in translate_isl_ast_for_loop()
[all …]
H A Dcfgloop.h95 typedef class loop *loop_p; typedef
142 vec<loop_p, va_gc> *superloops;
326 vec<loop_p, va_gc> *larray;
410 void mark_loop_for_removal (loop_p);
559 inline vec<loop_p, va_gc> *
H A Dsese.cc238 loop_p
241 loop_p nest = outermost_loop_in_sese_1 (region, bb); in outermost_loop_in_sese()
411 loop_p loop; in scev_analyzable_p()
441 scalar_evolution_in_region (const sese_l &region, loop_p loop, tree t) in scalar_evolution_in_region()
H A Dtree-loop-distribution.cc489 create_rdg_cd_edges (struct graph *rdg, control_dependences *cd, loop_p loop) in create_rdg_cd_edges()
514 vec<loop_p> loop_nest;
535 loop_p loop);
585 void classify_builtin_ldst (loop_p loop, struct graph *rdg, partition *partition,
595 classify_partition (loop_p loop,
660 bool transform_reduction_loop (loop_p loop);
713 loop_p loop) in create_rdg_vertices()
905 ssa_name_has_uses_outside_loop_p (tree def, loop_p loop) in ssa_name_has_uses_outside_loop_p()
927 stmt_has_scalar_dependences_outside_loop (loop_p loop, gimple *stmt) in stmt_has_scalar_dependences_outside_loop()
1624 compute_access_range (loop_p loop_nest, data_reference_p dr, tree *base, in compute_access_range()
[all …]
H A Dgraphite.h312 static inline loop_p
447 extern tree cached_scalar_evolution_in_region (const sese_l &, loop_p, tree);
H A Dtree-ssa-loop-ch.cc385 auto_vec<loop_p> candidates; in copy_headers()
386 auto_vec<std::pair<edge, loop_p> > copied; in copy_headers()
562 loop_p loop = copied[i].second; in copy_headers()
H A Dgraphite.cc145 loop_p loop = bb->loop_father; in print_graphite_scop_statistics()
248 cached_scalar_evolution_in_region (const sese_l &region, loop_p loop, in cached_scalar_evolution_in_region()
287 canonicalize_loop_closed_ssa (loop_p loop, edge e) in canonicalize_loop_closed_ssa()
H A Dcfgloop.cc213 loop_p loop; in flow_loops_free()
283 loop_p ploop; in establish_preds()
457 auto_vec<loop_p> larray (loops->larray->length ()); in flow_loops_find()
561 auto_vec<loop_p, 3> siblings; in sort_sibling_loops()
565 loop_p sibling = loop->inner; in sort_sibling_loops()
573 loop_p *siblingp = &loop->inner; in sort_sibling_loops()
1266 loop_p ploop; in add_bb_to_loop()
1292 loop_p ploop; in remove_bb_from_loops()
2109 mark_loop_for_removal (loop_p loop) in mark_loop_for_removal()
H A Dtree-scalar-evolution.h50 block_before_loop (loop_p loop) in block_before_loop()
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dsese.h105 extern tree scalar_evolution_in_region (const sese_l &, loop_p, tree);
189 sese_loop_depth (const sese_l &region, loop_p loop) in sese_loop_depth()
284 static inline loop_p
287 loop_p loop = gbb_loop (gbb); in gbb_loop_at_index()
303 loop_p l1 = gbb_loop (gbb1); in nb_common_loops()
304 loop_p l2 = gbb_loop (gbb2); in nb_common_loops()
305 loop_p common = find_common_loop (l1, l2); in nb_common_loops()
H A Dgraphite-sese-to-poly.c326 create_pw_aff_from_tree (poly_bb_p pbb, loop_p loop, tree t) in create_pw_aff_from_tree()
345 loop_p loop = gimple_bb (stmt)->loop_father; in add_condition_to_pbb()
725 add_iter_domain_dimension (__isl_take isl_set *domain, loop_p loop, scop_p scop) in add_iter_domain_dimension()
738 add_loop_constraints (scop_p scop, __isl_take isl_set *domain, loop_p loop, in add_loop_constraints()
739 loop_p context) in add_loop_constraints()
845 int index, loop_p context_loop) in build_iteration_domains()
847 loop_p current = pbb_loop (scop->pbbs[index]); in build_iteration_domains()
856 loop_p loop = pbb_loop (pbb); in build_iteration_domains()
919 nested_in (loop_p a, loop_p b) in nested_in()
925 static loop_p
[all …]
H A Dtree-data-ref.h438 vec<loop_p> loop_nest;
520 vec<loop_p> *,
542 extern bool graphite_find_data_references_in_stmt (edge, loop_p, gimple *,
545 bool loop_nest_has_data_refs (loop_p loop);
546 struct data_reference *create_data_ref (edge, loop_p, tree, gimple *, bool,
548 extern bool find_loop_nest (class loop *, vec<loop_p> *);
550 (struct data_reference *, struct data_reference *, vec<loop_p>);
552 loop_p);
556 vec<loop_p>, bool);
669 index_in_loop_nest (int var, vec<loop_p> loop_nest) in index_in_loop_nest()
H A Dcfgloop.h95 typedef class loop *loop_p; typedef
142 vec<loop_p, va_gc> *superloops;
326 vec<loop_p, va_gc> *larray;
410 void mark_loop_for_removal (loop_p);
559 inline vec<loop_p, va_gc> *
666 loop_iterator (function *fn, loop_p *loop, unsigned flags);
668 inline loop_p next ();
680 inline loop_p
688 loop_p loop = get_loop (fn, anum); in next()
697 loop_iterator::loop_iterator (function *fn, loop_p *loop, unsigned flags) in loop_iterator()
H A Dgraphite-scop-detection.c309 sese_l get_sese (loop_p loop);
318 void build_scop_depth (loop_p loop);
381 static bool graphite_can_represent_expr (sese_l scop, loop_p loop,
398 static bool can_represent_loop (loop_p loop, sese_l scop);
413 scop_detection::get_sese (loop_p loop) in get_sese()
512 scop_detection::build_scop_depth (loop_p loop) in build_scop_depth()
552 scop_detection::can_represent_loop (loop_p loop, sese_l scop) in can_represent_loop()
683 loop_p loop = bb->loop_father; in harmful_loop_in_region()
706 loop_p loop = (*current_loops->larray)[j]; in harmful_loop_in_region()
921 scop_detection::graphite_can_represent_expr (sese_l scop, loop_p loop, in graphite_can_represent_expr()
[all …]
H A Dgraphite-isl-ast-to-gimple.c138 edge translate_isl_ast (loop_p context_loop, __isl_keep isl_ast_node *node,
140 edge translate_isl_ast_node_for (loop_p context_loop,
143 edge translate_isl_ast_for_loop (loop_p context_loop,
148 edge translate_isl_ast_node_if (loop_p context_loop,
153 edge translate_isl_ast_node_block (loop_p context_loop,
178 loop_p outer, tree type,
191 tree get_rename_from_scev (tree old_name, gimple_seq *stmts, loop_p loop,
581 loop_p outer, tree type, tree lb, tree ub, in graphite_create_new_loop()
593 loop_p loop = create_empty_loop_on_edge in graphite_create_new_loop()
613 translate_isl_ast_for_loop (loop_p context_loop, in translate_isl_ast_for_loop()
[all …]
H A Dgraphite.c145 loop_p loop = bb->loop_father; in print_graphite_scop_statistics()
248 cached_scalar_evolution_in_region (const sese_l &region, loop_p loop, in cached_scalar_evolution_in_region()
287 canonicalize_loop_closed_ssa (loop_p loop, edge e) in canonicalize_loop_closed_ssa()
380 loop_p loop; in canonicalize_loop_form()
497 loop_p loop; in graphite_transform_loops()
H A Dsese.c238 loop_p
241 loop_p nest = outermost_loop_in_sese_1 (region, bb); in outermost_loop_in_sese()
411 loop_p loop; in scev_analyzable_p()
441 scalar_evolution_in_region (const sese_l &region, loop_p loop, tree t) in scalar_evolution_in_region()
H A Dcfgloop.c213 loop_p loop; in flow_loops_free()
283 loop_p ploop; in establish_preds()
457 auto_vec<loop_p> larray (loops->larray->length ()); in flow_loops_find()
561 auto_vec<loop_p, 3> siblings; in sort_sibling_loops()
562 loop_p loop; in sort_sibling_loops()
566 loop_p sibling = loop->inner; in sort_sibling_loops()
574 loop_p *siblingp = &loop->inner; in sort_sibling_loops()
1269 loop_p ploop; in add_bb_to_loop()
1295 loop_p ploop; in remove_bb_from_loops()
2097 mark_loop_for_removal (loop_p loop) in mark_loop_for_removal()
H A Dgraphite.h328 static inline loop_p
463 extern tree cached_scalar_evolution_in_region (const sese_l &, loop_p, tree);
H A Dtree-loop-distribution.c485 create_rdg_cd_edges (struct graph *rdg, control_dependences *cd, loop_p loop) in create_rdg_cd_edges()
510 vec<loop_p> loop_nest;
530 bool create_rdg_vertices (struct graph *rdg, vec<gimple *> stmts, loop_p loop);
580 void classify_builtin_ldst (loop_p loop, struct graph *rdg, partition *partition,
590 classify_partition (loop_p loop,
703 loop_p loop) in create_rdg_vertices()
895 ssa_name_has_uses_outside_loop_p (tree def, loop_p loop) in ssa_name_has_uses_outside_loop_p()
917 stmt_has_scalar_dependences_outside_loop (loop_p loop, gimple *stmt) in stmt_has_scalar_dependences_outside_loop()
1611 compute_access_range (loop_p loop_nest, data_reference_p dr, tree *base,
1701 classify_builtin_st (loop_p loop, partition *partition, data_reference_p dr) in classify_builtin_st()
[all …]
H A Dtree-scalar-evolution.h50 block_before_loop (loop_p loop) in block_before_loop()

1234