projects
/
oota-llvm.git
/ blobdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
|
commitdiff
|
tree
raw
|
inline
| side by side
Simplify code, don't or a bool with an uint64_t.
[oota-llvm.git]
/
lib
/
CodeGen
/
CodePlacementOpt.cpp
diff --git
a/lib/CodeGen/CodePlacementOpt.cpp
b/lib/CodeGen/CodePlacementOpt.cpp
index e37356a60cfd1e8225377aec6dc831d490d14bc2..1009a1e29c58cab67ecfb955b1e014dc0768a2db 100644
(file)
--- a/
lib/CodeGen/CodePlacementOpt.cpp
+++ b/
lib/CodeGen/CodePlacementOpt.cpp
@@
-39,9
+39,6
@@
namespace {
CodePlacementOpt() : MachineFunctionPass(ID) {}
virtual bool runOnMachineFunction(MachineFunction &MF);
CodePlacementOpt() : MachineFunctionPass(ID) {}
virtual bool runOnMachineFunction(MachineFunction &MF);
- virtual const char *getPassName() const {
- return "Code Placement Optimizer";
- }
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
AU.addRequired<MachineLoopInfo>();
virtual void getAnalysisUsage(AnalysisUsage &AU) const {
AU.addRequired<MachineLoopInfo>();
@@
-69,9
+66,9
@@
namespace {
char CodePlacementOpt::ID = 0;
} // end anonymous namespace
char CodePlacementOpt::ID = 0;
} // end anonymous namespace
-FunctionPass *llvm::createCodePlacementOptPass() {
- return new CodePlacementOpt();
-}
+char &llvm::CodePlacementOptID = CodePlacementOpt::ID;
+INITIALIZE_PASS(CodePlacementOpt, "code-placement",
+ "Code Placement Optimizer", false, false)
/// HasFallthrough - Test whether the given branch has a fallthrough, either as
/// a plain fallthrough or as a fallthrough case of a conditional branch.
/// HasFallthrough - Test whether the given branch has a fallthrough, either as
/// a plain fallthrough or as a fallthrough case of a conditional branch.
@@
-204,7
+201,7
@@
bool CodePlacementOpt::EliminateUnconditionalJumpsToTop(MachineFunction &MF,
// fallthrough edge.
if (!Prior->isSuccessor(End))
goto next_pred;
// fallthrough edge.
if (!Prior->isSuccessor(End))
goto next_pred;
- // Otherwise we can stop scanning and proce
de
to move the blocks.
+ // Otherwise we can stop scanning and proce
ed
to move the blocks.
break;
}
// If we hit a switch or something complicated, don't move anything
break;
}
// If we hit a switch or something complicated, don't move anything
@@
-254,7
+251,7
@@
bool CodePlacementOpt::MoveDiscontiguousLoopBlocks(MachineFunction &MF,
// Determine a position to move orphaned loop blocks to. If TopMBB is not
// entered via fallthrough and BotMBB is exited via fallthrough, prepend them
// Determine a position to move orphaned loop blocks to. If TopMBB is not
// entered via fallthrough and BotMBB is exited via fallthrough, prepend them
- // to the top of the loop to avoid lo
o
sing that fallthrough. Otherwise append
+ // to the top of the loop to avoid losing that fallthrough. Otherwise append
// them to the bottom, even if it previously had a fallthrough, on the theory
// that it's worth an extra branch to keep the loop contiguous.
MachineFunction::iterator InsertPt =
// them to the bottom, even if it previously had a fallthrough, on the theory
// that it's worth an extra branch to keep the loop contiguous.
MachineFunction::iterator InsertPt =
@@
-376,7
+373,7
@@
bool CodePlacementOpt::OptimizeIntraLoopEdges(MachineFunction &MF) {
///
bool CodePlacementOpt::AlignLoops(MachineFunction &MF) {
const Function *F = MF.getFunction();
///
bool CodePlacementOpt::AlignLoops(MachineFunction &MF) {
const Function *F = MF.getFunction();
- if (F->
hasFnAttr(Attribute::OptimizeForSize
))
+ if (F->
getFnAttributes().hasOptimizeForSizeAttr(
))
return false;
unsigned Align = TLI->getPrefLoopAlignment();
return false;
unsigned Align = TLI->getPrefLoopAlignment();