LLVM  6.0.0svn
Classes | Namespaces | Functions
MachineBasicBlock.h File Reference
#include "llvm/ADT/GraphTraits.h"
#include "llvm/ADT/ilist.h"
#include "llvm/ADT/ilist_node.h"
#include "llvm/ADT/iterator_range.h"
#include "llvm/ADT/simple_ilist.h"
#include "llvm/CodeGen/MachineInstr.h"
#include "llvm/CodeGen/MachineInstrBundleIterator.h"
#include "llvm/IR/DebugLoc.h"
#include "llvm/MC/LaneBitmask.h"
#include "llvm/MC/MCRegisterInfo.h"
#include "llvm/Support/BranchProbability.h"
#include <cassert>
#include <cstdint>
#include <functional>
#include <iterator>
#include <string>
#include <vector>
Include dependency graph for MachineBasicBlock.h:

Go to the source code of this file.

Classes

struct  llvm::ilist_traits< MachineInstr >
 
class  llvm::MachineBasicBlock
 
struct  llvm::MachineBasicBlock::RegisterMaskPair
 Pair of physical register and lane mask. More...
 
struct  llvm::MBB2NumberFunctor
 
struct  llvm::GraphTraits< MachineBasicBlock * >
 
struct  llvm::GraphTraits< const MachineBasicBlock * >
 
struct  llvm::GraphTraits< Inverse< MachineBasicBlock * > >
 
struct  llvm::GraphTraits< Inverse< const MachineBasicBlock * > >
 
class  llvm::MachineInstrSpan
 MachineInstrSpan provides an interface to get an iteration range containing the instruction it was initialized with, along with all those instructions inserted prior to or following that instruction at some point after the MachineInstrSpan is constructed. More...
 

Namespaces

 llvm
 Compute iterated dominance frontiers using a linear time algorithm.
 

Functions

raw_ostreamllvm::operator<< (raw_ostream &OS, const MachineBasicBlock &MBB)
 
template<typename IterT >
IterT llvm::skipDebugInstructionsForward (IterT It, IterT End)
 Increment It until it points to a non-debug instruction or to End and return the resulting iterator. More...
 
template<class IterT >
IterT llvm::skipDebugInstructionsBackward (IterT It, IterT Begin)
 Decrement It until it points to a non-debug instruction or to Begin and return the resulting iterator. More...