// GRSimpleVals.cpp - Transfer functions for tracking simple values -*- C++ -*-- // // The LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // This files defines GRSimpleVals, a sub-class of GRTransferFuncs that // provides transfer functions for performing simple value tracking with // limited support for symbolics. // //===----------------------------------------------------------------------===// #include "GRSimpleVals.h" #include "clang/Basic/Diagnostic.h" using namespace clang; namespace clang { template static void EmitWarning(Diagnostic& Diag, SourceManager& SrcMgr, ITERATOR I, ITERATOR E, const char* msg) { bool isFirst; unsigned ErrorDiag; for (; I != E; ++I) { if (isFirst) { isFirst = false; ErrorDiag = Diag.getCustomDiagID(Diagnostic::Warning, msg); } const PostStmt& L = cast((*I)->getLocation()); Expr* Exp = cast(L.getStmt()); Diag.Report(FullSourceLoc(Exp->getExprLoc(), SrcMgr), ErrorDiag); } } unsigned RunGRSimpleVals(CFG& cfg, FunctionDecl& FD, ASTContext& Ctx, Diagnostic& Diag, bool Visualize) { if (Diag.hasErrorOccurred()) return 0; GRCoreEngine Engine(cfg, FD, Ctx); GRExprEngine* CheckerState = &Engine.getCheckerState(); GRSimpleVals GRSV; CheckerState->setTransferFunctions(GRSV); // Execute the worklist algorithm. Engine.ExecuteWorkList(20000); SourceManager& SrcMgr = Ctx.getSourceManager(); EmitWarning(Diag, SrcMgr, CheckerState->null_derefs_begin(), CheckerState->null_derefs_end(), "NULL pointer is dereferenced after it is checked for NULL."); EmitWarning(Diag, SrcMgr, CheckerState->uninit_derefs_begin(), CheckerState->uninit_derefs_end(), "Dereference of uninitialized value."); EmitWarning(Diag, SrcMgr, CheckerState->uninit_derefs_begin(), CheckerState->uninit_derefs_end(), "Dereference of uninitialized value."); EmitWarning(Diag, SrcMgr, CheckerState->bad_divides_begin(), CheckerState->bad_divides_end(), "Division by zero/uninitialized value."); #ifndef NDEBUG if (Visualize) CheckerState->ViewGraph(); #endif return Engine.getGraph().size(); } } // end clang namespace //===----------------------------------------------------------------------===// // Transfer function for Casts. //===----------------------------------------------------------------------===// RVal GRSimpleVals::EvalCast(ValueManager& ValMgr, NonLVal X, QualType T) { if (!isa(X)) return UnknownVal(); llvm::APSInt V = cast(X).getValue(); V.setIsUnsigned(T->isUnsignedIntegerType() || T->isPointerType()); V.extOrTrunc(ValMgr.getContext().getTypeSize(T, SourceLocation())); if (T->isPointerType()) return lval::ConcreteInt(ValMgr.getValue(V)); else return nonlval::ConcreteInt(ValMgr.getValue(V)); } // Casts. RVal GRSimpleVals::EvalCast(ValueManager& ValMgr, LVal X, QualType T) { if (T->isPointerType()) return X; assert (T->isIntegerType()); if (!isa(X)) return UnknownVal(); llvm::APSInt V = cast(X).getValue(); V.setIsUnsigned(T->isUnsignedIntegerType() || T->isPointerType()); V.extOrTrunc(ValMgr.getContext().getTypeSize(T, SourceLocation())); return nonlval::ConcreteInt(ValMgr.getValue(V)); } // Unary operators. RVal GRSimpleVals::EvalMinus(ValueManager& ValMgr, UnaryOperator* U, NonLVal X){ switch (X.getSubKind()) { case nonlval::ConcreteIntKind: return cast(X).EvalMinus(ValMgr, U); default: return UnknownVal(); } } RVal GRSimpleVals::EvalComplement(ValueManager& ValMgr, NonLVal X) { switch (X.getSubKind()) { case nonlval::ConcreteIntKind: return cast(X).EvalComplement(ValMgr); default: return UnknownVal(); } } // Binary operators. RVal GRSimpleVals::EvalBinOp(ValueManager& ValMgr, BinaryOperator::Opcode Op, NonLVal L, NonLVal R) { while (1) { switch (L.getSubKind()) { default: return UnknownVal(); case nonlval::ConcreteIntKind: if (isa(R)) { const nonlval::ConcreteInt& L_CI = cast(L); const nonlval::ConcreteInt& R_CI = cast(R); return L_CI.EvalBinOp(ValMgr, Op, R_CI); } else { NonLVal tmp = R; R = L; L = tmp; continue; } case nonlval::SymbolValKind: { if (isa(R)) { const SymIntConstraint& C = ValMgr.getConstraint(cast(L).getSymbol(), Op, cast(R).getValue()); return nonlval::SymIntConstraintVal(C); } else return UnknownVal(); } } } } // Binary Operators (except assignments and comma). RVal GRSimpleVals::EvalBinOp(ValueManager& ValMgr, BinaryOperator::Opcode Op, LVal L, LVal R) { switch (Op) { default: return UnknownVal(); case BinaryOperator::EQ: return EvalEQ(ValMgr, L, R); case BinaryOperator::NE: return EvalNE(ValMgr, L, R); } } // Pointer arithmetic. RVal GRSimpleVals::EvalBinOp(ValueManager& ValMgr, BinaryOperator::Opcode Op, LVal L, NonLVal R) { return UnknownVal(); } // Equality operators for LVals. RVal GRSimpleVals::EvalEQ(ValueManager& ValMgr, LVal L, LVal R) { switch (L.getSubKind()) { default: assert(false && "EQ not implemented for this LVal."); return UnknownVal(); case lval::ConcreteIntKind: if (isa(R)) { bool b = cast(L).getValue() == cast(R).getValue(); return NonLVal::MakeIntTruthVal(ValMgr, b); } else if (isa(R)) { const SymIntConstraint& C = ValMgr.getConstraint(cast(R).getSymbol(), BinaryOperator::EQ, cast(L).getValue()); return nonlval::SymIntConstraintVal(C); } break; case lval::SymbolValKind: { if (isa(R)) { const SymIntConstraint& C = ValMgr.getConstraint(cast(L).getSymbol(), BinaryOperator::EQ, cast(R).getValue()); return nonlval::SymIntConstraintVal(C); } // FIXME: Implement == for lval Symbols. This is mainly useful // in iterator loops when traversing a buffer, e.g. while(z != zTerm). // Since this is not useful for many checkers we'll punt on this for // now. return UnknownVal(); } case lval::DeclValKind: case lval::FuncValKind: case lval::GotoLabelKind: return NonLVal::MakeIntTruthVal(ValMgr, L == R); } return NonLVal::MakeIntTruthVal(ValMgr, false); } RVal GRSimpleVals::EvalNE(ValueManager& ValMgr, LVal L, LVal R) { switch (L.getSubKind()) { default: assert(false && "NE not implemented for this LVal."); return UnknownVal(); case lval::ConcreteIntKind: if (isa(R)) { bool b = cast(L).getValue() != cast(R).getValue(); return NonLVal::MakeIntTruthVal(ValMgr, b); } else if (isa(R)) { const SymIntConstraint& C = ValMgr.getConstraint(cast(R).getSymbol(), BinaryOperator::NE, cast(L).getValue()); return nonlval::SymIntConstraintVal(C); } break; case lval::SymbolValKind: { if (isa(R)) { const SymIntConstraint& C = ValMgr.getConstraint(cast(L).getSymbol(), BinaryOperator::NE, cast(R).getValue()); return nonlval::SymIntConstraintVal(C); } // FIXME: Implement != for lval Symbols. This is mainly useful // in iterator loops when traversing a buffer, e.g. while(z != zTerm). // Since this is not useful for many checkers we'll punt on this for // now. return UnknownVal(); break; } case lval::DeclValKind: case lval::FuncValKind: case lval::GotoLabelKind: return NonLVal::MakeIntTruthVal(ValMgr, L != R); } return NonLVal::MakeIntTruthVal(ValMgr, true); }