Home
last modified time | relevance | path

Searched refs:sbitmap (Results 1 – 25 of 66) sorted by relevance

123

/freebsd-12.1/contrib/gcc/
H A Dsbitmap.h187 extern void sbitmap_union_of_diff (sbitmap, sbitmap, sbitmap, sbitmap);
188 extern bool sbitmap_union_of_diff_cg (sbitmap, sbitmap, sbitmap, sbitmap);
189 extern void sbitmap_difference (sbitmap, sbitmap, sbitmap);
191 extern void sbitmap_a_or_b_and_c (sbitmap, sbitmap, sbitmap, sbitmap);
192 extern bool sbitmap_a_or_b_and_c_cg (sbitmap, sbitmap, sbitmap, sbitmap);
193 extern void sbitmap_a_and_b_or_c (sbitmap, sbitmap, sbitmap, sbitmap);
194 extern bool sbitmap_a_and_b_or_c_cg (sbitmap, sbitmap, sbitmap, sbitmap);
196 extern void sbitmap_a_and_b (sbitmap, sbitmap, sbitmap);
198 extern void sbitmap_a_or_b (sbitmap, sbitmap, sbitmap);
199 extern bool sbitmap_a_or_b_cg (sbitmap, sbitmap, sbitmap);
[all …]
H A Dlcm.c74 static void compute_antinout_edge (sbitmap *, sbitmap *, sbitmap *, sbitmap *);
76 sbitmap *, sbitmap *, sbitmap *);
78 sbitmap *, sbitmap *);
80 sbitmap *, sbitmap *, sbitmap *, sbitmap *);
84 sbitmap*, sbitmap *, sbitmap *);
86 sbitmap *, sbitmap *);
88 sbitmap *, sbitmap *, sbitmap *,
181 sbitmap *antout, sbitmap *avout, sbitmap *kill, in compute_earliest()
249 sbitmap *antloc, sbitmap *later, sbitmap *laterin) in compute_laterin()
353 sbitmap *later, sbitmap *laterin, sbitmap *insert, in compute_insert_delete()
[all …]
H A Dsbitmap.c240 sbitmap_union_of_diff_cg (sbitmap dst, sbitmap a, sbitmap b, sbitmap c) in sbitmap_union_of_diff_cg()
260 sbitmap_union_of_diff (sbitmap dst, sbitmap a, sbitmap b, sbitmap c) in sbitmap_union_of_diff()
296 sbitmap_difference (sbitmap dst, sbitmap a, sbitmap b) in sbitmap_difference()
360 sbitmap_a_and_b (sbitmap dst, sbitmap a, sbitmap b) in sbitmap_a_and_b()
394 sbitmap_a_xor_b (sbitmap dst, sbitmap a, sbitmap b) in sbitmap_a_xor_b()
409 sbitmap_a_or_b_cg (sbitmap dst, sbitmap a, sbitmap b) in sbitmap_a_or_b_cg()
428 sbitmap_a_or_b (sbitmap dst, sbitmap a, sbitmap b) in sbitmap_a_or_b()
458 sbitmap_a_or_b_and_c_cg (sbitmap dst, sbitmap a, sbitmap b, sbitmap c) in sbitmap_a_or_b_and_c_cg()
478 sbitmap_a_or_b_and_c (sbitmap dst, sbitmap a, sbitmap b, sbitmap c) in sbitmap_a_or_b_and_c()
494 sbitmap_a_and_b_or_c_cg (sbitmap dst, sbitmap a, sbitmap b, sbitmap c) in sbitmap_a_and_b_or_c_cg()
[all …]
H A Dddg.h72 sbitmap successors;
73 sbitmap predecessors;
148 sbitmap nodes;
178 void find_successors (sbitmap result, ddg_ptr, sbitmap);
179 void find_predecessors (sbitmap result, ddg_ptr, sbitmap);
184 int find_nodes_on_paths (sbitmap result, ddg_ptr, sbitmap from, sbitmap to);
185 int longest_simple_path (ddg_ptr, int from, int to, sbitmap via);
H A Dbasic-block.h852 extern int count_or_remove_death_notes (sbitmap, int);
862 extern struct edge_list *pre_edge_lcm (int, sbitmap *, sbitmap *,
863 sbitmap *, sbitmap *, sbitmap **,
864 sbitmap **);
865 extern struct edge_list *pre_edge_rev_lcm (int, sbitmap *,
866 sbitmap *, sbitmap *,
867 sbitmap *, sbitmap **,
868 sbitmap **);
869 extern void compute_available (sbitmap *, sbitmap *, sbitmap *, sbitmap *);
905 extern void find_many_sub_basic_blocks (sbitmap);
[all …]
H A Dbt-load.c126 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);
419 sbitmap bb_gen;
420 sbitmap *btr_defset;
617 compute_kill (sbitmap *bb_kill, sbitmap *btr_defset, in compute_kill()
637 compute_out (sbitmap *bb_out, sbitmap *bb_gen, sbitmap *bb_kill, int max_uid) in compute_out()
668 sbitmap *btr_defset, int max_uid) in link_btr_uses()
789 sbitmap *bb_kill; in build_btr_def_use_webs()
[all …]
H A Dddg.c694 create_scc (ddg_ptr g, sbitmap nodes) in create_scc()
786 find_successors (sbitmap succ, ddg_ptr g, sbitmap ops) in find_successors()
805 find_predecessors (sbitmap preds, ddg_ptr g, sbitmap ops) in find_predecessors()
847 sbitmap from = sbitmap_alloc (num_nodes); in create_ddg_all_sccs()
848 sbitmap to = sbitmap_alloc (num_nodes); in create_ddg_all_sccs()
906 find_nodes_on_paths (sbitmap result, ddg_ptr g, sbitmap from, sbitmap to) in find_nodes_on_paths()
914 sbitmap workset = sbitmap_alloc (num_nodes); in find_nodes_on_paths()
917 sbitmap tmp = sbitmap_alloc (num_nodes); in find_nodes_on_paths()
991 update_dist_to_successors (ddg_node_ptr u_node, sbitmap nodes, sbitmap tmp) in update_dist_to_successors()
1024 sbitmap workset = sbitmap_alloc (num_nodes); in longest_simple_path()
[all …]
H A Dmodulo-sched.c167 sbitmap must_precede,
168 sbitmap must_follow);
445 sbitmap *uses_of_defs; in generate_reg_moves()
1643 static int order_nodes_in_scc (ddg_ptr, sbitmap, sbitmap, int*, int);
1900 order_nodes_in_scc (ddg_ptr g, sbitmap nodes_ordered, sbitmap scc, in order_nodes_in_scc()
1943 sbitmap v_node_preds; in order_nodes_in_scc()
1944 sbitmap v_node_succs; in order_nodes_in_scc()
2143 sbitmap must_precede, sbitmap must_follow) in ps_insn_find_column()
2204 sbitmap must_follow) in ps_insn_advance_column()
2254 sbitmap must_precede, sbitmap must_follow) in add_node_to_ps()
[all …]
H A Dcfghooks.h102 int (*flow_call_edges_add) (sbitmap);
117 sbitmap wont_exit,
163 extern int flow_call_edges_add (sbitmap);
169 sbitmap wont_exit,
H A Dmode-switching.c89 static sbitmap *antic;
90 static sbitmap *transp;
91 static sbitmap *comp;
392 sbitmap *kill; in optimize_mode_switching()
544 sbitmap *delete; in optimize_mode_switching()
545 sbitmap *insert; in optimize_mode_switching()
H A Dsched-rgn.c226 static sbitmap *dom;
240 typedef sbitmap edgeset;
371 extract_edgelst (sbitmap set, edgelst *el) in extract_edgelst()
516 sbitmap header; in find_rgns()
519 sbitmap inner; in find_rgns()
522 sbitmap in_queue; in find_rgns()
525 sbitmap in_stack; in find_rgns()
680 sbitmap extended_rgn_header = NULL; in find_rgns()
1362 sbitmap visited; in compute_trg_info()
2875 sbitmap blocks; in init_regions()
[all …]
H A Dcfganal.c47 sbitmap visited_blocks;
166 sbitmap visited; in mark_dfs_back_edges()
522 flow_nodes_print (const char *str, const sbitmap nodes, FILE *file) in flow_nodes_print()
657 sbitmap visited; in post_order_compute()
738 sbitmap visited; in pre_and_rev_post_order_compute()
946 static sbitmap visited; in dfs_enumerate_from()
H A Dcfgbuild.c52 static void make_label_edge (sbitmap, basic_block, rtx, int);
187 make_label_edge (sbitmap edge_cache, basic_block src, rtx label, int flags) in make_label_edge()
205 rtl_make_eh_edge (sbitmap edge_cache, basic_block src, rtx insn) in rtl_make_eh_edge()
255 sbitmap edge_cache = NULL; in make_edges()
751 find_many_sub_basic_blocks (sbitmap blocks) in find_many_sub_basic_blocks()
H A Dgcse.c563 static void compute_local_properties (sbitmap *, sbitmap *, sbitmap *,
1009 compute_local_properties (sbitmap *transp, sbitmap *comp, sbitmap *antloc, in compute_local_properties()
2389 static sbitmap *cprop_avin;
3737 static sbitmap *transp;
3742 static sbitmap *transpout;
3745 static sbitmap *comp;
3748 static sbitmap *antloc;
3815 sbitmap trapping_expr; in compute_pre_data()
4118 sbitmap *inserted; in pre_edge_insert()
5458 static sbitmap * st_antloc;
[all …]
H A Dcfgloop.h174 sbitmap shared_headers;
254 unsigned, sbitmap, edge, edge *,
H A Ddomwalk.h119 sbitmap interesting_blocks;
H A Dtree-ssa-structalias.h37 sbitmap ssa_names_visited;
H A Dtree-ssa-dce.c82 static sbitmap processed;
86 static sbitmap last_stmt_necessary;
99 static sbitmap visited_control_parents;
H A Dtree-into-ssa.c108 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) in rewrite_blocks()
2012 mark_def_site_blocks (sbitmap interesting_blocks) in mark_def_site_blocks()
2087 sbitmap interesting_blocks; in rewrite_into_ssa()
2953 sbitmap tmp; in update_ssa()
3072 sbitmap tmp = sbitmap_alloc (old_ssa_names->n_bits); in update_ssa()
H A Ddf-core.c636 sbitmap visited = sbitmap_alloc (last_basic_block); in df_iterative_dataflow()
637 sbitmap pending = sbitmap_alloc (last_basic_block); in df_iterative_dataflow()
638 sbitmap considered = sbitmap_alloc (last_basic_block); in df_iterative_dataflow()
H A Dloop-unroll.c480 sbitmap wont_exit; in peel_loop_completely()
665 sbitmap wont_exit; in unroll_loop_constant_iterations()
940 sbitmap wont_exit; in unroll_loop_runtime_iterations()
1266 sbitmap wont_exit; in peel_loop_simple()
1416 sbitmap wont_exit; in unroll_loop_stupid()
H A Dcfgloopmanip.c144 sbitmap in_queue; in fix_bb_placements()
251 sbitmap seen; in remove_path()
419 sbitmap seen; in loopify()
785 unsigned int ndupl, sbitmap wont_exit, in duplicate_loop_to_header_edge()
H A Dflow.c296 static void calculate_global_regs_live (sbitmap, sbitmap, int);
329 static void clear_log_links (sbitmap);
569 update_life_info (sbitmap blocks, enum update_life_extent extent, in update_life_info()
747 sbitmap update_life_blocks = sbitmap_alloc (last_basic_block); in update_life_info_in_dirty_blocks()
1040 calculate_global_regs_live (sbitmap blocks_in, sbitmap blocks_out, int flags) in calculate_global_regs_live()
4503 count_or_remove_death_notes (sbitmap blocks, int kill) in count_or_remove_death_notes()
4611 clear_log_links (sbitmap blocks) in clear_log_links()
H A Dsee.c639 static sbitmap *transp = NULL;
641 static sbitmap *comp = NULL;
643 static sbitmap *antloc = NULL;
645 static sbitmap *ae_kill = NULL;
647 static sbitmap *pre_insert_map = NULL;
649 static sbitmap *pre_delete_map = NULL;
H A Dcfghooks.c800 flow_call_edges_add (sbitmap blocks) in flow_call_edges_add()
849 sbitmap wont_exit, edge orig, in cfg_hook_duplicate_loop_to_header_edge()

123