Home
last modified time | relevance | path

Searched refs:Instruction (Results 1 – 25 of 1146) sorted by relevance

12345678910>>...46

/freebsd/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineInternal.h64 public InstVisitor<InstCombinerImpl, Instruction *> {
93 Instruction *visitFNeg(UnaryOperator &I);
94 Instruction *visitAdd(BinaryOperator &I);
95 Instruction *visitFAdd(BinaryOperator &I);
98 Instruction *visitSub(BinaryOperator &I);
99 Instruction *visitFSub(BinaryOperator &I);
100 Instruction *visitMul(BinaryOperator &I);
101 Instruction *foldPowiReassoc(BinaryOperator &I);
102 Instruction *foldFMulReassoc(BinaryOperator &I);
103 Instruction *visitFMul(BinaryOperator &I);
[all …]
/freebsd/contrib/llvm-project/llvm/lib/IR/
H A DInstruction.cpp29 InsertPosition::InsertPosition(Instruction *InsertBefore) in InsertPosition()
35 Instruction::Instruction(Type *ty, unsigned it, Use *Ops, unsigned NumOps, in Instruction() function in Instruction
46 Instruction::~Instruction() { in ~Instruction()
66 const Module *Instruction::getModule() const { in getModule()
70 const Function *Instruction::getFunction() const { in getFunction()
74 const DataLayout &Instruction::getDataLayout() const { in getDataLayout()
78 void Instruction::removeFromParent() { in removeFromParent()
85 void Instruction::handleMarkerRemoval() { in handleMarkerRemoval()
92 BasicBlock::iterator Instruction::eraseFromParent() { in eraseFromParent()
97 void Instruction::insertBefore(Instruction *InsertPos) { in insertBefore()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanAnalysis.cpp46 if (Instruction::isBinaryOp(Opcode) || Instruction::isUnaryOp(Opcode)) in inferScalarTypeForRecipe()
50 case Instruction::Select: { in inferScalarTypeForRecipe()
58 case Instruction::ICmp: in inferScalarTypeForRecipe()
92 case Instruction::ICmp: in inferScalarTypeForRecipe()
93 case Instruction::FCmp: in inferScalarTypeForRecipe()
95 case Instruction::UDiv: in inferScalarTypeForRecipe()
96 case Instruction::SDiv: in inferScalarTypeForRecipe()
97 case Instruction::SRem: in inferScalarTypeForRecipe()
98 case Instruction::URem: in inferScalarTypeForRecipe()
99 case Instruction::Add: in inferScalarTypeForRecipe()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/FuzzMutate/
H A DOperations.cpp19 Ops.push_back(binOpDescriptor(1, Instruction::Add)); in describeFuzzerIntOps()
20 Ops.push_back(binOpDescriptor(1, Instruction::Sub)); in describeFuzzerIntOps()
21 Ops.push_back(binOpDescriptor(1, Instruction::Mul)); in describeFuzzerIntOps()
22 Ops.push_back(binOpDescriptor(1, Instruction::SDiv)); in describeFuzzerIntOps()
23 Ops.push_back(binOpDescriptor(1, Instruction::UDiv)); in describeFuzzerIntOps()
24 Ops.push_back(binOpDescriptor(1, Instruction::SRem)); in describeFuzzerIntOps()
25 Ops.push_back(binOpDescriptor(1, Instruction::URem)); in describeFuzzerIntOps()
26 Ops.push_back(binOpDescriptor(1, Instruction::Shl)); in describeFuzzerIntOps()
27 Ops.push_back(binOpDescriptor(1, Instruction::LShr)); in describeFuzzerIntOps()
28 Ops.push_back(binOpDescriptor(1, Instruction::AShr)); in describeFuzzerIntOps()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/
H A DTruncInstCombine.cpp34 #include "llvm/IR/Instruction.h"
48 static void getRelevantOperands(Instruction *I, SmallVectorImpl<Value *> &Ops) { in getRelevantOperands()
51 case Instruction::Trunc: in getRelevantOperands()
52 case Instruction::ZExt: in getRelevantOperands()
53 case Instruction::SExt: in getRelevantOperands()
57 case Instruction::Add: in getRelevantOperands()
58 case Instruction::Sub: in getRelevantOperands()
59 case Instruction::Mul: in getRelevantOperands()
60 case Instruction::And: in getRelevantOperands()
61 case Instruction in getRelevantOperands()
[all...]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DSpeculativeExecution.cpp213 static InstructionCost ComputeSpeculationCost(const Instruction *I, in ComputeSpeculationCost()
216 case Instruction::GetElementPtr: in ComputeSpeculationCost()
217 case Instruction::Add: in ComputeSpeculationCost()
218 case Instruction::Mul: in ComputeSpeculationCost()
219 case Instruction::And: in ComputeSpeculationCost()
220 case Instruction::Or: in ComputeSpeculationCost()
221 case Instruction::Select: in ComputeSpeculationCost()
222 case Instruction::Shl: in ComputeSpeculationCost()
223 case Instruction::Sub: in ComputeSpeculationCost()
224 case Instruction::LShr: in ComputeSpeculationCost()
[all …]
H A DFloat2Int.cpp78 static Instruction::BinaryOps mapBinOpcode(unsigned Opcode) { in mapBinOpcode()
81 case Instruction::FAdd: return Instruction::Add; in mapBinOpcode()
82 case Instruction::FSub: return Instruction::Sub; in mapBinOpcode()
83 case Instruction::FMul: return Instruction::Mul; in mapBinOpcode()
96 for (Instruction &I : BB) { in findRoots()
101 case Instruction::FPToUI: in findRoots()
102 case Instruction::FPToSI: in findRoots()
105 case Instruction::FCmp: in findRoots()
116 void Float2IntPass::seen(Instruction *I, ConstantRange R) { in seen()
153 std::deque<Instruction*> Worklist(Roots.begin(), Roots.end()); in walkBackwards()
[all …]
H A DReassociate.cpp82 static void PrintOps(Instruction *I, const SmallVectorImpl<ValueEntry> &Ops) { in PrintOps()
84 dbgs() << Instruction::getOpcodeName(I->getOpcode()) << " " in PrintOps()
127 Instruction *I = dyn_cast<Instruction>(V); in XorOpnd()
130 if (I && (I->getOpcode() == Instruction::Or || in XorOpnd()
131 I->getOpcode() == Instruction::And)) { in XorOpnd()
141 isOr = (I->getOpcode() == Instruction::Or); in XorOpnd()
156 static bool hasFPAssociativeFlags(Instruction *I) { in hasFPAssociativeFlags()
199 for (Instruction &I : *BB) in BuildRankMap()
206 Instruction *I = dyn_cast<Instruction>(V); in getRank()
236 void ReassociatePass::canonicalizeOperands(Instruction *I) { in canonicalizeOperands()
[all …]
H A DGVNSink.cpp94 static bool isMemoryInst(const Instruction *I) { in isMemoryInst()
115 SmallVector<Instruction *, 4> Insts;
142 ArrayRef<Instruction *> operator*() const { return Insts; } in operator *()
166 SmallVector<Instruction *, 4> NewInsts; in operator --()
272 assert(cast<Instruction>(V)->getParent() == Blocks[C]); in verifyModelledPHI()
279 ModelledPHI(SmallVectorImpl<Instruction *> &V, in ModelledPHI()
290 ModelledPHI(ArrayRef<Instruction *> Insts, unsigned OpNum, in ModelledPHI()
380 InstructionUseExpr(Instruction *I, ArrayRecycler<Value *> &R, in InstructionUseExpr()
426 InstructionUseExpr *createExpr(Instruction *I) { in createExpr()
465 if (!isa<Instruction>(V)) { in lookupOrAdd()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZTargetTransformInfo.cpp40 if (const Instruction *User = dyn_cast<Instruction>(U)) { in isUsedAsMemCpySource()
110 Instruction *Inst) { in getIntImmCostInst()
125 case Instruction::GetElementPtr: in getIntImmCostInst()
132 case Instruction::Store: in getIntImmCostInst()
142 case Instruction::ICmp: in getIntImmCostInst()
152 case Instruction::Add: in getIntImmCostInst()
153 case Instruction::Sub: in getIntImmCostInst()
163 case Instruction::Mul: in getIntImmCostInst()
170 case Instruction::Or: in getIntImmCostInst()
171 case Instruction::Xor: in getIntImmCostInst()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/ARM/
H A DMVELaneInterleavingPass.cpp115 static bool isProfitableToInterleave(SmallSetVector<Instruction *, 4> &Exts, in isProfitableToInterleave() argument
116 SmallSetVector<Instruction *, 4> &Truncs) { in isProfitableToInterleave()
146 cast<Instruction>(*E->user_begin())->getOpcode() != Instruction::Mul) { in isProfitableToInterleave()
154 static bool tryInterleave(Instruction *Start, in tryInterleave()
155 SmallPtrSetImpl<Instruction *> &Visited) { in tryInterleave()
158 if (!isa<Instruction>(Start->getOperand(0))) in tryInterleave()
162 std::vector<Instruction *> Worklist; in tryInterleave()
164 Worklist.push_back(cast<Instruction>(Start->getOperand(0))); in tryInterleave()
166 SmallSetVector<Instruction *, 4> Truncs; in tryInterleave()
167 SmallSetVector<Instruction *, 4> Reducts; in tryInterleave()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DInstruction.h41 template <> struct ilist_alloc_traits<Instruction> {
42 static inline void deleteNode(Instruction *V);
49 using InstListType = SymbolTableList<Instruction, ilist_iterator_bits<true>,
57 InsertPosition(Instruction *InsertBefore);
65 class Instruction : public User,
66 public ilist_node_with_parent<Instruction, BasicBlock,
70 using InstListType = SymbolTableList<Instruction, ilist_iterator_bits<true>,
99 const Instruction *From,
161 ~Instruction(); // Use deleteValue() to delete a generic Instruction.
164 Instruction(const Instruction &) = delete;
[all …]
H A DOperator.h43 if (const Instruction *I = dyn_cast<Instruction>(this)) in getOpcode()
51 if (const Instruction *I = dyn_cast<Instruction>(V)) in getOpcode()
55 return Instruction::UserOp1; in getOpcode()
58 static bool classof(const Instruction *) { return true; } in classof() argument
61 return isa<Instruction>(V) || isa<ConstantExpr>(V); in classof()
86 friend class Instruction;
126 static bool classof(const Instruction *I) { in classof()
127 return I->getOpcode() == Instruction::Add || in classof()
128 I->getOpcode() == Instruction::Sub || in classof()
129 I->getOpcode() == Instruction::Mul || in classof()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DIVDescriptors.h26 class Instruction;
75 RecurrenceDescriptor(Value *Start, Instruction *Exit, StoreInst *Store, in RecurrenceDescriptor()
76 RecurKind K, FastMathFlags FMF, Instruction *ExactFP, in RecurrenceDescriptor()
78 SmallPtrSetImpl<Instruction *> &CI, in RecurrenceDescriptor()
90 InstDesc(bool IsRecur, Instruction *I, Instruction *ExactFP = nullptr)
94 InstDesc(Instruction *I, RecurKind K, Instruction *ExactFP = nullptr)
102 Instruction *getExactFPMathInst() const { return ExactFPMathInst; } in getExactFPMathInst()
106 Instruction *getPatternIns
27 class Instruction; global() variable
[all...]
H A DMustExecute.h40 class Instruction; variable
97 virtual bool isGuaranteedToExecute(const Instruction &Inst,
122 bool isGuaranteedToExecute(const Instruction &Inst,
147 bool isGuaranteedToExecute(const Instruction &Inst,
158 bool doesNotWriteMemoryBefore(const Instruction &I, const Loop *CurLoop)
164 void insertInstructionTo(const Instruction *Inst, const BasicBlock *BB);
169 void removeInstruction(const Instruction *Inst);
207 /// Start Instruction | Visit Set
258 /// Start Instruction | Visit Set
275 typedef const Instruction *value_typ
[all...]
H A DInstructionPrecedenceTracking.h28 class Instruction; variable
34 DenseMap<const BasicBlock *, const Instruction *> FirstSpecialInsts;
54 const Instruction *getFirstSpecialInstruction(const BasicBlock *BB);
62 bool isPreceededBySpecialInstruction(const Instruction *Insn);
69 virtual bool isSpecialInstruction(const Instruction *Insn) const = 0;
77 void insertInstructionTo(const Instruction *Inst, const BasicBlock *BB);
81 void removeInstruction(const Instruction *Inst);
86 void removeUsersOf(const Instruction *Inst);
103 const Instruction *getFirstICFI(const BasicBlock *BB) { in getFirstICFI()
114 bool isDominatedByICFIFromSameBlock(const Instruction *Insn) { in isDominatedByICFIFromSameBlock()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DInstructionWorklist.h26 SmallVector<Instruction *, 256> Worklist;
27 DenseMap<Instruction *, unsigned> WorklistMap;
31 SmallSetVector<Instruction *, 16> Deferred;
44 void add(Instruction *I) { in add()
52 if (Instruction *I = dyn_cast<Instruction>(V)) in addValue()
58 void push(Instruction *I) { in push()
69 if (Instruction *I = dyn_cast<Instruction>(V)) in pushValue()
73 Instruction *popDeferred() { in popDeferred()
85 void remove(Instruction *I) { in remove()
86 DenseMap<Instruction *, unsigned>::iterator It = WorklistMap.find(I); in remove()
[all …]
H A DScalarEvolutionExpander.h51 PoisonFlags(const Instruction *I);
52 void apply(Instruction *I);
74 DenseMap<std::pair<const SCEV *, Instruction *>, TrackingVH<Value>>
88 DenseMap<PoisoningVH<Instruction>, PoisonFlags> OrigFlags;
108 Instruction *IVIncInsertPos;
185 [this](Instruction *I) { rememberInstruction(I); })) {
217 SmallVector<Instruction *, 32> getAllInsertedInstructions() const {
218 SmallVector<Instruction *, 32> Result;
223 if (auto *Inst = dyn_cast<Instruction>(V))
230 if (auto *Inst = dyn_cast<Instruction>(V))
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/InstCombine/
H A DInstCombiner.h140 if (isa<Instruction>(V)) { in getComplexity()
248 bool canFreelyInvertAllUsersOf(Instruction *V, Value *IgnoredUser) { in canFreelyInvertAllUsersOf()
254 auto *I = cast<Instruction>(U.getUser()); in canFreelyInvertAllUsersOf()
256 case Instruction::Select: in canFreelyInvertAllUsersOf()
262 case Instruction::Br: in canFreelyInvertAllUsersOf()
265 case Instruction::Xor: // Can invert 'xor' if it's a 'not', by ignoring in canFreelyInvertAllUsersOf()
295 case Instruction::SRem: // X % 1 = 0 in getSafeVectorConstantForBinop()
296 case Instruction::URem: // X %u 1 = 0 in getSafeVectorConstantForBinop()
299 case Instruction::FRem: // X % 1.0 (doesn't simplify, but it is safe) in getSafeVectorConstantForBinop()
308 case Instruction::Shl: // 0 << X = 0 in getSafeVectorConstantForBinop()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DIVDescriptors.cpp32 bool RecurrenceDescriptor::areAllUsesIn(Instruction *I, in areAllUsesIn()
33 SmallPtrSetImpl<Instruction *> &Set) { in areAllUsesIn()
35 if (!Set.count(dyn_cast<Instruction>(Use))) in areAllUsesIn()
68 static Instruction *lookThroughAnd(PHINode *Phi, Type *&RT, in lookThroughAnd()
69 SmallPtrSetImpl<Instruction *> &Visited, in lookThroughAnd()
70 SmallPtrSetImpl<Instruction *> &CI) { in lookThroughAnd()
75 Instruction *I, *J = cast<Instruction>(Phi->use_begin()->getUser()); in lookThroughAnd()
93 static std::pair<Type *, bool> computeRecurrenceType(Instruction *Exit, in computeRecurrenceType()
139 static void collectCastInstrs(Loop *TheLoop, Instruction *Exit, in collectCastInstrs()
141 SmallPtrSetImpl<Instruction *> &Casts, in collectCastInstrs()
[all …]
H A DObjCARCInstKind.cpp214 if (const Instruction *I = dyn_cast<Instruction>(V)) { in GetARCInstKind()
222 case Instruction::Call: { in GetARCInstKind()
239 case Instruction::Invoke: in GetARCInstKind()
242 case Instruction::BitCast: in GetARCInstKind()
243 case Instruction::GetElementPtr: in GetARCInstKind()
244 case Instruction::Select: in GetARCInstKind()
245 case Instruction::PHI: in GetARCInstKind()
246 case Instruction::Ret: in GetARCInstKind()
247 case Instruction::Br: in GetARCInstKind()
248 case Instruction::Switch: in GetARCInstKind()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DComplexDeinterleavingPass.cpp232 SmallPtrSet<Instruction *, 16> FinalInstructions;
235 std::map<Instruction *, NodePtr> RootToNode;
238 SmallVector<Instruction *, 1> OrderedRoots;
262 MapVector<Instruction *, std::pair<PHINode *, Instruction *>> ReductionInfo;
313 NodePtr identifyPartialMul(Instruction *Real, Instruction *Imag);
319 identifyNodeWithImplicitAdd(Instruction *I, Instruction *J,
329 NodePtr identifyAdd(Instruction *Real, Instruction *Imag);
330 NodePtr identifySymmetricOperation(Instruction *Real, Instruction *Imag);
367 NodePtr identifyReassocNodes(Instruction *I, Instruction *J);
369 NodePtr identifyRoot(Instruction *I);
[all …]
H A DTypePromotion.cpp109 SetVector<Instruction *> &Sinks;
110 SmallPtrSetImpl<Instruction *> &SafeWrap;
111 SmallPtrSetImpl<Instruction *> &InstsToRemove;
126 SetVector<Value *> &sources, SetVector<Instruction *> &sinks, in IRPromoter()
127 SmallPtrSetImpl<Instruction *> &wrap, in IRPromoter()
128 SmallPtrSetImpl<Instruction *> &instsToRemove) in IRPromoter()
143 SmallPtrSet<Instruction *, 8> SafeToPromote;
144 SmallPtrSet<Instruction *, 4> SafeWrap;
145 SmallPtrSet<Instruction *, 4> InstsToRemove;
164 bool isSafeWrap(Instruction *I);
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonVectorLoopCarriedReuse.cpp25 #include "llvm/IR/Instruction.h"
71 using ChainOfDependences = SmallVector<Instruction *, 4>;
100 void push_back(Instruction *I) { in push_back()
108 Instruction *front() const { in front()
112 Instruction *back() const { in back()
116 Instruction *&operator[](const int index) { in operator []()
136 Instruction *Inst2Replace = nullptr;
141 Instruction *BackedgeInst = nullptr;
142 std::map<Instruction *, DepChain *> DepChains;
159 OS << "Instruction t in operator <<()
[all...]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DSimplifyIndVar.cpp83 void pushIVUsers(Instruction *Def,
84 SmallPtrSet<Instruction *, 16> &Simplified,
85 SmallVectorImpl<std::pair<Instruction *, Instruction *>>
88 Value *foldIVUser(Instruction *UseInst, Instruction *IVOperand);
90 bool eliminateIdentitySCEV(Instruction *UseInst, Instruction *IVOperand);
91 bool replaceIVUserWithLoopInvariant(Instruction *UseInst);
92 bool replaceFloatIVWithIntegerIV(Instruction *UseInst);
97 bool eliminateIVUser(Instruction *UseInst, Instruction *IVOperand);
98 bool makeIVComparisonInvariant(ICmpInst *ICmp, Instruction *IVOperand);
99 void eliminateIVComparison(ICmpInst *ICmp, Instruction *IVOperand);
[all …]

12345678910>>...46