tree_node_dup.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_NODE_DUP_HPP
#define TREE_NODE_DUP_HPP

#include "custom_map.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);
REF_FORWARD_DECL(bloc);
REF_FORWARD_DECL(application_manager);

enum tree_node_dup_mode
{
   DEFAULT = 0,  // Nodes are duplicated
   RENAME = 1,   // SSA variables are renamed during duplication
   FUNCTION = 4, // All nodes including declarations are duplicated (first function_decl only)
   FULL = 8      // All nodes including declarations are duplicated
};

struct tree_node_dup : public tree_node_mask
{
   tree_node_dup(CustomUnorderedMapStable<unsigned int, unsigned int>& _remap, const application_managerRef _AppM,
                 unsigned int _remap_bbi = 0, unsigned int _remap_loop_id = 0, bool _use_counting = false);

   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)

   
   unsigned int create_tree_node(const tree_nodeRef& tn, int mode = tree_node_dup_mode::DEFAULT);

 private:
   CustomUnorderedMapStable<unsigned int, unsigned int>& remap;
   const bool use_counting;
   unsigned int remap_bbi;
   CustomUnorderedMapStable<unsigned int, unsigned int> remap_bb;
   unsigned int remap_loop_id;
   CustomUnorderedMapStable<unsigned int, unsigned int> remap_lid;
   const application_managerRef AppM;
   const tree_managerRef TM;
   tree_node* curr_tree_node_ptr;
   bloc* curr_bloc;
   tree_nodeRef source_tn;
   blocRef source_bloc;
   int mode;

   unsigned int get_bbi(unsigned int old_bb);

   unsigned int get_loop_id(unsigned int old_loop_id);
};

#endif