LLVM  3.7.0
Classes | Namespaces | Functions
ilist.h File Reference
#include "llvm/Support/Compiler.h"
#include <algorithm>
#include <cassert>
#include <cstddef>
#include <iterator>
Include dependency graph for ilist.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes

class  llvm::iplist< NodeTy, Traits >
 iplist - The subset of list functionality that can safely be used on nodes of polymorphic types, i.e. More...
 
class  llvm::ilist_iterator< NodeTy >
 
struct  llvm::ilist_nextprev_traits< NodeTy >
 ilist_nextprev_traits - A fragment for template traits for intrusive list that provides default next/prev implementations for common operations. More...
 
struct  llvm::ilist_traits< NodeTy >
 
struct  llvm::ilist_sentinel_traits< NodeTy >
 ilist_sentinel_traits - A fragment for template traits for intrusive list that provides default sentinel implementations for common operations. More...
 
struct  llvm::ilist_node_traits< NodeTy >
 ilist_node_traits - A fragment for template traits for intrusive list that provides default node related operations. More...
 
struct  llvm::ilist_default_traits< NodeTy >
 ilist_default_traits - Default template traits for intrusive list. More...
 
struct  llvm::ilist_traits< NodeTy >
 
struct  llvm::ilist_traits< const Ty >
 
class  llvm::ilist_iterator< NodeTy >
 
struct  llvm::simplify_type< From >
 
struct  llvm::simplify_type< ilist_iterator< NodeTy > >
 
struct  llvm::simplify_type< const ilist_iterator< NodeTy > >
 
class  llvm::iplist< NodeTy, Traits >
 iplist - The subset of list functionality that can safely be used on nodes of polymorphic types, i.e. More...
 
struct  llvm::ilist< NodeTy >
 

Namespaces

 llvm
 Compute iterated dominance frontiers using a linear time algorithm.
 
 std
 

Functions

template<typename T >
void llvm::operator- (int, ilist_iterator< T >)=delete
 
template<typename T >
void llvm::operator- (ilist_iterator< T >, int)=delete
 
template<typename T >
void llvm::operator+ (int, ilist_iterator< T >)=delete
 
template<typename T >
void llvm::operator+ (ilist_iterator< T >, int)=delete
 
template<typename T >
bool llvm::operator!= (const T *LHS, const ilist_iterator< const T > &RHS)
 
template<typename T >
bool llvm::operator== (const T *LHS, const ilist_iterator< const T > &RHS)
 
template<typename T >
bool llvm::operator!= (T *LHS, const ilist_iterator< T > &RHS)
 
template<typename T >
bool llvm::operator== (T *LHS, const ilist_iterator< T > &RHS)
 
template<class Ty >
void std::swap (llvm::iplist< Ty > &Left, llvm::iplist< Ty > &Right)