Now we're pretty sure that the codebase doesn't cause any regressions.

This commit is contained in:
Shamus Hammons 2018-08-20 10:35:12 -05:00
parent 30a2086548
commit 0561939cf6
2 changed files with 6 additions and 4 deletions

View File

@ -1169,7 +1169,7 @@ CHK_FOR_DISPn:
// expr[.L]
AMn = ABSL;
// Is .L forced here?
// .L is forced here
if (*tok == DOTL)
{
tok++;
@ -1177,8 +1177,8 @@ CHK_FOR_DISPn:
}
else
{
// Defined, absolute values from $FFFF8000..$00007FFF get optimized
// to absolute short
// Defined, absolute values from $FFFF8000..$00007FFF get
// optimized to absolute short
if (CHECK_OPTS(OPT_ABS_SHORT)
&& ((AnEXATTR & (TDB | DEFINED)) == DEFINED)
&& (((uint32_t)AnEXVAL + 0x8000) < 0x10000))

View File

@ -854,9 +854,11 @@ When checking to see if it's already been equated, issue a warning.
// Keep a backup of chptr (used for optimisations during codegen)
chptr_opcode = chptr;
while ((m->mnattr & siz) && (amsk0 & m->mn0) == 0 || (amsk1 & m->mn1) == 0)
while (!(m->mnattr & siz) || (amsk0 & m->mn0) == 0 || (amsk1 & m->mn1) == 0)
m = &machtab[m->mncont];
DEBUG { printf(" 68K: mninst=$%X, siz=$%X, mnattr=$%X, amsk0=$%X, mn0=$%X, amsk1=$%X, mn1=$%X\n", m->mninst, siz, m->mnattr, amsk0, m->mn0, amsk1, m->mn1); }
(*m->mnfunc)(m->mninst, siz);
goto loop;
}