forked from OSchip/llvm-project
[analyzer] [NFC] Remove unused parameters, as found by -Wunused-parameter
Differential Revision: https://reviews.llvm.org/D52640 llvm-svn: 343353
This commit is contained in:
parent
c704f4fbd0
commit
c82d457db5
|
@ -58,7 +58,7 @@ public:
|
|||
/// The last parameter can be used to register a new visitor with the given
|
||||
/// BugReport while processing a node.
|
||||
virtual std::shared_ptr<PathDiagnosticPiece>
|
||||
VisitNode(const ExplodedNode *Succ, const ExplodedNode *Pred,
|
||||
VisitNode(const ExplodedNode *Succ,
|
||||
BugReporterContext &BRC, BugReport &BR) = 0;
|
||||
|
||||
/// Last function called on the visitor, no further calls to VisitNode
|
||||
|
@ -107,7 +107,6 @@ public:
|
|||
void Profile(llvm::FoldingSetNodeID &ID) const override;
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override;
|
||||
};
|
||||
|
@ -134,7 +133,6 @@ public:
|
|||
static const char *getTag();
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override;
|
||||
|
||||
|
@ -153,7 +151,6 @@ public:
|
|||
}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override;
|
||||
|
||||
|
@ -179,12 +176,10 @@ public:
|
|||
static const char *getTag();
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *Prev,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override;
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNodeImpl(const ExplodedNode *N,
|
||||
const ExplodedNode *Prev,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR);
|
||||
|
||||
|
@ -237,10 +232,9 @@ public:
|
|||
ID.AddPointer(getTag());
|
||||
}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *Prev,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override {
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *,
|
||||
BugReporterContext &,
|
||||
BugReport &) override {
|
||||
return nullptr;
|
||||
}
|
||||
|
||||
|
@ -267,7 +261,6 @@ public:
|
|||
}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override;
|
||||
};
|
||||
|
@ -297,7 +290,6 @@ public:
|
|||
static const char *getTag();
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *Succ,
|
||||
const ExplodedNode *Pred,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override;
|
||||
};
|
||||
|
@ -311,7 +303,6 @@ public:
|
|||
void Profile(llvm::FoldingSetNodeID &ID) const override {}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *Succ,
|
||||
const ExplodedNode *Pred,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override;
|
||||
};
|
||||
|
@ -327,7 +318,6 @@ public:
|
|||
void Profile(llvm::FoldingSetNodeID &ID) const override { ID.Add(V); }
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override;
|
||||
};
|
||||
|
@ -346,7 +336,6 @@ public:
|
|||
void Profile(llvm::FoldingSetNodeID &ID) const override;
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override;
|
||||
|
||||
|
|
|
@ -632,7 +632,7 @@ public:
|
|||
}
|
||||
|
||||
static std::shared_ptr<PathDiagnosticCallPiece>
|
||||
construct(const ExplodedNode *N, const CallExitEnd &CE,
|
||||
construct(const CallExitEnd &CE,
|
||||
const SourceManager &SM);
|
||||
|
||||
static PathDiagnosticCallPiece *construct(PathPieces &pieces,
|
||||
|
|
|
@ -155,7 +155,7 @@ private:
|
|||
|
||||
public:
|
||||
ExprEngine(cross_tu::CrossTranslationUnitContext &CTU, AnalysisManager &mgr,
|
||||
bool gcEnabled, SetOfConstDecls *VisitedCalleesIn,
|
||||
SetOfConstDecls *VisitedCalleesIn,
|
||||
FunctionSummariesTy *FS, InliningModes HowToInlineIn);
|
||||
|
||||
~ExprEngine() override;
|
||||
|
@ -293,7 +293,7 @@ public:
|
|||
|
||||
/// ProcessBranch - Called by CoreEngine. Used to generate successor
|
||||
/// nodes by processing the 'effects' of a branch condition.
|
||||
void processBranch(const Stmt *Condition, const Stmt *Term,
|
||||
void processBranch(const Stmt *Condition,
|
||||
NodeBuilderContext& BuilderCtx,
|
||||
ExplodedNode *Pred,
|
||||
ExplodedNodeSet &Dst,
|
||||
|
@ -352,7 +352,7 @@ public:
|
|||
void processCallExit(ExplodedNode *Pred) override;
|
||||
|
||||
/// Called by CoreEngine when the analysis worklist has terminated.
|
||||
void processEndWorklist(bool hasWorkRemaining) override;
|
||||
void processEndWorklist() override;
|
||||
|
||||
/// evalAssume - Callback function invoked by the ConstraintManager when
|
||||
/// making assumptions about state values.
|
||||
|
@ -615,7 +615,6 @@ protected:
|
|||
ProgramStateRef State,
|
||||
const InvalidatedSymbols *Invalidated,
|
||||
ArrayRef<const MemRegion *> ExplicitRegions,
|
||||
ArrayRef<const MemRegion *> Regions,
|
||||
const CallEvent *Call,
|
||||
RegionAndSymbolInvalidationTraits &ITraits) override;
|
||||
|
||||
|
@ -683,14 +682,13 @@ private:
|
|||
const ProgramPointTag *tag,
|
||||
QualType LoadTy);
|
||||
|
||||
// FIXME: 'tag' should be removed, and a LocationContext should be used
|
||||
// instead.
|
||||
void evalLocation(ExplodedNodeSet &Dst,
|
||||
const Stmt *NodeEx, /* This will eventually be a CFGStmt */
|
||||
const Stmt *BoundEx,
|
||||
ExplodedNode *Pred,
|
||||
ProgramStateRef St, SVal location,
|
||||
const ProgramPointTag *tag, bool isLoad);
|
||||
ProgramStateRef St,
|
||||
SVal location,
|
||||
bool isLoad);
|
||||
|
||||
/// Count the stack depth and determine if the call is recursive.
|
||||
void examineStackFrames(const Decl *D, const LocationContext *LCtx,
|
||||
|
|
|
@ -471,8 +471,7 @@ public:
|
|||
const LocationContext *CurrentLC = nullptr) const;
|
||||
void printDOT(raw_ostream &Out,
|
||||
const LocationContext *CurrentLC = nullptr) const;
|
||||
void printTaint(raw_ostream &Out, const char *nl = "\n",
|
||||
const char *sep = "") const;
|
||||
void printTaint(raw_ostream &Out, const char *nl = "\n") const;
|
||||
|
||||
void dump() const;
|
||||
void dumpTaint() const;
|
||||
|
|
|
@ -254,8 +254,7 @@ public:
|
|||
virtual bool scanReachableSymbols(Store S, const MemRegion *R,
|
||||
ScanReachableSymbols &Visitor) = 0;
|
||||
|
||||
virtual void print(Store store, raw_ostream &Out,
|
||||
const char* nl, const char *sep) = 0;
|
||||
virtual void print(Store store, raw_ostream &Out, const char* nl) = 0;
|
||||
|
||||
class BindingsHandler {
|
||||
public:
|
||||
|
|
|
@ -72,7 +72,7 @@ public:
|
|||
|
||||
/// Called by CoreEngine. Used to generate successor
|
||||
/// nodes by processing the 'effects' of a branch condition.
|
||||
virtual void processBranch(const Stmt *Condition, const Stmt *Term,
|
||||
virtual void processBranch(const Stmt *Condition,
|
||||
NodeBuilderContext& BuilderCtx,
|
||||
ExplodedNode *Pred,
|
||||
ExplodedNodeSet &Dst,
|
||||
|
@ -156,7 +156,6 @@ public:
|
|||
notifyCheckersOfPointerEscape(ProgramStateRef State,
|
||||
const InvalidatedSymbols *Invalidated,
|
||||
ArrayRef<const MemRegion *> ExplicitRegions,
|
||||
ArrayRef<const MemRegion *> Regions,
|
||||
const CallEvent *Call,
|
||||
RegionAndSymbolInvalidationTraits &HTraits) = 0;
|
||||
|
||||
|
@ -167,7 +166,7 @@ public:
|
|||
|
||||
/// Called by CoreEngine when the analysis worklist is either empty or the
|
||||
// maximum number of analysis steps have been reached.
|
||||
virtual void processEndWorklist(bool hasWorkRemaining) = 0;
|
||||
virtual void processEndWorklist() = 0;
|
||||
};
|
||||
|
||||
} // end GR namespace
|
||||
|
|
|
@ -657,7 +657,7 @@ public:
|
|||
/// The method returns \c true if symbols should continue be scanned and \c
|
||||
/// false otherwise.
|
||||
virtual bool VisitSymbol(SymbolRef sym) = 0;
|
||||
virtual bool VisitMemRegion(const MemRegion *region) { return true; }
|
||||
virtual bool VisitMemRegion(const MemRegion *) { return true; }
|
||||
};
|
||||
|
||||
} // namespace ento
|
||||
|
|
|
@ -47,7 +47,6 @@ class DeleteWithNonVirtualDtorChecker
|
|||
ID.AddPointer(&X);
|
||||
}
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override;
|
||||
|
||||
|
@ -104,7 +103,7 @@ void DeleteWithNonVirtualDtorChecker::checkPreStmt(const CXXDeleteExpr *DE,
|
|||
|
||||
std::shared_ptr<PathDiagnosticPiece>
|
||||
DeleteWithNonVirtualDtorChecker::DeleteBugVisitor::VisitNode(
|
||||
const ExplodedNode *N, const ExplodedNode *PrevN, BugReporterContext &BRC,
|
||||
const ExplodedNode *N, BugReporterContext &BRC,
|
||||
BugReport &BR) {
|
||||
// Stop traversal after the first conversion was found on a path.
|
||||
if (Satisfied)
|
||||
|
|
|
@ -49,7 +49,6 @@ class DynamicTypeChecker : public Checker<check::PostStmt<ImplicitCastExpr>> {
|
|||
}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override;
|
||||
|
||||
|
@ -92,11 +91,10 @@ void DynamicTypeChecker::reportTypeError(QualType DynamicType,
|
|||
|
||||
std::shared_ptr<PathDiagnosticPiece>
|
||||
DynamicTypeChecker::DynamicTypeBugVisitor::VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) {
|
||||
BugReport &) {
|
||||
ProgramStateRef State = N->getState();
|
||||
ProgramStateRef StatePrev = PrevN->getState();
|
||||
ProgramStateRef StatePrev = N->getFirstPred()->getState();
|
||||
|
||||
DynamicTypeInfo TrackedType = getDynamicTypeInfo(State, Reg);
|
||||
DynamicTypeInfo TrackedTypePrev = getDynamicTypeInfo(StatePrev, Reg);
|
||||
|
|
|
@ -85,7 +85,6 @@ class DynamicTypePropagation:
|
|||
}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override;
|
||||
|
||||
|
@ -937,11 +936,10 @@ void DynamicTypePropagation::reportGenericsBug(
|
|||
|
||||
std::shared_ptr<PathDiagnosticPiece>
|
||||
DynamicTypePropagation::GenericsBugVisitor::VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) {
|
||||
ProgramStateRef state = N->getState();
|
||||
ProgramStateRef statePrev = PrevN->getState();
|
||||
ProgramStateRef statePrev = N->getFirstPred()->getState();
|
||||
|
||||
const ObjCObjectPointerType *const *TrackedType =
|
||||
state->get<MostSpecializedTypeArgsMap>(Sym);
|
||||
|
|
|
@ -55,8 +55,7 @@ public:
|
|||
ID.AddPointer(getTag());
|
||||
}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
virtual std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *N,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override;
|
||||
|
||||
|
@ -282,11 +281,10 @@ const MemRegion *getContainerObjRegion(ProgramStateRef State, SymbolRef Sym) {
|
|||
|
||||
std::shared_ptr<PathDiagnosticPiece>
|
||||
InnerPointerChecker::InnerPointerBRVisitor::VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) {
|
||||
BugReport &) {
|
||||
if (!isSymbolTracked(N->getState(), PtrToBuf) ||
|
||||
isSymbolTracked(PrevN->getState(), PtrToBuf))
|
||||
isSymbolTracked(N->getFirstPred()->getState(), PtrToBuf))
|
||||
return nullptr;
|
||||
|
||||
const Stmt *S = PathDiagnosticLocation::getStmt(N);
|
||||
|
|
|
@ -125,7 +125,6 @@ public:
|
|||
}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *Succ,
|
||||
const ExplodedNode *Pred,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override;
|
||||
|
||||
|
@ -1003,7 +1002,6 @@ void NonLocalizedStringChecker::checkPostStmt(const ObjCStringLiteral *SL,
|
|||
|
||||
std::shared_ptr<PathDiagnosticPiece>
|
||||
NonLocalizedStringBRVisitor::VisitNode(const ExplodedNode *Succ,
|
||||
const ExplodedNode *Pred,
|
||||
BugReporterContext &BRC, BugReport &BR) {
|
||||
if (Satisfied)
|
||||
return nullptr;
|
||||
|
|
|
@ -87,7 +87,6 @@ void MPIBugReporter::reportUnmatchedWait(
|
|||
|
||||
std::shared_ptr<PathDiagnosticPiece>
|
||||
MPIBugReporter::RequestNodeVisitor::VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) {
|
||||
|
||||
|
@ -96,13 +95,13 @@ MPIBugReporter::RequestNodeVisitor::VisitNode(const ExplodedNode *N,
|
|||
|
||||
const Request *const Req = N->getState()->get<RequestMap>(RequestRegion);
|
||||
const Request *const PrevReq =
|
||||
PrevN->getState()->get<RequestMap>(RequestRegion);
|
||||
N->getFirstPred()->getState()->get<RequestMap>(RequestRegion);
|
||||
|
||||
// Check if request was previously unused or in a different state.
|
||||
if ((Req && !PrevReq) || (Req->CurrentState != PrevReq->CurrentState)) {
|
||||
IsNodeFound = true;
|
||||
|
||||
ProgramPoint P = PrevN->getLocation();
|
||||
ProgramPoint P = N->getFirstPred()->getLocation();
|
||||
PathDiagnosticLocation L =
|
||||
PathDiagnosticLocation::create(P, BRC.getSourceManager());
|
||||
|
||||
|
|
|
@ -91,7 +91,6 @@ private:
|
|||
}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override;
|
||||
|
||||
|
|
|
@ -135,7 +135,6 @@ private:
|
|||
}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override;
|
||||
};
|
||||
|
@ -573,12 +572,12 @@ void MacOSKeychainAPIChecker::checkDeadSymbols(SymbolReaper &SR,
|
|||
|
||||
std::shared_ptr<PathDiagnosticPiece>
|
||||
MacOSKeychainAPIChecker::SecKeychainBugVisitor::VisitNode(
|
||||
const ExplodedNode *N, const ExplodedNode *PrevN, BugReporterContext &BRC,
|
||||
BugReport &BR) {
|
||||
const ExplodedNode *N, BugReporterContext &BRC, BugReport &BR) {
|
||||
const AllocationState *AS = N->getState()->get<AllocatedData>(Sym);
|
||||
if (!AS)
|
||||
return nullptr;
|
||||
const AllocationState *ASPrev = PrevN->getState()->get<AllocatedData>(Sym);
|
||||
const AllocationState *ASPrev =
|
||||
N->getFirstPred()->getState()->get<AllocatedData>(Sym);
|
||||
if (ASPrev)
|
||||
return nullptr;
|
||||
|
||||
|
|
|
@ -517,7 +517,6 @@ private:
|
|||
}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override;
|
||||
|
||||
|
@ -2889,11 +2888,10 @@ static bool isReferenceCountingPointerDestructor(const CXXDestructorDecl *DD) {
|
|||
}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> MallocChecker::MallocBugVisitor::VisitNode(
|
||||
const ExplodedNode *N, const ExplodedNode *PrevN, BugReporterContext &BRC,
|
||||
BugReport &BR) {
|
||||
const ExplodedNode *N, BugReporterContext &BRC, BugReport &BR) {
|
||||
|
||||
ProgramStateRef state = N->getState();
|
||||
ProgramStateRef statePrev = PrevN->getState();
|
||||
ProgramStateRef statePrev = N->getFirstPred()->getState();
|
||||
|
||||
const RefState *RS = state->get<RegionState>(Sym);
|
||||
const RefState *RSPrev = statePrev->get<RegionState>(Sym);
|
||||
|
|
|
@ -72,7 +72,6 @@ private:
|
|||
}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override;
|
||||
|
||||
|
@ -119,15 +118,14 @@ static bool isAnyBaseRegionReported(ProgramStateRef State,
|
|||
|
||||
std::shared_ptr<PathDiagnosticPiece>
|
||||
MisusedMovedObjectChecker::MovedBugVisitor::VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) {
|
||||
BugReport &) {
|
||||
// We need only the last move of the reported object's region.
|
||||
// The visitor walks the ExplodedGraph backwards.
|
||||
if (Found)
|
||||
return nullptr;
|
||||
ProgramStateRef State = N->getState();
|
||||
ProgramStateRef StatePrev = PrevN->getState();
|
||||
ProgramStateRef StatePrev = N->getFirstPred()->getState();
|
||||
const RegionState *TrackedObject = State->get<TrackedRegionMap>(Region);
|
||||
const RegionState *TrackedObjectPrev =
|
||||
StatePrev->get<TrackedRegionMap>(Region);
|
||||
|
|
|
@ -139,7 +139,6 @@ private:
|
|||
}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override;
|
||||
|
||||
|
@ -293,11 +292,10 @@ NullabilityChecker::getTrackRegion(SVal Val, bool CheckSuperRegion) const {
|
|||
|
||||
std::shared_ptr<PathDiagnosticPiece>
|
||||
NullabilityChecker::NullabilityBugVisitor::VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) {
|
||||
ProgramStateRef State = N->getState();
|
||||
ProgramStateRef StatePrev = PrevN->getState();
|
||||
ProgramStateRef StatePrev = N->getFirstPred()->getState();
|
||||
|
||||
const NullabilityState *TrackedNullab = State->get<NullabilityMap>(Region);
|
||||
const NullabilityState *TrackedNullabPrev =
|
||||
|
|
|
@ -72,7 +72,6 @@ public:
|
|||
Satisfied(false) {}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *Succ,
|
||||
const ExplodedNode *Pred,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override;
|
||||
|
||||
|
@ -247,8 +246,7 @@ ObjCSuperDeallocChecker::isSuperDeallocMessage(const ObjCMethodCall &M) const {
|
|||
|
||||
std::shared_ptr<PathDiagnosticPiece>
|
||||
SuperDeallocBRVisitor::VisitNode(const ExplodedNode *Succ,
|
||||
const ExplodedNode *Pred,
|
||||
BugReporterContext &BRC, BugReport &BR) {
|
||||
BugReporterContext &BRC, BugReport &) {
|
||||
if (Satisfied)
|
||||
return nullptr;
|
||||
|
||||
|
@ -257,7 +255,8 @@ SuperDeallocBRVisitor::VisitNode(const ExplodedNode *Succ,
|
|||
bool CalledNow =
|
||||
Succ->getState()->contains<CalledSuperDealloc>(ReceiverSymbol);
|
||||
bool CalledBefore =
|
||||
Pred->getState()->contains<CalledSuperDealloc>(ReceiverSymbol);
|
||||
Succ->getFirstPred()->getState()->contains<CalledSuperDealloc>(
|
||||
ReceiverSymbol);
|
||||
|
||||
// Is Succ the node on which the analyzer noted that [super dealloc] was
|
||||
// called on ReceiverSymbol?
|
||||
|
|
|
@ -29,7 +29,7 @@ static bool isNumericLiteralExpression(const Expr *E) {
|
|||
}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece>
|
||||
CFRefReportVisitor::VisitNode(const ExplodedNode *N, const ExplodedNode *PrevN,
|
||||
CFRefReportVisitor::VisitNode(const ExplodedNode *N,
|
||||
BugReporterContext &BRC, BugReport &BR) {
|
||||
// FIXME: We will eventually need to handle non-statement-based events
|
||||
// (__attribute__((cleanup))).
|
||||
|
@ -37,7 +37,7 @@ CFRefReportVisitor::VisitNode(const ExplodedNode *N, const ExplodedNode *PrevN,
|
|||
return nullptr;
|
||||
|
||||
// Check if the type state has changed.
|
||||
ProgramStateRef PrevSt = PrevN->getState();
|
||||
ProgramStateRef PrevSt = N->getFirstPred()->getState();
|
||||
ProgramStateRef CurrSt = N->getState();
|
||||
const LocationContext *LCtx = N->getLocationContext();
|
||||
|
||||
|
|
|
@ -121,7 +121,6 @@ public:
|
|||
}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override;
|
||||
|
||||
|
|
|
@ -71,7 +71,6 @@ public:
|
|||
}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *Succ,
|
||||
const ExplodedNode *Pred,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override;
|
||||
};
|
||||
|
@ -95,7 +94,7 @@ public:
|
|||
REGISTER_SET_WITH_PROGRAMSTATE(DivZeroMap, ZeroState)
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece>
|
||||
DivisionBRVisitor::VisitNode(const ExplodedNode *Succ, const ExplodedNode *Pred,
|
||||
DivisionBRVisitor::VisitNode(const ExplodedNode *Succ,
|
||||
BugReporterContext &BRC, BugReport &BR) {
|
||||
if (Satisfied)
|
||||
return nullptr;
|
||||
|
@ -180,7 +179,7 @@ void TestAfterDivZeroChecker::reportBug(SVal Val, CheckerContext &C) const {
|
|||
}
|
||||
}
|
||||
|
||||
void TestAfterDivZeroChecker::checkEndFunction(const ReturnStmt *RS,
|
||||
void TestAfterDivZeroChecker::checkEndFunction(const ReturnStmt *,
|
||||
CheckerContext &C) const {
|
||||
ProgramStateRef State = C.getState();
|
||||
|
||||
|
|
|
@ -90,7 +90,6 @@ private:
|
|||
return std::make_shared<PathDiagnosticEventPiece>(L, BR.getDescription(), false);
|
||||
}
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override;
|
||||
|
||||
|
@ -376,10 +375,10 @@ void ValistChecker::checkVAListEndCall(const CallEvent &Call,
|
|||
}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> ValistChecker::ValistBugVisitor::VisitNode(
|
||||
const ExplodedNode *N, const ExplodedNode *PrevN, BugReporterContext &BRC,
|
||||
const ExplodedNode *N, BugReporterContext &BRC,
|
||||
BugReport &) {
|
||||
ProgramStateRef State = N->getState();
|
||||
ProgramStateRef StatePrev = PrevN->getState();
|
||||
ProgramStateRef StatePrev = N->getFirstPred()->getState();
|
||||
|
||||
const Stmt *S = PathDiagnosticLocation::getStmt(N);
|
||||
if (!S)
|
||||
|
|
|
@ -72,7 +72,6 @@ private:
|
|||
}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override;
|
||||
};
|
||||
|
@ -84,9 +83,8 @@ REGISTER_MAP_WITH_PROGRAMSTATE(CtorDtorMap, const MemRegion *, ObjectState)
|
|||
|
||||
std::shared_ptr<PathDiagnosticPiece>
|
||||
VirtualCallChecker::VirtualBugVisitor::VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) {
|
||||
BugReport &) {
|
||||
// We need the last ctor/dtor which call the virtual function.
|
||||
// The visitor walks the ExplodedGraph backwards.
|
||||
if (Found)
|
||||
|
|
|
@ -861,8 +861,7 @@ static void reversePropagateIntererstingSymbols(BugReport &R,
|
|||
static void reversePropagateInterestingSymbols(BugReport &R,
|
||||
InterestingExprs &IE,
|
||||
const ProgramState *State,
|
||||
const LocationContext *CalleeCtx,
|
||||
const LocationContext *CallerCtx)
|
||||
const LocationContext *CalleeCtx)
|
||||
{
|
||||
// FIXME: Handle non-CallExpr-based CallEvents.
|
||||
const StackFrameContext *Callee = CalleeCtx->getStackFrame();
|
||||
|
@ -967,8 +966,7 @@ static bool isInLoopBody(ParentMap &PM, const Stmt *S, const Stmt *Term) {
|
|||
/// Adds a sanitized control-flow diagnostic edge to a path.
|
||||
static void addEdgeToPath(PathPieces &path,
|
||||
PathDiagnosticLocation &PrevLoc,
|
||||
PathDiagnosticLocation NewLoc,
|
||||
const LocationContext *LC) {
|
||||
PathDiagnosticLocation NewLoc) {
|
||||
if (!NewLoc.isValid())
|
||||
return;
|
||||
|
||||
|
@ -1043,7 +1041,7 @@ static void generatePathDiagnosticsForNode(const ExplodedNode *N,
|
|||
// not from declaration.
|
||||
if (D->hasBody())
|
||||
addEdgeToPath(PD.getActivePath(), PrevLoc,
|
||||
PathDiagnosticLocation::createBegin(D, SM), CalleeLC);
|
||||
PathDiagnosticLocation::createBegin(D, SM));
|
||||
}
|
||||
|
||||
// Did we visit an entire call?
|
||||
|
@ -1108,7 +1106,7 @@ static void generatePathDiagnosticsForNode(const ExplodedNode *N,
|
|||
|
||||
// We are descending into a call (backwards). Construct
|
||||
// a new call piece to contain the path pieces for that call.
|
||||
auto C = PathDiagnosticCallPiece::construct(N, *CE, SM);
|
||||
auto C = PathDiagnosticCallPiece::construct(*CE, SM);
|
||||
// Record the mapping from call piece to LocationContext.
|
||||
LCM[&C->path] = CE->getCalleeContext();
|
||||
|
||||
|
@ -1121,7 +1119,7 @@ static void generatePathDiagnosticsForNode(const ExplodedNode *N,
|
|||
N->getLocationContext());
|
||||
}
|
||||
// Add the edge to the return site.
|
||||
addEdgeToPath(PD.getActivePath(), PrevLoc, C->callReturn, PDB.LC);
|
||||
addEdgeToPath(PD.getActivePath(), PrevLoc, C->callReturn);
|
||||
PrevLoc.invalidate();
|
||||
}
|
||||
|
||||
|
@ -1151,7 +1149,7 @@ static void generatePathDiagnosticsForNode(const ExplodedNode *N,
|
|||
if (!isa<ObjCForCollectionStmt>(PS->getStmt())) {
|
||||
PathDiagnosticLocation L =
|
||||
PathDiagnosticLocation(PS->getStmt(), SM, PDB.LC);
|
||||
addEdgeToPath(PD.getActivePath(), PrevLoc, L, PDB.LC);
|
||||
addEdgeToPath(PD.getActivePath(), PrevLoc, L);
|
||||
}
|
||||
|
||||
} else if (auto BE = P.getAs<BlockEdge>()) {
|
||||
|
@ -1168,8 +1166,7 @@ static void generatePathDiagnosticsForNode(const ExplodedNode *N,
|
|||
const LocationContext *CalleeCtx = PDB.LC;
|
||||
if (CallerCtx != CalleeCtx && AddPathEdges) {
|
||||
reversePropagateInterestingSymbols(*PDB.getBugReport(), IE,
|
||||
N->getState().get(),
|
||||
CalleeCtx, CallerCtx);
|
||||
N->getState().get(), CalleeCtx);
|
||||
}
|
||||
}
|
||||
|
||||
|
@ -1194,13 +1191,12 @@ static void generatePathDiagnosticsForNode(const ExplodedNode *N,
|
|||
"of the loop");
|
||||
p->setPrunable(true);
|
||||
|
||||
addEdgeToPath(PD.getActivePath(), PrevLoc, p->getLocation(), PDB.LC);
|
||||
addEdgeToPath(PD.getActivePath(), PrevLoc, p->getLocation());
|
||||
PD.getActivePath().push_front(std::move(p));
|
||||
|
||||
if (const auto *CS = dyn_cast_or_null<CompoundStmt>(Body)) {
|
||||
addEdgeToPath(PD.getActivePath(), PrevLoc,
|
||||
PathDiagnosticLocation::createEndBrace(CS, SM),
|
||||
PDB.LC);
|
||||
PathDiagnosticLocation::createEndBrace(CS, SM));
|
||||
}
|
||||
}
|
||||
|
||||
|
@ -1236,13 +1232,13 @@ static void generatePathDiagnosticsForNode(const ExplodedNode *N,
|
|||
auto PE = std::make_shared<PathDiagnosticEventPiece>(L, str);
|
||||
PE->setPrunable(true);
|
||||
addEdgeToPath(PD.getActivePath(), PrevLoc,
|
||||
PE->getLocation(), PDB.LC);
|
||||
PE->getLocation());
|
||||
PD.getActivePath().push_front(std::move(PE));
|
||||
}
|
||||
} else if (isa<BreakStmt>(Term) || isa<ContinueStmt>(Term) ||
|
||||
isa<GotoStmt>(Term)) {
|
||||
PathDiagnosticLocation L(Term, SM, PDB.LC);
|
||||
addEdgeToPath(PD.getActivePath(), PrevLoc, L, PDB.LC);
|
||||
addEdgeToPath(PD.getActivePath(), PrevLoc, L);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
@ -1540,8 +1536,7 @@ static Optional<size_t> getLengthOnSingleLine(SourceManager &SM,
|
|||
/// - if there is an inlined call between the edges instead of a single event.
|
||||
/// - if the whole statement is large enough that having subexpression arrows
|
||||
/// might be helpful.
|
||||
static void removeContextCycles(PathPieces &Path, SourceManager &SM,
|
||||
ParentMap &PM) {
|
||||
static void removeContextCycles(PathPieces &Path, SourceManager &SM) {
|
||||
for (PathPieces::iterator I = Path.begin(), E = Path.end(); I != E; ) {
|
||||
// Pattern match the current piece and its successor.
|
||||
const auto *PieceI = dyn_cast<PathDiagnosticControlFlowPiece>(I->get());
|
||||
|
@ -1844,7 +1839,7 @@ static bool optimizeEdges(PathPieces &path, SourceManager &SM,
|
|||
// and aesthetically pleasing.
|
||||
addContextEdges(path, SM, PM, LC);
|
||||
// Remove "cyclical" edges that include one or more context edges.
|
||||
removeContextCycles(path, SM, PM);
|
||||
removeContextCycles(path, SM);
|
||||
// Hoist edges originating from branch conditions to branches
|
||||
// for simple branches.
|
||||
simplifySimpleBranches(path);
|
||||
|
@ -1962,8 +1957,7 @@ static std::unique_ptr<PathDiagnostic> generatePathDiagnosticForConsumer(
|
|||
continue;
|
||||
|
||||
if (AddPathEdges)
|
||||
addEdgeToPath(PD->getActivePath(), PrevLoc, Note->getLocation(),
|
||||
PDB.LC);
|
||||
addEdgeToPath(PD->getActivePath(), PrevLoc, Note->getLocation());
|
||||
updateStackPiecesWithMessage(*Note, CallStack);
|
||||
PD->getActivePath().push_front(Note);
|
||||
}
|
||||
|
@ -1975,7 +1969,7 @@ static std::unique_ptr<PathDiagnostic> generatePathDiagnosticForConsumer(
|
|||
const StackFrameContext *CalleeLC = PDB.LC->getStackFrame();
|
||||
const Decl *D = CalleeLC->getDecl();
|
||||
addEdgeToPath(PD->getActivePath(), PrevLoc,
|
||||
PathDiagnosticLocation::createBegin(D, SM), CalleeLC);
|
||||
PathDiagnosticLocation::createBegin(D, SM));
|
||||
}
|
||||
|
||||
if (!AddPathEdges && GenerateDiagnostics)
|
||||
|
@ -2574,7 +2568,7 @@ generateVisitorsDiagnostics(BugReport *R, const ExplodedNode *ErrorNode,
|
|||
}
|
||||
|
||||
for (auto &V : visitors) {
|
||||
auto P = V->VisitNode(NextNode, Pred, BRC, *R);
|
||||
auto P = V->VisitNode(NextNode, BRC, *R);
|
||||
if (P)
|
||||
(*Notes)[NextNode].push_back(std::move(P));
|
||||
}
|
||||
|
|
|
@ -179,15 +179,14 @@ const Stmt *bugreporter::GetRetValExpr(const ExplodedNode *N) {
|
|||
//===----------------------------------------------------------------------===//
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece>
|
||||
BugReporterVisitor::getEndPath(BugReporterContext &BRC,
|
||||
const ExplodedNode *EndPathNode, BugReport &BR) {
|
||||
BugReporterVisitor::getEndPath(BugReporterContext &,
|
||||
const ExplodedNode *, BugReport &) {
|
||||
return nullptr;
|
||||
}
|
||||
|
||||
void
|
||||
BugReporterVisitor::finalizeVisitor(BugReporterContext &BRC,
|
||||
const ExplodedNode *EndPathNode,
|
||||
BugReport &BR) {}
|
||||
BugReporterVisitor::finalizeVisitor(BugReporterContext &,
|
||||
const ExplodedNode *, BugReport &) {}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> BugReporterVisitor::getDefaultEndPath(
|
||||
BugReporterContext &BRC, const ExplodedNode *EndPathNode, BugReport &BR) {
|
||||
|
@ -303,9 +302,8 @@ public:
|
|||
}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override {
|
||||
BugReporterContext &BR,
|
||||
BugReport &) override {
|
||||
|
||||
const LocationContext *Ctx = N->getLocationContext();
|
||||
const StackFrameContext *SCtx = Ctx->getStackFrame();
|
||||
|
@ -317,7 +315,7 @@ public:
|
|||
return nullptr;
|
||||
|
||||
CallEventRef<> Call =
|
||||
BRC.getStateManager().getCallEventManager().getCaller(SCtx, State);
|
||||
BR.getStateManager().getCallEventManager().getCaller(SCtx, State);
|
||||
|
||||
if (SM.isInSystemHeader(Call->getDecl()->getSourceRange().getBegin()))
|
||||
return nullptr;
|
||||
|
@ -668,7 +666,6 @@ public:
|
|||
ValueAtDereference(V) {}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override {
|
||||
if (WasModified)
|
||||
|
@ -679,7 +676,7 @@ public:
|
|||
return nullptr;
|
||||
|
||||
const SourceManager &SMgr = BRC.getSourceManager();
|
||||
if (auto Loc = matchAssignment(N, BRC)) {
|
||||
if (auto Loc = matchAssignment(N)) {
|
||||
if (isFunctionMacroExpansion(*Loc, SMgr)) {
|
||||
std::string MacroName = getMacroName(*Loc, BRC);
|
||||
SourceLocation BugLoc = BugPoint->getStmt()->getBeginLoc();
|
||||
|
@ -717,8 +714,7 @@ public:
|
|||
private:
|
||||
/// \return Source location of right hand side of an assignment
|
||||
/// into \c RegionOfInterest, empty optional if none found.
|
||||
Optional<SourceLocation> matchAssignment(const ExplodedNode *N,
|
||||
BugReporterContext &BRC) {
|
||||
Optional<SourceLocation> matchAssignment(const ExplodedNode *N) {
|
||||
const Stmt *S = PathDiagnosticLocation::getStmt(N);
|
||||
ProgramStateRef State = N->getState();
|
||||
auto *LCtx = N->getLocationContext();
|
||||
|
@ -843,7 +839,7 @@ public:
|
|||
}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece>
|
||||
visitNodeInitial(const ExplodedNode *N, const ExplodedNode *PrevN,
|
||||
visitNodeInitial(const ExplodedNode *N,
|
||||
BugReporterContext &BRC, BugReport &BR) {
|
||||
// Only print a message at the interesting return statement.
|
||||
if (N->getLocationContext() != StackFrame)
|
||||
|
@ -946,7 +942,7 @@ public:
|
|||
}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece>
|
||||
visitNodeMaybeUnsuppress(const ExplodedNode *N, const ExplodedNode *PrevN,
|
||||
visitNodeMaybeUnsuppress(const ExplodedNode *N,
|
||||
BugReporterContext &BRC, BugReport &BR) {
|
||||
#ifndef NDEBUG
|
||||
assert(Options.shouldAvoidSuppressingNullArgumentPaths());
|
||||
|
@ -996,14 +992,13 @@ public:
|
|||
}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece> VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) override {
|
||||
switch (Mode) {
|
||||
case Initial:
|
||||
return visitNodeInitial(N, PrevN, BRC, BR);
|
||||
return visitNodeInitial(N, BRC, BR);
|
||||
case MaybeUnsuppress:
|
||||
return visitNodeMaybeUnsuppress(N, PrevN, BRC, BR);
|
||||
return visitNodeMaybeUnsuppress(N, BRC, BR);
|
||||
case Satisfied:
|
||||
return nullptr;
|
||||
}
|
||||
|
@ -1011,7 +1006,7 @@ public:
|
|||
llvm_unreachable("Invalid visit mode!");
|
||||
}
|
||||
|
||||
void finalizeVisitor(BugReporterContext &BRC, const ExplodedNode *N,
|
||||
void finalizeVisitor(BugReporterContext &, const ExplodedNode *,
|
||||
BugReport &BR) override {
|
||||
if (EnableNullFPSuppression && ShouldInvalidate)
|
||||
BR.markInvalid(ReturnVisitor::getTag(), StackFrame);
|
||||
|
@ -1177,12 +1172,12 @@ static void showBRDefaultDiagnostics(llvm::raw_svector_ostream& os,
|
|||
|
||||
std::shared_ptr<PathDiagnosticPiece>
|
||||
FindLastStoreBRVisitor::VisitNode(const ExplodedNode *Succ,
|
||||
const ExplodedNode *Pred,
|
||||
BugReporterContext &BRC, BugReport &BR) {
|
||||
if (Satisfied)
|
||||
return nullptr;
|
||||
|
||||
const ExplodedNode *StoreSite = nullptr;
|
||||
const ExplodedNode *Pred = Succ->getFirstPred();
|
||||
const Expr *InitE = nullptr;
|
||||
bool IsParam = false;
|
||||
|
||||
|
@ -1348,8 +1343,8 @@ bool TrackConstraintBRVisitor::isUnderconstrained(const ExplodedNode *N) const {
|
|||
|
||||
std::shared_ptr<PathDiagnosticPiece>
|
||||
TrackConstraintBRVisitor::VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC, BugReport &BR) {
|
||||
BugReporterContext &BRC, BugReport &) {
|
||||
const ExplodedNode *PrevN = N->getFirstPred();
|
||||
if (IsSatisfied)
|
||||
return nullptr;
|
||||
|
||||
|
@ -1424,9 +1419,9 @@ const char *SuppressInlineDefensiveChecksVisitor::getTag() {
|
|||
|
||||
std::shared_ptr<PathDiagnosticPiece>
|
||||
SuppressInlineDefensiveChecksVisitor::VisitNode(const ExplodedNode *Succ,
|
||||
const ExplodedNode *Pred,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) {
|
||||
const ExplodedNode *Pred = Succ->getFirstPred();
|
||||
if (IsSatisfied)
|
||||
return nullptr;
|
||||
|
||||
|
@ -1730,7 +1725,6 @@ const Expr *NilReceiverBRVisitor::getNilReceiver(const Stmt *S,
|
|||
|
||||
std::shared_ptr<PathDiagnosticPiece>
|
||||
NilReceiverBRVisitor::VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC, BugReport &BR) {
|
||||
Optional<PreStmt> P = N->getLocationAs<PreStmt>();
|
||||
if (!P)
|
||||
|
@ -1811,9 +1805,9 @@ const char *ConditionBRVisitor::getTag() {
|
|||
}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece>
|
||||
ConditionBRVisitor::VisitNode(const ExplodedNode *N, const ExplodedNode *Prev,
|
||||
ConditionBRVisitor::VisitNode(const ExplodedNode *N,
|
||||
BugReporterContext &BRC, BugReport &BR) {
|
||||
auto piece = VisitNodeImpl(N, Prev, BRC, BR);
|
||||
auto piece = VisitNodeImpl(N, BRC, BR);
|
||||
if (piece) {
|
||||
piece->setTag(getTag());
|
||||
if (auto *ev = dyn_cast<PathDiagnosticEventPiece>(piece.get()))
|
||||
|
@ -1824,11 +1818,10 @@ ConditionBRVisitor::VisitNode(const ExplodedNode *N, const ExplodedNode *Prev,
|
|||
|
||||
std::shared_ptr<PathDiagnosticPiece>
|
||||
ConditionBRVisitor::VisitNodeImpl(const ExplodedNode *N,
|
||||
const ExplodedNode *Prev,
|
||||
BugReporterContext &BRC, BugReport &BR) {
|
||||
ProgramPoint progPoint = N->getLocation();
|
||||
ProgramStateRef CurrentState = N->getState();
|
||||
ProgramStateRef PrevState = Prev->getState();
|
||||
ProgramStateRef PrevState = N->getFirstPred()->getState();
|
||||
|
||||
// Compare the GDMs of the state, because that is where constraints
|
||||
// are managed. Note that ensure that we only look at nodes that
|
||||
|
@ -2320,7 +2313,6 @@ void LikelyFalsePositiveSuppressionBRVisitor::finalizeVisitor(
|
|||
|
||||
std::shared_ptr<PathDiagnosticPiece>
|
||||
UndefOrNullArgVisitor::VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC, BugReport &BR) {
|
||||
ProgramStateRef State = N->getState();
|
||||
ProgramPoint ProgLoc = N->getLocation();
|
||||
|
@ -2371,8 +2363,7 @@ UndefOrNullArgVisitor::VisitNode(const ExplodedNode *N,
|
|||
|
||||
std::shared_ptr<PathDiagnosticPiece>
|
||||
CXXSelfAssignmentBRVisitor::VisitNode(const ExplodedNode *Succ,
|
||||
const ExplodedNode *Pred,
|
||||
BugReporterContext &BRC, BugReport &BR) {
|
||||
BugReporterContext &BRC, BugReport &) {
|
||||
if (Satisfied)
|
||||
return nullptr;
|
||||
|
||||
|
@ -2423,11 +2414,11 @@ CXXSelfAssignmentBRVisitor::VisitNode(const ExplodedNode *Succ,
|
|||
}
|
||||
|
||||
std::shared_ptr<PathDiagnosticPiece>
|
||||
TaintBugVisitor::VisitNode(const ExplodedNode *N, const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC, BugReport &BR) {
|
||||
TaintBugVisitor::VisitNode(const ExplodedNode *N,
|
||||
BugReporterContext &BRC, BugReport &) {
|
||||
|
||||
// Find the ExplodedNode where the taint was first introduced
|
||||
if (!N->getState()->isTainted(V) || PrevN->getState()->isTainted(V))
|
||||
if (!N->getState()->isTainted(V) || N->getFirstPred()->getState()->isTainted(V))
|
||||
return nullptr;
|
||||
|
||||
const Stmt *S = PathDiagnosticLocation::getStmt(N);
|
||||
|
@ -2449,7 +2440,7 @@ FalsePositiveRefutationBRVisitor::FalsePositiveRefutationBRVisitor()
|
|||
void FalsePositiveRefutationBRVisitor::finalizeVisitor(
|
||||
BugReporterContext &BRC, const ExplodedNode *EndPathNode, BugReport &BR) {
|
||||
// Collect new constraints
|
||||
VisitNode(EndPathNode, nullptr, BRC, BR);
|
||||
VisitNode(EndPathNode, BRC, BR);
|
||||
|
||||
// Create a refutation manager
|
||||
SMTSolverRef RefutationSolver = CreateZ3Solver();
|
||||
|
@ -2480,9 +2471,8 @@ void FalsePositiveRefutationBRVisitor::finalizeVisitor(
|
|||
|
||||
std::shared_ptr<PathDiagnosticPiece>
|
||||
FalsePositiveRefutationBRVisitor::VisitNode(const ExplodedNode *N,
|
||||
const ExplodedNode *PrevN,
|
||||
BugReporterContext &BRC,
|
||||
BugReport &BR) {
|
||||
BugReporterContext &,
|
||||
BugReport &) {
|
||||
// Collect new constraints
|
||||
const ConstraintRangeTy &NewCs = N->getState()->get<ConstraintRange>();
|
||||
ConstraintRangeTy::Factory &CF =
|
||||
|
|
|
@ -146,7 +146,7 @@ bool CoreEngine::ExecuteWorkList(const LocationContext *L, unsigned Steps,
|
|||
|
||||
dispatchWorkItem(Node, Node->getLocation(), WU);
|
||||
}
|
||||
SubEng.processEndWorklist(hasWorkRemaining());
|
||||
SubEng.processEndWorklist();
|
||||
return WList->hasWork();
|
||||
}
|
||||
|
||||
|
@ -396,8 +396,8 @@ void CoreEngine::HandleBranch(const Stmt *Cond, const Stmt *Term,
|
|||
assert(B->succ_size() == 2);
|
||||
NodeBuilderContext Ctx(*this, B, Pred);
|
||||
ExplodedNodeSet Dst;
|
||||
SubEng.processBranch(Cond, Term, Ctx, Pred, Dst,
|
||||
*(B->succ_begin()), *(B->succ_begin()+1));
|
||||
SubEng.processBranch(Cond, Ctx, Pred, Dst, *(B->succ_begin()),
|
||||
*(B->succ_begin() + 1));
|
||||
// Enqueue the new frontier onto the worklist.
|
||||
enqueue(Dst);
|
||||
}
|
||||
|
|
|
@ -177,7 +177,7 @@ REGISTER_TRAIT_WITH_PROGRAMSTATE(ObjectsUnderConstruction,
|
|||
static const char* TagProviderName = "ExprEngine";
|
||||
|
||||
ExprEngine::ExprEngine(cross_tu::CrossTranslationUnitContext &CTU,
|
||||
AnalysisManager &mgr, bool gcEnabled,
|
||||
AnalysisManager &mgr,
|
||||
SetOfConstDecls *VisitedCalleesIn,
|
||||
FunctionSummariesTy *FS,
|
||||
InliningModes HowToInlineIn)
|
||||
|
@ -531,7 +531,6 @@ ExprEngine::processRegionChanges(ProgramStateRef state,
|
|||
static void printObjectsUnderConstructionForContext(raw_ostream &Out,
|
||||
ProgramStateRef State,
|
||||
const char *NL,
|
||||
const char *Sep,
|
||||
const LocationContext *LC) {
|
||||
PrintingPolicy PP =
|
||||
LC->getAnalysisDeclContext()->getASTContext().getPrintingPolicy();
|
||||
|
@ -553,7 +552,7 @@ void ExprEngine::printState(raw_ostream &Out, ProgramStateRef State,
|
|||
Out << Sep << "Objects under construction:" << NL;
|
||||
|
||||
LCtx->dumpStack(Out, "", NL, Sep, [&](const LocationContext *LC) {
|
||||
printObjectsUnderConstructionForContext(Out, State, NL, Sep, LC);
|
||||
printObjectsUnderConstructionForContext(Out, State, NL, LC);
|
||||
});
|
||||
}
|
||||
}
|
||||
|
@ -561,7 +560,7 @@ void ExprEngine::printState(raw_ostream &Out, ProgramStateRef State,
|
|||
getCheckerManager().runCheckersForPrintState(Out, State, NL, Sep);
|
||||
}
|
||||
|
||||
void ExprEngine::processEndWorklist(bool hasWorkRemaining) {
|
||||
void ExprEngine::processEndWorklist() {
|
||||
getCheckerManager().runCheckersForEndAnalysis(G, BR, *this);
|
||||
}
|
||||
|
||||
|
@ -1128,7 +1127,7 @@ ProgramStateRef ExprEngine::escapeValue(ProgramStateRef State, SVal V,
|
|||
InvalidatedSymbols Symbols;
|
||||
|
||||
public:
|
||||
explicit CollectReachableSymbolsCallback(ProgramStateRef State) {}
|
||||
explicit CollectReachableSymbolsCallback(ProgramStateRef) {}
|
||||
|
||||
const InvalidatedSymbols &getSymbols() const { return Symbols; }
|
||||
|
||||
|
@ -1930,8 +1929,7 @@ void ExprEngine::processCFGBlockEntrance(const BlockEdge &L,
|
|||
/// integers that promote their values (which are currently not tracked well).
|
||||
/// This function returns the SVal bound to Condition->IgnoreCasts if all the
|
||||
// cast(s) did was sign-extend the original value.
|
||||
static SVal RecoverCastedSymbol(ProgramStateManager& StateMgr,
|
||||
ProgramStateRef state,
|
||||
static SVal RecoverCastedSymbol(ProgramStateRef state,
|
||||
const Stmt *Condition,
|
||||
const LocationContext *LCtx,
|
||||
ASTContext &Ctx) {
|
||||
|
@ -2028,7 +2026,7 @@ static const Stmt *ResolveCondition(const Stmt *Condition,
|
|||
llvm_unreachable("could not resolve condition");
|
||||
}
|
||||
|
||||
void ExprEngine::processBranch(const Stmt *Condition, const Stmt *Term,
|
||||
void ExprEngine::processBranch(const Stmt *Condition,
|
||||
NodeBuilderContext& BldCtx,
|
||||
ExplodedNode *Pred,
|
||||
ExplodedNodeSet &Dst,
|
||||
|
@ -2079,8 +2077,7 @@ void ExprEngine::processBranch(const Stmt *Condition, const Stmt *Term,
|
|||
// integers that promote their values are currently not tracked well.
|
||||
// If 'Condition' is such an expression, try and recover the
|
||||
// underlying value and use that instead.
|
||||
SVal recovered = RecoverCastedSymbol(getStateManager(),
|
||||
PrevState, Condition,
|
||||
SVal recovered = RecoverCastedSymbol(PrevState, Condition,
|
||||
PredI->getLocationContext(),
|
||||
getContext());
|
||||
|
||||
|
@ -2665,7 +2662,6 @@ ProgramStateRef
|
|||
ExprEngine::notifyCheckersOfPointerEscape(ProgramStateRef State,
|
||||
const InvalidatedSymbols *Invalidated,
|
||||
ArrayRef<const MemRegion *> ExplicitRegions,
|
||||
ArrayRef<const MemRegion *> Regions,
|
||||
const CallEvent *Call,
|
||||
RegionAndSymbolInvalidationTraits &ITraits) {
|
||||
if (!Invalidated || Invalidated->empty())
|
||||
|
@ -2775,7 +2771,7 @@ void ExprEngine::evalStore(ExplodedNodeSet &Dst, const Expr *AssignE,
|
|||
|
||||
// Evaluate the location (checks for bad dereferences).
|
||||
ExplodedNodeSet Tmp;
|
||||
evalLocation(Tmp, AssignE, LocationE, Pred, state, location, tag, false);
|
||||
evalLocation(Tmp, AssignE, LocationE, Pred, state, location, false);
|
||||
|
||||
if (Tmp.empty())
|
||||
return;
|
||||
|
@ -2800,7 +2796,7 @@ void ExprEngine::evalLoad(ExplodedNodeSet &Dst,
|
|||
assert(BoundEx);
|
||||
// Evaluate the location (checks for bad dereferences).
|
||||
ExplodedNodeSet Tmp;
|
||||
evalLocation(Tmp, NodeEx, BoundEx, Pred, state, location, tag, true);
|
||||
evalLocation(Tmp, NodeEx, BoundEx, Pred, state, location, true);
|
||||
if (Tmp.empty())
|
||||
return;
|
||||
|
||||
|
@ -2831,7 +2827,6 @@ void ExprEngine::evalLocation(ExplodedNodeSet &Dst,
|
|||
ExplodedNode *Pred,
|
||||
ProgramStateRef state,
|
||||
SVal location,
|
||||
const ProgramPointTag *tag,
|
||||
bool isLoad) {
|
||||
StmtNodeBuilder BldrTop(Pred, Dst, *currBldrCtx);
|
||||
// Early checks for performance reason.
|
||||
|
@ -2999,7 +2994,7 @@ struct DOTGraphTraits<ExplodedGraph*> : public DefaultDOTGraphTraits {
|
|||
}
|
||||
|
||||
static std::string getNodeAttributes(const ExplodedNode *N,
|
||||
ExplodedGraph *G) {
|
||||
ExplodedGraph *) {
|
||||
SmallVector<StringRef, 10> Out;
|
||||
auto Noop = [](const ExplodedNode*){};
|
||||
if (traverseHiddenNodes(N, Noop, Noop, &nodeHasBugReport)) {
|
||||
|
@ -3035,8 +3030,8 @@ struct DOTGraphTraits<ExplodedGraph*> : public DefaultDOTGraphTraits {
|
|||
if (nodeHasBugReport(N))
|
||||
Out << "\\lBug report attached\\l";
|
||||
},
|
||||
[&](const ExplodedNode *OtherNode) { Out << "\\l--------\\l"; },
|
||||
[&](const ExplodedNode *N) { return false; });
|
||||
[&](const ExplodedNode *) { Out << "\\l--------\\l"; },
|
||||
[&](const ExplodedNode *) { return false; });
|
||||
|
||||
Out << "\\l\\|";
|
||||
|
||||
|
|
|
@ -129,7 +129,7 @@ void ExprEngine::VisitObjCForCollectionStmt(const ObjCForCollectionStmt *S,
|
|||
bool isContainerNull = state->isNull(collectionV).isConstrainedTrue();
|
||||
|
||||
ExplodedNodeSet dstLocation;
|
||||
evalLocation(dstLocation, S, elem, Pred, state, elementV, nullptr, false);
|
||||
evalLocation(dstLocation, S, elem, Pred, state, elementV, false);
|
||||
|
||||
ExplodedNodeSet Tmp;
|
||||
StmtNodeBuilder Bldr(Pred, Tmp, *currBldrCtx);
|
||||
|
|
|
@ -112,8 +112,7 @@ public:
|
|||
FileID FID, const FileEntry *Entry, const char *declName);
|
||||
|
||||
// Rewrite the file specified by FID with HTML formatting.
|
||||
void RewriteFile(Rewriter &R, const SourceManager& SMgr,
|
||||
const PathPieces& path, FileID FID);
|
||||
void RewriteFile(Rewriter &R, const PathPieces& path, FileID FID);
|
||||
|
||||
|
||||
private:
|
||||
|
@ -279,7 +278,7 @@ std::string HTMLDiagnostics::GenerateHTML(const PathDiagnostic& D, Rewriter &R,
|
|||
continue;
|
||||
|
||||
FileIDs.push_back(FID);
|
||||
RewriteFile(R, SMgr, path, FID);
|
||||
RewriteFile(R, path, FID);
|
||||
}
|
||||
|
||||
if (SupportsCrossFileDiagnostics && FileIDs.size() > 1) {
|
||||
|
@ -607,8 +606,8 @@ window.addEventListener("keydown", function (event) {
|
|||
)<<<";
|
||||
}
|
||||
|
||||
void HTMLDiagnostics::RewriteFile(Rewriter &R, const SourceManager& SMgr,
|
||||
const PathPieces& path, FileID FID) {
|
||||
void HTMLDiagnostics::RewriteFile(Rewriter &R,
|
||||
const PathPieces& path, FileID FID) {
|
||||
// Process the path.
|
||||
// Maintain the counts of extra note pieces separately.
|
||||
unsigned TotalPieces = path.size();
|
||||
|
|
|
@ -597,7 +597,7 @@ void MemRegion::printPretty(raw_ostream &os) const {
|
|||
os << "'";
|
||||
}
|
||||
|
||||
void MemRegion::printPrettyAsExpr(raw_ostream &os) const {
|
||||
void MemRegion::printPrettyAsExpr(raw_ostream &) const {
|
||||
llvm_unreachable("This region cannot be printed pretty.");
|
||||
}
|
||||
|
||||
|
@ -1175,7 +1175,7 @@ const MemRegion *MemRegion::getBaseRegion() const {
|
|||
return R;
|
||||
}
|
||||
|
||||
bool MemRegion::isSubRegionOf(const MemRegion *R) const {
|
||||
bool MemRegion::isSubRegionOf(const MemRegion *) const {
|
||||
return false;
|
||||
}
|
||||
|
||||
|
|
|
@ -970,7 +970,7 @@ void PathDiagnosticLocation::flatten() {
|
|||
//===----------------------------------------------------------------------===//
|
||||
|
||||
std::shared_ptr<PathDiagnosticCallPiece>
|
||||
PathDiagnosticCallPiece::construct(const ExplodedNode *N, const CallExitEnd &CE,
|
||||
PathDiagnosticCallPiece::construct(const CallExitEnd &CE,
|
||||
const SourceManager &SM) {
|
||||
const Decl *caller = CE.getLocationContext()->getDecl();
|
||||
PathDiagnosticLocation pos = getLocationForCaller(CE.getCalleeContext(),
|
||||
|
|
|
@ -222,7 +222,7 @@ ProgramState::invalidateRegionsImpl(ValueList Values,
|
|||
if (CausedByPointerEscape) {
|
||||
newState = Eng->notifyCheckersOfPointerEscape(newState, IS,
|
||||
TopLevelInvalidated,
|
||||
Invalidated, Call,
|
||||
Call,
|
||||
*ITraits);
|
||||
}
|
||||
|
||||
|
@ -462,7 +462,7 @@ void ProgramState::print(raw_ostream &Out,
|
|||
// Print the store.
|
||||
ProgramStateManager &Mgr = getStateManager();
|
||||
const ASTContext &Context = getStateManager().getContext();
|
||||
Mgr.getStoreManager().print(getStore(), Out, NL, Sep);
|
||||
Mgr.getStoreManager().print(getStore(), Out, NL);
|
||||
|
||||
// Print out the environment.
|
||||
Env.print(Out, NL, Sep, Context, LC);
|
||||
|
@ -474,7 +474,7 @@ void ProgramState::print(raw_ostream &Out,
|
|||
printDynamicTypeInfo(this, Out, NL, Sep);
|
||||
|
||||
// Print out tainted symbols.
|
||||
printTaint(Out, NL, Sep);
|
||||
printTaint(Out, NL);
|
||||
|
||||
// Print checker-specific data.
|
||||
Mgr.getOwningEngine()->printState(Out, this, NL, Sep, LC);
|
||||
|
@ -490,7 +490,7 @@ LLVM_DUMP_METHOD void ProgramState::dump() const {
|
|||
}
|
||||
|
||||
void ProgramState::printTaint(raw_ostream &Out,
|
||||
const char *NL, const char *Sep) const {
|
||||
const char *NL) const {
|
||||
TaintMapImpl TM = get<TaintMap>();
|
||||
|
||||
if (!TM.isEmpty())
|
||||
|
|
|
@ -601,8 +601,7 @@ public: // Part of public interface to class.
|
|||
RBFactory.getTreeFactory());
|
||||
}
|
||||
|
||||
void print(Store store, raw_ostream &Out, const char* nl,
|
||||
const char *sep) override;
|
||||
void print(Store store, raw_ostream &Out, const char* nl) override;
|
||||
|
||||
void iterBindings(Store store, BindingsHandler& f) override {
|
||||
RegionBindingsRef B = getRegionBindings(store);
|
||||
|
@ -2600,7 +2599,7 @@ StoreRef RegionStoreManager::removeDeadBindings(Store store,
|
|||
//===----------------------------------------------------------------------===//
|
||||
|
||||
void RegionStoreManager::print(Store store, raw_ostream &OS,
|
||||
const char* nl, const char *sep) {
|
||||
const char* nl) {
|
||||
RegionBindingsRef B = getRegionBindings(store);
|
||||
OS << "Store (direct and default bindings), "
|
||||
<< B.asStore()
|
||||
|
|
|
@ -331,9 +331,6 @@ public:
|
|||
void RunPathSensitiveChecks(Decl *D,
|
||||
ExprEngine::InliningModes IMode,
|
||||
SetOfConstDecls *VisitedCallees);
|
||||
void ActionExprEngine(Decl *D, bool ObjCGCEnabled,
|
||||
ExprEngine::InliningModes IMode,
|
||||
SetOfConstDecls *VisitedCallees);
|
||||
|
||||
/// Visitors for the RecursiveASTVisitor.
|
||||
bool shouldWalkTypesOfTypeLocs() const { return false; }
|
||||
|
@ -726,9 +723,9 @@ void AnalysisConsumer::HandleCode(Decl *D, AnalysisMode Mode,
|
|||
// Path-sensitive checking.
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
||||
void AnalysisConsumer::ActionExprEngine(Decl *D, bool ObjCGCEnabled,
|
||||
ExprEngine::InliningModes IMode,
|
||||
SetOfConstDecls *VisitedCallees) {
|
||||
void AnalysisConsumer::RunPathSensitiveChecks(Decl *D,
|
||||
ExprEngine::InliningModes IMode,
|
||||
SetOfConstDecls *VisitedCallees) {
|
||||
// Construct the analysis engine. First check if the CFG is valid.
|
||||
// FIXME: Inter-procedural analysis will need to handle invalid CFGs.
|
||||
if (!Mgr->getCFG(D))
|
||||
|
@ -738,8 +735,7 @@ void AnalysisConsumer::ActionExprEngine(Decl *D, bool ObjCGCEnabled,
|
|||
if (!Mgr->getAnalysisDeclContext(D)->getAnalysis<RelaxedLiveVariables>())
|
||||
return;
|
||||
|
||||
ExprEngine Eng(CTU, *Mgr, ObjCGCEnabled, VisitedCallees, &FunctionSummaries,
|
||||
IMode);
|
||||
ExprEngine Eng(CTU, *Mgr, VisitedCallees, &FunctionSummaries, IMode);
|
||||
|
||||
// Execute the worklist algorithm.
|
||||
Eng.ExecuteWorkList(Mgr->getAnalysisDeclContextManager().getStackFrame(D),
|
||||
|
@ -756,26 +752,6 @@ void AnalysisConsumer::ActionExprEngine(Decl *D, bool ObjCGCEnabled,
|
|||
Eng.getBugReporter().FlushReports();
|
||||
}
|
||||
|
||||
void AnalysisConsumer::RunPathSensitiveChecks(Decl *D,
|
||||
ExprEngine::InliningModes IMode,
|
||||
SetOfConstDecls *Visited) {
|
||||
|
||||
switch (Mgr->getLangOpts().getGC()) {
|
||||
case LangOptions::NonGC:
|
||||
ActionExprEngine(D, false, IMode, Visited);
|
||||
break;
|
||||
|
||||
case LangOptions::GCOnly:
|
||||
ActionExprEngine(D, true, IMode, Visited);
|
||||
break;
|
||||
|
||||
case LangOptions::HybridGC:
|
||||
ActionExprEngine(D, false, IMode, Visited);
|
||||
ActionExprEngine(D, true, IMode, Visited);
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
//===----------------------------------------------------------------------===//
|
||||
// AnalysisConsumer creation.
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
|
Loading…
Reference in New Issue