| /external/llvm/include/llvm/ADT/ |
| ValueMap.h | 267 static bool isEqual(const VH &LHS, const VH &RHS) {
268 return LHS == RHS;
270 static bool isEqual(const KeyT &LHS, const VH &RHS) {
271 return LHS == RHS.getValPtr();
309 bool operator==(const ValueMapIterator &RHS) const {
310 return I == RHS.I;
312 bool operator!=(const ValueMapIterator &RHS) const {
313 return I != RHS.I;
359 bool operator==(const ValueMapConstIterator &RHS) const {
360 return I == RHS.I
[all...] |
| SparseMultiSet.h | 248 iterator_base(const iterator_base &RHS)
249 : SMS(RHS.SMS), Idx(RHS.Idx), SparseIdx(RHS.SparseIdx) { }
251 const iterator_base &operator=(const iterator_base &RHS) {
252 SMS = RHS.SMS;
253 Idx = RHS.Idx;
254 SparseIdx = RHS.SparseIdx;
267 bool operator==(const iterator_base &RHS) const {
269 if (SMS == RHS.SMS && Idx == RHS.Idx)
[all...] |
| StringMap.h | 252 StringMap(const StringMap &RHS)
254 assert(RHS.empty() &&
256 (void)RHS;
258 void operator=(const StringMap &RHS) {
259 assert(RHS.empty() &&
261 (void)RHS;
435 bool operator==(const StringMapConstIterator &RHS) const {
436 return Ptr == RHS.Ptr;
438 bool operator!=(const StringMapConstIterator &RHS) const {
439 return Ptr != RHS.Ptr
[all...] |
| ilist.h | 183 ilist_iterator(const ilist_iterator<node_ty> &RHS)
184 : NodePtr(RHS.getNodePtrUnchecked()) {}
189 const ilist_iterator &operator=(const ilist_iterator<node_ty> &RHS) {
190 NodePtr = RHS.getNodePtrUnchecked();
205 bool operator==(const ilist_iterator &RHS) const {
206 return NodePtr == RHS.NodePtr;
208 bool operator!=(const ilist_iterator &RHS) const {
209 return NodePtr != RHS.NodePtr;
252 bool operator!=(const T* LHS, const ilist_iterator<const T> &RHS) {
253 return LHS != RHS.getNodePtrUnchecked()
[all...] |
| ArrayRef.h | 117 bool equals(ArrayRef RHS) const {
118 if (Length != RHS.Length)
121 if (Data[i] != RHS.Data[i])
299 inline bool operator==(ArrayRef<T> LHS, ArrayRef<T> RHS) {
300 return LHS.equals(RHS);
304 inline bool operator!=(ArrayRef<T> LHS, ArrayRef<T> RHS) {
305 return !(LHS == RHS);
|
| /external/clang/include/clang/AST/ |
| GlobalDecl.h | 72 friend bool operator==(const GlobalDecl &LHS, const GlobalDecl &RHS) {
73 return LHS.Value == RHS.Value;
111 clang::GlobalDecl RHS) {
112 return LHS == RHS;
|
| /external/clang/include/clang/Sema/ |
| IdentifierResolver.h | 116 bool operator==(const iterator &RHS) const {
117 return Ptr == RHS.Ptr;
119 bool operator!=(const iterator &RHS) const {
120 return Ptr != RHS.Ptr;
|
| /external/llvm/lib/Support/ |
| DeltaAlgorithm.cpp | 32 changeset_ty LHS, RHS;
36 ((idx < N) ? LHS : RHS).insert(*it);
39 if (!RHS.empty())
40 Res.push_back(RHS);
|
| StringRef.cpp | 41 int StringRef::compare_lower(StringRef RHS) const {
42 for (size_t I = 0, E = min(Length, RHS.Length); I != E; ++I) {
44 unsigned char RHC = ascii_tolower(RHS.Data[I]);
49 if (Length == RHS.Length)
51 return Length < RHS.Length ? -1 : 1;
55 int StringRef::compare_numeric(StringRef RHS) const {
56 for (size_t I = 0, E = min(Length, RHS.Length); I != E; ++I) {
58 if (ascii_isdigit(Data[I]) && ascii_isdigit(RHS.Data[I])) {
64 bool rd = J < RHS.Length && ascii_isdigit(RHS.Data[J])
[all...] |
| Statistic.cpp | 90 bool operator()(const Statistic *LHS, const Statistic *RHS) const {
91 int Cmp = std::strcmp(LHS->getName(), RHS->getName());
95 return std::strcmp(LHS->getDesc(), RHS->getDesc()) < 0;
|
| /external/llvm/include/llvm/Analysis/ |
| ScalarEvolution.h | 472 Constant *RHS,
499 ExitLimit HowManyLessThans(const SCEV *LHS, const SCEV *RHS,
510 /// RHS is true whenever the given FoundCondValue value evaluates to true.
512 const SCEV *LHS, const SCEV *RHS,
517 /// LHS, and RHS is true whenever the condition described by Pred, FoundLHS,
520 const SCEV *LHS, const SCEV *RHS,
524 /// Pred, LHS, and RHS is true whenever the condition described by Pred,
527 const SCEV *LHS, const SCEV *RHS,
540 /// of LHS and RHS.
543 const SCEV *LHS, const SCEV *RHS);
[all...] |
| /art/runtime/base/ |
| logging.h | 34 #define CHECK_OP(LHS, RHS, OP) \
35 for (auto _values = ::art::MakeEagerEvaluator(LHS, RHS); \
36 UNLIKELY(!(_values.lhs OP _values.rhs)); /* empty */) \
38 << "Check failed: " << #LHS << " " << #OP << " " << #RHS \
39 << " (" #LHS "=" << _values.lhs << ", " #RHS "=" << _values.rhs << ") "
136 template <typename LHS, typename RHS>
138 EagerEvaluator(LHS lhs, RHS rhs) : lhs(lhs), rhs(rhs) {
140 RHS rhs; member in struct:art::EagerEvaluator
[all...] |
| /external/llvm/lib/MC/ |
| MCExpr.cpp | 143 const MCExpr *RHS, MCContext &Ctx) {
144 return new (Ctx) MCBinaryExpr(Opc, LHS, RHS);
529 /// from two MCValue's LHS and RHS where
530 /// Result = LHS + RHS
695 // Negate RHS and add.
712 int64_t LHS = LHSValue.getConstant(), RHS = RHSValue.getConstant();
715 case MCBinaryExpr::Add: Result = LHS + RHS; break;
716 case MCBinaryExpr::And: Result = LHS & RHS; break;
717 case MCBinaryExpr::Div: Result = LHS / RHS; break;
718 case MCBinaryExpr::EQ: Result = LHS == RHS; break
[all...] |
| /external/clang/lib/CodeGen/ |
| CGExprScalar.cpp | 45 Value *RHS;
411 return Builder.CreateMul(Ops.LHS, Ops.RHS, "mul");
414 return Builder.CreateNSWMul(Ops.LHS, Ops.RHS, "mul");
425 return Builder.CreateFMul(Ops.LHS, Ops.RHS, "mul");
426 return Builder.CreateMul(Ops.LHS, Ops.RHS, "mul");
436 static Value *GetWidthMinusOneValue(Value* LHS,Value* RHS);
444 return Builder.CreateAnd(Ops.LHS, Ops.RHS, "and");
447 return Builder.CreateXor(Ops.LHS, Ops.RHS, "xor");
450 return Builder.CreateOr(Ops.LHS, Ops.RHS, "or");
2176 llvm::Value *rhs = Builder.CreateSExt(Ops.RHS, CGF.Int64Ty); local
[all...] |
| /external/llvm/include/llvm/Support/ |
| DebugLoc.h | 108 static bool isEqual(DebugLoc LHS, DebugLoc RHS) { return LHS == RHS; }
|
| IntegersSubsetMapping.h | 285 bool isOverlapped(self &RHS) {
286 if (Items.empty() || RHS.empty())
289 for (CaseItemIt L = Items.begin(), R = RHS.Items.begin(),
290 el = Items.end(), er = RHS.Items.end(); L != el && R != er;) {
380 void add(self& RHS) {
381 Items.insert(Items.end(), RHS.Items.begin(), RHS.Items.end());
384 void add(self& RHS, SuccessorClass *S) {
385 for (CaseItemIt i = RHS.Items.begin(), e = RHS.Items.end(); i != e; ++i
[all...] |
| Path.h | 72 bool operator==(const const_iterator &RHS) const;
73 bool operator!=(const const_iterator &RHS) const;
75 /// @brief Difference in bytes between this and RHS.
76 ptrdiff_t operator-(const const_iterator &RHS) const;
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| ValueMapper.h | 65 static inline RemapFlags operator|(RemapFlags LHS, RemapFlags RHS) {
66 return RemapFlags(unsigned(LHS)|unsigned(RHS));
|
| /external/compiler-rt/make/ |
| util.mk | 6 # Function: streq LHS RHS
8 # Return "true" if LHS == RHS, otherwise "".
10 # LHS == RHS <=> (LHS subst RHS is empty) and (RHS subst LHS is empty)
13 # Function: strneq LHS RHS
15 # Return "true" if LHS != RHS, otherwise "".
|
| /external/clang/lib/Rewrite/Core/ |
| RewriteRope.cpp | 305 // move the last 'WidthFactor' values into the RHS child.
399 RopePieceBTreeInterior(RopePieceBTreeNode *LHS, RopePieceBTreeNode *RHS)
402 Children[1] = RHS;
404 Size = LHS->size() + RHS->size();
452 RopePieceBTreeNode *HandleChildPiece(unsigned i, RopePieceBTreeNode *RHS);
485 if (RopePieceBTreeNode *RHS = getChild(i)->split(Offset-ChildOffset))
486 return HandleChildPiece(i, RHS);
515 if (RopePieceBTreeNode *RHS = getChild(i)->insert(Offset-ChildOffs, R))
516 return HandleChildPiece(i, RHS);
524 RopePieceBTreeInterior::HandleChildPiece(unsigned i, RopePieceBTreeNode *RHS) {
[all...] |
| DeltaTree.cpp | 56 DeltaTreeNode *LHS, *RHS;
135 Children[1] = IR.RHS;
137 FullDelta = IR.LHS->getFullDelta()+IR.RHS->getFullDelta()+IR.Split.Delta;
221 InsertRes->RHS->DoInsertion(FileIndex, Delta, 0 /*can't fail*/);
240 IN->Children[i+1] = InsertRes->RHS;
253 DeltaTreeNode *SubRHS = InsertRes->RHS;
264 InsertSide = cast<DeltaTreeInteriorNode>(InsertRes->RHS);
299 // into the RHS child.
327 InsertRes.RHS = NewNode;
390 DeltaTree::DeltaTree(const DeltaTree &RHS) {
[all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineAndOrXor.cpp | 97 static Value *getNewICmpValue(bool Sign, unsigned Code, Value *LHS, Value *RHS,
100 if (Value *NewConstant = getICmpValue(Sign, Code, LHS, RHS, NewPred))
102 return Builder->CreateICmp(NewPred, LHS, RHS);
109 Value *LHS, Value *RHS,
125 return Builder->CreateFCmp(Pred, LHS, RHS);
330 /// FoldLogicalPlusAnd - This is part of an expression (LHS +/- RHS) & Mask,
340 Value *InstCombiner::FoldLogicalPlusAnd(Value *LHS, Value *RHS,
364 uint32_t BitWidth = cast<IntegerType>(RHS->getType())->getBitWidth();
366 if (MaskedValueIsZero(RHS, Mask))
382 return Builder->CreateSub(LHSI->getOperand(0), RHS, "fold")
[all...] |
| /external/clang/lib/Sema/ |
| SemaExpr.cpp | 489 const Expr* RHS) {
509 if (RHS) {
515 SourceLocation RHSLocEnd = S.PP.getLocForEndOfToken(RHS->getLocEnd());
[all...] |
| /external/llvm/examples/Kaleidoscope/Chapter3/ |
| toy.cpp | 109 ExprAST *LHS, *RHS;
111 BinaryExprAST(char op, ExprAST *lhs, ExprAST *rhs)
112 : Op(op), LHS(lhs), RHS(rhs) {}
267 ExprAST *RHS = ParsePrimary();
268 if (!RHS) return 0;
270 // If BinOp binds less tightly with RHS than the operator after RHS, let
271 // the pending operator take RHS as its LHS.
274 RHS = ParseBinOpRHS(TokPrec+1, RHS)
[all...] |
| /external/llvm/utils/PerfectShuffle/ |
| PerfectShuffle.cpp | 62 /// getLHSOnlyMask - Given a mask that refers to its LHS and RHS, modify it to
151 return "RHS";
220 // Seed the table with accesses to the LHS and RHS.
322 for (unsigned RHS = 0; RHS != 0x8889; ++RHS) {
323 if (!isValidMask(RHS)) continue;
324 if (ShufTab[RHS].Cost > 1000) continue;
328 if (ShufTab[RHS].Cost + 1 >= MaxCost)
332 // Evaluate op(LHS,RHS)
[all...] |
