HomeSort by relevance Sort by last modified time
    Searched refs:visited (Results 1 - 25 of 147) sorted by null

1 2 3 4 5 6

  /dalvik/vm/analysis/
VfyBasicBlock.h 48 bool visited; /* block has been visited at least once */ member in struct:VfyBasicBlock
  /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/Support/
Path.cpp 248 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.end()
    [all...]
  /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);
  /sdk/sdkmanager/libs/sdklib/src/com/android/sdklib/internal/repository/
LocalSdkParser.java 144 HashSet<File> visited = new HashSet<File>(); local
156 visited.add(dir);
166 visited.add(dir);
176 visited.add(dir);
207 visited.add(samplesDir);
228 visited.add(siDir);
240 visited.add(new File(target.getLocation()));
247 scanMissingSystemImages(sdkManager, visited, packages, monitor);
251 scanMissingAddons(sdkManager, visited, packages, monitor);
255 scanMissingSamples(sdkManager, visited, packages, monitor)
294 scanExtrasDirectory(vendor.getAbsolutePath(), visited, packages, log); local
    [all...]
  /external/chromium/chrome/browser/resources/ntp4/
most_visited_page.css 6 .most-visited {
10 .most-visited {
17 .most-visited:focus {
74 .most-visited:focus .edit-bar,
75 .most-visited:hover .edit-bar {
79 .most-visited:hover .edit-bar {
137 .most-visited .title {
188 .most-visited:focus:not(.filler) .thumbnail-wrapper,
189 .most-visited:hover .thumbnail-wrapper {
195 .most-visited:hover .thumbnail-wrapper
    [all...]
recently_closed.css 48 .recent-menu-item:visited,
  /cts/tools/signature-tools/templates/
Styles.st 8 a.default:visited {color: blue; text-decoration: none}
12 a.discreet:visited {color: black; text-decoration: none}
  /external/clang/lib/Analysis/
CFGReachabilityAnalysis.cpp 44 llvm::BitVector visited(analyzed.size());
58 if (visited[block->getBlockID()])
60 visited[block->getBlockID()] = true;
  /external/llvm/lib/CodeGen/SelectionDAG/
SelectionDAGPrinter.cpp 218 bool SelectionDAG::setSubgraphColorHelper(SDNode *N, const char *Color, DenseSet<SDNode *> &visited,
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/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
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 the unreachable predecessor, recurs
    [all...]
  /external/clang/www/
menu.css 37 #menu a:visited {
  /external/compiler-rt/www/
menu.css 37 #menu a:visited {
  /frameworks/compile/libbcc/runtime/www/
menu.css 37 #menu a:visited {
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/descriptors/
ElementDescriptor.java 401 Set<ElementDescriptor> visited) {
402 if (recursive && visited == null) {
403 visited = new HashSet<ElementDescriptor>();
412 if (visited != null) {
413 visited.add(this);
418 if (visited != null) {
419 if (!visited.add(e)) { // Set.add() returns false if element is already present
424 recursive, visited);
  /frameworks/base/sax/java/android/sax/
Element.java 42 boolean visited; field in class:Element
182 requiredChildren.get(i).visited = false;
195 if (!child.visited) {
  /external/llvm/lib/Analysis/
DominanceFrontier.cpp 47 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
  /external/valgrind/main/docs/lib/
vg_basic.css 2 a, a:link, a:visited, a:active { color: #74240f; }
20 code a, code a:link, code a:visited, code a:active, code a:hover {
  /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...]
  /external/chromium/chrome/browser/resources/ntp/
most_visited.css 1 /* Most Visited */
3 #most-visited-maxiview {
238 #most-visited-maxiview {
257 #most-visited-settings {
272 html[dir=rtl] #most-visited-settings {
277 #most-visited:not(.collapsed) #most-visited-settings.has-blacklist {
  /sdk/common/src/com/android/utils/
XmlUtils.java 88 HashSet<String> visited = new HashSet<String>(); local
116 visited.add(nsPrefix);
130 // visited above. Pick a unique prefix from the provided default prefix.
133 for (int i = 1; visited.contains(prefix); i++) {
  /external/valgrind/main/coregrind/
m_sparsewa.c 377 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/eclipse-windowbuilder/propertysheet/src/org/eclipse/wb/internal/core/model/property/table/
Tooltip.css 27 a:visited { text-decoration: underline; }
29 a.header:visited { text-decoration: none; color: InfoText }
  /external/llvm/unittests/ADT/
StringMapTest.cpp 161 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";

Completed in 1064 milliseconds

1 2 3 4 5 6