AndersenWaveDiff.cpp

Go to the documentation of this file.

//===- AndersenWaveDiff.cpp -- Wave propagation based Andersen's analysis with caching--//
//
//                     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/>.
//
//===--------------------------------------------------------------------------------===//
 
/*
 * AndersenWaveDiff.cpp
 *
 *  Created on: 23/11/2013
 *      Author: yesen
 */
 
#include "WPA/Andersen.h"
#include "MemoryModel/PointsTo.h"
#include "Util/PTAStat.h"
#include "Util/GeneralType.h"
#include "Util/SVFUtil.h"
 
using namespace SVF;
using namespace SVFUtil;
using namespace std;
 
AndersenWaveDiff* AndersenWaveDiff::diffWave = nullptr;
 
void AndersenWaveDiff::initialize()
{
    loadStoreStates.clear();
    Andersen::initialize();
    setDetectPWC(true);   // Standard wave propagation always collapses PWCs
}
 
void AndersenWaveDiff::finalize()
{
    loadStoreStates.clear();
    Andersen::finalize();
}
 
void AndersenWaveDiff::solveWorklist()
{
    // Initialize the nodeStack via a whole SCC detection
    // Nodes in nodeStack are in topological order by default.
    NodeStack& nodeStack = SCCDetect();
 
    // Process nodeStack and put the changed nodes into workList.
    while (!nodeStack.empty())
    {
        NodeID nodeId = nodeStack.top();
        nodeStack.pop();
        collapsePWCNode(nodeId);
        // process nodes in nodeStack
        processNode(nodeId);
        collapseFields();
    }
 
    // New nodes will be inserted into workList during processing.
    while (!isWorklistEmpty())
    {
        NodeID nodeId = popFromWorklist();
        // process nodes in worklist
        postProcessNode(nodeId);
    }
}
 
void AndersenWaveDiff::processNode(NodeID nodeId)
{
    // This node may be merged during collapseNodePts() which means it is no longer a rep node
    // in the graph. Only rep node needs to be handled.
    if (sccRepNode(nodeId) != nodeId)
        return;
 
    double propStart = stat->getClk();
    ConstraintNode* node = consCG->getConstraintNode(nodeId);
    handleCopyGep(node);
    double propEnd = stat->getClk();
    timeOfProcessCopyGep += (propEnd - propStart) / TIMEINTERVAL;
}
 
void AndersenWaveDiff::postProcessNode(NodeID nodeId)
{
    double insertStart = stat->getClk();
 
    ConstraintNode* node = consCG->getConstraintNode(nodeId);
    if (node->getLoadOutEdges().empty() && node->getStoreInEdges().empty())
        return;
    LoadStoreState& handled = loadStoreStates[nodeId];
    // Adding copy edges below does not change points-to sets until the next wave.
    const PointsTo& all = getPts(nodeId);
    PointsTo added = all;
    added -= handled.pts;
 
    // handle load
    for (ConstraintNode::const_iterator it = node->outgoingLoadsBegin(), eit = node->outgoingLoadsEnd();
            it != eit; ++it)
    {
        // A new destination means this load has not seen this node's old objects,
        // e.g. when the edge was moved here by an SCC merge.
        const bool isNewLoad = handled.loadDsts.test_and_set((*it)->getDstID());
        const PointsTo& objs = isNewLoad ? all : added;
        if (handleLoad(objs, *it))
            reanalyze = true;
    }
    // handle store
    for (ConstraintNode::const_iterator it = node->incomingStoresBegin(), eit =  node->incomingStoresEnd();
            it != eit; ++it)
    {
        // Likewise, a new store source needs all objects; an existing one needs
        // only the objects added since this node was last handled.
        const bool isNewStore = handled.storeSrcs.test_and_set((*it)->getSrcID());
        const PointsTo& objs = isNewStore ? all : added;
        if (handleStore(objs, *it))
            reanalyze = true;
    }
    handled.pts = all;
 
    double insertEnd = stat->getClk();
    timeOfProcessLoadStore += (insertEnd - insertStart) / TIMEINTERVAL;
}
 
bool AndersenWaveDiff::handleLoad(const PointsTo& objs, const ConstraintEdge* edge)
{
    bool changed = false;
    for (PointsTo::iterator piter = objs.begin(), epiter = objs.end();
            piter != epiter; ++piter)
    {
        if (processLoad(*piter, edge))
        {
            changed = true;
        }
    }
    return changed;
}
 
bool AndersenWaveDiff::handleStore(const PointsTo& objs, const ConstraintEdge* edge)
{
    bool changed = false;
    for (PointsTo::iterator piter = objs.begin(), epiter = objs.end();
            piter != epiter; ++piter)
    {
        if (processStore(*piter, edge))
        {
            changed = true;
        }
    }
    return changed;
}