Mercurial > hg > truffle
diff graal/com.oracle.graal.compiler/src/com/oracle/graal/compiler/alloc/LinearScanWalker.java @ 7497:0f8c6dbf68be
Code clean up and documentation for ComputeBlockOrder class.
author | Thomas Wuerthinger <thomas.wuerthinger@oracle.com> |
---|---|
date | Thu, 17 Jan 2013 17:21:16 +0100 |
parents | c162fcf45ce7 |
children | 5e3d1a68664e |
line wrap: on
line diff
--- a/graal/com.oracle.graal.compiler/src/com/oracle/graal/compiler/alloc/LinearScanWalker.java Thu Jan 17 00:41:44 2013 +0100 +++ b/graal/com.oracle.graal.compiler/src/com/oracle/graal/compiler/alloc/LinearScanWalker.java Thu Jan 17 17:21:16 2013 +0100 @@ -265,8 +265,8 @@ } int findOptimalSplitPos(Block minBlock, Block maxBlock, int maxSplitPos) { - int fromBlockNr = minBlock.linearScanNumber; - int toBlockNr = maxBlock.linearScanNumber; + int fromBlockNr = minBlock.getLinearScanNumber(); + int toBlockNr = maxBlock.getLinearScanNumber(); assert 0 <= fromBlockNr && fromBlockNr < blockCount() : "out of range"; assert 0 <= toBlockNr && toBlockNr < blockCount() : "out of range"; @@ -318,7 +318,7 @@ // block at this opId) Block maxBlock = allocator.blockForId(maxSplitPos - 1); - assert minBlock.linearScanNumber <= maxBlock.linearScanNumber : "invalid order"; + assert minBlock.getLinearScanNumber() <= maxBlock.getLinearScanNumber() : "invalid order"; if (minBlock == maxBlock) { // split position cannot be moved to block boundary : so split as late as possible if (GraalOptions.TraceLinearScanLevel >= 4) {