tree_nodes_merger.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 TREE_NODES_MERGER_HPP
#define TREE_NODES_MERGER_HPP

#include "custom_map.hpp"
#include "custom_set.hpp"
#include "refcount.hpp"
#include "tree_node.hpp"
#include "tree_node_mask.hpp"
#include <boost/preprocessor/facilities/empty.hpp>
#include <boost/preprocessor/seq/for_each.hpp>

REF_FORWARD_DECL(tree_node_reached);
REF_FORWARD_DECL(tree_node);
REF_FORWARD_DECL(bloc);

struct tree_node_reached : public tree_node_mask
{
   tree_node_reached(CustomUnorderedMapUnstable<unsigned int, unsigned int>& _remap,
                     OrderedSetStd<unsigned int>& _not_yet_remapped, const tree_managerRef _TM)
       : remap(_remap), TM(_TM), not_yet_remapped(_not_yet_remapped)
   {
   }
   BOOST_PP_SEQ_FOR_EACH(OPERATOR_MACRO_DECL, BOOST_PP_EMPTY, OBJ_SPECIALIZED_SEQ)
   BOOST_PP_SEQ_FOR_EACH(OPERATOR_MACRO, BOOST_PP_EMPTY, OBJ_NOT_SPECIALIZED_SEQ)

 private:
   CustomUnorderedMapUnstable<unsigned int, unsigned int>& remap;
   const tree_managerRef TM;
   OrderedSetStd<unsigned int>& not_yet_remapped;
};

struct tree_node_index_factory : public tree_node_mask
{
   tree_node_index_factory(CustomUnorderedMapUnstable<unsigned int, unsigned int>& _remap, const tree_managerRef _TM)
       : remap(_remap), TM(_TM), curr_tree_node_ptr(nullptr), curr_bloc(nullptr)
   {
   }
   BOOST_PP_SEQ_FOR_EACH(OPERATOR_MACRO_DECL, BOOST_PP_EMPTY, OBJ_SPECIALIZED_SEQ)
   BOOST_PP_SEQ_FOR_EACH(OPERATOR_MACRO, BOOST_PP_EMPTY, OBJ_NOT_SPECIALIZED_SEQ)

   
   void create_tree_node(const unsigned int node_id, const tree_nodeRef& tn);

 private:
   CustomUnorderedMapUnstable<unsigned int, unsigned int>& remap;

   const tree_managerRef TM;

   tree_node* curr_tree_node_ptr;
   bloc* curr_bloc;
   tree_nodeRef source_tn;
   blocRef source_bloc;
};

#endif