com.oracle.graal.graph

Class Edges

java.lang.Object

com.oracle.graal.compiler.common.Fields

com.oracle.graal.graph.Edges

Direct Known Subclasses:

InputEdges, SuccessorEdges

public abstract class Edges
extends Fields

Describes Node fields representing the set of inputs for the node or the set of the node's successors.

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
private static class	Edges.AllEdgesIterator
private static class	Edges.EdgesIterator An iterator that will iterate over edges.
private static class	Edges.EdgesWithModCountIterator
static class	Edges.Type Constants denoting whether a set of edges are inputs or successors.

Nested classes/interfaces inherited from class com.oracle.graal.compiler.common.Fields

Fields.ObjectTransformer

Field Summary

Fields

Modifier and Type	Field and Description
(package private) static int	cnt1
(package private) static int	cnt2
private int	directCount
private Edges.Type	type

Fields inherited from class com.oracle.graal.compiler.common.Fields

offsets

Constructor Summary

Constructors

Constructor and Description
Edges(Edges.Type type, int directCount, ArrayList<? extends FieldsScanner.FieldInfo> edges)

Method Summary

Modifier and Type	Method and Description
void	accept(Node node, BiConsumer<Node,Node> consumer)
private static void	acceptHelper(Node node, BiConsumer<Node,Node> consumer, NodeList<Node> list)
boolean	areEqualIn(Node node, Node other) Determines if the edges of two given nodes are the same.
void	clear(Node node) Clear edges in a given node.
boolean	contains(Node node, Node value)
void	copy(Node fromNode, Node toNode) Copies edges from fromNode to toNode.
int	getDirectCount() Get the number of direct edges represented by this object.
NodeClassIterable	getIterable(Node node)
static Node	getNode(Node node, long[] offsets, int index) Gets the Node at the end point of a direct edge.
static NodeList<Node>	getNodeList(Node node, long[] offsets, int index) Gets the NodeList at the end point of a direct edge.
private static NodeList<Node>	getNodeListUnsafe(Node node, long offset)
private static Node	getNodeUnsafe(Node node, long offset)
static void	initializeList(Node node, long[] offsets, int index, NodeList<Node> value)
void	initializeLists(Node node, Node prototype) Initializes the list edges in a given node based on the size of the list edges in a prototype node.
static void	initializeNode(Node node, long[] offsets, int index, Node value) Sets the value of a given edge without notifying the new and old nodes on the other end of the edge of the change.
void	pushAll(Node node, NodeStack stack)
private static void	pushAllHelper(NodeStack stack, NodeList<Node> list)
private static void	putNodeListUnsafe(Node node, long offset, NodeList<?> value)
private static void	putNodeUnsafe(Node node, long offset, Node value)
boolean	replaceFirst(Node node, Node key, Node replacement) Searches for the first edge in a given node matching key and if found, replaces it with replacement.
void	set(Object node, int index, Object value)
void	setNode(Node node, int index, Node value) Sets the value of a given edge and notifies the new and old nodes on the other end of the edge of the change.
static void	translateInto(Edges edges, ArrayList<NodeClass.EdgeInfo> infos)
Edges.Type	type()
abstract void	update(Node node, Node oldValue, Node newValue)

Methods inherited from class com.oracle.graal.compiler.common.Fields

appendFields, copy, copy, forClass, get, getBoolean, getByte, getChar, getCount, getDeclaringClass, getDouble, getFloat, getInt, getLong, getName, getObject, getOffsets, getRawPrimitive, getShort, getType, isSame, putObject, setRawPrimitive, toString, translateInto

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Field Detail

directCount

private final int directCount

type

private final Edges.Type type

cnt1

static int cnt1

cnt2

static int cnt2

Constructor Detail

Edges

public Edges(Edges.Type type,
             int directCount,
             ArrayList<? extends FieldsScanner.FieldInfo> edges)

Method Detail

translateInto

public static void translateInto(Edges edges,
                                 ArrayList<NodeClass.EdgeInfo> infos)

