| /openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.graph/src/org/graalvm/compiler/graph/ |
| H A D | SuccessorEdges.java | 33 public SuccessorEdges(int directCount, ArrayList<EdgeInfo> edges) { argument
|
| H A D | InputEdges.java | 37 public InputEdges(int directCount, ArrayList<InputInfo> edges) { argument
|
| H A D | Position.java | 35 private final Edges edges; field in class:Position
48 public Position(Edges edges, int index, int subIndex) { argument
[all...] |
| H A D | Edges.java | 53 public Edges(Type type, int directCount, ArrayList<? extends FieldsScanner.FieldInfo> edges) { argument
59 public static void translateInto(Edges edges, ArrayList<EdgeInfo> infos) { argument
266 protected final Edges edges; field in class:Edges.EdgesIterator
276 EdgesIterator(Node node, Edges edges) argument
344 EdgesWithModCountIterator(Node node, Edges edges) argument
[all...] |
| /openjdk10/langtools/src/jdk.jdeps/share/classes/com/sun/tools/jdeps/ |
| H A D | ModuleGraphBuilder.java | 88 private Graph<Module> buildGraph(Map<Module, Set<Module>> edges) { argument
|
| H A D | Graph.java | 45 private final Map<T, Set<T>> edges; field in class:Graph
47 public Graph(Set<T> nodes, Map<T, Set<T>> edges) { argument
56 public Map<T, Set<T>> edges() { method in class:Graph
266 final Map<T, Set<T>> edges = new HashMap<>(); field in class:Graph.Builder
[all...] |
| H A D | JdepsWriter.java | 146 private final Map<Archive, Map<Archive,StringBuilder>> edges = new HashMap<>(); field in class:JdepsWriter.DotFileWriter.SummaryDotFile
|
| H A D | ModuleDotGraph.java | 383 public void printNode(PrintWriter out, ModuleDescriptor md, Set<String> edges) { argument
|
| /openjdk10/langtools/test/tools/jdeps/modules/ |
| H A D | DotFileTest.java | 90 public void test(String name, Set<String> edges) throws Exception { argument
107 public void testAPIOnly(String name, Set<String> edges) throws Exception { argument
|
| /openjdk10/jdk/src/jdk.jlink/share/classes/jdk/tools/jlink/internal/ |
| H A D | ModuleSorter.java | 49 private final Map<String, Set<ResourcePoolModule>> edges = new HashMap<>(); field in class:ModuleSorter
|
| /openjdk10/hotspot/src/share/tools/IdealGraphVisualizer/HierarchicalLayout/src/com/sun/hotspot/igv/hierarchicallayout/ |
| H A D | Graph.java | 35 private HashMap<Object, Edge<N, E>> edges; field in class:Graph
|
| /openjdk10/jdk/src/java.desktop/share/classes/sun/java2d/loops/ |
| H A D | TransformHelper.java | 93 Transform(MaskBlit output, SurfaceData src, SurfaceData dst, Composite comp, Region clip, AffineTransform itx, int txtype, int sx1, int sy1, int sx2, int sy2, int dx1, int dy1, int dx2, int dy2, int edges[], int dxoff, int dyoff) argument
124 Transform(MaskBlit output, SurfaceData src, SurfaceData dst, Composite comp, Region clip, AffineTransform itx, int txtype, int sx1, int sy1, int sx2, int sy2, int dx1, int dy1, int dx2, int dy2, int edges[], int dxoff, int dyoff) argument
|
| /openjdk10/jdk/src/java.base/share/classes/jdk/internal/module/ |
| H A D | ModuleHashesBuilder.java | 145 private final Map<T, Set<T>> edges; field in class:ModuleHashesBuilder.Graph
147 public Graph(Set<T> nodes, Map<T, Set<T>> edges) { argument
156 public Map<T, Set<T>> edges() { method in class:ModuleHashesBuilder.Graph
242 final Map<T, Set<T>> edges = new HashMap<>(); field in class:ModuleHashesBuilder.Graph.Builder
[all...] |
| /openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.nodes/src/org/graalvm/compiler/nodes/ |
| H A D | GraphEncoder.java | 390 protected void writeEdges(Node node, Edges edges, NodeOrder nodeOrder) { argument
[all...] |
| H A D | GraphDecoder.java | 1270 skipDirectEdge(Node node, Edges edges, int index) argument
[all...] |
| /openjdk10/hotspot/src/share/tools/IdealGraphVisualizer/Data/src/com/sun/hotspot/igv/data/ |
| H A D | InputGraph.java | 35 private List<InputEdge> edges; field in class:InputGraph
|
| /openjdk10/jdk/src/java.desktop/share/classes/sun/awt/geom/ |
| H A D | AreaOp.java | 171 private static void addEdges(Vector<Edge> edges, Vector<Curve> curves, int curvetag) { argument
198 private Vector<Curve> pruneEdges(Vector<Edge> edges) { argument
[all...] |
| /openjdk10/jdk/src/java.desktop/share/native/libawt/java2d/loops/ |
| H A D | DrawParallelogram.c | 104 EdgeInfo edges[8]; local
[all...] |
| H A D | MaskFill.c | 558 EdgeInfo edges[4]; local
796 EdgeInfo edges[8]; local
[all...] |
| /openjdk10/hotspot/src/jdk.internal.vm.compiler/share/classes/org.graalvm.graphio/src/org/graalvm/graphio/ |
| H A D | ProtocolImpl.java | 96 protected int findSize(Port edges) { argument
101 protected boolean isDirect(Port edges, int i) { argument
106 protected String findName(Port edges, int i) { argument
111 protected Object findType(Port edges, int i) { argument
|
| /openjdk10/jdk/src/java.desktop/unix/native/libawt/java2d/loops/ |
| H A D | mlib_ImageZoom.h | 81 mlib_edge_box edges[4]; member in struct:mlib_work_image
[all...] |
| /openjdk10/hotspot/src/share/tools/IdealGraphVisualizer/Data/src/com/sun/hotspot/igv/data/serialization/ |
| H A D | BinaryParser.java | 864 private String createName(List<Edge> edges, Map<String, Object> properties, String template) { argument
|
| /openjdk10/hotspot/src/share/vm/opto/ |
| H A D | idealGraphPrinter.cpp | 369 void IdealGraphPrinter::visit_node(Node *n, bool edges, VectorSet* temp_set) { argument
624 void IdealGraphPrinter::walk_nodes(Node *start, bool edges, VectorSet* temp_set) { argument
|
| /openjdk10/jdk/src/java.desktop/share/classes/sun/java2d/pipe/ |
| H A D | Region.java | 290 getInstance(final int lox, final int loy, final int hix, final int hiy, final int[] edges) argument
|
| /openjdk10/jdk/src/java.desktop/share/classes/sun/java2d/pisces/ |
| H A D | Renderer.java | 150 private float[] edges = null; field in class:Renderer
[all...] |