|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
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) {
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() {
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) {
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/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/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;
lib/Transforms/Scalar/LoopStrengthReduce.cpp 1007 const LSRUse &LU, const Formula &F);
1011 const LSRUse &LU, const Formula &F,
1056 void RateFormula(const Formula &F,
1066 void RateRegister(const Formula &F, const SCEV *Reg,
1068 void RatePrimaryRegister(const Formula &F, const SCEV *Reg,
1177 SmallVector<Formula, 12> Formulae;
1197 bool HasFormulaWithSameRegs(const Formula &F) const;
1199 bool InsertFormula(const Formula &F, const Loop &L);
1200 void DeleteFormula(Formula &F);
1236 void Cost::RateRegister(const Formula &F, const SCEV *Reg,
1308 void Cost::RatePrimaryRegister(const Formula &F, const SCEV *Reg,
1322 void Cost::RateFormula(const Formula &F,
1514 bool LSRUse::HasFormulaWithSameRegs(const Formula &F) const {
1525 for (const Formula &F : Formulae)
1533 bool LSRUse::InsertFormula(const Formula &F, const Loop &L) {
1567 void LSRUse::DeleteFormula(Formula &F) {
1578 for (const Formula &F : Formulae) {
1706 const Formula &F, const Loop &L) {
1736 MemAccessTy AccessTy, const Formula &F) {
1742 const LSRUse &LU, const Formula &F) {
1759 const LSRUse &LU, const Formula &F,
1982 LSRUse *FindUseWithSimilarFormula(const Formula &F, const LSRUse &OrigLU);
1986 void CountRegisters(const Formula &F, size_t LUIdx);
1987 bool InsertFormula(LSRUse &LU, unsigned LUIdx, const Formula &F);
1991 void GenerateReassociations(LSRUse &LU, unsigned LUIdx, Formula Base,
1995 const Formula &Base, unsigned Depth,
1997 void GenerateCombinations(LSRUse &LU, unsigned LUIdx, Formula Base);
1999 const Formula &Base, size_t Idx,
2001 void GenerateSymbolicOffsets(LSRUse &LU, unsigned LUIdx, Formula Base);
2003 const Formula &Base,
2006 void GenerateConstantOffsets(LSRUse &LU, unsigned LUIdx, Formula Base);
2007 void GenerateICmpZeroScales(LSRUse &LU, unsigned LUIdx, Formula Base);
2008 void GenerateScales(LSRUse &LU, unsigned LUIdx, Formula Base);
2009 void GenerateTruncates(LSRUse &LU, unsigned LUIdx, Formula Base);
2024 void SolveRecurse(SmallVectorImpl<const Formula *> &Solution,
2026 SmallVectorImpl<const Formula *> &Workspace,
2030 void Solve(SmallVectorImpl<const Formula *> &Solution) const;
2041 Value *Expand(const LSRUse &LU, const LSRFixup &LF, const Formula &F,
2045 const Formula &F, SCEVExpander &Rewriter,
2047 void Rewrite(const LSRUse &LU, const LSRFixup &LF, const Formula &F,
2050 void ImplementSolution(const SmallVectorImpl<const Formula *> &Solution);
2612 LSRInstance::FindUseWithSimilarFormula(const Formula &OrigF,
2628 for (const Formula &F : LU.Formulae) {
3343 Formula F;
3354 Formula F;
3362 void LSRInstance::CountRegisters(const Formula &F, size_t LUIdx) {
3371 bool LSRInstance::InsertFormula(LSRUse &LU, unsigned LUIdx, const Formula &F) {
3570 const Formula &Base,
3618 Formula F = Base;
3663 Formula Base, unsigned Depth) {
3680 Formula Base) {
3690 Formula NewBase = Base;
3711 Formula F = NewBase;
3743 const Formula &Base, size_t Idx,
3749 Formula F = Base;
3762 Formula Base) {
3775 LSRUse &LU, unsigned LUIdx, const Formula &Base,
3779 Formula F = Base;
3834 Formula F = Base;
3847 Formula Base) {
3865 Formula Base) {
3909 Formula F = Base;
3957 void LSRInstance::GenerateScales(LSRUse &LU, unsigned LUIdx, Formula Base) {
4002 Formula F = Base;
4023 void LSRInstance::GenerateTruncates(LSRUse &LU, unsigned LUIdx, Formula Base) {
4034 Formula F = Base;
4196 Formula F = LU.Formulae[L];
4209 Formula NewF = F;
4234 Formula NewF = F;
4332 Formula &F = LU.Formulae[FIdx];
4372 Formula &Best = LU.Formulae[P.first->second];
4441 Formula &F = LU.Formulae[i];
4448 Formula NewF = F;
4466 Formula NewF = F;
4506 for (const Formula &F : LU.Formulae) {
4532 Formula &F = LUThatHas->Formulae[i];
4639 Formula &F = LU.Formulae[FIdx];
4646 Formula &Best = LU.Formulae[P.first->second];
4763 Formula &F = LU.Formulae[i];
4801 Formula &F = LU.Formulae[0];
4855 Formula &F = LU.Formulae[i];
4892 void LSRInstance::SolveRecurse(SmallVectorImpl<const Formula *> &Solution,
4894 SmallVectorImpl<const Formula *> &Workspace,
4921 for (const Formula &F : LU.Formulae) {
4969 void LSRInstance::Solve(SmallVectorImpl<const Formula *> &Solution) const {
4970 SmallVector<const Formula *, 8> Workspace;
5128 const Formula &F, BasicBlock::iterator IP,
5306 PHINode *PN, const LSRUse &LU, const LSRFixup &LF, const Formula &F,
5421 const Formula &F, SCEVExpander &Rewriter,
5457 const SmallVectorImpl<const Formula *> &Solution) {
5585 SmallVector<const Formula *, 8> Solution;
5599 for (const Formula &F : LU.Formulae)
5646 for (const Formula &F : LU.Formulae) {
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
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/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)
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/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
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
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>
1304 : public is_assignable<_Tp&, _Tp&&>
1304 : public is_assignable<_Tp&, _Tp&&>
1310 : public __is_move_assignable_impl<_Tp>
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; };
1955 { typedef _Tp type; };
2574 typename remove_reference<_Tp>::type>::type>::type