| /llvm-project-15.0.7/llvm/test/CodeGen/PowerPC/ |
| H A D | legalize-invert-br_cc.ll | 6 …ze::ExpandNode(llvm::SDNode*): Assertion `!NeedInvert && "Don't know how to invert BR_CC!"' failed.
|
| /llvm-project-15.0.7/llvm/test/Transforms/InstCombine/ |
| H A D | sink-not-into-another-hand-of-and.ll | 8 ; iff y is free to invert and all uses of z can be freely updated. 76 ; FIXME: we could invert all uses of %i1 here
|
| H A D | sink-not-into-another-hand-of-or.ll | 8 ; iff y is free to invert and all uses of z can be freely updated. 76 ; FIXME: we could invert all uses of %i1 here
|
| H A D | canonicalize-selects-icmp-condition-bittest.ll | 33 ; Can't invert all users of original condition
|
| H A D | xor-of-icmps-with-extra-uses.ll | 89 ; Can invert 'not'.
|
| H A D | canonicalize-clamp-like-pattern-between-zero-and-positive-threshold.ll | 16 ; Also, ULT predicate can also be UGE; or UGT iff C0 != -1 (+invert result) 17 ; Also, SLT predicate can also be SGE; or SGT iff C2 != INT_MAX (+invert res.)
|
| H A D | canonicalize-clamp-like-pattern-between-negative-and-positive-thresholds.ll | 16 ; Also, ULT predicate can also be UGE; or UGT iff C0 != -1 (+invert result) 17 ; Also, SLT predicate can also be SGE; or SGT iff C2 != INT_MAX (+invert res.)
|
| H A D | invert-variable-mask-in-masked-merge-scalar.ll | 6 ; We can de-invert the M:
|
| H A D | icmp-sub.ll | 538 ; TODO: It might be ok to replace the "SUB == 0" in this example if codegen can invert it.
|
| H A D | invert-variable-mask-in-masked-merge-vector.ll | 6 ; We can de-invert the M:
|
| /llvm-project-15.0.7/llvm/test/CodeGen/AArch64/ |
| H A D | branch-relax-asm.ll | 6 ; of the limited range we gave tbz. So branch relaxation has to invert the
|
| /llvm-project-15.0.7/llvm/include/llvm/Support/ |
| H A D | ScaledNumber.h | 527 return get(N).invert(); in getInverse() 676 ScaledNumber &invert() { return *this = ScaledNumber::get(1) / *this; } in invert() function 677 ScaledNumber inverse() const { return ScaledNumber(*this).invert(); } in inverse()
|
| /llvm-project-15.0.7/clang-tools-extra/clangd/test/ |
| H A D | protocol.test | 6 # Note that we invert the test because we intent to let clangd exit prematurely.
|
| /llvm-project-15.0.7/lld/ELF/ |
| H A D | ScriptParser.cpp | 1740 bool invert = false; in readMemoryAttributes() local 1744 invert = !invert; in readMemoryAttributes() 1761 if (invert) { in readMemoryAttributes()
|
| /llvm-project-15.0.7/llvm/lib/Support/ |
| H A D | regcomp.c | 800 int invert = 0; in p_bracket() local 822 invert++; /* make note to invert set at end */ in p_bracket() 851 if (invert) { in p_bracket()
|
| /llvm-project-15.0.7/llvm/test/CodeGen/X86/ |
| H A D | bt.ll | 1042 define zeroext i1 @invert(i32 %flags, i32 %flag) nounwind { 1043 ; X86-LABEL: invert: 1051 ; X64-LABEL: invert:
|
| H A D | vector-compare-simplify.ll | 339 ; the constant pool load, but the alternative is a cmpeq+invert which is 3 instructions.
|
| H A D | test-vs-bittest.ll | 78 ; initial IR. One has an extra invert of the setcc. This previous caused one
|
| /llvm-project-15.0.7/llvm/test/CodeGen/AArch64/GlobalISel/ |
| H A D | lower-neon-vector-fcmp.mir | 340 ; Needs two compares. No invert. 365 ; Needs two compares. No invert.
|
| /llvm-project-15.0.7/llvm/docs/GlobalISel/ |
| H A D | GMIR.rst | 116 GPR then we can equivalently G_XOR the sign bit with 1 to invert it.
|
| /llvm-project-15.0.7/llvm/test/Transforms/InstSimplify/ |
| H A D | compare.ll | 714 %invert = xor i1 %cond, 1 715 %s = select i1 %invert, i32 0, i32 1 1142 %invert = xor <2 x i1> %cond, <i1 1, i1 1> 1143 %s = select <2 x i1> %invert, <2 x i32> <i32 0, i32 0>, <2 x i32> <i32 1, i32 1>
|
| /llvm-project-15.0.7/llvm/lib/Target/PowerPC/ |
| H A D | PPCInstrVSX.td | 2010 Similarly to the byte pattern, we invert the bits of the index, but we 2011 AND with 0x4 (i.e. clear all bits of the index and invert bit 61). 2110 - The order of elements after the move to GPR is reversed, so we invert 2128 - The order of elements after the move to GPR is reversed, so we invert 2146 - The order of elements after the move to GPR is reversed, so we invert
|
| /llvm-project-15.0.7/llvm/lib/Target/X86/ |
| H A D | README.txt | 79 when it can invert the result of the compare for free.
|
| /llvm-project-15.0.7/llvm/lib/Target/Mips/ |
| H A D | MipsISelLowering.cpp | 649 bool invert = invertFPCondCodeUser((Mips::CondCode)CC->getSExtValue()); in createCMovFP() local 652 return DAG.getNode((invert ? MipsISD::CMovFP_F : MipsISD::CMovFP_T), DL, in createCMovFP()
|
| /llvm-project-15.0.7/llvm/lib/Target/RISCV/ |
| H A D | RISCVInstrInfoV.td | 1034 // the always true/false semantics we would invert if we just decremented the
|