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

/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 ;
/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/jaxws/src/share/jaxws_classes/com/sun/tools/internal/xjc/reader/gbind/
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/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/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/hotspot/src/share/vm/code/
H A DdebugInfo.hpp118 void set_visited(bool visited) { _visited = false; } argument
/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/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
/openjdk7/jaxp/src/com/sun/org/apache/bcel/internal/generic/
H A DMethodGen.java829 if(visited(target))
851 private final boolean visited(InstructionHandle target) { method in class:MethodGen.BranchStack
/openjdk7/hotspot/src/share/vm/c1/
H A Dc1_LIRGenerator.hpp76 bool _visited; // Node already visited?
77 bool _start_node; // Start node already visited?
91 bool visited() const { return _visited; } function in class:ResolveNode
H A Dc1_Instruction.hpp593 visited = 1 << 0, enumerator in enum:Flag
/openjdk7/hotspot/src/share/vm/opto/
H A DphaseX.cpp522 VectorSet visited(Thread::current()->resource_area());
523 dump_nodes_and_types_recur( root, depth, only_ctrl, visited );
527 void PhaseTransform::dump_nodes_and_types_recur( const Node *n, uint depth, bool only_ctrl, VectorSet &visited) { argument
530 if( visited.test_set(n->_idx) ) return;
533 dump_nodes_and_types_recur( n->in(i), depth-1, only_ctrl, visited );
H A Dcfgnode.cpp342 VectorSet visited(a);
347 visited.set(n->_idx);
357 if (!visited.test_set(m->_idx))
831 void PhiNode::verify_adr_type(VectorSet& visited, const TypePtr* at) const { argument
832 if (visited.test_set(_idx)) return; //already visited
847 np->as_Phi()->verify_adr_type(visited, at);
874 VectorSet visited(Thread::current()->resource_area());
875 verify_adr_type(visited, _adr_type);
1563 VectorSet visited(
[all...]
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 Dloopopts.cpp1029 void PhaseIdealLoop::split_if_with_blocks( VectorSet &visited, Node_Stack &nstack ) { argument
1031 visited.set(n->_idx); // first, mark node as visited
1041 if (use->outcnt() != 0 && !visited.test_set(use->_idx)) {
1848 VectorSet visited(a);
1853 visited.set(n->_idx);
1870 assert(!visited.test(n->_idx), "not seen yet");
1871 visited.set(n->_idx);
1881 if (!visited.test_set(use->_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 DloopTransform.cpp825 Node *PhaseIdealLoop::clone_up_backedge_goo( Node *back_ctrl, Node *preheader_ctrl, Node *n, VectorSet &visited, Node_Stack &clones ) { argument
829 if (visited.test_set(n->_idx)) {
849 Node *g = clone_up_backedge_goo( back_ctrl, preheader_ctrl, n->in(i), visited, clones );
973 VectorSet visited(a);
984 visited, clones);
1048 visited.Clear();
1059 visited, clones);
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...]
/openjdk7/hotspot/src/share/vm/prims/
H A DjvmtiTagMap.cpp1646 // ObjectMarker provides the mark and visited functions
1659 static inline bool visited(oop o); // check if object has been visited
1740 inline bool ObjectMarker::visited(oop o) { function in class:ObjectMarker
1897 // if the object hasn't been visited then push it onto the visit stack
1898 // so that it will be visited later
1900 if (!ObjectMarker::visited(obj)) visit_stack()->push(obj);
3205 // first mark the object as visited
3210 // mark object as visited
3211 assert(!ObjectMarker::visited(
[all...]

Completed in 133 milliseconds