This is an archive of the discontinued LLVM Phabricator instance.

[CallSite removal][SimpleLoopUnswitch] Use CallBase instead of CallSite. NFC
ClosedPublic

Authored by craig.topper on Apr 15 2020, 11:38 AM.

Reviewers

dblaikie
mtrofin

Commits

lgtm

This revision is now accepted and ready to land.Apr 15 2020, 12:24 PM

This revision was automatically updated to reflect the committed changes.

Path

Size

llvm/

lib/

Transforms/

Scalar/

4 lines

Show First 20 Lines • Show All 2,650 Lines • ▼ Show 20 Lines	unswitchBestCondition(Loop &L, DominatorTree &DT, LoopInfo &LI,
for (auto *BB : L.blocks()) {		for (auto *BB : L.blocks()) {
int Cost = 0;		int Cost = 0;
for (auto &I : *BB) {		for (auto &I : *BB) {
if (EphValues.count(&I))		if (EphValues.count(&I))
continue;		continue;

if (I.getType()->isTokenTy() && I.isUsedOutsideOfBlock(BB))		if (I.getType()->isTokenTy() && I.isUsedOutsideOfBlock(BB))
return false;		return false;
if (auto CS = CallSite(&I))		if (auto *CB = dyn_cast<CallBase>(&I))
if (CS.isConvergent() \|\| CS.cannotDuplicate())		if (CB->isConvergent() \|\| CB->cannotDuplicate())
return false;		return false;

Cost += TTI.getUserCost(&I);		Cost += TTI.getUserCost(&I);
}		}
assert(Cost >= 0 && "Must not have negative costs!");		assert(Cost >= 0 && "Must not have negative costs!");
LoopCost += Cost;		LoopCost += Cost;
assert(LoopCost >= 0 && "Must not have negative loop costs!");		assert(LoopCost >= 0 && "Must not have negative loop costs!");
BBCostMap[BB] = Cost;		BBCostMap[BB] = Cost;
▲ Show 20 Lines • Show All 339 Lines • Show Last 20 Lines