PDG.cs

Go to the documentation of this file.

// TraceLab Component Library
// Copyright © 2012-2013 SEMERU
//
// 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/>.

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using TraceLabSDK;

namespace TraceLab.Components.Types.Preprocessors.ExecutionTraces
{
    [Serializable]
    [WorkspaceType]
    public class PDG
    {
        #region Static utilities

        public static PDG Convert(BiGramCollection bigrams)
        {
            PDG pdg = new PDG();
            
            foreach (BiGram bigram in bigrams)
            {
                if (!pdg._nodes.ContainsKey(bigram.Caller))
                {
                    pdg.Add(new PDGNode(bigram.Caller));
                }
                pdg._nodes[bigram.Caller].AddChild(bigram.Callee);
                if (!pdg._nodes.ContainsKey(bigram.Callee))
                    pdg.Add(new PDGNode(bigram.Callee));
            }

            return pdg;
        }

        public static PDG DeepCopy(PDG pdg)
        {
            PDG pdgCopy = new PDG();
            pdgCopy._nodes = new SerializableDictionary<string,PDGNode>();
            foreach (KeyValuePair<string, PDGNode> kvpNode in pdg._nodes)
            {
                PDGNode nodeCopy = new PDGNode(kvpNode.Value.MethodName);
                foreach (PDGEdge edge in kvpNode.Value.OutgoingEdges)
                {
                    nodeCopy.SetEdgeWeight(edge.OutgoingNodeID, edge.Weight);
                }
                pdgCopy.Add(nodeCopy);
            }
            return pdgCopy;
        }

        #endregion

        private SerializableDictionary<string, PDGNode> _nodes;
        private List<string> _mapping;
        private SerializableDictionary<string, int> _indexes;

        public IEnumerable<PDGNode> Nodes
        {
            get
            {
                return _nodes.Values;
            }
        }

        public PDG()
        {
            _nodes = new SerializableDictionary<string, PDGNode>();
            _mapping = new List<string>();
            _indexes = new SerializableDictionary<string, int>();
        }

        public void Add(PDGNode pdgNode)
        {
            _nodes.Add(pdgNode.MethodName, pdgNode);
            _mapping.Add(pdgNode.MethodName);
            _indexes.Add(pdgNode.MethodName, _mapping.Count - 1);
        }

        public PDGNode GetNode(string node)
        {
            PDGNode pdgNode;
            _nodes.TryGetValue(node, out pdgNode);
            return pdgNode;
        }

        public PDGNode GetNode(int index)
        {
            return _nodes[_mapping[index]];
        }

        public int IndexOf(string nodeID)
        {
            if (!_indexes.ContainsKey(nodeID))
            {
                return -2;
            }
            return _indexes[nodeID];
        }

        public string Print()
        {
            StringBuilder sb = new StringBuilder("===PDG BEGIN===");
            sb.AppendLine();
            foreach (PDGNode node in Nodes)
            {
                sb.AppendLine(node.ToString());
            }
            sb.AppendLine("===PDG END===");
            return sb.ToString();
        }
    }
}