Home
last modified time | relevance | path

Searched refs:One (Results 1 – 25 of 587) sorted by relevance

12345678910>>...24

/src/contrib/llvm-project/llvm/include/llvm/Support/
H A DKnownBits.h25 APInt One; member
29 KnownBits(APInt Zero, APInt One) in KnownBits()
30 : Zero(std::move(Zero)), One(std::move(One)) {} in KnownBits()
37 KnownBits(unsigned BitWidth) : Zero(BitWidth, 0), One(BitWidth, 0) {} in KnownBits()
41 assert(Zero.getBitWidth() == One.getBitWidth() && in getBitWidth()
47 bool hasConflict() const { return Zero.intersects(One); } in hasConflict()
51 return Zero.popcount() + One.popcount() == getBitWidth(); in isConstant()
58 return One; in getConstant()
62 bool isUnknown() const { return Zero.isZero() && One.isZero(); } in isUnknown()
66 return !Zero.isSignBitSet() && !One.isSignBitSet(); in isSignUnknown()
[all …]
/src/contrib/llvm-project/llvm/lib/Support/
H A DKnownBits.cpp29 APInt CarryKnownOne = PossibleSumOne ^ LHS.One ^ RHS.One; in computeForAddCarry()
32 APInt LHSKnownUnion = LHS.Zero | LHS.One; in computeForAddCarry()
33 APInt RHSKnownUnion = RHS.Zero | RHS.One; in computeForAddCarry()
40 KnownOut.One = std::move(PossibleSumOne) & Known; in computeForAddCarry()
48 LHS, RHS, Carry.Zero.getBoolValue(), Carry.One.getBoolValue()); in computeForAddCarry()
69 std::swap(NotRHS.Zero, NotRHS.One); in computeForAddSub()
86 KnownOut.One.setBits(BitWidth - 1 - NumBits, BitWidth - 1); in computeForAddSub()
88 KnownOut.One.setHighBits(MinVal.countl_one()); in computeForAddSub()
120 KnownOut.One.setBits(BitWidth - 1 - NumBits, BitWidth - 1); in computeForAddSub()
127 KnownOut.One.setSignBit(); in computeForAddSub()
[all …]
/src/contrib/llvm-project/llvm/lib/Transforms/InstCombine/
H A DInstCombineSimplifyDemanded.cpp220 if (DemandedMask.isSubsetOf(Known.Zero | Known.One)) in SimplifyDemandedUseBits()
221 return Constant::getIntegerValue(VTy, Known.One); in SimplifyDemandedUseBits()
225 if (DemandedMask.isSubsetOf(LHSKnown.Zero | RHSKnown.One)) in SimplifyDemandedUseBits()
227 if (DemandedMask.isSubsetOf(RHSKnown.Zero | LHSKnown.One)) in SimplifyDemandedUseBits()
239 SimplifyDemandedBits(I, 0, DemandedMask & ~RHSKnown.One, LHSKnown, in SimplifyDemandedUseBits()
251 if (DemandedMask.isSubsetOf(Known.Zero | Known.One)) in SimplifyDemandedUseBits()
252 return Constant::getIntegerValue(VTy, Known.One); in SimplifyDemandedUseBits()
256 if (DemandedMask.isSubsetOf(LHSKnown.One | RHSKnown.Zero)) in SimplifyDemandedUseBits()
258 if (DemandedMask.isSubsetOf(RHSKnown.One | LHSKnown.Zero)) in SimplifyDemandedUseBits()
297 if (DemandedMask.isSubsetOf(Known.Zero | Known.One)) in SimplifyDemandedUseBits()
[all …]
/src/contrib/llvm-project/llvm/lib/Analysis/
H A DDemandedBits.cpp247 AB &= ~Known2.One; in determineLiveOperandBits()
249 AB &= ~(Known.One & ~Known2.One); in determineLiveOperandBits()
507 APInt Bound = (LHS.Zero & RHS.Zero) | (LHS.One & RHS.One); in determineLiveOperandBitsAddCarry()
525 NeededToMaintainCarryOne = LHS.One | ~RHS.One; in determineLiveOperandBitsAddCarry()
528 NeededToMaintainCarryOne = RHS.One | ~LHS.One; in determineLiveOperandBitsAddCarry()
533 APInt PossibleSumOne = LHS.One + RHS.One + CarryOne; in determineLiveOperandBitsAddCarry()
566 NRHS.Zero = RHS.One; in determineLiveOperandBitsSub()
567 NRHS.One = RHS.Zero; in determineLiveOperandBitsSub()
/src/usr.sbin/bsdconfig/networking/include/
H A Dmessages.subr51 msg_hostname_label_contains_invalid_chars="ERROR! One or more individual labels within the hostname…
52 msg_hostname_label_exceeds_max_length="ERROR! One or more individual labels within the hostname\n(s…
53 msg_hostname_label_is_null="ERROR! One or more individual labels within the hostname\n(separated by…
54 msg_hostname_label_starts_or_ends_with_hyphen="ERROR! One or more individual labels within the host…
57 msg_ipv4_addr_octet_contains_invalid_chars="ERROR! One or more individual octets within the IPv4 ad…
58 msg_ipv4_addr_octet_exceeds_max_value="ERROR! One or more individual octets within the IPv4 address…
59 msg_ipv4_addr_octet_is_null="ERROR! One or more individual octets within the IPv4 address\n(separat…
61 msg_ipv4_mask_field_contains_invalid_chars="ERROR! One or more individual fields within the subnet …
62 msg_ipv4_mask_field_exceeds_max_value="ERROR! One or more individual fields within the subnet mask\…
63 msg_ipv4_mask_field_invalid_value="ERROR! One or more individual fields within the subnet mask\n(se…
[all …]
/src/contrib/arm-optimized-routines/math/aarch64/experimental/
H A Datanh_3u.c15 #define One 0x3ff0000000000000 macro
68 if (unlikely (ia == One)) in atanh()
71 if (unlikely (ia > One)) in atanh()
H A Datanhf_3u1.c15 #define One 0x3f800000 macro
71 if (iax == One) in atanhf()
74 if (unlikely (iax > One)) in atanhf()
H A Datanf_2u9.c16 #define One 0x3f800000 macro
45 if (ia > One) in atanf()
H A Dasinhf_3u5.c16 #define One (0x3f8) macro
52 if (ia12 < One) in asinhf()
H A Dacosf_1u4.c15 #define One 0x3f800000 macro
67 if (ia > One) in acosf()
H A Dasinf_2u5.c15 #define One 0x3f800000 macro
69 if (ia > One) in asinf()
H A Dasin_3u.c15 #define One 0x3ff0000000000000 macro
71 if (ia > One) in asin()
H A Dtanh_3u.c22 #define One 0x3ff0000000000000 macro
65 return asdouble (One | sign); in tanh()
H A Dasinh_2u5.c15 #define One 0x3ff0000000000000 /* asuint64(1.0). */ macro
55 if (ia < One) in asinh()
H A Dacos_2u.c15 #define One 0x3ff0000000000000 macro
64 if (ia > One) in acos()
H A Dtanhf_2u6.c14 #define One 0x3f800000 macro
72 return asfloat (One | sign); in tanhf()
/src/sys/contrib/device-tree/Bindings/timer/
H A Dandestech,atcpit100-timer.txt11 One 32-bit timer
14 One 16-bit PWM
15 One 16-bit timer and one 8-bit PWM
/src/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DLowerAtomic.cpp81 Constant *One = ConstantInt::get(Loaded->getType(), 1); in buildAtomicRMWValue() local
82 Value *Inc = Builder.CreateAdd(Loaded, One); in buildAtomicRMWValue()
89 Constant *One = ConstantInt::get(Loaded->getType(), 1); in buildAtomicRMWValue() local
91 Value *Dec = Builder.CreateSub(Loaded, One); in buildAtomicRMWValue()
/src/contrib/bmake/unit-tests/
H A Dvarmod-match.mk40 .if ${One Two Three Four five six seven so s:L:Ms??*} != "six seven"
89 .if ${One Two Three Four five six seven:L:M[A-Z]*} != "One Two Three Four"
94 .if ${One Two Three Four five six seven:L:M[^A-Z]*} != "five six seven"
179 .if ${One Two Three Four five six seven:L:M[^s]*[ex]} != "One Three five"
/src/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DBitTracker.h159 One, // Bit = 1. enumerator
195 BitValue(bool B) : Type(B ? One : Zero) {} in BitValue()
212 : (T == 1 ? Type == One : false); in is()
258 return Type == Zero || Type == One; in num()
262 assert(Type == Zero || Type == One);
263 return Type == One;
/src/contrib/arm-optimized-routines/math/aarch64/sve/
H A Dacosh.c14 #define One (0x3ff0000000000000) macro
32 svbool_t special = svcmpge (pg, svsub_x (pg, ix, One), Thres); in acosh()
H A Dacoshf.c11 #define One 0x3f800000 macro
33 svbool_t special = svcmpge (pg, svsub_x (pg, ix, One), Thres); in acosh()
H A Datanhf.c14 #define One (0x3f800000) macro
36 svbool_t special = svcmpge (pg, iax, One); in atanh()
/src/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DInductiveRangeCheckElimination.cpp351 const SCEV *One = SE.getOne(RHS->getType()); in parseIvAgaisntLimit() local
354 if (SE.willNotOverflow(Instruction::BinaryOps::Add, Signed, RHSS, One)) { in parseIvAgaisntLimit()
356 End = SE.getAddExpr(RHSS, One); in parseIvAgaisntLimit()
595 const SCEV *One = SE.getOne(RTy); in calculateSubRanges() local
600 GreatestSeen = SE.getMinusSCEV(End, One); in calculateSubRanges()
617 Smallest = SE.getAddExpr(End, One); in calculateSubRanges()
618 Greatest = SE.getAddExpr(Start, One); in calculateSubRanges()
756 const SCEV *One = SE.getOne(X->getType()); in computeSafeIterationSpace() local
759 return One; in computeSafeIterationSpace()
764 const SCEV *NegOne = SE.getNegativeSCEV(One); in computeSafeIterationSpace()
[all …]
/src/sys/contrib/device-tree/Bindings/sound/
H A Dsirf-usp.txt10 One of the DMA channels will be responsible for transmission (should be
15 - pinctrl-NNN: One property must exist for each entry in pinctrl-names.

12345678910>>...24