| /openjdk7/hotspot/src/share/vm/shark/ |
| H A D | sharkState.cpp | 372 BasicBlock *predecessor = builder()->GetInsertBlock(); local
375 ((PHINode *) method())->addIncoming(incoming_state->method(), predecessor);
380 local(i)->addIncoming(incoming_state->local(i), predecessor);
389 stack(i)->addIncoming(incoming_state->stack(i), predecessor);
|
| H A D | sharkTopLevelBlock.cpp | 218 void SharkTopLevelBlock::enter(SharkTopLevelBlock* predecessor, argument
224 // - if the predecessor will be compiled after this
230 (predecessor && predecessor->index() >= index())))
|
| /openjdk7/jaxp/src/com/sun/org/apache/bcel/internal/classfile/ |
| H A D | DescendingVisitor.java | 75 /** @return container of current entitity, i.e., predecessor during traversal
77 public Object predecessor() { method in class:DescendingVisitor
78 return predecessor(0);
82 * @param level nesting level, i.e., 0 returns the direct predecessor
83 * @return container of current entitity, i.e., predecessor during traversal
85 public Object predecessor(int level) { method in class:DescendingVisitor
|
| /openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/View/src/com/sun/hotspot/igv/view/widgets/ |
| H A D | LineWidget.java | 68 private LineWidget predecessor; field in class:LineWidget
75 public LineWidget(DiagramScene scene, OutputSlot s, List<Connection> connections, Point from, Point to, LineWidget predecessor, SceneAnimator animator, boolean isBold, boolean isDashed) { argument
82 this.predecessor = predecessor;
84 if (predecessor != null) {
85 predecessor.addSuccessor(this);
181 if (predecessor == null || predecessor.getTo().equals(getFrom())) {
231 LineWidget cur = predecessor;
234 cur = cur.predecessor;
[all...] |
| /openjdk7/jdk/src/share/classes/java/util/concurrent/locks/ |
| H A D | AbstractQueuedLongSynchronizer.java | 85 * information about a thread in the predecessor of its node. A
87 * should block. A node is signalled when its predecessor
115 * predecessor. For explanation of similar mechanics in the case
121 * predecessor signals the next node to wake up by traversing
135 * a new predecessor, unless we can identify an uncancelled
136 * predecessor who will carry this responsibility.
212 * Link to predecessor node that current node/thread relies on
215 * cancellation of a predecessor, we short-circuit while
229 * assign next field of a predecessor until after attachment,
266 * Use when predecessor canno
271 final Node predecessor() throws NullPointerException { method in class:AbstractQueuedLongSynchronizer.Node
[all...] |
| H A D | AbstractQueuedSynchronizer.java | 308 * information about a thread in the predecessor of its node. A
310 * should block. A node is signalled when its predecessor
338 * predecessor. For explanation of similar mechanics in the case
344 * predecessor signals the next node to wake up by traversing
358 * a new predecessor, unless we can identify an uncancelled
359 * predecessor who will carry this responsibility.
435 * Link to predecessor node that current node/thread relies on
438 * cancellation of a predecessor, we short-circuit while
452 * assign next field of a predecessor until after attachment,
489 * Use when predecessor canno
494 final Node predecessor() throws NullPointerException { method in class:AbstractQueuedSynchronizer.Node
[all...] |
| /openjdk7/hotspot/src/share/tools/IdealGraphVisualizer/View/src/com/sun/hotspot/igv/view/ |
| H A D | DiagramScene.java | 765 private void processOutputSlot(OutputSlot s, List<Connection> connections, int controlPointIndex, Point lastPoint, LineWidget predecessor, int offx, int offy, SceneAnimator animator) { argument
815 LineWidget newPredecessor = predecessor;
823 LineWidget w = new LineWidget(this, s, connectionList, p1, p2, predecessor, animator, isBold, isDashed);
|
| /openjdk7/jdk/src/share/classes/java/util/ |
| H A D | TreeMap.java | 1127 next = predecessor(e);
1606 next = predecessor(e);
2004 * Returns the predecessor of the specified Entry, or null if no such.
2006 static <K,V> Entry<K,V> predecessor(Entry<K,V> t) { method in class:TreeMap
|
| /openjdk7/hotspot/src/share/vm/c1/ |
| H A D | c1_GraphBuilder.cpp | 67 BlockBegin* make_block_at(int bci, BlockBegin* predecessor);
147 BlockBegin* BlockListBuilder::make_block_at(int cur_bci, BlockBegin* predecessor) { argument
157 assert(predecessor == NULL || predecessor->bci() < cur_bci, "targets for backward branches must already exist");
160 if (predecessor != NULL) {
165 predecessor->add_successor(block);
2728 assert(sux->is_predecessor(block()), "predecessor missing");
|