| 24364151180895f90018b6e373e51c0082ecff35 |
|
02-Jul-2012 |
Ted Kremenek <kremenek@apple.com> |
Make this test invariant to future changes of the max loop unrolling count.
git-svn-id: https://llvm.org/svn/llvm-project/cfe/trunk@159585 91177308-0d34-0410-b5e6-96231b3b80d8
/external/clang/test/Analysis/traversal-algorithm.mm
|
| 371b477836f289f2e9caaab58530f187b51bc86d |
|
02-Jul-2012 |
Ted Kremenek <kremenek@apple.com> |
Fix subtle bug in AnalysisConsumer where we would not analyze functions whose parent
in the call graph had been inlined but for whatever reason we did not inline some
of its callees.
Also, fix a related traversal bug where we meant to do a BFS of the callgraph but
instead were doing a DFS.
git-svn-id: https://llvm.org/svn/llvm-project/cfe/trunk@159577 91177308-0d34-0410-b5e6-96231b3b80d8
/external/clang/test/Analysis/traversal-algorithm.mm
|
| 8d0f528afd9fcb9ebb8ccb4b8a529a05375b628e |
|
29-Jun-2012 |
Jordan Rose <jordan_rose@apple.com> |
[analyzer] Add a test that we are, in fact, doing a DFS on the ExplodedGraph.
Previously:
...the comment said DFS...
...the WorkList being instantiated said BFS...
...and the implementation was actually DFS...
...due to an unintentional change in 2010...
...and everything kept working anyway.
This fixes our std::deque implementation of BFS, but switches back to a
SmallVector-based implementation of DFS.
We should probably still investigate the ramifications of DFS vs. BFS,
especially for large functions (and especially when we hit our block path
limit), since this might completely change our memory use. It can also mask
some bugs and reveal others depending on when we halt analysis. But at least
we will not have this kind of little mistake creep in again.
git-svn-id: https://llvm.org/svn/llvm-project/cfe/trunk@159397 91177308-0d34-0410-b5e6-96231b3b80d8
/external/clang/test/Analysis/traversal-algorithm.mm
|