/dragonfly/contrib/gcc-8.0/gcc/ |
H A D | lcm.c | 64 static void compute_insert_delete (struct edge_list *edge_list, sbitmap *, 231 compute_laterin (struct edge_list *edge_list, sbitmap *earliest, in compute_laterin() argument 341 compute_insert_delete (struct edge_list *edge_list, sbitmap *antloc, in compute_insert_delete() argument 368 struct edge_list * 376 struct edge_list *edge_list; in pre_edge_lcm_avs() local 470 struct edge_list * 475 struct edge_list *edge_list; in pre_edge_lcm() local 585 compute_farthest (struct edge_list *edge_list, int n_exprs, in compute_farthest() argument 623 compute_nearerout (struct edge_list *edge_list, sbitmap *farthest, in compute_nearerout() argument 732 struct edge_list * [all …]
|
H A D | cfganal.h | 26 struct edge_list struct 54 struct edge_list * create_edge_list (void); 55 void free_edge_list (struct edge_list *); 56 void print_edge_list (FILE *, struct edge_list *); 57 void verify_edge_list (FILE *, struct edge_list *); 59 int find_edge_index (struct edge_list *, basic_block, basic_block);
|
H A D | tree-outof-ssa.c | 141 auto_vec<int> edge_list; member 413 g->edge_list.truncate (0); in clear_elim_graph() 447 g->edge_list.safe_push (pred); in elim_graph_add_edge() 448 g->edge_list.safe_push (succ); in elim_graph_add_edge() 461 for (x = 0; x < g->edge_list.length (); x += 2) in elim_graph_remove_succ_edge() 462 if (g->edge_list[x] == node) in elim_graph_remove_succ_edge() 464 g->edge_list[x] = -1; in elim_graph_remove_succ_edge() 465 y = g->edge_list[x + 1]; in elim_graph_remove_succ_edge() 466 g->edge_list[x + 1] = -1; in elim_graph_remove_succ_edge() 486 y_ = (GRAPH)->edge_list[x_]; \ [all …]
|
H A D | lcm.h | 23 extern struct edge_list *pre_edge_lcm_avs (int, sbitmap *, sbitmap *, 26 extern struct edge_list *pre_edge_lcm (int, sbitmap *, sbitmap *, 30 extern struct edge_list *pre_edge_rev_lcm (int, sbitmap *,
|
H A D | mode-switching.c | 108 commit_mode_sets (struct edge_list *edge_list, int e, struct bb_info *info) in commit_mode_sets() argument 112 for (int ed = NUM_EDGES (edge_list) - 1; ed >= 0; ed--) in commit_mode_sets() 114 edge eg = INDEX_EDGE (edge_list, ed); in commit_mode_sets() 496 struct edge_list *edge_list = 0; in optimize_mode_switching() local 703 edge_list = pre_edge_lcm_avs (n_entities * max_num_modes, transp, comp, antic, in optimize_mode_switching() 712 for (int ed = NUM_EDGES (edge_list) - 1; ed >= 0; ed--) in optimize_mode_switching() 714 edge eg = INDEX_EDGE (edge_list, ed); in optimize_mode_switching() 773 need_commit |= commit_mode_sets (edge_list, entity_map[j], bb_info[j]); in optimize_mode_switching() 829 free_edge_list (edge_list); in optimize_mode_switching()
|
H A D | store-motion.c | 99 static struct edge_list *edge_list; variable 780 int index = EDGE_INDEX (edge_list, tmp->src, tmp->dest); in insert_store() 793 int index = EDGE_INDEX (edge_list, tmp->src, tmp->dest); in insert_store() 1158 edge_list = pre_edge_rev_lcm (num_stores, st_transp, st_avloc, in one_store_motion_pass() 1167 for (x = NUM_EDGES (edge_list) - 1; x >= 0; x--) in one_store_motion_pass() 1169 && (INDEX_EDGE (edge_list, x)->flags & EDGE_ABNORMAL)) in one_store_motion_pass() 1177 ptr->index, INDEX_EDGE (edge_list, x)->src->index, in one_store_motion_pass() 1178 INDEX_EDGE (edge_list, x)->dest->index); in one_store_motion_pass() 1191 for (x = 0; x < NUM_EDGES (edge_list); x++) in one_store_motion_pass() 1194 did_edge_inserts |= insert_store (ptr, INDEX_EDGE (edge_list, x)); in one_store_motion_pass() [all …]
|
H A D | gcse.c | 1859 static struct edge_list * 1862 struct edge_list *edge_list; in compute_pre_data() local 1889 return edge_list; in compute_pre_data() 2115 pre_edge_insert (struct edge_list *edge_list, struct gcse_expr **index_map) in pre_edge_insert() argument 2124 num_edges = NUM_EDGES (edge_list); in pre_edge_insert() 2156 edge eg = INDEX_EDGE (edge_list, e); in pre_edge_insert() 2540 pre_gcse (struct edge_list *edge_list) in pre_gcse() argument 2613 struct edge_list *edge_list; in one_pre_gcse_pass() local 2615 edge_list = compute_pre_data (); in one_pre_gcse_pass() 2616 changed |= pre_gcse (edge_list); in one_pre_gcse_pass() [all …]
|
H A D | cfganal.c | 215 struct edge_list * 218 struct edge_list *elist; in create_edge_list() 233 elist = XNEW (struct edge_list); in create_edge_list() 251 free_edge_list (struct edge_list *elist) in free_edge_list() 263 print_edge_list (FILE *f, struct edge_list *elist) in print_edge_list() 290 verify_edge_list (FILE *f, struct edge_list *elist) in verify_edge_list() 518 find_edge_index (struct edge_list *edge_list, basic_block pred, basic_block succ) in find_edge_index() argument 522 for (x = 0; x < NUM_EDGES (edge_list); x++) in find_edge_index() 523 if (INDEX_EDGE_PRED_BB (edge_list, x) == pred in find_edge_index() 524 && INDEX_EDGE_SUCC_BB (edge_list, x) == succ) in find_edge_index()
|
H A D | mcf.c | 119 fixup_edge_p edge_list; member 367 fixup_edge_p curr_edge = fixup_graph->edge_list + fixup_graph->num_edges; in add_edge() 445 free (fixup_graph->edge_list); in delete_fixup_graph() 501 fixup_graph->edge_list = in create_fixup_graph() 557 pfedge = fixup_graph->edge_list + i; in create_fixup_graph() 571 pfedge = fixup_graph->edge_list + i; in create_fixup_graph() 652 fedge_list = fixup_graph->edge_list; in create_fixup_graph() 799 fedge_list = fixup_graph->edge_list; in cancel_negative_cycle() 939 fedge_list = fixup_graph->edge_list; in compute_residual_flow() 1039 fedge_list = fixup_graph->edge_list; in find_max_flow()
|
H A D | profile.c | 115 static void find_spanning_tree (struct edge_list *); 123 instrument_edges (struct edge_list *el) in instrument_edges() 1025 struct edge_list *el; in branch_prob() 1435 find_spanning_tree (struct edge_list *el) in find_spanning_tree()
|
/dragonfly/contrib/gcc-4.7/gcc/ |
H A D | lcm.c | 78 static void compute_insert_delete (struct edge_list *edge_list, sbitmap *, 247 compute_laterin (struct edge_list *edge_list, sbitmap *earliest, in compute_laterin() argument 351 compute_insert_delete (struct edge_list *edge_list, sbitmap *antloc, in compute_insert_delete() argument 377 struct edge_list * 385 struct edge_list *edge_list; in pre_edge_lcm() local 470 return edge_list; in pre_edge_lcm() 561 compute_farthest (struct edge_list *edge_list, int n_exprs, in compute_farthest() argument 605 compute_nearerout (struct edge_list *edge_list, sbitmap *farthest, in compute_nearerout() argument 713 struct edge_list * 721 struct edge_list *edge_list; in pre_edge_rev_lcm() local [all …]
|
H A D | tree-outof-ssa.c | 76 VEC(int,heap) *edge_list; 350 g->edge_list = VEC_alloc (int, heap, 20); in new_elim_graph() 366 VEC_truncate (int, g->edge_list, 0); in clear_elim_graph() 378 VEC_free (int, heap, g->edge_list); in delete_elim_graph() 418 VEC_safe_push (int, heap, g->edge_list, pred); in elim_graph_add_edge() 419 VEC_safe_push (int, heap, g->edge_list, succ); in elim_graph_add_edge() 433 if (VEC_index (int, g->edge_list, x) == node) in elim_graph_remove_succ_edge() 435 VEC_replace (int, g->edge_list, x, -1); in elim_graph_remove_succ_edge() 436 y = VEC_index (int, g->edge_list, x + 1); in elim_graph_remove_succ_edge() 437 VEC_replace (int, g->edge_list, x + 1, -1); in elim_graph_remove_succ_edge() [all …]
|
H A D | cfganal.c | 342 struct edge_list * 345 struct edge_list *elist; in create_edge_list() 363 elist = XNEW (struct edge_list); in create_edge_list() 381 free_edge_list (struct edge_list *elist) in free_edge_list() 393 print_edge_list (FILE *f, struct edge_list *elist) in print_edge_list() 511 find_edge_index (struct edge_list *edge_list, basic_block pred, basic_block succ) in find_edge_index() argument 515 for (x = 0; x < NUM_EDGES (edge_list); x++) in find_edge_index() 516 if (INDEX_EDGE_PRED_BB (edge_list, x) == pred in find_edge_index() 517 && INDEX_EDGE_SUCC_BB (edge_list, x) == succ) in find_edge_index() 547 if (! edge_list) in flow_edge_list_print() [all …]
|
H A D | store-motion.c | 112 static struct edge_list *edge_list; variable 804 int index = EDGE_INDEX (edge_list, tmp->src, tmp->dest); in insert_store() 817 int index = EDGE_INDEX (edge_list, tmp->src, tmp->dest); in insert_store() 1165 edge_list = pre_edge_rev_lcm (num_stores, st_transp, st_avloc, in one_store_motion_pass() 1174 for (x = NUM_EDGES (edge_list) - 1; x >= 0; x--) in one_store_motion_pass() 1176 && (INDEX_EDGE (edge_list, x)->flags & EDGE_ABNORMAL)) in one_store_motion_pass() 1184 ptr->index, INDEX_EDGE (edge_list, x)->src->index, in one_store_motion_pass() 1185 INDEX_EDGE (edge_list, x)->dest->index); in one_store_motion_pass() 1198 for (x = 0; x < NUM_EDGES (edge_list); x++) in one_store_motion_pass() 1201 did_edge_inserts |= insert_store (ptr, INDEX_EDGE (edge_list, x)); in one_store_motion_pass() [all …]
|
H A D | basic-block.h | 500 struct edge_list struct 733 struct edge_list * create_edge_list (void); 734 void free_edge_list (struct edge_list *); 735 void print_edge_list (FILE *, struct edge_list *); 736 void verify_edge_list (FILE *, struct edge_list *); 737 int find_edge_index (struct edge_list *, basic_block, basic_block); 751 extern struct edge_list *pre_edge_lcm (int, sbitmap *, sbitmap *, 754 extern struct edge_list *pre_edge_rev_lcm (int, sbitmap *,
|
H A D | gcse.c | 1964 static struct edge_list * 1967 struct edge_list *edge_list; in compute_pre_data() local 1994 return edge_list; in compute_pre_data() 2220 pre_edge_insert (struct edge_list *edge_list, struct expr **index_map) in pre_edge_insert() argument 2229 num_edges = NUM_EDGES (edge_list); in pre_edge_insert() 2261 edge eg = INDEX_EDGE (edge_list, e); in pre_edge_insert() 2580 pre_gcse (struct edge_list *edge_list) in pre_gcse() argument 2653 struct edge_list *edge_list; in one_pre_gcse_pass() local 2655 edge_list = compute_pre_data (); in one_pre_gcse_pass() 2656 changed |= pre_gcse (edge_list); in one_pre_gcse_pass() [all …]
|
H A D | mode-switching.c | 440 struct edge_list *edge_list; in optimize_mode_switching() local 618 edge_list = pre_edge_lcm (n_entities, transp, comp, antic, in optimize_mode_switching() 633 for (e = NUM_EDGES (edge_list) - 1; e >= 0; e--) in optimize_mode_switching() 635 edge eg = INDEX_EDGE (edge_list, e); in optimize_mode_switching() 681 free_edge_list (edge_list); in optimize_mode_switching()
|
H A D | mcf.c | 127 fixup_edge_p edge_list; member 375 fixup_edge_p curr_edge = fixup_graph->edge_list + fixup_graph->num_edges; in add_edge() 453 free (fixup_graph->edge_list); in delete_fixup_graph() 506 fixup_graph->edge_list = in create_fixup_graph() 561 pfedge = fixup_graph->edge_list + i; in create_fixup_graph() 575 pfedge = fixup_graph->edge_list + i; in create_fixup_graph() 656 fedge_list = fixup_graph->edge_list; in create_fixup_graph() 803 fedge_list = fixup_graph->edge_list; in cancel_negative_cycle() 943 fedge_list = fixup_graph->edge_list; in compute_residual_flow() 1043 fedge_list = fixup_graph->edge_list; in find_max_flow()
|
H A D | tree-ssa-dce.c | 157 find_control_dependence (struct edge_list *el, int edge_index) in find_control_dependence() 190 find_all_control_dependences (struct edge_list *el) in find_all_control_dependences() 405 mark_control_dependent_edges_necessary (basic_block bb, struct edge_list *el, in mark_control_dependent_edges_necessary() 444 find_obviously_necessary_stmts (struct edge_list *el) in find_obviously_necessary_stmts() 695 propagate_necessity (struct edge_list *el) in propagate_necessity() 1545 struct edge_list *el = NULL; in perform_tree_ssa_dce()
|
H A D | profile.c | 104 static void find_spanning_tree (struct edge_list *); 112 instrument_edges (struct edge_list *el) in instrument_edges() 948 struct edge_list *el; in branch_prob() 1332 find_spanning_tree (struct edge_list *el) in find_spanning_tree()
|