
Go to the source code of this file.
Defines | |
| #define | nBITMAP_WORD_BITS (CHAR_BIT * SIZEOF_LONG) |
| #define | BITMAP_WORD_BITS (unsigned) nBITMAP_WORD_BITS |
| #define | BITMAP_ELEMENT_WORDS ((128 + nBITMAP_WORD_BITS - 1) / nBITMAP_WORD_BITS) |
| #define | BITMAP_ELEMENT_ALL_BITS ((unsigned) (BITMAP_ELEMENT_WORDS * BITMAP_WORD_BITS)) |
| #define | dump_bitmap(file, bitmap) bitmap_print (file, bitmap, "", "\n") |
| #define | bitmap_zero(a) bitmap_clear (a) |
| #define | bitmap_a_or_b(a, b, c) bitmap_operation (a, b, c, BITMAP_IOR) |
| #define | bitmap_a_and_b(a, b, c) bitmap_operation (a, b, c, BITMAP_AND) |
| #define | BITMAP_OBSTACK_ALLOC(OBSTACK) bitmap_initialize ((bitmap) obstack_alloc (OBSTACK, sizeof (bitmap_head)), 1) |
| #define | BITMAP_GGC_ALLOC() bitmap_initialize (NULL, 0) |
| #define | BITMAP_XMALLOC() bitmap_initialize ((bitmap) xmalloc (sizeof (bitmap_head)), 1) |
| #define | BITMAP_FREE(BITMAP) |
| #define | BITMAP_XFREE(BITMAP) |
| #define | BITMAP_INIT_ONCE() |
| #define | EXECUTE_IF_SET_IN_BITMAP(BITMAP, MIN, BITNUM, CODE) |
| #define | EXECUTE_IF_AND_COMPL_IN_BITMAP(BITMAP1, BITMAP2, MIN, BITNUM, CODE) |
| #define | EXECUTE_IF_AND_IN_BITMAP(BITMAP1, BITMAP2, MIN, BITNUM, CODE) |
Typedefs | |
| typedef unsigned long | BITMAP_WORD |
| typedef struct bitmap_head_def * | bitmap |
Enumerations | |
| enum | bitmap_bits { BITMAP_AND, BITMAP_AND_COMPL, BITMAP_IOR, BITMAP_XOR, BITMAP_IOR_COMPL, BITMAP_AND, BITMAP_AND_COMPL, BITMAP_IOR, BITMAP_XOR, BITMAP_IOR_COMPL } |
Functions/Subroutines | |
| struct bitmap_element_def | GTY (()) |
| void bitmap_clear | PARAMS ((bitmap)) |
| void bitmap_copy | PARAMS ((bitmap, bitmap)) |
| int bitmap_operation | PARAMS ((bitmap, bitmap, bitmap, enum bitmap_bits)) |
| void bitmap_ior_and_compl | PARAMS ((bitmap, bitmap, bitmap)) |
| void bitmap_clear_bit | PARAMS ((bitmap, int)) |
| void debug_bitmap_file | PARAMS ((FILE *, bitmap)) |
| void bitmap_print | PARAMS ((FILE *, bitmap, const char *, const char *)) |
| bitmap bitmap_initialize | PARAMS ((bitmap head, int using_obstack)) |
| void bitmap_release_memory | PARAMS ((void)) |
| int bitmap_union_of_diff | PARAMS ((bitmap, bitmap, bitmap, bitmap)) |
Variables | |
| bitmap_element | |
| bitmap_head | |
| bitmap_element | bitmap_zero_bits |
| #define BITMAP_ELEMENT_ALL_BITS ((unsigned) (BITMAP_ELEMENT_WORDS * BITMAP_WORD_BITS)) |
Definition at line 43 of file bitmap.h.
Referenced by bitmap_clear_range(), bitmap_find_bit(), bitmap_first_set_bit(), bitmap_last_set_bit(), bitmap_set_bit(), bmp_iter_and(), bmp_iter_and_compl(), bmp_iter_and_compl_init(), bmp_iter_and_init(), bmp_iter_set(), bmp_iter_set_init(), and debug_bitmap_file().
| #define BITMAP_ELEMENT_WORDS ((128 + nBITMAP_WORD_BITS - 1) / nBITMAP_WORD_BITS) |
Definition at line 36 of file bitmap.h.
Referenced by bitmap_and(), bitmap_and_compl(), bitmap_and_compl_into(), bitmap_and_into(), bitmap_bit_p(), bitmap_clear_bit(), bitmap_clear_range(), bitmap_compl_and_into(), bitmap_copy(), bitmap_count_bits(), bitmap_element_zerop(), bitmap_equal_p(), bitmap_first_set_bit(), bitmap_hash(), bitmap_intersect_compl_p(), bitmap_intersect_p(), bitmap_ior(), bitmap_ior_into(), bitmap_last_set_bit(), bitmap_set_bit(), bitmap_xor(), bitmap_xor_into(), bmp_iter_and(), bmp_iter_and_compl(), bmp_iter_and_compl_init(), bmp_iter_and_init(), bmp_iter_set(), bmp_iter_set_init(), debug_bitmap_file(), and GTY().
| #define BITMAP_FREE | ( | BITMAP | ) |
Value:
do { \ if (BITMAP) \ { \ bitmap_clear (BITMAP); \ (BITMAP) = 0; \ } \ } while (0)
Definition at line 143 of file bitmap.h.
Referenced by add_exit_phis_var(), allocate_bb_info(), bfin_reorg_loops(), bitmap_set_and(), bitmap_set_and_compl(), build_tree_conflict_graph(), calculate_live_on_entry(), calculate_reg_pav(), ccp_fold_builtin(), cgraph_decide_inlining_of_small_functions(), clean_function(), cleanup_tree_cfg_loop(), clear_edges_for_node(), close_addressof_down(), collapse_nodes(), combine_btr_defs(), compute_builtin_object_size(), create_ssa_var_map(), def_blocks_free(), delete_alias_info(), delete_tree_live_info(), delete_tree_ssa(), delete_update_ssa(), determine_lsm_loop(), determine_use_iv_costs(), df_analyze(), df_bb_rd_local_compute(), df_bb_refs_record(), df_bitmaps_free(), df_du_chain_create(), df_free(), df_lr_free(), df_lr_free_bb_info(), df_rd_alloc(), df_rd_confluence_n(), df_rd_free(), df_rd_free_bb_info(), df_rd_local_compute(), df_rd_transfer_function(), df_reg_info_compute(), df_rescan_blocks(), df_ri_compute(), df_ru_alloc(), df_ru_confluence_n(), df_ru_free(), df_ru_free_bb_info(), df_ru_transfer_function(), df_scan_free(), df_scan_free_internal(), df_set_blocks(), df_unset_seen(), df_ur_free(), df_ur_free_bb_info(), df_ur_local_finalize(), df_urec_free(), df_urec_free_bb_info(), df_urec_local_finalize(), duplicate_computed_gotos(), eliminate_degenerate_phis(), estimate_bb_frequencies(), execute_optimize_stdarg(), expand_case(), find_defs(), find_invariant_insn(), find_invariants(), fini_analyze_edges_for_bb(), fini_object_sizes(), fini_pre(), fini_ssanames(), free_bb_info(), free_dom_info(), free_gcse_mem(), free_inv_motion_data(), free_loop_data(), free_mem_ref(), free_propagate_block_info(), free_temp_expr_table(), frv_function_epilogue(), get_loop_body_in_bfs_order(), get_loop_body_in_if_conv_order(), insert_phi_nodes(), insert_phi_nodes_1(), insert_range_assertions(), insert_updated_phi_nodes_for(), iv_analysis_loop_init(), iv_ca_free(), mark_def_site_blocks(), mark_new_vars_to_rename(), migrate_btr_def(), migrate_btr_defs(), modify_reg_pav(), move_sese_region_to_fn(), nearest_common_dominator_of_uses(), perform_edge_inserts(), perform_var_substitution(), process_unification_queue(), propagate_bits(), prune_unused_phi_nodes(), record_important_candidates(), repl_map_free(), rewrite_into_loop_closed_ssa(), rewrite_into_ssa(), rewrite_ssa_into_ssa(), s390_chunkify_start(), s390_free_pool(), scev_const_prop(), scev_finalize(), set_union_with_increment(), set_use_iv_cost(), slpeel_tree_peel_loop_to_edge(), solution_set_add(), static_execute(), thread_jump(), thread_through_all_blocks(), tree_dce_done(), tree_duplicate_loop_to_header_edge(), tree_duplicate_sese_region(), tree_predict_by_opcode(), tree_sra(), tree_ssa_dominator_optimize(), tree_ssa_dse(), tree_ssa_forward_propagate_single_use_vars(), tree_ssa_iv_optimize_finalize(), type_escape_execute(), update_ssa(), update_value_range(), vectorize_loops(), verify_flow_insensitive_alias_info(), verify_name_tags(), verify_ssa(), and vrp_finalize().
| #define BITMAP_GGC_ALLOC | ( | ) | bitmap_initialize (NULL, 0) |
Definition at line 135 of file bitmap.h.
Referenced by add_pointed_to_var(), add_to_addressable_set(), duplicate_ssa_name(), duplicate_ssa_name_ptr_info(), find_what_p_points_to(), merge_pointed_to_info(), note_addressable(), record_voperand_set(), and remove_eh_handler().
| #define BITMAP_OBSTACK_ALLOC | ( | OBSTACK | ) | bitmap_initialize ((bitmap) obstack_alloc (OBSTACK, sizeof (bitmap_head)), 1) |
| #define BITMAP_WORD_BITS (unsigned) nBITMAP_WORD_BITS |
Definition at line 31 of file bitmap.h.
Referenced by bitmap_bit_p(), bitmap_clear_bit(), bitmap_clear_range(), bitmap_first_set_bit(), bitmap_last_set_bit(), bitmap_popcount(), bitmap_set_bit(), bmp_iter_and(), bmp_iter_and_compl(), bmp_iter_and_compl_init(), bmp_iter_and_init(), bmp_iter_set(), bmp_iter_set_init(), and debug_bitmap_file().
| #define BITMAP_XFREE | ( | BITMAP | ) |
Value:
do { \ if (BITMAP) \ { \ bitmap_clear (BITMAP); \ free (BITMAP); \ (BITMAP) = 0; \ } \ } while (0)
Definition at line 153 of file bitmap.h.
Referenced by actual_spill(), check_df(), conservative(), control_dependent_block_to_edge_map_free(), detect_spill_temps(), df_bitmaps_free(), df_du_chain_create(), df_free(), df_reg_info_compute(), emit_colors(), free_all_mem(), free_bb_info(), free_gcse_mem(), free_propagate_block_info(), merge_moves(), ra_build_free(), ra_build_free_all(), remove_suspicious_death_notes(), reset_conflicts(), reset_lists(), rewrite_program(), s390_chunkify_pool(), thread_jump(), and union_web_part_roots().
| #define BITMAP_XMALLOC | ( | ) | bitmap_initialize ((bitmap) xmalloc (sizeof (bitmap_head)), 1) |
Definition at line 139 of file bitmap.h.
Referenced by actual_spill(), alloc_gcse_mem(), alloc_mem(), check_df(), conflicts_between_webs(), conservative(), control_dependent_block_to_edge_map_create(), detect_spill_temps(), detect_web_parts_to_rebuild(), df_alloc(), df_bitmaps_alloc(), df_du_chain_create(), df_insn_table_realloc(), df_reg_info_compute(), emit_colors(), get_sub_conflicts(), init_bb_info(), init_one_web(), init_propagate_block_info(), livethrough_conflicts_bb(), merge_moves(), reset_conflicts(), rewrite_program(), rewrite_program2(), s390_chunkify_pool(), and thread_jump().
Definition at line 123 of file bitmap.h.
Referenced by build_web_parts_and_conflicts(), detect_spill_temps(), df_alloc(), df_analyse(), df_analyze(), df_bitmaps_alloc(), df_insn_table_realloc(), hybrid_search_bitmap(), live_merge_and_clear(), tree_ssa_dominator_optimize(), and vect_transform_loop().
Definition at line 122 of file bitmap.h.
Referenced by create_new_invariant(), df_dump(), df_lr_dump(), df_rd_dump(), df_ru_dump(), df_scan_dump(), df_ur_dump(), df_urec_dump(), and dump_use().
| #define EXECUTE_IF_AND_COMPL_IN_BITMAP | ( | BITMAP1, | |||
| BITMAP2, | |||||
| MIN, | |||||
| BITNUM, | |||||
| CODE | ) |
| #define EXECUTE_IF_AND_IN_BITMAP | ( | BITMAP1, | |||
| BITMAP2, | |||||
| MIN, | |||||
| BITNUM, | |||||
| CODE | ) |
Definition at line 288 of file bitmap.h.
Referenced by add_exit_phis_var(), insert_phi_nodes_for(), and iv_ca_narrow().
| #define EXECUTE_IF_SET_IN_BITMAP | ( | BITMAP, | |||
| MIN, | |||||
| BITNUM, | |||||
| CODE | ) |
Definition at line 169 of file bitmap.h.
Referenced by actual_spill(), add_btr_to_live_range(), add_call_clobber_ops(), add_call_read_ops(), add_exit_phis(), add_old_ivs_candidates(), alloc_use_cost_map(), allocate_new_names(), allocate_ssa_names(), bitmap_other_than_zero_bit_set(), bitmap_print(), bitmap_print_value_set(), bitmap_set_and(), bitmap_set_and_compl(), btr_def_live_range(), build_insn_chain(), build_inter_loop_deps(), build_tree_conflict_graph(), calculate_live_on_entry(), calculate_live_on_exit(), clear_btr_from_live_range(), clear_modify_mem_tables(), close_addressof_down(), close_type_full_escape(), compare_name_with_value(), compare_names(), compute_builtin_object_size(), compute_flow_insensitive_aliasing(), compute_flow_sensitive_aliasing(), compute_global_livein(), compute_points_to_and_addr_escape(), compute_transp(), condense_varmap_nodes(), conflicts_between_webs(), create_new_ivs(), create_ssa_var_map(), dead_or_predicable(), decide_instantiations(), delete_update_ssa(), delete_useless_defs(), detect_web_parts_to_rebuild(), determine_set_costs(), determine_use_iv_costs(), df_bb_refs_record(), df_bb_reg_info_compute(), df_chain_create_bb_process_use(), df_chain_finalize(), df_chain_reset(), df_insn_refs_record(), df_iterative_dataflow(), df_lr_alloc(), df_lr_init(), df_lr_local_compute(), df_rd_alloc(), df_rd_confluence_n(), df_rd_init_solution(), df_rd_local_compute(), df_rd_transfer_function(), df_record_entry_block_defs(), df_record_exit_block_uses(), df_refs_delete(), df_refs_record(), df_rescan_blocks(), df_ri_bb_compute(), df_ri_compute(), df_ru_alloc(), df_ru_confluence_n(), df_ru_init_solution(), df_ru_local_compute(), df_ru_transfer_function(), df_scan_alloc(), df_set_blocks(), df_ur_alloc(), df_ur_init(), df_ur_local_compute(), df_ur_local_finalize(), df_urec_alloc(), df_urec_init(), df_urec_local_compute(), df_urec_local_finalize(), do_da_constraint(), do_ds_constraint(), do_sd_constraint(), dse_finalize_block(), dump_all_asserts(), dump_bitmap_of_names(), dump_live_info(), dump_names_replaced_by(), dump_points_to_info_for(), dump_solution_for_var(), dump_update_ssa(), dump_value_range(), eliminate_degenerate_phis(), find_identical_invariants(), find_idf(), find_induction_variables(), find_interesting_uses(), find_replaceable_exprs(), find_uses_to_rename(), find_what_p_points_to(), free_loop_data(), free_new_names(), get_asm_expr_operands(), get_inv_cost(), group_aliases_into(), insert_aux(), insert_extra_phis(), insert_phi_nodes(), insert_phi_nodes_for(), insert_updated_phi_nodes_for(), invalidate_name_tags(), iterative_dataflow_bitmap(), iterative_dataflow_sbitmap(), iv_ca_add_use(), iv_ca_has_deps(), iv_ca_narrow(), iv_ca_prune(), iv_ca_set_add_invariants(), iv_ca_set_cp(), iv_ca_set_no_cp(), iv_ca_set_remove_invariants(), live_worklist(), livethrough_conflicts_bb(), mark_call_clobbered_vars_to_rename(), mark_def_interesting(), mark_set_for_renaming(), maybe_create_global_var(), merge_graph_nodes(), move_invariant_reg(), nearest_common_dominator_for_set(), nearest_common_dominator_of_uses(), prepare_names_to_update(), process_assert_insertions(), propagate_freq(), prune_unused_phi_nodes(), reg_set_to_hard_reg_set(), register_new_update_set(), reloads_to_loads(), remove_eh_handler(), remove_unused_ivs(), rewrite_program2(), rewrite_ssa_into_ssa(), scalarize_parms(), scan_function(), scev_const_prop(), set_initial_properties(), set_move_mark(), set_uids_in_ptset(), solution_set_add(), solve_graph(), static_execute(), thread_through_all_blocks(), topo_visit(), tree_duplicate_sese_region(), tree_purge_all_dead_eh_edges(), try_add_cand_for(), type_escape_execute(), update_alias_info(), update_ssa(), vect_transform_loop(), and verify_call_clobbering().
| typedef unsigned long BITMAP_WORD |
| enum bitmap_bits |
| struct bitmap_element_def GTY | ( | () | ) | [read, write] |
Definition at line 77 of file cplus-dem.c.
| int bitmap_operation PARAMS | ( | (bitmap, bitmap, bitmap, enum bitmap_bits) | ) |
Definition at line 57 of file bitmap.h.
Referenced by bitmap_and(), bitmap_and_compl(), bitmap_and_compl_into(), bitmap_and_into(), bitmap_bit_p(), bitmap_clear(), bitmap_clear_bit(), bitmap_clear_range(), bitmap_compl_and_into(), bitmap_copy(), bitmap_count_bits(), bitmap_element_allocate(), bitmap_element_free(), bitmap_element_link(), bitmap_elt_clear_from(), bitmap_elt_insert_after(), bitmap_equal_p(), bitmap_find_bit(), bitmap_first_set_bit(), bitmap_hash(), bitmap_intersect_compl_p(), bitmap_intersect_p(), bitmap_ior(), bitmap_ior_into(), bitmap_last_set_bit(), bitmap_obstack_initialize(), bitmap_operation(), bitmap_set_bit(), bitmap_xor(), bitmap_xor_into(), and debug_bitmap_file().
Definition at line 66 of file bitmap.h.
Referenced by bitmap_equal_p(), bitmap_ior_and_compl(), bitmap_ior_and_compl_into(), bitmap_obstack_alloc(), bitmap_union_of_diff(), c_finish_omp_clauses(), collect_pattern_seqs(), decide_instantiations(), extend_dependency_caches(), find_more_ref_vops(), finish_omp_clauses(), and init_dependency_caches().
1.5.6