mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-25 12:12:47 +01:00
grammar and trailing whitespace
llvm-svn: 107811
This commit is contained in:
parent
3e07e4eb8b
commit
d13cc7716e
@ -337,7 +337,7 @@ bool ARMConstantIslands::runOnMachineFunction(MachineFunction &MF) {
|
|||||||
if (CPChange && ++NoCPIters > 30)
|
if (CPChange && ++NoCPIters > 30)
|
||||||
llvm_unreachable("Constant Island pass failed to converge!");
|
llvm_unreachable("Constant Island pass failed to converge!");
|
||||||
DEBUG(dumpBBs());
|
DEBUG(dumpBBs());
|
||||||
|
|
||||||
// Clear NewWaterList now. If we split a block for branches, it should
|
// Clear NewWaterList now. If we split a block for branches, it should
|
||||||
// appear as "new water" for the next iteration of constant pool placement.
|
// appear as "new water" for the next iteration of constant pool placement.
|
||||||
NewWaterList.clear();
|
NewWaterList.clear();
|
||||||
@ -361,8 +361,8 @@ bool ARMConstantIslands::runOnMachineFunction(MachineFunction &MF) {
|
|||||||
// After a while, this might be made debug-only, but it is not expensive.
|
// After a while, this might be made debug-only, but it is not expensive.
|
||||||
verify(MF);
|
verify(MF);
|
||||||
|
|
||||||
// If LR has been forced spilled and no far jumps (i.e. BL) has been issued.
|
// If LR has been forced spilled and no far jump (i.e. BL) has been issued,
|
||||||
// Undo the spill / restore of LR if possible.
|
// undo the spill / restore of LR if possible.
|
||||||
if (isThumb && !HasFarJump && AFI->isLRSpilledForFarJump())
|
if (isThumb && !HasFarJump && AFI->isLRSpilledForFarJump())
|
||||||
MadeChange |= UndoLRSpillRestore();
|
MadeChange |= UndoLRSpillRestore();
|
||||||
|
|
||||||
@ -1624,7 +1624,7 @@ bool ARMConstantIslands::OptimizeThumb2JumpTables(MachineFunction &MF) {
|
|||||||
// constantpool tables?
|
// constantpool tables?
|
||||||
MachineJumpTableInfo *MJTI = MF.getJumpTableInfo();
|
MachineJumpTableInfo *MJTI = MF.getJumpTableInfo();
|
||||||
if (MJTI == 0) return false;
|
if (MJTI == 0) return false;
|
||||||
|
|
||||||
const std::vector<MachineJumpTableEntry> &JT = MJTI->getJumpTables();
|
const std::vector<MachineJumpTableEntry> &JT = MJTI->getJumpTables();
|
||||||
for (unsigned i = 0, e = T2JumpTables.size(); i != e; ++i) {
|
for (unsigned i = 0, e = T2JumpTables.size(); i != e; ++i) {
|
||||||
MachineInstr *MI = T2JumpTables[i];
|
MachineInstr *MI = T2JumpTables[i];
|
||||||
@ -1667,7 +1667,7 @@ bool ARMConstantIslands::OptimizeThumb2JumpTables(MachineFunction &MF) {
|
|||||||
|
|
||||||
MachineInstr *AddrMI = --PrevI;
|
MachineInstr *AddrMI = --PrevI;
|
||||||
bool OptOk = true;
|
bool OptOk = true;
|
||||||
// Examine the instruction that calculate the jumptable entry address.
|
// Examine the instruction that calculates the jumptable entry address.
|
||||||
// If it's not the one just before the t2BR_JT, we won't delete it, then
|
// If it's not the one just before the t2BR_JT, we won't delete it, then
|
||||||
// it's not worth doing the optimization.
|
// it's not worth doing the optimization.
|
||||||
for (unsigned k = 0, eee = AddrMI->getNumOperands(); k != eee; ++k) {
|
for (unsigned k = 0, eee = AddrMI->getNumOperands(); k != eee; ++k) {
|
||||||
@ -1732,7 +1732,7 @@ bool ARMConstantIslands::ReorderThumb2JumpTables(MachineFunction &MF) {
|
|||||||
|
|
||||||
MachineJumpTableInfo *MJTI = MF.getJumpTableInfo();
|
MachineJumpTableInfo *MJTI = MF.getJumpTableInfo();
|
||||||
if (MJTI == 0) return false;
|
if (MJTI == 0) return false;
|
||||||
|
|
||||||
const std::vector<MachineJumpTableEntry> &JT = MJTI->getJumpTables();
|
const std::vector<MachineJumpTableEntry> &JT = MJTI->getJumpTables();
|
||||||
for (unsigned i = 0, e = T2JumpTables.size(); i != e; ++i) {
|
for (unsigned i = 0, e = T2JumpTables.size(); i != e; ++i) {
|
||||||
MachineInstr *MI = T2JumpTables[i];
|
MachineInstr *MI = T2JumpTables[i];
|
||||||
|
Loading…
Reference in New Issue
Block a user