mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-07-18 12:29:27 +00:00
3ff4387113
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@664 91177308-0d34-0410-b5e6-96231b3b80d8
145 lines
5.3 KiB
C++
145 lines
5.3 KiB
C++
//===-- llvm/CFGdecls.h - CFG forward declarations ---------------*- C++ -*--=//
|
|
//
|
|
// This file contains forward declarations for CFG functions and data
|
|
// structures. This is used to reduce compile time dependencies among files.
|
|
// Any users of these functions must include CFG.h to get their full
|
|
// definitions.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef LLVM_CFG_DECLS_H
|
|
#define LLVM_CFG_DECLS_H
|
|
|
|
#include "llvm/Value.h"
|
|
class TerminatorInst;
|
|
class BasicBlock;
|
|
class Method;
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
// Interface
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
namespace cfg {
|
|
|
|
//===--------------------------------------------------------------------===//
|
|
// Predecessor iterator code
|
|
//===--------------------------------------------------------------------===//
|
|
//
|
|
// This is used to figure out what basic blocks we could be coming from.
|
|
//
|
|
|
|
// Forward declare iterator class template...
|
|
template <class _Ptr, class _USE_iterator> class PredIterator;
|
|
|
|
typedef PredIterator<BasicBlock, Value::use_iterator> pred_iterator;
|
|
typedef PredIterator<const BasicBlock,
|
|
Value::use_const_iterator> pred_const_iterator;
|
|
|
|
inline pred_iterator pred_begin( BasicBlock *BB);
|
|
inline pred_const_iterator pred_begin(const BasicBlock *BB);
|
|
inline pred_iterator pred_end ( BasicBlock *BB);
|
|
inline pred_const_iterator pred_end (const BasicBlock *BB);
|
|
|
|
|
|
//===--------------------------------------------------------------------===//
|
|
// Successor iterator code
|
|
//===--------------------------------------------------------------------===//
|
|
//
|
|
// This is used to figure out what basic blocks we could be going to...
|
|
//
|
|
|
|
// Forward declare iterator class template...
|
|
template <class _Term, class _BB> class SuccIterator;
|
|
|
|
typedef SuccIterator<TerminatorInst*, BasicBlock> succ_iterator;
|
|
typedef SuccIterator<const TerminatorInst*,
|
|
const BasicBlock> succ_const_iterator;
|
|
|
|
inline succ_iterator succ_begin( BasicBlock *BB);
|
|
inline succ_const_iterator succ_begin(const BasicBlock *BB);
|
|
inline succ_iterator succ_end ( BasicBlock *BB);
|
|
inline succ_const_iterator succ_end (const BasicBlock *BB);
|
|
|
|
#if 0
|
|
//===--------------------------------------------------------------------===//
|
|
// <Reverse> Depth First CFG iterator code
|
|
//===--------------------------------------------------------------------===//
|
|
//
|
|
// This is used to visit basic blocks in a method in either depth first, or
|
|
// reverse depth first ordering, depending on the value passed to the df_begin
|
|
// method.
|
|
//
|
|
struct BasicBlockGraph;
|
|
struct ConstBasicBlockGraph;
|
|
struct InverseBasicBlockGraph;
|
|
struct ConstInverseBasicBlockGraph;
|
|
struct TypeGraph;
|
|
|
|
// Forward declare iterator class template...
|
|
template<class GraphInfo> class DFIterator;
|
|
|
|
// Normal Depth First Iterator Definitions (Forward and Reverse)
|
|
typedef DFIterator< BasicBlockGraph> df_iterator;
|
|
typedef DFIterator<ConstBasicBlockGraph> df_const_iterator;
|
|
|
|
inline df_iterator df_begin( Method *M, bool Reverse = false);
|
|
inline df_const_iterator df_begin(const Method *M, bool Reverse = false);
|
|
inline df_iterator df_end ( Method *M);
|
|
inline df_const_iterator df_end (const Method *M);
|
|
|
|
inline df_iterator df_begin( BasicBlock *BB, bool Reverse = false);
|
|
inline df_const_iterator df_begin(const BasicBlock *BB, bool Reverse = false);
|
|
inline df_iterator df_end ( BasicBlock *BB);
|
|
inline df_const_iterator df_end (const BasicBlock *BB);
|
|
|
|
|
|
// Inverse Depth First Iterator Definitions (Forward and Reverse) - Traverse
|
|
// predecessors instead of successors...
|
|
//
|
|
typedef DFIterator< InverseBasicBlockGraph> idf_iterator;
|
|
typedef DFIterator<ConstInverseBasicBlockGraph> idf_const_iterator;
|
|
|
|
inline idf_iterator idf_begin( BasicBlock *BB, bool Reverse = false);
|
|
inline idf_const_iterator idf_begin(const BasicBlock *BB, bool Reverse = false);
|
|
inline idf_iterator idf_end ( BasicBlock *BB);
|
|
inline idf_const_iterator idf_end (const BasicBlock *BB);
|
|
|
|
|
|
// Depth First Iterator Definitions for Types. This lets you iterator over
|
|
// (possibly cyclic) type graphs in dfo
|
|
//
|
|
typedef DFIterator<TypeGraph> tdf_iterator;
|
|
|
|
inline tdf_iterator tdf_begin(const Type *T, bool Reverse = false);
|
|
inline tdf_iterator tdf_end (const Type *T);
|
|
|
|
|
|
//===--------------------------------------------------------------------===//
|
|
// Post Order CFG iterator code
|
|
//===--------------------------------------------------------------------===//
|
|
//
|
|
// This is used to visit basic blocks in a method in standard post order.
|
|
//
|
|
|
|
// Forward declare iterator class template...
|
|
template<class BBType, class SuccItTy> class POIterator;
|
|
|
|
typedef POIterator<BasicBlock, succ_iterator> po_iterator;
|
|
typedef POIterator<const BasicBlock,
|
|
succ_const_iterator> po_const_iterator;
|
|
|
|
inline po_iterator po_begin( Method *M);
|
|
inline po_const_iterator po_begin(const Method *M);
|
|
inline po_iterator po_end ( Method *M);
|
|
inline po_const_iterator po_end (const Method *M);
|
|
|
|
inline po_iterator po_begin( BasicBlock *BB);
|
|
inline po_const_iterator po_begin(const BasicBlock *BB);
|
|
inline po_iterator po_end ( BasicBlock *BB);
|
|
inline po_const_iterator po_end (const BasicBlock *BB);
|
|
#endif
|
|
|
|
} // End namespace cfg
|
|
|
|
#endif
|