/*****************************************************************************/
/* */
-/* 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 */
/*****************************************************************************/
-/* 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"
-};
-
-/* 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
-};
-
-/* 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
-};
-
-
-
-/*****************************************************************************/
-/* Helper functions */
-/*****************************************************************************/
-
-
-
-static cmp_t FindCmpCond (const char* Code, unsigned CodeLen)
-/* Search for a compare condition by the given code using the given length */
+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;
- /* Linear search */
- for (I = 0; I < sizeof (CmpSuffixTab) / sizeof (CmpSuffixTab [0]); ++I) {
- if (strncmp (Code, CmpSuffixTab [I], CodeLen) == 0) {
- /* Found */
- return I;
- }
- }
+ /* Walk over the entries */
+ I = 0;
+ while (I < CS_GetEntryCount (S)) {
- /* Not found */
- return CMP_INV;
-}
+ 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)) {
-static cmp_t FindBoolCmpCond (const char* Name)
-/* Map a condition suffix to a code. Return the code or CMP_INV on failure */
-{
- /* Check for the correct subroutine name */
- if (strncmp (Name, "bool", 4) == 0) {
- /* Name is ok, search for the code in the table */
- return FindCmpCond (Name+4, strlen(Name)-4);
- } else {
- /* Not found */
- return CMP_INV;
- }
-}
+ 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 int FindTosCmpCond (const char* Name)
-/* Check if this is a call to one of the TOS compare functions (tosgtax).
- * Return the condition code or CMP_INV on failure.
- */
-{
- unsigned Len = strlen (Name);
+ /* Now remove the call to the subroutine */
+ CS_DelEntry (S, I);
- /* Check for the correct subroutine name */
- if (strncmp (Name, "tos", 3) == 0 && strcmp (Name+Len-2, "ax") == 0) {
- /* Name is ok, search for the code in the table */
- return FindCmpCond (Name+3, Len-3-2);
- } else {
- /* Not found */
- return CMP_INV;
- }
-}
+ /* Remember, we had changes */
+ ++Changes;
+ }
+ /* Next entry */
+ ++I;
-static int IsUnsignedCmp (int Code)
-/* Check if this is an unsigned compare */
-{
- CHECK (Code >= 0);
- return CmpSignedTab [Code] == 0;
-}
-
-
+ }
-static const char* MakeBoolCmp (cmp_t Cond)
-/* Create the name of a bool transformer subroutine for the given code. The
- * result is placed into a static buffer, so beware!
- */
-{
- static char Buffer[20];
- CHECK (Cond != CMP_INV);
- sprintf (Buffer, "bool%s", CmpSuffixTab[Cond]);
- return Buffer;
+ /* Return the number of changes made */
+ return Changes;
}
-static const char* MakeTosCmp (cmp_t Cond)
-/* Create the name of a tos compare subroutine for the given code. The
- * result is placed into a static buffer, so beware!
- */
+static unsigned OptLoad2 (CodeSeg* S)
+/* Replace calls to ldaxysp by inline code */
{
- static char Buffer[20];
- CHECK (Cond != CMP_INV);
- sprintf (Buffer, "tos%sax", CmpSuffixTab[Cond]);
- return Buffer;
-}
+ unsigned I;
+ unsigned Changes = 0;
+ /* Walk over the entries */
+ I = 0;
+ while (I < CS_GetEntryCount (S)) {
+ CodeEntry* L[3];
-static int IsBitOp (const CodeEntry* E)
-/* Check if E is one of the bit operations (and, or, eor) */
-{
- return (E->OPC == OPC_AND || E->OPC == OPC_ORA || E->OPC == OPC_EOR);
-}
+ /* Get next entry */
+ L[0] = CS_GetEntry (S, I);
+ /* Check for the sequence */
+ if (CE_IsCallTo (L[0], "ldaxysp")) {
+ CodeEntry* X;
-static int IsCmpToZero (const CodeEntry* E)
-/* Check if the given instrcuction is a compare to zero instruction */
-{
- return (E->OPC == OPC_CMP &&
- E->AM == AM_IMM &&
- (E->Flags & CEF_NUMARG) != 0 &&
- E->Num == 0);
-}
+ /* 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)) {
+ /* A/X are stored into memory somewhere and X is not used
+ ** later
+ */
+ /* lda (sp),y */
+ X = NewCodeEntry (OP65_LDA, AM65_ZP_INDY, "sp", 0, L[0]->LI);
+ CS_InsertEntry (S, X, I+3);
-static int IsSpLoad (const CodeEntry* E)
-/* Return true if this is the load of A from the stack */
-{
- return E->OPC == OPC_LDA && E->AM == AM_ZP_INDY && strcmp (E->Arg, "sp") == 0;
-}
+ /* 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);
-static int IsLocalLoad16 (CodeSeg* S, unsigned Index,
- CodeEntry** L, unsigned Count)
-/* Check if a 16 bit load of a local variable follows:
- *
- * ldy #$xx
- * lda (sp),y
- * tax
- * dey
- * lda (sp),y
- *
- * If so, read Count entries following the first ldy into L and return true
- * if this is possible. Otherwise return false.
- */
-{
- /* Be sure we read enough entries for the check */
- CHECK (Count >= 5);
-
- /* Read the first entry */
- L[0] = GetCodeEntry (S, Index);
-
- /* Check for the sequence */
- return (L[0]->OPC == OPC_LDY &&
- L[0]->AM == AM_IMM &&
- (L[0]->Flags & CEF_NUMARG) != 0 &&
- GetCodeEntries (S, L+1, Index+1, Count-1) &&
- IsSpLoad (L[1]) &&
- !CodeEntryHasLabel (L[1]) &&
- L[2]->OPC == OPC_TAX &&
- !CodeEntryHasLabel (L[2]) &&
- L[3]->OPC == OPC_DEY &&
- !CodeEntryHasLabel (L[3]) &&
- IsSpLoad (L[4]) &&
- !CodeEntryHasLabel (L[4]));
-}
+ /* 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 int IsImmCmp16 (CodeSeg* S, CodeEntry** L)
-/* Check if the instructions at L are an immidiate compare of a/x:
- *
- *
- */
-{
- return (L[0]->OPC == OPC_CPX &&
- L[0]->AM == AM_IMM &&
- (L[0]->Flags & CEF_NUMARG) != 0 &&
- !CodeEntryHasLabel (L[0]) &&
- (L[1]->OPC == OPC_JNE || L[1]->OPC == OPC_BNE) &&
- L[1]->JumpTo != 0 &&
- !CodeEntryHasLabel (L[1]) &&
- L[2]->OPC == OPC_CMP &&
- L[2]->AM == AM_IMM &&
- (L[2]->Flags & CEF_NUMARG) != 0 &&
- (L[3]->Info & OF_ZBRA) != 0 &&
- L[3]->JumpTo != 0 &&
- (L[1]->JumpTo->Owner == L[3] || L[1]->JumpTo == L[3]->JumpTo));
-}
+ /* Standard replacement */
+ /* lda (sp),y */
+ X = NewCodeEntry (OP65_LDA, AM65_ZP_INDY, "sp", 0, L[0]->LI);
+ CS_InsertEntry (S, X, I+1);
+ /* tax */
+ X = NewCodeEntry (OP65_TAX, AM65_IMP, 0, 0, L[0]->LI);
+ CS_InsertEntry (S, X, I+2);
-/*****************************************************************************/
-/* Remove calls to the bool transformer subroutines */
-/*****************************************************************************/
+ /* dey */
+ X = NewCodeEntry (OP65_DEY, AM65_IMP, 0, 0, L[0]->LI);
+ CS_InsertEntry (S, X, I+3);
+ /* lda (sp),y */
+ X = NewCodeEntry (OP65_LDA, AM65_ZP_INDY, "sp", 0, L[0]->LI);
+ CS_InsertEntry (S, X, I+4);
+ /* Now remove the call to the subroutine */
+ CS_DelEntry (S, I);
-static unsigned OptBoolTransforms (CodeSeg* S)
-/* Try to remove the call to boolean transformer routines where the call is
- * not really needed.
- */
-{
- unsigned Changes = 0;
+ }
- /* Walk over the entries */
- unsigned I = 0;
- while (I < GetCodeEntryCount (S)) {
-
- CodeEntry* N;
- cmp_t Cond;
-
- /* Get next entry */
- CodeEntry* E = GetCodeEntry (S, I);
-
- /* Check for a boolean transformer */
- if (E->OPC == OPC_JSR &&
- (Cond = FindBoolCmpCond (E->Arg)) != CMP_INV &&
- (N = GetNextCodeEntry (S, I)) != 0 &&
- (N->Info & OF_ZBRA) != 0) {
-
- CodeEntry* X;
- CodeLabel* L;
-
- /* 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.
- * 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];
- }
-
- /* 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;
-
- case CMP_GT:
- /* Replace by
- * beq @L
- * jpl Target
- * @L: ...
- */
- if ((X = GetNextCodeEntry (S, I+1)) == 0) {
- /* No such entry */
- goto NextEntry;
- }
- L = GenCodeLabel (S, X);
- X = NewCodeEntry (OPC_BEQ, AM_BRA, L->Name, L);
- InsertCodeEntry (S, X, I+1);
- ReplaceOPC (N, OPC_JPL);
- break;
-
- case CMP_GE:
- ReplaceOPC (N, OPC_JPL);
- break;
-
- case CMP_LT:
- ReplaceOPC (N, OPC_JMI);
- break;
-
- case CMP_LE:
- /* Replace by
- * jmi Target
- * jeq Target
- */
- ReplaceOPC (N, OPC_JMI);
- L = N->JumpTo;
- X = NewCodeEntry (OPC_JEQ, AM_BRA, L->Name, L);
- InsertCodeEntry (S, X, I+2);
- break;
-
- case CMP_UGT:
- /* Replace by
- * beq @L
- * jcs Target
- * @L: ...
- */
- if ((X = GetNextCodeEntry (S, I+1)) == 0) {
- /* No such entry */
- goto NextEntry;
- }
- L = GenCodeLabel (S, X);
- X = NewCodeEntry (OPC_BEQ, AM_BRA, L->Name, L);
- InsertCodeEntry (S, X, I+1);
- ReplaceOPC (N, OPC_JCS);
- break;
-
- case CMP_UGE:
- ReplaceOPC (N, OPC_JCS);
- break;
-
- case CMP_ULT:
- ReplaceOPC (N, OPC_JCC);
- break;
-
- case CMP_ULE:
- /* Replace by
- * jcc Target
- * jeq Target
- */
- ReplaceOPC (N, OPC_JCC);
- L = N->JumpTo;
- X = NewCodeEntry (OPC_JEQ, AM_BRA, L->Name, L);
- InsertCodeEntry (S, X, I+2);
- break;
-
- default:
- Internal ("Unknown jump condition: %d", Cond);
-
- }
-
- /* Remove the call to the bool transformer */
- DelCodeEntry (S, I);
-
- /* Remember, we had changes */
- ++Changes;
-
- }
-
-NextEntry:
- /* Next entry */
- ++I;
+ /* Remember, we had changes */
+ ++Changes;
+
+ }
+ /* Next entry */
+ ++I;
}
/* Return the number of changes made */
-/*****************************************************************************/
-/* Optimizations for compares */
-/*****************************************************************************/
-
-
-
-static unsigned OptCmp1 (CodeSeg* S)
-/* Search for the sequence
- *
- * stx xx
- * stx tmp1
- * ora tmp1
- *
- * and replace it by
- *
- * stx xx
- * ora xx
- */
+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 < GetCodeEntryCount (S)) {
+ while (I < CS_GetEntryCount (S)) {
+
+ /* Get next entry */
+ CodeEntry* E = CS_GetEntry (S, I);
+
+ /* Forget a preceeding load if we have a label */
+ if (Load && CE_HasLabel (E)) {
+ Load = 0;
+ }
+
+ /* Check if this insn is a load */
+ if (E->Info & OF_LOAD) {
- CodeEntry* L[2];
+ CodeEntry* N;
- /* Get next entry */
- CodeEntry* E = GetCodeEntry (S, I);
+ /* 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) {
- /* Check for the sequence */
- if (E->OPC == OPC_STX &&
- GetCodeEntries (S, L, I+1, 2) &&
- L[0]->OPC == OPC_STX &&
- strcmp (L[0]->Arg, "tmp1") == 0 &&
- !CodeEntryHasLabel (L[0]) &&
- L[1]->OPC == OPC_ORA &&
- strcmp (L[1]->Arg, "tmp1") == 0 &&
- !CodeEntryHasLabel (L[1])) {
+ /* Now remove the call to the subroutine */
+ CS_DelEntry (S, I);
- /* Remove the remaining instructions */
- DelCodeEntries (S, I+1, 2);
+ /* Remember, we had changes */
+ ++Changes;
- /* Insert the ora instead */
- InsertCodeEntry (S, NewCodeEntry (OPC_ORA, E->AM, E->Arg, 0), I+1);
+ /* Next insn */
+ continue;
- /* Remember, we had changes */
- ++Changes;
+ } else {
- }
+ Load = E;
- /* Next entry */
- ++I;
+ }
+ } 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 */
-static unsigned OptCmp2 (CodeSeg* S)
-/* Search for
- *
- * lda/and/ora/eor ...
- * cmp #$00
- * jeq/jne
- *
- * and remove the cmp.
- */
+/*****************************************************************************/
+/* Decouple operations */
+/*****************************************************************************/
+
+
+
+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;
/* Walk over the entries */
- unsigned I = 0;
- while (I < GetCodeEntryCount (S)) {
+ I = 0;
+ 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;
- CodeEntry* L[2];
+ }
- /* Get next entry */
- CodeEntry* E = GetCodeEntry (S, I);
+ /* Return the number of changes made */
+ return Changes;
+}
- /* Check for the sequence */
- if ((E->OPC == OPC_LDA || IsBitOp (E)) &&
- GetCodeEntries (S, L, I+1, 2) &&
- IsCmpToZero (L[0]) &&
- !CodeEntryHasLabel (L[0]) &&
- (L[1]->Info & OF_FBRA) != 0 &&
- !CodeEntryHasLabel (L[1])) {
- /* Remove the compare */
- DelCodeEntry (S, I+1);
- /* Remember, we had changes */
- ++Changes;
+/*****************************************************************************/
+/* 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;
}
- /* Return the number of changes made */
- return Changes;
+ /* If we come here, it's not a decsp op */
+ return 0;
}
-static unsigned OptCmp3 (CodeSeg* S)
-/* Search for
- *
- * lda x
- * ldx y
- * cpx #a
- * bne L1
- * cmp #b
- * jne/jeq L2
- *
- * If a is zero, we may remove the compare. If a and b are both zero, we may
- * replace it by the sequence
- *
- * lda x
- * ora x+1
- * jne/jeq ...
- *
- * L1 may be either the label at the branch instruction, or the target label
- * of this instruction.
- */
+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 */
- unsigned I = 0;
- while (I < GetCodeEntryCount (S)) {
-
- CodeEntry* L[5];
-
- /* Get next entry */
- CodeEntry* E = GetCodeEntry (S, I);
-
- /* Check for the sequence */
- if (E->OPC == OPC_LDA &&
- GetCodeEntries (S, L, I+1, 5) &&
- L[0]->OPC == OPC_LDX &&
- !CodeEntryHasLabel (L[0]) &&
- IsImmCmp16 (S, L+1)) {
-
- if (L[1]->Num == 0 && L[3]->Num == 0) {
- /* The value is zero, we may use the simple code version. */
- ReplaceOPC (L[0], OPC_ORA);
- DelCodeEntries (S, I+2, 3);
- } else {
- /* Move the lda instruction after the first branch. This will
- * improve speed, since the load is delayed after the first
- * test.
- */
- MoveCodeEntry (S, I, I+4);
-
- /* We will replace the ldx/cpx by lda/cmp */
- ReplaceOPC (L[0], OPC_LDA);
- ReplaceOPC (L[1], OPC_CMP);
-
- }
-
- ++Changes;
- }
-
- /* Next entry */
- ++I;
+ 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 Changes;
}
-
-
-static unsigned OptCmp4 (CodeSeg* S)
-/* Optimize compares of local variables:
- *
- * ldy #o
- * lda (sp),y
- * tax
- * dey
- * lda (sp),y
- * cpx #a
- * bne L1
- * cmp #b
- * jne/jeq L2
- */
+static unsigned OptGotoSPAdj (CodeSeg* S)
+/* Optimize SP adjustment for forward 'goto' */
{
unsigned Changes = 0;
+ unsigned I;
/* Walk over the entries */
- unsigned I = 0;
- while (I < GetCodeEntryCount (S)) {
-
- CodeEntry* L[9];
-
- /* Check for the sequence */
- if (IsLocalLoad16 (S, I, L, 9) && IsImmCmp16 (S, L+5)) {
-
- if (L[5]->Num == 0 && L[7]->Num == 0) {
-
- /* The value is zero, we may use the simple code version:
- * ldy #o
- * lda (sp),y
- * dey
- * ora (sp),y
- * jne/jeq ...
- */
- ReplaceOPC (L[4], OPC_ORA);
- DelCodeEntries (S, I+5, 3); /* cpx/bne/cmp */
- DelCodeEntry (S, I+2); /* tax */
-
- } else {
-
- /* Change the code to just use the A register. Move the load
- * of the low byte after the first branch if possible:
- *
- * ldy #o
- * lda (sp),y
- * cmp #a
- * bne L1
- * dey
- * lda (sp),y
- * cmp #b
- * jne/jeq ...
- */
- DelCodeEntry (S, I+2); /* tax */
- ReplaceOPC (L[5], OPC_CMP); /* cpx -> cmp */
- MoveCodeEntry (S, I+4, I+2); /* cmp */
- MoveCodeEntry (S, I+5, I+3); /* bne */
-
- }
-
- ++Changes;
- }
-
- /* Next entry */
- ++I;
+ I = 0;
+ 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;
+ }
}
return Changes;
}
-
-
/*****************************************************************************/
-/* nega optimizations */
+/* struct OptFunc */
/*****************************************************************************/
-static unsigned OptNegA1 (CodeSeg* S)
-/* Check for
- *
- * ldx #$00
- * lda ..
- * jsr bnega
- *
- * Remove the ldx if the lda does not use it.
- */
-{
- unsigned Changes = 0;
-
- /* Walk over the entries */
- unsigned I = 0;
- while (I < GetCodeEntryCount (S)) {
+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 */
+};
- CodeEntry* L[2];
- /* Get next entry */
- CodeEntry* E = GetCodeEntry (S, I);
- /* Check for a ldx */
- if (E->OPC == OPC_LDX &&
- E->AM == AM_IMM &&
- (E->Flags & CEF_NUMARG) != 0 &&
- E->Num == 0 &&
- GetCodeEntries (S, L, I+1, 2) &&
- L[0]->OPC == OPC_LDA &&
- (L[0]->Use & REG_X) == 0 &&
- L[1]->OPC == OPC_JSR &&
- strcmp (L[1]->Arg, "bnega") == 0) {
+/*****************************************************************************/
+/* Code */
+/*****************************************************************************/
- /* Remove the ldx instruction */
- DelCodeEntry (S, I);
- /* Remember, we had changes */
- ++Changes;
- }
+/* 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]))
- /* Next entry */
- ++I;
- }
- /* Return the number of changes made */
- return Changes;
+static int CmpOptStep (const void* Key, const void* Func)
+/* Compare function for bsearch */
+{
+ return strcmp (Key, (*(const OptFunc**)Func)->Name);
}
-static unsigned OptNegA2 (CodeSeg* S)
-/* Check for
- *
- * lda ..
- * jsr bnega
- * jeq/jne ..
- *
- * Adjust the conditional branch and remove the call to the subroutine.
- */
+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.
+*/
{
- unsigned Changes = 0;
-
- /* Walk over the entries */
- unsigned I = 0;
- while (I < GetCodeEntryCount (S)) {
-
- CodeEntry* L[2];
-
- /* Get next entry */
- CodeEntry* E = GetCodeEntry (S, I);
-
- /* Check for the sequence */
- if (E->OPC == OPC_LDA &&
- GetCodeEntries (S, L, I+1, 2) &&
- L[0]->OPC == OPC_JSR &&
- strcmp (L[0]->Arg, "bnega") == 0 &&
- !CodeEntryHasLabel (L[0]) &&
- (L[1]->Info & OF_ZBRA) != 0) {
+ /* Search for the function in the list */
+ OptFunc** O = bsearch (Name, OptFuncs, OPTFUNC_COUNT, sizeof (OptFuncs[0]), CmpOptStep);
+ return O? *O : 0;
+}
- /* Invert the branch */
- ReplaceOPC (L[1], GetInverseBranch (L[1]->OPC));
- /* Delete the subroutine call */
- DelCodeEntry (S, I+1);
- /* Remember, we had changes */
- ++Changes;
+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.
+*/
+{
+ /* 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;
+}
- }
- /* Next entry */
- ++I;
+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;
}
-
- /* Return the number of changes made */
- return Changes;
}
-/*****************************************************************************/
-/* negax optimizations */
-/*****************************************************************************/
+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;
+ }
+}
-static unsigned OptNegAX1 (CodeSeg* S)
-/* Search for the sequence:
- *
- * lda (xx),y
- * tax
- * dey
- * lda (xx),y
- * jsr bnegax
- * jne/jeq ...
- *
- * and replace it by
- *
- * lda (xx),y
- * dey
- * ora (xx),y
- * jeq/jne ...
- */
+void ListOptSteps (FILE* F)
+/* List all optimization steps */
{
- unsigned Changes = 0;
+ unsigned I;
+
+ fprintf (F, "any\n");
+ for (I = 0; I < OPTFUNC_COUNT; ++I) {
+ fprintf (F, "%s\n", OptFuncs[I]->Name);
+ }
+}
- /* Walk over the entries */
- unsigned I = 0;
- while (I < GetCodeEntryCount (S)) {
- CodeEntry* L[5];
- /* Get next entry */
- CodeEntry* E = GetCodeEntry (S, 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;
+ }
- /* Check for the sequence */
- if (E->OPC == OPC_LDA &&
- E->AM == AM_ZP_INDY &&
- GetCodeEntries (S, L, I+1, 5) &&
- L[0]->OPC == OPC_TAX &&
- L[1]->OPC == OPC_DEY &&
- L[2]->OPC == OPC_LDA &&
- L[2]->AM == AM_ZP_INDY &&
- strcmp (L[2]->Arg, E->Arg) == 0 &&
- !CodeEntryHasLabel (L[2]) &&
- L[3]->OPC == OPC_JSR &&
- strcmp (L[3]->Arg, "bnegax") == 0 &&
- !CodeEntryHasLabel (L[3]) &&
- (L[4]->Info & OF_ZBRA) != 0) {
+ /* 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;
- /* lda --> ora */
- ReplaceOPC (L[2], OPC_ORA);
+ }
- /* Invert the branch */
- ReplaceOPC (L[4], GetInverseBranch (L[4]->OPC));
+ /* Close the file, ignore errors here. */
+ fclose (F);
+}
- /* Delete the entries no longer needed. Beware: Deleting entries
- * will change the indices.
- */
- DelCodeEntry (S, I+4); /* jsr bnegax */
- DelCodeEntry (S, I+1); /* tax */
- /* Remember, we had changes */
- ++Changes;
- }
+static void WriteOptStats (const char* Name)
+/* Write the optimizer statistics file */
+{
+ unsigned I;
- /* Next entry */
- ++I;
+ /* Try to open the file */
+ FILE* F = fopen (Name, "w");
+ if (F == 0) {
+ /* Ignore the error */
+ return;
+ }
+ /* 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);
}
- /* Return the number of changes made */
- return Changes;
+ /* Close the file, ignore errors here. */
+ fclose (F);
}
-static unsigned OptNegAX2 (CodeSeg* S)
-/* Search for the sequence:
- *
- * lda xx
- * ldx yy
- * jsr bnegax
- * jne/jeq ...
- *
- * and replace it by
- *
- * lda xx
- * ora xx+1
- * jeq/jne ...
- */
+static void OpenDebugFile (const CodeSeg* S)
+/* Open the debug file for the given segment if the flag is on */
{
- unsigned Changes = 0;
+ 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);
+ }
+}
- /* Walk over the entries */
- unsigned I = 0;
- while (I < GetCodeEntryCount (S)) {
- CodeEntry* L[3];
- /* Get next entry */
- CodeEntry* E = GetCodeEntry (S, I);
+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 for the sequence */
- if (E->OPC == OPC_LDA &&
- GetCodeEntries (S, L, I+1, 3) &&
- L[0]->OPC == OPC_LDX &&
- !CodeEntryHasLabel (L[0]) &&
- L[1]->OPC == OPC_JSR &&
- strcmp (L[1]->Arg, "bnegax") == 0 &&
- !CodeEntryHasLabel (L[1]) &&
- (L[2]->Info & OF_ZBRA) != 0) {
- /* ldx --> ora */
- ReplaceOPC (L[0], OPC_ORA);
+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;
- /* Invert the branch */
- ReplaceOPC (L[2], GetInverseBranch (L[2]->OPC));
+ /* 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;
+ }
- /* Delete the subroutine call */
- DelCodeEntry (S, I+2);
+ /* Run this until there are no more changes */
+ Changes = 0;
+ do {
- /* Remember, we had changes */
- ++Changes;
+ /* Run the function */
+ C = F->Func (S);
+ Changes += C;
- }
+ /* Do statistics */
+ ++F->TotalRuns;
+ ++F->LastRuns;
+ F->TotalChanges += C;
+ F->LastChanges += C;
- /* Next entry */
- ++I;
+ /* 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 made */
+ /* Return the number of changes */
return Changes;
}
-static unsigned OptNegAX3 (CodeSeg* S)
-/* Search for the sequence:
- *
- * jsr _xxx
- * jsr bnega(x)
- * jeq/jne ...
- *
- * and replace it by:
- *
- * jsr _xxx
- * <boolean test>
- * jne/jeq ...
- */
+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;
- /* Walk over the entries */
- unsigned I = 0;
- while (I < GetCodeEntryCount (S)) {
-
- CodeEntry* L[2];
-
- /* Get next entry */
- CodeEntry* E = GetCodeEntry (S, I);
-
- /* Check for the sequence */
- if (E->OPC == OPC_JSR &&
- E->Arg[0] == '_' &&
- GetCodeEntries (S, L, I+1, 2) &&
- L[0]->OPC == OPC_JSR &&
- strncmp (L[0]->Arg,"bnega",5) == 0 &&
- !CodeEntryHasLabel (L[0]) &&
- (L[1]->Info & OF_ZBRA) != 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;
+}
- /* Check if we're calling bnega or bnegax */
- int ByteSized = (strcmp (L[0]->Arg, "bnega") == 0);
- /* Delete the subroutine call */
- DelCodeEntry (S, I+1);
- /* Insert apropriate test code */
- if (ByteSized) {
- /* Test bytes */
- InsertCodeEntry (S, NewCodeEntry (OPC_TAX, AM_IMP, 0, 0), I+1);
- } else {
- /* Test words */
- InsertCodeEntry (S, NewCodeEntry (OPC_STX, AM_ZP, "tmp1", 0), I+1);
- InsertCodeEntry (S, NewCodeEntry (OPC_ORA, AM_ZP, "tmp1", 0), I+2);
- }
+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;
- /* Invert the branch */
- ReplaceOPC (L[1], GetInverseBranch (L[1]->OPC));
+ Changes += RunOptFunc (S, &DOptDecouple, 1);
- /* Remember, we had changes */
- ++Changes;
+ /* Return the number of changes */
+ return Changes;
+}
- }
- /* 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;
- /* Return the number of changes made */
+ 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 {
- unsigned (*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 },
- /* Optimize conditional branches */
- { OptCondBranches, "OptCondBranches", 0 },
- /* Replace jumps to RTS by RTS */
- { OptRTSJumps, "OptRTSJumps", 0 },
- /* Remove calls to the bool transformer subroutines */
- { OptBoolTransforms, "OptBoolTransforms", 0 },
- /* Optimize calls to nega */
- { OptNegA1, "OptNegA1", 0 },
- /* Optimize calls to nega */
- { OptNegA2, "OptNegA2", 0 },
- /* Optimize calls to negax */
- { OptNegAX1, "OptNegAX1", 0 },
- /* Optimize calls to negax */
- { OptNegAX2, "OptNegAX2", 0 },
- /* Optimize calls to negax */
- { OptNegAX3, "OptNegAX3", 0 },
- /* Optimize compares */
- { OptCmp1, "OptCmp1", 0 },
- /* Optimize compares */
- { OptCmp2, "OptCmp2", 0 },
- /* Optimize compares */
- { OptCmp3, "OptCmp3", 0 },
- /* Optimize compares */
- { OptCmp4, "OptCmp4", 0 },
- /* Remove unused loads */
- { OptUnusedLoads, "OptUnusedLoads", 0 },
- /* Optimize branch distance */
- { OptBranchDist, "OptBranchDist", 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 call 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;
+ unsigned Changes = 0;
- /* 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;
- }
+ /* 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 I;
- unsigned Pass = 0;
- unsigned OptChanges;
+ const char* StatFileName;
/* If we shouldn't run the optimizer, bail out */
- if (!Optimize) {
- return;
+ 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 {
- /* Reset the number of changes */
- OptChanges = 0;
-
- /* Keep the user hapy */
- Print (stdout, 1, " Optimizer pass %u:\n", ++Pass);
-
- /* Run all optimization steps */
- for (I = 0; I < sizeof(OptFuncs)/sizeof(OptFuncs[0]); ++I) {
-
- /* Print the name of the following optimizer step */
- Print (stdout, 1, " %s:%*s", OptFuncs[I].Name,
- (int) (30-strlen(OptFuncs[I].Name)), "");
-
- /* Check if the step is disabled */
- if (OptFuncs[I].Disabled) {
- Print (stdout, 1, "Disabled\n");
- } else {
- unsigned Changes = OptFuncs[I].Func (S);
- OptChanges += Changes;
- Print (stdout, 1, "%u Changes\n", Changes);
- }
- }
-
- } while (OptChanges > 0);
-}
+ /* If requested, open an output file */
+ OpenDebugFile (S);
+ WriteDebugOutput (S, 0);
+ /* Generate register info for all instructions */
+ CS_GenRegInfo (S);
+ /* Run groups of optimizations */
+ RunOptGroup1 (S);
+ RunOptGroup2 (S);
+ RunOptGroup3 (S);
+ RunOptGroup4 (S);
+ RunOptGroup5 (S);
+ RunOptGroup6 (S);
+ RunOptGroup7 (S);
+ /* Free register info */
+ CS_FreeRegInfo (S);
+
+ /* Close output file if necessary */
+ if (DebugOptOutput) {
+ CloseOutputFile ();
+ }
+
+ /* Write statistics */
+ if (StatFileName) {
+ WriteOptStats (StatFileName);
+ }
+}
projects / cc65 / blobdiff