Searched refs:BEInst (Results 1 – 2 of 2) sorted by relevance
382 Instruction *BEInst = D->back(); in findValueToReuse() local 411 // performs the same operation as I on BEInst and whose other operands, in findValueToReuse() 417 for (Use &U : BEInst->uses()) { in findValueToReuse() 523 Instruction *BEInst = ReuseCandidate.BackedgeInst; in reuseValue() local 553 BasicBlock *BB = BEInst->getParent(); in reuseValue() 556 Value *BEVal = BEInst; in reuseValue() 621 Instruction *BEInst = dyn_cast<Instruction>(BEVal); in findDepChainFromPHI() local 624 assert(BEInst && "There should be a value over the backedge"); in findDepChainFromPHI() 633 findDepChainFromPHI(BEInst, D); in findDepChainFromPHI()
5791 if (auto *BEInst = dyn_cast<Instruction>(BEValueV)) { in createSimpleAffineAddRec() local5794 if (isAddRecNeverPoison(BEInst, L)) in createSimpleAffineAddRec()5922 if (auto *BEInst = dyn_cast<Instruction>(BEValueV)) in createAddRecFromPHI() local5923 if (isLoopInvariant(Accum, L) && isAddRecNeverPoison(BEInst, L)) in createAddRecFromPHI()