| /external/clang/include/clang/AST/ |
| APValue.h | 138 APValue(const APValue &RHS);
179 void swap(APValue &RHS);
393 /// Assign by swapping from a copy of the RHS.
394 APValue &operator=(APValue RHS) {
395 swap(RHS);
|
| /external/clang/lib/CodeGen/ |
| CodeGenModule.h | 95 bool operator==(const OrderGlobalInits &RHS) const {
96 return priority == RHS.priority &&
97 lex_order == RHS.lex_order;
100 bool operator<(const OrderGlobalInits &RHS) const {
101 if (priority < RHS.priority)
104 return priority == RHS.priority && lex_order < RHS.lex_order;
343 const GlobalInitData &RHS) const {
344 return LHS.first.priority < RHS.first.priority;
[all...] |
| MicrosoftVBTables.cpp | 125 static bool pathCompare(VBTablePath *LHS, VBTablePath *RHS) {
126 return LHS->Path < RHS->Path;
|
| /external/llvm/include/llvm/Analysis/ |
| AliasAnalysis.h | 576 const AliasAnalysis::Location &RHS) {
577 return LHS.Ptr == RHS.Ptr &&
578 LHS.Size == RHS.Size &&
579 LHS.TBAATag == RHS.TBAATag;
|
| MemoryDependenceAnalysis.h | 207 bool operator<(const NonLocalDepEntry &RHS) const {
208 return BB < RHS.BB;
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| LegalizeIntegerTypes.cpp | 453 SDValue RHS = SExtPromotedInteger(N->getOperand(1));
460 SDValue Res = DAG.getNode(Opcode, dl, NVT, LHS, RHS);
478 SDValue RHS = SExtPromotedInteger(N->getOperand(1));
480 LHS.getValueType(), LHS, RHS);
485 SDValue RHS = GetPromotedInteger(N->getOperand(2));
487 LHS.getValueType(), N->getOperand(0), LHS, RHS);
497 SDValue RHS = GetPromotedInteger(N->getOperand(2));
499 LHS.getValueType(), Mask, LHS, RHS);
504 SDValue RHS = GetPromotedInteger(N->getOperand(3));
507 N->getOperand(1), LHS, RHS, N->getOperand(4))
[all...] |
| /external/llvm/lib/Analysis/ |
| ScalarEvolutionExpander.cpp | 153 Value *LHS, Value *RHS) {
156 if (Constant *CRHS = dyn_cast<Constant>(RHS))
172 IP->getOperand(1) == RHS)
184 if (!L->isLoopInvariant(LHS) || !L->isLoopInvariant(RHS)) break;
193 Instruction *BO = cast<Instruction>(Builder.CreateBinOp(Opcode, LHS, RHS));
683 std::pair<const Loop *, const SCEV *> RHS) const {
686 RHS.second->getType()->isPointerTy())
690 if (LHS.first != RHS.first)
691 return PickMostRelevantLoop(LHS.first, RHS.first, DT) != LHS.first;
697 if (!RHS.second->isNonConstantNegative()
[all...] |
| /external/clang/lib/ARCMigrate/ |
| TransZeroOutPropsInDealloc.cpp | 70 // Remove the setter message if RHS is null
72 Expr *RHS = ME->getArg(0);
74 RHS->isNullPointerConstant(Ctx,
|
| /external/clang/test/SemaCXX/ |
| overloaded-operator.cpp | 406 inline bool operator==(StringRef LHS, StringRef RHS) { // expected-error{{overloaded 'operator==' must be a binary operator (has 3 parameters)}}
407 return !(LHS == RHS); // expected-error{{invalid operands to binary expression ('rdar9222009::StringRef' and 'rdar9222009::StringRef')}}
|
| /external/llvm/lib/Transforms/IPO/ |
| MergeFunctions.cpp | 155 const ComparableFunction &RHS);
669 const ComparableFunction &RHS) {
670 if (LHS.getFunc() == RHS.getFunc() &&
671 LHS.getHash() == RHS.getHash())
673 if (!LHS.getFunc() || !RHS.getFunc())
678 RHS.getTD() == ComparableFunction::LookupOnly)
681 assert(LHS.getTD() == RHS.getTD() &&
685 RHS.getFunc()).compare();
|
| /external/llvm/lib/Transforms/Utils/ |
| PromoteMemoryToRegister.cpp | 218 void swap(RenamePassData &RHS) {
219 std::swap(BB, RHS.BB);
220 std::swap(Pred, RHS.Pred);
221 Values.swap(RHS.Values);
493 const std::pair<unsigned, StoreInst *> &RHS) {
494 return LHS.first < RHS.first;
[all...] |
| /external/clang/include/clang/StaticAnalyzer/Core/ |
| CheckerManager.h | 601 bool operator==(const CachedStmtCheckersKey &RHS) const {
602 return StmtKind == RHS.StmtKind && IsPreVisit == RHS.IsPreVisit;
682 clang::ento::CheckerManager::CachedStmtCheckersKey RHS) {
683 return LHS == RHS;
|
| /external/clang/lib/Lex/ |
| TokenLexer.cpp | 261 // If it is not the LHS/RHS of a ## operator, we must pre-expand the
318 // Okay, we have a token that is either the LHS or RHS of a paste (##)
370 // If an empty argument is on the LHS or RHS of a paste, the standard (C99
372 // implement this by eating ## operators when a LHS or RHS expands to
383 // If this is on the RHS of a paste operator, we've already copied the
511 /// operator. Read the ## and RHS, and paste the LHS/RHS together. If there
523 assert(!isAtEnd() && "No token on the RHS of a paste operator!");
525 // Get the RHS token.
526 const Token &RHS = Tokens[CurToken]
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachineInstr.h | [all...] |
| /external/llvm/lib/TableGen/ |
| TGParser.cpp | 971 Init *RHS = InitList.pop_back_val();
972 RHS = (BinOpInit::get(Code, InitList.back(), RHS, Type))
974 InitList.back() = RHS;
1030 Init *RHS = ParseValue(CurRec);
1031 if (RHS == 0) return 0;
1052 if (TypedInit *RHSt = dyn_cast<TypedInit>(RHS))
1054 if (BitsInit *RHSbits = dyn_cast<BitsInit>(RHS)
[all...] |
| /external/llvm/examples/Kaleidoscope/MCJIT/cached/ |
| toy.cpp | 169 ExprAST *LHS, *RHS;
171 BinaryExprAST(char op, ExprAST *lhs, ExprAST *rhs)
172 : Op(op), LHS(lhs), RHS(rhs) {}
508 ExprAST *RHS = ParseUnary();
509 if (!RHS) return 0;
511 // If BinOp binds less tightly with RHS than the operator after RHS, let
512 // the pending operator take RHS as its LHS.
515 RHS = ParseBinOpRHS(TokPrec+1, RHS)
[all...] |
| /external/llvm/examples/Kaleidoscope/MCJIT/complete/ |
| toy.cpp | 193 ExprAST *LHS, *RHS;
195 BinaryExprAST(char op, ExprAST *lhs, ExprAST *rhs)
196 : Op(op), LHS(lhs), RHS(rhs) {}
532 ExprAST *RHS = ParseUnary();
533 if (!RHS) return 0;
535 // If BinOp binds less tightly with RHS than the operator after RHS, let
536 // the pending operator take RHS as its LHS.
539 RHS = ParseBinOpRHS(TokPrec+1, RHS)
[all...] |
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombineSimplifyDemanded.cpp | 42 // This instruction is producing bits that are not demanded. Shrink the RHS.
159 // If either the LHS or the RHS are Zero, the result is zero.
181 // If either the LHS or the RHS are One, the result is One.
235 // If either the LHS or the RHS are Zero, the result is zero.
257 // If the RHS is a constant, see if we can simplify it.
261 // Output known-1 bits are only known if set in both the LHS & RHS.
263 // Output known-0 are known to be clear if zero in either the LHS | RHS.
267 // If either the LHS or the RHS are One, the result is One.
294 // If the RHS is a constant, see if we can simplify it.
298 // Output known-0 bits are only known if clear in both the LHS & RHS
[all...] |
| InstCombineSelect.cpp | 25 MatchSelectPattern(Value *V, Value *&LHS, Value *&RHS) {
33 RHS = ICI->getOperand(1);
[all...] |
| /external/llvm/include/llvm/IR/ |
| Instructions.h | [all...] |
| /external/llvm/lib/Support/ |
| Path.cpp | 271 bool const_iterator::operator==(const const_iterator &RHS) const {
272 return Path.begin() == RHS.Path.begin() &&
273 Position == RHS.Position;
276 bool const_iterator::operator!=(const const_iterator &RHS) const {
277 return !(*this == RHS);
280 ptrdiff_t const_iterator::operator-(const const_iterator &RHS) const {
281 return Position - RHS.Position;
|
| /external/chromium_org/third_party/mesa/src/src/gallium/drivers/radeon/ |
| AMDILPeepholeOptimizer.cpp | 498 Instruction *RHS = dyn_cast<Instruction>(inst->getOperand(1));
511 if (!setupBitInsert(RHS, RHSSrc, RHSMask, RHSShift)) {
515 if (RHS) { RHS->dump(); }
530 dbgs() << "RHS: "; if (RHS) { RHS->dump(); } else { dbgs() << "(None)\n"; }
531 dbgs() << "RHS Src: "; if (RHSSrc) { RHSSrc->dump(); } else { dbgs() << "(None)\n"; }
532 dbgs() << "RHS Mask: "; if (RHSMask) { RHSMask->dump(); } else { dbgs() << "(None)\n"; }
533 dbgs() << "RHS Shift: "; if (RHSShift) { RHSShift->dump(); } else { dbgs() << "(None)\n";
870 BinaryOperator *rhs = local
916 BinaryOperator *rhs = local
[all...] |
| /external/mesa3d/src/gallium/drivers/radeon/ |
| AMDILPeepholeOptimizer.cpp | 498 Instruction *RHS = dyn_cast<Instruction>(inst->getOperand(1));
511 if (!setupBitInsert(RHS, RHSSrc, RHSMask, RHSShift)) {
515 if (RHS) { RHS->dump(); }
530 dbgs() << "RHS: "; if (RHS) { RHS->dump(); } else { dbgs() << "(None)\n"; }
531 dbgs() << "RHS Src: "; if (RHSSrc) { RHSSrc->dump(); } else { dbgs() << "(None)\n"; }
532 dbgs() << "RHS Mask: "; if (RHSMask) { RHSMask->dump(); } else { dbgs() << "(None)\n"; }
533 dbgs() << "RHS Shift: "; if (RHSShift) { RHSShift->dump(); } else { dbgs() << "(None)\n";
870 BinaryOperator *rhs = local
916 BinaryOperator *rhs = local
[all...] |
| /external/clang/tools/libclang/ |
| IndexingContext.h | 548 clang::cxindex::RefFileOccurence RHS) {
549 return LHS.File == RHS.File && LHS.Dcl == RHS.Dcl;
|
| /external/llvm/include/llvm/ADT/ |
| IntervalMap.h | 526 bool operator==(const NodeRef &RHS) const {
527 if (pip == RHS.pip)
529 assert(pip.getPointer() != RHS.pip.getPointer() && "Inconsistent NodeRefs");
533 bool operator!=(const NodeRef &RHS) const {
534 return !operator==(RHS);
[all...] |
