-
Notifications
You must be signed in to change notification settings - Fork 0
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Merge pull request #258 from stevehalliwell/optimiser-comm
Merge optimiser-comm into main
- Loading branch information
Showing
4 changed files
with
57 additions
and
6 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
49 changes: 49 additions & 0 deletions
49
ulox/ulox.core/Package/Runtime/Optimiser/OptimiserPreenGetLocalsPass.cs
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,49 @@ | ||
using static ULox.Optimiser; | ||
|
||
namespace ULox | ||
{ | ||
public sealed class OptimiserPreenGetLocalsPass : IOptimiserPass | ||
{ | ||
private int _lastModifiedIndex = -1; | ||
|
||
public void Prepare(Optimiser optimiser, Chunk chunk) | ||
{ | ||
_lastModifiedIndex = -1; | ||
} | ||
|
||
public void ProcessPacket(Optimiser optimiser, Chunk chunk, int inst, ByteCodePacket packet) | ||
{ | ||
switch (packet.OpCode) | ||
{ | ||
case OpCode.ADD: | ||
case OpCode.MULTIPLY: | ||
case OpCode.EQUAL: | ||
if (inst < 2) return; //need at least 2 instructions to do anything | ||
|
||
//these are commutative so we can swap the order of the operands if it might make future passes easier/possible | ||
var prev = chunk.Instructions[inst - 1]; | ||
var prevPrev = chunk.Instructions[inst - 2]; | ||
|
||
if (prevPrev.OpCode == OpCode.GET_LOCAL && _lastModifiedIndex != inst - 2) | ||
{ | ||
switch (prev.OpCode) | ||
{ | ||
case OpCode.PUSH_VALUE: | ||
case OpCode.PUSH_CONSTANT: | ||
//we can swap those two instructions | ||
chunk.Instructions[inst - 2] = prev; | ||
chunk.Instructions[inst - 1] = prevPrev; | ||
_lastModifiedIndex = inst - 1; | ||
break; | ||
} | ||
} | ||
break; | ||
} | ||
} | ||
|
||
public PassCompleteRequest Complete(Optimiser optimiser, Chunk chunk) | ||
{ | ||
return PassCompleteRequest.None; | ||
} | ||
} | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters