/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.graph/src/org/graalvm/compiler/graph/ |
H A D | SuccessorEdges.java | 25 import static org.graalvm.compiler.graph.Edges.Type.Successors; 31 public final class SuccessorEdges extends Edges {
|
H A D | Position.java | 35 private final Edges edges; 48 public Position(Edges edges, int index, int subIndex) { 56 return Edges.getNode(node, edges.getOffsets(), index); 58 return Edges.getNodeList(node, edges.getOffsets(), index).get(subIndex); 78 Edges.getNodeList(node, edges.getOffsets(), index).set(subIndex, value); 86 Edges.getNodeList(node, edges.getOffsets(), index).initialize(subIndex, value);
|
H A D | NodeSuccessorList.java | 25 import static org.graalvm.compiler.graph.Edges.Type.Successors; 29 import org.graalvm.compiler.graph.Edges.Type;
|
H A D | NodeInputList.java | 25 import static org.graalvm.compiler.graph.Edges.Type.Inputs; 30 import org.graalvm.compiler.graph.Edges.Type;
|
H A D | Edges.java | 40 public abstract class Edges extends Fields { class in inherits:Fields 53 public Edges(Type type, int directCount, ArrayList<? extends FieldsScanner.FieldInfo> edges) { method in class:Edges 59 public static void translateInto(Edges edges, ArrayList<EdgeInfo> infos) { 133 NodeList<Node> newList = curType == Edges.Type.Inputs ? new NodeInputList<>(node, size) : new NodeSuccessorList<>(node, size); 152 final Edges.Type curType = this.type; 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); 266 protected final Edges edges; 276 EdgesIterator(Node node, Edges edges) { 303 NodeList<?> list = Edges [all...] |
H A D | InputEdges.java | 25 import static org.graalvm.compiler.graph.Edges.Type.Inputs; 32 public final class InputEdges extends Edges {
|
H A D | NodeClass.java | 27 import static org.graalvm.compiler.graph.Edges.translateInto; 56 import org.graalvm.compiler.graph.Edges.Type; 96 private static final DebugTimer Init_Edges = Debug.timer("NodeClass.Init.Edges"); 707 public boolean isValid(Position pos, NodeClass<?> from, Edges fromEdges) { 711 Edges toEdges = getEdges(fromEdges.type()); 721 static void updateEdgesInPlace(Node node, InplaceUpdateClosure duplicationReplacement, Edges edges) { 727 Node edge = Edges.getNode(node, curOffsets, index); 730 if (curType == Edges.Type.Inputs) { 741 NodeList<Node> list = Edges.getNodeList(node, curOffsets, index); 754 private static NodeList<Node> updateEdgeListCopy(Node node, NodeList<Node> list, InplaceUpdateClosure duplicationReplacement, Edges [all...] |
H A D | Node.java | 25 import static org.graalvm.compiler.graph.Edges.Type.Inputs; 26 import static org.graalvm.compiler.graph.Edges.Type.Successors; 66 * Once a node has been added to a graph, it has a graph-unique {@link #id()}. Edges in the 851 private void copyOrClearEdgesForClone(Node newNode, Edges.Type type, EnumSet<Edges.Type> edgesToCopy) { 864 public static final EnumSet<Edges.Type> WithNoEdges = EnumSet.noneOf(Edges.Type.class); 865 public static final EnumSet<Edges.Type> WithAllEdges = EnumSet.allOf(Edges.Type.class); 866 public static final EnumSet<Edges [all...] |
H A D | NodeList.java | 115 public abstract Edges.Type getEdgesType();
|
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.replacements.test/src/org/graalvm/compiler/replacements/test/ |
H A D | EdgesTest.java | 35 import org.graalvm.compiler.graph.Edges; 74 Edges inputs; 91 * {@link Edges#getNode(Node, long[], int)}. 100 * {@link Edges#getNodeList(Node, long[], int)}. 109 * {@link Edges#setNode(Node, int, Node)}. 136 return Edges.class.getDeclaredMethod(name, parameters);
|
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.salver/src/org/graalvm/compiler/salver/dumper/ |
H A D | GraphDumper.java | 37 import org.graalvm.compiler.graph.Edges; 38 import org.graalvm.compiler.graph.Edges.Type; 233 private static void appendEdges(DataList edgeList, Node node, Edges.Type type) { 236 Edges edges = nodeClass.getEdges(type); 240 Node other = Edges.getNode(node, curOffsets, i); 254 NodeList<Node> list = Edges.getNodeList(node, curOffsets, i); 333 private static DataDict getEdgeInfo(NodeClass<?> nodeClass, Edges.Type type) { 335 Edges edges = nodeClass.getEdges(type);
|
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.core/src/org/graalvm/compiler/core/match/ |
H A D | MatchRuleRegistry.java | 37 import org.graalvm.compiler.graph.Edges; 57 Edges edges = nodeClass.getInputEdges();
|
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/ |
H A D | GraphEncoder.java | 40 import org.graalvm.compiler.graph.Edges; 227 writeEdges(node, nodeClass.getEdges(Edges.Type.Successors), nodeOrder); 228 writeEdges(node, nodeClass.getEdges(Edges.Type.Inputs), nodeOrder); 367 protected void writeEdges(Node node, Edges edges, NodeOrder nodeOrder) { 373 Node edge = Edges.getNode(node, edges.getOffsets(), idx); 381 NodeList<Node> edgeList = Edges.getNodeList(node, edges.getOffsets(), idx);
|
H A D | GraphDecoder.java | 47 import org.graalvm.compiler.graph.Edges; 979 Edges edges = node.getNodeClass().getEdges(Edges.Type.Inputs); 1066 assert node.getNodeClass().getEdges(Edges.Type.Successors).getCount() == 0; 1106 Edges edges = node.getNodeClass().getEdges(Edges.Type.Successors); 1158 * Returns false for {@link Edges} that are not necessary in the encoded graph because they are 1161 protected static boolean skipEdge(Node node, Edges edges, int index, boolean direct, boolean decode) { 1164 assert edges.type() == Edges.Type.Inputs; 1176 } else if (node instanceof AbstractMergeNode && edges.type() == Edges [all...] |
/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; 26 import static org.graalvm.compiler.graph.Edges.Type.Successors; 45 import org.graalvm.compiler.graph.Edges; 396 private void writeEdgesInfo(NodeClass<?> nodeClass, Edges.Type type) throws IOException { 397 Edges edges = nodeClass.getEdges(type); 556 private void writeEdges(Node node, Edges.Type type) throws IOException { 558 Edges edges = nodeClass.getEdges(type); 561 writeNodeRef(Edges.getNode(node, curOffsets, i)); 564 NodeList<Node> list = Edges.getNodeList(node, curOffsets, i);
|
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.replacements/src/org/graalvm/compiler/replacements/ |
H A D | StandardGraphBuilderPlugins.java | 50 import org.graalvm.compiler.graph.Edges; 543 * Substitutions for improving the performance of some critical methods in {@link Edges}. These 548 Registration r = new Registration(plugins, Edges.class);
|