|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
Declarations
include/llvm/CodeGen/GlobalISel/RegBankSelect.h 78 class BlockFrequency;
include/llvm/Transforms/Utils/CodeExtractor.h 27 class BlockFrequency;
References
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>;
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) {
516 ValueArgs &&... Values) {
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>;
1163 using ConstIterator = DenseMapIterator<KeyT, ValueT, KeyInfoT, Bucket, true>;
1199 const DenseMapIterator<KeyT, ValueT, KeyInfoT, Bucket, IsConstSrc> &I)
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 *;
259 class SmallVectorTemplateBase<T, true> : public SmallVectorTemplateCommon<T> {
264 static void destroy_range(T *, T *) {}
264 static void destroy_range(T *, T *) {}
299 void grow(size_t MinSize = 0) { this->grow_pod(MinSize, sizeof(T)); }
302 void push_back(const T &Elt) {
315 class SmallVectorImpl : public SmallVectorTemplateBase<T> {
316 using SuperClass = SmallVectorTemplateBase<T>;
352 new (&*I) T();
357 void resize(size_type N, const T &NV) {
374 LLVM_NODISCARD T pop_back_val() {
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) {
641 template <typename... ArgTypes> reference emplace_back(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/Analysis/BlockFrequencyInfo.h 65 BlockFrequency getBlockFreq(const BasicBlock *BB) const;
97 raw_ostream &printBlockFreq(raw_ostream &OS, const BlockFrequency Freq) const;
include/llvm/Analysis/BlockFrequencyInfoImpl.h 521 BlockFrequency getBlockFreq(const BlockNode &Node) const;
534 const BlockFrequency &Freq) const;
968 BlockFrequency getBlockFreq(const BlockT *BB) const {
1398 BlockFrequency Freq = Graph->getBlockFreq(Node);
1399 BlockFrequency HotFreq =
1400 (BlockFrequency(MaxFrequency) *
1459 BlockFrequency EFreq = BFI->getBlockFreq(Node) * BP;
1460 BlockFrequency HotFreq = BlockFrequency(MaxFrequency) *
1460 BlockFrequency HotFreq = BlockFrequency(MaxFrequency) *
include/llvm/CodeGen/GlobalISel/RegBankSelect.h 442 MappingCost(const BlockFrequency &LocalFreq);
include/llvm/CodeGen/MachineBlockFrequencyInfo.h 62 BlockFrequency getBlockFreq(const MachineBasicBlock *MBB) const;
75 raw_ostream &printBlockFreq(raw_ostream &OS, const BlockFrequency Freq) const;
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/BlockFrequency.h 39 BlockFrequency &operator*=(BranchProbability Prob);
40 BlockFrequency operator*(BranchProbability Prob) const;
44 BlockFrequency &operator/=(BranchProbability Prob);
45 BlockFrequency operator/(BranchProbability Prob) const;
48 BlockFrequency &operator+=(BlockFrequency Freq);
48 BlockFrequency &operator+=(BlockFrequency Freq);
49 BlockFrequency operator+(BlockFrequency Freq) const;
49 BlockFrequency operator+(BlockFrequency Freq) const;
52 BlockFrequency &operator-=(BlockFrequency Freq);
52 BlockFrequency &operator-=(BlockFrequency Freq);
53 BlockFrequency operator-(BlockFrequency Freq) const;
53 BlockFrequency operator-(BlockFrequency Freq) const;
56 BlockFrequency &operator>>=(const unsigned count);
58 bool operator<(BlockFrequency RHS) const {
62 bool operator<=(BlockFrequency RHS) const {
66 bool operator>(BlockFrequency RHS) const {
70 bool operator>=(BlockFrequency RHS) const {
74 bool operator==(BlockFrequency RHS) const {
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;
include/llvm/Transforms/Utils/CodeExtractor.h 223 DenseMap<BasicBlock *, BlockFrequency> &ExitWeights,
lib/Analysis/BlockFrequencyInfo.cpp 201 BlockFrequency BlockFrequencyInfo::getBlockFreq(const BasicBlock *BB) const {
268 printBlockFreq(raw_ostream &OS, const BlockFrequency Freq) const {
lib/Analysis/BlockFrequencyInfoImpl.cpp 551 BlockFrequency
623 const BlockFrequency &Freq) const {
lib/Analysis/InlineCost.cpp 825 auto CallSiteFreq = CallerBFI->getBlockFreq(CallSiteBB);
826 auto CallerEntryFreq =
lib/CodeGen/BranchFolding.cpp 555 BlockFrequency
566 BlockFrequency F) {
578 const BlockFrequency Freq) const {
1224 SmallVector<BlockFrequency, 2> EdgeFreqLs(TailMBB.succ_size());
1225 BlockFrequency AccumulatedMBBFreq;
1232 BlockFrequency BlockFreq = MBBFreqInfo.getBlockFreq(SrcMBB);
lib/CodeGen/BranchFolding.h 140 BlockFrequency getBlockFreq(const MachineBasicBlock *MBB) const;
141 void setBlockFreq(const MachineBasicBlock *MBB, BlockFrequency F);
145 const BlockFrequency Freq) const;
151 DenseMap<const MachineBasicBlock *, BlockFrequency> MergedBBFreq;
lib/CodeGen/CodeGenPrepare.cpp 739 BlockFrequency PredFreq = BFI->getBlockFreq(Pred);
740 BlockFrequency BBFreq = BFI->getBlockFreq(BB);
lib/CodeGen/GlobalISel/RegBankSelect.cpp 937 RegBankSelect::MappingCost::MappingCost(const BlockFrequency &LocalFreq)
lib/CodeGen/InlineSpiller.cpp 1378 BlockFrequency &SubTreeCost = SpillsInSubTreeMap[*RIt].second;
1388 BlockFrequency &SubTreeCost = SpillsInSubTreeMap[*RIt].second;
lib/CodeGen/LiveIntervals.cpp 862 BlockFrequency Freq = MBFI->getBlockFreq(MBB);
lib/CodeGen/MachineBlockFrequencyInfo.cpp 226 BlockFrequency
259 const BlockFrequency Freq) const {
lib/CodeGen/MachineBlockPlacement.cpp 327 BlockFrequency Weight;
459 BlockFrequency TopFallThroughFreq(const MachineBasicBlock *Top,
461 BlockFrequency FallThroughGains(const MachineBasicBlock *NewTop,
471 BlockFrequency &ExitFreq);
476 BlockFrequency ExitFreq, const BlockFilterSet &LoopBlockSet);
724 static bool greaterWithBias(BlockFrequency A, BlockFrequency B,
724 static bool greaterWithBias(BlockFrequency A, BlockFrequency B,
727 BlockFrequency Gain = A - B;
769 auto BBFreq = MBFI->getBlockFreq(BB);
770 auto SuccFreq = MBFI->getBlockFreq(Succ);
771 BlockFrequency P = BBFreq * PProb;
772 BlockFrequency Qout = BBFreq * QProb;
793 auto SuccBestPred = BlockFrequency(0);
799 auto Freq = MBFI->getBlockFreq(SuccPred)
805 BlockFrequency Qin = SuccBestPred;
828 BlockFrequency F = SuccFreq - Qin;
829 BlockFrequency V = SuccFreq * VProb;
830 BlockFrequency QinU = std::min(Qin, F) * UProb;
831 BlockFrequency BaseCost = P + V;
832 BlockFrequency DupCost = Qout + QinU + std::max(Qin, F) * VProb;
837 BlockFrequency U = SuccFreq * UProb;
838 BlockFrequency V = SuccFreq * VProb;
839 BlockFrequency F = SuccFreq - Qin;
964 BlockFrequency BestAScore = BestA->Weight + SecondBestB->Weight;
965 BlockFrequency BestBScore = BestB->Weight + SecondBestA->Weight;
1012 BlockFrequency EdgeFreq = MBFI->getBlockFreq(SuccPred) *
1416 BlockFrequency CandidateEdgeFreq = MBFI->getBlockFreq(BB) * RealSuccProb;
1441 BlockFrequency PredEdgeFreq =
1599 BlockFrequency BestFreq;
1611 BlockFrequency CandidateFreq = MBFI->getBlockFreq(MBB);
1804 BlockFrequency
1808 BlockFrequency MaxFreq = 0;
1829 BlockFrequency EdgeFreq = MBFI->getBlockFreq(Pred) *
1860 BlockFrequency
1866 BlockFrequency FallThrough2Top = TopFallThroughFreq(OldTop, LoopBlockSet);
1867 BlockFrequency FallThrough2Exit = 0;
1871 BlockFrequency BackEdgeFreq = MBFI->getBlockFreq(NewTop) *
1876 BlockFrequency FallThroughFromPred = 0;
1882 BlockFrequency EdgeFreq = MBFI->getBlockFreq(Pred) *
1893 BlockFrequency NewFreq = 0;
1904 BlockFrequency EdgeFreq = MBFI->getBlockFreq(BestPred) *
1909 BlockFrequency OrigEdgeFreq = MBFI->getBlockFreq(BestPred) *
1920 BlockFrequency Result = 0;
1921 BlockFrequency Gains = BackEdgeFreq + NewFreq;
1922 BlockFrequency Lost = FallThrough2Top + FallThrough2Exit +
1966 BlockFrequency BestGains = 0;
1989 BlockFrequency Gains = FallThroughGains(Pred, OldTop, OtherBB,
2050 BlockFrequency &ExitFreq) {
2063 BlockFrequency BestExitEdgeFreq;
2085 BlockFrequency OldBestExitEdgeFreq = BestExitEdgeFreq;
2115 BlockFrequency ExitEdgeFreq = MBFI->getBlockFreq(MBB) * SuccProb;
2206 BlockFrequency ExitFreq,
2233 BlockFrequency FallThrough2Top = TopFallThroughFreq(Top, LoopBlockSet);
2293 BlockFrequency SmallestRotationCost = BlockFrequency::getMaxFrequency();
2293 BlockFrequency SmallestRotationCost = BlockFrequency::getMaxFrequency();
2309 BlockFrequency HeaderFallThroughCost(0);
2315 auto EdgeFreq = MBFI->getBlockFreq(Pred) *
2317 auto FallThruCost = ScaleBlockFrequency(EdgeFreq, MisfetchCost);
2330 SmallVector<std::pair<MachineBasicBlock *, BlockFrequency>, 4> ExitsWithFreq;
2342 auto ExitFreq = MBFI->getBlockFreq(BB) * LargestExitEdgeProb;
2361 BlockFrequency Cost = 0;
2390 auto TailBBFreq = MBFI->getBlockFreq(TailBB);
2396 auto TailToHeadFreq = TailBBFreq * TailToHeadProb;
2397 auto ColderEdgeFreq = TailToHeadProb > BranchProbability(1, 2)
2440 BlockFrequency LoopFreq(0);
2496 BlockFrequency ExitFreq;
2753 BlockFrequency EntryFreq = MBFI->getBlockFreq(&F->front());
2754 BlockFrequency WeightedEntryFreq = EntryFreq * ColdProb;
2773 BlockFrequency Freq = MBFI->getBlockFreq(ChainBB);
2780 BlockFrequency LoopHeaderFreq = MBFI->getBlockFreq(LoopHeader);
2802 BlockFrequency LayoutEdgeFreq = MBFI->getBlockFreq(LayoutPred) * LayoutProb;
3143 BlockFrequency BlockFreq = MBFI->getBlockFreq(&MBB);
3153 BlockFrequency EdgeFreq =
lib/CodeGen/RegAllocGreedy.cpp 401 BlockFrequency CSRCost;
449 BlockFrequency calcSpillCost();
450 bool addSplitConstraints(InterferenceCache::Cursor, BlockFrequency&);
459 BlockFrequency calcGlobalSplitCost(GlobalSplitCandidate &,
493 BlockFrequency &BestCost,
526 BlockFrequency Freq;
533 HintInfo(BlockFrequency Freq, unsigned Reg, unsigned PhysReg)
538 BlockFrequency getBrokenHintFreq(const HintsInfo &, unsigned);
1187 BlockFrequency &Cost) {
1192 BlockFrequency StaticCost = 0;
1386 BlockFrequency Cost;
1414 BlockFrequency RAGreedy::calcSpillCost() {
1415 BlockFrequency Cost = 0;
1583 BlockFrequency RAGreedy::calcGlobalSplitCost(GlobalSplitCandidate &Cand,
1586 BlockFrequency GlobalCost = 0;
1834 BlockFrequency SpillCost = calcSpillCost();
1835 BlockFrequency BestCost;
1842 BestCost = BlockFrequency::getMaxFrequency();
1874 BlockFrequency &BestCost,
1909 BlockFrequency Cost;
2825 BlockFrequency BestCost = CSRCost; // Don't modify CSRCost.
2896 BlockFrequency RAGreedy::getBrokenHintFreq(const HintsInfo &List,
2898 BlockFrequency Cost = 0;
2960 BlockFrequency OldCopiesCost = getBrokenHintFreq(Info, CurrPhys);
2961 BlockFrequency NewCopiesCost = getBrokenHintFreq(Info, PhysReg);
lib/CodeGen/SpillPlacement.cpp 80 BlockFrequency BiasN;
83 BlockFrequency BiasP;
90 using LinkVector = SmallVector<std::pair<BlockFrequency, unsigned>, 4>;
97 BlockFrequency SumLinkWeights;
115 void clear(const BlockFrequency &Threshold) {
122 void addLink(unsigned b, BlockFrequency w) {
137 void addBias(BlockFrequency freq, BorderConstraint direction) {
148 BiasN = BlockFrequency::getMaxFrequency();
155 bool update(const Node nodes[], const BlockFrequency &Threshold) {
157 BlockFrequency SumN = BiasN;
158 BlockFrequency SumP = BiasP;
253 void SpillPlacement::setThreshold(const BlockFrequency &Entry) {
266 BlockFrequency Freq = BlockFrequencies[I->Number];
288 BlockFrequency Freq = BlockFrequencies[*I];
312 BlockFrequency Freq = BlockFrequencies[Number];
lib/CodeGen/SpillPlacement.h 63 SmallVector<BlockFrequency, 8> BlockFrequencies;
67 BlockFrequency Threshold;
152 BlockFrequency getBlockFrequency(unsigned Number) const {
162 void setThreshold(const BlockFrequency &Entry);
lib/CodeGen/SplitKit.cpp 1012 SmallVector<BlockFrequency, 8> Costs(Parent->getNumValNums());
lib/Support/BlockFrequency.cpp 18 BlockFrequency &BlockFrequency::operator*=(BranchProbability Prob) {
23 BlockFrequency BlockFrequency::operator*(BranchProbability Prob) const {
24 BlockFrequency Freq(Frequency);
29 BlockFrequency &BlockFrequency::operator/=(BranchProbability Prob) {
34 BlockFrequency BlockFrequency::operator/(BranchProbability Prob) const {
35 BlockFrequency Freq(Frequency);
40 BlockFrequency &BlockFrequency::operator+=(BlockFrequency Freq) {
40 BlockFrequency &BlockFrequency::operator+=(BlockFrequency Freq) {
51 BlockFrequency BlockFrequency::operator+(BlockFrequency Freq) const {
51 BlockFrequency BlockFrequency::operator+(BlockFrequency Freq) const {
52 BlockFrequency NewFreq(Frequency);
57 BlockFrequency &BlockFrequency::operator-=(BlockFrequency Freq) {
57 BlockFrequency &BlockFrequency::operator-=(BlockFrequency Freq) {
66 BlockFrequency BlockFrequency::operator-(BlockFrequency Freq) const {
66 BlockFrequency BlockFrequency::operator-(BlockFrequency Freq) const {
67 BlockFrequency NewFreq(Frequency);
72 BlockFrequency &BlockFrequency::operator>>=(const unsigned count) {
lib/Transforms/IPO/GlobalOpt.cpp 2168 auto CallSiteFreq = CallerBFI.getBlockFreq(CallSiteBB);
2169 auto CallerEntryFreq =
lib/Transforms/IPO/PartialInlining.cpp 287 BlockFrequency WeightedOutliningRcost,
723 auto EntryFreq =
725 auto OutliningCallFreq =
762 BlockFrequency WeightedOutliningRcost,
816 BlockFrequency NormWeightedSavings(NonWeightedSavings);
1337 BlockFrequency WeightedRcost;
lib/Transforms/Instrumentation/PGOMemOPSizeOpt.cpp 340 auto OrigBBFreq = BFI.getBlockFreq(BB);
lib/Transforms/Scalar/ConstantHoisting.cpp 260 std::pair<SetVector<BasicBlock *>, BlockFrequency>;
270 BlockFrequency &InsertPtsFreq = InsertPtsMap[Node].second;
287 BlockFrequency &ParentPtsFreq = InsertPtsMap[Parent].second;
lib/Transforms/Scalar/JumpThreading.cpp 1992 auto NewBBFreq =
2110 DenseMap<BasicBlock *, BlockFrequency> FreqMap;
2128 BlockFrequency NewBBFreq(0);
2175 auto BBOrigFreq = BFI->getBlockFreq(BB);
2176 auto NewBBFreq = BFI->getBlockFreq(NewBB);
2177 auto BB2SuccBBFreq = BBOrigFreq * BPI->getEdgeProbability(BB, SuccBB);
2178 auto BBNewFreq = BBOrigFreq - NewBBFreq;
2185 auto SuccFreq = (Succ == SuccBB)
lib/Transforms/Scalar/LoopSink.cpp 82 static BlockFrequency adjustedSumFreq(SmallPtrSetImpl<BasicBlock *> &BBs,
84 BlockFrequency T = 0;
264 const BlockFrequency PreheaderFreq = BFI.getBlockFreq(Preheader);
lib/Transforms/Utils/BreakCriticalEdges.cpp 410 BlockFrequency BlockFreqForDirectSucc;
422 BlockFrequency NewBlockFreqForTarget =
lib/Transforms/Utils/CodeExtractor.cpp 1342 DenseMap<BasicBlock *, BlockFrequency> &ExitWeights,
1397 BlockFrequency EntryFreq;
1423 DenseMap<BasicBlock *, BlockFrequency> ExitWeights;
1431 BlockFrequency &BF = ExitWeights[*SI];
unittests/Support/BlockFrequencyTest.cpp 20 BlockFrequency Freq(1);
31 BlockFrequency Freq(1);
42 BlockFrequency Freq(3);
53 BlockFrequency Freq(UINT64_MAX);
66 BlockFrequency Freq(Big);
77 BlockFrequency Freq(UINT64_MAX);
91 BlockFrequency Freq1(0), Freq2(1);
97 BlockFrequency Freq(0x3333333333333333ULL);
103 BlockFrequency Freq(0x3333333333333333ULL);
120 BlockFrequency Freq(0x10080ULL);
usr/include/c++/7.4.0/bits/algorithmfwd.h 369 const _Tp&
370 max(const _Tp&, const _Tp&);
370 max(const _Tp&, const _Tp&);
382 const _Tp&
383 min(const _Tp&, const _Tp&);
383 min(const _Tp&, const _Tp&);
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
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)...); }
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;
usr/include/c++/7.4.0/bits/stl_numeric.h 119 inline _Tp
120 accumulate(_InputIterator __first, _InputIterator __last, _Tp __init)
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>;
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)) { }
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 144 const _Tp& __x)
182 const _Tp& __x)
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 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>
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; };
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;