Remove a ton of extraneous #includes

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@6842 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2003-06-22 03:08:05 +00:00
parent 18345bb93f
commit 3889a2cb05
60 changed files with 16 additions and 120 deletions

View File

@ -18,7 +18,6 @@
#include <utility>
#include <cstdarg>
#include "boost/type_traits/object_traits.hpp"
#include <assert.h>
/// cl Namespace - This namespace contains all of the command line option

View File

@ -1,4 +1,4 @@
//===-- Support/TarjanSCCIterator.h -Generic Tarjan SCC iterator -*- C++ -*--=//
//===-- Support/TarjanSCCIterator.h - Tarjan SCC iterator -------*- C++ -*-===//
//
// This builds on the Support/GraphTraits.h file to find the strongly
// connected components (SCCs) of a graph in O(N+E) time using
@ -9,18 +9,18 @@
//
// To visit S1 *before* S2, use the TarjanSCCIterator on the Inverse graph.
// (NOTE: This requires some simple wrappers and is not supported yet.)
//
//===----------------------------------------------------------------------===//
#ifndef SUPPORT_TARJANSCCITERATOR_H
#define SUPPORT_TARJANSCCITERATOR_H
#include "Support/GraphTraits.h"
#include <Support/Statistic.h>
#include <Support/iterator>
#include "Support/Statistic.h"
#include "Support/iterator"
#include <vector>
#include <stack>
#include <map>
#include <assert.h>
//--------------------------------------------------------------------------

View File

@ -28,7 +28,6 @@
#include <string>
#include <vector>
#include <iosfwd>
#include <assert.h>
class TimerGroup;
@ -64,7 +63,7 @@ public:
PeakMemBase = T.PeakMemBase;
Name = T.Name;
Started = T.Started;
assert (TG == T.TG && "Can only assign timers in the same TimerGroup!");
assert(TG == T.TG && "Can only assign timers in the same TimerGroup!");
return *this;
}

View File

@ -9,7 +9,6 @@
#define SUPPORT_TREE_H
#include <vector>
#include <assert.h>
template<class ConcreteTreeNode, class Payload>

View File

@ -1,4 +1,4 @@
//===-- Support/TarjanSCCIterator.h -Generic Tarjan SCC iterator -*- C++ -*--=//
//===-- Support/TarjanSCCIterator.h - Tarjan SCC iterator -------*- C++ -*-===//
//
// This builds on the Support/GraphTraits.h file to find the strongly
// connected components (SCCs) of a graph in O(N+E) time using
@ -9,18 +9,18 @@
//
// To visit S1 *before* S2, use the TarjanSCCIterator on the Inverse graph.
// (NOTE: This requires some simple wrappers and is not supported yet.)
//
//===----------------------------------------------------------------------===//
#ifndef SUPPORT_TARJANSCCITERATOR_H
#define SUPPORT_TARJANSCCITERATOR_H
#include "Support/GraphTraits.h"
#include <Support/Statistic.h>
#include <Support/iterator>
#include "Support/Statistic.h"
#include "Support/iterator"
#include <vector>
#include <stack>
#include <map>
#include <assert.h>
//--------------------------------------------------------------------------

View File

@ -9,7 +9,6 @@
#define SUPPORT_TREE_H
#include <vector>
#include <assert.h>
template<class ConcreteTreeNode, class Payload>

View File

@ -10,8 +10,6 @@
#ifndef LLVM_ANALYSIS_ALIASSETTRACKER_H
#define LLVM_ANALYSIS_ALIASSETTRACKER_H
#include <assert.h>
#include "llvm/Support/CallSite.h"
#include "Support/iterator"
#include "Support/hash_map"

View File

@ -41,8 +41,6 @@
#ifndef LLVM_ANALYSIS_CALLGRAPH_H
#define LLVM_ANALYSIS_CALLGRAPH_H
#include <assert.h>
#include "Support/GraphTraits.h"
#include "Support/STLExtras.h"
#include "llvm/Pass.h"

