Bit_Value.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 BIT_VALUE_HPP
#define BIT_VALUE_HPP

#include "bit_lattice.hpp"
#include "function_frontend_flow_step.hpp"

#include "refcount.hpp"
REF_FORWARD_DECL(Bit_Value);
REF_FORWARD_DECL(bloc);
class binary_expr;
enum class bit_lattice;
class gimple_assign;
class ssa_name;
class statement_list;
class addr_expr;
REF_FORWARD_DECL(tree_node);
CONSTREF_FORWARD_DECL(tree_node);
REF_FORWARD_DECL(tree_manager);

class Bit_Value : public FunctionFrontendFlowStep, public BitLatticeManipulator
{
 private:
   static const std::map<bit_lattice, std::map<bit_lattice, std::map<bit_lattice, std::deque<bit_lattice>>>>
       plus_expr_map;

   static const std::map<bit_lattice, std::map<bit_lattice, std::map<bit_lattice, std::deque<bit_lattice>>>>
       minus_expr_map;

   static const std::map<bit_lattice, std::map<bit_lattice, bit_lattice>> bit_ior_expr_map;

   static const std::map<bit_lattice, std::map<bit_lattice, bit_lattice>> bit_xor_expr_map;

   static const std::map<bit_lattice, std::map<bit_lattice, bit_lattice>> bit_and_expr_map;

   bool not_frontend;

   std::vector<blocRef> bb_topological;

   CustomUnorderedMapUnstable<unsigned int, unsigned int> direct_call_id_to_called_id;

   CustomUnorderedSet<unsigned int> arguments;

   void print_bitstring_map(const CustomMap<unsigned int, std::deque<bit_lattice>>& map) const;

   unsigned long long pointer_resizing(unsigned int output_id) const;

   unsigned int lsb_to_zero(const addr_expr* ae, bool safe) const;

   void initialize();

   void clear_current();

   void forward();

   void backward();

   std::deque<bit_lattice> forward_transfer(const gimple_assign* ga) const;

   std::deque<bit_lattice> backward_transfer(const gimple_assign* ga, unsigned int output_id) const;

   std::deque<bit_lattice> backward_chain(const tree_nodeConstRef& ssa) const;

   bool update_IR();

   std::deque<bit_lattice> get_current(const tree_nodeConstRef& tn) const;

   std::deque<bit_lattice> get_current_or_best(const tree_nodeConstRef& tn) const;

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

 public:
   Bit_Value(const ParameterConstRef Param, const application_managerRef AM, unsigned int f_id,
             const DesignFlowManagerConstRef dfm);

   ~Bit_Value() override;
   DesignFlowStep_Status InternalExec() override;

   void Initialize() override;

   bool HasToBeExecuted() const override;
};

#endif /* BIT_VALUE_HPP */