ThreadCallGraph.h

Go to the documentation of this file.

//===- ThreadCallGraph.h -- Call graph considering thread fork/join-----------//
//
//                     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 Affero 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 Affero General Public License for more details.
 
// You should have received a copy of the GNU Affero General Public License
// along with this program.  If not, see <http://www.gnu.org/licenses/>.
//
//===----------------------------------------------------------------------===//
 
/*
 * ThreadCallGraph.h
 *
 *  Created on: Jul 7, 2014
 *      Authors: Peng Di, Yulei Sui, Ding Ye
 */
 
#ifndef RCG_H_
#define RCG_H_
 
#include "Graphs/CallGraph.h"
 
namespace SVF
{
 
class ThreadAPI;
class PointerAnalysis;
class ThreadForkEdge: public CallGraphEdge
{
 
public:
    ThreadForkEdge(CallGraphNode* s, CallGraphNode* d, CallSiteID csId) :
        CallGraphEdge(s, d, CallGraphEdge::TDForkEdge, csId)
    {
    }
    virtual ~ThreadForkEdge()
    {
    }
 
 
    static inline bool classof(const ThreadForkEdge*)
    {
        return true;
    }
    static inline bool classof(const CallGraphEdge*edge)
    {
        return edge->getEdgeKind() == CallGraphEdge::TDForkEdge;
    }
 
    virtual const std::string toString() const;
 
    typedef GenericNode<CallGraphNode, ThreadForkEdge>::GEdgeSetTy ForkEdgeSet;
};
 
class ThreadJoinEdge: public CallGraphEdge
{
 
public:
    ThreadJoinEdge(CallGraphNode* s, CallGraphNode* d, CallSiteID csId) :
        CallGraphEdge(s, d, CallGraphEdge::TDJoinEdge, csId)
    {
    }
    virtual ~ThreadJoinEdge()
    {
    }
 
    static inline bool classof(const ThreadJoinEdge*)
    {
        return true;
    }
    static inline bool classof(const CallGraphEdge*edge)
    {
        return edge->getEdgeKind() == CallGraphEdge::TDJoinEdge;
    }
 
    virtual const std::string toString() const;
 
    typedef GenericNode<CallGraphNode, ThreadJoinEdge>::GEdgeSetTy JoinEdgeSet;
};
 
class HareParForEdge: public CallGraphEdge
{
 
public:
    HareParForEdge(CallGraphNode* s, CallGraphNode* d, CallSiteID csId) :
        CallGraphEdge(s, d, CallGraphEdge::HareParForEdge, csId)
    {
    }
    virtual ~HareParForEdge()
    {
    }
 
 
    static inline bool classof(const HareParForEdge*)
    {
        return true;
    }
    static inline bool classof(const CallGraphEdge*edge)
    {
        return edge->getEdgeKind() == CallGraphEdge::HareParForEdge;
    }
 
    typedef GenericNode<CallGraphNode, HareParForEdge>::GEdgeSetTy ParForEdgeSet;
};
 
 
class ThreadCallGraph: public CallGraph
{
 
public:
    struct CallSiteIdCmp
    {
        bool operator()(const CallICFGNode* lhs, const CallICFGNode* rhs) const
        {
            return lhs->getId() < rhs->getId();
        }
    };
    typedef OrderedSet<const CallICFGNode*, CallSiteIdCmp> InstSet;
    typedef InstSet CallSiteSet;
    typedef Set<CallSiteSet*> CtxSet;
    typedef ThreadForkEdge::ForkEdgeSet ForkEdgeSet;
    typedef Map<const CallICFGNode*, ForkEdgeSet> CallInstToForkEdgesMap;
    typedef ThreadJoinEdge::JoinEdgeSet JoinEdgeSet;
    typedef Map<const CallICFGNode*, JoinEdgeSet> CallInstToJoinEdgesMap;
    typedef HareParForEdge::ParForEdgeSet ParForEdgeSet;
    typedef Map<const CallICFGNode*, ParForEdgeSet> CallInstToParForEdgesMap;
 
    ThreadCallGraph(const CallGraph& cg);
 
    ThreadCallGraph(ThreadCallGraph& cg) = delete;
 
    virtual ~ThreadCallGraph();
 
 
    static inline bool classof(const ThreadCallGraph *)
    {
        return true;
    }
    static inline bool classof(const CallGraph*g)
    {
        return g->getKind() == CallGraph::ThdCallGraph;
    }
 
    void updateCallGraph(PointerAnalysis* pta);
    void updateJoinEdge(PointerAnalysis* pta);
 
 
 
 
    inline bool hasThreadForkEdge(const CallICFGNode* cs) const
    {
        return callinstToThreadForkEdgesMap.find(cs) !=
               callinstToThreadForkEdgesMap.end();
    }
    inline ForkEdgeSet::const_iterator getForkEdgeBegin(const CallICFGNode* cs) const
    {
        CallInstToForkEdgesMap::const_iterator it = callinstToThreadForkEdgesMap.find(cs);
        assert(it != callinstToThreadForkEdgesMap.end() && "call instruction not found");
        return it->second.begin();
    }
    inline ForkEdgeSet::const_iterator getForkEdgeEnd(const CallICFGNode* cs) const
    {
        CallInstToForkEdgesMap::const_iterator it = callinstToThreadForkEdgesMap.find(cs);
        assert(it != callinstToThreadForkEdgesMap.end() && "call instruction not found");
        return it->second.end();
    }
 
 
 
