| /freebsd-12-stable/contrib/gcc/ |
| D | ddg.c | 652 SET_BIT (src->successors, dest->cuid); in add_edge_to_ddg() 653 SET_BIT (dest->predecessors, src->cuid); in add_edge_to_ddg() 870 SET_BIT (from, dest->cuid); in create_ddg_all_sccs() 871 SET_BIT (to, src->cuid); in create_ddg_all_sccs() 940 SET_BIT (reachable_from, v); in find_nodes_on_paths() 941 SET_BIT (tmp, v); in find_nodes_on_paths() 969 SET_BIT (reach_to, v); in find_nodes_on_paths() 970 SET_BIT (tmp, v); in find_nodes_on_paths() 1006 SET_BIT (tmp, v); in update_dist_to_successors() 1035 SET_BIT (tmp, src); in longest_simple_path()
|
| D | sched-rgn.c | 596 SET_BIT (in_stack, node); in find_rgns() 614 SET_BIT (header, child); in find_rgns() 684 SET_BIT (header, 0); in find_rgns() 775 SET_BIT (in_queue, jbb->index); in find_rgns() 799 SET_BIT (in_queue, node); in find_rgns() 860 SET_BIT (in_queue, node); in find_rgns() 924 SET_BIT (extended_rgn_header, e->dest->index); in find_rgns() 1118 SET_BIT (header, bbn); in extend_rgns() 1293 SET_BIT (dom[bb], 0); in compute_dom_prob_ps() 1317 SET_BIT (ancestor_edges[bb], EDGE_TO_BIT (in_edge)); in compute_dom_prob_ps() [all …]
|
| D | df-core.c | 523 SET_BIT (dataflow->visited, bb->index); in df_hybrid_search_forward() 550 SET_BIT (dataflow->pending, e->dest->index); in df_hybrid_search_forward() 575 SET_BIT (dataflow->visited, bb->index); in df_hybrid_search_backward() 604 SET_BIT (dataflow->pending, e->src->index); in df_hybrid_search_backward() 653 SET_BIT (considered, idx); in df_iterative_dataflow() 659 SET_BIT (pending, idx); in df_iterative_dataflow()
|
| D | cfganal.c | 202 SET_BIT (visited, dest->index); in mark_dfs_back_edges() 690 SET_BIT (visited, dest->index); in post_order_compute() 779 SET_BIT (visited, dest->index); in pre_and_rev_post_order_compute() 885 SET_BIT (data->visited_blocks, bb->index); in flow_dfs_compute_reverse_add_bb() 949 #define MARK_VISITED(BB) (SET_BIT (visited, (BB)->index)) in dfs_enumerate_from()
|
| D | cfgloopmanip.c | 162 SET_BIT (in_queue, from->index); in fix_bb_placements() 164 SET_BIT (in_queue, base_loop->header->index); in fix_bb_placements() 234 SET_BIT (in_queue, pred->index); in fix_bb_placements() 291 SET_BIT (seen, rem_bbs[i]->index); in remove_path() 299 SET_BIT (seen, ae->dest->index); in remove_path() 331 SET_BIT (seen, bb->index); in remove_path() 478 SET_BIT (seen, body[i]->index); in loopify() 489 SET_BIT (seen, ldom->index); in loopify()
|
| D | tree-ssa-dce.c | 258 SET_BIT (processed, ver); in mark_operand_necessary() 456 SET_BIT (last_stmt_necessary, cd_bb->index); in mark_control_dependent_edges_necessary() 500 SET_BIT (visited_control_parents, bb->index); in propagate_necessity() 529 SET_BIT (visited_control_parents, arg_bb->index); in propagate_necessity()
|
| D | gcse.c | 1048 SET_BIT (antloc[BLOCK_NUM (occr->insn)], indx); in compute_local_properties() 1060 SET_BIT (comp[BLOCK_NUM (occr->insn)], indx); in compute_local_properties() 1927 SET_BIT (reg_set_in_block[current_bb->index], regno); in record_last_reg_set_info() 2448 SET_BIT (bmap[bb->index], indx); in compute_transp() 2453 SET_BIT (bmap[r->bb_index], indx); in compute_transp() 2484 SET_BIT (bmap[bb_index], indx); in compute_transp() 2512 SET_BIT (bmap[bb_index], indx); in compute_transp() 3830 SET_BIT (trapping_expr, e->bitmap_index); in compute_pre_data() 4181 SET_BIT (inserted[e], j); in pre_edge_insert() 4446 SET_BIT (pre_redundant_insns, INSN_CUID (insn)); in pre_delete() [all …]
|
| D | tree-ssa-structalias.c | 977 SET_BIT (graph->direct_nodes, j); in build_pred_graph() 1128 SET_BIT (si->visited, n); in scc_visit() 1196 SET_BIT (si->roots, n); in scc_visit() 1228 SET_BIT (changed, to); in unify_nodes() 1243 SET_BIT (changed, to); in unify_nodes() 1310 SET_BIT (ti->visited, n); in topo_visit() 1374 SET_BIT (changed, t); in do_da_constraint() 1440 SET_BIT (changed, lhs); in do_sd_constraint() 1477 SET_BIT (changed, t); in do_ds_constraint() 1510 SET_BIT (changed, t); in do_ds_constraint() [all …]
|
| D | modulo-sched.c | 490 SET_BIT (uses_of_defs[dest_copy - 1], e->dest->cuid); in generate_reg_moves() 1572 SET_BIT (must_precede, e->src->cuid); in sms_schedule_by_order() 1578 SET_BIT (must_follow, e->dest->cuid); in sms_schedule_by_order() 1593 SET_BIT (sched_nodes, u); in sms_schedule_by_order() 1673 SET_BIT (tmp, u); in check_nodes_order() 1934 SET_BIT (workset, u); in order_nodes_in_scc() 1960 SET_BIT (nodes_ordered, v); in order_nodes_in_scc() 1981 SET_BIT (nodes_ordered, v); in order_nodes_in_scc()
|
| D | sched-ebb.c | 632 SET_BIT (large_region_blocks, bb->index); in schedule_ebbs() 655 SET_BIT (blocks, bbi); in schedule_ebbs()
|
| D | loop-unroll.c | 725 SET_BIT (wont_exit, 1); in unroll_loop_constant_iterations() 763 SET_BIT (wont_exit, 0); in unroll_loop_constant_iterations() 764 SET_BIT (wont_exit, 1); in unroll_loop_constant_iterations() 1026 SET_BIT (wont_exit, 1); in unroll_loop_runtime_iterations() 1044 SET_BIT (wont_exit, 1); in unroll_loop_runtime_iterations()
|
| D | sbitmap.h | 45 #define SET_BIT(BITMAP, BITNO) \ macro
|
| D | mode-switching.c | 558 SET_BIT (antic[bb->index], j); in optimize_mode_switching() 561 SET_BIT (comp[bb->index], j); in optimize_mode_switching()
|
| D | tree-ssa-copy.c | 515 SET_BIT (visited, SSA_NAME_VERSION (var)); in dump_copy_of() 530 SET_BIT (visited, SSA_NAME_VERSION (val)); in dump_copy_of()
|
| D | tree-ssa-propagate.c | 223 SET_BIT (bb_in_list, bb->index); in cfg_blocks_add() 431 SET_BIT (executable_blocks, block->index); in simulate_block()
|
| D | bt-load.c | 506 SET_BIT (bb_gen[i], insn_uid); in compute_defs_uses_and_gen() 509 SET_BIT (btr_defset[regno - first_btr], insn_uid); in compute_defs_uses_and_gen() 698 SET_BIT(reaching_defs, insn_uid); in link_btr_uses()
|
| D | see.c | 1881 SET_BIT (comp[bb_num], indx); in see_analyze_merged_def_local_prop() 1942 SET_BIT (ae_kill[bb_num], indx); in see_analyze_unmerged_def_local_prop() 1991 SET_BIT (antloc[bb_num], indx); in see_analyze_use_local_prop() 2009 SET_BIT (comp[bb_num], indx); in see_analyze_use_local_prop() 2031 SET_BIT (comp[bb_num], indx); in see_analyze_use_local_prop()
|
| D | tree-outof-ssa.c | 414 SET_BIT (g->visited, T); in elim_forward() 444 SET_BIT (g->visited, T); in elim_backward() 484 SET_BIT (g->visited, T); in elim_create() 874 SET_BIT (live, x); in coalesce_ssa_name()
|
| D | tree-into-ssa.c | 696 SET_BIT (new_ssa_names, SSA_NAME_VERSION (new)); in add_new_name_mapping() 697 SET_BIT (old_ssa_names, SSA_NAME_VERSION (old)); in add_new_name_mapping() 779 SET_BIT (gd->interesting_blocks, bb->index); in mark_def_sites() 3108 SET_BIT (tmp, i); in update_ssa()
|
| D | tree-ssa-live.c | 235 SET_BIT (used, tmp); in compact_var_map() 1040 SET_BIT (seen, p); in root_var_init() 1114 SET_BIT (seen, p); in type_var_init()
|
| D | cfgloop.c | 662 SET_BIT (headers, header->index); in flow_loops_find() 1156 SET_BIT (irreds, bb->index); in verify_loop_structure()
|
| D | recog.c | 2769 SET_BIT (blocks, bb->index); in split_all_insns() 2787 SET_BIT (blocks, bb->index); in split_all_insns() 3231 SET_BIT (blocks, nfte->dest->index); in peephole2_optimize() 3250 SET_BIT (blocks, bb->index); in peephole2_optimize()
|
| D | cfgbuild.c | 286 SET_BIT (edge_cache, e->dest->index); in make_edges()
|
| D | tree-stdarg.c | 100 SET_BIT (visited, src->index); in reachable_at_most_once()
|
| D | tree-ssa-phiopt.c | 259 #define MARK_VISITED(BB) (SET_BIT (visited, (BB)->index)) in blocks_in_phiopt_order()
|