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 | e01c987 | 2008-02-14 22:36:46 +0000 | [diff] [blame] | 17 | #include "llvm/Support/Streams.h" |
Ted Kremenek | b387a3f | 2008-02-14 22:16:04 +0000 | [diff] [blame] | 18 | |
Ted Kremenek | 0f5f059 | 2008-02-27 06:07:00 +0000 | [diff] [blame^] | 19 | #ifndef NDEBUG |
| 20 | #include "llvm/Support/GraphWriter.h" |
| 21 | #include <sstream> |
| 22 | #endif |
| 23 | |
Ted Kremenek | b387a3f | 2008-02-14 22:16:04 +0000 | [diff] [blame] | 24 | using namespace clang; |
| 25 | using llvm::dyn_cast; |
| 26 | using llvm::cast; |
| 27 | using llvm::APSInt; |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 28 | |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 29 | GRExprEngine::StateTy |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 30 | GRExprEngine::SetRVal(StateTy St, Expr* Ex, const RVal& V) { |
Ted Kremenek | 3271f8d | 2008-02-07 04:16:04 +0000 | [diff] [blame] | 31 | |
Ted Kremenek | e070a1d | 2008-02-04 21:59:01 +0000 | [diff] [blame] | 32 | if (!StateCleaned) { |
| 33 | St = RemoveDeadBindings(CurrentStmt, St); |
| 34 | StateCleaned = true; |
| 35 | } |
Ted Kremenek | 3271f8d | 2008-02-07 04:16:04 +0000 | [diff] [blame] | 36 | |
Ted Kremenek | e070a1d | 2008-02-04 21:59:01 +0000 | [diff] [blame] | 37 | bool isBlkExpr = false; |
Ted Kremenek | 3271f8d | 2008-02-07 04:16:04 +0000 | [diff] [blame] | 38 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 39 | if (Ex == CurrentStmt) { |
| 40 | isBlkExpr = getCFG().isBlkExpr(Ex); |
Ted Kremenek | e070a1d | 2008-02-04 21:59:01 +0000 | [diff] [blame] | 41 | |
| 42 | if (!isBlkExpr) |
| 43 | return St; |
| 44 | } |
Ted Kremenek | 3271f8d | 2008-02-07 04:16:04 +0000 | [diff] [blame] | 45 | |
Ted Kremenek | 5a7b382 | 2008-02-26 23:37:01 +0000 | [diff] [blame] | 46 | return StateMgr.SetRVal(St, Ex, V, isBlkExpr, false); |
Ted Kremenek | e070a1d | 2008-02-04 21:59:01 +0000 | [diff] [blame] | 47 | } |
| 48 | |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 49 | const GRExprEngine::StateTy::BufferTy& |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 50 | GRExprEngine::SetRVal(StateTy St, Expr* Ex, const RVal::BufferTy& RB, |
Ted Kremenek | cba2e43 | 2008-02-05 19:35:18 +0000 | [diff] [blame] | 51 | StateTy::BufferTy& RetBuf) { |
| 52 | |
| 53 | assert (RetBuf.empty()); |
| 54 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 55 | for (RVal::BufferTy::const_iterator I = RB.begin(), E = RB.end(); I!=E; ++I) |
| 56 | RetBuf.push_back(SetRVal(St, Ex, *I)); |
Ted Kremenek | cba2e43 | 2008-02-05 19:35:18 +0000 | [diff] [blame] | 57 | |
| 58 | return RetBuf; |
| 59 | } |
| 60 | |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 61 | GRExprEngine::StateTy |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 62 | GRExprEngine::SetRVal(StateTy St, const LVal& LV, const RVal& RV) { |
Ted Kremenek | e070a1d | 2008-02-04 21:59:01 +0000 | [diff] [blame] | 63 | |
| 64 | if (!StateCleaned) { |
| 65 | St = RemoveDeadBindings(CurrentStmt, St); |
| 66 | StateCleaned = true; |
| 67 | } |
| 68 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 69 | return StateMgr.SetRVal(St, LV, RV); |
Ted Kremenek | e070a1d | 2008-02-04 21:59:01 +0000 | [diff] [blame] | 70 | } |
| 71 | |
Ted Kremenek | 05a2378 | 2008-02-26 19:05:15 +0000 | [diff] [blame] | 72 | GRExprEngine::StateTy |
| 73 | GRExprEngine::MarkBranch(StateTy St, Stmt* Terminator, bool branchTaken) { |
| 74 | |
| 75 | switch (Terminator->getStmtClass()) { |
| 76 | default: |
| 77 | return St; |
| 78 | |
| 79 | case Stmt::BinaryOperatorClass: { // '&&' and '||' |
| 80 | |
| 81 | BinaryOperator* B = cast<BinaryOperator>(Terminator); |
| 82 | BinaryOperator::Opcode Op = B->getOpcode(); |
| 83 | |
| 84 | assert (Op == BinaryOperator::LAnd || Op == BinaryOperator::LOr); |
| 85 | |
| 86 | // For &&, if we take the true branch, then the value of the whole |
| 87 | // expression is that of the RHS expression. |
| 88 | // |
| 89 | // For ||, if we take the false branch, then the value of the whole |
| 90 | // expression is that of the RHS expression. |
| 91 | |
| 92 | Expr* Ex = (Op == BinaryOperator::LAnd && branchTaken) || |
| 93 | (Op == BinaryOperator::LOr && !branchTaken) |
| 94 | ? B->getRHS() : B->getLHS(); |
| 95 | |
| 96 | return SetBlkExprRVal(St, B, UninitializedVal(Ex)); |
| 97 | } |
| 98 | |
| 99 | case Stmt::ConditionalOperatorClass: { // ?: |
| 100 | |
| 101 | ConditionalOperator* C = cast<ConditionalOperator>(Terminator); |
| 102 | |
| 103 | // For ?, if branchTaken == true then the value is either the LHS or |
| 104 | // the condition itself. (GNU extension). |
| 105 | |
| 106 | Expr* Ex; |
| 107 | |
| 108 | if (branchTaken) |
| 109 | Ex = C->getLHS() ? C->getLHS() : C->getCond(); |
| 110 | else |
| 111 | Ex = C->getRHS(); |
| 112 | |
| 113 | return SetBlkExprRVal(St, C, UninitializedVal(Ex)); |
| 114 | } |
| 115 | |
| 116 | case Stmt::ChooseExprClass: { // ?: |
| 117 | |
| 118 | ChooseExpr* C = cast<ChooseExpr>(Terminator); |
| 119 | |
| 120 | Expr* Ex = branchTaken ? C->getLHS() : C->getRHS(); |
| 121 | return SetBlkExprRVal(St, C, UninitializedVal(Ex)); |
| 122 | } |
| 123 | } |
| 124 | } |
| 125 | |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 126 | void GRExprEngine::ProcessBranch(Expr* Condition, Stmt* Term, |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 127 | BranchNodeBuilder& builder) { |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 128 | |
Ted Kremenek | e7d2211 | 2008-02-11 19:21:59 +0000 | [diff] [blame] | 129 | // Remove old bindings for subexpressions. |
| 130 | StateTy PrevState = StateMgr.RemoveSubExprBindings(builder.getState()); |
Ted Kremenek | f233d48 | 2008-02-05 00:26:40 +0000 | [diff] [blame] | 131 | |
Ted Kremenek | b233183 | 2008-02-15 22:29:00 +0000 | [diff] [blame] | 132 | // Check for NULL conditions; e.g. "for(;;)" |
| 133 | if (!Condition) { |
| 134 | builder.markInfeasible(false); |
| 135 | |
| 136 | // Get the current block counter. |
| 137 | GRBlockCounter BC = builder.getBlockCounter(); |
| 138 | unsigned BlockID = builder.getTargetBlock(true)->getBlockID(); |
| 139 | unsigned NumVisited = BC.getNumVisited(BlockID); |
| 140 | |
| 141 | if (NumVisited < 1) builder.generateNode(PrevState, true); |
| 142 | else builder.markInfeasible(true); |
| 143 | |
| 144 | return; |
| 145 | } |
| 146 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 147 | RVal V = GetRVal(PrevState, Condition); |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 148 | |
| 149 | switch (V.getBaseKind()) { |
| 150 | default: |
| 151 | break; |
| 152 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 153 | case RVal::UnknownKind: |
Ted Kremenek | 58b3321 | 2008-02-26 19:40:44 +0000 | [diff] [blame] | 154 | builder.generateNode(MarkBranch(PrevState, Term, true), true); |
| 155 | builder.generateNode(MarkBranch(PrevState, Term, false), false); |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 156 | return; |
| 157 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 158 | case RVal::UninitializedKind: { |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 159 | NodeTy* N = builder.generateNode(PrevState, true); |
| 160 | |
| 161 | if (N) { |
| 162 | N->markAsSink(); |
| 163 | UninitBranches.insert(N); |
| 164 | } |
| 165 | |
| 166 | builder.markInfeasible(false); |
| 167 | return; |
| 168 | } |
| 169 | } |
Ted Kremenek | b233183 | 2008-02-15 22:29:00 +0000 | [diff] [blame] | 170 | |
Ted Kremenek | 8e49dd6 | 2008-02-12 18:08:17 +0000 | [diff] [blame] | 171 | // Get the current block counter. |
| 172 | GRBlockCounter BC = builder.getBlockCounter(); |
Ted Kremenek | d9435bf | 2008-02-12 19:49:57 +0000 | [diff] [blame] | 173 | unsigned BlockID = builder.getTargetBlock(true)->getBlockID(); |
| 174 | unsigned NumVisited = BC.getNumVisited(BlockID); |
Ted Kremenek | f233d48 | 2008-02-05 00:26:40 +0000 | [diff] [blame] | 175 | |
Ted Kremenek | 8e49dd6 | 2008-02-12 18:08:17 +0000 | [diff] [blame] | 176 | if (isa<nonlval::ConcreteInt>(V) || |
| 177 | BC.getNumVisited(builder.getTargetBlock(true)->getBlockID()) < 1) { |
| 178 | |
| 179 | // Process the true branch. |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 180 | |
Ted Kremenek | 8e49dd6 | 2008-02-12 18:08:17 +0000 | [diff] [blame] | 181 | bool isFeasible = true; |
| 182 | |
| 183 | StateTy St = Assume(PrevState, V, true, isFeasible); |
| 184 | |
| 185 | if (isFeasible) |
Ted Kremenek | 05a2378 | 2008-02-26 19:05:15 +0000 | [diff] [blame] | 186 | builder.generateNode(MarkBranch(St, Term, true), true); |
Ted Kremenek | 8e49dd6 | 2008-02-12 18:08:17 +0000 | [diff] [blame] | 187 | else |
| 188 | builder.markInfeasible(true); |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 189 | } |
Ted Kremenek | 8e49dd6 | 2008-02-12 18:08:17 +0000 | [diff] [blame] | 190 | else |
| 191 | builder.markInfeasible(true); |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 192 | |
Ted Kremenek | d9435bf | 2008-02-12 19:49:57 +0000 | [diff] [blame] | 193 | BlockID = builder.getTargetBlock(false)->getBlockID(); |
| 194 | NumVisited = BC.getNumVisited(BlockID); |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 195 | |
Ted Kremenek | 8e49dd6 | 2008-02-12 18:08:17 +0000 | [diff] [blame] | 196 | if (isa<nonlval::ConcreteInt>(V) || |
| 197 | BC.getNumVisited(builder.getTargetBlock(false)->getBlockID()) < 1) { |
| 198 | |
| 199 | // Process the false branch. |
| 200 | |
| 201 | bool isFeasible = false; |
| 202 | |
| 203 | StateTy St = Assume(PrevState, V, false, isFeasible); |
| 204 | |
| 205 | if (isFeasible) |
Ted Kremenek | 05a2378 | 2008-02-26 19:05:15 +0000 | [diff] [blame] | 206 | builder.generateNode(MarkBranch(St, Term, false), false); |
Ted Kremenek | 8e49dd6 | 2008-02-12 18:08:17 +0000 | [diff] [blame] | 207 | else |
| 208 | builder.markInfeasible(false); |
| 209 | } |
Ted Kremenek | f233d48 | 2008-02-05 00:26:40 +0000 | [diff] [blame] | 210 | else |
| 211 | builder.markInfeasible(false); |
Ted Kremenek | 71c29bd | 2008-01-29 23:32:35 +0000 | [diff] [blame] | 212 | } |
| 213 | |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 214 | /// ProcessIndirectGoto - Called by GRCoreEngine. Used to generate successor |
Ted Kremenek | 754607e | 2008-02-13 00:24:44 +0000 | [diff] [blame] | 215 | /// nodes by processing the 'effects' of a computed goto jump. |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 216 | void GRExprEngine::ProcessIndirectGoto(IndirectGotoNodeBuilder& builder) { |
Ted Kremenek | 754607e | 2008-02-13 00:24:44 +0000 | [diff] [blame] | 217 | |
| 218 | StateTy St = builder.getState(); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 219 | RVal V = GetRVal(St, builder.getTarget()); |
Ted Kremenek | 754607e | 2008-02-13 00:24:44 +0000 | [diff] [blame] | 220 | |
| 221 | // Three possibilities: |
| 222 | // |
| 223 | // (1) We know the computed label. |
| 224 | // (2) The label is NULL (or some other constant), or Uninitialized. |
| 225 | // (3) We have no clue about the label. Dispatch to all targets. |
| 226 | // |
| 227 | |
| 228 | typedef IndirectGotoNodeBuilder::iterator iterator; |
| 229 | |
| 230 | if (isa<lval::GotoLabel>(V)) { |
| 231 | LabelStmt* L = cast<lval::GotoLabel>(V).getLabel(); |
| 232 | |
| 233 | for (iterator I=builder.begin(), E=builder.end(); I != E; ++I) { |
Ted Kremenek | 24f1a96 | 2008-02-13 17:27:37 +0000 | [diff] [blame] | 234 | if (I.getLabel() == L) { |
| 235 | builder.generateNode(I, St); |
Ted Kremenek | 754607e | 2008-02-13 00:24:44 +0000 | [diff] [blame] | 236 | return; |
| 237 | } |
| 238 | } |
| 239 | |
| 240 | assert (false && "No block with label."); |
| 241 | return; |
| 242 | } |
| 243 | |
| 244 | if (isa<lval::ConcreteInt>(V) || isa<UninitializedVal>(V)) { |
| 245 | // Dispatch to the first target and mark it as a sink. |
Ted Kremenek | 24f1a96 | 2008-02-13 17:27:37 +0000 | [diff] [blame] | 246 | NodeTy* N = builder.generateNode(builder.begin(), St, true); |
Ted Kremenek | 754607e | 2008-02-13 00:24:44 +0000 | [diff] [blame] | 247 | UninitBranches.insert(N); |
| 248 | return; |
| 249 | } |
| 250 | |
| 251 | // This is really a catch-all. We don't support symbolics yet. |
| 252 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 253 | assert (V.isUnknown()); |
Ted Kremenek | 754607e | 2008-02-13 00:24:44 +0000 | [diff] [blame] | 254 | |
| 255 | for (iterator I=builder.begin(), E=builder.end(); I != E; ++I) |
Ted Kremenek | 24f1a96 | 2008-02-13 17:27:37 +0000 | [diff] [blame] | 256 | builder.generateNode(I, St); |
Ted Kremenek | 754607e | 2008-02-13 00:24:44 +0000 | [diff] [blame] | 257 | } |
Ted Kremenek | f233d48 | 2008-02-05 00:26:40 +0000 | [diff] [blame] | 258 | |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 259 | /// ProcessSwitch - Called by GRCoreEngine. Used to generate successor |
| 260 | /// nodes by processing the 'effects' of a switch statement. |
| 261 | void GRExprEngine::ProcessSwitch(SwitchNodeBuilder& builder) { |
| 262 | |
| 263 | typedef SwitchNodeBuilder::iterator iterator; |
| 264 | |
| 265 | StateTy St = builder.getState(); |
Ted Kremenek | 692416c | 2008-02-18 22:57:02 +0000 | [diff] [blame] | 266 | Expr* CondE = builder.getCondition(); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 267 | RVal CondV = GetRVal(St, CondE); |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 268 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 269 | if (CondV.isUninit()) { |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 270 | NodeTy* N = builder.generateDefaultCaseNode(St, true); |
| 271 | UninitBranches.insert(N); |
| 272 | return; |
| 273 | } |
| 274 | |
| 275 | StateTy DefaultSt = St; |
| 276 | |
| 277 | // While most of this can be assumed (such as the signedness), having it |
| 278 | // just computed makes sure everything makes the same assumptions end-to-end. |
Ted Kremenek | 692416c | 2008-02-18 22:57:02 +0000 | [diff] [blame] | 279 | |
| 280 | unsigned bits = getContext().getTypeSize(CondE->getType(), |
| 281 | CondE->getExprLoc()); |
| 282 | |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 283 | APSInt V1(bits, false); |
| 284 | APSInt V2 = V1; |
| 285 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 286 | for (iterator I = builder.begin(), EI = builder.end(); I != EI; ++I) { |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 287 | |
| 288 | CaseStmt* Case = cast<CaseStmt>(I.getCase()); |
| 289 | |
| 290 | // Evaluate the case. |
| 291 | if (!Case->getLHS()->isIntegerConstantExpr(V1, getContext(), 0, true)) { |
| 292 | assert (false && "Case condition must evaluate to an integer constant."); |
| 293 | return; |
| 294 | } |
| 295 | |
| 296 | // Get the RHS of the case, if it exists. |
| 297 | |
| 298 | if (Expr* E = Case->getRHS()) { |
| 299 | if (!E->isIntegerConstantExpr(V2, getContext(), 0, true)) { |
| 300 | assert (false && |
| 301 | "Case condition (RHS) must evaluate to an integer constant."); |
| 302 | return ; |
| 303 | } |
| 304 | |
| 305 | assert (V1 <= V2); |
| 306 | } |
| 307 | else V2 = V1; |
| 308 | |
| 309 | // FIXME: Eventually we should replace the logic below with a range |
| 310 | // comparison, rather than concretize the values within the range. |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 311 | // This should be easy once we have "ranges" for NonLVals. |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 312 | |
| 313 | do { |
| 314 | nonlval::ConcreteInt CaseVal(ValMgr.getValue(V1)); |
| 315 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 316 | RVal Res = EvalBinOp(BinaryOperator::EQ, CondV, CaseVal); |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 317 | |
| 318 | // Now "assume" that the case matches. |
Ted Kremenek | 692416c | 2008-02-18 22:57:02 +0000 | [diff] [blame] | 319 | bool isFeasible = false; |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 320 | |
Ted Kremenek | 6cb0b54 | 2008-02-14 19:37:24 +0000 | [diff] [blame] | 321 | StateTy StNew = Assume(St, Res, true, isFeasible); |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 322 | |
| 323 | if (isFeasible) { |
| 324 | builder.generateCaseStmtNode(I, StNew); |
| 325 | |
| 326 | // If CondV evaluates to a constant, then we know that this |
| 327 | // is the *only* case that we can take, so stop evaluating the |
| 328 | // others. |
| 329 | if (isa<nonlval::ConcreteInt>(CondV)) |
| 330 | return; |
| 331 | } |
| 332 | |
| 333 | // Now "assume" that the case doesn't match. Add this state |
| 334 | // to the default state (if it is feasible). |
| 335 | |
Ted Kremenek | 6cb0b54 | 2008-02-14 19:37:24 +0000 | [diff] [blame] | 336 | StNew = Assume(DefaultSt, Res, false, isFeasible); |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 337 | |
| 338 | if (isFeasible) |
| 339 | DefaultSt = StNew; |
| 340 | |
| 341 | // Concretize the next value in the range. |
| 342 | ++V1; |
| 343 | |
| 344 | } while (V1 < V2); |
| 345 | } |
| 346 | |
| 347 | // If we reach here, than we know that the default branch is |
| 348 | // possible. |
| 349 | builder.generateDefaultCaseNode(DefaultSt); |
| 350 | } |
| 351 | |
| 352 | |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 353 | void GRExprEngine::VisitLogicalExpr(BinaryOperator* B, NodeTy* Pred, |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 354 | NodeSet& Dst) { |
Ted Kremenek | 9dca062 | 2008-02-19 00:22:37 +0000 | [diff] [blame] | 355 | |
Ted Kremenek | 05a2378 | 2008-02-26 19:05:15 +0000 | [diff] [blame] | 356 | assert (B->getOpcode() == BinaryOperator::LAnd || |
| 357 | B->getOpcode() == BinaryOperator::LOr); |
| 358 | |
| 359 | assert (B == CurrentStmt && getCFG().isBlkExpr(B)); |
| 360 | |
| 361 | StateTy St = Pred->getState(); |
| 362 | RVal X = GetBlkExprRVal(St, B); |
| 363 | |
| 364 | assert (X.isUninit()); |
| 365 | |
| 366 | Expr* Ex = (Expr*) cast<UninitializedVal>(X).getData(); |
| 367 | |
| 368 | assert (Ex); |
| 369 | |
| 370 | if (Ex == B->getRHS()) { |
| 371 | |
| 372 | X = GetBlkExprRVal(St, Ex); |
| 373 | |
Ted Kremenek | 58b3321 | 2008-02-26 19:40:44 +0000 | [diff] [blame] | 374 | // Handle uninitialized values. |
| 375 | |
| 376 | if (X.isUninit()) { |
| 377 | Nodify(Dst, B, Pred, SetBlkExprRVal(St, B, X)); |
| 378 | return; |
| 379 | } |
| 380 | |
Ted Kremenek | 05a2378 | 2008-02-26 19:05:15 +0000 | [diff] [blame] | 381 | // We took the RHS. Because the value of the '&&' or '||' expression must |
| 382 | // evaluate to 0 or 1, we must assume the value of the RHS evaluates to 0 |
| 383 | // or 1. Alternatively, we could take a lazy approach, and calculate this |
| 384 | // value later when necessary. We don't have the machinery in place for |
| 385 | // this right now, and since most logical expressions are used for branches, |
| 386 | // the payoff is not likely to be large. Instead, we do eager evaluation. |
| 387 | |
| 388 | bool isFeasible = false; |
| 389 | StateTy NewState = Assume(St, X, true, isFeasible); |
| 390 | |
| 391 | if (isFeasible) |
| 392 | Nodify(Dst, B, Pred, SetBlkExprRVal(NewState, B, MakeConstantVal(1U, B))); |
| 393 | |
| 394 | isFeasible = false; |
| 395 | NewState = Assume(St, X, false, isFeasible); |
| 396 | |
| 397 | if (isFeasible) |
| 398 | Nodify(Dst, B, Pred, SetBlkExprRVal(NewState, B, MakeConstantVal(0U, B))); |
Ted Kremenek | f233d48 | 2008-02-05 00:26:40 +0000 | [diff] [blame] | 399 | } |
| 400 | else { |
Ted Kremenek | 05a2378 | 2008-02-26 19:05:15 +0000 | [diff] [blame] | 401 | // We took the LHS expression. Depending on whether we are '&&' or |
| 402 | // '||' we know what the value of the expression is via properties of |
| 403 | // the short-circuiting. |
| 404 | |
| 405 | X = MakeConstantVal( B->getOpcode() == BinaryOperator::LAnd ? 0U : 1U, B); |
| 406 | Nodify(Dst, B, Pred, SetBlkExprRVal(St, B, X)); |
Ted Kremenek | f233d48 | 2008-02-05 00:26:40 +0000 | [diff] [blame] | 407 | } |
Ted Kremenek | f233d48 | 2008-02-05 00:26:40 +0000 | [diff] [blame] | 408 | } |
Ted Kremenek | 05a2378 | 2008-02-26 19:05:15 +0000 | [diff] [blame] | 409 | |
Ted Kremenek | f233d48 | 2008-02-05 00:26:40 +0000 | [diff] [blame] | 410 | |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 411 | void GRExprEngine::ProcessStmt(Stmt* S, StmtNodeBuilder& builder) { |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 412 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 413 | Builder = &builder; |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 414 | StmtEntryNode = builder.getLastNode(); |
| 415 | CurrentStmt = S; |
| 416 | NodeSet Dst; |
| 417 | StateCleaned = false; |
| 418 | |
| 419 | Visit(S, StmtEntryNode, Dst); |
| 420 | |
| 421 | // If no nodes were generated, generate a new node that has all the |
| 422 | // dead mappings removed. |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 423 | |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 424 | if (Dst.size() == 1 && *Dst.begin() == StmtEntryNode) { |
| 425 | StateTy St = RemoveDeadBindings(S, StmtEntryNode->getState()); |
| 426 | builder.generateNode(S, St, StmtEntryNode); |
| 427 | } |
Ted Kremenek | f84469b | 2008-01-18 00:41:32 +0000 | [diff] [blame] | 428 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 429 | // For safety, NULL out these variables. |
| 430 | |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 431 | CurrentStmt = NULL; |
| 432 | StmtEntryNode = NULL; |
| 433 | Builder = NULL; |
Ted Kremenek | d27f816 | 2008-01-15 23:55:06 +0000 | [diff] [blame] | 434 | } |
| 435 | |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 436 | GRExprEngine::NodeTy* |
| 437 | GRExprEngine::Nodify(NodeSet& Dst, Stmt* S, NodeTy* Pred, StateTy St) { |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 438 | |
| 439 | // If the state hasn't changed, don't generate a new node. |
Ted Kremenek | 7e59336 | 2008-02-07 15:20:13 +0000 | [diff] [blame] | 440 | if (St == Pred->getState()) |
Ted Kremenek | d131c4f | 2008-02-07 05:48:01 +0000 | [diff] [blame] | 441 | return NULL; |
Ted Kremenek | cb448ca | 2008-01-16 00:53:15 +0000 | [diff] [blame] | 442 | |
Ted Kremenek | d131c4f | 2008-02-07 05:48:01 +0000 | [diff] [blame] | 443 | NodeTy* N = Builder->generateNode(S, St, Pred); |
| 444 | Dst.Add(N); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 445 | |
Ted Kremenek | d131c4f | 2008-02-07 05:48:01 +0000 | [diff] [blame] | 446 | return N; |
Ted Kremenek | cb448ca | 2008-01-16 00:53:15 +0000 | [diff] [blame] | 447 | } |
Ted Kremenek | d27f816 | 2008-01-15 23:55:06 +0000 | [diff] [blame] | 448 | |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 449 | void GRExprEngine::Nodify(NodeSet& Dst, Stmt* S, NodeTy* Pred, |
Ted Kremenek | cba2e43 | 2008-02-05 19:35:18 +0000 | [diff] [blame] | 450 | const StateTy::BufferTy& SB) { |
| 451 | |
| 452 | for (StateTy::BufferTy::const_iterator I=SB.begin(), E=SB.end(); I!=E; ++I) |
| 453 | Nodify(Dst, S, Pred, *I); |
| 454 | } |
| 455 | |
Ted Kremenek | 44842c2 | 2008-02-13 18:06:44 +0000 | [diff] [blame] | 456 | void GRExprEngine::VisitDeclRefExpr(DeclRefExpr* D, NodeTy* Pred, NodeSet& Dst){ |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 457 | |
Ted Kremenek | d763eb9 | 2008-02-26 02:15:56 +0000 | [diff] [blame] | 458 | if (VarDecl* VD = dyn_cast<VarDecl>(D->getDecl())) |
| 459 | if (VD->hasGlobalStorage() || isa<ParmVarDecl>(VD)) { |
| 460 | |
| 461 | StateTy StOld = Pred->getState(); |
| 462 | StateTy St = Symbolicate(StOld, VD); |
| 463 | |
| 464 | if (!(St == StOld)) { |
| 465 | if (D != CurrentStmt) |
| 466 | Nodify(Dst, D, Pred, St); |
| 467 | else |
| 468 | Nodify(Dst, D, Pred, SetRVal(St, D, GetRVal(St, D))); |
| 469 | |
| 470 | return; |
| 471 | } |
| 472 | } |
| 473 | |
Ted Kremenek | 3271f8d | 2008-02-07 04:16:04 +0000 | [diff] [blame] | 474 | if (D != CurrentStmt) { |
| 475 | Dst.Add(Pred); // No-op. Simply propagate the current state unchanged. |
| 476 | return; |
| 477 | } |
| 478 | |
| 479 | // If we are here, we are loading the value of the decl and binding |
| 480 | // it to the block-level expression. |
| 481 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 482 | StateTy St = Pred->getState(); |
| 483 | Nodify(Dst, D, Pred, SetRVal(St, D, GetRVal(St, D))); |
Ted Kremenek | 3271f8d | 2008-02-07 04:16:04 +0000 | [diff] [blame] | 484 | } |
| 485 | |
Ted Kremenek | de43424 | 2008-02-19 01:44:53 +0000 | [diff] [blame] | 486 | void GRExprEngine::VisitCall(CallExpr* CE, NodeTy* Pred, |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 487 | CallExpr::arg_iterator AI, |
| 488 | CallExpr::arg_iterator AE, |
Ted Kremenek | de43424 | 2008-02-19 01:44:53 +0000 | [diff] [blame] | 489 | NodeSet& Dst) { |
| 490 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 491 | // Process the arguments. |
| 492 | |
| 493 | if (AI != AE) { |
Ted Kremenek | de43424 | 2008-02-19 01:44:53 +0000 | [diff] [blame] | 494 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 495 | NodeSet DstTmp; |
Ted Kremenek | a6fbe80 | 2008-02-27 00:44:11 +0000 | [diff] [blame] | 496 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 497 | Visit(*AI, Pred, DstTmp); |
Ted Kremenek | a6fbe80 | 2008-02-27 00:44:11 +0000 | [diff] [blame] | 498 | if (DstTmp.empty()) DstTmp.Add(Pred); |
| 499 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 500 | ++AI; |
| 501 | |
| 502 | for (NodeSet::iterator DI=DstTmp.begin(), DE=DstTmp.end(); DI != DE; ++DI) |
| 503 | VisitCall(CE, *DI, AI, AE, Dst); |
Ted Kremenek | de43424 | 2008-02-19 01:44:53 +0000 | [diff] [blame] | 504 | |
| 505 | return; |
| 506 | } |
| 507 | |
| 508 | // If we reach here we have processed all of the arguments. Evaluate |
| 509 | // the callee expression. |
Ted Kremenek | 994a09b | 2008-02-25 21:16:03 +0000 | [diff] [blame] | 510 | NodeSet DstTmp; |
| 511 | Expr* Callee = CE->getCallee()->IgnoreParenCasts(); |
| 512 | |
| 513 | VisitLVal(Callee, Pred, DstTmp); |
Ted Kremenek | 3ef1512 | 2008-02-27 00:46:25 +0000 | [diff] [blame] | 514 | if (DstTmp.empty()) DstTmp.Add(Pred); |
Ted Kremenek | de43424 | 2008-02-19 01:44:53 +0000 | [diff] [blame] | 515 | |
| 516 | // Finally, evaluate the function call. |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 517 | for (NodeSet::iterator DI = DstTmp.begin(), DE = DstTmp.end(); DI!=DE; ++DI) { |
| 518 | |
Ted Kremenek | de43424 | 2008-02-19 01:44:53 +0000 | [diff] [blame] | 519 | StateTy St = (*DI)->getState(); |
Ted Kremenek | 994a09b | 2008-02-25 21:16:03 +0000 | [diff] [blame] | 520 | RVal L = GetLVal(St, Callee); |
Ted Kremenek | de43424 | 2008-02-19 01:44:53 +0000 | [diff] [blame] | 521 | |
| 522 | // Check for uninitialized control-flow. |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 523 | |
| 524 | if (L.isUninit()) { |
| 525 | |
Ted Kremenek | de43424 | 2008-02-19 01:44:53 +0000 | [diff] [blame] | 526 | NodeTy* N = Builder->generateNode(CE, St, *DI); |
| 527 | N->markAsSink(); |
| 528 | UninitBranches.insert(N); |
| 529 | continue; |
| 530 | } |
| 531 | |
Ted Kremenek | 03da0d7 | 2008-02-21 19:46:04 +0000 | [diff] [blame] | 532 | if (L.isUnknown()) { |
| 533 | // Invalidate all arguments passed in by reference (LVals). |
| 534 | for (CallExpr::arg_iterator I = CE->arg_begin(), E = CE->arg_end(); |
| 535 | I != E; ++I) { |
| 536 | RVal V = GetRVal(St, *I); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 537 | |
Ted Kremenek | 03da0d7 | 2008-02-21 19:46:04 +0000 | [diff] [blame] | 538 | if (isa<LVal>(V)) |
| 539 | St = SetRVal(St, cast<LVal>(V), UnknownVal()); |
| 540 | } |
| 541 | } |
| 542 | else |
| 543 | St = EvalCall(CE, cast<LVal>(L), (*DI)->getState()); |
| 544 | |
| 545 | Nodify(Dst, CE, *DI, St); |
Ted Kremenek | de43424 | 2008-02-19 01:44:53 +0000 | [diff] [blame] | 546 | } |
| 547 | } |
| 548 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 549 | void GRExprEngine::VisitCast(Expr* CastE, Expr* Ex, NodeTy* Pred, NodeSet& Dst){ |
Ted Kremenek | 874d63f | 2008-01-24 02:02:54 +0000 | [diff] [blame] | 550 | |
Ted Kremenek | 5d3003a | 2008-02-19 18:52:54 +0000 | [diff] [blame] | 551 | NodeSet S1; |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 552 | Visit(Ex, Pred, S1); |
Ted Kremenek | 874d63f | 2008-01-24 02:02:54 +0000 | [diff] [blame] | 553 | |
Ted Kremenek | 5d3003a | 2008-02-19 18:52:54 +0000 | [diff] [blame] | 554 | QualType T = CastE->getType(); |
| 555 | |
Ted Kremenek | 402563b | 2008-02-19 18:47:04 +0000 | [diff] [blame] | 556 | // Check for redundant casts or casting to "void" |
| 557 | if (T->isVoidType() || |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 558 | Ex->getType() == T || |
| 559 | (T->isPointerType() && Ex->getType()->isFunctionType())) { |
Ted Kremenek | 5d3003a | 2008-02-19 18:52:54 +0000 | [diff] [blame] | 560 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 561 | for (NodeSet::iterator I1 = S1.begin(), E1 = S1.end(); I1 != E1; ++I1) |
Ted Kremenek | 5d3003a | 2008-02-19 18:52:54 +0000 | [diff] [blame] | 562 | Dst.Add(*I1); |
| 563 | |
Ted Kremenek | 874d63f | 2008-01-24 02:02:54 +0000 | [diff] [blame] | 564 | return; |
| 565 | } |
| 566 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 567 | for (NodeSet::iterator I1 = S1.begin(), E1 = S1.end(); I1 != E1; ++I1) { |
Ted Kremenek | 874d63f | 2008-01-24 02:02:54 +0000 | [diff] [blame] | 568 | NodeTy* N = *I1; |
| 569 | StateTy St = N->getState(); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 570 | RVal V = GetRVal(St, Ex); |
Ted Kremenek | 9ef1ec9 | 2008-02-21 18:43:30 +0000 | [diff] [blame] | 571 | Nodify(Dst, CastE, N, SetRVal(St, CastE, EvalCast(V, CastE->getType()))); |
Ted Kremenek | 874d63f | 2008-01-24 02:02:54 +0000 | [diff] [blame] | 572 | } |
Ted Kremenek | 9de04c4 | 2008-01-24 20:55:43 +0000 | [diff] [blame] | 573 | } |
| 574 | |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 575 | void GRExprEngine::VisitDeclStmt(DeclStmt* DS, GRExprEngine::NodeTy* Pred, |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 576 | GRExprEngine::NodeSet& Dst) { |
Ted Kremenek | 9de04c4 | 2008-01-24 20:55:43 +0000 | [diff] [blame] | 577 | |
| 578 | StateTy St = Pred->getState(); |
| 579 | |
| 580 | for (const ScopedDecl* D = DS->getDecl(); D; D = D->getNextDeclarator()) |
Ted Kremenek | 403c181 | 2008-01-28 22:51:57 +0000 | [diff] [blame] | 581 | if (const VarDecl* VD = dyn_cast<VarDecl>(D)) { |
Ted Kremenek | c2c95b0 | 2008-02-19 00:29:51 +0000 | [diff] [blame] | 582 | |
| 583 | // FIXME: Add support for local arrays. |
| 584 | if (VD->getType()->isArrayType()) |
| 585 | continue; |
| 586 | |
Ted Kremenek | 4dc3522 | 2008-02-26 00:20:52 +0000 | [diff] [blame] | 587 | // FIXME: static variables have an initializer, but the second |
| 588 | // time a function is called those values may not be current. |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 589 | const Expr* Ex = VD->getInit(); |
| 590 | |
| 591 | St = SetRVal(St, lval::DeclVal(VD), |
| 592 | Ex ? GetRVal(St, Ex) : UninitializedVal()); |
Ted Kremenek | 403c181 | 2008-01-28 22:51:57 +0000 | [diff] [blame] | 593 | } |
Ted Kremenek | 9de04c4 | 2008-01-24 20:55:43 +0000 | [diff] [blame] | 594 | |
| 595 | Nodify(Dst, DS, Pred, St); |
| 596 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 597 | if (Dst.empty()) { Dst.Add(Pred); } |
Ted Kremenek | 9de04c4 | 2008-01-24 20:55:43 +0000 | [diff] [blame] | 598 | } |
Ted Kremenek | 874d63f | 2008-01-24 02:02:54 +0000 | [diff] [blame] | 599 | |
Ted Kremenek | f233d48 | 2008-02-05 00:26:40 +0000 | [diff] [blame] | 600 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 601 | void GRExprEngine::VisitGuardedExpr(Expr* Ex, Expr* L, Expr* R, |
Ted Kremenek | f233d48 | 2008-02-05 00:26:40 +0000 | [diff] [blame] | 602 | NodeTy* Pred, NodeSet& Dst) { |
| 603 | |
Ted Kremenek | 05a2378 | 2008-02-26 19:05:15 +0000 | [diff] [blame] | 604 | assert (Ex == CurrentStmt && getCFG().isBlkExpr(Ex)); |
| 605 | |
Ted Kremenek | f233d48 | 2008-02-05 00:26:40 +0000 | [diff] [blame] | 606 | StateTy St = Pred->getState(); |
Ted Kremenek | 05a2378 | 2008-02-26 19:05:15 +0000 | [diff] [blame] | 607 | RVal X = GetBlkExprRVal(St, Ex); |
Ted Kremenek | f233d48 | 2008-02-05 00:26:40 +0000 | [diff] [blame] | 608 | |
Ted Kremenek | 05a2378 | 2008-02-26 19:05:15 +0000 | [diff] [blame] | 609 | assert (X.isUninit()); |
Ted Kremenek | f233d48 | 2008-02-05 00:26:40 +0000 | [diff] [blame] | 610 | |
Ted Kremenek | 05a2378 | 2008-02-26 19:05:15 +0000 | [diff] [blame] | 611 | Expr* SE = (Expr*) cast<UninitializedVal>(X).getData(); |
| 612 | |
| 613 | assert (SE); |
| 614 | |
| 615 | X = GetBlkExprRVal(St, SE); |
Ted Kremenek | 5a7b382 | 2008-02-26 23:37:01 +0000 | [diff] [blame] | 616 | |
| 617 | // Make sure that we invalidate the previous binding. |
| 618 | Nodify(Dst, Ex, Pred, StateMgr.SetRVal(St, Ex, X, true, true)); |
Ted Kremenek | f233d48 | 2008-02-05 00:26:40 +0000 | [diff] [blame] | 619 | } |
| 620 | |
Ted Kremenek | d9435bf | 2008-02-12 19:49:57 +0000 | [diff] [blame] | 621 | /// VisitSizeOfAlignOfTypeExpr - Transfer function for sizeof(type). |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 622 | void GRExprEngine::VisitSizeOfAlignOfTypeExpr(SizeOfAlignOfTypeExpr* Ex, |
| 623 | NodeTy* Pred, |
| 624 | NodeSet& Dst) { |
Ted Kremenek | 9ef1ec9 | 2008-02-21 18:43:30 +0000 | [diff] [blame] | 625 | |
| 626 | assert (Ex->isSizeOf() && "FIXME: AlignOf(Expr) not yet implemented."); |
Ted Kremenek | d9435bf | 2008-02-12 19:49:57 +0000 | [diff] [blame] | 627 | |
| 628 | // 6.5.3.4 sizeof: "The result type is an integer." |
| 629 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 630 | QualType T = Ex->getArgumentType(); |
Ted Kremenek | 9ef1ec9 | 2008-02-21 18:43:30 +0000 | [diff] [blame] | 631 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 632 | |
Ted Kremenek | 297d0d7 | 2008-02-21 18:15:29 +0000 | [diff] [blame] | 633 | // FIXME: Add support for VLAs. |
Eli Friedman | d868856 | 2008-02-15 12:28:27 +0000 | [diff] [blame] | 634 | if (!T.getTypePtr()->isConstantSizeType()) |
Ted Kremenek | d9435bf | 2008-02-12 19:49:57 +0000 | [diff] [blame] | 635 | return; |
| 636 | |
Ted Kremenek | 297d0d7 | 2008-02-21 18:15:29 +0000 | [diff] [blame] | 637 | |
| 638 | uint64_t size = 1; // Handle sizeof(void) |
| 639 | |
| 640 | if (T != getContext().VoidTy) { |
| 641 | SourceLocation Loc = Ex->getExprLoc(); |
| 642 | size = getContext().getTypeSize(T, Loc) / 8; |
| 643 | } |
Ted Kremenek | d9435bf | 2008-02-12 19:49:57 +0000 | [diff] [blame] | 644 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 645 | Nodify(Dst, Ex, Pred, |
| 646 | SetRVal(Pred->getState(), Ex, |
Ted Kremenek | 297d0d7 | 2008-02-21 18:15:29 +0000 | [diff] [blame] | 647 | NonLVal::MakeVal(ValMgr, size, Ex->getType()))); |
Ted Kremenek | d9435bf | 2008-02-12 19:49:57 +0000 | [diff] [blame] | 648 | |
| 649 | } |
| 650 | |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 651 | void GRExprEngine::VisitDeref(UnaryOperator* U, NodeTy* Pred, NodeSet& Dst) { |
| 652 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 653 | Expr* Ex = U->getSubExpr()->IgnoreParens(); |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 654 | |
| 655 | NodeSet DstTmp; |
| 656 | |
Ted Kremenek | 018c15f | 2008-02-26 03:44:25 +0000 | [diff] [blame] | 657 | if (isa<DeclRefExpr>(Ex)) |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 658 | DstTmp.Add(Pred); |
| 659 | else |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 660 | Visit(Ex, Pred, DstTmp); |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 661 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 662 | for (NodeSet::iterator I = DstTmp.begin(), DE = DstTmp.end(); I != DE; ++I) { |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 663 | |
| 664 | NodeTy* N = *I; |
| 665 | StateTy St = N->getState(); |
| 666 | |
| 667 | // FIXME: Bifurcate when dereferencing a symbolic with no constraints? |
| 668 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 669 | RVal V = GetRVal(St, Ex); |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 670 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 671 | // Check for dereferences of uninitialized values. |
| 672 | |
| 673 | if (V.isUninit()) { |
| 674 | |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 675 | NodeTy* Succ = Builder->generateNode(U, St, N); |
| 676 | |
| 677 | if (Succ) { |
| 678 | Succ->markAsSink(); |
| 679 | UninitDeref.insert(Succ); |
| 680 | } |
| 681 | |
| 682 | continue; |
| 683 | } |
| 684 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 685 | // Check for dereferences of unknown values. Treat as No-Ops. |
| 686 | |
| 687 | if (V.isUnknown()) { |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 688 | Dst.Add(N); |
| 689 | continue; |
| 690 | } |
| 691 | |
| 692 | // After a dereference, one of two possible situations arise: |
| 693 | // (1) A crash, because the pointer was NULL. |
| 694 | // (2) The pointer is not NULL, and the dereference works. |
| 695 | // |
| 696 | // We add these assumptions. |
| 697 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 698 | LVal LV = cast<LVal>(V); |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 699 | bool isFeasibleNotNull; |
| 700 | |
| 701 | // "Assume" that the pointer is Not-NULL. |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 702 | |
| 703 | StateTy StNotNull = Assume(St, LV, true, isFeasibleNotNull); |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 704 | |
| 705 | if (isFeasibleNotNull) { |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 706 | |
| 707 | // FIXME: Currently symbolic analysis "generates" new symbols |
| 708 | // for the contents of values. We need a better approach. |
| 709 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 710 | Nodify(Dst, U, N, SetRVal(StNotNull, U, |
| 711 | GetRVal(StNotNull, LV, U->getType()))); |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 712 | } |
| 713 | |
| 714 | bool isFeasibleNull; |
| 715 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 716 | // Now "assume" that the pointer is NULL. |
| 717 | |
| 718 | StateTy StNull = Assume(St, LV, false, isFeasibleNull); |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 719 | |
| 720 | if (isFeasibleNull) { |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 721 | |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 722 | // We don't use "Nodify" here because the node will be a sink |
| 723 | // and we have no intention of processing it later. |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 724 | |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 725 | NodeTy* NullNode = Builder->generateNode(U, StNull, N); |
| 726 | |
| 727 | if (NullNode) { |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 728 | |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 729 | NullNode->markAsSink(); |
| 730 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 731 | if (isFeasibleNotNull) ImplicitNullDeref.insert(NullNode); |
| 732 | else ExplicitNullDeref.insert(NullNode); |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 733 | } |
| 734 | } |
| 735 | } |
| 736 | } |
| 737 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 738 | void GRExprEngine::VisitUnaryOperator(UnaryOperator* U, NodeTy* Pred, |
| 739 | NodeSet& Dst) { |
Ted Kremenek | 3271f8d | 2008-02-07 04:16:04 +0000 | [diff] [blame] | 740 | |
Ted Kremenek | 7b8009a | 2008-01-24 02:28:56 +0000 | [diff] [blame] | 741 | NodeSet S1; |
Ted Kremenek | 3271f8d | 2008-02-07 04:16:04 +0000 | [diff] [blame] | 742 | |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 743 | assert (U->getOpcode() != UnaryOperator::Deref); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 744 | assert (U->getOpcode() != UnaryOperator::SizeOf); |
| 745 | assert (U->getOpcode() != UnaryOperator::AlignOf); |
| 746 | |
| 747 | bool use_GetLVal = false; |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 748 | |
| 749 | switch (U->getOpcode()) { |
| 750 | case UnaryOperator::PostInc: |
| 751 | case UnaryOperator::PostDec: |
| 752 | case UnaryOperator::PreInc: |
| 753 | case UnaryOperator::PreDec: |
| 754 | case UnaryOperator::AddrOf: |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 755 | // Evalue subexpression as an LVal. |
| 756 | use_GetLVal = true; |
| 757 | VisitLVal(U->getSubExpr(), Pred, S1); |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 758 | break; |
| 759 | |
| 760 | default: |
| 761 | Visit(U->getSubExpr(), Pred, S1); |
| 762 | break; |
| 763 | } |
| 764 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 765 | for (NodeSet::iterator I1 = S1.begin(), E1 = S1.end(); I1 != E1; ++I1) { |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 766 | |
Ted Kremenek | 7b8009a | 2008-01-24 02:28:56 +0000 | [diff] [blame] | 767 | NodeTy* N1 = *I1; |
| 768 | StateTy St = N1->getState(); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 769 | |
| 770 | RVal SubV = use_GetLVal ? GetLVal(St, U->getSubExpr()) : |
| 771 | GetRVal(St, U->getSubExpr()); |
| 772 | |
| 773 | if (SubV.isUnknown()) { |
| 774 | Dst.Add(N1); |
| 775 | continue; |
| 776 | } |
| 777 | |
| 778 | if (SubV.isUninit()) { |
| 779 | Nodify(Dst, U, N1, SetRVal(St, U, SubV)); |
| 780 | continue; |
| 781 | } |
Ted Kremenek | 7b8009a | 2008-01-24 02:28:56 +0000 | [diff] [blame] | 782 | |
Ted Kremenek | 50d0ac2 | 2008-02-15 22:09:30 +0000 | [diff] [blame] | 783 | if (U->isIncrementDecrementOp()) { |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 784 | |
| 785 | // Handle ++ and -- (both pre- and post-increment). |
| 786 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 787 | LVal SubLV = cast<LVal>(SubV); |
| 788 | RVal V = GetRVal(St, SubLV, U->getType()); |
| 789 | |
Ted Kremenek | 89063af | 2008-02-21 19:15:37 +0000 | [diff] [blame] | 790 | if (V.isUnknown()) { |
| 791 | Dst.Add(N1); |
| 792 | continue; |
| 793 | } |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 794 | |
| 795 | // Propagate uninitialized values. |
| 796 | if (V.isUninit()) { |
| 797 | Nodify(Dst, U, N1, SetRVal(St, U, V)); |
| 798 | continue; |
| 799 | } |
| 800 | |
Ted Kremenek | 443003b | 2008-02-21 19:29:23 +0000 | [diff] [blame] | 801 | // Handle all other values. |
Ted Kremenek | 50d0ac2 | 2008-02-15 22:09:30 +0000 | [diff] [blame] | 802 | |
| 803 | BinaryOperator::Opcode Op = U->isIncrementOp() ? BinaryOperator::Add |
| 804 | : BinaryOperator::Sub; |
| 805 | |
Ted Kremenek | 443003b | 2008-02-21 19:29:23 +0000 | [diff] [blame] | 806 | RVal Result = EvalBinOp(Op, V, MakeConstantVal(1U, U)); |
Ted Kremenek | 50d0ac2 | 2008-02-15 22:09:30 +0000 | [diff] [blame] | 807 | |
| 808 | if (U->isPostfix()) |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 809 | St = SetRVal(SetRVal(St, U, V), SubLV, Result); |
Ted Kremenek | 50d0ac2 | 2008-02-15 22:09:30 +0000 | [diff] [blame] | 810 | else |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 811 | St = SetRVal(SetRVal(St, U, Result), SubLV, Result); |
Ted Kremenek | 50d0ac2 | 2008-02-15 22:09:30 +0000 | [diff] [blame] | 812 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 813 | Nodify(Dst, U, N1, St); |
Ted Kremenek | 50d0ac2 | 2008-02-15 22:09:30 +0000 | [diff] [blame] | 814 | continue; |
| 815 | } |
| 816 | |
| 817 | // Handle all other unary operators. |
| 818 | |
Ted Kremenek | 7b8009a | 2008-01-24 02:28:56 +0000 | [diff] [blame] | 819 | switch (U->getOpcode()) { |
Ted Kremenek | cf78b6a | 2008-02-06 22:50:25 +0000 | [diff] [blame] | 820 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 821 | case UnaryOperator::Minus: |
| 822 | St = SetRVal(St, U, EvalMinus(U, cast<NonLVal>(SubV))); |
Ted Kremenek | dacbb4f | 2008-01-24 08:20:02 +0000 | [diff] [blame] | 823 | break; |
Ted Kremenek | dacbb4f | 2008-01-24 08:20:02 +0000 | [diff] [blame] | 824 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 825 | case UnaryOperator::Not: |
| 826 | St = SetRVal(St, U, EvalComplement(cast<NonLVal>(SubV))); |
Ted Kremenek | 90e4203 | 2008-02-20 04:12:31 +0000 | [diff] [blame] | 827 | break; |
Ted Kremenek | 90e4203 | 2008-02-20 04:12:31 +0000 | [diff] [blame] | 828 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 829 | case UnaryOperator::LNot: |
Ted Kremenek | c5d3b4c | 2008-02-04 16:58:30 +0000 | [diff] [blame] | 830 | |
Ted Kremenek | c60f0f7 | 2008-02-06 17:56:00 +0000 | [diff] [blame] | 831 | // C99 6.5.3.3: "The expression !E is equivalent to (0==E)." |
| 832 | // |
| 833 | // Note: technically we do "E == 0", but this is the same in the |
| 834 | // transfer functions as "0 == E". |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 835 | |
| 836 | if (isa<LVal>(SubV)) { |
| 837 | lval::ConcreteInt V(ValMgr.getZeroWithPtrWidth()); |
| 838 | RVal Result = EvalBinOp(BinaryOperator::EQ, cast<LVal>(SubV), V); |
| 839 | St = SetRVal(St, U, Result); |
Ted Kremenek | c60f0f7 | 2008-02-06 17:56:00 +0000 | [diff] [blame] | 840 | } |
| 841 | else { |
Ted Kremenek | f7ca696 | 2008-02-22 00:42:36 +0000 | [diff] [blame] | 842 | Expr* Ex = U->getSubExpr(); |
| 843 | nonlval::ConcreteInt V(ValMgr.getValue(0, Ex->getType())); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 844 | RVal Result = EvalBinOp(BinaryOperator::EQ, cast<NonLVal>(SubV), V); |
| 845 | St = SetRVal(St, U, Result); |
Ted Kremenek | c60f0f7 | 2008-02-06 17:56:00 +0000 | [diff] [blame] | 846 | } |
| 847 | |
| 848 | break; |
Ted Kremenek | c60f0f7 | 2008-02-06 17:56:00 +0000 | [diff] [blame] | 849 | |
Ted Kremenek | 6492485 | 2008-01-31 02:35:41 +0000 | [diff] [blame] | 850 | case UnaryOperator::AddrOf: { |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 851 | assert (isa<LVal>(SubV)); |
| 852 | St = SetRVal(St, U, SubV); |
Ted Kremenek | 6492485 | 2008-01-31 02:35:41 +0000 | [diff] [blame] | 853 | break; |
| 854 | } |
Ted Kremenek | d131c4f | 2008-02-07 05:48:01 +0000 | [diff] [blame] | 855 | |
Ted Kremenek | 7b8009a | 2008-01-24 02:28:56 +0000 | [diff] [blame] | 856 | default: ; |
| 857 | assert (false && "Not implemented."); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 858 | } |
| 859 | |
| 860 | Nodify(Dst, U, N1, St); |
Ted Kremenek | 7b8009a | 2008-01-24 02:28:56 +0000 | [diff] [blame] | 861 | } |
| 862 | } |
| 863 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 864 | void GRExprEngine::VisitSizeOfExpr(UnaryOperator* U, NodeTy* Pred, |
| 865 | NodeSet& Dst) { |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 866 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 867 | QualType T = U->getSubExpr()->getType(); |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 868 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 869 | // FIXME: Add support for VLAs. |
| 870 | if (!T.getTypePtr()->isConstantSizeType()) |
| 871 | return; |
| 872 | |
| 873 | SourceLocation Loc = U->getExprLoc(); |
| 874 | uint64_t size = getContext().getTypeSize(T, Loc) / 8; |
| 875 | StateTy St = Pred->getState(); |
| 876 | St = SetRVal(St, U, NonLVal::MakeVal(ValMgr, size, U->getType(), Loc)); |
| 877 | |
| 878 | Nodify(Dst, U, Pred, St); |
| 879 | } |
| 880 | |
| 881 | void GRExprEngine::VisitLVal(Expr* Ex, NodeTy* Pred, NodeSet& Dst) { |
| 882 | |
| 883 | assert (Ex != CurrentStmt && !getCFG().isBlkExpr(Ex)); |
| 884 | |
| 885 | Ex = Ex->IgnoreParens(); |
| 886 | |
Ted Kremenek | d763eb9 | 2008-02-26 02:15:56 +0000 | [diff] [blame] | 887 | if (DeclRefExpr* DR = dyn_cast<DeclRefExpr>(Ex)) { |
| 888 | |
| 889 | if (VarDecl* VD = dyn_cast<VarDecl>(DR->getDecl())) |
| 890 | if (VD->hasGlobalStorage() || isa<ParmVarDecl>(VD)) { |
| 891 | |
| 892 | StateTy StOld = Pred->getState(); |
| 893 | StateTy St = Symbolicate(StOld, VD); |
| 894 | |
| 895 | if (!(St == StOld)) { |
| 896 | Nodify(Dst, Ex, Pred, St); |
| 897 | return; |
| 898 | } |
| 899 | } |
| 900 | |
Ted Kremenek | 3271f8d | 2008-02-07 04:16:04 +0000 | [diff] [blame] | 901 | Dst.Add(Pred); |
Ted Kremenek | 5b6dc2d | 2008-02-07 01:08:27 +0000 | [diff] [blame] | 902 | return; |
Ted Kremenek | 3271f8d | 2008-02-07 04:16:04 +0000 | [diff] [blame] | 903 | } |
Ted Kremenek | 5b6dc2d | 2008-02-07 01:08:27 +0000 | [diff] [blame] | 904 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 905 | if (UnaryOperator* U = dyn_cast<UnaryOperator>(Ex)) { |
Ted Kremenek | 5b6dc2d | 2008-02-07 01:08:27 +0000 | [diff] [blame] | 906 | if (U->getOpcode() == UnaryOperator::Deref) { |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 907 | Ex = U->getSubExpr()->IgnoreParens(); |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 908 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 909 | if (isa<DeclRefExpr>(Ex)) |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 910 | Dst.Add(Pred); |
| 911 | else |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 912 | Visit(Ex, Pred, Dst); |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 913 | |
Ted Kremenek | 5b6dc2d | 2008-02-07 01:08:27 +0000 | [diff] [blame] | 914 | return; |
| 915 | } |
| 916 | } |
| 917 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 918 | Visit(Ex, Pred, Dst); |
Ted Kremenek | 5b6dc2d | 2008-02-07 01:08:27 +0000 | [diff] [blame] | 919 | } |
| 920 | |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 921 | void GRExprEngine::VisitBinaryOperator(BinaryOperator* B, |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 922 | GRExprEngine::NodeTy* Pred, |
| 923 | GRExprEngine::NodeSet& Dst) { |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 924 | NodeSet S1; |
Ted Kremenek | 5b6dc2d | 2008-02-07 01:08:27 +0000 | [diff] [blame] | 925 | |
| 926 | if (B->isAssignmentOp()) |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 927 | VisitLVal(B->getLHS(), Pred, S1); |
Ted Kremenek | 5b6dc2d | 2008-02-07 01:08:27 +0000 | [diff] [blame] | 928 | else |
| 929 | Visit(B->getLHS(), Pred, S1); |
Ted Kremenek | cb448ca | 2008-01-16 00:53:15 +0000 | [diff] [blame] | 930 | |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 931 | for (NodeSet::iterator I1=S1.begin(), E1=S1.end(); I1 != E1; ++I1) { |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 932 | |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 933 | NodeTy* N1 = *I1; |
Ted Kremenek | e00fe3f | 2008-01-17 00:52:48 +0000 | [diff] [blame] | 934 | |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 935 | // 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] | 936 | // In such cases, we want to (initially) treat the LHS as an LVal, |
| 937 | // so we use GetLVal instead of GetRVal so that DeclRefExpr's are |
| 938 | // evaluated to LValDecl's instead of to an NonLVal. |
| 939 | |
| 940 | RVal LeftV = B->isAssignmentOp() ? GetLVal(N1->getState(), B->getLHS()) |
| 941 | : GetRVal(N1->getState(), B->getLHS()); |
Ted Kremenek | cb448ca | 2008-01-16 00:53:15 +0000 | [diff] [blame] | 942 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 943 | // Visit the RHS... |
| 944 | |
| 945 | NodeSet S2; |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 946 | Visit(B->getRHS(), N1, S2); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 947 | |
| 948 | // Process the binary operator. |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 949 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 950 | for (NodeSet::iterator I2 = S2.begin(), E2 = S2.end(); I2 != E2; ++I2) { |
Ted Kremenek | cf78b6a | 2008-02-06 22:50:25 +0000 | [diff] [blame] | 951 | |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 952 | NodeTy* N2 = *I2; |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 953 | StateTy St = N2->getState(); |
Ted Kremenek | 3c8d0c5 | 2008-02-25 18:42:54 +0000 | [diff] [blame] | 954 | Expr* RHS = B->getRHS(); |
| 955 | RVal RightV = GetRVal(St, RHS); |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 956 | |
Ted Kremenek | cf78b6a | 2008-02-06 22:50:25 +0000 | [diff] [blame] | 957 | BinaryOperator::Opcode Op = B->getOpcode(); |
| 958 | |
Ted Kremenek | 3c8d0c5 | 2008-02-25 18:42:54 +0000 | [diff] [blame] | 959 | if ((Op == BinaryOperator::Div || Op == BinaryOperator::Rem) |
| 960 | && RHS->getType()->isIntegerType()) { |
Ted Kremenek | d763eb9 | 2008-02-26 02:15:56 +0000 | [diff] [blame] | 961 | |
| 962 | // Check if the denominator is uninitialized. |
Ted Kremenek | 3c8d0c5 | 2008-02-25 18:42:54 +0000 | [diff] [blame] | 963 | |
Ted Kremenek | 0015541 | 2008-02-26 22:27:51 +0000 | [diff] [blame] | 964 | if (!RightV.isUnknown()) { |
| 965 | |
| 966 | if (RightV.isUninit()) { |
| 967 | NodeTy* DivUninit = Builder->generateNode(B, St, N2); |
| 968 | |
| 969 | if (DivUninit) { |
| 970 | DivUninit->markAsSink(); |
| 971 | BadDivides.insert(DivUninit); |
| 972 | } |
| 973 | |
| 974 | continue; |
| 975 | } |
| 976 | |
| 977 | // Check for divide/remainder-by-zero. |
| 978 | // |
| 979 | // First, "assume" that the denominator is 0 or uninitialized. |
Ted Kremenek | d763eb9 | 2008-02-26 02:15:56 +0000 | [diff] [blame] | 980 | |
Ted Kremenek | 0015541 | 2008-02-26 22:27:51 +0000 | [diff] [blame] | 981 | bool isFeasible = false; |
| 982 | StateTy ZeroSt = Assume(St, RightV, false, isFeasible); |
| 983 | |
| 984 | if (isFeasible) { |
| 985 | NodeTy* DivZeroNode = Builder->generateNode(B, ZeroSt, N2); |
| 986 | |
| 987 | if (DivZeroNode) { |
| 988 | DivZeroNode->markAsSink(); |
| 989 | BadDivides.insert(DivZeroNode); |
| 990 | } |
Ted Kremenek | d763eb9 | 2008-02-26 02:15:56 +0000 | [diff] [blame] | 991 | } |
| 992 | |
Ted Kremenek | 0015541 | 2008-02-26 22:27:51 +0000 | [diff] [blame] | 993 | // Second, "assume" that the denominator cannot be 0. |
Ted Kremenek | d763eb9 | 2008-02-26 02:15:56 +0000 | [diff] [blame] | 994 | |
Ted Kremenek | 0015541 | 2008-02-26 22:27:51 +0000 | [diff] [blame] | 995 | isFeasible = false; |
| 996 | St = Assume(St, RightV, true, isFeasible); |
Ted Kremenek | 07d83aa | 2008-02-25 17:51:31 +0000 | [diff] [blame] | 997 | |
Ted Kremenek | 0015541 | 2008-02-26 22:27:51 +0000 | [diff] [blame] | 998 | if (!isFeasible) |
| 999 | continue; |
Ted Kremenek | 07d83aa | 2008-02-25 17:51:31 +0000 | [diff] [blame] | 1000 | } |
| 1001 | |
Ted Kremenek | 07d83aa | 2008-02-25 17:51:31 +0000 | [diff] [blame] | 1002 | // Fall-through. The logic below processes the divide. |
| 1003 | } |
| 1004 | |
Ted Kremenek | cf78b6a | 2008-02-06 22:50:25 +0000 | [diff] [blame] | 1005 | if (Op <= BinaryOperator::Or) { |
| 1006 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1007 | // Process non-assignements except commas or short-circuited |
| 1008 | // logical expressions (LAnd and LOr). |
| 1009 | |
| 1010 | RVal Result = EvalBinOp(Op, LeftV, RightV); |
| 1011 | |
| 1012 | if (Result.isUnknown()) { |
| 1013 | Dst.Add(N2); |
Ted Kremenek | 5b6dc2d | 2008-02-07 01:08:27 +0000 | [diff] [blame] | 1014 | continue; |
| 1015 | } |
| 1016 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1017 | Nodify(Dst, B, N2, SetRVal(St, B, Result)); |
Ted Kremenek | cf78b6a | 2008-02-06 22:50:25 +0000 | [diff] [blame] | 1018 | continue; |
| 1019 | } |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1020 | |
| 1021 | // Process assignments. |
| 1022 | |
| 1023 | switch (Op) { |
| 1024 | |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 1025 | case BinaryOperator::Assign: { |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1026 | |
| 1027 | // Simple assignments. |
Ted Kremenek | 9dca062 | 2008-02-19 00:22:37 +0000 | [diff] [blame] | 1028 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1029 | if (LeftV.isUninit()) { |
Ted Kremenek | 9dca062 | 2008-02-19 00:22:37 +0000 | [diff] [blame] | 1030 | HandleUninitializedStore(B, N2); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1031 | continue; |
| 1032 | } |
| 1033 | |
| 1034 | if (LeftV.isUnknown()) { |
| 1035 | St = SetRVal(St, B, RightV); |
| 1036 | break; |
| 1037 | } |
Ted Kremenek | 9dca062 | 2008-02-19 00:22:37 +0000 | [diff] [blame] | 1038 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1039 | St = SetRVal(SetRVal(St, B, RightV), cast<LVal>(LeftV), RightV); |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 1040 | break; |
| 1041 | } |
| 1042 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1043 | // Compound assignment operators. |
Ted Kremenek | 687af80 | 2008-01-29 19:43:15 +0000 | [diff] [blame] | 1044 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1045 | default: { |
Ted Kremenek | 9dca062 | 2008-02-19 00:22:37 +0000 | [diff] [blame] | 1046 | |
Ted Kremenek | 0015541 | 2008-02-26 22:27:51 +0000 | [diff] [blame] | 1047 | assert (B->isCompoundAssignmentOp()); |
| 1048 | |
| 1049 | if (Op >= BinaryOperator::AndAssign) |
| 1050 | ((int&) Op) -= (BinaryOperator::AndAssign - BinaryOperator::And); |
| 1051 | else |
| 1052 | ((int&) Op) -= BinaryOperator::MulAssign; |
| 1053 | |
| 1054 | // Check if the LHS is uninitialized. |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1055 | |
| 1056 | if (LeftV.isUninit()) { |
Ted Kremenek | 9dca062 | 2008-02-19 00:22:37 +0000 | [diff] [blame] | 1057 | HandleUninitializedStore(B, N2); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1058 | continue; |
| 1059 | } |
| 1060 | |
| 1061 | if (LeftV.isUnknown()) { |
| 1062 | |
| 1063 | // While we do not know the location to store RightV, |
| 1064 | // the entire expression does evaluate to RightV. |
| 1065 | |
| 1066 | if (RightV.isUnknown()) { |
| 1067 | Dst.Add(N2); |
| 1068 | continue; |
| 1069 | } |
| 1070 | |
| 1071 | St = SetRVal(St, B, RightV); |
Ted Kremenek | 9dca062 | 2008-02-19 00:22:37 +0000 | [diff] [blame] | 1072 | break; |
| 1073 | } |
| 1074 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1075 | // At this pointer we know that the LHS evaluates to an LVal |
| 1076 | // that is neither "Unknown" or "Unintialized." |
| 1077 | |
| 1078 | LVal LeftLV = cast<LVal>(LeftV); |
| 1079 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1080 | // Fetch the value of the LHS (the value of the variable, etc.). |
| 1081 | |
| 1082 | RVal V = GetRVal(N1->getState(), LeftLV, B->getLHS()->getType()); |
| 1083 | |
Ted Kremenek | 0015541 | 2008-02-26 22:27:51 +0000 | [diff] [blame] | 1084 | // Propagate uninitialized value (left-side). We |
| 1085 | // propogate uninitialized values for the RHS below when |
| 1086 | // we also check for divide-by-zero. |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1087 | |
| 1088 | if (V.isUninit()) { |
| 1089 | St = SetRVal(St, B, V); |
| 1090 | break; |
| 1091 | } |
| 1092 | |
| 1093 | // Propagate unknown values. |
| 1094 | |
Ted Kremenek | 89063af | 2008-02-21 19:15:37 +0000 | [diff] [blame] | 1095 | if (V.isUnknown()) { |
| 1096 | Dst.Add(N2); |
| 1097 | continue; |
| 1098 | } |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1099 | |
| 1100 | if (RightV.isUnknown()) { |
| 1101 | St = SetRVal(SetRVal(St, LeftLV, RightV), B, RightV); |
| 1102 | break; |
| 1103 | } |
| 1104 | |
Ted Kremenek | 0015541 | 2008-02-26 22:27:51 +0000 | [diff] [blame] | 1105 | // At this point: |
| 1106 | // |
| 1107 | // The LHS is not Uninit/Unknown. |
| 1108 | // The RHS is not Unknown. |
Ted Kremenek | cf78b6a | 2008-02-06 22:50:25 +0000 | [diff] [blame] | 1109 | |
Ted Kremenek | 9ef1ec9 | 2008-02-21 18:43:30 +0000 | [diff] [blame] | 1110 | // Get the computation type. |
| 1111 | QualType CTy = cast<CompoundAssignOperator>(B)->getComputationType(); |
| 1112 | |
| 1113 | // Perform promotions. |
| 1114 | V = EvalCast(V, CTy); |
Ted Kremenek | 61e090c | 2008-02-21 18:46:24 +0000 | [diff] [blame] | 1115 | RightV = EvalCast(RightV, CTy); |
Ted Kremenek | 9ef1ec9 | 2008-02-21 18:43:30 +0000 | [diff] [blame] | 1116 | |
| 1117 | // Evaluate operands and promote to result type. |
Ted Kremenek | 07d83aa | 2008-02-25 17:51:31 +0000 | [diff] [blame] | 1118 | |
Ted Kremenek | 3c8d0c5 | 2008-02-25 18:42:54 +0000 | [diff] [blame] | 1119 | if ((Op == BinaryOperator::Div || Op == BinaryOperator::Rem) |
| 1120 | && RHS->getType()->isIntegerType()) { |
| 1121 | |
Ted Kremenek | d763eb9 | 2008-02-26 02:15:56 +0000 | [diff] [blame] | 1122 | // Check if the denominator is uninitialized. |
| 1123 | |
| 1124 | if (RightV.isUninit()) { |
| 1125 | NodeTy* DivUninit = Builder->generateNode(B, St, N2); |
| 1126 | |
| 1127 | if (DivUninit) { |
| 1128 | DivUninit->markAsSink(); |
| 1129 | BadDivides.insert(DivUninit); |
| 1130 | } |
| 1131 | |
| 1132 | continue; |
| 1133 | } |
Ted Kremenek | 0015541 | 2008-02-26 22:27:51 +0000 | [diff] [blame] | 1134 | |
Ted Kremenek | 07d83aa | 2008-02-25 17:51:31 +0000 | [diff] [blame] | 1135 | // First, "assume" that the denominator is 0. |
| 1136 | |
| 1137 | bool isFeasible = false; |
| 1138 | StateTy ZeroSt = Assume(St, RightV, false, isFeasible); |
| 1139 | |
| 1140 | if (isFeasible) { |
| 1141 | NodeTy* DivZeroNode = Builder->generateNode(B, ZeroSt, N2); |
| 1142 | |
| 1143 | if (DivZeroNode) { |
| 1144 | DivZeroNode->markAsSink(); |
Ted Kremenek | d763eb9 | 2008-02-26 02:15:56 +0000 | [diff] [blame] | 1145 | BadDivides.insert(DivZeroNode); |
Ted Kremenek | 07d83aa | 2008-02-25 17:51:31 +0000 | [diff] [blame] | 1146 | } |
| 1147 | } |
| 1148 | |
| 1149 | // Second, "assume" that the denominator cannot be 0. |
| 1150 | |
| 1151 | isFeasible = false; |
| 1152 | St = Assume(St, RightV, true, isFeasible); |
| 1153 | |
| 1154 | if (!isFeasible) |
| 1155 | continue; |
| 1156 | |
| 1157 | // Fall-through. The logic below processes the divide. |
| 1158 | } |
Ted Kremenek | 0015541 | 2008-02-26 22:27:51 +0000 | [diff] [blame] | 1159 | else { |
| 1160 | |
| 1161 | // Propagate uninitialized values (right-side). |
| 1162 | |
| 1163 | if (RightV.isUninit()) { |
| 1164 | St = SetRVal(SetRVal(St, B, RightV), LeftLV, RightV); |
| 1165 | break; |
| 1166 | } |
| 1167 | |
| 1168 | } |
Ted Kremenek | 07d83aa | 2008-02-25 17:51:31 +0000 | [diff] [blame] | 1169 | |
Ted Kremenek | 9ef1ec9 | 2008-02-21 18:43:30 +0000 | [diff] [blame] | 1170 | RVal Result = EvalCast(EvalBinOp(Op, V, RightV), B->getType()); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1171 | St = SetRVal(SetRVal(St, B, Result), LeftLV, Result); |
Ted Kremenek | cf78b6a | 2008-02-06 22:50:25 +0000 | [diff] [blame] | 1172 | } |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 1173 | } |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1174 | |
| 1175 | Nodify(Dst, B, N2, St); |
Ted Kremenek | cb448ca | 2008-01-16 00:53:15 +0000 | [diff] [blame] | 1176 | } |
Ted Kremenek | d27f816 | 2008-01-15 23:55:06 +0000 | [diff] [blame] | 1177 | } |
Ted Kremenek | d27f816 | 2008-01-15 23:55:06 +0000 | [diff] [blame] | 1178 | } |
Ted Kremenek | ee98546 | 2008-01-16 18:18:48 +0000 | [diff] [blame] | 1179 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1180 | void GRExprEngine::HandleUninitializedStore(Stmt* S, NodeTy* Pred) { |
Ted Kremenek | 9dca062 | 2008-02-19 00:22:37 +0000 | [diff] [blame] | 1181 | NodeTy* N = Builder->generateNode(S, Pred->getState(), Pred); |
| 1182 | N->markAsSink(); |
| 1183 | UninitStores.insert(N); |
| 1184 | } |
Ted Kremenek | 1ccd31c | 2008-01-16 19:42:59 +0000 | [diff] [blame] | 1185 | |
Ted Kremenek | 9dca062 | 2008-02-19 00:22:37 +0000 | [diff] [blame] | 1186 | void GRExprEngine::Visit(Stmt* S, NodeTy* Pred, NodeSet& Dst) { |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 1187 | |
| 1188 | // FIXME: add metadata to the CFG so that we can disable |
| 1189 | // this check when we KNOW that there is no block-level subexpression. |
| 1190 | // The motivation is that this check requires a hashtable lookup. |
| 1191 | |
| 1192 | if (S != CurrentStmt && getCFG().isBlkExpr(S)) { |
| 1193 | Dst.Add(Pred); |
| 1194 | return; |
| 1195 | } |
| 1196 | |
| 1197 | switch (S->getStmtClass()) { |
Ted Kremenek | 230aaab | 2008-02-12 21:37:25 +0000 | [diff] [blame] | 1198 | |
| 1199 | default: |
| 1200 | // Cases we intentionally have "default" handle: |
Ted Kremenek | 189c305 | 2008-02-26 19:17:09 +0000 | [diff] [blame] | 1201 | // AddrLabelExpr, IntegerLiteral, CharacterLiteral |
Ted Kremenek | 230aaab | 2008-02-12 21:37:25 +0000 | [diff] [blame] | 1202 | |
| 1203 | Dst.Add(Pred); // No-op. Simply propagate the current state unchanged. |
| 1204 | break; |
| 1205 | |
Ted Kremenek | d70b62e | 2008-02-08 20:29:23 +0000 | [diff] [blame] | 1206 | case Stmt::BinaryOperatorClass: { |
| 1207 | BinaryOperator* B = cast<BinaryOperator>(S); |
Ted Kremenek | f233d48 | 2008-02-05 00:26:40 +0000 | [diff] [blame] | 1208 | |
Ted Kremenek | d70b62e | 2008-02-08 20:29:23 +0000 | [diff] [blame] | 1209 | if (B->isLogicalOp()) { |
| 1210 | VisitLogicalExpr(B, Pred, Dst); |
Ted Kremenek | f233d48 | 2008-02-05 00:26:40 +0000 | [diff] [blame] | 1211 | break; |
| 1212 | } |
Ted Kremenek | d70b62e | 2008-02-08 20:29:23 +0000 | [diff] [blame] | 1213 | else if (B->getOpcode() == BinaryOperator::Comma) { |
Ted Kremenek | da9bd09 | 2008-02-08 07:05:39 +0000 | [diff] [blame] | 1214 | StateTy St = Pred->getState(); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1215 | Nodify(Dst, B, Pred, SetRVal(St, B, GetRVal(St, B->getRHS()))); |
Ted Kremenek | da9bd09 | 2008-02-08 07:05:39 +0000 | [diff] [blame] | 1216 | break; |
| 1217 | } |
Ted Kremenek | d9435bf | 2008-02-12 19:49:57 +0000 | [diff] [blame] | 1218 | |
| 1219 | VisitBinaryOperator(cast<BinaryOperator>(S), Pred, Dst); |
| 1220 | break; |
| 1221 | } |
Ted Kremenek | de43424 | 2008-02-19 01:44:53 +0000 | [diff] [blame] | 1222 | |
| 1223 | case Stmt::CallExprClass: { |
| 1224 | CallExpr* C = cast<CallExpr>(S); |
| 1225 | VisitCall(C, Pred, C->arg_begin(), C->arg_end(), Dst); |
| 1226 | break; |
| 1227 | } |
Ted Kremenek | d9435bf | 2008-02-12 19:49:57 +0000 | [diff] [blame] | 1228 | |
| 1229 | case Stmt::CastExprClass: { |
| 1230 | CastExpr* C = cast<CastExpr>(S); |
| 1231 | VisitCast(C, C->getSubExpr(), Pred, Dst); |
| 1232 | break; |
Ted Kremenek | d70b62e | 2008-02-08 20:29:23 +0000 | [diff] [blame] | 1233 | } |
Ted Kremenek | 189c305 | 2008-02-26 19:17:09 +0000 | [diff] [blame] | 1234 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1235 | // FIXME: ChooseExpr is really a constant. We need to fix |
| 1236 | // the CFG do not model them as explicit control-flow. |
| 1237 | |
Ted Kremenek | d9435bf | 2008-02-12 19:49:57 +0000 | [diff] [blame] | 1238 | case Stmt::ChooseExprClass: { // __builtin_choose_expr |
| 1239 | ChooseExpr* C = cast<ChooseExpr>(S); |
| 1240 | VisitGuardedExpr(C, C->getLHS(), C->getRHS(), Pred, Dst); |
| 1241 | break; |
| 1242 | } |
Ted Kremenek | f233d48 | 2008-02-05 00:26:40 +0000 | [diff] [blame] | 1243 | |
Ted Kremenek | b4ae33f | 2008-01-23 23:38:00 +0000 | [diff] [blame] | 1244 | case Stmt::CompoundAssignOperatorClass: |
Ted Kremenek | ab2b8c5 | 2008-01-23 19:59:44 +0000 | [diff] [blame] | 1245 | VisitBinaryOperator(cast<BinaryOperator>(S), Pred, Dst); |
| 1246 | break; |
| 1247 | |
Ted Kremenek | d9435bf | 2008-02-12 19:49:57 +0000 | [diff] [blame] | 1248 | case Stmt::ConditionalOperatorClass: { // '?' operator |
| 1249 | ConditionalOperator* C = cast<ConditionalOperator>(S); |
| 1250 | VisitGuardedExpr(C, C->getLHS(), C->getRHS(), Pred, Dst); |
| 1251 | break; |
| 1252 | } |
| 1253 | |
| 1254 | case Stmt::DeclRefExprClass: |
| 1255 | VisitDeclRefExpr(cast<DeclRefExpr>(S), Pred, Dst); |
| 1256 | break; |
| 1257 | |
| 1258 | case Stmt::DeclStmtClass: |
| 1259 | VisitDeclStmt(cast<DeclStmt>(S), Pred, Dst); |
| 1260 | break; |
| 1261 | |
| 1262 | case Stmt::ImplicitCastExprClass: { |
| 1263 | ImplicitCastExpr* C = cast<ImplicitCastExpr>(S); |
| 1264 | VisitCast(C, C->getSubExpr(), Pred, Dst); |
| 1265 | break; |
| 1266 | } |
| 1267 | |
| 1268 | case Stmt::ParenExprClass: |
| 1269 | Visit(cast<ParenExpr>(S)->getSubExpr(), Pred, Dst); |
| 1270 | break; |
| 1271 | |
| 1272 | case Stmt::SizeOfAlignOfTypeExprClass: |
| 1273 | VisitSizeOfAlignOfTypeExpr(cast<SizeOfAlignOfTypeExpr>(S), Pred, Dst); |
| 1274 | break; |
| 1275 | |
Ted Kremenek | da9bd09 | 2008-02-08 07:05:39 +0000 | [diff] [blame] | 1276 | case Stmt::StmtExprClass: { |
Ted Kremenek | d70b62e | 2008-02-08 20:29:23 +0000 | [diff] [blame] | 1277 | StmtExpr* SE = cast<StmtExpr>(S); |
| 1278 | |
Ted Kremenek | da9bd09 | 2008-02-08 07:05:39 +0000 | [diff] [blame] | 1279 | StateTy St = Pred->getState(); |
Ted Kremenek | d70b62e | 2008-02-08 20:29:23 +0000 | [diff] [blame] | 1280 | Expr* LastExpr = cast<Expr>(*SE->getSubStmt()->body_rbegin()); |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1281 | Nodify(Dst, SE, Pred, SetRVal(St, SE, GetRVal(St, LastExpr))); |
Ted Kremenek | da9bd09 | 2008-02-08 07:05:39 +0000 | [diff] [blame] | 1282 | break; |
| 1283 | } |
| 1284 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1285 | // FIXME: We may wish to always bind state to ReturnStmts so |
| 1286 | // that users can quickly query what was the state at the |
| 1287 | // exit points of a function. |
| 1288 | |
Ted Kremenek | d9435bf | 2008-02-12 19:49:57 +0000 | [diff] [blame] | 1289 | case Stmt::ReturnStmtClass: { |
Ted Kremenek | 5b6dc2d | 2008-02-07 01:08:27 +0000 | [diff] [blame] | 1290 | if (Expr* R = cast<ReturnStmt>(S)->getRetValue()) |
| 1291 | Visit(R, Pred, Dst); |
| 1292 | else |
| 1293 | Dst.Add(Pred); |
| 1294 | |
| 1295 | break; |
Ted Kremenek | d9435bf | 2008-02-12 19:49:57 +0000 | [diff] [blame] | 1296 | } |
Ted Kremenek | 5b6dc2d | 2008-02-07 01:08:27 +0000 | [diff] [blame] | 1297 | |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1298 | case Stmt::UnaryOperatorClass: { |
| 1299 | UnaryOperator* U = cast<UnaryOperator>(S); |
| 1300 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1301 | switch (U->getOpcode()) { |
| 1302 | case UnaryOperator::Deref: VisitDeref(U, Pred, Dst); break; |
| 1303 | case UnaryOperator::Plus: Visit(U->getSubExpr(), Pred, Dst); break; |
| 1304 | case UnaryOperator::SizeOf: VisitSizeOfExpr(U, Pred, Dst); break; |
| 1305 | default: VisitUnaryOperator(U, Pred, Dst); break; |
| 1306 | } |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1307 | |
Ted Kremenek | 9de04c4 | 2008-01-24 20:55:43 +0000 | [diff] [blame] | 1308 | break; |
Ted Kremenek | d8e9f0d | 2008-02-20 04:02:35 +0000 | [diff] [blame] | 1309 | } |
Ted Kremenek | 79649df | 2008-01-17 18:25:22 +0000 | [diff] [blame] | 1310 | } |
Ted Kremenek | 1ccd31c | 2008-01-16 19:42:59 +0000 | [diff] [blame] | 1311 | } |
| 1312 | |
Ted Kremenek | ee98546 | 2008-01-16 18:18:48 +0000 | [diff] [blame] | 1313 | //===----------------------------------------------------------------------===// |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 1314 | // "Assume" logic. |
| 1315 | //===----------------------------------------------------------------------===// |
| 1316 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1317 | GRExprEngine::StateTy GRExprEngine::Assume(StateTy St, LVal Cond, |
Ted Kremenek | 692416c | 2008-02-18 22:57:02 +0000 | [diff] [blame] | 1318 | bool Assumption, |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1319 | bool& isFeasible) { |
Ted Kremenek | a6e4d21 | 2008-02-01 06:36:40 +0000 | [diff] [blame] | 1320 | switch (Cond.getSubKind()) { |
| 1321 | default: |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1322 | assert (false && "'Assume' not implemented for this LVal."); |
Ted Kremenek | a6e4d21 | 2008-02-01 06:36:40 +0000 | [diff] [blame] | 1323 | return St; |
| 1324 | |
Ted Kremenek | 862d5bb | 2008-02-06 00:54:14 +0000 | [diff] [blame] | 1325 | case lval::SymbolValKind: |
| 1326 | if (Assumption) |
| 1327 | return AssumeSymNE(St, cast<lval::SymbolVal>(Cond).getSymbol(), |
| 1328 | ValMgr.getZeroWithPtrWidth(), isFeasible); |
| 1329 | else |
| 1330 | return AssumeSymEQ(St, cast<lval::SymbolVal>(Cond).getSymbol(), |
| 1331 | ValMgr.getZeroWithPtrWidth(), isFeasible); |
| 1332 | |
Ted Kremenek | 08b6625 | 2008-02-06 04:31:33 +0000 | [diff] [blame] | 1333 | |
Ted Kremenek | 329f854 | 2008-02-05 21:52:21 +0000 | [diff] [blame] | 1334 | case lval::DeclValKind: |
Ted Kremenek | dc3936b | 2008-02-22 00:54:56 +0000 | [diff] [blame] | 1335 | case lval::FuncValKind: |
| 1336 | case lval::GotoLabelKind: |
Ted Kremenek | a6e4d21 | 2008-02-01 06:36:40 +0000 | [diff] [blame] | 1337 | isFeasible = Assumption; |
| 1338 | return St; |
Ted Kremenek | 862d5bb | 2008-02-06 00:54:14 +0000 | [diff] [blame] | 1339 | |
Ted Kremenek | 329f854 | 2008-02-05 21:52:21 +0000 | [diff] [blame] | 1340 | case lval::ConcreteIntKind: { |
| 1341 | bool b = cast<lval::ConcreteInt>(Cond).getValue() != 0; |
Ted Kremenek | a6e4d21 | 2008-02-01 06:36:40 +0000 | [diff] [blame] | 1342 | isFeasible = b ? Assumption : !Assumption; |
| 1343 | return St; |
| 1344 | } |
| 1345 | } |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 1346 | } |
| 1347 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1348 | GRExprEngine::StateTy GRExprEngine::Assume(StateTy St, NonLVal Cond, |
Ted Kremenek | 862d5bb | 2008-02-06 00:54:14 +0000 | [diff] [blame] | 1349 | bool Assumption, |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1350 | bool& isFeasible) { |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 1351 | switch (Cond.getSubKind()) { |
| 1352 | default: |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1353 | assert (false && "'Assume' not implemented for this NonLVal."); |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 1354 | return St; |
| 1355 | |
Ted Kremenek | feb01f6 | 2008-02-06 17:32:17 +0000 | [diff] [blame] | 1356 | |
| 1357 | case nonlval::SymbolValKind: { |
Ted Kremenek | 230aaab | 2008-02-12 21:37:25 +0000 | [diff] [blame] | 1358 | nonlval::SymbolVal& SV = cast<nonlval::SymbolVal>(Cond); |
Ted Kremenek | feb01f6 | 2008-02-06 17:32:17 +0000 | [diff] [blame] | 1359 | SymbolID sym = SV.getSymbol(); |
| 1360 | |
| 1361 | if (Assumption) |
| 1362 | return AssumeSymNE(St, sym, ValMgr.getValue(0, SymMgr.getType(sym)), |
| 1363 | isFeasible); |
| 1364 | else |
| 1365 | return AssumeSymEQ(St, sym, ValMgr.getValue(0, SymMgr.getType(sym)), |
| 1366 | isFeasible); |
| 1367 | } |
| 1368 | |
Ted Kremenek | 08b6625 | 2008-02-06 04:31:33 +0000 | [diff] [blame] | 1369 | case nonlval::SymIntConstraintValKind: |
| 1370 | return |
| 1371 | AssumeSymInt(St, Assumption, |
| 1372 | cast<nonlval::SymIntConstraintVal>(Cond).getConstraint(), |
| 1373 | isFeasible); |
| 1374 | |
Ted Kremenek | 329f854 | 2008-02-05 21:52:21 +0000 | [diff] [blame] | 1375 | case nonlval::ConcreteIntKind: { |
| 1376 | bool b = cast<nonlval::ConcreteInt>(Cond).getValue() != 0; |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 1377 | isFeasible = b ? Assumption : !Assumption; |
| 1378 | return St; |
| 1379 | } |
| 1380 | } |
| 1381 | } |
| 1382 | |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 1383 | GRExprEngine::StateTy |
| 1384 | GRExprEngine::AssumeSymNE(StateTy St, SymbolID sym, |
Ted Kremenek | 862d5bb | 2008-02-06 00:54:14 +0000 | [diff] [blame] | 1385 | const llvm::APSInt& V, bool& isFeasible) { |
Ted Kremenek | 692416c | 2008-02-18 22:57:02 +0000 | [diff] [blame] | 1386 | |
Ted Kremenek | 862d5bb | 2008-02-06 00:54:14 +0000 | [diff] [blame] | 1387 | // First, determine if sym == X, where X != V. |
| 1388 | if (const llvm::APSInt* X = St.getSymVal(sym)) { |
| 1389 | isFeasible = *X != V; |
| 1390 | return St; |
| 1391 | } |
| 1392 | |
| 1393 | // Second, determine if sym != V. |
| 1394 | if (St.isNotEqual(sym, V)) { |
| 1395 | isFeasible = true; |
| 1396 | return St; |
| 1397 | } |
| 1398 | |
| 1399 | // If we reach here, sym is not a constant and we don't know if it is != V. |
| 1400 | // Make that assumption. |
| 1401 | |
| 1402 | isFeasible = true; |
| 1403 | return StateMgr.AddNE(St, sym, V); |
| 1404 | } |
| 1405 | |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 1406 | GRExprEngine::StateTy |
| 1407 | GRExprEngine::AssumeSymEQ(StateTy St, SymbolID sym, |
Ted Kremenek | 862d5bb | 2008-02-06 00:54:14 +0000 | [diff] [blame] | 1408 | const llvm::APSInt& V, bool& isFeasible) { |
| 1409 | |
| 1410 | // First, determine if sym == X, where X != V. |
| 1411 | if (const llvm::APSInt* X = St.getSymVal(sym)) { |
| 1412 | isFeasible = *X == V; |
| 1413 | return St; |
| 1414 | } |
| 1415 | |
| 1416 | // Second, determine if sym != V. |
| 1417 | if (St.isNotEqual(sym, V)) { |
| 1418 | isFeasible = false; |
| 1419 | return St; |
| 1420 | } |
| 1421 | |
| 1422 | // If we reach here, sym is not a constant and we don't know if it is == V. |
| 1423 | // Make that assumption. |
| 1424 | |
| 1425 | isFeasible = true; |
| 1426 | return StateMgr.AddEQ(St, sym, V); |
| 1427 | } |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 1428 | |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 1429 | GRExprEngine::StateTy |
| 1430 | GRExprEngine::AssumeSymInt(StateTy St, bool Assumption, |
Ted Kremenek | 08b6625 | 2008-02-06 04:31:33 +0000 | [diff] [blame] | 1431 | const SymIntConstraint& C, bool& isFeasible) { |
| 1432 | |
| 1433 | switch (C.getOpcode()) { |
| 1434 | default: |
| 1435 | // No logic yet for other operators. |
| 1436 | return St; |
| 1437 | |
| 1438 | case BinaryOperator::EQ: |
| 1439 | if (Assumption) |
| 1440 | return AssumeSymEQ(St, C.getSymbol(), C.getInt(), isFeasible); |
| 1441 | else |
| 1442 | return AssumeSymNE(St, C.getSymbol(), C.getInt(), isFeasible); |
| 1443 | |
| 1444 | case BinaryOperator::NE: |
| 1445 | if (Assumption) |
| 1446 | return AssumeSymNE(St, C.getSymbol(), C.getInt(), isFeasible); |
| 1447 | else |
| 1448 | return AssumeSymEQ(St, C.getSymbol(), C.getInt(), isFeasible); |
| 1449 | } |
| 1450 | } |
| 1451 | |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 1452 | //===----------------------------------------------------------------------===// |
Ted Kremenek | e01c987 | 2008-02-14 22:36:46 +0000 | [diff] [blame] | 1453 | // Visualization. |
Ted Kremenek | ee98546 | 2008-01-16 18:18:48 +0000 | [diff] [blame] | 1454 | //===----------------------------------------------------------------------===// |
| 1455 | |
Ted Kremenek | aa66a32 | 2008-01-16 21:46:15 +0000 | [diff] [blame] | 1456 | #ifndef NDEBUG |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 1457 | static GRExprEngine* GraphPrintCheckerState; |
Ted Kremenek | 3b4f670 | 2008-01-30 23:24:39 +0000 | [diff] [blame] | 1458 | |
Ted Kremenek | aa66a32 | 2008-01-16 21:46:15 +0000 | [diff] [blame] | 1459 | namespace llvm { |
| 1460 | template<> |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 1461 | struct VISIBILITY_HIDDEN DOTGraphTraits<GRExprEngine::NodeTy*> : |
Ted Kremenek | aa66a32 | 2008-01-16 21:46:15 +0000 | [diff] [blame] | 1462 | public DefaultDOTGraphTraits { |
Ted Kremenek | 016f52f | 2008-02-08 21:10:02 +0000 | [diff] [blame] | 1463 | |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 1464 | static void PrintVarBindings(std::ostream& Out, GRExprEngine::StateTy St) { |
Ted Kremenek | 016f52f | 2008-02-08 21:10:02 +0000 | [diff] [blame] | 1465 | |
| 1466 | Out << "Variables:\\l"; |
| 1467 | |
Ted Kremenek | 9ff731d | 2008-01-24 22:27:20 +0000 | [diff] [blame] | 1468 | bool isFirst = true; |
| 1469 | |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 1470 | for (GRExprEngine::StateTy::vb_iterator I=St.vb_begin(), |
Ted Kremenek | 016f52f | 2008-02-08 21:10:02 +0000 | [diff] [blame] | 1471 | E=St.vb_end(); I!=E;++I) { |
| 1472 | |
| 1473 | if (isFirst) |
| 1474 | isFirst = false; |
| 1475 | else |
| 1476 | Out << "\\l"; |
| 1477 | |
| 1478 | Out << ' ' << I.getKey()->getName() << " : "; |
| 1479 | I.getData().print(Out); |
| 1480 | } |
| 1481 | |
| 1482 | } |
| 1483 | |
Ted Kremenek | e7d2211 | 2008-02-11 19:21:59 +0000 | [diff] [blame] | 1484 | |
Ted Kremenek | 44842c2 | 2008-02-13 18:06:44 +0000 | [diff] [blame] | 1485 | static void PrintSubExprBindings(std::ostream& Out, GRExprEngine::StateTy St){ |
Ted Kremenek | e7d2211 | 2008-02-11 19:21:59 +0000 | [diff] [blame] | 1486 | |
| 1487 | bool isFirst = true; |
| 1488 | |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 1489 | for (GRExprEngine::StateTy::seb_iterator I=St.seb_begin(), E=St.seb_end(); |
Ted Kremenek | e7d2211 | 2008-02-11 19:21:59 +0000 | [diff] [blame] | 1490 | I != E;++I) { |
| 1491 | |
| 1492 | if (isFirst) { |
| 1493 | Out << "\\l\\lSub-Expressions:\\l"; |
| 1494 | isFirst = false; |
| 1495 | } |
| 1496 | else |
| 1497 | Out << "\\l"; |
| 1498 | |
| 1499 | Out << " (" << (void*) I.getKey() << ") "; |
| 1500 | I.getKey()->printPretty(Out); |
| 1501 | Out << " : "; |
| 1502 | I.getData().print(Out); |
| 1503 | } |
| 1504 | } |
| 1505 | |
Ted Kremenek | 44842c2 | 2008-02-13 18:06:44 +0000 | [diff] [blame] | 1506 | static void PrintBlkExprBindings(std::ostream& Out, GRExprEngine::StateTy St){ |
Ted Kremenek | e7d2211 | 2008-02-11 19:21:59 +0000 | [diff] [blame] | 1507 | |
Ted Kremenek | 016f52f | 2008-02-08 21:10:02 +0000 | [diff] [blame] | 1508 | bool isFirst = true; |
| 1509 | |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 1510 | for (GRExprEngine::StateTy::beb_iterator I=St.beb_begin(), E=St.beb_end(); |
Ted Kremenek | e7d2211 | 2008-02-11 19:21:59 +0000 | [diff] [blame] | 1511 | I != E; ++I) { |
Ted Kremenek | 9ff731d | 2008-01-24 22:27:20 +0000 | [diff] [blame] | 1512 | if (isFirst) { |
Ted Kremenek | e7d2211 | 2008-02-11 19:21:59 +0000 | [diff] [blame] | 1513 | Out << "\\l\\lBlock-level Expressions:\\l"; |
Ted Kremenek | 9ff731d | 2008-01-24 22:27:20 +0000 | [diff] [blame] | 1514 | isFirst = false; |
| 1515 | } |
| 1516 | else |
| 1517 | Out << "\\l"; |
Ted Kremenek | 016f52f | 2008-02-08 21:10:02 +0000 | [diff] [blame] | 1518 | |
Ted Kremenek | e7d2211 | 2008-02-11 19:21:59 +0000 | [diff] [blame] | 1519 | Out << " (" << (void*) I.getKey() << ") "; |
| 1520 | I.getKey()->printPretty(Out); |
Ted Kremenek | 9ff731d | 2008-01-24 22:27:20 +0000 | [diff] [blame] | 1521 | Out << " : "; |
| 1522 | I.getData().print(Out); |
| 1523 | } |
| 1524 | } |
| 1525 | |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 1526 | static void PrintEQ(std::ostream& Out, GRExprEngine::StateTy St) { |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1527 | ValueState::ConstEqTy CE = St.getImpl()->ConstEq; |
Ted Kremenek | ed4de31 | 2008-02-06 03:56:15 +0000 | [diff] [blame] | 1528 | |
| 1529 | if (CE.isEmpty()) |
| 1530 | return; |
| 1531 | |
| 1532 | Out << "\\l\\|'==' constraints:"; |
| 1533 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1534 | 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] | 1535 | Out << "\\l $" << I.getKey() << " : " << I.getData()->toString(); |
| 1536 | } |
| 1537 | |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 1538 | static void PrintNE(std::ostream& Out, GRExprEngine::StateTy St) { |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1539 | ValueState::ConstNotEqTy NE = St.getImpl()->ConstNotEq; |
Ted Kremenek | ed4de31 | 2008-02-06 03:56:15 +0000 | [diff] [blame] | 1540 | |
| 1541 | if (NE.isEmpty()) |
| 1542 | return; |
| 1543 | |
| 1544 | Out << "\\l\\|'!=' constraints:"; |
| 1545 | |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1546 | for (ValueState::ConstNotEqTy::iterator I=NE.begin(), EI=NE.end(); |
Ted Kremenek | ed4de31 | 2008-02-06 03:56:15 +0000 | [diff] [blame] | 1547 | I != EI; ++I){ |
| 1548 | |
| 1549 | Out << "\\l $" << I.getKey() << " : "; |
| 1550 | bool isFirst = true; |
| 1551 | |
| 1552 | ValueState::IntSetTy::iterator J=I.getData().begin(), |
| 1553 | EJ=I.getData().end(); |
| 1554 | for ( ; J != EJ; ++J) { |
| 1555 | if (isFirst) isFirst = false; |
| 1556 | else Out << ", "; |
| 1557 | |
| 1558 | Out << (*J)->toString(); |
| 1559 | } |
| 1560 | } |
Ted Kremenek | a3fadfc | 2008-02-14 22:54:53 +0000 | [diff] [blame] | 1561 | } |
| 1562 | |
| 1563 | static std::string getNodeAttributes(const GRExprEngine::NodeTy* N, void*) { |
| 1564 | |
| 1565 | if (GraphPrintCheckerState->isImplicitNullDeref(N) || |
Ted Kremenek | 9dca062 | 2008-02-19 00:22:37 +0000 | [diff] [blame] | 1566 | GraphPrintCheckerState->isExplicitNullDeref(N) || |
Ted Kremenek | b533912 | 2008-02-19 20:53:06 +0000 | [diff] [blame] | 1567 | GraphPrintCheckerState->isUninitDeref(N) || |
Ted Kremenek | 9dca062 | 2008-02-19 00:22:37 +0000 | [diff] [blame] | 1568 | GraphPrintCheckerState->isUninitStore(N) || |
Ted Kremenek | d87a321 | 2008-02-26 21:31:18 +0000 | [diff] [blame] | 1569 | GraphPrintCheckerState->isUninitControlFlow(N) || |
| 1570 | GraphPrintCheckerState->isBadDivide(N)) |
Ted Kremenek | a3fadfc | 2008-02-14 22:54:53 +0000 | [diff] [blame] | 1571 | return "color=\"red\",style=\"filled\""; |
| 1572 | |
| 1573 | return ""; |
| 1574 | } |
Ted Kremenek | ed4de31 | 2008-02-06 03:56:15 +0000 | [diff] [blame] | 1575 | |
Ted Kremenek | 4d4dd85 | 2008-02-13 17:41:41 +0000 | [diff] [blame] | 1576 | static std::string getNodeLabel(const GRExprEngine::NodeTy* N, void*) { |
Ted Kremenek | aa66a32 | 2008-01-16 21:46:15 +0000 | [diff] [blame] | 1577 | std::ostringstream Out; |
Ted Kremenek | 803c9ed | 2008-01-23 22:30:44 +0000 | [diff] [blame] | 1578 | |
| 1579 | // Program Location. |
Ted Kremenek | aa66a32 | 2008-01-16 21:46:15 +0000 | [diff] [blame] | 1580 | ProgramPoint Loc = N->getLocation(); |
| 1581 | |
| 1582 | switch (Loc.getKind()) { |
| 1583 | case ProgramPoint::BlockEntranceKind: |
| 1584 | Out << "Block Entrance: B" |
| 1585 | << cast<BlockEntrance>(Loc).getBlock()->getBlockID(); |
| 1586 | break; |
| 1587 | |
| 1588 | case ProgramPoint::BlockExitKind: |
| 1589 | assert (false); |
| 1590 | break; |
| 1591 | |
| 1592 | case ProgramPoint::PostStmtKind: { |
| 1593 | const PostStmt& L = cast<PostStmt>(Loc); |
Ted Kremenek | 9ff731d | 2008-01-24 22:27:20 +0000 | [diff] [blame] | 1594 | Out << L.getStmt()->getStmtClassName() << ':' |
| 1595 | << (void*) L.getStmt() << ' '; |
| 1596 | |
Ted Kremenek | aa66a32 | 2008-01-16 21:46:15 +0000 | [diff] [blame] | 1597 | L.getStmt()->printPretty(Out); |
Ted Kremenek | d131c4f | 2008-02-07 05:48:01 +0000 | [diff] [blame] | 1598 | |
| 1599 | if (GraphPrintCheckerState->isImplicitNullDeref(N)) { |
| 1600 | Out << "\\|Implicit-Null Dereference.\\l"; |
| 1601 | } |
Ted Kremenek | 63a4f69 | 2008-02-07 06:04:18 +0000 | [diff] [blame] | 1602 | else if (GraphPrintCheckerState->isExplicitNullDeref(N)) { |
| 1603 | Out << "\\|Explicit-Null Dereference.\\l"; |
| 1604 | } |
Ted Kremenek | b533912 | 2008-02-19 20:53:06 +0000 | [diff] [blame] | 1605 | else if (GraphPrintCheckerState->isUninitDeref(N)) { |
| 1606 | Out << "\\|Dereference of uninitialied value.\\l"; |
| 1607 | } |
Ted Kremenek | 9dca062 | 2008-02-19 00:22:37 +0000 | [diff] [blame] | 1608 | else if (GraphPrintCheckerState->isUninitStore(N)) { |
Ted Kremenek | aa1c4e5 | 2008-02-21 18:02:17 +0000 | [diff] [blame] | 1609 | Out << "\\|Store to Uninitialized LVal."; |
Ted Kremenek | 9dca062 | 2008-02-19 00:22:37 +0000 | [diff] [blame] | 1610 | } |
Ted Kremenek | d87a321 | 2008-02-26 21:31:18 +0000 | [diff] [blame] | 1611 | else if (GraphPrintCheckerState->isBadDivide(N)) { |
| 1612 | Out << "\\|Divide-by zero or uninitialized value."; |
| 1613 | } |
Ted Kremenek | d131c4f | 2008-02-07 05:48:01 +0000 | [diff] [blame] | 1614 | |
Ted Kremenek | aa66a32 | 2008-01-16 21:46:15 +0000 | [diff] [blame] | 1615 | break; |
| 1616 | } |
| 1617 | |
| 1618 | default: { |
| 1619 | const BlockEdge& E = cast<BlockEdge>(Loc); |
| 1620 | Out << "Edge: (B" << E.getSrc()->getBlockID() << ", B" |
| 1621 | << E.getDst()->getBlockID() << ')'; |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 1622 | |
| 1623 | if (Stmt* T = E.getSrc()->getTerminator()) { |
| 1624 | Out << "\\|Terminator: "; |
| 1625 | E.getSrc()->printTerminator(Out); |
| 1626 | |
Ted Kremenek | daeb9a7 | 2008-02-13 23:08:21 +0000 | [diff] [blame] | 1627 | if (isa<SwitchStmt>(T)) { |
| 1628 | Stmt* Label = E.getDst()->getLabel(); |
| 1629 | |
| 1630 | if (Label) { |
| 1631 | if (CaseStmt* C = dyn_cast<CaseStmt>(Label)) { |
| 1632 | Out << "\\lcase "; |
| 1633 | C->getLHS()->printPretty(Out); |
| 1634 | |
| 1635 | if (Stmt* RHS = C->getRHS()) { |
| 1636 | Out << " .. "; |
| 1637 | RHS->printPretty(Out); |
| 1638 | } |
| 1639 | |
| 1640 | Out << ":"; |
| 1641 | } |
| 1642 | else { |
| 1643 | assert (isa<DefaultStmt>(Label)); |
| 1644 | Out << "\\ldefault:"; |
| 1645 | } |
| 1646 | } |
| 1647 | else |
| 1648 | Out << "\\l(implicit) default:"; |
| 1649 | } |
| 1650 | else if (isa<IndirectGotoStmt>(T)) { |
Ted Kremenek | b38911f | 2008-01-30 23:03:39 +0000 | [diff] [blame] | 1651 | // FIXME |
| 1652 | } |
| 1653 | else { |
| 1654 | Out << "\\lCondition: "; |
| 1655 | if (*E.getSrc()->succ_begin() == E.getDst()) |
| 1656 | Out << "true"; |
| 1657 | else |
| 1658 | Out << "false"; |
| 1659 | } |
| 1660 | |
| 1661 | Out << "\\l"; |
| 1662 | } |
Ted Kremenek | 3b4f670 | 2008-01-30 23:24:39 +0000 | [diff] [blame] | 1663 | |
| 1664 | if (GraphPrintCheckerState->isUninitControlFlow(N)) { |
| 1665 | Out << "\\|Control-flow based on\\lUninitialized value.\\l"; |
| 1666 | } |
Ted Kremenek | aa66a32 | 2008-01-16 21:46:15 +0000 | [diff] [blame] | 1667 | } |
| 1668 | } |
| 1669 | |
Ted Kremenek | 9153f73 | 2008-02-05 07:17:49 +0000 | [diff] [blame] | 1670 | Out << "\\|StateID: " << (void*) N->getState().getImpl() << "\\|"; |
Ted Kremenek | 016f52f | 2008-02-08 21:10:02 +0000 | [diff] [blame] | 1671 | |
Ted Kremenek | e7d2211 | 2008-02-11 19:21:59 +0000 | [diff] [blame] | 1672 | N->getState().printDOT(Out); |
Ted Kremenek | 803c9ed | 2008-01-23 22:30:44 +0000 | [diff] [blame] | 1673 | |
Ted Kremenek | 803c9ed | 2008-01-23 22:30:44 +0000 | [diff] [blame] | 1674 | Out << "\\l"; |
Ted Kremenek | aa66a32 | 2008-01-16 21:46:15 +0000 | [diff] [blame] | 1675 | return Out.str(); |
| 1676 | } |
| 1677 | }; |
| 1678 | } // end llvm namespace |
| 1679 | #endif |
| 1680 | |
Ted Kremenek | e01c987 | 2008-02-14 22:36:46 +0000 | [diff] [blame] | 1681 | void GRExprEngine::ViewGraph() { |
Ted Kremenek | aa66a32 | 2008-01-16 21:46:15 +0000 | [diff] [blame] | 1682 | #ifndef NDEBUG |
Ted Kremenek | e01c987 | 2008-02-14 22:36:46 +0000 | [diff] [blame] | 1683 | GraphPrintCheckerState = this; |
| 1684 | llvm::ViewGraph(*G.roots_begin(), "GRExprEngine"); |
Ted Kremenek | 3b4f670 | 2008-01-30 23:24:39 +0000 | [diff] [blame] | 1685 | GraphPrintCheckerState = NULL; |
Ted Kremenek | e01c987 | 2008-02-14 22:36:46 +0000 | [diff] [blame] | 1686 | #endif |
Ted Kremenek | ee98546 | 2008-01-16 18:18:48 +0000 | [diff] [blame] | 1687 | } |