/external/swiftshader/third_party/LLVM/unittests/ADT/ |
H A D | 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";
|
H A D | 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/ |
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. 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 th 170 FindUnreachableEntryPoints(const CFGBlock *CB, CFGBlocksSet &reachable, CFGBlocksSet &visited) argument [all...] |
/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/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 | 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/pdfium/core/fpdfapi/page/ |
H A D | cpdf_page.cpp | 110 std::set<CPDF_Dictionary*> visited; local 112 visited.insert(pPageDict); 117 if (!pPageDict || pdfium::ContainsKey(visited, pPageDict))
|
H A D | cpdf_docpagedata.cpp | 222 std::set<CPDF_Object*> visited; local 223 return GetColorSpaceImpl(pCSObj, pResources, &visited);
|
/external/swiftshader/third_party/LLVM/lib/Analysis/ |
H A D | 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
|
/external/swiftshader/third_party/LLVM/lib/CodeGen/ |
H A D | CalcSpillWeights.cpp | 97 SmallPtrSet<MachineInstr*, 8> visited; local 113 if (!visited.insert(mi))
|
/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
|
/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/swiftshader/third_party/LLVM/lib/CodeGen/SelectionDAG/ |
H A D | SelectionDAGPrinter.cpp | 221 bool SelectionDAG::setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet<SDNode *> &visited, argument 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);
|
/external/v8/src/compiler/ |
H A D | control-equivalence.h | 86 bool visited; // Indicates node has already been visited. member in struct:v8::internal::compiler::final::NodeData 111 // \ / - Pre-visit: When N1 is visited in direction D the preferred 114 // | N been visited, we switch the direction and start considering 117 // / \ to D have been visited, we pop N and call VisitPost(N).
|
/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/pdfium/fpdfsdk/ |
H A D | fpdfdoc.cpp | 28 std::set<CPDF_Dictionary*>* visited) { 30 if (pdfium::ContainsKey(*visited, bookmark.GetDict())) 32 visited->insert(bookmark.GetDict()); 42 while (child.GetDict() && !pdfium::ContainsKey(*visited, child.GetDict())) { 44 CPDF_Bookmark found = FindBookmark(tree, child, title, visited); 119 std::set<CPDF_Dictionary*> visited; local 120 return FindBookmark(tree, CPDF_Bookmark(), encodedTitle, &visited).GetDict(); 25 FindBookmark(const CPDF_BookmarkTree& tree, CPDF_Bookmark bookmark, const CFX_WideString& title, std::set<CPDF_Dictionary*>* visited) argument
|
H A D | fsdk_actionhandler.cpp | 24 std::set<CPDF_Dictionary*> visited; local 25 return ExecuteDocumentOpenAction(action, pFormFillEnv, &visited); 65 std::set<CPDF_Dictionary*> visited; local 66 return ExecuteDocumentPageAction(action, eType, pFormFillEnv, &visited); 73 std::set<CPDF_Dictionary*> visited; local 74 return ExecuteDocumentPageAction(action, eType, pFormFillEnv, &visited); 82 std::set<CPDF_Dictionary*> visited; local 83 return ExecuteBookMark(action, pFormFillEnv, pBookMark, &visited); 91 std::set<CPDF_Dictionary*> visited; local 92 return ExecuteScreenAction(action, type, pFormFillEnv, pScreen, &visited); 98 std::set<CPDF_Dictionary*> visited; local 108 std::set<CPDF_Dictionary*> visited; local 113 ExecuteDocumentOpenAction( const CPDF_Action& action, CPDFSDK_FormFillEnvironment* pFormFillEnv, std::set<CPDF_Dictionary*>* visited) argument 144 ExecuteLinkAction( const CPDF_Action& action, CPDFSDK_FormFillEnvironment* pFormFillEnv, std::set<CPDF_Dictionary*>* visited) argument 184 ExecuteDocumentPageAction( const CPDF_Action& action, CPDF_AAction::AActionType type, CPDFSDK_FormFillEnvironment* pFormFillEnv, std::set<CPDF_Dictionary*>* visited) argument 229 ExecuteFieldAction( const CPDF_Action& action, CPDF_AAction::AActionType type, CPDFSDK_FormFillEnvironment* pFormFillEnv, CPDF_FormField* pFormField, PDFSDK_FieldAction& data, std::set<CPDF_Dictionary*>* visited) argument 266 ExecuteScreenAction( const CPDF_Action& action, CPDF_AAction::AActionType type, CPDFSDK_FormFillEnvironment* pFormFillEnv, CPDFSDK_Annot* pScreen, std::set<CPDF_Dictionary*>* visited) argument 306 ExecuteBookMark( const CPDF_Action& action, CPDFSDK_FormFillEnvironment* pFormFillEnv, CPDF_Bookmark* pBookmark, std::set<CPDF_Dictionary*>* visited) argument [all...] |