|
|
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) {
462 ArrayRef<T> makeArrayRef(const T *begin, const T *end) {
462 ArrayRef<T> makeArrayRef(const T *begin, const T *end) {
462 ArrayRef<T> makeArrayRef(const T *begin, const T *end) {
include/llvm/CodeGen/SelectionDAG.h 262 ArrayRecycler<SDUse> OperandRecycler;
385 ArrayRecycler<SDUse>::Capacity::get(Node->NumOperands),
759 SDValue getBuildVector(EVT VT, const SDLoc &DL, ArrayRef<SDUse> Ops) {
904 ArrayRef<SDUse> Ops);
include/llvm/CodeGen/SelectionDAGNodes.h 265 SDUse **Prev = nullptr;
266 SDUse *Next = nullptr;
270 SDUse(const SDUse &U) = delete;
271 SDUse &operator=(const SDUse &) = delete;
271 SDUse &operator=(const SDUse &) = delete;
284 SDUse *getNext() const { return Next; }
326 void addToList(SDUse **List) {
344 static SimpleType getSimplifiedValue(SDUse &Val) {
615 SDUse *OperandList = nullptr;
622 SDUse *UseList = nullptr;
775 : public std::iterator<std::forward_iterator_tag, SDUse, ptrdiff_t> {
778 SDUse *Op = nullptr;
780 explicit use_iterator(SDUse *op) : Op(op) {}
784 SDUse, ptrdiff_t>::reference;
786 SDUse, ptrdiff_t>::pointer;
820 SDUse &getUse() const { return *Op; }
956 using op_iterator = SDUse *;
960 ArrayRef<SDUse> ops() const { return makeArrayRef(op_begin(), op_end()); }
968 explicit value_op_iterator(SDUse *U = nullptr)
1093 void addUse(SDUse &U) { U.addToList(&UseList); }
1254 SDUse Op;
include/llvm/Support/ArrayRecycler.h 36 static_assert(sizeof(T) >= sizeof(FreeList), "Objects are too small");
43 T *pop(unsigned Idx) {
56 void push(unsigned Idx, T *Ptr) {
125 T *allocate(Capacity Cap, AllocatorType &Allocator) {
127 if (T *Ptr = pop(Cap.getBucket()))
130 return static_cast<T*>(Allocator.Allocate(sizeof(T)*Cap.getSize(), Align));
137 void deallocate(Capacity Cap, T *Ptr) {
lib/CodeGen/SelectionDAG/DAGCombiner.cpp 9019 SDUse &Use = UI.getUse();
13594 SDUse &Use = UI.getUse();
lib/CodeGen/SelectionDAG/SelectionDAG.cpp 457 ArrayRef<SDUse> Ops) {
718 SDUse &Use = *I++;
7187 ArrayRef<SDUse> Ops) {
7559 SDUse &Use = *I++;
7718 SDUse &Use = *I++;
8189 SDUse &Use = UI.getUse();
8245 SDUse &Use = UI.getUse();
8291 SDUse &Use = UI.getUse();
8341 SDUse &Use = UI.getUse();
8383 SDUse *Use;
8479 SDUse &Use = UI.getUse();
8505 SDUse &Use = *Uses[UseIndex].Use;
9566 SDUse *Ops = OperandRecycler.allocate(
9567 ArrayRecycler<SDUse>::Capacity::get(Vals.size()), OperandAllocator);
lib/CodeGen/SelectionDAG/SelectionDAGISel.cpp 2094 SDUse &Use = I.getUse();
lib/Target/AMDGPU/AMDGPUISelLowering.cpp 1240 for (const SDUse &U : Op->ops())
lib/Target/Hexagon/HexagonISelLoweringHVX.cpp 1100 ArrayRef<SDUse> U(Op.getNode()->ops());
lib/Target/PowerPC/PPCISelLowering.cpp11897 for (const SDUse &O : ChainNext->ops())
lib/Target/X86/X86ISelLowering.cpp 9979 ArrayRef<SDUse> Ops = Op->ops();
10068 ArrayRef<SDUse> Ops = Op->ops();
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/move.h 72 constexpr _Tp&&
83 constexpr _Tp&&
usr/include/c++/7.4.0/bits/stl_construct.h 74 _Construct(_T1* __p, _Args&&... __args)
usr/include/c++/7.4.0/bits/stl_iterator_base_types.h 123 typedef _Tp value_type;
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_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/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 1554 { typedef _Tp type; };
1558 { typedef _Tp type; };
1633 { typedef _Tp type; };
1659 { typedef _Tp&& type; };