Home
last modified time | relevance | path

Searched full:lhs (Results 1 – 25 of 1011) sorted by relevance

12345678910>>...41

/freebsd-src/contrib/llvm-project/openmp/runtime/src/
H A Dkmp_atomic.h53 std::complex<type_lhs> __kmp_lhs_div_rhs(const std::complex<type_lhs> &lhs, in __kmp_lhs_div_rhs() argument
55 type_lhs a = lhs.real(); in __kmp_lhs_div_rhs()
56 type_lhs b = lhs.imag(); in __kmp_lhs_div_rhs()
74 std::complex<double> lhs = *this; member
75 *this = __kmp_lhs_div_rhs(lhs, rhs);
79 std::complex<double> lhs = *this; member
80 return __kmp_lhs_div_rhs(lhs, rhs);
93 std::complex<float> lhs = *this; member
95 return (lhs + rhs);
98 std::complex<float> lhs = *this; member
[all …]
/freebsd-src/contrib/llvm-project/llvm/lib/Support/
H A DKnownBits.cpp21 static KnownBits computeForAddCarry(const KnownBits &LHS, const KnownBits &RHS, in computeForAddCarry()
24 APInt PossibleSumZero = LHS.getMaxValue() + RHS.getMaxValue() + !CarryZero; in computeForAddCarry()
25 APInt PossibleSumOne = LHS.getMinValue() + RHS.getMinValue() + CarryOne; in computeForAddCarry()
28 APInt CarryKnownZero = ~(PossibleSumZero ^ LHS.Zero ^ RHS.Zero); in computeForAddCarry()
29 APInt CarryKnownOne = PossibleSumOne ^ LHS.One ^ RHS.One; in computeForAddCarry()
32 APInt LHSKnownUnion = LHS.Zero | LHS.One; in computeForAddCarry()
45 const KnownBits &LHS, const KnownBits &RHS, const KnownBits &Carry) { in computeForAddCarry()
48 LHS, RHS, Carry.Zero.getBoolValue(), Carry.One.getBoolValue()); in computeForAddCarry()
52 const KnownBits &LHS, in computeForAddCarry()
22 computeForAddCarry(const KnownBits & LHS,const KnownBits & RHS,bool CarryZero,bool CarryOne) computeForAddCarry() argument
51 computeForAddCarry(const KnownBits & LHS,const KnownBits & RHS,const KnownBits & Carry) computeForAddCarry() argument
58 computeForAddSub(bool Add,bool NSW,const KnownBits & LHS,KnownBits RHS) computeForAddSub() argument
88 computeForSubBorrow(const KnownBits & LHS,KnownBits RHS,const KnownBits & Borrow) computeForSubBorrow() argument
129 umax(const KnownBits & LHS,const KnownBits & RHS) umax() argument
147 umin(const KnownBits & LHS,const KnownBits & RHS) umin() argument
153 smax(const KnownBits & LHS,const KnownBits & RHS) smax() argument
166 smin(const KnownBits & LHS,const KnownBits & RHS) smin() argument
186 shl(const KnownBits & LHS,const KnownBits & RHS,bool NUW,bool NSW,bool ShAmtNonZero) shl() argument
189 __anon9671e40d0402(const KnownBits &LHS, unsigned ShiftAmt) shl() argument
271 lshr(const KnownBits & LHS,const KnownBits & RHS,bool ShAmtNonZero) lshr() argument
274 __anon9671e40d0502(const KnownBits &LHS, unsigned ShiftAmt) lshr() argument
317 ashr(const KnownBits & LHS,const KnownBits & RHS,bool ShAmtNonZero) ashr() argument
320 __anon9671e40d0602(const KnownBits &LHS, unsigned ShiftAmt) ashr() argument
365 eq(const KnownBits & LHS,const KnownBits & RHS) eq() argument
373 ne(const KnownBits & LHS,const KnownBits & RHS) ne() argument
379 ugt(const KnownBits & LHS,const KnownBits & RHS) ugt() argument
389 uge(const KnownBits & LHS,const KnownBits & RHS) uge() argument
395 ult(const KnownBits & LHS,const KnownBits & RHS) ult() argument
399 ule(const KnownBits & LHS,const KnownBits & RHS) ule() argument
403 sgt(const KnownBits & LHS,const KnownBits & RHS) sgt() argument
413 sge(const KnownBits & LHS,const KnownBits & RHS) sge() argument
419 slt(const KnownBits & LHS,const KnownBits & RHS) slt() argument
423 sle(const KnownBits & LHS,const KnownBits & RHS) sle() argument
487 computeForSatAddSub(bool Add,bool Signed,const KnownBits & LHS,const KnownBits & RHS) computeForSatAddSub() argument
634 sadd_sat(const KnownBits & LHS,const KnownBits & RHS) sadd_sat() argument
637 ssub_sat(const KnownBits & LHS,const KnownBits & RHS) ssub_sat() argument
640 uadd_sat(const KnownBits & LHS,const KnownBits & RHS) uadd_sat() argument
643 usub_sat(const KnownBits & LHS,const KnownBits & RHS) usub_sat() argument
647 mul(const KnownBits & LHS,const KnownBits & RHS,bool NoUndefSelfMultiply) mul() argument
745 mulhs(const KnownBits & LHS,const KnownBits & RHS) mulhs() argument
754 mulhu(const KnownBits & LHS,const KnownBits & RHS) mulhu() argument
763 divComputeLowBit(KnownBits Known,const KnownBits & LHS,const KnownBits & RHS,bool Exact) divComputeLowBit() argument
799 sdiv(const KnownBits & LHS,const KnownBits & RHS,bool Exact) sdiv() argument
858 udiv(const KnownBits & LHS,const KnownBits & RHS,bool Exact) udiv() argument
887 remGetLowBits(const KnownBits & LHS,const KnownBits & RHS) remGetLowBits() argument
900 urem(const KnownBits & LHS,const KnownBits & RHS) urem() argument
919 srem(const KnownBits & LHS,const KnownBits & RHS) srem() argument
[all...]
H A DZ3Solver.cpp253 static bool areEquivalent(const llvm::fltSemantics &LHS, in areEquivalent()
255 return (llvm::APFloat::semanticsPrecision(LHS) == in areEquivalent()
257 (llvm::APFloat::semanticsMinExponent(LHS) == in areEquivalent()
259 (llvm::APFloat::semanticsMaxExponent(LHS) ==
261 (llvm::APFloat::semanticsSizeInBits(LHS) ==
363 SMTExprRef mkBVAdd(const SMTExprRef &LHS, const SMTExprRef &RHS) override { in mkBVMul() argument
365 Z3Expr(Context, Z3_mk_bvadd(Context.Context, toZ3Expr(*LHS).AST, in mkBVMul()
369 SMTExprRef mkBVSub(const SMTExprRef &LHS, const SMTExprRef &RHS) override { in mkBVSRem() argument
371 Z3Expr(Context, Z3_mk_bvsub(Context.Context, toZ3Expr(*LHS).AST, in mkBVSRem()
375 SMTExprRef mkBVMul(const SMTExprRef &LHS, cons argument
248 areEquivalent(const llvm::fltSemantics & LHS,const llvm::fltSemantics & RHS) areEquivalent() argument
351 mkBVAdd(const SMTExprRef & LHS,const SMTExprRef & RHS) mkBVAdd() argument
357 mkBVSub(const SMTExprRef & LHS,const SMTExprRef & RHS) mkBVSub() argument
381 mkBVSDiv(const SMTExprRef & LHS,const SMTExprRef & RHS) mkBVSDiv() argument
387 mkBVUDiv(const SMTExprRef & LHS,const SMTExprRef & RHS) mkBVUDiv() argument
393 mkBVShl(const SMTExprRef & LHS,const SMTExprRef & RHS) mkBVShl() argument
399 mkBVAshr(const SMTExprRef & LHS,const SMTExprRef & RHS) mkBVAshr() argument
405 mkBVLshr(const SMTExprRef & LHS,const SMTExprRef & RHS) mkBVLshr() argument
411 mkBVXor(const SMTExprRef & LHS,const SMTExprRef & RHS) mkBVXor() argument
417 mkBVOr(const SMTExprRef & LHS,const SMTExprRef & RHS) mkBVOr() argument
423 mkBVAnd(const SMTExprRef & LHS,const SMTExprRef & RHS) mkBVAnd() argument
429 mkBVUlt(const SMTExprRef & LHS,const SMTExprRef & RHS) mkBVUlt() argument
435 mkBVSlt(const SMTExprRef & LHS,const SMTExprRef & RHS) mkBVSlt() argument
441 mkBVUgt(const SMTExprRef & LHS,const SMTExprRef & RHS) mkBVUgt() argument
447 mkBVSgt(const SMTExprRef & LHS,const SMTExprRef & RHS) mkBVSgt() argument
453 mkBVUle(const SMTExprRef & LHS,const SMTExprRef & RHS) mkBVUle() argument
459 mkBVSle(const SMTExprRef & LHS,const SMTExprRef & RHS) mkBVSle() argument
465 mkBVUge(const SMTExprRef & LHS,const SMTExprRef & RHS) mkBVUge() argument
471 mkBVSge(const SMTExprRef & LHS,const SMTExprRef & RHS) mkBVSge() argument
477 mkAnd(const SMTExprRef & LHS,const SMTExprRef & RHS) mkAnd() argument
482 mkOr(const SMTExprRef & LHS,const SMTExprRef & RHS) mkOr() argument
487 mkEqual(const SMTExprRef & LHS,const SMTExprRef & RHS) mkEqual() argument
518 mkFPMul(const SMTExprRef & LHS,const SMTExprRef & RHS) mkFPMul() argument
526 mkFPDiv(const SMTExprRef & LHS,const SMTExprRef & RHS) mkFPDiv() argument
534 mkFPRem(const SMTExprRef & LHS,const SMTExprRef & RHS) mkFPRem() argument
540 mkFPAdd(const SMTExprRef & LHS,const SMTExprRef & RHS) mkFPAdd() argument
548 mkFPSub(const SMTExprRef & LHS,const SMTExprRef & RHS) mkFPSub() argument
556 mkFPLt(const SMTExprRef & LHS,const SMTExprRef & RHS) mkFPLt() argument
562 mkFPGt(const SMTExprRef & LHS,const SMTExprRef & RHS) mkFPGt() argument
568 mkFPLe(const SMTExprRef & LHS,const SMTExprRef & RHS) mkFPLe() argument
574 mkFPGe(const SMTExprRef & LHS,const SMTExprRef & RHS) mkFPGe() argument
580 mkFPEqual(const SMTExprRef & LHS,const SMTExprRef & RHS) mkFPEqual() argument
611 mkBVAddNoOverflow(const SMTExprRef & LHS,const SMTExprRef & RHS,bool isSigned) mkBVAddNoOverflow() argument
620 mkBVAddNoUnderflow(const SMTExprRef & LHS,const SMTExprRef & RHS) mkBVAddNoUnderflow() argument
629 mkBVSubNoOverflow(const SMTExprRef & LHS,const SMTExprRef & RHS) mkBVSubNoOverflow() argument
638 mkBVSubNoUnderflow(const SMTExprRef & LHS,const SMTExprRef & RHS,bool isSigned) mkBVSubNoUnderflow() argument
647 mkBVSDivNoOverflow(const SMTExprRef & LHS,const SMTExprRef & RHS) mkBVSDivNoOverflow() argument
663 mkBVMulNoOverflow(const SMTExprRef & LHS,const SMTExprRef & RHS,bool isSigned) mkBVMulNoOverflow() argument
672 mkBVMulNoUnderflow(const SMTExprRef & LHS,const SMTExprRef & RHS) mkBVMulNoUnderflow() argument
679 mkBVConcat(const SMTExprRef & LHS,const SMTExprRef & RHS) mkBVConcat() argument
[all...]
/freebsd-src/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyInstrFloat.td27 defm _F32 : I<(outs F32:$dst), (ins F32:$lhs, F32:$rhs), (outs), (ins),
28 [(set F32:$dst, (node F32:$lhs, F32:$rhs))],
29 !strconcat("f32.", !strconcat(name, "\t$dst, $lhs, $rhs")),
31 defm _F64 : I<(outs F64:$dst), (ins F64:$lhs, F64:$rhs), (outs), (ins),
32 [(set F64:$dst, (node F64:$lhs, F64:$rhs))],
33 !strconcat("f64.", !strconcat(name, "\t$dst, $lhs, $rhs")),
37 defm _F32 : I<(outs I32:$dst), (ins F32:$lhs, F32:$rhs), (outs), (ins),
38 [(set I32:$dst, (setcc F32:$lhs, F32:$rhs, cond))],
39 !strconcat("f32.", !strconcat(name, "\t$dst, $lhs, $rhs")),
41 defm _F64 : I<(outs I32:$dst), (ins F64:$lhs, F64:$rhs), (outs), (ins),
[all …]
H A DWebAssemblyInstrInteger.td27 defm _I32 : I<(outs I32:$dst), (ins I32:$lhs, I32:$rhs), (outs), (ins),
28 [(set I32:$dst, (node I32:$lhs, I32:$rhs))],
29 !strconcat("i32.", !strconcat(name, "\t$dst, $lhs, $rhs")),
31 defm _I64 : I<(outs I64:$dst), (ins I64:$lhs, I64:$rhs), (outs), (ins),
32 [(set I64:$dst, (node I64:$lhs, I64:$rhs))],
33 !strconcat("i64.", !strconcat(name, "\t$dst, $lhs, $rhs")),
37 defm _I32 : I<(outs I32:$dst), (ins I32:$lhs, I32:$rhs), (outs), (ins),
38 [(set I32:$dst, (setcc I32:$lhs, I32:$rhs, cond))],
39 !strconcat("i32.", !strconcat(name, "\t$dst, $lhs, $rhs")),
41 defm _I64 : I<(outs I32:$dst), (ins I64:$lhs, I64:$rhs), (outs), (ins),
[all …]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Support/
H A DAlignment.h46 friend bool operator==(Align Lhs, Align Rhs);
47 friend bool operator!=(Align Lhs, Align Rhs);
48 friend bool operator<=(Align Lhs, Align Rhs);
49 friend bool operator>=(Align Lhs, Align Rhs);
50 friend bool operator<(Align Lhs, Align Rhs);
51 friend bool operator>(Align Lhs, Align Rhs);
145 inline bool isAligned(Align Lhs, uint64_t SizeInBytes) { in isAligned() argument
146 return SizeInBytes % Lhs.value() == 0; in isAligned()
150 inline bool isAddrAligned(Align Lhs, const void *Addr) { in isAddrAligned() argument
151 return isAligned(Lhs, reinterpret_cast<uintptr_t>(Addr)); in isAddrAligned()
[all …]
H A DKnownBits.h314 /// Return true if LHS and RHS have no common bits set. in unionWith()
315 static bool haveNoCommonBitsSet(const KnownBits &LHS, const KnownBits &RHS) {
316 return (LHS.Zero | RHS.Zero).isAllOnes();
319 /// Compute known bits resulting from adding LHS, RHS and a 1-bit Carry. in commonBits()
321 const KnownBits &LHS, const KnownBits &RHS, const KnownBits &Carry);
323 /// Compute known bits resulting from adding LHS and RHS. in haveNoCommonBitsSet()
325 const KnownBits &LHS, const KnownBits &RHS); in haveNoCommonBitsSet()
327 /// Compute known bits results from subtracting RHS from LHS with 1-bit
329 static KnownBits computeForSubBorrow(const KnownBits &LHS, KnownBits RHS,
332 /// Compute knownbits resulting from llvm.sadd.sat(LHS, RH
[all...]
H A DTypeSize.h100 friend constexpr LeafTy &operator+=(LeafTy &LHS, const LeafTy &RHS) {
101 assert((LHS.Quantity == 0 || RHS.Quantity == 0 ||
102 LHS.Scalable == RHS.Scalable) &&
104 LHS.Quantity += RHS.Quantity;
106 LHS.Scalable = RHS.Scalable;
107 return LHS;
110 friend constexpr LeafTy &operator-=(LeafTy &LHS, const LeafTy &RHS) {
111 assert((LHS.Quantity == 0 || RHS.Quantity == 0 ||
112 LHS.Scalable == RHS.Scalable) &&
114 LHS
203 isKnownLT(const FixedOrScalableQuantity & LHS,const FixedOrScalableQuantity & RHS) isKnownLT() argument
210 isKnownGT(const FixedOrScalableQuantity & LHS,const FixedOrScalableQuantity & RHS) isKnownGT() argument
217 isKnownLE(const FixedOrScalableQuantity & LHS,const FixedOrScalableQuantity & RHS) isKnownLE() argument
224 isKnownGE(const FixedOrScalableQuantity & LHS,const FixedOrScalableQuantity & RHS) isKnownGE() argument
[all...]
H A DSMTAPI.h67 friend bool operator==(SMTSort const &LHS, SMTSort const &RHS) {
68 return LHS.equal_to(RHS);
114 friend bool operator==(SMTExpr const &LHS, SMTExpr const &RHS) {
115 return LHS.equal_to(RHS);
197 virtual SMTExprRef mkBVAdd(const SMTExprRef &LHS, const SMTExprRef &RHS) = 0;
200 virtual SMTExprRef mkBVSub(const SMTExprRef &LHS, const SMTExprRef &RHS) = 0;
203 virtual SMTExprRef mkBVMul(const SMTExprRef &LHS, const SMTExprRef &RHS) = 0;
206 virtual SMTExprRef mkBVSRem(const SMTExprRef &LHS, const SMTExprRef &RHS) = 0;
209 virtual SMTExprRef mkBVURem(const SMTExprRef &LHS, const SMTExprRef &RHS) = 0;
212 virtual SMTExprRef mkBVSDiv(const SMTExprRef &LHS, cons
[all...]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/IR/
H A DMatrixBuilder.h37 std::pair<Value *, Value *> splatScalarOperandIfNeeded(Value *LHS, in splatScalarOperandIfNeeded() argument
39 assert((LHS->getType()->isVectorTy() || RHS->getType()->isVectorTy()) && in splatScalarOperandIfNeeded()
41 if (LHS->getType()->isVectorTy() && !RHS->getType()->isVectorTy()) { in splatScalarOperandIfNeeded()
42 assert(!isa<ScalableVectorType>(LHS->getType()) && in splatScalarOperandIfNeeded()
43 "LHS Assumed to be fixed width"); in splatScalarOperandIfNeeded()
45 cast<VectorType>(LHS->getType())->getElementCount(), RHS, in splatScalarOperandIfNeeded()
47 } else if (!LHS->getType()->isVectorTy() && RHS->getType()->isVectorTy()) { in splatScalarOperandIfNeeded()
50 LHS = B.CreateVectorSplat( in splatScalarOperandIfNeeded()
51 cast<VectorType>(RHS->getType())->getElementCount(), LHS, in splatScalarOperandIfNeeded()
54 return {LHS, RHS}; in splatScalarOperandIfNeeded()
[all …]
H A DPatternMatch.h1027 // The LHS is always matched first. in match()
1028 AnyBinaryOp_match(const LHS_t &LHS, const RHS_t &RHS) : L(LHS), R(RHS) {} in match()
1039 template <typename LHS, typename RHS>
1040 inline AnyBinaryOp_match<LHS, RHS> m_BinOp(const LHS &L, const RHS &R) {
1041 return AnyBinaryOp_match<LHS, RHS>(L, R);
1075 // The LHS is always matched first. in m_FDiv()
1076 BinaryOp_match(const LHS_t &LHS, const RHS_t &RHS) : L(LHS), in m_FDiv()
1904 Value *LHS = II->getOperand(0), *RHS = II->getOperand(1); match() local
1920 auto *LHS = Cmp->getOperand(0); match() local
[all...]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/Remarks/
H A DRemark.h148 bool operator<(const std::optional<T> &LHS, const std::optional<T> &RHS) {
152 if (!LHS && !RHS)
154 if (!LHS && RHS)
156 if (LHS && !RHS)
158 return *LHS < *RHS;
161 inline bool operator==(const RemarkLocation &LHS, const RemarkLocation &RHS) {
162 return LHS.SourceFilePath == RHS.SourceFilePath &&
163 LHS.SourceLine == RHS.SourceLine &&
164 LHS.SourceColumn == RHS.SourceColumn;
167 inline bool operator!=(const RemarkLocation &LHS, const RemarkLocation &RHS) {
[all …]
/freebsd-src/sys/ddb/
H A Ddb_expr.c160 db_expr_t lhs, rhs; in db_mult_expr() local
163 if (!db_unary(&lhs)) in db_mult_expr()
178 lhs *= rhs; in db_mult_expr()
181 lhs &= rhs; in db_mult_expr()
189 lhs /= rhs; in db_mult_expr()
191 lhs %= rhs; in db_mult_expr()
193 lhs = roundup(lhs, rhs); in db_mult_expr()
198 *valuep = lhs; in db_mult_expr()
205 db_expr_t lhs, rhs; in db_add_expr() local
208 if (!db_mult_expr(&lhs)) in db_add_expr()
[all …]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/
H A DMIPatternMatch.h396 BinaryOp_match(const LHS_P &LHS, const RHS_P &RHS) : L(LHS), R(RHS) {}
419 BinaryOpc_match(unsigned Opcode, const LHS_P &LHS, const RHS_P &RHS)
420 : Opc(Opcode), L(LHS), R(RHS) {}
437 template <typename LHS, typename RHS>
438 inline BinaryOpc_match<LHS, RHS, false> m_BinOp(unsigned Opcode, const LHS &L,
440 return BinaryOpc_match<LHS, RHS, false>(Opcode, L, R);
443 template <typename LHS, typename RHS>
444 inline BinaryOpc_match<LHS, RHS, true>
445 m_CommutativeBinOp(unsigned Opcode, const LHS &L, const RHS &R) {
446 return BinaryOpc_match<LHS, RHS, true>(Opcode, L, R);
[all …]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/Orc/Shared/
H A DExecutorAddress.h111 friend bool operator==(const ExecutorAddr &LHS, const ExecutorAddr &RHS) {
112 return LHS.Addr == RHS.Addr;
115 friend bool operator!=(const ExecutorAddr &LHS, const ExecutorAddr &RHS) {
116 return LHS.Addr != RHS.Addr;
119 friend bool operator<(const ExecutorAddr &LHS, const ExecutorAddr &RHS) {
120 return LHS.Addr < RHS.Addr;
123 friend bool operator<=(const ExecutorAddr &LHS, const ExecutorAddr &RHS) {
124 return LHS.Addr <= RHS.Addr;
127 friend bool operator>(const ExecutorAddr &LHS, const ExecutorAddr &RHS) {
128 return LHS.Addr > RHS.Addr;
[all …]
/freebsd-src/contrib/llvm-project/clang/lib/Analysis/FlowSensitive/
H A DArena.cpp18 canonicalFormulaPair(const Formula &LHS, const Formula &RHS) { in canonicalFormulaPair() argument
19 auto Res = std::make_pair(&LHS, &RHS); in canonicalFormulaPair()
20 if (&RHS < &LHS) // FIXME: use a deterministic order instead in canonicalFormulaPair()
41 const Formula &Arena::makeAnd(const Formula &LHS, const Formula &RHS) { in makeAnd() argument
42 return cached(Ands, canonicalFormulaPair(LHS, RHS), [&] { in makeAnd()
43 if (&LHS == &RHS) in makeAnd()
44 return &LHS; in makeAnd()
45 if (LHS.kind() == Formula::Literal) in makeAnd()
46 return LHS.literal() ? &RHS : &LHS; in makeAnd()
48 return RHS.literal() ? &LHS : &RHS; in makeAnd()
[all …]
/freebsd-src/contrib/llvm-project/clang/include/clang/APINotes/
H A DTypes.h120 inline bool operator==(const CommonEntityInfo &LHS,
122 return LHS.UnavailableMsg == RHS.UnavailableMsg &&
123 LHS.Unavailable == RHS.Unavailable &&
124 LHS.UnavailableInSwift == RHS.UnavailableInSwift &&
125 LHS.SwiftPrivateSpecified == RHS.SwiftPrivateSpecified &&
126 LHS.SwiftPrivate == RHS.SwiftPrivate && LHS.SwiftName == RHS.SwiftName;
129 inline bool operator!=(const CommonEntityInfo &LHS,
131 return !(LHS == RHS);
185 inline bool operator==(const CommonTypeInfo &LHS, cons
[all...]
/freebsd-src/contrib/llvm-project/llvm/lib/DebugInfo/LogicalView/Core/
H A DLVSort.cpp27 LVSortValue llvm::logicalview::compareKind(const LVObject *LHS, in compareKind() argument
29 return std::string(LHS->kind()) < std::string(RHS->kind()); in compareKind()
33 LVSortValue llvm::logicalview::compareLine(const LVObject *LHS, in compareLine() argument
35 return LHS->getLineNumber() < RHS->getLineNumber(); in compareLine()
39 LVSortValue llvm::logicalview::compareName(const LVObject *LHS, in compareName() argument
41 return LHS->getName() < RHS->getName(); in compareName()
45 LVSortValue llvm::logicalview::compareOffset(const LVObject *LHS, in compareOffset() argument
47 return LHS->getOffset() < RHS->getOffset(); in compareOffset()
51 LVSortValue llvm::logicalview::compareRange(const LVObject *LHS, in compareRange() argument
53 if (LHS->getLowerAddress() < RHS->getLowerAddress()) in compareRange()
[all …]
/freebsd-src/contrib/processor-trace/libipt/test/src/
H A Dptunit-asid.c264 struct pt_asid lhs, rhs; in match_default() local
267 pt_asid_init(&lhs); in match_default()
270 errcode = pt_asid_match(&lhs, &rhs); in match_default()
273 lhs.cr3 = 0x2300ull; in match_default()
274 lhs.vmcs = 0x42000ull; in match_default()
276 errcode = pt_asid_match(&lhs, &rhs); in match_default()
279 errcode = pt_asid_match(&rhs, &lhs); in match_default()
287 struct pt_asid lhs, rhs; in match_default_mixed() local
290 pt_asid_init(&lhs); in match_default_mixed()
293 errcode = pt_asid_match(&lhs, &rhs); in match_default_mixed()
[all …]
/freebsd-src/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DSMTConv.h91 const llvm::SMTExprRef &LHS, in fromBinOp() argument
95 assert(*Solver->getSort(LHS) == *Solver->getSort(RHS) && in fromBinOp()
101 return Solver->mkBVMul(LHS, RHS); in fromBinOp()
104 return isSigned ? Solver->mkBVSDiv(LHS, RHS) : Solver->mkBVUDiv(LHS, RHS); in fromBinOp()
107 return isSigned ? Solver->mkBVSRem(LHS, RHS) : Solver->mkBVURem(LHS, RHS); in fromBinOp()
111 return Solver->mkBVAdd(LHS, RHS); in fromBinOp()
114 return Solver->mkBVSub(LHS, RHS); in fromBinOp()
118 return Solver->mkBVShl(LHS, RHS); in fromBinOp()
121 return isSigned ? Solver->mkBVAshr(LHS, RHS) : Solver->mkBVLshr(LHS, RHS); in fromBinOp()
125 return isSigned ? Solver->mkBVSlt(LHS, RHS) : Solver->mkBVUlt(LHS, RHS); in fromBinOp()
[all …]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/DebugInfo/CodeView/
H A DGUID.h25 inline bool operator==(const GUID &LHS, const GUID &RHS) {
26 return 0 == ::memcmp(LHS.Guid, RHS.Guid, sizeof(LHS.Guid));
29 inline bool operator<(const GUID &LHS, const GUID &RHS) {
30 return ::memcmp(LHS.Guid, RHS.Guid, sizeof(LHS.Guid)) < 0;
33 inline bool operator<=(const GUID &LHS, const GUID &RHS) {
34 return ::memcmp(LHS.Guid, RHS.Guid, sizeof(LHS.Guid)) <= 0;
37 inline bool operator>(const GUID &LHS, const GUID &RHS) {
38 return !(LHS <= RHS);
41 inline bool operator>=(const GUID &LHS, const GUID &RHS) {
42 return !(LHS < RHS);
[all …]
/freebsd-src/contrib/llvm-project/llvm/include/llvm/ADT/
H A DTwine.h160 /// LHS - The prefix in the concatenation, which may be uninitialized for
162 Child LHS; variable
180 explicit Twine(const Twine &LHS, const Twine &RHS) in Twine() argument
182 this->LHS.twine = &LHS; in Twine()
188 explicit Twine(Child LHS, NodeKind LHSKind, Child RHS, NodeKind RHSKind) in Twine() argument
189 : LHS(LHS), RHS(RHS), LHSKind(LHSKind), RHSKind(RHSKind) { in Twine()
229 // The RHS cannot be non-empty if the LHS is empty. in isValid()
235 !LHS.twine->isBinary()) in isValid()
275 LHS.cString = Str; in Twine()
288 LHS.stdString = &Str; in Twine()
[all …]
/freebsd-src/contrib/llvm-project/lldb/include/lldb/Utility/
H A DScalar.h205 static Type PromoteToMaxType(Scalar &lhs, Scalar &rhs);
213 friend const Scalar operator+(const Scalar &lhs, const Scalar &rhs);
214 friend const Scalar operator-(Scalar lhs, Scalar rhs);
215 friend const Scalar operator/(Scalar lhs, Scalar rhs);
216 friend const Scalar operator*(Scalar lhs, Scalar rhs);
217 friend const Scalar operator&(Scalar lhs, Scalar rhs);
218 friend const Scalar operator|(Scalar lhs, Scalar rhs);
219 friend const Scalar operator%(Scalar lhs, Scalar rhs);
220 friend const Scalar operator^(Scalar lhs, Scalar rhs);
221 friend const Scalar operator<<(const Scalar &lhs, cons
[all...]
/freebsd-src/contrib/llvm-project/clang/include/clang/Edit/
H A DFileOffset.h37 friend bool operator==(FileOffset LHS, FileOffset RHS) {
38 return LHS.FID == RHS.FID && LHS.Offs == RHS.Offs;
41 friend bool operator!=(FileOffset LHS, FileOffset RHS) {
42 return !(LHS == RHS);
45 friend bool operator<(FileOffset LHS, FileOffset RHS) {
46 return std::tie(LHS.FID, LHS.Offs) < std::tie(RHS.FID, RHS.Offs);
49 friend bool operator>(FileOffset LHS, FileOffset RHS) {
50 return RHS < LHS;
53 friend bool operator>=(FileOffset LHS, FileOffset RHS) {
54 return !(LHS < RHS);
[all …]
/freebsd-src/contrib/llvm-project/clang/include/clang/Basic/
H A DThunk.h72 friend bool operator==(const ReturnAdjustment &LHS,
74 return LHS.NonVirtual == RHS.NonVirtual && LHS.Virtual.Equals(RHS.Virtual);
77 friend bool operator!=(const ReturnAdjustment &LHS,
79 return !(LHS == RHS);
82 friend bool operator<(const ReturnAdjustment &LHS,
84 if (LHS.NonVirtual < RHS.NonVirtual)
87 return LHS.NonVirtual == RHS.NonVirtual && LHS.Virtual.Less(RHS.Virtual);
139 friend bool operator==(const ThisAdjustment &LHS, cons
[all...]

12345678910>>...41