Searched refs:C1 (Results 26 - 50 of 113) sorted by relevance

12345

/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineAndOrXor.cpp115 /// This handles expressions of the form ((val OP C1) & C2). Where
116 /// the Op parameter is 'OP', OpRHS is 'C1', and AndRHS is 'C2'.
517 auto IsSubSetOrEqual = [](ConstantInt *C1, ConstantInt *C2) {
518 return (C1->getValue() & C2->getValue()) == C1->getValue();
520 auto IsSuperSetOrEqual = [](ConstantInt *C1, ConstantInt *C2) {
521 return (C1->getValue() & C2->getValue()) == C2->getValue();
811 const APInt *C1, *C2; local
812 if (!match(LHS->getOperand(1), m_APInt(C1)) ||
816 // We only handle (X != C1
1825 ConstantInt *C1; local
2090 areInverseVectorBitmasks(Constant *C1, Constant *C2) argument
2499 ConstantInt *C1 = dyn_cast<ConstantInt>(C); local
3075 Constant *C1; local
3132 ConstantInt *C1; local
[all...]
H A DInstCombineShifts.cpp330 const APInt *C0, *C1; local
331 if (!match(I.getOperand(1), m_APInt(C1)))
345 (*C0 + *C1).ult(Ty->getScalarSizeInBits());
356 // shift (logic (shift X, C0), Y), C1 -> logic (shift X, C0+C1), (shift Y, C1)
357 Constant *ShiftSumC = ConstantInt::get(Ty, *C0 + *C1);
392 // (C1 shift (A add C2)) -> (C1 shift C2) shift A)
422 /// that have constant shift amounts: OuterShift (InnerShift X, C1), C
556 const APInt *C1; local
1019 Constant *C1; local
1194 Constant *C1, *C2; local
[all...]
H A DInstCombineCalls.cpp882 Constant *C1 = dyn_cast<Constant>(Op1); local
887 C1 ? dyn_cast_or_null<ConstantInt>(C1->getAggregateElement((unsigned)0))
2024 // uaddo (X +nuw C0), C1 -> uaddo X, C0 + C1
2025 // saddo (X +nsw C0), C1 -> saddo X, C0 + C1
2027 const APInt *C0, *C1; local
2033 if (HasNWAdd && match(Arg1, m_APInt(C1))) {
2036 IsSigned ? C1
2198 const APFloat *C1, *C2; local
3006 Constant *C1 = dyn_cast<Constant>(Op1); local
3069 Constant *C1 = dyn_cast<Constant>(Op1); local
[all...]
H A DInstCombineSelect.cpp115 /// select (icmp eq (and X, C1)), TC, FC
116 /// iff C1 is a power 2 and the difference between TC and FC is a power-of-2.
118 /// (shr (and (X, C1)), (log2(C1) - log2(TC-FC))) + FC
120 /// (shl (and (X, C1)), (log2(TC-FC) - log2(C1))) + FC
575 /// (select (icmp eq (and X, C1), 0), Y, (or Y, C2))
577 /// (or (shl (and X, C1), C3), Y)
579 /// C1 and C2 are both powers of 2
581 /// C3 = Log(C2) - Log(C1)
607 const APInt *C1; local
658 APInt C1 = APInt::getOneBitSet(V->getType()->getScalarSizeInBits(), C1Log); local
2122 const APInt *C1, *C2; local
[all...]
H A DInstCombineInternal.h813 /// expression X % C0 + (( X / C0 ) % C1) * C0 can be simplified to
814 /// X % (C0 * C1)
959 const APInt &C1);
961 const APInt &C1, const APInt &C2);
962 Instruction *foldICmpShrConstConst(ICmpInst &I, Value *ShAmt, const APInt &C1,
964 Instruction *foldICmpShlConstConst(ICmpInst &I, Value *ShAmt, const APInt &C1,
H A DInstCombineCompares.cpp334 Value *C1 = Builder.CreateICmpEQ(Idx, FirstTrueIdx);
337 return BinaryOperator::CreateOr(C1, C2);
354 Value *C1 = Builder.CreateICmpNE(Idx, FirstFalseIdx);
357 return BinaryOperator::CreateAnd(C1, C2);
1632 /// Fold icmp (and (sh X, Y), C2), C1.
1634 const APInt &C1, const APInt &C2) {
1639 // If this is: (X >> C3) & C2 != C1 (where any shift and any compare could
1640 // exist), turn it into (X & (C2 << C3)) != (C1 << C3). This happens a LOT in
1654 if (!Cmp.isSigned() || (!C2.isNegative() && !C1.isNegative()))
1668 (!C2.shl(*C3).isNegative() && !C1
1633 foldICmpAndShift(ICmpInst &Cmp, BinaryOperator *And, const APInt &C1, const APInt &C2) argument
1716 foldICmpAndConstConst(ICmpInst &Cmp, BinaryOperator *And, const APInt &C1) argument
3400 const APInt *C0, *C1; // FIXME: non-splats, potentially with undef. local
4171 ConstantInt *C1, *C2; local
[all...]
/freebsd-11-stable/contrib/binutils/opcodes/
H A Dia64-opc.h49 #define C1 IA64_OPND_C1 macro
/freebsd-11-stable/contrib/llvm-project/clang/lib/Format/
H A DWhitespaceManager.h93 bool operator()(const Change &C1, const Change &C2) const;
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DTargetTransformInfoImpl.h238 bool isLSRCostLess(TTI::LSRCost &C1, TTI::LSRCost &C2) { argument
239 return std::tie(C1.NumRegs, C1.AddRecCost, C1.NumIVMuls, C1.NumBaseAdds,
240 C1.ScaleCost, C1.ImmCost, C1.SetupCost) <
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/SystemZ/
H A DSystemZTargetTransformInfo.cpp295 bool SystemZTTIImpl::isLSRCostLess(TargetTransformInfo::LSRCost &C1, argument
299 return std::tie(C1.Insns, C1.NumRegs, C1.AddRecCost,
300 C1.NumIVMuls, C1.NumBaseAdds,
301 C1.ScaleCost, C1.SetupCost) <
H A DSystemZTargetTransformInfo.h52 bool isLSRCostLess(TargetTransformInfo::LSRCost &C1,
/freebsd-11-stable/sys/dev/ep/
H A Dif_ep_pccard.c74 { PCMCIA_CARD(3COM, 3C1), EP_CHIP_C1 },
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DGCNILPSched.cpp319 [=](const Candidate& C1, const Candidate& C2) {
320 return C1.SU->getHeight() < C2.SU->getHeight();
H A DAMDGPUISelDAGToDAG.cpp1191 ConstantSDNode *C1 = cast<ConstantSDNode>(N1); local
1192 if (isDSOffsetLegal(N0, C1->getSExtValue(), 16)) {
1195 Offset = CurDAG->getTargetConstant(C1->getZExtValue(), DL, MVT::i16);
1266 ConstantSDNode *C1 = cast<ConstantSDNode>(N1); local
1267 unsigned DWordOffset0 = C1->getZExtValue() / 4;
1364 ConstantSDNode *C1 = nullptr; local
1367 C1 = cast<ConstantSDNode>(Addr.getOperand(1));
1368 if (isUInt<32>(C1->getZExtValue()))
1371 C1 = nullptr;
1376 // (add (add N2, N3), C1)
1548 ConstantSDNode *C1 = cast<ConstantSDNode>(N1); local
1896 ConstantSDNode *C1 = cast<ConstantSDNode>(N1); local
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DTargetLowering.cpp1217 // e.g. (A & C1)^(B & C2) -> (A & C1)|(B & C2) iff C1&C2 == 0
1230 // e.g. (X | C1) ^ C2 --> (X | C1) & ~C2 iff (C1&C2) == C2
1333 // If this is ((X >>u C1) << ShAmt), see if we can simplify this into a
1342 unsigned C1 = SA2->getZExtValue(); local
1344 int Diff = ShAmt - C1;
1438 // If this is ((X << C1) >>
1448 unsigned C1 = SA2->getZExtValue(); local
2141 SDValue C1 = getUndefOrConstantElt(BO.getOperand(1), i, UndefOp1); local
2918 ConstantSDNode *C1; local
3150 const APInt &C1 = N1C->getAPIntValue(); local
3558 const APInt &C1 = N1C->getAPIntValue(); local
3681 const APInt &C1 = N1C->getAPIntValue(); local
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DBasicAliasAnalysis.cpp577 // Use GetLinearExpression to decompose the index into a C1*V+C2 form.
584 // The GEP index scale ("Scale") scales C1*V+C2, yielding (C1*V+C2)*Scale.
585 // This gives us an aggregate computation of (C1*Scale)*V + C2*Scale.
587 // It can be the case that, even through C1*V+C2 does not overflow for
591 // FIXME: C1*Scale and the other operations in the decomposed
592 // (C1*Scale)*V+C2*Scale can also overflow. We should check for this
1110 ConstantInt *C1 = local
1117 if (C1 && C2) {
1118 unsigned BitWidth = std::max(C1
[all...]
H A DAliasSetTracker.cpp248 const auto *C1 = dyn_cast<CallBase>(UnknownInst); local
250 if (!C1 || !C2 || isModOrRefSet(AA.getModRefInfo(C1, C2)) ||
251 isModOrRefSet(AA.getModRefInfo(C2, C1)))
/freebsd-11-stable/usr.bin/systat/
H A Difstat.c52 #define C1 0 /* 0-19 */ macro
59 static const int col1 = C1;
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DReassociate.cpp90 /// C1) The operand is in the form "X & C", where C is a constant and C != ~0
94 /// C2.2) Any operand E which doesn't fall into C1 and C2.1, we view this
1215 const APInt &C1 = Opnd1->getConstPart();
1216 if (C1 != ConstOpnd)
1220 Res = createAndInstr(I, X, ~C1);
1221 // ConstOpnd was C2, now C1 ^ C2.
1222 ConstOpnd ^= C1;
1261 const APInt &C1 = Opnd1->getConstPart();
1263 APInt C3((~C1) ^ C2);
1273 ConstOpnd ^= C1;
[all...]
H A DInferAddressSpaces.cpp716 auto *C1 = dyn_cast<Constant>(Src1); local
721 if ((C1 && Src0AS == UninitializedAddressSpace) ||
727 else if (C1 && isSafeToCastConstAddrSpace(C1, Src0AS))
/freebsd-11-stable/libexec/getty/
H A Dgettytab.h114 #define C1 gettynums[14].value macro
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/
H A DX86RecognizableInstr.h28 MAP(C1, 65) \
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86TargetTransformInfo.h185 bool isLSRCostLess(TargetTransformInfo::LSRCost &C1,
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DIfConversion.cpp407 static bool IfcvtTokenCmp(const std::unique_ptr<IfcvtToken> &C1, argument
409 int Incr1 = (C1->Kind == ICDiamond)
410 ? -(int)(C1->NumDups + C1->NumDups2) : (int)C1->NumDups;
417 if (!C1->NeedSubsumption && C2->NeedSubsumption)
419 else if (C1->NeedSubsumption == C2->NeedSubsumption) {
421 if ((unsigned)C1->Kind < (unsigned)C2->Kind)
423 else if (C1->Kind == C2->Kind)
424 return C1
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Demangle/
H A DMicrosoftDemangle.cpp1050 uint8_t C1 = rebasedHexDigitToNumber(Nibbles[0]);
1053 return (C1 << 4) | C2;
1089 uint8_t C1, C2; local
1091 C1 = demangleCharLiteral(MangledName);
1098 return ((wchar_t)C1 << 8) | (wchar_t)C2;

Completed in 272 milliseconds

12345