tree_basic_block.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_BASIC_BLOCK_HPP
#define TREE_BASIC_BLOCK_HPP

#include "custom_set.hpp"
#include "refcount.hpp"
#include <cstddef> // for size_t
#include <list>
#include <vector>

REF_FORWARD_DECL(bloc);
REF_FORWARD_DECL(Schedule);
REF_FORWARD_DECL(tree_node);
REF_FORWARD_DECL(application_manager);
class tree_node_visitor;
class gimple_assign;


#define GETID(field) field##_ID

#define BB_ENTRY 0

#define BB_EXIT 1

struct bloc
{
 private:
   friend class use_counting;

   CustomUnorderedSet<unsigned int> already_visited;

   std::list<tree_nodeRef> list_of_phi;

   std::list<tree_nodeRef> list_of_stmt;

   size_t removed_phi;

   bool updated_ssa_uses;

   void update_new_stmt(const application_managerRef& AppM, const tree_nodeRef& new_stmt);
   void manageCallGraph(const application_managerRef& AppM, const tree_nodeRef& statement);
   bool check_function_call(const tree_nodeRef& statement, gimple_assign* ga, unsigned int& called_function_id);

 public:
   std::vector<unsigned int> list_of_pred;

   std::vector<unsigned int> list_of_succ;

   const unsigned int number;

   unsigned int loop_id;

   CustomOrderedSet<unsigned int> live_in;

   CustomOrderedSet<unsigned int> live_out;

   // std::map<unsigned int, unsigned int> live_out_phi_defs;

   unsigned int hpl;

   unsigned int true_edge;

   unsigned int false_edge;

   ScheduleRef schedule;

   explicit bloc(unsigned int _number);

   virtual ~bloc();

   void add_pred(const unsigned int& a)
   {
      list_of_pred.push_back(a);
   }

   void add_succ(const unsigned int& a)
   {
      list_of_succ.push_back(a);
   }
   void AddPhi(const tree_nodeRef phi);

   void PushFront(const tree_nodeRef statement, const application_managerRef AppM);

   void PushBack(const tree_nodeRef statement, const application_managerRef AppM);

   void Replace(const tree_nodeRef old_stmt, const tree_nodeRef new_stmt, const bool move_virtuals,
                const application_managerRef AppM);

   void PushBefore(const tree_nodeRef new_stmt, const tree_nodeRef existing_stmt, const application_managerRef AppM);

   void PushAfter(const tree_nodeRef new_stmt, const tree_nodeRef existing_stmt, const application_managerRef AppM);

   void ReorderLUTs();

   void RemoveStmt(const tree_nodeRef statement, const application_managerRef AppM);

   void RemovePhi(const tree_nodeRef phi);

   void SetSSAUsesComputed();

   const std::list<tree_nodeRef>& CGetPhiList() const;

   const std::list<tree_nodeRef>& CGetStmtList() const;

   size_t CGetNumberRemovedPhi() const;

   static const unsigned int ENTRY_BLOCK_ID;

   static const unsigned int EXIT_BLOCK_ID;

   virtual void visit(tree_node_visitor* const v) const;

   enum
   {
      GETID(list_of_phi) = 0,
      GETID(list_of_stmt)
   };
};

#endif