aboutsummaryrefslogtreecommitdiffstats
path: root/lib/Target/Hexagon
diff options
context:
space:
mode:
authorJyotsna Verma <jverma@codeaurora.org>2012-12-03 20:14:38 +0000
committerJyotsna Verma <jverma@codeaurora.org>2012-12-03 20:14:38 +0000
commit4fa65820bad84f24d3a34dab74b2c7158a5896da (patch)
treea9b7ca3e37a70864c316bca44ffdd2e7636d0759 /lib/Target/Hexagon
parentacb8d9fbe3853394a2537985349993580309b8cd (diff)
downloadexternal_llvm-4fa65820bad84f24d3a34dab74b2c7158a5896da.zip
external_llvm-4fa65820bad84f24d3a34dab74b2c7158a5896da.tar.gz
external_llvm-4fa65820bad84f24d3a34dab74b2c7158a5896da.tar.bz2
Removing unnecessary 'else' statement from the predicates defined in HexagonOperards.td.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@169148 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Target/Hexagon')
-rw-r--r--lib/Target/Hexagon/HexagonOperands.td60
1 files changed, 12 insertions, 48 deletions
diff --git a/lib/Target/Hexagon/HexagonOperands.td b/lib/Target/Hexagon/HexagonOperands.td
index c68f6c1..e40520d 100644
--- a/lib/Target/Hexagon/HexagonOperands.td
+++ b/lib/Target/Hexagon/HexagonOperands.td
@@ -497,10 +497,7 @@ def s16ExtPred : PatLeaf<(i32 imm), [{
// Return true if extending this immediate is profitable and the value
// can fit in a 32-bit signed field.
- if (isConstExtProfitable(Node) && isInt<32>(v))
- return true;
- else
- return false;
+ return isConstExtProfitable(Node) && isInt<32>(v);
}
}]>;
@@ -515,10 +512,7 @@ def s10ExtPred : PatLeaf<(i32 imm), [{
// Return true if extending this immediate is profitable and the value
// can fit in a 32-bit signed field.
- if (isConstExtProfitable(Node) && isInt<32>(v))
- return true;
- else
- return false;
+ return isConstExtProfitable(Node) && isInt<32>(v);
}
}]>;
@@ -533,10 +527,7 @@ def s9ExtPred : PatLeaf<(i32 imm), [{
// Return true if extending this immediate is profitable and the value
// can fit in a 32-bit unsigned field.
- if (isConstExtProfitable(Node) && isInt<32>(v))
- return true;
- else
- return false;
+ return isConstExtProfitable(Node) && isInt<32>(v);
}
}]>;
@@ -551,10 +542,7 @@ def s8ExtPred : PatLeaf<(i32 imm), [{
// Return true if extending this immediate is profitable and the value
// can fit in a 32-bit signed field.
- if (isConstExtProfitable(Node) && isInt<32>(v))
- return true;
- else
- return false;
+ return isConstExtProfitable(Node) && isInt<32>(v);
}
}]>;
@@ -570,10 +558,7 @@ def s8_16ExtPred : PatLeaf<(i32 imm), [{
// Return true if extending this immediate is profitable and the value
// can't fit in a 16-bit signed field. This is required to avoid
// unnecessary constant extenders.
- if (isConstExtProfitable(Node) && !isInt<16>(v))
- return true;
- else
- return false;
+ return isConstExtProfitable(Node) && !isInt<16>(v);
}
}]>;
@@ -588,10 +573,7 @@ def s6ExtPred : PatLeaf<(i32 imm), [{
// Return true if extending this immediate is profitable and the value
// can fit in a 32-bit unsigned field.
- if (isConstExtProfitable(Node) && isInt<32>(v))
- return true;
- else
- return false;
+ return isConstExtProfitable(Node) && isInt<32>(v);
}
}]>;
@@ -607,10 +589,7 @@ def s6_16ExtPred : PatLeaf<(i32 imm), [{
// Return true if extending this immediate is profitable and the value
// can't fit in a 16-bit signed field. This is required to avoid
// unnecessary constant extenders.
- if (isConstExtProfitable(Node) && !isInt<16>(v))
- return true;
- else
- return false;
+ return isConstExtProfitable(Node) && !isInt<16>(v);
}
}]>;
@@ -626,10 +605,7 @@ def s6_10ExtPred : PatLeaf<(i32 imm), [{
// Return true if extending this immediate is profitable and the value
// can't fit in a 10-bit signed field. This is required to avoid
// unnecessary constant extenders.
- if (isConstExtProfitable(Node) && !isInt<10>(v))
- return true;
- else
- return false;
+ return isConstExtProfitable(Node) && !isInt<10>(v);
}
}]>;
@@ -644,10 +620,7 @@ def s11_0ExtPred : PatLeaf<(i32 imm), [{
// Return true if extending this immediate is profitable and the value
// can fit in a 32-bit signed field.
- if (isConstExtProfitable(Node) && isInt<32>(v))
- return true;
- else
- return false;
+ return isConstExtProfitable(Node) && isInt<32>(v);
}
}]>;
@@ -663,10 +636,7 @@ def s11_1ExtPred : PatLeaf<(i32 imm), [{
// Return true if extending this immediate is profitable and the low 1 bit
// is zero (2-byte aligned).
- if (isConstExtProfitable(Node) && isInt<32>(v) && ((v % 2) == 0))
- return true;
- else
- return false;
+ return isConstExtProfitable(Node) && isInt<32>(v) && ((v % 2) == 0);
}
}]>;
@@ -682,10 +652,7 @@ def s11_2ExtPred : PatLeaf<(i32 imm), [{
// Return true if extending this immediate is profitable and the low 2-bits
// are zero (4-byte aligned).
- if (isConstExtProfitable(Node) && isInt<32>(v) && ((v % 4) == 0))
- return true;
- else
- return false;
+ return isConstExtProfitable(Node) && isInt<32>(v) && ((v % 4) == 0);
}
}]>;
@@ -701,9 +668,6 @@ def s11_3ExtPred : PatLeaf<(i32 imm), [{
// Return true if extending this immediate is profitable and the low 3-bits
// are zero (8-byte aligned).
- if (isConstExtProfitable(Node) && isInt<32>(v) && ((v % 8) == 0))
- return true;
- else
- return false;
+ return isConstExtProfitable(Node) && isInt<32>(v) && ((v % 8) == 0);
}
}]>;