reference, declarationdefinition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced

References

include/llvm/ADT/ilist.h
   57   static void deleteNode(NodeTy *V) {}
   65   void addNodeToList(NodeTy *) {}
   66   void removeNodeFromList(NodeTy *) {}
   82 struct ilist_node_traits : ilist_alloc_traits<NodeTy>,
   83                            ilist_callback_traits<NodeTy> {};
   89 struct ilist_traits : public ilist_node_traits<NodeTy> {};
   96 template <class T> T &make();
  106   static Yes &test(U *I, decltype(I->getNext(&make<NodeT>())) * = 0);
  136   static Yes &test(U *I, decltype(I->createNode(make<NodeT>())) * = 0);
  144   static const bool value = HasGetNext<TraitsT, NodeT>::value ||
  146                             HasCreateNode<TraitsT, NodeT>::value;
  389     : public iplist_impl<simple_ilist<T, Options...>, ilist_traits<T>> {
  389     : public iplist_impl<simple_ilist<T, Options...>, ilist_traits<T>> {
include/llvm/ADT/ilist_node.h
  150           typename ilist_detail::compute_node_options<T, Options...>::type> {
include/llvm/ADT/ilist_node_options.h
  108   typedef T value_type;
  109   typedef T *pointer;
  110   typedef T &reference;
  111   typedef const T *const_pointer;
  112   typedef const T &const_reference;
  122   typedef node_options<T, extract_sentinel_tracking<Options...>::value,
include/llvm/ADT/simple_ilist.h
   79     : ilist_detail::compute_node_options<T, Options...>::type::list_base_type,
   81           typename ilist_detail::compute_node_options<T, Options...>::type> {
   85       typename ilist_detail::compute_node_options<T, Options...>::type;
tools/lld/lib/ReaderWriter/MachO/MachONormalizedFileBinaryWriter.cpp
   55 struct TrieEdge : public llvm::ilist_node<TrieEdge> {
   70 struct ilist_alloc_traits<TrieEdge> : ilist_noalloc_traits<TrieEdge> {};
   79   typedef llvm::ilist<TrieEdge> TrieEdgeList;
 1263   for (TrieEdge &edge : _children) {
 1286         TrieEdge& abEdge = edge;
 1289         auto *bcEdge = new (allocator) TrieEdge(bcEdgeStr, cNode);
 1289         auto *bcEdge = new (allocator) TrieEdge(bcEdgeStr, cNode);
 1304   auto *newEdge = new (allocator) TrieEdge(partialStr, newNode);
 1304   auto *newEdge = new (allocator) TrieEdge(partialStr, newNode);
 1327   for (TrieEdge &edge : _children) {
 1355   for (TrieEdge &edge : _children) {
 1420   for (TrieEdge &edge : _children) {