Steensgaard.cpp

Go to the documentation of this file.

//===- Steensgaard.cpp -- Steensgaard's field-insensitive
// 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 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/>.
//
//===----------------------------------------------------------------------===//
 
/*
 * Steensgaard.cpp
 *
 *  Created on: 2 Feb. 2021
 *      Author: Yulei Sui
 */
 
#include "WPA/Steensgaard.h"
 
using namespace SVF;
using namespace SVFUtil;
 
Steensgaard* Steensgaard::steens = nullptr;
 
void Steensgaard::solveWorklist()
{
 
    processAllAddr();
 
    // Keep solving until workList is empty.
    while (!isWorklistEmpty())
    {
        NodeID nodeId = popFromWorklist();
        ConstraintNode* node = consCG->getConstraintNode(nodeId);
 
        for (NodeID o : getPts(nodeId))
        {
 
            for (ConstraintEdge* edge : node->getStoreInEdges())
            {
                ecUnion(edge->getSrcID(), o);
            }
            // r = *p : EC(r) == EC(o)
            for (ConstraintEdge* edge : node->getLoadOutEdges())
            {
                ecUnion(o, edge->getDstID());
            }
        }
 
        for (ConstraintEdge* edge : node->getCopyOutEdges())
        {
            ecUnion(edge->getSrcID(), edge->getDstID());
        }
        for (ConstraintEdge* edge : node->getGepOutEdges())
        {
            ecUnion(edge->getSrcID(), edge->getDstID());
        }
    }
}
 
void Steensgaard::setEC(NodeID node, NodeID rep)
{
    rep = getEC(rep);
    Set<NodeID>& subNodes = getSubNodes(node);
    for (NodeID sub : subNodes)
    {
        nodeToECMap[sub] = rep;
        addSubNode(rep, sub);
    }
    subNodes.clear();
}
 
void Steensgaard::ecUnion(NodeID node, NodeID ec)
{
    if (unionPts(ec, node))
        pushIntoWorklist(ec);
    setEC(node, ec);
}
 
void Steensgaard::processAllAddr()
{
    for (ConstraintGraph::const_iterator nodeIt = consCG->begin(),
            nodeEit = consCG->end();
            nodeIt != nodeEit; nodeIt++)
    {
        ConstraintNode* cgNode = nodeIt->second;
        for (ConstraintNode::const_iterator it = cgNode->incomingAddrsBegin(),
                eit = cgNode->incomingAddrsEnd();
                it != eit; ++it)
        {
            numOfProcessedAddr++;
 
            const AddrCGEdge* addr = cast<AddrCGEdge>(*it);
            NodeID dst = addr->getDstID();
            NodeID src = addr->getSrcID();
            if (addPts(dst, src))
                pushIntoWorklist(dst);
        }
    }
}