Searched defs:visited (Results 1 - 25 of 59) sorted by relevance

123

/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/
H A DDFAOptimizer.java128 protected Set visited = new HashSet(); field in class:DFAOptimizer
157 visited.clear();
172 visited.clear();
177 visited.clear();
186 if ( visited.contains(sI) ) {
187 return; // already visited
189 visited.add(sI);
216 if ( visited.contains(sI) ) {
217 return; // already visited
219 visited
[all...]
H A DMachineProbe.java49 Set<DFAState> visited = new HashSet<DFAState>();
50 return getAnyDFAPathToTarget(dfa.startState, targetState, visited);
54 DFAState targetState, Set<DFAState> visited) {
56 visited.add(startState);
65 if (!visited.contains(e.target)) {
67 (DFAState) e.target, targetState, visited);
53 getAnyDFAPathToTarget(DFAState startState, DFAState targetState, Set<DFAState> visited) argument
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/
H A DGraph.java82 Set<Node> visited = new OrderedHashSet<Node>();
84 while ( visited.size() < nodes.size() ) {
89 if ( !visited.contains(n) ) break;
91 DFS(n, visited, sorted);
96 public void DFS(Node n, Set<Node> visited, ArrayList<Object> sorted) { argument
97 if ( visited.contains(n) ) return;
98 visited.add(n);
102 DFS(target, visited, sorted);
/external/clang/lib/StaticAnalyzer/Checkers/
H A DUnreachableCodeChecker.cpp10 // path-sensitive analysis. We mark any path visited, and then walk the CFG as a
11 // post-analysis to determine what was never visited.
47 CFGBlocksSet &visited);
56 CFGBlocksSet reachable, visited; local
111 if (!visited.count(CB->getBlockID()))
112 FindUnreachableEntryPoints(CB, reachable, visited);
176 CFGBlocksSet &visited) {
177 visited.insert(CB->getBlockID());
188 if (!visited.count((*I)->getBlockID()))
189 // If we haven't previously visited th
174 FindUnreachableEntryPoints(const CFGBlock *CB, CFGBlocksSet &reachable, CFGBlocksSet &visited) argument
[all...]
/external/linux-tools-perf/perf-3.12.0/tools/perf/tests/
H A Dvmlinux-kallsyms.c14 bool *visited = symbol__priv(sym); local
15 *visited = true;
/external/llvm/unittests/ADT/
H A DDenseMapTest.cpp287 bool visited[100]; local
292 visited[i] = false;
301 visited[visitedIndex[it->first]] = true;
303 // Ensure every number was visited.
305 ASSERT_TRUE(visited[i]) << "Entry #" << i << " was never visited";
H A DStringMapTest.cpp162 bool visited[100]; local
169 visited[i] = false;
178 visited[it->second] = true;
181 // Ensure every number was visited.
183 ASSERT_TRUE(visited[i]) << "Entry #" << i << " was never visited";
/external/compiler-rt/lib/sanitizer_common/
H A Dsanitizer_bvgraph.h113 &visited = t2; local
115 visited.clear();
116 visited.setBit(from);
119 if (visited.setBit(idx))
122 return targets.intersectsWith(visited);
H A Dsanitizer_deadlock_detector2.cc61 bool visited[kMaxMutex]; member in struct:__sanitizer::DDPhysicalThread
365 internal_memset(pt->visited, 0, sizeof(pt->visited));
380 if (pt->visited[link.id])
386 pt->visited[link.id] = true;
/external/llvm/lib/Analysis/
H A DDominanceFrontier.cpp46 SmallPtrSet<BasicBlock *, 32> visited; local
62 if (visited.count(currentBB) == 0) {
63 visited.insert(currentBB);
82 if (visited.count(childBB) == 0) {
89 // If all children are visited or there is any child then pop this block
/external/llvm/lib/CodeGen/
H A DCalcSpillWeights.cpp103 SmallPtrSet<MachineInstr*, 8> visited; local
121 if (!visited.insert(mi))
/external/chromium_org/content/browser/accessibility/
H A Dbrowser_accessibility_cocoa.h116 @property(nonatomic, readonly) NSNumber* visited; variable
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_graph.h138 int visited; member in class:nv50_ir::Graph::Node
196 if (visited == v)
198 visited = v;
204 return visited;
/external/chromium_org/v8/src/compiler/
H A Dgeneric-algorithm.h48 BoolVector visited(Traits::max_id(graph), false, zone);
55 bool visit = !GetVisited(&visited, id);
59 if (!IsReenter(control)) SetVisited(&visited, id, true);
71 SetVisited(&visited, post_order_node->id(), !IsReenter(control));
85 if (!GetVisited(&visited, current->id())) break;
115 static void SetVisited(BoolVector* visited, int id, bool value) { argument
116 if (id >= static_cast<int>(visited->size())) {
118 visited->resize((3 * id) / 2, false);
120 visited->at(id) = value;
123 static bool GetVisited(BoolVector* visited, in argument
[all...]
/external/chromium_org/v8/test/cctest/
H A Dtest-global-handles.cc80 visited.Add(*o);
83 List<Object*> visited; member in class:TestObjectVisitor
130 // Nothing was visited.
131 DCHECK(visitor.visited.length() == 0);
139 // The first grough should still be visited, since only one object is
154 // The first group was visited.
155 DCHECK(visitor.visited.length() == 2);
156 DCHECK(visitor.visited.Contains(*g1s1.location()));
157 DCHECK(visitor.visited.Contains(*g1s2.location()));
173 // The second group was visited
[all...]
/external/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGPrinter.cpp219 bool SelectionDAG::setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet<SDNode *> &visited, argument
232 unsigned oldSize = visited.size();
233 visited.insert(N);
234 if (visited.size() != oldSize) {
239 hit_limit = setSubgraphColorHelper(*i, Color, visited, level+1, printed) || hit_limit;
253 DenseSet<SDNode *> visited; local
255 if (setSubgraphColorHelper(N, Color, visited, 0, printed)) {
258 setSubgraphColorHelper(N, "blue", visited, 0, printed);
260 setSubgraphColorHelper(N, "green", visited, 0, printed);
/external/mesa3d/src/gallium/drivers/nv50/codegen/
H A Dnv50_ir_graph.h138 int visited; member in class:nv50_ir::Graph::Node
196 if (visited == v)
198 visited = v;
204 return visited;
/external/openfst/src/include/fst/
H A Dprune.h131 vector<bool> visited(ns, false);
150 visited[s] = true;
169 if (visited[arc.nextstate]) continue;
181 for (size_t i = 0; i < visited.size(); ++i)
182 if (!visited[i]) dead.push_back(i);
254 vector<bool> visited; local
268 visited.push_back(false);
276 visited[s] = true;
305 visited.push_back(false);
307 if (visited[ar
[all...]
/external/valgrind/main/coregrind/
H A Dm_sparsewa.c377 LevelN* visited[_3_or_7]; local
391 visited[nVisited] = levelN;
420 vg_assert(visited[nVisited]->child[ visitedIx[nVisited] ]);
421 visited[nVisited]->child[ visitedIx[nVisited] ] = NULL;
422 visited[nVisited]->nInUse--;
423 vg_assert(visited[nVisited]->nInUse >= 0);
424 if (visited[nVisited]->nInUse > 0)
426 swa->dealloc(visited[nVisited]);
/external/chromium_org/chrome/browser/android/
H A Dmost_visited_sites.cc92 const history::MostVisitedURL& visited = visited_list[i]; local
94 if (visited.url.is_empty())
95 break; // This is the signal that there are no more real visited sites.
97 titles->push_back(visited.title);
98 urls->push_back(visited.url.spec());
/external/chromium_org/chromeos/network/onc/
H A Donc_merger.cc91 std::set<std::string> visited; local
100 if (key == ::onc::kRecommended || !visited.insert(key).second)
/external/chromium_org/content/public/test/
H A Dtest_file_error_injector.cc449 static bool visited = false; local
450 DCHECK(!visited); // Only allowed to be called once.
451 visited = true;
/external/chromium_org/sandbox/linux/seccomp-bpf/
H A Dcodegen.cc20 void TraverseRecursively(std::set<sandbox::Instruction*>* visited, argument
22 if (visited->find(instruction) == visited->end()) {
23 visited->insert(instruction);
27 TraverseRecursively(visited, instruction->jf_ptr);
29 TraverseRecursively(visited, instruction->jt_ptr);
34 TraverseRecursively(visited, instruction->next);
195 std::set<Instruction*> visited; local
196 TraverseRecursively(&visited, instruction);
197 for (std::set<Instruction*>::const_iterator iter = visited
[all...]
/external/chromium_org/third_party/skia/tests/
H A DPDFPrimitivesTest.cpp437 DummyImageFilter(bool visited = false) : SkImageFilter(0, NULL), fVisited(visited) {}
452 bool visited() const { return fVisited; } function in class:__anon15396::DummyImageFilter
460 bool visited = buffer.readBool(); local
461 return SkNEW_ARGS(DummyImageFilter, (visited));
475 REPORTER_ASSERT(reporter, !filter->visited());
480 // Filter was used in rendering; should be visited.
481 REPORTER_ASSERT(reporter, filter->visited());
/external/llvm/lib/Target/NVPTX/
H A DNVPTXUtilities.cpp503 void llvm::dumpInstRec(Value *v, std::set<Instruction *> *visited) { argument
506 if (visited->find(I) != visited->end())
509 visited->insert(I);
512 dumpInstRec(I->getOperand(i), visited);
520 std::set<Instruction *> visited; local
524 dumpInstRec(v, &visited);

Completed in 702 milliseconds

123