| /netbsd-src/external/gpl3/gcc/dist/gcc/analyzer/ |
| H A D | analyzer.cc | 64 fixup_tree_for_diagnostic_1 (tree expr, hash_set<tree> *visited);
71 hash_set<tree> *visited) in get_diagnostic_tree_for_gassign_1() argument
94 op = fixup_tree_for_diagnostic_1 (op, visited); in get_diagnostic_tree_for_gassign_1()
105 op = fixup_tree_for_diagnostic_1 (op, visited); in get_diagnostic_tree_for_gassign_1()
121 hash_set<tree> *visited) in maybe_reconstruct_from_def_stmt() argument
124 if (visited->contains (ssa_name)) in maybe_reconstruct_from_def_stmt()
126 visited->add (ssa_name); in maybe_reconstruct_from_def_stmt()
141 (as_a <const gassign *> (def_stmt), visited); in maybe_reconstruct_from_def_stmt()
147 visited); in maybe_reconstruct_from_def_stmt()
155 arg = fixup_tree_for_diagnostic_1 (arg, visited); in maybe_reconstruct_from_def_stmt()
[all …]
|
| /netbsd-src/usr.bin/nbperf/ |
| H A D | nbperf-bdz.c | 74 uint32_t *visited; member
94 if (!state->visited[e->vertices[0]]) { in assign_nodes()
97 } else if (!state->visited[e->vertices[1]]) { in assign_nodes()
101 if (state->visited[e->vertices[2]]) in assign_nodes()
107 state->visited[t] = 2 + j; in assign_nodes()
108 if (state->visited[e->vertices[0]] == 0) in assign_nodes()
109 state->visited[e->vertices[0]] = 1; in assign_nodes()
110 if (state->visited[e->vertices[1]] == 0) in assign_nodes()
111 state->visited[e->vertices[1]] = 1; in assign_nodes()
112 if (state->visited[e->vertices[2]] == 0) in assign_nodes()
[all …]
|
| H A D | nbperf-chm.c | 79 uint8_t *visited; member
93 if (!state->visited[e->vertices[0]]) { in assign_nodes()
97 } else if (!state->visited[e->vertices[1]]) { in assign_nodes()
113 state->visited[v0] = 1; in assign_nodes()
114 state->visited[v1] = 1; in assign_nodes()
115 state->visited[v2] = 1; in assign_nodes()
129 if (!state->visited[e->vertices[0]]) { in assign_nodes()
140 state->visited[v0] = 1; in assign_nodes()
141 state->visited[v1] = 1; in assign_nodes()
274 state.visited = calloc(sizeof(uint8_t), v); in chm3_compute()
[all …]
|
| /netbsd-src/external/gpl3/gcc.old/dist/gcc/ |
| H A D | cfganal.c | 77 auto_sbitmap visited (last_basic_block_for_fn (cfun)); in mark_dfs_back_edges()
80 bitmap_clear (visited); in mark_dfs_back_edges()
97 if (dest != EXIT_BLOCK_PTR_FOR_FN (cfun) && ! bitmap_bit_p (visited, in mark_dfs_back_edges()
101 bitmap_set_bit (visited, dest->index); in mark_dfs_back_edges()
639 auto_sbitmap visited (last_basic_block_for_fn (cfun)); in post_order_compute()
642 bitmap_clear (visited); in post_order_compute()
659 && ! bitmap_bit_p (visited, dest->index)) in post_order_compute()
662 bitmap_set_bit (visited, dest->index); in post_order_compute()
703 if (!(bitmap_bit_p (visited, b->index))) in post_order_compute()
739 auto_bitmap visited; in dfs_find_deadend() local
[all …]
|
| H A D | tree-ssa-threadedge.c | 900 bitmap visited, in thread_around_empty_blocks() argument
940 if (!bitmap_bit_p (visited, taken_edge->dest->index)) in thread_around_empty_blocks()
945 bitmap_set_bit (visited, taken_edge->dest->index); in thread_around_empty_blocks()
950 visited, in thread_around_empty_blocks()
988 if (bitmap_bit_p (visited, taken_edge->dest->index)) in thread_around_empty_blocks()
990 bitmap_set_bit (visited, taken_edge->dest->index); in thread_around_empty_blocks()
1000 visited, in thread_around_empty_blocks()
1045 bitmap visited) in thread_through_normal_block() argument
1124 || bitmap_bit_p (visited, dest->index)) in thread_through_normal_block()
1146 bitmap_set_bit (visited, dest->index); in thread_through_normal_block()
[all …]
|
| H A D | tree-chrec.c | 940 chrec_contains_symbols (const_tree chrec, hash_set<const_tree> &visited, in chrec_contains_symbols() argument
963 if (visited.add (chrec)) in chrec_contains_symbols()
968 if (chrec_contains_symbols (TREE_OPERAND (chrec, i), visited, loop)) in chrec_contains_symbols()
981 hash_set<const_tree> visited; in chrec_contains_symbols() local
982 return chrec_contains_symbols (chrec, visited, loop); in chrec_contains_symbols()
990 hash_set<const_tree> &visited) in chrec_contains_symbols_defined_in_loop() argument
1021 if (visited.add (chrec)) in chrec_contains_symbols_defined_in_loop()
1027 loop_nb, visited)) in chrec_contains_symbols_defined_in_loop()
1038 hash_set<const_tree> visited; in chrec_contains_symbols_defined_in_loop() local
1039 return chrec_contains_symbols_defined_in_loop (chrec, loop_nb, visited); in chrec_contains_symbols_defined_in_loop()
[all …]
|
| H A D | tree-outof-ssa.c | 150 auto_sbitmap visited; variable
433 nodes (30), edge_list (20), edge_locus (10), visited (map->num_partitions), in elim_graph()
636 bitmap_set_bit (g->visited, T); in elim_forward()
639 if (!bitmap_bit_p (g->visited, S)) in elim_forward()
656 if (!bitmap_bit_p (g->visited, P)) in elim_unvisited_predecessor()
670 bitmap_set_bit (g->visited, T); in elim_backward()
673 if (!bitmap_bit_p (g->visited, P)) in elim_backward()
716 if (!bitmap_bit_p (g->visited, P)) in elim_create()
728 bitmap_set_bit (g->visited, T); in elim_create()
757 bitmap_clear (g->visited); in eliminate_phi()
[all …]
|
| H A D | tree-vect-slp.c | 1600 slp_tree node, hash_set<slp_tree> &visited) in vect_print_slp_tree() argument
1607 if (visited.add (node)) in vect_print_slp_tree()
1644 vect_print_slp_tree (dump_kind, loc, child, visited); in vect_print_slp_tree()
1651 hash_set<slp_tree> visited; in vect_print_slp_tree() local
1652 vect_print_slp_tree (dump_kind, loc, node, visited); in vect_print_slp_tree()
1658 vect_mark_slp_stmts (slp_tree node, hash_set<slp_tree> &visited) in vect_mark_slp_stmts() argument
1667 if (visited.add (node)) in vect_mark_slp_stmts()
1674 vect_mark_slp_stmts (child, visited); in vect_mark_slp_stmts()
1680 hash_set<slp_tree> visited; in vect_mark_slp_stmts() local
1681 vect_mark_slp_stmts (node, visited); in vect_mark_slp_stmts()
[all …]
|
| H A D | gimple-ssa-isolate-paths.c | 428 hash_set<gphi *> *visited) in is_addr_local() argument
435 plocmap, visited); in is_addr_local()
491 res1 = is_addr_local (return_stmt, ptr1, plocmap, visited); in is_addr_local()
493 res2 = is_addr_local (return_stmt, ptr2, plocmap, visited); in is_addr_local()
550 plocmap, visited); in is_addr_local()
556 if (code == GIMPLE_PHI && visited) in is_addr_local()
559 if (visited->add (phi_stmt)) in is_addr_local()
571 if (is_addr_local (return_stmt, arg, plocmap, visited)) in is_addr_local()
|
| /netbsd-src/external/gpl3/gcc/dist/gcc/ |
| H A D | cfganal.cc | 78 auto_sbitmap visited (last_basic_block_for_fn (fun)); in mark_dfs_back_edges() local
81 bitmap_clear (visited); in mark_dfs_back_edges()
98 if (dest != EXIT_BLOCK_PTR_FOR_FN (fun) && ! bitmap_bit_p (visited, in mark_dfs_back_edges()
102 bitmap_set_bit (visited, dest->index); in mark_dfs_back_edges()
668 auto_sbitmap visited (last_basic_block_for_fn (cfun)); in post_order_compute() local
671 bitmap_clear (visited); in post_order_compute()
688 && ! bitmap_bit_p (visited, dest->index)) in post_order_compute()
691 bitmap_set_bit (visited, dest->index); in post_order_compute()
732 if (!(bitmap_bit_p (visited, b->index))) in post_order_compute()
768 auto_bitmap visited; in dfs_find_deadend() local
[all …]
|
| H A D | tree-ssa-threadedge.cc | 789 bitmap visited) in thread_around_empty_blocks() argument
828 if (!bitmap_bit_p (visited, taken_edge->dest->index)) in thread_around_empty_blocks()
832 bitmap_set_bit (visited, taken_edge->dest->index); in thread_around_empty_blocks()
833 return thread_around_empty_blocks (path, taken_edge, visited); in thread_around_empty_blocks()
868 if (bitmap_bit_p (visited, taken_edge->dest->index)) in thread_around_empty_blocks()
870 bitmap_set_bit (visited, taken_edge->dest->index); in thread_around_empty_blocks()
875 thread_around_empty_blocks (path, taken_edge, visited); in thread_around_empty_blocks()
902 edge e, bitmap visited) in thread_through_normal_block() argument
973 || bitmap_bit_p (visited, dest->index)) in thread_through_normal_block()
990 bitmap_set_bit (visited, dest->index); in thread_through_normal_block()
[all …]
|
| H A D | tree-chrec.cc | 940 chrec_contains_symbols (const_tree chrec, hash_set<const_tree> &visited, in chrec_contains_symbols() argument
963 if (visited.add (chrec)) in chrec_contains_symbols()
968 if (chrec_contains_symbols (TREE_OPERAND (chrec, i), visited, loop)) in chrec_contains_symbols()
981 hash_set<const_tree> visited; in chrec_contains_symbols() local
982 return chrec_contains_symbols (chrec, visited, loop); in chrec_contains_symbols()
990 hash_set<const_tree> &visited) in chrec_contains_symbols_defined_in_loop() argument
1021 if (visited.add (chrec)) in chrec_contains_symbols_defined_in_loop()
1027 loop_nb, visited)) in chrec_contains_symbols_defined_in_loop()
1038 hash_set<const_tree> visited; in chrec_contains_symbols_defined_in_loop() local
1039 return chrec_contains_symbols_defined_in_loop (chrec, loop_nb, visited); in chrec_contains_symbols_defined_in_loop()
[all …]
|
| H A D | tree-outof-ssa.cc | 150 auto_sbitmap visited; member in elim_graph
433 nodes (30), edge_list (20), edge_locus (10), visited (map->num_partitions), in elim_graph()
636 bitmap_set_bit (g->visited, T); in elim_forward()
639 if (!bitmap_bit_p (g->visited, S)) in elim_forward()
656 if (!bitmap_bit_p (g->visited, P)) in elim_unvisited_predecessor()
670 bitmap_set_bit (g->visited, T); in elim_backward()
673 if (!bitmap_bit_p (g->visited, P)) in elim_backward()
716 if (!bitmap_bit_p (g->visited, P)) in elim_create()
728 bitmap_set_bit (g->visited, T); in elim_create()
757 bitmap_clear (g->visited); in eliminate_phi()
[all …]
|
| H A D | tree-vect-slp.cc | 2559 dot_slp_tree (FILE *f, slp_tree node, hash_set<slp_tree> &visited) in dot_slp_tree() argument
2561 if (visited.add (node)) in dot_slp_tree()
2576 dot_slp_tree (f, child, visited); in dot_slp_tree()
2587 hash_set<slp_tree> visited; in dot_slp_tree() local
2588 dot_slp_tree (f, node, visited); in dot_slp_tree()
2599 slp_tree node, hash_set<slp_tree> &visited) in vect_print_slp_graph() argument
2604 if (visited.add (node)) in vect_print_slp_graph()
2611 vect_print_slp_graph (dump_kind, loc, child, visited); in vect_print_slp_graph()
2618 hash_set<slp_tree> visited; in vect_print_slp_graph() local
2619 vect_print_slp_graph (dump_kind, loc, entry, visited); in vect_print_slp_graph()
[all …]
|
| H A D | gimple-ssa-isolate-paths.cc | 433 hash_set<gphi *> *visited) in is_addr_local() argument
440 plocmap, visited); in is_addr_local()
496 res1 = is_addr_local (return_stmt, ptr1, plocmap, visited); in is_addr_local()
498 res2 = is_addr_local (return_stmt, ptr2, plocmap, visited); in is_addr_local()
555 plocmap, visited); in is_addr_local()
561 if (code == GIMPLE_PHI && visited) in is_addr_local()
564 if (visited->add (phi_stmt)) in is_addr_local()
576 if (is_addr_local (return_stmt, arg, plocmap, visited)) in is_addr_local()
|
| /netbsd-src/crypto/external/bsd/openssl/dist/crypto/ |
| H A D | provider_conf.c | 84 STACK_OF(OPENSSL_CSTRING) *visited) in provider_conf_params_internal()
104 for (i = 0; i < sk_OPENSSL_CSTRING_num(visited); i++) { in provider_conf_params_internal()
105 if (sk_OPENSSL_CSTRING_value(visited, i) == value) { in provider_conf_params_internal()
114 if (!sk_OPENSSL_CSTRING_push(visited, value)) in provider_conf_params_internal()
127 sk_OPENSSL_CSTRING_pop(visited); in provider_conf_params_internal()
133 sectconf->value, cnf, visited); in provider_conf_params_internal()
135 sk_OPENSSL_CSTRING_pop(visited); in provider_conf_params_internal()
139 sk_OPENSSL_CSTRING_pop(visited); in provider_conf_params_internal()
167 STACK_OF(OPENSSL_CSTRING) *visited = sk_OPENSSL_CSTRING_new_null(); in provider_conf_params()
169 if (visited == NULL) in provider_conf_params()
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | SelectionDAGPrinter.cpp | 237 bool SelectionDAG::setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet<SDNode *> &visited, in setSubgraphColorHelper() argument
250 unsigned oldSize = visited.size(); in setSubgraphColorHelper()
251 visited.insert(N); in setSubgraphColorHelper()
252 if (visited.size() != oldSize) { in setSubgraphColorHelper()
257 hit_limit = setSubgraphColorHelper(*i, Color, visited, level+1, printed) || hit_limit; in setSubgraphColorHelper()
271 DenseSet<SDNode *> visited; in setSubgraphColor() local
273 if (setSubgraphColorHelper(N, Color, visited, 0, printed)) { in setSubgraphColor()
276 setSubgraphColorHelper(N, "blue", visited, 0, printed); in setSubgraphColor()
278 setSubgraphColorHelper(N, "green", visited, 0, printed); in setSubgraphColor()
|
| /netbsd-src/sbin/fsck_lfs/ |
| H A D | pass0.c | 105 char *visited; in pass0() local
112 visited = ecalloc(maxino, sizeof(*visited)); in pass0()
127 if (visited[ino]) { in pass0()
138 visited[ino] = 1; in pass0()
168 if (visited[ino]) in pass0()
|
| /netbsd-src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/ |
| H A D | UnreachableCodeChecker.cpp | 42 CFGBlocksSet &visited);
51 CFGBlocksSet reachable, visited; in checkEndAnalysis() local
106 if (!visited.count(CB->getBlockID())) in checkEndAnalysis()
107 FindUnreachableEntryPoints(CB, reachable, visited); in checkEndAnalysis()
180 CFGBlocksSet &visited) { in FindUnreachableEntryPoints() argument
181 visited.insert(CB->getBlockID()); in FindUnreachableEntryPoints()
192 if (!visited.count((*I)->getBlockID())) in FindUnreachableEntryPoints()
194 FindUnreachableEntryPoints(*I, reachable, visited); in FindUnreachableEntryPoints()
|
| /netbsd-src/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/ |
| H A D | sanitizer_bvgraph.h | 111 &visited = t2; in isReachable() local
113 visited.clear(); in isReachable()
114 visited.setBit(from); in isReachable()
117 if (visited.setBit(idx)) in isReachable()
120 return targets.intersectsWith(visited); in isReachable()
|
| /netbsd-src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/ |
| H A D | sanitizer_bvgraph.h | 112 &visited = t2; in isReachable() local
114 visited.clear(); in isReachable()
115 visited.setBit(from); in isReachable()
118 if (visited.setBit(idx)) in isReachable()
121 return targets.intersectsWith(visited); in isReachable()
|
| /netbsd-src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/ |
| H A D | sanitizer_bvgraph.h | 113 &visited = t2; in isReachable() local
115 visited.clear(); in isReachable()
116 visited.setBit(from); in isReachable()
119 if (visited.setBit(idx)) in isReachable()
122 return targets.intersectsWith(visited); in isReachable()
|
| /netbsd-src/external/apache2/llvm/dist/clang/lib/Analysis/ |
| H A D | CFGReachabilityAnalysis.cpp | 44 llvm::BitVector visited(analyzed.size()); in mapReachability() local
57 if (visited[block->getBlockID()]) in mapReachability()
59 visited[block->getBlockID()] = true; in mapReachability()
|
| /netbsd-src/lib/libc/cdb/ |
| H A D | cdbw.c | 382 char *visited; member
499 if (!state->visited[e->vertices[0]]) { in assign_nodes()
503 } else if (!state->visited[e->vertices[1]]) { in assign_nodes()
517 state->visited[v0] = 1; in assign_nodes()
518 state->visited[v1] = 1; in assign_nodes()
519 state->visited[v2] = 1; in assign_nodes()
636 NALLOC(state.visited, state.entries); in cdbw_output()
642 if (state.g == NULL || state.visited == NULL || state.edges == NULL || in cdbw_output()
661 free(state.visited); in cdbw_output()
|
| /netbsd-src/sys/dev/raidframe/ |
| H A D | rf_dagutils.c | 124 node->visited = 0; in rf_InitNode()
556 node->visited = (unvisited) ? 0 : 1; in rf_RecurPrintDAG()
589 if (node->succedents[i]->visited == unvisited) in rf_RecurPrintDAG()
616 unvisited = dag_h->succedents[0]->visited; in rf_PrintDAG()
628 if (dag_h->succedents[i]->visited == unvisited) in rf_PrintDAG()
641 unvisited = dag_h->succedents[0]->visited; in rf_AssignNodeNums()
646 if (node->visited == unvisited) { in rf_AssignNodeNums()
658 node->visited = (unvisited) ? 0 : 1; in rf_RecurAssignNodeNums()
662 if (node->succedents[i]->visited == unvisited) { in rf_RecurAssignNodeNums()
708 node->visited = (unvisited) ? 0 : 1; in rf_ValidateBranch()
[all …]
|