/external/swiftshader/third_party/LLVM/unittests/ADT/ |
DenseMapTest.cpp | 147 bool visited[100]; local 151 visited[i] = false; 158 visited[it->first] = true; 161 // Ensure every number was visited. 163 ASSERT_TRUE(visited[i]) << "Entry #" << i << " was never visited";
|
StringMapTest.cpp | 145 bool visited[100]; local 152 visited[i] = false; 161 visited[it->second] = true; 164 // Ensure every number was visited. 166 ASSERT_TRUE(visited[i]) << "Entry #" << i << " was never visited";
|
/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/guava/guava/src/com/google/common/reflect/ |
TypeVisitor.java | 53 * <p>One {@code Type} is visited at most once. The second time the same type is visited, it's 63 private final Set<Type> visited = Sets.newHashSet(); field in class:TypeVisitor 71 if (type == null || !visited.add(type)) { 72 // null owner type, or already visited; 93 visited.remove(type);
|
/art/compiler/optimizing/ |
licm.cc | 85 ArenaBitVector* visited = nullptr; local 87 visited = new (graph_->GetArena()) ArenaBitVector(graph_->GetArena(), 108 // Thanks to post order visit, inner loops were already visited. 109 DCHECK(visited->IsBitSet(inner->GetBlockId())); 113 visited->SetBit(inner->GetBlockId());
|
/art/runtime/ |
handle_scope_test.cc | 81 visited.insert(ref); 86 std::set<StackReference<mirror::Object>*> visited; member in class:art::CollectVisitor 115 EXPECT_LE(visitor.visited.size(), base->NumberOfReferences()); 117 for (StackReference<mirror::Object>* ref : visitor.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. 43 CFGBlocksSet &visited); 52 CFGBlocksSet reachable, visited; local 107 if (!visited.count(CB->getBlockID())) 108 FindUnreachableEntryPoints(CB, reachable, visited); 172 CFGBlocksSet &visited) { 173 visited.insert(CB->getBlockID()); 184 if (!visited.count((*I)->getBlockID())) 185 // 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/pdfium/core/fpdfapi/page/ |
cpdf_page.cpp | 110 std::set<CPDF_Dictionary*> visited; local 112 visited.insert(pPageDict); 117 if (!pPageDict || pdfium::ContainsKey(visited, pPageDict))
|
/external/swiftshader/third_party/LLVM/lib/Analysis/ |
DominanceFrontier.cpp | 45 SmallPtrSet<BasicBlock *, 32> visited; local 61 if (visited.count(currentBB) == 0) { 62 visited.insert(currentBB); 81 if (visited.count(childBB) == 0) { 88 // If all children are visited or there is any child then pop this block
|
/frameworks/base/sax/java/android/sax/ |
Element.java | 40 boolean visited; field in class:Element 180 requiredChildren.get(i).visited = false; 193 if (!child.visited) {
|
/packages/providers/ContactsProvider/src/com/android/providers/contacts/aggregation/util/ |
ContactAggregatorHelper.java | 97 Set<Long> visited = new HashSet<>(); local 99 if (!visited.contains(id)) { 101 findConnectedComponentForRawContact(matchingRawIdPairs, visited, id, set); 109 Set<Long> visited, Long rawContactId, Set<Long> results) { 110 visited.add(rawContactId); 113 if (!visited.contains(match)) { 114 findConnectedComponentForRawContact(connections, visited, match, results);
|
/external/llvm/include/llvm/Analysis/ |
DominanceFrontierImpl.h | 159 SmallPtrSet<BlockT *, 32> visited; local 175 if (visited.insert(currentBB).second) { 195 if (visited.count(childBB) == 0) { 202 // If all children are visited or there is any child then pop this block
|
/external/llvm/lib/CodeGen/ |
CalcSpillWeights.cpp | 139 SmallPtrSet<MachineInstr*, 8> visited; local 158 if (!visited.insert(mi).second)
|
/external/llvm/unittests/ADT/ |
DenseMapTest.cpp | 309 bool visited[100]; local 314 visited[i] = false; 323 visited[visitedIndex[it->first]] = true; 325 // Ensure every number was visited. 327 ASSERT_TRUE(visited[i]) << "Entry #" << i << " was never visited";
|
StringMapTest.cpp | 190 bool visited[100]; local 197 visited[i] = false; 206 visited[it->second] = true; 209 // Ensure every number was visited. 211 ASSERT_TRUE(visited[i]) << "Entry #" << i << " was never visited";
|
/external/swiftshader/third_party/LLVM/lib/CodeGen/ |
CalcSpillWeights.cpp | 97 SmallPtrSet<MachineInstr*, 8> visited; local 113 if (!visited.insert(mi))
|
/external/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
SelectionDAGPrinter.cpp | 221 bool SelectionDAG::setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet<SDNode *> &visited, 234 unsigned oldSize = visited.size(); 235 visited.insert(N); 236 if (visited.size() != oldSize) { 241 hit_limit = setSubgraphColorHelper(*i, Color, visited, level+1, printed) || hit_limit; 255 DenseSet<SDNode *> visited; local 257 if (setSubgraphColorHelper(N, Color, visited, 0, printed)) { 260 setSubgraphColorHelper(N, "blue", visited, 0, printed); 262 setSubgraphColorHelper(N, "green", visited, 0, printed);
|
/development/tools/bugreport/src/com/android/bugreport/html/ |
Renderer.java | 158 final HashMap<Integer,HashSet<Integer>> visited = new HashMap<Integer,HashSet<Integer>>(); local 175 visited.put(offendingProcess.pid, visitedThreads); 179 final ArrayList<ProcessSnapshot> deadlockedProcesses = cloneAndFilter(visited, 189 final ArrayList<ProcessSnapshot> interestingProcesses = cloneAndFilter(visited, 201 * visited list (probably from previous sections on the current page). 205 private ArrayList<ProcessSnapshot> cloneAndFilter(HashMap<Integer,HashSet<Integer>> visited, 210 HashSet<Integer> visitedThreads = visited.get(process.pid); 213 visited.put(process.pid, visitedThreads);
|
/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/icu/android_icu4j/src/main/java/android/icu/impl/ |
ICUCurrencyDisplayInfoProvider.java | 292 Set<String> visited = new HashSet<String>(); local 302 if (!visited.contains(isoCode)) { 303 visited.add(isoCode);
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
SelectionDAGPrinter.cpp | 226 bool SelectionDAG::setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet<SDNode *> &visited, 239 unsigned oldSize = visited.size(); 240 visited.insert(N); 241 if (visited.size() != oldSize) { 246 hit_limit = setSubgraphColorHelper(*i, Color, visited, level+1, printed) || hit_limit; 260 DenseSet<SDNode *> visited; local 262 if (setSubgraphColorHelper(N, Color, visited, 0, printed)) { 265 setSubgraphColorHelper(N, "blue", visited, 0, printed); 267 setSubgraphColorHelper(N, "green", visited, 0, printed);
|
/external/llvm/lib/Target/NVPTX/ |
NVPTXUtilities.cpp | 402 void llvm::dumpInstRec(Value *v, std::set<Instruction *> *visited) { 405 if (visited->find(I) != visited->end()) 408 visited->insert(I); 411 dumpInstRec(I->getOperand(i), visited); 419 std::set<Instruction *> visited; local 423 dumpInstRec(v, &visited);
|