/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Object/ |
H A D | WasmTraits.h | 44 const wasm::WasmSignature &RHS) { 45 return LHS == RHS; 61 const wasm::WasmGlobalType &RHS) { 62 return LHS == RHS; 43 isEqual(const wasm::WasmSignature &LHS, const wasm::WasmSignature &RHS) argument 60 isEqual(const wasm::WasmGlobalType &LHS, const wasm::WasmGlobalType &RHS) argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/ |
H A D | DIContext.h | 47 bool operator==(const DILineInfo &RHS) const { 48 return Line == RHS.Line && Column == RHS.Column && 49 FileName == RHS.FileName && FunctionName == RHS.FunctionName && 50 StartLine == RHS.StartLine && Discriminator == RHS.Discriminator; 53 bool operator!=(const DILineInfo &RHS) const { 54 return !(*this == RHS); 57 bool operator<(const DILineInfo &RHS) cons [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-dwp/ |
H A D | DWPStringPool.h | 24 static bool isEqual(const char *LHS, const char *RHS) { argument 25 if (RHS == getEmptyKey()) 27 if (RHS == getTombstoneKey()) 29 return strcmp(LHS, RHS) == 0;
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/AST/Interp/ |
H A D | Source.h | 34 int32_t operator-(const CodePtr &RHS) const { 35 assert(Ptr != nullptr && RHS.Ptr != nullptr && "Invalid code pointer"); 36 return Ptr - RHS.Ptr; 39 CodePtr operator-(size_t RHS) const { 41 return CodePtr(Ptr - RHS); 44 bool operator!=(const CodePtr &RHS) const { return Ptr != RHS.Ptr; }
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/DWARFLinker/ |
H A D | DWARFLinkerDeclContext.h | 156 static bool isEqual(const DeclContext *LHS, const DeclContext *RHS) { argument 157 if (RHS == getEmptyKey() || RHS == getTombstoneKey()) 158 return RHS == LHS; 159 return LHS->QualifiedNameHash == RHS->QualifiedNameHash && 160 LHS->Line == RHS->Line && LHS->ByteSize == RHS->ByteSize && 161 LHS->Name.data() == RHS->Name.data() && 162 LHS->File.data() == RHS->File.data() && 163 LHS->Parent.QualifiedNameHash == RHS [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/GSYM/ |
H A D | Header.cpp | 101 bool llvm::gsym::operator==(const Header &LHS, const Header &RHS) { argument 102 return LHS.Magic == RHS.Magic && LHS.Version == RHS.Version && 103 LHS.AddrOffSize == RHS.AddrOffSize && LHS.UUIDSize == RHS.UUIDSize && 104 LHS.BaseAddress == RHS.BaseAddress && 105 LHS.NumAddresses == RHS.NumAddresses && 106 LHS.StrtabOffset == RHS.StrtabOffset && 107 LHS.StrtabSize == RHS.StrtabSize && 108 memcmp(LHS.UUID, RHS [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | LoopAnalysisManager.h | 97 Result &operator=(Result &&RHS) { argument 98 InnerAM = RHS.InnerAM; 99 LI = RHS.LI; 100 MSSAUsed = RHS.MSSAUsed; 104 RHS.InnerAM = nullptr;
|
H A D | CmpInstAnalysis.h | 64 bool decomposeBitTestICmp(Value *LHS, Value *RHS, CmpInst::Predicate &Pred,
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Tooling/Core/ |
H A D | Replacement.h | 57 /// Whether this range overlaps with \p RHS or not. 58 bool overlapsWith(Range RHS) const { 59 return Offset + Length > RHS.Offset && Offset < RHS.Offset + RHS.Length; 62 /// Whether this range contains \p RHS or not. 63 bool contains(Range RHS) const { 64 return RHS.Offset >= Offset && 65 (RHS.Offset + RHS [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineInternal.h | 119 inline bool isSignBitCheck(ICmpInst::Predicate Pred, const APInt &RHS, argument 124 return RHS.isNullValue(); 127 return RHS.isAllOnesValue(); 130 return RHS.isAllOnesValue(); 133 return RHS.isNullValue(); 135 // True if LHS u> RHS and RHS == sign-bit-mask - 1 137 return RHS.isMaxSignedValue(); 139 // True if LHS u>= RHS and RHS 536 willNotOverflowSignedAdd(const Value *LHS, const Value *RHS, const Instruction &CxtI) const argument 542 willNotOverflowUnsignedAdd(const Value *LHS, const Value *RHS, const Instruction &CxtI) const argument 548 willNotOverflowAdd(const Value *LHS, const Value *RHS, const Instruction &CxtI, bool IsSigned) const argument 554 willNotOverflowSignedSub(const Value *LHS, const Value *RHS, const Instruction &CxtI) const argument 560 willNotOverflowUnsignedSub(const Value *LHS, const Value *RHS, const Instruction &CxtI) const argument 566 willNotOverflowSub(const Value *LHS, const Value *RHS, const Instruction &CxtI, bool IsSigned) const argument 572 willNotOverflowSignedMul(const Value *LHS, const Value *RHS, const Instruction &CxtI) const argument 578 willNotOverflowUnsignedMul(const Value *LHS, const Value *RHS, const Instruction &CxtI) const argument 584 willNotOverflowMul(const Value *LHS, const Value *RHS, const Instruction &CxtI, bool IsSigned) const argument 590 willNotOverflow(BinaryOperator::BinaryOps Opcode, const Value *LHS, const Value *RHS, const Instruction &CxtI, bool IsSigned) const argument 754 computeOverflowForUnsignedMul(const Value *LHS, const Value *RHS, const Instruction *CxtI) const argument 760 computeOverflowForSignedMul(const Value *LHS, const Value *RHS, const Instruction *CxtI) const argument 766 computeOverflowForUnsignedAdd(const Value *LHS, const Value *RHS, const Instruction *CxtI) const argument 772 computeOverflowForSignedAdd(const Value *LHS, const Value *RHS, const Instruction *CxtI) const argument 778 computeOverflowForUnsignedSub(const Value *LHS, const Value *RHS, const Instruction *CxtI) const argument 784 computeOverflowForSignedSub(const Value *LHS, const Value *RHS, const Instruction *CxtI) const argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Option/ |
H A D | ArgList.h | 102 friend bool operator==(arg_iterator LHS, arg_iterator RHS) { argument 103 return LHS.Current == RHS.Current; 105 friend bool operator!=(arg_iterator LHS, arg_iterator RHS) { argument 106 return !(LHS == RHS); 155 ArgList(ArgList &&RHS) argument 156 : Args(std::move(RHS.Args)), OptRanges(std::move(RHS.OptRanges)) { 157 RHS.Args.clear(); 158 RHS.OptRanges.clear(); 161 ArgList &operator=(ArgList &&RHS) { argument 395 InputArgList(InputArgList &&RHS) argument 400 operator =(InputArgList &&RHS) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
H A D | EquivalenceClasses.h | 98 ECValue(const ECValue &RHS) : Leader(this), Next((ECValue*)(intptr_t)1), argument 99 Data(RHS.Data) { 101 assert(RHS.isLeader() && RHS.getNext() == nullptr && "Not a singleton!"); 123 EquivalenceClasses(const EquivalenceClasses &RHS) { argument 124 operator=(RHS); 127 const EquivalenceClasses &operator=(const EquivalenceClasses &RHS) { argument 129 for (iterator I = RHS.begin(), E = RHS.end(); I != E; ++I) 131 member_iterator MI = RHS [all...] |
H A D | PointerIntPair.h | 110 bool operator==(const PointerIntPair &RHS) const { 111 return Value == RHS.Value; 114 bool operator!=(const PointerIntPair &RHS) const { 115 return Value != RHS.Value; 118 bool operator<(const PointerIntPair &RHS) const { return Value < RHS.Value; } 119 bool operator>(const PointerIntPair &RHS) const { return Value > RHS.Value; } 121 bool operator<=(const PointerIntPair &RHS) const { 122 return Value <= RHS [all...] |
H A D | SmallPtrSet.h | 207 void swap(SmallPtrSetImplBase &RHS); 209 void CopyFrom(const SmallPtrSetImplBase &RHS); 210 void MoveFrom(unsigned SmallSize, SmallPtrSetImplBase &&RHS); 214 void MoveHelper(unsigned SmallSize, SmallPtrSetImplBase &&RHS); 216 void CopyHelper(const SmallPtrSetImplBase &RHS); 236 bool operator==(const SmallPtrSetIteratorImpl &RHS) const { 237 return Bucket == RHS.Bucket; 239 bool operator!=(const SmallPtrSetIteratorImpl &RHS) const { 240 return Bucket != RHS.Bucket; 415 /// RHS, an 473 operator =(const SmallPtrSet<PtrType, SmallSize> &RHS) argument 480 operator =(SmallPtrSet<PtrType, SmallSize> &&RHS) argument 494 swap(SmallPtrSet<PtrType, SmallSize> &RHS) argument 505 swap(llvm::SmallPtrSet<T, N> &LHS, llvm::SmallPtrSet<T, N> &RHS) argument [all...] |
H A D | BitVector.h | 147 BitVector(const BitVector &RHS) : Size(RHS.size()) { argument 153 size_t Capacity = NumBitWords(RHS.size()); 155 std::memcpy(Bits.data(), RHS.Bits.data(), Capacity * sizeof(BitWord)); 158 BitVector(BitVector &&RHS) : Bits(RHS.Bits), Size(RHS.Size) { argument 159 RHS.Bits = MutableArrayRef<BitWord>(); 160 RHS.Size = 0; 523 bool anyCommon(const BitVector &RHS) cons [all...] |
H A D | TinyPtrVector.h | 51 TinyPtrVector(const TinyPtrVector &RHS) : Val(RHS.Val) { argument 56 TinyPtrVector &operator=(const TinyPtrVector &RHS) { argument 57 if (this == &RHS) 59 if (RHS.empty()) { 67 if (RHS.size() == 1) 68 Val = RHS.front(); 70 Val = new VecTy(*RHS.Val.template get<VecTy*>()); 75 if (RHS.Val.template is<EltTy>()) { 77 Val.template get<VecTy*>()->push_back(RHS 84 TinyPtrVector(TinyPtrVector &&RHS) argument 88 operator =(TinyPtrVector &&RHS) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | LoopUnrollAnalyzer.cpp | 69 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1); local 73 if (!isa<Constant>(RHS)) 74 if (Constant *SimpleRHS = SimplifiedValues.lookup(RHS)) 75 RHS = SimpleRHS; 81 SimplifyBinOp(I.getOpcode(), LHS, RHS, FI->getFastMathFlags(), DL); 83 SimpleV = SimplifyBinOp(I.getOpcode(), LHS, RHS, DL); 167 Value *LHS = I.getOperand(0), *RHS = I.getOperand(1); local 173 if (!isa<Constant>(RHS)) 174 if (Constant *SimpleRHS = SimplifiedValues.lookup(RHS)) 175 RHS [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/TextAPI/ELF/ |
H A D | ELFStub.h | 45 bool operator<(const ELFSymbol &RHS) const { 46 return Name < RHS.Name;
|
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Rewrite/Core/ |
H A D | RewriteRope.h | 106 bool operator==(const RopePieceBTreeIterator &RHS) const { 107 return CurPiece == RHS.CurPiece && CurChar == RHS.CurChar; 109 bool operator!=(const RopePieceBTreeIterator &RHS) const { 110 return !operator==(RHS); 141 RopePieceBTree(const RopePieceBTree &RHS); 177 RewriteRope(const RewriteRope &RHS) : Chunks(RHS.Chunks) {} argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/Orc/ |
H A D | SymbolStringPool.h | 91 const SymbolStringPtr &RHS) { 92 return LHS.S == RHS.S; 96 const SymbolStringPtr &RHS) { 97 return !(LHS == RHS); 101 const SymbolStringPtr &RHS) { 102 return LHS.S < RHS.S; 190 const orc::SymbolStringPtr &RHS) { 191 return LHS.S == RHS.S; 90 operator ==(const SymbolStringPtr &LHS, const SymbolStringPtr &RHS) argument 95 operator !=(const SymbolStringPtr &LHS, const SymbolStringPtr &RHS) argument 100 operator <(const SymbolStringPtr &LHS, const SymbolStringPtr &RHS) argument 189 isEqual(const orc::SymbolStringPtr &LHS, const orc::SymbolStringPtr &RHS) argument
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/AST/ |
H A D | APValue.cpp | 82 const APValue::LValueBase &RHS) { 83 if (LHS.Ptr != RHS.Ptr) 87 return LHS.Local.CallIndex == RHS.Local.CallIndex && 88 LHS.Local.Version == RHS.Local.Version; 142 const clang::APValue::LValueBase &RHS) { 143 return LHS == RHS; 236 APValue::APValue(const APValue &RHS) : Kind(None) { argument 237 switch (RHS.getKind()) { 240 Kind = RHS.getKind(); 244 setInt(RHS 81 operator ==(const APValue::LValueBase &LHS, const APValue::LValueBase &RHS) argument 140 isEqual( const clang::APValue::LValueBase &LHS, const clang::APValue::LValueBase &RHS) argument 373 swap(APValue &RHS) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | NaryReassociate.cpp | 346 // sext(LHS + RHS) != sext(LHS) + sext(RHS). 352 Value *LHS = AO->getOperand(0), *RHS = AO->getOperand(1); 353 // IndexToSplit = LHS + RHS. 354 if (auto *NewGEP = tryReassociateGEPAtIndex(GEP, I, LHS, RHS, IndexedType)) 356 // Symmetrically, try IndexToSplit = RHS + LHS. 357 if (LHS != RHS) { 359 tryReassociateGEPAtIndex(GEP, I, RHS, LHS, IndexedType)) 369 Value *RHS, Type *IndexedType) { 401 // NewGEP = (char *)Candidate + RHS * sizeo 367 tryReassociateGEPAtIndex(GetElementPtrInst *GEP, unsigned I, Value *LHS, Value *RHS, Type *IndexedType) argument 438 Value *LHS = I->getOperand(0), *RHS = I->getOperand(1); local 449 tryReassociateBinaryOp(Value *LHS, Value *RHS, BinaryOperator *I) argument 473 tryReassociatedBinaryOp(const SCEV *LHSExpr, Value *RHS, BinaryOperator *I) argument 510 getBinarySCEV(BinaryOperator *I, const SCEV *LHS, const SCEV *RHS) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/ |
H A D | NaryReassociate.h | 132 // Given GEP's I-th index = LHS + RHS, see whether &Base[..][LHS][..] or 133 // &Base[..][RHS][..] can be CSE'ed and rewrite GEP accordingly. 136 Value *RHS, Type *IndexedType); 141 // A helper function for tryReassociateBinaryOp. LHS and RHS are explicitly 143 Instruction *tryReassociateBinaryOp(Value *LHS, Value *RHS, 145 // Rewrites I to (LHS op RHS) if LHS is computed already. 146 Instruction *tryReassociatedBinaryOp(const SCEV *LHS, Value *RHS, 152 // Gets SCEV for (LHS op RHS). 154 const SCEV *RHS);
|
/freebsd-11-stable/contrib/llvm-project/clang/lib/Lex/ |
H A D | PPExpressions.cpp | 562 // If this is a short-circuiting operator, see if the RHS of the operator is 565 // this example, the RHS of the && being dead does not make the rest of the 569 RHSIsLive = false; // RHS of "0 && x" is dead. 571 RHSIsLive = false; // RHS of "1 || x" is dead. 573 RHSIsLive = false; // RHS (x) of "0 ? x : y" is dead. 581 PPValue RHS(LHS.getBitWidth()); 582 // Parse the RHS of the operator. 584 if (EvaluateValue(RHS, PeekTok, DT, RHSIsLive, PP)) return true; 588 // operator immediately to the right of the RHS. 594 diagnoseUnexpectedOperator(PP, RHS, PeekTo [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | PassManagerInternal.h | 67 friend void swap(PassModel &LHS, PassModel &RHS) { argument 69 swap(LHS.Pass, RHS.Pass); 72 PassModel &operator=(PassModel RHS) { argument 73 swap(*this, RHS); 176 friend void swap(AnalysisResultModel &LHS, AnalysisResultModel &RHS) { argument 178 swap(LHS.Result, RHS.Result); 181 AnalysisResultModel &operator=(AnalysisResultModel RHS) { argument 182 swap(*this, RHS); 215 friend void swap(AnalysisResultModel &LHS, AnalysisResultModel &RHS) { argument 217 swap(LHS.Result, RHS 220 operator =(AnalysisResultModel RHS) argument 270 swap(AnalysisPassModel &LHS, AnalysisPassModel &RHS) argument 275 operator =(AnalysisPassModel RHS) argument [all...] |