/freebsd-9.3-release/contrib/gcc/ |
H A D | sbitmap.h | 37 } *sbitmap; typedef in typeref:struct:simple_bitmap_def 58 /* The iterator for sbitmap. */ 76 /* Initialize the iterator I with sbitmap BMP and the initial index 80 sbitmap_iter_init (sbitmap_iterator *i, sbitmap bmp, unsigned int min) 173 extern void dump_sbitmap (FILE *, sbitmap); 174 extern void dump_sbitmap_file (FILE *, sbitmap); 175 extern void dump_sbitmap_vector (FILE *, const char *, const char *, sbitmap *, 177 extern sbitmap sbitmap_alloc (unsigned int); 178 extern sbitmap *sbitmap_vector_alloc (unsigned int, unsigned int); 179 extern sbitmap sbitmap_resiz [all...] |
H A D | lcm.c | 74 static void compute_antinout_edge (sbitmap *, sbitmap *, sbitmap *, sbitmap *); 75 static void compute_earliest (struct edge_list *, int, sbitmap *, sbitmap *, 76 sbitmap *, sbitmap *, sbitmap *); 77 static void compute_laterin (struct edge_list *, sbitmap *, sbitma [all...] |
H A D | ddg.h | 26 /* For sbitmap. */ 27 #include "sbitmap.h" 72 sbitmap successors; 73 sbitmap predecessors; 149 sbitmap nodes; 180 void find_successors (sbitmap result, ddg_ptr, sbitmap); 181 void find_predecessors (sbitmap result, ddg_ptr, sbitmap); 186 int find_nodes_on_paths (sbitmap resul [all...] |
H A D | sbitmap.c | 35 sbitmap 39 sbitmap bmap; 56 sbitmap 57 sbitmap_resize (sbitmap bmap, unsigned int n_elms, int def) 109 sbitmap 110 sbitmap_realloc (sbitmap src, unsigned int n_elms) 113 sbitmap bmap; 126 bmap = (sbitmap) xrealloc (src, amt); 135 sbitmap * 139 sbitmap *bitmap_vecto [all...] |
H A D | domwalk.h | 119 sbitmap interesting_blocks;
|
H A D | cfghooks.h | 102 int (*flow_call_edges_add) (sbitmap); 117 sbitmap wont_exit, 163 extern int flow_call_edges_add (sbitmap); 169 sbitmap wont_exit,
|
H A D | basic-block.h | 26 #include "sbitmap.h" 499 extern edge cached_make_edge (sbitmap, basic_block, basic_block, int); 851 extern int update_life_info (sbitmap, enum update_life_extent, int); 853 extern int count_or_remove_death_notes (sbitmap, int); 863 extern struct edge_list *pre_edge_lcm (int, sbitmap *, sbitmap *, 864 sbitmap *, sbitmap *, sbitmap **, 865 sbitmap **); [all...] |
H A D | ddg.c | 43 #include "sbitmap.h" 697 create_scc (ddg_ptr g, sbitmap nodes) 789 find_successors (sbitmap succ, ddg_ptr g, sbitmap ops) 796 const sbitmap node_succ = NODE_SUCCESSORS (&g->nodes[i]); 808 find_predecessors (sbitmap preds, ddg_ptr g, sbitmap ops) 815 const sbitmap node_preds = NODE_PREDECESSORS (&g->nodes[i]); 850 sbitmap from = sbitmap_alloc (num_nodes); 851 sbitmap t [all...] |
H A D | bt-load.c | 126 sbitmap *, sbitmap *, HARD_REG_SET *); 127 static void compute_kill (sbitmap *, sbitmap *, HARD_REG_SET *); 128 static void compute_out (sbitmap *bb_out, sbitmap *, sbitmap *, int); 129 static void link_btr_uses (btr_def *, btr_user *, sbitmap *, sbitmap *, int); 420 sbitmap bb_ge [all...] |
H A D | modulo-sched.c | 168 sbitmap must_precede, 169 sbitmap must_follow); 448 sbitmap *uses_of_defs; 1363 sbitmap sched_nodes, int ii, int *start_p, int *step_p, int *end_p) 1369 sbitmap psp = sbitmap_alloc (ps->g->num_nodes); 1370 sbitmap pss = sbitmap_alloc (ps->g->num_nodes); 1371 sbitmap u_node_preds = NODE_PREDECESSORS (u_node); 1372 sbitmap u_node_succs = NODE_SUCCESSORS (u_node); 1495 sbitmap sched_nodes = sbitmap_alloc (num_nodes); 1496 sbitmap must_preced [all...] |
H A D | tree-ssa-structalias.h | 37 sbitmap ssa_names_visited;
|
H A D | cfgloop.h | 174 sbitmap shared_headers; 254 unsigned, sbitmap, edge, edge *,
|
H A D | cfganal.c | 47 sbitmap visited_blocks; 168 sbitmap visited; 525 flow_nodes_print (const char *str, const sbitmap nodes, FILE *file) 662 sbitmap visited; 743 sbitmap visited; 949 loops), and allocating a large sbitmap would lead to quadratic 951 static sbitmap visited; 958 /* Resize the VISITED sbitmap if necessary. */ 972 /* Ensure that we increase the size of the sbitmap exponentially. */
|
H A D | mode-switching.c | 90 static sbitmap *antic; 91 static sbitmap *transp; 92 static sbitmap *comp; 394 sbitmap *kill; 546 sbitmap *delete; 547 sbitmap *insert;
|
H A D | cfgbuild.c | 53 static void make_label_edge (sbitmap, basic_block, rtx, int); 190 make_label_edge (sbitmap edge_cache, basic_block src, rtx label, int flags) 208 rtl_make_eh_edge (sbitmap edge_cache, basic_block src, rtx insn) 258 sbitmap edge_cache = NULL; 756 find_many_sub_basic_blocks (sbitmap blocks)
|
H A D | gcse.c | 31 - ability to realloc sbitmap vectors would allow one initial computation 478 gcse) and it's currently not easy to realloc sbitmap vectors. */ 479 static sbitmap *reg_set_in_block; 515 static sbitmap *ae_kill, *ae_gen; 564 static void compute_transp (rtx, int, sbitmap *, int); 566 static void compute_local_properties (sbitmap *, sbitmap *, sbitmap *, 1016 compute_local_properties (sbitmap *transp, sbitmap *com [all...] |
H A D | sched-rgn.c | 144 static void extend_rgns (int *, int *, sbitmap, int *); 216 static void extract_edgelst (sbitmap, edgelst *); 225 /* Dominators array: dom[i] contains the sbitmap of dominators of 227 static sbitmap *dom; 241 typedef sbitmap edgeset; 372 extract_edgelst (sbitmap set, edgelst *el) 517 sbitmap header; 520 sbitmap inner; 523 sbitmap in_queue; 526 sbitmap in_stac [all...] |
H A D | tree-into-ssa.c | 108 static sbitmap old_ssa_names; 113 static sbitmap new_ssa_names; 186 sbitmap names_to_rename; 190 sbitmap interesting_blocks; 1919 rewrite_blocks (basic_block entry, enum rewrite_mode what, sbitmap blocks) 2012 mark_def_site_blocks (sbitmap interesting_blocks) 2087 sbitmap interesting_blocks; 2953 sbitmap tmp; 3072 sbitmap tmp = sbitmap_alloc (old_ssa_names->n_bits);
|
H A D | tree-ssa-dce.c | 83 static sbitmap processed; 87 static sbitmap last_stmt_necessary; 100 static sbitmap visited_control_parents;
|
H A D | cfghooks.c | 800 flow_call_edges_add (sbitmap blocks) 849 sbitmap wont_exit, edge orig,
|
H A D | tree-ssa-propagate.c | 130 static sbitmap executable_blocks; 139 static sbitmap bb_in_list;
|
H A D | cfgloopmanip.c | 144 sbitmap in_queue; 251 sbitmap seen; 419 sbitmap seen; 785 unsigned int ndupl, sbitmap wont_exit,
|
H A D | tree-ssa-loop-ivcanon.c | 226 sbitmap wont_exit;
|
H A D | df-core.c | 293 #include "sbitmap.h" 637 sbitmap visited = sbitmap_alloc (last_basic_block); 638 sbitmap pending = sbitmap_alloc (last_basic_block); 639 sbitmap considered = sbitmap_alloc (last_basic_block);
|
H A D | loop-unroll.c | 480 sbitmap wont_exit; 665 sbitmap wont_exit; 940 sbitmap wont_exit; 1266 sbitmap wont_exit; 1416 sbitmap wont_exit;
|