View File

@ -9,8 +9,6 @@
#ifndef LLVM_ANALYSIS_CONSTANTSSCANNER_H
#define LLVM_ANALYSIS_CONSTANTSSCANNER_H
#include <assert.h>
#include "llvm/Support/InstIterator.h"
#include "llvm/Instruction.h"
#include "Support/iterator"

View File

@ -7,8 +7,6 @@
#ifndef LLVM_ANALYSIS_DSGRAPH_H
#define LLVM_ANALYSIS_DSGRAPH_H
#include <assert.h>
#include "llvm/Analysis/DSNode.h"
//===----------------------------------------------------------------------===//

View File

@ -9,8 +9,6 @@
#ifndef LLVM_ANALYSIS_DSGRAPHTRAITS_H
#define LLVM_ANALYSIS_DSGRAPHTRAITS_H
#include <assert.h>
#include "llvm/Analysis/DSGraph.h"
#include "Support/GraphTraits.h"
#include "Support/iterator"

View File

@ -7,11 +7,10 @@
#ifndef LLVM_ANALYSIS_DSSUPPORT_H
#define LLVM_ANALYSIS_DSSUPPORT_H
#include <assert.h>
#include <vector>
#include <functional>
#include <string>
#include <assert.h>
#include "Support/HashExtras.h"
#include "Support/hash_set"

View File

@ -7,8 +7,6 @@
#ifndef LLVM_ANALYSIS_DATA_STRUCTURE_H
#define LLVM_ANALYSIS_DATA_STRUCTURE_H
#include <assert.h>
#include "llvm/Pass.h"
#include "Support/HashExtras.h"
#include "Support/hash_set"

View File

@ -7,8 +7,6 @@
#ifndef LLVM_ANALYSIS_DSGRAPH_H
#define LLVM_ANALYSIS_DSGRAPH_H
#include <assert.h>
#include "llvm/Analysis/DSNode.h"
//===----------------------------------------------------------------------===//

View File

@ -9,8 +9,6 @@
#ifndef LLVM_ANALYSIS_DSGRAPHTRAITS_H
#define LLVM_ANALYSIS_DSGRAPHTRAITS_H
#include <assert.h>
#include "llvm/Analysis/DSGraph.h"
#include "Support/GraphTraits.h"
#include "Support/iterator"

View File

@ -7,11 +7,10 @@
#ifndef LLVM_ANALYSIS_DSSUPPORT_H
#define LLVM_ANALYSIS_DSSUPPORT_H
#include <assert.h>
#include <vector>
#include <functional>
#include <string>
#include <assert.h>
#include "Support/HashExtras.h"
#include "Support/hash_set"

View File

@ -7,8 +7,6 @@
#ifndef LLVM_ANALYSIS_DATA_STRUCTURE_H
#define LLVM_ANALYSIS_DATA_STRUCTURE_H
#include <assert.h>
#include "llvm/Pass.h"
#include "Support/HashExtras.h"
#include "Support/hash_set"

View File

@ -14,7 +14,6 @@
//
//===----------------------------------------------------------------------===//
#ifndef LLVM_ANALYSIS_DEPENDENCEGRAPH_H
#define LLVM_ANALYSIS_DEPENDENCEGRAPH_H
@ -22,7 +21,6 @@
#include <iosfwd>
#include <vector>
#include <utility>
#include <assert.h>
class Instruction;

View File

@ -20,7 +20,6 @@
#include "llvm/Pass.h"
#include <set>
#include <assert.h>
class Instruction;
template <typename GraphType> struct GraphTraits;

View File

@ -39,8 +39,6 @@
#ifndef LLVM_ANALYSIS_IPMODREF_H
#define LLVM_ANALYSIS_IPMODREF_H
#include <assert.h>
#include "llvm/Pass.h"
#include "Support/BitSetVector.h"
#include "Support/hash_map"

