Lines Matching defs:OpI

2524         for (unsigned OpI = 0, OpE = getNumOperands(); OpI != OpE; ++OpI) {
2525           OperandData &Data = getData(OpI, Ln);
2528           Value *OpILane = getValue(OpI, Lane);
2542                  !getSameOpcode({Op, getValue((OpI + 1) % OpE, Ln)}, TLI) &&
2575         if (any_of(seq<unsigned>(getNumOperands()), [&](unsigned OpI) {
2576               const OperandData &Data = getData(OpI, Ln);
2579               Value *OpILn = getValue(OpI, Ln);
2859         if (auto *OpI = dyn_cast_if_present<Instruction>(U.get());
2860             OpI && !DeletedInstructions.contains(OpI) && OpI->hasOneUser() &&
2861             wouldInstructionBeTriviallyDead(OpI, TLI) &&
2863                return Entry->VectorizedValue == OpI;
2865           DeadInsts.push_back(OpI);
2909         if (auto *OpI = dyn_cast<Instruction>(OpV))
2910           if (!DeletedInstructions.contains(OpI) &&
2911               isInstructionTriviallyDead(OpI, TLI))
2912             DeadInsts.push_back(OpI);
3508       for (unsigned OpI = 0, OpE = Operands.size(); OpI != OpE; ++OpI) {
3509         dbgs() << "Operand " << OpI << ":\n";
3510         for (const Value *V : Operands[OpI])
8638         if (auto *OpI = dyn_cast<Instruction>(VL0->getOperand(0))) {
8639           APInt Mask = DB->getDemandedBits(OpI);
16951           auto *OpI = dyn_cast<Instruction>(V);
16952           return OpI && L->contains(OpI);