/external/llvm/lib/CodeGen/ |
H A D | MachineModuleInfoImpls.cpp | 27 static int SortSymbolPair(const void *LHS, const void *RHS) { argument 29 const MCSymbol *LHSS = ((const PairTy *)LHS)->first;
|
H A D | LatencyPriorityQueue.cpp | 22 bool latency_sort::operator()(const SUnit *LHS, const SUnit *RHS) const { argument 26 if (LHS->isScheduleHigh && !RHS->isScheduleHigh) 28 if (!LHS->isScheduleHigh && RHS->isScheduleHigh) 31 unsigned LHSNum = LHS->NodeNum;
|
/external/clang/include/clang/AST/ |
H A D | TypeOrdering.h | 51 static bool isEqual(clang::QualType LHS, clang::QualType RHS) { argument 52 return LHS == RHS; 71 static bool isEqual(clang::CanQualType LHS, clang::CanQualType RHS) { argument 72 return LHS == RHS;
|
H A D | BaseSubobject.h | 46 friend bool operator==(const BaseSubobject &LHS, const BaseSubobject &RHS) { argument 47 return LHS.Base == RHS.Base && LHS.BaseOffset == RHS.BaseOffset; 74 static bool isEqual(const clang::BaseSubobject &LHS, argument 76 return LHS == RHS;
|
H A D | GlobalDecl.h | 71 friend bool operator==(const GlobalDecl &LHS, const GlobalDecl &RHS) { argument 72 return LHS.Value == RHS.Value; 109 static bool isEqual(clang::GlobalDecl LHS, argument 111 return LHS == RHS;
|
H A D | RawCommentList.h | 167 bool operator()(const RawComment &LHS, const RawComment &RHS) { argument 168 return SM.isBeforeInTranslationUnit(LHS.getSourceRange().getBegin(), 172 bool operator()(const RawComment *LHS, const RawComment *RHS) { argument 173 return operator()(*LHS, *RHS);
|
H A D | CharUnits.h | 216 static bool isEqual(const clang::CharUnits &LHS, argument 218 return LHS == RHS;
|
/external/clang/test/SemaCXX/ |
H A D | warn-self-assign.cpp | 18 #define LHS a macro 23 LHS = a; 25 LHS OP RHS; 27 #undef LHS macro
|
/external/llvm/lib/Transforms/Utils/ |
H A D | CmpInstAnalysis.cpp | 72 Value *llvm::getICmpValue(bool Sign, unsigned Code, Value *LHS, Value *RHS, argument 77 return ConstantInt::get(CmpInst::makeCmpResultType(LHS->getType()), 0); 85 return ConstantInt::get(CmpInst::makeCmpResultType(LHS->getType()), 1);
|
/external/clang/include/clang/Lex/ |
H A D | PPConditionalDirectiveRecord.h | 46 bool operator()(const CondDirectiveLoc &LHS, argument 48 return SM.isBeforeInTranslationUnit(LHS.getLoc(), RHS.getLoc()); 50 bool operator()(const CondDirectiveLoc &LHS, SourceLocation RHS) { argument 51 return SM.isBeforeInTranslationUnit(LHS.getLoc(), RHS); 53 bool operator()(SourceLocation LHS, const CondDirectiveLoc &RHS) { argument 54 return SM.isBeforeInTranslationUnit(LHS, RHS.getLoc()); 80 bool areInDifferentConditionalDirectiveRegion(SourceLocation LHS, argument 82 return findConditionalDirectiveRegionLoc(LHS) !=
|
/external/llvm/include/llvm/ADT/ |
H A D | 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; } argument 55 static bool isEqual(const char &LHS, const char &RHS) { argument 56 return LHS == RHS; 65 static bool isEqual(const unsigned& LHS, const unsigned& RHS) { argument 66 return LHS == RHS; 77 static bool isEqual(const unsigned long& LHS, const unsigned long& RHS) { argument 78 return LHS == RHS; 89 static bool isEqual(const unsigned long long& LHS, argument 100 isEqual(const int& LHS, const int& RHS) argument 114 isEqual(const long& LHS, const long& RHS) argument 126 isEqual(const long long& LHS, const long long& RHS) argument 160 isEqual(const Pair &LHS, const Pair &RHS) argument [all...] |
H A D | ArrayRef.h | 292 inline bool operator==(ArrayRef<T> LHS, ArrayRef<T> RHS) { argument 293 return LHS.equals(RHS); 297 inline bool operator!=(ArrayRef<T> LHS, ArrayRef<T> RHS) { argument 298 return !(LHS == RHS);
|
/external/llvm/include/llvm/Support/ |
H A D | DebugLoc.h | 108 static bool isEqual(DebugLoc LHS, DebugLoc RHS) { return LHS == RHS; } argument
|
/external/llvm/include/llvm/Transforms/Utils/ |
H A D | ValueMapper.h | 52 static inline RemapFlags operator|(RemapFlags LHS, RemapFlags RHS) { argument 53 return RemapFlags(unsigned(LHS)|unsigned(RHS));
|
/external/llvm/lib/Support/ |
H A D | DeltaAlgorithm.cpp | 32 changeset_ty LHS, RHS; local 36 ((idx < N) ? LHS : RHS).insert(*it); 37 if (!LHS.empty()) 38 Res.push_back(LHS);
|
H A D | Statistic.cpp | 90 bool operator()(const Statistic *LHS, const Statistic *RHS) const { argument 91 int Cmp = std::strcmp(LHS->getName(), RHS->getName()); 95 return std::strcmp(LHS->getDesc(), RHS->getDesc()) < 0;
|
H A D | TargetRegistry.cpp | 138 static int TargetArraySortFn(const void *LHS, const void *RHS) { argument 140 return ((const pair_ty*)LHS)->first.compare(((const pair_ty*)RHS)->first);
|
/external/llvm/lib/Target/ |
H A D | TargetLibraryInfo.cpp | 602 /// Compare two strings and return true if LHS is lexicographically less than 604 bool operator()(const char *LHS, StringRef RHS) const { argument 605 // Compare prefixes with strncmp. If prefixes match we know that LHS is 607 return std::strncmp(LHS, RHS.data(), RHS.size()) < 0; 611 bool operator()(StringRef LHS, const char *RHS) const { return LHS < RHS; } argument 612 bool operator()(StringRef LHS, StringRef RHS) const { return LHS < RHS; } argument 613 bool operator()(const char *LHS, const char *RHS) const { argument 614 return std::strcmp(LHS, RH [all...] |
/external/clang/include/clang/Basic/ |
H A D | ABI.h | 51 friend bool operator==(const ReturnAdjustment &LHS, argument 53 return LHS.NonVirtual == RHS.NonVirtual && 54 LHS.VBaseOffsetOffset == RHS.VBaseOffsetOffset; 57 friend bool operator<(const ReturnAdjustment &LHS, argument 59 if (LHS.NonVirtual < RHS.NonVirtual) 62 return LHS.NonVirtual == RHS.NonVirtual && 63 LHS.VBaseOffsetOffset < RHS.VBaseOffsetOffset; 81 friend bool operator==(const ThisAdjustment &LHS, argument 83 return LHS.NonVirtual == RHS.NonVirtual && 84 LHS 87 operator <(const ThisAdjustment &LHS, const ThisAdjustment &RHS) argument 111 operator ==(const ThunkInfo &LHS, const ThunkInfo &RHS) argument 115 operator <(const ThunkInfo &LHS, const ThunkInfo &RHS) argument [all...] |
/external/clang/include/clang/Edit/ |
H A D | FileOffset.h | 37 friend bool operator==(FileOffset LHS, FileOffset RHS) { argument 38 return LHS.FID == RHS.FID && LHS.Offs == RHS.Offs; 40 friend bool operator!=(FileOffset LHS, FileOffset RHS) { argument 41 return !(LHS == RHS); 43 friend bool operator<(FileOffset LHS, FileOffset RHS) { argument 44 if (LHS.FID != RHS.FID) 45 return LHS.FID < RHS.FID; 46 return LHS.Offs < RHS.Offs; 48 friend bool operator>(FileOffset LHS, FileOffse argument 53 operator >=(FileOffset LHS, FileOffset RHS) argument 56 operator <=(FileOffset LHS, FileOffset RHS) argument [all...] |
/external/llvm/unittests/ADT/ |
H A D | DenseMapTest.cpp | 66 static bool isEqual(const CtorTester &LHS, const CtorTester &RHS) { 67 return LHS == RHS; 301 static bool isEqual(const unsigned& LHS, const unsigned& RHS) { argument 302 return LHS == RHS; 304 static bool isEqual(const char* LHS, const unsigned& RHS) { argument 305 return (unsigned)(LHS[0] - 'a') == RHS; 337 static bool isEqual(const unsigned& LHS, const unsigned& RHS) { argument 338 return LHS == RHS;
|
/external/clang/lib/StaticAnalyzer/Core/ |
H A D | SimpleConstraintManager.cpp | 235 const SymExpr *LHS, 243 APSIntType WraparoundType = BVF.getAPSIntType(LHS->getType()); 252 SymbolRef Sym = LHS; 234 assumeSymRel(ProgramStateRef state, const SymExpr *LHS, BinaryOperator::Opcode op, const llvm::APSInt& Int) argument
|
/external/llvm/lib/Analysis/ |
H A D | PHITransAddr.cpp | 264 // PHI translate the LHS. 269 Value *LHS = PHITranslateSubExpr(Inst->getOperand(0), CurBB, PredBB, DT); local 270 if (LHS == 0) return 0; 272 // If the PHI translated LHS is an add of a constant, fold the immediates. 273 if (BinaryOperator *BOp = dyn_cast<BinaryOperator>(LHS)) 276 LHS = BOp->getOperand(0); 280 // If the old 'LHS' was an input, add the new 'LHS' as an input. 283 AddAsInput(LHS); 288 if (Value *Res = SimplifyAddInst(LHS, RH [all...] |
/external/llvm/unittests/Support/ |
H A D | 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 } }; local 259 TestDiff(LHS, 3, RHS, 1, ExcludeRes, 2, IntersectRes, 3); 263 unsigned_ranges LHS = { { 0, 4 }, { 7, 10 }, { 13, 17 } }; local 268 TestDiff(LHS, 3, RHS, 2, ExcludeRes, 1, IntersectRes, 2); 272 unsigned_ranges LHS = { { 0, 17 } }; local 278 TestDiff(LHS, 1, RHS, 3, ExcludeRes, 4, IntersectRes, 3); 282 unsigned_ranges LHS local 184 TestDiff( const unsigned_ranges LHS, unsigned LSize, const unsigned_ranges RHS, unsigned RSize, const unsigned_ranges ExcludeRes, unsigned ExcludeResSize, const unsigned_ranges IntersectRes, unsigned IntersectResSize ) argument 291 unsigned_ranges LHS = { { 2, 4 } }; local 300 unsigned_ranges LHS = { { 3, 7 } }; local 309 unsigned_ranges LHS = { { 0, 7 } }; local 318 unsigned_ranges LHS = { { 17, 17 } }; local [all...] |
/external/llvm/utils/TableGen/ |
H A D | DAGISelEmitter.cpp | 73 // PatternSortingPredicate - return true if we prefer to match LHS before RHS. 80 bool operator()(const PatternToMatch *LHS, const PatternToMatch *RHS) { argument 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 [all...] |