Home
last modified time | relevance | path

Searched refs:LHS (Results 1 – 25 of 670) sorted by relevance

12345678910>>...27

/freebsd/contrib/llvm-project/llvm/include/llvm/Remarks/
H A DRemark.h152 if (!LHS && !RHS)
154 if (!LHS && RHS)
156 if (LHS && !RHS)
158 return *LHS < *RHS;
172 return std::make_tuple(LHS.SourceFilePath, LHS.SourceLine, LHS.SourceColumn) <
177 return LHS.Key == RHS.Key && LHS.Val == RHS.Val && LHS.Loc == RHS.Loc;
185 return std::make_tuple(LHS.Key, LHS.Val, LHS.Loc) <
192 LHS.FunctionName == RHS.FunctionName && LHS.Loc == RHS.Loc &&
193 LHS.Hotness == RHS.Hotness && LHS.Args == RHS.Args;
201 return std::make_tuple(LHS.RemarkType, LHS.PassName, LHS.RemarkName,
[all …]
/freebsd/contrib/llvm-project/llvm/lib/Support/
H A DKnownBits.cpp35 APInt LHSKnownUnion = LHS.Zero | LHS.One; in computeForAddCarry()
135 return LHS; in umax()
232 std::max(LHS.countMaxLeadingZeros(), LHS.countMaxLeadingOnes()) - 1); in shl()
368 if (LHS.One.intersects(RHS.Zero) || RHS.One.intersects(LHS.Zero)) in eq()
396 return ugt(RHS, LHS); in ult()
400 return uge(RHS, LHS); in ule()
420 return sgt(RHS, LHS); in slt()
716 unsigned TrailBitsKnown0 = (LHS.Zero | LHS.One).countr_one(); in mul()
772 if (LHS.One[0]) in divComputeLowBit()
928 if (LHS.isNonNegative() || LowBits.isSubsetOf(LHS.Zero)) in srem()
[all …]
H A DZ3Solver.cpp248 static bool areEquivalent(const llvm::fltSemantics &LHS, in areEquivalent() argument
250 return (llvm::APFloat::semanticsPrecision(LHS) == in areEquivalent()
252 (llvm::APFloat::semanticsMinExponent(LHS) == in areEquivalent()
254 (llvm::APFloat::semanticsMaxExponent(LHS) == in areEquivalent()
256 (llvm::APFloat::semanticsSizeInBits(LHS) == in areEquivalent()
478 Z3_ast Args[2] = {toZ3Expr(*LHS).AST, toZ3Expr(*RHS).AST}; in mkAnd()
483 Z3_ast Args[2] = {toZ3Expr(*LHS).AST, toZ3Expr(*RHS).AST}; in mkOr()
620 SMTExprRef mkBVAddNoUnderflow(const SMTExprRef &LHS, in mkBVAddNoUnderflow() argument
629 SMTExprRef mkBVSubNoOverflow(const SMTExprRef &LHS, in mkBVSubNoOverflow() argument
647 SMTExprRef mkBVSDivNoOverflow(const SMTExprRef &LHS, in mkBVSDivNoOverflow() argument
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DTwine.h162 Child LHS; variable
182 this->LHS.twine = &LHS; in Twine()
189 : LHS(LHS), RHS(RHS), LHSKind(LHSKind), RHSKind(RHSKind) { in Twine()
350 LHS.decUI = Val; in Twine()
355 LHS.decI = Val; in Twine()
386 this->LHS.cString = LHS; in Twine()
395 this->LHS.ptrAndLength.ptr = LHS.data(); in Twine()
396 this->LHS.ptrAndLength.length = LHS.size(); in Twine()
417 Child LHS, RHS; in utohexstr() local
485 return StringRef(LHS.ptrAndLength.ptr, LHS.ptrAndLength.length); in getSingleStringRef()
[all …]
H A DDenseMapInfo.h87 static bool isEqual(const T *LHS, const T *RHS) { return LHS == RHS; }
97 return LHS == RHS;
108 return LHS == RHS;
119 return LHS == RHS;
130 return LHS == RHS;
144 return LHS == RHS;
159 return LHS == RHS;
168 static bool isEqual(const short &LHS, const short &RHS) { return LHS == RHS; }
178 return LHS == RHS;
195 return LHS == RHS;
[all …]
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/LogicalView/Core/
H A DLVSort.cpp27 LVSortValue llvm::logicalview::compareKind(const LVObject *LHS, in compareKind() argument
29 return std::string(LHS->kind()) < std::string(RHS->kind()); in compareKind()
35 return LHS->getLineNumber() < RHS->getLineNumber(); in compareLine()
41 return LHS->getName() < RHS->getName(); in compareName()
47 return LHS->getOffset() < RHS->getOffset(); in compareOffset()
53 if (LHS->getLowerAddress() < RHS->getLowerAddress()) in compareRange()
58 if (LHS->getLowerAddress() == RHS->getLowerAddress()) in compareRange()
59 return LHS->getUpperAddress() < RHS->getUpperAddress(); in compareRange()
70 LHS->kind(), LHS->getName(), LHS->getLineNumber(), LHS->getOffset()); in sortByKind()
82 LHS->getLineNumber(), LHS->getName(), LHS->kind(), LHS->getOffset()); in sortByLine()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DMatrixBuilder.h50 LHS = B.CreateVectorSplat( in splatScalarOperandIfNeeded()
54 return {LHS, RHS}; in splatScalarOperandIfNeeded()
168 LHS = B.CreateVectorSplat( in CreateAdd()
176 ? B.CreateFAdd(LHS, RHS) in CreateAdd()
177 : B.CreateAdd(LHS, RHS); in CreateAdd()
193 LHS = B.CreateVectorSplat( in CreateSub()
201 ? B.CreateFSub(LHS, RHS) in CreateSub()
208 std::tie(LHS, RHS) = splatScalarOperandIfNeeded(LHS, RHS); in CreateScalarMultiply()
210 return B.CreateFMul(LHS, RHS); in CreateScalarMultiply()
211 return B.CreateMul(LHS, RHS); in CreateScalarMultiply()
[all …]
H A DPatternMatch.h982 inline BinaryOp_match<LHS, RHS, Instruction::Add> m_Add(const LHS &L, in m_Add()
994 inline BinaryOp_match<LHS, RHS, Instruction::Sub> m_Sub(const LHS &L, in m_Sub()
1048 inline BinaryOp_match<LHS, RHS, Instruction::Mul> m_Mul(const LHS &L, in m_Mul()
1096 inline BinaryOp_match<LHS, RHS, Instruction::And> m_And(const LHS &L, in m_And()
1102 inline BinaryOp_match<LHS, RHS, Instruction::Or> m_Or(const LHS &L, in m_Or()
1244 LHS L;
1268 inline DisjointOr_match<LHS, RHS, true> m_c_DisjointOr(const LHS &L, in m_c_DisjointOr()
1335 inline BinOpPred_match<LHS, RHS, is_shift_op> m_Shift(const LHS &L, in m_Shift()
1363 inline BinOpPred_match<LHS, RHS, is_idiv_op> m_IDiv(const LHS &L, in m_IDiv()
1370 inline BinOpPred_match<LHS, RHS, is_irem_op> m_IRem(const LHS &L, in m_IRem()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DKnownBits.h319 return LHS.intersectWith(RHS); in commonBits()
324 return (LHS.Zero | RHS.Zero).isAllOnes(); in haveNoCommonBitsSet()
478 LHS &= RHS;
479 return LHS;
483 RHS &= LHS;
488 LHS |= RHS;
489 return LHS;
493 RHS |= LHS;
498 LHS ^= RHS;
499 return LHS;
[all …]
H A DTypeSize.h107 return LHS;
117 return LHS;
122 return LHS;
126 LeafTy Copy = LHS;
131 LeafTy Copy = LHS;
136 LeafTy Copy = LHS;
143 LeafTy Copy = LHS;
377 return RHS * LHS;
380 return RHS * LHS;
383 return RHS * LHS;
[all …]
H A DSMTAPI.h68 return LHS.equal_to(RHS);
115 return LHS.equal_to(RHS);
279 virtual SMTExprRef mkBVConcat(const SMTExprRef &LHS,
284 virtual SMTExprRef mkBVAddNoOverflow(const SMTExprRef &LHS,
290 virtual SMTExprRef mkBVAddNoUnderflow(const SMTExprRef &LHS,
295 virtual SMTExprRef mkBVSubNoOverflow(const SMTExprRef &LHS,
300 virtual SMTExprRef mkBVSubNoUnderflow(const SMTExprRef &LHS,
306 virtual SMTExprRef mkBVSDivNoOverflow(const SMTExprRef &LHS,
315 virtual SMTExprRef mkBVMulNoOverflow(const SMTExprRef &LHS,
321 virtual SMTExprRef mkBVMulNoUnderflow(const SMTExprRef &LHS,
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/APINotes/
H A DTypes.h122 LHS.SwiftPrivate == RHS.SwiftPrivate && LHS.SwiftName == RHS.SwiftName;
127 return !(LHS == RHS);
188 return !(LHS == RHS);
295 return !(LHS == RHS);
346 LHS.Nullable == RHS.Nullable && LHS.Type == RHS.Type;
350 return !(LHS == RHS);
406 return !(LHS == RHS);
474 return !(LHS == RHS);
588 LHS.ResultType == RHS.ResultType && LHS.Params == RHS.Params &&
593 return !(LHS == RHS);
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/ExecutionEngine/Orc/Shared/
H A DExecutorAddress.h112 return LHS.Addr == RHS.Addr;
116 return LHS.Addr != RHS.Addr;
120 return LHS.Addr < RHS.Addr;
124 return LHS.Addr <= RHS.Addr;
128 return LHS.Addr > RHS.Addr;
203 return LHS.Start == RHS.Start && LHS.End == RHS.End;
207 return !(LHS == RHS);
212 (LHS.Start == RHS.Start && LHS.End < RHS.End);
217 (LHS.Start == RHS.Start && LHS.End <= RHS.End);
222 (LHS.Start == RHS.Start && LHS.End > RHS.End);
[all …]
/freebsd/contrib/llvm-project/clang/lib/Analysis/FlowSensitive/
H A DArena.cpp19 auto Res = std::make_pair(&LHS, &RHS); in canonicalFormulaPair()
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()
56 if (&LHS == &RHS) in makeOr()
57 return &LHS; in makeOr()
59 return LHS.literal() ? &LHS : &RHS; in makeOr()
80 if (&LHS == &RHS) in makeImplies()
93 if (&LHS == &RHS) in makeEquals()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/
H A DMIPatternMatch.h396 BinaryOp_match(const LHS_P &LHS, const RHS_P &RHS) : L(LHS), R(RHS) {}
438 inline BinaryOpc_match<LHS, RHS, false> m_BinOp(unsigned Opcode, const LHS &L,
451 m_GAdd(const LHS &L, const RHS &R) {
475 inline BinaryOp_match<LHS, RHS, TargetOpcode::G_SUB> m_GSub(const LHS &L,
482 m_GMul(const LHS &L, const RHS &R) {
506 m_GAnd(const LHS &L, const RHS &R) {
512 m_GXor(const LHS &L, const RHS &R) {
517 inline BinaryOp_match<LHS, RHS, TargetOpcode::G_OR, true> m_GOr(const LHS &L,
524 m_GShl(const LHS &L, const RHS &R) {
556 UnaryOp_match(const SrcTy &LHS) : L(LHS) {}
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/DebugInfo/CodeView/
H A DGUID.h25 inline bool operator==(const GUID &LHS, const GUID &RHS) {
26 return 0 == ::memcmp(LHS.Guid, RHS.Guid, sizeof(LHS.Guid));
29 inline bool operator<(const GUID &LHS, const GUID &RHS) {
30 return ::memcmp(LHS.Guid, RHS.Guid, sizeof(LHS.Guid)) < 0;
33 inline bool operator<=(const GUID &LHS, const GUID &RHS) {
34 return ::memcmp(LHS.Guid, RHS.Guid, sizeof(LHS.Guid)) <= 0;
37 inline bool operator>(const GUID &LHS, const GUID &RHS) {
38 return !(LHS <= RHS);
41 inline bool operator>=(const GUID &LHS, const GUID &RHS) {
42 return !(LHS < RHS);
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/Basic/
H A DThunk.h73 return LHS.NonVirtual == RHS.NonVirtual && LHS.Virtual.Equals(RHS.Virtual);
78 return !(LHS == RHS);
81 friend bool operator<(const ReturnAdjustment &LHS,
83 if (LHS.NonVirtual < RHS.NonVirtual)
86 return LHS.NonVirtual == RHS.NonVirtual && LHS.Virtual.Less(RHS.Virtual);
139 return LHS.NonVirtual == RHS.NonVirtual && LHS.Virtual.Equals(RHS.Virtual);
143 return !(LHS == RHS);
147 if (LHS.NonVirtual < RHS.NonVirtual)
150 return LHS.NonVirtual == RHS.NonVirtual && LHS.Virtual.Less(RHS.Virtual);
177 return LHS.This == RHS.This && LHS.Return == RHS.Return &&
[all …]
H A DFileEntry.h88 return LHS == &RHS.getFileEntry();
91 return &LHS.getFileEntry() == RHS;
94 return !(LHS == RHS);
97 return !(LHS == RHS);
100 return !(LHS == RHS);
254 if (LHS.isSameRef(RHS))
262 return LHS == RHS;
273 return LHS == RHS;
286 return (LHS ? &LHS->getFileEntry() : nullptr) == RHS;
289 return !(LHS == RHS);
[all …]
/freebsd/contrib/llvm-project/clang/lib/Tooling/
H A DNodeIntrospection.cpp45 static bool locationCallLessThan(const LocationCall *LHS, in locationCallLessThan() argument
47 if (!LHS && !RHS) in locationCallLessThan()
49 if (LHS && !RHS) in locationCallLessThan()
51 if (!LHS && RHS) in locationCallLessThan()
53 auto compareResult = LHS->name().compare(RHS->name()); in locationCallLessThan()
58 return locationCallLessThan(LHS->on(), RHS->on()); in locationCallLessThan()
64 if (LHS.first.getBegin() < RHS.first.getBegin()) in operator ()()
69 if (LHS.first.getEnd() < RHS.first.getEnd()) in operator ()()
71 else if (LHS.first.getEnd() != RHS.first.getEnd()) in operator ()()
79 if (LHS.first == RHS.first) in operator ()()
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DSMTConv.h125 return isSigned ? Solver->mkBVSlt(LHS, RHS) : Solver->mkBVUlt(LHS, RHS); in fromBinOp()
128 return isSigned ? Solver->mkBVSgt(LHS, RHS) : Solver->mkBVUgt(LHS, RHS); in fromBinOp()
131 return isSigned ? Solver->mkBVSle(LHS, RHS) : Solver->mkBVUle(LHS, RHS); in fromBinOp()
632 LHS = fromCast(Solver, LHS, RTy, RBitWidth, LTy, LBitWidth); in doTypeConversion()
684 LHS = (*doCast)(Solver, LHS, NewTy, NewBitWidth, LTy, LBitWidth); in doIntTypeConversion()
711 LHS = (*doCast)(Solver, LHS, RTy, RBitWidth, LTy, LBitWidth); in doIntTypeConversion()
721 LHS = (*doCast)(Solver, LHS, RTy, RBitWidth, LTy, LBitWidth); in doIntTypeConversion()
732 LHS = (*doCast)(Solver, LHS, RTy, RBitWidth, LTy, LBitWidth); in doIntTypeConversion()
744 LHS = (doCast)(Solver, LHS, RTy, RBitWidth, LTy, LBitWidth); in doIntTypeConversion()
762 LHS = (*doCast)(Solver, LHS, RTy, RBitWidth, LTy, LBitWidth); in doFloatTypeConversion()
[all …]
/freebsd/contrib/llvm-project/clang/include/clang/Edit/
H A DFileOffset.h37 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 Dsanitizer_dense_map_info.h100 return LHS == RHS;
112 return LHS == RHS;
127 return LHS == RHS;
142 return LHS == RHS;
156 return LHS == RHS;
172 return LHS == RHS;
188 return LHS == RHS;
199 return LHS == RHS;
213 return LHS == RHS;
231 return LHS == RHS;
[all …]
/freebsd/contrib/llvm-project/clang/lib/Analysis/
H A DThreadSafetyLogical.cpp28 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()
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()
82 : LeftAndOperator(cast<Or>(LHS)); in implies()
105 bool implies(const LExpr *LHS, const LExpr *RHS) { in implies() argument
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/MC/
H A DMCExpr.h514 const MCExpr *LHS, *RHS;
518 : MCExpr(MCExpr::Binary, Loc, Op), LHS(LHS), RHS(RHS) {} in MCExpr()
530 return create(Add, LHS, RHS, Ctx); in createAdd()
535 return create(And, LHS, RHS, Ctx); in createAnd()
540 return create(Div, LHS, RHS, Ctx); in createDiv()
545 return create(EQ, LHS, RHS, Ctx); in createEQ()
550 return create(GT, LHS, RHS, Ctx); in createGT()
555 return create(GTE, LHS, RHS, Ctx); in createGTE()
570 return create(LT, LHS, RHS, Ctx); in createLT()
590 return create(NE, LHS, RHS, Ctx); in createNE()
[all …]
/freebsd/contrib/llvm-project/compiler-rt/lib/orc/
H A Dbitmask_enum.h117 constexpr E operator|(E LHS, E RHS) {
122 constexpr E operator&(E LHS, E RHS) {
132 E &operator|=(E &LHS, E RHS) {
133 LHS = LHS | RHS;
134 return LHS;
138 E &operator&=(E &LHS, E RHS) {
139 LHS = LHS & RHS;
140 return LHS;
144 E &operator^=(E &LHS, E RHS) {
145 LHS = LHS ^ RHS;
[all …]

12345678910>>...27