| /dragonfly/contrib/gcc-4.7/gcc/ |
| HD | cfganal.c | 93 if (bb == EXIT_BLOCK_PTR || bb == ENTRY_BLOCK_PTR in forwarder_block_p() 188 stack[sp++] = ei_start (ENTRY_BLOCK_PTR->succs); in mark_dfs_back_edges() 220 if (dest != EXIT_BLOCK_PTR && src != ENTRY_BLOCK_PTR in mark_dfs_back_edges() 225 if (ei_one_before_end_p (ei) && src != ENTRY_BLOCK_PTR) in mark_dfs_back_edges() 300 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs) in find_unreachable_blocks() 358 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb) in create_edge_list() 371 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb) in create_edge_list() 403 if (INDEX_EDGE_PRED_BB (elist, x) == ENTRY_BLOCK_PTR) in print_edge_list() 427 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb) in verify_edge_list() 452 FOR_BB_BETWEEN (p, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb) in verify_edge_list() [all …]
|
| HD | profile.c | 118 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb) in instrument_edges() 241 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb) in get_exec_counts() 299 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb) in correct_negative_edge_counts() 375 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb) in set_bb_counts() 394 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb) in read_profile_edge_counts() 457 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb) in compute_frequency_overlap() 466 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb) in compute_frequency_overlap() 508 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb) in compute_branch_probabilities() 523 BB_INFO (ENTRY_BLOCK_PTR)->pred_count = 2; in compute_branch_probabilities() 694 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb) in compute_branch_probabilities() [all …]
|
| HD | tree-optimize.c | 250 if (ENTRY_BLOCK_PTR->count) in execute_fixup_cfg() 252 * REG_BR_PROB_BASE + ENTRY_BLOCK_PTR->count / 2) in execute_fixup_cfg() 253 / ENTRY_BLOCK_PTR->count); in execute_fixup_cfg() 257 ENTRY_BLOCK_PTR->count = cgraph_get_node (current_function_decl)->count; in execute_fixup_cfg() 261 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs) in execute_fixup_cfg()
|
| HD | lcm.c | 161 if (!e->src->aux && e->src != ENTRY_BLOCK_PTR) in compute_antinout_edge() 196 if (pred == ENTRY_BLOCK_PTR) in compute_earliest() 284 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs) in compute_laterin() 508 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs) in compute_available() 509 e->dest->aux = ENTRY_BLOCK_PTR; in compute_available() 524 if (bb->aux == ENTRY_BLOCK_PTR) in compute_available() 582 if (pred == ENTRY_BLOCK_PTR) in compute_farthest() 664 && e->src != ENTRY_BLOCK_PTR && e->src->aux == 0) in compute_nearerout() 675 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs) in compute_nearerout() 701 if (b == ENTRY_BLOCK_PTR) in compute_rev_insert_delete()
|
| HD | cfghooks.c | 104 last_bb_seen = ENTRY_BLOCK_PTR; in verify_flow_info() 105 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR->next_bb, NULL, next_bb) in verify_flow_info() 236 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs) in verify_flow_info() 243 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb) in verify_flow_info() 250 last_bb_seen = ENTRY_BLOCK_PTR; in verify_flow_info() 847 if (ENTRY_BLOCK_PTR->next_bb == EXIT_BLOCK_PTR) in tidy_fallthru_edges() 850 FOR_BB_BETWEEN (b, ENTRY_BLOCK_PTR->next_bb, EXIT_BLOCK_PTR->prev_bb, next_bb) in tidy_fallthru_edges() 920 if (bb == EXIT_BLOCK_PTR || bb == ENTRY_BLOCK_PTR) in can_duplicate_block_p()
|
| HD | cfg.c | 128 FOR_EACH_EDGE (e, ei, ENTRY_BLOCK_PTR->succs) in clear_edges() 131 VEC_truncate (edge, ENTRY_BLOCK_PTR->succs, 0); in clear_edges() 172 SET_BASIC_BLOCK (ENTRY_BLOCK, ENTRY_BLOCK_PTR); in compact_blocks() 301 || src == ENTRY_BLOCK_PTR in cached_make_edge() 435 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb) in clear_bb_flags() 471 if (bb != ENTRY_BLOCK_PTR) in check_bb_profile() 702 if (cfun && side == ENTRY_BLOCK_PTR) in dump_edge_info() 851 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb) in alloc_aux_for_edges() 870 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb) in clear_aux_for_edges()
|
| HD | cfgrtl.c | 461 BB_HEAD (ENTRY_BLOCK_PTR->next_bb) : get_insns ()); in entry_of_function() 469 edge_iterator ei = ei_start (ENTRY_BLOCK_PTR->succs); in emit_insn_at_entry() 738 && a != ENTRY_BLOCK_PTR && b != EXIT_BLOCK_PTR in rtl_can_merge_blocks() 1152 if (e->src != ENTRY_BLOCK_PTR && e->dest != EXIT_BLOCK_PTR in force_nonfallthru_and_redirect() 1193 if (e->src == ENTRY_BLOCK_PTR) in force_nonfallthru_and_redirect() 1202 basic_block bb = create_basic_block (BB_HEAD (e->dest), NULL, ENTRY_BLOCK_PTR); in force_nonfallthru_and_redirect() 1207 for (ei = ei_start (ENTRY_BLOCK_PTR->succs); (tmp = ei_safe_edge (ei)); ) in force_nonfallthru_and_redirect() 1211 VEC_unordered_remove (edge, ENTRY_BLOCK_PTR->succs, ei.index); in force_nonfallthru_and_redirect() 1222 make_single_succ_edge (ENTRY_BLOCK_PTR, bb, EDGE_FALLTHRU); in force_nonfallthru_and_redirect() 1520 if (edge_in->src != ENTRY_BLOCK_PTR) in rtl_split_edge() [all …]
|
| HD | tree-ssa-dce.c | 119 if (bb == ENTRY_BLOCK_PTR) in set_control_dependence_map_bit() 139 gcc_assert (block != ENTRY_BLOCK_PTR); in find_pdom() 164 if (INDEX_EDGE_PRED_BB (el, edge_index) == ENTRY_BLOCK_PTR) in find_control_dependence() 165 ending_block = single_succ (ENTRY_BLOCK_PTR); in find_control_dependence() 414 if (bb == ENTRY_BLOCK_PTR) in mark_control_dependent_edges_necessary() 721 if (bb != ENTRY_BLOCK_PTR in propagate_necessity() 827 else if (arg_bb != ENTRY_BLOCK_PTR in propagate_necessity() 1296 h = get_all_dominated_blocks (CDI_DOMINATORS, single_succ (ENTRY_BLOCK_PTR)); in eliminate_unnecessary_stmts() 1386 for (bb = EXIT_BLOCK_PTR->prev_bb; bb != ENTRY_BLOCK_PTR; bb = prev_bb) in eliminate_unnecessary_stmts()
|
| HD | domwalk.c | 149 SET_BIT (visited, ENTRY_BLOCK_PTR->index); in walk_dominator_tree() 155 || bb == ENTRY_BLOCK_PTR in walk_dominator_tree()
|
| HD | cfgbuild.c | 224 if (min == ENTRY_BLOCK_PTR->next_bb) in make_edges() 225 make_edge (ENTRY_BLOCK_PTR, min, EDGE_FALLTHRU); in make_edges() 251 cached_make_edge (NULL, ENTRY_BLOCK_PTR, bb, 0); in make_edges() 491 make_edge (ENTRY_BLOCK_PTR, bb, 0); in find_bb_boundaries()
|
| HD | predict.c | 127 && freq < (ENTRY_BLOCK_PTR->frequency * 2 / 3)) in maybe_hot_frequency_p() 129 if (freq < ENTRY_BLOCK_PTR->frequency / PARAM_VALUE (HOT_BB_FREQUENCY_FRACTION)) in maybe_hot_frequency_p() 526 if ((e->src != ENTRY_BLOCK_PTR && EDGE_COUNT (e->src->succs) > 1) in gimple_predict_edge() 2143 propagate_freq (ENTRY_BLOCK_PTR, tovisit); in estimate_loops() 2156 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb) in counts_to_freqs() 2160 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb) in counts_to_freqs() 2185 if (ENTRY_BLOCK_PTR->frequency == 0) in expensive_function_p() 2189 limit = ENTRY_BLOCK_PTR->frequency * threshold; in expensive_function_p() 2233 single_succ_edge (ENTRY_BLOCK_PTR)->probability = REG_BR_PROB_BASE; in estimate_bb_frequencies() 2238 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb) in estimate_bb_frequencies() [all …]
|
| HD | tree-ssa-live.h | 286 && bb != ENTRY_BLOCK_PTR in live_on_entry() 300 && bb != ENTRY_BLOCK_PTR in live_on_exit()
|
| HD | ipa-split.c | 202 if (e->src != ENTRY_BLOCK_PTR in verify_non_ssa_vars() 215 if (e->src != ENTRY_BLOCK_PTR in verify_non_ssa_vars() 383 >= (ENTRY_BLOCK_PTR->frequency in consider_split() 907 first.bb = ENTRY_BLOCK_PTR; in find_split_points() 916 ENTRY_BLOCK_PTR->aux = (void *)(intptr_t)-1; in find_split_points() 927 && entry->bb != ENTRY_BLOCK_PTR) in find_split_points() 1007 else if (entry->bb != ENTRY_BLOCK_PTR) in find_split_points() 1034 ENTRY_BLOCK_PTR->aux = NULL; in find_split_points()
|
| HD | cfgcleanup.c | 789 return b->prev_bb == ENTRY_BLOCK_PTR ? b : b->prev_bb; in merge_blocks_move() 827 return next == ENTRY_BLOCK_PTR ? next->next_bb : next; in merge_blocks_move() 839 if (b_fallthru_edge->src == ENTRY_BLOCK_PTR) in merge_blocks_move() 847 return next == ENTRY_BLOCK_PTR ? next->next_bb : next; in merge_blocks_move() 1878 if (src1 == ENTRY_BLOCK_PTR || src2 == ENTRY_BLOCK_PTR) in try_crossjump_to_edge() 2599 for (b = ENTRY_BLOCK_PTR->next_bb; b != EXIT_BLOCK_PTR;) in try_optimize_cfg() 2616 && single_succ_edge (ENTRY_BLOCK_PTR)->dest != b)) in try_optimize_cfg() 2657 b = (c == ENTRY_BLOCK_PTR ? c->next_bb : c); in try_optimize_cfg() 2672 && (single_pred (b) == ENTRY_BLOCK_PTR in try_optimize_cfg() 2712 c = b->prev_bb == ENTRY_BLOCK_PTR ? b->next_bb : b->prev_bb; in try_optimize_cfg() [all …]
|
| HD | dominance.c | 246 ex_block = ENTRY_BLOCK_PTR; in calc_dfs_tree_nonrec() 251 en_block = ENTRY_BLOCK_PTR; in calc_dfs_tree_nonrec() 338 basic_block begin = reverse ? EXIT_BLOCK_PTR : ENTRY_BLOCK_PTR; in calc_dfs_tree() 504 en_block = ENTRY_BLOCK_PTR; in calc_idoms() 1098 if (bb == ENTRY_BLOCK_PTR) in prune_bbs_to_update_dominators() 1172 ybb = ENTRY_BLOCK_PTR; in determine_dominators_for_sons() 1343 *pointer_map_insert (map, ENTRY_BLOCK_PTR) = (void *) (size_t) n; in iterate_fix_dominators()
|
| HD | cfglayout.c | 656 for (bb = ENTRY_BLOCK_PTR->next_bb, index = NUM_FIXED_BLOCKS; in relink_block_chain() 674 prev_bb = ENTRY_BLOCK_PTR; in relink_block_chain() 675 bb = ENTRY_BLOCK_PTR->next_bb; in relink_block_chain() 724 for (bb = ENTRY_BLOCK_PTR->next_bb; bb; bb = (basic_block) bb->aux) in fixup_reorder_chain() 767 for (bb = ENTRY_BLOCK_PTR->next_bb; bb ; bb = (basic_block) bb->aux) in fixup_reorder_chain() 1053 basic_block c = ENTRY_BLOCK_PTR->next_bb; in fixup_fallthru_exit_predecessor()
|
| HD | mcf.c | 515 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb) in create_fixup_graph() 529 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, NULL, next_bb) in create_fixup_graph() 1131 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb) in adjust_cfg_counts() 1244 ENTRY_BLOCK_PTR->count = sum_edge_counts (ENTRY_BLOCK_PTR->succs); in adjust_cfg_counts() 1284 FOR_BB_BETWEEN (bb, ENTRY_BLOCK_PTR->next_bb, EXIT_BLOCK_PTR, next_bb) in adjust_cfg_counts()
|
| HD | tree-scalar-evolution.h | 50 return (preheader ? preheader->src : ENTRY_BLOCK_PTR); in block_before_loop()
|
| HD | tree-tailcall.c | 819 first = single_succ (ENTRY_BLOCK_PTR); in eliminate_tail_call() 841 decrease_profile (ENTRY_BLOCK_PTR, e->count, EDGE_FREQUENCY (e)); in eliminate_tail_call() 974 basic_block first = single_succ (ENTRY_BLOCK_PTR); in tree_optimize_tail_calls_1() 1008 first = split_edge (single_succ_edge (ENTRY_BLOCK_PTR)); in tree_optimize_tail_calls_1()
|
| HD | cfgloopanal.c | 90 FOR_BB_BETWEEN (act, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb) in mark_irreducible_loops() 100 FOR_BB_BETWEEN (act, ENTRY_BLOCK_PTR, EXIT_BLOCK_PTR, next_bb) in mark_irreducible_loops()
|
| HD | tree-into-ssa.c | 406 if (pred != ENTRY_BLOCK_PTR in compute_global_livein() 1307 if (TREE_CODE (var) == PARM_DECL && single_succ_p (ENTRY_BLOCK_PTR)) in rewrite_debug_stmt_uses() 1310 = gsi_after_labels (single_succ (ENTRY_BLOCK_PTR)); in rewrite_debug_stmt_uses() 1339 gsi = gsi_after_labels (single_succ (ENTRY_BLOCK_PTR)); in rewrite_debug_stmt_uses() 2406 walk_dominator_tree (&walk_data, ENTRY_BLOCK_PTR); in mark_def_site_blocks() 2501 rewrite_blocks (ENTRY_BLOCK_PTR, REWRITE_ALL); in rewrite_into_ssa() 3148 if (entry != ENTRY_BLOCK_PTR) in insert_updated_phi_nodes_for() 3421 start_bb = ENTRY_BLOCK_PTR; in update_ssa() 3479 if (start_bb != ENTRY_BLOCK_PTR) in update_ssa()
|
| HD | tree-ssa-live.c | 949 if (pred_bb == ENTRY_BLOCK_PTR) in loe_visit_block() 1027 def_bb = ENTRY_BLOCK_PTR; in set_var_live_on_entry() 1043 if (e->src != ENTRY_BLOCK_PTR) in set_var_live_on_entry() 1109 if (e->src != ENTRY_BLOCK_PTR) in calculate_live_on_exit() 1359 bb = ENTRY_BLOCK_PTR; in verify_live_on_entry()
|
| HD | cfgexpand.c | 4139 gcc_assert (EDGE_COUNT (ENTRY_BLOCK_PTR->succs) == 1); in construct_init_block() 4140 init_rtl_bb_info (ENTRY_BLOCK_PTR); in construct_init_block() 4142 ENTRY_BLOCK_PTR->flags |= BB_RTL; in construct_init_block() 4145 e = EDGE_SUCC (ENTRY_BLOCK_PTR, 0); in construct_init_block() 4149 if (e && e->dest != ENTRY_BLOCK_PTR->next_bb) in construct_init_block() 4161 ENTRY_BLOCK_PTR); in construct_init_block() 4162 init_block->frequency = ENTRY_BLOCK_PTR->frequency; in construct_init_block() 4163 init_block->count = ENTRY_BLOCK_PTR->count; in construct_init_block() 4173 e->count = ENTRY_BLOCK_PTR->count; in construct_init_block() 4424 rtl_profile_for_bb (ENTRY_BLOCK_PTR); in gimple_expand_cfg() [all …]
|
| HD | cfgloop.c | 361 root->header = ENTRY_BLOCK_PTR; in init_loops_structure() 362 ENTRY_BLOCK_PTR->loop_father = root; in init_loops_structure() 427 if (latch != ENTRY_BLOCK_PTR in flow_loops_find() 736 e = find_edge (ENTRY_BLOCK_PTR, loop->header); in disambiguate_multiple_latches() 773 if (bb == ENTRY_BLOCK_PTR || bb == EXIT_BLOCK_PTR) in flow_bb_inside_loop_p()
|
| HD | sbitmap.c | 814 if (e->src == ENTRY_BLOCK_PTR) in sbitmap_intersection_of_preds() 830 if (e->src == ENTRY_BLOCK_PTR) in sbitmap_intersection_of_preds() 898 if (e->src== ENTRY_BLOCK_PTR) in sbitmap_union_of_preds() 914 if (e->src == ENTRY_BLOCK_PTR) in sbitmap_union_of_preds()
|