/netbsd/external/gpl3/gcc/dist/gcc/ |
H A D | tree-ssa-uninit.c | 982 preds->release (); in destroy_predicate_vecs() 1698 n = preds->length (); in simplify_preds_2() 1754 preds->release (); in simplify_preds_2() 1755 (*preds) = s_preds; in simplify_preds_2() 1776 n = preds->length (); in simplify_preds_3() 1832 n = preds->length (); in simplify_preds_4() 1892 preds->release (); in simplify_preds_4() 1917 n = preds->length (); in simplify_preds() 2253 preds[i].release (); in normalize_preds() 2462 preds); in is_use_properly_guarded() [all …]
|
H A D | cfganal.c | 336 FOR_EACH_EDGE (e, ei, s->preds) in verify_edge_list() 506 FOR_EACH_EDGE (e, ei, succ->preds) in find_edge() 819 && EDGE_COUNT (bb->preds) > 0) in inverted_post_order_compute() 836 if (EDGE_COUNT (bb->preds) > 0) in inverted_post_order_compute() 893 if (EDGE_COUNT (bb->preds) > 0) in inverted_post_order_compute() 1517 FOR_EACH_EDGE (e, ei, bb->preds) in execute() 1557 FOR_EACH_EDGE (e, ei, lbb->preds) in dfs_enumerate_from() 1618 if (EDGE_COUNT (b->preds) >= 2) in compute_dominance_frontiers() 1621 FOR_EACH_EDGE (p, ei, b->preds) in compute_dominance_frontiers() 1840 if (ix == EDGE_COUNT (b->preds)) in bitmap_union_of_preds() [all …]
|
H A D | cfganal.cc | 377 FOR_EACH_EDGE (e, ei, s->preds) in verify_edge_list() 531 FOR_EACH_EDGE (e, ei, succ->preds) in find_edge() 846 && EDGE_COUNT (bb->preds) > 0) in inverted_post_order_compute() 863 if (EDGE_COUNT (bb->preds) > 0) in inverted_post_order_compute() 920 if (EDGE_COUNT (bb->preds) > 0) in inverted_post_order_compute() 1544 FOR_EACH_EDGE (e, ei, bb->preds) in execute() 1584 FOR_EACH_EDGE (e, ei, lbb->preds) in dfs_enumerate_from() 1645 if (EDGE_COUNT (b->preds) >= 2) in compute_dominance_frontiers() 1648 FOR_EACH_EDGE (p, ei, b->preds) in compute_dominance_frontiers() 1867 if (ix == EDGE_COUNT (b->preds)) in bitmap_union_of_preds() [all …]
|
H A D | gimple-predicate-analysis.cc | 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() 295 const pred_chain &chain = preds[i]; in find_matching_predicate_in_rest_chains() 333 gcc_assert (preds.length () > 0); in find_var_cmp_const() 334 pred_chain chain = preds[0]; in find_var_cmp_const() 963 if (!includes (preds.m_preds[i])) in superset_of() 1192 if (preds.is_empty ()) in can_be_invalidated_p() 1196 dump_predicates (NULL, preds, in can_be_invalidated_p() [all …]
|
H A D | predict.cc | 517 if (!preds) in gimple_predicted_by_p() 535 if (!preds) in edge_predicted_by_p() 628 preds = i; in gimple_predict_edge() 646 if (preds) in filter_predictions() 694 if (!preds) in clear_bb_predictions() 702 *preds = NULL; in clear_bb_predictions() 1147 if (preds) in prune_predictions_for_bb() 1257 if (preds) in combine_predictions_for_bb() 1311 if (preds) in combine_predictions_for_bb() 1392 if (preds) in combine_predictions_for_bb() [all …]
|
H A D | basic-block.h | 119 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 D | predict.c | 480 if (!preds) in gimple_predicted_by_p() 498 if (!preds) in edge_predicted_by_p() 591 preds = i; in gimple_predict_edge() 608 if (preds) in filter_predictions() 656 if (!preds) in clear_bb_predictions() 664 *preds = NULL; in clear_bb_predictions() 1109 if (preds) in prune_predictions_for_bb() 1219 if (preds) in combine_predictions_for_bb() 1273 if (preds) in combine_predictions_for_bb() 1354 if (preds) in combine_predictions_for_bb() [all …]
|
H A D | read-rtl-function.c | 1931 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() 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() 2087 ASSERT_EQ (NULL, entry->preds); in test_loading_cfg() 2092 ASSERT_EQ (1, bb2->preds->length ()); in test_loading_cfg() 2099 ASSERT_EQ (1, bb3->preds->length ()); in test_loading_cfg() 2105 ASSERT_EQ (1, bb4->preds->length ()); in test_loading_cfg() 2111 ASSERT_EQ (2, bb5->preds->length ()); in test_loading_cfg() [all …]
|
H A D | read-rtl-function.cc | 1934 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() 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() 2090 ASSERT_EQ (NULL, entry->preds); in test_loading_cfg() 2095 ASSERT_EQ (1, bb2->preds->length ()); in test_loading_cfg() 2102 ASSERT_EQ (1, bb3->preds->length ()); in test_loading_cfg() 2108 ASSERT_EQ (1, bb4->preds->length ()); in test_loading_cfg() 2114 ASSERT_EQ (2, bb5->preds->length ()); in test_loading_cfg() [all …]
|
H A D | cfg.c | 110 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 D | cfg.cc | 103 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 D | shrink-wrap.c | 140 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() 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() 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() 1343 FOR_EACH_EDGE (e, ei, bb->preds) in spread_components() 1377 FOR_EACH_EDGE (e, ei, bb->preds) in spread_components() [all …]
|
H A D | shrink-wrap.cc | 141 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() 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() 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() 1354 FOR_EACH_EDGE (e, ei, bb->preds) in spread_components() 1388 FOR_EACH_EDGE (e, ei, bb->preds) in spread_components() [all …]
|
H A D | domwalk.c | 225 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 D | domwalk.cc | 225 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 D | tree-ssa-tail-merge.c | 255 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()
|
/netbsd/external/gpl3/gcc.old/dist/gcc/ |
H A D | tree-ssa-uninit.c | 982 preds->release (); in destroy_predicate_vecs() 1698 n = preds->length (); in simplify_preds_2() 1754 preds->release (); in simplify_preds_2() 1755 (*preds) = s_preds; in simplify_preds_2() 1776 n = preds->length (); in simplify_preds_3() 1832 n = preds->length (); in simplify_preds_4() 1892 preds->release (); in simplify_preds_4() 1917 n = preds->length (); in simplify_preds() 2253 preds[i].release (); in normalize_preds() 2462 preds); in is_use_properly_guarded() [all …]
|
H A D | cfganal.c | 336 FOR_EACH_EDGE (e, ei, s->preds) in verify_edge_list() 506 FOR_EACH_EDGE (e, ei, succ->preds) in find_edge() 819 && EDGE_COUNT (bb->preds) > 0) in inverted_post_order_compute() 836 if (EDGE_COUNT (bb->preds) > 0) in inverted_post_order_compute() 893 if (EDGE_COUNT (bb->preds) > 0) in inverted_post_order_compute() 1517 FOR_EACH_EDGE (e, ei, bb->preds) in execute() 1557 FOR_EACH_EDGE (e, ei, lbb->preds) in dfs_enumerate_from() 1618 if (EDGE_COUNT (b->preds) >= 2) in compute_dominance_frontiers() 1621 FOR_EACH_EDGE (p, ei, b->preds) in compute_dominance_frontiers() 1840 if (ix == EDGE_COUNT (b->preds)) in bitmap_union_of_preds() [all …]
|
H A D | basic-block.h | 119 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 D | predict.c | 480 if (!preds) in gimple_predicted_by_p() 498 if (!preds) in edge_predicted_by_p() 591 preds = i; in gimple_predict_edge() 608 if (preds) in filter_predictions() 656 if (!preds) in clear_bb_predictions() 664 *preds = NULL; in clear_bb_predictions() 1109 if (preds) in prune_predictions_for_bb() 1219 if (preds) in combine_predictions_for_bb() 1273 if (preds) in combine_predictions_for_bb() 1354 if (preds) in combine_predictions_for_bb() [all …]
|
H A D | read-rtl-function.c | 1931 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() 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() 2087 ASSERT_EQ (NULL, entry->preds); in test_loading_cfg() 2092 ASSERT_EQ (1, bb2->preds->length ()); in test_loading_cfg() 2099 ASSERT_EQ (1, bb3->preds->length ()); in test_loading_cfg() 2105 ASSERT_EQ (1, bb4->preds->length ()); in test_loading_cfg() 2111 ASSERT_EQ (2, bb5->preds->length ()); in test_loading_cfg() [all …]
|
H A D | cfg.c | 110 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 D | shrink-wrap.c | 140 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() 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() 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() 1343 FOR_EACH_EDGE (e, ei, bb->preds) in spread_components() 1377 FOR_EACH_EDGE (e, ei, bb->preds) in spread_components() [all …]
|
H A D | domwalk.c | 225 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 D | tree-ssa-tail-merge.c | 255 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()
|