HomeSort by relevance Sort by last modified time
    Searched refs:LHS (Results 1 - 25 of 269) sorted by null

1 2 3 4 5 6 7 8 91011

  /external/clang/include/clang/Edit/
FileOffset.h 37 friend bool operator==(FileOffset LHS, FileOffset RHS) {
38 return LHS.FID == RHS.FID && LHS.Offs == RHS.Offs;
40 friend bool operator!=(FileOffset LHS, FileOffset RHS) {
41 return !(LHS == RHS);
43 friend bool operator<(FileOffset LHS, FileOffset RHS) {
44 if (LHS.FID != RHS.FID)
45 return LHS.FID < RHS.FID;
46 return LHS.Offs < RHS.Offs;
48 friend bool operator>(FileOffset LHS, FileOffset RHS)
    [all...]
  /external/clang/include/clang/Basic/
ABI.h 51 friend bool operator==(const ReturnAdjustment &LHS,
53 return LHS.NonVirtual == RHS.NonVirtual &&
54 LHS.VBaseOffsetOffset == RHS.VBaseOffsetOffset;
57 friend bool operator<(const ReturnAdjustment &LHS,
59 if (LHS.NonVirtual < RHS.NonVirtual)
62 return LHS.NonVirtual == RHS.NonVirtual &&
63 LHS.VBaseOffsetOffset < RHS.VBaseOffsetOffset;
81 friend bool operator==(const ThisAdjustment &LHS,
83 return LHS.NonVirtual == RHS.NonVirtual &&
84 LHS.VCallOffsetOffset == RHS.VCallOffsetOffset
    [all...]
  /external/llvm/include/llvm/Support/
NoFolder.h 40 Instruction *CreateAdd(Constant *LHS, Constant *RHS,
42 BinaryOperator *BO = BinaryOperator::CreateAdd(LHS, RHS);
47 Instruction *CreateNSWAdd(Constant *LHS, Constant *RHS) const {
48 return BinaryOperator::CreateNSWAdd(LHS, RHS);
50 Instruction *CreateNUWAdd(Constant *LHS, Constant *RHS) const {
51 return BinaryOperator::CreateNUWAdd(LHS, RHS);
53 Instruction *CreateFAdd(Constant *LHS, Constant *RHS) const {
54 return BinaryOperator::CreateFAdd(LHS, RHS);
56 Instruction *CreateSub(Constant *LHS, Constant *RHS,
58 BinaryOperator *BO = BinaryOperator::CreateSub(LHS, RHS)
    [all...]
ConstantFolder.h 34 Constant *CreateAdd(Constant *LHS, Constant *RHS,
36 return ConstantExpr::getAdd(LHS, RHS, HasNUW, HasNSW);
38 Constant *CreateFAdd(Constant *LHS, Constant *RHS) const {
39 return ConstantExpr::getFAdd(LHS, RHS);
41 Constant *CreateSub(Constant *LHS, Constant *RHS,
43 return ConstantExpr::getSub(LHS, RHS, HasNUW, HasNSW);
45 Constant *CreateFSub(Constant *LHS, Constant *RHS) const {
46 return ConstantExpr::getFSub(LHS, RHS);
48 Constant *CreateMul(Constant *LHS, Constant *RHS,
50 return ConstantExpr::getMul(LHS, RHS, HasNUW, HasNSW)
    [all...]
TargetFolder.h 50 Constant *CreateAdd(Constant *LHS, Constant *RHS,
52 return Fold(ConstantExpr::getAdd(LHS, RHS, HasNUW, HasNSW));
54 Constant *CreateFAdd(Constant *LHS, Constant *RHS) const {
55 return Fold(ConstantExpr::getFAdd(LHS, RHS));
57 Constant *CreateSub(Constant *LHS, Constant *RHS,
59 return Fold(ConstantExpr::getSub(LHS, RHS, HasNUW, HasNSW));
61 Constant *CreateFSub(Constant *LHS, Constant *RHS) const {
62 return Fold(ConstantExpr::getFSub(LHS, RHS));
64 Constant *CreateMul(Constant *LHS, Constant *RHS,
66 return Fold(ConstantExpr::getMul(LHS, RHS, HasNUW, HasNSW))
    [all...]
PatternMatch.h 378 BinaryOp_match(const LHS_t &LHS, const RHS_t &RHS) : L(LHS), R(RHS) {}
393 template<typename LHS, typename RHS>
394 inline BinaryOp_match<LHS, RHS, Instruction::Add>
395 m_Add(const LHS &L, const RHS &R) {
396 return BinaryOp_match<LHS, RHS, Instruction::Add>(L, R);
399 template<typename LHS, typename RHS>
400 inline BinaryOp_match<LHS, RHS, Instruction::FAdd>
401 m_FAdd(const LHS &L, const RHS &R) {
402 return BinaryOp_match<LHS, RHS, Instruction::FAdd>(L, R)
    [all...]
  /external/llvm/include/llvm/ADT/
Twine.h 150 /// LHS - The prefix in the concatenation, which may be uninitialized for
152 Child LHS;
173 LHS.twine = &_LHS;
181 : LHS(_LHS), RHS(_RHS), LHSKind(_LHSKind), RHSKind(_RHSKind) {
221 // The RHS cannot be non-empty if the LHS is empty.
227 !LHS.twine->isBinary())
266 LHS.cString = Str;
277 LHS.stdString = &Str;
284 LHS.stringRef = &Str;
291 LHS.character = Val
    [all...]
DenseMapInfo.h 27 //static bool isEqual(const T &LHS, const T &RHS);
47 static bool isEqual(const T *LHS, const T *RHS) { return LHS == RHS; }
55 static bool isEqual(const char &LHS, const char &RHS) {
56 return LHS == RHS;
65 static bool isEqual(const unsigned& LHS, const unsigned& RHS) {
66 return LHS == RHS;
77 static bool isEqual(const unsigned long& LHS, const unsigned long& RHS) {
78 return LHS == RHS;
89 static bool isEqual(const unsigned long long& LHS,
    [all...]
Triple.h 265 unsigned LHS[3];
266 getOSVersion(LHS[0], LHS[1], LHS[2]);
268 if (LHS[0] != Major)
269 return LHS[0] < Major;
270 if (LHS[1] != Minor)
271 return LHS[1] < Minor;
272 if (LHS[2] != Micro)
273 return LHS[1] < Micro
    [all...]
  /frameworks/native/include/utils/
Debug.h 39 template<typename LHS, typename RHS>
40 struct CompileTimeIfElse<true, LHS, RHS> { typedef LHS TYPE; };
41 template<typename LHS, typename RHS>
42 struct CompileTimeIfElse<false, LHS, RHS> { typedef RHS TYPE; };
  /external/clang/test/SemaCXX/
warn-self-assign.cpp 18 #define LHS a
23 LHS = a;
25 LHS OP RHS;
27 #undef LHS
  /external/clang/include/clang/Lex/
PPConditionalDirectiveRecord.h 46 bool operator()(const CondDirectiveLoc &LHS,
48 return SM.isBeforeInTranslationUnit(LHS.getLoc(), RHS.getLoc());
50 bool operator()(const CondDirectiveLoc &LHS, SourceLocation RHS) {
51 return SM.isBeforeInTranslationUnit(LHS.getLoc(), RHS);
53 bool operator()(SourceLocation LHS, const CondDirectiveLoc &RHS) {
54 return SM.isBeforeInTranslationUnit(LHS, RHS.getLoc());
80 bool areInDifferentConditionalDirectiveRegion(SourceLocation LHS,
82 return findConditionalDirectiveRegionLoc(LHS) !=
  /external/llvm/include/llvm/MC/
MCExpr.h 353 const MCExpr *LHS, *RHS;
356 : MCExpr(MCExpr::Binary), Op(_Op), LHS(_LHS), RHS(_RHS) {}
362 static const MCBinaryExpr *Create(Opcode Op, const MCExpr *LHS,
364 static const MCBinaryExpr *CreateAdd(const MCExpr *LHS, const MCExpr *RHS,
366 return Create(Add, LHS, RHS, Ctx);
368 static const MCBinaryExpr *CreateAnd(const MCExpr *LHS, const MCExpr *RHS,
370 return Create(And, LHS, RHS, Ctx);
372 static const MCBinaryExpr *CreateDiv(const MCExpr *LHS, const MCExpr *RHS,
374 return Create(Div, LHS, RHS, Ctx);
376 static const MCBinaryExpr *CreateEQ(const MCExpr *LHS, const MCExpr *RHS
    [all...]
  /external/compiler-rt/lib/ubsan/
ubsan_handlers.cc 66 ValueHandle LHS,
76 << Value(Data->Type, LHS) << Operator << RHS << Data->Type;
80 ValueHandle LHS, ValueHandle RHS) {
81 HandleIntegerOverflow(Data, LHS, "+", Value(Data->Type, RHS));
84 ValueHandle LHS,
86 __ubsan_handle_add_overflow(Data, LHS, RHS);
91 ValueHandle LHS, ValueHandle RHS) {
92 HandleIntegerOverflow(Data, LHS, "-", Value(Data->Type, RHS));
95 ValueHandle LHS,
97 __ubsan_handle_sub_overflow(Data, LHS, RHS)
    [all...]
ubsan_handlers.h 44 RECOVERABLE(add_overflow, OverflowData *Data, ValueHandle LHS, ValueHandle RHS)
47 RECOVERABLE(sub_overflow, OverflowData *Data, ValueHandle LHS, ValueHandle RHS)
50 RECOVERABLE(mul_overflow, OverflowData *Data, ValueHandle LHS, ValueHandle RHS)
57 ValueHandle LHS, ValueHandle RHS)
66 /// the LHS is negative or overflows.
68 ValueHandle LHS, ValueHandle RHS)
  /external/clang/include/clang/AST/
BaseSubobject.h 46 friend bool operator==(const BaseSubobject &LHS, const BaseSubobject &RHS) {
47 return LHS.Base == RHS.Base && LHS.BaseOffset == RHS.BaseOffset;
74 static bool isEqual(const clang::BaseSubobject &LHS,
76 return LHS == RHS;
TypeOrdering.h 51 static bool isEqual(clang::QualType LHS, clang::QualType RHS) {
52 return LHS == RHS;
71 static bool isEqual(clang::CanQualType LHS, clang::CanQualType RHS) {
72 return LHS == RHS;
  /external/llvm/include/llvm/Analysis/
InstructionSimplify.h 50 Value *SimplifyAddInst(Value *LHS, Value *RHS, bool isNSW, bool isNUW,
57 Value *SimplifySubInst(Value *LHS, Value *RHS, bool isNSW, bool isNUW,
64 Value *SimplifyFAddInst(Value *LHS, Value *RHS, FastMathFlags FMF,
71 Value *SimplifyFSubInst(Value *LHS, Value *RHS, FastMathFlags FMF,
78 Value *SimplifyFMulInst(Value *LHS, Value *RHS,
86 Value *SimplifyMulInst(Value *LHS, Value *RHS, const DataLayout *TD = 0,
92 Value *SimplifySDivInst(Value *LHS, Value *RHS, const DataLayout *TD = 0,
98 Value *SimplifyUDivInst(Value *LHS, Value *RHS, const DataLayout *TD = 0,
104 Value *SimplifyFDivInst(Value *LHS, Value *RHS, const DataLayout *TD = 0,
110 Value *SimplifySRemInst(Value *LHS, Value *RHS, const DataLayout *TD = 0
    [all...]
  /external/llvm/lib/CodeGen/
MachineModuleInfoImpls.cpp 27 static int SortSymbolPair(const void *LHS, const void *RHS) {
29 const MCSymbol *LHSS = ((const PairTy *)LHS)->first;
  /external/llvm/include/llvm/IR/
IRBuilder.h 550 Value *LHS, Value *RHS,
553 BinaryOperator *BO = Insert(BinaryOperator::Create(Opc, LHS, RHS), Name);
570 Value *CreateAdd(Value *LHS, Value *RHS, const Twine &Name = "",
572 if (Constant *LC = dyn_cast<Constant>(LHS))
575 return CreateInsertNUWNSWBinOp(Instruction::Add, LHS, RHS, Name,
578 Value *CreateNSWAdd(Value *LHS, Value *RHS, const Twine &Name = "") {
579 return CreateAdd(LHS, RHS, Name, false, true);
581 Value *CreateNUWAdd(Value *LHS, Value *RHS, const Twine &Name = "") {
582 return CreateAdd(LHS, RHS, Name, true, false);
584 Value *CreateFAdd(Value *LHS, Value *RHS, const Twine &Name = ""
    [all...]
  /external/llvm/include/llvm/Transforms/Utils/
CmpInstAnalysis.h 56 Value *getICmpValue(bool Sign, unsigned Code, Value *LHS, Value *RHS,
  /external/llvm/unittests/Support/
IntegersSubsetTest.cpp 185 const unsigned_ranges LHS,
199 Ranges.push_back(Range(Int(LHS[i][0]), Int(LHS[i][1])));
254 unsigned_ranges LHS = { { 0, 4 }, { 7, 10 }, { 13, 17 } };
259 TestDiff(LHS, 3, RHS, 1, ExcludeRes, 2, IntersectRes, 3);
263 unsigned_ranges LHS = { { 0, 4 }, { 7, 10 }, { 13, 17 } };
268 TestDiff(LHS, 3, RHS, 2, ExcludeRes, 1, IntersectRes, 2);
272 unsigned_ranges LHS = { { 0, 17 } };
278 TestDiff(LHS, 1, RHS, 3, ExcludeRes, 4, IntersectRes, 3);
282 unsigned_ranges LHS = { { 2, 4 } }
    [all...]
  /external/clang/lib/Lex/
PPExpressions.cpp 57 static bool EvaluateDirectiveSubExpr(PPValue &LHS, unsigned MinPrec,
447 /// PeekTok, and whose precedence is PeekPrec. This returns the result in LHS.
452 static bool EvaluateDirectiveSubExpr(PPValue &LHS, unsigned MinPrec,
459 << LHS.getRange();
477 if (Operator == tok::ampamp && LHS.Val == 0)
479 else if (Operator == tok::pipepipe && LHS.Val != 0)
481 else if (Operator == tok::question && LHS.Val == 0)
490 PPValue RHS(LHS.getBitWidth());
512 // the LHS of the '?'. The grammar rule is:
533 llvm::APSInt Res(LHS.getBitWidth())
    [all...]
  /external/llvm/utils/TableGen/
DAGISelEmitter.cpp 73 // PatternSortingPredicate - return true if we prefer to match LHS before RHS.
80 bool operator()(const PatternToMatch *LHS, const PatternToMatch *RHS) {
81 const TreePatternNode *LHSSrc = LHS->getSrcPattern();
97 unsigned LHSSize = LHS->getPatternComplexity(CGP);
99 if (LHSSize > RHSSize) return true; // LHS -> bigger -> less cost
103 unsigned LHSCost = getResultPatternCost(LHS->getDstPattern(), CGP);
108 unsigned LHSPatSize = getResultPatternSize(LHS->getDstPattern(), CGP);
115 assert(LHS == RHS || LHS->ID != RHS->ID);
116 return LHS->ID < RHS->ID
    [all...]
  /external/llvm/lib/Target/Mips/MCTargetDesc/
MipsBaseInfo.h 137 const MCExpr *LHS = BE->getLHS();
140 if ((LHS->getKind() != MCExpr::SymbolRef) || !CE)
143 return std::make_pair(cast<MCSymbolRefExpr>(LHS), CE->getValue());

Completed in 357 milliseconds

1 2 3 4 5 6 7 8 91011