View File

@ -14,12 +14,9 @@
#ifndef LLVM_ANALYSIS_INSTFOREST_H
#define LLVM_ANALYSIS_INSTFOREST_H
#include "llvm/Instruction.h"
#include "llvm/BasicBlock.h"
#include "llvm/Function.h"
#include "Support/Tree.h"
#include <map>
#include <assert.h>
template<class Payload> class InstTreeNode;
template<class Payload> class InstForest;

View File

@ -28,12 +28,10 @@
#include "llvm/Analysis/IntervalPartition.h"
#include "llvm/Function.h"
#include "llvm/BasicBlock.h"
#include "llvm/Support/CFG.h"
#include <stack>
#include <set>
#include <algorithm>
#include <assert.h>
// getNodeHeader - Given a source graph node and the source graph, return the
// BasicBlock that is the header node. This is the opposite of

View File

@ -7,6 +7,7 @@
//
// The result of this pass is a DependenceGraph for each function
// representing the memory-based data dependences between instructions.
//
//===----------------------------------------------------------------------===//
#ifndef LLVM_ANALYSIS_MEMORYDEPANALYSIS_H
@ -17,17 +18,11 @@
#include "llvm/Analysis/DataStructure.h"
#include "llvm/Pass.h"
#include "Support/TarjanSCCIterator.h"
#include "Support/NonCopyable.h"
#include "Support/hash_map"
#include <assert.h>
class Instruction;
class Function;
class DSGraph;
class ModRefTable;
///---------------------------------------------------------------------------
/// class MemoryDepGraph:
/// Dependence analysis for load/store/call instructions using IPModRef info

View File

@ -26,6 +26,7 @@
//
// class PgmDependenceGraph -- Interface to obtain PDGIterators for each
// instruction.
//
//===----------------------------------------------------------------------===//
#ifndef LLVM_ANALYSIS_PGMDEPENDENCEGRAPH_H
@ -35,15 +36,9 @@
#include "llvm/Analysis/MemoryDepAnalysis.h"
/* #include "llvm/Analysis/PostDominators.h" -- see below */
#include "llvm/Instruction.h"
#include "llvm/Value.h"
#include "llvm/Pass.h"
#include "Support/NonCopyable.h"
#include <iterator>
#include <assert.h>
class Instruction;
class Function;
class DSGraph;
class DependenceGraph;
class PgmDependenceGraph;

View File

@ -21,10 +21,8 @@
#include "llvm/Instruction.h"
#include "Support/HashExtras.h"
#include <assert.h>
class Constant;
class BasicBlock;
class Function;
class InstrTreeNode;
class InstrForest;

View File

@ -8,7 +8,6 @@
#define LLVM_CODEGEN_INSTR_SELECTION_H
#include "llvm/Instruction.h"
#include <assert.h>
class Function;
class InstrForest;
class MachineInstr;

View File

@ -24,7 +24,6 @@
#include "llvm/CodeGen/MachineFunctionPass.h"
#include <map>
#include <assert.h>
class MRegisterInfo;

View File

@ -20,7 +20,6 @@
#include "Support/Annotation.h"
#include <vector>
#include <assert.h>
class MachineInstr;
class Instruction;

View File

@ -13,7 +13,6 @@
#include "Support/Annotation.h"
#include "Support/iterator"
#include <set>
#include <assert.h>
class Value;
class Function;

View File

@ -10,8 +10,6 @@
#include "llvm/CodeGen/MachineInstr.h"
#include "llvm/Target/TargetRegInfo.h"
#include <assert.h>
class Value;
class TmpInstruction;
class CallInst;

View File

