ip->op = op;
ip->cval = constVal;
ip->ic = ic;
- updateSpillLocation(ic,1);
+//updateSpillLocation(ic,1);
return ip;
}
if (!exit)
return NULL;
-
+
succVect = bitVectCopy (exit->succVect);
for (exit = setNextItem (lexits); exit;
if (ebp->depth<depth)
ebp->depth = depth;
- if (getenv ("SDCC_LRKLAUS"))
- {
- /* put the loop region info in the block */
- if (!isinSet (ebp->KpartOfLoop, lr))
- addSetHead (&ebp->KpartOfLoop, lr);
- }
- else
- {
- /* NOTE: here we will update only the inner most loop
- that it is a part of */
- if (!ebp->partOfLoop)
- ebp->partOfLoop = lr;
- }
+ /* NOTE: here we will update only the inner most loop
+ that it is a part of */
+ if (!ebp->partOfLoop)
+ ebp->partOfLoop = lr;
/* if any of the successors go out of the loop then */
/* we add this one to the exits */
eBBlock *ebp = item;
V_ARG (operand *, op);
- return ebp->hasFcall || bitVectBitValue (ebp->ptrsSet, op->key);
+ if (ebp->hasFcall)
+ return 1;
+
+ if (bitVectBitValue (ebp->ptrsSet, op->key))
+ return 1;
+
+ /* Unfortunately, one of the other pointer set operations */
+ /* may be using an alias of this operand, and the above */
+ /* test would miss it. To be thorough, some aliasing */
+ /* analysis should be done here. In the meantime, be */
+ /* conservative and assume any other pointer set operation */
+ /* is dangerous */
+ if (!bitVectIsZero (ebp->ptrsSet))
+ return 1;
+
+ return 0;
}
/*-----------------------------------------------------------------*/
if (SKIP_IC (ic) || POINTER_SET (ic) || ic->op == IFX)
continue;
+
+ /* iTemp assignment from a literal may be invariant, but it
+ will needlessly increase register pressure if the
+ iCode(s) that use this iTemp are not also invariant */
+ if (ic->op=='=' && IS_ITEMP (IC_RESULT (ic))
+ && IS_OP_LITERAL (IC_RIGHT (ic)))
+ continue;
/* if result is volatile then skip */
if (IC_RESULT (ic) &&
applyToSet (theLoop->regBlocks, hasNonPtrUse, IC_LEFT (ic)))
continue;
- /* if both the left & right are invariants : then check that */
+
+ /* if both the left & right are invariants : then check that */
/* this definition exists in the out definition of all the */
/* blocks, this will ensure that this is not assigned any */
/* other value in the loop , and not used in this block */
eBBlock *sBlock;
set *lSet = setFromSet (theLoop->regBlocks);
- /* if this block does not dominate all exists */
+ /* if this block does not dominate all exits */
/* make sure this defintion is not used anywhere else */
if (!domsAllExits)
{
/* now we know it is a true invariant */
/* remove it from the insts chain & put */
/* in the invariant set */
- OP_SYMBOL (IC_RESULT (ic))->isinvariant = 1;
+
+ OP_SYMBOL (IC_RESULT (ic))->isinvariant = 1;
+ SPIL_LOC (IC_RESULT (ic)) = NULL;
remiCodeFromeBBlock (lBlock, ic);
/* maintain the data flow */
if (nexits == 1)
{
eBBlock *exit = setFirstItem (loopReg->exits);
-
/* if it is the same block then there is no
need to move it about */
if (exit != lBlock)
if (bitVectBitValue (loopSuccs, i))
{
- eBBlock *eblock = ebbs[i];
+ eBBlock *eblock = NULL;
+ int j;
+
+ /* Need to search for bbnum == i since ebbs is */
+ /* sorted by dfnum; a direct index won't do. */
+ for (j=0; j<count; j++)
+ if (ebbs[j]->bbnum == i)
+ {
+ eblock = ebbs[j];
+ break;
+ }
+ assert(eblock);
/* if the successor does not belong to the loop
and will be executed after the loop : then
return change;
}
-
-/*-----------------------------------------------------------------*/
-/* addLoopBlocks - will add all blocks inside a loop to this loop */
-/* this should fix most of the liverange problems */
-/*-----------------------------------------------------------------*/
-void
-addLoopBlocks (eBBlock ** ebbs, int count)
-{
- region *aloop;
- struct eBBlock *block;
- int seqMin, seqMax;
- int i, j;
-
- for (i = 0; i < count; i++)
- {
- if (!ebbs[i]->KpartOfLoop)
- continue;
-
- /* for all loops this block belongs to */
- /* add inner block not already marked as part of this loop */
- aloop = setFirstItem (ebbs[i]->KpartOfLoop);
- for (; aloop; aloop = setNextItem (ebbs[i]->KpartOfLoop))
- {
-
- if (aloop->visited)
- continue;
-
- aloop->visited = 1;
-
- /* set max & min Seq for loopRegion */
- block = setFirstItem (aloop->regBlocks);
- seqMax = block->lSeq;
- seqMin = block->fSeq;
- for (; block; block = setNextItem (aloop->regBlocks))
- {
- if (block->lSeq > seqMax)
- seqMax = block->lSeq;
- if (block->fSeq < seqMin)
- seqMin = block->fSeq;
- }
-
- /* add all blocks between seqMin, seqMax to loop */
- for (j = 0; j < count; j++)
- {
- if (ebbs[j]->fSeq > seqMin && ebbs[j]->lSeq < seqMax &&
- !isinSet (aloop->regBlocks, ebbs[j]))
- {
- if (!isinSet (ebbs[j]->KpartOfLoop, aloop))
- addSetHead (&ebbs[j]->KpartOfLoop, aloop);
- }
- }
- }
- }
-}
projects / fw / sdcc / blobdiff