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

12

/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
108 if (!visited.count(CB->getBlockID()))
109 FindUnreachableEntryPoints(CB, reachable, visited);
173 CFGBlocksSet &visited) {
174 visited.insert(CB->getBlockID());
182 if (!visited.count((*I)->getBlockID()))
183 // If we haven't previously visited th
171 FindUnreachableEntryPoints(const CFGBlock *CB, CFGBlocksSet &reachable, CFGBlocksSet &visited) argument
[all...]
/external/llvm/unittests/ADT/
H A DDenseMapTest.cpp259 bool visited[100]; local
264 visited[i] = false;
273 visited[visitedIndex[it->first]] = true;
275 // Ensure every number was visited.
277 ASSERT_TRUE(visited[i]) << "Entry #" << i << " was never visited";
H A DStringMapTest.cpp161 bool visited[100]; local
168 visited[i] = false;
177 visited[it->second] = true;
180 // Ensure every number was visited.
182 ASSERT_TRUE(visited[i]) << "Entry #" << i << " was never visited";
/external/jmonkeyengine/engine/src/tools/jme3tools/converters/model/strip/
H A DStripInfo.java45 boolean visited; field in class:StripInfo
55 visited = false;
/external/llvm/lib/Analysis/
H A DDominanceFrontier.cpp47 SmallPtrSet<BasicBlock *, 32> visited; local
63 if (visited.count(currentBB) == 0) {
64 visited.insert(currentBB);
83 if (visited.count(childBB) == 0) {
90 // If all children are visited or there is any child then pop this block
H A DRegionInfo.cpp221 void Region::verifyWalk(BasicBlock *BB, std::set<BasicBlock*> *visited) const {
224 visited->insert(BB);
229 if (*SI != exit && visited->find(*SI) == visited->end())
230 verifyWalk(*SI, visited);
238 std::set<BasicBlock*> visited;
239 verifyWalk(getEntry(), &visited); local
/external/linux-tools-perf/
H A Dbuiltin-test.c20 bool *visited = symbol__priv(sym); local
21 *visited = true;
/external/llvm/lib/CodeGen/
H A DCalcSpillWeights.cpp118 SmallPtrSet<MachineInstr*, 8> visited; local
134 if (!visited.insert(mi))
/external/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGPrinter.cpp218 bool SelectionDAG::setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet<SDNode *> &visited, argument
231 unsigned oldSize = visited.size();
232 visited.insert(N);
233 if (visited.size() != oldSize) {
238 hit_limit = setSubgraphColorHelper(*i, Color, visited, level+1, printed) || hit_limit;
252 DenseSet<SDNode *> visited; local
254 if (setSubgraphColorHelper(N, Color, visited, 0, printed)) {
257 setSubgraphColorHelper(N, "blue", visited, 0, printed);
259 setSubgraphColorHelper(N, "green", visited, 0, printed);
/external/llvm/unittests/Support/
H A DPath.cpp248 v_t visited; local
259 visited.push_back(path::filename(i->path()));
261 v_t::const_iterator a0 = std::find(visited.begin(), visited.end(), "a0");
262 v_t::const_iterator aa1 = std::find(visited.begin(), visited.end(), "aa1");
263 v_t::const_iterator ab1 = std::find(visited.begin(), visited.end(), "ab1");
264 v_t::const_iterator dontlookhere = std::find(visited.begin(), visited
[all...]
/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/llvm/lib/Target/NVPTX/
H A DNVPTXUtilities.cpp474 void llvm::dumpInstRec(Value *v, std::set<Instruction *> *visited) { argument
477 if (visited->find(I) != visited->end())
480 visited->insert(I);
483 dumpInstRec(I->getOperand(i), visited);
491 std::set<Instruction *> visited; local
495 dumpInstRec(v, &visited);
/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/antlr/antlr-3.4/runtime/C/include/
H A Dantlr3collections.h427 * 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 DProgramState.h780 VisitedItems visited; member in class:clang::ento::ScanReachableSymbols
/external/webkit/Source/WebCore/history/
H A DHistoryItem.cpp376 void HistoryItem::visited(const String& title, double time, VisitCountBehavior visitCountBehavior) function in class:WebCore::HistoryItem
/external/chromium/net/disk_cache/
H A Dbackend_impl.cc1578 std::set<CacheAddr> visited; local
1585 if (visited.find(address.value()) != visited.end()) {
1592 visited.insert(address.value());
1631 visited.clear();
/external/v8/src/
H A Dhydrogen-instructions.cc2006 BitVector* visited) {
2007 visited->Add(id());
2023 HValue* HChange::EnsureAndPropagateNotMinusZero(BitVector* visited) { argument
2024 visited->Add(id());
2036 BitVector* visited) {
2037 visited->Add(id());
2042 HValue* HMod::EnsureAndPropagateNotMinusZero(BitVector* visited) { argument
2043 visited->Add(id());
2052 HValue* HDiv::EnsureAndPropagateNotMinusZero(BitVector* visited) { argument
2053 visited
2005 EnsureAndPropagateNotMinusZero( BitVector* visited) argument
2035 EnsureAndPropagateNotMinusZero( BitVector* visited) argument
2061 EnsureAndPropagateNotMinusZero(BitVector* visited) argument
2070 EnsureAndPropagateNotMinusZero(BitVector* visited) argument
2081 EnsureAndPropagateNotMinusZero(BitVector* visited) argument
[all...]
H A Djsregexp.h478 visited(false) { }
527 bool visited: 1; member in struct:v8::internal::NodeInfo
/external/chromium/chrome/browser/automation/
H A Dautomation_provider_observers.cc1990 const history::MostVisitedURL& visited = visited_list[i]; local
1991 if (visited.url.spec().empty())
1992 break; // This is the signal that there are no more real visited sites.
1994 dict->SetString("url", visited.url.spec());
1995 dict->SetString("title", visited.title);
1996 dict->SetBoolean("is_pinned", top_sites_->IsURLPinned(visited.url));
/external/valgrind/main/helgrind/
H A Dhg_main.c3593 WordFM* visited; /* Lock* -> void, iow, Set(Lock*) */ local
3607 visited = VG_(newFM)( HG_(zalloc), "hg.lddft.2", HG_(free), NULL/*unboxedcmp*/ );
3622 if (VG_(lookupFM)( visited, NULL, NULL, (Word)here ))
3625 VG_(addToFM)( visited, (Word)here, 0 );
3633 VG_(deleteFM)( visited, NULL, NULL );
/external/clang/lib/Sema/
H A DSemaLookup.cpp95 llvm::SmallPtrSet<DeclContext*, 8> visited; member in class:__anon223::UnqualUsingDirectiveSet
129 // A given context is only every visited once, so it is important
130 // that contexts be visited from the inside out in order to get
133 if (!visited.insert(DC))
144 if (!visited.insert(NS))
161 if (visited.insert(NS)) {
2746 /// \brief The declaration contexts we have already visited.
2752 /// \brief Determine whether we have already visited this context

Completed in 594 milliseconds

12