mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-12-14 11:32:34 +00:00
Reformat blank lines.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@209106 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
14c7036563
commit
6f1b92a0d4
@ -34,7 +34,6 @@ class TerminatorInst;
|
|||||||
/// predecessors.
|
/// predecessors.
|
||||||
void DeleteDeadBlock(BasicBlock *BB);
|
void DeleteDeadBlock(BasicBlock *BB);
|
||||||
|
|
||||||
|
|
||||||
/// FoldSingleEntryPHINodes - We know that BB has one predecessor. If there are
|
/// FoldSingleEntryPHINodes - We know that BB has one predecessor. If there are
|
||||||
/// any single-entry PHI nodes in it, fold them away. This handles the case
|
/// any single-entry PHI nodes in it, fold them away. This handles the case
|
||||||
/// when all entries to the PHI nodes in a block are guaranteed equal, such as
|
/// when all entries to the PHI nodes in a block are guaranteed equal, such as
|
||||||
@ -207,7 +206,6 @@ TerminatorInst *SplitBlockAndInsertIfThen(Value *Cond, Instruction *SplitBefore,
|
|||||||
bool Unreachable,
|
bool Unreachable,
|
||||||
MDNode *BranchWeights = nullptr);
|
MDNode *BranchWeights = nullptr);
|
||||||
|
|
||||||
|
|
||||||
/// SplitBlockAndInsertIfThenElse is similar to SplitBlockAndInsertIfThen,
|
/// SplitBlockAndInsertIfThenElse is similar to SplitBlockAndInsertIfThen,
|
||||||
/// but also creates the ElseBlock.
|
/// but also creates the ElseBlock.
|
||||||
/// Before:
|
/// Before:
|
||||||
|
@ -124,6 +124,7 @@ namespace llvm {
|
|||||||
virtual void replaceCall(Value *With) = 0;
|
virtual void replaceCall(Value *With) = 0;
|
||||||
virtual bool isFoldable(unsigned SizeCIOp, unsigned SizeArgOp,
|
virtual bool isFoldable(unsigned SizeCIOp, unsigned SizeArgOp,
|
||||||
bool isString) const = 0;
|
bool isString) const = 0;
|
||||||
|
|
||||||
public:
|
public:
|
||||||
virtual ~SimplifyFortifiedLibCalls();
|
virtual ~SimplifyFortifiedLibCalls();
|
||||||
bool fold(CallInst *CI, const DataLayout *TD, const TargetLibraryInfo *TLI);
|
bool fold(CallInst *CI, const DataLayout *TD, const TargetLibraryInfo *TLI);
|
||||||
|
@ -65,7 +65,6 @@ struct ClonedCodeInfo {
|
|||||||
ClonedCodeInfo() : ContainsCalls(false), ContainsDynamicAllocas(false) {}
|
ClonedCodeInfo() : ContainsCalls(false), ContainsDynamicAllocas(false) {}
|
||||||
};
|
};
|
||||||
|
|
||||||
|
|
||||||
/// CloneBasicBlock - Return a copy of the specified basic block, but without
|
/// CloneBasicBlock - Return a copy of the specified basic block, but without
|
||||||
/// embedding the block into a particular function. The block returned is an
|
/// embedding the block into a particular function. The block returned is an
|
||||||
/// exact copy of the specified basic block, without any remapping having been
|
/// exact copy of the specified basic block, without any remapping having been
|
||||||
@ -154,7 +153,6 @@ void CloneAndPruneFunctionInto(Function *NewFunc, const Function *OldFunc,
|
|||||||
const DataLayout *DL = nullptr,
|
const DataLayout *DL = nullptr,
|
||||||
Instruction *TheCall = nullptr);
|
Instruction *TheCall = nullptr);
|
||||||
|
|
||||||
|
|
||||||
/// InlineFunctionInfo - This class captures the data input to the
|
/// InlineFunctionInfo - This class captures the data input to the
|
||||||
/// InlineFunction call, and records the auxiliary results produced by it.
|
/// InlineFunction call, and records the auxiliary results produced by it.
|
||||||
class InlineFunctionInfo {
|
class InlineFunctionInfo {
|
||||||
|
@ -120,7 +120,6 @@ namespace llvm {
|
|||||||
BasicBlock *newHeader,
|
BasicBlock *newHeader,
|
||||||
ValueSet &inputs,
|
ValueSet &inputs,
|
||||||
ValueSet &outputs);
|
ValueSet &outputs);
|
||||||
|
|
||||||
};
|
};
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -82,7 +82,6 @@ bool RecursivelyDeleteTriviallyDeadInstructions(Value *V,
|
|||||||
bool RecursivelyDeleteDeadPHINode(PHINode *PN,
|
bool RecursivelyDeleteDeadPHINode(PHINode *PN,
|
||||||
const TargetLibraryInfo *TLI = nullptr);
|
const TargetLibraryInfo *TLI = nullptr);
|
||||||
|
|
||||||
|
|
||||||
/// SimplifyInstructionsInBlock - Scan the specified basic block and try to
|
/// SimplifyInstructionsInBlock - Scan the specified basic block and try to
|
||||||
/// simplify any instructions in it and recursively delete dead instructions.
|
/// simplify any instructions in it and recursively delete dead instructions.
|
||||||
///
|
///
|
||||||
@ -109,7 +108,6 @@ bool SimplifyInstructionsInBlock(BasicBlock *BB, const DataLayout *TD = nullptr,
|
|||||||
void RemovePredecessorAndSimplify(BasicBlock *BB, BasicBlock *Pred,
|
void RemovePredecessorAndSimplify(BasicBlock *BB, BasicBlock *Pred,
|
||||||
DataLayout *TD = nullptr);
|
DataLayout *TD = nullptr);
|
||||||
|
|
||||||
|
|
||||||
/// MergeBasicBlockIntoOnlyPred - BB is a block with one predecessor and its
|
/// MergeBasicBlockIntoOnlyPred - BB is a block with one predecessor and its
|
||||||
/// predecessor is known to have one successor (BB!). Eliminate the edge
|
/// predecessor is known to have one successor (BB!). Eliminate the edge
|
||||||
/// between them, moving the instructions in the predecessor into BB. This
|
/// between them, moving the instructions in the predecessor into BB. This
|
||||||
@ -117,7 +115,6 @@ void RemovePredecessorAndSimplify(BasicBlock *BB, BasicBlock *Pred,
|
|||||||
///
|
///
|
||||||
void MergeBasicBlockIntoOnlyPred(BasicBlock *BB, Pass *P = nullptr);
|
void MergeBasicBlockIntoOnlyPred(BasicBlock *BB, Pass *P = nullptr);
|
||||||
|
|
||||||
|
|
||||||
/// TryToSimplifyUncondBranchFromEmptyBlock - BB is known to contain an
|
/// TryToSimplifyUncondBranchFromEmptyBlock - BB is known to contain an
|
||||||
/// unconditional branch, and contains no instructions other than PHI nodes,
|
/// unconditional branch, and contains no instructions other than PHI nodes,
|
||||||
/// potential debug intrinsics and the branch. If possible, eliminate BB by
|
/// potential debug intrinsics and the branch. If possible, eliminate BB by
|
||||||
|
@ -58,7 +58,6 @@ bool formLCSSA(Loop &L, DominatorTree &DT, ScalarEvolution *SE = nullptr);
|
|||||||
/// Returns true if any modifications are made to the loop.
|
/// Returns true if any modifications are made to the loop.
|
||||||
bool formLCSSARecursively(Loop &L, DominatorTree &DT,
|
bool formLCSSARecursively(Loop &L, DominatorTree &DT,
|
||||||
ScalarEvolution *SE = nullptr);
|
ScalarEvolution *SE = nullptr);
|
||||||
|
|
||||||
}
|
}
|
||||||
|
|
||||||
#endif
|
#endif
|
||||||
|
@ -133,6 +133,7 @@ private:
|
|||||||
class LoadAndStorePromoter {
|
class LoadAndStorePromoter {
|
||||||
protected:
|
protected:
|
||||||
SSAUpdater &SSA;
|
SSAUpdater &SSA;
|
||||||
|
|
||||||
public:
|
public:
|
||||||
LoadAndStorePromoter(const SmallVectorImpl<Instruction*> &Insts,
|
LoadAndStorePromoter(const SmallVectorImpl<Instruction*> &Insts,
|
||||||
SSAUpdater &S, StringRef Name = StringRef());
|
SSAUpdater &S, StringRef Name = StringRef());
|
||||||
@ -145,7 +146,6 @@ public:
|
|||||||
/// removed from the code.
|
/// removed from the code.
|
||||||
void run(const SmallVectorImpl<Instruction*> &Insts) const;
|
void run(const SmallVectorImpl<Instruction*> &Insts) const;
|
||||||
|
|
||||||
|
|
||||||
/// \brief Return true if the specified instruction is in the Inst list.
|
/// \brief Return true if the specified instruction is in the Inst list.
|
||||||
///
|
///
|
||||||
/// The Insts list is the one passed into the constructor. Clients should
|
/// The Insts list is the one passed into the constructor. Clients should
|
||||||
|
@ -37,6 +37,7 @@ protected:
|
|||||||
bool ShouldSplitOverflowIntrinsics;
|
bool ShouldSplitOverflowIntrinsics;
|
||||||
|
|
||||||
virtual void anchor();
|
virtual void anchor();
|
||||||
|
|
||||||
public:
|
public:
|
||||||
IVVisitor(): DT(nullptr), ShouldSplitOverflowIntrinsics(false) {}
|
IVVisitor(): DT(nullptr), ShouldSplitOverflowIntrinsics(false) {}
|
||||||
virtual ~IVVisitor() {}
|
virtual ~IVVisitor() {}
|
||||||
|
@ -30,6 +30,7 @@ namespace llvm {
|
|||||||
/// Impl - A pointer to the actual implementation of the library call
|
/// Impl - A pointer to the actual implementation of the library call
|
||||||
/// simplifier.
|
/// simplifier.
|
||||||
LibCallSimplifierImpl *Impl;
|
LibCallSimplifierImpl *Impl;
|
||||||
|
|
||||||
public:
|
public:
|
||||||
LibCallSimplifier(const DataLayout *TD, const TargetLibraryInfo *TLI,
|
LibCallSimplifier(const DataLayout *TD, const TargetLibraryInfo *TLI,
|
||||||
bool UnsafeFPShrink);
|
bool UnsafeFPShrink);
|
||||||
|
@ -24,6 +24,7 @@ namespace llvm {
|
|||||||
|
|
||||||
struct UnifyFunctionExitNodes : public FunctionPass {
|
struct UnifyFunctionExitNodes : public FunctionPass {
|
||||||
BasicBlock *ReturnBlock, *UnwindBlock, *UnreachableBlock;
|
BasicBlock *ReturnBlock, *UnwindBlock, *UnreachableBlock;
|
||||||
|
|
||||||
public:
|
public:
|
||||||
static char ID; // Pass identification, replacement for typeid
|
static char ID; // Pass identification, replacement for typeid
|
||||||
UnifyFunctionExitNodes() : FunctionPass(ID),
|
UnifyFunctionExitNodes() : FunctionPass(ID),
|
||||||
|
@ -29,7 +29,6 @@ bool UnrollLoop(Loop *L, unsigned Count, unsigned TripCount, bool AllowRuntime,
|
|||||||
|
|
||||||
bool UnrollRuntimeLoopProlog(Loop *L, unsigned Count, LoopInfo *LI,
|
bool UnrollRuntimeLoopProlog(Loop *L, unsigned Count, LoopInfo *LI,
|
||||||
LPPassManager* LPM);
|
LPPassManager* LPM);
|
||||||
|
|
||||||
}
|
}
|
||||||
|
|
||||||
#endif
|
#endif
|
||||||
|
@ -93,7 +93,6 @@ namespace llvm {
|
|||||||
Materializer));
|
Materializer));
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
} // End llvm namespace
|
} // End llvm namespace
|
||||||
|
|
||||||
#endif
|
#endif
|
||||||
|
@ -53,7 +53,6 @@ static inline bool isTriviallyVectorizable(Intrinsic::ID ID) {
|
|||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
static Intrinsic::ID checkUnaryFloatSignature(const CallInst &I,
|
static Intrinsic::ID checkUnaryFloatSignature(const CallInst &I,
|
||||||
Intrinsic::ID ValidIntrinsicID) {
|
Intrinsic::ID ValidIntrinsicID) {
|
||||||
if (I.getNumArgOperands() != 1 ||
|
if (I.getNumArgOperands() != 1 ||
|
||||||
@ -175,7 +174,6 @@ getIntrinsicIDForCall(CallInst *CI, const TargetLibraryInfo *TLI) {
|
|||||||
return Intrinsic::not_intrinsic;
|
return Intrinsic::not_intrinsic;
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
} // llvm namespace
|
} // llvm namespace
|
||||||
|
|
||||||
#endif
|
#endif
|
||||||
|
Loading…
Reference in New Issue
Block a user