CollisionMatrix.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 CollisionMatrix.cc
 *
 * Definition of CollisionMatrix class.
 *
 * Matrix' value is 1 if and only if the operation represented by the row
 * cannot be started after the cycle number represented by the column number.
 * That is, M[O,I] = 1 in case operation O cannot be started I cycles after, 0 
 * otherwise.
 *
 * @author Pekka Jääskeläinen 2006 (pekka.jaaskelainen-no.spam-tut.fi)
 * @note rating: red
 */
 
#include "CollisionMatrix.hh"
#include "Application.hh"
#include "FunctionUnit.hh"
#include "PipelineElement.hh"
#include "FUPort.hh"
#include "HWOperation.hh"
#include "Conversion.hh"
#include "ResourceVector.hh"
#include "ResourceVectorSet.hh"
#include "ReservationTable.hh"
#include "FUReservationTableIndex.hh"
 
/**
 * Builds a collision matrix out of a set of reservation tables and an index
 * that points to a row in the index. 
 *
 * The first column is included, that is, it is possible to test whether 
 * an operation can be issued at the same cycle than other operation. This 
 * is useful for the scheduler.
 *
 * @param reservationTables Reservation tables of all operations in the FU.
 * @param index Index of reservation table we compute the matrix for.
 *
 */
CollisionMatrix::CollisionMatrix(
    FUReservationTableIndex& reservationTables, 
    std::size_t index) : 
    BitMatrix(
        reservationTables.at(index).columnCount(), 
        reservationTables.size(), false) {
 
    ReservationTable& thisOperation = reservationTables.at(index);
    
    for (int row = 0; row < rowCount(); ++row) {
        const ReservationTable& other = reservationTables.at(row);
 
        for (int column = 0; column < columnCount(); ++column) {
            BitMatrix::setBit(
                column, row, thisOperation.conflictsWith(other, column));
        }
    }
}
 
/**
 * Constructor.
 *
 * Builds a collision matrix with given dimensions and with each value the
 * same.
 */
CollisionMatrix::CollisionMatrix(
    std::size_t width, std::size_t height, bool value = false) :
    BitMatrix(width, height, value) {
}
 
/**
 * Destructor.
 */
CollisionMatrix::~CollisionMatrix() {
}
 
/**
 * Returns the value of the collision matrix at the given location.
 *
 * @param row The row number (operation).
 * @param column The column number (cycle).
 * @return The value.
 */
bool 
CollisionMatrix::isCollision(std::size_t row, std::size_t column) const {
    return BitMatrix::bitAt(column, row);
}