|
LLVM
3.7.0
|
#include "llvm/ADT/GraphTraits.h"#include "llvm/ADT/PointerIntPair.h"#include "llvm/ADT/SmallPtrSet.h"#include "llvm/ADT/iterator_range.h"#include <set>#include <vector>Go to the source code of this file.
Namespaces | |
| llvm | |
| Compute iterated dominance frontiers using a linear time algorithm. | |
Functions | |
| template<class T > | |
| df_iterator< T > | llvm::df_begin (const T &G) |
| template<class T > | |
| df_iterator< T > | llvm::df_end (const T &G) |
| template<class T > | |
| iterator_range< df_iterator< T > > | llvm::depth_first (const T &G) |
| template<class T , class SetTy > | |
| df_ext_iterator< T, SetTy > | llvm::df_ext_begin (const T &G, SetTy &S) |
| template<class T , class SetTy > | |
| df_ext_iterator< T, SetTy > | llvm::df_ext_end (const T &G, SetTy &S) |
| template<class T , class SetTy > | |
| iterator_range < df_ext_iterator< T, SetTy > > | llvm::depth_first_ext (const T &G, SetTy &S) |
| template<class T > | |
| idf_iterator< T > | llvm::idf_begin (const T &G) |
| template<class T > | |
| idf_iterator< T > | llvm::idf_end (const T &G) |
| template<class T > | |
| iterator_range< idf_iterator< T > > | llvm::inverse_depth_first (const T &G) |
| template<class T , class SetTy > | |
| idf_ext_iterator< T, SetTy > | llvm::idf_ext_begin (const T &G, SetTy &S) |
| template<class T , class SetTy > | |
| idf_ext_iterator< T, SetTy > | llvm::idf_ext_end (const T &G, SetTy &S) |
| template<class T , class SetTy > | |
| iterator_range < idf_ext_iterator< T, SetTy > > | llvm::inverse_depth_first_ext (const T &G, SetTy &S) |
1.8.6