HomeSort by: relevance | last modified time | path
    Searched refs:BEInst (Results 1 - 2 of 2) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Target/Hexagon/
HexagonVectorLoopCarriedReuse.cpp 382 Instruction *BEInst = D->back();
412 // performs the same operation as I on BEInst and whose other operands,
418 for (auto UI = BEInst->use_begin(), E = BEInst->use_end(); UI != E;
526 Instruction *BEInst = ReuseCandidate.BackedgeInst;
556 BasicBlock *BB = BEInst->getParent();
559 Value *BEVal = BEInst;
624 Instruction *BEInst = dyn_cast<Instruction>(BEVal);
627 assert(BEInst && "There should be a value over the backedge");
636 findDepChainFromPHI(BEInst, D)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
ScalarEvolution.cpp 5096 if (auto *BEInst = dyn_cast<Instruction>(BEValueV))
5097 if (isLoopInvariant(Accum, L) && isAddRecNeverPoison(BEInst, L))
5218 if (auto *BEInst = dyn_cast<Instruction>(BEValueV))
5219 if (isLoopInvariant(Accum, L) && isAddRecNeverPoison(BEInst, L))

Completed in 24 milliseconds