short_circuit_taf.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 SHORT_CIRCUIT_TAF_HPP
#define SHORT_CIRCUIT_TAF_HPP

#include "function_frontend_flow_step.hpp"

#include "refcount.hpp"
REF_FORWARD_DECL(tree_manager);
REF_FORWARD_DECL(tree_node);
REF_FORWARD_DECL(bloc);
class statement_list;

#include <deque>
#include <list>
#include <string>

#include "custom_map.hpp"
#include "custom_set.hpp"

class short_circuit_taf : public FunctionFrontendFlowStep
{
 private:
   bool check_merging_candidate(unsigned int& bb1, unsigned int& bb2, unsigned int merging_candidate, bool& bb1_true,
                                bool& bb2_true, const std::map<unsigned int, blocRef>& list_of_bloc);

   bool create_gimple_cond(unsigned int bb1, unsigned int bb2, bool bb1_true,
                           const std::map<unsigned int, blocRef>& list_of_bloc, bool or_type,
                           unsigned int merging_candidate);

   void restructure_CFG(unsigned int bb1, unsigned int bb2, unsigned int merging_candidate,
                        std::map<unsigned int, blocRef>& list_of_bloc);

   bool check_phis(unsigned int curr_bb, const std::map<unsigned int, blocRef>& list_of_bloc);

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

 public:
   short_circuit_taf(const ParameterConstRef _Param, const application_managerRef _AppM, unsigned int function_id,
                     const DesignFlowManagerConstRef design_flow_manager);

   ~short_circuit_taf() override;

   DesignFlowStep_Status InternalExec() override;

   void Initialize() override;

   bool HasToBeExecuted() const override;
};
#endif