getNodeUnsafe

private static Node getNodeUnsafe(Node node,
                                  long offset)

getNodeListUnsafe

private static NodeList<Node> getNodeListUnsafe(Node node,
                                                long offset)

putNodeUnsafe

private static void putNodeUnsafe(Node node,
                                  long offset,
                                  Node value)

putNodeListUnsafe

private static void putNodeListUnsafe(Node node,
                                      long offset,
                                      NodeList<?> value)

getDirectCount

public int getDirectCount()

Get the number of direct edges represented by this object. A direct edge goes directly to another Node. An indirect edge goes via a NodeList.

getNode

public static Node getNode(Node node,
                           long[] offsets,
                           int index)

Gets the Node at the end point of a direct edge.

Parameters:

node - one end point of the edge

index - the index of a non-list the edge (must be less than getDirectCount())

Returns:

the Node at the other edge of the requested edge

getNodeList

public static NodeList<Node> getNodeList(Node node,
                                         long[] offsets,
                                         int index)

Gets the NodeList at the end point of a direct edge.

Parameters:

node - one end point of the edge

index - the index of a non-list the edge (must be equal to or greater than getDirectCount())

Returns:

the NodeList at the other edge of the requested edge

clear

public void clear(Node node)

Clear edges in a given node. This is accomplished by setting direct edges to null and replacing the lists containing indirect edges with new lists. The latter is important so that this method can be used to clear the edges of cloned nodes.

Parameters:

node - the node whose edges are to be cleared

initializeLists

public void initializeLists(Node node,
                            Node prototype)

Initializes the list edges in a given node based on the size of the list edges in a prototype node.

Parameters:

node - the node whose list edges are to be initialized

prototype - the node whose list edge sizes are used when creating new edge lists

copy

public void copy(Node fromNode,
                 Node toNode)

Copies edges from fromNode to toNode. The nodes are expected to be of the exact same type.

Parameters:

fromNode - the node from which the edges should be copied.

toNode - the node to which the edges should be copied.

replaceFirst

public boolean replaceFirst(Node node,
                            Node key,
                            Node replacement)

Searches for the first edge in a given node matching key and if found, replaces it with replacement.

Parameters:

node - the node whose edges are to be searched

key - the edge to search for

replacement - the replacement for key

Returns:

true if a replacement was made

set

public void set(Object node,
                int index,
                Object value)

Overrides:

set in class Fields

initializeNode

public static void initializeNode(Node node,
                                  long[] offsets,
                                  int index,
                                  Node value)

Sets the value of a given edge without notifying the new and old nodes on the other end of the edge of the change.

Parameters:

node - the node whose edge is to be updated

index - the index of the edge (between 0 and Fields.getCount())

value - the node to be written to the edge

initializeList

public static void initializeList(Node node,
                                  long[] offsets,
                                  int index,
                                  NodeList<Node> value)

setNode

public void setNode(Node node,
                    int index,
                    Node value)

Sets the value of a given edge and notifies the new and old nodes on the other end of the edge of the change.

Parameters:

node - the node whose edge is to be updated

index - the index of the edge (between 0 and Fields.getCount())

value - the node to be written to the edge

update

public abstract void update(Node node,
                            Node oldValue,
                            Node newValue)

contains

public boolean contains(Node node,
                        Node value)

areEqualIn

public boolean areEqualIn(Node node,
                          Node other)

Determines if the edges of two given nodes are the same.

getIterable

public NodeClassIterable getIterable(Node node)

type

public Edges.Type type()

accept

public void accept(Node node,
                   BiConsumer<Node,Node> consumer)

acceptHelper

private static void acceptHelper(Node node,
                                 BiConsumer<Node,Node> consumer,
                                 NodeList<Node> list)

pushAll

public void pushAll(Node node,
                    NodeStack stack)

pushAllHelper

private static void pushAllHelper(NodeStack stack,
                                  NodeList<Node> list)