11cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger//=-- ExplodedGraph.cpp - Local, Path-Sens. "Exploded Graph" -*- C++ -*------=// 20910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project// 31cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger// The LLVM Compiler Infrastructure 40910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project// 51cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger// This file is distributed under the University of Illinois Open Source 61cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger// License. See LICENSE.TXT for details. 70910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project// 80910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project//===----------------------------------------------------------------------===// 91cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger// 100910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project// This file defines the template classes ExplodedNode and ExplodedGraph, 110910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project// which represent a path-sensitive, intra-procedural "exploded graph." 120910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project// 130910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project//===----------------------------------------------------------------------===// 140910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 150910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project#include "clang/StaticAnalyzer/Core/PathSensitive/ExplodedGraph.h" 1671531ca1f484da5837be8017a0c83e5bff701587Derek Sollenberger#include "clang/StaticAnalyzer/Core/PathSensitive/ProgramState.h" 170910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project#include "clang/AST/Stmt.h" 180910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project#include "clang/AST/ParentMap.h" 190910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project#include "llvm/ADT/DenseSet.h" 200910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project#include "llvm/ADT/DenseMap.h" 210910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project#include "llvm/ADT/SmallVector.h" 2259f59bde0b05a6ac5ff28fdebc1942dbf0d43aabMike Reed#include <vector> 230910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 240910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Projectusing namespace clang; 250910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Projectusing namespace ento; 260910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 270910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project//===----------------------------------------------------------------------===// 280910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project// Node auditing. 290910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project//===----------------------------------------------------------------------===// 300910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 310910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project// An out of line virtual method to provide a home for the class vtable. 320910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source ProjectExplodedNode::Auditor::~Auditor() {} 330910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 340910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project#ifndef NDEBUG 350910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Projectstatic ExplodedNode::Auditor* NodeAuditor = 0; 360910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project#endif 370910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 380910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Projectvoid ExplodedNode::SetAuditor(ExplodedNode::Auditor* A) { 390910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project#ifndef NDEBUG 400910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project NodeAuditor = A; 410910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project#endif 420910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project} 430910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 440910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project//===----------------------------------------------------------------------===// 45137a4ca42423bbb6d683067ea544c9a48f18f06cDerek Sollenberger// Cleanup. 460910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project//===----------------------------------------------------------------------===// 471cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger 481cab2921ab279367f8206cdadc9259d12e603548Derek Sollenbergerstatic const unsigned CounterTop = 1000; 491cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger 5020ab88413000fcc8668eeab25d9cb714097d0c45tedboExplodedGraph::ExplodedGraph() 5120ab88413000fcc8668eeab25d9cb714097d0c45tedbo : NumNodes(0), reclaimNodes(false), reclaimCounter(CounterTop) {} 5220ab88413000fcc8668eeab25d9cb714097d0c45tedbo 5320ab88413000fcc8668eeab25d9cb714097d0c45tedboExplodedGraph::~ExplodedGraph() {} 5420ab88413000fcc8668eeab25d9cb714097d0c45tedbo 5520ab88413000fcc8668eeab25d9cb714097d0c45tedbo//===----------------------------------------------------------------------===// 560910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project// Node reclamation. 570910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project//===----------------------------------------------------------------------===// 580910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 590910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Projectbool ExplodedGraph::shouldCollect(const ExplodedNode *node) { 600910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // Reclaimn all nodes that match *all* the following criteria: 610910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // 620910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // (1) 1 predecessor (that has one successor) 630910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // (2) 1 successor (that has one predecessor) 641cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger // (3) The ProgramPoint is for a PostStmt. 654f1dae40e24d57d647db01443b8bf2410514b8b5Derek Sollenberger // (4) There is no 'tag' for the ProgramPoint. 664f1dae40e24d57d647db01443b8bf2410514b8b5Derek Sollenberger // (5) The 'store' is the same as the predecessor. 674f1dae40e24d57d647db01443b8bf2410514b8b5Derek Sollenberger // (6) The 'GDM' is the same as the predecessor. 684f1dae40e24d57d647db01443b8bf2410514b8b5Derek Sollenberger // (7) The LocationContext is the same as the predecessor. 694f1dae40e24d57d647db01443b8bf2410514b8b5Derek Sollenberger // (8) The PostStmt is for a non-consumed Stmt or Expr. 701cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger 711cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger // Conditions 1 and 2. 721cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger if (node->pred_size() != 1 || node->succ_size() != 1) 731cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger return false; 741cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger 751cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger const ExplodedNode *pred = *(node->pred_begin()); 760910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project if (pred->succ_size() != 1) 770910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project return false; 780910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 790910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project const ExplodedNode *succ = *(node->succ_begin()); 800910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project if (succ->pred_size() != 1) 810910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project return false; 820910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 830910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // Condition 3. 840910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project ProgramPoint progPoint = node->getLocation(); 850910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project if (!isa<PostStmt>(progPoint) || 864f1dae40e24d57d647db01443b8bf2410514b8b5Derek Sollenberger (isa<CallEnter>(progPoint) || isa<CallExit>(progPoint))) 8720ab88413000fcc8668eeab25d9cb714097d0c45tedbo return false; 8887b8e645865f9633f410c02252a0fd3feb18f09bDerek Sollenberger 8987b8e645865f9633f410c02252a0fd3feb18f09bDerek Sollenberger // Condition 4. 9087b8e645865f9633f410c02252a0fd3feb18f09bDerek Sollenberger PostStmt ps = cast<PostStmt>(progPoint); 9187b8e645865f9633f410c02252a0fd3feb18f09bDerek Sollenberger if (ps.getTag()) 9287b8e645865f9633f410c02252a0fd3feb18f09bDerek Sollenberger return false; 9387b8e645865f9633f410c02252a0fd3feb18f09bDerek Sollenberger 9487b8e645865f9633f410c02252a0fd3feb18f09bDerek Sollenberger if (isa<BinaryOperator>(ps.getStmt())) 9587b8e645865f9633f410c02252a0fd3feb18f09bDerek Sollenberger return false; 9687b8e645865f9633f410c02252a0fd3feb18f09bDerek Sollenberger 9740528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger // Conditions 5, 6, and 7. 9840528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger ProgramStateRef state = node->getState(); 9940528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger ProgramStateRef pred_state = pred->getState(); 10040528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger if (state->store != pred_state->store || state->GDM != pred_state->GDM || 1011cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger progPoint.getLocationContext() != pred->getLocationContext()) 10240528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger return false; 10340528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger 1041cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger // Condition 8. 1051cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger if (const Expr *Ex = dyn_cast<Expr>(ps.getStmt())) { 10640528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger ParentMap &PM = progPoint.getLocationContext()->getParentMap(); 1074f1dae40e24d57d647db01443b8bf2410514b8b5Derek Sollenberger if (!PM.isConsumedExpr(Ex)) 1081cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger return false; 1091cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger } 1101cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger 1111cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger return true; 11240528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger} 11340528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger 1141cab2921ab279367f8206cdadc9259d12e603548Derek Sollenbergervoid ExplodedGraph::collectNode(ExplodedNode *node) { 1151cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger // Removing a node means: 1161cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger // (a) changing the predecessors successor to the successor of this node 1171cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger // (b) changing the successors predecessor to the predecessor of this node 1181cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger // (c) Putting 'node' onto freeNodes. 1191cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger assert(node->pred_size() == 1 || node->succ_size() == 1); 1201cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger ExplodedNode *pred = *(node->pred_begin()); 1211cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger ExplodedNode *succ = *(node->succ_begin()); 1221cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger pred->replaceSuccessor(succ); 1231cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger succ->replacePredecessor(pred); 12440528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger FreeNodes.push_back(node); 1251cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger Nodes.RemoveNode(node); 1261cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger --NumNodes; 1271cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger node->~ExplodedNode(); 1281cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger} 1291cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger 1301cab2921ab279367f8206cdadc9259d12e603548Derek Sollenbergervoid ExplodedGraph::reclaimRecentlyAllocatedNodes() { 1311cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger if (ChangedNodes.empty()) 1321cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger return; 1331cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger 1341cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger // Only periodically relcaim nodes so that we can build up a set of 1351cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger // nodes that meet the reclamation criteria. Freshly created nodes 1361cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger // by definition have no successor, and thus cannot be reclaimed (see below). 1371cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger assert(reclaimCounter > 0); 1381cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger if (--reclaimCounter != 0) 1391cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger return; 1401cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger reclaimCounter = CounterTop; 1411cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger 1421cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger for (NodeVector::iterator it = ChangedNodes.begin(), et = ChangedNodes.end(); 1431cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger it != et; ++it) { 1441cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger ExplodedNode *node = *it; 1451cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger if (shouldCollect(node)) 1461cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger collectNode(node); 14740528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger } 1481cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger ChangedNodes.clear(); 1491cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger} 1501cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger 1511cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger//===----------------------------------------------------------------------===// 1521cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger// ExplodedNode. 1531cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger//===----------------------------------------------------------------------===// 1541cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger 1551cab2921ab279367f8206cdadc9259d12e603548Derek Sollenbergerstatic inline BumpVector<ExplodedNode*>& getVector(void *P) { 1561cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger return *reinterpret_cast<BumpVector<ExplodedNode*>*>(P); 1571cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger} 1581cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger 1591cab2921ab279367f8206cdadc9259d12e603548Derek Sollenbergervoid ExplodedNode::addPredecessor(ExplodedNode *V, ExplodedGraph &G) { 1604f1dae40e24d57d647db01443b8bf2410514b8b5Derek Sollenberger assert (!V->isSink()); 1611cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger Preds.addNode(V, G); 1621cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger V->Succs.addNode(this, G); 1631cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger#ifndef NDEBUG 1641cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger if (NodeAuditor) NodeAuditor->AddEdge(V, this); 1651cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger#endif 1661cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger} 1671cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger 1681cab2921ab279367f8206cdadc9259d12e603548Derek Sollenbergervoid ExplodedNode::NodeGroup::replaceNode(ExplodedNode *node) { 1691cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger assert(getKind() == Size1); 1701cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger P = reinterpret_cast<uintptr_t>(node); 1711cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger assert(getKind() == Size1); 1721cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger} 1731cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger 1741cab2921ab279367f8206cdadc9259d12e603548Derek Sollenbergervoid ExplodedNode::NodeGroup::addNode(ExplodedNode *N, ExplodedGraph &G) { 1751cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger assert((reinterpret_cast<uintptr_t>(N) & Mask) == 0x0); 1761cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger assert(!getFlag()); 1771cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger 1781cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger if (getKind() == Size1) { 1791cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger if (ExplodedNode *NOld = getNode()) { 1801cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger BumpVectorContext &Ctx = G.getNodeAllocator(); 1811cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger BumpVector<ExplodedNode*> *V = 1821cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger G.getAllocator().Allocate<BumpVector<ExplodedNode*> >(); 1831cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger new (V) BumpVector<ExplodedNode*>(Ctx, 4); 1841cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger 1851cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger assert((reinterpret_cast<uintptr_t>(V) & Mask) == 0x0); 1861cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger V->push_back(NOld, Ctx); 18740528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger V->push_back(N, Ctx); 18840528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger P = reinterpret_cast<uintptr_t>(V) | SizeOther; 1891cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger assert(getPtr() == (void*) V); 1901cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger assert(getKind() == SizeOther); 1911cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger } 1921cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger else { 19340528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger P = reinterpret_cast<uintptr_t>(N); 19440528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger assert(getKind() == Size1); 19540528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger } 19640528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger } 19740528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger else { 1981cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger assert(getKind() == SizeOther); 1991cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger getVector(getPtr()).push_back(N, G.getNodeAllocator()); 2001cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger } 2011cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger} 2021cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger 2031cab2921ab279367f8206cdadc9259d12e603548Derek Sollenbergerunsigned ExplodedNode::NodeGroup::size() const { 2041cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger if (getFlag()) 2051cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger return 0; 2061cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger 2071cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger if (getKind() == Size1) 2081cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger return getNode() ? 1 : 0; 2091cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger else 21040528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger return getVector(getPtr()).size(); 2111cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger} 2121cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger 2131cab2921ab279367f8206cdadc9259d12e603548Derek SollenbergerExplodedNode **ExplodedNode::NodeGroup::begin() const { 2140910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project if (getFlag()) 2150910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project return NULL; 21620ab88413000fcc8668eeab25d9cb714097d0c45tedbo 2170910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project if (getKind() == Size1) 2180910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project return (ExplodedNode**) (getPtr() ? &P : NULL); 2190910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project else 2200910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project return const_cast<ExplodedNode**>(&*(getVector(getPtr()).begin())); 2210910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project} 2220910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 2230910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source ProjectExplodedNode** ExplodedNode::NodeGroup::end() const { 2240910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project if (getFlag()) 2250910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project return NULL; 2260910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 2270910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project if (getKind() == Size1) 2280910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project return (ExplodedNode**) (getPtr() ? &P+1 : NULL); 2290910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project else { 2300910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // Dereferencing end() is undefined behaviour. The vector is not empty, so 2310910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // we can dereference the last elem and then add 1 to the result. 2320910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project return const_cast<ExplodedNode**>(getVector(getPtr()).end()); 2330910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project } 2340910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project} 2358f7d36c67f1bdde7ca1680857936f6af951e19e2Mike Reed 2360910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source ProjectExplodedNode *ExplodedGraph::getNode(const ProgramPoint &L, 2378f7d36c67f1bdde7ca1680857936f6af951e19e2Mike Reed ProgramStateRef State, 2388f7d36c67f1bdde7ca1680857936f6af951e19e2Mike Reed bool IsSink, 2398f7d36c67f1bdde7ca1680857936f6af951e19e2Mike Reed bool* IsNew) { 2408f7d36c67f1bdde7ca1680857936f6af951e19e2Mike Reed // Profile 'State' to determine if we already have an existing node. 2410910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project llvm::FoldingSetNodeID profile; 2420910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project void *InsertPos = 0; 2430910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 2440910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project NodeTy::Profile(profile, L, State, IsSink); 2450910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project NodeTy* V = Nodes.FindNodeOrInsertPos(profile, InsertPos); 2460910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 2470910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project if (!V) { 2488f7d36c67f1bdde7ca1680857936f6af951e19e2Mike Reed if (!FreeNodes.empty()) { 24940528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger V = FreeNodes.back(); 25040528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger FreeNodes.pop_back(); 25140528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger } 25240528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger else { 2530910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // Allocate a new node. 2540910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project V = (NodeTy*) getAllocator().Allocate<NodeTy>(); 2550910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project } 2560910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 2570910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project new (V) NodeTy(L, State, IsSink); 2580910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 2590910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project if (reclaimNodes) 2600910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project ChangedNodes.push_back(V); 2610910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 2620910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // Insert the node into the node set and return it. 2630910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project Nodes.InsertNode(V, InsertPos); 2648f7d36c67f1bdde7ca1680857936f6af951e19e2Mike Reed ++NumNodes; 26540528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger 26640528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger if (IsNew) *IsNew = true; 26740528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger } 26840528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger else 2690910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project if (IsNew) *IsNew = false; 2700910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 2710910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project return V; 2720910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project} 2730910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 2740910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Projectstd::pair<ExplodedGraph*, InterExplodedGraphMap*> 2750910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source ProjectExplodedGraph::Trim(const NodeTy* const* NBeg, const NodeTy* const* NEnd, 2760910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project llvm::DenseMap<const void*, const void*> *InverseMap) const { 2778f7d36c67f1bdde7ca1680857936f6af951e19e2Mike Reed 2788f7d36c67f1bdde7ca1680857936f6af951e19e2Mike Reed if (NBeg == NEnd) 2798f7d36c67f1bdde7ca1680857936f6af951e19e2Mike Reed return std::make_pair((ExplodedGraph*) 0, 2800910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project (InterExplodedGraphMap*) 0); 2810910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 2820910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project assert (NBeg < NEnd); 2830910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 2840910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project OwningPtr<InterExplodedGraphMap> M(new InterExplodedGraphMap()); 2850910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 2860910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project ExplodedGraph* G = TrimInternal(NBeg, NEnd, M.get(), InverseMap); 2870910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 2880910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project return std::make_pair(static_cast<ExplodedGraph*>(G), M.take()); 2890910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project} 2900910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 2910910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source ProjectExplodedGraph* 2920910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source ProjectExplodedGraph::TrimInternal(const ExplodedNode* const* BeginSources, 2930910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project const ExplodedNode* const* EndSources, 2940910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project InterExplodedGraphMap* M, 2951cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger llvm::DenseMap<const void*, const void*> *InverseMap) const { 2961cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger 2971cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger typedef llvm::DenseSet<const ExplodedNode*> Pass1Ty; 2984f1dae40e24d57d647db01443b8bf2410514b8b5Derek Sollenberger Pass1Ty Pass1; 2991cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger 3000910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project typedef llvm::DenseMap<const ExplodedNode*, ExplodedNode*> Pass2Ty; 3010910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project Pass2Ty& Pass2 = M->M; 3020910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 3030910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project SmallVector<const ExplodedNode*, 10> WL1, WL2; 3040910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 3050910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // ===- Pass 1 (reverse DFS) -=== 3060910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project for (const ExplodedNode* const* I = BeginSources; I != EndSources; ++I) { 3070910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project assert(*I); 3080910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project WL1.push_back(*I); 3090910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project } 3100910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 3110910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // Process the first worklist until it is empty. Because it is a std::list 3120910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // it acts like a FIFO queue. 3130910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project while (!WL1.empty()) { 3140910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project const ExplodedNode *N = WL1.back(); 3150910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project WL1.pop_back(); 3160910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 3170910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // Have we already visited this node? If so, continue to the next one. 3180910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project if (Pass1.count(N)) 3190910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project continue; 3200910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 3210910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // Otherwise, mark this node as visited. 3220910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project Pass1.insert(N); 3230910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 3240910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // If this is a root enqueue it to the second worklist. 3250910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project if (N->Preds.empty()) { 3260910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project WL2.push_back(N); 3270910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project continue; 3280910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project } 3290910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 3300910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // Visit our predecessors and enqueue them. 3310910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project for (ExplodedNode** I=N->Preds.begin(), **E=N->Preds.end(); I!=E; ++I) 33240528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger WL1.push_back(*I); 3330910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project } 3340910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 3350910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // We didn't hit a root? Return with a null pointer for the new graph. 3360910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project if (WL2.empty()) 33740528743dbb9ce7f39f093e0cdc47849ac8887cfDerek Sollenberger return 0; 3380910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 3390910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // Create an empty graph. 3400910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project ExplodedGraph* G = MakeEmptyGraph(); 3410910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 3420910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // ===- Pass 2 (forward DFS to construct the new graph) -=== 3430910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project while (!WL2.empty()) { 3440910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project const ExplodedNode *N = WL2.back(); 3450910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project WL2.pop_back(); 3460910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 3470910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // Skip this node if we have already processed it. 3481cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger if (Pass2.find(N) != Pass2.end()) 3491cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger continue; 3500910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 3510910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // Create the corresponding node in the new graph and record the mapping 3520910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // from the old node to the new node. 3530910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project ExplodedNode *NewN = G->getNode(N->getLocation(), N->State, N->isSink(), 0); 3540910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project Pass2[N] = NewN; 3550910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 3560910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // Also record the reverse mapping from the new node to the old node. 3571cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger if (InverseMap) (*InverseMap)[NewN] = N; 3581cab2921ab279367f8206cdadc9259d12e603548Derek Sollenberger 3590910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // If this node is a root, designate it as such in the graph. 3600910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project if (N->Preds.empty()) 3610910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project G->addRoot(NewN); 3620910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 3630910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // In the case that some of the intended predecessors of NewN have already 3640910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // been created, we should hook them up as predecessors. 3650910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 3660910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // Walk through the predecessors of 'N' and hook up their corresponding 3670910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // nodes in the new graph (if any) to the freshly created node. 3680910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project for (ExplodedNode **I=N->Preds.begin(), **E=N->Preds.end(); I!=E; ++I) { 3690910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project Pass2Ty::iterator PI = Pass2.find(*I); 3700910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project if (PI == Pass2.end()) 3710910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project continue; 3720910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 3730910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project NewN->addPredecessor(PI->second, *G); 3740910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project } 3750910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 3760910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // In the case that some of the intended successors of NewN have already 3770910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // been created, we should hook them up as successors. Otherwise, enqueue 3780910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // the new nodes from the original graph that should have nodes created 3790910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // in the new graph. 3800910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project for (ExplodedNode **I=N->Succs.begin(), **E=N->Succs.end(); I!=E; ++I) { 3810910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project Pass2Ty::iterator PI = Pass2.find(*I); 3820910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project if (PI != Pass2.end()) { 3830910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project PI->second->addPredecessor(NewN, *G); 3840910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project continue; 3850910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project } 3860910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 3870910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project // Enqueue nodes to the worklist that were marked during pass 1. 3880910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project if (Pass1.count(*I)) 3890910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project WL2.push_back(*I); 3900910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project } 3910910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project } 3920910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 3930910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project return G; 3940910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project} 3950910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 3960910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Projectvoid InterExplodedGraphMap::anchor() { } 3970910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 3980910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source ProjectExplodedNode* 3990910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source ProjectInterExplodedGraphMap::getMappedNode(const ExplodedNode *N) const { 4000910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project llvm::DenseMap<const ExplodedNode*, ExplodedNode*>::const_iterator I = 4010910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project M.find(N); 4020910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 4030910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project return I == M.end() ? 0 : I->second; 4040910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project} 4050910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project 4060910916c0f7b951ee55c4b7c6358295b9bca0565The Android Open Source Project