|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
Declarations
lib/Transforms/Scalar/LoopStrengthReduce.cpp 993 class LSRUse;
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) {
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() {
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,
1059 const LSRUse &LU,
1210 LSRUse::KindType Kind, MemAccessTy AccessTy,
1325 const LSRUse &LU,
1375 if (LU.Kind == LSRUse::Address && Offset != 0 &&
1376 !isAMCompletelyFolded(*TTI, LSRUse::Address, LU.AccessTy, F.BaseGV,
1411 if (LU.Kind == LSRUse::ICmpZero && !F.hasZeroEnd() &&
1418 if (LU.Kind != LSRUse::ICmpZero)
1629 LSRUse::KindType Kind, MemAccessTy AccessTy,
1634 case LSRUse::Address:
1638 case LSRUse::ICmpZero:
1670 case LSRUse::Basic:
1674 case LSRUse::Special:
1684 LSRUse::KindType Kind, MemAccessTy AccessTy,
1705 LSRUse::KindType Kind, MemAccessTy AccessTy,
1721 int64_t MaxOffset, LSRUse::KindType Kind,
1735 int64_t MaxOffset, LSRUse::KindType Kind,
1742 const LSRUse &LU, const Formula &F) {
1744 if (LU.Kind == LSRUse::Address && TTI.LSRWithInstrQueries()) {
1746 if (!isAMCompletelyFolded(TTI, LSRUse::Address, LU.AccessTy, F.BaseGV,
1759 const LSRUse &LU, const Formula &F,
1771 case LSRUse::Address: {
1784 case LSRUse::ICmpZero:
1785 case LSRUse::Basic:
1786 case LSRUse::Special:
1796 LSRUse::KindType Kind, MemAccessTy AccessTy,
1804 int64_t Scale = Kind == LSRUse::ICmpZero ? -1 : 1;
1819 int64_t MaxOffset, LSRUse::KindType Kind,
1838 int64_t Scale = Kind == LSRUse::ICmpZero ? -1 : 1;
1939 mutable SmallVector<LSRUse, 16> Uses;
1971 using UseMapTy = DenseMap<LSRUse::SCEVUseKindPair, size_t>;
1974 bool reconcileNewOffset(LSRUse &LU, int64_t NewOffset, bool HasBaseReg,
1975 LSRUse::KindType Kind, MemAccessTy AccessTy);
1977 std::pair<size_t, int64_t> getUse(const SCEV *&Expr, LSRUse::KindType Kind,
1980 void DeleteUse(LSRUse &LU, size_t LUIdx);
1982 LSRUse *FindUseWithSimilarFormula(const Formula &F, const LSRUse &OrigLU);
1982 LSRUse *FindUseWithSimilarFormula(const Formula &F, const LSRUse &OrigLU);
1984 void InsertInitialFormula(const SCEV *S, LSRUse &LU, size_t LUIdx);
1985 void InsertSupplementalFormula(const SCEV *S, LSRUse &LU, size_t LUIdx);
1987 bool InsertFormula(LSRUse &LU, unsigned LUIdx, const Formula &F);
1991 void GenerateReassociations(LSRUse &LU, unsigned LUIdx, Formula Base,
1994 void GenerateReassociationsImpl(LSRUse &LU, unsigned LUIdx,
1997 void GenerateCombinations(LSRUse &LU, unsigned LUIdx, Formula Base);
1998 void GenerateSymbolicOffsetsImpl(LSRUse &LU, unsigned LUIdx,
2001 void GenerateSymbolicOffsets(LSRUse &LU, unsigned LUIdx, Formula Base);
2002 void GenerateConstantOffsetsImpl(LSRUse &LU, unsigned LUIdx,
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);
2038 const LSRUse &LU,
2041 Value *Expand(const LSRUse &LU, const LSRFixup &LF, const Formula &F,
2044 void RewriteForPHI(PHINode *PN, const LSRUse &LU, const LSRFixup &LF,
2047 void Rewrite(const LSRUse &LU, const LSRFixup &LF, const Formula &F,
2518 bool LSRInstance::reconcileNewOffset(LSRUse &LU, int64_t NewOffset,
2519 bool HasBaseReg, LSRUse::KindType Kind,
2534 if (Kind == LSRUse::Address) {
2565 LSRUse::KindType Kind,
2582 LSRUse &LU = Uses[LUIdx];
2592 LSRUse &LU = Uses[LUIdx];
2600 void LSRInstance::DeleteUse(LSRUse &LU, size_t LUIdx) {
2611 LSRUse *
2613 const LSRUse &OrigLU) {
2616 LSRUse &LU = Uses[LUIdx];
2623 LU.Kind != LSRUse::ICmpZero &&
3129 if (!isAlwaysFoldable(TTI, LSRUse::Address, AccessTy, /*BaseGV=*/nullptr,
3255 LSRUse::KindType Kind = LSRUse::Basic;
3255 LSRUse::KindType Kind = LSRUse::Basic;
3258 Kind = LSRUse::Address;
3293 Kind = LSRUse::ICmpZero;
3310 LSRUse &LU = Uses[LUIdx];
3338 LSRInstance::InsertInitialFormula(const SCEV *S, LSRUse &LU, size_t LUIdx) {
3353 LSRUse &LU, size_t LUIdx) {
3371 bool LSRInstance::InsertFormula(LSRUse &LU, unsigned LUIdx, const Formula &F) {
3459 S, LSRUse::Basic, MemAccessTy());
3462 LSRUse &LU = Uses[LUIdx];
3544 LSRUse &LU, const SCEV *S, const Loop *L,
3546 if (LU.Kind != LSRUse::Address ||
3569 void LSRInstance::GenerateReassociationsImpl(LSRUse &LU, unsigned LUIdx,
3662 void LSRInstance::GenerateReassociations(LSRUse &LU, unsigned LUIdx,
3679 void LSRInstance::GenerateCombinations(LSRUse &LU, unsigned LUIdx,
3742 void LSRInstance::GenerateSymbolicOffsetsImpl(LSRUse &LU, unsigned LUIdx,
3761 void LSRInstance::GenerateSymbolicOffsets(LSRUse &LU, unsigned LUIdx,
3775 LSRUse &LU, unsigned LUIdx, const Formula &Base,
3813 if (FavorBackedgeIndex && LU.Kind == LSRUse::Address) {
3846 void LSRInstance::GenerateConstantOffsets(LSRUse &LU, unsigned LUIdx,
3864 void LSRInstance::GenerateICmpZeroScales(LSRUse &LU, unsigned LUIdx,
3866 if (LU.Kind != LSRUse::ICmpZero) return;
3957 void LSRInstance::GenerateScales(LSRUse &LU, unsigned LUIdx, Formula Base) {
3978 if (LU.Kind == LSRUse::Basic &&
3979 isLegalUse(TTI, LU.MinOffset, LU.MaxOffset, LSRUse::Special,
3982 LU.Kind = LSRUse::Special;
3988 if (LU.Kind == LSRUse::ICmpZero &&
4023 void LSRInstance::GenerateTruncates(LSRUse &LU, unsigned LUIdx, Formula Base) {
4186 LSRUse &LU = Uses[LUIdx];
4277 LSRUse &LU = Uses[LUIdx];
4284 LSRUse &LU = Uses[LUIdx];
4295 LSRUse &LU = Uses[LUIdx];
4325 LSRUse &LU = Uses[LUIdx];
4413 for (const LSRUse &LU : Uses) {
4438 LSRUse &LU = Uses[LUIdx];
4505 LSRUse &LU = Uses[LUIdx];
4510 LSRUse *LUThatHas = FindUseWithSimilarFormula(F, LU);
4602 LSRUse &LU = Uses[LUIdx];
4735 for (const LSRUse &LU : Uses) {
4752 LSRUse &LU = Uses[LUIdx];
4850 LSRUse &LU = Uses[LUIdx];
4908 const LSRUse &LU = Uses[Workspace.size()];
5065 const LSRUse &LU,
5073 if (LU.Kind == LSRUse::ICmpZero)
5127 Value *LSRInstance::Expand(const LSRUse &LU, const LSRFixup &LF,
5177 if (LU.Kind == LSRUse::ICmpZero) {
5196 if (!Ops.empty() && LU.Kind == LSRUse::Address &&
5232 if (LU.Kind == LSRUse::ICmpZero) {
5268 if (LU.Kind == LSRUse::ICmpZero) {
5306 PHINode *PN, const LSRUse &LU, const LSRFixup &LF, const Formula &F,
5420 void LSRInstance::Rewrite(const LSRUse &LU, const LSRFixup &LF,
5445 if (LU.Kind == LSRUse::ICmpZero)
5598 for (const LSRUse &LU : Uses) {
5632 for (const LSRUse &LU : Uses)
5642 for (const LSRUse &LU : Uses) {
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/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