LLVM  6.0.0svn
Classes | Namespaces | Typedefs | Functions
IntervalIterator.h File Reference
#include "llvm/ADT/GraphTraits.h"
#include "llvm/Analysis/Interval.h"
#include "llvm/Analysis/IntervalPartition.h"
#include "llvm/IR/CFG.h"
#include "llvm/IR/Function.h"
#include "llvm/Support/ErrorHandling.h"
#include <algorithm>
#include <cassert>
#include <iterator>
#include <set>
#include <utility>
#include <vector>
Include dependency graph for IntervalIterator.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes

class  llvm::IntervalIterator< NodeTy, OrigContainer_t, GT, IGT >
 

Namespaces

 llvm
 Compute iterated dominance frontiers using a linear time algorithm.
 

Typedefs

using llvm::function_interval_iterator = IntervalIterator< BasicBlock, Function >
 
using llvm::interval_part_interval_iterator = IntervalIterator< Interval, IntervalPartition >
 

Functions

BasicBlock * llvm::getNodeHeader (BasicBlock *BB)
 
BasicBlock * llvm::getNodeHeader (Interval *I)
 
BasicBlock * llvm::getSourceGraphNode (Function *, BasicBlock *BB)
 
Intervalllvm::getSourceGraphNode (IntervalPartition *IP, BasicBlock *BB)
 
void llvm::addNodeToInterval (Interval *Int, BasicBlock *BB)
 
void llvm::addNodeToInterval (Interval *Int, Interval *I)
 
function_interval_iterator llvm::intervals_begin (Function *F, bool DeleteInts=true)
 
function_interval_iterator llvm::intervals_end (Function *)
 
interval_part_interval_iterator llvm::intervals_begin (IntervalPartition &IP, bool DeleteIntervals=true)
 
interval_part_interval_iterator llvm::intervals_end (IntervalPartition &IP)