priority.hpp

Go to the documentation of this file.

/*
 *
 *                   _/_/_/    _/_/   _/    _/ _/_/_/    _/_/
 *                  _/   _/ _/    _/ _/_/  _/ _/   _/ _/    _/
 *                 _/_/_/  _/_/_/_/ _/  _/_/ _/   _/ _/_/_/_/
 *                _/      _/    _/ _/    _/ _/   _/ _/    _/
 *               _/      _/    _/ _/    _/ _/_/_/  _/    _/
 *
 *             ***********************************************
 *                              PandA Project
 *                     URL: http://panda.dei.polimi.it
 *                       Politecnico di Milano - DEIB
 *                        System Architectures Group
 *             ***********************************************
 *              Copyright (C) 2004-2024 Politecnico di Milano
 *
 *   This file is part of the PandA framework.
 *
 *   The PandA framework 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/>.
 *
 */
#ifndef PRIORITY_HPP
#define PRIORITY_HPP

#include "Vertex.hpp"

#include "custom_map.hpp"
#include "refcount.hpp"

#include "op_graph.hpp"

REF_FORWARD_DECL(ASLAP);

template <class dataType>
struct priority_data
{
   virtual bool update() = 0;
   virtual dataType operator()(const vertex& _a) const
   {
      return priority_values(_a);
   }
   virtual dataType& operator[](const vertex& _a)
   {
      return priority_values[_a];
   }
   virtual ~priority_data() = default;

 private:
   vertex2obj<dataType> priority_values;
};

struct priority_static_mobility : public priority_data<int>
{
   explicit priority_static_mobility(const ASLAPRef& aslap);

   bool update() override
   {
      return false;
   }
};

struct priority_dynamic_mobility : public priority_data<int>
{
   priority_dynamic_mobility(const ASLAPRef& aslap, const OpVertexSet& _ready_nodes,
                             unsigned int _ctrl_step_multiplier);

   bool update() override;

 private:
   const OpVertexSet& ready_nodes;
   unsigned int ctrl_step_multiplier;
};

struct priority_fixed : public priority_data<int>
{
   explicit priority_fixed(const CustomUnorderedMapUnstable<vertex, int>& priority_value);

   bool update() override
   {
      return false;
   }
};

template <class Type>
struct priority_compare_functor
{
   bool operator()(const vertex& a, const vertex& b) const
   {
      return priority_values->operator()(a) < priority_values->operator()(b) ||
             (priority_values->operator()(a) == priority_values->operator()(b) && a > b);
   }

   explicit priority_compare_functor(const refcount<priority_data<Type>> pri) : priority_values(pri)
   {
   }

   priority_compare_functor& operator=(const priority_compare_functor& in)
   {
      priority_values = in.priority_values;
      return *this;
   }
   priority_compare_functor(const priority_compare_functor& in) : priority_values(in.priority_values)
   {
   }

   ~priority_compare_functor() = default;

 private:
   const refcount<priority_data<Type>> priority_values;
};

#endif