Searched refs:Insts (Results 1 - 25 of 45) sorted by relevance

12

/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/FuzzMutate/
H A DRandomIRBuilder.h35 /// operation's operands. This either selects an instruction in \c Insts or
37 Value *findOrCreateSource(BasicBlock &BB, ArrayRef<Instruction *> Insts);
39 /// operation's operands. This either selects an instruction in \c Insts that
43 Value *findOrCreateSource(BasicBlock &BB, ArrayRef<Instruction *> Insts,
46 Value *newSource(BasicBlock &BB, ArrayRef<Instruction *> Insts,
48 /// Find a viable user for \c V in \c Insts, which should all be contained in
50 void connectToSink(BasicBlock &BB, ArrayRef<Instruction *> Insts, Value *V);
52 void newSink(BasicBlock &BB, ArrayRef<Instruction *> Insts, Value *V);
53 Value *findPointer(BasicBlock &BB, ArrayRef<Instruction *> Insts,
/freebsd-13-stable/contrib/llvm-project/llvm/lib/FuzzMutate/
H A DRandomIRBuilder.cpp22 ArrayRef<Instruction *> Insts) {
23 return findOrCreateSource(BB, Insts, {}, anyType());
27 ArrayRef<Instruction *> Insts,
33 auto RS = makeSampler(Rand, make_filter_range(Insts, MatchesPred));
38 return newSource(BB, Insts, Srcs, Pred);
41 Value *RandomIRBuilder::newSource(BasicBlock &BB, ArrayRef<Instruction *> Insts, argument
48 Value *Ptr = findPointer(BB, Insts, Srcs, Pred);
96 ArrayRef<Instruction *> Insts, Value *V) {
98 for (auto &I : Insts) {
117 newSink(BB, Insts,
21 findOrCreateSource(BasicBlock &BB, ArrayRef<Instruction *> Insts) argument
26 findOrCreateSource(BasicBlock &BB, ArrayRef<Instruction *> Insts, ArrayRef<Value *> Srcs, SourcePred Pred) argument
95 connectToSink(BasicBlock &BB, ArrayRef<Instruction *> Insts, Value *V) argument
120 newSink(BasicBlock &BB, ArrayRef<Instruction *> Insts, Value *V) argument
133 findPointer(BasicBlock &BB, ArrayRef<Instruction *> Insts, ArrayRef<Value *> Srcs, SourcePred Pred) argument
[all...]
H A DIRMutator.cpp107 SmallVector<Instruction *, 32> Insts; local
109 Insts.push_back(&*I);
110 if (Insts.size() < 1)
114 size_t IP = uniform<size_t>(IB.Rand, 0, Insts.size() - 1);
116 auto InstsBefore = makeArrayRef(Insts).slice(0, IP);
117 auto InstsAfter = makeArrayRef(Insts).slice(IP);
133 if (Value *Op = OpDesc->BuilderFunc(Srcs, Insts[IP])) {
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/Mips/
H A DMipsAnalyzeImmediate.h56 /// return it in Insts.
57 void GetShortestSeq(InstSeqLs &SeqLs, InstSeq &Insts);
61 InstSeq Insts; member in class:llvm::MipsAnalyzeImmediate
H A DMipsAnalyzeImmediate.cpp109 void MipsAnalyzeImmediate::GetShortestSeq(InstSeqLs &SeqLs, InstSeq &Insts) { argument
124 Insts.clear();
125 Insts.append(ShortestSeq->begin(), ShortestSeq->end());
153 // Set Insts to the shortest instruction sequence.
154 GetShortestSeq(SeqLs, Insts);
156 return Insts;
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DSSAUpdater.h141 LoadAndStorePromoter(ArrayRef<const Instruction *> Insts,
147 /// Insts is a list of loads and stores to promote, and Name is the basename
150 void run(const SmallVectorImpl<Instruction *> &Insts);
154 /// The Insts list is the one passed into the constructor. Clients should
157 const SmallVectorImpl<Instruction *> &Insts) const;
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineBasicBlock.h112 Instructions Insts;
231 unsigned size() const { return (unsigned)Insts.size(); }
232 bool empty() const { return Insts.empty(); }
234 MachineInstr &instr_front() { return Insts.front(); }
235 MachineInstr &instr_back() { return Insts.back(); }
236 const MachineInstr &instr_front() const { return Insts.front(); }
237 const MachineInstr &instr_back() const { return Insts.back(); }
239 MachineInstr &front() { return Insts.front(); }
241 const MachineInstr &front() const { return Insts.front(); }
244 instr_iterator instr_begin() { return Insts
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSSAUpdater.cpp332 LoadAndStorePromoter(ArrayRef<const Instruction *> Insts, argument
334 if (Insts.empty()) return;
337 if (const LoadInst *LI = dyn_cast<LoadInst>(Insts[0]))
340 SomeVal = cast<StoreInst>(Insts[0])->getOperand(0);
347 void LoadAndStorePromoter::run(const SmallVectorImpl<Instruction *> &Insts) { argument
353 for (Instruction *User : Insts)
362 for (Instruction *User : Insts) {
411 if (!isInstInList(L, Insts)) continue;
427 if (!isInstInList(SI, Insts)) continue;
458 for (Instruction *User : Insts) {
[all...]
H A DSimplifyCFG.cpp1480 // All instructions in Insts belong to different blocks that all unconditionally
1486 ArrayRef<Instruction *> Insts,
1491 bool HasUse = !Insts.front()->user_empty();
1492 for (auto *I : Insts) {
1513 const Instruction *I0 = Insts.front();
1514 for (auto *I : Insts)
1518 // All instructions in Insts are known to be the same opcode. If they have a
1525 if (!all_of(Insts, [&PNUse,&Succ](const Instruction *I) -> bool {
1544 if (isa<StoreInst>(I0) && any_of(Insts, [](const Instruction *I) {
1548 if (isa<LoadInst>(I0) && any_of(Insts, [](cons
1485 canSinkInstructions( ArrayRef<Instruction *> Insts, DenseMap<Instruction *, SmallVector<Value *, 4>> &PHIOperands) argument
1592 SmallVector<Instruction*,4> Insts; local
1694 SmallVector<Instruction*,4> Insts; member in class:__anon4763::LockstepReverseIterator
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DGVNSink.cpp122 SmallVector<Instruction *, 4> Insts; member in class:__anon4630::LockstepReverseIterator
135 Insts.clear();
142 Insts.push_back(BB->getTerminator()->getPrevNode());
144 if (Insts.empty())
149 ArrayRef<Instruction *> operator*() const { return Insts; }
160 for (auto II = Insts.begin(); II != Insts.end();) {
164 II = Insts.erase(II);
175 for (auto *Inst : Insts) {
185 Insts
267 ModelledPHI(ArrayRef<Instruction *> Insts, unsigned OpNum, const BArray &B) argument
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/MCA/
H A DHWEventListener.h144 HWPressureEvent(GenericReason reason, ArrayRef<InstRef> Insts, argument
146 : Reason(reason), AffectedInstructions(Insts), ResourceMask(Mask) {}
/freebsd-13-stable/contrib/llvm-project/llvm/tools/llvm-mca/
H A Dllvm-mca.cpp466 ArrayRef<MCInst> Insts = Region->getInstructions();
467 mca::CodeEmitter CE(*STI, *MAB, *MCE, Insts);
469 for (const MCInst &MCI : Insts) {
505 *STI, *MCII, CE, ShowEncoding, Insts, *IP));
508 std::make_unique<mca::ResourcePressureView>(*STI, *IP, Insts));
523 std::make_unique<mca::SummaryView>(SM, Insts, DispatchWidth));
527 *STI, *IP, Insts, S.getNumIterations()));
532 *STI, *MCII, CE, ShowEncoding, Insts, *IP));
548 std::make_unique<mca::ResourcePressureView>(*STI, *IP, Insts));
554 *STI, *IP, Insts, st
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/utils/TableGen/
H A DCodeGenTarget.cpp424 std::vector<Record*> Insts = Records.getAllDerivedDefinitions("Instruction"); local
425 if (Insts.size() <= 2)
429 for (unsigned i = 0, e = Insts.size(); i != e; ++i)
430 Instructions[Insts[i]] = std::make_unique<CodeGenInstruction>(Insts[i]);
436 std::unique_ptr<CodeGenInstruction>> &Insts,
440 const auto I = Insts.find(Rec);
441 if (!Rec || I == Insts.end())
458 const auto &Insts = getInstructions(); local
460 const CodeGenInstruction *Instr = GetInstByName(*p, Insts, Record
434 GetInstByName(const char *Name, const DenseMap<const Record*, std::unique_ptr<CodeGenInstruction>> &Insts, RecordKeeper &Records) argument
[all...]
H A DPseudoLoweringEmitter.cpp279 std::vector<Record*> Insts; local
283 Insts.push_back(D.second.get());
287 for (unsigned i = 0, e = Insts.size(); i != e; ++i)
288 evaluateExpansion(Insts[i]);
H A DAsmWriterEmitter.cpp103 static void EmitInstructions(std::vector<AsmWriterInst> &Insts, argument
105 AsmWriterInst FirstInst = Insts.back();
106 Insts.pop_back();
110 for (unsigned i = Insts.size(); i != 0; --i) {
111 unsigned DiffOp = Insts[i-1].MatchesAllButOneOp(FirstInst);
119 SimilarInsts.push_back(Insts[i-1]);
120 Insts.erase(Insts.begin()+i-1);
H A DCodeEmitterGen.cpp391 std::vector<Record*> Insts = Records.getAllDerivedDefinitions("Instruction"); local
464 for (std::vector<Record*>::iterator IC = Insts.begin(), EC = Insts.end();
/freebsd-13-stable/contrib/llvm-project/llvm/lib/MCA/Stages/
H A DExecuteStage.cpp131 SmallVector<InstRef, 8> Insts;
132 uint64_t Mask = HWS.analyzeResourcePressure(Insts);
137 HWPressureEvent Ev(HWPressureEvent::RESOURCES, Insts, Mask);
/freebsd-13-stable/contrib/llvm-project/llvm/lib/MCA/HardwareUnits/
H A DScheduler.cpp243 uint64_t Scheduler::analyzeResourcePressure(SmallVectorImpl<InstRef> &Insts) { argument
244 Insts.insert(Insts.end(), ReadySet.begin(), ReadySet.end());
/freebsd-13-stable/contrib/llvm-project/llvm/tools/bugpoint/
H A DCrashDebugger.cpp770 std::vector<const Instruction *> &Insts) {
777 for (unsigned i = 0, e = Insts.size(); i != e; ++i) {
778 assert(!Insts[i]->isTerminator());
779 Instructions.insert(cast<Instruction>(VMap[Insts[i]]));
812 Insts.clear();
814 Insts.push_back(Inst);
846 bool ReduceCrashingMetadata::TestInsts(std::vector<Instruction *> &Insts) { argument
853 for (Instruction *I : Insts)
884 Insts.clear();
886 Insts
769 TestInsts( std::vector<const Instruction *> &Insts) argument
1093 std::vector<const Instruction *> Insts; local
1173 std::vector<Instruction *> Insts; local
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/AArch64/
H A DAArch64A57FPLoadBalancing.cpp193 std::set<MachineInstr*> Insts; member in class:__anon3834::Chain
207 Insts.insert(MI);
220 Insts.insert(MI);
224 bool contains(MachineInstr &MI) { return Insts.count(&MI) > 0; }
228 return Insts.size();
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/MCA/HardwareUnits/
H A DScheduler.h254 /// Returns a mask of busy resources, and populates vector Insts with
257 uint64_t analyzeResourcePressure(SmallVectorImpl<InstRef> &Insts);
/freebsd-13-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/
H A DReassociate.h123 void RecursivelyEraseDeadInsts(Instruction *I, OrderedSet &Insts);
/freebsd-13-stable/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMLowOverheadLoops.cpp155 SmallVector<PredicatedMI, 4> Insts; member in class:__anon4030::VPTBlock
165 Divergent = &Insts.back();
168 Insts.emplace_back(MI, Preds);
169 assert(Insts.size() <= 4 && "Too many instructions in VPT block!");
198 unsigned size() const { return Insts.size(); }
199 SmallVectorImpl<PredicatedMI> &getInsts() { return Insts; }
428 SmallVectorImpl<PredicatedMI> &Insts = Block.getInsts(); local
429 for (auto &PredMI : Insts) {
1426 SmallVectorImpl<PredicatedMI> &Insts = Block.getInsts(); local
1449 auto I = MachineBasicBlock::reverse_iterator(Insts
[all...]
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DLegalizer.cpp120 LegalizerWorkListManager(InstListTy &Insts, ArtifactListTy &Arts) argument
121 : InstList(Insts), ArtifactList(Arts) {}
/freebsd-13-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachinePipeliner.cpp2553 std::deque<SUnit *> &Insts) {
2563 for (std::deque<SUnit *>::iterator I = Insts.begin(), E = Insts.end(); I != E;
2658 SUnit *UseSU = Insts.at(MoveUse);
2659 SUnit *DefSU = Insts.at(MoveDef);
2661 Insts.erase(Insts.begin() + MoveUse);
2662 Insts.erase(Insts.begin() + MoveDef);
2664 Insts
2552 orderDependence(SwingSchedulerDAG *SSD, SUnit *SU, std::deque<SUnit *> &Insts) argument
[all...]

Completed in 207 milliseconds

12