- Mar 05, 2008
-
-
Ted Kremenek authored
ExplodedGraph. This allows us to build "layered" ExplodedGraphs where one simulation is layered on another. llvm-svn: 47926
-
Chris Lattner authored
llvm-svn: 47925
-
Devang Patel authored
llvm-svn: 47924
-
Ted Kremenek authored
GRStmtNodeBuilder and is now responsible for adding its own nodes to the graph. llvm-svn: 47923
-
Devang Patel authored
llvm-svn: 47922
-
Ted Kremenek authored
This is conceptually much cleaner, as it shows that the state is always a pointer. It also makes it easier to marshall these values around across the internal APIs of the path-sensitive engine. llvm-svn: 47921
-
Ted Kremenek authored
of the entire checker. llvm-svn: 47920
-
Ted Kremenek authored
allow us to pass the builder to plug-in transfer functions and allow those functions to create intermediate nodes. llvm-svn: 47919
-
Bill Wendling authored
llvm-svn: 47918
-
Dale Johannesen authored
class (cosmetic). First piece of byval implementation; this doesn't work yet. No functional change. llvm-svn: 47917
-
Bill Wendling authored
llvm-svn: 47916
-
Bill Wendling authored
llvm-svn: 47915
-
Ted Kremenek authored
Made GRExprEngine::NodeSet a typedef of ExplodedNodeSet. llvm-svn: 47914
-
- Mar 04, 2008
-
-
Ted Kremenek authored
llvm-svn: 47913
-
Ted Kremenek authored
llvm-svn: 47912
-
Devang Patel authored
llvm-svn: 47911
-
Ted Kremenek authored
passed-by-reference to builtin functions until we have better builtin support. llvm-svn: 47910
-
Devang Patel authored
llvm-svn: 47909
-
Devang Patel authored
llvm-svn: 47908
-
Devang Patel authored
Update test to use multiple return value directly, instead of relying on -sretpromotion. llvm-svn: 47907
-
Devang Patel authored
llvm-svn: 47906
-
Devang Patel authored
llvm-svn: 47904
-
Andrew Lenharth authored
llvm-svn: 47903
-
Anders Carlsson authored
llvm-svn: 47902
-
Ted Kremenek authored
structs (local variables) to Unknown instead of Undefined. (added FIXME to initialize *members* of struct to undefined) llvm-svn: 47901
-
Anton Korobeynikov authored
llvm-svn: 47900
-
Anton Korobeynikov authored
llvm-svn: 47899
-
Ted Kremenek authored
llvm-svn: 47898
-
Devang Patel authored
llvm-svn: 47897
-
Devang Patel authored
new function and new call sites. llvm-svn: 47896
-
Devang Patel authored
llvm-svn: 47895
-
Ted Kremenek authored
llvm-svn: 47894
-
Chris Lattner authored
llvm-svn: 47893
-
Devang Patel authored
llvm-svn: 47892
-
Ted Kremenek authored
TargetInfo::AddSecondaryTarget is now private, as it is only used during object construction. llvm-svn: 47891
-
Devang Patel authored
llvm-svn: 47890
-
Devang Patel authored
llvm-svn: 47889
-
Devang Patel authored
llvm-svn: 47888
-
Gordon Henriksen authored
llvm-svn: 47886
-
Roman Levenstein authored
The basic idea is that all these algorithms are computing the longest paths from the root node or to the exit node. Therefore the existing implementation that uses and iterative and potentially exponential algorithm was changed to a well-known graph algorithm based on dynamic programming. It has a linear run-time. llvm-svn: 47884
-