maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

Remove strange extra semicolons. 

llvm-svn: 67287
This commit is contained in:
Nick Lewycky 2009-03-19 05:51:39 +00:00
parent dbe3f77f5b
commit bfd4ad67c7
4 changed files with 4 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
llvm/lib/Target/MSIL/MSILWriter.cpp
View File

@ -178,7 +178,7 @@ void MSILWriter::printModuleStartup() {
Out << "\tldc.i4.0\n\tret\n}\n"; Out << "\tldc.i4.0\n\tret\n}\n";
return; return;
} }
bool BadSig = true;; bool BadSig = true;
std::string Args(""); std::string Args("");
Function::const_arg_iterator Arg1,Arg2; Function::const_arg_iterator Arg1,Arg2;

2
llvm/lib/Target/X86/X86RegisterInfo.cpp
View File

@ -332,7 +332,7 @@ bool X86RegisterInfo::hasFP(const MachineFunction &MF) const {
} }
bool X86RegisterInfo::needsStackRealignment(const MachineFunction &MF) const { bool X86RegisterInfo::needsStackRealignment(const MachineFunction &MF) const {
const MachineFrameInfo *MFI = MF.getFrameInfo();; const MachineFrameInfo *MFI = MF.getFrameInfo();
// FIXME: Currently we don't support stack realignment for functions with // FIXME: Currently we don't support stack realignment for functions with
// variable-sized allocas // variable-sized allocas

2
llvm/lib/Transforms/Scalar/LoopUnswitch.cpp
View File

@ -577,7 +577,7 @@ void LoopUnswitch::SplitExitEdges(Loop *L,
BasicBlock* EndBlock; BasicBlock* EndBlock;
if (NewExitBlock->getSinglePredecessor() == ExitBlock) { if (NewExitBlock->getSinglePredecessor() == ExitBlock) {
EndBlock = NewExitBlock; EndBlock = NewExitBlock;
NewExitBlock = EndBlock->getSinglePredecessor();; NewExitBlock = EndBlock->getSinglePredecessor();
} else { } else {
EndBlock = ExitBlock; EndBlock = ExitBlock;
} }

2
llvm/lib/Transforms/Scalar/MemCpyOptimizer.cpp
View File

@ -277,7 +277,7 @@ void MemsetRanges::addStore(int64_t Start, StoreInst *SI) {
// End. // End.
if (End > I->End) { if (End > I->End) {
I->End = End; I->End = End;
range_iterator NextI = I;; range_iterator NextI = I;
while (++NextI != E && End >= NextI->Start) { while (++NextI != E && End >= NextI->Start) {
// Merge the range in. // Merge the range in.
I->TheStores.append(NextI->TheStores.begin(), NextI->TheStores.end()); I->TheStores.append(NextI->TheStores.begin(), NextI->TheStores.end());