RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2024-10-19 11:02:59 +02:00
Code Issues Projects Releases Wiki Activity

Formatting and comment tweaks.

Browse Source 
llvm-svn: 125200
This commit is contained in:
Duncan Sands 2011-02-09 17:45:03 +00:00
parent 02088f3ab8
commit db22898512
1 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
lib/Analysis/InstructionSimplify.cpp
View File

@ -1814,22 +1814,22 @@ static Value *SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS,
unsigned MaxRecurse) {
switch (Opcode) {
case Instruction::Add:
return SimplifyAddInst(LHS, RHS, /* isNSW */ false, /* isNUW */ false,
return SimplifyAddInst(LHS, RHS, /*isNSW*/false, /*isNUW*/false,
TD, DT, MaxRecurse);
case Instruction::Sub:
return SimplifySubInst(LHS, RHS, /* isNSW */ false, /* isNUW */ false,
return SimplifySubInst(LHS, RHS, /*isNSW*/false, /*isNUW*/false,
TD, DT, MaxRecurse);
case Instruction::Mul: return SimplifyMulInst (LHS, RHS, TD, DT, MaxRecurse);
case Instruction::SDiv: return SimplifySDivInst(LHS, RHS, TD, DT, MaxRecurse);
case Instruction::UDiv: return SimplifyUDivInst(LHS, RHS, TD, DT, MaxRecurse);
case Instruction::FDiv: return SimplifyFDivInst(LHS, RHS, TD, DT, MaxRecurse);
case Instruction::Shl:
return SimplifyShlInst(LHS, RHS, /*NSW*/false, /*NUW*/false,
return SimplifyShlInst(LHS, RHS, /*isNSW*/false, /*isNUW*/false,
TD, DT, MaxRecurse);
case Instruction::LShr:
return SimplifyLShrInst(LHS, RHS, /*isexact*/ false, TD, DT, MaxRecurse);
return SimplifyLShrInst(LHS, RHS, /*isExact*/false, TD, DT, MaxRecurse);
case Instruction::AShr:
return SimplifyAShrInst(LHS, RHS, /*isexact*/false, TD, DT, MaxRecurse);
return SimplifyAShrInst(LHS, RHS, /*isExact*/false, TD, DT, MaxRecurse);
case Instruction::And: return SimplifyAndInst(LHS, RHS, TD, DT, MaxRecurse);
case Instruction::Or: return SimplifyOrInst (LHS, RHS, TD, DT, MaxRecurse);
case Instruction::Xor: return SimplifyXorInst(LHS, RHS, TD, DT, MaxRecurse);