Searched refs:RHS (Results 101 - 125 of 627) sorted by relevance

1234567891011>>

/freebsd-11-stable/contrib/llvm-project/llvm/lib/DebugInfo/Symbolize/
H A DSymbolizableObjectFile.h82 bool operator<(const SymbolDesc &RHS) const {
83 return Addr != RHS.Addr ? Addr < RHS.Addr : Size < RHS.Size;
/freebsd-11-stable/contrib/llvm-project/clang/lib/StaticAnalyzer/Core/
H A DCheckerHelpers.cpp82 const Expr *RHS = nullptr; local
87 RHS = Assign->getRHS();
95 RHS = VD->getAnyInitializer();
98 return std::make_pair(VD, RHS);
/freebsd-11-stable/contrib/llvm-project/clang/lib/AST/Interp/
H A DIntegral.h83 bool operator<(Integral RHS) const { return V < RHS.V; }
84 bool operator>(Integral RHS) const { return V > RHS.V; }
85 bool operator<=(Integral RHS) const { return V <= RHS.V; }
86 bool operator>=(Integral RHS) const { return V >= RHS.V; }
87 bool operator==(Integral RHS) const { return V == RHS
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/
H A DMachineMemOperand.h302 const MachineMemOperand &RHS) {
303 return LHS.getValue() == RHS.getValue() &&
304 LHS.getPseudoValue() == RHS.getPseudoValue() &&
305 LHS.getSize() == RHS.getSize() &&
306 LHS.getOffset() == RHS.getOffset() &&
307 LHS.getFlags() == RHS.getFlags() &&
308 LHS.getAAInfo() == RHS.getAAInfo() &&
309 LHS.getRanges() == RHS.getRanges() &&
310 LHS.getAlignment() == RHS.getAlignment() &&
311 LHS.getAddrSpace() == RHS
301 operator ==(const MachineMemOperand &LHS, const MachineMemOperand &RHS) argument
314 operator !=(const MachineMemOperand &LHS, const MachineMemOperand &RHS) argument
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/
H A DTimer.h51 void operator+=(const TimeRecord &RHS) { argument
52 WallTime += RHS.WallTime;
53 UserTime += RHS.UserTime;
54 SystemTime += RHS.SystemTime;
55 MemUsed += RHS.MemUsed;
57 void operator-=(const TimeRecord &RHS) { argument
58 WallTime -= RHS.WallTime;
59 UserTime -= RHS.UserTime;
60 SystemTime -= RHS.SystemTime;
61 MemUsed -= RHS
94 Timer(const Timer &RHS) argument
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Remarks/
H A DRemarkLinker.h32 const std::unique_ptr<Remark> &RHS) const {
33 assert(LHS && RHS && "Invalid pointers to compare.");
34 return *LHS < *RHS;
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Support/
H A DAPInt.cpp143 void APInt::AssignSlowCase(const APInt& RHS) { argument
145 if (this == &RHS)
149 reallocate(RHS.getBitWidth());
153 U.VAL = RHS.U.VAL;
155 memcpy(U.pVal, RHS.U.pVal, getNumWords() * APINT_WORD_SIZE);
190 /// Adds the RHS APInt to this APInt.
191 /// @returns this, after addition of RHS.
193 APInt& APInt::operator+=(const APInt& RHS) { argument
194 assert(BitWidth == RHS.BitWidth && "Bit widths must be the same");
196 U.VAL += RHS
202 operator +=(uint64_t RHS) argument
213 operator -=(const APInt& RHS) argument
222 operator -=(uint64_t RHS) argument
243 AndAssignSlowCase(const APInt& RHS) argument
247 OrAssignSlowCase(const APInt& RHS) argument
251 XorAssignSlowCase(const APInt& RHS) argument
255 operator *=(const APInt& RHS) argument
261 operator *=(uint64_t RHS) argument
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/
H A Dsimple_ilist.h255 /// \pre \c this and \p RHS are sorted.
257 void merge(simple_ilist &RHS) { merge(RHS, std::less<T>()); } argument
258 template <class Compare> void merge(simple_ilist &RHS, Compare comp);
270 void simple_ilist<T, Options...>::merge(simple_ilist &RHS, Compare comp) { argument
271 if (this == &RHS || RHS.empty())
274 iterator RI = RHS.begin(), RE = RHS.end();
277 // Transfer a run of at least size 1 from RHS t
303 simple_ilist RHS; local
[all...]
H A DFunctionExtras.h192 unique_function(unique_function &&RHS) noexcept {
194 CallbackAndInlineFlag = RHS.CallbackAndInlineFlag;
196 // If the RHS is empty, just copying the above is sufficient.
197 if (!RHS)
202 StorageUnion.OutOfLineStorage = RHS.StorageUnion.OutOfLineStorage;
205 memcpy(getInlineStorage(), RHS.getInlineStorage(), InlineStorageSize);
209 RHS.getInlineStorage());
213 RHS.CallbackAndInlineFlag = {};
217 memset(RHS.getInlineStorage(), 0xAD, InlineStorageSize);
221 unique_function &operator=(unique_function &&RHS) noexcep
[all...]
H A Dfallible_iterator.h154 /// Returns true if both LHS and RHS are end-of-range values, or if both are
165 const fallible_iterator &RHS) {
168 if (LHS.isEnd() && RHS.isEnd())
171 assert(LHS.isValid() && RHS.isValid() &&
174 bool Equal = LHS.I == RHS.I;
180 (void)!!*RHS.getErrPtr();
192 const fallible_iterator &RHS) {
193 return !(LHS == RHS);
164 operator ==(const fallible_iterator &LHS, const fallible_iterator &RHS) argument
191 operator !=(const fallible_iterator &LHS, const fallible_iterator &RHS) argument
H A DStringMap.h63 StringMapImpl(StringMapImpl &&RHS) argument
64 : TheTable(RHS.TheTable), NumBuckets(RHS.NumBuckets),
65 NumItems(RHS.NumItems), NumTombstones(RHS.NumTombstones),
66 ItemSize(RHS.ItemSize) {
67 RHS.TheTable = nullptr;
68 RHS.NumBuckets = 0;
69 RHS.NumItems = 0;
70 RHS
267 StringMap(StringMap &&RHS) argument
270 StringMap(const StringMap &RHS) argument
305 operator =(StringMap RHS) argument
[all...]
H A DStringRef.h181 bool equals(StringRef RHS) const {
182 return (Length == RHS.Length &&
183 compareMemory(Data, RHS.Data, RHS.Length) == 0);
188 bool equals_lower(StringRef RHS) const {
189 return Length == RHS.Length && compare_lower(RHS) == 0;
193 /// is lexicographically less than, equal to, or greater than the \p RHS.
195 int compare(StringRef RHS) const {
197 if (int Res = compareMemory(Data, RHS
[all...]
H A Dilist_iterator.h92 const ilist_iterator<OptionsT, IsReverse, RHSIsConst> &RHS,
94 : NodePtr(RHS.NodePtr) {}
100 operator=(const ilist_iterator<OptionsT, IsReverse, RHSIsConst> &RHS) { argument
101 NodePtr = RHS.NodePtr;
114 const ilist_iterator<OptionsT, !IsReverse, IsConst> &RHS)
115 : ilist_iterator(++RHS.getReverse()) {}
145 friend bool operator==(const ilist_iterator &LHS, const ilist_iterator &RHS) { argument
146 return LHS.NodePtr == RHS.NodePtr;
148 friend bool operator!=(const ilist_iterator &LHS, const ilist_iterator &RHS) { argument
149 return LHS.NodePtr != RHS
91 ilist_iterator( const ilist_iterator<OptionsT, IsReverse, RHSIsConst> &RHS, typename std::enable_if<IsConst || !RHSIsConst, void *>::type = nullptr) argument
113 ilist_iterator( const ilist_iterator<OptionsT, !IsReverse, IsConst> &RHS) argument
[all...]
H A DSmallSet.h110 bool operator==(const SmallSetIterator &RHS) const {
111 if (isSmall != RHS.isSmall)
114 return VecIter == RHS.VecIter;
115 return SetIter == RHS.SetIter;
254 /// of RHS, and that RHS contains no additional values.
255 /// Equivalent to N calls to RHS.count.
260 bool operator==(const SmallSet<T, LN, C> &LHS, const SmallSet<T, RN, C> &RHS) { argument
261 if (LHS.size() != RHS.size())
264 // All elements in LHS must also be in RHS
272 operator !=(const SmallSet<T, LN, C> &LHS, const SmallSet<T, RN, C> &RHS) argument
[all...]
H A DPackedVector.h131 bool operator==(const PackedVector &RHS) const {
132 return Bits == RHS.Bits;
135 bool operator!=(const PackedVector &RHS) const {
136 return Bits != RHS.Bits;
139 PackedVector &operator|=(const PackedVector &RHS) { argument
140 Bits |= RHS.Bits;
/freebsd-11-stable/contrib/llvm-project/clang/lib/Rewrite/
H A DRewriteRope.cpp306 // move the last 'WidthFactor' values into the RHS child.
405 RopePieceBTreeInterior(RopePieceBTreeNode *LHS, RopePieceBTreeNode *RHS)
408 Children[1] = RHS;
410 Size = LHS->size() + RHS->size();
458 RopePieceBTreeNode *HandleChildPiece(unsigned i, RopePieceBTreeNode *RHS);
492 if (RopePieceBTreeNode *RHS = getChild(i)->split(Offset-ChildOffset))
493 return HandleChildPiece(i, RHS);
522 if (RopePieceBTreeNode *RHS = getChild(i)->insert(Offset-ChildOffs, R))
523 return HandleChildPiece(i, RHS);
531 RopePieceBTreeInterior::HandleChildPiece(unsigned i, RopePieceBTreeNode *RHS) {
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/BinaryFormat/
H A DWasm.h369 inline bool operator==(const WasmSignature &LHS, const WasmSignature &RHS) { argument
370 return LHS.State == RHS.State && LHS.Returns == RHS.Returns &&
371 LHS.Params == RHS.Params;
374 inline bool operator!=(const WasmSignature &LHS, const WasmSignature &RHS) { argument
375 return !(LHS == RHS);
378 inline bool operator==(const WasmGlobalType &LHS, const WasmGlobalType &RHS) { argument
379 return LHS.Type == RHS.Type && LHS.Mutable == RHS.Mutable;
382 inline bool operator!=(const WasmGlobalType &LHS, const WasmGlobalType &RHS) { argument
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyRegColoring.cpp120 llvm::sort(SortedIntervals, [MRI](LiveInterval *LHS, LiveInterval *RHS) {
121 if (MRI->isLiveIn(LHS->reg) != MRI->isLiveIn(RHS->reg))
123 if (LHS->weight != RHS->weight)
124 return LHS->weight > RHS->weight;
125 if (LHS->empty() || RHS->empty())
126 return !LHS->empty() && RHS->empty();
127 return *LHS < *RHS;
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-cov/
H A DSourceCoverageView.h37 ExpansionView(ExpansionView &&RHS) argument
38 : Region(std::move(RHS.Region)), View(std::move(RHS.View)) {}
39 ExpansionView &operator=(ExpansionView &&RHS) { argument
40 Region = std::move(RHS.Region);
41 View = std::move(RHS.View);
49 friend bool operator<(const ExpansionView &LHS, const ExpansionView &RHS) { argument
50 return LHS.Region.startLoc() < RHS.Region.startLoc();
65 const InstantiationView &RHS) {
66 return LHS.Line < RHS
64 operator <(const InstantiationView &LHS, const InstantiationView &RHS) argument
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/
H A DIRBuilder.h809 CallInst *CreateBinaryIntrinsic(Intrinsic::ID ID, Value *LHS, Value *RHS,
822 CallInst *CreateMinNum(Value *LHS, Value *RHS, const Twine &Name = "") { argument
823 return CreateBinaryIntrinsic(Intrinsic::minnum, LHS, RHS, nullptr, Name);
827 CallInst *CreateMaxNum(Value *LHS, Value *RHS, const Twine &Name = "") { argument
828 return CreateBinaryIntrinsic(Intrinsic::maxnum, LHS, RHS, nullptr, Name);
832 CallInst *CreateMinimum(Value *LHS, Value *RHS, const Twine &Name = "") { argument
833 return CreateBinaryIntrinsic(Intrinsic::minimum, LHS, RHS, nullptr, Name);
837 CallInst *CreateMaximum(Value *LHS, Value *RHS, const Twine &Name = "") { argument
838 return CreateBinaryIntrinsic(Intrinsic::maximum, LHS, RHS, nullptr, Name);
1146 Value *LHS, Value *RHS,
1145 CreateInsertNUWNSWBinOp(BinaryOperator::BinaryOps Opc, Value *LHS, Value *RHS, const Twine &Name, bool HasNUW, bool HasNSW) argument
1211 CreateAdd(Value *LHS, Value *RHS, const Twine &Name = �, bool HasNUW = false, bool HasNSW = false) argument
1220 CreateNSWAdd(Value *LHS, Value *RHS, const Twine &Name = �) argument
1224 CreateNUWAdd(Value *LHS, Value *RHS, const Twine &Name = �) argument
1228 CreateSub(Value *LHS, Value *RHS, const Twine &Name = �, bool HasNUW = false, bool HasNSW = false) argument
1237 CreateNSWSub(Value *LHS, Value *RHS, const Twine &Name = �) argument
1241 CreateNUWSub(Value *LHS, Value *RHS, const Twine &Name = �) argument
1245 CreateMul(Value *LHS, Value *RHS, const Twine &Name = �, bool HasNUW = false, bool HasNSW = false) argument
1254 CreateNSWMul(Value *LHS, Value *RHS, const Twine &Name = �) argument
1258 CreateNUWMul(Value *LHS, Value *RHS, const Twine &Name = �) argument
1262 CreateUDiv(Value *LHS, Value *RHS, const Twine &Name = �, bool isExact = false) argument
1272 CreateExactUDiv(Value *LHS, Value *RHS, const Twine &Name = �) argument
1276 CreateSDiv(Value *LHS, Value *RHS, const Twine &Name = �, bool isExact = false) argument
1286 CreateExactSDiv(Value *LHS, Value *RHS, const Twine &Name = �) argument
1290 CreateURem(Value *LHS, Value *RHS, const Twine &Name = �) argument
1295 CreateSRem(Value *LHS, Value *RHS, const Twine &Name = �) argument
1300 CreateShl(Value *LHS, Value *RHS, const Twine &Name = �, bool HasNUW = false, bool HasNSW = false) argument
1309 CreateShl(Value *LHS, const APInt &RHS, const Twine &Name = �, bool HasNUW = false, bool HasNSW = false) argument
1315 CreateShl(Value *LHS, uint64_t RHS, const Twine &Name = �, bool HasNUW = false, bool HasNSW = false) argument
1321 CreateLShr(Value *LHS, Value *RHS, const Twine &Name = �, bool isExact = false) argument
1331 CreateLShr(Value *LHS, const APInt &RHS, const Twine &Name = �, bool isExact = false) argument
1336 CreateLShr(Value *LHS, uint64_t RHS, const Twine &Name = �, bool isExact = false) argument
1341 CreateAShr(Value *LHS, Value *RHS, const Twine &Name = �, bool isExact = false) argument
1351 CreateAShr(Value *LHS, const APInt &RHS, const Twine &Name = �, bool isExact = false) argument
1356 CreateAShr(Value *LHS, uint64_t RHS, const Twine &Name = �, bool isExact = false) argument
1361 CreateAnd(Value *LHS, Value *RHS, const Twine &Name = �) argument
1371 CreateAnd(Value *LHS, const APInt &RHS, const Twine &Name = �) argument
1375 CreateAnd(Value *LHS, uint64_t RHS, const Twine &Name = �) argument
1387 CreateOr(Value *LHS, Value *RHS, const Twine &Name = �) argument
1397 CreateOr(Value *LHS, const APInt &RHS, const Twine &Name = �) argument
1401 CreateOr(Value *LHS, uint64_t RHS, const Twine &Name = �) argument
1413 CreateXor(Value *LHS, Value *RHS, const Twine &Name = �) argument
1418 CreateXor(Value *LHS, const APInt &RHS, const Twine &Name = �) argument
1422 CreateXor(Value *LHS, uint64_t RHS, const Twine &Name = �) argument
1551 CreateBinOp(Instruction::BinaryOps Opc, Value *LHS, Value *RHS, const Twine &Name = �, MDNode *FPMathTag = nullptr) argument
2246 CreateICmpEQ(Value *LHS, Value *RHS, const Twine &Name = �) argument
2250 CreateICmpNE(Value *LHS, Value *RHS, const Twine &Name = �) argument
2254 CreateICmpUGT(Value *LHS, Value *RHS, const Twine &Name = �) argument
2258 CreateICmpUGE(Value *LHS, Value *RHS, const Twine &Name = �) argument
2262 CreateICmpULT(Value *LHS, Value *RHS, const Twine &Name = �) argument
2266 CreateICmpULE(Value *LHS, Value *RHS, const Twine &Name = �) argument
2270 CreateICmpSGT(Value *LHS, Value *RHS, const Twine &Name = �) argument
2274 CreateICmpSGE(Value *LHS, Value *RHS, const Twine &Name = �) argument
2278 CreateICmpSLT(Value *LHS, Value *RHS, const Twine &Name = �) argument
2282 CreateICmpSLE(Value *LHS, Value *RHS, const Twine &Name = �) argument
2286 CreateFCmpOEQ(Value *LHS, Value *RHS, const Twine &Name = �, MDNode *FPMathTag = nullptr) argument
2291 CreateFCmpOGT(Value *LHS, Value *RHS, const Twine &Name = �, MDNode *FPMathTag = nullptr) argument
2296 CreateFCmpOGE(Value *LHS, Value *RHS, const Twine &Name = �, MDNode *FPMathTag = nullptr) argument
2301 CreateFCmpOLT(Value *LHS, Value *RHS, const Twine &Name = �, MDNode *FPMathTag = nullptr) argument
2306 CreateFCmpOLE(Value *LHS, Value *RHS, const Twine &Name = �, MDNode *FPMathTag = nullptr) argument
2311 CreateFCmpONE(Value *LHS, Value *RHS, const Twine &Name = �, MDNode *FPMathTag = nullptr) argument
2316 CreateFCmpORD(Value *LHS, Value *RHS, const Twine &Name = �, MDNode *FPMathTag = nullptr) argument
2321 CreateFCmpUNO(Value *LHS, Value *RHS, const Twine &Name = �, MDNode *FPMathTag = nullptr) argument
2326 CreateFCmpUEQ(Value *LHS, Value *RHS, const Twine &Name = �, MDNode *FPMathTag = nullptr) argument
2331 CreateFCmpUGT(Value *LHS, Value *RHS, const Twine &Name = �, MDNode *FPMathTag = nullptr) argument
2336 CreateFCmpUGE(Value *LHS, Value *RHS, const Twine &Name = �, MDNode *FPMathTag = nullptr) argument
2341 CreateFCmpULT(Value *LHS, Value *RHS, const Twine &Name = �, MDNode *FPMathTag = nullptr) argument
2346 CreateFCmpULE(Value *LHS, Value *RHS, const Twine &Name = �, MDNode *FPMathTag = nullptr) argument
2351 CreateFCmpUNE(Value *LHS, Value *RHS, const Twine &Name = �, MDNode *FPMathTag = nullptr) argument
2356 CreateICmp(CmpInst::Predicate P, Value *LHS, Value *RHS, const Twine &Name = �) argument
2367 CreateFCmp(CmpInst::Predicate P, Value *LHS, Value *RHS, const Twine &Name = �, MDNode *FPMathTag = nullptr) argument
2382 CreateFCmpS(CmpInst::Predicate P, Value *LHS, Value *RHS, const Twine &Name = �, MDNode *FPMathTag = nullptr) argument
2610 CreatePtrDiff(Value *LHS, Value *RHS, const Twine &Name = �) argument
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DStraightLineStrengthReduce.cpp188 // Given I = LHS + RHS, factors RHS into i * S and makes (LHS + i * S) a
190 void allocateCandidatesAndFindBasisForAdd(Value *LHS, Value *RHS,
197 void allocateCandidatesAndFindBasisForMul(Value *LHS, Value *RHS,
394 Value *LHS = I->getOperand(0), *RHS = I->getOperand(1); local
395 allocateCandidatesAndFindBasisForAdd(LHS, RHS, I);
396 if (LHS != RHS)
397 allocateCandidatesAndFindBasisForAdd(RHS, LHS, I);
401 Value *LHS, Value *RHS, Instruction *I) {
404 if (match(RHS, m_Mu
400 allocateCandidatesAndFindBasisForAdd( Value *LHS, Value *RHS, Instruction *I) argument
432 allocateCandidatesAndFindBasisForMul( Value *LHS, Value *RHS, Instruction *I) argument
462 Value *LHS = I->getOperand(0), *RHS = I->getOperand(1); local
492 ConstantInt *RHS = nullptr; local
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/lib/Format/
H A DSortJavaScriptImports.cpp44 bool operator==(const JsImportedSymbol &RHS) const {
47 return Symbol == RHS.Symbol && Alias == RHS.Alias;
93 bool operator<(const JsModuleReference &LHS, const JsModuleReference &RHS) { argument
94 if (LHS.IsExport != RHS.IsExport)
95 return LHS.IsExport < RHS.IsExport;
96 if (LHS.Category != RHS.Category)
97 return LHS.Category < RHS.Category;
101 // This retains transitivity because LHS.Category == RHS.Category here.
104 if (LHS.URL.empty() != RHS
[all...]
/freebsd-11-stable/contrib/llvm-project/clang/include/clang/Basic/
H A DSanitizers.h89 SanitizerMask &operator&=(const SanitizerMask &RHS) { argument
91 maskLoToHigh[k] &= RHS.maskLoToHigh[k];
95 SanitizerMask &operator|=(const SanitizerMask &RHS) { argument
97 maskLoToHigh[k] |= RHS.maskLoToHigh[k];
103 constexpr bool operator!=(const SanitizerMask &RHS) const {
104 return !((*this) == RHS);
/freebsd-11-stable/contrib/llvm-project/llvm/lib/TextAPI/MachO/
H A DInterfaceFile.cpp34 lower_bound(Container, Target_, [](const Target &LHS, const Target &RHS) {
35 return LHS < RHS;
63 Target RHS) { return LHS.first < RHS; });
77 Target RHS) { return LHS.first < RHS; });
/freebsd-11-stable/contrib/llvm-project/llvm/utils/TableGen/
H A DDAGISelEmitter.cpp74 // PatternSortingPredicate - return true if we prefer to match LHS before RHS.
81 bool operator()(const PatternToMatch *LHS, const PatternToMatch *RHS) { argument
83 const TreePatternNode *RT = RHS->getSrcPattern();
97 int RHSSize = RHS->getPatternComplexity(CGP);
103 unsigned RHSCost = getResultPatternCost(RHS->getDstPattern(), CGP);
108 unsigned RHSPatSize = getResultPatternSize(RHS->getDstPattern(), CGP);
117 return LHS->ID < RHS->ID;

Completed in 304 milliseconds

1234567891011>>