/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/analysis/ |
H A D | 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 [all...] |
H A D | MachineProbe.java | 49 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/guava/guava/src/com/google/common/reflect/ |
H A D | 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);
|
/external/antlr/antlr-3.4/tool/src/main/java/org/antlr/misc/ |
H A D | Graph.java | 82 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 D | 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 th 174 FindUnreachableEntryPoints(const CFGBlock *CB, CFGBlocksSet &reachable, CFGBlocksSet &visited) argument [all...] |
/external/llvm/unittests/ADT/ |
H A D | 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";
|
H A D | 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/compiler-rt/lib/sanitizer_common/ |
H A D | sanitizer_bvgraph.h | 113 &visited = t2; local 115 visited.clear(); 116 visited.setBit(from); 119 if (visited.setBit(idx)) 122 return targets.intersectsWith(visited);
|
H A D | sanitizer_deadlock_detector2.cc | 61 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/include/llvm/Analysis/ |
H A D | 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
|
H A D | RegionInfoImpl.h | 263 void RegionBase<Tr>::verifyWalk(BlockT *BB, std::set<BlockT *> *visited) const { 266 visited->insert(BB); 273 if (*SI != exit && visited->find(*SI) == visited->end()) 274 verifyWalk(*SI, visited); 286 std::set<BlockT *> visited; 287 verifyWalk(getEntry(), &visited); local
|
/external/llvm/lib/CodeGen/ |
H A D | CalcSpillWeights.cpp | 139 SmallPtrSet<MachineInstr*, 8> visited; local 158 if (!visited.insert(mi).second)
|
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | SelectionDAGPrinter.cpp | 226 bool SelectionDAG::setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet<SDNode *> &visited, argument 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/mesa3d/src/gallium/drivers/nv50/codegen/ |
H A D | 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/v8/src/compiler/ |
H A D | control-equivalence.h | 83 bool visited; // Indicates node has already been visited. member in struct:v8::internal::compiler::final::NodeData 108 // \ / - Pre-visit: When N1 is visited in direction D the preferred 111 // | N been visited, we switch the direction and start considering 114 // / \ to D have been visited, we pop N and call VisitPost(N).
|
/external/v8/test/cctest/ |
H A D | test-global-handles.cc | 80 visited.Add(*o); 83 List<Object*> visited; member in class:TestObjectVisitor 130 // Nothing was visited. 131 CHECK(visitor.visited.length() == 0); 139 // The first grough should still be visited, since only one object is 154 // The first group was visited. 155 CHECK(visitor.visited.length() == 2); 156 CHECK(visitor.visited.Contains(*g1s1.location())); 157 CHECK(visitor.visited.Contains(*g1s2.location())); 173 // The second group was visited [all...] |
/external/valgrind/coregrind/ |
H A D | m_sparsewa.c | 376 LevelN* visited[_3_or_7]; local 390 visited[nVisited] = levelN; 418 vg_assert(visited[nVisited]->child[ visitedIx[nVisited] ]); 419 visited[nVisited]->child[ visitedIx[nVisited] ] = NULL; 420 visited[nVisited]->nInUse--; 421 vg_assert(visited[nVisited]->nInUse >= 0); 422 if (visited[nVisited]->nInUse > 0) 424 swa->dealloc(visited[nVisited]);
|
/external/llvm/lib/Target/NVPTX/ |
H A D | NVPTXUtilities.cpp | 402 void llvm::dumpInstRec(Value *v, std::set<Instruction *> *visited) { argument 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);
|
/external/skia/src/pathops/ |
H A D | SkOpSegment.h | 389 bool visited() { function in class:SkOpSegment
|
/external/skia/tests/ |
H A D | PDFPrimitivesTest.cpp | 367 DummyImageFilter(bool visited = false) : SkImageFilter(0, nullptr), fVisited(visited) {} 378 bool visited() const { return fVisited; } function in class:__anon17074::DummyImageFilter 386 bool visited = buffer.readBool(); local 387 return new DummyImageFilter(visited); 409 REPORTER_ASSERT(reporter, !filter->visited()); 415 // Filter was used in rendering; should be visited. 416 REPORTER_ASSERT(reporter, filter->visited());
|
/external/antlr/antlr-3.4/runtime/C/include/ |
H A D | antlr3collections.h | 427 * visited in the stack, then it means there wasa cycle such as 9->8->1->9 457 * The set of visited nodes as determined by a set entry in 460 pANTLR3_BITSET visited; member in struct:ANTLR3_TOPO_struct
|
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | ProgramState.h | 249 // visited. 835 VisitedItems visited; member in class:clang::ento::ScanReachableSymbols
|
/external/llvm/unittests/Support/ |
H A D | Path.cpp | 666 v_t visited; local 677 visited.push_back(path::filename(i->path())); 679 v_t::const_iterator a0 = std::find(visited.begin(), visited.end(), "a0"); 680 v_t::const_iterator aa1 = std::find(visited.begin(), visited.end(), "aa1"); 681 v_t::const_iterator ab1 = std::find(visited.begin(), visited.end(), "ab1"); 682 v_t::const_iterator dontlookhere = std::find(visited.begin(), visited [all...] |
/external/clang/lib/Sema/ |
H A D | SemaLookup.cpp | 100 llvm::SmallPtrSet<DeclContext*, 8> visited; member in class:__anon1371::UnqualUsingDirectiveSet 131 // A given context is only every visited once, so it is important 132 // that contexts be visited from the inside out in order to get 135 if (!visited.insert(DC).second) 146 if (!visited.insert(NS).second) 161 if (visited.insert(NS).second) { 3260 /// \brief The declaration contexts we have already visited. 3266 /// \brief Determine whether we have already visited this context
|
/external/pdfium/core/src/fpdfapi/fpdf_parser/ |
H A D | fpdf_parser_objects.cpp | 240 std::set<FX_DWORD> visited; local 241 return CloneInternal(bDirect, &visited); 244 std::set<FX_DWORD>* visited) const { 265 pCopy->m_Objects.Add(value->CloneInternal(bDirect, visited)); 274 it.first, it.second->CloneInternal(bDirect, visited))); 288 pDict = ToDictionary(pDict->CloneInternal(bDirect, visited)); 295 if (bDirect && !pdfium::ContainsKey(*visited, obj_num)) { 296 visited->insert(obj_num); 298 return pDirect ? pDirect->CloneInternal(TRUE, visited) : nullptr;
|