Searched refs:Inputs (Results 1 - 9 of 9) sorted by relevance
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.graph/src/org/graalvm/compiler/graph/ |
H A D | NodeInputList.java | 25 import static org.graalvm.compiler.graph.Edges.Type.Inputs; 64 return Inputs;
|
H A D | InputEdges.java | 25 import static org.graalvm.compiler.graph.Edges.Type.Inputs; 38 super(Inputs, directCount, edges);
|
H A D | Edges.java | 46 Inputs, enum constant in enum:Edges.Type 133 NodeList<Node> newList = curType == Edges.Type.Inputs ? new NodeInputList<>(node, size) : new NodeSuccessorList<>(node, size); 157 NodeList<Node> newList = curType == Edges.Type.Inputs ? new NodeInputList<>(node, size) : new NodeSuccessorList<>(node, size); 187 list = curType == Edges.Type.Inputs ? new NodeInputList<>(toNode, fromList) : new NodeSuccessorList<>(toNode, fromList);
|
H A D | Node.java | 25 import static org.graalvm.compiler.graph.Edges.Type.Inputs; 866 public static final EnumSet<Edges.Type> WithOnlyInputEdges = EnumSet.of(Inputs); 898 copyOrClearEdgesForClone(newNode, Inputs, edgesToCopy); 907 copyOrClearEdgesForClone(newNode, Inputs, edgesToCopy);
|
H A D | NodeClass.java | 433 * Describes a field representing an {@linkplain Type#Inputs input} edge in a node. 730 if (curType == Edges.Type.Inputs) { 755 NodeList<Node> result = type == Edges.Type.Inputs ? new NodeInputList<>(node, list.size()) : new NodeSuccessorList<>(node, list.size()); 771 return type == Edges.Type.Inputs ? inputs : successors; 837 } else if (node.graph() == graph && type == Edges.Type.Inputs) { 890 transferEdges(graph, replacements, newNodes, oldNode, node, Edges.Type.Inputs); 912 } else if (type == Edges.Type.Inputs && oldEdge.graph() == graph) {
|
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.salver/src/org/graalvm/compiler/salver/dumper/ |
H A D | GraphDumper.java | 173 appendEdges(edgeList, node, Type.Inputs); 248 edgeDict.put("from", type == Type.Inputs ? getNodeId(other) : nodeDict); 249 edgeDict.put("to", type == Type.Inputs ? nodeDict : getNodeId(other)); 266 edgeDict.put("from", type == Type.Inputs ? getNodeId(other) : nodeDict); 267 edgeDict.put("to", type == Type.Inputs ? nodeDict : getNodeId(other)); 306 Object inputInfo = getEdgeInfo(nodeClass, Type.Inputs); 345 if (type == Type.Inputs) {
|
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.printer/src/org/graalvm/compiler/printer/ |
H A D | BinaryGraphPrinter.java | 25 import static org.graalvm.compiler.graph.Edges.Type.Inputs; 364 writeEdgesInfo(nodeClass, Inputs); 402 if (type == Inputs) { 535 writeEdges(node, Inputs);
|
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/ |
H A D | GraphDecoder.java | 979 Edges edges = node.getNodeClass().getEdges(Edges.Type.Inputs); 1164 assert edges.type() == Edges.Type.Inputs; 1176 } else if (node instanceof AbstractMergeNode && edges.type() == Edges.Type.Inputs && !direct) { 1182 } else if (node instanceof LoopExitNode && edges.type() == Edges.Type.Inputs && edges.getType(index) == FrameState.class) { 1193 assert edges.type() == Edges.Type.Inputs;
|
H A D | GraphEncoder.java | 228 writeEdges(node, nodeClass.getEdges(Edges.Type.Inputs), nodeOrder);
|
Completed in 63 milliseconds