| /llvm-project-15.0.7/llvm/unittests/Support/ |
| H A D | KnownBitsTest.cpp | 23 ForeachKnownBits(Bits, [&](const KnownBits &Known1) { in TEST() argument
31 ForeachNumInKnownBits(Known1, [&](const APInt &N1) { in TEST()
54 ForeachKnownBits(Bits, [&](const KnownBits &Known1) { in TestAddSubExhaustive() argument
62 ForeachNumInKnownBits(Known1, [&](const APInt &N1) { in TestAddSubExhaustive()
88 IsAdd, /*NSW*/true, Known1, Known2); in TestAddSubExhaustive()
102 ForeachKnownBits(Bits, [&](const KnownBits &Known1) { in TEST() argument
201 KnownBits ComputedAnd = Known1 & Known2; in TEST()
204 KnownBits ComputedOr = Known1 | Known2; in TEST()
207 KnownBits ComputedXor = Known1 ^ Known2; in TEST()
312 ForeachKnownBits(Bits, [&](const KnownBits &Known1) { in TEST() argument
[all …]
|
| /llvm-project-15.0.7/llvm/unittests/IR/ |
| H A D | DemandedBitsTest.cpp | 22 ForeachKnownBits(Bits, [&](const KnownBits &Known1) { in TestBinOpExhaustive() argument
26 APInt AB1 = PropagateFn(0, AOut, Known1, Known2); in TestBinOpExhaustive()
27 APInt AB2 = PropagateFn(1, AOut, Known1, Known2); in TestBinOpExhaustive()
34 Known1Redacted.Zero = Known1.Zero & AB1; in TestBinOpExhaustive()
35 Known1Redacted.One = Known1.One & AB1; in TestBinOpExhaustive()
44 ForeachNumInKnownBits(Known1, [&](APInt Value1) { in TestBinOpExhaustive()
|
| /llvm-project-15.0.7/llvm/lib/Target/WebAssembly/ |
| H A D | WebAssemblyInstrMemory.td | 35 KnownBits Known1 = CurDAG->computeKnownBits(N->getOperand(1), 0);
36 return (~Known0.Zero & ~Known1.Zero) == 0;
|
| /llvm-project-15.0.7/llvm/lib/Target/Hexagon/ |
| H A D | HexagonVectorCombine.cpp | 1353 KnownBits Known1 = computeKnownBits(Idx1, DL, 0, &AC, Gep1, &DT); in calculatePointerDifference() local
1354 APInt Unknown = ~(Known0.Zero | Known0.One) | ~(Known1.Zero | Known1.One); in calculatePointerDifference()
|
| /llvm-project-15.0.7/llvm/lib/Analysis/ |
| H A D | ConstantFolding.cpp | 789 KnownBits Known1 = computeKnownBits(Op1, DL); in SymbolicallyEvaluateBinop() local
790 if ((Known1.One | Known0.Zero).isAllOnes()) { in SymbolicallyEvaluateBinop()
794 if ((Known0.One | Known1.Zero).isAllOnes()) { in SymbolicallyEvaluateBinop()
799 Known0 &= Known1; in SymbolicallyEvaluateBinop()
|
| H A D | ValueTracking.cpp | 2944 KnownBits Known1 = computeKnownBits(V1, Depth, Q); in isKnownNonEqual() local
2947 if (Known1.Zero.intersects(Known2.One) || in isKnownNonEqual()
2948 Known2.Zero.intersects(Known1.One)) in isKnownNonEqual()
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | TargetLowering.cpp | 2082 KnownBits Known1 = TLO.DAG.computeKnownBits(Op1, DemandedElts, Depth + 1); in SimplifyDemandedBits() local
2083 Known = KnownBits::umin(Known0, Known1); in SimplifyDemandedBits()
2084 if (Optional<bool> IsULE = KnownBits::ule(Known0, Known1)) in SimplifyDemandedBits()
2086 if (Optional<bool> IsULT = KnownBits::ult(Known0, Known1)) in SimplifyDemandedBits()
2095 KnownBits Known1 = TLO.DAG.computeKnownBits(Op1, DemandedElts, Depth + 1); in SimplifyDemandedBits() local
2096 Known = KnownBits::umax(Known0, Known1); in SimplifyDemandedBits()
2097 if (Optional<bool> IsUGE = KnownBits::uge(Known0, Known1)) in SimplifyDemandedBits()
2099 if (Optional<bool> IsUGT = KnownBits::ugt(Known0, Known1)) in SimplifyDemandedBits()
|
| /llvm-project-15.0.7/llvm/lib/Target/X86/ |
| H A D | X86InstrCompiler.td | 1456 KnownBits Known1 = CurDAG->computeKnownBits(N->getOperand(1), 0);
1457 return (~Known0.Zero & ~Known1.Zero) == 0;
|
| H A D | X86ISelLowering.cpp | 42024 KnownBits Known1; in SimplifyDemandedBitsForTargetNode() local
42026 if (SimplifyDemandedBits(Op1, DemandedMask, Known1, TLO, Depth + 1)) in SimplifyDemandedBitsForTargetNode()
42030 KnownBits LengthBits = Known1.extractBits(8, 8); in SimplifyDemandedBitsForTargetNode()
|