6502/cc65
1
0
Fork 0
mirror of https://github.com/cc65/cc65.git synced 2025-01-17 05:31:45 +00:00
Code Issues Projects Releases Wiki Activity

Improve the performance of the routine that determines the overall .IF

Browse Source 
condition.
            


git-svn-id: svn://svn.cc65.org/cc65/trunk@5046 b7a2c559-68d2-44c3-8de9-860c34a00d81
This commit is contained in:
uz 2011-06-09 11:23:37 +00:00
parent 15fc094c7a
commit acb1699017
1 changed files with 63 additions and 49 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

112
src/ca65/condasm.c
View File

@ -58,8 +58,9 @@
enum { enum {
ifNone = 0x0000, /* No flag */ ifNone = 0x0000, /* No flag */
ifCond = 0x0001, /* IF condition was true */ ifCond = 0x0001, /* IF condition was true */
ifElse = 0x0002, /* We had a .ELSE branch */ ifParentCond= 0x0002, /* IF condition of parent */
ifNeedTerm = 0x0004, /* Need .ENDIF termination */ ifElse = 0x0004, /* We had a .ELSE branch */
ifNeedTerm = 0x0008, /* Need .ENDIF termination */
}; };
/* The overall .IF condition */ /* The overall .IF condition */
@ -87,31 +88,6 @@ static unsigned IfCount = 0;
static IfDesc* AllocIf (const char* Directive, int NeedTerm)
/* Alloc a new element from the .IF stack */
{
IfDesc* ID;
/* Check for stack overflow */
if (IfCount >= MAX_IFS) {
Fatal ("Too many nested .IFs");
}
/* Alloc one element */
ID = &IfStack[IfCount++];
/* Initialize elements */
ID->Flags = NeedTerm? ifNeedTerm : ifNone;
ID->LineInfos = EmptyCollection;
GetFullLineInfo (&ID->LineInfos, 0);
ID->Name = Directive;
/* Return the result */
return ID;
}
static IfDesc* GetCurrentIf (void) static IfDesc* GetCurrentIf (void)
/* Return the current .IF descriptor */ /* Return the current .IF descriptor */
{ {
@ -124,35 +100,23 @@ static IfDesc* GetCurrentIf (void)
static void FreeIf (void) static int GetOverallIfCond (void)
/* Free all .IF descriptors until we reach one with the NeedTerm bit set */ /* Get the overall condition based on all conditions on the stack. */
{ {
int Done; /* Since the last entry contains the overall condition of the parent, we
do { * must check it in combination of the current condition. If there is no
IfDesc* ID = GetCurrentIf(); * last entry, the overall condition is true.
if (ID == 0) { */
Error (" Unexpected .ENDIF"); return (IfCount == 0) ||
Done = 1; ((IfStack[IfCount-1].Flags & (ifCond | ifParentCond)) == (ifCond | ifParentCond));
} else {
Done = (ID->Flags & ifNeedTerm) != 0;
--IfCount;
}
} while (!Done);
} }
static void CalcOverallIfCond (void) static void CalcOverallIfCond (void)
/* Caclulate the overall condition based on all conditions on the stack */ /* Caclulate the overall condition based on all conditions on the stack. */
{ {
unsigned Count; IfCond = GetOverallIfCond ();
IfCond = 1;
for (Count = 0; Count < IfCount; ++Count) {
if ((IfStack[Count].Flags & ifCond) == 0) {
IfCond = 0;
break;
}
}
} }
@ -191,6 +155,56 @@ static void ElseClause (IfDesc* ID, const char* Directive)
static IfDesc* AllocIf (const char* Directive, int NeedTerm)
/* Alloc a new element from the .IF stack */
{
IfDesc* ID;
/* Check for stack overflow */
if (IfCount >= MAX_IFS) {
Fatal ("Too many nested .IFs");
}
/* Get the next element */
ID = &IfStack[IfCount];
/* Initialize elements */
ID->Flags = NeedTerm? ifNeedTerm : ifNone;
if (GetOverallIfCond ()) {
/* The parents .IF condition is true */
ID->Flags |= ifParentCond;
}
ID->LineInfos = EmptyCollection;
GetFullLineInfo (&ID->LineInfos, 0);
ID->Name = Directive;
/* One more slot allocated */
++IfCount;
/* Return the result */
return ID;
}
static void FreeIf (void)
/* Free all .IF descriptors until we reach one with the NeedTerm bit set */
{
int Done;
do {
IfDesc* ID = GetCurrentIf();
if (ID == 0) {
Error (" Unexpected .ENDIF");
Done = 1;
} else {
Done = (ID->Flags & ifNeedTerm) != 0;
--IfCount;
}
} while (!Done);
}
/*****************************************************************************/ /*****************************************************************************/
/* Code */ /* Code */
/*****************************************************************************/ /*****************************************************************************/