AndersenSFR.h

Go to the documentation of this file.

//===- AndersenSFR.h -- SFR based field-sensitive Andersen's analysis-------------//
//
//                     SVF: Static Value-Flow Analysis
//
// Copyright (C) <2013-2017>  <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/>.
//
//===----------------------------------------------------------------------===//

/*
 * AndersenSFR.h
 *
 *  Created on: 09, Feb, 2019
 *      Author: Yuxiang Lei
 */

#ifndef PROJECT_ANDERSENSFR_H
#define PROJECT_ANDERSENSFR_H


#include "WPA/Andersen.h"
#include "WPA/CSC.h"

namespace SVF
{

class AndersenSCD : public Andersen
{
public:
    typedef Map<NodeID, NodeID> NodeToNodeMap;

protected:
    static AndersenSCD* scdAndersen;
    NodeSet sccCandidates;
    NodeToNodeMap pwcReps;

public:
    AndersenSCD(PAG* _pag, PTATY type = AndersenSCD_WPA) :
        Andersen(_pag,type)
    {
    }

    static AndersenSCD *createAndersenSCD(PAG* _pag)
    {
        if (scdAndersen == nullptr)
        {
            new AndersenSCD(_pag);
            scdAndersen->analyze();
            return scdAndersen;
        }
        return scdAndersen;
    }

    static void releaseAndersenSCD()
    {
        if (scdAndersen)
            delete scdAndersen;
        scdAndersen = nullptr;
    }

protected:
    inline void addSccCandidate(NodeID nodeId)
    {
        sccCandidates.insert(sccRepNode(nodeId));
    }

    virtual NodeStack& SCCDetect();
    virtual void PWCDetect();
    virtual void solveWorklist();
    virtual void handleLoadStore(ConstraintNode* node);
    virtual void processAddr(const AddrCGEdge* addr);
    virtual bool addCopyEdge(NodeID src, NodeID dst);
    virtual bool updateCallGraph(const CallSiteToFunPtrMap& callsites);
    virtual void processPWC(ConstraintNode* rep);
    virtual void handleCopyGep(ConstraintNode* node);

};



class AndersenSFR : public AndersenSCD
{
public:
    typedef Map<NodeID, NodeBS> NodeStrides;
    typedef Map<NodeID, NodeSet> FieldReps;
    typedef Map<NodeID, pair<NodeID, NodeSet>> SFRTrait;

private:
    static AndersenSFR* sfrAndersen;

    CSC* csc;
    NodeSet sfrObjNodes;
    FieldReps fieldReps;

public:
    AndersenSFR(PAG* _pag, PTATY type = AndersenSFR_WPA) :
        AndersenSCD(_pag, type), csc(nullptr)
    {
    }

    static AndersenSFR *createAndersenSFR(PAG* _pag)
    {
        if (sfrAndersen == nullptr)
        {
            new AndersenSFR(_pag);
            sfrAndersen->analyze();
            return sfrAndersen;
        }
        return sfrAndersen;
    }

    static void releaseAndersenSFR()
    {
        if (sfrAndersen)
            delete sfrAndersen;
    }

    ~AndersenSFR()
    {
        if (csc != nullptr)
        {
            delete(csc);
            csc = nullptr;
        }
    }

protected:
    void initialize();
    void PWCDetect();
    void fieldExpand(NodeSet& initials, Size_t offset, NodeBS& strides, PointsTo& expandPts);
    bool processGepPts(PointsTo& pts, const GepCGEdge* edge);
    bool mergeSrcToTgt(NodeID nodeId, NodeID newRepId);

};

} // End namespace SVF

#endif //PROJECT_ANDERSENSFR_H