OpenGrok
Home
Sort by:
relevance
|
last modified time
|
path
Full Search
in project(s):
src
xsrc
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:BOp
(Results
1 - 10
of
10
) sorted by relevancy
/src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Checkers/
PointerArithChecker.cpp
64
void checkPreStmt(const BinaryOperator *
BOp
, CheckerContext &C) const;
317
void PointerArithChecker::checkPreStmt(const BinaryOperator *
BOp
,
319
BinaryOperatorKind OpKind =
BOp
->getOpcode();
320
if (!
BOp
->isAdditiveOp() && OpKind != BO_AddAssign && OpKind != BO_SubAssign)
323
const Expr *Lhs =
BOp
->getLHS();
324
const Expr *Rhs =
BOp
->getRHS();
331
reportPointerArithMisuse(Lhs, C, !
BOp
->isAdditiveOp());
MallocOverflowSecurityChecker.cpp
190
if (const BinaryOperator *
BOp
= dyn_cast<BinaryOperator>(rhse)) {
191
if (
BOp
->getOpcode() == BO_Div) {
192
const Expr *denom =
BOp
->getRHS()->IgnoreParenImpCasts();
198
const Expr *numerator =
BOp
->getLHS()->IgnoreParenImpCasts();
/src/external/apache2/llvm/dist/llvm/lib/Analysis/
PHITransAddr.cpp
264
if (BinaryOperator *
BOp
= dyn_cast<BinaryOperator>(LHS))
265
if (
BOp
->getOpcode() == Instruction::Add)
266
if (ConstantInt *CI = dyn_cast<ConstantInt>(
BOp
->getOperand(1))) {
267
LHS =
BOp
->getOperand(0);
272
if (is_contained(InstInputs,
BOp
)) {
273
RemoveInstInputs(
BOp
, InstInputs);
IVDescriptors.cpp
939
const SCEV *Step, BinaryOperator *
BOp
,
941
: StartValue(Start), IK(K), Step(Step), InductionBinOp(
BOp
) {
1007
BinaryOperator *
BOp
= dyn_cast<BinaryOperator>(BEValue);
1008
if (!
BOp
)
1012
if (
BOp
->getOpcode() == Instruction::FAdd) {
1013
if (
BOp
->getOperand(0) == Phi)
1014
Addend =
BOp
->getOperand(1);
1015
else if (
BOp
->getOperand(1) == Phi)
1016
Addend =
BOp
->getOperand(0);
1017
} else if (
BOp
->getOpcode() == Instruction::FSub
[
all
...]
BasicAliasAnalysis.cpp
312
if (const BinaryOperator *
BOp
= dyn_cast<BinaryOperator>(Val.V)) {
313
if (ConstantInt *RHSC = dyn_cast<ConstantInt>(
BOp
->getOperand(1))) {
318
if (isa<OverflowingBinaryOperator>(
BOp
)) {
319
NUW &=
BOp
->hasNoUnsignedWrap();
320
NSW &=
BOp
->hasNoSignedWrap();
325
switch (
BOp
->getOpcode()) {
333
if (!MaskedValueIsZero(
BOp
->getOperand(0), RHSC->getValue(), DL, 0, AC,
334
BOp
, DT))
340
Val.withValue(
BOp
->getOperand(0)), DL, Depth + 1, AC, DT);
346
Val.withValue(
BOp
->getOperand(0)), DL, Depth + 1, AC, DT)
[
all
...]
/src/external/apache2/llvm/dist/llvm/lib/CodeGen/GlobalISel/
IRTranslator.cpp
370
if (const CmpInst *
BOp
= dyn_cast<CmpInst>(Cond)) {
379
SwitchCG::CaseBlock CB(Condition, false,
BOp
->getOperand(0),
380
BOp
->getOperand(1), nullptr, TBB, FBB, CurBB,
418
const Instruction *
BOp
= dyn_cast<Instruction>(Cond);
426
if (
BOp
) {
427
BOpc = match(
BOp
, m_LogicalAnd(m_Value(BOpOp0), m_Value(BOpOp1)))
429
: (match(
BOp
, m_LogicalOr(m_Value(BOpOp0), m_Value(BOpOp1)))
442
bool BOpIsInOrAndTree = BOpc && BOpc == Opc &&
BOp
->hasOneUse();
443
if (!BOpIsInOrAndTree ||
BOp
->getParent() != CurBB->getBasicBlock() ||
/src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
Reassociate.cpp
1631
BinaryOperator *
BOp
=
1633
if (!
BOp
)
1638
FindSingleUseMultiplyFactors(
BOp
, Factors);
1703
BinaryOperator *
BOp
=
1705
if (!
BOp
)
/src/external/apache2/llvm/dist/clang/lib/CodeGen/
CodeGenFunction.cpp
1521
const BinaryOperator *
BOp
= dyn_cast<BinaryOperator>(C->IgnoreParens());
1522
return (!
BOp
|| !
BOp
->isLogicalOp());
/src/external/apache2/llvm/dist/llvm/lib/Transforms/InstCombine/
InstCombineAddSub.cpp
1118
if (auto *
BOp
= dyn_cast<BinaryOperator>(NotMask)) {
1120
BOp
->setHasNoSignedWrap();
1121
BOp
->setHasNoUnsignedWrap(I.hasNoUnsignedWrap());
/src/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/
SelectionDAGBuilder.cpp
2145
if (const CmpInst *
BOp
= dyn_cast<CmpInst>(Cond)) {
2150
(isExportableFromCurrentBlock(
BOp
->getOperand(0), BB) &&
2151
isExportableFromCurrentBlock(
BOp
->getOperand(1), BB))) {
2166
CaseBlock CB(Condition,
BOp
->getOperand(0),
BOp
->getOperand(1), nullptr,
2199
const Instruction *
BOp
= dyn_cast<Instruction>(Cond);
2207
if (
BOp
) {
2208
BOpc = match(
BOp
, m_LogicalAnd(m_Value(BOpOp0), m_Value(BOpOp1)))
2210
: (match(
BOp
, m_LogicalOr(m_Value(BOpOp0), m_Value(BOpOp1)))
2223
bool BOpIsInOrAndTree = BOpc && BOpc == Opc &&
BOp
->hasOneUse()
[
all
...]
Completed in 51 milliseconds
Indexes created Wed Jun 17 00:25:26 UTC 2026