| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
| DFAOptimizer.java | 128 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.add(sI)
[all...] |
| MachineProbe.java | 49 Set<DFAState> visited = new HashSet<DFAState>(); local
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);
|
| /external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
| Graph.java | 82 Set<Node> visited = new OrderedHashSet<Node>(); local
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) {
97 if ( visited.contains(n) ) return;
98 visited.add(n);
102 DFS(target, visited, sorted);
|
| /external/llvm/unittests/ADT/ |
| DenseMapTest.cpp | 287 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";
|
| StringMapTest.cpp | 162 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/clang/lib/StaticAnalyzer/Checkers/ |
| UnreachableCodeChecker.cpp | 10 // 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 the unreachable predecessor, recurs
[all...] |
| /external/compiler-rt/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);
|
| /external/linux-tools-perf/perf-3.12.0/tools/perf/tests/ |
| vmlinux-kallsyms.c | 14 bool *visited = symbol__priv(sym); local
15 *visited = true;
|
| /external/llvm/lib/Analysis/ |
| DominanceFrontier.cpp | 46 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/chromium_org/v8/test/cctest/ |
| test-global-handles.cc | 80 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/ |
| CalcSpillWeights.cpp | 103 SmallPtrSet<MachineInstr*, 8> visited; local
121 if (!visited.insert(mi))
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| SelectionDAGPrinter.cpp | 219 bool SelectionDAG::setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet<SDNode *> &visited,
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/openfst/src/include/fst/ |
| prune.h | 131 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[arc.nextstate]) continue
[all...] |
| /dalvik/dx/src/com/android/dx/ssa/ |
| Dominators.java | 121 HashSet<SsaBasicBlock> visited = new HashSet<SsaBasicBlock>(); local
132 if (visited.add(vAncestor) && vabbInfo.ancestor != null) {
|
| /external/chromium_org/chromeos/network/onc/ |
| onc_merger.cc | 91 std::set<std::string> visited; local
100 if (key == ::onc::kRecommended || !visited.insert(key).second)
|
| /external/chromium_org/content/browser/accessibility/ |
| browser_accessibility_cocoa.h | 116 @property(nonatomic, readonly) NSNumber* visited; variable
|
| /external/chromium_org/content/public/test/ |
| test_file_error_injector.cc | 449 static bool visited = false; local
450 DCHECK(!visited); // Only allowed to be called once.
451 visited = true;
|
| /external/chromium_org/sandbox/linux/seccomp-bpf/ |
| codegen.cc | 20 void TraverseRecursively(std::set<sandbox::Instruction*>* visited,
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.begin()
[all...] |
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.h | 138 int visited; member in class:nv50_ir::Graph::Node
196 if (visited == v)
198 visited = v;
204 return visited;
|
| /external/chromium_org/third_party/skia/tests/ |
| PDFPrimitivesTest.cpp | 437 DummyImageFilter(bool visited = false) : SkImageFilter(0, NULL), fVisited(visited) {}
452 bool visited() const { return fVisited; } function in class:__anon20014::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/dexmaker/src/dx/java/com/android/dx/ssa/ |
| Dominators.java | 121 HashSet<SsaBasicBlock> visited = new HashSet<SsaBasicBlock>(); local
132 if (visited.add(vAncestor) && vabbInfo.ancestor != null) {
|
| /external/llvm/lib/Target/NVPTX/ |
| NVPTXUtilities.cpp | 503 void llvm::dumpInstRec(Value *v, std::set<Instruction *> *visited) {
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);
|
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.h | 138 int visited; member in class:nv50_ir::Graph::Node
196 if (visited == v)
198 visited = v;
204 return visited;
|
| /external/chromium_org/chrome/browser/android/ |
| most_visited_sites.cc | 92 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/third_party/WebKit/Source/modules/websockets/ |
| DOMWebSocket.cpp | 330 HashSet<String> visited; local
332 if (!visited.add(protocols[i]).isNewEntry) {
|
