| /src/external/gpl3/gdb/dist/sim/ppc/ |
| dc-stupid | 22 ## Branch Conditional instruction - Expand BO{0:4} only, ignore BO{5}
24 array,expand-forced: 6: 9: 6: 9:BO: 0xfc000000:0x40000000
|
| dc-test.01 | 21 6: 9: 6: 9:0:BO: 0:0xfc000000:0x40000000:1
|
| dc-test.02 | 21 6: 9: 6: 9:0:BO: 0:0xfc000000:0x40000000:1
|
| idecode_fields.h | 98 #define BO_0_ ((BO & BIT5(0)) != 0)
99 #define BO_1_ ((BO & BIT5(1)) != 0)
100 #define BO_2_ ((BO & BIT5(2)) != 0)
101 #define BO_3_ ((BO & BIT5(3)) != 0)
102 #define BO_4_ ((BO & BIT5(4)) != 0)
|
| dc-complex | 22 ## Branch Conditional instruction - Expand BO{0:4}
24 array,expand-forced: 6:10: 6:10:BO: 0xfc000000:0x40000000
|
| /src/external/gpl3/gdb.old/dist/sim/ppc/ |
| dc-stupid | 22 ## Branch Conditional instruction - Expand BO{0:4} only, ignore BO{5}
24 array,expand-forced: 6: 9: 6: 9:BO: 0xfc000000:0x40000000
|
| dc-test.01 | 21 6: 9: 6: 9:0:BO: 0:0xfc000000:0x40000000:1
|
| dc-test.02 | 21 6: 9: 6: 9:0:BO: 0:0xfc000000:0x40000000:1
|
| idecode_fields.h | 98 #define BO_0_ ((BO & BIT5(0)) != 0)
99 #define BO_1_ ((BO & BIT5(1)) != 0)
100 #define BO_2_ ((BO & BIT5(2)) != 0)
101 #define BO_3_ ((BO & BIT5(3)) != 0)
102 #define BO_4_ ((BO & BIT5(4)) != 0)
|
| dc-complex | 22 ## Branch Conditional instruction - Expand BO{0:4}
24 array,expand-forced: 6:10: 6:10:BO: 0xfc000000:0x40000000
|
| /src/external/apache2/llvm/dist/llvm/lib/Target/X86/ |
| X86PartialReduction.cpp | 122 if (auto *BO = dyn_cast<BinaryOperator>(Op)) {
123 if (BO->getParent() == Mul->getParent() &&
124 IsFreeTruncation(BO->getOperand(0)) &&
125 IsFreeTruncation(BO->getOperand(1)) &&
309 const auto *BO = dyn_cast<BinaryOperator>(EE.getVectorOperand());
310 if (!BO || BO->getOpcode() != Instruction::Add || !BO->hasOneUse())
313 unsigned NumElems = cast<FixedVectorType>(BO->getType())->getNumElements();
318 const Value *Op = BO;
[all...] |
| /src/external/apache2/llvm/dist/llvm/include/llvm/IR/ |
| NoFolder.h | 47 BinaryOperator *BO = BinaryOperator::CreateAdd(LHS, RHS);
48 if (HasNUW) BO->setHasNoUnsignedWrap();
49 if (HasNSW) BO->setHasNoSignedWrap();
50 return BO;
60 BinaryOperator *BO = BinaryOperator::CreateSub(LHS, RHS);
61 if (HasNUW) BO->setHasNoUnsignedWrap();
62 if (HasNSW) BO->setHasNoSignedWrap();
63 return BO;
73 BinaryOperator *BO = BinaryOperator::CreateMul(LHS, RHS);
74 if (HasNUW) BO->setHasNoUnsignedWrap()
[all...] |
| InstrTypes.h | 255 BinaryOperator *BO = Create(Opc, V1, V2, Name);
256 BO->copyIRFlags(CopyO);
257 return BO;
288 BinaryOperator *BO = Create(Opc, V1, V2, Name);
289 BO->setHasNoSignedWrap(true);
290 return BO;
294 BinaryOperator *BO = Create(Opc, V1, V2, Name, BB);
295 BO->setHasNoSignedWrap(true);
296 return BO;
300 BinaryOperator *BO = Create(Opc, V1, V2, Name, I)
[all...] |
| /src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| ScalarEvolutionAliasAnalysis.cpp | 83 Value *BO = GetBaseValue(BS);
84 if ((AO && AO != LocA.Ptr) || (BO && BO != LocB.Ptr))
89 MemoryLocation(BO ? BO : LocB.Ptr,
90 BO ? LocationSize::beforeOrAfterPointer()
92 BO ? AAMDNodes() : LocB.AATags),
|
| /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/ |
| SeparateConstOffsetFromGEP.cpp | 270 APInt findInEitherOperand(BinaryOperator *BO, bool SignExtended,
316 /// of binary operator BO for a constant offset.
318 /// \p SignExtended Whether BO is surrounded by sext
319 /// \p ZeroExtended Whether BO is surrounded by zext
320 /// \p NonNegative Whether BO is known to be non-negative, e.g., an in-bound
322 bool CanTraceInto(bool SignExtended, bool ZeroExtended, BinaryOperator *BO,
505 BinaryOperator *BO,
510 if (BO->getOpcode() != Instruction::Add &&
511 BO->getOpcode() != Instruction::Sub &&
512 BO->getOpcode() != Instruction::Or)
[all...] |
| CorrelatedValuePropagation.cpp | 391 static bool willNotOverflow(BinaryOpIntrinsic *BO, LazyValueInfo *LVI) {
392 ConstantRange LRange = LVI->getConstantRange(BO->getLHS(), BO);
393 ConstantRange RRange = LVI->getConstantRange(BO->getRHS(), BO);
395 BO->getBinaryOp(), RRange, BO->getNoWrapKind());
501 if (auto *BO = dyn_cast<BinaryOperator>(NegX))
502 processBinOp(BO, LVI);
542 if (auto *BO = dyn_cast<BinaryOperator>(NewOp)
[all...] |
| Reassociate.cpp | 511 if (BinaryOperator *BO = isReassociableOp(Op, Opcode)) {
514 Worklist.push_back(std::make_pair(BO, Weight));
552 if (BinaryOperator *BO = isReassociableOp(Op, Opcode)) {
554 Worklist.push_back(std::make_pair(BO, It->second));
701 BinaryOperator *BO = isReassociableOp(OldLHS, Opcode);
702 if (BO && !NotRewritable.count(BO))
703 NodesToRewrite.push_back(BO);
707 BinaryOperator *BO = isReassociableOp(OldRHS, Opcode);
708 if (BO && !NotRewritable.count(BO)
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Analysis/ |
| ThreadSafetyCommon.cpp | 479 const BinaryOperator *BO,
481 til::SExpr *E0 = translate(BO->getLHS(), Ctx);
482 til::SExpr *E1 = translate(BO->getRHS(), Ctx);
490 const BinaryOperator *BO,
493 const Expr *LHS = BO->getLHS();
494 const Expr *RHS = BO->getRHS();
515 til::SExpr *SExprBuilder::translateBinaryOperator(const BinaryOperator *BO,
517 switch (BO->getOpcode()) {
520 return new (Arena) til::Undefined(BO);
522 case BO_Mul: return translateBinOp(til::BOP_Mul, BO, Ctx)
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/AST/Interp/ |
| ByteCodeExprGen.cpp | 146 bool ByteCodeExprGen<Emitter>::VisitBinaryOperator(const BinaryOperator *BO) {
147 const Expr *LHS = BO->getLHS();
148 const Expr *RHS = BO->getRHS();
151 switch (BO->getOpcode()) {
166 return this->bail(BO);
169 if (Optional<PrimType> T = classify(BO->getType())) {
175 auto Discard = [this, T, BO](bool Result) {
178 return DiscardResult ? this->emitPop(*T, BO) : true;
181 switch (BO->getOpcode()) {
183 return Discard(this->emitEQ(*LT, BO));
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/Sema/ |
| SemaConcept.cpp | 39 if (auto *BO = dyn_cast<BinaryOperator>(E)) {
40 Op = BinaryOperator::getOverloadedOperator(BO->getOpcode());
41 LHS = BO->getLHS();
42 RHS = BO->getRHS();
67 if (LogicalBinOp BO = ConstraintExpression) {
68 return CheckConstraintExpression(BO.getLHS(), NextToken,
70 CheckConstraintExpression(BO.getRHS(), NextToken,
128 if (LogicalBinOp BO = ConstraintExpr) {
129 if (calculateConstraintSatisfaction(S, BO.getLHS(), Satisfaction,
135 if (BO.isOr() && IsLHSSatisfied
[all...] |
| /src/external/apache2/llvm/dist/clang/lib/ARCMigrate/ |
| TransZeroOutPropsInDealloc.cpp | 151 if (BinaryOperator *BO = dyn_cast<BinaryOperator>(E))
152 return isZeroingPropIvar(BO);
191 BinaryOperator *BO = dyn_cast<BinaryOperator>(PO->getSyntacticForm());
192 if (!BO) return false;
193 if (BO->getOpcode() != BO_Assign) return false;
196 dyn_cast<ObjCPropertyRefExpr>(BO->getLHS()->IgnoreParens());
208 return isZero(cast<OpaqueValueExpr>(BO->getRHS())->getSourceExpr());
|
| /src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/ |
| DirectIvarAssignment.cpp | 76 void VisitBinaryOperator(const BinaryOperator *BO);
166 const BinaryOperator *BO) {
167 if (!BO->isAssignmentOp())
171 dyn_cast<ObjCIvarRefExpr>(BO->getLHS()->IgnoreParenCasts());
|
| InvalidatedIteratorChecker.cpp | 44 void checkPreStmt(const BinaryOperator *BO, CheckerContext &C) const;
89 void InvalidatedIteratorChecker::checkPreStmt(const BinaryOperator *BO,
92 BinaryOperatorKind OK = BO->getOpcode();
93 SVal LVal = State->getSVal(BO->getLHS(), C.getLocationContext());
|
| MismatchedIteratorChecker.cpp | 50 void checkPreStmt(const BinaryOperator *BO, CheckerContext &C) const;
192 void MismatchedIteratorChecker::checkPreStmt(const BinaryOperator *BO,
194 if (!BO->isComparisonOp())
198 SVal LVal = State->getSVal(BO->getLHS(), C.getLocationContext());
199 SVal RVal = State->getSVal(BO->getRHS(), C.getLocationContext());
|
| /src/external/apache2/llvm/dist/llvm/lib/Support/ |
| FormatVariadic.cpp | 97 std::size_t BO = Fmt.find_first_of('{');
98 return std::make_pair(ReplacementItem{Fmt.substr(0, BO)}, Fmt.substr(BO));
|
