RValue R1 = GetValue(PrevState, B->getLHS());
RValue R2 = GetValue(PrevState, B->getRHS(), hasR2);
-
- if (isa<UnknownVal>(R1) &&
- (isa<UnknownVal>(R2) ||
- isa<UninitializedVal>(R2))) {
-
- Nodify(Dst, B, Pred, SetValue(PrevState, B, R2));
- return;
- }
- else if (isa<UninitializedVal>(R1)) {
+
+ if (hasR2) {
+ if (isa<UninitializedVal>(R2) || isa<UnknownVal>(R2)) {
+ Nodify(Dst, B, Pred, SetValue(PrevState, B, R2));
+ return;
+ }
+ }
+ else if (isa<UninitializedVal>(R1) || isa<UnknownVal>(R1)) {
Nodify(Dst, B, Pred, SetValue(PrevState, B, R1));
return;
}
switch (Op) {
case BinaryOperator::Assign: {
const LValue& L1 = cast<LValue>(V1);
- Nodify(Dst, B, N2, SetValue(SetValue(St, B, V2), L1, V2));
+
+ if (isa<UninitializedVal>(L1))
+ HandleUninitializedStore(B, N2);
+ else
+ Nodify(Dst, B, N2, SetValue(SetValue(St, B, V2), L1, V2));
+
break;
}
assert (B->isCompoundAssignmentOp());
const LValue& L1 = cast<LValue>(V1);
+
+ if (isa<UninitializedVal>(L1)) {
+ HandleUninitializedStore(B, N2);
+ break;
+ }
+
RValue Result = cast<NonLValue>(UnknownVal());
if (Op >= BinaryOperator::AndAssign)
}
}
+void GRExprEngine::HandleUninitializedStore(Stmt* S, NodeTy* Pred) {
+
+ NodeTy* N = Builder->generateNode(S, Pred->getState(), Pred);
+ N->markAsSink();
+ UninitStores.insert(N);
+}
-void GRExprEngine::Visit(Stmt* S, GRExprEngine::NodeTy* Pred,
- GRExprEngine::NodeSet& Dst) {
+void GRExprEngine::Visit(Stmt* S, NodeTy* Pred, NodeSet& Dst) {
// FIXME: add metadata to the CFG so that we can disable
// this check when we KNOW that there is no block-level subexpression.
static std::string getNodeAttributes(const GRExprEngine::NodeTy* N, void*) {
if (GraphPrintCheckerState->isImplicitNullDeref(N) ||
- GraphPrintCheckerState->isExplicitNullDeref(N))
+ GraphPrintCheckerState->isExplicitNullDeref(N) ||
+ GraphPrintCheckerState->isUninitStore(N) ||
+ GraphPrintCheckerState->isUninitControlFlow(N))
return "color=\"red\",style=\"filled\"";
return "";
else if (GraphPrintCheckerState->isExplicitNullDeref(N)) {
Out << "\\|Explicit-Null Dereference.\\l";
}
+ else if (GraphPrintCheckerState->isUninitStore(N)) {
+ Out << "\\|Store to Uninitialized LValue.";
+ }
break;
}
using namespace clang;
namespace clang {
- void RunGRSimpleVals(CFG& cfg, FunctionDecl& FD, ASTContext& Ctx,
- Diagnostic& Diag, bool Visualize) {
+ unsigned RunGRSimpleVals(CFG& cfg, FunctionDecl& FD, ASTContext& Ctx,
+ Diagnostic& Diag, bool Visualize) {
if (Diag.hasErrorOccurred())
- return;
+ return 0;
GRCoreEngine<GRExprEngine> Engine(cfg, FD, Ctx);
GRExprEngine* CheckerState = &Engine.getCheckerState();
CheckerState->setTransferFunctions(GRSV);
// Execute the worklist algorithm.
- Engine.ExecuteWorkList(10000);
+ Engine.ExecuteWorkList(200);
// Look for explicit-Null dereferences and warn about them.
for (GRExprEngine::null_iterator I=CheckerState->null_begin(),
#ifndef NDEBUG
if (Visualize) CheckerState->ViewGraph();
-#endif
+#endif
+
+ return Engine.getGraph().size();
}
} // end clang namespace
ValueState
ValueStateManager::SetValue(ValueState St, const LValue& LV, const RValue& V) {
- assert (!isa<UnknownVal>(LV));
+ if (isa<UnknownVal>(LV))
+ return St;
+
assert (!isa<UninitializedVal>(LV));
switch (LV.getSubKind()) {
llvm::Timer T("GRSimpleVals");
T.startTimer();
- RunGRSimpleVals(C, FD, *Ctx, Diags, Visualize);
+ unsigned size = RunGRSimpleVals(C, FD, *Ctx, Diags, Visualize);
T.stopTimer();
- llvm::cerr << T.getWallTime() << '\n';
+ llvm::cerr << size << ' ' << T.getWallTime() << '\n';
}
else {
llvm::cerr << '\n';
/// RunGRSimpleVals - This is a simple driver to run the GRSimpleVals analysis
/// on a provided CFG. This interface will eventually be replaced with
/// something more elaborate as the requirements on the interface become
- /// clearer.
- void RunGRSimpleVals(CFG& cfg, FunctionDecl& FD, ASTContext& Ctx,
- Diagnostic& Diag, bool Visualize);
+ /// clearer. The value returned is the number of nodes in the ExplodedGraph.
+ unsigned RunGRSimpleVals(CFG& cfg, FunctionDecl& FD, ASTContext& Ctx,
+ Diagnostic& Diag, bool Visualize);
} // end clang namespace
typedef llvm::SmallPtrSet<NodeTy*,5> UninitBranchesTy;
UninitBranchesTy UninitBranches;
+ /// UninitStores - Sinks in the ExplodedGraph that result from
+ /// making a store to an uninitialized lvalue.
+ typedef llvm::SmallPtrSet<NodeTy*,5> UninitStoresTy;
+ UninitStoresTy UninitStores;
+
/// ImplicitNullDeref - Nodes in the ExplodedGraph that result from
/// taking a dereference on a symbolic pointer that may be NULL.
typedef llvm::SmallPtrSet<NodeTy*,5> NullDerefTy;
NullDerefTy ImplicitNullDeref;
NullDerefTy ExplicitNullDeref;
-
bool StateCleaned;
public:
return N->isSink() && UninitBranches.count(const_cast<NodeTy*>(N)) != 0;
}
+ bool isUninitStore(const NodeTy* N) const {
+ return N->isSink() && UninitStores.count(const_cast<NodeTy*>(N)) != 0;
+ }
+
bool isImplicitNullDeref(const NodeTy* N) const {
return N->isSink() && ImplicitNullDeref.count(const_cast<NodeTy*>(N)) != 0;
}
/// The states are not guaranteed to be unique.
void Nodify(NodeSet& Dst, Stmt* S, NodeTy* Pred, const StateTy::BufferTy& SB);
+ /// HandleUninitializedStore - Create the necessary sink node to represent
+ /// a store to an "uninitialized" LValue.
+ void HandleUninitializedStore(Stmt* S, NodeTy* Pred);
+
/// Visit - Transfer function logic for all statements. Dispatches to
/// other functions that handle specific kinds of statements.
void Visit(Stmt* S, NodeTy* Pred, NodeSet& Dst);