| /freebsd-9.3-release/contrib/gcc/ |
| H A D | lcm.c | 75 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 *,
181 compute_earliest (struct edge_list *edge_list, in
180 compute_earliest(struct edge_list *edge_list, int n_exprs, sbitmap *antin, sbitmap *antout, sbitmap *avout, sbitmap *kill, sbitmap *earliest) argument
248 compute_laterin(struct edge_list *edge_list, sbitmap *earliest, sbitmap *antloc, sbitmap *later, sbitmap *laterin) argument
352 compute_insert_delete(struct edge_list *edge_list, sbitmap *antloc, sbitmap *later, sbitmap *laterin, sbitmap *insert, sbitmap *delete) argument
386 struct edge_list *edge_list; local
560 compute_farthest(struct edge_list *edge_list, int n_exprs, sbitmap *st_avout, sbitmap *st_avin, sbitmap *st_antin, sbitmap *kill, sbitmap *farthest) argument
604 compute_nearerout(struct edge_list *edge_list, sbitmap *farthest, sbitmap *st_avloc, sbitmap *nearer, sbitmap *nearerout) argument
686 compute_rev_insert_delete(struct edge_list *edge_list, sbitmap *st_avloc, sbitmap *nearer, sbitmap *nearerout, sbitmap *insert, sbitmap *delete) argument
720 struct edge_list *edge_list; local
[all...] |
| H A D | cfganal.c | 341 struct edge_list *
344 struct edge_list *elist;
362 elist = XNEW (struct edge_list);
380 free_edge_list (struct edge_list *elist)
392 print_edge_list (FILE *f, struct edge_list *elist)
419 verify_edge_list (FILE *f, struct edge_list *elist)
510 find_edge_index (struct edge_list *edge_list, basic_block pred, basic_block succ)
514 for (x = 0; x < NUM_EDGES (edge_list); x++)
515 if (INDEX_EDGE_PRED_BB (edge_list,
507 find_edge_index(struct edge_list *edge_list, basic_block pred, basic_block succ) argument
539 flow_edge_list_print(const char *str, const edge *edge_list, int num_edges, FILE *file) argument
[all...] |
| H A D | tree-ssa-dce.c | 119 static void find_all_control_dependences (struct edge_list *);
120 static void find_control_dependence (struct edge_list *, int);
127 static void find_obviously_necessary_stmts (struct edge_list *);
129 static void mark_control_dependent_edges_necessary (basic_block, struct edge_list *);
130 static void propagate_necessity (struct edge_list *);
162 find_all_control_dependences (struct edge_list *el)
170 /* Determine all blocks' control dependences on the given edge with edge_list
174 find_control_dependence (struct edge_list *el, int edge_index)
391 find_obviously_necessary_stmts (struct edge_list *el)
445 mark_control_dependent_edges_necessary (basic_block bb, struct edge_list *e
[all...] |
| H A D | tree-outof-ssa.c | 86 VEC(int,heap) *edge_list; member in struct:_elim_graph
224 g->edge_list = VEC_alloc (int, heap, 20);
239 VEC_truncate (int, g->edge_list, 0);
250 VEC_free (int, heap, g->edge_list);
286 VEC_safe_push (int, heap, g->edge_list, pred);
287 VEC_safe_push (int, heap, g->edge_list, succ);
299 for (x = 0; x < VEC_length (int, g->edge_list); x += 2)
300 if (VEC_index (int, g->edge_list, x) == node)
302 VEC_replace (int, g->edge_list, x, -1);
303 y = VEC_index (int, g->edge_list,
[all...] |
| H A D | mode-switching.c | 395 struct edge_list *edge_list;
572 edge_list = pre_edge_lcm (n_entities, transp, comp, antic,
587 for (e = NUM_EDGES (edge_list) - 1; e >= 0; e--)
589 edge eg = INDEX_EDGE (edge_list, e);
636 free_edge_list (edge_list);
393 struct edge_list *edge_list; local
|
| H A D | basic-block.h | 551 struct edge_list
784 struct edge_list * create_edge_list (void);
785 void free_edge_list (struct edge_list *);
786 void print_edge_list (FILE *, struct edge_list *);
787 void verify_edge_list (FILE *, struct edge_list *);
788 int find_edge_index (struct edge_list *, basic_block, basic_block);
863 extern struct edge_list *pre_edge_lcm (int, sbitmap *, sbitmap *,
866 extern struct edge_list *pre_edge_rev_lcm (int, sbitmap *,
550 struct edge_list struct
|
| H A D | gcse.c | 605 static int pre_edge_insert (struct edge_list *, struct expr **);
3777 /* Contains the edge_list returned by pre_edge_lcm. */
3778 static struct edge_list *edge_list;
3873 edge_list = pre_edge_lcm (expr_hash_table.n_elems, transp, comp, antloc,
4131 pre_edge_insert (struct edge_list *edge_list, struct expr **index_map)
4140 num_edges = NUM_EDGES (edge_list);
4147 basic_block bb = INDEX_EDGE_PRED_BB (edge_list, e);
4170 edge eg = INDEX_EDGE (edge_list,
3764 static struct edge_list *edge_list; variable in typeref:struct:edge_list
4115 pre_edge_insert(struct edge_list *edge_list, struct expr **index_map) argument
[all...] |
| H A D | profile.c | 117 static void find_spanning_tree (struct edge_list *);
118 static unsigned instrument_edges (struct edge_list *);
134 instrument_edges (struct edge_list *el)
745 struct edge_list *el;
1105 find_spanning_tree (struct edge_list *el)
|
| H A D | see.c | 410 pre_insert_map and edge_list (from the output of the LCM).
650 /* Contains the edge_list returned by pre_edge_lcm. */
651 static struct edge_list *edge_list = NULL; variable in typeref:struct:edge_list
1298 if (edge_list)
1300 free_edge_list (edge_list);
1301 edge_list = NULL;
1657 int num_edges = NUM_EDGES (edge_list);
1669 basic_block bb = INDEX_EDGE_PRED_BB (edge_list, e);
1682 edge eg = INDEX_EDGE (edge_list,
[all...] |