/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-cov/ |
H A D | CoverageSummaryInfo.h | 38 RegionCoverageInfo &operator+=(const RegionCoverageInfo &RHS) { argument 39 Covered += RHS.Covered; 40 NumRegions += RHS.NumRegions; 44 void merge(const RegionCoverageInfo &RHS) { argument 45 Covered = std::max(Covered, RHS.Covered); 46 NumRegions = std::max(NumRegions, RHS.NumRegions); 79 LineCoverageInfo &operator+=(const LineCoverageInfo &RHS) { argument 80 Covered += RHS.Covered; 81 NumLines += RHS.NumLines; 85 void merge(const LineCoverageInfo &RHS) { argument 118 operator +=(const FunctionCoverageInfo &RHS) argument 184 operator +=(const FileCoverageSummary &RHS) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/GSYM/ |
H A D | LookupResult.h | 29 inline bool operator==(const SourceLocation &LHS, const SourceLocation &RHS) { argument 30 return LHS.Name == RHS.Name && LHS.Dir == RHS.Dir && 31 LHS.Base == RHS.Base && LHS.Line == RHS.Line;
|
H A D | FunctionInfo.h | 187 inline bool operator==(const FunctionInfo &LHS, const FunctionInfo &RHS) { argument 188 return LHS.Range == RHS.Range && LHS.Name == RHS.Name && 189 LHS.OptLineTable == RHS.OptLineTable && LHS.Inline == RHS.Inline; 191 inline bool operator!=(const FunctionInfo &LHS, const FunctionInfo &RHS) { argument 192 return !(LHS == RHS); 199 inline bool operator<(const FunctionInfo &LHS, const FunctionInfo &RHS) { argument 201 if (LHS.Range != RHS.Range) 202 return LHS.Range < RHS [all...] |
H A D | InlineInfo.h | 171 inline bool operator==(const InlineInfo &LHS, const InlineInfo &RHS) { argument 172 return LHS.Name == RHS.Name && LHS.CallFile == RHS.CallFile && 173 LHS.CallLine == RHS.CallLine && LHS.Ranges == RHS.Ranges && 174 LHS.Children == RHS.Children;
|
H A D | LineTable.h | 192 bool operator==(const LineTable &RHS) const { 193 return Lines == RHS.Lines; 195 bool operator!=(const LineTable &RHS) const { 196 return Lines != RHS.Lines; 198 bool operator<(const LineTable &RHS) const { 200 const auto RHSSize = RHS.Lines.size(); 202 return Lines < RHS.Lines;
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | LineIterator.h | 72 friend bool operator==(const line_iterator &LHS, const line_iterator &RHS) { argument 73 return LHS.Buffer == RHS.Buffer && 74 LHS.CurrentLine.begin() == RHS.CurrentLine.begin(); 77 friend bool operator!=(const line_iterator &LHS, const line_iterator &RHS) { argument 78 return !(LHS == RHS);
|
H A D | SMLoc.h | 31 bool operator==(const SMLoc &RHS) const { return RHS.Ptr == Ptr; } 32 bool operator!=(const SMLoc &RHS) const { return RHS.Ptr != Ptr; }
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | SparseBitVector.h | 68 bool operator==(const SparseBitVectorElement &RHS) const { 69 if (ElementIndex != RHS.ElementIndex) 72 if (Bits[i] != RHS.Bits[i]) 77 bool operator!=(const SparseBitVectorElement &RHS) const { 78 return !(*this == RHS); 170 // Union this element with RHS and return true if this one changed. 171 bool unionWith(const SparseBitVectorElement &RHS) { 176 Bits[i] |= RHS.Bits[i]; 183 // Return true if we have any bits in common with RHS 184 bool intersects(const SparseBitVectorElement &RHS) cons 396 SparseBitVectorIterator(const SparseBitVector<ElementSize> *RHS, bool end = false) argument [all...] |
H A D | SmallString.h | 57 void assign(StringRef RHS) { argument 59 SmallVectorImpl<char>::append(RHS.begin(), RHS.end()); 63 void assign(const SmallVectorImpl<char> &RHS) { argument 65 SmallVectorImpl<char>::append(RHS.begin(), RHS.end()); 83 void append(StringRef RHS) { argument 84 SmallVectorImpl<char>::append(RHS.begin(), RHS.end()); 88 void append(const SmallVectorImpl<char> &RHS) { argument 279 operator =(StringRef RHS) argument 284 operator +=(StringRef RHS) argument [all...] |
H A D | APInt.h | 192 const WordType *RHS, unsigned rhsWords, WordType *Quotient, 214 void AssignSlowCase(const APInt &RHS); 217 bool EqualSlowCase(const APInt &RHS) const LLVM_READONLY; 235 bool intersectsSlowCase(const APInt &RHS) const LLVM_READONLY; 238 bool isSubsetOfSlowCase(const APInt &RHS) const LLVM_READONLY; 247 void AndAssignSlowCase(const APInt& RHS); 250 void OrAssignSlowCase(const APInt& RHS); 253 void XorAssignSlowCase(const APInt& RHS); 256 /// to, or greater than RHS. 257 int compare(const APInt &RHS) cons 751 operator =(const APInt &RHS) argument 791 operator =(uint64_t RHS) argument 808 operator &=(const APInt &RHS) argument 822 operator &=(uint64_t RHS) argument 838 operator |=(const APInt &RHS) argument 852 operator |=(uint64_t RHS) argument 868 operator ^=(const APInt &RHS) argument 882 operator ^=(uint64_t RHS) argument [all...] |
H A D | Sequence.h | 58 difference_type operator-(const value_sequence_iterator &RHS) const { 59 return Value - RHS.Value; 62 bool operator==(const value_sequence_iterator &RHS) const { 63 return Value == RHS.Value; 65 bool operator<(const value_sequence_iterator &RHS) const { 66 return Value < RHS.Value;
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | ValueHandle.h | 39 ValueHandleBase(const ValueHandleBase &RHS) argument 40 : ValueHandleBase(RHS.PrevPair.getInt(), RHS) {} 42 ValueHandleBase(HandleBaseKind Kind, const ValueHandleBase &RHS) argument 43 : PrevPair(nullptr, Kind), Val(RHS.getValPtr()) { 45 AddToExistingUseList(RHS.getPrevPtr()); 69 Value *operator=(Value *RHS) { argument 70 if (getValPtr() == RHS) 71 return RHS; 74 setValPtr(RHS); 80 operator =(const ValueHandleBase &RHS) argument 144 WeakVH(const WeakVH &RHS) argument 147 WeakVH &operator=(const WeakVH &RHS) = default; member in class:llvm::WeakVH 149 operator =(Value *RHS) argument 152 operator =(const ValueHandleBase &RHS) argument 188 isEqual(const WeakVH &LHS, const WeakVH &RHS) argument 204 WeakTrackingVH(const WeakTrackingVH &RHS) argument 207 WeakTrackingVH &operator=(const WeakTrackingVH &RHS) = default; member in class:llvm::WeakTrackingVH 209 operator =(Value *RHS) argument 212 operator =(const ValueHandleBase &RHS) argument 282 AssertingVH(const AssertingVH &RHS) argument 293 operator =(ValueTy *RHS) argument 297 operator =(const AssertingVH<ValueTy> &RHS) argument 325 isEqual(const AssertingVH<T> &LHS, const AssertingVH<T> &RHS) argument 383 operator =(ValueTy *RHS) argument 513 PoisoningVH(const PoisoningVH &RHS) argument 521 operator =(const PoisoningVH &RHS) argument 556 isEqual(const PoisoningVH<T> &LHS, const PoisoningVH<T> &RHS) argument [all...] |
H A D | PatternMatch.h | 737 AnyBinaryOp_match(const LHS_t &LHS, const RHS_t &RHS) : L(LHS), R(RHS) {} argument 748 template <typename LHS, typename RHS> 749 inline AnyBinaryOp_match<LHS, RHS> m_BinOp(const LHS &L, const RHS &R) { 750 return AnyBinaryOp_match<LHS, RHS>(L, R); 765 BinaryOp_match(const LHS_t &LHS, const RHS_t &RHS) : L(LHS), R(RHS) {} argument 783 template <typename LHS, typename RHS> 784 inline BinaryOp_match<LHS, RHS, Instructio 940 OverflowingBinaryOp_match(const LHS_t &LHS, const RHS_t &RHS) argument 1033 BinOpPred_match(const LHS_t &LHS, const RHS_t &RHS) argument 1154 CmpClass_match(PredicateTy &Pred, const LHS_t &LHS, const RHS_t &RHS) argument 1468 MaxMin_match(const LHS_t &LHS, const RHS_t &RHS) argument 1483 Value *RHS = Cmp->getOperand(1); local 1969 auto RHS = m_LShr(m_Neg(m_Value(OpR)), m_SpecificInt(ShiftWidth)); local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/IR/ |
H A D | Use.cpp | 16 void Use::swap(Use &RHS) { argument 17 if (Val == RHS.Val) 24 if (RHS.Val) { 25 RHS.removeFromList(); 26 Val = RHS.Val; 33 RHS.Val = OldVal; 34 RHS.Val->addUse(RHS); 36 RHS.Val = nullptr;
|
/freebsd-11-stable/contrib/llvm-project/lldb/include/lldb/Utility/ |
H A D | UUID.h | 101 friend bool operator==(const UUID &LHS, const UUID &RHS) { argument 102 return LHS.m_bytes == RHS.m_bytes; 104 friend bool operator!=(const UUID &LHS, const UUID &RHS) { argument 105 return !(LHS == RHS); 107 friend bool operator<(const UUID &LHS, const UUID &RHS) { argument 108 return LHS.m_bytes < RHS.m_bytes; 110 friend bool operator<=(const UUID &LHS, const UUID &RHS) { argument 111 return !(RHS < LHS); 113 friend bool operator>(const UUID &LHS, const UUID &RHS) { return RHS < LH argument 114 operator >=(const UUID &LHS, const UUID &RHS) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/ |
H A D | DynamicTypeInfo.h | 36 bool operator==(const DynamicTypeInfo &RHS) const { 37 return DynTy == RHS.DynTy && CanBeASubClass == RHS.CanBeASubClass;
|
H A D | DynamicCastInfo.h | 34 bool operator==(const DynamicCastInfo &RHS) const { 35 return From == RHS.From && To == RHS.To; 37 bool operator<(const DynamicCastInfo &RHS) const { 38 return From < RHS.From && To < RHS.To;
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/AST/ |
H A D | StmtIterator.h | 82 StmtIteratorImpl(const StmtIteratorBase& RHS) : StmtIteratorBase(RHS) {} argument 107 bool operator==(const DERIVED& RHS) const { 108 return stmt == RHS.stmt && DGI == RHS.DGI && RawVAPtr == RHS.RawVAPtr; 111 bool operator!=(const DERIVED& RHS) const { 112 return stmt != RHS.stmt || DGI != RHS.DGI || RawVAPtr != RHS 133 StmtIterator(const StmtIteratorBase &RHS) argument 143 ConstStmtIterator(const StmtIterator& RHS) argument 151 cast_away_const(const ConstStmtIterator &RHS) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/X86/ |
H A D | X86InstrFoldTables.h | 73 bool operator<(const X86MemoryFoldTableEntry &RHS) const { 74 return KeyOp < RHS.KeyOp; 76 bool operator==(const X86MemoryFoldTableEntry &RHS) const { 77 return KeyOp == RHS.KeyOp;
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/AST/Interp/ |
H A D | Boolean.h | 37 bool operator<(Boolean RHS) const { return V < RHS.V; } 38 bool operator>(Boolean RHS) const { return V > RHS.V; } 39 bool operator<=(Boolean RHS) const { return V <= RHS.V; } 40 bool operator>=(Boolean RHS) const { return V >= RHS.V; } 41 bool operator==(Boolean RHS) const { return V == RHS [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/MC/ |
H A D | MCExpr.h | 453 const MCExpr *LHS, *RHS; member in class:llvm::MCBinaryExpr 455 MCBinaryExpr(Opcode Op, const MCExpr *LHS, const MCExpr *RHS, argument 457 : MCExpr(MCExpr::Binary, Loc), Op(Op), LHS(LHS), RHS(RHS) {} 464 const MCExpr *RHS, MCContext &Ctx, 467 static const MCBinaryExpr *createAdd(const MCExpr *LHS, const MCExpr *RHS, argument 469 return create(Add, LHS, RHS, Ctx); 472 static const MCBinaryExpr *createAnd(const MCExpr *LHS, const MCExpr *RHS, argument 474 return create(And, LHS, RHS, Ctx); 477 static const MCBinaryExpr *createDiv(const MCExpr *LHS, const MCExpr *RHS, argument 482 createEQ(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 487 createGT(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 492 createGTE(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 497 createLAnd(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 502 createLOr(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 507 createLT(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 512 createLTE(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 517 createMod(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 522 createMul(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 527 createNE(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 532 createOr(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 537 createShl(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 542 createAShr(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 547 createLShr(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 552 createSub(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument 557 createXor(const MCExpr *LHS, const MCExpr *RHS, MCContext &Ctx) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Lex/ |
H A D | PPConditionalDirectiveRecord.h | 46 const CondDirectiveLoc &RHS) { 47 return SM.isBeforeInTranslationUnit(LHS.getLoc(), RHS.getLoc()); 49 bool operator()(const CondDirectiveLoc &LHS, SourceLocation RHS) { argument 50 return SM.isBeforeInTranslationUnit(LHS.getLoc(), RHS); 52 bool operator()(SourceLocation LHS, const CondDirectiveLoc &RHS) { argument 53 return SM.isBeforeInTranslationUnit(LHS, RHS.getLoc()); 80 SourceLocation RHS) const { 82 findConditionalDirectiveRegionLoc(RHS); 45 operator ()(const CondDirectiveLoc &LHS, const CondDirectiveLoc &RHS) argument
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Basic/ |
H A D | SourceLocation.h | 47 bool operator==(const FileID &RHS) const { return ID == RHS.ID; } 48 bool operator<(const FileID &RHS) const { return ID < RHS.ID; } 49 bool operator<=(const FileID &RHS) const { return ID <= RHS.ID; } 50 bool operator!=(const FileID &RHS) const { return !(*this == RHS); } 51 bool operator>(const FileID &RHS) const { return RHS < *thi 183 operator ==(const SourceLocation &LHS, const SourceLocation &RHS) argument 187 operator !=(const SourceLocation &LHS, const SourceLocation &RHS) argument 193 operator <(const SourceLocation &LHS, const SourceLocation &RHS) argument 196 operator >(const SourceLocation &LHS, const SourceLocation &RHS) argument 199 operator <=(const SourceLocation &LHS, const SourceLocation &RHS) argument 202 operator >=(const SourceLocation &LHS, const SourceLocation &RHS) argument 446 operator ==(const FullSourceLoc &LHS, const FullSourceLoc &RHS) argument 452 operator !=(const FullSourceLoc &LHS, const FullSourceLoc &RHS) argument 477 isEqual(clang::FileID LHS, clang::FileID RHS) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | ScheduleDFS.h | 44 bool operator<(ILPValue RHS) const { 45 return (uint64_t)InstrCount * RHS.Length 46 < (uint64_t)Length * RHS.InstrCount; 48 bool operator>(ILPValue RHS) const { 49 return RHS < *this; 51 bool operator<=(ILPValue RHS) const { 52 return (uint64_t)InstrCount * RHS.Length 53 <= (uint64_t)Length * RHS.InstrCount; 55 bool operator>=(ILPValue RHS) const { 56 return RHS < [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/MCA/ |
H A D | Support.cpp | 23 ResourceCycles &ResourceCycles::operator+=(const ResourceCycles &RHS) { argument 24 if (Denominator == RHS.Denominator) 25 Numerator += RHS.Numerator; 27 // Create a common denominator for LHS and RHS by calculating the least 29 unsigned GCD = GreatestCommonDivisor64(Denominator, RHS.Denominator); 30 unsigned LCM = (Denominator * RHS.Denominator) / GCD; 32 unsigned RHSNumerator = RHS.Numerator * (LCM / RHS.Denominator);
|