projects
/
platform
/
upstream
/
llvm.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
| inline |
side by side
(parent:
612c524
)
[X86] Remove unnecessary AddedComplexity line. NFC
author
Craig Topper
<craig.topper@intel.com>
Sun, 12 Aug 2018 03:22:18 +0000
(
03:22
+0000)
committer
Craig Topper
<craig.topper@intel.com>
Sun, 12 Aug 2018 03:22:18 +0000
(
03:22
+0000)
The use of the or_is_add predicate already gives enough of a complexity boost to get the patterns ordered properly.
llvm-svn: 339507
llvm/lib/Target/X86/X86InstrCompiler.td
patch
|
blob
|
history
diff --git
a/llvm/lib/Target/X86/X86InstrCompiler.td
b/llvm/lib/Target/X86/X86InstrCompiler.td
index bc258f64fbe03802f89ad70b9db076d87c9cbbb6..fb5e4573123604417fb4db711c6d0ad76487dbea 100644
(file)
--- a/
llvm/lib/Target/X86/X86InstrCompiler.td
+++ b/
llvm/lib/Target/X86/X86InstrCompiler.td
@@
-1282,7
+1282,7
@@
def or_is_add : PatFrag<(ops node:$lhs, node:$rhs), (or node:$lhs, node:$rhs),[{
// (or x1, x2) -> (add x1, x2) if two operands are known not to share bits.
// Try this before the selecting to OR.
-let
AddedComplexity = 5,
SchedRW = [WriteALU] in {
+let SchedRW = [WriteALU] in {
let isConvertibleToThreeAddress = 1,
Constraints = "$src1 = $dst", Defs = [EFLAGS] in {