/external/clang/test/SemaCXX/ |
warn-self-assign.cpp | 19 #define RHS a 24 a = RHS; 25 LHS OP RHS; 28 #undef RHS
|
/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);
|
/external/llvm/lib/Analysis/ |
PHITransAddr.cpp | 261 // Handle add with a constant RHS. 265 Constant *RHS = cast<ConstantInt>(Inst->getOperand(1)); 277 RHS = ConstantExpr::getAdd(RHS, CI); 288 if (Value *Res = SimplifyAddInst(LHS, RHS, isNSW, isNUW, TD, TLI, DT)) { 296 if (LHS == Inst->getOperand(0) && RHS == Inst->getOperand(1)) 304 BO->getOperand(0) == LHS && BO->getOperand(1) == RHS && 424 // Handle add with a constant RHS.
|
/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/llvm/unittests/Support/ |
IntegersSubsetTest.cpp | 25 bool operator < (const APInt& RHS) const { return ult(RHS); } 26 bool operator > (const APInt& RHS) const { return ugt(RHS); } 27 bool operator <= (const APInt& RHS) const { return ule(RHS); } 28 bool operator >= (const APInt& RHS) const { return uge(RHS); } 187 const unsigned_ranges RHS, 206 Ranges.push_back(Range(Int(RHS[i][0]), Int(RHS[i][1]))) [all...] |
/external/clang/lib/Lex/ |
PreprocessingRecord.cpp | 180 SourceLocation RHS = getLoc(R); 181 return SM.isBeforeInTranslationUnit(LHS, RHS); 184 bool operator()(PreprocessedEntity *L, SourceLocation RHS) const { 186 return SM.isBeforeInTranslationUnit(LHS, RHS); 190 SourceLocation RHS = getLoc(R); 191 return SM.isBeforeInTranslationUnit(LHS, RHS);
|
TokenLexer.cpp | 259 // If it is not the LHS/RHS of a ## operator, we must pre-expand the 308 // Okay, we have a token that is either the LHS or RHS of a paste (##) 360 // If an empty argument is on the LHS or RHS of a paste, the standard (C99 362 // implement this by eating ## operators when a LHS or RHS expands to 373 // If this is on the RHS of a paste operator, we've already copied the 497 /// operator. Read the ## and RHS, and paste the LHS/RHS together. If there 509 assert(!isAtEnd() && "No token on the RHS of a paste operator!"); 511 // Get the RHS token. 512 const Token &RHS = Tokens[CurToken] [all...] |
/external/clang/lib/Rewrite/Core/ |
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/clang/lib/StaticAnalyzer/Checkers/ |
DeadStoresChecker.cpp | 232 const Expr *RHS = B->getRHS()->IgnoreParenCasts(); 233 const BinaryOperator* BRHS = dyn_cast<BinaryOperator>(RHS); 269 const Expr *RHS = LookThroughTransitiveAssignments(B->getRHS()); 273 if (RHS->isNullPointerConstant(Ctx, Expr::NPC_ValueDependentIsNull)) 277 RHS = RHS->IgnoreParenCasts(); 280 if (const DeclRefExpr *RhsDR = dyn_cast<DeclRefExpr>(RHS))
|
IdempotentOperationChecker.cpp | 86 static bool isSelfAssign(const Expr *LHS, const Expr *RHS); 89 const Expr *RHS); 132 const Expr *RHS = B->getRHS(); 143 RHSContainsFalsePositive = !CanVary(RHS, AC) 144 || containsNonLocalVarDecl(RHS); 150 SVal RHSVal = state->getSVal(RHS, LCtx); 197 if (isSelfAssign(LHS, RHS)) { 198 if (!isUnused(LHS, AC) && !isTruncationExtensionAssignment(LHS, RHS)) { 429 const Expr *RHS = i->first->getRHS(); 431 FindLastStoreBRVisitor::registerStatementVarDecls(*report, RHS); [all...] |
/external/llvm/examples/Kaleidoscope/Chapter2/ |
toy.cpp | 101 ExprAST *LHS, *RHS; 103 BinaryExprAST(char op, ExprAST *lhs, ExprAST *rhs) 104 : Op(op), LHS(lhs), RHS(rhs) {} 255 ExprAST *RHS = ParsePrimary(); 256 if (!RHS) return 0; 258 // If BinOp binds less tightly with RHS than the operator after RHS, let 259 // the pending operator take RHS as its LHS. 262 RHS = ParseBinOpRHS(TokPrec+1, RHS) [all...] |
/external/llvm/include/llvm/ADT/ |
Twine.h | 153 /// RHS - The suffix in the concatenation, which may be uninitialized for 155 Child RHS; 174 RHS.twine = &_RHS; 181 : LHS(_LHS), RHS(_RHS), LHSKind(_LHSKind), RHSKind(_RHSKind) { 213 // Nullary twines always have Empty on the RHS. 217 // Null should never appear on the RHS. 221 // The RHS cannot be non-empty if the LHS is empty. 230 !RHS.twine->isBinary()) 351 RHS.stringRef = &_RHS; 359 RHS.cString = _RHS [all...] |
/external/llvm/lib/CodeGen/ |
IntrinsicLowering.cpp | 286 Value *RHS = Builder.CreateAnd(VShift, MaskCst, "cppop.and2"); 287 PartValue = Builder.CreateAdd(LHS, RHS, "ctpop.step");
|
/external/llvm/lib/MC/ |
MCExpr.cpp | 152 const MCExpr *RHS, MCContext &Ctx) { 153 return new (Ctx) MCBinaryExpr(Opc, LHS, RHS); 405 /// from two MCValue's LHS and RHS where 406 /// Result = LHS + RHS 571 // Negate RHS and add. 588 int64_t LHS = LHSValue.getConstant(), RHS = RHSValue.getConstant(); 591 case MCBinaryExpr::Add: Result = LHS + RHS; break; 592 case MCBinaryExpr::And: Result = LHS & RHS; break; 593 case MCBinaryExpr::Div: Result = LHS / RHS; break; 594 case MCBinaryExpr::EQ: Result = LHS == RHS; break [all...] |
/external/llvm/lib/Target/Mips/ |
Mips16ISelDAGToDAG.cpp | 265 SDValue RHS = Node->getOperand(1); 273 SDValue(Carry,0), RHS);
|
MipsSEISelDAGToDAG.cpp | 211 SDValue LHS = Node->getOperand(0), RHS = Node->getOperand(1); 216 SDValue(Carry, 0), RHS);
|
/external/llvm/lib/Target/R600/ |
AMDGPUISelLowering.cpp | 186 SDValue RHS = Op.getOperand(1); 192 !((LHS == True && RHS == False) || (LHS == False && RHS == True))) { 218 return DAG.getNode(AMDGPUISD::FMIN, DL, VT, LHS, RHS); 220 return DAG.getNode(AMDGPUISD::FMAX, DL, VT, LHS, RHS); 229 return DAG.getNode(AMDGPUISD::FMAX, DL, VT, LHS, RHS); 231 return DAG.getNode(AMDGPUISD::FMIN, DL, VT, LHS, RHS);
|
/external/llvm/lib/Transforms/InstCombine/ |
InstCombineShifts.cpp | 480 // If the operand is an bitwise operator with a constant RHS, and the 738 Constant *RHS = ConstantInt::getSigned(Op0->getType(), isCtPop ? -1:0); 739 Value *Cmp = Builder->CreateICmpEQ(II->getArgOperand(0), RHS);
|
InstCombineVectorOps.cpp | 165 EI.getName()+".rhs"); 216 /// elements from either LHS or RHS, return the shuffle mask and true. 218 static bool CollectSingleShuffleElements(Value *V, Value *LHS, Value *RHS, 220 assert(V->getType() == LHS->getType() && V->getType() == RHS->getType() && 235 if (V == RHS) { 255 if (CollectSingleShuffleElements(VecOp, LHS, RHS, Mask)) { 266 // This must be extracting from either LHS or RHS. 267 if (EI->getOperand(0) == LHS || EI->getOperand(0) == RHS) { 270 if (CollectSingleShuffleElements(VecOp, LHS, RHS, Mask)) { 277 assert(EI->getOperand(0) == RHS); [all...] |
/frameworks/native/include/private/ui/ |
RegionHelper.h | 41 static const uint32_t RHS = 0x6; // 0b110 43 op_nand = LHS & ~RHS, 44 op_and = LHS & RHS, 45 op_or = LHS | RHS, 46 op_xor = LHS ^ RHS 54 inline region(const region& rhs) 55 : rects(rhs.rects), count(rhs.count), dx(rhs.dx), dy(rhs.dy) { 162 region rhs; member in class:android::region_operator::Spanner 223 region rhs; member in class:android::region_operator::SpannerInner [all...] |
/external/clang/lib/Frontend/ |
PrintPreprocessedOutput.cpp | 585 const id_macro_pair *RHS = static_cast<const id_macro_pair*>(b); 586 return LHS->first->getName().compare(RHS->first->getName());
|
/external/clang/lib/StaticAnalyzer/Core/ |
ExprEngineC.cpp | 27 Expr *RHS = B->getRHS()->IgnoreParens(); 34 // With both the LHS and RHS evaluated, process the operation itself. 41 SVal RightV = state->getSVal(RHS, LCtx); 52 // Simulate the effects of a "store": bind the value of the RHS 71 RHS->getType()->isIntegerType() && RightV.isUnknown()) { 72 RightV = svalBuilder.conjureSymbolVal(RHS, LCtx, RHS->getType(), 556 const Expr *RHS = cast<Expr>(Elem.getStmt()); 557 SVal RHSVal = N->getState()->getSVal(RHS, Pred->getLocationContext()); 569 X = getSValBuilder().evalCast(RHSVal, B->getType(), RHS->getType()) [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/examples/Kaleidoscope/Chapter4/ |
toy.cpp | 116 ExprAST *LHS, *RHS; 118 BinaryExprAST(char op, ExprAST *lhs, ExprAST *rhs) 119 : Op(op), LHS(lhs), RHS(rhs) {} 274 ExprAST *RHS = ParsePrimary(); 275 if (!RHS) return 0; 277 // If BinOp binds less tightly with RHS than the operator after RHS, let 278 // the pending operator take RHS as its LHS. 281 RHS = ParseBinOpRHS(TokPrec+1, RHS) [all...] |
/external/llvm/lib/CodeGen/SelectionDAG/ |
LegalizeTypesGeneric.cpp | 126 SDValue RHS = Vals[Slot + 1]; 129 std::swap(LHS, RHS); 135 LHS, RHS));
|