HomeSort by: relevance | last modified time | path
    Searched defs:LU (Results 1 - 4 of 4) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/tools/verify-uselistorder/
verify-uselistorder.cpp 318 auto LU = L->use_begin(), LE = L->use_end();
320 skipUnmappedUsers(LU, LE, LM);
323 while (LU != LE) {
328 if (LM.lookup(LU->getUser()) != RM.lookup(RU->getUser())) {
332 if (LU->getOperandNo() != RU->getOperandNo()) {
336 skipUnmappedUsers(++LU, LE, LM);
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
ScalarEvolution.cpp 716 const SCEVUnknown *LU = cast<SCEVUnknown>(LHS);
719 int X = CompareValueComplexity(EqCacheValue, LI, LU->getValue(),
10710 if (const SCEVUnknown *LU = dyn_cast<SCEVUnknown>(LHS))
10711 if (auto *Phi = dyn_cast<PHINode>(LU->getValue())) {
  /src/external/apache2/llvm/dist/llvm/lib/IR/
LegacyPassManager.cpp 624 auto &LU = DMI->second;
625 LastUses.append(LU.begin(), LU.end());
1638 SmallVector<Pass *, 1> LU;
1639 LU.push_back(FoundPass);
1640 FPP->setLastUser(LU, P);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
LoopStrengthReduce.cpp 1000 /// folded in \p LU at isel time.
1002 /// This function returns true if \p LU can accommodate what \p F
1009 const LSRUse &LU, const Formula &F);
1011 // Get the cost of the scaling factor used in F for LU.
1013 const LSRUse &LU, const Formula &F,
1063 const LSRUse &LU,
1327 const LSRUse &LU,
1359 NumBaseParts - (1 + (F.Scale && isAMCompletelyFolded(*TTI, LU, F)));
1363 C.ScaleCost += *getScalingFactorCost(*TTI, LU, F, *L).getValue();
1366 for (const LSRFixup &Fixup : LU.Fixups)
    [all...]

Completed in 129 milliseconds