@ -11,9 +11,6 @@
#define LLVM_CODEGEN_SSAREGMAP_H
#include "llvm/Target/MRegisterInfo.h"
#include <assert.h>
class TargetRegisterClass;
class SSARegMap {

View File

@ -7,7 +7,6 @@
#ifndef LLVM_CONSTANT_H
#define LLVM_CONSTANT_H
#include <assert.h>
#include "llvm/User.h"
class Constant : public User {

View File

@ -33,8 +33,6 @@
#ifndef LLVM_CONSTANTHANDLING_H
#define LLVM_CONSTANTHANDLING_H
#include <assert.h>
#include "llvm/Constants.h"
#include "llvm/Type.h"
class PointerType;

View File

@ -8,8 +8,6 @@
#ifndef LLVM_CONSTANTS_H
#define LLVM_CONSTANTS_H
#include <assert.h>
#include "llvm/Constant.h"
#include "Support/DataTypes.h"

View File

@ -11,8 +11,6 @@
#ifndef LLVM_DERIVED_TYPES_H
#define LLVM_DERIVED_TYPES_H
#include <assert.h>
#include "llvm/Type.h"
class DerivedType : public Type {

View File

@ -13,8 +13,6 @@
#ifndef LLVM_GLOBAL_VARIABLE_H
#define LLVM_GLOBAL_VARIABLE_H
#include <assert.h>
#include "llvm/GlobalValue.h"
class Module;
class Constant;

View File

@ -8,8 +8,6 @@
#ifndef LLVM_INSTRUCTION_H
#define LLVM_INSTRUCTION_H
#include <assert.h>
#include "llvm/User.h"
template<typename SC> struct ilist_traits;
template<typename ValueSubClass, typename ItemParentClass, typename SymTabClass,

View File

@ -23,7 +23,6 @@
#define LLVM_PASS_H
#include <assert.h>
#include <vector>
#include <map>
#include <iosfwd>

View File

@ -14,8 +14,6 @@
// No need to include Pass.h, we are being included by it!
#include <assert.h>
//===----------------------------------------------------------------------===//
// AnalysisUsage - Represent the analysis usage information of a pass. This
// tracks analyses that the pass REQUIRES (must available when the pass runs),

View File

@ -14,8 +14,6 @@
#ifndef LLVM_PASS_SUPPORT_H
#define LLVM_PASS_SUPPORT_H
#include <assert.h>
// No need to include Pass.h, we are being included by it!
class TargetMachine;

View File

@ -13,8 +13,6 @@
#include "llvm/InstrTypes.h"
#include "Support/iterator"
#include <assert.h>
//===--------------------------------------------------------------------===//
// BasicBlock pred_iterator definition
//===--------------------------------------------------------------------===//

View File

@ -18,7 +18,6 @@
#include <utility>
#include <cstdarg>
#include "boost/type_traits/object_traits.hpp"
#include <assert.h>
/// cl Namespace - This namespace contains all of the command line option

View File

@ -44,7 +44,6 @@
#define LLVM_SUPPORT_INSTVISITOR_H
#include "llvm/Instruction.h"
#include <assert.h>
class Module;

View File

@ -20,7 +20,6 @@
#include "llvm/Pass.h"
#include <algorithm>
#include <iostream>
#include <assert.h>
//===----------------------------------------------------------------------===//
// PassNameParser class - Make use of the pass registration mechanism to

View File

@ -28,7 +28,6 @@
#include <string>
#include <vector>
#include <iosfwd>
#include <assert.h>
class TimerGroup;
@ -64,7 +63,7 @@ public:
PeakMemBase = T.PeakMemBase;
Name = T.Name;
Started = T.Started;
assert (TG == T.TG && "Can only assign timers in the same TimerGroup!");
assert(TG == T.TG && "Can only assign timers in the same TimerGroup!");
return *this;
}

View File

@ -16,8 +16,6 @@
#ifndef LLVM_SYMBOL_TABLE_H
#define LLVM_SYMBOL_TABLE_H
#include <assert.h>
#include "llvm/Value.h"
#include <map>

View File

@ -10,7 +10,6 @@
#define LLVM_TARGET_MREGISTERINFO_H
#include "llvm/CodeGen/MachineBasicBlock.h"
#include <assert.h>
class Type;
class MachineFunction;

View File

@ -10,7 +10,6 @@
#include "llvm/Target/TargetInstrInfo.h"
#include "Support/hash_map"
#include <string>
#include <assert.h>
typedef long long cycles_t;
static const cycles_t HUGE_LATENCY = ~((long long) 1 << (sizeof(cycles_t)-2));

View File

@ -12,8 +12,6 @@
#ifndef LLVM_USER_H
#define LLVM_USER_H
#include <assert.h>
#include "llvm/Value.h"
class User : public Value {

View File

@ -8,8 +8,6 @@
#ifndef LLVM_IOTHER_H
#define LLVM_IOTHER_H
#include <assert.h>
#include "llvm/InstrTypes.h"
//===----------------------------------------------------------------------===//

View File

@ -7,8 +7,6 @@
#ifndef LLVM_IPHINODE_H
#define LLVM_IPHINODE_H
#include <assert.h>
#include "llvm/Instruction.h"
class BasicBlock;

View File

@ -9,8 +9,6 @@
#ifndef LLVM_ITERMINATORS_H
#define LLVM_ITERMINATORS_H
#include <assert.h>
#include "llvm/InstrTypes.h"
//===---------------------------------------------------------------------------

View File

@ -26,7 +26,6 @@
#define IG_NODE_H
#include "llvm/CodeGen/LiveRange.h"
#include <assert.h>
class RegClass;
//----------------------------------------------------------------------------

View File

@ -1,4 +1,4 @@
//===-- LiveRange.h - Store info about a live range --------------*- C++ -*--=//
//===-- LiveRange.h - Store info about a live range -------------*- C++ -*-===//
//
// Implements a live range using a ValueSet. A LiveRange is a simple set
// of Values.
@ -14,11 +14,8 @@
#include "llvm/CodeGen/ValueSet.h"
#include "llvm/Value.h"
#include <assert.h>
class RegClass;
class IGNode;
class Type;
class LiveRange : public ValueSet {
RegClass *MyRegClass; // register classs (e.g., int, FP) for this LR

View File

@ -20,7 +20,6 @@
#include "Support/Annotation.h"
#include <vector>
#include <assert.h>
class MachineInstr;
class Instruction;

View File

@ -10,8 +10,6 @@
#include "llvm/CodeGen/MachineInstr.h"
#include "llvm/Target/TargetRegInfo.h"
#include <assert.h>
class Value;
class TmpInstruction;
class CallInst;

View File

@ -26,7 +26,6 @@
#define IG_NODE_H
#include "llvm/CodeGen/LiveRange.h"
#include <assert.h>
class RegClass;
//----------------------------------------------------------------------------

View File

@ -1,4 +1,4 @@
//===-- LiveRange.h - Store info about a live range --------------*- C++ -*--=//
//===-- LiveRange.h - Store info about a live range -------------*- C++ -*-===//
//
// Implements a live range using a ValueSet. A LiveRange is a simple set
// of Values.
@ -14,11 +14,8 @@
#include "llvm/CodeGen/ValueSet.h"
#include "llvm/Value.h"
#include <assert.h>
class RegClass;
class IGNode;
class Type;
class LiveRange : public ValueSet {
RegClass *MyRegClass; // register classs (e.g., int, FP) for this LR

View File

@ -33,8 +33,6 @@
#ifndef LLVM_CONSTANTHANDLING_H
#define LLVM_CONSTANTHANDLING_H
#include <assert.h>
#include "llvm/Constants.h"
#include "llvm/Type.h"
class PointerType;

View File

@ -33,8 +33,6 @@
#ifndef LLVM_CONSTANTHANDLING_H
#define LLVM_CONSTANTHANDLING_H
#include <assert.h>
#include "llvm/Constants.h"
#include "llvm/Type.h"
class PointerType;