Searched refs:visited (Results 1 - 25 of 42) sorted by relevance

12

/openjdk7/corba/src/share/classes/com/sun/corba/se/impl/orbutil/graph/
H A DNodeData.java32 private boolean visited ; field in class:NodeData
42 this.visited = false ;
46 /** Return whether this node has been visited in a traversal.
51 return visited ;
54 void visited() method in class:NodeData
56 visited = true ;
H A DGraphImpl.java114 // Repeat the traversal until every node has been visited. Since
116 // already been visited, this loop always runs at least once.
125 // Visit each node in the graph that has not already been visited.
126 // If any node is visited in this pass, we must run at least one more
134 nd.visited() ;
154 // visited later if necessary.
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/tools/internal/xjc/reader/gbind/
H A DGraph.java69 Set<Element> visited = new HashSet<Element>();
71 visited.clear();
72 if(source.checkCutSet(cc,visited)) {
H A DElement.java133 return prev; // already visited
150 // store visited elements - loop detection
201 * @param visited
202 * Used to keep track of visited nodes.
206 /*package*/ final boolean checkCutSet(ConnectedComponent cc, Set<Element> visited) { argument
214 if(!visited.add(this))
221 if(!next.checkCutSet(cc,visited))
/openjdk7/jdk/src/macosx/native/jobjc/src/generator/java/com/apple/internal/jobjc/generator/
H A DUtils.java64 final Set<String> visited = new HashSet<String>();
70 if(!visited.add(cpath)) return;
134 final Set<Framework> visited = new TreeSet<Framework>();
138 if(!visited.add(fw)) return;
162 void visit(final Framework fw, List<Framework> visited) throws FoundCycle{
163 visited = new LinkedList<Framework>(visited);
164 if(visited.contains(fw)){
165 visited.add(fw);
166 throw new FoundCycle(visited);
[all...]
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/tools/internal/xjc/reader/xmlschema/
H A DRefererFinder.java62 private final Set<Object> visited = new HashSet<Object>(); field in class:RefererFinder
74 if(!visited.add(xss)) return;
82 if(!visited.add(xs)) return;
94 if(!visited.add(e)) return;
101 if(!visited.add(ct)) return;
109 if(!visited.add(decl)) return;
115 if(!visited.add(group)) return;
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DNode.java39 private boolean visited; field in class:Node
45 return visited;
49 visited = b;
H A DHierarchicalLayoutManager.java1117 HashSet<LayoutNode> visited = new HashSet<LayoutNode>();
1121 visited.add(n);
1124 visited.add(n);
1131 if (!visited.contains(e.to)) {
1132 visited.add(e.to);
1342 HashSet<LayoutNode> visited = new HashSet<LayoutNode>();
1345 assert !visited.contains(n);
1347 visited.add(n);
1750 private HashSet<LayoutNode> visited; field in class:HierarchicalLayoutManager.ReverseEdges
1785 visited
[all...]
/openjdk7/jdk/src/solaris/classes/sun/nio/ch/
H A DEventPortWrapper.java83 // bit set to indicate if a file descriptor has been visited when
85 private BitSet visited = new BitSet(); field in class:EventPortWrapper
155 if (!visited.get(fd)) {
170 visited.set(fd);
212 visited.clear(fd);
/openjdk7/jaxws/src/share/jaxws_classes/com/sun/xml/internal/xsom/impl/scd/
H A DAxis.java177 private final Set<XSComponent> visited = new HashSet<XSComponent>();
192 if(visited.add(schema))
199 if(visited.add(decl))
206 if(visited.add(type))
213 if(visited.add(type))
220 if(visited.add(particle))
227 if(visited.add(decl))
234 if(visited.add(group))
241 if(visited.add(decl))
248 if(visited
[all...]
/openjdk7/langtools/src/share/classes/com/sun/tools/doclets/internal/toolkit/resources/
H A Dstylesheet.css12 a:link, a:visited {
86 .bar a, .bar a:link, .bar a:visited, .bar a:active {
167 .topNav a:link, .topNav a:active, .topNav a:visited, .bottomNav a:link, .bottomNav a:active, .bottomNav a:visited {
372 caption a:link, caption a:hover, caption a:active, caption a:visited {
416 td.colOne a:link, td.colOne a:active, td.colOne a:visited, td.colOne a:hover, td.colFirst a:link, td.colFirst a:active, td.colFirst a:visited, td.colFirst a:hover, td.colLast a:link, td.colLast a:active, td.colLast a:visited, td.colLast a:hover, .constantValuesContainer td a:link, .constantValuesContainer td a:active, .constantValuesContainer td a:visited, .constantValuesContainer td a:hover {
/openjdk7/hotspot/src/share/vm/opto/
H A Dgcm.cpp123 void PhaseCFG::schedule_pinned_nodes( VectorSet &visited ) {
129 if( !visited.test_set(n->_idx) ) { // Test node and flag it as visited
204 bool PhaseCFG::schedule_early(VectorSet &visited, Node_List &roots) { argument
209 visited.set(C->top()->_idx);
245 int is_visited = visited.test_set(in->_idx);
248 // assert( !visited.test(in->_idx), "did not schedule early" );
256 } else if (!is_visited) { // Input not yet visited?
353 // Test and set the visited bit.
354 if (mid->raise_LCA_visited() == mark) continue; // already visited
769 Node_Backward_Iterator( Node *root, VectorSet &visited, Node_List &stack, Block_Array &bbs ) argument
849 ComputeLatenciesBackwards(VectorSet &visited, Node_List &stack) argument
1118 schedule_late(VectorSet &visited, Node_List &stack) argument
[all...]
H A Ddomgraph.cpp180 b->_pre_order = pre_order; // Flag as visited
278 if (s->_pre_order == 0) { // Check for no-pre-order, not-visited
387 static int DFS( NTarjan *ntarjan, VectorSet &visited, PhaseIdealLoop *pil, uint *dfsorder );
420 VectorSet visited(Thread::current()->resource_area());
421 int dfsnum = NTarjan::DFS( ntarjan, visited, this, dfsorder);
466 assert( !visited.test(whead->in(i)->_idx),
523 int NTarjan::DFS( NTarjan *ntarjan, VectorSet &visited, PhaseIdealLoop *pil, uint *dfsorder) {
533 if( !visited.test_set(b->_idx) ) { // Test node and flag it as visited
551 if( s->is_CFG() && pil->has_node(s) && !visited
[all...]
H A Dloopnode.cpp1113 uint if_limit = 10; // Max number of dominating if's visited
1549 void IdealLoopTree::allpaths_check_safepts(VectorSet &visited, Node_List &stack) { argument
1552 visited.Clear();
1553 visited.set(_tail->_idx);
1570 if (!visited.test_set(in->_idx) && is_member(_phase->get_loop(in))) {
1632 void IdealLoopTree::check_safepts(VectorSet &visited, Node_List &stack) { argument
1635 if (_child) _child->check_safepts(visited, stack);
1636 if (_next) _next ->check_safepts(visited, stack);
1688 allpaths_check_safepts(visited, stack);
2112 VectorSet visited(
3012 build_loop_early( VectorSet &visited, Node_List &worklist, Node_Stack &nstack ) argument
3376 build_loop_late( VectorSet &visited, Node_List &worklist, Node_Stack &nstack ) argument
3718 rpo( Node *start, Node_Stack &stk, VectorSet &visited, Node_List &rpo_list ) const argument
[all...]
H A Dloopnode.hpp400 void check_safepts(VectorSet &visited, Node_List &stack);
404 void allpaths_check_safepts(VectorSet &visited, Node_List &stack);
508 // Array of pre-order numbers, plus post-visited bit.
509 // ZERO for not pre-visited. EVEN for pre-visited but not post-visited.
510 // ODD for post-visited. Other bits are the pre-order number.
543 // Check for pre-visited. Zero for NOT visited; non-zero for visited
[all...]
H A Dblock.hpp176 // Mark and visited bits for an LCA calculation in insert_anti_dependences.
367 void schedule_pinned_nodes( VectorSet &visited );
421 bool schedule_early(VectorSet &visited, Node_List &roots);
426 void schedule_late(VectorSet &visited, Node_List &stack);
433 void ComputeLatenciesBackwards(VectorSet &visited, Node_List &stack);
465 void _dump_cfg( const Node *end, VectorSet &visited ) const;
H A DidealGraphPrinter.cpp633 VectorSet visited(Thread::current()->resource_area());
636 visited.test_set(start->_idx);
656 if (!visited.test_set(p->_idx)) {
664 if (!visited.test_set(n->in(i)->_idx)) {
H A Dnode.cpp1117 // No Region nodes except loops were visited before and the EntryControl
1123 // Region nodes were visited. Continue walk up to Start or Root
1154 // Was this Region node visited before?
1161 Node* visited = (Node*)(ni & ~1); local
1163 if (visited == sub) {
1168 // The Region node was visited before only once.
1747 void Node::verify_edges(Unique_Node_List &visited) { argument
1753 if (visited.member(this)) return;
1754 visited.push(this);
1783 in(i)->verify_edges(visited);
1854 walk_(NFunc pre, NFunc post, void *env, VectorSet &visited) argument
[all...]
H A Dblock.cpp399 VectorSet visited(a);
418 // If or Goto? (This check should be done for visited nodes also).
425 if (!visited.test_set(x->_idx)) { // Visit this block once
471 } else { // Post-processing visited nodes
858 void PhaseCFG::_dump_cfg( const Node *end, VectorSet &visited ) const {
863 if( visited.test_set(x->_idx) ) return;
874 _dump_cfg(p->in(i),visited);
886 VectorSet visited(_bbs._arena);
887 _dump_cfg(_root,visited);
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/ServerCompiler/src/com/sun/hotspot/igv/servercompiler/
H A DServerCompilerScheduler.java81 Set<Node> visited = new HashSet<Node>();
94 if (!visited.contains(parent)) {
95 visited.add(parent);
359 Set<InputBlock> visited = new HashSet<InputBlock>();
361 visited.add(ba);
366 if (visited.contains(bb)) {
/openjdk7/jdk/src/share/classes/com/sun/tools/hat/internal/model/
H A DSnapshot.java443 Hashtable<JavaHeapObject, JavaHeapObject> visited = new Hashtable<JavaHeapObject, JavaHeapObject>();
446 visited.put(target, target);
461 if (t != null && !visited.containsKey(t)) {
463 visited.put(t, t);
/openjdk7/jdk/test/com/sun/jdi/
H A DReferrersTest.java411 Map<ObjectReference, Object> visited = new HashMap(100); field in class:ReferrersTest
415 visited.clear();
417 if (visited.containsKey(objRef)) {
422 visited.put(objRef, null);
/openjdk7/jdk/src/share/classes/sun/tools/jconsole/
H A DThreadTab.java512 // keep track of which thread is visited
514 boolean[] visited = new boolean[ids.length];
524 // start a new cycle from a non-visited thread
526 if (!visited[j]) {
528 visited[j] = true;
543 if (visited[j]) {
547 visited[j] = true;
/openjdk7/hotspot/src/share/vm/code/
H A DdebugInfo.hpp118 void set_visited(bool visited) { _visited = false; } argument
/openjdk7/jdk/src/share/classes/sun/misc/
H A DURLClassPath.java847 HashSet<String> visited = new HashSet<String>();
848 return getResource(name, check, visited);
853 * visited by linking through the index files. This helper method uses
859 Set<String> visited) {
918 /* Note that the addition of the url to the list of visited
921 boolean visitedURL = !visited.add(URLUtil.urlNoFragString(url));
955 if((res = newLoader.getResource(name, check, visited))
858 getResource(final String name, boolean check, Set<String> visited) argument

Completed in 151 milliseconds

12