| /external/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyLogical.h | 55 class BinOp : public LExpr {
59 BinOp(LExpr *LHS, LExpr *RHS, Opcode Code) : LExpr(Code), LHS(LHS), RHS(RHS) {}
69 class And : public BinOp {
71 And(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::And) {}
76 class Or : public BinOp {
78 Or(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::Or) {}
|
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyLogical.h | 55 class BinOp : public LExpr {
59 BinOp(LExpr *LHS, LExpr *RHS, Opcode Code) : LExpr(Code), LHS(LHS), RHS(RHS) {}
69 class And : public BinOp {
71 And(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::And) {}
76 class Or : public BinOp {
78 Or(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::Or) {}
|
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyLogical.h | 55 class BinOp : public LExpr {
59 BinOp(LExpr *LHS, LExpr *RHS, Opcode Code) : LExpr(Code), LHS(LHS), RHS(RHS) {}
69 class And : public BinOp {
71 And(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::And) {}
76 class Or : public BinOp {
78 Or(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::Or) {}
|
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyLogical.h | 55 class BinOp : public LExpr {
59 BinOp(LExpr *LHS, LExpr *RHS, Opcode Code) : LExpr(Code), LHS(LHS), RHS(RHS) {}
69 class And : public BinOp {
71 And(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::And) {}
76 class Or : public BinOp {
78 Or(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::Or) {}
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyLogical.h | 55 class BinOp : public LExpr {
59 BinOp(LExpr *LHS, LExpr *RHS, Opcode Code) : LExpr(Code), LHS(LHS), RHS(RHS) {}
69 class And : public BinOp {
71 And(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::And) {}
76 class Or : public BinOp {
78 Or(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::Or) {}
|
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyLogical.h | 55 class BinOp : public LExpr {
59 BinOp(LExpr *LHS, LExpr *RHS, Opcode Code) : LExpr(Code), LHS(LHS), RHS(RHS) {}
69 class And : public BinOp {
71 And(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::And) {}
76 class Or : public BinOp {
78 Or(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::Or) {}
|
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyLogical.h | 55 class BinOp : public LExpr {
59 BinOp(LExpr *LHS, LExpr *RHS, Opcode Code) : LExpr(Code), LHS(LHS), RHS(RHS) {}
69 class And : public BinOp {
71 And(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::And) {}
76 class Or : public BinOp {
78 Or(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::Or) {}
|
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyLogical.h | 55 class BinOp : public LExpr {
59 BinOp(LExpr *LHS, LExpr *RHS, Opcode Code) : LExpr(Code), LHS(LHS), RHS(RHS) {}
69 class And : public BinOp {
71 And(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::And) {}
76 class Or : public BinOp {
78 Or(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::Or) {}
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/clang/include/clang/Analysis/Analyses/ |
| ThreadSafetyLogical.h | 55 class BinOp : public LExpr {
59 BinOp(LExpr *LHS, LExpr *RHS, Opcode Code) : LExpr(Code), LHS(LHS), RHS(RHS) {}
69 class And : public BinOp {
71 And(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::And) {}
76 class Or : public BinOp {
78 Or(LExpr *LHS, LExpr *RHS) : BinOp(LHS, RHS, LExpr::Or) {}
|
| /device/linaro/bootloader/edk2/ShellPkg/Library/UefiShellLevel1CommandsLib/ |
| If.c | 112 @param[in] BinOp The type of comparison to perform.
123 IN CONST BIN_OPERATOR_TYPE BinOp,
132 // "Compare1 BinOp Compare2"
134 switch (BinOp) {
158 if (BinOp == OperatorGreaterThan) {
192 if (BinOp == OperatorLessThan) {
281 if (BinOp == OperatorGreatorOrEqual) {
315 if (BinOp == OperatorLessOrEqual) {
363 BIN_OPERATOR_TYPE BinOp;
372 BinOp = OperatorMax;
[all...] |
| /external/llvm/examples/Kaleidoscope/Chapter2/ |
| toy.cpp | 184 // Make sure it's a declared binop.
280 // If this is a binop, find its precedence.
284 // If this is a binop that binds at least as tightly as the current binop,
289 // Okay, we know this is a binop.
290 int BinOp = CurTok;
291 getNextToken(); // eat binop
298 // If BinOp binds less tightly with RHS than the operator after RHS, let
308 LHS = helper::make_unique<BinaryExprAST>(BinOp, std::move(LHS),
|
| /external/llvm/lib/Analysis/ |
| CostModel.cpp | 158 static bool matchPairwiseReductionAtLevel(const BinaryOperator *BinOp,
166 if (BinOp == nullptr)
169 assert(BinOp->getType()->isVectorTy() && "Expecting a vector type");
171 unsigned Opcode = BinOp->getOpcode();
172 Value *L = BinOp->getOperand(0);
173 Value *R = BinOp->getOperand(1);
202 // %BinOp = fadd %NextLevelOpL, %R
342 BinaryOperator *BinOp;
343 if (!(BinOp = dyn_cast<BinaryOperator>(RdxOp)))
345 if (BinOp->getOpcode() != RdxOpcode
[all...] |
| /external/llvm/lib/Target/AArch64/ |
| AArch64AddressTypePromotion.cpp | 160 const BinaryOperator *BinOp = dyn_cast<BinaryOperator>(Inst);
161 if (BinOp && isa<OverflowingBinaryOperator>(BinOp) &&
162 (BinOp->hasNoUnsignedWrap() || BinOp->hasNoSignedWrap()))
454 const BinaryOperator *BinOp = dyn_cast<BinaryOperator>(Inst);
455 if (BinOp && isa<ConstantInt>(BinOp->getOperand(0)))
|
| /external/swiftshader/third_party/LLVM/examples/Kaleidoscope/Chapter2/ |
| toy.cpp | 159 // Make sure it's a declared binop.
241 // If this is a binop, find its precedence.
245 // If this is a binop that binds at least as tightly as the current binop,
250 // Okay, we know this is a binop.
251 int BinOp = CurTok;
252 getNextToken(); // eat binop
258 // If BinOp binds less tightly with RHS than the operator after RHS, let
267 LHS = new BinaryExprAST(BinOp, LHS, RHS);
|
| /external/llvm/examples/Kaleidoscope/Chapter3/ |
| toy.cpp | 193 // Make sure it's a declared binop.
290 // If this is a binop, find its precedence.
294 // If this is a binop that binds at least as tightly as the current binop,
299 // Okay, we know this is a binop.
300 int BinOp = CurTok;
301 getNextToken(); // eat binop
308 // If BinOp binds less tightly with RHS than the operator after RHS, let
319 llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
|
| /external/llvm/examples/Kaleidoscope/Chapter4/ |
| toy.cpp | 202 // Make sure it's a declared binop.
299 // If this is a binop, find its precedence.
303 // If this is a binop that binds at least as tightly as the current binop,
308 // Okay, we know this is a binop.
309 int BinOp = CurTok;
310 getNextToken(); // eat binop
317 // If BinOp binds less tightly with RHS than the operator after RHS, let
328 llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
|
| /external/swiftshader/third_party/LLVM/examples/Kaleidoscope/Chapter3/ |
| toy.cpp | 171 // Make sure it's a declared binop.
253 // If this is a binop, find its precedence.
257 // If this is a binop that binds at least as tightly as the current binop,
262 // Okay, we know this is a binop.
263 int BinOp = CurTok;
264 getNextToken(); // eat binop
270 // If BinOp binds less tightly with RHS than the operator after RHS, let
279 LHS = new BinaryExprAST(BinOp, LHS, RHS);
|
| /external/swiftshader/third_party/LLVM/examples/Kaleidoscope/Chapter4/ |
| toy.cpp | 178 // Make sure it's a declared binop.
260 // If this is a binop, find its precedence.
264 // If this is a binop that binds at least as tightly as the current binop,
269 // Okay, we know this is a binop.
270 int BinOp = CurTok;
271 getNextToken(); // eat binop
277 // If BinOp binds less tightly with RHS than the operator after RHS, let
286 LHS = new BinaryExprAST(BinOp, LHS, RHS);
|
| /external/llvm/examples/Kaleidoscope/Chapter5/ |
| toy.cpp | 245 // Make sure it's a declared binop.
424 // If this is a binop, find its precedence.
428 // If this is a binop that binds at least as tightly as the current binop,
433 // Okay, we know this is a binop.
434 int BinOp = CurTok;
435 getNextToken(); // eat binop
442 // If BinOp binds less tightly with RHS than the operator after RHS, let
453 llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
|
| /external/llvm/lib/Transforms/InstCombine/ |
| InstCombinePHI.cpp | 27 /// adds all have a single use, turn this into a phi and a single binop.
108 BinaryOperator *BinOp = cast<BinaryOperator>(FirstInst);
110 BinaryOperator::Create(BinOp->getOpcode(), LHSVal, RHSVal);
498 // Can fold binop, compare or shift here if the RHS is a constant,
556 if (BinaryOperator *BinOp = dyn_cast<BinaryOperator>(FirstInst)) {
557 BinOp = BinaryOperator::Create(BinOp->getOpcode(), PhiVal, ConstantOp);
558 BinOp->copyIRFlags(PN.getIncomingValue(0));
561 BinOp->andIRFlags(PN.getIncomingValue(i));
563 BinOp->setDebugLoc(FirstInst->getDebugLoc())
[all...] |
| /external/swiftshader/third_party/LLVM/examples/Kaleidoscope/Chapter5/ |
| toy.cpp | 207 // Make sure it's a declared binop.
361 // If this is a binop, find its precedence.
365 // If this is a binop that binds at least as tightly as the current binop,
370 // Okay, we know this is a binop.
371 int BinOp = CurTok;
372 getNextToken(); // eat binop
378 // If BinOp binds less tightly with RHS than the operator after RHS, let
387 LHS = new BinaryExprAST(BinOp, LHS, RHS);
|
| /external/swiftshader/third_party/LLVM/lib/Transforms/InstCombine/ |
| InstCombinePHI.cpp | 23 /// and a single binop.
120 BinaryOperator *BinOp = cast<BinaryOperator>(FirstInst);
122 BinaryOperator::Create(BinOp->getOpcode(), LHSVal, RHSVal);
417 // Can fold binop, compare or shift here if the RHS is a constant,
490 if (BinaryOperator *BinOp = dyn_cast<BinaryOperator>(FirstInst)) {
491 BinOp = BinaryOperator::Create(BinOp->getOpcode(), PhiVal, ConstantOp);
492 if (isNUW) BinOp->setHasNoUnsignedWrap();
493 if (isNSW) BinOp->setHasNoSignedWrap();
494 if (isExact) BinOp->setIsExact()
[all...] |
| /external/swiftshader/third_party/subzero/src/ |
| IceConverter.cpp | 345 const auto BinOp = cast<BinaryOperator>(Instr);
348 Ice::Variable *Dest = mapValueToIceVar(BinOp);
[all...] |
| /external/clang/lib/StaticAnalyzer/Checkers/ |
| NullabilityChecker.cpp | [all...] |
| /external/llvm/examples/Kaleidoscope/BuildingAJIT/Chapter1/ |
| toy.cpp | 298 // Make sure it's a declared binop.
544 // If this is a binop, find its precedence.
548 // If this is a binop that binds at least as tightly as the current binop,
553 // Okay, we know this is a binop.
554 int BinOp = CurTok;
555 getNextToken(); // eat binop
562 // If BinOp binds less tightly with RHS than the operator after RHS, let
573 llvm::make_unique<BinaryExprAST>(BinOp, std::move(LHS), std::move(RHS));
799 return Builder.CreateCall(F, Ops, "binop");
[all...] |
