Home
last modified time | relevance | path

Searched refs:preds (Results 1 – 25 of 400) sorted by relevance

12345678910>>...16

/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dtree-ssa-uninit.c644 pred_chain_union *preds) in convert_control_dep_chain_into_preds() argument
653 preds->reserve (num_chains); in convert_control_dep_chain_into_preds()
766 preds->safe_push (t_chain); in convert_control_dep_chain_into_preds()
777 find_predicates (pred_chain_union *preds, in find_predicates() argument
804 = convert_control_dep_chain_into_preds (dep_chains, num_chains, preds); in find_predicates()
870 find_def_preds (pred_chain_union *preds, gphi *phi) in find_def_preds() argument
916 = convert_control_dep_chain_into_preds (dep_chains, num_chains, preds); in find_def_preds()
953 dump_predicates (gimple *usestmt, pred_chain_union preds, const char *msg) in dump_predicates() argument
961 size_t num_preds = preds.length (); in dump_predicates()
964 dump_pred_chain (preds[i]); in dump_predicates()
[all …]
H A Dcfganal.c336 FOR_EACH_EDGE (e, ei, s->preds) in verify_edge_list()
498 if (EDGE_COUNT (pred->succs) <= EDGE_COUNT (succ->preds)) in find_edge()
506 FOR_EACH_EDGE (e, ei, succ->preds) in find_edge()
540 for (ei = ei_start (bb->preds); (e = ei_safe_edge (ei)); ) in remove_fake_predecessors()
819 && EDGE_COUNT (bb->preds) > 0) in inverted_post_order_compute()
821 stack.quick_push (ei_start (bb->preds)); in inverted_post_order_compute()
824 if (EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (cfun)->preds)) in inverted_post_order_compute()
826 stack.quick_push (ei_start (EXIT_BLOCK_PTR_FOR_FN (cfun)->preds)); in inverted_post_order_compute()
836 if (EDGE_COUNT (bb->preds) > 0) in inverted_post_order_compute()
838 stack.quick_push (ei_start (bb->preds)); in inverted_post_order_compute()
[all …]
H A Dbasic-block.h119 vec<edge, va_gc> *preds; member
311 && EDGE_COUNT ((e)->dest->preds) >= 2)
315 #define EDGE_PRED(bb,i) (*(bb)->preds)[(i)]
331 return EDGE_COUNT (bb->preds) == 1; in single_pred_p()
529 FOR_EACH_EDGE (e, ei, bb->preds) in bb_has_eh_pred()
544 FOR_EACH_EDGE (e, ei, bb->preds) in bb_has_abnormal_pred()
637 FOR_EACH_EDGE (e, ei, bb->preds) in has_abnormal_call_or_eh_pred_edge_p()
H A Dpredict.c478 edge_prediction **preds = bb_predictions->get (bb); in gimple_predicted_by_p() local
480 if (!preds) in gimple_predicted_by_p()
483 for (i = *preds; i; i = i->ep_next) in gimple_predicted_by_p()
497 edge_prediction **preds = bb_predictions->get (bb); in edge_predicted_by_p() local
498 if (!preds) in edge_predicted_by_p()
506 for (i = *preds; i; i = i->ep_next) in edge_predicted_by_p()
588 edge_prediction *&preds = bb_predictions->get_or_insert (e->src); in gimple_predict_edge() local
590 i->ep_next = preds; in gimple_predict_edge()
591 preds = i; in gimple_predict_edge()
602 filter_predictions (edge_prediction **preds, in filter_predictions() argument
[all …]
H A Dread-rtl-function.c1931 ASSERT_EQ (NULL, entry->preds); in test_loading_jump_to_label_ref()
1936 ASSERT_EQ (1, bb4->preds->length ()); in test_loading_jump_to_label_ref()
1937 ASSERT_EDGE ((*bb4->preds)[0], 0, 4, EDGE_FALLTHRU); in test_loading_jump_to_label_ref()
1942 ASSERT_EQ (1, bb5->preds->length ()); in test_loading_jump_to_label_ref()
1943 ASSERT_EDGE ((*bb5->preds)[0], 4, 5, 0x0); in test_loading_jump_to_label_ref()
1948 ASSERT_EQ (1, exit->preds->length ()); in test_loading_jump_to_label_ref()
1949 ASSERT_EDGE ((*exit->preds)[0], 5, 1, EDGE_FALLTHRU); in test_loading_jump_to_label_ref()
2087 ASSERT_EQ (NULL, entry->preds); in test_loading_cfg()
2092 ASSERT_EQ (1, bb2->preds->length ()); in test_loading_cfg()
2093 ASSERT_EDGE ((*bb2->preds)[0], 0, 2, EDGE_FALLTHRU); in test_loading_cfg()
[all …]
H A Dcfg.c110 vec_safe_truncate (bb->preds, 0); in clear_edges()
115 vec_safe_truncate (EXIT_BLOCK_PTR_FOR_FN (fn)->preds, 0); in clear_edges()
212 vec_safe_push (dest->preds, e); in connect_dest()
213 e->dest_idx = EDGE_COUNT (dest->preds) - 1; in connect_dest()
249 dest->preds->unordered_remove (dest_idx); in disconnect_dest()
253 if (dest_idx < EDGE_COUNT (dest->preds)) in disconnect_dest()
458 FOR_EACH_EDGE (e, ei, bb->preds) in check_bb_profile()
477 FOR_EACH_EDGE (e, ei, bb->preds) in check_bb_profile()
819 FOR_EACH_EDGE (e, ei, bb->preds) in dump_bb_info()
H A Dshrink-wrap.c140 if (EDGE_COUNT (live_edge->dest->preds) > 2) in live_edge_for_reg()
279 if (EDGE_COUNT (next_block->preds) == 2) in move_insn_for_shrink_wrap()
386 if (!live_edge || EDGE_COUNT (live_edge->dest->preds) > 1) in move_insn_for_shrink_wrap()
495 FOR_EACH_EDGE (e, ei, pro->preds) in can_get_prologue()
523 FOR_EACH_EDGE (e, ei, bb->preds) in can_dup_for_shrink_wrapping()
896 FOR_EACH_EDGE (e, ei, pro->preds) in try_shrink_wrapping()
997 for (ei = ei_start (pro->preds); (e = ei_safe_edge (ei)); ) in try_shrink_wrapping()
1195 FOR_EACH_EDGE (e, ei, bb->preds) in place_prologue_for_one_component()
1304 FOR_EACH_EDGE (e, ei, bb->preds) in spread_components()
1332 FOR_EACH_EDGE (e, ei, exit_block->preds) in spread_components()
[all …]
H A Dtree-ssa-tail-merge.c255 bitmap preds; member
823 FOR_EACH_EDGE (e, ei, bb->preds) in mark_basic_block_deleted()
922 bitmap_print (file, c->preds, "preds:", "\n"); in print_cluster()
978 FOR_EACH_EDGE (e, ei, bb->preds) in add_bb_to_cluster()
979 bitmap_set_bit (c->preds, e->src->index); in add_bb_to_cluster()
992 c->preds = BITMAP_ALLOC (NULL); in new_cluster()
1005 BITMAP_FREE (c->preds); in delete_cluster()
1053 bitmap_ior_into (c1->preds, c2->preds); in merge_clusters()
1437 FOR_EACH_EDGE (e, ei, from->preds) in deps_ok_for_redirect_from_bb_to_bb()
1566 for (i = EDGE_COUNT (bb1->preds); i > 0 ; --i) in replace_block_by()
H A Ddomwalk.c225 FOR_EACH_EDGE (e, ei, bb->preds) in bb_reachable()
250 FOR_EACH_EDGE (e, ei, bb->preds) in propagate_unreachable_to_edges()
299 if (EDGE_COUNT (bb->preds) > 0 in walk()
H A Dtree-ssa-threadupdate.c744 FOR_EACH_EDGE (ein, ei, e->dest->preds) in compute_path_counts()
811 FOR_EACH_EDGE (ein, ei, epath->dest->preds) in compute_path_counts()
1381 FOR_EACH_EDGE (e, ei, bb->preds) in thread_block_1()
1573 FOR_EACH_EDGE (e, ei, bb->preds) in determine_bb_domination_status()
1597 FOR_EACH_EDGE (e, ei, bblocks[i]->preds) in determine_bb_domination_status()
1700 FOR_EACH_EDGE (e, ei, header->preds) in thread_through_loop_header()
1757 if (EDGE_COUNT (tgt_bb->preds) > 2) in thread_through_loop_header()
1771 FOR_EACH_EDGE (e, ei, header->preds) in thread_through_loop_header()
1798 FOR_EACH_EDGE (e, ei, header->preds) in thread_through_loop_header()
1997 FOR_EACH_EDGE (e, ei, BASIC_BLOCK_FOR_FN (cfun, i)->preds) in mark_threaded_blocks()
[all …]
H A Dfunction-tests.c371 ASSERT_EQ (NULL, entry->preds); in verify_three_block_cfg()
378 ASSERT_EQ (1, bb2->preds->length ()); in verify_three_block_cfg()
379 ASSERT_EQ (from_entry_to_bb2, (*bb2->preds)[0]); in verify_three_block_cfg()
386 ASSERT_EQ (1, exit->preds->length ()); in verify_three_block_cfg()
387 ASSERT_EQ (from_bb2_to_exit, (*exit->preds)[0]); in verify_three_block_cfg()
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dcfganal.cc377 FOR_EACH_EDGE (e, ei, s->preds) in verify_edge_list()
523 if (EDGE_COUNT (pred->succs) <= EDGE_COUNT (succ->preds)) in find_edge()
531 FOR_EACH_EDGE (e, ei, succ->preds) in find_edge()
565 for (ei = ei_start (bb->preds); (e = ei_safe_edge (ei)); ) in remove_fake_predecessors()
846 && EDGE_COUNT (bb->preds) > 0) in inverted_post_order_compute()
848 stack.quick_push (ei_start (bb->preds)); in inverted_post_order_compute()
851 if (EDGE_COUNT (EXIT_BLOCK_PTR_FOR_FN (cfun)->preds)) in inverted_post_order_compute()
853 stack.quick_push (ei_start (EXIT_BLOCK_PTR_FOR_FN (cfun)->preds)); in inverted_post_order_compute()
863 if (EDGE_COUNT (bb->preds) > 0) in inverted_post_order_compute()
865 stack.quick_push (ei_start (bb->preds)); in inverted_post_order_compute()
[all …]
H A Dgimple-predicate-analysis.cc208 dump_predicates (gimple *stmt, const pred_chain_union &preds, const char *msg) in dump_predicates() argument
217 unsigned np = preds.length (); in dump_predicates()
222 dump_pred_chain (preds[i]); in dump_predicates()
286 const pred_chain_union &preds) in find_matching_predicate_in_rest_chains() argument
289 if (preds.length () == 1) in find_matching_predicate_in_rest_chains()
292 for (unsigned i = 1; i < preds.length (); i++) in find_matching_predicate_in_rest_chains()
295 const pred_chain &chain = preds[i]; in find_matching_predicate_in_rest_chains()
326 find_var_cmp_const (pred_chain_union preds, gphi *phi, gimple **flag_def, in find_var_cmp_const() argument
333 gcc_assert (preds.length () > 0); in find_var_cmp_const()
334 pred_chain chain = preds[0]; in find_var_cmp_const()
[all …]
H A Dpredict.cc515 edge_prediction **preds = bb_predictions->get (bb); in gimple_predicted_by_p() local
517 if (!preds) in gimple_predicted_by_p()
520 for (i = *preds; i; i = i->ep_next) in gimple_predicted_by_p()
534 edge_prediction **preds = bb_predictions->get (bb); in edge_predicted_by_p() local
535 if (!preds) in edge_predicted_by_p()
543 for (i = *preds; i; i = i->ep_next) in edge_predicted_by_p()
625 edge_prediction *&preds = bb_predictions->get_or_insert (e->src); in gimple_predict_edge() local
627 i->ep_next = preds; in gimple_predict_edge()
628 preds = i; in gimple_predict_edge()
640 filter_predictions (edge_prediction **preds, in filter_predictions() argument
[all …]
H A Dbasic-block.h119 vec<edge, va_gc> *preds; member
311 && EDGE_COUNT ((e)->dest->preds) >= 2)
315 #define EDGE_PRED(bb,i) (*(bb)->preds)[(i)]
331 return EDGE_COUNT (bb->preds) == 1; in single_pred_p()
529 FOR_EACH_EDGE (e, ei, bb->preds) in bb_has_eh_pred()
544 FOR_EACH_EDGE (e, ei, bb->preds) in bb_has_abnormal_pred()
637 FOR_EACH_EDGE (e, ei, bb->preds) in has_abnormal_call_or_eh_pred_edge_p()
H A Dread-rtl-function.cc1934 ASSERT_EQ (NULL, entry->preds); in test_loading_jump_to_label_ref()
1939 ASSERT_EQ (1, bb4->preds->length ()); in test_loading_jump_to_label_ref()
1940 ASSERT_EDGE ((*bb4->preds)[0], 0, 4, EDGE_FALLTHRU); in test_loading_jump_to_label_ref()
1945 ASSERT_EQ (1, bb5->preds->length ()); in test_loading_jump_to_label_ref()
1946 ASSERT_EDGE ((*bb5->preds)[0], 4, 5, 0x0); in test_loading_jump_to_label_ref()
1951 ASSERT_EQ (1, exit->preds->length ()); in test_loading_jump_to_label_ref()
1952 ASSERT_EDGE ((*exit->preds)[0], 5, 1, EDGE_FALLTHRU); in test_loading_jump_to_label_ref()
2090 ASSERT_EQ (NULL, entry->preds); in test_loading_cfg()
2095 ASSERT_EQ (1, bb2->preds->length ()); in test_loading_cfg()
2096 ASSERT_EDGE ((*bb2->preds)[0], 0, 2, EDGE_FALLTHRU); in test_loading_cfg()
[all …]
H A Dcfg.cc103 vec_free (bb->preds); in free_block()
104 bb->preds = NULL; in free_block()
226 vec_safe_push (dest->preds, e); in connect_dest()
227 e->dest_idx = EDGE_COUNT (dest->preds) - 1; in connect_dest()
263 dest->preds->unordered_remove (dest_idx); in disconnect_dest()
267 if (dest_idx < EDGE_COUNT (dest->preds)) in disconnect_dest()
472 FOR_EACH_EDGE (e, ei, bb->preds) in check_bb_profile()
491 FOR_EACH_EDGE (e, ei, bb->preds) in check_bb_profile()
855 FOR_EACH_EDGE (e, ei, bb->preds) in dump_bb_info()
H A Dshrink-wrap.cc141 if (EDGE_COUNT (live_edge->dest->preds) > 2) in live_edge_for_reg()
280 if (EDGE_COUNT (next_block->preds) == 2) in move_insn_for_shrink_wrap()
387 if (!live_edge || EDGE_COUNT (live_edge->dest->preds) > 1) in move_insn_for_shrink_wrap()
496 FOR_EACH_EDGE (e, ei, pro->preds) in can_get_prologue()
524 FOR_EACH_EDGE (e, ei, bb->preds) in can_dup_for_shrink_wrapping()
907 FOR_EACH_EDGE (e, ei, pro->preds) in try_shrink_wrapping()
1008 for (ei = ei_start (pro->preds); (e = ei_safe_edge (ei)); ) in try_shrink_wrapping()
1206 FOR_EACH_EDGE (e, ei, bb->preds) in place_prologue_for_one_component()
1315 FOR_EACH_EDGE (e, ei, bb->preds) in spread_components()
1343 FOR_EACH_EDGE (e, ei, exit_block->preds) in spread_components()
[all …]
H A Dtree-ssa-tail-merge.cc255 bitmap preds; member
823 FOR_EACH_EDGE (e, ei, bb->preds) in mark_basic_block_deleted()
922 bitmap_print (file, c->preds, "preds:", "\n"); in print_cluster()
978 FOR_EACH_EDGE (e, ei, bb->preds) in add_bb_to_cluster()
979 bitmap_set_bit (c->preds, e->src->index); in add_bb_to_cluster()
992 c->preds = BITMAP_ALLOC (NULL); in new_cluster()
1005 BITMAP_FREE (c->preds); in delete_cluster()
1053 bitmap_ior_into (c1->preds, c2->preds); in merge_clusters()
1449 FOR_EACH_EDGE (e, ei, from->preds) in deps_ok_for_redirect_from_bb_to_bb()
1578 for (i = EDGE_COUNT (bb1->preds); i > 0 ; --i) in replace_block_by()
H A Ddomwalk.cc225 FOR_EACH_EDGE (e, ei, bb->preds) in bb_reachable()
250 FOR_EACH_EDGE (e, ei, bb->preds) in propagate_unreachable_to_edges()
299 if (EDGE_COUNT (bb->preds) > 0 in walk()
H A Dfunction-tests.cc372 ASSERT_EQ (NULL, entry->preds); in verify_three_block_cfg()
379 ASSERT_EQ (1, bb2->preds->length ()); in verify_three_block_cfg()
380 ASSERT_EQ (from_entry_to_bb2, (*bb2->preds)[0]); in verify_three_block_cfg()
387 ASSERT_EQ (1, exit->preds->length ()); in verify_three_block_cfg()
388 ASSERT_EQ (from_bb2_to_exit, (*exit->preds)[0]); in verify_three_block_cfg()
H A Dtree-ssa-threadupdate.cc826 FOR_EACH_EDGE (ein, ei, e->dest->preds) in compute_path_counts()
893 FOR_EACH_EDGE (ein, ei, epath->dest->preds) in compute_path_counts()
1466 FOR_EACH_EDGE (e, ei, bb->preds) in thread_block_1()
1660 FOR_EACH_EDGE (e, ei, bb->preds) in determine_bb_domination_status()
1684 FOR_EACH_EDGE (e, ei, bblocks[i]->preds) in determine_bb_domination_status()
1788 FOR_EACH_EDGE (e, ei, header->preds) in thread_through_loop_header()
1845 if (EDGE_COUNT (tgt_bb->preds) > 2) in thread_through_loop_header()
1859 FOR_EACH_EDGE (e, ei, header->preds) in thread_through_loop_header()
1886 FOR_EACH_EDGE (e, ei, header->preds) in thread_through_loop_header()
2081 FOR_EACH_EDGE (e, ei, BASIC_BLOCK_FOR_FN (cfun, i)->preds) in mark_threaded_blocks()
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/GlobalISel/
H A DMIPatternMatch.h140 And(Pred &&p, Preds &&... preds)
141 : And<Preds...>(std::forward<Preds>(preds)...), P(std::forward<Pred>(p)) {
159 Or(Pred &&p, Preds &&... preds)
160 : Or<Preds...>(std::forward<Preds>(preds)...), P(std::forward<Pred>(p)) {}
167 template <typename... Preds> And<Preds...> m_all_of(Preds &&... preds) {
168 return And<Preds...>(std::forward<Preds>(preds)...);
171 template <typename... Preds> Or<Preds...> m_any_of(Preds &&... preds) {
172 return Or<Preds...>(std::forward<Preds>(preds)...);
/netbsd-src/external/gpl3/gcc/dist/gcc/config/nds32/
H A Dnds32-fp-as-gp.cc135 || (find_fallthru_edge (EXIT_BLOCK_PTR_FOR_FN (cfun)->preds) == NULL)) in nds32_fp_as_gp_check_available()
145 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR_FOR_FN (cfun)->preds) in nds32_fp_as_gp_check_available()
/netbsd-src/external/gpl3/gcc.old/dist/gcc/config/nds32/
H A Dnds32-fp-as-gp.c135 || (find_fallthru_edge (EXIT_BLOCK_PTR_FOR_FN (cfun)->preds) == NULL)) in nds32_fp_as_gp_check_available()
145 FOR_EACH_EDGE (e, ei, EXIT_BLOCK_PTR_FOR_FN (cfun)->preds) in nds32_fp_as_gp_check_available()

12345678910>>...16