/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.core/src/org/graalvm/compiler/core/gen/ |
H A D | NodeMatchRules.java | 63 @MatchableNode(nodeClass = ConstantNode.class, shareable = true) 64 @MatchableNode(nodeClass = FloatConvertNode.class, inputs = {"value"}) 65 @MatchableNode(nodeClass = FloatingReadNode.class, inputs = {"address"}) 66 @MatchableNode(nodeClass = IfNode.class, inputs = {"condition"}) 67 @MatchableNode(nodeClass = SubNode.class, inputs = {"x", "y"}) 68 @MatchableNode(nodeClass = LeftShiftNode.class, inputs = {"x", "y"}) 69 @MatchableNode(nodeClass = NarrowNode.class, inputs = {"value"}) 70 @MatchableNode(nodeClass = ReadNode.class, inputs = {"address"}) 71 @MatchableNode(nodeClass = ReinterpretNode.class, inputs = {"value"}) 72 @MatchableNode(nodeClass [all...] |
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.api.directives.test/src/org/graalvm/compiler/api/directives/test/ |
H A D | ControlFlowAnchorDirectiveTest.java | 57 Class<? extends Node> nodeClass(); method in interface:ControlFlowAnchorDirectiveTest.NodeCount 68 @NodeCount(nodeClass = ReturnNode.class, expectedCount = 1) 77 @NodeCount(nodeClass = ControlFlowAnchorNode.class, expectedCount = 2) 78 @NodeCount(nodeClass = ReturnNode.class, expectedCount = 2) 95 @NodeCount(nodeClass = ReturnNode.class, expectedCount = 2) 106 @NodeCount(nodeClass = ControlFlowAnchorNode.class, expectedCount = 1) 107 @NodeCount(nodeClass = ReturnNode.class, expectedCount = 1) 125 @NodeCount(nodeClass = LoopBeginNode.class, expectedCount = 0) 134 @NodeCount(nodeClass = LoopBeginNode.class, expectedCount = 1) 135 @NodeCount(nodeClass [all...] |
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.core/src/org/graalvm/compiler/core/match/ |
H A D | MatchPattern.java | 125 private final Class<? extends Node> nodeClass; field in class:MatchPattern 155 public MatchPattern(Class<? extends Node> nodeClass, String name, boolean singleUser) { argument 156 this.nodeClass = nodeClass; 163 private MatchPattern(Class<? extends Node> nodeClass, String name, boolean singleUser, MatchPattern[] patterns, Position[] inputs) { argument 165 this.nodeClass = nodeClass; 172 public MatchPattern(Class<? extends Node> nodeClass, String name, MatchPattern first, Position[] inputs, boolean singleUser) { argument 173 this(nodeClass, name, singleUser, new MatchPattern[]{first}, inputs); 176 public MatchPattern(Class<? extends Node> nodeClass, Strin argument 180 MatchPattern(Class<? extends Node> nodeClass, String name, MatchPattern first, MatchPattern second, MatchPattern third, Position[] inputs, boolean singleUser) argument 184 Class<? extends Node> nodeClass() { method in class:MatchPattern [all...] |
H A D | MatchRuleRegistry.java | 50 * @param nodeClass 54 public static Position[] findPositions(NodeClass<? extends Node> nodeClass, String[] names) { argument 57 Edges edges = nodeClass.getInputEdges(); 64 throw new GraalError("unknown field \"%s\" in class %s", names[i], nodeClass); 127 Class<? extends Node> nodeClass = statement.getPattern().nodeClass(); 128 List<MatchStatement> current = rules.get(nodeClass); 131 rules.put(nodeClass, current);
|
H A D | MatchableNode.java | 48 Class<? extends ValueNode> nodeClass(); method in interface:MatchableNode
|
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.replacements.verifier/src/org/graalvm/compiler/replacements/verifier/ |
H A D | NodeIntrinsicVerifier.java | 109 TypeElement nodeClass = (TypeElement) env.getTypeUtils().asElement(nodeClassMirror); 110 if (nodeClass.getSimpleName().contentEquals(NodeIntrinsic.class.getSimpleName())) { 117 nodeClass = (TypeElement) enclosingElement; 126 ExecutableElement custom = findCustomIntrinsifyMethod(nodeClass, constructorSignature); 130 if (isNodeType(nodeClass)) { 131 if (nodeClass.getModifiers().contains(Modifier.ABSTRACT)) { 132 env.getMessager().printMessage(Kind.ERROR, String.format("Cannot make @NodeIntrinsic for abstract node class %s.", nodeClass.getSimpleName()), element, annotation); 136 checkInputType(nodeClass, ret, element, annotation); 139 ExecutableElement constructor = findConstructor(nodeClass, constructorSignature, intrinsicMethod, annotation); 145 env.getMessager().printMessage(Kind.ERROR, String.format("The class %s is not a Node subclass.", nodeClass 150 checkInputType(TypeElement nodeClass, TypeMirror returnType, Element element, AnnotationMirror annotation) argument 183 isNodeType(TypeElement nodeClass) argument 204 findConstructor(TypeElement nodeClass, TypeMirror[] signature, ExecutableElement intrinsicMethod, AnnotationMirror intrinsicAnnotation) argument 230 findCustomIntrinsifyMethod(TypeElement nodeClass, TypeMirror[] signature) argument [all...] |
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.salver/src/org/graalvm/compiler/salver/dumper/ |
H A D | GraphDumper.java | 154 NodeClass<?> nodeClass = node.getNodeClass(); 160 nodeDict.put("class", getNodeClassId(classMap, classList, nodeClass)); 234 NodeClass<?> nodeClass = node.getNodeClass(); 236 Edges edges = nodeClass.getEdges(type); 280 private static int getNodeClassId(Map<NodeClass<?>, Integer> classMap, DataList classList, NodeClass<?> nodeClass) { argument 281 if (classMap.containsKey(nodeClass)) { 282 return classMap.get(nodeClass); 285 classMap.put(nodeClass, classId); 287 Class<?> javaClass = nodeClass.getJavaClass(); 293 classDict.put("name", nodeClass 317 getPropertyInfo(NodeClass<?> nodeClass) argument 333 getEdgeInfo(NodeClass<?> nodeClass, Edges.Type type) argument [all...] |
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.hotspot/src/org/graalvm/compiler/hotspot/ |
H A D | HotSpotNodeLIRBuilder.java | 36 @MatchableNode(nodeClass = CompressionNode.class, inputs = {"value"})
|
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/ |
H A D | GraphEncoder.java | 174 NodeClass<?> nodeClass = node.getNodeClass(); 176 for (int i = 0; i < nodeClass.getData().getCount(); i++) { 177 if (!nodeClass.getData().getType(i).isPrimitive()) { 178 objects.addObject(nodeClass.getData().get(node, i)); 224 NodeClass<?> nodeClass = node.getNodeClass(); 225 writer.putUV(nodeClasses.getIndex(nodeClass)); 226 writeProperties(node, nodeClass.getData()); 227 writeEdges(node, nodeClass.getEdges(Edges.Type.Successors), nodeOrder); 228 writeEdges(node, nodeClass.getEdges(Edges.Type.Inputs), nodeOrder); 437 NodeClass<?> nodeClass [all...] |
H A D | IfNode.java | 310 NodeClass<?> nodeClass = trueNext.getNodeClass(); 312 if (nodeClass.equalInputs(trueNext, falseNext) && trueNext.valueEquals(falseNext)) {
|
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.core.match.processor/src/org/graalvm/compiler/core/match/processor/ |
H A D | MatchProcessor.java | 190 throw new RuleParseError("Too many arguments to " + descriptor.nodeType.nodeClass); 327 final String nodeClass; field in class:MatchProcessor.TypeDescriptor 354 TypeDescriptor(TypeMirror mirror, String shortName, String nodeClass, String nodePackage, String[] inputs, boolean commutative, boolean shareable) { argument 357 this.nodeClass = nodeClass; 381 private void declareType(TypeMirror mirror, String shortName, String nodeClass, String nodePackage, String[] inputs, boolean commutative, boolean shareable, Element element) { argument 382 TypeDescriptor descriptor = new TypeDescriptor(mirror, shortName, nodeClass, nodePackage, inputs, commutative, shareable); 467 return String.format("new MatchPattern(%s.class, %s", nodeType.nodeClass, name != null ? ("\"" + name + "\"") : "null"); 477 return ", " + nodeType.nodeClass + "_positions, " + !nodeType.shareable + ")"; 488 return String.format("Position[] %s_positions = MatchRuleRegistry.findPositions(%s.TYPE, new String[]{\"%s\"});", nodeType.nodeClass, nodeTyp [all...] |
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.phases.common/src/org/graalvm/compiler/phases/common/ |
H A D | CanonicalizerPhase.java | 241 NodeClass<?> nodeClass = node.getNodeClass(); 242 if (tryGlobalValueNumbering(node, nodeClass)) { 249 if (tryCanonicalize(node, nodeClass)) { 264 if (tryCanonicalize(valueNode, nodeClass)) { 273 public boolean tryGlobalValueNumbering(Node node, NodeClass<?> nodeClass) { argument 274 if (nodeClass.valueNumberable()) { 302 public boolean tryCanonicalize(final Node node, NodeClass<?> nodeClass) { argument 315 if (nodeClass.isCanonicalizable()) { 320 if (canonical == node && nodeClass.isCommutative()) { 331 if (nodeClass [all...] |
/openjdk9/jdk/test/java/util/concurrent/ConcurrentLinkedQueue/ |
H A D | WhiteBox.java | 67 Class<?> nodeClass = Class.forName(qClass.getName() + "$Node"); 70 HEAD = lookup.findVarHandle(qClass, "head", nodeClass); 71 TAIL = lookup.findVarHandle(qClass, "tail", nodeClass); 72 NEXT = lookup.findVarHandle(nodeClass, "next", nodeClass); 73 ITEM = lookup.findVarHandle(nodeClass, "item", Object.class);
|
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/calc/ |
H A D | SignedDivNode.java | 105 NodeClass<?> nodeClass = getNodeClass(); 106 if (next().getClass() == this.getClass() && nodeClass.equalInputs(this, next()) && valueEquals(next())) {
|
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.graph/src/org/graalvm/compiler/graph/ |
H A D | Node.java | 235 private NodeClass<? extends Node> nodeClass; field in class:Node 246 this.nodeClass = c; 324 return nodeClass.getInputIterable(this); 334 return nodeClass.getInputEdges().getPositionsIterable(this); 349 nodeClass.applyInputs(this, visitor); 358 nodeClass.applySuccessors(this, visitor); 369 return nodeClass.getSuccessorIterable(this); 379 return nodeClass.getSuccessorEdges().getPositionsIterable(this); 626 return nodeClass; 770 if (nodeClass [all...] |
H A D | Graph.java | 627 NodeClass<?> nodeClass = node.getNodeClass(); 628 assert nodeClass.valueNumberable(); 629 if (nodeClass.isLeafNode()) { 659 if (usage != node && nodeClass == usage.getNodeClass() && node.valueEquals(usage) && nodeClass.equalInputs(node, usage) && 660 nodeClass.equalSuccessors(node, usage)) { 828 * @param nodeClass the type of node to return 831 public <T extends Node & IterableNodeType> NodeIterable<T> getNodes(final NodeClass<T> nodeClass) { argument 836 return new TypedGraphNodeIterator<>(nodeClass, Graph.this);
|
H A D | NodeClass.java | 851 NodeClass<?> nodeClass = node.getNodeClass(); 853 nodeClass.updateInputSuccInPlace(node, replacementClosure); 895 NodeClass<?> nodeClass = node.getNodeClass(); 899 if (!nodeClass.isValid(pos, oldNodeClass, oldEdges)) {
|
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.printer/src/org/graalvm/compiler/printer/ |
H A D | BinaryGraphPrinter.java | 360 NodeClass<?> nodeClass = (NodeClass<?>) object; 362 writeString(nodeClass.getJavaClass().getSimpleName()); 363 writeString(nodeClass.getNameTemplate()); 364 writeEdgesInfo(nodeClass, Inputs); 365 writeEdgesInfo(nodeClass, Successors); 396 private void writeEdgesInfo(NodeClass<?> nodeClass, Edges.Type type) throws IOException { argument 397 Edges edges = nodeClass.getEdges(type); 488 NodeClass<?> nodeClass = node.getNodeClass(); 532 writePoolObject(nodeClass); 557 NodeClass<?> nodeClass [all...] |
/openjdk9/jdk/test/java/util/concurrent/LinkedTransferQueue/ |
H A D | WhiteBox.java | 69 Class<?> nodeClass = Class.forName(qClass.getName() + "$Node"); 72 HEAD = lookup.findVarHandle(qClass, "head", nodeClass); 73 TAIL = lookup.findVarHandle(qClass, "tail", nodeClass); 74 NEXT = lookup.findVarHandle(nodeClass, "next", nodeClass); 75 ITEM = lookup.findVarHandle(nodeClass, "item", Object.class);
|
/openjdk9/nashorn/src/jdk.scripting.nashorn/share/classes/jdk/nashorn/internal/ir/debug/ |
H A D | ASTWriter.java | 241 private static void enqueueChildren(final Node node, final Class<?> nodeClass, final List<Field> children) { argument 256 Class<?> clazz = nodeClass;
|
/openjdk9/hotspot/src/share/tools/IdealGraphVisualizer/Data/src/com/sun/hotspot/igv/data/serialization/ |
H A D | BinaryParser.java | 761 NodeClass nodeClass = readPoolObject(NodeClass.class); 785 for (TypedPort p : nodeClass.inputs) { 809 for (Port p : nodeClass.sux) { 831 properties.setProperty("name", createName(currentEdges, props, nodeClass.nameTemplate)); 832 properties.setProperty("class", nodeClass.className); 833 switch (nodeClass.className) {
|
/openjdk9/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.replacements/src/org/graalvm/compiler/replacements/ |
H A D | WordOperationPlugin.java | 363 private static ValueNode createBinaryNodeInstance(Class<? extends ValueNode> nodeClass, ValueNode left, ValueNode right) { argument 365 Constructor<?> cons = nodeClass.getDeclaredConstructor(ValueNode.class, ValueNode.class); 368 throw new GraalError(ex).addContext(nodeClass.getName());
|
/openjdk9/jaxp/src/java.xml/share/classes/com/sun/org/apache/xalan/internal/xsltc/compiler/ |
H A D | FunctionCall.java | 189 final Class<?> nodeClass, nodeListClass; 191 nodeClass = Class.forName("org.w3c.dom.Node"); 235 _internal2Java.put(Type.NodeSet, new JavaType(nodeClass, 1)); 241 _internal2Java.put(Type.Node, new JavaType(nodeClass, 1)); 247 _internal2Java.put(Type.ResultTree, new JavaType(nodeClass, 1)); 276 java2Internal.put(nodeClass, Type.NodeSet);
|
/openjdk9/jdk/test/java/util/concurrent/ArrayBlockingQueue/ |
H A D | WhiteBox.java | 73 Class<?> nodeClass = Class.forName(itrsClass.getName() + "$Node"); 79 HEAD = findVarHandle(itrsClass, "head", nodeClass); 80 NEXT = findVarHandle(nodeClass, "next", nodeClass);
|
/openjdk9/jdk/src/java.desktop/unix/native/common/java2d/opengl/J2D_GL/ |
H A D | glxext.h | 451 typedef GLXVideoSourceSGIX ( * PFNGLXCREATEGLXVIDEOSOURCESGIXPROC) (Display *display, int screen, VLServer server, VLPath path, int nodeClass, VLNode drainNode);
|