src/jdk.internal.vm.compiler/share/classes/org.graalvm.compiler.graph/src/org/graalvm/compiler/graph/IterableNodeType.java
equal
deleted
inserted
replaced
1 /* |
1 /* |
2 * Copyright (c) 2013, 2018, Oracle and/or its affiliates. All rights reserved. |
2 * Copyright (c) 2013, 2019, Oracle and/or its affiliates. All rights reserved. |
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
3 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. |
4 * |
4 * |
5 * This code is free software; you can redistribute it and/or modify it |
5 * This code is free software; you can redistribute it and/or modify it |
6 * under the terms of the GNU General Public License version 2 only, as |
6 * under the terms of the GNU General Public License version 2 only, as |
7 * published by the Free Software Foundation. |
7 * published by the Free Software Foundation. |
25 package org.graalvm.compiler.graph; |
25 package org.graalvm.compiler.graph; |
26 |
26 |
27 /** |
27 /** |
28 * A marker for a node type supporting {@linkplain Graph#getNodes(NodeClass) fast iteration} of its |
28 * A marker for a node type supporting {@linkplain Graph#getNodes(NodeClass) fast iteration} of its |
29 * instances in a graph. The support for fast iteration comes with a memory cost (e.g., extra data |
29 * instances in a graph. The support for fast iteration comes with a memory cost (e.g., extra data |
30 * structures {@link Graph}) so only node types for which fast iteration provides a compilation |
30 * structures {@link Graph}) and additional bookkeeping when adding nodes, so only node types for |
31 * performance benefit should implement this interface. |
31 * which fast iteration provides a compilation performance benefit should implement this interface. |
32 */ |
32 */ |
33 public interface IterableNodeType { |
33 public interface IterableNodeType { |
34 } |
34 } |