    inline bool hasThreadJoinEdge(const CallICFGNode* cs) const
    {
        return callinstToThreadJoinEdgesMap.find(cs) != callinstToThreadJoinEdgesMap.end();
    }
    inline JoinEdgeSet::const_iterator getJoinEdgeBegin(const CallICFGNode* cs) const
    {
        CallInstToJoinEdgesMap::const_iterator it = callinstToThreadJoinEdgesMap.find(cs);
        assert(it != callinstToThreadJoinEdgesMap.end() && "call instruction does not have a valid callee");
        return it->second.begin();
    }
    inline JoinEdgeSet::const_iterator getJoinEdgeEnd(const CallICFGNode* cs) const
    {
        CallInstToJoinEdgesMap::const_iterator it = callinstToThreadJoinEdgesMap.find(cs);
        assert(it != callinstToThreadJoinEdgesMap.end() && "call instruction does not have a valid callee");
        return it->second.end();
    }
    inline void getJoinSites(const CallGraphNode* routine, InstSet& csSet)
    {
        for(CallInstToJoinEdgesMap::const_iterator it = callinstToThreadJoinEdgesMap.begin(), eit = callinstToThreadJoinEdgesMap.end(); it!=eit; ++it)
        {
            for(JoinEdgeSet::const_iterator jit = it->second.begin(), ejit = it->second.end(); jit!=ejit; ++jit)
            {
                if((*jit)->getDstNode() == routine)
                {
                    csSet.insert(it->first);
                }
            }
        }
    }
 
    inline bool isForksite(const CallICFGNode* csInst)
    {
        return forksites.find(csInst) != forksites.end();
    }
    inline bool isJoinsite(const CallICFGNode* csInst)
    {
        return joinsites.find(csInst) != joinsites.end();
    }
    inline bool isParForSite(const CallICFGNode* csInst)
    {
        return parForSites.find(csInst) != parForSites.end();
    }
 
 
    inline CallSiteSet::const_iterator forksitesBegin() const
    {
        return forksites.begin();
    }
    inline CallSiteSet::const_iterator forksitesEnd() const
    {
        return forksites.end();
    }
 
 
    inline CallSiteSet::const_iterator joinsitesBegin() const
    {
        return joinsites.begin();
    }
    inline CallSiteSet::const_iterator joinsitesEnd() const
    {
        return joinsites.end();
    }
 
 
    inline CallSiteSet::const_iterator parForSitesBegin() const
    {
        return parForSites.begin();
    }
    inline CallSiteSet::const_iterator parForSitesEnd() const
    {
        return parForSites.end();
    }
 
 
    inline u32_t getNumOfForksite() const
    {
        return forksites.size();
    }
    inline u32_t getNumOfJoinsite() const
    {
        return joinsites.size();
    }
    inline u32_t getNumOfParForSite() const
    {
        return parForSites.size();
    }
 
    inline ThreadAPI* getThreadAPI() const
    {
        return tdAPI;
    }
 
 
    inline bool addForksite(const CallICFGNode* cs)
    {
        callinstToThreadForkEdgesMap[cs];
        return forksites.insert(cs).second;
    }
    inline bool addJoinsite(const CallICFGNode* cs)
    {
        callinstToThreadJoinEdgesMap[cs];
        return joinsites.insert(cs).second;
    }
    inline bool addParForSite(const CallICFGNode* cs)
    {
        callinstToHareParForEdgesMap[cs];
        return parForSites.insert(cs).second;
    }
 
 
    bool addDirectForkEdge(const CallICFGNode* cs);
    bool addIndirectForkEdge(const CallICFGNode* cs, const FunObjVar* callee);
 
 
    void addDirectJoinEdge(const CallICFGNode* cs,const CallSiteSet& forksite);
 
 
    inline void addThreadForkEdgeSetMap(const CallICFGNode* cs, ThreadForkEdge* edge)
    {
        if(edge!=nullptr)
        {
            callinstToThreadForkEdgesMap[cs].insert(edge);
            callinstToCallGraphEdgesMap[cs].insert(edge);
        }
    }
 
    inline void addThreadJoinEdgeSetMap(const CallICFGNode* cs, ThreadJoinEdge* edge)
    {
        if(edge!=nullptr)
        {
            callinstToThreadJoinEdgesMap[cs].insert(edge);
            callinstToCallGraphEdgesMap[cs].insert(edge);
        }
    }
 
    inline void addHareParForEdgeSetMap(const CallICFGNode* cs, HareParForEdge* edge)
    {
        if(edge!=nullptr)
        {
            callinstToHareParForEdgesMap[cs].insert(edge);
            callinstToCallGraphEdgesMap[cs].insert(edge);
        }
    }
 
    inline ThreadJoinEdge* hasThreadJoinEdge(const CallICFGNode* call, CallGraphNode* joinFunNode, CallGraphNode* threadRoutineFunNode, CallSiteID csId) const
    {
        ThreadJoinEdge joinEdge(joinFunNode,threadRoutineFunNode, csId);
        CallInstToJoinEdgesMap::const_iterator it = callinstToThreadJoinEdgesMap.find(call);
        if(it != callinstToThreadJoinEdgesMap.end())
        {
            JoinEdgeSet::const_iterator jit = it->second.find(&joinEdge);
            if(jit!=it->second.end())
                return *jit;
        }
        return nullptr;
    }
 
private:
    ThreadAPI* tdAPI;       
    CallSiteSet forksites; 
    CallSiteSet joinsites; 
    CallSiteSet parForSites; 
    CallInstToForkEdgesMap callinstToThreadForkEdgesMap; 
    CallInstToJoinEdgesMap callinstToThreadJoinEdgesMap; 
    CallInstToParForEdgesMap callinstToHareParForEdgesMap; 
};
 
} // End namespace SVF
 
#endif /* RCG_H_ */