|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
Declarations
include/llvm/Analysis/MemoryBuiltins.h 32 class Argument;
include/llvm/CodeGen/FunctionLoweringInfo.h 36 class Argument;
include/llvm/IR/SymbolTableListTraits.h 33 class Argument;
include/llvm/IR/Value.h 30 class Argument;
include/llvm/IR/ValueSymbolTable.h 23 class Argument;
lib/Target/AMDGPU/AMDGPUHSAMetadataStreamer.h 27 class Argument;
lib/Target/AMDGPU/Utils/AMDGPUBaseInfo.h 28 class Argument;
lib/Target/Mips/MipsISelLowering.h 42 class Argument;
References
examples/Fibonacci/fibonacci.cpp 67 Argument *ArgX = &*FibF->arg_begin(); // Get the arg.
examples/HowToUseJIT/HowToUseJIT.cpp 89 Argument *ArgX = &*Add1F->arg_begin(); // Get the arg
examples/HowToUseLLJIT/HowToUseLLJIT.cpp 46 Argument *ArgX = &*Add1F->arg_begin(); // Get the arg
examples/Kaleidoscope/BuildingAJIT/Chapter1/toy.cpp 1046 for (auto &Arg : F->args())
1071 for (auto &Arg : TheFunction->args()) {
examples/Kaleidoscope/BuildingAJIT/Chapter2/toy.cpp 1046 for (auto &Arg : F->args())
1071 for (auto &Arg : TheFunction->args()) {
examples/Kaleidoscope/BuildingAJIT/Chapter3/toy.cpp 1045 for (auto &Arg : F->args())
1070 for (auto &Arg : TheFunction->args()) {
examples/Kaleidoscope/BuildingAJIT/Chapter4/toy.cpp 1031 for (auto &Arg : F->args())
1063 for (auto &Arg : TheFunction->args()) {
examples/Kaleidoscope/BuildingAJIT/Chapter5/toy.cpp 1055 for (auto &Arg : F->args())
1087 for (auto &Arg : TheFunction->args()) {
examples/Kaleidoscope/Chapter3/toy.cpp 477 for (auto &Arg : F->args())
499 for (auto &Arg : TheFunction->args())
examples/Kaleidoscope/Chapter4/toy.cpp 505 for (auto &Arg : F->args())
526 for (auto &Arg : TheFunction->args())
examples/Kaleidoscope/Chapter5/toy.cpp 779 for (auto &Arg : F->args())
800 for (auto &Arg : TheFunction->args())
examples/Kaleidoscope/Chapter6/toy.cpp 891 for (auto &Arg : F->args())
916 for (auto &Arg : TheFunction->args())
examples/Kaleidoscope/Chapter7/toy.cpp 1051 for (auto &Arg : F->args())
1076 for (auto &Arg : TheFunction->args()) {
examples/Kaleidoscope/Chapter8/toy.cpp 1050 for (auto &Arg : F->args())
1075 for (auto &Arg : TheFunction->args()) {
examples/Kaleidoscope/Chapter9/toy.cpp 1217 for (auto &Arg : F->args())
1263 for (auto &Arg : TheFunction->args()) {
examples/ParallelJIT/ParallelJIT.cpp 67 Argument *ArgX = &*Add1F->arg_begin(); // Get the arg
97 Argument *ArgX = &*FibF->arg_begin(); // Get the arg.
include/llvm/ADT/ArrayRef.h 43 using iterator = const T *;
44 using const_iterator = const T *;
50 const T *Data = nullptr;
66 /*implicit*/ ArrayRef(const T &OneElt)
70 /*implicit*/ ArrayRef(const T *data, size_t length)
74 ArrayRef(const T *begin, const T *end)
74 ArrayRef(const T *begin, const T *end)
81 /*implicit*/ ArrayRef(const SmallVectorTemplateCommon<T, U> &Vec)
87 /*implicit*/ ArrayRef(const std::vector<T, A> &Vec)
92 /*implicit*/ constexpr ArrayRef(const std::array<T, N> &Arr)
97 /*implicit*/ constexpr ArrayRef(const T (&Arr)[N]) : Data(Arr), Length(N) {}
100 /*implicit*/ ArrayRef(const std::initializer_list<T> &Vec)
108 const ArrayRef<U *> &A,
110 std::is_convertible<U *const *, T const *>::value>::type * = nullptr)
118 const SmallVectorTemplateCommon<U *, DummyT> &Vec,
120 std::is_convertible<U *const *, T const *>::value>::type * = nullptr)
145 const T *data() const { return Data; }
151 const T &front() const {
157 const T &back() const {
163 template <typename Allocator> ArrayRef<T> copy(Allocator &A) {
178 ArrayRef<T> slice(size_t N, size_t M) const {
184 ArrayRef<T> slice(size_t N) const { return slice(N, size() - N); }
187 ArrayRef<T> drop_front(size_t N = 1) const {
193 ArrayRef<T> drop_back(size_t N = 1) const {
200 template <class PredicateT> ArrayRef<T> drop_while(PredicateT Pred) const {
206 template <class PredicateT> ArrayRef<T> drop_until(PredicateT Pred) const {
211 ArrayRef<T> take_front(size_t N = 1) const {
218 ArrayRef<T> take_back(size_t N = 1) const {
226 template <class PredicateT> ArrayRef<T> take_while(PredicateT Pred) const {
232 template <class PredicateT> ArrayRef<T> take_until(PredicateT Pred) const {
239 const T &operator[](size_t Index) const {
249 typename std::enable_if<std::is_same<U, T>::value, ArrayRef<T>>::type &
257 typename std::enable_if<std::is_same<U, T>::value, ArrayRef<T>>::type &
263 std::vector<T> vec() const {
270 operator std::vector<T>() const {
290 class LLVM_NODISCARD MutableArrayRef : public ArrayRef<T> {
292 using iterator = T *;
302 /*implicit*/ MutableArrayRef(T &OneElt) : ArrayRef<T>(OneElt) {}
305 /*implicit*/ MutableArrayRef(T *data, size_t length)
309 MutableArrayRef(T *begin, T *end) : ArrayRef<T>(begin, end) {}
309 MutableArrayRef(T *begin, T *end) : ArrayRef<T>(begin, end) {}
312 /*implicit*/ MutableArrayRef(SmallVectorImpl<T> &Vec)
316 /*implicit*/ MutableArrayRef(std::vector<T> &Vec)
321 /*implicit*/ constexpr MutableArrayRef(std::array<T, N> &Arr)
326 /*implicit*/ constexpr MutableArrayRef(T (&Arr)[N]) : ArrayRef<T>(Arr) {}
328 T *data() const { return const_cast<T*>(ArrayRef<T>::data()); }
337 T &front() const {
343 T &back() const {
350 MutableArrayRef<T> slice(size_t N, size_t M) const {
356 MutableArrayRef<T> slice(size_t N) const {
361 MutableArrayRef<T> drop_front(size_t N = 1) const {
366 MutableArrayRef<T> drop_back(size_t N = 1) const {
374 MutableArrayRef<T> drop_while(PredicateT Pred) const {
381 MutableArrayRef<T> drop_until(PredicateT Pred) const {
386 MutableArrayRef<T> take_front(size_t N = 1) const {
393 MutableArrayRef<T> take_back(size_t N = 1) const {
402 MutableArrayRef<T> take_while(PredicateT Pred) const {
409 MutableArrayRef<T> take_until(PredicateT Pred) const {
416 T &operator[](size_t Index) const {
include/llvm/Analysis/CFLAliasAnalysisUtils.h 50 if (auto *Arg = dyn_cast<Argument>(Val))
include/llvm/Analysis/MemoryBuiltins.h 261 SizeOffsetType visitArgument(Argument &A);
include/llvm/Analysis/ObjCARCAnalysisUtils.h 158 if (const Argument *Arg = dyn_cast<Argument>(Op))
158 if (const Argument *Arg = dyn_cast<Argument>(Op))
217 isa<Argument>(V) || isa<Constant>(V) ||
include/llvm/Analysis/TargetTransformInfo.h 1067 SmallPtrSetImpl<Argument *> &Args) const;
1354 SmallPtrSetImpl<Argument *> &Args) const = 0;
1798 SmallPtrSetImpl<Argument *> &Args) const override {
include/llvm/Analysis/TargetTransformInfoImpl.h 543 SmallPtrSetImpl<Argument *> &Args) const {
include/llvm/CodeGen/FunctionLoweringInfo.h 131 DenseMap<const Argument*, int> ByValArgFrameIndexMap;
274 void setArgumentFrameIndex(const Argument *A, int FI);
277 int getArgumentFrameIndex(const Argument *A);
include/llvm/IR/CallSite.h 820 int getCallArgOperandNo(Argument &Arg) const {
834 Value *getCallArgOperand(Argument &Arg) const {
include/llvm/IR/Function.h 67 using arg_iterator = Argument *;
68 using const_arg_iterator = const Argument *;
73 mutable Argument *Arguments = nullptr; ///< The formal arguments
718 Argument* getArg(unsigned i) const {
include/llvm/Support/Casting.h 58 return To::classof(&Val);
77 return isa_impl<To, From>::doit(Val);
92 return isa_impl<To, From>::doit(*Val);
106 return isa_impl<To, From>::doit(*Val);
122 return isa_impl_wrap<To, SimpleFrom,
132 return isa_impl_cl<To,FromTy>::doit(Val);
142 return isa_impl_wrap<X, const Y,
165 using ret_type = To &; // Normal case, return Ty&
168 using ret_type = const To &; // Normal case, return Ty&
172 using ret_type = To *; // Pointer arg case, return Ty*
176 using ret_type = const To *; // Constant pointer arg case, return const Ty*
198 using ret_type = typename cast_retty<To, SimpleFrom>::ret_type;
204 using ret_type = typename cast_retty_impl<To,FromTy>::ret_type;
210 To, From, typename simplify_type<From>::SimpleType>::ret_type;
218 static typename cast_retty<To, From>::ret_type doit(From &Val) {
219 return cast_convert_val<To, SimpleFrom,
227 static typename cast_retty<To, FromTy>::ret_type doit(const FromTy &Val) {
228 typename cast_retty<To, FromTy>::ret_type Res2
248 typename cast_retty<X, const Y>::ret_type>::type
256 inline typename cast_retty<X, Y>::ret_type cast(Y &Val) {
258 return cast_convert_val<X, Y,
263 inline typename cast_retty<X, Y *>::ret_type cast(Y *Val) {
265 return cast_convert_val<X, Y*,
331 typename cast_retty<X, const Y>::ret_type>::type
337 LLVM_NODISCARD inline typename cast_retty<X, Y>::ret_type dyn_cast(Y &Val) {
338 return isa<X>(Val) ? cast<X>(Val) : nullptr;
338 return isa<X>(Val) ? cast<X>(Val) : nullptr;
342 LLVM_NODISCARD inline typename cast_retty<X, Y *>::ret_type dyn_cast(Y *Val) {
343 return isa<X>(Val) ? cast<X>(Val) : nullptr;
343 return isa<X>(Val) ? cast<X>(Val) : nullptr;
366 LLVM_NODISCARD inline typename cast_retty<X, Y *>::ret_type
368 return (Val && isa<X>(Val)) ? cast<X>(Val) : nullptr;
368 return (Val && isa<X>(Val)) ? cast<X>(Val) : nullptr;
include/llvm/Support/PointerLikeTypeTraits.h 56 static inline void *getAsVoidPointer(T *P) { return P; }
57 static inline T *getFromVoidPointer(void *P) { return static_cast<T *>(P); }
59 enum { NumLowBitsAvailable = detail::ConstantLog2<alignof(T)>::value };
91 typedef PointerLikeTypeTraits<T *> NonConst;
93 static inline const void *getAsVoidPointer(const T *P) {
96 static inline const T *getFromVoidPointer(const void *P) {
include/llvm/Transforms/IPO/Attributor.h 166 if (auto *Arg = dyn_cast<Argument>(&V))
184 static const IRPosition argument(const Argument &Arg) {
278 if (isa<Argument>(V))
279 return cast<Argument>(V).getParent();
292 Argument *getAssociatedArgument() {
293 if (auto *Arg = dyn_cast<Argument>(&getAnchorValue()))
293 if (auto *Arg = dyn_cast<Argument>(&getAnchorValue()))
303 const Argument *getAssociatedArgument() const {
328 if (isa<Argument>(V))
329 return cast<Argument>(V).getParent();
346 if (auto *Arg = dyn_cast<Argument>(&V))
346 if (auto *Arg = dyn_cast<Argument>(&V))
365 if (getArgNo() < 0 || isa<Argument>(AnchorVal))
lib/Analysis/AliasAnalysis.cpp 875 if (const Argument *A = dyn_cast<Argument>(V))
875 if (const Argument *A = dyn_cast<Argument>(V))
887 if (const Argument *A = dyn_cast<Argument>(V))
887 if (const Argument *A = dyn_cast<Argument>(V))
lib/Analysis/AliasAnalysisEvaluator.cpp 103 for (auto &I : F.args())
lib/Analysis/AliasAnalysisSummary.cpp 55 if (auto *Arg = dyn_cast<Argument>(&Val))
lib/Analysis/AssumptionCache.cpp 62 if (isa<Argument>(V)) {
72 if (isa<Instruction>(Op) || isa<Argument>(Op))
159 if (!isa<Instruction>(NV) && !isa<Argument>(NV))
lib/Analysis/BasicAliasAnalysis.cpp 147 if (const Argument *A = dyn_cast<Argument>(V))
147 if (const Argument *A = dyn_cast<Argument>(V))
167 if (isa<Argument>(V))
824 if (const Argument *arg = dyn_cast<Argument>(V))
824 if (const Argument *arg = dyn_cast<Argument>(V))
1791 if ((isa<Argument>(O1) && isIdentifiedFunctionLocal(O2)) ||
1792 (isa<Argument>(O2) && isIdentifiedFunctionLocal(O1)))
lib/Analysis/CFLAndersAliasAnalysis.cpp 359 if (auto Arg = dyn_cast<Argument>(Val))
409 for (const auto &Arg : Fn.args()) {
lib/Analysis/CFLGraph.h 610 void addArgumentToGraph(Argument &Arg) {
641 for (auto &Arg : Fn.args())
lib/Analysis/CFLSteensAliasAnalysis.cpp 173 for (auto &Param : Fn.args()) {
lib/Analysis/DemandedBits.cpp 380 if (!I && !isa<Argument>(OI))
lib/Analysis/DivergenceAnalysis.cpp 445 for (auto &Arg : F.args()) {
lib/Analysis/GlobalsModRef.cpp 638 if (isa<GlobalValue>(Input) || isa<Argument>(Input) || isa<CallInst>(Input) ||
751 if (isa<Argument>(Input) || isa<CallInst>(Input) ||
lib/Analysis/InlineCost.cpp 220 bool paramHasAttr(Argument *A, Attribute::AttrKind Attr);
757 bool CallAnalyzer::paramHasAttr(Argument *A, Attribute::AttrKind Attr) {
767 if (Argument *A = dyn_cast<Argument>(V))
767 if (Argument *A = dyn_cast<Argument>(V))
lib/Analysis/InstructionSimplify.cpp 2454 if (const Argument *A = dyn_cast<Argument>(V))
2454 if (const Argument *A = dyn_cast<Argument>(V))
lib/Analysis/LegacyDivergenceAnalysis.cpp 136 for (auto &Arg : F.args()) {
375 if (const Argument *Arg = dyn_cast<Argument>(FirstDivergentValue)) {
375 if (const Argument *Arg = dyn_cast<Argument>(FirstDivergentValue)) {
lib/Analysis/Lint.cpp 258 Argument *Formal = &*PI++;
lib/Analysis/MemoryBuiltins.cpp 593 if (Argument *A = dyn_cast<Argument>(V))
593 if (Argument *A = dyn_cast<Argument>(V))
653 SizeOffsetType ObjectSizeOffsetVisitor::visitArgument(Argument &A) {
897 } else if (isa<Argument>(V) ||
lib/Analysis/ScalarEvolution.cpp 593 if (const auto *LA = dyn_cast<Argument>(LV)) {
593 if (const auto *LA = dyn_cast<Argument>(LV)) {
594 const auto *RA = cast<Argument>(RV);
594 const auto *RA = cast<Argument>(RV);
5208 if (isa<Argument>(V))
lib/Analysis/ScalarEvolutionExpander.cpp 150 if (Argument *A = dyn_cast<Argument>(V)) {
150 if (Argument *A = dyn_cast<Argument>(V)) {
153 isa<Argument>(cast<BitCastInst>(IP)->getOperand(0)) &&
lib/Analysis/StackSafetyAnalysis.cpp 115 const Argument *Arg = nullptr;
118 explicit ParamInfo(unsigned PointerSize, const Argument *Arg)
382 for (const Argument &A : make_range(F.arg_begin(), F.arg_end())) {
lib/Analysis/TargetTransformInfo.cpp 578 if (Splat && (isa<Argument>(Splat) || isa<GlobalValue>(Splat)))
780 SmallPtrSetImpl<Argument *> &Args) const {
lib/Analysis/ValueTracking.cpp 1922 for (const Argument &Arg : CalledFunc->args())
2064 if (const Argument *A = dyn_cast<Argument>(V))
2064 if (const Argument *A = dyn_cast<Argument>(V))
lib/AsmParser/LLParser.cpp 2834 for (Argument &A : F.args())
2902 FwdVal = new Argument(Ty, Name);
2936 FwdVal = new Argument(Ty);
lib/Bitcode/Reader/BitcodeReader.cpp 3709 for (Argument &I : F->args()) {
5167 if (Argument *A = dyn_cast<Argument>(ValueList.back())) {
5167 if (Argument *A = dyn_cast<Argument>(ValueList.back())) {
5171 if ((A = dyn_cast_or_null<Argument>(ValueList[i])) && !A->getParent()) {
lib/Bitcode/Reader/MetadataLoader.cpp 538 dyn_cast_or_null<Argument>(DDI->getAddress())) {
lib/Bitcode/Reader/ValueList.cpp 142 Value *V = new Argument(Ty);
lib/Bitcode/Writer/ValueEnumerator.cpp 155 for (const Argument &A : F.args())
279 for (const Argument &A : F.args())
392 for (const Argument &A : F.args())
952 for (const auto &I : F.args()) {
lib/CodeGen/CodeGenPrepare.cpp 4183 if (isa<Argument>(Base) || isa<GlobalValue>(Base) ||
4505 if (!isa<Instruction>(Val) && !isa<Argument>(Val)) return true;
6250 if (auto *Arg = dyn_cast<Argument>(Cond))
6250 if (auto *Arg = dyn_cast<Argument>(Cond))
lib/CodeGen/GlobalISel/IRTranslator.cpp 852 if (auto Arg = dyn_cast<Argument>(V))
2298 for (const Argument &Arg: F.args()) {
lib/CodeGen/MIRParser/MIParser.cpp 3010 for (const auto &Arg : F.args())
lib/CodeGen/SafeStack.cpp 157 SmallVectorImpl<Argument *> &ByValArguments,
173 ArrayRef<Argument *> ByValArguments,
380 SmallVectorImpl<Argument *> &ByValArguments,
413 for (Argument &Arg : F.args()) {
488 ArrayRef<Argument *> ByValArguments, ArrayRef<ReturnInst *> Returns,
509 for (Argument *Arg : ByValArguments) {
563 for (Argument *Arg : ByValArguments) {
746 SmallVector<Argument *, 4> ByValArguments;
lib/CodeGen/SelectionDAG/FastISel.cpp 1361 const auto *Arg =
1362 dyn_cast<Argument>(Address->stripInBoundsConstantOffsets());
lib/CodeGen/SelectionDAG/FunctionLoweringInfo.cpp 502 void FunctionLoweringInfo::setArgumentFrameIndex(const Argument *A,
510 int FunctionLoweringInfo::getArgumentFrameIndex(const Argument *A) {
lib/CodeGen/SelectionDAG/SelectionDAGBuilder.cpp 1298 if (!N.getNode() && isa<Argument>(V)) // Check unused arguments map.
1312 bool IsParamOfFunc = isa<Argument>(V) && Var->isParameter() &&
1948 if (!isa<Instruction>(V) && !isa<Argument>(V)) return;
1972 if (isa<Argument>(V)) {
4008 if (const Argument *Arg = dyn_cast<Argument>(SV)) {
4008 if (const Argument *Arg = dyn_cast<Argument>(SV)) {
4195 if (const Argument *Arg = dyn_cast<Argument>(PtrV)) {
4195 if (const Argument *Arg = dyn_cast<Argument>(PtrV)) {
5424 const Argument *Arg = dyn_cast<Argument>(V);
5424 const Argument *Arg = dyn_cast<Argument>(V);
5816 (Address->use_empty() && !isa<Argument>(Address))) {
5821 bool isParameter = Variable->isParameter() || isa<Argument>(Address);
5833 } else if (const auto *Arg = dyn_cast<Argument>(
5833 } else if (const auto *Arg = dyn_cast<Argument>(
5851 if (!N.getNode() && isa<Argument>(Address))
5865 } else if (isa<Argument>(Address)) {
9397 static bool isOnlyUsedInEntryBlock(const Argument *A, bool FastISel) {
9412 DenseMap<const Argument *,
9483 const auto *Arg = dyn_cast<Argument>(Val);
9483 const auto *Arg = dyn_cast<Argument>(Val);
9514 ArgCopyElisionMapTy &ArgCopyElisionCandidates, const Argument &Arg,
9611 for (const Argument &Arg : F.args()) {
9780 for (const Argument &Arg : F.args()) {
lib/CodeGen/SelectionDAG/SelectionDAGISel.cpp 1321 } else if (const auto *Arg = dyn_cast<Argument>(Address))
1321 } else if (const auto *Arg = dyn_cast<Argument>(Address))
lib/CodeGen/SelectionDAG/StatepointLowering.cpp 554 if (const Argument *Arg = dyn_cast<Argument>(V)) {
554 if (const Argument *Arg = dyn_cast<Argument>(V)) {
lib/CodeGen/SjLjEHPrepare.cpp 235 for (auto &AI : F.args()) {
lib/ExecutionEngine/Orc/IndirectionUtils.cpp 245 for (auto &A : F.args())
lib/IR/AsmWriter.cpp 165 for (const Argument &A : F.args())
283 for (const Argument &A : F.args())
319 if (const Argument *MA = dyn_cast<Argument>(V))
319 if (const Argument *MA = dyn_cast<Argument>(V))
865 if (const Argument *FA = dyn_cast<Argument>(V))
865 if (const Argument *FA = dyn_cast<Argument>(V))
2406 void printArgument(const Argument *FA, AttributeSet Attrs);
3469 for (const Argument &Arg : F->args()) {
3546 void AssemblyWriter::printArgument(const Argument *Arg, AttributeSet Attrs) {
4325 } else if (isa<InlineAsm>(this) || isa<Argument>(this)) {
lib/IR/Core.cpp 2456 return wrap(unwrap<Argument>(V)->getParent());
2476 Argument *A = unwrap<Argument>(Arg);
2476 Argument *A = unwrap<Argument>(Arg);
2484 Argument *A = unwrap<Argument>(Arg);
2484 Argument *A = unwrap<Argument>(Arg);
2491 Argument *A = unwrap<Argument>(Arg);
2491 Argument *A = unwrap<Argument>(Arg);
lib/IR/DiagnosticInfo.cpp 174 if (isa<llvm::Argument>(V) || isa<GlobalValue>(V))
lib/IR/Function.cpp 290 new (Arguments + i) Argument(ArgTy, "", const_cast<Function *>(this), i);
301 static MutableArrayRef<Argument> makeArgArray(Argument *Args, size_t Count) {
301 static MutableArrayRef<Argument> makeArgArray(Argument *Args, size_t Count) {
306 for (Argument &A : makeArgArray(Arguments, NumArgs)) {
334 for (Argument &A : makeArgArray(Arguments, NumArgs)) {
lib/IR/Metadata.cpp 333 if (auto *A = dyn_cast<Argument>(V)) {
333 if (auto *A = dyn_cast<Argument>(V)) {
lib/IR/SafepointIRVerifier.cpp 753 for (const Argument &A : BB->getParent()->args())
lib/IR/TypeFinder.cpp 57 for (const auto &A : FI.args())
lib/IR/Value.cpp 176 } else if (Argument *A = dyn_cast<Argument>(V)) {
176 } else if (Argument *A = dyn_cast<Argument>(V)) {
614 if (const Argument *A = dyn_cast<Argument>(this)) {
614 if (const Argument *A = dyn_cast<Argument>(this)) {
703 } else if (const Argument *A = dyn_cast<Argument>(this)) {
703 } else if (const Argument *A = dyn_cast<Argument>(this)) {
765 auto *Arg = dyn_cast<Argument>(this);
lib/IR/Verifier.cpp 845 else if (Argument *A = dyn_cast<Argument>(L->getValue()))
845 else if (Argument *A = dyn_cast<Argument>(L->getValue()))
2205 for (const Argument &Arg : F.args()) {
2887 auto ArgI = dyn_cast<Argument>(SwiftErrorArg);
4136 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
4136 } else if (Argument *OpArg = dyn_cast<Argument>(I.getOperand(i))) {
lib/Target/AArch64/AArch64FastISel.cpp 319 if (const auto *Arg = dyn_cast<Argument>(I->getOperand(0)))
319 if (const auto *Arg = dyn_cast<Argument>(I->getOperand(0)))
1990 if (const Argument *Arg = dyn_cast<Argument>(SV)) {
1990 if (const Argument *Arg = dyn_cast<Argument>(SV)) {
2192 if (const Argument *Arg = dyn_cast<Argument>(PtrV)) {
2192 if (const Argument *Arg = dyn_cast<Argument>(PtrV)) {
2969 for (auto const &Arg : F->args()) {
3023 for (auto const &Arg : F->args()) {
4600 if (const auto *Arg = dyn_cast<Argument>(I->getOperand(0))) {
4600 if (const auto *Arg = dyn_cast<Argument>(I->getOperand(0))) {
lib/Target/AMDGPU/AMDGPUAliasAnalysis.cpp 104 } else if (const Argument *Arg = dyn_cast<Argument>(Base)) {
104 } else if (const Argument *Arg = dyn_cast<Argument>(Base)) {
lib/Target/AMDGPU/AMDGPUAnnotateUniformValues.cpp 136 if (isa<Argument>(Ptr) || isa<GlobalValue>(Ptr)) {
lib/Target/AMDGPU/AMDGPUHSAMetadataStreamer.cpp 308 void MetadataStreamerV2::emitKernelArg(const Argument &Arg) {
724 void MetadataStreamerV3::emitKernelArg(const Argument &Arg, unsigned &Offset,
lib/Target/AMDGPU/AMDGPUHSAMetadataStreamer.h 87 void emitKernelArg(const Argument &Arg, unsigned &Offset,
159 void emitKernelArg(const Argument &Arg);
lib/Target/AMDGPU/AMDGPUISelLowering.cpp 924 for (const Argument &Arg : Fn.args()) {
lib/Target/AMDGPU/AMDGPUInstrInfo.cpp 45 if (const Argument *Arg = dyn_cast<Argument>(Ptr))
45 if (const Argument *Arg = dyn_cast<Argument>(Ptr))
lib/Target/AMDGPU/AMDGPUInstructionSelector.cpp 1519 if (!Ptr || isa<UndefValue>(Ptr) || isa<Argument>(Ptr) ||
lib/Target/AMDGPU/AMDGPULowerKernelArguments.cpp 95 for (Argument &Arg : F.args()) {
lib/Target/AMDGPU/AMDGPURewriteOutArguments.cpp 105 bool isOutArgumentCandidate(Argument &Arg) const;
188 bool AMDGPURewriteOutArguments::isOutArgumentCandidate(Argument &Arg) const {
248 SmallVector<Argument *, 4> OutArgs;
249 for (Argument &Arg : F.args()) {
260 using ReplacementVec = SmallVector<std::pair<Argument *, Value *>, 4>;
285 for (Argument *OutArg : OutArgs) {
396 for (std::pair<Argument *, Value *> ReturnPoint : Replacement.second) {
397 Argument *Arg = ReturnPoint.first;
433 for (Argument &Arg : F.args()) {
448 for (Argument &Arg : F.args()) {
lib/Target/AMDGPU/AMDGPUSubtarget.cpp 503 for (const Argument &Arg : F.args()) {
lib/Target/AMDGPU/AMDGPUTargetTransformInfo.cpp 172 !isa<Argument>(GEP->getPointerOperand())))
519 static bool isArgPassedInSGPR(const Argument *A) {
548 if (const Argument *A = dyn_cast<Argument>(V))
548 if (const Argument *A = dyn_cast<Argument>(V))
lib/Target/AMDGPU/R600OpenCLImageTypeLoweringPass.cpp 164 bool replaceImageUses(Argument &ImageArg, uint32_t ResourceID,
165 Argument &ImageSizeArg,
166 Argument &ImageFormatArg) {
199 bool replaceSamplerUses(Argument &SamplerArg, uint32_t ResourceID) {
236 Argument &Arg = *ArgI;
251 Argument &SizeArg = *(++ArgI);
252 Argument &FormatArg = *(++ArgI);
309 for (auto &Arg: F->args()) {
lib/Target/AMDGPU/SIISelLowering.cpp 2615 for (const Argument &Arg : CallerF.args()) {
lib/Target/AMDGPU/Utils/AMDGPUBaseInfo.cpp 1216 bool isArgPassedInSGPR(const Argument *A) {
lib/Target/AMDGPU/Utils/AMDGPUBaseInfo.h 632 bool isArgPassedInSGPR(const Argument *Arg);
lib/Target/ARM/ARMCodeGenPrepare.cpp 239 if (isa<Argument>(V))
515 if (isa<Argument>(V))
531 else if (auto *Arg = dyn_cast<Argument>(V)) {
531 else if (auto *Arg = dyn_cast<Argument>(V)) {
843 } else if (isa<Argument>(V))
lib/Target/ARM/ARMFastISel.cpp 1028 if (const Argument *Arg = dyn_cast<Argument>(SV)) {
1028 if (const Argument *Arg = dyn_cast<Argument>(SV)) {
1160 if (const Argument *Arg = dyn_cast<Argument>(PtrV)) {
1160 if (const Argument *Arg = dyn_cast<Argument>(PtrV)) {
3024 for (const Argument &Arg : F->args()) {
3056 for (const Argument &Arg : F->args()) {
lib/Target/Hexagon/HexagonBitTracker.cpp 63 for (const Argument &Arg : MF.getFunction().args()) {
lib/Target/Hexagon/HexagonCommonGEP.cpp 838 if (isa<Constant>(Val) || isa<Argument>(Val))
lib/Target/Hexagon/HexagonOptimizeSZextends.cpp 73 for (auto &Arg : F.args()) {
lib/Target/Mips/MipsFastISel.cpp 1352 for (const auto &FormalArg : F->args()) {
1465 for (const auto &FormalArg : F->args()) {
lib/Target/Mips/MipsISelLowering.cpp 4176 SmallVectorImpl<SDValue> &InVals, const Argument *FuncArg,
lib/Target/Mips/MipsISelLowering.h 581 const Argument *FuncArg, unsigned FirstReg,
lib/Target/Mips/MipsOs16.cpp 59 Argument &Arg = *F.arg_begin();
lib/Target/NVPTX/NVPTXISelDAGToDAG.cpp 710 if (auto *A = dyn_cast<const Argument>(V))
lib/Target/NVPTX/NVPTXISelLowering.cpp 2483 std::vector<const Argument *> theArgs;
2484 for (const Argument &I : F->args()) {
lib/Target/NVPTX/NVPTXLowerArgs.cpp 116 void handleByValParam(Argument *Arg);
154 void NVPTXLowerArgs::handleByValParam(Argument *Arg) {
184 if (Argument *Arg = dyn_cast<Argument>(Ptr)) {
184 if (Argument *Arg = dyn_cast<Argument>(Ptr)) {
217 if (Argument *Arg = dyn_cast<Argument>(UO)) {
217 if (Argument *Arg = dyn_cast<Argument>(UO)) {
229 for (Argument &Arg : F.args()) {
242 for (Argument &Arg : F.args())
lib/Target/NVPTX/NVPTXTargetTransformInfo.cpp 73 if (const Argument *Arg = dyn_cast<Argument>(V))
73 if (const Argument *Arg = dyn_cast<Argument>(V))
lib/Target/NVPTX/NVPTXUtilities.cpp 165 if (const Argument *arg = dyn_cast<Argument>(&val)) {
165 if (const Argument *arg = dyn_cast<Argument>(&val)) {
177 if (const Argument *arg = dyn_cast<Argument>(&val)) {
177 if (const Argument *arg = dyn_cast<Argument>(&val)) {
189 if (const Argument *arg = dyn_cast<Argument>(&val)) {
189 if (const Argument *arg = dyn_cast<Argument>(&val)) {
201 if (const Argument *arg = dyn_cast<Argument>(&val)) {
201 if (const Argument *arg = dyn_cast<Argument>(&val)) {
lib/Target/PowerPC/PPCBoolRetToInt.cpp 109 auto *A = dyn_cast<Argument>(V);
109 auto *A = dyn_cast<Argument>(V);
145 return isa<Constant>(V) || isa<Argument>(V) || isa<CallInst>(V) ||
231 !isa<Argument>(V) && !isa<CallInst>(V))
lib/Target/WebAssembly/WebAssemblyFastISel.cpp 450 if (V != nullptr && isa<Argument>(V) && cast<Argument>(V)->hasZExtAttr())
450 if (V != nullptr && isa<Argument>(V) && cast<Argument>(V)->hasZExtAttr())
644 for (auto const &Arg : F->args()) {
723 for (auto const &Arg : F->args()) {
lib/Target/X86/X86FastISel.cpp 1112 if (const Argument *Arg = dyn_cast<Argument>(PtrV)) {
1112 if (const Argument *Arg = dyn_cast<Argument>(PtrV)) {
1303 if (const Argument *Arg = dyn_cast<Argument>(SV)) {
1303 if (const Argument *Arg = dyn_cast<Argument>(SV)) {
3081 for (auto const &Arg : F->args()) {
3130 for (auto const &Arg : F->args()) {
lib/Target/X86/X86ISelLowering.cpp22237 for (const auto &A : F.args()) {
lib/Target/X86/X86TargetTransformInfo.cpp 3423 SmallPtrSetImpl<Argument *> &Args) const {
lib/Target/X86/X86TargetTransformInfo.h 203 SmallPtrSetImpl<Argument *> &Args) const;
lib/Transforms/Coroutines/CoroFrame.cpp 137 bool isDefinitionAcrossSuspend(Argument &A, User *U) const {
673 if (auto Arg = dyn_cast<Argument>(CurrentValue)) {
1257 static void eliminateSwiftErrorArgument(Function &F, Argument &Arg,
1298 for (auto &Arg : F.args()) {
1380 for (Argument &A : F.args())
lib/Transforms/Coroutines/CoroSplit.cpp 508 for (auto &Arg : F.args()) {
621 Argument *NewStorage = &*NewF->arg_begin();
649 for (Argument &A : OrigF.args())
lib/Transforms/IPO/ArgumentPromotion.cpp 105 doPromotion(Function *F, SmallPtrSetImpl<Argument *> &ArgsToPromote,
106 SmallPtrSetImpl<Argument *> &ByValArgsToTransform,
122 std::map<Argument *, ScalarizeTable> ScalarizedElements;
129 std::map<std::pair<Argument *, IndicesVector>, LoadInst *> OriginalLoads;
485 static bool allCallersPassValidPointerForArgument(Argument *Arg, Type *Ty) {
570 static bool isSafeToPromoteArgument(Argument *Arg, Type *ByValTy, AAResults &AAR,
811 static bool canPaddingBeAccessed(Argument *arg) {
848 SmallPtrSetImpl<Argument *> &ArgsToPromote,
849 SmallPtrSetImpl<Argument *> &ByValArgsToTransform) {
895 SmallVector<Argument *, 16> PointerArgs;
896 for (Argument &I : F->args())
932 SmallPtrSet<Argument *, 8> ArgsToPromote;
933 SmallPtrSet<Argument *, 8> ByValArgsToTransform;
934 for (Argument *PtrArg : PointerArgs) {
lib/Transforms/IPO/Attributor.cpp 196 for (Argument &Arg : CS.getCalledFunction()->args())
475 if (isa<Argument>(AnchorVal)) {
886 for (Argument &Arg : F->args()) {
989 if (auto *UniqueRVArg = dyn_cast<Argument>(UniqueRV.getValue())) {
989 if (auto *UniqueRVArg = dyn_cast<Argument>(UniqueRV.getValue())) {
1172 if (isa<Argument>(RetVal) || isa<CallBase>(RetVal) ||
1199 if (Argument *Arg = dyn_cast<Argument>(RetVal)) {
1199 if (Argument *Arg = dyn_cast<Argument>(RetVal)) {
3188 } else if (!isa<Argument>(It.first) ||
3253 Argument *Arg = getAssociatedArgument();
3904 Argument *Arg = getAssociatedArgument();
3941 Argument *Arg = getAssociatedArgument();
4777 for (Argument &Arg : F.args()) {
lib/Transforms/IPO/CalledValuePropagation.cpp 127 } else if (auto *A = dyn_cast<Argument>(Key.getPointer())) {
127 } else if (auto *A = dyn_cast<Argument>(Key.getPointer())) {
282 for (Argument &A : F->args()) {
lib/Transforms/IPO/DeadArgumentElimination.cpp 292 for (Argument &Arg : Fn.args()) {
lib/Transforms/IPO/FunctionAttrs.cpp 319 Argument *Definition;
326 using ArgumentMapTy = std::map<Argument *, ArgumentGraphNode>;
347 ArgumentGraphNode *operator[](Argument *A) {
412 SmallVector<Argument *, 4> Uses;
445 determinePointerReadAttrs(Argument *A,
446 const SmallPtrSet<Argument *, 8> &SCCNodes) {
598 if (!isa<Argument>(RetVal) || RetVal->getType() != F->getReturnType())
611 auto *A = cast<Argument>(RetArg);
611 auto *A = cast<Argument>(RetArg);
642 for (auto &CSArg : CalledFunc->args()) {
649 auto *FArg = dyn_cast<Argument>(CS.getArgOperand(CSArg.getArgNo()));
649 auto *FArg = dyn_cast<Argument>(CS.getArgOperand(CSArg.getArgNo()));
664 static bool addReadAttr(Argument *A, Attribute::AttrKind R) {
734 for (Argument *Use : Tracker.Uses) {
748 SmallPtrSet<Argument *, 8> Self;
773 Argument *A = ArgumentSCC[0]->Definition;
793 SmallPtrSet<Argument *, 8> ArgumentSCCNodes;
804 Argument *A = Use->Definition;
815 Argument *A = ArgumentSCC[i]->Definition;
834 Argument *A = ArgumentSCC[i]->Definition;
848 Argument *A = ArgumentSCC[i]->Definition;
877 if (isa<Argument>(RetVal))
lib/Transforms/IPO/GlobalOpt.cpp 165 if (isa<LoadInst>(V) || isa<InvokeInst>(V) || isa<Argument>(V) ||
lib/Transforms/IPO/IPConstantPropagation.cpp 199 if (isa<Constant>(V) || isa<Argument>(V)) {
240 if (Argument *A = dyn_cast<Argument>(New))
240 if (Argument *A = dyn_cast<Argument>(New))
265 if (Argument *A = dyn_cast<Argument>(New))
265 if (Argument *A = dyn_cast<Argument>(New))
lib/Transforms/IPO/MergeFunctions.cpp 587 if (dyn_cast<Argument>(Arg)) {
708 for (Argument &AI : H->args()) {
lib/Transforms/IPO/ThinLTOBitcodeWriter.cpp 262 for (auto &Arg : make_range(std::next(F->arg_begin()), F->arg_end())) {
lib/Transforms/InstCombine/InstCombineCompares.cpp 630 if (auto *A = dyn_cast<Argument>(V)) {
630 if (auto *A = dyn_cast<Argument>(V)) {
lib/Transforms/InstCombine/InstCombineInternal.h 90 if (isa<Argument>(V))
lib/Transforms/Instrumentation/AddressSanitizer.cpp 2898 for (Argument &Arg : F.args()) {
lib/Transforms/Instrumentation/ControlHeightReduction.cpp 538 if (isa<Argument>(V)) {
lib/Transforms/Instrumentation/DataFlowSanitizer.cpp 1024 if (!isa<Argument>(V) && !isa<Instruction>(V))
1028 if (Argument *A = dyn_cast<Argument>(V)) {
1028 if (Argument *A = dyn_cast<Argument>(V)) {
lib/Transforms/Instrumentation/MemorySanitizer.cpp 1597 if (Argument *A = dyn_cast<Argument>(V)) {
1597 if (Argument *A = dyn_cast<Argument>(V)) {
1606 for (auto &FArg : F->args()) {
lib/Transforms/ObjCARC/ObjCARCContract.cpp 617 if (!isa<Instruction>(Arg) && !isa<Argument>(Arg))
lib/Transforms/ObjCARC/ProvenanceAnalysisEvaluator.cpp 56 for (auto &Arg : F.args())
lib/Transforms/Scalar/BDCE.cpp 116 if (!isa<Instruction>(U) && !isa<Argument>(U))
lib/Transforms/Scalar/DeadStoreElimination.cpp 728 if (isa<AllocaInst>(UnderlyingPointer) || isa<Argument>(UnderlyingPointer)) {
772 for (Argument &AI : BB.getParent()->args())
lib/Transforms/Scalar/GVN.cpp 1469 if ((isa<Argument>(CmpLHS) && isa<Argument>(CmpRHS)) ||
1469 if ((isa<Argument>(CmpLHS) && isa<Argument>(CmpRHS)) ||
1798 if (isa<Constant>(LHS) || (isa<Argument>(LHS) && !isa<Constant>(RHS)))
1807 if ((isa<Argument>(LHS) && isa<Argument>(RHS)) ||
1807 if ((isa<Argument>(LHS) && isa<Argument>(RHS)) ||
2205 if (isa<Argument>(Op) || isa<Constant>(Op) || isa<GlobalValue>(Op))
lib/Transforms/Scalar/GVNHoist.cpp 316 else if (auto *A = dyn_cast<Argument>(V))
lib/Transforms/Scalar/MemCpyOptimizer.cpp 778 } else if (Argument *A = dyn_cast<Argument>(cpyDest)) {
778 } else if (Argument *A = dyn_cast<Argument>(cpyDest)) {
lib/Transforms/Scalar/NewGVN.cpp 973 return isa<Constant>(V) || isa<Argument>(V);
1079 } else if (isa<Argument>(V) || isa<GlobalVariable>(V)) {
1961 else if (isa<Argument>(V) || isa<GlobalVariable>(V)) {
2913 for (auto &FA : F.args())
4149 else if (auto *A = dyn_cast<Argument>(V))
lib/Transforms/Scalar/Reassociate.cpp 170 for (auto &Arg : F.args()) {
192 if (isa<Argument>(V)) return ValueRankMap[V]; // Function argument.
lib/Transforms/Scalar/RewriteStatepointsForGC.cpp 438 if (isa<Argument>(I))
499 if (isa<Argument>(I))
2402 for (Argument &A : F.args())
lib/Transforms/Scalar/SCCP.cpp 1812 for (Argument &AI : F.args())
2034 for (Argument &AI : F.args())
lib/Transforms/Scalar/Scalarizer.cpp 335 if (Argument *VArg = dyn_cast<Argument>(V)) {
335 if (Argument *VArg = dyn_cast<Argument>(V)) {
lib/Transforms/Scalar/StructurizeCFG.cpp 425 if (Argument *Arg = dyn_cast<Argument>(Condition)) {
425 if (Argument *Arg = dyn_cast<Argument>(Condition)) {
lib/Transforms/Scalar/TailRecursionElimination.cpp 196 for (Argument &Arg : F.args()) {
257 if (Argument *A = dyn_cast<Argument>(Arg.getUser()))
257 if (Argument *A = dyn_cast<Argument>(Arg.getUser()))
367 if (Argument *Arg = dyn_cast<Argument>(V)) {
367 if (Argument *Arg = dyn_cast<Argument>(V)) {
lib/Transforms/Utils/CloneFunction.cpp 94 for (const Argument &I : OldFunc->args())
115 for (const Argument &OldArg : OldFunc->args()) {
116 if (Argument *NewArg = dyn_cast<Argument>(VMap[&OldArg])) {
116 if (Argument *NewArg = dyn_cast<Argument>(VMap[&OldArg])) {
244 for (const Argument &I : F->args())
258 for (const Argument & I : F->args())
464 for (const Argument &II : OldFunc->args())
lib/Transforms/Utils/CodeExtractor.cpp 278 if (isa<Argument>(V)) return true;
lib/Transforms/Utils/InlineFunction.cpp 925 SmallVector<const Argument *, 4> NoAliasArgs;
927 for (const Argument &Arg : CalledFunc->args())
945 DenseMap<const Argument *, MDNode *> NewScopes;
952 const Argument *A = NoAliasArgs[i];
1036 SmallSetVector<const Argument *, 4> NAPtrArgs;
1061 if (const Argument *A = dyn_cast<Argument>(V)) {
1061 if (const Argument *A = dyn_cast<Argument>(V)) {
1072 if (!isa<Argument>(V) &&
1090 for (const Argument *A : NoAliasArgs) {
1125 for (const Argument *A : NoAliasArgs) {
1154 for (Argument &Arg : CalledFunc->args()) {
lib/Transforms/Utils/InstructionNamer.cpp 34 for (auto &Arg : F.args())
lib/Transforms/Utils/PredicateInfo.cpp 113 auto *ArgA = dyn_cast_or_null<Argument>(A);
114 auto *ArgB = dyn_cast_or_null<Argument>(B);
241 auto *ArgA = dyn_cast_or_null<Argument>(ADef);
241 auto *ArgA = dyn_cast_or_null<Argument>(ADef);
242 auto *ArgB = dyn_cast_or_null<Argument>(BDef);
242 auto *ArgB = dyn_cast_or_null<Argument>(BDef);
333 if ((isa<Instruction>(Op0) || isa<Argument>(Op0)) && !Op0->hasOneUse())
335 if ((isa<Instruction>(Op1) || isa<Argument>(Op1)) && !Op1->hasOneUse())
464 if ((!isa<Instruction>(Op) && !isa<Argument>(Op)) || Op->hasOneUse())
lib/Transforms/Utils/ValueMapper.cpp 946 for (Argument &A : F.args())
lib/Transforms/Vectorize/SLPVectorizer.cpp 1022 else if (isa<Argument>(OpLane0))
tools/bugpoint/Miscompilation.cpp 910 for (Argument &A : FuncWrapper->args())
tools/clang/lib/CodeGen/Address.h 108 template <class U> inline U cast(CodeGen::Address addr) {
tools/clang/lib/CodeGen/CGCUDANV.cpp 419 llvm::Argument &GpuBinaryHandlePtr = *RegisterKernelsFunc->arg_begin();
tools/clang/lib/CodeGen/CGCall.cpp 2249 for (auto &Arg : Fn->args()) {
2266 auto AI = cast<llvm::Argument>(FnArgs[IRFunctionArgs.getSRetArgNo()]);
2357 auto AI = cast<llvm::Argument>(V);
tools/clang/lib/CodeGen/CGNonTrivialStruct.cpp 436 for (const llvm::Argument &Arg : F->args())
tools/clang/lib/CodeGen/CGVTables.cpp 397 for (llvm::Argument &A : CurFn->args())
tools/clang/lib/CodeGen/CodeGenFunction.cpp 432 for (llvm::Argument &A : CurFn->args())
tools/clang/lib/CodeGen/CodeGenModule.cpp 4301 for (llvm::Argument &A : newFn->args()) {
tools/clang/lib/CodeGen/TargetInfo.cpp 9905 for (auto &A : F->args())
tools/lldb/source/Expression/IRInterpreter.cpp 308 bool MakeArgument(const Argument *value, uint64_t address) {
tools/lldb/source/Plugins/ExpressionParser/Clang/IRForTarget.cpp 1683 Argument *argument = &*iter;
tools/lldb/source/Plugins/LanguageRuntime/RenderScript/RenderScriptRuntime/RenderScriptx86ABIFixups.cpp 254 for (auto &arg : func->args()) {
tools/llvm-diff/DifferenceEngine.cpp 472 if (isa<Argument>(L))
tools/llvm-reduce/deltas/ReduceArguments.cpp 46 std::set<Argument *> ArgsToKeep;
52 for (auto &A : F.args())
64 for (auto &A : F->args())
85 for (auto &Arg : F->args())
112 for (auto &A : F.args())
tools/llvm-stress/llvm-stress.cpp 680 for (auto &arg : F->args())
tools/polly/lib/Analysis/ScopBuilder.cpp 2924 for (const llvm::Argument &Arg : F.args())
tools/polly/lib/Analysis/ScopDetection.cpp 789 if (isa<Argument>(Val) || isa<Constant>(Val))
tools/polly/lib/Support/VirtualInstruction.cpp 89 if (!UserStmt || isa<Argument>(Val))
tools/verify-uselistorder/verify-uselistorder.cpp 216 for (const Argument &A : F.args())
492 for (Argument &A : F.args())
unittests/Analysis/AliasAnalysisTest.cpp 48 for (Argument &A : F.args())
unittests/Analysis/DivergenceAnalysisTest.cpp 98 Argument &arg = *F->arg_begin();
143 auto &NArg = *ItArg;
197 auto &NArg = *ItArg;
325 auto *AArg = &*ItArg++;
326 auto *BArg = &*ItArg++;
327 auto *CArg = &*ItArg;
347 auto *AArg = &*ItArg++;
348 auto *BArg = &*ItArg++;
349 auto *CArg = &*ItArg;
369 auto *AArg = &*ItArg++;
370 auto *BArg = &*ItArg++;
371 auto *CArg = &*ItArg;
412 auto &CondArg = *F->arg_begin();
unittests/Analysis/MemorySSATest.cpp 85 Argument *PointerArg = &*F->arg_begin();
123 Argument *PointerArg = &*F->arg_begin();
213 Argument *PointerArg = &*F->arg_begin();
257 Argument *PointerArg = &*F->arg_begin();
305 Argument *PointerArg = &*F->arg_begin();
341 Argument *PointerArg = &*F->arg_begin();
387 Argument *PointerArg = &*F->arg_begin();
431 Argument *PointerArg = &*F->arg_begin();
488 Argument *PointerArg = &*F->arg_begin();
533 Argument *PointerArg = &*F->arg_begin();
900 Argument *FirstArg = &*F->arg_begin();
1102 auto *ArgIt = F->arg_begin();
1103 Argument *PointerA = &*ArgIt;
1104 Argument *PointerB = &*(++ArgIt);
1144 auto *ArgIt = F->arg_begin();
1145 Argument *PointerA = &*ArgIt;
1146 Argument *PointerB = &*(++ArgIt);
1414 Argument *PointerArg = &*F->arg_begin();
1470 Argument *PointerArg = &*F->arg_begin();
1542 Argument *PointerArg = &*F->arg_begin();
unittests/Analysis/OrderedInstructionsTest.cpp 46 Argument *PointerArg = &*F->arg_begin();
unittests/Analysis/ScalarEvolutionTest.cpp 447 Argument *A1 = &*F->arg_begin();
448 Argument *A2 = &*(std::next(F->arg_begin()));
760 Argument *Arg = &*F->arg_begin();
932 Argument *Arg = &*F->arg_begin();
1079 auto *Arg = &*(F->arg_begin());
1108 auto *Arg = &*(F->arg_begin());
1220 Argument *Arg = &*F->arg_begin();
1272 Argument *Arg = &*F->arg_begin();
1322 Argument *Arg = &*F->arg_begin();
1373 Argument *Arg = &*F->arg_begin();
1423 Argument *A = &*F->arg_begin();
1424 Argument *B = &*std::next(F->arg_begin());
unittests/Analysis/SparsePropagation.cpp 172 for (Argument &A : F->args()) {
465 Argument *A = G->arg_begin();
466 Argument *B = std::next(G->arg_begin());
unittests/ExecutionEngine/MCJIT/MCJITTestBase.h 68 for (Argument &A : Result->args())
unittests/IR/AsmWriterTest.cpp 41 auto Arg = new Argument(Ty);
unittests/IR/BasicBlockTest.cpp 100 Argument *V = new Argument(Type::getInt32Ty(Ctx));
100 Argument *V = new Argument(Type::getInt32Ty(Ctx));
unittests/IR/FunctionTest.cpp 39 for (Argument &A : F->args()) {
68 SmallVector<Argument *, 4> Args;
69 for (Argument &A : F1->args())
81 for (Argument &A : F2->args()) {
90 for (Argument &A : F1->args()) {
105 for (Argument &A : F1->args()) {
unittests/IR/InstructionsTest.cpp 599 auto *Arg0 = &*F->arg_begin();
unittests/IR/UseTest.cpp 43 Argument &X = *F->arg_begin();
88 Argument &X = *F->arg_begin();
unittests/Transforms/Scalar/LoopPassManagerTest.cpp 884 Argument &Ptr = *F.arg_begin();
1087 Argument &Ptr = *F.arg_begin();
1348 Argument &Ptr = *F.arg_begin();
unittests/Transforms/Utils/CloningTest.cpp 68 V = new Argument(Type::getInt32Ty(context));
138 V = new Argument(Type::getInt32PtrTy(context));
152 V = new Argument(Type::getInt32Ty(context));
172 Argument *A = &*F1->arg_begin();
212 V = new Argument(Type::getInt32Ty(context));
261 V = new Argument(Type::getInt32Ty(context));
314 V = new Argument(Type::getInt32Ty(context));
unittests/Transforms/Utils/FunctionComparatorTest.cpp 33 Argument *PointerArg = &*F->arg_begin();
unittests/Transforms/Utils/SSAUpdaterBulkTest.cpp 46 Argument *FirstArg = &*(F->arg_begin());
133 Argument *FirstArg = &*F->arg_begin();
unittests/Transforms/Utils/ValueMapperTest.cpp 272 Argument &A = *F->arg_begin();
291 Argument &A = *F->arg_begin();
335 Argument &A = *F->arg_begin();
usr/include/c++/7.4.0/bits/alloc_traits.h 387 using allocator_type = allocator<_Tp>;
389 using value_type = _Tp;
392 using pointer = _Tp*;
395 using const_pointer = const _Tp*;
usr/include/c++/7.4.0/bits/allocator.h 108 class allocator: public __allocator_base<_Tp>
113 typedef _Tp* pointer;
114 typedef const _Tp* const_pointer;
115 typedef _Tp& reference;
116 typedef const _Tp& const_reference;
117 typedef _Tp value_type;
137 allocator(const allocator<_Tp1>&) throw() { }
usr/include/c++/7.4.0/bits/stl_iterator_base_types.h 181 typedef _Tp value_type;
183 typedef _Tp* pointer;
184 typedef _Tp& reference;
192 typedef _Tp value_type;
194 typedef const _Tp* pointer;
195 typedef const _Tp& reference;
usr/include/c++/7.4.0/bits/stl_vector.h 77 rebind<_Tp>::other _Tp_alloc_type;
216 class vector : protected _Vector_base<_Tp, _Alloc>
227 typedef _Vector_base<_Tp, _Alloc> _Base;
232 typedef _Tp value_type;
919 _Tp*
923 const _Tp*
usr/include/c++/7.4.0/ext/alloc_traits.h 117 { typedef typename _Base_type::template rebind_alloc<_Tp> other; };
usr/include/c++/7.4.0/ext/new_allocator.h 63 typedef _Tp* pointer;
64 typedef const _Tp* const_pointer;
65 typedef _Tp& reference;
66 typedef const _Tp& const_reference;
67 typedef _Tp value_type;
111 return static_cast<_Tp*>(::operator new(__n * sizeof(_Tp)));
130 { return size_t(-1) / sizeof(_Tp); }
usr/include/c++/7.4.0/initializer_list 50 typedef _E value_type;
51 typedef const _E& reference;
52 typedef const _E& const_reference;
54 typedef const _E* iterator;
55 typedef const _E* const_iterator;
usr/include/c++/7.4.0/type_traits 1983 { typedef _Up type; };
utils/unittest/googletest/include/gtest/gtest-printers.h 407 T* p, ::std::ostream* os) {
416 if (IsTrue(ImplicitlyConvertible<T*, const void*>::value)) {