com.oracle.graal.phases.util

Class BlockWorkList

java.lang.Object

com.oracle.graal.phases.util.BlockWorkList

public class BlockWorkList
extends Object

This class implements a worklist for dealing with blocks. The worklist can operate either as a stack (i.e. first-in / last-out), or as a sorted list, where blocks can be sorted by a supplied number. The latter usage lends itself naturally to iterative dataflow analysis problems.

Field Summary

Fields

Modifier and Type	Field and Description
(package private) AbstractMergeNode[]	workList
(package private) int	workListIndex
(package private) int[]	workListNumbers

Constructor Summary

Constructors

Constructor and Description
BlockWorkList()

Method Summary

Modifier and Type	Method and Description
void	add(AbstractMergeNode block) Adds a block to this list in an unsorted fashion, like a stack.
void	addSorted(AbstractMergeNode block, int number) Adds a block to this list, sorted by the supplied number.
private void	allocate()
private void	grow()
boolean	isEmpty() Checks whether the list is empty.
AbstractMergeNode	removeFromWorkList() Removes the next block from this work list.

Methods inherited from class java.lang.Object

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

Field Detail

workList

AbstractMergeNode[] workList

workListNumbers

int[] workListNumbers

workListIndex

int workListIndex

Constructor Detail

BlockWorkList

public BlockWorkList()

Method Detail

add

public void add(AbstractMergeNode block)

Adds a block to this list in an unsorted fashion, like a stack.

Parameters:

block - the block to add

addSorted

public void addSorted(AbstractMergeNode block,
                      int number)

Adds a block to this list, sorted by the supplied number. The block with the lowest number is returned upon subsequent removes.

Parameters:

block - the block to add

number - the number used to sort the block

removeFromWorkList

public AbstractMergeNode removeFromWorkList()

Removes the next block from this work list. If the blocks have been added in a sorted order, then the block with the lowest number is returned. Otherwise, the last block added is returned.

Returns:

the next block in the list

isEmpty

public boolean isEmpty()

Checks whether the list is empty.

Returns:

true if this list is empty

allocate

private void allocate()

grow

private void grow()