svf-lib 1.0.1375 → 1.0.1377

package/SVF-linux/svf/include/include/MemoryModel/AbstractPointsToDS.h

@@ -1,316 +0,0 @@
-//===- AbstractPointsToDS.h -- Abstract points-to data structure-------------//
-//
-//                     SVF: Static Value-Flow Analysis
-//
-// Copyright (C) <2013->  <Yulei Sui>
-//
-
-// This program is free software: you can redistribute it and/or modify
-// it under the terms of the GNU General Public License as published by
-// the Free Software Foundation, either version 3 of the License, or
-// (at your option) any later version.
-
-// This program is distributed in the hope that it will be useful,
-// but WITHOUT ANY WARRANTY; without even the implied warranty of
-// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
-// GNU General Public License for more details.
-
-// You should have received a copy of the GNU General Public License
-// along with this program.  If not, see <http://www.gnu.org/licenses/>.
-//
-//===----------------------------------------------------------------------===//
-
-
-/// Contains abstract classes for:
-/// PTData: basic points-to data structure derived by all others.
-/// DiffPTData: PTData which only propagates new changes, not entire points-to sets.
-/// DFPTData: flow-sensitive PTData as defined by Hardekopf and Lin (CGO '11).
-///
-/// Hierarchy (square brackets indicate abstract class):
-///
-///       +------------> [PTData] <----------------+---------------------+
-///       |                 ^                      |                     |
-///       |                 |                      |                     |
-/// MutablePTData      [DiffPTData]            [DFPTData]         [VersionedPTData]
-///                         ^                      ^                     ^
-///                         |                      |                     |
-///                 MutableDiffPTData        MutableDFPTData    MutableVersionedPTData
-///                                                ^
-///                                                |
-///                                        MutableIncDFPTData
-
-
-/*
- * AbstractPointsToDS.h
- *
- * Authors: Mohamad Barbar and Yulei Sui
- *
- * The implementation is based on
- * Mohamad Barbar and Yulei Sui. Hash Consed Points-To Sets.
- * 28th Static Analysis Symposium (SAS'21)
- */
-
-#ifndef ABSTRACT_POINTSTO_H_
-#define ABSTRACT_POINTSTO_H_
-
-#include "SVFIR/SVFType.h"
-
-namespace SVF
-{
-/// Basic points-to data structure
-/// Given a key (variable/condition variable), return its points-to data (pts/condition pts)
-/// It is designed flexible for different context, heap and path sensitive analysis
-/// Context Insensitive			   Key --> Variable, DataSet --> PointsTo
-/// Context sensitive:  			   Key --> CondVar,  DataSet --> PointsTo
-/// Heap sensitive:     			   Key --> Variable  DataSet --> CondPointsToSet
-/// Context and heap sensitive:     Key --> CondVar,  DataSet --> CondPointsToSet
-///
-/// This class is abstract to allow for multiple methods of actually storing points-to sets.
-/// Key:     "owning" variable of a points-to set.
-/// KeySet:  collection of keys.
-/// Data:    elements in points-to sets.
-/// DataSet: the points-to set; a collection of Data.
-template <typename Key, typename KeySet, typename Data, typename DataSet>
-class PTData
-{
-public:
-    /// Types of a points-to data structures.
-    enum PTDataTy
-    {
-        Base,
-        MutBase,
-        Diff,
-        MutDiff,
-        DataFlow,
-        MutDataFlow,
-        MutIncDataFlow,
-        Versioned,
-        MutVersioned,
-        PersBase,
-        PersDiff,
-        PersDataFlow,
-        PersIncDataFlow,
-        PersVersioned,
-    };
-
-    PTData(bool reversePT = true, PTDataTy ty = PTDataTy::Base) : rev(reversePT), ptdTy(ty) { }
-
-    virtual ~PTData() { }
-
-    /// Get the type of points-to data structure that this is.
-    inline PTDataTy getPTDTY() const
-    {
-        return ptdTy;
-    }
-
-    /// Clears all points-to sets as if nothing is stored.
-    virtual void clear() = 0;
-
-    /// Get points-to set of var.
-    virtual const DataSet& getPts(const Key& var) = 0;
-    /// Get reverse points-to set of a datum.
-    virtual const KeySet& getRevPts(const Data& datum) = 0;
-
-    /// Adds element to the points-to set associated with var.
-    virtual bool addPts(const Key& var, const Data& element) = 0;
-
-    /// Performs pts(dstVar) = pts(dstVar) U pts(srcVar).
-    virtual bool unionPts(const Key& dstVar, const Key& srcVar) = 0;
-    /// Performs pts(dstVar) = pts(dstVar) U srcDataSet.
-    virtual bool unionPts(const Key& dstVar, const DataSet& srcDataSet) = 0;
-
-    /// Clears element from the points-to set of var.
-    virtual void clearPts(const Key& var, const Data& element) = 0;
-    /// Fully clears the points-to set of var.
-    virtual void clearFullPts(const Key& var) = 0;
-
-    /// Remaps all points-to sets to use the current mapping.
-    virtual void remapAllPts(void) = 0;
-
-    /// Dump stored keys and points-to sets.
-    virtual void dumpPTData() = 0;
-
-    /// Returns a mapping of points-to sets to the number of times
-    /// they are stored. liveOnly indicates whether to include only
-    /// points-to sets which correspond to a variable (matters when
-    /// dealing with non-GC persistent PT).
-    virtual Map<DataSet, unsigned> getAllPts(bool liveOnly) const = 0;
-
-protected:
-    /// Whether we maintain reverse points-to sets or not.
-    bool rev;
-    PTDataTy ptdTy;
-};
-
-/// Abstract diff points-to data with cached information.
-/// This is an optimisation on top of the base points-to data structure.
-/// The points-to information is propagated incrementally only for the different parts.
-template <typename Key, typename KeySet, typename Data, typename DataSet>
-class DiffPTData : public PTData<Key, KeySet, Data, DataSet>
-{
-public:
-    typedef PTData<Key, KeySet, Data, DataSet> BasePTData;
-    typedef typename BasePTData::PTDataTy PTDataTy;
-
-    DiffPTData(bool reversePT = true, PTDataTy ty = PTDataTy::Diff) : BasePTData(reversePT, ty) { }
-
-    virtual ~DiffPTData() { }
-
-    /// Get diff points to.
-    virtual const DataSet& getDiffPts(Key& var) = 0;
-
-    /// Compute diff points to. Return TRUE if diff is not empty.
-    /// 1. calculate diff: diff = all - propa.
-    /// 2. update propagated pts: propa = all.
-    virtual bool computeDiffPts(Key& var, const DataSet& all) = 0;
-
-    /// Update dst's propagated points-to set with src's.
-    /// The final result is the intersection of these two sets.
-    virtual void updatePropaPtsMap(Key& src, Key& dst) = 0;
-
-    /// Clear propagated points-to set of var.
-    virtual void clearPropaPts(Key& var) = 0;
-
-    /// Methods to support type inquiry through isa, cast, and dyn_cast:
-    ///@{
-    static inline bool classof(const DiffPTData<Key, KeySet, Data, DataSet> *)
-    {
-        return true;
-    }
-    static inline bool classof(const PTData<Key, KeySet, Data, DataSet>* ptd)
-    {
-        return ptd->getPTDTY() == PTDataTy::Diff
-               || ptd->getPTDTY() == PTDataTy::MutDiff
-               || ptd->getPTDTY() == PTDataTy::PersDiff;
-    }
-    ///@}
-};
-
-/// Data-flow points-to data structure for flow-sensitive analysis as defined by Hardekopf and Lin (CGO 11).
-/// Points-to information is maintained at each program point (statement).
-/// For address-taken variables, every program point has two sets: IN and OUT points-to sets.
-/// For top-level variables, points-to sets are maintained flow-insensitively via getPts(var).
-template <typename Key, typename KeySet, typename Data, typename DataSet>
-class DFPTData : public PTData<Key, KeySet, Data, DataSet>
-{
-public:
-    typedef PTData<Key, KeySet, Data, DataSet> BasePTData;
-    typedef typename BasePTData::PTDataTy PTDataTy;
-
-    typedef NodeID LocID;
-
-    /// Constructor
-    DFPTData(bool reversePT = true, PTDataTy ty = BasePTData::DataFlow) : BasePTData(reversePT, ty) { }
-
-    virtual ~DFPTData() { }
-
-    /// Determine whether the DF IN/OUT sets have points-to sets.
-    ///@{
-    virtual bool hasDFInSet(LocID loc) const = 0;
-    virtual bool hasDFOutSet(LocID loc) const = 0;
-    ///@}
-
-    /// Access points-to set from data-flow IN/OUT set.
-    ///@{
-    virtual bool hasDFOutSet(LocID loc, const Key& var) const = 0;
-    virtual bool hasDFInSet(LocID loc, const Key& var) const = 0;
-    virtual const DataSet& getDFInPtsSet(LocID loc, const Key& var) = 0;
-    virtual const DataSet& getDFOutPtsSet(LocID loc, const Key& var) = 0;
-    ///@}
-
-    /// Update points-to for IN/OUT set
-    /// IN[loc:var] represents the points-to of variable var in the IN set of location loc.
-    /// union(ptsDst, ptsSrc) represents ptsDst = ptsDst U ptsSrc.
-    ///@{
-    /// Union (IN[dstLoc:dstVar], IN[srcLoc:srcVar]).
-    virtual bool updateDFInFromIn(LocID srcLoc, const Key& srcVar, LocID dstLoc, const Key& dstVar) = 0;
-    /// Union (IN[dstLoc::dstVar], IN[srcLoc:srcVar]. There is no flag check, unlike the above.
-    virtual bool updateAllDFInFromIn(LocID srcLoc, const Key& srcVar, LocID dstLoc, const Key& dstVar) = 0;
-    /// Union (IN[dstLoc:dstVar], OUT[srcLoc:srcVar]).
-    virtual bool updateDFInFromOut(LocID srcLoc, const Key& srcVar, LocID dstLoc, const Key& dstVar) = 0;
-    /// Union (IN[dstLoc::dstVar], OUT[srcLoc:srcVar]. There is no flag check, unlike the above.
-    virtual bool updateAllDFInFromOut(LocID srcLoc, const Key& srcVar, LocID dstLoc, const Key& dstVar) = 0;
-
-    /// Union (OUT[dstLoc:dstVar], IN[srcLoc:srcVar]).
-    virtual bool updateDFOutFromIn(LocID srcLoc, const Key& srcVar, LocID dstLoc, const Key& dstVar) = 0;
-    /// For each variable var in IN at loc, do updateDFOutFromIn(loc, var, loc, var).
-    virtual bool updateAllDFOutFromIn(LocID loc, const Key& singleton, bool strongUpdates) = 0;
-
-    virtual void clearAllDFOutUpdatedVar(LocID) = 0;
-
-    /// Update points-to set of top-level pointers with IN[srcLoc:srcVar].
-    virtual bool updateTLVPts(LocID srcLoc, const Key& srcVar, const Key& dstVar) = 0;
-    /// Update address-taken variables OUT[dstLoc:dstVar] with points-to of top-level pointers
-    virtual bool updateATVPts(const Key& srcVar, LocID dstLoc, const Key& dstVar) = 0;
-    ///@}
-
-    /// Methods to support type inquiry through isa, cast, and dyn_cast:
-    ///@{
-    static inline bool classof(const DFPTData<Key, KeySet, Data, DataSet> *)
-    {
-        return true;
-    }
-
-    static inline bool classof(const PTData<Key, KeySet, Data, DataSet>* ptd)
-    {
-        return ptd->getPTDTY() == BasePTData::DataFlow
-               || ptd->getPTDTY() == BasePTData::MutDataFlow
-               || ptd->getPTDTY() == BasePTData::MutIncDataFlow
-               || ptd->getPTDTY() == BasePTData::PersDataFlow
-               || ptd->getPTDTY() == BasePTData::PersIncDataFlow;
-    }
-    ///@}
-};
-
-/// PTData with normal keys and versioned keys. Replicates the PTData interface for
-/// versioned keys too. Intended to be used for versioned flow-sensitive PTA--hence the
-/// name--but can be used anywhere where there are two types of keys at play.
-template <typename Key, typename KeySet, typename Data, typename DataSet, typename VersionedKey, typename VersionedKeySet>
-class VersionedPTData : public PTData<Key, KeySet, Data, DataSet>
-{
-public:
-    typedef PTData<Key, KeySet, Data, DataSet> BasePTData;
-    typedef typename BasePTData::PTDataTy PTDataTy;
-
-    VersionedPTData(bool reversePT = true, PTDataTy ty = PTDataTy::Versioned) : BasePTData(reversePT, ty) { }
-
-    virtual ~VersionedPTData() { }
-
-    virtual const DataSet& getPts(const VersionedKey& vk) = 0;
-    virtual const VersionedKeySet& getVersionedKeyRevPts(const Data& datum) = 0;
-
-    virtual bool addPts(const VersionedKey& vk, const Data& element) = 0;
-
-    virtual bool unionPts(const VersionedKey& dstVar, const VersionedKey& srcVar) = 0;
-    virtual bool unionPts(const VersionedKey& dstVar, const Key& srcVar) = 0;
-    virtual bool unionPts(const Key& dstVar, const VersionedKey& srcVar) = 0;
-    virtual bool unionPts(const VersionedKey& dstVar, const DataSet& srcDataSet) = 0;
-
-    virtual void clearPts(const VersionedKey& vk, const Data& element) = 0;
-    virtual void clearFullPts(const VersionedKey& vk) = 0;
-
-    /// Methods to support type inquiry through isa, cast, and dyn_cast:
-    ///@{
-    static inline bool classof(const VersionedPTData<Key, KeySet, Data, DataSet, VersionedKey, VersionedKeySet> *)
-    {
-        return true;
-    }
-
-    static inline bool classof(const PTData<Key, KeySet, Data, DataSet>* ptd)
-    {
-        return ptd->getPTDTY() == PTDataTy::Versioned
-               || ptd->getPTDTY() == PTDataTy::MutVersioned
-               || ptd->getPTDTY() == PTDataTy::PersVersioned;
-    }
-private:
-    using BasePTData::getPts;
-    using BasePTData::addPts;
-    using BasePTData::unionPts;
-    using BasePTData::clearPts;
-    using BasePTData::clearFullPts;
-    ///@}
-};
-
-} // End namespace SVF
-
-#endif  // ABSTRACT_POINTSTO_H_