LLVM  14.0.0git
ilist.h
Go to the documentation of this file.
1 //==-- llvm/ADT/ilist.h - Intrusive Linked List Template ---------*- C++ -*-==//
2 //
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6 //
7 //===----------------------------------------------------------------------===//
8 //
9 // This file defines classes to implement an intrusive doubly linked list class
10 // (i.e. each node of the list must contain a next and previous field for the
11 // list.
12 //
13 // The ilist class itself should be a plug in replacement for list. This list
14 // replacement does not provide a constant time size() method, so be careful to
15 // use empty() when you really want to know if it's empty.
16 //
17 // The ilist class is implemented as a circular list. The list itself contains
18 // a sentinel node, whose Next points at begin() and whose Prev points at
19 // rbegin(). The sentinel node itself serves as end() and rend().
20 //
21 //===----------------------------------------------------------------------===//
22 
23 #ifndef LLVM_ADT_ILIST_H
24 #define LLVM_ADT_ILIST_H
25 
26 #include "llvm/ADT/simple_ilist.h"
27 #include <cassert>
28 #include <cstddef>
29 #include <iterator>
30 
31 namespace llvm {
32 
33 /// Use delete by default for iplist and ilist.
34 ///
35 /// Specialize this to get different behaviour for ownership-related API. (If
36 /// you really want ownership semantics, consider using std::list or building
37 /// something like \a BumpPtrList.)
38 ///
39 /// \see ilist_noalloc_traits
40 template <typename NodeTy> struct ilist_alloc_traits {
41  static void deleteNode(NodeTy *V) { delete V; }
42 };
43 
44 /// Custom traits to do nothing on deletion.
45 ///
46 /// Specialize ilist_alloc_traits to inherit from this to disable the
47 /// non-intrusive deletion in iplist (which implies ownership).
48 ///
49 /// If you want purely intrusive semantics with no callbacks, consider using \a
50 /// simple_ilist instead.
51 ///
52 /// \code
53 /// template <>
54 /// struct ilist_alloc_traits<MyType> : ilist_noalloc_traits<MyType> {};
55 /// \endcode
56 template <typename NodeTy> struct ilist_noalloc_traits {
57  static void deleteNode(NodeTy *V) {}
58 };
59 
60 /// Callbacks do nothing by default in iplist and ilist.
61 ///
62 /// Specialize this for to use callbacks for when nodes change their list
63 /// membership.
64 template <typename NodeTy> struct ilist_callback_traits {
65  void addNodeToList(NodeTy *) {}
66  void removeNodeFromList(NodeTy *) {}
67 
68  /// Callback before transferring nodes to this list. The nodes may already be
69  /// in this same list.
70  template <class Iterator>
71  void transferNodesFromList(ilist_callback_traits &OldList, Iterator /*first*/,
72  Iterator /*last*/) {
73  (void)OldList;
74  }
75 };
76 
77 /// A fragment for template traits for intrusive list that provides default
78 /// node related operations.
79 ///
80 /// TODO: Remove this layer of indirection. It's not necessary.
81 template <typename NodeTy>
83  ilist_callback_traits<NodeTy> {};
84 
85 /// Template traits for intrusive list.
86 ///
87 /// Customize callbacks and allocation semantics.
88 template <typename NodeTy>
89 struct ilist_traits : public ilist_node_traits<NodeTy> {};
90 
91 /// Const traits should never be instantiated.
92 template <typename Ty> struct ilist_traits<const Ty> {};
93 
94 namespace ilist_detail {
95 
96 template <class T> T &make();
97 
98 /// Type trait to check for a traits class that has a getNext member (as a
99 /// canary for any of the ilist_nextprev_traits API).
100 template <class TraitsT, class NodeT> struct HasGetNext {
101  typedef char Yes[1];
102  typedef char No[2];
103  template <size_t N> struct SFINAE {};
104 
105  template <class U>
106  static Yes &test(U *I, decltype(I->getNext(&make<NodeT>())) * = 0);
107  template <class> static No &test(...);
108 
109 public:
110  static const bool value = sizeof(test<TraitsT>(nullptr)) == sizeof(Yes);
111 };
112 
113 /// Type trait to check for a traits class that has a createSentinel member (as
114 /// a canary for any of the ilist_sentinel_traits API).
115 template <class TraitsT> struct HasCreateSentinel {
116  typedef char Yes[1];
117  typedef char No[2];
118 
119  template <class U>
120  static Yes &test(U *I, decltype(I->createSentinel()) * = 0);
121  template <class> static No &test(...);
122 
123 public:
124  static const bool value = sizeof(test<TraitsT>(nullptr)) == sizeof(Yes);
125 };
126 
127 /// Type trait to check for a traits class that has a createNode member.
128 /// Allocation should be managed in a wrapper class, instead of in
129 /// ilist_traits.
130 template <class TraitsT, class NodeT> struct HasCreateNode {
131  typedef char Yes[1];
132  typedef char No[2];
133  template <size_t N> struct SFINAE {};
134 
135  template <class U>
136  static Yes &test(U *I, decltype(I->createNode(make<NodeT>())) * = 0);
137  template <class> static No &test(...);
138 
139 public:
140  static const bool value = sizeof(test<TraitsT>(nullptr)) == sizeof(Yes);
141 };
142 
143 template <class TraitsT, class NodeT> struct HasObsoleteCustomization {
147 };
148 
149 } // end namespace ilist_detail
150 
151 //===----------------------------------------------------------------------===//
152 //
153 /// A wrapper around an intrusive list with callbacks and non-intrusive
154 /// ownership.
155 ///
156 /// This wraps a purely intrusive list (like simple_ilist) with a configurable
157 /// traits class. The traits can implement callbacks and customize the
158 /// ownership semantics.
159 ///
160 /// This is a subset of ilist functionality that can safely be used on nodes of
161 /// polymorphic types, i.e. a heterogeneous list with a common base class that
162 /// holds the next/prev pointers. The only state of the list itself is an
163 /// ilist_sentinel, which holds pointers to the first and last nodes in the
164 /// list.
165 template <class IntrusiveListT, class TraitsT>
168 
169 public:
180  typedef
182 
183 private:
184  // TODO: Drop this assertion and the transitive type traits anytime after
185  // v4.0 is branched (i.e,. keep them for one release to help out-of-tree code
186  // update).
187  static_assert(
189  "ilist customization points have changed!");
190 
191  static bool op_less(const_reference L, const_reference R) { return L < R; }
192  static bool op_equal(const_reference L, const_reference R) { return L == R; }
193 
194 public:
195  iplist_impl() = default;
196 
197  iplist_impl(const iplist_impl &) = delete;
198  iplist_impl &operator=(const iplist_impl &) = delete;
199 
201  : TraitsT(std::move(static_cast<TraitsT &>(X))),
202  IntrusiveListT(std::move(static_cast<IntrusiveListT &>(X))) {}
204  *static_cast<TraitsT *>(this) = std::move(static_cast<TraitsT &>(X));
205  *static_cast<IntrusiveListT *>(this) =
206  std::move(static_cast<IntrusiveListT &>(X));
207  return *this;
208  }
209 
211 
212  // Miscellaneous inspection routines.
213  size_type max_size() const { return size_type(-1); }
214 
215  using base_list_type::begin;
216  using base_list_type::end;
218  using base_list_type::rend;
219  using base_list_type::empty;
220  using base_list_type::front;
221  using base_list_type::back;
222 
223  void swap(iplist_impl &RHS) {
224  assert(0 && "Swap does not use list traits callback correctly yet!");
226  }
227 
229  this->addNodeToList(New); // Notify traits that we added a node...
230  return base_list_type::insert(where, *New);
231  }
232 
234  return this->insert(where, new value_type(New));
235  }
236 
238  if (empty())
239  return insert(begin(), New);
240  else
241  return insert(++where, New);
242  }
243 
244  /// Clone another list.
245  template <class Cloner> void cloneFrom(const iplist_impl &L2, Cloner clone) {
246  clear();
247  for (const_reference V : L2)
248  push_back(clone(V));
249  }
250 
252  pointer Node = &*IT++;
253  this->removeNodeFromList(Node); // Notify traits that we removed a node...
255  return Node;
256  }
257 
259  iterator MutIt = IT;
260  return remove(MutIt);
261  }
262 
265 
266  // erase - remove a node from the controlled sequence... and delete it.
268  this->deleteNode(remove(where));
269  return where;
270  }
271 
274 
275  /// Remove all nodes from the list like clear(), but do not call
276  /// removeNodeFromList() or deleteNode().
277  ///
278  /// This should only be used immediately before freeing nodes in bulk to
279  /// avoid traversing the list and bringing all the nodes into cache.
281 
282 private:
283  // transfer - The heart of the splice function. Move linked list nodes from
284  // [first, last) into position.
285  //
286  void transfer(iterator position, iplist_impl &L2, iterator first, iterator last) {
287  if (position == last)
288  return;
289 
290  // Notify traits we moved the nodes...
291  this->transferNodesFromList(L2, first, last);
292 
293  base_list_type::splice(position, L2, first, last);
294  }
295 
296 public:
297  //===----------------------------------------------------------------------===
298  // Functionality derived from other functions defined above...
299  //
300 
301  using base_list_type::size;
302 
304  while (first != last)
305  first = erase(first);
306  return last;
307  }
308 
309  void clear() { erase(begin(), end()); }
310 
311  // Front and back inserters...
314  void pop_front() {
315  assert(!empty() && "pop_front() on empty list!");
316  erase(begin());
317  }
318  void pop_back() {
319  assert(!empty() && "pop_back() on empty list!");
320  iterator t = end(); erase(--t);
321  }
322 
323  // Special forms of insert...
324  template<class InIt> void insert(iterator where, InIt first, InIt last) {
325  for (; first != last; ++first) insert(where, *first);
326  }
327 
328  // Splice members - defined in terms of transfer...
329  void splice(iterator where, iplist_impl &L2) {
330  if (!L2.empty())
331  transfer(where, L2, L2.begin(), L2.end());
332  }
333  void splice(iterator where, iplist_impl &L2, iterator first) {
334  iterator last = first; ++last;
335  if (where == first || where == last) return; // No change
336  transfer(where, L2, first, last);
337  }
338  void splice(iterator where, iplist_impl &L2, iterator first, iterator last) {
339  if (first != last) transfer(where, L2, first, last);
340  }
342  splice(where, L2, iterator(N));
343  }
345  splice(where, L2, iterator(N));
346  }
347 
348  template <class Compare>
349  void merge(iplist_impl &Right, Compare comp) {
350  if (this == &Right)
351  return;
352  this->transferNodesFromList(Right, Right.begin(), Right.end());
354  }
355  void merge(iplist_impl &Right) { return merge(Right, op_less); }
356 
357  using base_list_type::sort;
358 
359  /// Get the previous node, or \c nullptr for the list head.
361  auto I = N.getIterator();
362  if (I == begin())
363  return nullptr;
364  return &*std::prev(I);
365  }
366  /// Get the previous node, or \c nullptr for the list head.
368  return getPrevNode(const_cast<reference >(N));
369  }
370 
371  /// Get the next node, or \c nullptr for the list tail.
373  auto Next = std::next(N.getIterator());
374  if (Next == end())
375  return nullptr;
376  return &*Next;
377  }
378  /// Get the next node, or \c nullptr for the list tail.
380  return getNextNode(const_cast<reference >(N));
381  }
382 };
383 
384 /// An intrusive list with ownership and callbacks specified/controlled by
385 /// ilist_traits, only with API safe for polymorphic types.
386 ///
387 /// The \p Options parameters are the same as those for \a simple_ilist. See
388 /// there for a description of what's available.
389 template <class T, class... Options>
390 class iplist
391  : public iplist_impl<simple_ilist<T, Options...>, ilist_traits<T>> {
392  using iplist_impl_type = typename iplist::iplist_impl;
393 
394 public:
395  iplist() = default;
396 
397  iplist(const iplist &X) = delete;
398  iplist &operator=(const iplist &X) = delete;
399 
400  iplist(iplist &&X) : iplist_impl_type(std::move(X)) {}
402  *static_cast<iplist_impl_type *>(this) = std::move(X);
403  return *this;
404  }
405 };
406 
407 template <class T, class... Options> using ilist = iplist<T, Options...>;
408 
409 } // end namespace llvm
410 
411 namespace std {
412 
413  // Ensure that swap uses the fast list swap...
414  template<class Ty>
415  void swap(llvm::iplist<Ty> &Left, llvm::iplist<Ty> &Right) {
416  Left.swap(Right);
417  }
418 
419 } // end namespace std
420 
421 #endif // LLVM_ADT_ILIST_H
llvm::iplist_impl::erase
iterator erase(reference IT)
Definition: ilist.h:273
llvm::iplist_impl::clear
void clear()
Definition: ilist.h:309
llvm
This file implements support for optimizing divisions by a constant.
Definition: AllocatorList.h:23
llvm::ilist_detail::HasGetNext::No
char No[2]
Definition: ilist.h:102
llvm::iplist_impl::merge
void merge(iplist_impl &Right)
Definition: ilist.h:355
llvm::sys::path::rbegin
reverse_iterator rbegin(StringRef path, Style style=Style::native)
Get reverse begin iterator over path.
Definition: Path.cpp:295
llvm::iplist_impl::push_back
void push_back(pointer val)
Definition: ilist.h:313
llvm::iplist_impl::difference_type
base_list_type::difference_type difference_type
Definition: ilist.h:176
llvm::ilist_detail::HasGetNext::Yes
char Yes[1]
Definition: ilist.h:101
llvm::iplist_impl::pop_front
void pop_front()
Definition: ilist.h:314
llvm::iplist_impl::clearAndLeakNodesUnsafely
void clearAndLeakNodesUnsafely()
Remove all nodes from the list like clear(), but do not call removeNodeFromList() or deleteNode().
Definition: ilist.h:280
llvm::iplist_impl::pointer
base_list_type::pointer pointer
Definition: ilist.h:170
llvm::simple_ilist< MachineInstr, Options... >::const_pointer
typename OptionsT::const_pointer const_pointer
Definition: simple_ilist.h:93
llvm::iplist_impl::erase
iterator erase(iterator first, iterator last)
Definition: ilist.h:303
llvm::iplist_impl::getNextNode
pointer getNextNode(reference N) const
Get the next node, or nullptr for the list tail.
Definition: ilist.h:372
llvm::ilist_detail::HasCreateSentinel
Type trait to check for a traits class that has a createSentinel member (as a canary for any of the i...
Definition: ilist.h:115
Right
Vector Shift Left Right
Definition: README_P9.txt:118
llvm::iplist_impl::const_reverse_iterator
base_list_type::const_reverse_iterator const_reverse_iterator
Definition: ilist.h:181
llvm::ilist_callback_traits
Callbacks do nothing by default in iplist and ilist.
Definition: ilist.h:64
llvm::iplist_impl::insert
void insert(iterator where, InIt first, InIt last)
Definition: ilist.h:324
llvm::sys::path::end
const_iterator end(StringRef path)
Get end iterator over path.
Definition: Path.cpp:233
llvm::sys::path::begin
const_iterator begin(StringRef path, Style style=Style::native)
Get begin iterator over path.
Definition: Path.cpp:224
T
#define T
Definition: Mips16ISelLowering.cpp:341
llvm::ilist_detail::HasGetNext::SFINAE
Definition: ilist.h:103
llvm::ilist_detail::HasCreateNode::test
static Yes & test(U *I, decltype(I->createNode(make< NodeT >())) *=0)
llvm::iplist_impl::remove
pointer remove(iterator &IT)
Definition: ilist.h:251
llvm::iplist_impl::cloneFrom
void cloneFrom(const iplist_impl &L2, Cloner clone)
Clone another list.
Definition: ilist.h:245
llvm::iplist
An intrusive list with ownership and callbacks specified/controlled by ilist_traits,...
Definition: ilist.h:390
llvm::iplist_impl::operator=
iplist_impl & operator=(iplist_impl &&X)
Definition: ilist.h:203
llvm::iplist_impl::splice
void splice(iterator where, iplist_impl &L2)
Definition: ilist.h:329
size_t
llvm::simple_ilist< MachineInstr, Options... >::value_type
typename OptionsT::value_type value_type
Definition: simple_ilist.h:90
llvm::iplist_impl::erase
iterator erase(iterator where)
Definition: ilist.h:267
llvm::ilist_detail::HasObsoleteCustomization
Definition: ilist.h:143
llvm::iplist_impl::const_reference
base_list_type::const_reference const_reference
Definition: ilist.h:173
llvm::iplist_impl::getPrevNode
pointer getPrevNode(reference N) const
Get the previous node, or nullptr for the list head.
Definition: ilist.h:360
clear
static void clear(coro::Shape &Shape)
Definition: Coroutines.cpp:234
llvm::simple_ilist< MachineInstr, Options... >::reference
typename OptionsT::reference reference
Definition: simple_ilist.h:92
llvm::ilist_noalloc_traits::deleteNode
static void deleteNode(NodeTy *V)
Definition: ilist.h:57
llvm::iplist_impl::swap
void swap(iplist_impl &RHS)
Definition: ilist.h:223
llvm::iplist_impl::erase
iterator erase(pointer IT)
Definition: ilist.h:272
L2
add sub stmia L5 ldr L2
Definition: README.txt:201
ptrdiff_t
llvm::iplist_impl::push_front
void push_front(pointer val)
Definition: ilist.h:312
llvm::iplist_impl::splice
void splice(iterator where, iplist_impl &L2, reference N)
Definition: ilist.h:341
llvm::iplist_impl::iplist_impl
iplist_impl(iplist_impl &&X)
Definition: ilist.h:200
llvm::iplist_impl::splice
void splice(iterator where, iplist_impl &L2, iterator first)
Definition: ilist.h:333
t
bitcast float %x to i32 %s=and i32 %t, 2147483647 %d=bitcast i32 %s to float ret float %d } declare float @fabsf(float %n) define float @bar(float %x) nounwind { %d=call float @fabsf(float %x) ret float %d } This IR(from PR6194):target datalayout="e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64-S128" target triple="x86_64-apple-darwin10.0.0" %0=type { double, double } %struct.float3=type { float, float, float } define void @test(%0, %struct.float3 *nocapture %res) nounwind noinline ssp { entry:%tmp18=extractvalue %0 %0, 0 t
Definition: README-SSE.txt:788
llvm::iplist::iplist
iplist(iplist &&X)
Definition: ilist.h:400
llvm::iplist_impl::operator=
iplist_impl & operator=(const iplist_impl &)=delete
llvm::ilist_detail::HasCreateSentinel::value
static const bool value
Definition: ilist.h:124
merge
static LoopDeletionResult merge(LoopDeletionResult A, LoopDeletionResult B)
Definition: LoopDeletion.cpp:51
llvm::iplist_impl
A wrapper around an intrusive list with callbacks and non-intrusive ownership.
Definition: ilist.h:166
llvm::ilist_detail::HasCreateNode::No
char No[2]
Definition: ilist.h:132
Options
const char LLVMTargetMachineRef LLVMPassBuilderOptionsRef Options
Definition: PassBuilderBindings.cpp:48
llvm::ilist_detail::make
T & make()
llvm::iplist_impl::reference
base_list_type::reference reference
Definition: ilist.h:172
llvm::ilist_detail::HasCreateNode
Type trait to check for a traits class that has a createNode member.
Definition: ilist.h:130
llvm::iplist_impl::reverse_iterator
base_list_type::reverse_iterator reverse_iterator
Definition: ilist.h:179
X
static GCMetadataPrinterRegistry::Add< ErlangGCPrinter > X("erlang", "erlang-compatible garbage collector")
llvm::ilist_detail::HasCreateSentinel::Yes
char Yes[1]
Definition: ilist.h:116
llvm::iplist_impl::const_pointer
base_list_type::const_pointer const_pointer
Definition: ilist.h:171
llvm::ilist_traits
Template traits for intrusive list.
Definition: ilist.h:89
llvm::iplist_impl::merge
void merge(iplist_impl &Right, Compare comp)
Definition: ilist.h:349
llvm::ilist_node_traits
A fragment for template traits for intrusive list that provides default node related operations.
Definition: ilist.h:82
val
The initial backend is deliberately restricted to z10 We should add support for later architectures at some point If an asm ties an i32 r result to an i64 the input will be treated as an leaving the upper bits uninitialised For i64 store i32 val
Definition: README.txt:15
std::swap
void swap(llvm::iplist< Ty > &Left, llvm::iplist< Ty > &Right)
Definition: ilist.h:415
llvm::iplist_impl::~iplist_impl
~iplist_impl()
Definition: ilist.h:210
const
aarch64 promote const
Definition: AArch64PromoteConstant.cpp:232
llvm::iplist_impl::iterator
base_list_type::iterator iterator
Definition: ilist.h:177
move
compiles ldr LCPI1_0 ldr ldr mov lsr tst moveq r1 ldr LCPI1_1 and r0 bx lr It would be better to do something like to fold the shift into the conditional move
Definition: README.txt:546
llvm::iplist::iplist
iplist()=default
I
#define I(x, y, z)
Definition: MD5.cpp:59
size
i< reg-> size
Definition: README.txt:166
llvm::ilist_alloc_traits
Use delete by default for iplist and ilist.
Definition: ilist.h:40
llvm::simple_ilist< MachineInstr, Options... >::const_reference
typename OptionsT::const_reference const_reference
Definition: simple_ilist.h:94
llvm::iplist_impl::remove
pointer remove(pointer IT)
Definition: ilist.h:263
assert
assert(ImpDefSCC.getReg()==AMDGPU::SCC &&ImpDefSCC.isDef())
llvm::move
OutputIt move(R &&Range, OutputIt Out)
Provide wrappers to std::move which take ranges instead of having to pass begin/end explicitly.
Definition: STLExtras.h:1609
std::swap
void swap(llvm::BitVector &LHS, llvm::BitVector &RHS)
Implement std::swap in terms of BitVector swap.
Definition: BitVector.h:840
TraitsT
llvm::iplist_impl::getPrevNode
const_pointer getPrevNode(const_reference N) const
Get the previous node, or nullptr for the list head.
Definition: ilist.h:367
llvm::iplist_impl::remove
pointer remove(reference IT)
Definition: ilist.h:264
llvm::ilist_detail::HasGetNext::test
static Yes & test(U *I, decltype(I->getNext(&make< NodeT >())) *=0)
Compare
QP Compare Ordered outs ins xscmpudp No builtin are required Or llvm fcmp order unorder compare DP QP Compare builtin are required DP Compare
Definition: README_P9.txt:309
llvm::sys::fs::remove
std::error_code remove(const Twine &path, bool IgnoreNonExisting=true)
Remove path.
IT
static cl::opt< ITMode > IT(cl::desc("IT block support"), cl::Hidden, cl::init(DefaultIT), cl::ZeroOrMore, cl::values(clEnumValN(DefaultIT, "arm-default-it", "Generate IT block based on arch"), clEnumValN(RestrictedIT, "arm-restrict-it", "Disallow deprecated IT based on ARMv8"), clEnumValN(NoRestrictedIT, "arm-no-restrict-it", "Allow IT blocks based on ARMv7")))
llvm::ilist_noalloc_traits
Custom traits to do nothing on deletion.
Definition: ilist.h:56
IntrusiveListT
llvm::iplist_impl::insert
iterator insert(iterator where, const_reference New)
Definition: ilist.h:233
llvm::ilist_callback_traits::addNodeToList
void addNodeToList(NodeTy *)
When an MBB is added to an MF, we need to update the parent pointer of the MBB, the MBB numbering,...
Definition: ilist.h:65
llvm::iplist_impl::max_size
size_type max_size() const
Definition: ilist.h:213
Node
Definition: ItaniumDemangle.h:235
llvm::iplist_impl::iplist_impl
iplist_impl()=default
llvm::iplist_impl::getNextNode
const_pointer getNextNode(const_reference N) const
Get the next node, or nullptr for the list tail.
Definition: ilist.h:379
llvm::iplist_impl::remove
pointer remove(const iterator &IT)
Definition: ilist.h:258
llvm::iplist_impl::value_type
base_list_type::value_type value_type
Definition: ilist.h:174
llvm::empty
constexpr bool empty(const T &RangeOrContainer)
Test whether RangeOrContainer is empty. Similar to C++17 std::empty.
Definition: STLExtras.h:254
std
Definition: BitVector.h:838
llvm::ilist_iterator
Iterator for intrusive lists based on ilist_node.
Definition: ilist_iterator.h:57
llvm::iplist_impl::pop_back
void pop_back()
Definition: ilist.h:318
llvm::ilist_callback_traits::removeNodeFromList
void removeNodeFromList(NodeTy *)
Definition: ilist.h:66
llvm::sort
void sort(IteratorTy Start, IteratorTy End)
Definition: STLExtras.h:1492
llvm::iplist::operator=
iplist & operator=(iplist &&X)
Definition: ilist.h:401
llvm::ilist_detail::HasGetNext
Type trait to check for a traits class that has a getNext member (as a canary for any of the ilist_ne...
Definition: ilist.h:100
llvm::iplist_impl::insertAfter
iterator insertAfter(iterator where, pointer New)
Definition: ilist.h:237
llvm::iplist_impl::insert
iterator insert(iterator where, pointer New)
Definition: ilist.h:228
llvm::iplist_impl::splice
void splice(iterator where, iplist_impl &L2, iterator first, iterator last)
Definition: ilist.h:338
llvm::ilist_alloc_traits::deleteNode
static void deleteNode(NodeTy *V)
Definition: ilist.h:41
llvm::iplist_impl::size_type
base_list_type::size_type size_type
Definition: ilist.h:175
N
#define N
llvm::iplist_impl::const_iterator
base_list_type::const_iterator const_iterator
Definition: ilist.h:178
simple_ilist.h
llvm::ilist_detail::HasCreateNode::Yes
char Yes[1]
Definition: ilist.h:131
llvm::sys::path::rend
reverse_iterator rend(StringRef path)
Get reverse end iterator over path.
Definition: Path.cpp:304
llvm::ilist_detail::HasCreateNode::value
static const bool value
Definition: ilist.h:140
llvm::iplist_impl::splice
void splice(iterator where, iplist_impl &L2, pointer N)
Definition: ilist.h:344
llvm::ilist_detail::HasGetNext::value
static const bool value
Definition: ilist.h:110
llvm::simple_ilist< MachineInstr, Options... >::pointer
typename OptionsT::pointer pointer
Definition: simple_ilist.h:91
llvm::ilist_detail::HasCreateSentinel::No
char No[2]
Definition: ilist.h:117
llvm::ilist_detail::HasObsoleteCustomization::value
static const bool value
Definition: ilist.h:144
llvm::ilist_callback_traits::transferNodesFromList
void transferNodesFromList(ilist_callback_traits &OldList, Iterator, Iterator)
Callback before transferring nodes to this list.
Definition: ilist.h:71
llvm::ilist_detail::HasCreateSentinel::test
static Yes & test(U *I, decltype(I->createSentinel()) *=0)
llvm::ilist_detail::HasCreateNode::SFINAE
Definition: ilist.h:133
llvm::iplist::operator=
iplist & operator=(const iplist &X)=delete