ProgramGraph.cc

Go to the documentation of this file.

/*
    Copyright (c) 2002-2009 Tampere University.
 
    This file is part of TTA-Based Codesign Environment (TCE).
 
    Permission is hereby granted, free of charge, to any person obtaining a
    copy of this software and associated documentation files (the "Software"),
    to deal in the Software without restriction, including without limitation
    the rights to use, copy, modify, merge, publish, distribute, sublicense,
    and/or sell copies of the Software, and to permit persons to whom the
    Software is furnished to do so, subject to the following conditions:
 
    The above copyright notice and this permission notice shall be included in
    all copies or substantial portions of the Software.
 
    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
    IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
    FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL
    THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
    LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
    FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
    DEALINGS IN THE SOFTWARE.
 */
/**
 * @file ProgramGraph.cc
 *
 * Implementation of ProgramGraph class.
 *
 * ProgramGraph represents a program in PDG form.
 *
 * @author Vladimir Guzma 2006 (vladimir.guzma-no.spam-tut.fi)
 * @note rating: red
 */
 
#include "ProgramGraph.hh"
#include "Port.hh"
#include "Bus.hh"
#include "UniversalMachine.hh"
#include "NullProgram.hh"
#include "ControlFlowGraph.hh"
#include "ControlDependenceGraph.hh"
#include "DataDependenceGraph.hh"
#include "DataDependenceGraphBuilder.hh"
#include "ProgramDependenceGraph.hh"
#include "SequenceTools.hh"
 
/**
 * Constructor.
 *
 * Creates a new ProgramGraph from Program
 * @param program Program in POM
 */
 
ProgramGraph::ProgramGraph(
    TTAProgram::Program& program, const TTAMachine::Machine& mach ) 
    : program_(program){
    try {
        for (int i = 0; i < program.procedureCount(); i++) {
            ControlFlowGraph* cfg = NULL;
            cfg = new ControlFlowGraph(program.procedure(i));
            cfgs_.push_back(cfg);
            ControlDependenceGraph* cdg = NULL;
            try {
                cdg = new ControlDependenceGraph(*cfg);
                cdgs_.push_back(cdg);
            } catch (const InvalidData& e) {
                delete cdg;
                continue;
            }
            DataDependenceGraphBuilder builder;
            DataDependenceGraph* ddg = NULL;
            ddg = builder.build(*cfg, DataDependenceGraph::ALL_ANTIDEPS,mach);
            ddgs_.push_back(ddg);
            ProgramDependenceGraph* pdg = NULL;
            pdg = new ProgramDependenceGraph(*cdg, *ddg);
            pdgs_.push_back(pdg);
        }
    } catch (Exception&) {
        clear();
        throw;
    }
}
 
/**
 * Deletes all graphs owned by this.
 */
void ProgramGraph::clear() {
    SequenceTools::deleteAllItems(pdgs_);
    SequenceTools::deleteAllItems(ddgs_);
    SequenceTools::deleteAllItems(cdgs_);
    SequenceTools::deleteAllItems(cfgs_);
}
 
/**
 * Destructor.
 *
 * Removes the graphs.
 */
ProgramGraph::~ProgramGraph() {
    clear();
}
 
/**
 * Convert Program Graph to Program Object Model
 * and returns POM
 * @return POM
 */
TTAProgram::Program&
ProgramGraph::generateProgram() const {
    ///TODO: convert PDG to POM
    /// this is basically scheduling
    return TTAProgram::NullProgram::instance();
}
 
/**
 * Returns MoveNode of program representation corresponding
 * to Move of POM.
 * @param move move from POM
 * @return MoveNode corresponding to move
 */
MoveNode&
ProgramGraph::nodeOf(const TTAProgram::Move&) const{
    ///TODO: find a move and return corresponding MoveNode
    return *(new MoveNode());
}
 
/**
 * Returns number of PDG's in a program graph, equals number of procedures
 * in program.
 * @return number of PDG's in a graph
 */
int
ProgramGraph::graphCount() const {
    return pdgs_.size();
}
 
/**
 * Returns a PDG for procedure identified by index.
 * @param i index of a procedure
 * @return PDG for given procedure
 */
ProgramDependenceGraph*
ProgramGraph::graphAt(int i) {
    if (i < 0 || i >= graphCount()){
        throw InvalidData(__FILE__, __LINE__, __func__, "Trying to access"
            " graph out of a scope!");
    }
    return pdgs_.at(i);
}
 
/**
 * Returns a PDG for procedure identified by procedure name.
 * @param name name of a procedure
 * @return PDG for given procedure
 */
ProgramDependenceGraph*
ProgramGraph::graph(const std::string name) {
    for (int i = 0; i < graphCount(); i++) {
        if (pdgs_.at(i)->name() == name) {
            return pdgs_.at(i);
        }
    }
    throw InvalidData(__FILE__, __LINE__, __func__, "Can not find graph of "
        "procedure " + name);
}