Searched refs:edge_list (Results 1 - 10 of 10) sorted by relevance

/haiku-buildtools/gcc/gcc/
H A Dlcm.h23 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 Dcfganal.h26 struct edge_list struct
37 control_dependences (edge_list *);
47 edge_list *m_el;
52 struct edge_list * create_edge_list (void);
53 void free_edge_list (struct edge_list *);
54 void print_edge_list (FILE *, struct edge_list *);
55 void verify_edge_list (FILE *, struct edge_list *);
57 int find_edge_index (struct edge_list *, basic_block, basic_block);
H A Dlcm.c79 static void compute_earliest (struct edge_list *, int, sbitmap *, sbitmap *,
81 static void compute_laterin (struct edge_list *, sbitmap *, sbitmap *,
83 static void compute_insert_delete (struct edge_list *edge_list, sbitmap *,
87 static void compute_farthest (struct edge_list *, int, sbitmap *, sbitmap *,
89 static void compute_nearerout (struct edge_list *, sbitmap *, sbitmap *,
91 static void compute_rev_insert_delete (struct edge_list *edge_list, sbitmap *,
189 compute_earliest (struct edge_list *edge_list, in
188 compute_earliest(struct edge_list *edge_list, int n_exprs, sbitmap *antin, sbitmap *antout, sbitmap *avout, sbitmap *kill, sbitmap *earliest) argument
256 compute_laterin(struct edge_list *edge_list, sbitmap *earliest, sbitmap *antloc, sbitmap *later, sbitmap *laterin) argument
367 compute_insert_delete(struct edge_list *edge_list, sbitmap *antloc, sbitmap *later, sbitmap *laterin, sbitmap *insert, sbitmap *del) argument
402 struct edge_list *edge_list; local
501 struct edge_list *edge_list; local
612 compute_farthest(struct edge_list *edge_list, int n_exprs, sbitmap *st_avout, sbitmap *st_avin, sbitmap *st_antin, sbitmap *kill, sbitmap *farthest) argument
656 compute_nearerout(struct edge_list *edge_list, sbitmap *farthest, sbitmap *st_avloc, sbitmap *nearer, sbitmap *nearerout) argument
738 compute_rev_insert_delete(struct edge_list *edge_list, sbitmap *st_avloc, sbitmap *nearer, sbitmap *nearerout, sbitmap *insert, sbitmap *del) argument
773 struct edge_list *edge_list; local
[all...]
H A Dmode-switching.c121 commit_mode_sets (struct edge_list *edge_list, int e, struct bb_info *info)
125 for (int ed = NUM_EDGES (edge_list) - 1; ed >= 0; ed--)
127 edge eg = INDEX_EDGE (edge_list, ed);
510 struct edge_list *edge_list = 0;
717 edge_list = pre_edge_lcm_avs (n_entities * max_num_modes, transp, comp, antic,
726 for (int ed = NUM_EDGES (edge_list) - 1; ed >= 0; ed--)
728 edge eg = INDEX_EDGE (edge_list, ed);
787 need_commit |= commit_mode_sets (edge_list, entity_ma
120 commit_mode_sets(struct edge_list *edge_list, int e, struct bb_info *info) argument
509 struct edge_list *edge_list = 0; local
[all...]
H A Dtree-outof-ssa.c172 vec<int> edge_list; member in struct:_elim_graph
444 g->edge_list.create (20);
460 g->edge_list.truncate (0);
472 g->edge_list.release ();
512 g->edge_list.safe_push (pred);
513 g->edge_list.safe_push (succ);
526 for (x = 0; x < g->edge_list.length (); x += 2)
527 if (g->edge_list[x] == node)
529 g->edge_list[x] = -1;
530 y = g->edge_list[
[all...]
H A Dstore-motion.c133 /* Contains the edge_list returned by pre_edge_lcm. */
134 static struct edge_list *edge_list; variable in typeref:struct:edge_list
826 int index = EDGE_INDEX (edge_list, tmp->src, tmp->dest);
839 int index = EDGE_INDEX (edge_list, tmp->src, tmp->dest);
1197 edge_list = pre_edge_rev_lcm (num_stores, st_transp, st_avloc,
1206 for (x = NUM_EDGES (edge_list) - 1; x >= 0; x--)
1208 && (INDEX_EDGE (edge_list, x)->flags & EDGE_ABNORMAL))
1216 ptr->index, INDEX_EDGE (edge_list, x)->src->index,
1217 INDEX_EDGE (edge_list,
[all...]
H A Dcfganal.c224 struct edge_list *
227 struct edge_list *elist;
242 elist = XNEW (struct edge_list);
260 free_edge_list (struct edge_list *elist)
272 print_edge_list (FILE *f, struct edge_list *elist)
299 verify_edge_list (FILE *f, struct edge_list *elist)
403 /* Determine all blocks' control dependences on the given edge with edge_list
440 control_dependences::control_dependences (struct edge_list *edges)
508 find_edge_index (struct edge_list *edge_list, basic_bloc
506 find_edge_index(struct edge_list *edge_list, basic_block pred, basic_block succ) argument
[all...]
H A Dmcf.c131 fixup_edge_p edge_list; member in struct:fixup_graph_d
372 (SRC->DEST) to the edge_list maintained in FIXUP_GRAPH with cost of the edge
379 fixup_edge_p curr_edge = fixup_graph->edge_list + fixup_graph->num_edges;
392 MAX_CAPACITY to the edge_list in the fixup graph. */
457 free (fixup_graph->edge_list);
513 fixup_graph->edge_list =
569 pfedge = fixup_graph->edge_list + i;
583 pfedge = fixup_graph->edge_list + i;
664 fedge_list = fixup_graph->edge_list;
811 fedge_list = fixup_graph->edge_list;
[all...]
H A Dgcse.c515 static struct edge_list *compute_pre_data (void);
522 static int pre_gcse (struct edge_list *);
537 static int pre_edge_insert (struct edge_list *, struct gcse_expr **);
1893 static struct edge_list *
1896 struct edge_list *edge_list;
1914 edge_list = pre_edge_lcm (expr_hash_table.n_elems, transp, comp, antloc,
1923 return edge_list;
2140 pre_edge_insert (struct edge_list *edge_list, struc
1885 struct edge_list *edge_list; local
2127 pre_edge_insert(struct edge_list *edge_list, struct gcse_expr **index_map) argument
2551 pre_gcse(struct edge_list *edge_list) argument
2624 struct edge_list *edge_list; local
[all...]
H A Dprofile.c148 static void find_spanning_tree (struct edge_list *);
156 instrument_edges (struct edge_list *el)
1045 struct edge_list *el;
1417 find_spanning_tree (struct edge_list *el)

Completed in 191 milliseconds