UninitializedValues.cpp revision 3060178ad9df29789505c1e6debcfc80a3a13587 
1//==- UninitializedValues.cpp - Find Uninitialized Values -------*- C++ --*-==//
2//
3//                     The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9//
10// This file implements uninitialized values analysis for source-level CFGs.
11//
12//===----------------------------------------------------------------------===//
13
14#include <utility>
15#include "llvm/ADT/Optional.h"
16#include "llvm/ADT/SmallVector.h"
17#include "llvm/ADT/PackedVector.h"
18#include "llvm/ADT/DenseMap.h"
19#include "clang/AST/Decl.h"
20#include "clang/Analysis/CFG.h"
21#include "clang/Analysis/AnalysisContext.h"
22#include "clang/Analysis/Visitors/CFGRecStmtDeclVisitor.h"
23#include "clang/Analysis/Analyses/UninitializedValues.h"
24#include "clang/Analysis/Support/SaveAndRestore.h"
25
26using namespace clang;
27
28static bool isTrackedVar(const VarDecl *vd, const DeclContext *dc) {
29  if (vd->isLocalVarDecl() && !vd->hasGlobalStorage() &&
30      !vd->isExceptionVariable() &&
31      vd->getDeclContext() == dc) {
32    QualType ty = vd->getType();
33    return ty->isScalarType() || ty->isVectorType();
34  }
35  return false;
36}
37
38//------------------------------------------------------------------------====//
39// DeclToIndex: a mapping from Decls we track to value indices.
40//====------------------------------------------------------------------------//
41
42namespace {
43class DeclToIndex {
44  llvm::DenseMap<const VarDecl *, unsigned> map;
45public:
46  DeclToIndex() {}
47
48  /// Compute the actual mapping from declarations to bits.
49  void computeMap(const DeclContext &dc);
50
51  /// Return the number of declarations in the map.
52  unsigned size() const { return map.size(); }
53
54  /// Returns the bit vector index for a given declaration.
55  llvm::Optional<unsigned> getValueIndex(const VarDecl *d) const;
56};
57}
58
59void DeclToIndex::computeMap(const DeclContext &dc) {
60  unsigned count = 0;
61  DeclContext::specific_decl_iterator<VarDecl> I(dc.decls_begin()),
62                                               E(dc.decls_end());
63  for ( ; I != E; ++I) {
64    const VarDecl *vd = *I;
65    if (isTrackedVar(vd, &dc))
66      map[vd] = count++;
67  }
68}
69
70llvm::Optional<unsigned> DeclToIndex::getValueIndex(const VarDecl *d) const {
71  llvm::DenseMap<const VarDecl *, unsigned>::const_iterator I = map.find(d);
72  if (I == map.end())
73    return llvm::Optional<unsigned>();
74  return I->second;
75}
76
77//------------------------------------------------------------------------====//
78// CFGBlockValues: dataflow values for CFG blocks.
79//====------------------------------------------------------------------------//
80
81// These values are defined in such a way that a merge can be done using
82// a bitwise OR.
83enum Value { Unknown = 0x0,         /* 00 */
84             Initialized = 0x1,     /* 01 */
85             Uninitialized = 0x2,   /* 10 */
86             MayUninitialized = 0x3 /* 11 */ };
87
88static bool isUninitialized(const Value v) {
89  return v >= Uninitialized;
90}
91static bool isAlwaysUninit(const Value v) {
92  return v == Uninitialized;
93}
94
95namespace {
96
97typedef llvm::PackedVector<Value, 2> ValueVector;
98typedef std::pair<ValueVector *, ValueVector *> BVPair;
99
100class CFGBlockValues {
101  const CFG &cfg;
102  BVPair *vals;
103  ValueVector scratch;
104  DeclToIndex declToIndex;
105
106  ValueVector &lazyCreate(ValueVector *&bv);
107public:
108  CFGBlockValues(const CFG &cfg);
109  ~CFGBlockValues();
110
111  unsigned getNumEntries() const { return declToIndex.size(); }
112
113  void computeSetOfDeclarations(const DeclContext &dc);
114  ValueVector &getValueVector(const CFGBlock *block,
115                                const CFGBlock *dstBlock);
116
117  BVPair &getValueVectors(const CFGBlock *block, bool shouldLazyCreate);
118
119  void mergeIntoScratch(ValueVector const &source, bool isFirst);
120  bool updateValueVectorWithScratch(const CFGBlock *block);
121  bool updateValueVectors(const CFGBlock *block, const BVPair &newVals);
122
123  bool hasNoDeclarations() const {
124    return declToIndex.size() == 0;
125  }
126
127  bool hasEntry(const VarDecl *vd) const {
128    return declToIndex.getValueIndex(vd).hasValue();
129  }
130
131  bool hasValues(const CFGBlock *block);
132
133  void resetScratch();
134  ValueVector &getScratch() { return scratch; }
135
136  ValueVector::reference operator[](const VarDecl *vd);
137};
138} // end anonymous namespace
139
140CFGBlockValues::CFGBlockValues(const CFG &c) : cfg(c), vals(0) {
141  unsigned n = cfg.getNumBlockIDs();
142  if (!n)
143    return;
144  vals = new std::pair<ValueVector*, ValueVector*>[n];
145  memset((void*)vals, 0, sizeof(*vals) * n);
146}
147
148CFGBlockValues::~CFGBlockValues() {
149  unsigned n = cfg.getNumBlockIDs();
150  if (n == 0)
151    return;
152  for (unsigned i = 0; i < n; ++i) {
153    delete vals[i].first;
154    delete vals[i].second;
155  }
156  delete [] vals;
157}
158
159void CFGBlockValues::computeSetOfDeclarations(const DeclContext &dc) {
160  declToIndex.computeMap(dc);
161  scratch.resize(declToIndex.size());
162}
163
164ValueVector &CFGBlockValues::lazyCreate(ValueVector *&bv) {
165  if (!bv)
166    bv = new ValueVector(declToIndex.size());
167  return *bv;
168}
169
170/// This function pattern matches for a '&&' or '||' that appears at
171/// the beginning of a CFGBlock that also (1) has a terminator and
172/// (2) has no other elements.  If such an expression is found, it is returned.
173static BinaryOperator *getLogicalOperatorInChain(const CFGBlock *block) {
174  if (block->empty())
175    return 0;
176
177  const CFGStmt *cstmt = block->front().getAs<CFGStmt>();
178  if (!cstmt)
179    return 0;
180
181  BinaryOperator *b = dyn_cast_or_null<BinaryOperator>(cstmt->getStmt());
182
183  if (!b || !b->isLogicalOp())
184    return 0;
185
186  if (block->pred_size() == 2) {
187    if (block->getTerminatorCondition() == b) {
188      if (block->succ_size() == 2)
189      return b;
190    }
191    else if (block->size() == 1)
192      return b;
193  }
194
195  return 0;
196}
197
198ValueVector &CFGBlockValues::getValueVector(const CFGBlock *block,
199                                            const CFGBlock *dstBlock) {
200  unsigned idx = block->getBlockID();
201  if (dstBlock && getLogicalOperatorInChain(block)) {
202    if (*block->succ_begin() == dstBlock)
203      return lazyCreate(vals[idx].first);
204    assert(*(block->succ_begin()+1) == dstBlock);
205    return lazyCreate(vals[idx].second);
206  }
207
208  assert(vals[idx].second == 0);
209  return lazyCreate(vals[idx].first);
210}
211
212bool CFGBlockValues::hasValues(const CFGBlock *block) {
213  unsigned idx = block->getBlockID();
214  return vals[idx].second != 0;
215}
216
217BVPair &CFGBlockValues::getValueVectors(const clang::CFGBlock *block,
218                                        bool shouldLazyCreate) {
219  unsigned idx = block->getBlockID();
220  lazyCreate(vals[idx].first);
221  if (shouldLazyCreate)
222    lazyCreate(vals[idx].second);
223  return vals[idx];
224}
225
226void CFGBlockValues::mergeIntoScratch(ValueVector const &source,
227                                      bool isFirst) {
228  if (isFirst)
229    scratch = source;
230  else
231    scratch |= source;
232}
233#if 0
234static void printVector(const CFGBlock *block, ValueVector &bv,
235                        unsigned num) {
236
237  llvm::errs() << block->getBlockID() << " :";
238  for (unsigned i = 0; i < bv.size(); ++i) {
239    llvm::errs() << ' ' << bv[i];
240  }
241  llvm::errs() << " : " << num << '\n';
242}
243#endif
244
245bool CFGBlockValues::updateValueVectorWithScratch(const CFGBlock *block) {
246  ValueVector &dst = getValueVector(block, 0);
247  bool changed = (dst != scratch);
248  if (changed)
249    dst = scratch;
250#if 0
251  printVector(block, scratch, 0);
252#endif
253  return changed;
254}
255
256bool CFGBlockValues::updateValueVectors(const CFGBlock *block,
257                                      const BVPair &newVals) {
258  BVPair &vals = getValueVectors(block, true);
259  bool changed = *newVals.first != *vals.first ||
260                 *newVals.second != *vals.second;
261  *vals.first = *newVals.first;
262  *vals.second = *newVals.second;
263#if 0
264  printVector(block, *vals.first, 1);
265  printVector(block, *vals.second, 2);
266#endif
267  return changed;
268}
269
270void CFGBlockValues::resetScratch() {
271  scratch.reset();
272}
273
274ValueVector::reference CFGBlockValues::operator[](const VarDecl *vd) {
275  const llvm::Optional<unsigned> &idx = declToIndex.getValueIndex(vd);
276  assert(idx.hasValue());
277  return scratch[idx.getValue()];
278}
279
280//------------------------------------------------------------------------====//
281// Worklist: worklist for dataflow analysis.
282//====------------------------------------------------------------------------//
283
284namespace {
285class DataflowWorklist {
286  SmallVector<const CFGBlock *, 20> worklist;
287  llvm::BitVector enqueuedBlocks;
288public:
289  DataflowWorklist(const CFG &cfg) : enqueuedBlocks(cfg.getNumBlockIDs()) {}
290
291  void enqueueSuccessors(const CFGBlock *block);
292  const CFGBlock *dequeue();
293};
294}
295
296void DataflowWorklist::enqueueSuccessors(const clang::CFGBlock *block) {
297  unsigned OldWorklistSize = worklist.size();
298  for (CFGBlock::const_succ_iterator I = block->succ_begin(),
299       E = block->succ_end(); I != E; ++I) {
300    const CFGBlock *Successor = *I;
301    if (!Successor || enqueuedBlocks[Successor->getBlockID()])
302      continue;
303    worklist.push_back(Successor);
304    enqueuedBlocks[Successor->getBlockID()] = true;
305  }
306  if (OldWorklistSize == 0 || OldWorklistSize == worklist.size())
307    return;
308
309  // Rotate the newly added blocks to the start of the worklist so that it forms
310  // a proper queue when we pop off the end of the worklist.
311  std::rotate(worklist.begin(), worklist.begin() + OldWorklistSize,
312              worklist.end());
313}
314
315const CFGBlock *DataflowWorklist::dequeue() {
316  if (worklist.empty())
317    return 0;
318  const CFGBlock *b = worklist.back();
319  worklist.pop_back();
320  enqueuedBlocks[b->getBlockID()] = false;
321  return b;
322}
323
324//------------------------------------------------------------------------====//
325// Transfer function for uninitialized values analysis.
326//====------------------------------------------------------------------------//
327
328namespace {
329class FindVarResult {
330  const VarDecl *vd;
331  const DeclRefExpr *dr;
332public:
333  FindVarResult(VarDecl *vd, DeclRefExpr *dr) : vd(vd), dr(dr) {}
334
335  const DeclRefExpr *getDeclRefExpr() const { return dr; }
336  const VarDecl *getDecl() const { return vd; }
337};
338
339class TransferFunctions : public StmtVisitor<TransferFunctions> {
340  CFGBlockValues &vals;
341  const CFG &cfg;
342  AnalysisContext &ac;
343  UninitVariablesHandler *handler;
344  const bool flagBlockUses;
345
346  /// The last DeclRefExpr seen when analyzing a block.  Used to
347  /// cheat when detecting cases when the address of a variable is taken.
348  DeclRefExpr *lastDR;
349
350  /// The last lvalue-to-rvalue conversion of a variable whose value
351  /// was uninitialized.  Normally this results in a warning, but it is
352  /// possible to either silence the warning in some cases, or we
353  /// propagate the uninitialized value.
354  CastExpr *lastLoad;
355
356  /// For some expressions, we want to ignore any post-processing after
357  /// visitation.
358  bool skipProcessUses;
359
360public:
361  TransferFunctions(CFGBlockValues &vals, const CFG &cfg,
362                    AnalysisContext &ac,
363                    UninitVariablesHandler *handler,
364                    bool flagBlockUses)
365    : vals(vals), cfg(cfg), ac(ac), handler(handler),
366      flagBlockUses(flagBlockUses), lastDR(0), lastLoad(0),
367      skipProcessUses(false) {}
368
369  const CFG &getCFG() { return cfg; }
370  void reportUninit(const DeclRefExpr *ex, const VarDecl *vd,
371                    bool isAlwaysUninit);
372
373  void VisitBlockExpr(BlockExpr *be);
374  void VisitDeclStmt(DeclStmt *ds);
375  void VisitDeclRefExpr(DeclRefExpr *dr);
376  void VisitUnaryOperator(UnaryOperator *uo);
377  void VisitBinaryOperator(BinaryOperator *bo);
378  void VisitCastExpr(CastExpr *ce);
379  void VisitObjCForCollectionStmt(ObjCForCollectionStmt *fs);
380  void Visit(Stmt *s);
381
382  bool isTrackedVar(const VarDecl *vd) {
383    return ::isTrackedVar(vd, cast<DeclContext>(ac.getDecl()));
384  }
385
386  FindVarResult findBlockVarDecl(Expr *ex);
387
388  void ProcessUses(Stmt *s = 0);
389};
390}
391
392static const Expr *stripCasts(ASTContext &C, const Expr *Ex) {
393  while (Ex) {
394    Ex = Ex->IgnoreParenNoopCasts(C);
395    if (const CastExpr *CE = dyn_cast<CastExpr>(Ex)) {
396      if (CE->getCastKind() == CK_LValueBitCast) {
397        Ex = CE->getSubExpr();
398        continue;
399      }
400    }
401    break;
402  }
403  return Ex;
404}
405
406void TransferFunctions::reportUninit(const DeclRefExpr *ex,
407                                     const VarDecl *vd, bool isAlwaysUnit) {
408  if (handler) handler->handleUseOfUninitVariable(ex, vd, isAlwaysUnit);
409}
410
411FindVarResult TransferFunctions::findBlockVarDecl(Expr *ex) {
412  if (DeclRefExpr *dr = dyn_cast<DeclRefExpr>(ex->IgnoreParenCasts()))
413    if (VarDecl *vd = dyn_cast<VarDecl>(dr->getDecl()))
414      if (isTrackedVar(vd))
415        return FindVarResult(vd, dr);
416  return FindVarResult(0, 0);
417}
418
419void TransferFunctions::VisitObjCForCollectionStmt(ObjCForCollectionStmt *fs) {
420  // This represents an initialization of the 'element' value.
421  Stmt *element = fs->getElement();
422  const VarDecl *vd = 0;
423
424  if (DeclStmt *ds = dyn_cast<DeclStmt>(element)) {
425    vd = cast<VarDecl>(ds->getSingleDecl());
426    if (!isTrackedVar(vd))
427      vd = 0;
428  } else {
429    // Initialize the value of the reference variable.
430    const FindVarResult &res = findBlockVarDecl(cast<Expr>(element));
431    vd = res.getDecl();
432  }
433
434  if (vd)
435    vals[vd] = Initialized;
436}
437
438void TransferFunctions::VisitBlockExpr(BlockExpr *be) {
439  if (!flagBlockUses || !handler)
440    return;
441  const BlockDecl *bd = be->getBlockDecl();
442  for (BlockDecl::capture_const_iterator i = bd->capture_begin(),
443        e = bd->capture_end() ; i != e; ++i) {
444    const VarDecl *vd = i->getVariable();
445    if (!vd->hasLocalStorage())
446      continue;
447    if (!isTrackedVar(vd))
448      continue;
449    if (i->isByRef()) {
450      vals[vd] = Initialized;
451      continue;
452    }
453    Value v = vals[vd];
454    if (isUninitialized(v))
455      handler->handleUseOfUninitVariable(be, vd, isAlwaysUninit(v));
456  }
457}
458
459void TransferFunctions::VisitDeclRefExpr(DeclRefExpr *dr) {
460  // Record the last DeclRefExpr seen.  This is an lvalue computation.
461  // We use this value to later detect if a variable "escapes" the analysis.
462  if (const VarDecl *vd = dyn_cast<VarDecl>(dr->getDecl()))
463    if (isTrackedVar(vd)) {
464      ProcessUses();
465      lastDR = dr;
466    }
467}
468
469void TransferFunctions::VisitDeclStmt(DeclStmt *ds) {
470  for (DeclStmt::decl_iterator DI = ds->decl_begin(), DE = ds->decl_end();
471       DI != DE; ++DI) {
472    if (VarDecl *vd = dyn_cast<VarDecl>(*DI)) {
473      if (isTrackedVar(vd)) {
474        if (Expr *init = vd->getInit()) {
475          // If the initializer consists solely of a reference to itself, we
476          // explicitly mark the variable as uninitialized. This allows code
477          // like the following:
478          //
479          //   int x = x;
480          //
481          // to deliberately leave a variable uninitialized. Different analysis
482          // clients can detect this pattern and adjust their reporting
483          // appropriately, but we need to continue to analyze subsequent uses
484          // of the variable.
485          if (init == lastLoad) {
486            const DeclRefExpr *DR
487              = cast<DeclRefExpr>(stripCasts(ac.getASTContext(),
488                                             lastLoad->getSubExpr()));
489            if (DR->getDecl() == vd) {
490              // int x = x;
491              // Propagate uninitialized value, but don't immediately report
492              // a problem.
493              vals[vd] = Uninitialized;
494              lastLoad = 0;
495              lastDR = 0;
496              return;
497            }
498          }
499
500          // All other cases: treat the new variable as initialized.
501          vals[vd] = Initialized;
502        }
503      }
504    }
505  }
506}
507
508void TransferFunctions::VisitBinaryOperator(clang::BinaryOperator *bo) {
509  if (bo->isAssignmentOp()) {
510    const FindVarResult &res = findBlockVarDecl(bo->getLHS());
511    if (const VarDecl *vd = res.getDecl()) {
512      ValueVector::reference val = vals[vd];
513      if (isUninitialized(val)) {
514        if (bo->getOpcode() != BO_Assign)
515          reportUninit(res.getDeclRefExpr(), vd, isAlwaysUninit(val));
516        else
517          val = Initialized;
518      }
519    }
520  }
521}
522
523void TransferFunctions::VisitUnaryOperator(clang::UnaryOperator *uo) {
524  switch (uo->getOpcode()) {
525    case clang::UO_PostDec:
526    case clang::UO_PostInc:
527    case clang::UO_PreDec:
528    case clang::UO_PreInc: {
529      const FindVarResult &res = findBlockVarDecl(uo->getSubExpr());
530      if (const VarDecl *vd = res.getDecl()) {
531        assert(res.getDeclRefExpr() == lastDR);
532        // We null out lastDR to indicate we have fully processed it
533        // and we don't want the auto-value setting in Visit().
534        lastDR = 0;
535
536        ValueVector::reference val = vals[vd];
537        if (isUninitialized(val))
538          reportUninit(res.getDeclRefExpr(), vd, isAlwaysUninit(val));
539      }
540      break;
541    }
542    default:
543      break;
544  }
545}
546
547void TransferFunctions::VisitCastExpr(clang::CastExpr *ce) {
548  if (ce->getCastKind() == CK_LValueToRValue) {
549    const FindVarResult &res = findBlockVarDecl(ce->getSubExpr());
550    if (const VarDecl *vd = res.getDecl()) {
551      assert(res.getDeclRefExpr() == lastDR);
552      if (isUninitialized(vals[vd])) {
553        // Record this load of an uninitialized value.  Normally this
554        // results in a warning, but we delay reporting the issue
555        // in case it is wrapped in a void cast, etc.
556        lastLoad = ce;
557      }
558    }
559  }
560  else if (ce->getCastKind() == CK_NoOp ||
561           ce->getCastKind() == CK_LValueBitCast) {
562    skipProcessUses = true;
563  }
564  else if (CStyleCastExpr *cse = dyn_cast<CStyleCastExpr>(ce)) {
565    if (cse->getType()->isVoidType()) {
566      // e.g. (void) x;
567      if (lastLoad == cse->getSubExpr()) {
568        // Squelch any detected load of an uninitialized value if
569        // we cast it to void.
570        lastLoad = 0;
571        lastDR = 0;
572      }
573    }
574  }
575}
576
577void TransferFunctions::Visit(clang::Stmt *s) {
578  skipProcessUses = false;
579  StmtVisitor<TransferFunctions>::Visit(s);
580  if (!skipProcessUses)
581    ProcessUses(s);
582}
583
584void TransferFunctions::ProcessUses(Stmt *s) {
585  // This method is typically called after visiting a CFGElement statement
586  // in the CFG.  We delay processing of reporting many loads of uninitialized
587  // values until here.
588  if (lastLoad) {
589    // If we just visited the lvalue-to-rvalue cast, there is nothing
590    // left to do.
591    if (lastLoad == s)
592      return;
593
594    // If we reach here, we have seen a load of an uninitialized value
595    // and it hasn't been casted to void or otherwise handled.  In this
596    // situation, report the incident.
597    const DeclRefExpr *DR =
598      cast<DeclRefExpr>(stripCasts(ac.getASTContext(),
599                                   lastLoad->getSubExpr()));
600    const VarDecl *VD = cast<VarDecl>(DR->getDecl());
601    reportUninit(DR, VD, isAlwaysUninit(vals[VD]));
602    lastLoad = 0;
603
604    if (DR == lastDR) {
605      lastDR = 0;
606      return;
607    }
608  }
609
610  // Any other uses of 'lastDR' involve taking an lvalue of variable.
611  // In this case, it "escapes" the analysis.
612  if (lastDR && lastDR != s) {
613    vals[cast<VarDecl>(lastDR->getDecl())] = Initialized;
614    lastDR = 0;
615  }
616}
617
618//------------------------------------------------------------------------====//
619// High-level "driver" logic for uninitialized values analysis.
620//====------------------------------------------------------------------------//
621
622static bool runOnBlock(const CFGBlock *block, const CFG &cfg,
623                       AnalysisContext &ac, CFGBlockValues &vals,
624                       llvm::BitVector &wasAnalyzed,
625                       UninitVariablesHandler *handler = 0,
626                       bool flagBlockUses = false) {
627
628  wasAnalyzed[block->getBlockID()] = true;
629
630  if (const BinaryOperator *b = getLogicalOperatorInChain(block)) {
631    CFGBlock::const_pred_iterator itr = block->pred_begin();
632    BVPair vA = vals.getValueVectors(*itr, false);
633    ++itr;
634    BVPair vB = vals.getValueVectors(*itr, false);
635
636    BVPair valsAB;
637
638    if (b->getOpcode() == BO_LAnd) {
639      // Merge the 'F' bits from the first and second.
640      vals.mergeIntoScratch(*(vA.second ? vA.second : vA.first), true);
641      vals.mergeIntoScratch(*(vB.second ? vB.second : vB.first), false);
642      valsAB.first = vA.first;
643      valsAB.second = &vals.getScratch();
644    } else {
645      // Merge the 'T' bits from the first and second.
646      assert(b->getOpcode() == BO_LOr);
647      vals.mergeIntoScratch(*vA.first, true);
648      vals.mergeIntoScratch(*vB.first, false);
649      valsAB.first = &vals.getScratch();
650      valsAB.second = vA.second ? vA.second : vA.first;
651    }
652    return vals.updateValueVectors(block, valsAB);
653  }
654
655  // Default behavior: merge in values of predecessor blocks.
656  vals.resetScratch();
657  bool isFirst = true;
658  for (CFGBlock::const_pred_iterator I = block->pred_begin(),
659       E = block->pred_end(); I != E; ++I) {
660    vals.mergeIntoScratch(vals.getValueVector(*I, block), isFirst);
661    isFirst = false;
662  }
663  // Apply the transfer function.
664  TransferFunctions tf(vals, cfg, ac, handler, flagBlockUses);
665  for (CFGBlock::const_iterator I = block->begin(), E = block->end();
666       I != E; ++I) {
667    if (const CFGStmt *cs = dyn_cast<CFGStmt>(&*I)) {
668      tf.Visit(cs->getStmt());
669    }
670  }
671  tf.ProcessUses();
672  return vals.updateValueVectorWithScratch(block);
673}
674
675void clang::runUninitializedVariablesAnalysis(
676    const DeclContext &dc,
677    const CFG &cfg,
678    AnalysisContext &ac,
679    UninitVariablesHandler &handler,
680    UninitVariablesAnalysisStats &stats) {
681  CFGBlockValues vals(cfg);
682  vals.computeSetOfDeclarations(dc);
683  if (vals.hasNoDeclarations())
684    return;
685
686  stats.NumVariablesAnalyzed = vals.getNumEntries();
687
688  // Mark all variables uninitialized at the entry.
689  const CFGBlock &entry = cfg.getEntry();
690  for (CFGBlock::const_succ_iterator i = entry.succ_begin(),
691        e = entry.succ_end(); i != e; ++i) {
692    if (const CFGBlock *succ = *i) {
693      ValueVector &vec = vals.getValueVector(&entry, succ);
694      const unsigned n = vals.getNumEntries();
695      for (unsigned j = 0; j < n ; ++j) {
696        vec[j] = Uninitialized;
697      }
698    }
699  }
700
701  // Proceed with the workist.
702  DataflowWorklist worklist(cfg);
703  llvm::BitVector previouslyVisited(cfg.getNumBlockIDs());
704  worklist.enqueueSuccessors(&cfg.getEntry());
705  llvm::BitVector wasAnalyzed(cfg.getNumBlockIDs(), false);
706
707  while (const CFGBlock *block = worklist.dequeue()) {
708    // Did the block change?
709    bool changed = runOnBlock(block, cfg, ac, vals, wasAnalyzed);
710    ++stats.NumBlockVisits;
711    if (changed || !previouslyVisited[block->getBlockID()])
712      worklist.enqueueSuccessors(block);
713    previouslyVisited[block->getBlockID()] = true;
714  }
715
716  // Run through the blocks one more time, and report uninitialized variabes.
717  for (CFG::const_iterator BI = cfg.begin(), BE = cfg.end(); BI != BE; ++BI) {
718    if (wasAnalyzed[(*BI)->getBlockID()]) {
719      runOnBlock(*BI, cfg, ac, vals, wasAnalyzed, &handler,
720                 /* flagBlockUses */ true);
721      ++stats.NumBlockVisits;
722    }
723  }
724}
725
726UninitVariablesHandler::~UninitVariablesHandler() {}
727