/*****************************************************************************/
/* */
-/* codeopt.c */
+/* codeopt.c */
/* */
-/* Optimizer subroutines */
+/* Optimizer subroutines */
/* */
/* */
/* */
-/* (C) 2001 Ullrich von Bassewitz */
-/* Wacholderweg 14 */
-/* D-70597 Stuttgart */
-/* EMail: uz@cc65.org */
+/* (C) 2001-2012, Ullrich von Bassewitz */
+/* Roemerstrasse 52 */
+/* D-70794 Filderstadt */
+/* EMail: uz@cc65.org */
/* */
/* */
/* This software is provided 'as-is', without any expressed or implied */
+#include <stdlib.h>
#include <string.h>
+#include <stdarg.h>
/* common */
#include "abend.h"
+#include "chartype.h"
+#include "cpu.h"
+#include "debugflag.h"
#include "print.h"
+#include "strbuf.h"
+#include "xmalloc.h"
+#include "xsprintf.h"
/* cc65 */
#include "asmlabel.h"
#include "codeent.h"
#include "codeinfo.h"
+#include "codeopt.h"
+#include "coptadd.h"
+#include "coptc02.h"
+#include "coptcmp.h"
+#include "coptind.h"
+#include "coptneg.h"
+#include "coptptrload.h"
+#include "coptptrstore.h"
+#include "coptpush.h"
+#include "coptshift.h"
+#include "coptsize.h"
+#include "coptstop.h"
+#include "coptstore.h"
+#include "coptsub.h"
+#include "copttest.h"
#include "error.h"
#include "global.h"
-#include "codeopt.h"
-
+#include "output.h"
+#include "symtab.h"
/*****************************************************************************/
-/* Data */
+/* Optimize loads */
/*****************************************************************************/
-/* Counter for the number of changes in one run. The optimizer process is
- * repeated until there are no more changes.
- */
-static unsigned OptChanges;
-
-/* Defines for the conditions in a compare */
-typedef enum {
- CMP_INV = -1,
- CMP_EQ,
- CMP_NE,
- CMP_GT,
- CMP_GE,
- CMP_LT,
- CMP_LE,
- CMP_UGT,
- CMP_UGE,
- CMP_ULT,
- CMP_ULE
-} cmp_t;
-
-/* Table with the compare suffixes */
-static const char CmpSuffixTab [][4] = {
- "eq", "ne", "gt", "ge", "lt", "le", "ugt", "uge", "ult", "ule"
-};
+static unsigned OptLoad1 (CodeSeg* S)
+/* Search for a call to ldaxysp where X is not used later and replace it by
+** a load of just the A register.
+*/
+{
+ unsigned I;
+ unsigned Changes = 0;
-/* Table used to invert a condition, indexed by condition */
-static const unsigned char CmpInvertTab [] = {
- CMP_NE, CMP_EQ,
- CMP_LE, CMP_LT, CMP_GE, CMP_GT,
- CMP_ULE, CMP_ULT, CMP_UGE, CMP_UGT
-};
+ /* Walk over the entries */
+ I = 0;
+ while (I < CS_GetEntryCount (S)) {
-/* Table to show which compares are signed (use the N flag) */
-static const char CmpSignedTab [] = {
- 0, 0, 1, 1, 1, 1, 0, 0, 0, 0
-};
+ CodeEntry* E;
+ /* Get next entry */
+ E = CS_GetEntry (S, I);
+ /* Check for the sequence */
+ if (CE_IsCallTo (E, "ldaxysp") &&
+ RegValIsKnown (E->RI->In.RegY) &&
+ !RegXUsed (S, I+1)) {
-/*****************************************************************************/
-/* Helper functions */
-/*****************************************************************************/
+ CodeEntry* X;
+ /* Reload the Y register */
+ const char* Arg = MakeHexArg (E->RI->In.RegY - 1);
+ X = NewCodeEntry (OP65_LDY, AM65_IMM, Arg, 0, E->LI);
+ CS_InsertEntry (S, X, I+1);
+ /* Load from stack */
+ X = NewCodeEntry (OP65_LDA, AM65_ZP_INDY, "sp", 0, E->LI);
+ CS_InsertEntry (S, X, I+2);
-static cmp_t FindCmpCond (const char* Suffix)
-/* Map a condition suffix to a code. Return the code or CMP_INV on failure */
-{
- int I;
-
- /* Linear search */
- for (I = 0; I < sizeof (CmpSuffixTab) / sizeof (CmpSuffixTab [0]); ++I) {
- if (strcmp (Suffix, CmpSuffixTab [I]) == 0) {
- /* Found */
- return I;
- }
- }
+ /* Now remove the call to the subroutine */
+ CS_DelEntry (S, I);
- /* Not found */
- return CMP_INV;
-}
+ /* Remember, we had changes */
+ ++Changes;
+ }
+ /* Next entry */
+ ++I;
-/*****************************************************************************/
-/* Remove dead jumps */
-/*****************************************************************************/
+ }
+
+ /* Return the number of changes made */
+ return Changes;
+}
-static void OptDeadJumps (CodeSeg* S)
-/* Remove dead jumps (jumps to the next instruction) */
+static unsigned OptLoad2 (CodeSeg* S)
+/* Replace calls to ldaxysp by inline code */
{
- CodeEntry* E;
unsigned I;
+ unsigned Changes = 0;
- /* Get the number of entries, bail out if we have less than two entries */
- unsigned Count = GetCodeEntryCount (S);
- if (Count < 2) {
- return;
- }
-
- /* Walk over all entries minus the last one */
+ /* Walk over the entries */
I = 0;
- while (I < Count-1) {
+ while (I < CS_GetEntryCount (S)) {
- /* Get the next entry */
- E = GetCodeEntry (S, I);
+ CodeEntry* L[3];
- /* Check if it's a branch, if it has a local target, and if the target
- * is the next instruction.
- */
- if (E->AM == AM_BRA && E->JumpTo && E->JumpTo->Owner == GetCodeEntry (S, I+1)) {
+ /* Get next entry */
+ L[0] = CS_GetEntry (S, I);
- /* Delete the dead jump */
- DelCodeEntry (S, I);
+ /* Check for the sequence */
+ if (CE_IsCallTo (L[0], "ldaxysp")) {
- /* Keep the number of entries updated */
- --Count;
+ CodeEntry* X;
- /* Remember, we had changes */
- ++OptChanges;
+ /* Followed by sta abs/stx abs? */
+ if (CS_GetEntries (S, L+1, I+1, 2) &&
+ L[1]->OPC == OP65_STA &&
+ L[2]->OPC == OP65_STX &&
+ (L[1]->Arg == 0 ||
+ L[2]->Arg == 0 ||
+ strcmp (L[1]->Arg, L[2]->Arg) != 0) &&
+ !CS_RangeHasLabel (S, I+1, 2) &&
+ !RegXUsed (S, I+3)) {
- } else {
+ /* A/X are stored into memory somewhere and X is not used
+ ** later
+ */
- /* Next entry */
- ++I;
+ /* lda (sp),y */
+ X = NewCodeEntry (OP65_LDA, AM65_ZP_INDY, "sp", 0, L[0]->LI);
+ CS_InsertEntry (S, X, I+3);
- }
- }
-}
+ /* sta abs */
+ X = NewCodeEntry (OP65_STA, L[2]->AM, L[2]->Arg, 0, L[2]->LI);
+ CS_InsertEntry (S, X, I+4);
+ /* dey */
+ X = NewCodeEntry (OP65_DEY, AM65_IMP, 0, 0, L[0]->LI);
+ CS_InsertEntry (S, X, I+5);
+ /* lda (sp),y */
+ X = NewCodeEntry (OP65_LDA, AM65_ZP_INDY, "sp", 0, L[0]->LI);
+ CS_InsertEntry (S, X, I+6);
-/*****************************************************************************/
-/* Remove dead code */
-/*****************************************************************************/
+ /* sta abs */
+ X = NewCodeEntry (OP65_STA, L[1]->AM, L[1]->Arg, 0, L[1]->LI);
+ CS_InsertEntry (S, X, I+7);
+ /* Now remove the call to the subroutine and the sta/stx */
+ CS_DelEntries (S, I, 3);
+ } else {
-static void OptDeadCode (CodeSeg* S)
-/* Remove dead code (code that follows an unconditional jump or an rts/rti
- * and has no label)
- */
-{
- unsigned I;
+ /* Standard replacement */
- /* Get the number of entries, bail out if we have less than two entries */
- unsigned Count = GetCodeEntryCount (S);
- if (Count < 2) {
- return;
- }
-
- /* Walk over all entries minus the last one */
- I = 0;
- while (I < Count-1) {
+ /* lda (sp),y */
+ X = NewCodeEntry (OP65_LDA, AM65_ZP_INDY, "sp", 0, L[0]->LI);
+ CS_InsertEntry (S, X, I+1);
- /* Get this entry */
- CodeEntry* E = GetCodeEntry (S, I);
+ /* tax */
+ X = NewCodeEntry (OP65_TAX, AM65_IMP, 0, 0, L[0]->LI);
+ CS_InsertEntry (S, X, I+2);
- /* Check if it's an unconditional branch, and if the next entry has
- * no labels attached
- */
- if ((E->Info & OF_DEAD) != 0 && !CodeEntryHasLabel (GetCodeEntry (S, I+1))) {
+ /* dey */
+ X = NewCodeEntry (OP65_DEY, AM65_IMP, 0, 0, L[0]->LI);
+ CS_InsertEntry (S, X, I+3);
- /* Delete the next entry */
- DelCodeEntry (S, I+1);
+ /* lda (sp),y */
+ X = NewCodeEntry (OP65_LDA, AM65_ZP_INDY, "sp", 0, L[0]->LI);
+ CS_InsertEntry (S, X, I+4);
- /* Keep the number of entries updated */
- --Count;
+ /* Now remove the call to the subroutine */
+ CS_DelEntry (S, I);
- /* Remember, we had changes */
- ++OptChanges;
+ }
- } else {
+ /* Remember, we had changes */
+ ++Changes;
- /* Next entry */
- ++I;
+ }
- }
+ /* Next entry */
+ ++I;
}
+
+ /* Return the number of changes made */
+ return Changes;
}
-/*****************************************************************************/
-/* Optimize jump cascades */
-/*****************************************************************************/
+static unsigned OptLoad3 (CodeSeg* S)
+/* Remove repeated loads from one and the same memory location */
+{
+ unsigned Changes = 0;
+ CodeEntry* Load = 0;
+ /* Walk over the entries */
+ unsigned I = 0;
+ while (I < CS_GetEntryCount (S)) {
+ /* Get next entry */
+ CodeEntry* E = CS_GetEntry (S, I);
-static void OptJumpCascades (CodeSeg* S)
-/* Optimize jump cascades (jumps to jumps). In such a case, the jump is
- * replaced by a jump to the final location. This will in some cases produce
- * worse code, because some jump targets are no longer reachable by short
- * branches, but this is quite rare, so there are more advantages than
- * disadvantages.
- */
-{
- unsigned I;
+ /* Forget a preceeding load if we have a label */
+ if (Load && CE_HasLabel (E)) {
+ Load = 0;
+ }
- /* Get the number of entries, bail out if we have no entries */
- unsigned Count = GetCodeEntryCount (S);
- if (Count == 0) {
- return;
- }
+ /* Check if this insn is a load */
+ if (E->Info & OF_LOAD) {
- /* Walk over all entries */
- I = 0;
- while (I < Count) {
-
- /* Get this entry */
- CodeEntry* E = GetCodeEntry (S, I);
-
- /* Check if it's a branch, if it has a jump label, and if this jump
- * label is not attached to the instruction itself.
- */
- if ((E->Info & OF_BRA) != 0 && E->JumpTo != 0 && E->JumpTo->Owner != E) {
-
- /* Get the label this insn is branching to */
- CodeLabel* OldLabel = E->JumpTo;
-
- /* Get the entry we're branching to */
- CodeEntry* N = OldLabel->Owner;
-
- /* If the entry we're branching to is not itself a branch, it is
- * not what we're searching for.
- */
- if ((N->Info & OF_BRA) == 0) {
- goto NextEntry;
- }
-
- /* Check if we can use the final target label. This is the case,
- * if the target branch is an absolut branch, or if it is a
- * conditional branch checking the same condition as the first one.
- */
- if ((N->Info & OF_UBRA) != 0 ||
- ((E->Info & OF_CBRA) != 0 &&
- GetBranchCond (E->OPC) == GetBranchCond (N->OPC))) {
-
- /* This is a jump cascade and we may jump to the final target.
- * If we have a label, move the reference to this label. If
- * we don't have a label, use the argument instead.
- */
- if (N->JumpTo) {
- /* Move the reference to the new insn */
- MoveCodeLabelRef (S, E, N->JumpTo);
- } else {
- /* Remove the reference to the old label */
- RemoveCodeLabelRef (S, E);
- }
-
- /* Use the new argument */
- CodeEntrySetArg (E, N->Arg);
-
- /* Use the usage information from the new instruction */
- E->Use = N->Use;
- E->Chg = N->Chg;
-
- /* Remember, we had changes */
- ++OptChanges;
-
- /* Done */
- continue;
-
- }
-
- /* Check if both are conditional branches, and the condition of
- * the second is the inverse of that of the first. In this case,
- * the second branch will never be taken, and we may jump directly
- * to the instruction behind this one.
- */
- goto NextEntry;
-
- }
-
-NextEntry:
- /* Next entry */
- ++I;
+ CodeEntry* N;
+
+ /* If we had a preceeding load that is identical, remove this one.
+ ** If it is not identical, or we didn't have one, remember it.
+ */
+ if (Load != 0 &&
+ E->OPC == Load->OPC &&
+ E->AM == Load->AM &&
+ ((E->Arg == 0 && Load->Arg == 0) ||
+ strcmp (E->Arg, Load->Arg) == 0) &&
+ (N = CS_GetNextEntry (S, I)) != 0 &&
+ (N->Info & OF_CBRA) == 0) {
+
+ /* Now remove the call to the subroutine */
+ CS_DelEntry (S, I);
+
+ /* Remember, we had changes */
+ ++Changes;
+
+ /* Next insn */
+ continue;
+ } else {
+
+ Load = E;
+
+ }
+
+ } else if ((E->Info & OF_CMP) == 0 && (E->Info & OF_CBRA) == 0) {
+ /* Forget the first load on occurance of any insn we don't like */
+ Load = 0;
+ }
+
+ /* Next entry */
+ ++I;
}
+
+ /* Return the number of changes made */
+ return Changes;
}
/*****************************************************************************/
-/* Optimize jsr/rts */
+/* Decouple operations */
/*****************************************************************************/
-static void OptRTS (CodeSeg* S)
-/* Optimize subroutine calls followed by an RTS. The subroutine call will get
- * replaced by a jump. Don't bother to delete the RTS if it does not have a
- * label, the dead code elimination should take care of it.
- */
+static unsigned OptDecouple (CodeSeg* S)
+/* Decouple operations, that is, do the following replacements:
+**
+** dex -> ldx #imm
+** inx -> ldx #imm
+** dey -> ldy #imm
+** iny -> ldy #imm
+** tax -> ldx #imm
+** txa -> lda #imm
+** tay -> ldy #imm
+** tya -> lda #imm
+** lda zp -> lda #imm
+** ldx zp -> ldx #imm
+** ldy zp -> ldy #imm
+**
+** Provided that the register values are known of course.
+*/
{
+ unsigned Changes = 0;
unsigned I;
- /* Get the number of entries, bail out if we have less than 2 entries */
- unsigned Count = GetCodeEntryCount (S);
- if (Count < 2) {
- return;
- }
-
- /* Walk over all entries minus the last one */
+ /* Walk over the entries */
I = 0;
- while (I < Count-1) {
+ while (I < CS_GetEntryCount (S)) {
+
+ const char* Arg;
+
+ /* Get next entry and it's input register values */
+ CodeEntry* E = CS_GetEntry (S, I);
+ const RegContents* In = &E->RI->In;
+
+ /* Assume we have no replacement */
+ CodeEntry* X = 0;
+
+ /* Check the instruction */
+ switch (E->OPC) {
+
+ case OP65_DEA:
+ if (RegValIsKnown (In->RegA)) {
+ Arg = MakeHexArg ((In->RegA - 1) & 0xFF);
+ X = NewCodeEntry (OP65_LDA, AM65_IMM, Arg, 0, E->LI);
+ }
+ break;
+
+ case OP65_DEX:
+ if (RegValIsKnown (In->RegX)) {
+ Arg = MakeHexArg ((In->RegX - 1) & 0xFF);
+ X = NewCodeEntry (OP65_LDX, AM65_IMM, Arg, 0, E->LI);
+ }
+ break;
+
+ case OP65_DEY:
+ if (RegValIsKnown (In->RegY)) {
+ Arg = MakeHexArg ((In->RegY - 1) & 0xFF);
+ X = NewCodeEntry (OP65_LDY, AM65_IMM, Arg, 0, E->LI);
+ }
+ break;
+
+ case OP65_INA:
+ if (RegValIsKnown (In->RegA)) {
+ Arg = MakeHexArg ((In->RegA + 1) & 0xFF);
+ X = NewCodeEntry (OP65_LDA, AM65_IMM, Arg, 0, E->LI);
+ }
+ break;
+
+ case OP65_INX:
+ if (RegValIsKnown (In->RegX)) {
+ Arg = MakeHexArg ((In->RegX + 1) & 0xFF);
+ X = NewCodeEntry (OP65_LDX, AM65_IMM, Arg, 0, E->LI);
+ }
+ break;
+
+ case OP65_INY:
+ if (RegValIsKnown (In->RegY)) {
+ Arg = MakeHexArg ((In->RegY + 1) & 0xFF);
+ X = NewCodeEntry (OP65_LDY, AM65_IMM, Arg, 0, E->LI);
+ }
+ break;
+
+ case OP65_LDA:
+ if (E->AM == AM65_ZP) {
+ switch (GetKnownReg (E->Use & REG_ZP, In)) {
+ case REG_TMP1:
+ Arg = MakeHexArg (In->Tmp1);
+ X = NewCodeEntry (OP65_LDA, AM65_IMM, Arg, 0, E->LI);
+ break;
+
+ case REG_PTR1_LO:
+ Arg = MakeHexArg (In->Ptr1Lo);
+ X = NewCodeEntry (OP65_LDA, AM65_IMM, Arg, 0, E->LI);
+ break;
+
+ case REG_PTR1_HI:
+ Arg = MakeHexArg (In->Ptr1Hi);
+ X = NewCodeEntry (OP65_LDA, AM65_IMM, Arg, 0, E->LI);
+ break;
+
+ case REG_SREG_LO:
+ Arg = MakeHexArg (In->SRegLo);
+ X = NewCodeEntry (OP65_LDA, AM65_IMM, Arg, 0, E->LI);
+ break;
+
+ case REG_SREG_HI:
+ Arg = MakeHexArg (In->SRegHi);
+ X = NewCodeEntry (OP65_LDA, AM65_IMM, Arg, 0, E->LI);
+ break;
+ }
+ }
+ break;
+
+ case OP65_LDX:
+ if (E->AM == AM65_ZP) {
+ switch (GetKnownReg (E->Use & REG_ZP, In)) {
+ case REG_TMP1:
+ Arg = MakeHexArg (In->Tmp1);
+ X = NewCodeEntry (OP65_LDX, AM65_IMM, Arg, 0, E->LI);
+ break;
+
+ case REG_PTR1_LO:
+ Arg = MakeHexArg (In->Ptr1Lo);
+ X = NewCodeEntry (OP65_LDX, AM65_IMM, Arg, 0, E->LI);
+ break;
+
+ case REG_PTR1_HI:
+ Arg = MakeHexArg (In->Ptr1Hi);
+ X = NewCodeEntry (OP65_LDX, AM65_IMM, Arg, 0, E->LI);
+ break;
+
+ case REG_SREG_LO:
+ Arg = MakeHexArg (In->SRegLo);
+ X = NewCodeEntry (OP65_LDX, AM65_IMM, Arg, 0, E->LI);
+ break;
+
+ case REG_SREG_HI:
+ Arg = MakeHexArg (In->SRegHi);
+ X = NewCodeEntry (OP65_LDX, AM65_IMM, Arg, 0, E->LI);
+ break;
+ }
+ }
+ break;
+
+ case OP65_LDY:
+ if (E->AM == AM65_ZP) {
+ switch (GetKnownReg (E->Use, In)) {
+ case REG_TMP1:
+ Arg = MakeHexArg (In->Tmp1);
+ X = NewCodeEntry (OP65_LDY, AM65_IMM, Arg, 0, E->LI);
+ break;
+
+ case REG_PTR1_LO:
+ Arg = MakeHexArg (In->Ptr1Lo);
+ X = NewCodeEntry (OP65_LDY, AM65_IMM, Arg, 0, E->LI);
+ break;
+
+ case REG_PTR1_HI:
+ Arg = MakeHexArg (In->Ptr1Hi);
+ X = NewCodeEntry (OP65_LDY, AM65_IMM, Arg, 0, E->LI);
+ break;
+
+ case REG_SREG_LO:
+ Arg = MakeHexArg (In->SRegLo);
+ X = NewCodeEntry (OP65_LDY, AM65_IMM, Arg, 0, E->LI);
+ break;
+
+ case REG_SREG_HI:
+ Arg = MakeHexArg (In->SRegHi);
+ X = NewCodeEntry (OP65_LDY, AM65_IMM, Arg, 0, E->LI);
+ break;
+ }
+ }
+ break;
+
+ case OP65_TAX:
+ if (E->RI->In.RegA >= 0) {
+ Arg = MakeHexArg (In->RegA);
+ X = NewCodeEntry (OP65_LDX, AM65_IMM, Arg, 0, E->LI);
+ }
+ break;
+
+ case OP65_TAY:
+ if (E->RI->In.RegA >= 0) {
+ Arg = MakeHexArg (In->RegA);
+ X = NewCodeEntry (OP65_LDY, AM65_IMM, Arg, 0, E->LI);
+ }
+ break;
+
+ case OP65_TXA:
+ if (E->RI->In.RegX >= 0) {
+ Arg = MakeHexArg (In->RegX);
+ X = NewCodeEntry (OP65_LDA, AM65_IMM, Arg, 0, E->LI);
+ }
+ break;
+
+ case OP65_TYA:
+ if (E->RI->In.RegY >= 0) {
+ Arg = MakeHexArg (In->RegY);
+ X = NewCodeEntry (OP65_LDA, AM65_IMM, Arg, 0, E->LI);
+ }
+ break;
+
+ default:
+ /* Avoid gcc warnings */
+ break;
+
+ }
+
+ /* Insert the replacement if we have one */
+ if (X) {
+ CS_InsertEntry (S, X, I+1);
+ CS_DelEntry (S, I);
+ ++Changes;
+ }
+
+ /* Next entry */
+ ++I;
- /* Get this entry */
- CodeEntry* E = GetCodeEntry (S, I);
+ }
+
+ /* Return the number of changes made */
+ return Changes;
+}
- /* Check if it's a subroutine call and if the following insn is RTS */
- if (E->OPC == OPC_JSR && GetCodeEntry(S,I+1)->OPC == OPC_RTS) {
- /* Change the jsr to a jmp and use the additional info for a jump */
- E->OPC = OPC_JMP;
- E->AM = AM_BRA;
- E->Info = GetOPCInfo (OPC_JMP);
- /* Remember, we had changes */
- ++OptChanges;
+/*****************************************************************************/
+/* Optimize stack pointer ops */
+/*****************************************************************************/
- }
- /* Next entry */
- ++I;
+static unsigned IsDecSP (const CodeEntry* E)
+/* Check if this is an insn that decrements the stack pointer. If so, return
+** the decrement. If not, return zero.
+** The function expects E to be a subroutine call.
+*/
+{
+ if (strncmp (E->Arg, "decsp", 5) == 0) {
+ if (E->Arg[5] >= '1' && E->Arg[5] <= '8') {
+ return (E->Arg[5] - '0');
+ }
+ } else if (strcmp (E->Arg, "subysp") == 0 && RegValIsKnown (E->RI->In.RegY)) {
+ return E->RI->In.RegY;
}
+
+ /* If we come here, it's not a decsp op */
+ return 0;
}
-/*****************************************************************************/
-/* Optimize jump targets */
-/*****************************************************************************/
+static unsigned OptStackPtrOps (CodeSeg* S)
+/* Merge adjacent calls to decsp into one. NOTE: This function won't merge all
+** known cases!
+*/
+{
+ unsigned Changes = 0;
+ unsigned I;
+
+ /* Walk over the entries */
+ I = 0;
+ while (I < CS_GetEntryCount (S)) {
+
+ unsigned Dec1;
+ unsigned Dec2;
+ const CodeEntry* N;
+
+ /* Get the next entry */
+ const CodeEntry* E = CS_GetEntry (S, I);
+
+ /* Check for decspn or subysp */
+ if (E->OPC == OP65_JSR &&
+ (Dec1 = IsDecSP (E)) > 0 &&
+ (N = CS_GetNextEntry (S, I)) != 0 &&
+ (Dec2 = IsDecSP (N)) > 0 &&
+ (Dec1 += Dec2) <= 255 &&
+ !CE_HasLabel (N)) {
+
+ CodeEntry* X;
+ char Buf[20];
+
+ /* We can combine the two */
+ if (Dec1 <= 8) {
+ /* Insert a call to decsp */
+ xsprintf (Buf, sizeof (Buf), "decsp%u", Dec1);
+ X = NewCodeEntry (OP65_JSR, AM65_ABS, Buf, 0, N->LI);
+ CS_InsertEntry (S, X, I+2);
+ } else {
+ /* Insert a call to subysp */
+ const char* Arg = MakeHexArg (Dec1);
+ X = NewCodeEntry (OP65_LDY, AM65_IMM, Arg, 0, N->LI);
+ CS_InsertEntry (S, X, I+2);
+ X = NewCodeEntry (OP65_JSR, AM65_ABS, "subysp", 0, N->LI);
+ CS_InsertEntry (S, X, I+3);
+ }
+
+ /* Delete the old code */
+ CS_DelEntries (S, I, 2);
+
+ /* Regenerate register info */
+ CS_GenRegInfo (S);
+
+ /* Remember we had changes */
+ ++Changes;
+
+ } else {
+
+ /* Next entry */
+ ++I;
+ }
+ }
+ /* Return the number of changes made */
+ return Changes;
+}
-static void OptJumpTarget (CodeSeg* S)
-/* If the instruction preceeding an unconditional branch is the same as the
- * instruction preceeding the jump target, the jump target may be moved
- * one entry back. This is a size optimization, since the instruction before
- * the branch gets removed.
- */
+static unsigned OptGotoSPAdj (CodeSeg* S)
+/* Optimize SP adjustment for forward 'goto' */
{
- CodeEntry* E1; /* Entry 1 */
- CodeEntry* E2; /* Entry 2 */
- CodeEntry* T1; /* Jump target entry 1 */
- CodeEntry* T2; /* Jump target entry 2 */
- CodeLabel* TL1; /* Target label 1 */
- unsigned TI; /* Target index */
+ unsigned Changes = 0;
unsigned I;
- /* Get the number of entries, bail out if we have not enough */
- unsigned Count = GetCodeEntryCount (S);
- if (Count < 3) {
- return;
- }
-
/* Walk over the entries */
I = 0;
- while (I < Count-1) {
+ while (I < CS_GetEntryCount (S)) {
+
+ CodeEntry* L[10], *X;
+ unsigned short adjustment;
+ const char* Arg;
+
+ /* Get next entry */
+ L[0] = CS_GetEntry (S, I);
+
+ /* Check for the sequence generated by g_lateadjustSP */
+ if (L[0]->OPC == OP65_PHA &&
+ CS_GetEntries (S, L+1, I+1, 9) &&
+ L[1]->OPC == OP65_LDA &&
+ L[1]->AM == AM65_ABS &&
+ L[2]->OPC == OP65_CLC &&
+ L[3]->OPC == OP65_ADC &&
+ strcmp (L[3]->Arg, "sp") == 0 &&
+ L[6]->OPC == OP65_ADC &&
+ strcmp (L[6]->Arg, "sp+1") == 0 &&
+ L[9]->OPC == OP65_JMP) {
+ adjustment = FindSPAdjustment (L[1]->Arg);
+
+ if (adjustment == 0) {
+ /* No SP adjustment needed, remove the whole sequence */
+ CS_DelEntries (S, I, 9);
+ }
+ else if (adjustment >= 65536 - 8) {
+ /* If adjustment is in range [-8, 0) we use decsp* calls */
+ char Buf[20];
+ adjustment = 65536 - adjustment;
+ xsprintf (Buf, sizeof (Buf), "decsp%u", adjustment);
+ X = NewCodeEntry (OP65_JSR, AM65_ABS, Buf, 0, L[1]->LI);
+ CS_InsertEntry (S, X, I + 9);
+
+ /* Delete the old code */
+ CS_DelEntries (S, I, 9);
+ }
+ else if (adjustment >= 65536 - 255) {
+ /* For range [-255, -8) we have ldy #, jsr subysp */
+ adjustment = 65536 - adjustment;
+ Arg = MakeHexArg (adjustment);
+ X = NewCodeEntry (OP65_LDY, AM65_IMM, Arg, 0, L[1]->LI);
+ CS_InsertEntry (S, X, I + 9);
+ X = NewCodeEntry (OP65_JSR, AM65_ABS, "subysp", 0, L[1]->LI);
+ CS_InsertEntry (S, X, I + 10);
+
+ /* Delete the old code */
+ CS_DelEntries (S, I, 9);
+ }
+ else if (adjustment > 255) {
+ /* For ranges [-32768, 255) and (255, 32767) the only modification
+ ** is to replace the absolute with immediate addressing
+ */
+ Arg = MakeHexArg (adjustment & 0xff);
+ X = NewCodeEntry (OP65_LDA, AM65_IMM, Arg, 0, L[1]->LI);
+ CS_InsertEntry (S, X, I + 1);
+ Arg = MakeHexArg (adjustment >> 8);
+ X = NewCodeEntry (OP65_LDA, AM65_IMM, Arg, 0, L[5]->LI);
+ CS_InsertEntry (S, X, I + 6);
+
+ /* Delete the old code */
+ CS_DelEntry (S, I + 2);
+ CS_DelEntry (S, I + 6);
+ }
+ else if (adjustment > 8) {
+ /* For range (8, 255] we have ldy #, jsr addysp */
+ Arg = MakeHexArg (adjustment & 0xff);
+ X = NewCodeEntry (OP65_LDY, AM65_IMM, Arg, 0, L[1]->LI);
+ CS_InsertEntry (S, X, I + 9);
+ X = NewCodeEntry (OP65_JSR, AM65_ABS, "addysp", 0, L[1]->LI);
+ CS_InsertEntry (S, X, I + 10);
+
+ /* Delete the old code */
+ CS_DelEntries (S, I, 9);
+ }
+ else {
+ /* If adjustment is in range (0, 8] we use incsp* calls */
+ char Buf[20];
+ xsprintf (Buf, sizeof (Buf), "incsp%u", adjustment);
+ X = NewCodeEntry (OP65_JSR, AM65_ABS, Buf, 0, L[1]->LI);
+ CS_InsertEntry (S, X, I + 9);
+
+ /* Delete the old code */
+ CS_DelEntries (S, I, 9);
+ }
+ /* Regenerate register info */
+ CS_GenRegInfo (S);
+
+ /* Remember we had changes */
+ Changes++;
+
+ } else {
+
+ /* Next entry */
+ ++I;
+ }
- /* Get next entry */
- E2 = GetCodeEntry (S, I+1);
+ }
- /* Check if we have a jump or branch, and a matching label */
- if ((E2->Info & OF_UBRA) != 0 && E2->JumpTo) {
+ /* Return the number of changes made */
+ return Changes;
+}
- /* Get the target instruction for the label */
- T2 = E2->JumpTo->Owner;
+/*****************************************************************************/
+/* struct OptFunc */
+/*****************************************************************************/
- /* Get the entry preceeding this one (if possible) */
- TI = GetCodeEntryIndex (S, T2);
- if (TI == 0) {
- /* There is no entry before this one */
- goto NextEntry;
- }
- T1 = GetCodeEntry (S, TI-1);
- /* Get the entry preceeding the jump */
- E1 = GetCodeEntry (S, I);
- /* Check if both preceeding instructions are identical */
- if (!CodeEntriesAreEqual (E1, T1)) {
- /* Not equal, try next */
- goto NextEntry;
- }
+typedef struct OptFunc OptFunc;
+struct OptFunc {
+ unsigned (*Func) (CodeSeg*); /* Optimizer function */
+ const char* Name; /* Name of the function/group */
+ unsigned CodeSizeFactor; /* Code size factor for this opt func */
+ unsigned long TotalRuns; /* Total number of runs */
+ unsigned long LastRuns; /* Last number of runs */
+ unsigned long TotalChanges; /* Total number of changes */
+ unsigned long LastChanges; /* Last number of changes */
+ char Disabled; /* True if function disabled */
+};
+
- /* Get the label for the instruction preceeding the jump target.
- * This routine will create a new label if the instruction does
- * not already have one.
- */
- TL1 = GenCodeLabel (S, T1);
- /* Change the jump target to point to this new label */
- MoveCodeLabelRef (S, E2, TL1);
+/*****************************************************************************/
+/* Code */
+/*****************************************************************************/
- /* If the instruction preceeding the jump has labels attached,
- * move references to this label to the new label.
- */
- if (CodeEntryHasLabel (E1)) {
- MoveCodeLabels (S, E1, T1);
- }
- /* Remove the entry preceeding the jump */
- DelCodeEntry (S, I);
- --Count;
- /* Remember, we had changes */
- ++OptChanges;
+/* A list of all the function descriptions */
+static OptFunc DOpt65C02BitOps = { Opt65C02BitOps, "Opt65C02BitOps", 66, 0, 0, 0, 0, 0 };
+static OptFunc DOpt65C02Ind = { Opt65C02Ind, "Opt65C02Ind", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOpt65C02Stores = { Opt65C02Stores, "Opt65C02Stores", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptAdd1 = { OptAdd1, "OptAdd1", 125, 0, 0, 0, 0, 0 };
+static OptFunc DOptAdd2 = { OptAdd2, "OptAdd2", 200, 0, 0, 0, 0, 0 };
+static OptFunc DOptAdd3 = { OptAdd3, "OptAdd3", 65, 0, 0, 0, 0, 0 };
+static OptFunc DOptAdd4 = { OptAdd4, "OptAdd4", 90, 0, 0, 0, 0, 0 };
+static OptFunc DOptAdd5 = { OptAdd5, "OptAdd5", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptAdd6 = { OptAdd6, "OptAdd6", 40, 0, 0, 0, 0, 0 };
+static OptFunc DOptBNegA1 = { OptBNegA1, "OptBNegA1", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptBNegA2 = { OptBNegA2, "OptBNegA2", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptBNegAX1 = { OptBNegAX1, "OptBNegAX1", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptBNegAX2 = { OptBNegAX2, "OptBNegAX2", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptBNegAX3 = { OptBNegAX3, "OptBNegAX3", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptBNegAX4 = { OptBNegAX4, "OptBNegAX4", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptBoolTrans = { OptBoolTrans, "OptBoolTrans", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptBranchDist = { OptBranchDist, "OptBranchDist", 0, 0, 0, 0, 0, 0 };
+static OptFunc DOptCmp1 = { OptCmp1, "OptCmp1", 42, 0, 0, 0, 0, 0 };
+static OptFunc DOptCmp2 = { OptCmp2, "OptCmp2", 85, 0, 0, 0, 0, 0 };
+static OptFunc DOptCmp3 = { OptCmp3, "OptCmp3", 75, 0, 0, 0, 0, 0 };
+static OptFunc DOptCmp4 = { OptCmp4, "OptCmp4", 75, 0, 0, 0, 0, 0 };
+static OptFunc DOptCmp5 = { OptCmp5, "OptCmp5", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptCmp6 = { OptCmp6, "OptCmp6", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptCmp7 = { OptCmp7, "OptCmp7", 85, 0, 0, 0, 0, 0 };
+static OptFunc DOptCmp8 = { OptCmp8, "OptCmp8", 50, 0, 0, 0, 0, 0 };
+static OptFunc DOptCmp9 = { OptCmp9, "OptCmp9", 85, 0, 0, 0, 0, 0 };
+static OptFunc DOptComplAX1 = { OptComplAX1, "OptComplAX1", 65, 0, 0, 0, 0, 0 };
+static OptFunc DOptCondBranches1= { OptCondBranches1,"OptCondBranches1", 80, 0, 0, 0, 0, 0 };
+static OptFunc DOptCondBranches2= { OptCondBranches2,"OptCondBranches2", 0, 0, 0, 0, 0, 0 };
+static OptFunc DOptDeadCode = { OptDeadCode, "OptDeadCode", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptDeadJumps = { OptDeadJumps, "OptDeadJumps", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptDecouple = { OptDecouple, "OptDecouple", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptDupLoads = { OptDupLoads, "OptDupLoads", 0, 0, 0, 0, 0, 0 };
+static OptFunc DOptGotoSPAdj = { OptGotoSPAdj, "OptGotoSPAdj", 0, 0, 0, 0, 0, 0 };
+static OptFunc DOptIndLoads1 = { OptIndLoads1, "OptIndLoads1", 0, 0, 0, 0, 0, 0 };
+static OptFunc DOptIndLoads2 = { OptIndLoads2, "OptIndLoads2", 0, 0, 0, 0, 0, 0 };
+static OptFunc DOptJumpCascades = { OptJumpCascades, "OptJumpCascades", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptJumpTarget1 = { OptJumpTarget1, "OptJumpTarget1", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptJumpTarget2 = { OptJumpTarget2, "OptJumpTarget2", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptJumpTarget3 = { OptJumpTarget3, "OptJumpTarget3", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptLoad1 = { OptLoad1, "OptLoad1", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptLoad2 = { OptLoad2, "OptLoad2", 200, 0, 0, 0, 0, 0 };
+static OptFunc DOptLoad3 = { OptLoad3, "OptLoad3", 0, 0, 0, 0, 0, 0 };
+static OptFunc DOptNegAX1 = { OptNegAX1, "OptNegAX1", 165, 0, 0, 0, 0, 0 };
+static OptFunc DOptNegAX2 = { OptNegAX2, "OptNegAX2", 200, 0, 0, 0, 0, 0 };
+static OptFunc DOptRTS = { OptRTS, "OptRTS", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptRTSJumps1 = { OptRTSJumps1, "OptRTSJumps1", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptRTSJumps2 = { OptRTSJumps2, "OptRTSJumps2", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptPrecalc = { OptPrecalc, "OptPrecalc", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptPtrLoad1 = { OptPtrLoad1, "OptPtrLoad1", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptPtrLoad2 = { OptPtrLoad2, "OptPtrLoad2", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptPtrLoad3 = { OptPtrLoad3, "OptPtrLoad3", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptPtrLoad4 = { OptPtrLoad4, "OptPtrLoad4", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptPtrLoad5 = { OptPtrLoad5, "OptPtrLoad5", 50, 0, 0, 0, 0, 0 };
+static OptFunc DOptPtrLoad6 = { OptPtrLoad6, "OptPtrLoad6", 60, 0, 0, 0, 0, 0 };
+static OptFunc DOptPtrLoad7 = { OptPtrLoad7, "OptPtrLoad7", 140, 0, 0, 0, 0, 0 };
+static OptFunc DOptPtrLoad11 = { OptPtrLoad11, "OptPtrLoad11", 92, 0, 0, 0, 0, 0 };
+static OptFunc DOptPtrLoad12 = { OptPtrLoad12, "OptPtrLoad12", 50, 0, 0, 0, 0, 0 };
+static OptFunc DOptPtrLoad13 = { OptPtrLoad13, "OptPtrLoad13", 65, 0, 0, 0, 0, 0 };
+static OptFunc DOptPtrLoad14 = { OptPtrLoad14, "OptPtrLoad14", 108, 0, 0, 0, 0, 0 };
+static OptFunc DOptPtrLoad15 = { OptPtrLoad15, "OptPtrLoad15", 86, 0, 0, 0, 0, 0 };
+static OptFunc DOptPtrLoad16 = { OptPtrLoad16, "OptPtrLoad16", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptPtrLoad17 = { OptPtrLoad17, "OptPtrLoad17", 190, 0, 0, 0, 0, 0 };
+static OptFunc DOptPtrLoad18 = { OptPtrLoad18, "OptPtrLoad18", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptPtrLoad19 = { OptPtrLoad19, "OptPtrLoad19", 65, 0, 0, 0, 0, 0 };
+static OptFunc DOptPtrStore1 = { OptPtrStore1, "OptPtrStore1", 65, 0, 0, 0, 0, 0 };
+static OptFunc DOptPtrStore2 = { OptPtrStore2, "OptPtrStore2", 65, 0, 0, 0, 0, 0 };
+static OptFunc DOptPtrStore3 = { OptPtrStore3, "OptPtrStore3", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptPush1 = { OptPush1, "OptPush1", 65, 0, 0, 0, 0, 0 };
+static OptFunc DOptPush2 = { OptPush2, "OptPush2", 50, 0, 0, 0, 0, 0 };
+static OptFunc DOptPushPop = { OptPushPop, "OptPushPop", 0, 0, 0, 0, 0, 0 };
+static OptFunc DOptShift1 = { OptShift1, "OptShift1", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptShift2 = { OptShift2, "OptShift2", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptShift3 = { OptShift3, "OptShift3", 17, 0, 0, 0, 0, 0 };
+static OptFunc DOptShift4 = { OptShift4, "OptShift4", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptShift5 = { OptShift5, "OptShift5", 110, 0, 0, 0, 0, 0 };
+static OptFunc DOptShift6 = { OptShift6, "OptShift6", 200, 0, 0, 0, 0, 0 };
+static OptFunc DOptSize1 = { OptSize1, "OptSize1", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptSize2 = { OptSize2, "OptSize2", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptStackOps = { OptStackOps, "OptStackOps", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptStackPtrOps = { OptStackPtrOps, "OptStackPtrOps", 50, 0, 0, 0, 0, 0 };
+static OptFunc DOptStore1 = { OptStore1, "OptStore1", 70, 0, 0, 0, 0, 0 };
+static OptFunc DOptStore2 = { OptStore2, "OptStore2", 115, 0, 0, 0, 0, 0 };
+static OptFunc DOptStore3 = { OptStore3, "OptStore3", 120, 0, 0, 0, 0, 0 };
+static OptFunc DOptStore4 = { OptStore4, "OptStore4", 50, 0, 0, 0, 0, 0 };
+static OptFunc DOptStore5 = { OptStore5, "OptStore5", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptStoreLoad = { OptStoreLoad, "OptStoreLoad", 0, 0, 0, 0, 0, 0 };
+static OptFunc DOptSub1 = { OptSub1, "OptSub1", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptSub2 = { OptSub2, "OptSub2", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptSub3 = { OptSub3, "OptSub3", 100, 0, 0, 0, 0, 0 };
+static OptFunc DOptTest1 = { OptTest1, "OptTest1", 65, 0, 0, 0, 0, 0 };
+static OptFunc DOptTest2 = { OptTest2, "OptTest2", 50, 0, 0, 0, 0, 0 };
+static OptFunc DOptTransfers1 = { OptTransfers1, "OptTransfers1", 0, 0, 0, 0, 0, 0 };
+static OptFunc DOptTransfers2 = { OptTransfers2, "OptTransfers2", 60, 0, 0, 0, 0, 0 };
+static OptFunc DOptTransfers3 = { OptTransfers3, "OptTransfers3", 65, 0, 0, 0, 0, 0 };
+static OptFunc DOptTransfers4 = { OptTransfers4, "OptTransfers4", 65, 0, 0, 0, 0, 0 };
+static OptFunc DOptUnusedLoads = { OptUnusedLoads, "OptUnusedLoads", 0, 0, 0, 0, 0, 0 };
+static OptFunc DOptUnusedStores = { OptUnusedStores, "OptUnusedStores", 0, 0, 0, 0, 0, 0 };
+
+
+/* Table containing all the steps in alphabetical order */
+static OptFunc* OptFuncs[] = {
+ &DOpt65C02BitOps,
+ &DOpt65C02Ind,
+ &DOpt65C02Stores,
+ &DOptAdd1,
+ &DOptAdd2,
+ &DOptAdd3,
+ &DOptAdd4,
+ &DOptAdd5,
+ &DOptAdd6,
+ &DOptBNegA1,
+ &DOptBNegA2,
+ &DOptBNegAX1,
+ &DOptBNegAX2,
+ &DOptBNegAX3,
+ &DOptBNegAX4,
+ &DOptBoolTrans,
+ &DOptBranchDist,
+ &DOptCmp1,
+ &DOptCmp2,
+ &DOptCmp3,
+ &DOptCmp4,
+ &DOptCmp5,
+ &DOptCmp6,
+ &DOptCmp7,
+ &DOptCmp8,
+ &DOptCmp9,
+ &DOptComplAX1,
+ &DOptCondBranches1,
+ &DOptCondBranches2,
+ &DOptDeadCode,
+ &DOptDeadJumps,
+ &DOptDecouple,
+ &DOptDupLoads,
+ &DOptGotoSPAdj,
+ &DOptIndLoads1,
+ &DOptIndLoads2,
+ &DOptJumpCascades,
+ &DOptJumpTarget1,
+ &DOptJumpTarget2,
+ &DOptJumpTarget3,
+ &DOptLoad1,
+ &DOptLoad2,
+ &DOptLoad3,
+ &DOptNegAX1,
+ &DOptNegAX2,
+ &DOptPrecalc,
+ &DOptPtrLoad1,
+ &DOptPtrLoad11,
+ &DOptPtrLoad12,
+ &DOptPtrLoad13,
+ &DOptPtrLoad14,
+ &DOptPtrLoad15,
+ &DOptPtrLoad16,
+ &DOptPtrLoad17,
+ &DOptPtrLoad18,
+ &DOptPtrLoad19,
+ &DOptPtrLoad2,
+ &DOptPtrLoad3,
+ &DOptPtrLoad4,
+ &DOptPtrLoad5,
+ &DOptPtrLoad6,
+ &DOptPtrLoad7,
+ &DOptPtrStore1,
+ &DOptPtrStore2,
+ &DOptPtrStore3,
+ &DOptPush1,
+ &DOptPush2,
+ &DOptPushPop,
+ &DOptRTS,
+ &DOptRTSJumps1,
+ &DOptRTSJumps2,
+ &DOptShift1,
+ &DOptShift2,
+ &DOptShift3,
+ &DOptShift4,
+ &DOptShift5,
+ &DOptShift6,
+ &DOptSize1,
+ &DOptSize2,
+ &DOptStackOps,
+ &DOptStackPtrOps,
+ &DOptStore1,
+ &DOptStore2,
+ &DOptStore3,
+ &DOptStore4,
+ &DOptStore5,
+ &DOptStoreLoad,
+ &DOptSub1,
+ &DOptSub2,
+ &DOptSub3,
+ &DOptTest1,
+ &DOptTest2,
+ &DOptTransfers1,
+ &DOptTransfers2,
+ &DOptTransfers3,
+ &DOptTransfers4,
+ &DOptUnusedLoads,
+ &DOptUnusedStores,
+};
+#define OPTFUNC_COUNT (sizeof(OptFuncs) / sizeof(OptFuncs[0]))
- }
-NextEntry:
- /* Next entry */
- ++I;
- }
+static int CmpOptStep (const void* Key, const void* Func)
+/* Compare function for bsearch */
+{
+ return strcmp (Key, (*(const OptFunc**)Func)->Name);
}
-/*****************************************************************************/
-/* Remove conditional jumps never taken */
-/*****************************************************************************/
+static OptFunc* FindOptFunc (const char* Name)
+/* Find an optimizer step by name in the table and return a pointer. Return
+** NULL if no such step is found.
+*/
+{
+ /* Search for the function in the list */
+ OptFunc** O = bsearch (Name, OptFuncs, OPTFUNC_COUNT, sizeof (OptFuncs[0]), CmpOptStep);
+ return O? *O : 0;
+}
-static void OptDeadCondBranches (CodeSeg* S)
-/* If an immidiate load of a register is followed by a conditional jump that
- * is never taken because the load of the register sets the flags in such a
- * manner, remove the conditional branch.
- */
+static OptFunc* GetOptFunc (const char* Name)
+/* Find an optimizer step by name in the table and return a pointer. Print an
+** error and call AbEnd if not found.
+*/
{
- unsigned I;
-
- /* Get the number of entries, bail out if we have not enough */
- unsigned Count = GetCodeEntryCount (S);
- if (Count < 2) {
- return;
+ /* Search for the function in the list */
+ OptFunc* F = FindOptFunc (Name);
+ if (F == 0) {
+ /* Not found */
+ AbEnd ("Optimization step '%s' not found", Name);
}
+ return F;
+}
- /* Walk over the entries */
- I = 0;
- while (I < Count-1) {
-
- /* Get next entry */
- CodeEntry* E = GetCodeEntry (S, I);
- /* Check if it's a register load */
- if ((E->Info & OF_LOAD) != 0 && E->AM == AM_IMM && (E->Flags & CEF_NUMARG) != 0) {
- bc_t BC;
+void DisableOpt (const char* Name)
+/* Disable the optimization with the given name */
+{
+ if (strcmp (Name, "any") == 0) {
+ unsigned I;
+ for (I = 0; I < OPTFUNC_COUNT; ++I) {
+ OptFuncs[I]->Disabled = 1;
+ }
+ } else {
+ GetOptFunc(Name)->Disabled = 1;
+ }
+}
- /* Immidiate register load, get next instruction */
- CodeEntry* N = GetCodeEntry (S, I+1);
- /* Check if the following insn is a conditional branch or if it
- * has a label attached.
- */
- if ((N->Info & OF_CBRA) == 0 || CodeEntryHasLabel (E)) {
- /* No conditional jump or label attached, bail out */
- goto NextEntry;
- }
- /* Get the branch condition */
- BC = GetBranchCond (N->OPC);
+void EnableOpt (const char* Name)
+/* Enable the optimization with the given name */
+{
+ if (strcmp (Name, "any") == 0) {
+ unsigned I;
+ for (I = 0; I < OPTFUNC_COUNT; ++I) {
+ OptFuncs[I]->Disabled = 0;
+ }
+ } else {
+ GetOptFunc(Name)->Disabled = 0;
+ }
+}
- /* Check the argument against the branch condition */
- if ((BC == BC_EQ && E->Num != 0) ||
- (BC == BC_NE && E->Num == 0) ||
- (BC == BC_PL && (E->Num & 0x80) != 0) ||
- (BC == BC_MI && (E->Num & 0x80) == 0)) {
- /* Remove the conditional branch */
- DelCodeEntry (S, I+1);
- --Count;
- /* Remember, we had changes */
- ++OptChanges;
+void ListOptSteps (FILE* F)
+/* List all optimization steps */
+{
+ unsigned I;
+
+ fprintf (F, "any\n");
+ for (I = 0; I < OPTFUNC_COUNT; ++I) {
+ fprintf (F, "%s\n", OptFuncs[I]->Name);
+ }
+}
- }
- }
-NextEntry:
- /* Next entry */
- ++I;
+static void ReadOptStats (const char* Name)
+/* Read the optimizer statistics file */
+{
+ char Buf [256];
+ unsigned Lines;
+
+ /* Try to open the file */
+ FILE* F = fopen (Name, "r");
+ if (F == 0) {
+ /* Ignore the error */
+ return;
}
-}
+ /* Read and parse the lines */
+ Lines = 0;
+ while (fgets (Buf, sizeof (Buf), F) != 0) {
+
+ char* B;
+ unsigned Len;
+ OptFunc* Func;
+
+ /* Fields */
+ char Name[32];
+ unsigned long TotalRuns;
+ unsigned long TotalChanges;
+
+ /* Count lines */
+ ++Lines;
+
+ /* Remove trailing white space including the line terminator */
+ B = Buf;
+ Len = strlen (B);
+ while (Len > 0 && IsSpace (B[Len-1])) {
+ --Len;
+ }
+ B[Len] = '\0';
+
+ /* Remove leading whitespace */
+ while (IsSpace (*B)) {
+ ++B;
+ }
+
+ /* Check for empty and comment lines */
+ if (*B == '\0' || *B == ';' || *B == '#') {
+ continue;
+ }
+
+ /* Parse the line */
+ if (sscanf (B, "%31s %lu %*u %lu %*u", Name, &TotalRuns, &TotalChanges) != 3) {
+ /* Syntax error */
+ continue;
+ }
+
+ /* Search for the optimizer step. */
+ Func = FindOptFunc (Name);
+ if (Func == 0) {
+ /* Not found */
+ continue;
+ }
+
+ /* Found the step, set the fields */
+ Func->TotalRuns = TotalRuns;
+ Func->TotalChanges = TotalChanges;
+ }
-/*****************************************************************************/
-/* Remove calls to the bool transformer subroutines */
-/*****************************************************************************/
+ /* Close the file, ignore errors here. */
+ fclose (F);
+}
-static void OptBoolTransforms (CodeSeg* S)
-/* Try to remove the call to boolean transformer routines where the call is
- * not really needed.
- */
+static void WriteOptStats (const char* Name)
+/* Write the optimizer statistics file */
{
unsigned I;
- /* Get the number of entries, bail out if we have not enough */
- unsigned Count = GetCodeEntryCount (S);
- if (Count < 2) {
- return;
+ /* Try to open the file */
+ FILE* F = fopen (Name, "w");
+ if (F == 0) {
+ /* Ignore the error */
+ return;
}
- /* Walk over the entries */
- I = 0;
- while (I < Count-1) {
+ /* Write a header */
+ fprintf (F,
+ "; Optimizer Total Last Total Last\n"
+ "; Step Runs Runs Chg Chg\n");
+
+
+ /* Write the data */
+ for (I = 0; I < OPTFUNC_COUNT; ++I) {
+ const OptFunc* O = OptFuncs[I];
+ fprintf (F,
+ "%-20s %10lu %10lu %10lu %10lu\n",
+ O->Name,
+ O->TotalRuns,
+ O->LastRuns,
+ O->TotalChanges,
+ O->LastChanges);
+ }
- /* Get next entry */
- CodeEntry* E = GetCodeEntry (S, I);
+ /* Close the file, ignore errors here. */
+ fclose (F);
+}
- /* Check for a boolean transformer */
- if (E->OPC == OPC_JSR && strncmp (E->Arg, "bool", 4) == 0) {
- cmp_t Cond;
- /* Get the next entry */
- CodeEntry* N = GetCodeEntry (S, I+1);
+static void OpenDebugFile (const CodeSeg* S)
+/* Open the debug file for the given segment if the flag is on */
+{
+ if (DebugOptOutput) {
+ StrBuf Name = AUTO_STRBUF_INITIALIZER;
+ if (S->Func) {
+ SB_CopyStr (&Name, S->Func->Name);
+ } else {
+ SB_CopyStr (&Name, "global");
+ }
+ SB_AppendStr (&Name, ".opt");
+ SB_Terminate (&Name);
+ OpenDebugOutputFile (SB_GetConstBuf (&Name));
+ SB_Done (&Name);
+ }
+}
- /* Check if this is a conditional branch */
- if ((N->Info & OF_CBRA) == 0) {
- /* No conditional branch, bail out */
- goto NextEntry;
- }
- /* Make the boolean transformer unnecessary by changing the
- * the conditional jump to evaluate the condition flags that
- * are set after the compare directly. Note: jeq jumps if
- * the condition is not met, jne jumps if the condition is met.
- */
- Cond = FindCmpCond (E->Arg + 4);
- if (Cond == CMP_INV) {
- /* Unknown function */
- goto NextEntry;
- }
- /* Invert the code if we jump on condition not met. */
- if (GetBranchCond (N->OPC) == BC_EQ) {
- /* Jumps if condition false, invert condition */
- Cond = CmpInvertTab [Cond];
- }
+static void WriteDebugOutput (CodeSeg* S, const char* Step)
+/* Write a separator line into the debug file if the flag is on */
+{
+ if (DebugOptOutput) {
+ /* Output a separator */
+ WriteOutput ("=========================================================================\n");
+
+ /* Output a header line */
+ if (Step == 0) {
+ /* Initial output */
+ WriteOutput ("Initial code for function '%s':\n",
+ S->Func? S->Func->Name : "<global>");
+ } else {
+ WriteOutput ("Code after applying '%s':\n", Step);
+ }
+
+ /* Output the code segment */
+ CS_Output (S);
+ }
+}
- /* Check if we can replace the code by something better */
- switch (Cond) {
- case CMP_EQ:
- ReplaceOPC (N, OPC_JEQ);
- break;
- case CMP_NE:
- ReplaceOPC (N, OPC_JNE);
- break;
+static unsigned RunOptFunc (CodeSeg* S, OptFunc* F, unsigned Max)
+/* Run one optimizer function Max times or until there are no more changes */
+{
+ unsigned Changes, C;
- case CMP_GT:
- /* Not now ### */
- goto NextEntry;
+ /* Don't run the function if it is disabled or if it is prohibited by the
+ ** code size factor
+ */
+ if (F->Disabled || F->CodeSizeFactor > S->CodeSizeFactor) {
+ return 0;
+ }
- case CMP_GE:
- ReplaceOPC (N, OPC_JPL);
- break;
+ /* Run this until there are no more changes */
+ Changes = 0;
+ do {
- case CMP_LT:
- ReplaceOPC (N, OPC_JMI);
- break;
+ /* Run the function */
+ C = F->Func (S);
+ Changes += C;
+
+ /* Do statistics */
+ ++F->TotalRuns;
+ ++F->LastRuns;
+ F->TotalChanges += C;
+ F->LastChanges += C;
+
+ /* If we had changes, output stuff and regenerate register info */
+ if (C) {
+ if (Debug) {
+ printf ("Applied %s: %u changes\n", F->Name, C);
+ }
+ WriteDebugOutput (S, F->Name);
+ CS_GenRegInfo (S);
+ }
+
+ } while (--Max && C > 0);
+
+ /* Return the number of changes */
+ return Changes;
+}
- case CMP_LE:
- /* Not now ### */
- goto NextEntry;
- case CMP_UGT:
- /* Not now ### */
- goto NextEntry;
- case CMP_UGE:
- ReplaceOPC (N, OPC_JCS);
- break;
+static unsigned RunOptGroup1 (CodeSeg* S)
+/* Run the first group of optimization steps. These steps translate known
+** patterns emitted by the code generator into more optimal patterns. Order
+** of the steps is important, because some of the steps done earlier cover
+** the same patterns as later steps as subpatterns.
+*/
+{
+ unsigned Changes = 0;
+
+ Changes += RunOptFunc (S, &DOptGotoSPAdj, 1);
+ Changes += RunOptFunc (S, &DOptStackPtrOps, 5);
+ Changes += RunOptFunc (S, &DOptPtrStore1, 1);
+ Changes += RunOptFunc (S, &DOptPtrStore2, 1);
+ Changes += RunOptFunc (S, &DOptPtrStore3, 1);
+ Changes += RunOptFunc (S, &DOptAdd3, 1); /* Before OptPtrLoad5! */
+ Changes += RunOptFunc (S, &DOptPtrLoad1, 1);
+ Changes += RunOptFunc (S, &DOptPtrLoad2, 1);
+ Changes += RunOptFunc (S, &DOptPtrLoad3, 1);
+ Changes += RunOptFunc (S, &DOptPtrLoad4, 1);
+ Changes += RunOptFunc (S, &DOptPtrLoad5, 1);
+ Changes += RunOptFunc (S, &DOptPtrLoad6, 1);
+ Changes += RunOptFunc (S, &DOptPtrLoad7, 1);
+ Changes += RunOptFunc (S, &DOptPtrLoad18, 1); /* Before OptPtrLoad11 */
+ Changes += RunOptFunc (S, &DOptPtrLoad11, 1);
+ Changes += RunOptFunc (S, &DOptPtrLoad12, 1);
+ Changes += RunOptFunc (S, &DOptPtrLoad13, 1);
+ Changes += RunOptFunc (S, &DOptPtrLoad14, 1);
+ Changes += RunOptFunc (S, &DOptPtrLoad15, 1);
+ Changes += RunOptFunc (S, &DOptPtrLoad16, 1);
+ Changes += RunOptFunc (S, &DOptPtrLoad17, 1);
+ Changes += RunOptFunc (S, &DOptPtrLoad19, 1);
+ Changes += RunOptFunc (S, &DOptBNegAX1, 1);
+ Changes += RunOptFunc (S, &DOptBNegAX2, 1);
+ Changes += RunOptFunc (S, &DOptBNegAX3, 1);
+ Changes += RunOptFunc (S, &DOptBNegAX4, 1);
+ Changes += RunOptFunc (S, &DOptAdd1, 1);
+ Changes += RunOptFunc (S, &DOptAdd2, 1);
+ Changes += RunOptFunc (S, &DOptAdd4, 1);
+ Changes += RunOptFunc (S, &DOptAdd5, 1);
+ Changes += RunOptFunc (S, &DOptAdd6, 1);
+ Changes += RunOptFunc (S, &DOptSub1, 1);
+ Changes += RunOptFunc (S, &DOptSub3, 1);
+ Changes += RunOptFunc (S, &DOptStore4, 1);
+ Changes += RunOptFunc (S, &DOptStore5, 1);
+ Changes += RunOptFunc (S, &DOptShift1, 1);
+ Changes += RunOptFunc (S, &DOptShift2, 1);
+ Changes += RunOptFunc (S, &DOptShift5, 1);
+ Changes += RunOptFunc (S, &DOptShift6, 1);
+ Changes += RunOptFunc (S, &DOptStore1, 1);
+ Changes += RunOptFunc (S, &DOptStore2, 5);
+ Changes += RunOptFunc (S, &DOptStore3, 5);
+
+ /* Return the number of changes */
+ return Changes;
+}
- case CMP_ULT:
- ReplaceOPC (N, OPC_JCC);
- break;
- case CMP_ULE:
- /* Not now ### */
- goto NextEntry;
- default:
- Internal ("Unknown jump condition: %d", Cond);
+static unsigned RunOptGroup2 (CodeSeg* S)
+/* Run one group of optimization steps. This step involves just decoupling
+** instructions by replacing them by instructions that do not depend on
+** previous instructions. This makes it easier to find instructions that
+** aren't used.
+*/
+{
+ unsigned Changes = 0;
- }
+ Changes += RunOptFunc (S, &DOptDecouple, 1);
- /* Remove the call to the bool transformer */
- DelCodeEntry (S, I);
- --Count;
+ /* Return the number of changes */
+ return Changes;
+}
- /* Remember, we had changes */
- ++OptChanges;
- }
-NextEntry:
- /* Next entry */
- ++I;
+static unsigned RunOptGroup3 (CodeSeg* S)
+/* Run one group of optimization steps. These steps depend on each other,
+** that means that one step may allow another step to do additional work,
+** so we will repeat the steps as long as we see any changes.
+*/
+{
+ unsigned Changes, C;
- }
+ Changes = 0;
+ do {
+ C = 0;
+
+ C += RunOptFunc (S, &DOptBNegA1, 1);
+ C += RunOptFunc (S, &DOptBNegA2, 1);
+ C += RunOptFunc (S, &DOptNegAX1, 1);
+ C += RunOptFunc (S, &DOptNegAX2, 1);
+ C += RunOptFunc (S, &DOptStackOps, 3);
+ C += RunOptFunc (S, &DOptShift1, 1);
+ C += RunOptFunc (S, &DOptShift4, 1);
+ C += RunOptFunc (S, &DOptComplAX1, 1);
+ C += RunOptFunc (S, &DOptSub1, 1);
+ C += RunOptFunc (S, &DOptSub2, 1);
+ C += RunOptFunc (S, &DOptSub3, 1);
+ C += RunOptFunc (S, &DOptAdd5, 1);
+ C += RunOptFunc (S, &DOptAdd6, 1);
+ C += RunOptFunc (S, &DOptJumpCascades, 1);
+ C += RunOptFunc (S, &DOptDeadJumps, 1);
+ C += RunOptFunc (S, &DOptRTS, 1);
+ C += RunOptFunc (S, &DOptDeadCode, 1);
+ C += RunOptFunc (S, &DOptBoolTrans, 1);
+ C += RunOptFunc (S, &DOptJumpTarget1, 1);
+ C += RunOptFunc (S, &DOptJumpTarget2, 1);
+ C += RunOptFunc (S, &DOptCondBranches1, 1);
+ C += RunOptFunc (S, &DOptCondBranches2, 1);
+ C += RunOptFunc (S, &DOptRTSJumps1, 1);
+ C += RunOptFunc (S, &DOptCmp1, 1);
+ C += RunOptFunc (S, &DOptCmp2, 1);
+ C += RunOptFunc (S, &DOptCmp8, 1); /* Must run before OptCmp3 */
+ C += RunOptFunc (S, &DOptCmp3, 1);
+ C += RunOptFunc (S, &DOptCmp4, 1);
+ C += RunOptFunc (S, &DOptCmp5, 1);
+ C += RunOptFunc (S, &DOptCmp6, 1);
+ C += RunOptFunc (S, &DOptCmp7, 1);
+ C += RunOptFunc (S, &DOptCmp9, 1);
+ C += RunOptFunc (S, &DOptTest1, 1);
+ C += RunOptFunc (S, &DOptLoad1, 1);
+ C += RunOptFunc (S, &DOptJumpTarget3, 1); /* After OptCondBranches2 */
+ C += RunOptFunc (S, &DOptUnusedLoads, 1);
+ C += RunOptFunc (S, &DOptUnusedStores, 1);
+ C += RunOptFunc (S, &DOptDupLoads, 1);
+ C += RunOptFunc (S, &DOptStoreLoad, 1);
+ C += RunOptFunc (S, &DOptTransfers1, 1);
+ C += RunOptFunc (S, &DOptTransfers3, 1);
+ C += RunOptFunc (S, &DOptTransfers4, 1);
+ C += RunOptFunc (S, &DOptStore1, 1);
+ C += RunOptFunc (S, &DOptStore5, 1);
+ C += RunOptFunc (S, &DOptPushPop, 1);
+ C += RunOptFunc (S, &DOptPrecalc, 1);
+
+ Changes += C;
+
+ } while (C);
+
+ /* Return the number of changes */
+ return Changes;
}
-/*****************************************************************************/
-/* Code */
-/*****************************************************************************/
-
-
+static unsigned RunOptGroup4 (CodeSeg* S)
+/* Run another round of pattern replacements. These are done late, since there
+** may be better replacements before.
+*/
+{
+ unsigned Changes = 0;
+
+ /* Repeat some of the steps here */
+ Changes += RunOptFunc (S, &DOptShift3, 1);
+ Changes += RunOptFunc (S, &DOptPush1, 1);
+ Changes += RunOptFunc (S, &DOptPush2, 1);
+ Changes += RunOptFunc (S, &DOptUnusedLoads, 1);
+ Changes += RunOptFunc (S, &DOptTest2, 1);
+ Changes += RunOptFunc (S, &DOptTransfers2, 1);
+ Changes += RunOptFunc (S, &DOptLoad2, 1);
+ Changes += RunOptFunc (S, &DOptLoad3, 1);
+ Changes += RunOptFunc (S, &DOptDupLoads, 1);
+
+ /* Return the number of changes */
+ return Changes;
+}
-/* Table with all the optimization functions */
-typedef struct OptFunc OptFunc;
-struct OptFunc {
- void (*Func) (CodeSeg*); /* Optimizer function */
- const char* Name; /* Name of optimizer step */
- char Disabled; /* True if pass disabled */
-};
+static unsigned RunOptGroup5 (CodeSeg* S)
+/* 65C02 specific optimizations. */
+{
+ unsigned Changes = 0;
+
+ if (CPUIsets[CPU] & CPU_ISET_65SC02) {
+ Changes += RunOptFunc (S, &DOpt65C02BitOps, 1);
+ Changes += RunOptFunc (S, &DOpt65C02Ind, 1);
+ Changes += RunOptFunc (S, &DOpt65C02Stores, 1);
+ if (Changes) {
+ /* The 65C02 replacement codes do often make the use of a register
+ ** value unnecessary, so if we have changes, run another load
+ ** removal pass.
+ */
+ Changes += RunOptFunc (S, &DOptUnusedLoads, 1);
+ }
+ }
-/* Table with optimizer steps - are called in this order */
-static OptFunc OptFuncs [] = {
- /* Optimize jump cascades */
- { OptJumpCascades, "OptJumpCascades", 0 },
- /* Remove dead jumps */
- { OptDeadJumps, "OptDeadJumps", 0 },
- /* Change jsr/rts to jmp */
- { OptRTS, "OptRTS", 0 },
- /* Remove dead code */
- { OptDeadCode, "OptDeadCode", 0 },
- /* Optimize jump targets */
- { OptJumpTarget, "OptJumpTarget", 0 },
- /* Remove dead conditional branches */
- { OptDeadCondBranches, "OptDeadCondBranches", 0 },
- /* Remove calls to the bool transformer subroutines */
- { OptBoolTransforms, "OptBoolTransforms", 0 },
-};
+ /* Return the number of changes */
+ return Changes;
+}
-static OptFunc* FindOptStep (const char* Name)
-/* Find an optimizer step by name in the table and return a pointer. Print an
- * error and cann AbEnd if not found.
- */
+static unsigned RunOptGroup6 (CodeSeg* S)
+/* This one is quite special. It tries to replace "lda (sp),y" by "lda (sp,x)".
+** The latter is ony cycle slower, but if we're able to remove the necessary
+** load of the Y register, because X is zero anyway, we gain 1 cycle and
+** shorten the code by one (transfer) or two bytes (load). So what we do is
+** to replace the insns, remove unused loads, and then change back all insns
+** where Y is still zero (meaning that the load has not been removed).
+*/
{
- unsigned I;
-
- /* Run all optimization steps */
- for (I = 0; I < sizeof(OptFuncs)/sizeof(OptFuncs[0]); ++I) {
- if (strcmp (OptFuncs[I].Name, Name) == 0) {
- /* Found */
- return OptFuncs+I;
- }
+ unsigned Changes = 0;
+
+ /* This group will only run for a standard 6502, because the 65C02 has a
+ ** better addressing mode that covers this case.
+ */
+ if ((CPUIsets[CPU] & CPU_ISET_65SC02) == 0) {
+ Changes += RunOptFunc (S, &DOptIndLoads1, 1);
+ Changes += RunOptFunc (S, &DOptUnusedLoads, 1);
+ Changes += RunOptFunc (S, &DOptIndLoads2, 1);
}
- /* Not found */
- AbEnd ("Optimization step `%s' not found", Name);
- return 0;
+ /* Return the number of changes */
+ return Changes;
}
-void DisableOpt (const char* Name)
-/* Disable the optimization with the given name */
+static unsigned RunOptGroup7 (CodeSeg* S)
+/* The last group of optimization steps. Adjust branches, do size optimizations.
+*/
{
- OptFunc* F = FindOptStep (Name);
- F->Disabled = 1;
-}
+ unsigned Changes = 0;
+ unsigned C;
+
+ /* Optimize for size, that is replace operations by shorter ones, even
+ ** if this does hinder further optimizations (no problem since we're
+ ** done soon).
+ */
+ C = RunOptFunc (S, &DOptSize1, 1);
+ if (C) {
+ Changes += C;
+ /* Run some optimization passes again, since the size optimizations
+ ** may have opened new oportunities.
+ */
+ Changes += RunOptFunc (S, &DOptUnusedLoads, 1);
+ Changes += RunOptFunc (S, &DOptUnusedStores, 1);
+ Changes += RunOptFunc (S, &DOptJumpTarget1, 5);
+ Changes += RunOptFunc (S, &DOptStore5, 1);
+ }
+ C = RunOptFunc (S, &DOptSize2, 1);
+ if (C) {
+ Changes += C;
+ /* Run some optimization passes again, since the size optimizations
+ ** may have opened new oportunities.
+ */
+ Changes += RunOptFunc (S, &DOptUnusedLoads, 1);
+ Changes += RunOptFunc (S, &DOptJumpTarget1, 5);
+ Changes += RunOptFunc (S, &DOptStore5, 1);
+ Changes += RunOptFunc (S, &DOptTransfers1, 1);
+ Changes += RunOptFunc (S, &DOptTransfers3, 1);
+ }
+ /* Adjust branch distances */
+ Changes += RunOptFunc (S, &DOptBranchDist, 3);
-void EnableOpt (const char* Name)
-/* Enable the optimization with the given name */
-{
- OptFunc* F = FindOptStep (Name);
- F->Disabled = 0;
+ /* Replace conditional branches to RTS. If we had changes, we must run dead
+ ** code elimination again, since the change may have introduced dead code.
+ */
+ C = RunOptFunc (S, &DOptRTSJumps2, 1);
+ Changes += C;
+ if (C) {
+ Changes += RunOptFunc (S, &DOptDeadCode, 1);
+ }
+
+ /* Return the number of changes */
+ return Changes;
}
void RunOpt (CodeSeg* S)
/* Run the optimizer */
{
- unsigned Pass = 0;
+ const char* StatFileName;
+
+ /* If we shouldn't run the optimizer, bail out */
+ if (!S->Optimize) {
+ return;
+ }
+
+ /* Check if we are requested to write optimizer statistics */
+ StatFileName = getenv ("CC65_OPTSTATS");
+ if (StatFileName) {
+ ReadOptStats (StatFileName);
+ }
/* Print the name of the function we are working on */
if (S->Func) {
- Print (stdout, 1, "Running optimizer for function `%s'\n", S->Func->Name);
+ Print (stdout, 1, "Running optimizer for function '%s'\n", S->Func->Name);
} else {
- Print (stdout, 1, "Running optimizer for global code segment\n");
+ Print (stdout, 1, "Running optimizer for global code segment\n");
}
- /* Repeat all steps until there are no more changes */
- do {
-
- unsigned I;
-
- /* Reset the number of changes */
- OptChanges = 0;
+ /* If requested, open an output file */
+ OpenDebugFile (S);
+ WriteDebugOutput (S, 0);
- /* Keep the user hapy */
- Print (stdout, 1, " Optimizer pass %u:\n", ++Pass);
+ /* Generate register info for all instructions */
+ CS_GenRegInfo (S);
- /* Run all optimization steps */
- for (I = 0; I < sizeof(OptFuncs)/sizeof(OptFuncs[0]); ++I) {
+ /* Run groups of optimizations */
+ RunOptGroup1 (S);
+ RunOptGroup2 (S);
+ RunOptGroup3 (S);
+ RunOptGroup4 (S);
+ RunOptGroup5 (S);
+ RunOptGroup6 (S);
+ RunOptGroup7 (S);
- /* Print the name of the following optimizer step */
- Print (stdout, 1, " %s:%*s", OptFuncs[I].Name,
- (int) (30-strlen(OptFuncs[I].Name)), "");
+ /* Free register info */
+ CS_FreeRegInfo (S);
- /* Check if the step is disabled */
- if (OptFuncs[I].Disabled) {
- Print (stdout, 1, "Disabled\n");
- } else {
- unsigned Changes = OptChanges;
- OptFuncs[I].Func (S);
- Changes = OptChanges - Changes;
- Print (stdout, 1, "%u Changes\n", Changes);
- }
- }
+ /* Close output file if necessary */
+ if (DebugOptOutput) {
+ CloseOutputFile ();
+ }
- } while (OptChanges > 0);
+ /* Write statistics */
+ if (StatFileName) {
+ WriteOptStats (StatFileName);
+ }
}
-
-
-
projects / cc65 / blobdiff