Searched refs:oldNode (Results 1 - 11 of 11) sorted by relevance
/openjdk10/nashorn/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/objects/ |
H A D | LinkedMap.java | 240 private void unlink(final Node oldNode) { argument 244 oldNode.prev.next = oldNode.next; 245 oldNode.next.prev = oldNode.prev; 246 oldNode.alive = false;
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.graph/src/org/graalvm/compiler/graph/ |
H A D | NodeSuccessorList.java | 52 protected void update(T oldNode, T newNode) { argument 53 self.updatePredecessor(oldNode, newNode);
|
H A D | NodeInputList.java | 58 protected void update(T oldNode, T newNode) { argument 59 self.updateUsages(oldNode, newNode);
|
H A D | NodeClass.java | 773 Node oldNode = list.get(i); 774 if (oldNode != null) { 775 Node newNode = duplicationReplacement.replacement(oldNode, type); 866 for (Node oldNode : nodes) { 867 Node node = newNodes.get(oldNode); 869 if (replacements == null || replacements.replacement(oldNode) == oldNode) { 872 transferEdgesDifferentNodeClass(graph, replacements, newNodes, oldNode, node); 900 private static void transferEdgesDifferentNodeClass(final Graph graph, final DuplicationReplacement replacements, final EconomicMap<Node, Node> newNodes, Node oldNode, Node node) { argument 901 transferEdges(graph, replacements, newNodes, oldNode, nod 905 transferEdges(final Graph graph, final DuplicationReplacement replacements, final EconomicMap<Node, Node> newNodes, Node oldNode, Node node, Edges.Type type) argument [all...] |
H A D | NodeList.java | 113 protected abstract void update(T oldNode, T newNode); argument
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.replacements/src/org/graalvm/compiler/replacements/ |
H A D | InstanceOfSnippetsTemplates.java | 251 public void replace(ValueNode oldNode, ValueNode newNode) { argument 253 assert oldNode == instanceOf; 256 usage.replaceFirstInput(oldNode, instantiation.asCondition(trueValue)); 282 public void replace(ValueNode oldNode, ValueNode newNode) { argument 284 assert oldNode == instanceOf;
|
H A D | SnippetTemplate.java | 1173 * Replaces all usages of {@code oldNode} with direct or indirect usages of {@code newNode}. 1175 void replace(ValueNode oldNode, ValueNode newNode); argument 1185 public void replace(ValueNode oldNode, ValueNode newNode) { 1187 assert oldNode.hasNoUsages(); 1189 oldNode.replaceAtUsages(newNode);
|
/openjdk10/nashorn/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/ir/ |
H A D | Node.java | 305 static <T extends LexicalContextNode> T replaceInLexicalContext(final LexicalContext lc, final T oldNode, final T newNode) { argument 307 lc.replace(oldNode, newNode);
|
H A D | LexicalContext.java | 267 * @param oldNode old node 272 public LexicalContextNode replace(final LexicalContextNode oldNode, final LexicalContextNode newNode) { argument 274 if (stack[i] == oldNode) {
|
/openjdk10/jaxp/src/java.xml/share/classes/com/sun/org/apache/xpath/internal/axes/ |
H A D | NodeSequence.java | 551 int oldNode = vec.elementAt(index); 552 if (oldNode != node && m_cache.useCount() > 1) {
|
/openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.loop/src/org/graalvm/compiler/loop/ |
H A D | LoopFragment.java | 105 protected <New extends Node, Old extends New> void putDuplicatedNode(Old oldNode, New newNode) { argument 106 duplicationMap.put(oldNode, newNode);
|
Completed in 82 milliseconds