about summary refs log tree commit diff homepage
path: root/lib/Core/StatsTracker.cpp
diff options
context:
space:
mode:
authorCristian Cadar <cristic@cs.stanford.edu>2011-09-02 22:37:00 +0000
committerCristian Cadar <cristic@cs.stanford.edu>2011-09-02 22:37:00 +0000
commit9702b978795d8e0518e211bc0a3789363157fb16 (patch)
tree5835091594c0b3391734d5bb99a7df20c335e3db /lib/Core/StatsTracker.cpp
parent90d8a6fb1a71c030f87fff5685b5d6f39ed4ac09 (diff)
downloadklee-9702b978795d8e0518e211bc0a3789363157fb16.tar.gz
Applied patch from David Ramos that fixes a bug in minDistToUncovered
   calculation: "Functions with a single instruction were erroneously
   treated as never returning. This propagated far, making many
   instructions unreachable according to this metric."



git-svn-id: https://llvm.org/svn/llvm-project/klee/trunk@139045 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/Core/StatsTracker.cpp')
-rw-r--r--lib/Core/StatsTracker.cpp10
1 files changed, 8 insertions, 2 deletions
diff --git a/lib/Core/StatsTracker.cpp b/lib/Core/StatsTracker.cpp
index 7dcca6b2..4906dead 100644
--- a/lib/Core/StatsTracker.cpp
+++ b/lib/Core/StatsTracker.cpp
@@ -714,12 +714,18 @@ void StatsTracker::computeReachableUncovered() {
                 best = val;
             }
           }
-          if (best != cur) {
+          // there's a corner case here when a function only includes a single
+          // instruction (a ret). in that case, we MUST update
+          // functionShortestPath, or it will remain 0 (erroneously indicating
+          // that no return instructions are reachable)
+          Function *f = inst->getParent()->getParent();
+          if (best != cur
+              || (inst == f->begin()->begin()
+                  && functionShortestPath[f] != best)) {
             sm.setIndexedValue(stats::minDistToReturn, id, best);
             changed = true;
 
             // Update shortest path if this is the entry point.
-            Function *f = inst->getParent()->getParent();
             if (inst==f->begin()->begin())
               functionShortestPath[f] = best;
           }