|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
include/llvm/ADT/STLExtras.h 155 -> decltype(begin(std::forward<ContainerTy>(container))) {
163 -> decltype(end(std::forward<ContainerTy>(container))) {
179 -> decltype(adl_detail::adl_begin(std::forward<ContainerTy>(container))) {
185 -> decltype(adl_detail::adl_end(std::forward<ContainerTy>(container))) {
include/llvm/ADT/iterator_range.h 32 IteratorT begin_iterator, end_iterator;
41 iterator_range(IteratorT begin_iterator, IteratorT end_iterator)
41 iterator_range(IteratorT begin_iterator, IteratorT end_iterator)
45 IteratorT begin() const { return begin_iterator; }
46 IteratorT end() const { return end_iterator; }
54 template <class T> iterator_range<T> make_range(T x, T y) {
54 template <class T> iterator_range<T> make_range(T x, T y) {
54 template <class T> iterator_range<T> make_range(T x, T y) {
include/llvm/CodeGen/SelectionDAGNodes.h 789 use_iterator(const use_iterator &I) : Op(I.Op) {}
791 bool operator==(const use_iterator &x) const {
794 bool operator!=(const use_iterator &x) const {
802 use_iterator &operator++() { // Preincrement
808 use_iterator operator++(int) { // Postincrement
809 use_iterator tmp = *this; ++*this; return tmp;
830 use_iterator use_begin() const {
834 static use_iterator use_end() { return use_iterator(nullptr); }
836 inline iterator_range<use_iterator> uses() {
839 inline iterator_range<use_iterator> uses() const {
996 for (use_iterator UI = use_begin(), UE = use_end(); UI != UE; ++UI)
lib/CodeGen/SelectionDAG/DAGCombiner.cpp 3544 for (SDNode::use_iterator UI = Op0.getNode()->use_begin(),
8979 for (SDNode::use_iterator UI = N0.getNode()->use_begin(),
9017 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
13591 for (SDNode::use_iterator UI = BasePtr.getNode()->use_begin(),
14622 for (SDNode::use_iterator UI = LD->use_begin(), UIEnd = LD->use_end();
15391 for (auto I = RootNode->use_begin(), E = RootNode->use_end();
15394 for (auto I2 = (*I)->use_begin(), E2 = (*I)->use_end(); I2 != E2; ++I2)
15404 for (auto I = RootNode->use_begin(), E = RootNode->use_end();
lib/CodeGen/SelectionDAG/LegalizeDAG.cpp 1296 for (SDNode::use_iterator UI = Vec.getNode()->use_begin(),
2266 for (SDNode::use_iterator UI = Op0.getNode()->use_begin(),
lib/CodeGen/SelectionDAG/LegalizeTypes.cpp 92 for (SDNode::use_iterator UI = Node.use_begin(), UE = Node.use_end();
180 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
378 for (SDNode::use_iterator UI = N->use_begin(), E = N->use_end();
lib/CodeGen/SelectionDAG/ScheduleDAGSDNodes.cpp 235 for (SDNode::use_iterator I = Chain->use_begin(), E = Chain->use_end();
384 for (SDNode::use_iterator UI = N->use_begin(), E = N->use_end();
lib/CodeGen/SelectionDAG/SelectionDAG.cpp 5614 for (SDNode::use_iterator U = getEntryNode().getNode()->use_begin(),
8137 SDNode::use_iterator &UI;
8138 SDNode::use_iterator &UE;
8148 SDNode::use_iterator &ui,
8149 SDNode::use_iterator &ue)
8176 SDNode::use_iterator UI = From->use_begin(), UE = From->use_end();
8232 SDNode::use_iterator UI = From->use_begin(), UE = From->use_end();
8277 SDNode::use_iterator UI = From->use_begin(), UE = From->use_end();
8329 SDNode::use_iterator UI = From.getNode()->use_begin(),
8477 for (SDNode::use_iterator UI = FromNode->use_begin(),
8560 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
8892 for (SDNode::use_iterator UI = use_begin(), E = use_end(); UI != E; ++UI) {
8909 for (SDNode::use_iterator UI = use_begin(), E = use_end(); UI != E; ++UI)
8919 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
8933 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
lib/CodeGen/SelectionDAG/SelectionDAGISel.cpp 2093 for (SDNode::use_iterator I = N->use_begin(), E = N->use_end(); I != E; ++I) {
lib/Target/AArch64/AArch64ISelLowering.cpp 3689 for (SDNode::use_iterator U = DAG.getEntryNode().getNode()->use_begin(),
10899 for (SDNode::use_iterator UI = LD->use_begin(), UE = LD->use_end(); UI != UE;
10910 for (SDNode::use_iterator UI = Addr.getNode()->use_begin(), UE =
11013 for (SDNode::use_iterator UI = Addr.getNode()->use_begin(),
lib/Target/AMDGPU/AMDGPUISelDAGToDAG.cpp 2643 for (SDNode::use_iterator U = N->use_begin(), E = SDNode::use_end();
lib/Target/AMDGPU/AMDGPUISelLowering.cpp 1060 for (SDNode::use_iterator U = DAG.getEntryNode().getNode()->use_begin(),
lib/Target/AMDGPU/SIISelLowering.cpp 4377 for (SDNode::use_iterator I = Parent->use_begin(), E = Parent->use_end();
10109 for (SDNode::use_iterator I = Node->use_begin(), E = Node->use_end();
lib/Target/ARM/ARMISelLowering.cpp 2886 for (SDNode::use_iterator UI = VMov->use_begin(), UE = VMov->use_end();
2895 for (SDNode::use_iterator UI = VMov->use_begin(), UE = VMov->use_end();
2928 for (SDNode::use_iterator UI = Copy->use_begin(), UE = Copy->use_end();
5679 auto Move = N->use_begin();
5721 auto ZeroExtend = N->use_begin();
5726 auto Copy = ZeroExtend->use_begin();
12884 for (SDNode::use_iterator UI = Addr.getNode()->use_begin(),
13131 for (SDNode::use_iterator UI = VLD->use_begin(), UE = VLD->use_end();
13156 for (SDNode::use_iterator UI = VLD->use_begin(), UE = VLD->use_end();
lib/Target/Hexagon/HexagonISelDAGToDAG.cpp 1165 for (auto I = N->use_begin(), E = N->use_end(); I != E; ++I) {
lib/Target/NVPTX/NVPTXISelLowering.cpp 4385 for (SDNode::use_iterator UI = N0.getNode()->use_begin(),
4415 for (SDNode::use_iterator UI = left->use_begin(), UE = left->use_end(); UI != UE; ++UI) {
4425 for (SDNode::use_iterator UI = right->use_begin(), UE = right->use_end(); UI != UE; ++UI) {
lib/Target/PowerPC/PPCISelDAGToDAG.cpp 1037 for (SDNode::use_iterator Use = N->use_begin(), UseEnd = N->use_end();
5578 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
5608 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
lib/Target/PowerPC/PPCISelLowering.cpp 2262 for (SDNode::use_iterator UI = N->use_begin(), E = N->use_end();
2531 for (SDNode::use_iterator UI = LD->use_begin(), UE = LD->use_end();
7582 for (SDNode::use_iterator UI = Origin->use_begin(),
11925 for (SDNode::use_iterator UI = LoadRoot->use_begin(),
11987 for (SDNode::use_iterator UI = N->use_begin(),
12167 for (SDNode::use_iterator UI = Inputs[i].getNode()->use_begin(),
12191 for (SDNode::use_iterator UI = PromOps[i].getNode()->use_begin(),
12380 for (SDNode::use_iterator UI = Inputs[i].getNode()->use_begin(),
12405 for (SDNode::use_iterator UI = PromOps[i].getNode()->use_begin(),
13541 auto UI = LD->use_begin();
13784 for (SDNode::use_iterator UI = BasePtr->use_begin(),
13800 for (SDNode::use_iterator UI = BasePtr->use_begin(),
13808 for (SDNode::use_iterator VI = OtherAdd->use_begin(),
13932 for (SDNode::use_iterator UI = LHSN->use_begin(), E = LHSN->use_end();
13951 for (SDNode::use_iterator UI = VCMPoNode->use_begin();
lib/Target/SystemZ/SystemZISelLowering.cpp 2146 for (auto I = C.Op0->use_begin(), E = C.Op0->use_end(); I != E; ++I) {
2166 for (auto I = C.Op0->use_begin(), E = C.Op0->use_end(); I != E; ++I) {
2193 for (auto I = ShlOp0->use_begin(), E = ShlOp0->use_end(); I != E; ++I) {
5533 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
lib/Target/X86/X86ISelDAGToDAG.cpp 342 for (SDNode::use_iterator UI = N->use_begin(),
2661 for (SDNode::use_iterator UI = Flags->use_begin(), UE = Flags->use_end();
2671 for (SDNode::use_iterator FlagUI = UI->use_begin(),
2697 for (SDNode::use_iterator UI = Flags->use_begin(), UE = Flags->use_end();
2707 for (SDNode::use_iterator FlagUI = UI->use_begin(),
2753 for (SDNode::use_iterator UI = Flags->use_begin(), UE = Flags->use_end();
2766 for (SDNode::use_iterator FlagUI = UI->use_begin(), FlagUE = UI->use_end();
lib/Target/X86/X86ISelLowering.cpp 2685 for (SDNode::use_iterator UI = Copy->use_begin(), UE = Copy->use_end();
4876 for (auto UI = Load->use_begin(), UE = Load->use_end(); UI != UE; ++UI) {
19999 for (SDNode::use_iterator UI = Op->use_begin(), UE = Op->use_end(); UI != UE;
20082 for (SDNode::use_iterator UI = Op.getNode()->use_begin(),
36772 for (SDNode::use_iterator UI = Cond->use_begin(), UE = Cond->use_end();
38674 for (SDNode::use_iterator UI = N->use_begin(), UE = N->use_end();
43294 for (SDNode::use_iterator UI = Flags->use_begin(), UE = Flags->use_end();
43332 for (SDNode::use_iterator UI = Flags->use_begin(), UE = Flags->use_end();
usr/include/c++/7.4.0/bits/algorithmfwd.h 276 _IIter
277 find_if_not(_IIter, _IIter, _Predicate);
277 find_if_not(_IIter, _IIter, _Predicate);
usr/include/c++/7.4.0/bits/move.h 98 move(_Tp&& __t) noexcept
usr/include/c++/7.4.0/bits/predefined_ops.h 350 operator()(_Iterator __it)
usr/include/c++/7.4.0/bits/range_access.h 48 begin(_Container& __cont) -> decltype(__cont.begin())
58 begin(const _Container& __cont) -> decltype(__cont.begin())
68 end(_Container& __cont) -> decltype(__cont.end())
78 end(const _Container& __cont) -> decltype(__cont.end())
usr/include/c++/7.4.0/bits/stl_algo.h 100 inline _InputIterator
101 __find_if(_InputIterator __first, _InputIterator __last,
101 __find_if(_InputIterator __first, _InputIterator __last,
111 _RandomAccessIterator
112 __find_if(_RandomAccessIterator __first, _RandomAccessIterator __last,
112 __find_if(_RandomAccessIterator __first, _RandomAccessIterator __last,
167 inline _InputIterator
168 __find_if_not(_InputIterator __first, _InputIterator __last,
168 __find_if_not(_InputIterator __first, _InputIterator __last,
508 all_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
508 all_of(_InputIterator __first, _InputIterator __last, _Predicate __pred)
usr/include/c++/7.4.0/bits/stl_iterator_base_funcs.h 79 typename iterator_traits<_InputIterator>::difference_type
80 __distance(_InputIterator __first, _InputIterator __last,
80 __distance(_InputIterator __first, _InputIterator __last,
86 typename iterator_traits<_InputIterator>::difference_type __n = 0;
97 typename iterator_traits<_RandomAccessIterator>::difference_type
98 __distance(_RandomAccessIterator __first, _RandomAccessIterator __last,
98 __distance(_RandomAccessIterator __first, _RandomAccessIterator __last,
137 typename iterator_traits<_InputIterator>::difference_type
138 distance(_InputIterator __first, _InputIterator __last)
138 distance(_InputIterator __first, _InputIterator __last)
147 __advance(_InputIterator& __i, _Distance __n, input_iterator_tag)
158 __advance(_BidirectionalIterator& __i, _Distance __n,
174 __advance(_RandomAccessIterator& __i, _Distance __n,
197 advance(_InputIterator& __i, _Distance __n)
200 typename iterator_traits<_InputIterator>::difference_type __d = __n;
207 inline _GLIBCXX17_CONSTEXPR _ForwardIterator
208 next(_ForwardIterator __x, typename
209 iterator_traits<_ForwardIterator>::difference_type __n = 1)
usr/include/c++/7.4.0/bits/stl_iterator_base_types.h 154 typedef typename _Iterator::iterator_category iterator_category;
155 typedef typename _Iterator::value_type value_type;
156 typedef typename _Iterator::difference_type difference_type;
157 typedef typename _Iterator::pointer pointer;
158 typedef typename _Iterator::reference reference;
163 : public __iterator_traits<_Iterator> { };
204 typename iterator_traits<_Iter>::iterator_category
205 __iterator_category(const _Iter&)
usr/include/c++/7.4.0/type_traits 1633 { typedef _Tp type; };