Ted Kremenek | 77349cb | 2008-02-14 22:13:12 +0000 | [diff] [blame] | 1 | //=-- GRExprEngine.cpp - Path-Sensitive Expression-Level Dataflow ---*- C++ -*-= |
Ted Kremenek | 6492485 | 2008-01-31 02:35:41 +0000 | [diff] [blame] | 2 | // |
Ted Kremenek | 4af8431 | 2008-01-31 06:49:09 +0000 | [diff] [blame] | 3 | // The LLVM Compiler Infrastructure |
Ted Kremenek | d27f816 | 2008-01-15 23:55:06 +0000 | [diff] [blame] | 4 | // |
| 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | // |
Ted Kremenek | 77349cb | 2008-02-14 22:13:12 +0000 | [diff] [blame] | 10 | // This file defines a meta-engine for path-sensitive dataflow analysis that |
| 11 | // is built on GREngine, but provides the boilerplate to execute transfer |
| 12 | // functions and build the ExplodedGraph at the expression level. |
Ted Kremenek | d27f816 | 2008-01-15 23:55:06 +0000 | [diff] [blame] | 13 | // |
| 14 | //===----------------------------------------------------------------------===// |
| 15 | |
Ted Kremenek | 77349cb | 2008-02-14 22:13:12 +0000 | [diff] [blame] | 16 | #include "clang/Analysis/PathSensitive/GRExprEngine.h" |
Ted Kremenek | 50a6d0c | 2008-04-09 21:41:14 +0000 | [diff] [blame] | 17 | #include "clang/Analysis/PathSensitive/BugReporter.h" |
Ted Kremenek | e97ca06 | 2008-03-07 20:57:30 +0000 | [diff] [blame] | 18 | #include "clang/Basic/SourceManager.h" |
Ted Kremenek | e01c987 | 2008-02-14 22:36:46 +0000 | [diff] [blame] | 19 | #include "llvm/Support/Streams.h" |
Ted Kremenek | b387a3f | 2008-02-14 22:16:04 +0000 | [diff] [blame] | 20 | |
Ted Kremenek | 0f5f059 | 2008-02-27 06:07:00 +0000 | [diff] [blame] | 21 | #ifndef NDEBUG |
| 22 | #include "llvm/Support/GraphWriter.h" |
| 23 | #include <sstream> |
| 24 | #endif |
| 25 | |
Ted Kremenek | b387a3f | 2008-02-14 22:16:04 +0000 | [diff] [blame] | 26 | using namespace clang; |
| 27 | using llvm::dyn_cast; |
| 28 | using llvm::cast; |
| 29 | using llvm::APSInt; |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 30 | |
Ted Kremenek | e695e1c | 2008-04-15 23:06:53 +0000 | [diff] [blame] | 31 | //===----------------------------------------------------------------------===// |
| 32 | // Engine construction and deletion. |
| 33 | //===----------------------------------------------------------------------===// |
| 34 | |
Ted Kremenek | daa497e | 2008-03-09 18:05:48 +0000 | [diff] [blame] | 35 | |
Ted Kremenek | 50a6d0c | 2008-04-09 21:41:14 +0000 | [diff] [blame] | 36 | GRExprEngine::GRExprEngine(CFG& cfg, Decl& CD, ASTContext& Ctx) |
| 37 | : CoreEngine(cfg, CD, Ctx, *this), |
| 38 | G(CoreEngine.getGraph()), |
| 39 | Liveness(G.getCFG()), |
| 40 | Builder(NULL), |
| 41 | StateMgr(G.getContext(), G.getAllocator()), |
| 42 | BasicVals(StateMgr.getBasicValueFactory()), |
| 43 | TF(NULL), // FIXME |
| 44 | SymMgr(StateMgr.getSymbolManager()), |
| 45 | StmtEntryNode(NULL), CleanedState(NULL), CurrentStmt(NULL) { |
| 46 | |
| 47 | // Compute liveness information. |
| 48 | Liveness.runOnCFG(G.getCFG()); |
| 49 | Liveness.runOnAllBlocks(G.getCFG(), NULL, true); |
| 50 | } |
| 51 | |
| 52 | GRExprEngine::~GRExprEngine() { |
| 53 | for (BugTypeSet::iterator I = BugTypes.begin(), E = BugTypes.end(); I!=E; ++I) |
| 54 | delete *I; |
| 55 | |
| 56 | for (SimpleChecksTy::iterator I = CallChecks.begin(), E = CallChecks.end(); |
| 57 | I != E; ++I) |
| 58 | delete *I; |
| 59 | |
| 60 | for (SimpleChecksTy::iterator I=MsgExprChecks.begin(), E=MsgExprChecks.end(); |
| 61 | I != E; ++I) |
| 62 | delete *I; |
| 63 | } |
| 64 | |
Ted Kremenek | e695e1c | 2008-04-15 23:06:53 +0000 | [diff] [blame] | 65 | //===----------------------------------------------------------------------===// |
| 66 | // Utility methods. |
| 67 | //===----------------------------------------------------------------------===// |
| 68 | |
| 69 | // SaveAndRestore - A utility class that uses RIIA to save and restore |
| 70 | // the value of a variable. |
| 71 | template<typename T> |
| 72 | struct VISIBILITY_HIDDEN SaveAndRestore { |
| 73 | SaveAndRestore(T& x) : X(x), old_value(x) {} |
| 74 | ~SaveAndRestore() { X = old_value; } |
| 75 | T get() { return old_value; } |
| 76 | |
| 77 | T& X; |
| 78 | T old_value; |
| 79 | }; |
| 80 | |
Ted Kremenek | 50a6d0c | 2008-04-09 21:41:14 +0000 | [diff] [blame] | 81 | void GRExprEngine::EmitWarnings(Diagnostic& Diag, PathDiagnosticClient* PD) { |
| 82 | for (bug_type_iterator I = bug_types_begin(), E = bug_types_end(); I!=E; ++I){ |
| 83 | BugReporter BR(Diag, PD, getContext(), *this); |
| 84 | (*I)->EmitWarnings(BR); |
| 85 | } |
| 86 | |
| 87 | for (SimpleChecksTy::iterator I = CallChecks.begin(), E = CallChecks.end(); |
| 88 | I != E; ++I) { |
| 89 | BugReporter BR(Diag, PD, getContext(), *this); |
| 90 | (*I)->EmitWarnings(BR); |
| 91 | } |
| 92 | |
| 93 | for (SimpleChecksTy::iterator I=MsgExprChecks.begin(), E=MsgExprChecks.end(); |
| 94 | I != E; ++I) { |
| 95 | BugReporter BR(Diag, PD, getContext(), *this); |
| 96 | (*I)->EmitWarnings(BR); |
| 97 | } |
| 98 | } |
| 99 | |
| 100 | void GRExprEngine::setTransferFunctions(GRTransferFuncs* tf) { |
| 101 | TF = tf; |
| 102 | TF->RegisterChecks(*this); |
| 103 | } |
| 104 | |
| 105 | void GRExprEngine::AddCallCheck(GRSimpleAPICheck* A) { |
| 106 | CallChecks.push_back(A); |
| 107 | } |
| 108 | |
| 109 | void GRExprEngine::AddObjCMessageExprCheck(GRSimpleAPICheck* A) { |
| 110 | MsgExprChecks.push_back(A); |
| 111 | } |
| 112 | |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 113 | ValueState* GRExprEngine::getInitialState() { |
Ted Kremenek | 0793263 | 2008-02-27 06:47:26 +0000 | [diff] [blame] | 114 | |
| 115 | // The LiveVariables information already has a compilation of all VarDecls |
| 116 | // used in the function. Iterate through this set, and "symbolicate" |
| 117 | // any VarDecl whose value originally comes from outside the function. |
| 118 | |
| 119 | typedef LiveVariables::AnalysisDataTy LVDataTy; |
| 120 | LVDataTy& D = Liveness.getAnalysisData(); |
| 121 | |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 122 | ValueState StateImpl = *StateMgr.getInitialState(); |
Ted Kremenek | 0793263 | 2008-02-27 06:47:26 +0000 | [diff] [blame] | 123 | |
| 124 | for (LVDataTy::decl_iterator I=D.begin_decl(), E=D.end_decl(); I != E; ++I) { |
| 125 | |
| 126 | VarDecl* VD = cast<VarDecl>(const_cast<ScopedDecl*>(I->first)); |
| 127 | |
| 128 | if (VD->hasGlobalStorage() || isa<ParmVarDecl>(VD)) { |
| 129 | RVal X = RVal::GetSymbolValue(SymMgr, VD); |
| 130 | StateMgr.BindVar(StateImpl, VD, X); |
| 131 | } |
| 132 | } |
| 133 | |
| 134 | return StateMgr.getPersistentState(StateImpl); |
| 135 | } |
| 136 | |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 137 | ValueState* GRExprEngine::SetRVal(ValueState* St, Expr* Ex, RVal V) { |
Ted Kremenek | 3271f8d | 2008-02-07 04:16:04 +0000 | [diff] [blame] | 138 | |
Ted Kremenek | e070a1d | 2008-02-04 21:59:01 +0000 | [diff] [blame] | 139 | bool isBlkExpr = false; |
Ted Kremenek | 3271f8d | 2008-02-07 04:16:04 +0000 | [diff] [blame] | 140 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 141 | if (Ex == CurrentStmt) { |
| 142 | isBlkExpr = getCFG().isBlkExpr(Ex); |
Ted Kremenek | e070a1d | 2008-02-04 21:59:01 +0000 | [diff] [blame] | 143 | |
| 144 | if (!isBlkExpr) |
| 145 | return St; |
| 146 | } |
Ted Kremenek | 3271f8d | 2008-02-07 04:16:04 +0000 | [diff] [blame] | 147 | |
Ted Kremenek | 5a7b382 | 2008-02-26 23:37:01 +0000 | [diff] [blame] | 148 | return StateMgr.SetRVal(St, Ex, V, isBlkExpr, false); |
Ted Kremenek | e070a1d | 2008-02-04 21:59:01 +0000 | [diff] [blame] | 149 | } |
| 150 | |
Ted Kremenek | e695e1c | 2008-04-15 23:06:53 +0000 | [diff] [blame] | 151 | //===----------------------------------------------------------------------===// |
| 152 | // Top-level transfer function logic (Dispatcher). |
| 153 | //===----------------------------------------------------------------------===// |
| 154 | |
| 155 | void GRExprEngine::ProcessStmt(Stmt* S, StmtNodeBuilder& builder) { |
| 156 | |
| 157 | Builder = &builder; |
| 158 | StmtEntryNode = builder.getLastNode(); |
| 159 | CurrentStmt = S; |
| 160 | NodeSet Dst; |
| 161 | |
| 162 | // Set up our simple checks. |
| 163 | |
| 164 | // FIXME: This can probably be installed directly in GRCoreEngine, obviating |
| 165 | // the need to do a copy every time we hit a block-level statement. |
| 166 | |
| 167 | if (!MsgExprChecks.empty()) |
| 168 | Builder->setObjCMsgExprAuditors((GRAuditor<ValueState>**) &MsgExprChecks[0], |
| 169 | (GRAuditor<ValueState>**) (&MsgExprChecks[0] + MsgExprChecks.size())); |
| 170 | |
| 171 | |
| 172 | if (!CallChecks.empty()) |
| 173 | Builder->setCallExprAuditors((GRAuditor<ValueState>**) &CallChecks[0], |
| 174 | (GRAuditor<ValueState>**) (&CallChecks[0] + CallChecks.size())); |
| 175 | |
| 176 | // Create the cleaned state. |
| 177 | |
| 178 | CleanedState = StateMgr.RemoveDeadBindings(StmtEntryNode->getState(), |
| 179 | CurrentStmt, Liveness); |
| 180 | |
| 181 | Builder->SetCleanedState(CleanedState); |
| 182 | |
| 183 | // Visit the statement. |
| 184 | |
| 185 | Visit(S, StmtEntryNode, Dst); |
| 186 | |
| 187 | // If no nodes were generated, generate a new node that has all the |
| 188 | // dead mappings removed. |
| 189 | |
| 190 | if (Dst.size() == 1 && *Dst.begin() == StmtEntryNode) |
| 191 | builder.generateNode(S, GetState(StmtEntryNode), StmtEntryNode); |
| 192 | |
| 193 | // NULL out these variables to cleanup. |
| 194 | |
| 195 | CurrentStmt = NULL; |
| 196 | StmtEntryNode = NULL; |
| 197 | Builder = NULL; |
| 198 | CleanedState = NULL; |
| 199 | } |
| 200 | |
| 201 | void GRExprEngine::Visit(Stmt* S, NodeTy* Pred, NodeSet& Dst) { |
| 202 | |
| 203 | // FIXME: add metadata to the CFG so that we can disable |
| 204 | // this check when we KNOW that there is no block-level subexpression. |
| 205 | // The motivation is that this check requires a hashtable lookup. |
| 206 | |
| 207 | if (S != CurrentStmt && getCFG().isBlkExpr(S)) { |
| 208 | Dst.Add(Pred); |
| 209 | return; |
| 210 | } |
| 211 | |
| 212 | switch (S->getStmtClass()) { |
| 213 | |
| 214 | default: |
| 215 | // Cases we intentionally have "default" handle: |
| 216 | // AddrLabelExpr, IntegerLiteral, CharacterLiteral |
| 217 | |
| 218 | Dst.Add(Pred); // No-op. Simply propagate the current state unchanged. |
| 219 | break; |
| 220 | |
| 221 | case Stmt::AsmStmtClass: |
| 222 | VisitAsmStmt(cast<AsmStmt>(S), Pred, Dst); |
| 223 | break; |
| 224 | |
| 225 | case Stmt::BinaryOperatorClass: { |
| 226 | BinaryOperator* B = cast<BinaryOperator>(S); |
| 227 | |
| 228 | if (B->isLogicalOp()) { |
| 229 | VisitLogicalExpr(B, Pred, Dst); |
| 230 | break; |
| 231 | } |
| 232 | else if (B->getOpcode() == BinaryOperator::Comma) { |
| 233 | ValueState* St = GetState(Pred); |
| 234 | MakeNode(Dst, B, Pred, SetRVal(St, B, GetRVal(St, B->getRHS()))); |
| 235 | break; |
| 236 | } |
| 237 | |
| 238 | VisitBinaryOperator(cast<BinaryOperator>(S), Pred, Dst); |
| 239 | break; |
| 240 | } |
| 241 | |
| 242 | case Stmt::CallExprClass: { |
| 243 | CallExpr* C = cast<CallExpr>(S); |
| 244 | VisitCall(C, Pred, C->arg_begin(), C->arg_end(), Dst); |
| 245 | break; |
| 246 | } |
| 247 | |
| 248 | case Stmt::CastExprClass: { |
| 249 | CastExpr* C = cast<CastExpr>(S); |
| 250 | VisitCast(C, C->getSubExpr(), Pred, Dst); |
| 251 | break; |
| 252 | } |
| 253 | |
| 254 | // FIXME: ChooseExpr is really a constant. We need to fix |
| 255 | // the CFG do not model them as explicit control-flow. |
| 256 | |
| 257 | case Stmt::ChooseExprClass: { // __builtin_choose_expr |
| 258 | ChooseExpr* C = cast<ChooseExpr>(S); |
| 259 | VisitGuardedExpr(C, C->getLHS(), C->getRHS(), Pred, Dst); |
| 260 | break; |
| 261 | } |
| 262 | |
| 263 | case Stmt::CompoundAssignOperatorClass: |
| 264 | VisitBinaryOperator(cast<BinaryOperator>(S), Pred, Dst); |
| 265 | break; |
| 266 | |
| 267 | case Stmt::ConditionalOperatorClass: { // '?' operator |
| 268 | ConditionalOperator* C = cast<ConditionalOperator>(S); |
| 269 | VisitGuardedExpr(C, C->getLHS(), C->getRHS(), Pred, Dst); |
| 270 | break; |
| 271 | } |
| 272 | |
| 273 | case Stmt::DeclRefExprClass: |
| 274 | VisitDeclRefExpr(cast<DeclRefExpr>(S), Pred, Dst); |
| 275 | break; |
| 276 | |
| 277 | case Stmt::DeclStmtClass: |
| 278 | VisitDeclStmt(cast<DeclStmt>(S), Pred, Dst); |
| 279 | break; |
| 280 | |
| 281 | case Stmt::ImplicitCastExprClass: { |
| 282 | ImplicitCastExpr* C = cast<ImplicitCastExpr>(S); |
| 283 | VisitCast(C, C->getSubExpr(), Pred, Dst); |
| 284 | break; |
| 285 | } |
| 286 | |
| 287 | case Stmt::ObjCMessageExprClass: { |
| 288 | VisitObjCMessageExpr(cast<ObjCMessageExpr>(S), Pred, Dst); |
| 289 | break; |
| 290 | } |
| 291 | |
| 292 | case Stmt::ParenExprClass: |
| 293 | Visit(cast<ParenExpr>(S)->getSubExpr(), Pred, Dst); |
| 294 | break; |
| 295 | |
| 296 | case Stmt::SizeOfAlignOfTypeExprClass: |
| 297 | VisitSizeOfAlignOfTypeExpr(cast<SizeOfAlignOfTypeExpr>(S), Pred, Dst); |
| 298 | break; |
| 299 | |
| 300 | case Stmt::StmtExprClass: { |
| 301 | StmtExpr* SE = cast<StmtExpr>(S); |
| 302 | |
| 303 | ValueState* St = GetState(Pred); |
| 304 | |
| 305 | // FIXME: Not certain if we can have empty StmtExprs. If so, we should |
| 306 | // probably just remove these from the CFG. |
| 307 | assert (!SE->getSubStmt()->body_empty()); |
| 308 | |
| 309 | if (Expr* LastExpr = dyn_cast<Expr>(*SE->getSubStmt()->body_rbegin())) |
| 310 | MakeNode(Dst, SE, Pred, SetRVal(St, SE, GetRVal(St, LastExpr))); |
| 311 | else |
| 312 | Dst.Add(Pred); |
| 313 | |
| 314 | break; |
| 315 | } |
| 316 | |
| 317 | // FIXME: We may wish to always bind state to ReturnStmts so |
| 318 | // that users can quickly query what was the state at the |
| 319 | // exit points of a function. |
| 320 | |
| 321 | case Stmt::ReturnStmtClass: |
| 322 | VisitReturnStmt(cast<ReturnStmt>(S), Pred, Dst); break; |
| 323 | |
| 324 | case Stmt::UnaryOperatorClass: { |
| 325 | UnaryOperator* U = cast<UnaryOperator>(S); |
| 326 | |
| 327 | switch (U->getOpcode()) { |
| 328 | case UnaryOperator::Deref: VisitDeref(U, Pred, Dst); break; |
| 329 | case UnaryOperator::Plus: Visit(U->getSubExpr(), Pred, Dst); break; |
| 330 | case UnaryOperator::SizeOf: VisitSizeOfExpr(U, Pred, Dst); break; |
| 331 | default: VisitUnaryOperator(U, Pred, Dst); break; |
| 332 | } |
| 333 | |
| 334 | break; |
| 335 | } |
| 336 | } |
| 337 | } |
| 338 | |
| 339 | //===----------------------------------------------------------------------===// |
| 340 | // Block entrance. (Update counters). |
| 341 | //===----------------------------------------------------------------------===// |
| 342 | |
| 343 | bool GRExprEngine::ProcessBlockEntrance(CFGBlock* B, ValueState*, |
| 344 | GRBlockCounter BC) { |
| 345 | |
| 346 | return BC.getNumVisited(B->getBlockID()) < 3; |
| 347 | } |
| 348 | |
| 349 | //===----------------------------------------------------------------------===// |
| 350 | // Branch processing. |
| 351 | //===----------------------------------------------------------------------===// |
| 352 | |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 353 | ValueState* GRExprEngine::MarkBranch(ValueState* St, Stmt* Terminator, |
| 354 | bool branchTaken) { |
Ted Kremenek | 05a2378 | 2008-02-26 19:05:15 +0000 | [diff] [blame] | 355 | |
| 356 | switch (Terminator->getStmtClass()) { |
| 357 | default: |
| 358 | return St; |
| 359 | |
| 360 | case Stmt::BinaryOperatorClass: { // '&&' and '||' |
| 361 | |
| 362 | BinaryOperator* B = cast<BinaryOperator>(Terminator); |
| 363 | BinaryOperator::Opcode Op = B->getOpcode(); |
| 364 | |
| 365 | assert (Op == BinaryOperator::LAnd || Op == BinaryOperator::LOr); |
| 366 | |
| 367 | // For &&, if we take the true branch, then the value of the whole |
| 368 | // expression is that of the RHS expression. |
| 369 | // |
| 370 | // For ||, if we take the false branch, then the value of the whole |
| 371 | // expression is that of the RHS expression. |
| 372 | |
| 373 | Expr* Ex = (Op == BinaryOperator::LAnd && branchTaken) || |
| 374 | (Op == BinaryOperator::LOr && !branchTaken) |
| 375 | ? B->getRHS() : B->getLHS(); |
| 376 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 377 | return SetBlkExprRVal(St, B, UndefinedVal(Ex)); |
Ted Kremenek | 05a2378 | 2008-02-26 19:05:15 +0000 | [diff] [blame] | 378 | } |
| 379 | |
| 380 | case Stmt::ConditionalOperatorClass: { // ?: |
| 381 | |
| 382 | ConditionalOperator* C = cast<ConditionalOperator>(Terminator); |
| 383 | |
| 384 | // For ?, if branchTaken == true then the value is either the LHS or |
| 385 | // the condition itself. (GNU extension). |
| 386 | |
| 387 | Expr* Ex; |
| 388 | |
| 389 | if (branchTaken) |
| 390 | Ex = C->getLHS() ? C->getLHS() : C->getCond(); |
| 391 | else |
| 392 | Ex = C->getRHS(); |
| 393 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 394 | return SetBlkExprRVal(St, C, UndefinedVal(Ex)); |
Ted Kremenek | 05a2378 | 2008-02-26 19:05:15 +0000 | [diff] [blame] | 395 | } |
| 396 | |
| 397 | case Stmt::ChooseExprClass: { // ?: |
| 398 | |
| 399 | ChooseExpr* C = cast<ChooseExpr>(Terminator); |
| 400 | |
| 401 | Expr* Ex = branchTaken ? C->getLHS() : C->getRHS(); |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 402 | return SetBlkExprRVal(St, C, UndefinedVal(Ex)); |
Ted Kremenek | 05a2378 | 2008-02-26 19:05:15 +0000 | [diff] [blame] | 403 | } |
| 404 | } |
| 405 | } |
| 406 | |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 407 | void GRExprEngine::ProcessBranch(Expr* Condition, Stmt* Term, |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 408 | BranchNodeBuilder& builder) { |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 409 | |
Ted Kremenek | e7d2211 | 2008-02-11 19:21:59 +0000 | [diff] [blame] | 410 | // Remove old bindings for subexpressions. |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 411 | ValueState* PrevState = StateMgr.RemoveSubExprBindings(builder.getState()); |
Ted Kremenek | f233d48 | 2008-02-05 00:26:40 +0000 | [diff] [blame] | 412 | |
Ted Kremenek | b233183 | 2008-02-15 22:29:00 +0000 | [diff] [blame] | 413 | // Check for NULL conditions; e.g. "for(;;)" |
| 414 | if (!Condition) { |
| 415 | builder.markInfeasible(false); |
Ted Kremenek | b233183 | 2008-02-15 22:29:00 +0000 | [diff] [blame] | 416 | return; |
| 417 | } |
| 418 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 419 | RVal V = GetRVal(PrevState, Condition); |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 420 | |
| 421 | switch (V.getBaseKind()) { |
| 422 | default: |
| 423 | break; |
| 424 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 425 | case RVal::UnknownKind: |
Ted Kremenek | 58b3321 | 2008-02-26 19:40:44 +0000 | [diff] [blame] | 426 | builder.generateNode(MarkBranch(PrevState, Term, true), true); |
| 427 | builder.generateNode(MarkBranch(PrevState, Term, false), false); |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 428 | return; |
| 429 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 430 | case RVal::UndefinedKind: { |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 431 | NodeTy* N = builder.generateNode(PrevState, true); |
| 432 | |
| 433 | if (N) { |
| 434 | N->markAsSink(); |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 435 | UndefBranches.insert(N); |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 436 | } |
| 437 | |
| 438 | builder.markInfeasible(false); |
| 439 | return; |
| 440 | } |
| 441 | } |
Ted Kremenek | 8e49dd6 | 2008-02-12 18:08:17 +0000 | [diff] [blame] | 442 | |
Ted Kremenek | 6a6719a | 2008-02-29 20:27:50 +0000 | [diff] [blame] | 443 | // Process the true branch. |
Ted Kremenek | 8e49dd6 | 2008-02-12 18:08:17 +0000 | [diff] [blame] | 444 | |
Ted Kremenek | 361fa8e | 2008-03-12 21:45:47 +0000 | [diff] [blame] | 445 | bool isFeasible = false; |
Ted Kremenek | 6a6719a | 2008-02-29 20:27:50 +0000 | [diff] [blame] | 446 | ValueState* St = Assume(PrevState, V, true, isFeasible); |
| 447 | |
| 448 | if (isFeasible) |
| 449 | builder.generateNode(MarkBranch(St, Term, true), true); |
Ted Kremenek | 8e49dd6 | 2008-02-12 18:08:17 +0000 | [diff] [blame] | 450 | else |
| 451 | builder.markInfeasible(true); |
Ted Kremenek | 6a6719a | 2008-02-29 20:27:50 +0000 | [diff] [blame] | 452 | |
| 453 | // Process the false branch. |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 454 | |
Ted Kremenek | 6a6719a | 2008-02-29 20:27:50 +0000 | [diff] [blame] | 455 | isFeasible = false; |
| 456 | St = Assume(PrevState, V, false, isFeasible); |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 457 | |
Ted Kremenek | 6a6719a | 2008-02-29 20:27:50 +0000 | [diff] [blame] | 458 | if (isFeasible) |
| 459 | builder.generateNode(MarkBranch(St, Term, false), false); |
Ted Kremenek | f233d48 | 2008-02-05 00:26:40 +0000 | [diff] [blame] | 460 | else |
| 461 | builder.markInfeasible(false); |
Ted Kremenek | 71c29bd | 2008-01-29 23:32:35 +0000 | [diff] [blame] | 462 | } |
| 463 | |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 464 | /// ProcessIndirectGoto - Called by GRCoreEngine. Used to generate successor |
Ted Kremenek | 754607e | 2008-02-13 00:24:44 +0000 | [diff] [blame] | 465 | /// nodes by processing the 'effects' of a computed goto jump. |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 466 | void GRExprEngine::ProcessIndirectGoto(IndirectGotoNodeBuilder& builder) { |
Ted Kremenek | 754607e | 2008-02-13 00:24:44 +0000 | [diff] [blame] | 467 | |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 468 | ValueState* St = builder.getState(); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 469 | RVal V = GetRVal(St, builder.getTarget()); |
Ted Kremenek | 754607e | 2008-02-13 00:24:44 +0000 | [diff] [blame] | 470 | |
| 471 | // Three possibilities: |
| 472 | // |
| 473 | // (1) We know the computed label. |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 474 | // (2) The label is NULL (or some other constant), or Undefined. |
Ted Kremenek | 754607e | 2008-02-13 00:24:44 +0000 | [diff] [blame] | 475 | // (3) We have no clue about the label. Dispatch to all targets. |
| 476 | // |
| 477 | |
| 478 | typedef IndirectGotoNodeBuilder::iterator iterator; |
| 479 | |
| 480 | if (isa<lval::GotoLabel>(V)) { |
| 481 | LabelStmt* L = cast<lval::GotoLabel>(V).getLabel(); |
| 482 | |
| 483 | for (iterator I=builder.begin(), E=builder.end(); I != E; ++I) { |
Ted Kremenek | 24f1a96 | 2008-02-13 17:27:37 +0000 | [diff] [blame] | 484 | if (I.getLabel() == L) { |
| 485 | builder.generateNode(I, St); |
Ted Kremenek | 754607e | 2008-02-13 00:24:44 +0000 | [diff] [blame] | 486 | return; |
| 487 | } |
| 488 | } |
| 489 | |
| 490 | assert (false && "No block with label."); |
| 491 | return; |
| 492 | } |
| 493 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 494 | if (isa<lval::ConcreteInt>(V) || isa<UndefinedVal>(V)) { |
Ted Kremenek | 754607e | 2008-02-13 00:24:44 +0000 | [diff] [blame] | 495 | // Dispatch to the first target and mark it as a sink. |
Ted Kremenek | 24f1a96 | 2008-02-13 17:27:37 +0000 | [diff] [blame] | 496 | NodeTy* N = builder.generateNode(builder.begin(), St, true); |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 497 | UndefBranches.insert(N); |
Ted Kremenek | 754607e | 2008-02-13 00:24:44 +0000 | [diff] [blame] | 498 | return; |
| 499 | } |
| 500 | |
| 501 | // This is really a catch-all. We don't support symbolics yet. |
| 502 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 503 | assert (V.isUnknown()); |
Ted Kremenek | 754607e | 2008-02-13 00:24:44 +0000 | [diff] [blame] | 504 | |
| 505 | for (iterator I=builder.begin(), E=builder.end(); I != E; ++I) |
Ted Kremenek | 24f1a96 | 2008-02-13 17:27:37 +0000 | [diff] [blame] | 506 | builder.generateNode(I, St); |
Ted Kremenek | 754607e | 2008-02-13 00:24:44 +0000 | [diff] [blame] | 507 | } |
Ted Kremenek | f233d48 | 2008-02-05 00:26:40 +0000 | [diff] [blame] | 508 | |
Ted Kremenek | e695e1c | 2008-04-15 23:06:53 +0000 | [diff] [blame] | 509 | |
| 510 | void GRExprEngine::VisitGuardedExpr(Expr* Ex, Expr* L, Expr* R, |
| 511 | NodeTy* Pred, NodeSet& Dst) { |
| 512 | |
| 513 | assert (Ex == CurrentStmt && getCFG().isBlkExpr(Ex)); |
| 514 | |
| 515 | ValueState* St = GetState(Pred); |
| 516 | RVal X = GetBlkExprRVal(St, Ex); |
| 517 | |
| 518 | assert (X.isUndef()); |
| 519 | |
| 520 | Expr* SE = (Expr*) cast<UndefinedVal>(X).getData(); |
| 521 | |
| 522 | assert (SE); |
| 523 | |
| 524 | X = GetBlkExprRVal(St, SE); |
| 525 | |
| 526 | // Make sure that we invalidate the previous binding. |
| 527 | MakeNode(Dst, Ex, Pred, StateMgr.SetRVal(St, Ex, X, true, true)); |
| 528 | } |
| 529 | |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 530 | /// ProcessSwitch - Called by GRCoreEngine. Used to generate successor |
| 531 | /// nodes by processing the 'effects' of a switch statement. |
| 532 | void GRExprEngine::ProcessSwitch(SwitchNodeBuilder& builder) { |
| 533 | |
| 534 | typedef SwitchNodeBuilder::iterator iterator; |
| 535 | |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 536 | ValueState* St = builder.getState(); |
Ted Kremenek | 692416c | 2008-02-18 22:57:02 +0000 | [diff] [blame] | 537 | Expr* CondE = builder.getCondition(); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 538 | RVal CondV = GetRVal(St, CondE); |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 539 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 540 | if (CondV.isUndef()) { |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 541 | NodeTy* N = builder.generateDefaultCaseNode(St, true); |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 542 | UndefBranches.insert(N); |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 543 | return; |
| 544 | } |
| 545 | |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 546 | ValueState* DefaultSt = St; |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 547 | |
| 548 | // While most of this can be assumed (such as the signedness), having it |
| 549 | // just computed makes sure everything makes the same assumptions end-to-end. |
Ted Kremenek | 692416c | 2008-02-18 22:57:02 +0000 | [diff] [blame] | 550 | |
Chris Lattner | 98be494 | 2008-03-05 18:54:05 +0000 | [diff] [blame] | 551 | unsigned bits = getContext().getTypeSize(CondE->getType()); |
Ted Kremenek | 692416c | 2008-02-18 22:57:02 +0000 | [diff] [blame] | 552 | |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 553 | APSInt V1(bits, false); |
| 554 | APSInt V2 = V1; |
| 555 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 556 | for (iterator I = builder.begin(), EI = builder.end(); I != EI; ++I) { |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 557 | |
| 558 | CaseStmt* Case = cast<CaseStmt>(I.getCase()); |
| 559 | |
| 560 | // Evaluate the case. |
| 561 | if (!Case->getLHS()->isIntegerConstantExpr(V1, getContext(), 0, true)) { |
| 562 | assert (false && "Case condition must evaluate to an integer constant."); |
| 563 | return; |
| 564 | } |
| 565 | |
| 566 | // Get the RHS of the case, if it exists. |
| 567 | |
| 568 | if (Expr* E = Case->getRHS()) { |
| 569 | if (!E->isIntegerConstantExpr(V2, getContext(), 0, true)) { |
| 570 | assert (false && |
| 571 | "Case condition (RHS) must evaluate to an integer constant."); |
| 572 | return ; |
| 573 | } |
| 574 | |
| 575 | assert (V1 <= V2); |
| 576 | } |
Ted Kremenek | 14a1140 | 2008-03-17 22:17:56 +0000 | [diff] [blame] | 577 | else |
| 578 | V2 = V1; |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 579 | |
| 580 | // FIXME: Eventually we should replace the logic below with a range |
| 581 | // comparison, rather than concretize the values within the range. |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 582 | // This should be easy once we have "ranges" for NonLVals. |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 583 | |
Ted Kremenek | 14a1140 | 2008-03-17 22:17:56 +0000 | [diff] [blame] | 584 | do { |
Ted Kremenek | 240f1f0 | 2008-03-07 20:13:31 +0000 | [diff] [blame] | 585 | nonlval::ConcreteInt CaseVal(BasicVals.getValue(V1)); |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 586 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 587 | RVal Res = EvalBinOp(BinaryOperator::EQ, CondV, CaseVal); |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 588 | |
| 589 | // Now "assume" that the case matches. |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 590 | |
Ted Kremenek | 361fa8e | 2008-03-12 21:45:47 +0000 | [diff] [blame] | 591 | bool isFeasible = false; |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 592 | ValueState* StNew = Assume(St, Res, true, isFeasible); |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 593 | |
| 594 | if (isFeasible) { |
| 595 | builder.generateCaseStmtNode(I, StNew); |
| 596 | |
| 597 | // If CondV evaluates to a constant, then we know that this |
| 598 | // is the *only* case that we can take, so stop evaluating the |
| 599 | // others. |
| 600 | if (isa<nonlval::ConcreteInt>(CondV)) |
| 601 | return; |
| 602 | } |
| 603 | |
| 604 | // Now "assume" that the case doesn't match. Add this state |
| 605 | // to the default state (if it is feasible). |
| 606 | |
Ted Kremenek | 361fa8e | 2008-03-12 21:45:47 +0000 | [diff] [blame] | 607 | isFeasible = false; |
Ted Kremenek | 6cb0b54 | 2008-02-14 19:37:24 +0000 | [diff] [blame] | 608 | StNew = Assume(DefaultSt, Res, false, isFeasible); |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 609 | |
| 610 | if (isFeasible) |
| 611 | DefaultSt = StNew; |
| 612 | |
Ted Kremenek | 14a1140 | 2008-03-17 22:17:56 +0000 | [diff] [blame] | 613 | // Concretize the next value in the range. |
| 614 | if (V1 == V2) |
| 615 | break; |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 616 | |
Ted Kremenek | 14a1140 | 2008-03-17 22:17:56 +0000 | [diff] [blame] | 617 | ++V1; |
Ted Kremenek | 58cda6f | 2008-03-17 22:18:22 +0000 | [diff] [blame] | 618 | assert (V1 <= V2); |
Ted Kremenek | 14a1140 | 2008-03-17 22:17:56 +0000 | [diff] [blame] | 619 | |
| 620 | } while (true); |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 621 | } |
| 622 | |
| 623 | // If we reach here, than we know that the default branch is |
| 624 | // possible. |
| 625 | builder.generateDefaultCaseNode(DefaultSt); |
| 626 | } |
| 627 | |
Ted Kremenek | e695e1c | 2008-04-15 23:06:53 +0000 | [diff] [blame] | 628 | //===----------------------------------------------------------------------===// |
| 629 | // Transfer functions: logical operations ('&&', '||'). |
| 630 | //===----------------------------------------------------------------------===// |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 631 | |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 632 | void GRExprEngine::VisitLogicalExpr(BinaryOperator* B, NodeTy* Pred, |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 633 | NodeSet& Dst) { |
Ted Kremenek | 9dca062 | 2008-02-19 00:22:37 +0000 | [diff] [blame] | 634 | |
Ted Kremenek | 05a2378 | 2008-02-26 19:05:15 +0000 | [diff] [blame] | 635 | assert (B->getOpcode() == BinaryOperator::LAnd || |
| 636 | B->getOpcode() == BinaryOperator::LOr); |
| 637 | |
| 638 | assert (B == CurrentStmt && getCFG().isBlkExpr(B)); |
| 639 | |
Ted Kremenek | 0d093d3 | 2008-03-10 04:11:42 +0000 | [diff] [blame] | 640 | ValueState* St = GetState(Pred); |
Ted Kremenek | 05a2378 | 2008-02-26 19:05:15 +0000 | [diff] [blame] | 641 | RVal X = GetBlkExprRVal(St, B); |
| 642 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 643 | assert (X.isUndef()); |
Ted Kremenek | 05a2378 | 2008-02-26 19:05:15 +0000 | [diff] [blame] | 644 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 645 | Expr* Ex = (Expr*) cast<UndefinedVal>(X).getData(); |
Ted Kremenek | 05a2378 | 2008-02-26 19:05:15 +0000 | [diff] [blame] | 646 | |
| 647 | assert (Ex); |
| 648 | |
| 649 | if (Ex == B->getRHS()) { |
| 650 | |
| 651 | X = GetBlkExprRVal(St, Ex); |
| 652 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 653 | // Handle undefined values. |
Ted Kremenek | 58b3321 | 2008-02-26 19:40:44 +0000 | [diff] [blame] | 654 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 655 | if (X.isUndef()) { |
Ted Kremenek | 0e561a3 | 2008-03-21 21:30:14 +0000 | [diff] [blame] | 656 | MakeNode(Dst, B, Pred, SetBlkExprRVal(St, B, X)); |
Ted Kremenek | 58b3321 | 2008-02-26 19:40:44 +0000 | [diff] [blame] | 657 | return; |
| 658 | } |
| 659 | |
Ted Kremenek | 05a2378 | 2008-02-26 19:05:15 +0000 | [diff] [blame] | 660 | // We took the RHS. Because the value of the '&&' or '||' expression must |
| 661 | // evaluate to 0 or 1, we must assume the value of the RHS evaluates to 0 |
| 662 | // or 1. Alternatively, we could take a lazy approach, and calculate this |
| 663 | // value later when necessary. We don't have the machinery in place for |
| 664 | // this right now, and since most logical expressions are used for branches, |
| 665 | // the payoff is not likely to be large. Instead, we do eager evaluation. |
| 666 | |
| 667 | bool isFeasible = false; |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 668 | ValueState* NewState = Assume(St, X, true, isFeasible); |
Ted Kremenek | 05a2378 | 2008-02-26 19:05:15 +0000 | [diff] [blame] | 669 | |
| 670 | if (isFeasible) |
Ted Kremenek | 0e561a3 | 2008-03-21 21:30:14 +0000 | [diff] [blame] | 671 | MakeNode(Dst, B, Pred, |
| 672 | SetBlkExprRVal(NewState, B, MakeConstantVal(1U, B))); |
Ted Kremenek | 05a2378 | 2008-02-26 19:05:15 +0000 | [diff] [blame] | 673 | |
| 674 | isFeasible = false; |
| 675 | NewState = Assume(St, X, false, isFeasible); |
| 676 | |
| 677 | if (isFeasible) |
Ted Kremenek | 0e561a3 | 2008-03-21 21:30:14 +0000 | [diff] [blame] | 678 | MakeNode(Dst, B, Pred, |
| 679 | SetBlkExprRVal(NewState, B, MakeConstantVal(0U, B))); |
Ted Kremenek | f233d48 | 2008-02-05 00:26:40 +0000 | [diff] [blame] | 680 | } |
| 681 | else { |
Ted Kremenek | 05a2378 | 2008-02-26 19:05:15 +0000 | [diff] [blame] | 682 | // We took the LHS expression. Depending on whether we are '&&' or |
| 683 | // '||' we know what the value of the expression is via properties of |
| 684 | // the short-circuiting. |
| 685 | |
| 686 | X = MakeConstantVal( B->getOpcode() == BinaryOperator::LAnd ? 0U : 1U, B); |
Ted Kremenek | 0e561a3 | 2008-03-21 21:30:14 +0000 | [diff] [blame] | 687 | MakeNode(Dst, B, Pred, SetBlkExprRVal(St, B, X)); |
Ted Kremenek | f233d48 | 2008-02-05 00:26:40 +0000 | [diff] [blame] | 688 | } |
Ted Kremenek | f233d48 | 2008-02-05 00:26:40 +0000 | [diff] [blame] | 689 | } |
Ted Kremenek | 05a2378 | 2008-02-26 19:05:15 +0000 | [diff] [blame] | 690 | |
Ted Kremenek | e695e1c | 2008-04-15 23:06:53 +0000 | [diff] [blame] | 691 | //===----------------------------------------------------------------------===// |
Ted Kremenek | ec96a2d | 2008-04-16 18:39:06 +0000 | [diff] [blame^] | 692 | // Transfer functions: Loads and stores. |
Ted Kremenek | e695e1c | 2008-04-15 23:06:53 +0000 | [diff] [blame] | 693 | //===----------------------------------------------------------------------===// |
Ted Kremenek | d27f816 | 2008-01-15 23:55:06 +0000 | [diff] [blame] | 694 | |
Ted Kremenek | 44842c2 | 2008-02-13 18:06:44 +0000 | [diff] [blame] | 695 | void GRExprEngine::VisitDeclRefExpr(DeclRefExpr* D, NodeTy* Pred, NodeSet& Dst){ |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 696 | |
Ted Kremenek | 3271f8d | 2008-02-07 04:16:04 +0000 | [diff] [blame] | 697 | if (D != CurrentStmt) { |
| 698 | Dst.Add(Pred); // No-op. Simply propagate the current state unchanged. |
| 699 | return; |
| 700 | } |
| 701 | |
| 702 | // If we are here, we are loading the value of the decl and binding |
| 703 | // it to the block-level expression. |
| 704 | |
Ted Kremenek | 0d093d3 | 2008-03-10 04:11:42 +0000 | [diff] [blame] | 705 | ValueState* St = GetState(Pred); |
Ted Kremenek | 9b5551d | 2008-03-09 03:30:59 +0000 | [diff] [blame] | 706 | RVal X = RVal::MakeVal(BasicVals, D); |
| 707 | RVal Y = isa<lval::DeclVal>(X) ? GetRVal(St, cast<lval::DeclVal>(X)) : X; |
Ted Kremenek | 0e561a3 | 2008-03-21 21:30:14 +0000 | [diff] [blame] | 708 | MakeNode(Dst, D, Pred, SetBlkExprRVal(St, D, Y)); |
Ted Kremenek | 3271f8d | 2008-02-07 04:16:04 +0000 | [diff] [blame] | 709 | } |
| 710 | |
Ted Kremenek | ec96a2d | 2008-04-16 18:39:06 +0000 | [diff] [blame^] | 711 | void GRExprEngine::VisitStore(NodeSet& Dst, Expr* E, NodeTy* Pred, |
| 712 | ValueState* St, LVal TargetLV, RVal Val) { |
| 713 | |
| 714 | assert (Builder && "GRStmtNodeBuilder must be defined."); |
| 715 | |
| 716 | unsigned size = Dst.size(); |
| 717 | SaveAndRestore<bool> OldSink(Builder->BuildSinks); |
| 718 | |
| 719 | EvalStore(Dst, E, Pred, St, TargetLV, Val); |
| 720 | |
| 721 | // Handle the case where no nodes where generated. Auto-generate that |
| 722 | // contains the updated state if we aren't generating sinks. |
| 723 | |
| 724 | if (!Builder->BuildSinks && Dst.size() == size) |
| 725 | MakeNode(Dst, E, Pred, SetRVal(St, TargetLV, Val)); |
| 726 | } |
| 727 | |
Ted Kremenek | e695e1c | 2008-04-15 23:06:53 +0000 | [diff] [blame] | 728 | //===----------------------------------------------------------------------===// |
| 729 | // Transfer function: Function calls. |
| 730 | //===----------------------------------------------------------------------===// |
| 731 | |
Ted Kremenek | de43424 | 2008-02-19 01:44:53 +0000 | [diff] [blame] | 732 | void GRExprEngine::VisitCall(CallExpr* CE, NodeTy* Pred, |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 733 | CallExpr::arg_iterator AI, |
| 734 | CallExpr::arg_iterator AE, |
Ted Kremenek | de43424 | 2008-02-19 01:44:53 +0000 | [diff] [blame] | 735 | NodeSet& Dst) { |
| 736 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 737 | // Process the arguments. |
| 738 | |
| 739 | if (AI != AE) { |
Ted Kremenek | de43424 | 2008-02-19 01:44:53 +0000 | [diff] [blame] | 740 | |
Ted Kremenek | ed2d2ed | 2008-03-04 00:56:45 +0000 | [diff] [blame] | 741 | NodeSet DstTmp; |
Ted Kremenek | d753f3c | 2008-03-04 22:01:56 +0000 | [diff] [blame] | 742 | Visit(*AI, Pred, DstTmp); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 743 | ++AI; |
| 744 | |
Ted Kremenek | d753f3c | 2008-03-04 22:01:56 +0000 | [diff] [blame] | 745 | for (NodeSet::iterator DI=DstTmp.begin(), DE=DstTmp.end(); DI != DE; ++DI) |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 746 | VisitCall(CE, *DI, AI, AE, Dst); |
Ted Kremenek | de43424 | 2008-02-19 01:44:53 +0000 | [diff] [blame] | 747 | |
| 748 | return; |
| 749 | } |
| 750 | |
| 751 | // If we reach here we have processed all of the arguments. Evaluate |
| 752 | // the callee expression. |
Ted Kremenek | a1354a5 | 2008-03-03 16:47:31 +0000 | [diff] [blame] | 753 | |
Ted Kremenek | 994a09b | 2008-02-25 21:16:03 +0000 | [diff] [blame] | 754 | NodeSet DstTmp; |
| 755 | Expr* Callee = CE->getCallee()->IgnoreParenCasts(); |
Ted Kremenek | a1354a5 | 2008-03-03 16:47:31 +0000 | [diff] [blame] | 756 | |
Ted Kremenek | 994a09b | 2008-02-25 21:16:03 +0000 | [diff] [blame] | 757 | VisitLVal(Callee, Pred, DstTmp); |
Ted Kremenek | a1354a5 | 2008-03-03 16:47:31 +0000 | [diff] [blame] | 758 | |
| 759 | if (DstTmp.empty()) |
| 760 | DstTmp.Add(Pred); |
Ted Kremenek | de43424 | 2008-02-19 01:44:53 +0000 | [diff] [blame] | 761 | |
| 762 | // Finally, evaluate the function call. |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 763 | for (NodeSet::iterator DI = DstTmp.begin(), DE = DstTmp.end(); DI!=DE; ++DI) { |
| 764 | |
Ted Kremenek | 0d093d3 | 2008-03-10 04:11:42 +0000 | [diff] [blame] | 765 | ValueState* St = GetState(*DI); |
Ted Kremenek | 994a09b | 2008-02-25 21:16:03 +0000 | [diff] [blame] | 766 | RVal L = GetLVal(St, Callee); |
Ted Kremenek | de43424 | 2008-02-19 01:44:53 +0000 | [diff] [blame] | 767 | |
Ted Kremenek | a1354a5 | 2008-03-03 16:47:31 +0000 | [diff] [blame] | 768 | // FIXME: Add support for symbolic function calls (calls involving |
| 769 | // function pointer values that are symbolic). |
| 770 | |
| 771 | // Check for undefined control-flow or calls to NULL. |
| 772 | |
Ted Kremenek | 5e03fcb | 2008-02-29 23:14:48 +0000 | [diff] [blame] | 773 | if (L.isUndef() || isa<lval::ConcreteInt>(L)) { |
Ted Kremenek | de43424 | 2008-02-19 01:44:53 +0000 | [diff] [blame] | 774 | NodeTy* N = Builder->generateNode(CE, St, *DI); |
Ted Kremenek | d753f3c | 2008-03-04 22:01:56 +0000 | [diff] [blame] | 775 | |
Ted Kremenek | 2ded35a | 2008-02-29 23:53:11 +0000 | [diff] [blame] | 776 | if (N) { |
| 777 | N->markAsSink(); |
| 778 | BadCalls.insert(N); |
| 779 | } |
Ted Kremenek | d753f3c | 2008-03-04 22:01:56 +0000 | [diff] [blame] | 780 | |
Ted Kremenek | de43424 | 2008-02-19 01:44:53 +0000 | [diff] [blame] | 781 | continue; |
Ted Kremenek | 4bf38da | 2008-03-05 21:15:02 +0000 | [diff] [blame] | 782 | } |
| 783 | |
| 784 | // Check for the "noreturn" attribute. |
| 785 | |
| 786 | SaveAndRestore<bool> OldSink(Builder->BuildSinks); |
| 787 | |
Ted Kremenek | 636e6ba | 2008-03-14 21:58:42 +0000 | [diff] [blame] | 788 | if (isa<lval::FuncVal>(L)) { |
| 789 | |
| 790 | FunctionDecl* FD = cast<lval::FuncVal>(L).getDecl(); |
| 791 | |
| 792 | if (FD->getAttr<NoReturnAttr>()) |
Ted Kremenek | 4bf38da | 2008-03-05 21:15:02 +0000 | [diff] [blame] | 793 | Builder->BuildSinks = true; |
Ted Kremenek | 636e6ba | 2008-03-14 21:58:42 +0000 | [diff] [blame] | 794 | else { |
| 795 | // HACK: Some functions are not marked noreturn, and don't return. |
| 796 | // Here are a few hardwired ones. If this takes too long, we can |
| 797 | // potentially cache these results. |
| 798 | const char* s = FD->getIdentifier()->getName(); |
| 799 | unsigned n = strlen(s); |
| 800 | |
| 801 | switch (n) { |
| 802 | default: |
| 803 | break; |
Ted Kremenek | 76fdbde | 2008-03-14 23:25:49 +0000 | [diff] [blame] | 804 | |
Ted Kremenek | 636e6ba | 2008-03-14 21:58:42 +0000 | [diff] [blame] | 805 | case 4: |
Ted Kremenek | 76fdbde | 2008-03-14 23:25:49 +0000 | [diff] [blame] | 806 | if (!memcmp(s, "exit", 4)) Builder->BuildSinks = true; |
| 807 | break; |
| 808 | |
| 809 | case 5: |
| 810 | if (!memcmp(s, "panic", 5)) Builder->BuildSinks = true; |
| 811 | break; |
Ted Kremenek | 636e6ba | 2008-03-14 21:58:42 +0000 | [diff] [blame] | 812 | } |
| 813 | } |
| 814 | } |
Ted Kremenek | 4bf38da | 2008-03-05 21:15:02 +0000 | [diff] [blame] | 815 | |
| 816 | // Evaluate the call. |
| 817 | |
Ted Kremenek | a1354a5 | 2008-03-03 16:47:31 +0000 | [diff] [blame] | 818 | |
Ted Kremenek | d753f3c | 2008-03-04 22:01:56 +0000 | [diff] [blame] | 819 | bool invalidateArgs = false; |
Ted Kremenek | de43424 | 2008-02-19 01:44:53 +0000 | [diff] [blame] | 820 | |
Ted Kremenek | 03da0d7 | 2008-02-21 19:46:04 +0000 | [diff] [blame] | 821 | if (L.isUnknown()) { |
Ted Kremenek | d753f3c | 2008-03-04 22:01:56 +0000 | [diff] [blame] | 822 | // Check for an "unknown" callee. |
| 823 | invalidateArgs = true; |
| 824 | } |
| 825 | else if (isa<lval::FuncVal>(L)) { |
| 826 | |
| 827 | IdentifierInfo* Info = cast<lval::FuncVal>(L).getDecl()->getIdentifier(); |
| 828 | |
Ted Kremenek | 55aea31 | 2008-03-05 22:59:42 +0000 | [diff] [blame] | 829 | if (unsigned id = Info->getBuiltinID()) { |
| 830 | switch (id) { |
| 831 | case Builtin::BI__builtin_expect: { |
| 832 | // For __builtin_expect, just return the value of the subexpression. |
| 833 | assert (CE->arg_begin() != CE->arg_end()); |
| 834 | RVal X = GetRVal(St, *(CE->arg_begin())); |
Ted Kremenek | 0e561a3 | 2008-03-21 21:30:14 +0000 | [diff] [blame] | 835 | MakeNode(Dst, CE, *DI, SetRVal(St, CE, X)); |
Ted Kremenek | 55aea31 | 2008-03-05 22:59:42 +0000 | [diff] [blame] | 836 | continue; |
| 837 | } |
| 838 | |
| 839 | default: |
| 840 | invalidateArgs = true; |
| 841 | break; |
| 842 | } |
| 843 | } |
Ted Kremenek | d753f3c | 2008-03-04 22:01:56 +0000 | [diff] [blame] | 844 | } |
| 845 | |
| 846 | if (invalidateArgs) { |
Ted Kremenek | 03da0d7 | 2008-02-21 19:46:04 +0000 | [diff] [blame] | 847 | // Invalidate all arguments passed in by reference (LVals). |
| 848 | for (CallExpr::arg_iterator I = CE->arg_begin(), E = CE->arg_end(); |
| 849 | I != E; ++I) { |
| 850 | RVal V = GetRVal(St, *I); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 851 | |
Ted Kremenek | 03da0d7 | 2008-02-21 19:46:04 +0000 | [diff] [blame] | 852 | if (isa<LVal>(V)) |
| 853 | St = SetRVal(St, cast<LVal>(V), UnknownVal()); |
Ted Kremenek | 4bf38da | 2008-03-05 21:15:02 +0000 | [diff] [blame] | 854 | } |
| 855 | |
Ted Kremenek | 0e561a3 | 2008-03-21 21:30:14 +0000 | [diff] [blame] | 856 | MakeNode(Dst, CE, *DI, St); |
Ted Kremenek | 03da0d7 | 2008-02-21 19:46:04 +0000 | [diff] [blame] | 857 | } |
Ted Kremenek | d753f3c | 2008-03-04 22:01:56 +0000 | [diff] [blame] | 858 | else { |
| 859 | |
| 860 | // Check any arguments passed-by-value against being undefined. |
| 861 | |
| 862 | bool badArg = false; |
| 863 | |
| 864 | for (CallExpr::arg_iterator I = CE->arg_begin(), E = CE->arg_end(); |
| 865 | I != E; ++I) { |
| 866 | |
Ted Kremenek | 0d093d3 | 2008-03-10 04:11:42 +0000 | [diff] [blame] | 867 | if (GetRVal(GetState(*DI), *I).isUndef()) { |
| 868 | NodeTy* N = Builder->generateNode(CE, GetState(*DI), *DI); |
Ted Kremenek | d753f3c | 2008-03-04 22:01:56 +0000 | [diff] [blame] | 869 | |
| 870 | if (N) { |
| 871 | N->markAsSink(); |
| 872 | UndefArgs[N] = *I; |
| 873 | } |
| 874 | |
| 875 | badArg = true; |
| 876 | break; |
| 877 | } |
| 878 | } |
| 879 | |
| 880 | if (badArg) |
| 881 | continue; |
| 882 | |
| 883 | // Dispatch to the plug-in transfer function. |
Ted Kremenek | 330dddd | 2008-03-05 00:33:14 +0000 | [diff] [blame] | 884 | |
| 885 | unsigned size = Dst.size(); |
| 886 | |
Ted Kremenek | 940b1d8 | 2008-04-10 23:44:06 +0000 | [diff] [blame] | 887 | SaveAndRestore<bool> OldSink(Builder->BuildSinks); |
| 888 | |
Ted Kremenek | 330dddd | 2008-03-05 00:33:14 +0000 | [diff] [blame] | 889 | EvalCall(Dst, CE, cast<LVal>(L), *DI); |
| 890 | |
Ted Kremenek | e695e1c | 2008-04-15 23:06:53 +0000 | [diff] [blame] | 891 | // Handle the case where no nodes where generated. Auto-generate that |
| 892 | // contains the updated state if we aren't generating sinks. |
| 893 | |
Ted Kremenek | 5dc7f8b | 2008-03-05 22:49:16 +0000 | [diff] [blame] | 894 | if (!Builder->BuildSinks && Dst.size() == size) |
Ted Kremenek | 0e561a3 | 2008-03-21 21:30:14 +0000 | [diff] [blame] | 895 | MakeNode(Dst, CE, *DI, St); |
Ted Kremenek | d753f3c | 2008-03-04 22:01:56 +0000 | [diff] [blame] | 896 | } |
Ted Kremenek | de43424 | 2008-02-19 01:44:53 +0000 | [diff] [blame] | 897 | } |
| 898 | } |
| 899 | |
Ted Kremenek | e695e1c | 2008-04-15 23:06:53 +0000 | [diff] [blame] | 900 | //===----------------------------------------------------------------------===// |
| 901 | // Transfer function: Objective-C message expressions. |
| 902 | //===----------------------------------------------------------------------===// |
| 903 | |
| 904 | void GRExprEngine::VisitObjCMessageExpr(ObjCMessageExpr* ME, NodeTy* Pred, |
| 905 | NodeSet& Dst){ |
| 906 | |
| 907 | VisitObjCMessageExprArgHelper(ME, ME->arg_begin(), ME->arg_end(), |
| 908 | Pred, Dst); |
| 909 | } |
| 910 | |
| 911 | void GRExprEngine::VisitObjCMessageExprArgHelper(ObjCMessageExpr* ME, |
| 912 | ObjCMessageExpr::arg_iterator AI, |
| 913 | ObjCMessageExpr::arg_iterator AE, |
| 914 | NodeTy* Pred, NodeSet& Dst) { |
| 915 | if (AI == AE) { |
| 916 | |
| 917 | // Process the receiver. |
| 918 | |
| 919 | if (Expr* Receiver = ME->getReceiver()) { |
| 920 | NodeSet Tmp; |
| 921 | Visit(Receiver, Pred, Tmp); |
| 922 | |
| 923 | for (NodeSet::iterator NI = Tmp.begin(), NE = Tmp.end(); NI != NE; ++NI) |
| 924 | VisitObjCMessageExprDispatchHelper(ME, *NI, Dst); |
| 925 | |
| 926 | return; |
| 927 | } |
| 928 | |
| 929 | VisitObjCMessageExprDispatchHelper(ME, Pred, Dst); |
| 930 | return; |
| 931 | } |
| 932 | |
| 933 | NodeSet Tmp; |
| 934 | Visit(*AI, Pred, Tmp); |
| 935 | |
| 936 | ++AI; |
| 937 | |
| 938 | for (NodeSet::iterator NI = Tmp.begin(), NE = Tmp.end(); NI != NE; ++NI) |
| 939 | VisitObjCMessageExprArgHelper(ME, AI, AE, *NI, Dst); |
| 940 | } |
| 941 | |
| 942 | void GRExprEngine::VisitObjCMessageExprDispatchHelper(ObjCMessageExpr* ME, |
| 943 | NodeTy* Pred, |
| 944 | NodeSet& Dst) { |
| 945 | |
| 946 | // FIXME: More logic for the processing the method call. |
| 947 | |
| 948 | ValueState* St = GetState(Pred); |
| 949 | |
| 950 | if (Expr* Receiver = ME->getReceiver()) { |
| 951 | |
| 952 | RVal L = GetRVal(St, Receiver); |
| 953 | |
| 954 | // Check for undefined control-flow or calls to NULL. |
| 955 | |
| 956 | if (L.isUndef()) { |
| 957 | NodeTy* N = Builder->generateNode(ME, St, Pred); |
| 958 | |
| 959 | if (N) { |
| 960 | N->markAsSink(); |
| 961 | UndefReceivers.insert(N); |
| 962 | } |
| 963 | |
| 964 | return; |
| 965 | } |
| 966 | } |
| 967 | |
| 968 | // Check for any arguments that are uninitialized/undefined. |
| 969 | |
| 970 | for (ObjCMessageExpr::arg_iterator I = ME->arg_begin(), E = ME->arg_end(); |
| 971 | I != E; ++I) { |
| 972 | |
| 973 | if (GetRVal(St, *I).isUndef()) { |
| 974 | |
| 975 | // Generate an error node for passing an uninitialized/undefined value |
| 976 | // as an argument to a message expression. This node is a sink. |
| 977 | NodeTy* N = Builder->generateNode(ME, St, Pred); |
| 978 | |
| 979 | if (N) { |
| 980 | N->markAsSink(); |
| 981 | MsgExprUndefArgs[N] = *I; |
| 982 | } |
| 983 | |
| 984 | return; |
| 985 | } |
| 986 | } |
| 987 | // Dispatch to plug-in transfer function. |
| 988 | |
| 989 | unsigned size = Dst.size(); |
| 990 | SaveAndRestore<bool> OldSink(Builder->BuildSinks); |
| 991 | |
| 992 | EvalObjCMessageExpr(Dst, ME, Pred); |
| 993 | |
| 994 | // Handle the case where no nodes where generated. Auto-generate that |
| 995 | // contains the updated state if we aren't generating sinks. |
| 996 | |
| 997 | if (!Builder->BuildSinks && Dst.size() == size) |
| 998 | MakeNode(Dst, ME, Pred, St); |
| 999 | } |
| 1000 | |
| 1001 | //===----------------------------------------------------------------------===// |
| 1002 | // Transfer functions: Miscellaneous statements. |
| 1003 | //===----------------------------------------------------------------------===// |
| 1004 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1005 | void GRExprEngine::VisitCast(Expr* CastE, Expr* Ex, NodeTy* Pred, NodeSet& Dst){ |
Ted Kremenek | 874d63f | 2008-01-24 02:02:54 +0000 | [diff] [blame] | 1006 | |
Ted Kremenek | 5d3003a | 2008-02-19 18:52:54 +0000 | [diff] [blame] | 1007 | NodeSet S1; |
Ted Kremenek | 5d3003a | 2008-02-19 18:52:54 +0000 | [diff] [blame] | 1008 | QualType T = CastE->getType(); |
| 1009 | |
Ted Kremenek | 65cfb73 | 2008-03-04 22:16:08 +0000 | [diff] [blame] | 1010 | if (T->isReferenceType()) |
| 1011 | VisitLVal(Ex, Pred, S1); |
| 1012 | else |
| 1013 | Visit(Ex, Pred, S1); |
| 1014 | |
Ted Kremenek | 402563b | 2008-02-19 18:47:04 +0000 | [diff] [blame] | 1015 | // Check for redundant casts or casting to "void" |
| 1016 | if (T->isVoidType() || |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1017 | Ex->getType() == T || |
| 1018 | (T->isPointerType() && Ex->getType()->isFunctionType())) { |
Ted Kremenek | 5d3003a | 2008-02-19 18:52:54 +0000 | [diff] [blame] | 1019 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1020 | for (NodeSet::iterator I1 = S1.begin(), E1 = S1.end(); I1 != E1; ++I1) |
Ted Kremenek | 5d3003a | 2008-02-19 18:52:54 +0000 | [diff] [blame] | 1021 | Dst.Add(*I1); |
| 1022 | |
Ted Kremenek | 874d63f | 2008-01-24 02:02:54 +0000 | [diff] [blame] | 1023 | return; |
| 1024 | } |
| 1025 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1026 | for (NodeSet::iterator I1 = S1.begin(), E1 = S1.end(); I1 != E1; ++I1) { |
Ted Kremenek | 874d63f | 2008-01-24 02:02:54 +0000 | [diff] [blame] | 1027 | NodeTy* N = *I1; |
Ted Kremenek | 0d093d3 | 2008-03-10 04:11:42 +0000 | [diff] [blame] | 1028 | ValueState* St = GetState(N); |
Ted Kremenek | 65cfb73 | 2008-03-04 22:16:08 +0000 | [diff] [blame] | 1029 | |
| 1030 | RVal V = T->isReferenceType() ? GetLVal(St, Ex) : GetRVal(St, Ex); |
| 1031 | |
Ted Kremenek | 0e561a3 | 2008-03-21 21:30:14 +0000 | [diff] [blame] | 1032 | MakeNode(Dst, CastE, N, SetRVal(St, CastE, EvalCast(V, CastE->getType()))); |
Ted Kremenek | 874d63f | 2008-01-24 02:02:54 +0000 | [diff] [blame] | 1033 | } |
Ted Kremenek | 9de04c4 | 2008-01-24 20:55:43 +0000 | [diff] [blame] | 1034 | } |
| 1035 | |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 1036 | void GRExprEngine::VisitDeclStmt(DeclStmt* DS, GRExprEngine::NodeTy* Pred, |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1037 | GRExprEngine::NodeSet& Dst) { |
Ted Kremenek | 9de04c4 | 2008-01-24 20:55:43 +0000 | [diff] [blame] | 1038 | |
Ted Kremenek | 0d093d3 | 2008-03-10 04:11:42 +0000 | [diff] [blame] | 1039 | ValueState* St = GetState(Pred); |
Ted Kremenek | 9de04c4 | 2008-01-24 20:55:43 +0000 | [diff] [blame] | 1040 | |
| 1041 | for (const ScopedDecl* D = DS->getDecl(); D; D = D->getNextDeclarator()) |
Ted Kremenek | 403c181 | 2008-01-28 22:51:57 +0000 | [diff] [blame] | 1042 | if (const VarDecl* VD = dyn_cast<VarDecl>(D)) { |
Ted Kremenek | c2c95b0 | 2008-02-19 00:29:51 +0000 | [diff] [blame] | 1043 | |
| 1044 | // FIXME: Add support for local arrays. |
| 1045 | if (VD->getType()->isArrayType()) |
| 1046 | continue; |
| 1047 | |
Ted Kremenek | b0ab212 | 2008-02-27 19:21:33 +0000 | [diff] [blame] | 1048 | const Expr* Ex = VD->getInit(); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1049 | |
Ted Kremenek | b0ab212 | 2008-02-27 19:21:33 +0000 | [diff] [blame] | 1050 | if (!VD->hasGlobalStorage() || VD->getStorageClass() == VarDecl::Static) { |
| 1051 | |
| 1052 | // In this context, Static => Local variable. |
| 1053 | |
| 1054 | assert (!VD->getStorageClass() == VarDecl::Static || |
Steve Naroff | 248a753 | 2008-04-15 22:42:06 +0000 | [diff] [blame] | 1055 | !VD->isFileVarDecl()); |
Ted Kremenek | b0ab212 | 2008-02-27 19:21:33 +0000 | [diff] [blame] | 1056 | |
| 1057 | // If there is no initializer, set the value of the |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 1058 | // variable to "Undefined". |
Ted Kremenek | b0ab212 | 2008-02-27 19:21:33 +0000 | [diff] [blame] | 1059 | // |
| 1060 | // FIXME: static variables may have an initializer, but the second |
| 1061 | // time a function is called those values may not be current. |
Ted Kremenek | fcb092b | 2008-03-04 20:40:11 +0000 | [diff] [blame] | 1062 | |
| 1063 | QualType T = VD->getType(); |
Ted Kremenek | b0ab212 | 2008-02-27 19:21:33 +0000 | [diff] [blame] | 1064 | |
Ted Kremenek | 16d8156 | 2008-03-04 04:18:04 +0000 | [diff] [blame] | 1065 | if ( VD->getStorageClass() == VarDecl::Static) { |
Ted Kremenek | 16d8156 | 2008-03-04 04:18:04 +0000 | [diff] [blame] | 1066 | |
| 1067 | // C99: 6.7.8 Initialization |
| 1068 | // If an object that has static storage duration is not initialized |
| 1069 | // explicitly, then: |
| 1070 | // —if it has pointer type, it is initialized to a null pointer; |
| 1071 | // —if it has arithmetic type, it is initialized to (positive or |
| 1072 | // unsigned) zero; |
| 1073 | |
Ted Kremenek | fcb092b | 2008-03-04 20:40:11 +0000 | [diff] [blame] | 1074 | // FIXME: Handle structs. Now we treat their values as unknown. |
| 1075 | |
Ted Kremenek | 16d8156 | 2008-03-04 04:18:04 +0000 | [diff] [blame] | 1076 | if (T->isPointerType()) { |
| 1077 | |
| 1078 | St = SetRVal(St, lval::DeclVal(VD), |
Ted Kremenek | 240f1f0 | 2008-03-07 20:13:31 +0000 | [diff] [blame] | 1079 | lval::ConcreteInt(BasicVals.getValue(0, T))); |
Ted Kremenek | 16d8156 | 2008-03-04 04:18:04 +0000 | [diff] [blame] | 1080 | } |
| 1081 | else if (T->isIntegerType()) { |
| 1082 | |
| 1083 | St = SetRVal(St, lval::DeclVal(VD), |
Ted Kremenek | 240f1f0 | 2008-03-07 20:13:31 +0000 | [diff] [blame] | 1084 | nonlval::ConcreteInt(BasicVals.getValue(0, T))); |
Ted Kremenek | 16d8156 | 2008-03-04 04:18:04 +0000 | [diff] [blame] | 1085 | } |
| 1086 | |
Ted Kremenek | fcb092b | 2008-03-04 20:40:11 +0000 | [diff] [blame] | 1087 | |
Ted Kremenek | 16d8156 | 2008-03-04 04:18:04 +0000 | [diff] [blame] | 1088 | } |
Ted Kremenek | fcb092b | 2008-03-04 20:40:11 +0000 | [diff] [blame] | 1089 | else { |
Ted Kremenek | 16d8156 | 2008-03-04 04:18:04 +0000 | [diff] [blame] | 1090 | |
Ted Kremenek | fcb092b | 2008-03-04 20:40:11 +0000 | [diff] [blame] | 1091 | // FIXME: Handle structs. Now we treat them as unknown. What |
| 1092 | // we need to do is treat their members as unknown. |
| 1093 | |
| 1094 | if (T->isPointerType() || T->isIntegerType()) |
| 1095 | St = SetRVal(St, lval::DeclVal(VD), |
| 1096 | Ex ? GetRVal(St, Ex) : UndefinedVal()); |
| 1097 | } |
Ted Kremenek | b0ab212 | 2008-02-27 19:21:33 +0000 | [diff] [blame] | 1098 | } |
Ted Kremenek | 403c181 | 2008-01-28 22:51:57 +0000 | [diff] [blame] | 1099 | } |
Ted Kremenek | 9de04c4 | 2008-01-24 20:55:43 +0000 | [diff] [blame] | 1100 | |
Ted Kremenek | 0e561a3 | 2008-03-21 21:30:14 +0000 | [diff] [blame] | 1101 | MakeNode(Dst, DS, Pred, St); |
Ted Kremenek | 9de04c4 | 2008-01-24 20:55:43 +0000 | [diff] [blame] | 1102 | } |
Ted Kremenek | 874d63f | 2008-01-24 02:02:54 +0000 | [diff] [blame] | 1103 | |
Ted Kremenek | f233d48 | 2008-02-05 00:26:40 +0000 | [diff] [blame] | 1104 | |
Ted Kremenek | f233d48 | 2008-02-05 00:26:40 +0000 | [diff] [blame] | 1105 | |
Ted Kremenek | d9435bf | 2008-02-12 19:49:57 +0000 | [diff] [blame] | 1106 | /// VisitSizeOfAlignOfTypeExpr - Transfer function for sizeof(type). |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1107 | void GRExprEngine::VisitSizeOfAlignOfTypeExpr(SizeOfAlignOfTypeExpr* Ex, |
| 1108 | NodeTy* Pred, |
| 1109 | NodeSet& Dst) { |
Ted Kremenek | 9ef1ec9 | 2008-02-21 18:43:30 +0000 | [diff] [blame] | 1110 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1111 | QualType T = Ex->getArgumentType(); |
Ted Kremenek | 87e8034 | 2008-03-15 03:13:20 +0000 | [diff] [blame] | 1112 | uint64_t amt; |
| 1113 | |
| 1114 | if (Ex->isSizeOf()) { |
Ted Kremenek | 9ef1ec9 | 2008-02-21 18:43:30 +0000 | [diff] [blame] | 1115 | |
Ted Kremenek | 87e8034 | 2008-03-15 03:13:20 +0000 | [diff] [blame] | 1116 | // FIXME: Add support for VLAs. |
| 1117 | if (!T.getTypePtr()->isConstantSizeType()) |
| 1118 | return; |
| 1119 | |
| 1120 | amt = 1; // Handle sizeof(void) |
| 1121 | |
| 1122 | if (T != getContext().VoidTy) |
| 1123 | amt = getContext().getTypeSize(T) / 8; |
| 1124 | |
| 1125 | } |
| 1126 | else // Get alignment of the type. |
Ted Kremenek | 897781a | 2008-03-15 03:13:55 +0000 | [diff] [blame] | 1127 | amt = getContext().getTypeAlign(T) / 8; |
Ted Kremenek | d9435bf | 2008-02-12 19:49:57 +0000 | [diff] [blame] | 1128 | |
Ted Kremenek | 0e561a3 | 2008-03-21 21:30:14 +0000 | [diff] [blame] | 1129 | MakeNode(Dst, Ex, Pred, |
Ted Kremenek | 0d093d3 | 2008-03-10 04:11:42 +0000 | [diff] [blame] | 1130 | SetRVal(GetState(Pred), Ex, |
Ted Kremenek | 87e8034 | 2008-03-15 03:13:20 +0000 | [diff] [blame] | 1131 | NonLVal::MakeVal(BasicVals, amt, Ex->getType()))); |
Ted Kremenek | d9435bf | 2008-02-12 19:49:57 +0000 | [diff] [blame] | 1132 | } |
| 1133 | |
Ted Kremenek | ffe0f43 | 2008-03-07 22:58:01 +0000 | [diff] [blame] | 1134 | void GRExprEngine::VisitDeref(UnaryOperator* U, NodeTy* Pred, |
| 1135 | NodeSet& Dst, bool GetLVal) { |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1136 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1137 | Expr* Ex = U->getSubExpr()->IgnoreParens(); |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1138 | |
| 1139 | NodeSet DstTmp; |
| 1140 | |
Ted Kremenek | 018c15f | 2008-02-26 03:44:25 +0000 | [diff] [blame] | 1141 | if (isa<DeclRefExpr>(Ex)) |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1142 | DstTmp.Add(Pred); |
| 1143 | else |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1144 | Visit(Ex, Pred, DstTmp); |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1145 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1146 | for (NodeSet::iterator I = DstTmp.begin(), DE = DstTmp.end(); I != DE; ++I) { |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1147 | |
| 1148 | NodeTy* N = *I; |
Ted Kremenek | 0d093d3 | 2008-03-10 04:11:42 +0000 | [diff] [blame] | 1149 | ValueState* St = GetState(N); |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1150 | |
| 1151 | // FIXME: Bifurcate when dereferencing a symbolic with no constraints? |
| 1152 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1153 | RVal V = GetRVal(St, Ex); |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1154 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 1155 | // Check for dereferences of undefined values. |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1156 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 1157 | if (V.isUndef()) { |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1158 | |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1159 | NodeTy* Succ = Builder->generateNode(U, St, N); |
| 1160 | |
| 1161 | if (Succ) { |
| 1162 | Succ->markAsSink(); |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 1163 | UndefDeref.insert(Succ); |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1164 | } |
| 1165 | |
| 1166 | continue; |
| 1167 | } |
| 1168 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1169 | // Check for dereferences of unknown values. Treat as No-Ops. |
| 1170 | |
| 1171 | if (V.isUnknown()) { |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1172 | Dst.Add(N); |
| 1173 | continue; |
| 1174 | } |
| 1175 | |
| 1176 | // After a dereference, one of two possible situations arise: |
| 1177 | // (1) A crash, because the pointer was NULL. |
| 1178 | // (2) The pointer is not NULL, and the dereference works. |
| 1179 | // |
| 1180 | // We add these assumptions. |
| 1181 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1182 | LVal LV = cast<LVal>(V); |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1183 | bool isFeasibleNotNull; |
| 1184 | |
| 1185 | // "Assume" that the pointer is Not-NULL. |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1186 | |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 1187 | ValueState* StNotNull = Assume(St, LV, true, isFeasibleNotNull); |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1188 | |
| 1189 | if (isFeasibleNotNull) { |
Ted Kremenek | ffe0f43 | 2008-03-07 22:58:01 +0000 | [diff] [blame] | 1190 | |
Ted Kremenek | 0e561a3 | 2008-03-21 21:30:14 +0000 | [diff] [blame] | 1191 | if (GetLVal) MakeNode(Dst, U, N, SetRVal(StNotNull, U, LV)); |
Ted Kremenek | ffe0f43 | 2008-03-07 22:58:01 +0000 | [diff] [blame] | 1192 | else { |
| 1193 | |
| 1194 | // FIXME: Currently symbolic analysis "generates" new symbols |
| 1195 | // for the contents of values. We need a better approach. |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1196 | |
Ted Kremenek | 0e561a3 | 2008-03-21 21:30:14 +0000 | [diff] [blame] | 1197 | MakeNode(Dst, U, N, SetRVal(StNotNull, U, |
Ted Kremenek | ffe0f43 | 2008-03-07 22:58:01 +0000 | [diff] [blame] | 1198 | GetRVal(StNotNull, LV, U->getType()))); |
| 1199 | } |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1200 | } |
| 1201 | |
| 1202 | bool isFeasibleNull; |
| 1203 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1204 | // Now "assume" that the pointer is NULL. |
| 1205 | |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 1206 | ValueState* StNull = Assume(St, LV, false, isFeasibleNull); |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1207 | |
| 1208 | if (isFeasibleNull) { |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1209 | |
Ted Kremenek | 0e561a3 | 2008-03-21 21:30:14 +0000 | [diff] [blame] | 1210 | // We don't use "MakeNode" here because the node will be a sink |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1211 | // and we have no intention of processing it later. |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1212 | |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1213 | NodeTy* NullNode = Builder->generateNode(U, StNull, N); |
| 1214 | |
| 1215 | if (NullNode) { |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1216 | |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1217 | NullNode->markAsSink(); |
| 1218 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1219 | if (isFeasibleNotNull) ImplicitNullDeref.insert(NullNode); |
| 1220 | else ExplicitNullDeref.insert(NullNode); |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1221 | } |
| 1222 | } |
| 1223 | } |
| 1224 | } |
| 1225 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1226 | void GRExprEngine::VisitUnaryOperator(UnaryOperator* U, NodeTy* Pred, |
| 1227 | NodeSet& Dst) { |
Ted Kremenek | 3271f8d | 2008-02-07 04:16:04 +0000 | [diff] [blame] | 1228 | |
Ted Kremenek | 7b8009a | 2008-01-24 02:28:56 +0000 | [diff] [blame] | 1229 | NodeSet S1; |
Ted Kremenek | 3271f8d | 2008-02-07 04:16:04 +0000 | [diff] [blame] | 1230 | |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1231 | assert (U->getOpcode() != UnaryOperator::Deref); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1232 | assert (U->getOpcode() != UnaryOperator::SizeOf); |
| 1233 | assert (U->getOpcode() != UnaryOperator::AlignOf); |
| 1234 | |
| 1235 | bool use_GetLVal = false; |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1236 | |
| 1237 | switch (U->getOpcode()) { |
| 1238 | case UnaryOperator::PostInc: |
| 1239 | case UnaryOperator::PostDec: |
| 1240 | case UnaryOperator::PreInc: |
| 1241 | case UnaryOperator::PreDec: |
| 1242 | case UnaryOperator::AddrOf: |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1243 | // Evalue subexpression as an LVal. |
| 1244 | use_GetLVal = true; |
| 1245 | VisitLVal(U->getSubExpr(), Pred, S1); |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1246 | break; |
| 1247 | |
| 1248 | default: |
| 1249 | Visit(U->getSubExpr(), Pred, S1); |
| 1250 | break; |
| 1251 | } |
| 1252 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1253 | for (NodeSet::iterator I1 = S1.begin(), E1 = S1.end(); I1 != E1; ++I1) { |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1254 | |
Ted Kremenek | 7b8009a | 2008-01-24 02:28:56 +0000 | [diff] [blame] | 1255 | NodeTy* N1 = *I1; |
Ted Kremenek | 0d093d3 | 2008-03-10 04:11:42 +0000 | [diff] [blame] | 1256 | ValueState* St = GetState(N1); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1257 | |
| 1258 | RVal SubV = use_GetLVal ? GetLVal(St, U->getSubExpr()) : |
| 1259 | GetRVal(St, U->getSubExpr()); |
| 1260 | |
| 1261 | if (SubV.isUnknown()) { |
| 1262 | Dst.Add(N1); |
| 1263 | continue; |
| 1264 | } |
| 1265 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 1266 | if (SubV.isUndef()) { |
Ted Kremenek | 0e561a3 | 2008-03-21 21:30:14 +0000 | [diff] [blame] | 1267 | MakeNode(Dst, U, N1, SetRVal(St, U, SubV)); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1268 | continue; |
| 1269 | } |
Ted Kremenek | 7b8009a | 2008-01-24 02:28:56 +0000 | [diff] [blame] | 1270 | |
Ted Kremenek | 50d0ac2 | 2008-02-15 22:09:30 +0000 | [diff] [blame] | 1271 | if (U->isIncrementDecrementOp()) { |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1272 | |
| 1273 | // Handle ++ and -- (both pre- and post-increment). |
| 1274 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1275 | LVal SubLV = cast<LVal>(SubV); |
| 1276 | RVal V = GetRVal(St, SubLV, U->getType()); |
| 1277 | |
Ted Kremenek | 89063af | 2008-02-21 19:15:37 +0000 | [diff] [blame] | 1278 | if (V.isUnknown()) { |
| 1279 | Dst.Add(N1); |
| 1280 | continue; |
| 1281 | } |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1282 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 1283 | // Propagate undefined values. |
| 1284 | if (V.isUndef()) { |
Ted Kremenek | 0e561a3 | 2008-03-21 21:30:14 +0000 | [diff] [blame] | 1285 | MakeNode(Dst, U, N1, SetRVal(St, U, V)); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1286 | continue; |
| 1287 | } |
| 1288 | |
Ted Kremenek | 443003b | 2008-02-21 19:29:23 +0000 | [diff] [blame] | 1289 | // Handle all other values. |
Ted Kremenek | 50d0ac2 | 2008-02-15 22:09:30 +0000 | [diff] [blame] | 1290 | |
| 1291 | BinaryOperator::Opcode Op = U->isIncrementOp() ? BinaryOperator::Add |
| 1292 | : BinaryOperator::Sub; |
| 1293 | |
Ted Kremenek | 443003b | 2008-02-21 19:29:23 +0000 | [diff] [blame] | 1294 | RVal Result = EvalBinOp(Op, V, MakeConstantVal(1U, U)); |
Ted Kremenek | 50d0ac2 | 2008-02-15 22:09:30 +0000 | [diff] [blame] | 1295 | |
| 1296 | if (U->isPostfix()) |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1297 | St = SetRVal(SetRVal(St, U, V), SubLV, Result); |
Ted Kremenek | 50d0ac2 | 2008-02-15 22:09:30 +0000 | [diff] [blame] | 1298 | else |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1299 | St = SetRVal(SetRVal(St, U, Result), SubLV, Result); |
Ted Kremenek | 50d0ac2 | 2008-02-15 22:09:30 +0000 | [diff] [blame] | 1300 | |
Ted Kremenek | 0e561a3 | 2008-03-21 21:30:14 +0000 | [diff] [blame] | 1301 | MakeNode(Dst, U, N1, St); |
Ted Kremenek | 50d0ac2 | 2008-02-15 22:09:30 +0000 | [diff] [blame] | 1302 | continue; |
| 1303 | } |
| 1304 | |
| 1305 | // Handle all other unary operators. |
| 1306 | |
Ted Kremenek | 7b8009a | 2008-01-24 02:28:56 +0000 | [diff] [blame] | 1307 | switch (U->getOpcode()) { |
Ted Kremenek | 5139c78 | 2008-03-15 03:05:30 +0000 | [diff] [blame] | 1308 | |
| 1309 | case UnaryOperator::Extension: |
| 1310 | St = SetRVal(St, U, SubV); |
| 1311 | break; |
Ted Kremenek | cf78b6a | 2008-02-06 22:50:25 +0000 | [diff] [blame] | 1312 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1313 | case UnaryOperator::Minus: |
| 1314 | St = SetRVal(St, U, EvalMinus(U, cast<NonLVal>(SubV))); |
Ted Kremenek | dacbb4f | 2008-01-24 08:20:02 +0000 | [diff] [blame] | 1315 | break; |
Ted Kremenek | dacbb4f | 2008-01-24 08:20:02 +0000 | [diff] [blame] | 1316 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1317 | case UnaryOperator::Not: |
| 1318 | St = SetRVal(St, U, EvalComplement(cast<NonLVal>(SubV))); |
Ted Kremenek | 90e4203 | 2008-02-20 04:12:31 +0000 | [diff] [blame] | 1319 | break; |
Ted Kremenek | 90e4203 | 2008-02-20 04:12:31 +0000 | [diff] [blame] | 1320 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1321 | case UnaryOperator::LNot: |
Ted Kremenek | c5d3b4c | 2008-02-04 16:58:30 +0000 | [diff] [blame] | 1322 | |
Ted Kremenek | c60f0f7 | 2008-02-06 17:56:00 +0000 | [diff] [blame] | 1323 | // C99 6.5.3.3: "The expression !E is equivalent to (0==E)." |
| 1324 | // |
| 1325 | // Note: technically we do "E == 0", but this is the same in the |
| 1326 | // transfer functions as "0 == E". |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1327 | |
| 1328 | if (isa<LVal>(SubV)) { |
Ted Kremenek | 240f1f0 | 2008-03-07 20:13:31 +0000 | [diff] [blame] | 1329 | lval::ConcreteInt V(BasicVals.getZeroWithPtrWidth()); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1330 | RVal Result = EvalBinOp(BinaryOperator::EQ, cast<LVal>(SubV), V); |
| 1331 | St = SetRVal(St, U, Result); |
Ted Kremenek | c60f0f7 | 2008-02-06 17:56:00 +0000 | [diff] [blame] | 1332 | } |
| 1333 | else { |
Ted Kremenek | f7ca696 | 2008-02-22 00:42:36 +0000 | [diff] [blame] | 1334 | Expr* Ex = U->getSubExpr(); |
Ted Kremenek | 240f1f0 | 2008-03-07 20:13:31 +0000 | [diff] [blame] | 1335 | nonlval::ConcreteInt V(BasicVals.getValue(0, Ex->getType())); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1336 | RVal Result = EvalBinOp(BinaryOperator::EQ, cast<NonLVal>(SubV), V); |
| 1337 | St = SetRVal(St, U, Result); |
Ted Kremenek | c60f0f7 | 2008-02-06 17:56:00 +0000 | [diff] [blame] | 1338 | } |
| 1339 | |
| 1340 | break; |
Ted Kremenek | c60f0f7 | 2008-02-06 17:56:00 +0000 | [diff] [blame] | 1341 | |
Ted Kremenek | 6492485 | 2008-01-31 02:35:41 +0000 | [diff] [blame] | 1342 | case UnaryOperator::AddrOf: { |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1343 | assert (isa<LVal>(SubV)); |
| 1344 | St = SetRVal(St, U, SubV); |
Ted Kremenek | 6492485 | 2008-01-31 02:35:41 +0000 | [diff] [blame] | 1345 | break; |
| 1346 | } |
Ted Kremenek | d131c4f | 2008-02-07 05:48:01 +0000 | [diff] [blame] | 1347 | |
Ted Kremenek | 7b8009a | 2008-01-24 02:28:56 +0000 | [diff] [blame] | 1348 | default: ; |
| 1349 | assert (false && "Not implemented."); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1350 | } |
| 1351 | |
Ted Kremenek | 0e561a3 | 2008-03-21 21:30:14 +0000 | [diff] [blame] | 1352 | MakeNode(Dst, U, N1, St); |
Ted Kremenek | 7b8009a | 2008-01-24 02:28:56 +0000 | [diff] [blame] | 1353 | } |
| 1354 | } |
| 1355 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1356 | void GRExprEngine::VisitSizeOfExpr(UnaryOperator* U, NodeTy* Pred, |
| 1357 | NodeSet& Dst) { |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1358 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1359 | QualType T = U->getSubExpr()->getType(); |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1360 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1361 | // FIXME: Add support for VLAs. |
| 1362 | if (!T.getTypePtr()->isConstantSizeType()) |
| 1363 | return; |
| 1364 | |
Chris Lattner | 98be494 | 2008-03-05 18:54:05 +0000 | [diff] [blame] | 1365 | uint64_t size = getContext().getTypeSize(T) / 8; |
Ted Kremenek | 0d093d3 | 2008-03-10 04:11:42 +0000 | [diff] [blame] | 1366 | ValueState* St = GetState(Pred); |
Ted Kremenek | 240f1f0 | 2008-03-07 20:13:31 +0000 | [diff] [blame] | 1367 | St = SetRVal(St, U, NonLVal::MakeVal(BasicVals, size, U->getType())); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1368 | |
Ted Kremenek | 0e561a3 | 2008-03-21 21:30:14 +0000 | [diff] [blame] | 1369 | MakeNode(Dst, U, Pred, St); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1370 | } |
| 1371 | |
| 1372 | void GRExprEngine::VisitLVal(Expr* Ex, NodeTy* Pred, NodeSet& Dst) { |
Ted Kremenek | 2ad8868 | 2008-02-27 07:04:16 +0000 | [diff] [blame] | 1373 | |
| 1374 | if (Ex != CurrentStmt && getCFG().isBlkExpr(Ex)) { |
| 1375 | Dst.Add(Pred); |
| 1376 | return; |
| 1377 | } |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1378 | |
| 1379 | Ex = Ex->IgnoreParens(); |
| 1380 | |
Ted Kremenek | 0793263 | 2008-02-27 06:47:26 +0000 | [diff] [blame] | 1381 | if (isa<DeclRefExpr>(Ex)) { |
Ted Kremenek | 3271f8d | 2008-02-07 04:16:04 +0000 | [diff] [blame] | 1382 | Dst.Add(Pred); |
Ted Kremenek | 5b6dc2d | 2008-02-07 01:08:27 +0000 | [diff] [blame] | 1383 | return; |
Ted Kremenek | 3271f8d | 2008-02-07 04:16:04 +0000 | [diff] [blame] | 1384 | } |
Ted Kremenek | 5b6dc2d | 2008-02-07 01:08:27 +0000 | [diff] [blame] | 1385 | |
Ted Kremenek | ffe0f43 | 2008-03-07 22:58:01 +0000 | [diff] [blame] | 1386 | if (UnaryOperator* U = dyn_cast<UnaryOperator>(Ex)) |
Ted Kremenek | 5b6dc2d | 2008-02-07 01:08:27 +0000 | [diff] [blame] | 1387 | if (U->getOpcode() == UnaryOperator::Deref) { |
Ted Kremenek | ffe0f43 | 2008-03-07 22:58:01 +0000 | [diff] [blame] | 1388 | VisitDeref(U, Pred, Dst, true); |
Ted Kremenek | 5b6dc2d | 2008-02-07 01:08:27 +0000 | [diff] [blame] | 1389 | return; |
| 1390 | } |
Ted Kremenek | 5b6dc2d | 2008-02-07 01:08:27 +0000 | [diff] [blame] | 1391 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1392 | Visit(Ex, Pred, Dst); |
Ted Kremenek | 5b6dc2d | 2008-02-07 01:08:27 +0000 | [diff] [blame] | 1393 | } |
| 1394 | |
Ted Kremenek | ef44bfb | 2008-03-17 21:11:24 +0000 | [diff] [blame] | 1395 | void GRExprEngine::VisitAsmStmt(AsmStmt* A, NodeTy* Pred, NodeSet& Dst) { |
| 1396 | VisitAsmStmtHelperOutputs(A, A->begin_outputs(), A->end_outputs(), Pred, Dst); |
| 1397 | } |
| 1398 | |
| 1399 | void GRExprEngine::VisitAsmStmtHelperOutputs(AsmStmt* A, |
| 1400 | AsmStmt::outputs_iterator I, |
| 1401 | AsmStmt::outputs_iterator E, |
| 1402 | NodeTy* Pred, NodeSet& Dst) { |
| 1403 | if (I == E) { |
| 1404 | VisitAsmStmtHelperInputs(A, A->begin_inputs(), A->end_inputs(), Pred, Dst); |
| 1405 | return; |
| 1406 | } |
| 1407 | |
| 1408 | NodeSet Tmp; |
| 1409 | VisitLVal(*I, Pred, Tmp); |
| 1410 | |
| 1411 | ++I; |
| 1412 | |
| 1413 | for (NodeSet::iterator NI = Tmp.begin(), NE = Tmp.end(); NI != NE; ++NI) |
| 1414 | VisitAsmStmtHelperOutputs(A, I, E, *NI, Dst); |
| 1415 | } |
| 1416 | |
| 1417 | void GRExprEngine::VisitAsmStmtHelperInputs(AsmStmt* A, |
| 1418 | AsmStmt::inputs_iterator I, |
| 1419 | AsmStmt::inputs_iterator E, |
| 1420 | NodeTy* Pred, NodeSet& Dst) { |
| 1421 | if (I == E) { |
| 1422 | |
| 1423 | // We have processed both the inputs and the outputs. All of the outputs |
| 1424 | // should evaluate to LVals. Nuke all of their values. |
| 1425 | |
| 1426 | // FIXME: Some day in the future it would be nice to allow a "plug-in" |
| 1427 | // which interprets the inline asm and stores proper results in the |
| 1428 | // outputs. |
| 1429 | |
| 1430 | ValueState* St = GetState(Pred); |
| 1431 | |
| 1432 | for (AsmStmt::outputs_iterator OI = A->begin_outputs(), |
| 1433 | OE = A->end_outputs(); OI != OE; ++OI) { |
| 1434 | |
| 1435 | RVal X = GetLVal(St, *OI); |
| 1436 | |
| 1437 | assert (!isa<NonLVal>(X)); |
| 1438 | |
| 1439 | if (isa<LVal>(X)) |
| 1440 | St = SetRVal(St, cast<LVal>(X), UnknownVal()); |
| 1441 | } |
| 1442 | |
Ted Kremenek | 0e561a3 | 2008-03-21 21:30:14 +0000 | [diff] [blame] | 1443 | MakeNode(Dst, A, Pred, St); |
Ted Kremenek | ef44bfb | 2008-03-17 21:11:24 +0000 | [diff] [blame] | 1444 | return; |
| 1445 | } |
| 1446 | |
| 1447 | NodeSet Tmp; |
| 1448 | Visit(*I, Pred, Tmp); |
| 1449 | |
| 1450 | ++I; |
| 1451 | |
| 1452 | for (NodeSet::iterator NI = Tmp.begin(), NE = Tmp.end(); NI != NE; ++NI) |
| 1453 | VisitAsmStmtHelperInputs(A, I, E, *NI, Dst); |
| 1454 | } |
| 1455 | |
Ted Kremenek | 02737ed | 2008-03-31 15:02:58 +0000 | [diff] [blame] | 1456 | void GRExprEngine::VisitReturnStmt(ReturnStmt* S, NodeTy* Pred, NodeSet& Dst) { |
| 1457 | |
| 1458 | Expr* R = S->getRetValue(); |
| 1459 | |
| 1460 | if (!R) { |
| 1461 | Dst.Add(Pred); |
| 1462 | return; |
| 1463 | } |
| 1464 | |
| 1465 | QualType T = R->getType(); |
| 1466 | |
Chris Lattner | 423a3c9 | 2008-04-02 17:45:06 +0000 | [diff] [blame] | 1467 | if (T->isPointerLikeType()) { |
Ted Kremenek | 02737ed | 2008-03-31 15:02:58 +0000 | [diff] [blame] | 1468 | |
| 1469 | // Check if any of the return values return the address of a stack variable. |
| 1470 | |
| 1471 | NodeSet Tmp; |
| 1472 | Visit(R, Pred, Tmp); |
| 1473 | |
| 1474 | for (NodeSet::iterator I=Tmp.begin(), E=Tmp.end(); I!=E; ++I) { |
| 1475 | RVal X = GetRVal((*I)->getState(), R); |
| 1476 | |
| 1477 | if (isa<lval::DeclVal>(X)) { |
| 1478 | |
| 1479 | if (cast<lval::DeclVal>(X).getDecl()->hasLocalStorage()) { |
| 1480 | |
| 1481 | // Create a special node representing the v |
| 1482 | |
| 1483 | NodeTy* RetStackNode = Builder->generateNode(S, GetState(*I), *I); |
| 1484 | |
| 1485 | if (RetStackNode) { |
| 1486 | RetStackNode->markAsSink(); |
| 1487 | RetsStackAddr.insert(RetStackNode); |
| 1488 | } |
| 1489 | |
| 1490 | continue; |
| 1491 | } |
| 1492 | } |
| 1493 | |
| 1494 | Dst.Add(*I); |
| 1495 | } |
| 1496 | } |
| 1497 | else |
| 1498 | Visit(R, Pred, Dst); |
| 1499 | } |
Ted Kremenek | 55deb97 | 2008-03-25 00:34:37 +0000 | [diff] [blame] | 1500 | |
Ted Kremenek | e695e1c | 2008-04-15 23:06:53 +0000 | [diff] [blame] | 1501 | //===----------------------------------------------------------------------===// |
| 1502 | // Transfer functions: Binary operators. |
| 1503 | //===----------------------------------------------------------------------===// |
| 1504 | |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 1505 | void GRExprEngine::VisitBinaryOperator(BinaryOperator* B, |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 1506 | GRExprEngine::NodeTy* Pred, |
| 1507 | GRExprEngine::NodeSet& Dst) { |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 1508 | NodeSet S1; |
Ted Kremenek | 5b6dc2d | 2008-02-07 01:08:27 +0000 | [diff] [blame] | 1509 | |
| 1510 | if (B->isAssignmentOp()) |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1511 | VisitLVal(B->getLHS(), Pred, S1); |
Ted Kremenek | 5b6dc2d | 2008-02-07 01:08:27 +0000 | [diff] [blame] | 1512 | else |
| 1513 | Visit(B->getLHS(), Pred, S1); |
Ted Kremenek | cb448ca | 2008-01-16 00:53:15 +0000 | [diff] [blame] | 1514 | |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 1515 | for (NodeSet::iterator I1=S1.begin(), E1=S1.end(); I1 != E1; ++I1) { |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1516 | |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 1517 | NodeTy* N1 = *I1; |
Ted Kremenek | e00fe3f | 2008-01-17 00:52:48 +0000 | [diff] [blame] | 1518 | |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 1519 | // When getting the value for the LHS, check if we are in an assignment. |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1520 | // In such cases, we want to (initially) treat the LHS as an LVal, |
| 1521 | // so we use GetLVal instead of GetRVal so that DeclRefExpr's are |
| 1522 | // evaluated to LValDecl's instead of to an NonLVal. |
| 1523 | |
Ted Kremenek | 0d093d3 | 2008-03-10 04:11:42 +0000 | [diff] [blame] | 1524 | RVal LeftV = B->isAssignmentOp() ? GetLVal(GetState(N1), B->getLHS()) |
| 1525 | : GetRVal(GetState(N1), B->getLHS()); |
Ted Kremenek | cb448ca | 2008-01-16 00:53:15 +0000 | [diff] [blame] | 1526 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1527 | // Visit the RHS... |
| 1528 | |
| 1529 | NodeSet S2; |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 1530 | Visit(B->getRHS(), N1, S2); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1531 | |
| 1532 | // Process the binary operator. |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 1533 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1534 | for (NodeSet::iterator I2 = S2.begin(), E2 = S2.end(); I2 != E2; ++I2) { |
Ted Kremenek | cf78b6a | 2008-02-06 22:50:25 +0000 | [diff] [blame] | 1535 | |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 1536 | NodeTy* N2 = *I2; |
Ted Kremenek | 0d093d3 | 2008-03-10 04:11:42 +0000 | [diff] [blame] | 1537 | ValueState* St = GetState(N2); |
Ted Kremenek | 3c8d0c5 | 2008-02-25 18:42:54 +0000 | [diff] [blame] | 1538 | Expr* RHS = B->getRHS(); |
| 1539 | RVal RightV = GetRVal(St, RHS); |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 1540 | |
Ted Kremenek | cf78b6a | 2008-02-06 22:50:25 +0000 | [diff] [blame] | 1541 | BinaryOperator::Opcode Op = B->getOpcode(); |
| 1542 | |
Ted Kremenek | 3c8d0c5 | 2008-02-25 18:42:54 +0000 | [diff] [blame] | 1543 | if ((Op == BinaryOperator::Div || Op == BinaryOperator::Rem) |
| 1544 | && RHS->getType()->isIntegerType()) { |
Ted Kremenek | d763eb9 | 2008-02-26 02:15:56 +0000 | [diff] [blame] | 1545 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 1546 | // Check if the denominator is undefined. |
Ted Kremenek | 3c8d0c5 | 2008-02-25 18:42:54 +0000 | [diff] [blame] | 1547 | |
Ted Kremenek | 0015541 | 2008-02-26 22:27:51 +0000 | [diff] [blame] | 1548 | if (!RightV.isUnknown()) { |
| 1549 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 1550 | if (RightV.isUndef()) { |
| 1551 | NodeTy* DivUndef = Builder->generateNode(B, St, N2); |
Ted Kremenek | 0015541 | 2008-02-26 22:27:51 +0000 | [diff] [blame] | 1552 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 1553 | if (DivUndef) { |
| 1554 | DivUndef->markAsSink(); |
Ted Kremenek | 4d839b4 | 2008-03-07 19:04:53 +0000 | [diff] [blame] | 1555 | ExplicitBadDivides.insert(DivUndef); |
Ted Kremenek | 0015541 | 2008-02-26 22:27:51 +0000 | [diff] [blame] | 1556 | } |
| 1557 | |
| 1558 | continue; |
| 1559 | } |
| 1560 | |
| 1561 | // Check for divide/remainder-by-zero. |
| 1562 | // |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 1563 | // First, "assume" that the denominator is 0 or undefined. |
Ted Kremenek | d763eb9 | 2008-02-26 02:15:56 +0000 | [diff] [blame] | 1564 | |
Ted Kremenek | 4d839b4 | 2008-03-07 19:04:53 +0000 | [diff] [blame] | 1565 | bool isFeasibleZero = false; |
| 1566 | ValueState* ZeroSt = Assume(St, RightV, false, isFeasibleZero); |
Ted Kremenek | d763eb9 | 2008-02-26 02:15:56 +0000 | [diff] [blame] | 1567 | |
Ted Kremenek | 0015541 | 2008-02-26 22:27:51 +0000 | [diff] [blame] | 1568 | // Second, "assume" that the denominator cannot be 0. |
Ted Kremenek | d763eb9 | 2008-02-26 02:15:56 +0000 | [diff] [blame] | 1569 | |
Ted Kremenek | 4d839b4 | 2008-03-07 19:04:53 +0000 | [diff] [blame] | 1570 | bool isFeasibleNotZero = false; |
| 1571 | St = Assume(St, RightV, true, isFeasibleNotZero); |
Ted Kremenek | 07d83aa | 2008-02-25 17:51:31 +0000 | [diff] [blame] | 1572 | |
Ted Kremenek | 4d839b4 | 2008-03-07 19:04:53 +0000 | [diff] [blame] | 1573 | // Create the node for the divide-by-zero (if it occurred). |
| 1574 | |
| 1575 | if (isFeasibleZero) |
| 1576 | if (NodeTy* DivZeroNode = Builder->generateNode(B, ZeroSt, N2)) { |
| 1577 | DivZeroNode->markAsSink(); |
| 1578 | |
| 1579 | if (isFeasibleNotZero) |
| 1580 | ImplicitBadDivides.insert(DivZeroNode); |
| 1581 | else |
| 1582 | ExplicitBadDivides.insert(DivZeroNode); |
| 1583 | |
| 1584 | } |
| 1585 | |
| 1586 | if (!isFeasibleNotZero) |
Ted Kremenek | 0015541 | 2008-02-26 22:27:51 +0000 | [diff] [blame] | 1587 | continue; |
Ted Kremenek | 07d83aa | 2008-02-25 17:51:31 +0000 | [diff] [blame] | 1588 | } |
| 1589 | |
Ted Kremenek | 07d83aa | 2008-02-25 17:51:31 +0000 | [diff] [blame] | 1590 | // Fall-through. The logic below processes the divide. |
| 1591 | } |
| 1592 | |
Ted Kremenek | 8cc13ea | 2008-02-28 20:32:03 +0000 | [diff] [blame] | 1593 | |
Ted Kremenek | cf78b6a | 2008-02-06 22:50:25 +0000 | [diff] [blame] | 1594 | if (Op <= BinaryOperator::Or) { |
| 1595 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1596 | // Process non-assignements except commas or short-circuited |
| 1597 | // logical expressions (LAnd and LOr). |
| 1598 | |
| 1599 | RVal Result = EvalBinOp(Op, LeftV, RightV); |
| 1600 | |
| 1601 | if (Result.isUnknown()) { |
| 1602 | Dst.Add(N2); |
Ted Kremenek | 5b6dc2d | 2008-02-07 01:08:27 +0000 | [diff] [blame] | 1603 | continue; |
| 1604 | } |
| 1605 | |
Ted Kremenek | 8cc13ea | 2008-02-28 20:32:03 +0000 | [diff] [blame] | 1606 | if (Result.isUndef() && !LeftV.isUndef() && !RightV.isUndef()) { |
| 1607 | |
| 1608 | // The operands were not undefined, but the result is undefined. |
| 1609 | |
| 1610 | if (NodeTy* UndefNode = Builder->generateNode(B, St, N2)) { |
| 1611 | UndefNode->markAsSink(); |
| 1612 | UndefResults.insert(UndefNode); |
| 1613 | } |
| 1614 | |
| 1615 | continue; |
| 1616 | } |
| 1617 | |
Ted Kremenek | 0e561a3 | 2008-03-21 21:30:14 +0000 | [diff] [blame] | 1618 | MakeNode(Dst, B, N2, SetRVal(St, B, Result)); |
Ted Kremenek | cf78b6a | 2008-02-06 22:50:25 +0000 | [diff] [blame] | 1619 | continue; |
| 1620 | } |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1621 | |
| 1622 | // Process assignments. |
| 1623 | |
| 1624 | switch (Op) { |
| 1625 | |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 1626 | case BinaryOperator::Assign: { |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1627 | |
| 1628 | // Simple assignments. |
Ted Kremenek | 9dca062 | 2008-02-19 00:22:37 +0000 | [diff] [blame] | 1629 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 1630 | if (LeftV.isUndef()) { |
| 1631 | HandleUndefinedStore(B, N2); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1632 | continue; |
| 1633 | } |
| 1634 | |
Ted Kremenek | 361fa8e | 2008-03-12 21:45:47 +0000 | [diff] [blame] | 1635 | // EXPERIMENTAL: "Conjured" symbols. |
| 1636 | |
| 1637 | if (RightV.isUnknown()) { |
| 1638 | unsigned Count = Builder->getCurrentBlockCount(); |
| 1639 | SymbolID Sym = SymMgr.getConjuredSymbol(B->getRHS(), Count); |
| 1640 | |
| 1641 | RightV = B->getRHS()->getType()->isPointerType() |
| 1642 | ? cast<RVal>(lval::SymbolVal(Sym)) |
| 1643 | : cast<RVal>(nonlval::SymbolVal(Sym)); |
| 1644 | } |
| 1645 | |
| 1646 | // Even if the LHS evaluates to an unknown L-Value, the entire |
| 1647 | // expression still evaluates to the RHS. |
| 1648 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1649 | if (LeftV.isUnknown()) { |
| 1650 | St = SetRVal(St, B, RightV); |
| 1651 | break; |
| 1652 | } |
Ted Kremenek | 361fa8e | 2008-03-12 21:45:47 +0000 | [diff] [blame] | 1653 | |
| 1654 | // Simulate the effects of a "store": bind the value of the RHS |
| 1655 | // to the L-Value represented by the LHS. |
Ted Kremenek | 9dca062 | 2008-02-19 00:22:37 +0000 | [diff] [blame] | 1656 | |
Ted Kremenek | ec96a2d | 2008-04-16 18:39:06 +0000 | [diff] [blame^] | 1657 | VisitStore(Dst, B, N2, SetRVal(St, B, RightV), |
Ted Kremenek | e38718e | 2008-04-16 18:21:25 +0000 | [diff] [blame] | 1658 | cast<LVal>(LeftV), RightV); |
| 1659 | |
| 1660 | // St = SetRVal(SetRVal(St, B, RightV), cast<LVal>(LeftV), RightV); |
| 1661 | continue; |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 1662 | } |
| 1663 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1664 | // Compound assignment operators. |
Ted Kremenek | 687af80 | 2008-01-29 19:43:15 +0000 | [diff] [blame] | 1665 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1666 | default: { |
Ted Kremenek | 9dca062 | 2008-02-19 00:22:37 +0000 | [diff] [blame] | 1667 | |
Ted Kremenek | 0015541 | 2008-02-26 22:27:51 +0000 | [diff] [blame] | 1668 | assert (B->isCompoundAssignmentOp()); |
| 1669 | |
| 1670 | if (Op >= BinaryOperator::AndAssign) |
| 1671 | ((int&) Op) -= (BinaryOperator::AndAssign - BinaryOperator::And); |
| 1672 | else |
| 1673 | ((int&) Op) -= BinaryOperator::MulAssign; |
| 1674 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 1675 | // Check if the LHS is undefined. |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1676 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 1677 | if (LeftV.isUndef()) { |
| 1678 | HandleUndefinedStore(B, N2); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1679 | continue; |
| 1680 | } |
| 1681 | |
| 1682 | if (LeftV.isUnknown()) { |
Ted Kremenek | 3ce9214 | 2008-03-09 08:12:37 +0000 | [diff] [blame] | 1683 | assert (isa<UnknownVal>(GetRVal(St, B))); |
| 1684 | Dst.Add(N2); |
| 1685 | continue; |
Ted Kremenek | 9dca062 | 2008-02-19 00:22:37 +0000 | [diff] [blame] | 1686 | } |
| 1687 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1688 | // At this pointer we know that the LHS evaluates to an LVal |
Ted Kremenek | 3ce9214 | 2008-03-09 08:12:37 +0000 | [diff] [blame] | 1689 | // that is neither "Unknown" or "Undefined." |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1690 | |
| 1691 | LVal LeftLV = cast<LVal>(LeftV); |
| 1692 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1693 | // Fetch the value of the LHS (the value of the variable, etc.). |
| 1694 | |
Ted Kremenek | 0d093d3 | 2008-03-10 04:11:42 +0000 | [diff] [blame] | 1695 | RVal V = GetRVal(GetState(N1), LeftLV, B->getLHS()->getType()); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1696 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 1697 | // Propagate undefined value (left-side). We |
| 1698 | // propogate undefined values for the RHS below when |
Ted Kremenek | 0015541 | 2008-02-26 22:27:51 +0000 | [diff] [blame] | 1699 | // we also check for divide-by-zero. |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1700 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 1701 | if (V.isUndef()) { |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1702 | St = SetRVal(St, B, V); |
| 1703 | break; |
| 1704 | } |
| 1705 | |
| 1706 | // Propagate unknown values. |
| 1707 | |
Ted Kremenek | 89063af | 2008-02-21 19:15:37 +0000 | [diff] [blame] | 1708 | if (V.isUnknown()) { |
Ted Kremenek | 3ce9214 | 2008-03-09 08:12:37 +0000 | [diff] [blame] | 1709 | // The value bound to LeftV is unknown. Thus we just |
| 1710 | // propagate the current node (as "B" is already bound to nothing). |
| 1711 | assert (isa<UnknownVal>(GetRVal(St, B))); |
Ted Kremenek | 89063af | 2008-02-21 19:15:37 +0000 | [diff] [blame] | 1712 | Dst.Add(N2); |
| 1713 | continue; |
| 1714 | } |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1715 | |
| 1716 | if (RightV.isUnknown()) { |
Ted Kremenek | 3ce9214 | 2008-03-09 08:12:37 +0000 | [diff] [blame] | 1717 | assert (isa<UnknownVal>(GetRVal(St, B))); |
| 1718 | St = SetRVal(St, LeftLV, UnknownVal()); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1719 | break; |
| 1720 | } |
| 1721 | |
Ted Kremenek | 0015541 | 2008-02-26 22:27:51 +0000 | [diff] [blame] | 1722 | // At this point: |
| 1723 | // |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 1724 | // The LHS is not Undef/Unknown. |
Ted Kremenek | 0015541 | 2008-02-26 22:27:51 +0000 | [diff] [blame] | 1725 | // The RHS is not Unknown. |
Ted Kremenek | cf78b6a | 2008-02-06 22:50:25 +0000 | [diff] [blame] | 1726 | |
Ted Kremenek | 9ef1ec9 | 2008-02-21 18:43:30 +0000 | [diff] [blame] | 1727 | // Get the computation type. |
| 1728 | QualType CTy = cast<CompoundAssignOperator>(B)->getComputationType(); |
| 1729 | |
| 1730 | // Perform promotions. |
| 1731 | V = EvalCast(V, CTy); |
Ted Kremenek | 61e090c | 2008-02-21 18:46:24 +0000 | [diff] [blame] | 1732 | RightV = EvalCast(RightV, CTy); |
Ted Kremenek | 9ef1ec9 | 2008-02-21 18:43:30 +0000 | [diff] [blame] | 1733 | |
| 1734 | // Evaluate operands and promote to result type. |
Ted Kremenek | 07d83aa | 2008-02-25 17:51:31 +0000 | [diff] [blame] | 1735 | |
Ted Kremenek | 3c8d0c5 | 2008-02-25 18:42:54 +0000 | [diff] [blame] | 1736 | if ((Op == BinaryOperator::Div || Op == BinaryOperator::Rem) |
| 1737 | && RHS->getType()->isIntegerType()) { |
| 1738 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 1739 | // Check if the denominator is undefined. |
Ted Kremenek | d763eb9 | 2008-02-26 02:15:56 +0000 | [diff] [blame] | 1740 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 1741 | if (RightV.isUndef()) { |
| 1742 | NodeTy* DivUndef = Builder->generateNode(B, St, N2); |
Ted Kremenek | d763eb9 | 2008-02-26 02:15:56 +0000 | [diff] [blame] | 1743 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 1744 | if (DivUndef) { |
| 1745 | DivUndef->markAsSink(); |
Ted Kremenek | 4d839b4 | 2008-03-07 19:04:53 +0000 | [diff] [blame] | 1746 | ExplicitBadDivides.insert(DivUndef); |
Ted Kremenek | d763eb9 | 2008-02-26 02:15:56 +0000 | [diff] [blame] | 1747 | } |
| 1748 | |
| 1749 | continue; |
| 1750 | } |
Ted Kremenek | 0015541 | 2008-02-26 22:27:51 +0000 | [diff] [blame] | 1751 | |
Ted Kremenek | 07d83aa | 2008-02-25 17:51:31 +0000 | [diff] [blame] | 1752 | // First, "assume" that the denominator is 0. |
| 1753 | |
Ted Kremenek | 4d839b4 | 2008-03-07 19:04:53 +0000 | [diff] [blame] | 1754 | bool isFeasibleZero = false; |
| 1755 | ValueState* ZeroSt = Assume(St, RightV, false, isFeasibleZero); |
Ted Kremenek | 07d83aa | 2008-02-25 17:51:31 +0000 | [diff] [blame] | 1756 | |
Ted Kremenek | 4d839b4 | 2008-03-07 19:04:53 +0000 | [diff] [blame] | 1757 | // Second, "assume" that the denominator cannot be 0. |
| 1758 | |
| 1759 | bool isFeasibleNotZero = false; |
| 1760 | St = Assume(St, RightV, true, isFeasibleNotZero); |
| 1761 | |
| 1762 | // Create the node for the divide-by-zero error (if it occurred). |
| 1763 | |
| 1764 | if (isFeasibleZero) { |
Ted Kremenek | 07d83aa | 2008-02-25 17:51:31 +0000 | [diff] [blame] | 1765 | NodeTy* DivZeroNode = Builder->generateNode(B, ZeroSt, N2); |
| 1766 | |
| 1767 | if (DivZeroNode) { |
| 1768 | DivZeroNode->markAsSink(); |
Ted Kremenek | 4d839b4 | 2008-03-07 19:04:53 +0000 | [diff] [blame] | 1769 | |
| 1770 | if (isFeasibleNotZero) |
| 1771 | ImplicitBadDivides.insert(DivZeroNode); |
| 1772 | else |
| 1773 | ExplicitBadDivides.insert(DivZeroNode); |
Ted Kremenek | 07d83aa | 2008-02-25 17:51:31 +0000 | [diff] [blame] | 1774 | } |
| 1775 | } |
| 1776 | |
Ted Kremenek | 4d839b4 | 2008-03-07 19:04:53 +0000 | [diff] [blame] | 1777 | if (!isFeasibleNotZero) |
Ted Kremenek | 07d83aa | 2008-02-25 17:51:31 +0000 | [diff] [blame] | 1778 | continue; |
| 1779 | |
| 1780 | // Fall-through. The logic below processes the divide. |
| 1781 | } |
Ted Kremenek | 0015541 | 2008-02-26 22:27:51 +0000 | [diff] [blame] | 1782 | else { |
| 1783 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 1784 | // Propagate undefined values (right-side). |
Ted Kremenek | 0015541 | 2008-02-26 22:27:51 +0000 | [diff] [blame] | 1785 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 1786 | if (RightV.isUndef()) { |
Ted Kremenek | 0015541 | 2008-02-26 22:27:51 +0000 | [diff] [blame] | 1787 | St = SetRVal(SetRVal(St, B, RightV), LeftLV, RightV); |
| 1788 | break; |
| 1789 | } |
| 1790 | |
| 1791 | } |
Ted Kremenek | 07d83aa | 2008-02-25 17:51:31 +0000 | [diff] [blame] | 1792 | |
Ted Kremenek | 9ef1ec9 | 2008-02-21 18:43:30 +0000 | [diff] [blame] | 1793 | RVal Result = EvalCast(EvalBinOp(Op, V, RightV), B->getType()); |
Ted Kremenek | 8cc13ea | 2008-02-28 20:32:03 +0000 | [diff] [blame] | 1794 | |
| 1795 | if (Result.isUndef()) { |
| 1796 | |
| 1797 | // The operands were not undefined, but the result is undefined. |
| 1798 | |
| 1799 | if (NodeTy* UndefNode = Builder->generateNode(B, St, N2)) { |
| 1800 | UndefNode->markAsSink(); |
| 1801 | UndefResults.insert(UndefNode); |
| 1802 | } |
| 1803 | |
| 1804 | continue; |
| 1805 | } |
| 1806 | |
Ted Kremenek | e38718e | 2008-04-16 18:21:25 +0000 | [diff] [blame] | 1807 | // St = SetRVal(SetRVal(St, B, Result), LeftLV, Result); |
Ted Kremenek | ec96a2d | 2008-04-16 18:39:06 +0000 | [diff] [blame^] | 1808 | VisitStore(Dst, B, N2, SetRVal(St, B, Result), LeftLV, Result); |
Ted Kremenek | e38718e | 2008-04-16 18:21:25 +0000 | [diff] [blame] | 1809 | continue; |
Ted Kremenek | cf78b6a | 2008-02-06 22:50:25 +0000 | [diff] [blame] | 1810 | } |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 1811 | } |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1812 | |
Ted Kremenek | 0e561a3 | 2008-03-21 21:30:14 +0000 | [diff] [blame] | 1813 | MakeNode(Dst, B, N2, St); |
Ted Kremenek | cb448ca | 2008-01-16 00:53:15 +0000 | [diff] [blame] | 1814 | } |
Ted Kremenek | d27f816 | 2008-01-15 23:55:06 +0000 | [diff] [blame] | 1815 | } |
Ted Kremenek | d27f816 | 2008-01-15 23:55:06 +0000 | [diff] [blame] | 1816 | } |
Ted Kremenek | ee98546 | 2008-01-16 18:18:48 +0000 | [diff] [blame] | 1817 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 1818 | void GRExprEngine::HandleUndefinedStore(Stmt* S, NodeTy* Pred) { |
Ted Kremenek | 0d093d3 | 2008-03-10 04:11:42 +0000 | [diff] [blame] | 1819 | NodeTy* N = Builder->generateNode(S, GetState(Pred), Pred); |
Ted Kremenek | 9dca062 | 2008-02-19 00:22:37 +0000 | [diff] [blame] | 1820 | N->markAsSink(); |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 1821 | UndefStores.insert(N); |
Ted Kremenek | 9dca062 | 2008-02-19 00:22:37 +0000 | [diff] [blame] | 1822 | } |
Ted Kremenek | 1ccd31c | 2008-01-16 19:42:59 +0000 | [diff] [blame] | 1823 | |
Ted Kremenek | 1ccd31c | 2008-01-16 19:42:59 +0000 | [diff] [blame] | 1824 | |
Ted Kremenek | ee98546 | 2008-01-16 18:18:48 +0000 | [diff] [blame] | 1825 | //===----------------------------------------------------------------------===// |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 1826 | // "Assume" logic. |
| 1827 | //===----------------------------------------------------------------------===// |
| 1828 | |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 1829 | ValueState* GRExprEngine::Assume(ValueState* St, LVal Cond, |
Ted Kremenek | 692416c | 2008-02-18 22:57:02 +0000 | [diff] [blame] | 1830 | bool Assumption, |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1831 | bool& isFeasible) { |
Ted Kremenek | a6e4d21 | 2008-02-01 06:36:40 +0000 | [diff] [blame] | 1832 | switch (Cond.getSubKind()) { |
| 1833 | default: |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1834 | assert (false && "'Assume' not implemented for this LVal."); |
Ted Kremenek | a6e4d21 | 2008-02-01 06:36:40 +0000 | [diff] [blame] | 1835 | return St; |
| 1836 | |
Ted Kremenek | 862d5bb | 2008-02-06 00:54:14 +0000 | [diff] [blame] | 1837 | case lval::SymbolValKind: |
| 1838 | if (Assumption) |
| 1839 | return AssumeSymNE(St, cast<lval::SymbolVal>(Cond).getSymbol(), |
Ted Kremenek | 240f1f0 | 2008-03-07 20:13:31 +0000 | [diff] [blame] | 1840 | BasicVals.getZeroWithPtrWidth(), isFeasible); |
Ted Kremenek | 862d5bb | 2008-02-06 00:54:14 +0000 | [diff] [blame] | 1841 | else |
| 1842 | return AssumeSymEQ(St, cast<lval::SymbolVal>(Cond).getSymbol(), |
Ted Kremenek | 240f1f0 | 2008-03-07 20:13:31 +0000 | [diff] [blame] | 1843 | BasicVals.getZeroWithPtrWidth(), isFeasible); |
Ted Kremenek | 862d5bb | 2008-02-06 00:54:14 +0000 | [diff] [blame] | 1844 | |
Ted Kremenek | 08b6625 | 2008-02-06 04:31:33 +0000 | [diff] [blame] | 1845 | |
Ted Kremenek | 329f854 | 2008-02-05 21:52:21 +0000 | [diff] [blame] | 1846 | case lval::DeclValKind: |
Ted Kremenek | dc3936b | 2008-02-22 00:54:56 +0000 | [diff] [blame] | 1847 | case lval::FuncValKind: |
| 1848 | case lval::GotoLabelKind: |
Ted Kremenek | a6e4d21 | 2008-02-01 06:36:40 +0000 | [diff] [blame] | 1849 | isFeasible = Assumption; |
| 1850 | return St; |
Ted Kremenek | 862d5bb | 2008-02-06 00:54:14 +0000 | [diff] [blame] | 1851 | |
Ted Kremenek | 329f854 | 2008-02-05 21:52:21 +0000 | [diff] [blame] | 1852 | case lval::ConcreteIntKind: { |
| 1853 | bool b = cast<lval::ConcreteInt>(Cond).getValue() != 0; |
Ted Kremenek | a6e4d21 | 2008-02-01 06:36:40 +0000 | [diff] [blame] | 1854 | isFeasible = b ? Assumption : !Assumption; |
| 1855 | return St; |
| 1856 | } |
| 1857 | } |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 1858 | } |
| 1859 | |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 1860 | ValueState* GRExprEngine::Assume(ValueState* St, NonLVal Cond, |
Ted Kremenek | 862d5bb | 2008-02-06 00:54:14 +0000 | [diff] [blame] | 1861 | bool Assumption, |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1862 | bool& isFeasible) { |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 1863 | switch (Cond.getSubKind()) { |
| 1864 | default: |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1865 | assert (false && "'Assume' not implemented for this NonLVal."); |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 1866 | return St; |
| 1867 | |
Ted Kremenek | feb01f6 | 2008-02-06 17:32:17 +0000 | [diff] [blame] | 1868 | |
| 1869 | case nonlval::SymbolValKind: { |
Ted Kremenek | 230aaab | 2008-02-12 21:37:25 +0000 | [diff] [blame] | 1870 | nonlval::SymbolVal& SV = cast<nonlval::SymbolVal>(Cond); |
Ted Kremenek | feb01f6 | 2008-02-06 17:32:17 +0000 | [diff] [blame] | 1871 | SymbolID sym = SV.getSymbol(); |
| 1872 | |
| 1873 | if (Assumption) |
Ted Kremenek | 240f1f0 | 2008-03-07 20:13:31 +0000 | [diff] [blame] | 1874 | return AssumeSymNE(St, sym, BasicVals.getValue(0, SymMgr.getType(sym)), |
Ted Kremenek | feb01f6 | 2008-02-06 17:32:17 +0000 | [diff] [blame] | 1875 | isFeasible); |
| 1876 | else |
Ted Kremenek | 240f1f0 | 2008-03-07 20:13:31 +0000 | [diff] [blame] | 1877 | return AssumeSymEQ(St, sym, BasicVals.getValue(0, SymMgr.getType(sym)), |
Ted Kremenek | feb01f6 | 2008-02-06 17:32:17 +0000 | [diff] [blame] | 1878 | isFeasible); |
| 1879 | } |
| 1880 | |
Ted Kremenek | 08b6625 | 2008-02-06 04:31:33 +0000 | [diff] [blame] | 1881 | case nonlval::SymIntConstraintValKind: |
| 1882 | return |
| 1883 | AssumeSymInt(St, Assumption, |
| 1884 | cast<nonlval::SymIntConstraintVal>(Cond).getConstraint(), |
| 1885 | isFeasible); |
| 1886 | |
Ted Kremenek | 329f854 | 2008-02-05 21:52:21 +0000 | [diff] [blame] | 1887 | case nonlval::ConcreteIntKind: { |
| 1888 | bool b = cast<nonlval::ConcreteInt>(Cond).getValue() != 0; |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 1889 | isFeasible = b ? Assumption : !Assumption; |
| 1890 | return St; |
| 1891 | } |
| 1892 | } |
| 1893 | } |
| 1894 | |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 1895 | ValueState* |
| 1896 | GRExprEngine::AssumeSymNE(ValueState* St, SymbolID sym, |
Ted Kremenek | 862d5bb | 2008-02-06 00:54:14 +0000 | [diff] [blame] | 1897 | const llvm::APSInt& V, bool& isFeasible) { |
Ted Kremenek | 692416c | 2008-02-18 22:57:02 +0000 | [diff] [blame] | 1898 | |
Ted Kremenek | 862d5bb | 2008-02-06 00:54:14 +0000 | [diff] [blame] | 1899 | // First, determine if sym == X, where X != V. |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 1900 | if (const llvm::APSInt* X = St->getSymVal(sym)) { |
Ted Kremenek | 862d5bb | 2008-02-06 00:54:14 +0000 | [diff] [blame] | 1901 | isFeasible = *X != V; |
| 1902 | return St; |
| 1903 | } |
| 1904 | |
| 1905 | // Second, determine if sym != V. |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 1906 | if (St->isNotEqual(sym, V)) { |
Ted Kremenek | 862d5bb | 2008-02-06 00:54:14 +0000 | [diff] [blame] | 1907 | isFeasible = true; |
| 1908 | return St; |
| 1909 | } |
| 1910 | |
| 1911 | // If we reach here, sym is not a constant and we don't know if it is != V. |
| 1912 | // Make that assumption. |
| 1913 | |
| 1914 | isFeasible = true; |
| 1915 | return StateMgr.AddNE(St, sym, V); |
| 1916 | } |
| 1917 | |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 1918 | ValueState* |
| 1919 | GRExprEngine::AssumeSymEQ(ValueState* St, SymbolID sym, |
Ted Kremenek | 862d5bb | 2008-02-06 00:54:14 +0000 | [diff] [blame] | 1920 | const llvm::APSInt& V, bool& isFeasible) { |
| 1921 | |
| 1922 | // First, determine if sym == X, where X != V. |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 1923 | if (const llvm::APSInt* X = St->getSymVal(sym)) { |
Ted Kremenek | 862d5bb | 2008-02-06 00:54:14 +0000 | [diff] [blame] | 1924 | isFeasible = *X == V; |
| 1925 | return St; |
| 1926 | } |
| 1927 | |
| 1928 | // Second, determine if sym != V. |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 1929 | if (St->isNotEqual(sym, V)) { |
Ted Kremenek | 862d5bb | 2008-02-06 00:54:14 +0000 | [diff] [blame] | 1930 | isFeasible = false; |
| 1931 | return St; |
| 1932 | } |
| 1933 | |
| 1934 | // If we reach here, sym is not a constant and we don't know if it is == V. |
| 1935 | // Make that assumption. |
| 1936 | |
| 1937 | isFeasible = true; |
| 1938 | return StateMgr.AddEQ(St, sym, V); |
| 1939 | } |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 1940 | |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 1941 | ValueState* |
| 1942 | GRExprEngine::AssumeSymInt(ValueState* St, bool Assumption, |
Ted Kremenek | 08b6625 | 2008-02-06 04:31:33 +0000 | [diff] [blame] | 1943 | const SymIntConstraint& C, bool& isFeasible) { |
| 1944 | |
| 1945 | switch (C.getOpcode()) { |
| 1946 | default: |
| 1947 | // No logic yet for other operators. |
Ted Kremenek | 361fa8e | 2008-03-12 21:45:47 +0000 | [diff] [blame] | 1948 | isFeasible = true; |
Ted Kremenek | 08b6625 | 2008-02-06 04:31:33 +0000 | [diff] [blame] | 1949 | return St; |
| 1950 | |
| 1951 | case BinaryOperator::EQ: |
| 1952 | if (Assumption) |
| 1953 | return AssumeSymEQ(St, C.getSymbol(), C.getInt(), isFeasible); |
| 1954 | else |
| 1955 | return AssumeSymNE(St, C.getSymbol(), C.getInt(), isFeasible); |
| 1956 | |
| 1957 | case BinaryOperator::NE: |
| 1958 | if (Assumption) |
| 1959 | return AssumeSymNE(St, C.getSymbol(), C.getInt(), isFeasible); |
| 1960 | else |
| 1961 | return AssumeSymEQ(St, C.getSymbol(), C.getInt(), isFeasible); |
| 1962 | } |
| 1963 | } |
| 1964 | |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 1965 | //===----------------------------------------------------------------------===// |
Ted Kremenek | e01c987 | 2008-02-14 22:36:46 +0000 | [diff] [blame] | 1966 | // Visualization. |
Ted Kremenek | ee98546 | 2008-01-16 18:18:48 +0000 | [diff] [blame] | 1967 | //===----------------------------------------------------------------------===// |
| 1968 | |
Ted Kremenek | aa66a32 | 2008-01-16 21:46:15 +0000 | [diff] [blame] | 1969 | #ifndef NDEBUG |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 1970 | static GRExprEngine* GraphPrintCheckerState; |
Ted Kremenek | e97ca06 | 2008-03-07 20:57:30 +0000 | [diff] [blame] | 1971 | static SourceManager* GraphPrintSourceManager; |
Ted Kremenek | 75da3e8 | 2008-03-11 19:02:40 +0000 | [diff] [blame] | 1972 | static ValueState::CheckerStatePrinter* GraphCheckerStatePrinter; |
Ted Kremenek | 3b4f670 | 2008-01-30 23:24:39 +0000 | [diff] [blame] | 1973 | |
Ted Kremenek | aa66a32 | 2008-01-16 21:46:15 +0000 | [diff] [blame] | 1974 | namespace llvm { |
| 1975 | template<> |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 1976 | struct VISIBILITY_HIDDEN DOTGraphTraits<GRExprEngine::NodeTy*> : |
Ted Kremenek | aa66a32 | 2008-01-16 21:46:15 +0000 | [diff] [blame] | 1977 | public DefaultDOTGraphTraits { |
Ted Kremenek | 016f52f | 2008-02-08 21:10:02 +0000 | [diff] [blame] | 1978 | |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 1979 | static void PrintVarBindings(std::ostream& Out, ValueState* St) { |
Ted Kremenek | 016f52f | 2008-02-08 21:10:02 +0000 | [diff] [blame] | 1980 | |
| 1981 | Out << "Variables:\\l"; |
| 1982 | |
Ted Kremenek | 9ff731d | 2008-01-24 22:27:20 +0000 | [diff] [blame] | 1983 | bool isFirst = true; |
| 1984 | |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 1985 | for (ValueState::vb_iterator I=St->vb_begin(), E=St->vb_end(); I!=E;++I) { |
Ted Kremenek | 016f52f | 2008-02-08 21:10:02 +0000 | [diff] [blame] | 1986 | |
| 1987 | if (isFirst) |
| 1988 | isFirst = false; |
| 1989 | else |
| 1990 | Out << "\\l"; |
| 1991 | |
| 1992 | Out << ' ' << I.getKey()->getName() << " : "; |
| 1993 | I.getData().print(Out); |
| 1994 | } |
| 1995 | |
| 1996 | } |
| 1997 | |
Ted Kremenek | e7d2211 | 2008-02-11 19:21:59 +0000 | [diff] [blame] | 1998 | |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 1999 | static void PrintSubExprBindings(std::ostream& Out, ValueState* St){ |
Ted Kremenek | e7d2211 | 2008-02-11 19:21:59 +0000 | [diff] [blame] | 2000 | |
| 2001 | bool isFirst = true; |
| 2002 | |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 2003 | for (ValueState::seb_iterator I=St->seb_begin(), E=St->seb_end();I!=E;++I) { |
Ted Kremenek | e7d2211 | 2008-02-11 19:21:59 +0000 | [diff] [blame] | 2004 | |
| 2005 | if (isFirst) { |
| 2006 | Out << "\\l\\lSub-Expressions:\\l"; |
| 2007 | isFirst = false; |
| 2008 | } |
| 2009 | else |
| 2010 | Out << "\\l"; |
| 2011 | |
| 2012 | Out << " (" << (void*) I.getKey() << ") "; |
| 2013 | I.getKey()->printPretty(Out); |
| 2014 | Out << " : "; |
| 2015 | I.getData().print(Out); |
| 2016 | } |
| 2017 | } |
| 2018 | |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 2019 | static void PrintBlkExprBindings(std::ostream& Out, ValueState* St){ |
Ted Kremenek | e7d2211 | 2008-02-11 19:21:59 +0000 | [diff] [blame] | 2020 | |
Ted Kremenek | 016f52f | 2008-02-08 21:10:02 +0000 | [diff] [blame] | 2021 | bool isFirst = true; |
| 2022 | |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 2023 | for (ValueState::beb_iterator I=St->beb_begin(), E=St->beb_end(); I!=E;++I){ |
Ted Kremenek | 9ff731d | 2008-01-24 22:27:20 +0000 | [diff] [blame] | 2024 | if (isFirst) { |
Ted Kremenek | e7d2211 | 2008-02-11 19:21:59 +0000 | [diff] [blame] | 2025 | Out << "\\l\\lBlock-level Expressions:\\l"; |
Ted Kremenek | 9ff731d | 2008-01-24 22:27:20 +0000 | [diff] [blame] | 2026 | isFirst = false; |
| 2027 | } |
| 2028 | else |
| 2029 | Out << "\\l"; |
Ted Kremenek | 016f52f | 2008-02-08 21:10:02 +0000 | [diff] [blame] | 2030 | |
Ted Kremenek | e7d2211 | 2008-02-11 19:21:59 +0000 | [diff] [blame] | 2031 | Out << " (" << (void*) I.getKey() << ") "; |
| 2032 | I.getKey()->printPretty(Out); |
Ted Kremenek | 9ff731d | 2008-01-24 22:27:20 +0000 | [diff] [blame] | 2033 | Out << " : "; |
| 2034 | I.getData().print(Out); |
| 2035 | } |
| 2036 | } |
| 2037 | |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 2038 | static void PrintEQ(std::ostream& Out, ValueState* St) { |
| 2039 | ValueState::ConstEqTy CE = St->ConstEq; |
Ted Kremenek | ed4de31 | 2008-02-06 03:56:15 +0000 | [diff] [blame] | 2040 | |
| 2041 | if (CE.isEmpty()) |
| 2042 | return; |
| 2043 | |
| 2044 | Out << "\\l\\|'==' constraints:"; |
| 2045 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 2046 | for (ValueState::ConstEqTy::iterator I=CE.begin(), E=CE.end(); I!=E;++I) |
Ted Kremenek | ed4de31 | 2008-02-06 03:56:15 +0000 | [diff] [blame] | 2047 | Out << "\\l $" << I.getKey() << " : " << I.getData()->toString(); |
| 2048 | } |
| 2049 | |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 2050 | static void PrintNE(std::ostream& Out, ValueState* St) { |
| 2051 | ValueState::ConstNotEqTy NE = St->ConstNotEq; |
Ted Kremenek | ed4de31 | 2008-02-06 03:56:15 +0000 | [diff] [blame] | 2052 | |
| 2053 | if (NE.isEmpty()) |
| 2054 | return; |
| 2055 | |
| 2056 | Out << "\\l\\|'!=' constraints:"; |
| 2057 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 2058 | for (ValueState::ConstNotEqTy::iterator I=NE.begin(), EI=NE.end(); |
Ted Kremenek | ed4de31 | 2008-02-06 03:56:15 +0000 | [diff] [blame] | 2059 | I != EI; ++I){ |
| 2060 | |
| 2061 | Out << "\\l $" << I.getKey() << " : "; |
| 2062 | bool isFirst = true; |
| 2063 | |
| 2064 | ValueState::IntSetTy::iterator J=I.getData().begin(), |
| 2065 | EJ=I.getData().end(); |
| 2066 | for ( ; J != EJ; ++J) { |
| 2067 | if (isFirst) isFirst = false; |
| 2068 | else Out << ", "; |
| 2069 | |
| 2070 | Out << (*J)->toString(); |
| 2071 | } |
| 2072 | } |
Ted Kremenek | a3fadfc | 2008-02-14 22:54:53 +0000 | [diff] [blame] | 2073 | } |
| 2074 | |
| 2075 | static std::string getNodeAttributes(const GRExprEngine::NodeTy* N, void*) { |
| 2076 | |
| 2077 | if (GraphPrintCheckerState->isImplicitNullDeref(N) || |
Ted Kremenek | 9dca062 | 2008-02-19 00:22:37 +0000 | [diff] [blame] | 2078 | GraphPrintCheckerState->isExplicitNullDeref(N) || |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 2079 | GraphPrintCheckerState->isUndefDeref(N) || |
| 2080 | GraphPrintCheckerState->isUndefStore(N) || |
| 2081 | GraphPrintCheckerState->isUndefControlFlow(N) || |
Ted Kremenek | 4d839b4 | 2008-03-07 19:04:53 +0000 | [diff] [blame] | 2082 | GraphPrintCheckerState->isExplicitBadDivide(N) || |
| 2083 | GraphPrintCheckerState->isImplicitBadDivide(N) || |
Ted Kremenek | 5e03fcb | 2008-02-29 23:14:48 +0000 | [diff] [blame] | 2084 | GraphPrintCheckerState->isUndefResult(N) || |
Ted Kremenek | 2ded35a | 2008-02-29 23:53:11 +0000 | [diff] [blame] | 2085 | GraphPrintCheckerState->isBadCall(N) || |
| 2086 | GraphPrintCheckerState->isUndefArg(N)) |
Ted Kremenek | a3fadfc | 2008-02-14 22:54:53 +0000 | [diff] [blame] | 2087 | return "color=\"red\",style=\"filled\""; |
| 2088 | |
Ted Kremenek | 8cc13ea | 2008-02-28 20:32:03 +0000 | [diff] [blame] | 2089 | if (GraphPrintCheckerState->isNoReturnCall(N)) |
| 2090 | return "color=\"blue\",style=\"filled\""; |
| 2091 | |
Ted Kremenek | a3fadfc | 2008-02-14 22:54:53 +0000 | [diff] [blame] | 2092 | return ""; |
| 2093 | } |
Ted Kremenek | ed4de31 | 2008-02-06 03:56:15 +0000 | [diff] [blame] | 2094 | |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 2095 | static std::string getNodeLabel(const GRExprEngine::NodeTy* N, void*) { |
Ted Kremenek | aa66a32 | 2008-01-16 21:46:15 +0000 | [diff] [blame] | 2096 | std::ostringstream Out; |
Ted Kremenek | 803c9ed | 2008-01-23 22:30:44 +0000 | [diff] [blame] | 2097 | |
| 2098 | // Program Location. |
Ted Kremenek | aa66a32 | 2008-01-16 21:46:15 +0000 | [diff] [blame] | 2099 | ProgramPoint Loc = N->getLocation(); |
| 2100 | |
| 2101 | switch (Loc.getKind()) { |
| 2102 | case ProgramPoint::BlockEntranceKind: |
| 2103 | Out << "Block Entrance: B" |
| 2104 | << cast<BlockEntrance>(Loc).getBlock()->getBlockID(); |
| 2105 | break; |
| 2106 | |
| 2107 | case ProgramPoint::BlockExitKind: |
| 2108 | assert (false); |
| 2109 | break; |
| 2110 | |
| 2111 | case ProgramPoint::PostStmtKind: { |
Ted Kremenek | e97ca06 | 2008-03-07 20:57:30 +0000 | [diff] [blame] | 2112 | const PostStmt& L = cast<PostStmt>(Loc); |
| 2113 | Stmt* S = L.getStmt(); |
| 2114 | SourceLocation SLoc = S->getLocStart(); |
| 2115 | |
| 2116 | Out << S->getStmtClassName() << ' ' << (void*) S << ' '; |
| 2117 | S->printPretty(Out); |
Ted Kremenek | 9ff731d | 2008-01-24 22:27:20 +0000 | [diff] [blame] | 2118 | |
Ted Kremenek | 9b5551d | 2008-03-09 03:30:59 +0000 | [diff] [blame] | 2119 | if (SLoc.isFileID()) { |
| 2120 | Out << "\\lline=" |
| 2121 | << GraphPrintSourceManager->getLineNumber(SLoc) << " col=" |
| 2122 | << GraphPrintSourceManager->getColumnNumber(SLoc) << "\\l"; |
| 2123 | } |
Ted Kremenek | d131c4f | 2008-02-07 05:48:01 +0000 | [diff] [blame] | 2124 | |
Ted Kremenek | 5e03fcb | 2008-02-29 23:14:48 +0000 | [diff] [blame] | 2125 | if (GraphPrintCheckerState->isImplicitNullDeref(N)) |
Ted Kremenek | d131c4f | 2008-02-07 05:48:01 +0000 | [diff] [blame] | 2126 | Out << "\\|Implicit-Null Dereference.\\l"; |
Ted Kremenek | 5e03fcb | 2008-02-29 23:14:48 +0000 | [diff] [blame] | 2127 | else if (GraphPrintCheckerState->isExplicitNullDeref(N)) |
Ted Kremenek | 63a4f69 | 2008-02-07 06:04:18 +0000 | [diff] [blame] | 2128 | Out << "\\|Explicit-Null Dereference.\\l"; |
Ted Kremenek | 5e03fcb | 2008-02-29 23:14:48 +0000 | [diff] [blame] | 2129 | else if (GraphPrintCheckerState->isUndefDeref(N)) |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 2130 | Out << "\\|Dereference of undefialied value.\\l"; |
Ted Kremenek | 5e03fcb | 2008-02-29 23:14:48 +0000 | [diff] [blame] | 2131 | else if (GraphPrintCheckerState->isUndefStore(N)) |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 2132 | Out << "\\|Store to Undefined LVal."; |
Ted Kremenek | 4d839b4 | 2008-03-07 19:04:53 +0000 | [diff] [blame] | 2133 | else if (GraphPrintCheckerState->isExplicitBadDivide(N)) |
| 2134 | Out << "\\|Explicit divide-by zero or undefined value."; |
| 2135 | else if (GraphPrintCheckerState->isImplicitBadDivide(N)) |
| 2136 | Out << "\\|Implicit divide-by zero or undefined value."; |
Ted Kremenek | 5e03fcb | 2008-02-29 23:14:48 +0000 | [diff] [blame] | 2137 | else if (GraphPrintCheckerState->isUndefResult(N)) |
Ted Kremenek | 8cc13ea | 2008-02-28 20:32:03 +0000 | [diff] [blame] | 2138 | Out << "\\|Result of operation is undefined."; |
Ted Kremenek | 8cc13ea | 2008-02-28 20:32:03 +0000 | [diff] [blame] | 2139 | else if (GraphPrintCheckerState->isNoReturnCall(N)) |
| 2140 | Out << "\\|Call to function marked \"noreturn\"."; |
Ted Kremenek | 5e03fcb | 2008-02-29 23:14:48 +0000 | [diff] [blame] | 2141 | else if (GraphPrintCheckerState->isBadCall(N)) |
| 2142 | Out << "\\|Call to NULL/Undefined."; |
Ted Kremenek | 2ded35a | 2008-02-29 23:53:11 +0000 | [diff] [blame] | 2143 | else if (GraphPrintCheckerState->isUndefArg(N)) |
| 2144 | Out << "\\|Argument in call is undefined"; |
Ted Kremenek | d131c4f | 2008-02-07 05:48:01 +0000 | [diff] [blame] | 2145 | |
Ted Kremenek | aa66a32 | 2008-01-16 21:46:15 +0000 | [diff] [blame] | 2146 | break; |
| 2147 | } |
| 2148 | |
| 2149 | default: { |
| 2150 | const BlockEdge& E = cast<BlockEdge>(Loc); |
| 2151 | Out << "Edge: (B" << E.getSrc()->getBlockID() << ", B" |
| 2152 | << E.getDst()->getBlockID() << ')'; |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 2153 | |
| 2154 | if (Stmt* T = E.getSrc()->getTerminator()) { |
Ted Kremenek | e97ca06 | 2008-03-07 20:57:30 +0000 | [diff] [blame] | 2155 | |
| 2156 | SourceLocation SLoc = T->getLocStart(); |
| 2157 | |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 2158 | Out << "\\|Terminator: "; |
Ted Kremenek | e97ca06 | 2008-03-07 20:57:30 +0000 | [diff] [blame] | 2159 | |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 2160 | E.getSrc()->printTerminator(Out); |
| 2161 | |
Ted Kremenek | 9b5551d | 2008-03-09 03:30:59 +0000 | [diff] [blame] | 2162 | if (SLoc.isFileID()) { |
| 2163 | Out << "\\lline=" |
| 2164 | << GraphPrintSourceManager->getLineNumber(SLoc) << " col=" |
| 2165 | << GraphPrintSourceManager->getColumnNumber(SLoc); |
| 2166 | } |
Ted Kremenek | e97ca06 | 2008-03-07 20:57:30 +0000 | [diff] [blame] | 2167 | |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 2168 | if (isa<SwitchStmt>(T)) { |
| 2169 | Stmt* Label = E.getDst()->getLabel(); |
| 2170 | |
| 2171 | if (Label) { |
| 2172 | if (CaseStmt* C = dyn_cast<CaseStmt>(Label)) { |
| 2173 | Out << "\\lcase "; |
| 2174 | C->getLHS()->printPretty(Out); |
| 2175 | |
| 2176 | if (Stmt* RHS = C->getRHS()) { |
| 2177 | Out << " .. "; |
| 2178 | RHS->printPretty(Out); |
| 2179 | } |
| 2180 | |
| 2181 | Out << ":"; |
| 2182 | } |
| 2183 | else { |
| 2184 | assert (isa<DefaultStmt>(Label)); |
| 2185 | Out << "\\ldefault:"; |
| 2186 | } |
| 2187 | } |
| 2188 | else |
| 2189 | Out << "\\l(implicit) default:"; |
| 2190 | } |
| 2191 | else if (isa<IndirectGotoStmt>(T)) { |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 2192 | // FIXME |
| 2193 | } |
| 2194 | else { |
| 2195 | Out << "\\lCondition: "; |
| 2196 | if (*E.getSrc()->succ_begin() == E.getDst()) |
| 2197 | Out << "true"; |
| 2198 | else |
| 2199 | Out << "false"; |
| 2200 | } |
| 2201 | |
| 2202 | Out << "\\l"; |
| 2203 | } |
Ted Kremenek | 3b4f670 | 2008-01-30 23:24:39 +0000 | [diff] [blame] | 2204 | |
Ted Kremenek | 4a4e524 | 2008-02-28 09:25:22 +0000 | [diff] [blame] | 2205 | if (GraphPrintCheckerState->isUndefControlFlow(N)) { |
| 2206 | Out << "\\|Control-flow based on\\lUndefined value.\\l"; |
Ted Kremenek | 3b4f670 | 2008-01-30 23:24:39 +0000 | [diff] [blame] | 2207 | } |
Ted Kremenek | aa66a32 | 2008-01-16 21:46:15 +0000 | [diff] [blame] | 2208 | } |
| 2209 | } |
| 2210 | |
Ted Kremenek | aed9b6a | 2008-02-28 10:21:43 +0000 | [diff] [blame] | 2211 | Out << "\\|StateID: " << (void*) N->getState() << "\\|"; |
Ted Kremenek | 016f52f | 2008-02-08 21:10:02 +0000 | [diff] [blame] | 2212 | |
Ted Kremenek | 75da3e8 | 2008-03-11 19:02:40 +0000 | [diff] [blame] | 2213 | N->getState()->printDOT(Out, GraphCheckerStatePrinter); |
Ted Kremenek | 803c9ed | 2008-01-23 22:30:44 +0000 | [diff] [blame] | 2214 | |
Ted Kremenek | 803c9ed | 2008-01-23 22:30:44 +0000 | [diff] [blame] | 2215 | Out << "\\l"; |
Ted Kremenek | aa66a32 | 2008-01-16 21:46:15 +0000 | [diff] [blame] | 2216 | return Out.str(); |
| 2217 | } |
| 2218 | }; |
| 2219 | } // end llvm namespace |
| 2220 | #endif |
| 2221 | |
Ted Kremenek | ffe0f43 | 2008-03-07 22:58:01 +0000 | [diff] [blame] | 2222 | #ifndef NDEBUG |
Ted Kremenek | 7ec07fd | 2008-03-12 17:18:20 +0000 | [diff] [blame] | 2223 | |
| 2224 | template <typename ITERATOR> |
| 2225 | GRExprEngine::NodeTy* GetGraphNode(ITERATOR I) { return *I; } |
| 2226 | |
| 2227 | template <> |
| 2228 | GRExprEngine::NodeTy* |
| 2229 | GetGraphNode<llvm::DenseMap<GRExprEngine::NodeTy*, Expr*>::iterator> |
| 2230 | (llvm::DenseMap<GRExprEngine::NodeTy*, Expr*>::iterator I) { |
| 2231 | return I->first; |
| 2232 | } |
| 2233 | |
Ted Kremenek | ffe0f43 | 2008-03-07 22:58:01 +0000 | [diff] [blame] | 2234 | template <typename ITERATOR> |
| 2235 | static void AddSources(llvm::SmallVector<GRExprEngine::NodeTy*, 10>& Sources, |
Ted Kremenek | 7ec07fd | 2008-03-12 17:18:20 +0000 | [diff] [blame] | 2236 | ITERATOR I, ITERATOR E) { |
Ted Kremenek | ffe0f43 | 2008-03-07 22:58:01 +0000 | [diff] [blame] | 2237 | |
Ted Kremenek | 7ec07fd | 2008-03-12 17:18:20 +0000 | [diff] [blame] | 2238 | llvm::SmallPtrSet<void*,10> CachedSources; |
| 2239 | |
| 2240 | for ( ; I != E; ++I ) { |
| 2241 | GRExprEngine::NodeTy* N = GetGraphNode(I); |
| 2242 | void* p = N->getLocation().getRawData(); |
| 2243 | |
| 2244 | if (CachedSources.count(p)) |
| 2245 | continue; |
| 2246 | |
| 2247 | CachedSources.insert(p); |
| 2248 | |
| 2249 | Sources.push_back(N); |
| 2250 | } |
Ted Kremenek | ffe0f43 | 2008-03-07 22:58:01 +0000 | [diff] [blame] | 2251 | } |
| 2252 | #endif |
| 2253 | |
| 2254 | void GRExprEngine::ViewGraph(bool trim) { |
Ted Kremenek | 493d7a2 | 2008-03-11 18:25:33 +0000 | [diff] [blame] | 2255 | #ifndef NDEBUG |
Ted Kremenek | ffe0f43 | 2008-03-07 22:58:01 +0000 | [diff] [blame] | 2256 | if (trim) { |
Ted Kremenek | 7ec07fd | 2008-03-12 17:18:20 +0000 | [diff] [blame] | 2257 | llvm::SmallVector<NodeTy*, 10> Src; |
| 2258 | AddSources(Src, null_derefs_begin(), null_derefs_end()); |
| 2259 | AddSources(Src, undef_derefs_begin(), undef_derefs_end()); |
| 2260 | AddSources(Src, explicit_bad_divides_begin(), explicit_bad_divides_end()); |
| 2261 | AddSources(Src, undef_results_begin(), undef_results_end()); |
| 2262 | AddSources(Src, bad_calls_begin(), bad_calls_end()); |
| 2263 | AddSources(Src, undef_arg_begin(), undef_arg_end()); |
Ted Kremenek | 1b9df4c | 2008-03-14 18:14:50 +0000 | [diff] [blame] | 2264 | AddSources(Src, undef_branches_begin(), undef_branches_end()); |
Ted Kremenek | ffe0f43 | 2008-03-07 22:58:01 +0000 | [diff] [blame] | 2265 | |
Ted Kremenek | 7ec07fd | 2008-03-12 17:18:20 +0000 | [diff] [blame] | 2266 | ViewGraph(&Src[0], &Src[0]+Src.size()); |
Ted Kremenek | ffe0f43 | 2008-03-07 22:58:01 +0000 | [diff] [blame] | 2267 | } |
Ted Kremenek | 493d7a2 | 2008-03-11 18:25:33 +0000 | [diff] [blame] | 2268 | else { |
| 2269 | GraphPrintCheckerState = this; |
| 2270 | GraphPrintSourceManager = &getContext().getSourceManager(); |
Ted Kremenek | 75da3e8 | 2008-03-11 19:02:40 +0000 | [diff] [blame] | 2271 | GraphCheckerStatePrinter = TF->getCheckerStatePrinter(); |
Ted Kremenek | 493d7a2 | 2008-03-11 18:25:33 +0000 | [diff] [blame] | 2272 | |
Ted Kremenek | ffe0f43 | 2008-03-07 22:58:01 +0000 | [diff] [blame] | 2273 | llvm::ViewGraph(*G.roots_begin(), "GRExprEngine"); |
Ted Kremenek | 493d7a2 | 2008-03-11 18:25:33 +0000 | [diff] [blame] | 2274 | |
| 2275 | GraphPrintCheckerState = NULL; |
| 2276 | GraphPrintSourceManager = NULL; |
Ted Kremenek | 75da3e8 | 2008-03-11 19:02:40 +0000 | [diff] [blame] | 2277 | GraphCheckerStatePrinter = NULL; |
Ted Kremenek | 493d7a2 | 2008-03-11 18:25:33 +0000 | [diff] [blame] | 2278 | } |
| 2279 | #endif |
| 2280 | } |
| 2281 | |
| 2282 | void GRExprEngine::ViewGraph(NodeTy** Beg, NodeTy** End) { |
| 2283 | #ifndef NDEBUG |
| 2284 | GraphPrintCheckerState = this; |
| 2285 | GraphPrintSourceManager = &getContext().getSourceManager(); |
Ted Kremenek | 75da3e8 | 2008-03-11 19:02:40 +0000 | [diff] [blame] | 2286 | GraphCheckerStatePrinter = TF->getCheckerStatePrinter(); |
Ted Kremenek | ffe0f43 | 2008-03-07 22:58:01 +0000 | [diff] [blame] | 2287 | |
Ted Kremenek | 493d7a2 | 2008-03-11 18:25:33 +0000 | [diff] [blame] | 2288 | GRExprEngine::GraphTy* TrimmedG = G.Trim(Beg, End); |
| 2289 | |
| 2290 | if (!TrimmedG) |
| 2291 | llvm::cerr << "warning: Trimmed ExplodedGraph is empty.\n"; |
| 2292 | else { |
| 2293 | llvm::ViewGraph(*TrimmedG->roots_begin(), "TrimmedGRExprEngine"); |
| 2294 | delete TrimmedG; |
| 2295 | } |
Ted Kremenek | ffe0f43 | 2008-03-07 22:58:01 +0000 | [diff] [blame] | 2296 | |
Ted Kremenek | 3b4f670 | 2008-01-30 23:24:39 +0000 | [diff] [blame] | 2297 | GraphPrintCheckerState = NULL; |
Ted Kremenek | e97ca06 | 2008-03-07 20:57:30 +0000 | [diff] [blame] | 2298 | GraphPrintSourceManager = NULL; |
Ted Kremenek | 75da3e8 | 2008-03-11 19:02:40 +0000 | [diff] [blame] | 2299 | GraphCheckerStatePrinter = NULL; |
Ted Kremenek | e01c987 | 2008-02-14 22:36:46 +0000 | [diff] [blame] | 2300 | #endif |
Ted Kremenek | ee98546 | 2008-01-16 18:18:48 +0000 | [diff] [blame] | 2301 | } |