Lines Matching defs:Insts
684 auto &Insts = PreHeader->getInsts();
685 auto &LastInst = Insts.back();
686 Insts.pop_back();
707 CfgVector<std::reference_wrapper<Inst>> Insts(Node->getInsts().begin(),
710 for (auto &InstRef : Insts) {
873 auto &Insts = Node->getInsts();
881 Insts.insert(Pair.second[0], Assign);
890 Insts.insert(Pair.second[0], Assign);
911 uint32_t CombinedAlignment, InstList &Insts,
973 Insts.push_front(Add);
980 Insts.push_front(CombinedAlloca);
993 Insts.push_front(Def);
1091 InstList &Insts = getEntryNode()->getInsts();
1096 sortAndCombineAllocas(AlignedAllocas, MaxAlignment, Insts, BVT_UserPointer);
1098 sortAndCombineAllocas(FixedAllocas, StackAlignment, Insts,
1105 sortAndCombineAllocas(FixedAllocas, MaxAlignment, Insts, BasePointerType);
1237 // invoked with I = i, the function assumes Insts[i] is the last found
1239 // Insts[i+1].
1241 CfgVector<const Inst *> *Insts, SizeT I = 0) {
1244 if (I > Insts->size()) {
1251 const auto *LastInsert = Insts->at(I);
1254 if (I == Insts->size() - 1) {
1261 << Insts->size();
1271 // a shufflevector. The Insts vector is traversed backwards because the
1274 for (const auto *I : reverse_range(*Insts)) {
1295 (*Insts)[I]->dump(Func);
1312 // Everything seems fine, so we save Def in Insts, and delegate the decision
1314 (*Insts)[I + 1] = Def;
1316 return findAllInserts(Func, Ctx, VM, Insts, I + 1);
1336 const CfgVector<const Inst *> &Insts, Variable **Src0,
1342 assert(Insts.size() > 0);
1343 for (SizeT I = 0; I < Insts.size(); ++I) {
1344 const auto *Insert = Insts.at(I);
