Range_Analysis.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 RANGE_ANALYSIS_HPP
#define RANGE_ANALYSIS_HPP

#include <iostream>

#include "Range.hpp"
#include "application_frontend_flow_step.hpp"
#include "tree_node.hpp"

REF_FORWARD_DECL(ConstraintGraph);

struct tree_reindexCompare
{
   bool operator()(const tree_nodeConstRef& lhs, const tree_nodeConstRef& rhs) const;
};

enum SolverType
{
   st_Cousot,
   st_Crop
};

class RangeAnalysis : public ApplicationFrontendFlowStep
{
#ifndef NDEBUG
   int graph_debug;
   uint64_t iteration;
   uint64_t stop_iteration;
   uint64_t stop_transformation;
#endif

   SolverType solverType;
   bool requireESSA;
   int execution_mode;

   bool finalize(ConstraintGraphRef);

 protected:
   CustomOrderedSet<unsigned int> fun_id_to_restart;
   std::map<unsigned int, unsigned int> last_bitvalue_ver;
   std::map<unsigned int, unsigned int> last_bb_ver;

   const CustomUnorderedSet<std::pair<FrontendFlowStepType, FunctionRelationship>>
   ComputeFrontendRelationships(const DesignFlowStep::RelationshipType relationship_type) const override;
   void ComputeRelationships(DesignFlowStepSet& relationships,
                             const DesignFlowStep::RelationshipType relationship_type) override;

 public:
   RangeAnalysis(const application_managerRef AM, const DesignFlowManagerConstRef dfm,
                 const ParameterConstRef parameters);

   ~RangeAnalysis() override;

   DesignFlowStep_Status Exec() override;

   void Initialize() override;

   bool HasToBeExecuted() const override;
};

#endif // !RANGE_ANALYSIS_HPP