CSE.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 CSE_HPP
#define CSE_HPP

#include "function_frontend_flow_step.hpp"

#include "custom_map.hpp"
#include <boost/tuple/tuple.hpp>

#include "tree_common.hpp"

#include "refcount.hpp"
REF_FORWARD_DECL(CSE);
REF_FORWARD_DECL(tree_node);
REF_FORWARD_DECL(Schedule);
REF_FORWARD_DECL(tree_manager);
class gimple_assign;
class statement_list;

#if NO_ABSEIL_HASH

namespace std
{
   template <>
   struct hash<enum kind> : public unary_function<enum kind, size_t>
   {
      size_t operator()(enum kind t) const
      {
         hash<int> hasher;
         return hasher(static_cast<int>(t));
      }
   };
} // namespace std
#endif

class CSE : public FunctionFrontendFlowStep
{
 private:
   ScheduleRef schedule;

   const tree_managerRef TM;

   bool restart_phi_opt;

   const CustomUnorderedSet<std::pair<FrontendFlowStepType, FunctionRelationship>>
   ComputeFrontendRelationships(const DesignFlowStep::RelationshipType relationship_type) const override;

   using CSE_tuple_key_type = std::pair<enum kind, std::vector<unsigned int>>;

   tree_nodeRef
   hash_check(const tree_nodeRef& tn, vertex bb, const statement_list* sl,
              std::map<vertex, CustomUnorderedMapStable<CSE_tuple_key_type, tree_nodeRef>>& unique_table) const;

   bool has_memory_access(const gimple_assign* ga) const;

 public:
   CSE(const ParameterConstRef _parameters, const application_managerRef _AppM, unsigned int function_id,
       const DesignFlowManagerConstRef design_flow_manager);

   ~CSE() override;
   DesignFlowStep_Status InternalExec() override;

   void Initialize() override;
};

#endif /* CSE_HPP */