From ed8a114c86d8f6fd8d25701ef248c9e759d68950 Mon Sep 17 00:00:00 2001 From: Craig Topper Date: Sun, 12 Aug 2018 03:22:18 +0000 Subject: [PATCH] [X86] Remove unnecessary AddedComplexity line. NFC 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 | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/llvm/lib/Target/X86/X86InstrCompiler.td b/llvm/lib/Target/X86/X86InstrCompiler.td index bc258f6..fb5e457 100644 --- 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 { -- 2.7.4