/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | InstructionSimplify.cpp | 63 static Value *SimplifyICmpInst(unsigned Predicate, Value *LHS, Value *RHS, 126 /// isSameCompare - Is V equivalent to the comparison "LHS Pred RHS"? 128 Value *RHS) { 134 if (CPred == Pred && CLHS == LHS && CRHS == RHS) 136 return CPred == CmpInst::getSwappedPredicate(Pred) && CLHS == RHS && 146 Value *RHS, Value *Cond, 149 Value *SimplifiedCmp = SimplifyCmpInst(Pred, LHS, RHS, Q, MaxRecurse); 153 } else if (!SimplifiedCmp && isSameCompare(Cond, Pred, LHS, RHS)) { 163 Value *RHS, Value *Cond, 166 return simplifyCmpSelCase(Pred, LHS, RHS, Con 127 isSameCompare(Value *V, CmpInst::Predicate Pred, Value *LHS, Value *RHS) argument 145 simplifyCmpSelCase(CmpInst::Predicate Pred, Value *LHS, Value *RHS, Value *Cond, const SimplifyQuery &Q, unsigned MaxRecurse, Constant *TrueOrFalse) argument 162 simplifyCmpSelTrueCase(CmpInst::Predicate Pred, Value *LHS, Value *RHS, Value *Cond, const SimplifyQuery &Q, unsigned MaxRecurse) argument 171 simplifyCmpSelFalseCase(CmpInst::Predicate Pred, Value *LHS, Value *RHS, Value *Cond, const SimplifyQuery &Q, unsigned MaxRecurse) argument 236 ExpandBinOp(Instruction::BinaryOps Opcode, Value *LHS, Value *RHS, Instruction::BinaryOps OpcodeToExpand, const SimplifyQuery &Q, unsigned MaxRecurse) argument 294 SimplifyAssociativeBinOp(Instruction::BinaryOps Opcode, Value *LHS, Value *RHS, const SimplifyQuery &Q, unsigned MaxRecurse) argument 394 ThreadBinOpOverSelect(Instruction::BinaryOps Opcode, Value *LHS, Value *RHS, const SimplifyQuery &Q, unsigned MaxRecurse) argument 472 ThreadCmpOverSelect(CmpInst::Predicate Pred, Value *LHS, Value *RHS, const SimplifyQuery &Q, unsigned MaxRecurse) argument 518 ThreadBinOpOverPHI(Instruction::BinaryOps Opcode, Value *LHS, Value *RHS, const SimplifyQuery &Q, unsigned MaxRecurse) argument 561 ThreadCmpOverPHI(CmpInst::Predicate Pred, Value *LHS, Value *RHS, const SimplifyQuery &Q, unsigned MaxRecurse) argument 718 computePointerDifference(const DataLayout &DL, Value *LHS, Value *RHS) argument 989 isICmpTrue(ICmpInst::Predicate Pred, Value *LHS, Value *RHS, const SimplifyQuery &Q, unsigned MaxRecurse) argument 1797 simplifyAndOrOfFCmps(const TargetLibraryInfo *TLI, FCmpInst *LHS, FCmpInst *RHS, bool IsAnd) argument 2295 ExtractEquivalentCondition(Value *V, CmpInst::Predicate Pred, Value *LHS, Value *RHS) argument 2341 computePointerICmp(const DataLayout &DL, const TargetLibraryInfo *TLI, const DominatorTree *DT, CmpInst::Predicate Pred, AssumptionCache *AC, const Instruction *CxtI, const InstrInfoQuery &IIQ, Value *LHS, Value *RHS) argument 2528 simplifyICmpOfBools(CmpInst::Predicate Pred, Value *LHS, Value *RHS, const SimplifyQuery &Q) argument 2602 simplifyICmpWithZero(CmpInst::Predicate Pred, Value *LHS, Value *RHS, const SimplifyQuery &Q) argument 2664 simplifyICmpWithConstant(CmpInst::Predicate Pred, Value *LHS, Value *RHS, const InstrInfoQuery &IIQ) argument 2705 simplifyICmpWithBinOp(CmpInst::Predicate Pred, Value *LHS, Value *RHS, const SimplifyQuery &Q, unsigned MaxRecurse) argument 3019 simplifyICmpWithMinMax(CmpInst::Predicate Pred, Value *LHS, Value *RHS, const SimplifyQuery &Q, unsigned MaxRecurse) argument 3223 SimplifyICmpInst(unsigned Predicate, Value *LHS, Value *RHS, const SimplifyQuery &Q, unsigned MaxRecurse) argument 3510 SimplifyICmpInst(unsigned Predicate, Value *LHS, Value *RHS, const SimplifyQuery &Q) argument 3517 SimplifyFCmpInst(unsigned Predicate, Value *LHS, Value *RHS, FastMathFlags FMF, const SimplifyQuery &Q, unsigned MaxRecurse) argument 3699 SimplifyFCmpInst(unsigned Predicate, Value *LHS, Value *RHS, FastMathFlags FMF, const SimplifyQuery &Q) argument 4846 SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS, const SimplifyQuery &Q, unsigned MaxRecurse) argument 4893 SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS, const FastMathFlags &FMF, const SimplifyQuery &Q, unsigned MaxRecurse) argument 4910 SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS, const SimplifyQuery &Q) argument 4915 SimplifyBinOp(unsigned Opcode, Value *LHS, Value *RHS, FastMathFlags FMF, const SimplifyQuery &Q) argument 4921 SimplifyCmpInst(unsigned Predicate, Value *LHS, Value *RHS, const SimplifyQuery &Q, unsigned MaxRecurse) argument 4928 SimplifyCmpInst(unsigned Predicate, Value *LHS, Value *RHS, const SimplifyQuery &Q) argument [all...] |
H A D | CFLAndersAliasAnalysis.cpp | 95 CFLAndersAAResult::CFLAndersAAResult(CFLAndersAAResult &&RHS) argument 96 : AAResultBase(std::move(RHS)), GetTLI(std::move(RHS.GetTLI)) {} 141 bool operator==(OffsetValue LHS, OffsetValue RHS) { argument 142 return LHS.Val == RHS.Val && LHS.Offset == RHS.Offset; 144 bool operator<(OffsetValue LHS, OffsetValue RHS) { argument 145 return std::less<const Value *>()(LHS.Val, RHS.Val) || 146 (LHS.Val == RHS.Val && LHS.Offset < RHS 155 operator ==(OffsetInstantiatedValue LHS, OffsetInstantiatedValue RHS) argument 210 insert(InstantiatedValue LHS, InstantiatedValue RHS) argument 291 isEqual(const OffsetValue &LHS, const OffsetValue &RHS) argument 315 isEqual(const OffsetInstantiatedValue &LHS, const OffsetInstantiatedValue &RHS) argument 520 mayAlias( const Value *LHS, LocationSize MaybeLHSSize, const Value *RHS, LocationSize MaybeRHSSize) const argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | ValueTracking.h | 76 /// Return true if LHS and RHS have no common bits set. 77 bool haveNoCommonBitsSet(const Value *LHS, const Value *RHS, 459 const Value *RHS, 465 OverflowResult computeOverflowForSignedMul(const Value *LHS, const Value *RHS, 472 const Value *RHS, 478 OverflowResult computeOverflowForSignedAdd(const Value *LHS, const Value *RHS, 489 OverflowResult computeOverflowForUnsignedSub(const Value *LHS, const Value *RHS, 494 OverflowResult computeOverflowForSignedSub(const Value *LHS, const Value *RHS, 615 /// For ABS/NABS, LHS will be set to the input to the abs idiom. RHS will be 621 /// type of LHS and RHS int 635 matchSelectPattern(const Value *V, const Value *&LHS, const Value *&RHS) argument [all...] |
H A D | OptimizationRemarkEmitter.h | 58 OptimizationRemarkEmitter &operator=(OptimizationRemarkEmitter &&RHS) { argument 59 F = RHS.F; 60 BFI = RHS.BFI;
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Sema/ |
H A D | SemaExpr.cpp | 535 const Expr* RHS) { 555 if (RHS) { 561 SourceLocation RHSLocEnd = S.getLocForEndOfToken(RHS->getEndLoc()); 1009 ExprResult &RHS, QualType LHSType, 1013 if (!handleIntegerToComplexFloatConversion(S, RHS, LHS, RHSType, LHSType, 1016 if (!handleIntegerToComplexFloatConversion(S, LHS, RHS, LHSType, RHSType, 1053 // Promote the precision of the RHS. 1055 RHS = S.ImpCastExprToType(RHS.get(), ResultType, CK_FloatingComplexCast); 1057 RHS 533 DiagnoseDirectIsaAccess(Sema &S, const ObjCIvarRefExpr *OIRE, SourceLocation AssignLoc, const Expr* RHS) argument 1008 handleComplexFloatConversion(Sema &S, ExprResult &LHS, ExprResult &RHS, QualType LHSType, QualType RHSType, bool IsCompAssign) argument 1095 handleFloatConversion(Sema &S, ExprResult &LHS, ExprResult &RHS, QualType LHSType, QualType RHSType, bool IsCompAssign) argument 1190 handleIntegerConversion(Sema &S, ExprResult &LHS, ExprResult &RHS, QualType LHSType, QualType RHSType, bool IsCompAssign) argument 1240 handleComplexIntConversion(Sema &S, ExprResult &LHS, ExprResult &RHS, QualType LHSType, QualType RHSType, bool IsCompAssign) argument 1372 checkEnumArithmeticConversions(Sema &S, Expr *LHS, Expr *RHS, SourceLocation Loc, Sema::ArithConvKind ACK) argument 1430 UsualArithmeticConversions(ExprResult &LHS, ExprResult &RHS, SourceLocation Loc, ArithConvKind ACK) argument 7012 checkConditionalVoidType(Sema &S, ExprResult &LHS, ExprResult &RHS) argument 7043 checkConditionalPointerCompatibility(Sema &S, ExprResult &LHS, ExprResult &RHS, SourceLocation Loc) argument 7172 checkConditionalBlockPointerCompatibility(Sema &S, ExprResult &LHS, ExprResult &RHS, SourceLocation Loc) argument 7198 checkConditionalObjectPointersCompatibility(Sema &S, ExprResult &LHS, ExprResult &RHS, SourceLocation Loc) argument 7267 OpenCLArithmeticConversions(Sema &S, ExprResult &LHS, ExprResult &RHS, SourceLocation QuestionLoc) argument 7322 OpenCLConvertScalarsToVectors(Sema &S, ExprResult &LHS, ExprResult &RHS, QualType CondTy, SourceLocation QuestionLoc) argument 7404 OpenCLCheckVectorConditional(Sema &S, ExprResult &Cond, ExprResult &LHS, ExprResult &RHS, SourceLocation QuestionLoc) argument 7450 CheckConditionalOperands(ExprResult &Cond, ExprResult &LHS, ExprResult &RHS, ExprValueKind &VK, ExprObjectKind &OK, SourceLocation QuestionLoc) argument 7587 FindCompositeObjCPointerType(ExprResult &LHS, ExprResult &RHS, SourceLocation QuestionLoc) argument 7990 ExprResult Cond = CondExpr, LHS = LHSExpr, RHS = RHSExpr; local 8283 CheckAssignmentConstraints(QualType LHSType, ExprResult &RHS, CastKind &Kind, bool ConvertRHS) argument 8614 CheckTransparentUnionArgumentConstraints(QualType ArgType, ExprResult &RHS) argument 8678 ExprResult &RHS = ConvertRHS ? CallerRHS : LocalRHS; local 8838 InvalidOperands(SourceLocation Loc, ExprResult &LHS, ExprResult &RHS) argument 8865 InvalidLogicalVectorOperands(SourceLocation Loc, ExprResult &LHS, ExprResult &RHS) argument 9130 CheckVectorOperands(ExprResult &LHS, ExprResult &RHS, SourceLocation Loc, bool IsCompAssign, bool AllowBothBool, bool AllowBoolConversions) argument 9301 checkArithmeticNull(Sema &S, ExprResult &LHS, ExprResult &RHS, SourceLocation Loc, bool IsCompare) argument 9337 DiagnoseDivisionSizeofPointerOrArray(Sema &S, Expr *LHS, Expr *RHS, SourceLocation Loc) argument 9385 DiagnoseBadDivideOrRemainderValues(Sema& S, ExprResult &LHS, ExprResult &RHS, SourceLocation Loc, bool IsDiv) argument 9398 CheckMultiplyDivideOperands(ExprResult &LHS, ExprResult &RHS, SourceLocation Loc, bool IsCompAssign, bool IsDiv) argument 9424 CheckRemainderOperands( ExprResult &LHS, ExprResult &RHS, SourceLocation Loc, bool IsCompAssign) argument 9484 diagnoseArithmeticOnTwoFunctionPointers(Sema &S, SourceLocation Loc, Expr *LHS, Expr *RHS) argument 9713 CheckAdditionOperands(ExprResult &LHS, ExprResult &RHS, SourceLocation Loc, BinaryOperatorKind Opc, QualType* CompLHSTy) argument 9808 CheckSubtractionOperands(ExprResult &LHS, ExprResult &RHS, SourceLocation Loc, QualType* CompLHSTy) argument 9925 DiagnoseBadShiftValues(Sema& S, ExprResult &LHS, ExprResult &RHS, SourceLocation Loc, BinaryOperatorKind Opc, QualType LHSType) argument 10011 checkVectorShift(Sema &S, ExprResult &LHS, ExprResult &RHS, SourceLocation Loc, bool IsCompAssign) argument 10097 CheckShiftOperands(ExprResult &LHS, ExprResult &RHS, SourceLocation Loc, BinaryOperatorKind Opc, bool IsCompAssign) argument 10156 diagnoseDistinctPointerComparison(Sema &S, SourceLocation Loc, ExprResult &LHS, ExprResult &RHS, bool IsError) argument 10167 convertPointersToCompositeType(Sema &S, SourceLocation Loc, ExprResult &LHS, ExprResult &RHS) argument 10196 diagnoseFunctionPointerToVoidComparison(Sema &S, SourceLocation Loc, ExprResult &LHS, ExprResult &RHS, bool IsError) argument 10219 hasIsEqualMethod(Sema &S, const Expr *LHS, const Expr *RHS) argument 10307 diagnoseObjCLiteralComparison(Sema &S, SourceLocation Loc, ExprResult &LHS, ExprResult &RHS, BinaryOperator::Opcode Opc) argument 10357 diagnoseLogicalNotOnLHSofCheck(Sema &S, ExprResult &LHS, ExprResult &RHS, SourceLocation Loc, BinaryOperatorKind Opc) argument 10413 diagnoseTautologicalComparison(Sema &S, SourceLocation Loc, Expr *LHS, Expr *RHS, BinaryOperatorKind Opc) argument 10620 checkArithmeticOrEnumeralThreeWayCompare(Sema &S, ExprResult &LHS, ExprResult &RHS, SourceLocation Loc) argument 10702 checkArithmeticOrEnumeralCompare(Sema &S, ExprResult &LHS, ExprResult &RHS, SourceLocation Loc, BinaryOperatorKind Opc) argument 10756 CheckCompareOperands(ExprResult &LHS, ExprResult &RHS, SourceLocation Loc, BinaryOperatorKind Opc) argument 11238 CheckVectorCompareOperands(ExprResult &LHS, ExprResult &RHS, SourceLocation Loc, BinaryOperatorKind Opc) argument 11392 CheckVectorLogicalOperands(ExprResult &LHS, ExprResult &RHS, SourceLocation Loc) argument 11414 CheckBitwiseOperands(ExprResult &LHS, ExprResult &RHS, SourceLocation Loc, BinaryOperatorKind Opc) argument 11456 CheckLogicalOperands(ExprResult &LHS, ExprResult &RHS, SourceLocation Loc, BinaryOperatorKind Opc) argument 11993 CheckAssignmentOperands(Expr *LHSExpr, ExprResult &RHS, SourceLocation Loc, QualType CompoundType) argument 12196 CheckCommaOperands(Sema &S, ExprResult &LHS, ExprResult &RHS, SourceLocation Loc) argument 12805 const Expr *RHS = R.get(); local 12854 convertHalfVecBinOp(Sema &S, ExprResult LHS, ExprResult RHS, BinaryOperatorKind Opc, QualType ResultTy, ExprValueKind VK, ExprObjectKind OK, bool IsCompAssign, SourceLocation OpLoc, FPOptions FPFeatures) argument 12889 ExprResult LHS = LHSExpr, RHS = RHSExpr; local 12939 ExprResult LHS = LHSExpr, RHS = RHSExpr; local 13419 BuildOverloadedBinOp(Sema &S, Scope *Sc, SourceLocation OpLoc, BinaryOperatorKind Opc, Expr *LHS, Expr *RHS) argument 13463 ExprResult LHS, RHS; local 16559 Expr *RHS = ASE->getBase() == ASE->getRHS() ? Base.get() : ASE->getRHS(); local 16602 Expr *RHS = BO->getRHS(); local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/X86/ |
H A D | ImmutableGraph.h | 140 NodeSet &operator|=(const NodeSet &RHS) { argument 141 assert(&this->G == &RHS.G); 142 V |= RHS.V; 146 NodeSet &operator&=(const NodeSet &RHS) { argument 147 assert(&this->G == &RHS.G); 148 V &= RHS.V; 152 NodeSet &operator^=(const NodeSet &RHS) { argument 153 assert(&this->G == &RHS.G); 154 V ^= RHS.V; 228 EdgeSet &operator|=(const EdgeSet &RHS) { argument 234 operator &=(const EdgeSet &RHS) argument 240 operator ^=(const EdgeSet &RHS) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Basic/ |
H A D | FileManager.h | 113 bool operator<(const FileEntry &RHS) const { return UniqueID < RHS.UniqueID; } 152 friend bool operator==(const FileEntryRef &LHS, const FileEntryRef &RHS) { argument 153 return LHS.Entry == RHS.Entry && LHS.Name == RHS.Name; 155 friend bool operator!=(const FileEntryRef &LHS, const FileEntryRef &RHS) { argument 156 return !(LHS == RHS);
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/AST/ |
H A D | ItaniumCXXABI.cpp | 88 Optional<bool> areDenseMapKeysEqualSpecialValues(T LHS, T RHS) { argument 90 bool RHSEmpty = isDenseMapKeyEmpty(RHS); 95 bool RHSTombstone = isDenseMapKeyTombstone(RHS); 115 static bool isEqual(DecompositionDeclName LHS, DecompositionDeclName RHS) { argument 117 LHS.Bindings, RHS.Bindings)) 120 return LHS.Bindings.size() == RHS.Bindings.size() && 121 std::equal(LHS.begin(), LHS.end(), RHS.begin());
|
H A D | DeclarationName.cpp | 45 int DeclarationName::compare(DeclarationName LHS, DeclarationName RHS) { argument 46 if (LHS.getNameKind() != RHS.getNameKind()) 47 return (LHS.getNameKind() < RHS.getNameKind() ? -1 : 1); 52 IdentifierInfo *RII = RHS.castAsIdentifierInfo(); 65 Selector RHSSelector = RHS.getObjCSelector(); 68 RHS.getNameKind() == DeclarationName::ObjCZeroArgSelector) { 91 if (QualTypeOrdering()(LHS.getCXXNameType(), RHS.getCXXNameType())) 93 if (QualTypeOrdering()(RHS.getCXXNameType(), LHS.getCXXNameType())) 101 RHS.getCXXDeductionGuideTemplate()->getDeclName()); 105 RHS [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Demangle/ |
H A D | StringView.h | 119 inline bool operator==(const StringView &LHS, const StringView &RHS) { argument 120 return LHS.size() == RHS.size() && 121 std::equal(LHS.begin(), LHS.end(), RHS.begin());
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | Use.h | 61 void swap(Use &RHS); 117 inline Value *operator=(Value *RHS); 118 inline const Use &operator=(const Use &RHS);
|
H A D | ValueMap.h | 317 static bool isEqual(const VH &LHS, const VH &RHS) { argument 318 return LHS == RHS; 321 static bool isEqual(const KeyT &LHS, const VH &RHS) { argument 322 return LHS == RHS.getValPtr(); 362 bool operator==(const ValueMapIterator &RHS) const { 363 return I == RHS.I; 365 bool operator!=(const ValueMapIterator &RHS) const { 366 return I != RHS.I; 414 bool operator==(const ValueMapConstIterator &RHS) const { 415 return I == RHS [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/ |
H A D | CFGUpdate.h | 40 bool operator==(const Update &RHS) const { 41 return From == RHS.From && ToAndKind == RHS.ToAndKind;
|
H A D | MD5.h | 104 inline bool operator==(const MD5::MD5Result &LHS, const MD5::MD5Result &RHS) { argument 105 return LHS.Bytes == RHS.Bytes;
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | MachinePipeliner.h | 365 int compareRecMII(NodeSet &RHS) { return RecMII - RHS.RecMII; } argument 397 bool operator>(const NodeSet &RHS) const { 398 if (RecMII == RHS.RecMII) { 399 if (Colocate != 0 && RHS.Colocate != 0 && Colocate != RHS.Colocate) 400 return Colocate < RHS.Colocate; 401 if (MaxMOV == RHS.MaxMOV) 402 return MaxDepth > RHS.MaxDepth; 403 return MaxMOV < RHS [all...] |
H A D | Register.h | 149 static bool isEqual(const Register &LHS, const Register &RHS) { argument 150 return DenseMapInfo<unsigned>::isEqual(LHS.id(), RHS.id());
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/ |
H A D | StringRef.cpp | 27 static int ascii_strncasecmp(const char *LHS, const char *RHS, size_t Length) { argument 30 unsigned char RHC = toLower(RHS[I]); 38 int StringRef::compare_lower(StringRef RHS) const { 39 if (int Res = ascii_strncasecmp(Data, RHS.Data, std::min(Length, RHS.Length))) 41 if (Length == RHS.Length) 43 return Length < RHS.Length ? -1 : 1; 64 int StringRef::compare_numeric(StringRef RHS) const { 65 for (size_t I = 0, E = std::min(Length, RHS.Length); I != E; ++I) { 67 if (isDigit(Data[I]) && isDigit(RHS [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/lib/Tooling/Core/ |
H A D | Replacement.cpp | 98 bool operator<(const Replacement &LHS, const Replacement &RHS) { argument 99 if (LHS.getOffset() != RHS.getOffset()) 100 return LHS.getOffset() < RHS.getOffset(); 102 if (LHS.getLength() != RHS.getLength()) 103 return LHS.getLength() < RHS.getLength(); 105 if (LHS.getFilePath() != RHS.getFilePath()) 106 return LHS.getFilePath() < RHS.getFilePath(); 107 return LHS.getReplacementText() < RHS.getReplacementText(); 110 bool operator==(const Replacement &LHS, const Replacement &RHS) { argument 111 return LHS.getOffset() == RHS [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | DenseMap.h | 650 /// is also in RHS, and that no additional pairs are in RHS. 651 /// Equivalent to N calls to RHS.find and N value comparisons. Amortized 657 const DenseMapBase<DerivedT, KeyT, ValueT, KeyInfoT, BucketT> &RHS) { 658 if (LHS.size() != RHS.size()) 662 auto I = RHS.find(KV.first); 663 if (I == RHS.end() || I->second != KV.second) 672 /// Equivalent to !(LHS == RHS). See operator== for performance notes. 677 const DenseMapBase<DerivedT, KeyT, ValueT, KeyInfoT, BucketT> &RHS) { 678 return !(LHS == RHS); 655 operator ==( const DenseMapBase<DerivedT, KeyT, ValueT, KeyInfoT, BucketT> &LHS, const DenseMapBase<DerivedT, KeyT, ValueT, KeyInfoT, BucketT> &RHS) argument 675 operator !=( const DenseMapBase<DerivedT, KeyT, ValueT, KeyInfoT, BucketT> &LHS, const DenseMapBase<DerivedT, KeyT, ValueT, KeyInfoT, BucketT> &RHS) argument 728 swap(DenseMap& RHS) argument 902 swap(SmallDenseMap& RHS) argument [all...] |
H A D | BreadthFirstIterator.h | 119 bool operator==(const bf_iterator &RHS) const { 120 return VisitQueue == RHS.VisitQueue; 123 bool operator!=(const bf_iterator &RHS) const { return !(*this == RHS); }
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | LatencyPriorityQueue.cpp | 23 bool latency_sort::operator()(const SUnit *LHS, const SUnit *RHS) const { 27 if (LHS->isScheduleHigh && !RHS->isScheduleHigh) 29 if (!LHS->isScheduleHigh && RHS->isScheduleHigh) 33 unsigned RHSNum = RHS->NodeNum;
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/GSYM/ |
H A D | Header.h | 123 bool operator==(const Header &LHS, const Header &RHS);
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/AST/ |
H A D | RawCommentList.h | 184 bool operator()(const RawComment &LHS, const RawComment &RHS) { argument 185 return SM.isBeforeInTranslationUnit(LHS.getBeginLoc(), RHS.getBeginLoc()); 188 bool operator()(const RawComment *LHS, const RawComment *RHS) { argument 189 return operator()(*LHS, *RHS);
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ProfileData/Coverage/ |
H A D | CoverageMapping.h | 116 friend bool operator==(const Counter &LHS, const Counter &RHS) { argument 117 return LHS.Kind == RHS.Kind && LHS.ID == RHS.ID; 120 friend bool operator!=(const Counter &LHS, const Counter &RHS) { argument 121 return !(LHS == RHS); 124 friend bool operator<(const Counter &LHS, const Counter &RHS) { argument 125 return std::tie(LHS.Kind, LHS.ID) < std::tie(RHS.Kind, RHS.ID); 148 Counter LHS, RHS; member in struct:llvm::coverage::CounterExpression 150 CounterExpression(ExprKind Kind, Counter LHS, Counter RHS) argument 824 isEqual(const coverage::CounterExpression &LHS, const coverage::CounterExpression &RHS) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Analysis/Analyses/ |
H A D | ThreadSafetyUtil.h | 100 SimpleArray &operator=(SimpleArray &&RHS) { argument 101 if (this != &RHS) { 102 Data = RHS.Data; 103 Size = RHS.Size; 104 Capacity = RHS.Capacity; 106 RHS.Data = nullptr; 107 RHS.Size = RHS.Capacity = 0;
|