Home
last modified time | relevance | path

Searched refs:visited (Results 1 – 25 of 111) sorted by relevance

12345

/dragonfly/contrib/gcc-4.7/gcc/
H A Dcfganal.c170 sbitmap visited; in mark_dfs_back_edges() local
185 sbitmap_zero (visited); in mark_dfs_back_edges()
238 sbitmap_free (visited); in mark_dfs_back_edges()
664 sbitmap visited; in post_order_compute() local
678 sbitmap_zero (visited); in post_order_compute()
745 sbitmap_free (visited); in post_order_compute()
774 sbitmap_zero (visited); in dfs_find_deadend()
821 sbitmap visited; in inverted_post_order_compute() local
959 sbitmap visited; in pre_and_rev_post_order_compute() local
1179 if (!visited) in dfs_enumerate_from()
[all …]
H A Ddomwalk.c147 sbitmap visited = sbitmap_alloc (last_basic_block + 1); in walk_dominator_tree() local
148 sbitmap_zero (visited); in walk_dominator_tree()
149 SET_BIT (visited, ENTRY_BLOCK_PTR->index); in walk_dominator_tree()
190 SET_BIT (visited, bb->index); in walk_dominator_tree()
236 && !TEST_BIT (visited, e->src->index)) in walk_dominator_tree()
258 sbitmap_free (visited); in walk_dominator_tree()
H A Dtree-ssa-threadedge.c631 bitmap visited) in thread_around_empty_block() argument
780 bitmap visited; in thread_across_edge() local
796 visited = BITMAP_ALLOC (NULL); in thread_across_edge()
797 bitmap_set_bit (visited, dest->index); in thread_across_edge()
805 visited); in thread_across_edge()
810 BITMAP_FREE (visited); in thread_across_edge()
834 bitmap visited = BITMAP_ALLOC (NULL); in thread_across_edge() local
840 bitmap_clear (visited); in thread_across_edge()
842 bitmap_set_bit (visited, e->dest->index); in thread_across_edge()
856 visited); in thread_across_edge()
[all …]
H A Dmatrix-reorg.c775 int level, sbitmap visited) in analyze_matrix_allocation_site() argument
1161 current_indirect_level, false, visited, in analyze_accesses_for_phi_node()
1174 bool last_op, sbitmap visited, in analyze_accesses_for_assign_stmt() argument
1319 visited, record_accesses); in analyze_accesses_for_assign_stmt()
1336 sbitmap visited, bool record_accesses) in analyze_matrix_accesses() argument
1368 visited, record_accesses); in analyze_matrix_accesses()
1377 visited, record_accesses); in analyze_matrix_accesses()
1512 SET_BIT (visited, SSA_NAME_VERSION (expr)); in can_calculate_expr_before_stmt()
1554 sbitmap visited; in check_allocation_function() local
1559 visited = sbitmap_alloc (num_ssa_names); in check_allocation_function()
[all …]
H A Dtree-ssa-alias.c1893 if (!*visited) in maybe_skip_until()
1894 *visited = BITMAP_ALLOC (NULL); in maybe_skip_until()
1909 visited, abort_on_visited); in maybe_skip_until()
2066 bitmap visited = NULL; in walk_non_aliased_vuses() local
2110 if (visited) in walk_non_aliased_vuses()
2111 BITMAP_FREE (visited); in walk_non_aliased_vuses()
2141 if (*visited in walk_aliased_vdefs_1()
2150 if (!*visited) in walk_aliased_vdefs_1()
2154 walker, data, visited, 0); in walk_aliased_vdefs_1()
2173 bitmap *visited) in walk_aliased_vdefs() argument
[all …]
H A Dtree-outof-ssa.c82 sbitmap visited; member
354 g->visited = sbitmap_alloc (size); in new_elim_graph()
376 sbitmap_free (g->visited); in delete_elim_graph()
558 SET_BIT (g->visited, T); in elim_forward()
561 if (!TEST_BIT (g->visited, S)) in elim_forward()
592 SET_BIT (g->visited, T); in elim_backward()
637 if (!TEST_BIT (g->visited, P)) in elim_create()
649 SET_BIT (g->visited, T); in elim_create()
678 sbitmap_zero (g->visited); in eliminate_phi()
687 sbitmap_zero (g->visited); in eliminate_phi()
[all …]
H A Dpredict.c1200 tree op1, bitmap visited) in expr_expected_value_1() argument
1257 visited); in expr_expected_value_1()
1348 op0, code, op1, visited); in expr_expected_value()
1412 bitmap visited; in tree_predict_by_opcode() local
1424 visited = BITMAP_ALLOC (NULL); in tree_predict_by_opcode()
1426 BITMAP_FREE (visited); in tree_predict_by_opcode()
1837 bitmap visited) in predict_paths_for_bb() argument
1894 bitmap visited = BITMAP_ALLOC (NULL); in predict_paths_leading_to() local
1896 BITMAP_FREE (visited); in predict_paths_leading_to()
1920 bitmap visited = BITMAP_ALLOC (NULL); in predict_paths_leading_to_edge() local
[all …]
H A Dbb-reorder.c316 if (!e->dest->il.rtl->visited in rotate_loop()
332 if (!e->dest->il.rtl->visited in rotate_loop()
405 bb->il.rtl->visited = trace; in mark_bb_visited()
499 if (e->dest->il.rtl->visited in find_traces_1_round()
553 || e->dest->il.rtl->visited) in find_traces_1_round()
685 && !e->dest->il.rtl->visited in find_traces_1_round()
719 || e->dest->il.rtl->visited) in find_traces_1_round()
767 new_bb->il.rtl->visited = trace; in copy_bb()
2077 if (bb->il.rtl->visited) in duplicate_computed_gotos()
2080 bb->il.rtl->visited = 1; in duplicate_computed_gotos()
[all …]
H A Dtree-ssa-live.c933 loe_visit_block (tree_live_info_p live, basic_block bb, sbitmap visited, in loe_visit_block() argument
941 gcc_assert (!TEST_BIT (visited, bb->index)); in loe_visit_block()
943 SET_BIT (visited, bb->index); in loe_visit_block()
961 if (TEST_BIT (visited, pred_bb->index) && change) in loe_visit_block()
963 RESET_BIT (visited, pred_bb->index); in loe_visit_block()
978 sbitmap visited = sbitmap_alloc (last_basic_block + 1); in live_worklist() local
981 sbitmap_zero (visited); in live_worklist()
986 loe_visit_block (live, bb, visited, tmp); in live_worklist()
992 loe_visit_block (live, BASIC_BLOCK (b), visited, tmp); in live_worklist()
996 sbitmap_free (visited); in live_worklist()
H A Dtree-stdarg.c53 sbitmap visited; in reachable_at_most_once() local
62 visited = sbitmap_alloc (last_basic_block); in reachable_at_most_once()
63 sbitmap_zero (visited); in reachable_at_most_once()
94 if (! TEST_BIT (visited, src->index)) in reachable_at_most_once()
96 SET_BIT (visited, src->index); in reachable_at_most_once()
103 sbitmap_free (visited); in reachable_at_most_once()
H A Dtree-if-conv.c844 pred_blocks_visited_p (basic_block bb, bitmap *visited) in pred_blocks_visited_p() argument
849 if (!bitmap_bit_p (*visited, e->src->index)) in pred_blocks_visited_p()
866 bitmap visited; in get_loop_body_in_if_conv_order() local
874 visited = BITMAP_ALLOC (NULL); in get_loop_body_in_if_conv_order()
886 BITMAP_FREE (visited); in get_loop_body_in_if_conv_order()
891 if (!bitmap_bit_p (visited, bb->index)) in get_loop_body_in_if_conv_order()
893 if (pred_blocks_visited_p (bb, &visited) in get_loop_body_in_if_conv_order()
897 bitmap_set_bit (visited, bb->index); in get_loop_body_in_if_conv_order()
910 BITMAP_FREE (visited); in get_loop_body_in_if_conv_order()
H A Dgcse.c2014 basic_block bb, char *visited) in pre_expr_reaches_here_p_work() argument
2025 || visited[pred_bb->index]) in pre_expr_reaches_here_p_work()
2037 visited[pred_bb->index] = 1; in pre_expr_reaches_here_p_work()
2041 visited[pred_bb->index] = 1; in pre_expr_reaches_here_p_work()
2046 visited[pred_bb->index] = 1; in pre_expr_reaches_here_p_work()
2067 free (visited); in pre_expr_reaches_here_p()
2878 if (visited == NULL) in hoist_expr_reaches_here_p()
2892 else if (visited[pred_bb->index]) in hoist_expr_reaches_here_p()
2901 visited[pred_bb->index] = 1; in hoist_expr_reaches_here_p()
2903 visited, distance, bb_size)) in hoist_expr_reaches_here_p()
[all …]
H A Dregcprop.c1024 sbitmap visited; in copyprop_hardreg_forward() local
1029 visited = sbitmap_alloc (last_basic_block); in copyprop_hardreg_forward()
1030 sbitmap_zero (visited); in copyprop_hardreg_forward()
1039 SET_BIT (visited, bb->index); in copyprop_hardreg_forward()
1046 && TEST_BIT (visited, single_pred (bb)->index) in copyprop_hardreg_forward()
1074 if (TEST_BIT (visited, bb->index) in copyprop_hardreg_forward()
1099 sbitmap_free (visited); in copyprop_hardreg_forward()
H A Dtree-ssa-ccp.c1716 insert_clobber_before_stack_restore (tree saved_val, tree var, htab_t *visited) in insert_clobber_before_stack_restore() argument
1736 if (*visited == NULL) in insert_clobber_before_stack_restore()
1737 *visited = htab_create (10, htab_hash_pointer, htab_eq_pointer, NULL); in insert_clobber_before_stack_restore()
1739 slot = (gimple *)htab_find_slot (*visited, stmt, INSERT); in insert_clobber_before_stack_restore()
1745 visited); in insert_clobber_before_stack_restore()
1749 visited); in insert_clobber_before_stack_restore()
1785 htab_t visited = NULL; in insert_clobbers_for_var() local
1798 insert_clobber_before_stack_restore (saved_val, var, &visited); in insert_clobbers_for_var()
1802 if (visited != NULL) in insert_clobbers_for_var()
1803 htab_delete (visited); in insert_clobbers_for_var()
H A Dtree-ssa-dce.c524 static bitmap visited = NULL; variable
671 mark_all_reaching_defs_necessary_1, NULL, &visited); in mark_all_reaching_defs_necessary()
996 if (visited) in propagate_necessity()
997 bitmap_clear (visited); in propagate_necessity()
1583 visited = BITMAP_ALLOC (NULL); in perform_tree_ssa_dce()
1585 BITMAP_FREE (visited); in perform_tree_ssa_dce()
/dragonfly/contrib/gcc-8.0/gcc/
H A Dcfganal.c80 bitmap_clear (visited); in mark_dfs_back_edges()
101 bitmap_set_bit (visited, dest->index); in mark_dfs_back_edges()
642 bitmap_clear (visited); in post_order_compute()
739 auto_bitmap visited; in dfs_find_deadend() local
813 bitmap_clear (visited); in inverted_post_order_compute()
974 bitmap_clear (visited); in pre_and_rev_post_order_compute_fn()
1155 static sbitmap visited; in dfs_enumerate_from() local
1167 if (!visited) in dfs_enumerate_from()
1171 bitmap_clear (visited); in dfs_enumerate_from()
1180 visited = sbitmap_resize (visited, size, 0); in dfs_enumerate_from()
[all …]
H A Dtree-ssa-threadedge.c900 bitmap visited, in thread_around_empty_blocks() argument
950 visited, in thread_around_empty_blocks()
999 visited, in thread_around_empty_blocks()
1044 bitmap visited) in thread_through_normal_block() argument
1151 visited, in thread_through_normal_block()
1190 bitmap_clear (visited); in thread_across_edge()
1201 visited); in thread_across_edge()
1235 BITMAP_FREE (visited); in thread_across_edge()
1269 BITMAP_FREE (visited); in thread_across_edge()
1288 bitmap_clear (visited); in thread_across_edge()
[all …]
H A Dtree-outof-ssa.c147 auto_sbitmap visited; member
600 bitmap_set_bit (g->visited, T); in elim_forward()
603 if (!bitmap_bit_p (g->visited, S)) in elim_forward()
620 if (!bitmap_bit_p (g->visited, P)) in elim_unvisited_predecessor()
634 bitmap_set_bit (g->visited, T); in elim_backward()
637 if (!bitmap_bit_p (g->visited, P)) in elim_backward()
678 if (!bitmap_bit_p (g->visited, P)) in elim_create()
690 bitmap_set_bit (g->visited, T); in elim_create()
719 bitmap_clear (g->visited); in eliminate_phi()
728 bitmap_clear (g->visited); in eliminate_phi()
[all …]
H A Dtree-ssa-alias.c2590 if (!*visited) in maybe_skip_until()
2591 *visited = BITMAP_ALLOC (NULL); in maybe_skip_until()
2606 visited, abort_on_visited, in maybe_skip_until()
2762 bitmap visited = NULL; in walk_non_aliased_vuses() local
2819 if (visited) in walk_non_aliased_vuses()
2820 BITMAP_FREE (visited); in walk_non_aliased_vuses()
2856 if (*visited in walk_aliased_vdefs_1()
2869 if (!*visited) in walk_aliased_vdefs_1()
2870 *visited = BITMAP_ALLOC (NULL); in walk_aliased_vdefs_1()
2901 bitmap *visited, in walk_aliased_vdefs() argument
[all …]
H A Dgraph.c164 auto_sbitmap visited (last_basic_block_for_fn (cfun)); in draw_cfg_nodes_no_loops()
165 bitmap_clear (visited); in draw_cfg_nodes_no_loops()
173 bitmap_set_bit (visited, bb->index); in draw_cfg_nodes_no_loops()
182 if (! bitmap_bit_p (visited, bb->index)) in draw_cfg_nodes_no_loops()
H A Dgcse.c1909 basic_block bb, char *visited) in pre_expr_reaches_here_p_work() argument
1920 || visited[pred_bb->index]) in pre_expr_reaches_here_p_work()
1932 visited[pred_bb->index] = 1; in pre_expr_reaches_here_p_work()
1936 visited[pred_bb->index] = 1; in pre_expr_reaches_here_p_work()
1941 visited[pred_bb->index] = 1; in pre_expr_reaches_here_p_work()
1962 free (visited); in pre_expr_reaches_here_p()
2900 basic_block bb, sbitmap visited, in should_hoist_expr_to_dom() argument
2959 if (visited == NULL) in should_hoist_expr_to_dom()
2963 bitmap_clear (visited); in should_hoist_expr_to_dom()
2983 visited, distance, bb_size, in should_hoist_expr_to_dom()
[all …]
H A Dtree-ssa-live.c947 loe_visit_block (tree_live_info_p live, basic_block bb, sbitmap visited) in loe_visit_block() argument
955 gcc_checking_assert (!bitmap_bit_p (visited, bb->index)); in loe_visit_block()
956 bitmap_set_bit (visited, bb->index); in loe_visit_block()
975 && bitmap_bit_p (visited, pred_bb->index)) in loe_visit_block()
977 bitmap_clear_bit (visited, pred_bb->index); in loe_visit_block()
992 auto_sbitmap visited (last_basic_block_for_fn (cfun) + 1); in live_worklist()
994 bitmap_clear (visited); in live_worklist()
999 loe_visit_block (live, bb, visited); in live_worklist()
1005 loe_visit_block (live, BASIC_BLOCK_FOR_FN (cfun, b), visited); in live_worklist()
H A Dcfgloopanal.c507 bitmap visited = BITMAP_ALLOC (NULL); in get_loop_hot_path() local
516 bitmap_set_bit (visited, bb->index); in get_loop_hot_path()
520 && !bitmap_bit_p (visited, e->dest->index)) in get_loop_hot_path()
526 BITMAP_FREE (visited); in get_loop_hot_path()
H A Dipa-polymorphic-call.c795 hash_set <tree> *visited = NULL; variable
814 if (!visited)
815 visited = new hash_set<tree>;
816 if (visited->add (op))
852 if (visited)
853 delete (visited);
881 hash_set <tree> *visited = NULL; in ipa_polymorphic_call_context() local
937 if (visited) in ipa_polymorphic_call_context()
938 delete (visited); in ipa_polymorphic_call_context()
984 if (visited) in ipa_polymorphic_call_context()
[all …]
/dragonfly/sys/kern/
H A Dsubr_cpu_topology.c286 int visited[MAXCPU], i, j, pos, cpuid; in build_cpu_topology() local
289 bzero(visited, MAXCPU * sizeof(int)); in build_cpu_topology()
292 if (visited[i] == 0) { in build_cpu_topology()
294 visited[i] = 1; in build_cpu_topology()
313 if (visited[cpuid] == 0 && in build_cpu_topology()
322 visited[cpuid] = 1; in build_cpu_topology()

12345