svf-tools 1.0.1202 → 1.0.1204

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "svf-tools",
-  "version": "1.0.1202",
+  "version": "1.0.1204",
   "description": "* <b>[TypeClone](https://github.com/SVF-tools/SVF/wiki/TypeClone) published in our [ECOOP paper](https://yuleisui.github.io/publications/ecoop20.pdf) is now available in SVF </b> * <b>SVF now uses a single script for its build. Just type [`source ./build.sh`](https://github.com/SVF-tools/SVF/blob/master/build.sh) in your terminal, that's it!</b> * <b>SVF now supports LLVM-10.0.0! </b> * <b>We thank [bsauce](https://github.com/bsauce) for writing a user manual of SVF ([link1](https://www.jianshu.com/p/068a08ec749c) and [link2](https://www.jianshu.com/p/777c30d4240e)) in Chinese </b> * <b>SVF now supports LLVM-9.0.0 (Thank [Byoungyoung Lee](https://github.com/SVF-tools/SVF/issues/142) for his help!). </b> * <b>SVF now supports a set of [field-sensitive pointer analyses](https://yuleisui.github.io/publications/sas2019a.pdf). </b> * <b>[Use SVF as an external lib](https://github.com/SVF-tools/SVF/wiki/Using-SVF-as-a-lib-in-your-own-tool) for your own project (Contributed by [Hongxu Chen](https://github.com/HongxuChen)). </b> * <b>SVF now supports LLVM-7.0.0. </b> * <b>SVF now supports Docker. [Try SVF in Docker](https://github.com/SVF-tools/SVF/wiki/Try-SVF-in-Docker)! </b> * <b>SVF now supports [LLVM-6.0.0](https://github.com/svf-tools/SVF/pull/38) (Contributed by [Jack Anthony](https://github.com/jackanth)). </b> * <b>SVF now supports [LLVM-4.0.0](https://github.com/svf-tools/SVF/pull/23) (Contributed by Jared Carlson. Thank [Jared](https://github.com/jcarlson23) and [Will](https://github.com/dtzWill) for their in-depth [discussions](https://github.com/svf-tools/SVF/pull/18) about updating SVF!) </b> * <b>SVF now supports analysis for C++ programs.</b> <br />",
   "main": "index.js",
   "scripts": {

package/svf/include/Graphs/SVFG.h

@@ -179,6 +179,22 @@ public:
         return hasDef(pagNode) && hasSVFGNode(getDef(pagNode));
     }
 
+    /// Given a ValVar and its SVFGNode, find the definition-site ICFGNode
+    /// by following incoming direct VFGEdges (asserts unique definition)
+    const ICFGNode* getDefSiteOfValVar(const ValVar* var, const SVFGNode* node) const;
+
+    /// Given an ObjVar and its SVFGNode, find the definition-site ICFGNode
+    /// by following incoming IndirectSVFGEdges whose pts contains the ObjVar (asserts unique definition)
+    const ICFGNode* getDefSiteOfObjVar(const ObjVar* obj, const SVFGNode* node) const;
+
+    /// Given a ValVar and its SVFStmt, find all use-site ICFGNodes
+    /// by following outgoing direct VFGEdges from its definition SVFGNode
+    const Set<const ICFGNode*> getUseSitesOfValVar(const ValVar* var, const SVFGNode* vNode) const;
+
+    /// Given an ObjVar and its SVFStmt, find all use-site ICFGNodes
+    /// by following outgoing IndirectSVFGEdges whose pts contains the ObjVar
+    const Set<const ICFGNode*> getUseSitesOfObjVar(const ObjVar* obj, const SVFGNode* vNode) const;
+
     /// Perform statistics
     void performStat();
 

package/svf/lib/Graphs/SVFG.cpp

@@ -760,6 +760,84 @@ void SVFG::performStat()
     stat->performStat();
 }
 
+/// Given a ValVar and its SVFGNode, find the definition-site ICFGNode
+/// by following incoming direct VFGEdges (asserts unique definition)
+const ICFGNode* SVFG::getDefSiteOfValVar(const ValVar* var, const SVFGNode* node) const
+{
+    const ICFGNode* defSite = nullptr;
+    for (auto it = node->InEdgeBegin(), eit = node->InEdgeEnd(); it != eit; ++it)
+    {
+        const VFGEdge* edge = *it;
+        if (edge->isDirectVFGEdge())
+        {
+            assert(defSite == nullptr && "ValVar should have a unique direct definition!");
+            defSite = edge->getSrcNode()->getICFGNode();
+        }
+    }
+    return defSite;
+}
+
+/// Given an ObjVar and its SVFGNode, find the definition-site ICFGNode
+/// by following incoming IndirectSVFGEdges whose pts contains the ObjVar (asserts unique definition)
+const ICFGNode* SVFG::getDefSiteOfObjVar(const ObjVar* obj, const SVFGNode* node) const
+{
+    const ICFGNode* defSite = nullptr;
+    NodeID objId = obj->getId();
+    for (auto it = node->InEdgeBegin(), eit = node->InEdgeEnd(); it != eit; ++it)
+    {
+        if (const IndirectSVFGEdge* indEdge = SVFUtil::dyn_cast<IndirectSVFGEdge>(*it))
+        {
+            if (indEdge->getPointsTo().test(objId))
+            {
+                assert(defSite == nullptr && "ObjVar should have a unique indirect definition!");
+                defSite = indEdge->getSrcNode()->getICFGNode();
+            }
+        }
+    }
+    return defSite;
+}
+
+/// Given a ValVar and its SVFStmt, find all use-site ICFGNodes
+/// by following outgoing direct VFGEdges from its definition SVFGNode
+const Set<const ICFGNode*> SVFG::getUseSitesOfValVar(const ValVar* var, const SVFGNode* node) const
+{
+    Set<const ICFGNode*> useSites;
+    for (auto it = node->OutEdgeBegin(), eit = node->OutEdgeEnd(); it != eit; ++it)
+    {
+        const VFGEdge* edge = *it;
+        if (edge->isDirectVFGEdge())
+        {
+            if (const ICFGNode* icfgNode = edge->getDstNode()->getICFGNode())
+                useSites.insert(icfgNode);
+            else
+                assert(false && "The destination node of a direct VFG edge should have an ICFG node!");
+        }
+    }
+    return useSites;
+}
+
+/// Given an ObjVar and its SVFStmt, find all use-site ICFGNodes
+/// by following outgoing IndirectSVFGEdges whose pts contains the ObjVar
+const Set<const ICFGNode*> SVFG::getUseSitesOfObjVar(const ObjVar* obj, const SVFGNode* node) const
+{
+    Set<const ICFGNode*> useSites;
+    NodeID objId = obj->getId();
+    for (auto it = node->OutEdgeBegin(), eit = node->OutEdgeEnd(); it != eit; ++it)
+    {
+        if (const IndirectSVFGEdge* indEdge = SVFUtil::dyn_cast<IndirectSVFGEdge>(*it))
+        {
+            if (indEdge->getPointsTo().test(objId))
+            {
+                if (const ICFGNode* icfgNode = indEdge->getDstNode()->getICFGNode())
+                    useSites.insert(icfgNode);
+                else
+                    assert(false && "The destination node of an indirect SVFG edge should have an ICFG node!");
+            }
+        }
+    }
+    return useSites;
+}
+
 /*!
  * GraphTraits specialization
  */