diff options
| author | Ted Kremenek <kremenek@apple.com> | 2012-01-26 21:29:00 +0000 |
|---|---|---|
| committer | Ted Kremenek <kremenek@apple.com> | 2012-01-26 21:29:00 +0000 |
| commit | 8bef8238181a30e52dea380789a7e2d760eac532 (patch) | |
| tree | d92cc6ba35a038b0429fb2c5dffb37eea6599337 /lib/StaticAnalyzer/Core/CoreEngine.cpp | |
| parent | bbdfad581fa300fa0d162d968ec14de3c95fc760 (diff) | |
Change references to 'const ProgramState *' to typedef 'ProgramStateRef'.
At this point this is largely cosmetic, but it opens the door to replace
ProgramStateRef with a smart pointer that more eagerly acts in the role
of reclaiming unused ProgramState objects.
git-svn-id: https://llvm.org/svn/llvm-project/cfe/trunk@149081 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/StaticAnalyzer/Core/CoreEngine.cpp')
| -rw-r--r-- | lib/StaticAnalyzer/Core/CoreEngine.cpp | 16 |
1 files changed, 8 insertions, 8 deletions
diff --git a/lib/StaticAnalyzer/Core/CoreEngine.cpp b/lib/StaticAnalyzer/Core/CoreEngine.cpp index b39b0f23b4..84b2c594e4 100644 --- a/lib/StaticAnalyzer/Core/CoreEngine.cpp +++ b/lib/StaticAnalyzer/Core/CoreEngine.cpp @@ -152,7 +152,7 @@ WorkList* WorkList::makeBFSBlockDFSContents() { /// ExecuteWorkList - Run the worklist algorithm for a maximum number of steps. bool CoreEngine::ExecuteWorkList(const LocationContext *L, unsigned Steps, - const ProgramState *InitState) { + ProgramStateRef InitState) { if (G->num_roots() == 0) { // Initialize the analysis by constructing // the root if none exists. @@ -236,7 +236,7 @@ bool CoreEngine::ExecuteWorkList(const LocationContext *L, unsigned Steps, void CoreEngine::ExecuteWorkListWithInitialState(const LocationContext *L, unsigned Steps, - const ProgramState *InitState, + ProgramStateRef InitState, ExplodedNodeSet &Dst) { ExecuteWorkList(L, Steps, InitState); for (SmallVectorImpl<ExplodedNode*>::iterator I = G->EndNodes.begin(), @@ -424,7 +424,7 @@ void CoreEngine::HandlePostStmt(const CFGBlock *B, unsigned StmtIdx, /// generateNode - Utility method to generate nodes, hook up successors, /// and add nodes to the worklist. void CoreEngine::generateNode(const ProgramPoint &Loc, - const ProgramState *State, + ProgramStateRef State, ExplodedNode *Pred) { bool IsNew; @@ -527,7 +527,7 @@ void CoreEngine::enqueueEndOfFunction(ExplodedNodeSet &Set) { void NodeBuilder::anchor() { } ExplodedNode* NodeBuilder::generateNodeImpl(const ProgramPoint &Loc, - const ProgramState *State, + ProgramStateRef State, ExplodedNode *FromN, bool MarkAsSink) { HasGeneratedNodes = true; @@ -556,7 +556,7 @@ StmtNodeBuilder::~StmtNodeBuilder() { void BranchNodeBuilder::anchor() { } -ExplodedNode *BranchNodeBuilder::generateNode(const ProgramState *State, +ExplodedNode *BranchNodeBuilder::generateNode(ProgramStateRef State, bool branch, ExplodedNode *NodePred) { // If the branch has been marked infeasible we should not generate a node. @@ -571,7 +571,7 @@ ExplodedNode *BranchNodeBuilder::generateNode(const ProgramState *State, ExplodedNode* IndirectGotoNodeBuilder::generateNode(const iterator &I, - const ProgramState *St, + ProgramStateRef St, bool IsSink) { bool IsNew; ExplodedNode *Succ = Eng.G->getNode(BlockEdge(Src, I.getBlock(), @@ -591,7 +591,7 @@ IndirectGotoNodeBuilder::generateNode(const iterator &I, ExplodedNode* SwitchNodeBuilder::generateCaseStmtNode(const iterator &I, - const ProgramState *St) { + ProgramStateRef St) { bool IsNew; ExplodedNode *Succ = Eng.G->getNode(BlockEdge(Src, I.getBlock(), @@ -607,7 +607,7 @@ SwitchNodeBuilder::generateCaseStmtNode(const iterator &I, ExplodedNode* -SwitchNodeBuilder::generateDefaultCaseNode(const ProgramState *St, +SwitchNodeBuilder::generateDefaultCaseNode(ProgramStateRef St, bool IsSink) { // Get the block for the default case. assert(Src->succ_rbegin() != Src->succ_rend()); |