faster_utils.hpp

/**
 * PEIGEN: a Platform for Evaluation, Implementation, and Generation of S-boxes
 *
 *  Copyright 2019 by
 *    Zhenzhen Bao <baozhenzhen10[at]gmail.com>
 *    Jian Guo <guojian[at]ntu.edu.sg>
 *    San Ling <lingsan[at]ntu.edu.sg>
 *    Yu Sasaki <yu[dot]sasaki[dot]sk@hco.ntt.co.jp>
 * 
 * This platform is developed based on the open source application
 * <http://jeremy.jean.free.fr/pub/fse2018_layer_implementations.tar.gz>
 * Optimizing Implementations of Lightweight Building Blocks
 *
 *  Copyright 2017 by
 *    Jade Tourteaux <Jade[dot]Tourteaux[at]gmail.com>
 *    Jérémy Jean <Jean[dot]Jeremy[at]gmail.com>
 * 
 * We follow the same copyright policy.
 * 
 * This file is part of some open source application.
 * 
 * Some open source application 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.
 * 
 * Some open source application 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 Foobar.  If not, see <http://www.gnu.org/licenses/>.
 *
 * @license GPL-3.0+ <http://spdx.org/licenses/GPL-3.0+>
 */

#ifndef FASTER_UTILS_H
#define FASTER_UTILS_H

using namespace Peigen::depth;
using namespace std;

template<int N>
void faster<N>::print_graphe_info()
{
  int tot_f1 = 0;

  cout << "\n\033[0;31mf1_succ : \033[0m";

  auto it = f1_succ.begin();

  while (it != f1_succ.end())
  {
    cout << (*it).first << " (" << (*it).second.size() << ") ";
    tot_f1 += ((*it).second.size());
    it++;
  }
  cout << "\n\033[1;33mTotal = " << tot_f1;
}

template<int N>
void faster<N>::exit_m()
{
  if(write_in_file)
  {
    graphe_to_file(&f1_succ, "f1");
  }
  //system("notify-send 'EXIT'");
  //exit(0);
}

template<int N>
void faster<N>::graphe_to_file(map<int, set<bool_function_t<N> > > *graphe,
                    string graphe_name)
{
  string name;
  int tot_number = 0;
  /*
    Generating file_info
  */
  ofstream file_info(graphe_name + "_infos.txt");
  file_info << "Number of lists in graph : "
            << graphe->size()
            << endl;
  auto it_graphe = graphe->begin();
  while(it_graphe != graphe->end())
  {
    if((*it_graphe).second.size() != 0)
    {
      tot_number += (*it_graphe).second.size();
      file_info << "Number of nodes in list "
              << (*it_graphe).first
              << " : "
              <<  (*it_graphe).second.size()
              << endl;
    }
    if((*it_graphe).second.size() != 0)
    {
      name = graphe_name
            + string("_list_")
            + to_string((*it_graphe).first)
            + string(".txt");

      ofstream file_list(name);
      /*
        Generating *_list_n.txt
      */
      if(file_list.is_open())
      {
        auto it_curr = (*it_graphe).second.begin();
        while(it_curr != (*it_graphe).second.end())
        {
          file_list << (*it_curr).to_string()<<endl;
          it_curr++;
        }
      }
      file_list.close();
    }
    it_graphe++;
  }
  file_info << "Total number of nodes in graphe : "
            << to_string(tot_number)
            << endl;
  file_info.close();
}

template<int N>
void faster<N>::print_uint16(uint16_t n){
  int i = 16;
  while(i != 0)
  {
    printf("%c", (n & 0x8000) == 0 ? '0' : '1');
    n <<= 1;
    i--;
  }
  printf("\n");
}

template<int N>
void faster<N>::print_uint8(uint8_t n){
  int i = 8;
  while(i != 0)
  {
    printf("%c", (n & 0x80) == 0 ? '0' : '1');
    n <<= 1;
    i--;
  }
  printf("\n");
}

template<int N>
string faster<N>::uint8_to_string(uint8_t n)
{
  string s;
  int i = 8;
  while(i != 0)
  {
    (n & 0x80) == 0 ? s+='0' : s+='1';
    n <<= 1;
    i--;
  }
  return s;
}

template<int N>
void faster<N>::print_uint32(uint32_t n){
  int i = 32;
  while(i != 0)
  {
    printf("%c", (n & 0x80000000) == 0 ? '0' : '1');
    n <<= 1;
    i--;
  }
  printf("\n");
}

#endif // #ifndef FASTER_UTILS_H