llvm.org GIT mirror llvm / release_26 include / llvm / ADT / ilist_node.h
release_26

Tree @release_26 (Download .tar.gz)

ilist_node.h @release_26

fed90b6
3a54b3d
fed90b6
 
 
 
3a54b3d
fed90b6
 
 
 
 
 
 
 
 
 
 
 
 
9c01f2d
76d3838
 
9c01f2d
0a0e68a
fed90b6
 
 
 
9c01f2d
 
fed90b6
a05764c
9c01f2d
 
fed90b6
9c01f2d
fed90b6
9c01f2d
fed90b6
 
9c01f2d
fed90b6
 
 
 
 
//==-- llvm/ADT/ilist_node.h - Intrusive Linked List Helper ------*- C++ -*-==//
//
//                     The LLVM Compiler Infrastructure
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// This file defines the ilist_node class template, which is a convenient
// base class for creating classes that can be used with ilists.
//
//===----------------------------------------------------------------------===//

#ifndef LLVM_ADT_ILIST_NODE_H
#define LLVM_ADT_ILIST_NODE_H

namespace llvm {

template<typename NodeTy>
struct ilist_nextprev_traits;

template<typename NodeTy>
struct ilist_traits;

/// ilist_node - Base class that provides next/prev services for nodes
/// that use ilist_nextprev_traits or ilist_default_traits.
///
template<typename NodeTy>
class ilist_node {
private:
  friend struct ilist_nextprev_traits<NodeTy>;
  friend struct ilist_traits<NodeTy>;
  NodeTy *Prev, *Next;
  NodeTy *getPrev() { return Prev; }
  NodeTy *getNext() { return Next; }
  const NodeTy *getPrev() const { return Prev; }
  const NodeTy *getNext() const { return Next; }
  void setPrev(NodeTy *N) { Prev = N; }
  void setNext(NodeTy *N) { Next = N; }
protected:
  ilist_node() : Prev(0), Next(0) {}
};

} // End llvm namespace

#endif