Searched refs:BEInst (Results 1 – 2 of 2) sorted by relevance
370 Instruction *BEInst = D->back(); in findValueToReuse() local405 for (Use &U : BEInst->uses()) { in findValueToReuse()511 Instruction *BEInst = ReuseCandidate.BackedgeInst; in reuseValue() local540 BasicBlock *BB = BEInst->getParent(); in reuseValue()543 Value *BEVal = BEInst; in reuseValue()608 Instruction *BEInst = dyn_cast<Instruction>(BEVal); in findDepChainFromPHI() local611 assert(BEInst && "There should be a value over the backedge"); in findDepChainFromPHI()620 findDepChainFromPHI(BEInst, D); in findDepChainFromPHI()
5758 if (auto *BEInst = dyn_cast<Instruction>(BEValueV)) { in createSimpleAffineAddRec() local5761 if (isAddRecNeverPoison(BEInst, L)) in createSimpleAffineAddRec()5889 if (auto *BEInst = dyn_cast<Instruction>(BEValueV)) in createAddRecFromPHI() local5890 if (isLoopInvariant(Accum, L) && isAddRecNeverPoison(BEInst, L)) in createAddRecFromPHI()