Searched refs:succ (Results 1 - 22 of 22) sorted by relevance

/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Filter/src/com/sun/hotspot/igv/filter/
H A DCombineFilter.java68 Figure succ = successors.get(0);
71 for (InputSlot s : succ.getInputSlots()) {
103 for (Figure succ : successors) {
104 if (succ.getPredecessors().size() == 1) {
105 if (succ.getProperties().selectSingle(r.getSecondMatcher()) != null && succ.getOutputSlots().size() == 1) {
111 if (c.getInputSlot().getFigure() == succ) {
119 OutputSlot nextSlot = succ.getOutputSlots().get(0);
121 if (succ.getProperties().get("con") != null) {
122 pos = Integer.parseInt(succ
[all...]
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/Graph/src/com/sun/hotspot/igv/graph/
H A DDiagram.java186 private void freeFigure(Figure succ) { argument
188 List<InputSlot> inputSlots = new ArrayList<InputSlot>(succ.getInputSlots());
190 succ.removeInputSlot(s);
193 List<OutputSlot> outputSlots = new ArrayList<OutputSlot>(succ.getOutputSlots());
195 succ.removeOutputSlot(s);
198 assert succ.getInputSlots().size() == 0;
199 assert succ.getOutputSlots().size() == 0;
200 assert succ.getPredecessors().size() == 0;
201 assert succ.getSuccessors().size() == 0;
205 public void removeFigure(Figure succ) { argument
[all...]
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/
H A DNode.java128 ArrayList<Node<N, E>> succ = new ArrayList<Node<N, E>>();
131 if (!succ.contains(n)) {
132 succ.add(n);
135 return succ;
H A DOldHierarchicalLayoutManager.java554 Node<NodeData, EdgeData> succ = e.getDest();
555 if (succ.getData().isDummy()) {
556 //PositionedEdge edge = succ.getData().getEdge();
558 assignToRealObjects(layerSizes, succ, points);
893 private int calcRelativeCoordinate(Node<NodeData, EdgeData> n, Node<NodeData, EdgeData> succ) { argument
895 if (n.getData().isDummy() && succ.getData().isDummy()) {
907 if (e.getDest() == succ) {
914 if (!succ.getData().isDummy()) {
922 if (!succ.getData().isDummy()) {
934 if (!succ
[all...]
H A DGraph.java266 for (Node<N, E> succ : n.getSuccessors()) {
267 if (checkCycles(succ)) {
H A DHierarchicalClusterLayoutManager.java107 for (Cluster succ : c.getSuccessors()) {
108 ClusterNode end = clusterNodes.get(succ);
H A DHierarchicalLayoutManager.java828 for (Segment succ : s.succs) {
829 succ.preds.remove(s);
830 if (succ.preds.size() == 0) {
831 queue.add(succ);
832 succ.orderNumber = index;
833 newList.add(succ);
/openjdk7/jdk/src/share/classes/java/util/concurrent/
H A DConcurrentLinkedQueue.java226 * - all live nodes are reachable from head via succ()
240 * - the last node is always reachable from tail via succ()
301 * as sentinel for succ(), below.
313 final Node<E> succ(Node<E> p) { method in class:ConcurrentLinkedQueue
449 for (Node<E> p = first(); p != null; p = succ(p))
467 for (Node<E> p = first(); p != null; p = succ(p)) {
489 for (Node<E> p = first(); p != null; p = succ(p)) {
494 Node<E> next = succ(p);
583 for (Node<E> p = first(); p != null; p = succ(p)) {
632 for (p = first(); p != null && k < a.length; p = succ(
[all...]
H A DConcurrentLinkedDeque.java256 * - all live nodes are reachable from the first node via succ()
725 final Node<E> succ(Node<E> p) { method in class:ConcurrentLinkedDeque
824 for (Node<E> p = first(); p != null; p = succ(p)) {
935 for (Node<E> p = first(); p != null; p = succ(p)) {
967 for (Node<E> p = first(); p != null; p = succ(p)) {
1045 for (Node<E> p = first(); p != null; p = succ(p)) {
1085 for (Node<E> p = first(); p != null; p = succ(p)) {
1120 for (Node<E> p = first(); p != null; p = succ(p))
1381 Node<E> nextNode(Node<E> p) { return succ(p); }
1404 for (Node<E> p = first(); p != null; p = succ(
[all...]
H A DLinkedTransferQueue.java763 final Node succ(Node p) { method in class:LinkedTransferQueue
773 for (Node p = head; p != null; p = succ(p)) {
785 for (Node p = head; p != null; p = succ(p)) {
1218 for (Node p = head; p != null; p = succ(p)) {
1274 for (Node p = head; p != null; p = succ(p)) {
H A DLinkedBlockingDeque.java1081 private Node<E> succ(Node<E> n) { method in class:LinkedBlockingDeque.AbstractItr
1105 next = succ(next);
H A DConcurrentSkipListMap.java573 * @param succ the expected current successor
577 final boolean link(Index<K,V> succ, Index<K,V> newSucc) { argument
579 newSucc.right = succ;
580 return n.value != null && casRight(succ, newSucc);
585 * succ. Fails (forcing a retraversal by caller) if this node
587 * @param succ the expected current successor
590 final boolean unlink(Index<K,V> succ) { argument
591 return !indexesDeletedNode() && casRight(succ, succ.right);
/openjdk7/jdk/src/share/demo/applets/Fractal/
H A DCLSFractal.java293 + "Sensitive\n L-System \n(pred, succ, lContext, rContext)."
312 { "succ", "String",
387 * (pred, succ, lContext, rContext) from the given java.applet.Applet's attributes.
404 String succ = app.getParameter("succ" + num);
405 if (pred == null || succ == null) {
408 rules.add(new CLSRule(pred, succ,
440 newPath.append(rule.succ);
463 * L-System (pred, succ, lContext, rContext).
472 String succ; field in class:CLSRule
[all...]
/openjdk7/jdk/src/share/classes/java/util/
H A DLinkedList.java151 * Inserts element e before non-null Node succ.
153 void linkBefore(E e, Node<E> succ) { argument
154 // assert succ != null;
155 final Node<E> pred = succ.prev;
156 final Node<E> newNode = new Node<>(pred, e, succ);
157 succ.prev = newNode;
411 Node<E> pred, succ;
413 succ = null;
416 succ = node(index);
417 pred = succ
[all...]
/openjdk7/hotspot/src/share/vm/opto/
H A Dsuperword.hpp81 DepEdge(DepMem* pred, DepMem* succ, DepEdge* next_in, DepEdge* next_out) : argument
82 _pred(pred), _succ(succ), _next_in(next_in), _next_out(next_out) {}
87 DepMem* succ() { return _succ; } function in class:DepEdge
142 DepEdge* make_edge(Node* pred, Node* succ) { return make_edge(dep(pred), dep(succ)); } argument
143 DepEdge* make_edge(DepMem* pred, Node* succ) { return make_edge(pred, dep(succ)); } argument
144 DepEdge* make_edge(Node* pred, DepMem* succ) { return make_edge(dep(pred), succ); } argument
H A Dblock.cpp568 Block *succ = b->_succs[idx];
577 b->_succs.map(0,succ); // Map only successor
581 for( j = 1; j < succ->num_preds(); j++)
582 if( succ->pred(j)->in(0) == bp )
583 succ->head()->set_req(j, gto);
H A Dsuperword.cpp2462 Node* succ = s->succ()->node(); local
2463 tty->print(" %d", succ != NULL ? succ->_idx : 0);
2539 _current = _dep_next->succ()->node();
/openjdk7/hotspot/src/share/vm/ci/
H A DciTypeFlow.cpp1565 void ciTypeFlow::SuccIter::set_succ(Block* succ) { argument
1568 _pred->successors()->at_put(_index, succ);
1571 _pred->exceptions()->at_put(idx, succ);
1835 Block* succ = iter.succ(); local
1838 if (lp->contains(succ->loop())) {
1842 if (lp->contains(succ->loop())) return false;
1854 Block* succ = iter.succ(); local
1855 if (lp->contains(succ
2489 Block* succ = iter.succ(); local
2665 Block* succ = iter.succ(); local
[all...]
H A DbcEscapeAnalyzer.cpp1145 ciBlock *succ = successors.pop(); local
1146 merge_block_states(blockstates, succ, &state);
1147 if (!succ->processed())
1148 worklist.push(succ);
H A DciTypeFlow.hpp519 Block* succ() { return _succ; } // Return current successor function in class:ciTypeFlow::SuccIter
521 void set_succ(Block* succ); // Update current successor
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/ServerCompiler/src/com/sun/hotspot/igv/servercompiler/
H A DServerCompilerScheduler.java413 BlockIntermediate succ = map.get(b);
414 if (succ.semi == -1) {
415 succ.parent = index;
416 stack.push(succ.index); // TODO: check if same node could be pushed twice
418 succ.pred.add(index);
/openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/View/src/com/sun/hotspot/igv/view/
H A DEditorTopComponent.java533 for (Figure succ : f.getPredecessors()) {
534 if (oldSelection.contains(succ)) {

Completed in 116 milliseconds