| /src/sbin/fsck_lfs/ |
| pass0.c | 105 char *visited; local
112 visited = ecalloc(maxino, sizeof(*visited));
127 if (visited[ino]) {
138 visited[ino] = 1;
168 if (visited[ino])
|
| /src/usr.bin/nbperf/ |
| graph2.h | 79 uint8_t *visited; local
|
| nbperf-bdz.c | 74 uint32_t *visited; member in struct:state
94 if (!state->visited[e->vertices[0]]) {
97 } else if (!state->visited[e->vertices[1]]) {
101 if (state->visited[e->vertices[2]])
107 state->visited[t] = 2 + j;
108 if (state->visited[e->vertices[0]] == 0)
109 state->visited[e->vertices[0]] = 1;
110 if (state->visited[e->vertices[1]] == 0)
111 state->visited[e->vertices[1]] = 1;
112 if (state->visited[e->vertices[2]] == 0
[all...] |
| nbperf-chm.c | 79 uint8_t *visited; member in struct:state
93 if (!state->visited[e->vertices[0]]) {
97 } else if (!state->visited[e->vertices[1]]) {
113 state->visited[v0] = 1;
114 state->visited[v1] = 1;
115 state->visited[v2] = 1;
129 if (!state->visited[e->vertices[0]]) {
140 state->visited[v0] = 1;
141 state->visited[v1] = 1;
274 state.visited = calloc(sizeof(uint8_t), v)
[all...] |
| /src/external/gpl3/gdb.old/dist/gdb/testsuite/gdb.dwarf2/ |
| dw5-rnglist-test.cc | 25 bool visited; member in struct:node
38 new_node->visited = false;
71 if (curr->visited)
75 curr->visited = true;
|
| /src/external/gpl3/gdb/dist/gdb/testsuite/gdb.dwarf2/ |
| dw5-rnglist-test.cc | 25 bool visited; member in struct:node
38 new_node->visited = false;
71 if (curr->visited)
75 curr->visited = true;
|
| /src/sys/external/bsd/compiler_rt/dist/lib/sanitizer_common/ |
| sanitizer_bvgraph.h | 113 &visited = t2; local
115 visited.clear();
116 visited.setBit(from);
119 if (visited.setBit(idx))
122 return targets.intersectsWith(visited);
|
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/ |
| UnreachableCodeChecker.cpp | 9 // path-sensitive analysis. We mark any path visited, and then walk the CFG as a
10 // post-analysis to determine what was never visited.
42 CFGBlocksSet &visited);
51 CFGBlocksSet reachable, visited; local
106 if (!visited.count(CB->getBlockID()))
107 FindUnreachableEntryPoints(CB, reachable, visited);
180 CFGBlocksSet &visited) {
181 visited.insert(CB->getBlockID());
192 if (!visited.count((*I)->getBlockID()))
193 // If we haven't previously visited the unreachable predecessor, recurs
[all...] |
| /src/external/gpl3/gcc/dist/gcc/ |
| gimple-warn-recursion.cc | 63 /* Basic blocks already visited in the current function. */
171 auto_bitmap visited; local
174 m_visited = visited;
|
| hw-doloop.h | 99 /* True if we have visited this loop during the optimization phase. */
100 bool visited; variable
|
| pointer-query.h | 29 bitmap visited; /* Bitmap of visited SSA_NAMEs. */ member in class:ssa_name_limit_t
38 : visited (),
41 /* Set a bit for the PHI in VISITED and return true if it wasn't
44 /* Clear a bit for the PHI in VISITED. */
51 Otherwise add it to VISITED. If the SSA_NAME limit has been
|
| /src/external/gpl3/gcc/dist/libsanitizer/sanitizer_common/ |
| sanitizer_bvgraph.h | 112 &visited = t2; local
114 visited.clear();
115 visited.setBit(from);
118 if (visited.setBit(idx))
121 return targets.intersectsWith(visited);
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| gimple-warn-recursion.cc | 63 /* Basic blocks already visited in the current function. */
171 auto_bitmap visited; local
174 m_visited = visited;
|
| hw-doloop.h | 99 /* True if we have visited this loop during the optimization phase. */
100 bool visited; variable
|
| cfgloopanal.cc | 508 bitmap visited = BITMAP_ALLOC (NULL); local
517 bitmap_set_bit (visited, bb->index);
521 && !bitmap_bit_p (visited, e->dest->index))
527 BITMAP_FREE (visited);
|
| pointer-query.h | 29 bitmap visited; /* Bitmap of visited SSA_NAMEs. */ member in class:ssa_name_limit_t
38 : visited (),
41 /* Set a bit for the PHI in VISITED and return true if it wasn't
44 /* Clear a bit for the PHI in VISITED. */
51 Otherwise add it to VISITED. If the SSA_NAME limit has been
|
| /src/external/gpl3/gcc.old/dist/libsanitizer/sanitizer_common/ |
| sanitizer_bvgraph.h | 112 &visited = t2; local
114 visited.clear();
115 visited.setBit(from);
118 if (visited.setBit(idx))
121 return targets.intersectsWith(visited);
|
| /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| DominanceFrontierImpl.h | 166 SmallPtrSet<BlockT *, 32> visited; local
182 if (visited.insert(currentBB).second) {
200 if (visited.count(childBB) == 0) {
207 // If all children are visited or there is any child then pop this block
|
| /src/external/gpl3/gcc.old/dist/gcc/analyzer/ |
| analyzer.cc | 64 fixup_tree_for_diagnostic_1 (tree expr, hash_set<tree> *visited);
67 VISITED must be non-NULL; it is used to ensure termination. */
71 hash_set<tree> *visited)
94 op = fixup_tree_for_diagnostic_1 (op, visited);
105 op = fixup_tree_for_diagnostic_1 (op, visited);
115 VISITED must be non-NULL; it is used to ensure termination.
121 hash_set<tree> *visited)
124 if (visited->contains (ssa_name))
126 visited->add (ssa_name);
141 (as_a <const gassign *> (def_stmt), visited);
204 hash_set<tree> visited; local
213 hash_set<tree> visited; local
[all...] |
| /src/sys/external/bsd/drm2/dist/drm/amd/display/dc/dml/ |
| amdgpu_display_mode_vba.c | 366 bool visited[DC__NUM_DPP__MAX]; local
370 visited[k] = false;
381 if (visited[j])
383 visited[j] = true;
599 if (src_k->is_hsplit && !visited[k]
621 visited[k] = true;
|
| /src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGPrinter.cpp | 237 bool SelectionDAG::setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet<SDNode *> &visited,
250 unsigned oldSize = visited.size();
251 visited.insert(N);
252 if (visited.size() != oldSize) {
257 hit_limit = setSubgraphColorHelper(*i, Color, visited, level+1, printed) || hit_limit;
271 DenseSet<SDNode *> visited; local
273 if (setSubgraphColorHelper(N, Color, visited, 0, printed)) {
276 setSubgraphColorHelper(N, "blue", visited, 0, printed);
278 setSubgraphColorHelper(N, "green", visited, 0, printed);
|
| /src/external/bsd/unbound/dist/testcode/ |
| lock_verify.c | 83 /** if lock has been visited (all smaller locks have been compared to
86 int visited; member in struct:order_lock
309 /** Detect cycle by comparing visited now with all (unvisited) bigger nodes */
322 * @param visit: the lock visited at this step.
323 * its dfs_next pointer gives the visited lock up in recursion.
338 if(!visit->lock->visited)
348 visit->lock->visited = 1;
355 if(lock->visited) return;
|
| /src/external/gpl3/gcc/dist/gcc/analyzer/ |
| analyzer.cc | 69 fixup_tree_for_diagnostic_1 (tree expr, hash_set<tree> *visited);
72 VISITED must be non-NULL; it is used to ensure termination. */
76 hash_set<tree> *visited)
99 op = fixup_tree_for_diagnostic_1 (op, visited);
110 op = fixup_tree_for_diagnostic_1 (op, visited);
120 VISITED must be non-NULL; it is used to ensure termination.
126 hash_set<tree> *visited)
129 if (visited->contains (ssa_name))
131 visited->add (ssa_name);
146 (as_a <const gassign *> (def_stmt), visited);
209 hash_set<tree> visited; local
218 hash_set<tree> visited; local
[all...] |
| infinite-loop.cc | 412 hash_set<const exploded_node *> visited; local
426 if (visited.contains (iter))
460 visited.add (iter);
550 get_logger ()->log ("visited: %i out of %i",
|
| infinite-recursion.cc | 346 hash_set<exploded_node *> visited; local
348 visited.add (enode);
360 if (visited.contains (iter))
362 visited.add (iter);
|
