Home
last modified time | relevance | path

Searched defs:I (Results 1 – 25 of 1989) sorted by relevance

12345678910>>...80

/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DInstVisitor.h111 RetTy visit(Instruction *I) { return visit(*I); } in visit()
115 RetTy visit(Instruction &I) { in visit()
226 RetTy visitReturnInst(ReturnInst &I) { in visitReturnInst()
229 RetTy visitBranchInst(BranchInst &I) { in visitBranchInst()
232 RetTy visitSwitchInst(SwitchInst &I) { in visitSwitchInst()
235 RetTy visitIndirectBrInst(IndirectBrInst &I) { in visitIndirectBrInst()
238 RetTy visitResumeInst(ResumeInst &I) { in visitResumeInst()
241 RetTy visitUnreachableInst(UnreachableInst &I) { in visitUnreachableInst()
267 RetTy visitCallBase(CallBase &I) { in visitCallBase()
284 RetTy delegateCallInst(CallInst &I) { in delegateCallInst()
[all …]
H A DIntrinsicInst.h129 static bool classof(const CallInst *I) { in classof()
155 static bool classof(const IntrinsicInst *I) { in classof()
182 static bool classof(const IntrinsicInst *I) { in classof()
414 static bool classof(const IntrinsicInst *I) { in classof()
446 static bool classof(const IntrinsicInst *I) { in classof()
469 static bool classof(const IntrinsicInst *I) { in classof()
521 static bool classof(const IntrinsicInst *I) { in classof()
541 static bool classof(const IntrinsicInst *I) { in classof()
599 static bool classof(const IntrinsicInst *I) { in classof()
646 static bool classof(const IntrinsicInst *I) { in classof()
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/orc/tests/unit/
H A Dc_api_test.cpp36 for (size_t I = 0; I != SmallAllocSize; ++I) in TEST() local
42 for (size_t I = 0; I != SmallAllocSize; ++I) in TEST() local
66 for (size_t I = 0; I != LargeAllocSize; ++I) in TEST() local
73 for (size_t I = 0; I != LargeAllocSize; ++I) in TEST() local
95 for (size_t I = 0; I != SmallAllocSize; ++I) in TEST() local
104 for (size_t I = 0; I != SmallAllocSize; ++I) in TEST() local
116 for (size_t I = 0; I != LargeAllocSize; ++I) in TEST() local
125 for (size_t I = 0; I != LargeAllocSize; ++I) in TEST() local
137 for (size_t I = 0; I != SmallAllocSize - 1; ++I) in TEST() local
147 for (size_t I = 0; I != SmallAllocSize - 1; ++I) in TEST() local
[all …]
/freebsd/sys/contrib/ck/include/gcc/x86/
H A Dck_pr.h61 #define CK_PR_FENCE(T, I) \ argument
70 #define CK_PR_FENCE(T, I) \ argument
111 #define CK_PR_FAS(S, M, T, C, I) \ argument
137 #define CK_PR_LOAD(S, M, T, C, I) \ argument
163 #define CK_PR_STORE(S, M, T, C, I) \ argument
191 #define CK_PR_FAA(S, M, T, C, I) \ argument
220 #define CK_PR_UNARY(K, S, T, C, I) \ argument
224 #define CK_PR_UNARY_R(K, S, T, C, I) \ argument
235 #define CK_PR_UNARY_V(K, S, T, C, I) \ argument
313 #define CK_PR_CAS(S, M, T, C, I) \ argument
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DInstructionWorklist.h44 void add(Instruction *I) { in add()
52 if (Instruction *I = dyn_cast<Instruction>(V)) in addValue() local
58 void push(Instruction *I) { in push()
69 if (Instruction *I = dyn_cast<Instruction>(V)) in pushValue() local
85 void remove(Instruction *I) { in remove()
99 Instruction *I = Worklist.pop_back_val(); in removeOne() local
106 void pushUsersToWorkList(Instruction &I) { in pushUsersToWorkList()
113 if (auto *I = dyn_cast<Instruction>(V)) { in handleUseCountDecrement() local
/freebsd/contrib/llvm-project/compiler-rt/lib/scudo/standalone/
H A Dstats.h34 for (uptr I = 0; I < StatCount; I++) in init() local
38 void add(StatType I, uptr V) { in add()
43 void sub(StatType I, uptr V) { in sub()
48 void set(StatType I, uptr V) { atomic_store_relaxed(&StatsArray[I], V); } in set()
50 uptr get(StatType I) const { return atomic_load_relaxed(&StatsArray[I]); } in get()
72 for (uptr I = 0; I < StatCount; I++) in unlink() local
78 for (uptr I = 0; I < StatCount; I++) in get() local
81 for (uptr I = 0; I < StatCount; I++) in get() local
85 for (uptr I = 0; I < StatCount; I++) in get() local
H A Dtsd_shared.h32 for (u32 I = 0; I < TSDsArraySize; I++) in init() local
48 for (u32 I = 0; I < TSDsArraySize; I++) { in unmapTestOnly() local
59 for (uptr I = 0; I < NumberOfTSDs; ++I) { in drainCaches() local
95 for (u32 I = 0; I < TSDsArraySize; I++) in disable() local
100 for (s32 I = static_cast<s32>(TSDsArraySize - 1); I >= 0; I--) in enable() local
121 for (uptr I = 0; I < NumberOfTSDs; ++I) { in getStats() local
166 for (u32 I = 0; I < N; I++) { in setNumberOfTSDs() local
214 for (u32 I = 0; I < Min(4U, N); I++) { in getTSDAndLockSlow() local
/freebsd/contrib/llvm-project/llvm/lib/Target/SPIRV/
H A DSPIRVEmitIntrinsics.cpp115 static bool isMemInstrToReplace(Instruction *I) { in isMemInstrToReplace()
132 static bool requireAssignPtrType(Instruction *I) { in requireAssignPtrType()
139 static bool requireAssignType(Instruction *I) { in requireAssignType()
172 for (auto &I : instructions(F)) in preprocessUndefs() local
176 Instruction *I = Worklist.front(); in preprocessUndefs() local
195 for (auto &I : instructions(F)) in preprocessCompositeConstants() local
199 auto *I = Worklist.front(); in preprocessCompositeConstants() local
623 for (auto &I : instructions(Func)) { in runOnFunction() local
639 for (auto &I : instructions(Func)) in runOnFunction() local
642 for (auto &I : Worklist) { in runOnFunction() local
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DBitset.h48 for (auto I : Init) in Bitset() local
57 constexpr Bitset &set(unsigned I) { in set()
62 constexpr Bitset &reset(unsigned I) { in reset()
67 constexpr Bitset &flip(unsigned I) { in flip()
77 constexpr bool test(unsigned I) const { return (*this)[I]; } in test()
93 for (unsigned I = 0, E = Bits.size(); I != E; ++I) { variable
105 for (unsigned I = 0, E = Bits.size(); I != E; ++I) variable
116 for (unsigned I = 0, E = Bits.size(); I != E; ++I) { variable
141 for (unsigned I = 0, E = size(); I != E; ++I) { variable
H A Dfallible_iterator.h84 static fallible_iterator itr(Underlying I, Error &Err) { in itr()
94 static fallible_iterator end(Underlying I) { in end()
195 fallible_iterator(Underlying I, Error *Err) in fallible_iterator()
214 Underlying I; variable
221 fallible_iterator<Underlying> make_fallible_itr(Underlying I, Error &Err) { in make_fallible_itr()
234 make_fallible_range(Underlying I, Underlying E, Error &Err) { in make_fallible_range()
/freebsd/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DFunctionSummary.h61 MapTy::iterator I = Map.find(D); in findOrInsertSummary() local
73 MapTy::iterator I = findOrInsertSummary(D); in markMayInline() local
79 MapTy::iterator I = findOrInsertSummary(D); in markShouldNotInline() local
89 MapTy::const_iterator I = Map.find(D); in mayInline() local
96 MapTy::iterator I = findOrInsertSummary(D); in markVisitedBasicBlock() local
107 MapTy::const_iterator I = Map.find(D); in getNumVisitedBasicBlocks() local
114 MapTy::const_iterator I = Map.find(D); in getNumTimesInlined() local
121 MapTy::iterator I = findOrInsertSummary(D); in bumpNumTimesInlined() local
127 MapTy::const_iterator I = Map.find(D); in getPercentBlocksReachable() local
/freebsd/contrib/llvm-project/clang/lib/Headers/
H A Dgfniintrin.h49 #define _mm_gf2p8affineinv_epi64_epi8(A, B, I) \ argument
54 #define _mm_gf2p8affine_epi64_epi8(A, B, I) \ argument
67 #define _mm256_gf2p8affineinv_epi64_epi8(A, B, I) \ argument
72 #define _mm256_gf2p8affine_epi64_epi8(A, B, I) \ argument
86 #define _mm512_gf2p8affineinv_epi64_epi8(A, B, I) \ argument
100 #define _mm512_gf2p8affine_epi64_epi8(A, B, I) \ argument
110 #define _mm512_maskz_gf2p8affine_epi64_epi8(U, A, B, I) \ argument
143 #define _mm_maskz_gf2p8affineinv_epi64_epi8(U, A, B, I) \ argument
156 #define _mm_mask_gf2p8affine_epi64_epi8(S, U, A, B, I) \ argument
161 #define _mm_maskz_gf2p8affine_epi64_epi8(U, A, B, I) \ argument
[all …]
/freebsd/sys/contrib/ck/include/gcc/x86_64/
H A Dck_pr.h71 #define CK_PR_FENCE(T, I) \ argument
140 #define CK_PR_FAS(S, M, T, C, I) \ argument
173 #define CK_PR_LOAD(S, M, T, C, I) \ argument
245 #define CK_PR_STORE_IMM(S, M, T, C, I, K) \ argument
256 #define CK_PR_STORE(S, M, T, C, I) \ argument
289 #define CK_PR_FAA(S, M, T, C, I) \ argument
319 #define CK_PR_UNARY(K, S, T, C, I) \ argument
323 #define CK_PR_UNARY_R(K, S, T, C, I) \ argument
334 #define CK_PR_UNARY_V(K, S, T, C, I) \ argument
414 #define CK_PR_CAS(S, M, T, C, I) \ argument
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/TargetParser/
H A DSubtargetFeature.h53 for (auto I : Init) in FeatureBitset() local
62 constexpr FeatureBitset &set(unsigned I) { in set()
67 constexpr FeatureBitset &reset(unsigned I) { in reset()
72 constexpr FeatureBitset &flip(unsigned I) { in flip()
82 constexpr bool test(unsigned I) const { return (*this)[I]; } in test()
98 for (unsigned I = 0, E = Bits.size(); I != E; ++I) { variable
110 for (unsigned I = 0, E = Bits.size(); I != E; ++I) variable
121 for (unsigned I = 0, E = Bits.size(); I != E; ++I) { variable
146 for (unsigned I = 0, E = size(); I != E; ++I) { variable
/freebsd/sys/contrib/ck/include/gcc/aarch64/
H A Dck_pr.h61 #define CK_PR_FENCE(T, I) \ argument
90 #define CK_PR_LOAD(S, M, T, I) \ argument
101 #define CK_PR_LOAD_64(S, M, T, I) \ argument
116 #define CK_PR_LOAD_S(S, T, I) CK_PR_LOAD(S, T, T, I) argument
117 #define CK_PR_LOAD_S_64(S, T, I) CK_PR_LOAD_64(S, T, T, I) argument
136 #define CK_PR_STORE(S, M, T, I) \ argument
147 #define CK_PR_STORE_64(S, M, T, I) \ argument
161 #define CK_PR_STORE_S(S, T, I) CK_PR_STORE(S, T, T, I) argument
162 #define CK_PR_STORE_S_64(S, T, I) CK_PR_STORE_64(S, T, T, I) argument
/freebsd/contrib/llvm-project/llvm/lib/IR/
H A DProfDataUtils.cpp72 bool hasProfMD(const Instruction &I) { in hasProfMD()
80 bool hasBranchWeightMD(const Instruction &I) { in hasBranchWeightMD()
85 bool hasValidBranchWeightMD(const Instruction &I) { in hasValidBranchWeightMD()
89 MDNode *getBranchWeightMDNode(const Instruction &I) { in getBranchWeightMDNode()
96 MDNode *getValidBranchWeightMDNode(const Instruction &I) { in getValidBranchWeightMDNode()
129 bool extractBranchWeights(const Instruction &I, in extractBranchWeights()
135 bool extractBranchWeights(const Instruction &I, uint64_t &TrueVal, in extractBranchWeights()
183 bool extractProfTotalWeight(const Instruction &I, uint64_t &TotalVal) { in extractProfTotalWeight()
187 void setBranchWeights(Instruction &I, ArrayRef<uint32_t> Weights) { in setBranchWeights()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Coroutines/
H A DCoroInstr.h61 static bool classof(const IntrinsicInst *I) { in classof()
73 static bool classof(const IntrinsicInst *I) { in classof()
100 static bool classof(const IntrinsicInst *I) { in classof()
192 static bool classof(const IntrinsicInst *I) { in classof()
238 static bool classof(const IntrinsicInst *I) { in classof()
253 static bool classof(const IntrinsicInst *I) { in classof()
266 static bool classof(const IntrinsicInst *I) { in classof()
315 static bool classof(const IntrinsicInst *I) { in classof()
336 static bool classof(const IntrinsicInst *I) { in classof()
355 static bool classof(const IntrinsicInst *I) { in classof()
[all …]
/freebsd/contrib/llvm-project/clang/utils/TableGen/
H A DClangOpcodesEmitter.cpp146 for (size_t I = 0, N = Args.size(); I < N; ++I) in EmitInterp() local
196 for (size_t I = 0, N = Args.size(); I < N; ++I) in EmitEmitter() local
202 for (size_t I = 0, N = Args.size(); I < N; ++I) { in EmitEmitter() local
208 for (size_t I = 0, N = Args.size(); I < N; ++I) in EmitEmitter() local
232 for (size_t I = 0; I < TypeCount; ++I) { in EmitProto() local
261 for (size_t I = 0, N = Types->size(); I < N; ++I) in EmitGroup() local
277 for (size_t I = 0, N = Types->size(); I < N; ++I) in EmitGroup() local
279 for (size_t I = 0, N = Args.size(); I < N; ++I) in EmitGroup() local
286 EmitFuncName](size_t I, const Twine &ID) { in EmitGroup()
303 for (size_t I = 0; I < Args.size(); ++I) { in EmitGroup() local
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DLint.cpp185 void Lint::visitCallBase(CallBase &I) { in visitCallBase()
485 void Lint::visitLoadInst(LoadInst &I) { in visitLoadInst()
490 void Lint::visitStoreInst(StoreInst &I) { in visitStoreInst()
495 void Lint::visitXor(BinaryOperator &I) { in visitXor()
500 void Lint::visitSub(BinaryOperator &I) { in visitSub()
505 void Lint::visitLShr(BinaryOperator &I) { in visitLShr()
512 void Lint::visitAShr(BinaryOperator &I) { in visitAShr()
519 void Lint::visitShl(BinaryOperator &I) { in visitShl()
563 void Lint::visitSDiv(BinaryOperator &I) { in visitSDiv()
568 void Lint::visitUDiv(BinaryOperator &I) { in visitUDiv()
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/MCTargetDesc/
H A DHexagonMCChecker.cpp56 for (auto const &I : HexagonMCInstrInfo::bundleInstructions(MCB)) { in init() local
298 for (auto const &I : HexagonMCInstrInfo::bundleInstructions(MCII, MCB)) { in checkAXOK() local
305 for (auto const &I : HexagonMCInstrInfo::bundleInstructions(MCII, MCB)) { in checkAXOK() local
348 MCInst const &I = *BranchLocations[J]; in checkCOFMax1() local
387 for (const auto &I : NewPreds) { in checkPredicates() local
400 for (const auto &I : LatePreds) { in checkPredicates() local
528 for (auto I : HexagonMCInstrInfo::bundleInstructions(MCB)) { in checkRegistersReadOnly() local
546 for (auto const &I : HexagonMCInstrInfo::bundleInstructions(MCII, MCB)) in registerUsed() local
609 for (const auto &I : Defs) { in checkRegisters() local
666 for (const auto &I : TmpDefs) { in checkRegisters() local
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DCloneModule.cpp70 for (const GlobalVariable &I : M.globals()) { in CloneModule() local
80 for (const Function &I : M) { in CloneModule() local
89 for (const GlobalAlias &I : M.aliases()) { in CloneModule() local
118 for (const GlobalIFunc &I : M.ifuncs()) { in CloneModule() local
155 for (const Function &I : M) { in CloneModule() local
193 for (const GlobalAlias &I : M.aliases()) { in CloneModule() local
202 for (const GlobalIFunc &I : M.ifuncs()) { in CloneModule() local
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DSelectionDAGBuilder.h535 void visitFNeg(const User &I) { visitUnary(I, ISD::FNEG); } in visitFNeg()
539 void visitAdd(const User &I) { visitBinary(I, ISD::ADD); } in visitAdd()
541 void visitSub(const User &I) { visitBinary(I, ISD::SUB); } in visitSub()
543 void visitMul(const User &I) { visitBinary(I, ISD::MUL); } in visitMul()
551 void visitAnd (const User &I) { visitBinary(I, ISD::AND); } in visitAnd()
552 void visitOr (const User &I) { visitBinary(I, ISD::OR); } in visitOr()
554 void visitShl (const User &I) { visitShift(I, ISD::SHL); } in visitShl()
555 void visitLShr(const User &I) { visitShift(I, ISD::SRL); } in visitLShr()
556 void visitAShr(const User &I) { visitShift(I, ISD::SRA); } in visitAShr()
654 void visitUserOp1(const Instruction &I) { in visitUserOp1()
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/AST/
H A DUnresolvedSet.h103 for (DeclsTy::iterator I = decls().begin(), E = decls().end(); I != E; ++I) in replace() local
111 void replace(iterator I, NamedDecl *New) { I.I->setDecl(New); } in replace()
113 void replace(iterator I, NamedDecl *New, AccessSpecifier AS) { in replace()
117 void erase(unsigned I) { in erase()
123 void erase(iterator I) { in erase()
129 void setAccess(iterator I, AccessSpecifier AS) { I.I->setAccess(AS); } in setAccess()
137 void append(iterator I, iterator E) { decls().append(I.I, E.I); } in append()
139 template<typename Iter> void assign(Iter I, Iter E) { decls().assign(I, E); } in assign()
/freebsd/contrib/llvm-project/llvm/lib/Target/DirectX/DXILWriter/
H A DDXILValueEnumerator.cpp144 for (const Instruction &I : BB) in orderModule() local
189 for (const Instruction &I : BB) { in orderModule() local
198 for (const Instruction &I : BB) in orderModule() local
331 for (const Instruction &I : BB) in predictUseListOrder() local
430 for (const auto &I : MDs) in ValueEnumerator() local
445 for (const auto &I : MDs) in ValueEnumerator() local
539 for (const auto &I : Map) { in print() local
565 for (const auto &I : Map) { in print() local
1036 for (const auto &I : F.args()) { in incorporateFunction() local
1049 for (const Instruction &I : BB) { in incorporateFunction() local
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Target/Mips/
H A DMipsBranchExpansion.cpp198 Iter I = Position, E = Position->getParent()->end(); in getNextMachineInstrInBB() local
298 for (unsigned I = 0, E = MBBInfos.size(); I < E; ++I) { in initMBBInfo() local
413 void MipsBranchExpansion::expandToLongBranch(MBBInfo &I) { in expandToLongBranch()
735 MachineBasicBlock::iterator I = MBB.begin(); in emitGPDisp() local
750 for (Iter I = FI->begin(); I != FI->end(); ++I) { in handleSlot() local
787 [this](auto &I) -> bool { return TII->HasForbiddenSlot(I); }, in handleForbiddenSlot()
788 [this](auto &IInSlot, auto &I) -> bool { in handleForbiddenSlot()
799 [this](auto &IInSlot, auto &I) -> bool { in handleFPUDelaySlot()
811 [this](auto &IInSlot, auto &I) -> bool { in handleLoadDelaySlot()
830 for (unsigned I = 0, E = MBBInfos.size(); I < E; ++I) { in handlePossibleLongBranch() local
[all …]

12345678910>>...80