Home
last modified time | relevance | path

Searched refs:edge_list (Results 1 – 12 of 12) sorted by relevance

/freebsd-11-stable/contrib/gcc/
HDlcm.c75 static void compute_earliest (struct edge_list *, int, sbitmap *, sbitmap *,
77 static void compute_laterin (struct edge_list *, sbitmap *, sbitmap *,
79 static void compute_insert_delete (struct edge_list *edge_list, sbitmap *,
83 static void compute_farthest (struct edge_list *, int, sbitmap *, sbitmap *,
85 static void compute_nearerout (struct edge_list *, sbitmap *, sbitmap *,
87 static void compute_rev_insert_delete (struct edge_list *edge_list, sbitmap *,
180 compute_earliest (struct edge_list *edge_list, int n_exprs, sbitmap *antin, in compute_earliest() argument
188 num_edges = NUM_EDGES (edge_list); in compute_earliest()
195 pred = INDEX_EDGE_PRED_BB (edge_list, x); in compute_earliest()
196 succ = INDEX_EDGE_SUCC_BB (edge_list, x); in compute_earliest()
[all …]
HDcfganal.c338 struct edge_list *
341 struct edge_list *elist; in create_edge_list()
359 elist = XNEW (struct edge_list); in create_edge_list()
377 free_edge_list (struct edge_list *elist) in free_edge_list()
389 print_edge_list (FILE *f, struct edge_list *elist) in print_edge_list()
416 verify_edge_list (FILE *f, struct edge_list *elist) in verify_edge_list()
507 find_edge_index (struct edge_list *edge_list, basic_block pred, basic_block succ) in find_edge_index() argument
511 for (x = 0; x < NUM_EDGES (edge_list); x++) in find_edge_index()
512 if (INDEX_EDGE_PRED_BB (edge_list, x) == pred in find_edge_index()
513 && INDEX_EDGE_SUCC_BB (edge_list, x) == succ) in find_edge_index()
[all …]
HDtree-ssa-dce.c118 static void find_all_control_dependences (struct edge_list *);
119 static void find_control_dependence (struct edge_list *, int);
126 static void find_obviously_necessary_stmts (struct edge_list *);
128 static void mark_control_dependent_edges_necessary (basic_block, struct edge_list *);
129 static void propagate_necessity (struct edge_list *);
160 find_all_control_dependences (struct edge_list *el) in find_all_control_dependences()
172 find_control_dependence (struct edge_list *el, int edge_index) in find_control_dependence()
386 find_obviously_necessary_stmts (struct edge_list *el) in find_obviously_necessary_stmts()
439 mark_control_dependent_edges_necessary (basic_block bb, struct edge_list *el) in mark_control_dependent_edges_necessary()
471 propagate_necessity (struct edge_list *el) in propagate_necessity()
[all …]
HDbasic-block.h550 struct edge_list struct
783 struct edge_list * create_edge_list (void);
784 void free_edge_list (struct edge_list *);
785 void print_edge_list (FILE *, struct edge_list *);
786 void verify_edge_list (FILE *, struct edge_list *);
787 int find_edge_index (struct edge_list *, basic_block, basic_block);
862 extern struct edge_list *pre_edge_lcm (int, sbitmap *, sbitmap *,
865 extern struct edge_list *pre_edge_rev_lcm (int, sbitmap *,
HDmode-switching.c393 struct edge_list *edge_list; in optimize_mode_switching() local
570 edge_list = pre_edge_lcm (n_entities, transp, comp, antic, in optimize_mode_switching()
585 for (e = NUM_EDGES (edge_list) - 1; e >= 0; e--) in optimize_mode_switching()
587 edge eg = INDEX_EDGE (edge_list, e); in optimize_mode_switching()
634 free_edge_list (edge_list); in optimize_mode_switching()
HDtree-outof-ssa.c86 VEC(int,heap) *edge_list;
224 g->edge_list = VEC_alloc (int, heap, 20); in new_elim_graph()
239 VEC_truncate (int, g->edge_list, 0); in clear_elim_graph()
250 VEC_free (int, heap, g->edge_list); in delete_elim_graph()
286 VEC_safe_push (int, heap, g->edge_list, pred); in elim_graph_add_edge()
287 VEC_safe_push (int, heap, g->edge_list, succ); in elim_graph_add_edge()
299 for (x = 0; x < VEC_length (int, g->edge_list); x += 2) in elim_graph_remove_succ_edge()
300 if (VEC_index (int, g->edge_list, x) == node) in elim_graph_remove_succ_edge()
302 VEC_replace (int, g->edge_list, x, -1); in elim_graph_remove_succ_edge()
303 y = VEC_index (int, g->edge_list, x + 1); in elim_graph_remove_succ_edge()
[all …]
HDgcse.c602 static int pre_edge_insert (struct edge_list *, struct expr **);
3764 static struct edge_list *edge_list; variable
3859 edge_list = pre_edge_lcm (expr_hash_table.n_elems, transp, comp, antloc, in compute_pre_data()
4115 pre_edge_insert (struct edge_list *edge_list, struct expr **index_map) in pre_edge_insert() argument
4124 num_edges = NUM_EDGES (edge_list); in pre_edge_insert()
4131 basic_block bb = INDEX_EDGE_PRED_BB (edge_list, e); in pre_edge_insert()
4154 edge eg = INDEX_EDGE (edge_list, e); in pre_edge_insert()
4175 INDEX_EDGE_SUCC_BB (edge_list, e)->index); in pre_edge_insert()
4512 did_insert = pre_edge_insert (edge_list, index_map); in pre_gcse()
4555 free_edge_list (edge_list); in one_pre_gcse_pass()
[all …]
HDprofile.c117 static void find_spanning_tree (struct edge_list *);
118 static unsigned instrument_edges (struct edge_list *);
133 instrument_edges (struct edge_list *el) in instrument_edges()
742 struct edge_list *el; in branch_prob()
1100 find_spanning_tree (struct edge_list *el) in find_spanning_tree()
HDsee.c651 static struct edge_list *edge_list = NULL; variable
1297 if (edge_list) in see_free_data_structures()
1299 free_edge_list (edge_list); in see_free_data_structures()
1300 edge_list = NULL; in see_free_data_structures()
1656 int num_edges = NUM_EDGES (edge_list); in see_pre_insert_extensions()
1668 basic_block bb = INDEX_EDGE_PRED_BB (edge_list, e); in see_pre_insert_extensions()
1681 edge eg = INDEX_EDGE (edge_list, e); in see_pre_insert_extensions()
1712 INDEX_EDGE_SUCC_BB (edge_list, e)->index); in see_pre_insert_extensions()
2132 edge_list = pre_edge_lcm (pre_extension_num, transp, comp, antloc, in see_execute_LCM()
HDChangeLog-19994882 (pre_insert_map, pre_delete_map, edge_list): New.
10830 * basic-block.h (struct edge_list): Stucture to maintain a vector
HDChangeLog-200516968 * tree-outof-ssa.c (_elim_graph): Change the type of edge_list
HDChangeLog-200410531 (find_rgns): Remove edge_list parameter. Traverse standard CFG