|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
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)
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/ADT/DenseMap.h 40 struct DenseMapPair : public std::pair<KeyT, ValueT> {
45 ValueT &getSecond() { return std::pair<KeyT, ValueT>::second; }
46 const ValueT &getSecond() const { return std::pair<KeyT, ValueT>::second; }
66 using mapped_type = ValueT;
69 using iterator = DenseMapIterator<KeyT, ValueT, KeyInfoT, BucketT>;
71 DenseMapIterator<KeyT, ValueT, KeyInfoT, BucketT, true>;
123 is_trivially_copyable<ValueT>::value) {
185 ValueT lookup(const_arg_type_t<KeyT> Val) const {
195 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) {
202 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) {
219 InsertIntoBucket(TheBucket, std::move(Key), std::forward<Ts>(Args)...);
249 std::pair<iterator, bool> insert_as(std::pair<KeyT, ValueT> &&KV,
299 ValueT &operator[](const KeyT &Key) {
311 ValueT &operator[](KeyT &&Key) {
380 ::new (&DestBucket->getSecond()) ValueT(std::move(B->getSecond()));
392 const DenseMapBase<OtherBaseT, KeyT, ValueT, KeyInfoT, BucketT> &other) {
520 ::new (&TheBucket->getSecond()) ValueT(std::forward<ValueArgs>(Values)...);
520 ::new (&TheBucket->getSecond()) ValueT(std::forward<ValueArgs>(Values)...);
526 ValueT &&Value, LookupKeyT &Lookup) {
684 class DenseMap : public DenseMapBase<DenseMap<KeyT, ValueT, KeyInfoT, BucketT>,
685 KeyT, ValueT, KeyInfoT, BucketT> {
690 using BaseT = DenseMapBase<DenseMap, KeyT, ValueT, KeyInfoT, BucketT>;
include/llvm/ADT/SmallVector.h 75 AlignedCharArrayUnion<T> FirstEl;
114 using value_type = T;
115 using iterator = T *;
116 using const_iterator = const T *;
121 using reference = T &;
122 using const_reference = const T &;
123 using pointer = T *;
124 using const_pointer = const T *;
179 class SmallVectorTemplateBase : public SmallVectorTemplateCommon<T> {
183 static void destroy_range(T *S, T *E) {
183 static void destroy_range(T *S, T *E) {
211 void push_back(const T &Elt) {
214 ::new ((void*) this->end()) T(Elt);
218 void push_back(T &&Elt) {
221 ::new ((void*) this->end()) T(::std::move(Elt));
240 T *NewElts = static_cast<T*>(llvm::safe_malloc(NewCapacity*sizeof(T)));
240 T *NewElts = static_cast<T*>(llvm::safe_malloc(NewCapacity*sizeof(T)));
315 class SmallVectorImpl : public SmallVectorTemplateBase<T> {
316 using SuperClass = SmallVectorTemplateBase<T>;
357 void resize(size_type N, const T &NV) {
374 LLVM_NODISCARD T pop_back_val() {
375 T Result = ::std::move(this->back());
397 void append(size_type NumInputs, const T &Elt) {
405 void append(std::initializer_list<T> IL) {
412 void assign(size_type NumElts, const T &Elt) {
429 void assign(std::initializer_list<T> IL) {
467 iterator insert(iterator I, T &&Elt) {
497 iterator insert(iterator I, const T &Elt) {
526 iterator insert(iterator I, size_type NumToInsert, const T &Elt) {
637 void insert(iterator I, std::initializer_list<T> IL) {
644 ::new ((void *)this->end()) T(std::forward<ArgTypes>(Args)...);
820 AlignedCharArrayUnion<T> InlineElts[N];
837 class SmallVector : public SmallVectorImpl<T>, SmallVectorStorage<T, N> {
837 class SmallVector : public SmallVectorImpl<T>, SmallVectorStorage<T, N> {
846 explicit SmallVector(size_t Size, const T &Value = T())
865 SmallVector(std::initializer_list<T> IL) : SmallVectorImpl<T>(N) {
884 SmallVector(SmallVectorImpl<T> &&RHS) : SmallVectorImpl<T>(N) {
include/llvm/ADT/StringMap.h 129 ValueTy second;
138 const ValueTy &getValue() const { return second; }
139 ValueTy &getValue() { return second; }
141 void setValue(const ValueTy &V) { second = V; }
158 class StringMapEntry final : public StringMapEntryStorage<ValueTy> {
246 using MapEntryTy = StringMapEntry<ValueTy>;
260 StringMap(std::initializer_list<std::pair<StringRef, ValueTy>> List)
330 using mapped_type = ValueTy;
331 using value_type = StringMapEntry<ValueTy>;
334 using const_iterator = StringMapConstIterator<ValueTy>;
335 using iterator = StringMapIterator<ValueTy>;
350 iterator_range<StringMapKeyIterator<ValueTy>> keys() const {
369 ValueTy lookup(StringRef Key) const {
378 ValueTy &operator[](StringRef Key) { return try_emplace(Key).first->second; }
413 std::pair<iterator, bool> insert(std::pair<StringRef, ValueTy> KV) {
531 : public StringMapIterBase<StringMapConstIterator<ValueTy>,
532 const StringMapEntry<ValueTy>> {
533 using base = StringMapIterBase<StringMapConstIterator<ValueTy>,
534 const StringMapEntry<ValueTy>>;
542 const StringMapEntry<ValueTy> &operator*() const {
548 class StringMapIterator : public StringMapIterBase<StringMapIterator<ValueTy>,
549 StringMapEntry<ValueTy>> {
551 StringMapIterBase<StringMapIterator<ValueTy>, StringMapEntry<ValueTy>>;
551 StringMapIterBase<StringMapIterator<ValueTy>, StringMapEntry<ValueTy>>;
559 StringMapEntry<ValueTy> &operator*() const {
563 operator StringMapConstIterator<ValueTy>() const {
include/llvm/Analysis/AssumptionCache.h 49 SmallVector<WeakTrackingVH, 4> AssumeHandles;
69 DenseMap<AffectedValueCallbackVH, SmallVector<WeakTrackingVH, 1>,
74 SmallVector<WeakTrackingVH, 1> &getOrInsertAffectedValues(Value *V);
131 MutableArrayRef<WeakTrackingVH> assumptions() {
138 MutableArrayRef<WeakTrackingVH> assumptionsFor(const Value *V) {
include/llvm/Analysis/CGSCCPassManager.h 572 SmallVector<WeakTrackingVH, 8> CallHandles;
include/llvm/Analysis/CallGraph.h 168 using CallRecord = std::pair<WeakTrackingVH, CallGraphNode *>;
include/llvm/Analysis/IVUsers.h 82 WeakTrackingVH OperandValToReplace;
include/llvm/Analysis/MemoryBuiltins.h 287 using WeakEvalType = std::pair<WeakTrackingVH, WeakTrackingVH>;
287 using WeakEvalType = std::pair<WeakTrackingVH, WeakTrackingVH>;
include/llvm/Analysis/MemorySSAUpdater.h 64 using ValueToValueMapTy = ValueMap<const Value *, WeakTrackingVH>;
include/llvm/Analysis/ObjCARCAnalysisUtils.h 92 DenseMap<const Value *, WeakTrackingVH> &Cache) {
93 if (auto InCache = Cache.lookup(V))
include/llvm/Analysis/ScalarEvolutionExpander.h 202 SmallVectorImpl<WeakTrackingVH> &DeadInsts,
include/llvm/IR/ValueHandle.h 185 WeakTrackingVH(const WeakTrackingVH &RHS)
188 WeakTrackingVH &operator=(const WeakTrackingVH &RHS) = default;
188 WeakTrackingVH &operator=(const WeakTrackingVH &RHS) = default;
211 static SimpleType getSimplifiedValue(WeakTrackingVH &WVH) { return WVH; }
216 static SimpleType getSimplifiedValue(const WeakTrackingVH &WVH) {
328 WeakTrackingVH InnerHandle;
include/llvm/IR/ValueMap.h 88 using ValueMapCVH = ValueMapCallbackVH<KeyT, ValueT, Config>;
89 using MapT = DenseMap<ValueMapCVH, ValueT, DenseMapInfo<ValueMapCVH>>;
99 using mapped_type = ValueT;
100 using value_type = std::pair<KeyT, ValueT>;
165 ValueT lookup(const KeyT &Val) const {
173 std::pair<iterator, bool> insert(const std::pair<KeyT, ValueT> &KV) {
178 std::pair<iterator, bool> insert(std::pair<KeyT, ValueT> &&KV) {
207 ValueT &operator[](const KeyT &Key) {
245 using ValueMapT = ValueMap<KeyT, ValueT, Config>;
289 ValueT Target(std::move(I->second));
299 using VH = ValueMapCallbackVH<KeyT, ValueT, Config>;
include/llvm/Support/AlignOf.h 30 T t;
39 template <typename T> union SizerImpl<T> { char arr[sizeof(T)]; };
50 llvm::detail::SizerImpl<T, Ts...>)];
include/llvm/Support/Casting.h 141 template <class X, class Y> LLVM_NODISCARD inline bool isa(const Y &Val) {
142 return isa_impl_wrap<X, const Y,
143 typename simplify_type<const Y>::SimpleType>::doit(Val);
210 To, From, typename simplify_type<From>::SimpleType>::ret_type;
210 To, From, typename simplify_type<From>::SimpleType>::ret_type;
218 static typename cast_retty<To, From>::ret_type doit(From &Val) {
218 static typename cast_retty<To, From>::ret_type doit(From &Val) {
221 simplify_type<From>::getSimplifiedValue(Val));
236 std::is_same<X, typename simplify_type<X>::SimpleType>::value;
236 std::is_same<X, typename simplify_type<X>::SimpleType>::value;
247 inline typename std::enable_if<!is_simple_type<Y>::value,
248 typename cast_retty<X, const Y>::ret_type>::type
249 cast(const Y &Val) {
252 X, const Y, typename simplify_type<const Y>::SimpleType>::doit(Val);
252 X, const Y, typename simplify_type<const Y>::SimpleType>::doit(Val);
256 inline typename cast_retty<X, Y>::ret_type cast(Y &Val) {
256 inline typename cast_retty<X, Y>::ret_type cast(Y &Val) {
258 return cast_convert_val<X, Y,
259 typename simplify_type<Y>::SimpleType>::doit(Val);
284 typename std::enable_if<!is_simple_type<Y>::value,
285 typename cast_retty<X, const Y>::ret_type>::type
286 cast_or_null(const Y &Val) {
295 typename std::enable_if<!is_simple_type<Y>::value,
296 typename cast_retty<X, Y>::ret_type>::type
297 cast_or_null(Y &Val) {
330 typename std::enable_if<!is_simple_type<Y>::value,
331 typename cast_retty<X, const Y>::ret_type>::type
332 dyn_cast(const Y &Val) {
337 LLVM_NODISCARD inline typename cast_retty<X, Y>::ret_type dyn_cast(Y &Val) {
337 LLVM_NODISCARD inline typename cast_retty<X, Y>::ret_type dyn_cast(Y &Val) {
351 typename std::enable_if<!is_simple_type<Y>::value,
352 typename cast_retty<X, const Y>::ret_type>::type
353 dyn_cast_or_null(const Y &Val) {
359 typename std::enable_if<!is_simple_type<Y>::value,
360 typename cast_retty<X, Y>::ret_type>::type
361 dyn_cast_or_null(Y &Val) {
include/llvm/Support/type_traits.h 91 T t;
122 static auto get(F*) -> decltype(std::declval<F &>() = std::declval<const F &>(), std::true_type{});
122 static auto get(F*) -> decltype(std::declval<F &>() = std::declval<const F &>(), std::true_type{});
122 static auto get(F*) -> decltype(std::declval<F &>() = std::declval<const F &>(), std::true_type{});
130 static auto get(F*) -> decltype(std::declval<F &>() = std::declval<F &&>(), std::true_type{});
130 static auto get(F*) -> decltype(std::declval<F &>() = std::declval<F &&>(), std::true_type{});
130 static auto get(F*) -> decltype(std::declval<F &>() = std::declval<F &&>(), std::true_type{});
145 std::is_copy_constructible<detail::trivial_helper<T>>::value;
147 !std::is_copy_constructible<T>::value;
151 std::is_move_constructible<detail::trivial_helper<T>>::value;
153 !std::is_move_constructible<T>::value;
157 is_copy_assignable<detail::trivial_helper<T>>::value;
159 !is_copy_assignable<T>::value;
163 is_move_assignable<detail::trivial_helper<T>>::value;
165 !is_move_assignable<T>::value;
169 std::is_destructible<detail::trivial_helper<T>>::value;
181 static_assert(value == std::is_trivially_copyable<T>::value,
include/llvm/Transforms/Scalar/NaryReassociate.h 183 DenseMap<const SCEV *, SmallVector<WeakTrackingVH, 2>> SeenExprs;
include/llvm/Transforms/Utils/Cloning.h 77 std::vector<WeakTrackingVH> OperandBundleCallSites;
197 SmallVector<WeakTrackingVH, 8> InlinedCalls;
273 const ValueMap<const Value *, WeakTrackingVH> *VMap = nullptr);
include/llvm/Transforms/Utils/SimplifyIndVar.h 49 LoopInfo *LI, SmallVectorImpl<WeakTrackingVH> &Dead,
55 LoopInfo *LI, SmallVectorImpl<WeakTrackingVH> &Dead);
include/llvm/Transforms/Utils/ValueMapper.h 33 using ValueToValueMapTy = ValueMap<const Value *, WeakTrackingVH>;
lib/Analysis/AssumptionCache.cpp 43 SmallVector<WeakTrackingVH, 1> &
152 for (auto &A : AVI->second)
185 for (auto &A : AssumeHandles)
210 for (auto &VH : AssumeHandles) {
233 for (auto &VH : AC.assumptions())
281 for (auto &VH : I.second->assumptions())
lib/Analysis/CodeMetrics.cpp 76 for (auto &AssumeVH : AC->assumptions()) {
100 for (auto &AssumeVH : AC->assumptions()) {
lib/Analysis/LazyValueInfo.cpp 828 for (auto &AssumeVH : AC->assumptionsFor(Val)) {
lib/Analysis/ScalarEvolution.cpp 9503 for (auto &AssumeVH : AC.assumptions()) {
9658 for (auto &AssumeVH : AC.assumptions()) {
lib/Analysis/ScalarEvolutionExpander.cpp 1950 SmallVectorImpl<WeakTrackingVH> &DeadInsts,
lib/Analysis/ValueTracking.cpp 590 for (auto &AssumeVH : Q.AC->assumptionsFor(V)) {
lib/Bitcode/Reader/ValueList.cpp 80 WeakTrackingVH &OldV = ValuePtrs[Idx];
lib/Bitcode/Reader/ValueList.h 29 std::vector<WeakTrackingVH> ValuePtrs;
lib/CodeGen/CodeGenPrepare.cpp 264 ValueMap<Value*, WeakTrackingVH> SunkAddrs;
332 WeakTrackingVH IterHandle(CurValue);
567 SmallVector<WeakTrackingVH, 16> Blocks;
571 for (auto &Block : Blocks) {
644 SmallVector<WeakTrackingVH, 16> Blocks;
648 for (auto &Block : Blocks) {
4769 WeakTrackingVH SunkAddrVH = SunkAddrs[Addr];
5013 WeakTrackingVH IterHandle(CurValue);
lib/Target/XCore/XCoreLowerThreadLocal.cpp 130 SmallVector<WeakTrackingVH, 8> WUsers(CE->user_begin(), CE->user_end());
134 if (WeakTrackingVH WU = WUsers.pop_back_val()) {
161 SmallVector<WeakTrackingVH, 8> WUsers;
166 if (WeakTrackingVH WU = WUsers.pop_back_val()) {
lib/Transforms/Coroutines/CoroSplit.cpp 418 auto NewS = VMap[ActiveSuspend];
lib/Transforms/IPO/GlobalOpt.cpp 283 SmallVector<WeakTrackingVH, 8> WorkList(V->user_begin(), V->user_end());
lib/Transforms/IPO/MergeFunctions.cpp 232 std::vector<WeakTrackingVH> Deferred;
237 bool doSanityCheck(std::vector<WeakTrackingVH> &Worklist);
311 bool MergeFunctions::doSanityCheck(std::vector<WeakTrackingVH> &Worklist) {
319 for (std::vector<WeakTrackingVH>::iterator I = Worklist.begin(),
323 for (std::vector<WeakTrackingVH>::iterator J = I; J != E && j < Max;
342 for (std::vector<WeakTrackingVH>::iterator K = J; K != E && k < Max;
417 std::vector<WeakTrackingVH> Worklist;
426 for (WeakTrackingVH &I : Worklist) {
lib/Transforms/InstCombine/InstructionCombining.cpp 2273 SmallVectorImpl<WeakTrackingVH> &Users,
2364 SmallVector<WeakTrackingVH, 64> Users;
lib/Transforms/ObjCARC/ProvenanceAnalysis.h 59 DenseMap<const Value *, WeakTrackingVH> UnderlyingObjCPtrCache;
lib/Transforms/Scalar/AlignmentFromAssumptions.cpp 391 for (auto &AssumeVH : AC.assumptions())
lib/Transforms/Scalar/IndVarSimplify.cpp 143 SmallVector<WeakTrackingVH, 16> DeadInsts;
473 WeakTrackingVH WeakPH = PN;
507 SmallVector<WeakTrackingVH, 8> PHIs;
984 SmallVectorImpl<WeakTrackingVH> &DeadInsts;
1028 DominatorTree *DTree, SmallVectorImpl<WeakTrackingVH> &DI,
lib/Transforms/Scalar/InferAddressSpaces.cpp 172 void inferAddressSpaces(ArrayRef<WeakTrackingVH> Postorder,
181 const TargetTransformInfo &TTI, ArrayRef<WeakTrackingVH> Postorder,
195 std::vector<WeakTrackingVH> collectFlatAddressExpressions(Function &F) const;
340 std::vector<WeakTrackingVH>
389 std::vector<WeakTrackingVH> Postorder; // The resultant postorder.
636 std::vector<WeakTrackingVH> Postorder = collectFlatAddressExpressions(F);
651 ArrayRef<WeakTrackingVH> Postorder,
873 const TargetTransformInfo &TTI, ArrayRef<WeakTrackingVH> Postorder,
904 for (const WeakTrackingVH &WVH : Postorder) {
lib/Transforms/Scalar/LoopIdiomRecognize.cpp 646 WeakTrackingVH InstPtr(&*I);
lib/Transforms/Scalar/LoopSimplifyCFG.cpp 647 SmallVector<WeakTrackingVH, 16> Blocks(L.blocks());
649 for (auto &Block : Blocks) {
lib/Transforms/Scalar/LoopStrengthReduce.cpp 967 DeleteTriviallyDeadInstructions(SmallVectorImpl<WeakTrackingVH> &DeadInsts) {
1965 SmallVectorImpl<WeakTrackingVH> &DeadInsts);
2043 SmallVectorImpl<WeakTrackingVH> &DeadInsts) const;
2046 SmallVectorImpl<WeakTrackingVH> &DeadInsts) const;
2049 SmallVectorImpl<WeakTrackingVH> &DeadInsts) const;
3139 SmallVectorImpl<WeakTrackingVH> &DeadInsts) {
5130 SmallVectorImpl<WeakTrackingVH> &DeadInsts) const {
5307 SCEVExpander &Rewriter, SmallVectorImpl<WeakTrackingVH> &DeadInsts) const {
5422 SmallVectorImpl<WeakTrackingVH> &DeadInsts) const {
5460 SmallVector<WeakTrackingVH, 16> DeadInsts;
5720 SmallVector<WeakTrackingVH, 16> DeadInsts;
lib/Transforms/Scalar/LoopUnswitch.cpp 1388 WeakTrackingVH LICHandle(LIC);
lib/Transforms/Scalar/LowerConstantIntrinsics.cpp 88 SmallVector<WeakTrackingVH, 8> Worklist;
106 for (WeakTrackingVH &VH: Worklist) {
lib/Transforms/Scalar/Reassociate.cpp 1029 SmallVectorImpl<WeakTrackingVH> &Ops) {
1601 SmallVector<WeakTrackingVH, 4> NewMulOps;
lib/Transforms/Utils/BasicBlockUtils.cpp 159 SmallVector<WeakTrackingVH, 8> PHIs;
lib/Transforms/Utils/CloneFunction.cpp 304 WeakTrackingVH &BBEntry = VMap[BB];
lib/Transforms/Utils/CodeExtractor.cpp 1614 for (auto AssumeVH : AC->assumptions()) {
lib/Transforms/Utils/InlineFunction.cpp 1496 const ValueMap<const Value *, WeakTrackingVH> *VMap) {
1737 for (auto &VH : InlinedFunctionInfo.OperandBundleCallSites) {
lib/Transforms/Utils/Local.cpp 653 WeakTrackingVH PhiIt = &BB->front();
lib/Transforms/Utils/LoopUnroll.cpp 204 SmallVector<WeakTrackingVH, 16> DeadInsts;
lib/Transforms/Utils/PredicateInfo.cpp 506 for (auto &Assume : AC.assumptions()) {
lib/Transforms/Utils/SimplifyIndVar.cpp 58 SmallVectorImpl<WeakTrackingVH> &DeadInsts;
65 SmallVectorImpl<WeakTrackingVH> &Dead)
934 LoopInfo *LI, SmallVectorImpl<WeakTrackingVH> &Dead,
945 LoopInfo *LI, SmallVectorImpl<WeakTrackingVH> &Dead) {
lib/Transforms/Vectorize/SLPVectorizer.cpp 6102 WeakTrackingVH ReductionRoot;
tools/clang/lib/CodeGen/CGDeclCXX.cpp 729 const std::vector<std::tuple<llvm::FunctionType *, llvm::WeakTrackingVH,
tools/clang/lib/CodeGen/CGObjCMac.cpp 915 llvm::WeakTrackingVH ConstantStringClassRef;
tools/clang/lib/CodeGen/CGOpenMPRuntime.h 484 llvm::WeakTrackingVH Addr;
652 llvm::StringMap<llvm::WeakTrackingVH> EmittedNonTargetVariables;
tools/clang/lib/CodeGen/CodeGenFunction.h 3986 const std::vector<std::tuple<llvm::FunctionType *, llvm::WeakTrackingVH,
tools/clang/lib/CodeGen/CodeGenModule.cpp 1898 std::vector<llvm::WeakTrackingVH> &List) {
tools/clang/lib/CodeGen/CodeGenModule.h 383 std::vector<llvm::WeakTrackingVH> LLVMUsed;
384 std::vector<llvm::WeakTrackingVH> LLVMCompilerUsed;
463 std::tuple<llvm::FunctionType *, llvm::WeakTrackingVH, llvm::Constant *>>
484 llvm::WeakTrackingVH CFConstantStringClassRef;
tools/polly/lib/Analysis/ScopBuilder.cpp 1526 for (auto &Assumption : AC.assumptions()) {
unittests/IR/ValueHandleTest.cpp 55 WeakTrackingVH WVH(BitcastV.get());
67 WeakTrackingVH BitcastWVH(BitcastV.get());
68 WeakTrackingVH ConstantWVH(ConstantV);
100 WeakTrackingVH WVH(BitcastV.get());
101 WeakTrackingVH WVH_Copy(WVH);
102 WeakTrackingVH WVH_Recreated(BitcastV.get());
110 WeakTrackingVH WVH(BitcastV.get());
111 WeakTrackingVH WVH_Copy(WVH);
112 WeakTrackingVH WVH_Recreated(BitcastV.get());
363 std::unique_ptr<WeakTrackingVH> ToClear[2];
365 ToClear[0].reset(new WeakTrackingVH(V));
367 ToClear[1].reset(new WeakTrackingVH(V));
381 WeakTrackingVH ShouldBeVisited1(BitcastV.get());
383 WeakTrackingVH ShouldBeVisited2(BitcastV.get());
391 WeakTrackingVH ShouldBeVisited1(BitcastV.get());
393 WeakTrackingVH ShouldBeVisited2(BitcastV.get());
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*;
474 construct(allocator_type& __a, _Up* __p, _Args&&... __args)
474 construct(allocator_type& __a, _Up* __p, _Args&&... __args)
475 { __a.construct(__p, std::forward<_Args>(__args)...); }
486 destroy(allocator_type& __a, _Up* __p)
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/move.h 46 inline _GLIBCXX_CONSTEXPR _Tp*
47 __addressof(_Tp& __r) _GLIBCXX_NOEXCEPT
72 constexpr _Tp&&
73 forward(typename std::remove_reference<_Tp>::type& __t) noexcept
83 constexpr _Tp&&
84 forward(typename std::remove_reference<_Tp>::type&& __t) noexcept
98 move(_Tp&& __t) noexcept
104 : public __and_<__not_<is_nothrow_move_constructible<_Tp>>,
105 is_copy_constructible<_Tp>>::type { };
184 typename enable_if<__and_<__not_<__is_tuple_like<_Tp>>,
185 is_move_constructible<_Tp>,
186 is_move_assignable<_Tp>>::value>::type
187 swap(_Tp& __a, _Tp& __b)
187 swap(_Tp& __a, _Tp& __b)
198 _Tp __tmp = _GLIBCXX_MOVE(__a);
usr/include/c++/7.4.0/bits/predefined_ops.h 64 operator()(_Iterator __it, _Value& __val) const
89 operator()(_Value& __val, _Iterator __it) const
usr/include/c++/7.4.0/bits/ptr_traits.h 126 typedef _Tp* pointer;
128 typedef _Tp element_type;
141 pointer_to(__make_not_void<element_type>& __r) noexcept
141 pointer_to(__make_not_void<element_type>& __r) noexcept
usr/include/c++/7.4.0/bits/stl_algo.h 3900 const _Tp& __val)
usr/include/c++/7.4.0/bits/stl_construct.h 74 _Construct(_T1* __p, _Args&&... __args)
74 _Construct(_T1* __p, _Args&&... __args)
75 { ::new(static_cast<void*>(__p)) _T1(std::forward<_Args>(__args)...); }
75 { ::new(static_cast<void*>(__p)) _T1(std::forward<_Args>(__args)...); }
97 _Destroy(_Tp* __pointer)
204 allocator<_Tp>&)
usr/include/c++/7.4.0/bits/stl_heap.h 129 _Distance __holeIndex, _Distance __topIndex, _Tp __value,
215 _Distance __len, _Tp __value, _Compare __comp)
usr/include/c++/7.4.0/bits/stl_iterator.h 1224 __make_move_if_noexcept_iterator(_Tp* __i)
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_pair.h 100 return __and_<is_constructible<_T1, const _U1&>,
100 return __and_<is_constructible<_T1, const _U1&>,
101 is_constructible<_T2, const _U2&>>::value;
101 is_constructible<_T2, const _U2&>>::value;
107 return __and_<is_convertible<const _U1&, _T1>,
107 return __and_<is_convertible<const _U1&, _T1>,
108 is_convertible<const _U2&, _T2>>::value;
108 is_convertible<const _U2&, _T2>>::value;
114 return __and_<is_constructible<_T1, _U1&&>,
114 return __and_<is_constructible<_T1, _U1&&>,
115 is_constructible<_T2, _U2&&>>::value;
115 is_constructible<_T2, _U2&&>>::value;
121 return __and_<is_convertible<_U1&&, _T1>,
121 return __and_<is_convertible<_U1&&, _T1>,
122 is_convertible<_U2&&, _T2>>::value;
122 is_convertible<_U2&&, _T2>>::value;
128 using __do_converts = __and_<is_convertible<const _U1&, _T1>,
128 using __do_converts = __and_<is_convertible<const _U1&, _T1>,
129 is_convertible<_U2&&, _T2>>;
129 is_convertible<_U2&&, _T2>>;
133 return __and_<is_constructible<_T1, const _U1&>,
133 return __and_<is_constructible<_T1, const _U1&>,
134 is_constructible<_T2, _U2&&>,
134 is_constructible<_T2, _U2&&>,
142 using __do_converts = __and_<is_convertible<_U1&&, _T1>,
142 using __do_converts = __and_<is_convertible<_U1&&, _T1>,
143 is_convertible<const _U2&, _T2>>;
143 is_convertible<const _U2&, _T2>>;
147 return __and_<is_constructible<_T1, _U1&&>,
147 return __and_<is_constructible<_T1, _U1&&>,
148 is_constructible<_T2, const _U2&&>,
148 is_constructible<_T2, const _U2&&>,
209 : private __pair_base<_T1, _T2>
209 : private __pair_base<_T1, _T2>
211 typedef _T1 first_type; /// @c first_type is the first bound type
212 typedef _T2 second_type; /// @c second_type is the second bound type
214 _T1 first; /// @c first is a copy of the first object
215 _T2 second; /// @c second is a copy of the second object
252 using _PCCP = _PCC<true, _T1, _T2>;
252 using _PCCP = _PCC<true, _T1, _T2>;
260 constexpr pair(const _T1& __a, const _T2& __b)
260 constexpr pair(const _T1& __a, const _T2& __b)
269 explicit constexpr pair(const _T1& __a, const _T2& __b)
269 explicit constexpr pair(const _T1& __a, const _T2& __b)
283 _T1, _T2>;
283 _T1, _T2>;
291 constexpr pair(const pair<_U1, _U2>& __p)
291 constexpr pair(const pair<_U1, _U2>& __p)
311 constexpr pair(_U1&& __x, const _T2& __y)
311 constexpr pair(_U1&& __x, const _T2& __y)
318 explicit constexpr pair(_U1&& __x, const _T2& __y)
325 constexpr pair(const _T1& __x, _U2&& __y)
325 constexpr pair(const _T1& __x, _U2&& __y)
332 explicit pair(const _T1& __x, _U2&& __y)
341 constexpr pair(_U1&& __x, _U2&& __y)
341 constexpr pair(_U1&& __x, _U2&& __y)
342 : first(std::forward<_U1>(__x)), second(std::forward<_U2>(__y)) { }
360 constexpr pair(pair<_U1, _U2>&& __p)
360 constexpr pair(pair<_U1, _U2>&& __p)
361 : first(std::forward<_U1>(__p.first)),
379 __and_<is_copy_assignable<_T1>,
380 is_copy_assignable<_T2>>::value,
390 __and_<is_move_assignable<_T1>,
391 is_move_assignable<_T2>>::value,
402 typename enable_if<__and_<is_assignable<_T1&, const _U1&>,
402 typename enable_if<__and_<is_assignable<_T1&, const _U1&>,
403 is_assignable<_T2&, const _U2&>>::value,
403 is_assignable<_T2&, const _U2&>>::value,
405 operator=(const pair<_U1, _U2>& __p)
405 operator=(const pair<_U1, _U2>& __p)
413 typename enable_if<__and_<is_assignable<_T1&, _U1&&>,
413 typename enable_if<__and_<is_assignable<_T1&, _U1&&>,
414 is_assignable<_T2&, _U2&&>>::value,
414 is_assignable<_T2&, _U2&&>>::value,
416 operator=(pair<_U1, _U2>&& __p)
416 operator=(pair<_U1, _U2>&& __p)
523 typename __decay_and_strip<_T2>::__type>
524 make_pair(_T1&& __x, _T2&& __y)
524 make_pair(_T1&& __x, _T2&& __y)
527 typedef typename __decay_and_strip<_T2>::__type __ds_type2;
529 return __pair_type(std::forward<_T1>(__x), std::forward<_T2>(__y));
usr/include/c++/7.4.0/bits/stl_uninitialized.h 288 _ForwardIterator __result, allocator<_Tp>&)
644 allocator<_Tp>&)
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*
962 emplace_back(_Args&&... __args);
1483 _M_realloc_insert(iterator __position, _Args&&... __args);
1561 _Up*
1562 _M_data_ptr(_Up* __ptr) const _GLIBCXX_NOEXCEPT
usr/include/c++/7.4.0/bits/unique_ptr.h 68 default_delete(const default_delete<_Up>&) noexcept { }
72 operator()(_Tp* __ptr) const
74 static_assert(!is_void<_Tp>::value,
76 static_assert(sizeof(_Tp)>0,
122 using type = _Up*;
137 using pointer = typename _Ptr<_Tp, _Dp>::type;
161 typename __uniq_ptr_impl<_Tp, _Up>::_DeleterConstraint::type;
163 __uniq_ptr_impl<_Tp, _Dp> _M_t;
166 using pointer = typename __uniq_ptr_impl<_Tp, _Dp>::pointer;
167 using element_type = _Tp;
252 unique_ptr(unique_ptr<_Up, _Ep>&& __u) noexcept
297 __safe_conversion_up<_Up, _Ep>,
301 operator=(unique_ptr<_Up, _Ep>&& __u) noexcept
usr/include/c++/7.4.0/bits/vector.tcc 101 std::forward<_Args>(__args)...);
105 _M_realloc_insert(end(), std::forward<_Args>(__args)...);
418 std::forward<_Args>(__args)...);
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;
84 new_allocator(const new_allocator<_Tp1>&) _GLIBCXX_USE_NOEXCEPT { }
111 return static_cast<_Tp*>(::operator new(__n * sizeof(_Tp)));
130 { return size_t(-1) / sizeof(_Tp); }
135 construct(_Up* __p, _Args&&... __args)
135 construct(_Up* __p, _Args&&... __args)
136 { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); }
136 { ::new((void *)__p) _Up(std::forward<_Args>(__args)...); }
140 destroy(_Up* __p) { __p->~_Up(); }
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/tuple 56 struct __is_empty_non_tuple : is_empty<_Tp> { };
125 constexpr _Head_base(const _Head& __h)
132 constexpr _Head_base(_UHead&& __h)
133 : _M_head_impl(std::forward<_UHead>(__h)) { }
159 static constexpr _Head&
162 static constexpr const _Head&
165 _Head _M_head_impl;
186 : public _Tuple_impl<_Idx + 1, _Tail...>,
187 private _Head_base<_Idx, _Head>
191 typedef _Tuple_impl<_Idx + 1, _Tail...> _Inherited;
192 typedef _Head_base<_Idx, _Head> _Base;
194 static constexpr _Head&
197 static constexpr const _Head&
210 constexpr _Tuple_impl(const _Head& __head, const _Tail&... __tail)
210 constexpr _Tuple_impl(const _Head& __head, const _Tail&... __tail)
227 _Base(std::forward<_Head>(_M_head(__in))) { }
230 constexpr _Tuple_impl(const _Tuple_impl<_Idx, _UElements...>& __in)
235 constexpr _Tuple_impl(_Tuple_impl<_Idx, _UHead, _UTails...>&& __in)
235 constexpr _Tuple_impl(_Tuple_impl<_Idx, _UHead, _UTails...>&& __in)
248 const _Head& __head, const _Tail&... __tail)
248 const _Head& __head, const _Tail&... __tail)
313 _M_head(*this) = _Tuple_impl<_Idx, _UElements...>::_M_head(__in);
314 _M_tail(*this) = _Tuple_impl<_Idx, _UElements...>::_M_tail(__in);
473 return __and_<is_constructible<_Elements, const _UElements&>...>::value;
473 return __and_<is_constructible<_Elements, const _UElements&>...>::value;
479 return __and_<is_convertible<const _UElements&, _Elements>...>::value;
479 return __and_<is_convertible<const _UElements&, _Elements>...>::value;
485 return __and_<is_constructible<_Elements, _UElements&&>...>::value;
485 return __and_<is_constructible<_Elements, _UElements&&>...>::value;
491 return __and_<is_convertible<_UElements&&, _Elements>...>::value;
491 return __and_<is_convertible<_UElements&&, _Elements>...>::value;
508 return __not_<is_same<tuple<_Elements...>,
556 class tuple : public _Tuple_impl<0, _Elements...>
558 typedef _Tuple_impl<0, _Elements...> _Inherited;
598 _Elements...>;
608 constexpr tuple(const _Elements&... __elements)
619 explicit constexpr tuple(const _Elements&... __elements)
628 _Elements...>;
636 _Elements...>;
668 _Elements...>;
730 const _Elements&... __elements)
741 const _Elements&... __elements)
853 operator=(const tuple<_UElements...>& __in)
863 operator=(tuple<_UElements...>&& __in)
usr/include/c++/7.4.0/type_traits 215 : public __is_void_helper<typename remove_cv<_Tp>::type>::type
326 : public __is_integral_helper<typename remove_cv<_Tp>::type>::type
354 : public __is_floating_point_helper<typename remove_cv<_Tp>::type>::type
381 : public __is_pointer_helper<typename remove_cv<_Tp>::type>::type
567 : public __is_null_pointer_helper<typename remove_cv<_Tp>::type>::type
581 : public __or_<is_lvalue_reference<_Tp>,
582 is_rvalue_reference<_Tp>>::type
588 : public __or_<is_integral<_Tp>, is_floating_point<_Tp>>::type
588 : public __or_<is_integral<_Tp>, is_floating_point<_Tp>>::type
601 : public __not_<__or_<is_function<_Tp>, is_reference<_Tp>,
601 : public __not_<__or_<is_function<_Tp>, is_reference<_Tp>,
602 is_void<_Tp>>>::type
611 : public __or_<is_arithmetic<_Tp>, is_enum<_Tp>, is_pointer<_Tp>,
611 : public __or_<is_arithmetic<_Tp>, is_enum<_Tp>, is_pointer<_Tp>,
611 : public __or_<is_arithmetic<_Tp>, is_enum<_Tp>, is_pointer<_Tp>,
612 is_member_pointer<_Tp>, is_null_pointer<_Tp>>::type
612 is_member_pointer<_Tp>, is_null_pointer<_Tp>>::type
631 : public __is_member_pointer_helper<typename remove_cv<_Tp>::type>::type
638 : public __or_<is_object<_Tp>, is_reference<_Tp>>::type
638 : public __or_<is_object<_Tp>, is_reference<_Tp>>::type
762 typename add_rvalue_reference<_Tp>::type declval() noexcept;
777 : public __and_<is_array<_Tp>, __not_<extent<_Tp>>>
777 : public __and_<is_array<_Tp>, __not_<extent<_Tp>>>
798 typedef decltype(__test<_Tp>(0)) type;
811 remove_all_extents<_Tp>::type>::type
825 : public __is_destructible_safe<_Tp>::type
889 typedef decltype(__test<_Tp>(0)) type;
894 : public __and_<__not_<is_void<_Tp>>,
895 __is_default_constructible_impl<_Tp>>
915 : public __is_default_constructible_atom<_Tp>::type
921 : public __is_default_constructible_safe<_Tp>::type
984 typedef decltype(__test<_Tp, _Arg>(0)) type;
989 : public __and_<is_destructible<_Tp>,
990 __is_direct_constructible_impl<_Tp, _Arg>>
1072 __is_direct_constructible_ref_cast<_Tp, _Arg>,
1073 __is_direct_constructible_new_safe<_Tp, _Arg>
1079 : public __is_direct_constructible_new<_Tp, _Arg>::type
1119 : public __is_direct_constructible<_Tp, _Arg>
1130 : public __is_constructible_impl<_Tp, _Args...>::type
1142 : public is_constructible<_Tp, const _Tp&>
1142 : public is_constructible<_Tp, const _Tp&>
1148 : public __is_copy_constructible_impl<_Tp>
1160 : public is_constructible<_Tp, _Tp&&>
1160 : public is_constructible<_Tp, _Tp&&>
1166 : public __is_move_constructible_impl<_Tp>
1215 : public __and_<is_constructible<_Tp, _Args...>,
1216 __is_nt_constructible_impl<_Tp, _Args...>>
1246 : public is_nothrow_constructible<_Tp, _Tp&&>
1246 : public is_nothrow_constructible<_Tp, _Tp&&>
1252 : public __is_nothrow_move_constructible_impl<_Tp>
1286 : public is_assignable<_Tp&, const _Tp&>
1286 : public is_assignable<_Tp&, const _Tp&>
1292 : public __is_copy_assignable_impl<_Tp>
1304 : public is_assignable<_Tp&, _Tp&&>
1304 : public is_assignable<_Tp&, _Tp&&>
1310 : public __is_move_assignable_impl<_Tp>
1377 static void __helper(const _Tp&);
1380 static true_type __test(const _Tp&,
1381 decltype(__helper<const _Tp&>({}))* = 0);
1390 typedef decltype(__test(declval<_Tp>())) type;
1395 : public __is_implicitly_default_constructible_impl<_Tp>::type
1400 : public __and_<is_default_constructible<_Tp>,
1401 __is_implicitly_default_constructible_safe<_Tp>>
1526 static void __test_aux(_To1);
1538 typedef decltype(__test<_From, _To>(0)) type;
1545 : public __is_convertible_helper<_From, _To>::type
1554 { typedef _Tp type; };
1563 { typedef _Tp type; };
1574 remove_const<typename remove_volatile<_Tp>::type>::type type;
1629 { typedef _Tp type; };
1633 { typedef _Tp type; };
1645 { typedef _Tp& type; };
1650 : public __add_lvalue_reference_helper<_Tp>
1659 { typedef _Tp&& type; };
1664 : public __add_rvalue_reference_helper<_Tp>
1955 { typedef _Tp type; };
2104 { typedef typename remove_cv<_Up>::type __type; };
2118 typedef typename remove_reference<_Tp>::type __remove_type;
2131 typedef _Tp __type;
2144 typename decay<_Tp>::type>::__type __type;
2171 { typedef _Iffalse type; };
2574 typename remove_reference<_Tp>::type>::type>::type
usr/include/c++/7.4.0/utility 209 __get(std::pair<_Tp1, _Tp2>& __pair) noexcept
224 constexpr typename tuple_element<_Int, std::pair<_Tp1, _Tp2>>::type&
225 get(std::pair<_Tp1, _Tp2>& __in) noexcept
229 constexpr typename tuple_element<_Int, std::pair<_Tp1, _Tp2>>::type&&
230 get(std::pair<_Tp1, _Tp2>&& __in) noexcept
234 constexpr const typename tuple_element<_Int, std::pair<_Tp1, _Tp2>>::type&
235 get(const std::pair<_Tp1, _Tp2>& __in) noexcept
utils/unittest/googletest/include/gtest/gtest-printers.h 140 static void PrintValue(const T& value, ::std::ostream* os) {
205 ::std::basic_ostream<Char, CharTraits>& os, const T& x) {
206 TypeWithoutFormatter<T,
207 (internal::IsAProtocolMessage<T>::value ? kProtobuf :
208 internal::ImplicitlyConvertible<const T&, internal::BiggestInt>::value ?
223 void DefaultPrintNonContainerTo(const T& value, ::std::ostream* os) {
276 static ::std::string Format(const ToPrint& value) {
351 const T1& value, const T2& /* other_operand */) {
351 const T1& value, const T2& /* other_operand */) {
352 return FormatForComparison<T1, T2>::Format(value);
352 return FormatForComparison<T1, T2>::Format(value);
366 void UniversalPrint(const T& value, ::std::ostream* os);
373 const C& container, ::std::ostream* os) {
439 const T& value, ::std::ostream* os) {
455 void PrintTo(const T& value, ::std::ostream* os) {
478 DefaultPrintTo(IsContainerTest<T>(0), is_pointer<T>(), value, os);
699 static void Print(const T& value, ::std::ostream* os) {
784 static void Print(const T& value, ::std::ostream* os) {
856 typedef T T1;
983 internal::UniversalTersePrinter<T>::Print(value, &ss);
utils/unittest/googletest/include/gtest/gtest.h 1377 const T1& lhs, const T2& rhs) {
1390 const T2& rhs) {
1420 const T2& rhs) {
utils/unittest/googletest/include/gtest/internal/custom/raw-ostream.h 29 static const T& printable(const T& V) { return V; }
29 static const T& printable(const T& V) { return V; }
35 auto printable(const T &V) -> decltype(StreamSwitch<T>::printable(V)) {
35 auto printable(const T &V) -> decltype(StreamSwitch<T>::printable(V)) {
37 return StreamSwitch<T>::printable(V);
utils/unittest/googletest/include/gtest/internal/gtest-internal.h 94 ::std::string PrintToString(const T& value);