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

Cast away "comparison between signed and unsigned integer" warnings. 

llvm-svn: 122598
This commit is contained in:
Benjamin Kramer 2010-12-28 13:52:52 +00:00
parent 110442d8a0
commit b6d52b8b64
2 changed files with 7 additions and 4 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
llvm/lib/Analysis/InstructionSimplify.cpp
View File

@ -71,8 +71,9 @@ static bool ValueDominatesPHI(Value *V, PHINode *P, const DominatorTree *DT) {
/// Also performs the transform "(A op' B) op C" -> "(A op C) op' (B op C)". /// Also performs the transform "(A op' B) op C" -> "(A op C) op' (B op C)".
/// Returns the simplified value, or null if no simplification was performed. /// Returns the simplified value, or null if no simplification was performed.
static Value *ExpandBinOp(unsigned Opcode, Value *LHS, Value *RHS, static Value *ExpandBinOp(unsigned Opcode, Value *LHS, Value *RHS,
unsigned OpcodeToExpand, const TargetData *TD, unsigned OpcToExpand, const TargetData *TD,
const DominatorTree *DT, unsigned MaxRecurse) { const DominatorTree *DT, unsigned MaxRecurse) {
Instruction::BinaryOps OpcodeToExpand = (Instruction::BinaryOps)OpcToExpand;
// Recursion is always used, so bail out at once if we already hit the limit. // Recursion is always used, so bail out at once if we already hit the limit.
if (!MaxRecurse--) if (!MaxRecurse--)
return 0; return 0;
@ -133,8 +134,9 @@ static Value *ExpandBinOp(unsigned Opcode, Value *LHS, Value *RHS,
/// OpCodeToExtract is Mul then this tries to turn "(A*B)+(A*C)" into "A*(B+C)". /// OpCodeToExtract is Mul then this tries to turn "(A*B)+(A*C)" into "A*(B+C)".
/// Returns the simplified value, or null if no simplification was performed. /// Returns the simplified value, or null if no simplification was performed.
static Value *FactorizeBinOp(unsigned Opcode, Value *LHS, Value *RHS, static Value *FactorizeBinOp(unsigned Opcode, Value *LHS, Value *RHS,
unsigned OpcodeToExtract, const TargetData *TD, unsigned OpcToExtract, const TargetData *TD,
const DominatorTree *DT, unsigned MaxRecurse) { const DominatorTree *DT, unsigned MaxRecurse) {
Instruction::BinaryOps OpcodeToExtract = (Instruction::BinaryOps)OpcToExtract;
// Recursion is always used, so bail out at once if we already hit the limit. // Recursion is always used, so bail out at once if we already hit the limit.
if (!MaxRecurse--) if (!MaxRecurse--)
return 0; return 0;
@ -201,10 +203,11 @@ static Value *FactorizeBinOp(unsigned Opcode, Value *LHS, Value *RHS,
/// SimplifyAssociativeBinOp - Generic simplifications for associative binary /// SimplifyAssociativeBinOp - Generic simplifications for associative binary
/// operations. Returns the simpler value, or null if none was found. /// operations. Returns the simpler value, or null if none was found.
static Value *SimplifyAssociativeBinOp(unsigned Opcode, Value *LHS, Value *RHS, static Value *SimplifyAssociativeBinOp(unsigned Opc, Value *LHS, Value *RHS,
const TargetData *TD, const TargetData *TD,
const DominatorTree *DT, const DominatorTree *DT,
unsigned MaxRecurse) { unsigned MaxRecurse) {
Instruction::BinaryOps Opcode = (Instruction::BinaryOps)Opc;
assert(Instruction::isAssociative(Opcode) && "Not an associative operation!"); assert(Instruction::isAssociative(Opcode) && "Not an associative operation!");
// Recursion is always used, so bail out at once if we already hit the limit. // Recursion is always used, so bail out at once if we already hit the limit.

2
llvm/lib/MC/TargetAsmBackend.cpp
View File

@ -31,7 +31,7 @@ TargetAsmBackend::getFixupKindInfo(MCFixupKind Kind) const {
{ "FK_PCRel_8", 0, 64, MCFixupKindInfo::FKF_IsPCRel } { "FK_PCRel_8", 0, 64, MCFixupKindInfo::FKF_IsPCRel }
}; };
assert(Kind <= sizeof(Builtins) / sizeof(Builtins[0]) && assert((size_t)Kind <= sizeof(Builtins) / sizeof(Builtins[0]) &&
"Unknown fixup kind"); "Unknown fixup kind");
return Builtins[Kind]; return Builtins[Kind];
} }