| /freebsd/contrib/llvm-project/llvm/lib/Support/ |
| H A D | KnownBits.cpp | 30 static KnownBits computeForAddCarry(const KnownBits &LHS, const KnownBits &RHS, in computeForAddCarry() argument 33 APInt PossibleSumZero = LHS.getMaxValue() + RHS.getMaxValue() + !CarryZero; in computeForAddCarry() 34 APInt PossibleSumOne = LHS.getMinValue() + RHS.getMinValue() + CarryOne; in computeForAddCarry() 37 APInt CarryKnownZero = ~(PossibleSumZero ^ LHS.Zero ^ RHS.Zero); in computeForAddCarry() 38 APInt CarryKnownOne = PossibleSumOne ^ LHS.One ^ RHS.One; in computeForAddCarry() 41 APInt LHSKnownUnion = LHS.Zero | LHS.One; in computeForAddCarry() 54 const KnownBits &LHS, const KnownBits &RHS, const KnownBits &Carry) { in computeForAddCarry() argument 57 LHS, RHS, Carry.Zero.getBoolValue(), Carry.One.getBoolValue()); in computeForAddCarry() 61 const KnownBits &LHS, in computeForAddSub() argument 63 unsigned BitWidth = LHS.getBitWidth(); in computeForAddSub() [all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Remarks/ |
| H A D | Remark.h | 149 bool operator<(const std::optional<T> &LHS, const std::optional<T> &RHS) { 153 if (!LHS && !RHS) 155 if (!LHS && RHS) 157 if (LHS && !RHS) 159 return *LHS < *RHS; 162 inline bool operator==(const RemarkLocation &LHS, const RemarkLocation &RHS) { 163 return LHS.SourceFilePath == RHS.SourceFilePath && 164 LHS.SourceLine == RHS.SourceLine && 165 LHS.SourceColumn == RHS.SourceColumn; 168 inline bool operator!=(const RemarkLocation &LHS, const RemarkLocation &RHS) { [all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | Twine.h | 163 Child LHS; variable 181 explicit Twine(const Twine &LHS, const Twine &RHS) in Twine() argument 183 this->LHS.twine = &LHS; in Twine() 189 explicit Twine(Child LHS, NodeKind LHSKind, Child RHS, NodeKind RHSKind) in Twine() argument 190 : LHS(LHS), RHS(RHS), LHSKind(LHSKind), RHSKind(RHSKind) { in Twine() 236 !LHS.twine->isBinary()) in isValid() 276 LHS.cString = Str; in Twine() 290 LHS.stdString = &Str; in Twine() 300 LHS.ptrAndLength.ptr = Str.data(); in Twine() 301 LHS.ptrAndLength.length = Str.length(); in Twine() [all …]
|
| H A D | DenseMapInfo.h | 90 static bool isEqual(const T *LHS, const T *RHS) { return LHS == RHS; } 99 static bool isEqual(const char &LHS, const char &RHS) { 100 return LHS == RHS; 110 static bool isEqual(const unsigned char &LHS, const unsigned char &RHS) { 111 return LHS == RHS; 121 static bool isEqual(const unsigned short &LHS, const unsigned short &RHS) { 122 return LHS == RHS; 132 static bool isEqual(const unsigned& LHS, const unsigned& RHS) { 133 return LHS == RHS; 149 static bool isEqual(const unsigned long& LHS, const unsigned long& RHS) { [all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | KnownBits.h | 319 static bool haveNoCommonBitsSet(const KnownBits &LHS, const KnownBits &RHS) { in haveNoCommonBitsSet() 320 return (LHS.Zero | RHS.Zero).isAllOnes(); in haveNoCommonBitsSet() 324 LLVM_ABI static KnownBits computeForAddCarry(const KnownBits &LHS, 330 const KnownBits &LHS, 335 LLVM_ABI static KnownBits computeForSubBorrow(const KnownBits &LHS, 340 static KnownBits add(const KnownBits &LHS, const KnownBits &RHS, 342 return computeForAddSub(/*Add=*/true, NSW, NUW, LHS, RHS); 346 static KnownBits sub(const KnownBits &LHS, const KnownBits &RHS, 348 return computeForAddSub(/*Add=*/false, NSW, NUW, LHS, RHS); 352 LLVM_ABI static KnownBits sadd_sat(const KnownBits &LHS, [all …]
|
| H A D | TypeSize.h | 101 friend constexpr LeafTy &operator+=(LeafTy &LHS, const LeafTy &RHS) { 102 assert((LHS.Quantity == 0 || RHS.Quantity == 0 || 103 LHS.Scalable == RHS.Scalable) && 105 LHS.Quantity += RHS.Quantity; 107 LHS.Scalable = RHS.Scalable; 108 return LHS; 111 friend constexpr LeafTy &operator-=(LeafTy &LHS, const LeafTy &RHS) { 112 assert((LHS.Quantity == 0 || RHS.Quantity == 0 || 113 LHS.Scalable == RHS.Scalable) && 115 LHS.Quantity -= RHS.Quantity; [all …]
|
| H A D | SMTAPI.h | 68 friend bool operator==(SMTSort const &LHS, SMTSort const &RHS) { 69 return LHS.equal_to(RHS); 117 friend bool operator==(SMTExpr const &LHS, SMTExpr const &RHS) { 118 return LHS.equal_to(RHS); 206 virtual SMTExprRef mkBVAdd(const SMTExprRef &LHS, const SMTExprRef &RHS) = 0; 209 virtual SMTExprRef mkBVSub(const SMTExprRef &LHS, const SMTExprRef &RHS) = 0; 212 virtual SMTExprRef mkBVMul(const SMTExprRef &LHS, const SMTExprRef &RHS) = 0; 215 virtual SMTExprRef mkBVSRem(const SMTExprRef &LHS, const SMTExprRef &RHS) = 0; 218 virtual SMTExprRef mkBVURem(const SMTExprRef &LHS, const SMTExprRef &RHS) = 0; 221 virtual SMTExprRef mkBVSDiv(const SMTExprRef &LHS, const SMTExprRef &RHS) = 0; [all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/IR/ |
| H A D | MatrixBuilder.h | 37 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() 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() 126 CallInst *CreateMatrixMultiply(Value *LHS, Value *RHS, unsigned LHSRows, [all …]
|
| H A D | PatternMatch.h | 1075 AnyBinaryOp_match(const LHS_t &LHS, const RHS_t &RHS) : L(LHS), R(RHS) {} in AnyBinaryOp_match() 1086 template <typename LHS, typename RHS> 1087 inline AnyBinaryOp_match<LHS, RHS> m_BinOp(const LHS &L, const RHS &R) { in m_BinOp() 1088 return AnyBinaryOp_match<LHS, RHS>(L, R); in m_BinOp() 1123 BinaryOp_match(const LHS_t &LHS, const RHS_t &RHS) : L(LHS), R(RHS) {} in BinaryOp_match() 1140 template <typename LHS, typename RHS> 1141 inline BinaryOp_match<LHS, RHS, Instruction::Add> m_Add(const LHS &L, in m_Add() 1143 return BinaryOp_match<LHS, RHS, Instruction::Add>(L, R); in m_Add() 1146 template <typename LHS, typename RHS> 1147 inline BinaryOp_match<LHS, RHS, Instruction::FAdd> m_FAdd(const LHS &L, in m_FAdd() [all …]
|
| /freebsd/contrib/llvm-project/llvm/lib/DebugInfo/LogicalView/Core/ |
| H A D | LVSort.cpp | 26 LVSortValue llvm::logicalview::compareKind(const LVObject *LHS, in compareKind() argument 28 return std::string(LHS->kind()) < std::string(RHS->kind()); in compareKind() 32 LVSortValue llvm::logicalview::compareLine(const LVObject *LHS, in compareLine() argument 34 return LHS->getLineNumber() < RHS->getLineNumber(); in compareLine() 38 LVSortValue llvm::logicalview::compareName(const LVObject *LHS, in compareName() argument 40 return LHS->getName() < RHS->getName(); in compareName() 44 LVSortValue llvm::logicalview::compareOffset(const LVObject *LHS, in compareOffset() argument 46 return LHS->getOffset() < RHS->getOffset(); in compareOffset() 50 LVSortValue llvm::logicalview::compareRange(const LVObject *LHS, in compareRange() argument 52 if (LHS->getLowerAddress() < RHS->getLowerAddress()) in compareRange() [all …]
|
| /freebsd/contrib/llvm-project/clang/include/clang/APINotes/ |
| H A D | Types.h | 120 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, const CommonTypeInfo &RHS) { 186 return static_cast<const CommonEntityInfo &>(LHS) == RHS && [all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/ |
| H A D | MIPatternMatch.h | 452 BinaryOp_match(const LHS_P &LHS, const RHS_P &RHS) : L(LHS), R(RHS) {} 482 BinaryOpc_match(unsigned Opcode, const LHS_P &LHS, const RHS_P &RHS) 483 : Opc(Opcode), L(LHS), R(RHS) {} 505 template <typename LHS, typename RHS> 506 inline BinaryOpc_match<LHS, RHS, false> m_BinOp(unsigned Opcode, const LHS &L, 508 return BinaryOpc_match<LHS, RHS, false>(Opcode, L, R); 511 template <typename LHS, typename RHS> 512 inline BinaryOpc_match<LHS, RHS, true> 513 m_CommutativeBinOp(unsigned Opcode, const LHS &L, const RHS &R) { 514 return BinaryOpc_match<LHS, RHS, true>(Opcode, L, R); [all …]
|
| /freebsd/contrib/llvm-project/clang/lib/Analysis/FlowSensitive/ |
| H A D | Arena.cpp | 18 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/contrib/llvm-project/clang/include/clang/Basic/ |
| H A D | Thunk.h | 72 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, const ThisAdjustment &RHS) { 140 return LHS.NonVirtual == RHS.NonVirtual && LHS.Virtual.Equals(RHS.Virtual); 143 friend bool operator!=(const ThisAdjustment &LHS, const ThisAdjustment &RHS) { [all …]
|
| H A D | FileEntry.h | 90 friend bool operator==(const FileEntryRef &LHS, const FileEntryRef &RHS) { 91 return &LHS.getFileEntry() == &RHS.getFileEntry(); 93 friend bool operator==(const FileEntry *LHS, const FileEntryRef &RHS) { 94 return LHS == &RHS.getFileEntry(); 96 friend bool operator==(const FileEntryRef &LHS, const FileEntry *RHS) { 97 return &LHS.getFileEntry() == RHS; 99 friend bool operator!=(const FileEntryRef &LHS, const FileEntryRef &RHS) { 100 return !(LHS == RHS); 102 friend bool operator!=(const FileEntry *LHS, const FileEntryRef &RHS) { 103 return !(LHS == RHS); [all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/CodeView/ |
| H A D | GUID.h | 26 inline bool operator==(const GUID &LHS, const GUID &RHS) { 27 return 0 == ::memcmp(LHS.Guid, RHS.Guid, sizeof(LHS.Guid)); 30 inline bool operator<(const GUID &LHS, const GUID &RHS) { 31 return ::memcmp(LHS.Guid, RHS.Guid, sizeof(LHS.Guid)) < 0; 34 inline bool operator<=(const GUID &LHS, const GUID &RHS) { 35 return ::memcmp(LHS.Guid, RHS.Guid, sizeof(LHS.Guid)) <= 0; 38 inline bool operator>(const GUID &LHS, const GUID &RHS) { 39 return !(LHS <= RHS); 42 inline bool operator>=(const GUID &LHS, const GUID &RHS) { 43 return !(LHS < RHS); [all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/Orc/Shared/ |
| H A D | ExecutorAddress.h | 142 friend bool operator==(const ExecutorAddr &LHS, const ExecutorAddr &RHS) { 143 return LHS.Addr == RHS.Addr; 146 friend bool operator!=(const ExecutorAddr &LHS, const ExecutorAddr &RHS) { 147 return LHS.Addr != RHS.Addr; 150 friend bool operator<(const ExecutorAddr &LHS, const ExecutorAddr &RHS) { 151 return LHS.Addr < RHS.Addr; 154 friend bool operator<=(const ExecutorAddr &LHS, const ExecutorAddr &RHS) { 155 return LHS.Addr <= RHS.Addr; 158 friend bool operator>(const ExecutorAddr &LHS, const ExecutorAddr &RHS) { 159 return LHS.Addr > RHS.Addr; [all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | SDPatternMatch.h | 538 m_SetCC(const T0_P &LHS, const T1_P &RHS, const T2_P &CC) { 539 return TernaryOpc_match<T0_P, T1_P, T2_P>(ISD::SETCC, LHS, RHS, CC); 544 m_c_SetCC(const T0_P &LHS, const T1_P &RHS, const T2_P &CC) { 545 return TernaryOpc_match<T0_P, T1_P, T2_P, true, false>(ISD::SETCC, LHS, RHS, 575 template <typename LHS, typename RHS, typename IDX> 576 inline TernaryOpc_match<LHS, RHS, IDX> 577 m_InsertSubvector(const LHS &Base, const RHS &Sub, const IDX &Idx) { 578 return TernaryOpc_match<LHS, RHS, IDX>(ISD::INSERT_SUBVECTOR, Base, Sub, Idx); 586 LHS_P LHS; 591 : Opcode(Opc), LHS(L), RHS(R), Flags(Flgs) {} [all …]
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/MC/ |
| H A D | MCExpr.h | 329 const MCExpr *LHS, *RHS; 331 MCBinaryExpr(Opcode Op, const MCExpr *LHS, const MCExpr *RHS, 333 : MCExpr(MCExpr::Binary, Loc, Op), LHS(LHS), RHS(RHS) {} in MCExpr() 339 LLVM_ABI static const MCBinaryExpr *create(Opcode Op, const MCExpr *LHS, 343 static const MCBinaryExpr *createAdd(const MCExpr *LHS, const MCExpr *RHS, 345 return create(Add, LHS, RHS, Ctx, Loc); 348 static const MCBinaryExpr *createAnd(const MCExpr *LHS, const MCExpr *RHS, in createAnd() argument 350 return create(And, LHS, RHS, Ctx); in createAnd() 353 static const MCBinaryExpr *createDiv(const MCExpr *LHS, const MCExpr *RHS, in createDiv() argument 355 return create(Div, LHS, RHS, Ctx); in createDiv() [all …]
|
| /freebsd/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
| H A D | SMTConv.h | 93 const llvm::SMTExprRef &LHS, in fromBinOp() argument 97 assert(*Solver->getSort(LHS) == *Solver->getSort(RHS) && in fromBinOp() 103 return Solver->mkBVMul(LHS, RHS); in fromBinOp() 106 return isSigned ? Solver->mkBVSDiv(LHS, RHS) : Solver->mkBVUDiv(LHS, RHS); in fromBinOp() 109 return isSigned ? Solver->mkBVSRem(LHS, RHS) : Solver->mkBVURem(LHS, RHS); in fromBinOp() 113 return Solver->mkBVAdd(LHS, RHS); in fromBinOp() 116 return Solver->mkBVSub(LHS, RHS); in fromBinOp() 120 return Solver->mkBVShl(LHS, RHS); in fromBinOp() 123 return isSigned ? Solver->mkBVAshr(LHS, RHS) : Solver->mkBVLshr(LHS, RHS); in fromBinOp() 127 return isSigned ? Solver->mkBVSlt(LHS, RHS) : Solver->mkBVUlt(LHS, RHS); in fromBinOp() [all …]
|
| /freebsd/contrib/llvm-project/clang/include/clang/Edit/ |
| H A D | FileOffset.h | 37 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/contrib/llvm-project/compiler-rt/lib/sanitizer_common/ |
| H A D | sanitizer_dense_map_info.h | 99 static constexpr bool isEqual(const T *LHS, const T *RHS) { 100 return LHS == RHS; 111 static constexpr bool isEqual(const char &LHS, const char &RHS) { 112 return LHS == RHS; 125 static constexpr bool isEqual(const unsigned char &LHS, 127 return LHS == RHS; 140 static constexpr bool isEqual(const unsigned short &LHS, 142 return LHS == RHS; 155 static constexpr bool isEqual(const unsigned &LHS, const unsigned &RHS) { 156 return LHS == RHS; [all …]
|
| /freebsd/contrib/llvm-project/clang/include/clang/AST/ |
| H A D | DeclID.h | 127 friend bool operator==(const DeclIDBase &LHS, const DeclID &RHS) { 128 return LHS.ID == RHS; 130 friend bool operator!=(const DeclIDBase &LHS, const DeclID &RHS) { 131 return !operator==(LHS, RHS); 133 friend bool operator<(const DeclIDBase &LHS, const DeclID &RHS) { 134 return LHS.ID < RHS; 136 friend bool operator<=(const DeclIDBase &LHS, const DeclID &RHS) { 137 return LHS.ID <= RHS; 139 friend bool operator>(const DeclIDBase &LHS, const DeclID &RHS) { 140 return LHS.ID > RHS; [all …]
|
| /freebsd/contrib/llvm-project/clang/lib/Analysis/ |
| H A D | ThreadSafetyLogical.cpp | 19 static bool implies(const LExpr *LHS, bool LNeg, const LExpr *RHS, bool RNeg) { in implies() argument 28 return implies(LHS, LNeg, A->left(), RNeg) && in implies() 29 implies(LHS, LNeg, A->right(), RNeg); in implies() 38 return implies(LHS, LNeg, A->left(), RNeg) || in implies() 39 implies(LHS, LNeg, A->right(), RNeg); in implies() 61 return implies(LHS, LNeg, cast<Not>(RHS)->exp(), !RNeg); in implies() 68 switch (LHS->kind()) { in implies() 74 return LNeg ? LeftAndOperator(cast<And>(LHS)) in implies() 75 : LeftOrOperator(cast<And>(LHS)); in implies() 81 return LNeg ? LeftOrOperator(cast<Or>(LHS)) in implies() [all …]
|
| /freebsd/contrib/llvm-project/compiler-rt/lib/orc/ |
| H A D | bitmask_enum.h | 117 constexpr E operator|(E LHS, E RHS) { 118 return static_cast<E>(Underlying(LHS) | Underlying(RHS)); 122 constexpr E operator&(E LHS, E RHS) { 123 return static_cast<E>(Underlying(LHS) & Underlying(RHS)); 127 constexpr E operator^(E LHS, E RHS) { 128 return static_cast<E>(Underlying(LHS) ^ Underlying(RHS)); 132 E &operator|=(E &LHS, E RHS) { 133 LHS = LHS | RHS; 134 return LHS; 138 E &operator&=(E &LHS, E RHS) { [all …]
|