bit_lattice.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_LATTICE_HPP_
#define _BIT_LATTICE_HPP_

#include <string>

#include "custom_map.hpp"
#include "custom_set.hpp"
#include <deque>

#include "panda_types.hpp"
#include "refcount.hpp"

CONSTREF_FORWARD_DECL(Parameter);
CONSTREF_FORWARD_DECL(tree_manager);
REF_FORWARD_DECL(tree_node);
CONSTREF_FORWARD_DECL(tree_node);

enum class bit_lattice
{
   U,
   ZERO,
   ONE,
   X
};

class BitLatticeManipulator
{
 protected:
   const tree_managerConstRef TM;

   CustomMap<unsigned int, std::deque<bit_lattice>> current;

   CustomMap<unsigned int, std::deque<bit_lattice>> best;

   CustomSet<unsigned int> signed_var;

   const int bl_debug_level;

   bool IsSignedIntegerType(const tree_nodeConstRef& tn) const;

   std::deque<bit_lattice> sup(const std::deque<bit_lattice>& a, const std::deque<bit_lattice>& b,
                               const unsigned int output_uid) const;

   std::deque<bit_lattice> sup(const std::deque<bit_lattice>& a, const std::deque<bit_lattice>& b,
                               const tree_nodeConstRef& out_node) const;

   std::deque<bit_lattice> inf(const std::deque<bit_lattice>& a, const std::deque<bit_lattice>& b,
                               const unsigned int output_uid) const;

   std::deque<bit_lattice> inf(const std::deque<bit_lattice>& a, const std::deque<bit_lattice>& b,
                               const tree_nodeConstRef& out_node) const;

   std::deque<bit_lattice> constructor_bitstring(const tree_nodeRef& ctor_tn, unsigned int ssa_node_id) const;

   std::deque<bit_lattice> string_cst_bitstring(const tree_nodeRef& strcst_tn, unsigned int ssa_node_id) const;

   bool IsHandledByBitvalue(const tree_nodeConstRef& tn) const;

   bool mix();

   bool update_current(std::deque<bit_lattice>& res, const tree_nodeConstRef& tn);

   void clear();

 public:
   explicit BitLatticeManipulator(const tree_managerConstRef TM, const int debug_level);

   ~BitLatticeManipulator();

   static std::deque<bit_lattice> sign_extend_bitstring(const std::deque<bit_lattice>& bitstring,
                                                        bool bitstring_is_signed, size_t final_size);

   static void sign_reduce_bitstring(std::deque<bit_lattice>& bitstring, bool bitstring_is_signed);

   static bit_lattice bit_sup(const bit_lattice a, const bit_lattice b);

   static bit_lattice bit_inf(const bit_lattice a, const bit_lattice b);

   static std::deque<bit_lattice> sup(const std::deque<bit_lattice>& a, const std::deque<bit_lattice>& b,
                                      const size_t out_type_size, const bool out_is_signed, const bool out_is_bool);

   static std::deque<bit_lattice> inf(const std::deque<bit_lattice>& a, const std::deque<bit_lattice>& b,
                                      const size_t out_type_size, const bool out_is_signed, const bool out_is_bool);

   static unsigned long long Size(const tree_nodeConstRef& t);

   static unsigned long long size(const tree_managerConstRef tm, unsigned int index);

   static bool isBetter(const std::string& a_string, const std::string& b_string);
};

std::deque<bit_lattice> create_u_bitstring(size_t lenght);

std::deque<bit_lattice> create_x_bitstring(size_t lenght);

std::deque<bit_lattice> create_bitstring_from_constant(integer_cst_t value_int, unsigned long long length,
                                                       bool signed_value);

std::string bitstring_to_string(const std::deque<bit_lattice>& bitstring);

std::deque<bit_lattice> string_to_bitstring(const std::string& s);

bool bitstring_constant(const std::deque<bit_lattice>& a);
#endif