|
|
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 {
456 ArrayRef<T> makeArrayRef(const T *data, size_t length) {
456 ArrayRef<T> makeArrayRef(const T *data, size_t length) {
include/llvm/DebugInfo/DWARF/DWARFUnit.h 55 const DWARFUnitIndex::Entry *IndexEntry = nullptr;
75 const DWARFUnitIndex::Entry *Entry = nullptr);
92 const DWARFUnitIndex::Entry *getIndexEntry() const { return IndexEntry; }
116 const DWARFUnitIndex::Entry *)>
126 DWARFUnit *getUnitForIndexEntry(const DWARFUnitIndex::Entry &E);
include/llvm/DebugInfo/DWARF/DWARFUnitIndex.h 75 std::unique_ptr<Entry[]> Rows;
76 mutable std::vector<Entry *> OffsetLookup;
91 const Entry *getFromOffset(uint32_t Offset) const;
92 const Entry *getFromHash(uint64_t Offset) const;
98 ArrayRef<Entry> getRows() const {
lib/DebugInfo/DWARF/DWARFContext.cpp 615 if (const auto *R = CUI.getFromHash(Hash))
lib/DebugInfo/DWARF/DWARFUnit.cpp 142 DWARFUnitVector::getUnitForIndexEntry(const DWARFUnitIndex::Entry &E) {
239 const DWARFUnitIndex::Entry *Entry) {
lib/DebugInfo/DWARF/DWARFUnitIndex.cpp 57 Rows = std::make_unique<Entry[]>(Header.NumBuckets);
59 std::make_unique<Entry::SectionContribution *[]>(Header.NumUnits);
73 std::make_unique<Entry::SectionContribution[]>(Header.NumColumns);
137 auto &Row = Rows[i];
150 const DWARFUnitIndex::Entry::SectionContribution *
159 const DWARFUnitIndex::Entry::SectionContribution *
164 const DWARFUnitIndex::Entry *
181 const auto *E = *I;
188 const DWARFUnitIndex::Entry *DWARFUnitIndex::getFromHash(uint64_t S) const {
tools/lldb/source/Plugins/SymbolFile/DWARF/SymbolFileDWARFDwp.cpp 74 for (const auto &entry : m_debug_cu_index.getRows())
tools/lldb/source/Plugins/SymbolFile/DWARF/SymbolFileDWARFDwp.h 47 std::map<uint64_t, const llvm::DWARFUnitIndex::Entry *> m_debug_cu_index_map;
tools/llvm-dwp/llvm-dwp.cpp 201 DWARFUnitIndex::Entry::SectionContribution Contributions[8];
208 const DWARFUnitIndex::Entry &Entry,
221 for (const DWARFUnitIndex::Entry &E : TUIndex.getRows()) {
340 &DWARFUnitIndex::Entry::SectionContribution::Offset);
344 &DWARFUnitIndex::Entry::SectionContribution::Length);
589 for (const DWARFUnitIndex::Entry &E : CUIndex.getRows()) {
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_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/bits/unique_ptr.h 103 default_delete(const default_delete<_Up[]>&) noexcept { }
107 typename enable_if<is_convertible<_Up(*)[], _Tp(*)[]>::value>::type
107 typename enable_if<is_convertible<_Up(*)[], _Tp(*)[]>::value>::type
108 operator()(_Up* __ptr) const
110 static_assert(sizeof(_Tp)>0,
122 using type = _Up*;
137 using pointer = typename _Ptr<_Tp, _Dp>::type;
401 typename __uniq_ptr_impl<_Tp, _Up>::_DeleterConstraint::type;
403 __uniq_ptr_impl<_Tp, _Dp> _M_t;
411 = __and_< is_base_of<_Tp, _Up>,
412 __not_<is_same<__remove_cv<_Tp>, __remove_cv<_Up>>> >;
412 __not_<is_same<__remove_cv<_Tp>, __remove_cv<_Up>>> >;
412 __not_<is_same<__remove_cv<_Tp>, __remove_cv<_Up>>> >;
415 using pointer = typename __uniq_ptr_impl<_Tp, _Dp>::pointer;
416 using element_type = _Tp;
815 { typedef unique_ptr<_Tp[]> __array; };
831 { return unique_ptr<_Tp>(new remove_extent_t<_Tp>[__num]()); }
831 { return unique_ptr<_Tp>(new remove_extent_t<_Tp>[__num]()); }
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;
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
581 : public __or_<is_lvalue_reference<_Tp>,
582 is_rvalue_reference<_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
638 : public __or_<is_object<_Tp>, is_reference<_Tp>>::type
638 : public __or_<is_object<_Tp>, is_reference<_Tp>>::type
1554 { typedef _Tp type; };
1563 { typedef _Tp type; };
1574 remove_const<typename remove_volatile<_Tp>::type>::type type;
1645 { typedef _Tp& type; };
1650 : public __add_lvalue_reference_helper<_Tp>
1950 { typedef _Tp type; };
1983 { typedef _Up type; };