#ifndef PROCESSOR_MACHINE_HPP_
#define PROCESSOR_MACHINE_HPP_

#include "Machine.h"

#include "Memory.hpp"
#include "Online-Thread.hpp"
#include "Protocols/Hemi.hpp"
#include "Protocols/fake-stuff.hpp"

#include "Tools/Exceptions.h"

#include <sys/time.h>

#include "Math/Setup.h"
#include "Tools/mkpath.h"
#include "Tools/Bundle.h"

#include <iostream>
#include <vector>
#include <string>
#include <fstream>
#include <pthread.h>
using namespace std;

template<class sint, class sgf2n>
void Machine<sint, sgf2n>::init_binary_domains(int security_parameter, int lg2)
{
  sgf2n::clear::init_field(lg2);

  if (not is_same<typename sgf2n::mac_key_type, GC::NoValue>())
    {
      if (sgf2n::mac_key_type::length() < security_parameter)
        {
          cerr << "Security parameter needs to be at most n in GF(2^n)."
              << endl;
          cerr << "Increase the latter (-lg2) or decrease the former (-S)."
              << endl;
          exit(1);
        }
    }

  if (not is_same<typename sint::bit_type::mac_key_type, GC::NoValue>())
    {
      sint::bit_type::mac_key_type::init_minimum(security_parameter);
    }
  else
    {
      // Initialize field for CCD
      sint::bit_type::part_type::open_type::init_field();
    }
}

template<class sint, class sgf2n>
Machine<sint, sgf2n>::Machine(Names& playerNames, bool use_encryption,
    const OnlineOptions opts)
  : my_number(playerNames.my_num()), N(playerNames),
    use_encryption(use_encryption), live_prep(opts.live_prep), opts(opts),
    external_clients(my_number)
{
  OnlineOptions::singleton = opts;

  int min_players = 3 - sint::dishonest_majority;
  if (sint::is_real)
    {
      if (N.num_players() == 1)
        {
          cerr << "Need more than one player to run a protocol." << endl;
          cerr << "Use 'emulate.x' for just running the virtual machine" << endl;
          exit(1);
        }
      else if (N.num_players() < min_players)
        {
          cerr << "Need at least " << min_players << " players for this protocol."
              << endl;
          exit(1);
        }
    }

  // Set the prime modulus from command line or program if applicable
  if (opts.prime)
    sint::clear::init_field(opts.prime);

  init_binary_domains(opts.security_parameter, opts.lg2);

  // make directory for outputs if necessary
  mkdir_p(PREP_DIR);

  string id = "machine";
  if (use_encryption)
    P = new CryptoPlayer(N, id);
  else
    P = new PlainPlayer(N, id);

  if (opts.live_prep)
    {
      sint::LivePrep::basic_setup(*P);
    }

  // Set the prime modulus if not done earlier
  if (not sint::clear::length())
    sint::clear::read_or_generate_setup(prep_dir_prefix<sint>(), opts);

  sint::MAC_Check::setup(*P);
  sint::bit_type::MAC_Check::setup(*P);
  sgf2n::MAC_Check::setup(*P);

  if (opts.live_prep)
    alphapi = read_generate_write_mac_key<sint>(*P);
  else
    {
      // check for directory
      Sub_Data_Files<sint>::check_setup(N);
      // require existing MAC key
      if (sint::has_mac)
        read_mac_key<sint>(N, alphapi);
    }

  alpha2i = read_generate_write_mac_key<sgf2n>(*P);
  alphabi = read_generate_write_mac_key<typename
      sint::bit_type::part_type>(*P);

#ifdef DEBUG_MAC
  cerr << "MAC Key p = " << alphapi << endl;
  cerr << "MAC Key 2 = " << alpha2i << endl;
#endif

  // for OT-based preprocessing
  sint::clear::next::template init<typename sint::clear>(false);

  // Initialize the global memory
  auto memtype = opts.memtype;
  if (memtype.compare("old")==0)
     {
       if (sint::real_shares(*P))
         {
           ifstream inpf;
           inpf.open(memory_filename(), ios::in | ios::binary);
           if (inpf.fail()) { throw file_error(memory_filename()); }
           inpf >> M2 >> Mp >> Mi;
           if (inpf.get() != 'M')
           {
               cerr << "Invalid memory file. Run with '-m empty'." << endl;
               exit(1);
           }
           inpf.close();
         }
     }
  else if (!(memtype.compare("empty")==0))
     { cerr << "Invalid memory argument" << endl;
       exit(1);
     }
}

template<class sint, class sgf2n>
void Machine<sint, sgf2n>::prepare(const string& progname_str)
{
  int old_n_threads = nthreads;
  progs.clear();
  load_schedule(progname_str);
  check_program();

  // keep preprocessing
  nthreads = max(old_n_threads, nthreads);

  // initialize persistence if necessary
  for (auto& prog : progs)
    {
      if (prog.writes_persistence)
        {
          Binary_File_IO<sint>::reset(my_number);
          Binary_File_IO<sgf2n>::reset(my_number);
          break;
        }
    }

#ifdef VERBOSE
  progs[0].print_offline_cost();
#endif

  /* Set up the threads */
  tinfo.resize(nthreads);
  queues.resize(nthreads);
  join_timer.resize(nthreads);
  assert(threads.size() == size_t(old_n_threads));

  for (int i = old_n_threads; i < nthreads; i++)
    {
      queues[i] = new ThreadQueue;
      // stand-in for initialization
      queues[i]->schedule({});
      tinfo[i].thread_num=i;
      tinfo[i].Nms=&N;
      tinfo[i].alphapi=&alphapi;
      tinfo[i].alpha2i=&alpha2i;
      tinfo[i].machine=this;
      pthread_t thread;
      int res = pthread_create(&thread, NULL,
          thread_info<sint, sgf2n>::Main_Func, &tinfo[i]);

      if (res == 0)
        threads.push_back(thread);
      else
        throw runtime_error("cannot start thread");
    }

  assert(queues.size() == threads.size());

  // synchronize with clients before starting timer
  for (int i=old_n_threads; i<nthreads; i++)
    {
      queues[i]->result();
    }
}

template<class sint, class sgf2n>
Machine<sint, sgf2n>::~Machine()
{
  stop_threads();

  sint::LivePrep::teardown();
  sgf2n::LivePrep::teardown();

  sint::MAC_Check::teardown();
  sint::bit_type::MAC_Check::teardown();
  sgf2n::MAC_Check::teardown();

  delete P;
}

template<class sint, class sgf2n>
size_t Machine<sint, sgf2n>::load_program(const string& threadname,
    const string& filename)
{
  progs.push_back(N.num_players());
  int i = progs.size() - 1;
  progs[i].parse(filename);
  M2.minimum_size(SGF2N, CGF2N, progs[i], threadname);
  Mp.minimum_size(SINT, CINT, progs[i], threadname);
  Mi.minimum_size(NONE, INT, progs[i], threadname);
  bit_memories.reset(progs[i]);
  return progs.back().size();
}

template<class sint, class sgf2n>
DataPositions Machine<sint, sgf2n>::run_tapes(const vector<int>& args,
    Data_Files<sint, sgf2n>& DataF)
{
  assert(args.size() % 3 == 0);
  for (unsigned i = 0; i < args.size(); i += 3)
    fill_buffers(args[i], args[i + 1], &DataF.DataFp, &DataF.DataFb);
  DataPositions res(N.num_players());
  for (unsigned i = 0; i < args.size(); i += 3)
    res.increase(
        run_tape(args[i], args[i + 1], args[i + 2], DataF.tellg() + res));
  DataF.skip(res);
  return res;
}

template<class sint, class sgf2n>
void Machine<sint, sgf2n>::fill_buffers(int thread_number, int tape_number,
    Preprocessing<sint>* prep,
    Preprocessing<typename sint::bit_type>* bit_prep)
{
  // central preprocessing
  auto usage = progs[tape_number].get_offline_data_used();
  if (sint::expensive and prep != 0 and OnlineOptions::singleton.bucket_size == 3)
    {
      try
      {
          auto& source = *dynamic_cast<BufferPrep<sint>*>(prep);
          auto& dest =
              dynamic_cast<BufferPrep<sint>&>(tinfo[thread_number].processor->DataF.DataFp);
          for (auto it = usage.edabits.begin(); it != usage.edabits.end(); it++)
            {
              bool strict = it->first.first;
              int n_bits = it->first.second;
              size_t required = DIV_CEIL(it->second,
                  sint::bit_type::part_type::default_length);
              auto& dest_buffer = dest.edabits[it->first];
              auto& source_buffer = source.edabits[it->first];
              while (dest_buffer.size() < required)
                {
                  if (source_buffer.empty())
                    source.buffer_edabits(strict, n_bits, &queues);
                  size_t n = min(source_buffer.size(),
                      required - dest_buffer.size());
                  dest_buffer.insert(dest_buffer.end(), source_buffer.end() - n,
                      source_buffer.end());
                  source_buffer.erase(source_buffer.end() - n,
                      source_buffer.end());
                }
            }
      }
      catch (bad_cast& e)
      {
#ifdef VERBOSE_CENTRAL
        cerr << "Problem with central preprocessing" << endl;
#endif
      }
    }

  typedef typename sint::bit_type bit_type;
  if (bit_type::expensive_triples and bit_prep and OnlineOptions::singleton.bucket_size == 3)
    {
      try
      {
          auto& source = *dynamic_cast<BufferPrep<bit_type>*>(bit_prep);
          auto &dest =
              dynamic_cast<BufferPrep<bit_type>&>(tinfo[thread_number].processor->share_thread.DataF);
          for (int i = 0; i < DIV_CEIL(usage.files[DATA_GF2][DATA_TRIPLE],
                                        bit_type::default_length); i++)
            dest.push_triple(source.get_triple_no_count(bit_type::default_length));
      }
      catch (bad_cast& e)
      {
#ifdef VERBOSE_CENTRAL
        cerr << "Problem with central bit triple preprocessing: " << e.what() << endl;
#endif
      }
    }

  if (not HemiOptions::singleton.plain_matmul)
    fill_matmul(thread_number, tape_number, prep, sint::triple_matmul);
}

template<class sint, class sgf2n>
template<int>
void Machine<sint, sgf2n>::fill_matmul(int thread_number, int tape_number,
    Preprocessing<sint>* prep, true_type)
{
  auto usage = progs[tape_number].get_offline_data_used();
  for (auto it = usage.matmuls.begin(); it != usage.matmuls.end(); it++)
    {
      try
      {
          auto& source_proc = *dynamic_cast<BufferPrep<sint>&>(*prep).proc;
          int max_inner = opts.batch_size;
          int max_cols = opts.batch_size;
          for (int j = 0; j < it->first[1]; j += max_inner)
            {
              for (int k = 0; k < it->first[2]; k += max_cols)
                {
                  auto subdim = it->first;
                  subdim[1] = min(subdim[1] - j, max_inner);
                  subdim[2] = min(subdim[2] - k, max_cols);
                  auto& source_proto = dynamic_cast<Hemi<sint>&>(source_proc.protocol);
                  auto& source = source_proto.get_matrix_prep(
                          subdim, source_proc);
                  auto& dest =
                      dynamic_cast<Hemi<sint>&>(tinfo[thread_number].processor->Procp.protocol).get_matrix_prep(
                          subdim, tinfo[thread_number].processor->Procp);
                  if (not source_proto.use_plain_matmul(subdim, source_proc))
                    for (int i = 0; i < it->second; i++)
                      dynamic_cast<BufferPrep<ShareMatrix<sint>>&>(dest).push_triple(
                          source.get_triple_no_count(-1));
                }
            }
      }
      catch (bad_cast& e)
      {
#ifdef VERBOSE_CENTRAL
        cerr << "Problem with central matmul preprocessing: " << e.what() << endl;
#endif
      }
    }
}

template<class sint, class sgf2n>
DataPositions Machine<sint, sgf2n>::run_tape(int thread_number, int tape_number,
    int arg, const DataPositions& pos)
{
  if (size_t(thread_number) >= tinfo.size())
    throw overflow("invalid thread number", thread_number, tinfo.size());
  if (size_t(tape_number) >= progs.size())
    throw overflow("invalid tape number", tape_number, progs.size());

  queues[thread_number]->schedule({tape_number, arg, pos});
  //printf("Send signal to run program %d in thread %d\n",tape_number,thread_number);
  //printf("Running line %d\n",exec);
  if (progs[tape_number].usage_unknown())
    {
      if (not opts.live_prep and thread_number != 0)
        {
          insecure(
              "Internally called tape " + to_string(tape_number)
                  + " has unknown offline data usage");
        }
      return DataPositions(N.num_players());
    }
  else
    {
      // Bits, Triples, Squares, and Inverses skipping
      return progs[tape_number].get_offline_data_used();
    }
}

template<class sint, class sgf2n>
DataPositions Machine<sint, sgf2n>::join_tape(int i)
{
  join_timer[i].start();
  //printf("Waiting for client to terminate\n");
  auto pos = queues[i]->result().pos;
  join_timer[i].stop();
  return pos;
}

template<class sint, class sgf2n>
void Machine<sint, sgf2n>::run_step(const string& progname)
{
  prepare(progname);
  run_tape(0, 0, 0, N.num_players());
  join_tape(0);
}

template<class sint, class sgf2n>
void Machine<sint, sgf2n>::run_function(const string& name,
        FunctionArgument& result, vector<FunctionArgument>& arguments)
{
  ifstream file;
  FunctionArgument::open(file, name, arguments);

  string progname, return_type;
  int tape_number, return_reg;
  file >> progname >> tape_number >> return_type >> return_reg;

  result.check_type(return_type);

  vector<int> arg_regs(arguments.size());
  vector<int> address_regs(arguments.size());
  for (size_t i = 0; i < arguments.size(); i++)
    {
      file >> arg_regs.at(i);
      if (arguments[i].get_memory())
        file >> address_regs.at(i);
    }

  if (not file.good())
    throw runtime_error("error reading file for function " + name);

  prepare(progname);
  auto& processor = *tinfo.at(0).processor;
  processor.reset(progs.at(tape_number), 0);

  for (size_t i = 0; i < arguments.size(); i++)
    for (size_t j = 0; j < arguments[i].get_size(); j++)
      {
        if (arguments[i].get_n_bits())
          {
            size_t n_limbs = DIV_CEIL(arguments[i].get_n_bits(),
                sint::bit_type::default_length);
            for (size_t k = 0; k < n_limbs; k++)
              bit_memories.MS[arg_regs.at(i) + j * n_limbs + k] =
                  arguments[i].get_value<vector<typename sint::bit_type>>(j).at(
                      k);
          }
        else if (arguments[i].has_reg_type("s"))
          {
            auto& value = arguments[i].get_value<sint>(j);
            if (arguments[i].get_memory())
              Mp.MS[arg_regs.at(i) + j] = value;
            else
              processor.Procp.get_S()[arg_regs.at(i) + j] = value;
          }
        else
          {
            assert(arguments[i].has_reg_type("ci"));
            processor.write_Ci(arg_regs.at(i) + j, arguments[i].get_value<long>(j));
          }
        if (arguments[i].get_memory())
          processor.write_Ci(address_regs.at(i), arg_regs.at(i));
      }

  run_tape(0, tape_number, 0, N.num_players());
  join_tape(0);

  assert(result.has_reg_type("s"));
  for (size_t j = 0; j < result.get_size(); j++)
    result.get_value<sint>(j) = processor.Procp.get_S()[return_reg + j];

  for (size_t i = 0; i < arguments.size(); i++)
    if (arguments[i].get_memory())
      for (size_t j = 0; j < arguments[i].get_size(); j++)
        {
          if (arguments[i].get_n_bits())
            {
              size_t n_limbs = DIV_CEIL(arguments[i].get_n_bits(),
                  sint::bit_type::default_length);
              for (size_t k = 0; k < n_limbs; k++)
                arguments[i].get_value<vector<typename sint::bit_type>>(j).at(k) =
                    bit_memories.MS[arg_regs.at(i) + j * n_limbs + k];
            }
          else
            arguments[i].get_value<sint>(j) = Mp.MS[arg_regs.at(i) + j];
        }
}

template<class sint, class sgf2n>
pair<DataPositions, NamedCommStats> Machine<sint, sgf2n>::stop_threads()
{
  // only stop actually running threads
  nthreads = threads.size();

  // Tell all C-threads to stop
  for (int i=0; i<nthreads; i++)
    {
      //printf("Send kill signal to client\n");
      auto queue = queues.at(i);
      assert(queue);
      queue->schedule(-1);
    }

  // sum actual usage
  DataPositions pos(N.num_players());

#ifdef DEBUG_THREADS
  cerr << "Waiting for all clients to finish" << endl;
#endif
  // Wait until all clients have signed out
  for (int i=0; i<nthreads; i++)
    {
      queues[i]->schedule({});
      pos.increase(queues[i]->result().pos);
      pthread_join(threads[i],NULL);
    }

  auto comm_stats = total_comm();
  max_comm = queues.max_comm();

  if (OnlineOptions::singleton.verbose)
    {
      NamedStats total;
      for (auto queue : queues)
        total += queue->stats;
      total.print();
      queues.print_breakdown();
    }

  for (auto& queue : queues)
    if (queue)
      delete queue;

  queues.clear();
  threads.clear();

  nthreads = 0;

  return {pos, comm_stats};
}

template<class sint, class sgf2n>
void Machine<sint, sgf2n>::run(const string& progname)
{
  prepare(progname);

  if (opts.verbose and setup_timer.is_running())
    {
      cerr << "Setup took " << setup_timer.elapsed() << " seconds." << endl;
      setup_timer.stop();
    }

  Timer proc_timer(CLOCK_PROCESS_CPUTIME_ID);
  proc_timer.start();
  timer[0].start({});

  // run main tape
  run_tape(0, 0, 0, N.num_players());
  join_tape(0);

  print_compiler();

  finish_timer.start();

  // actual usage
  multithread = nthreads > 1;
  auto res = stop_threads();
  DataPositions& pos = res.first;

  finish_timer.stop();
  
#ifdef VERBOSE
  cerr << "Memory usage: ";
  tinfo[0].print_usage(cerr, Mp.MS, "sint");
  tinfo[0].print_usage(cerr, Mp.MC, "cint");
  tinfo[0].print_usage(cerr, M2.MS, "sgf2n");
  tinfo[0].print_usage(cerr, M2.MS, "cgf2n");
  tinfo[0].print_usage(cerr, bit_memories.MS, "sbits");
  tinfo[0].print_usage(cerr, bit_memories.MC, "cbits");
  tinfo[0].print_usage(cerr, Mi.MC, "regint");
  cerr << endl;

  for (unsigned int i = 0; i < join_timer.size(); i++)
    cerr << "Join timer: " << i << " " << join_timer[i].elapsed() << endl;
  cerr << "Finish timer: " << finish_timer.elapsed() << endl;
#endif

  NamedCommStats& comm_stats = res.second;

  if (opts.verbose)
    {
      cerr << "Communication details";
      if (multithread)
        cerr << " (rounds and time in parallel threads counted double)";
      cerr << ":" << endl;
      comm_stats.print(false, max_comm);
      cerr << "CPU time = " <<  proc_timer.elapsed();
      if (multithread)
        cerr << " (overall core time)";
      cerr << endl;
    }

  print_timers();

  if (sint::is_real)
    this->print_comm(*this->P, comm_stats);

#ifdef VERBOSE_OPTIONS
  if (opening_sum < N.num_players() && !direct)
    cerr << "Summed at most " << opening_sum << " shares at once with indirect communication" << endl;
  else
    cerr << "Summed all shares at once" << endl;

  if (max_broadcast < N.num_players() && !direct)
    cerr << "Send to at most " << max_broadcast << " parties at once" << endl;
  else
    cerr << "Full broadcast" << endl;
#endif

  if (not OnlineOptions::singleton.has_option("output_full_memory")
      and OnlineOptions::singleton.disk_memory.empty())
    {
      // Reduce memory size to speed up
      unsigned max_size = 1 << 20;
      if (M2.size_s() > max_size)
        M2.resize_s(max_size);
      if (Mp.size_s() > max_size)
        Mp.resize_s(max_size);
    }

  if (sint::real_shares(*P) and not opts.has_option("no_memory_output"))
    {
      RunningTimer timer;
      // Write out the memory to use next time
      ofstream outf(memory_filename(), ios::out | ios::binary);
      outf << M2 << Mp << Mi;
      outf << 'M';
      outf.close();

      bit_memories.write_memory(N.my_num());

      if (opts.has_option("time_memory_output"))
        cerr << "Writing memory to disk took " << timer.elapsed() << " seconds"
            << endl;
    }

  if (opts.verbose)
    {
      cerr << "Actual preprocessing cost of program:" << endl;
      pos.print_cost();
    }

  if (pos.any_more(progs[0].get_offline_data_used())
      and not progs[0].usage_unknown())
    throw runtime_error("computation used more preprocessing than expected");

  if (not stats.empty())
    {
      stats.print();
    }

  if (not opts.file_prep_per_thread)
    {
      Data_Files<sint, sgf2n> df(*this);
      df.seekg(pos);
      df.prune();
    }

  suggest_optimizations();

  if (N.num_players() > 4)
    {
      string alt = sint::alt();
      if (alt.size())
        cerr << "This protocol doesn't scale well with the number of parties, "
            << "have you considered using " << alt << " instead?" << endl;
    }

  if (nan_warning and sint::real_shares(*P))
    {
      cerr << "Outputs of 'NaN' might be related to exceeding the sfix range. See ";
      cerr << "https://mp-spdz.readthedocs.io/en/latest/Compiler.html#Compiler.types.sfix";
      cerr << " for details" << endl;
      nan_warning = false;
    }

#ifdef VERBOSE
  cerr << "End of prog" << endl;
#endif
}

template<class sint, class sgf2n>
string Machine<sint, sgf2n>::memory_filename()
{
  return BaseMachine::memory_filename(sint::type_short(), my_number);
}

template<class sint, class sgf2n>
template<class T>
string Machine<sint, sgf2n>::prep_dir_prefix()
{
  return opts.prep_dir_prefix<T>(N.num_players());
}

template<class sint, class sgf2n>
void Machine<sint, sgf2n>::reqbl(int n)
{
  sint::clear::reqbl(n);
}

template<class sint, class sgf2n>
void Machine<sint, sgf2n>::active(int n)
{

  if (sint::malicious and n == 0)
    {
      cerr << "Program requires a semi-honest protocol" << endl;
      exit(1);
    }
}

template<class sint, class sgf2n>
void Machine<sint, sgf2n>::suggest_optimizations()
{
  string optimizations;
  if (relevant_opts.find("trunc_pr") != string::npos and sint::has_trunc_pr)
    optimizations.append("\tprogram.use_trunc_pr = True\n");
  if (relevant_opts.find("split") != string::npos and sint::has_split)
    optimizations.append(
        "\tprogram.use_split(" + to_string(N.num_players()) + ")\n");
  if (relevant_opts.find("edabit") != string::npos and not sint::has_split and sint::is_real)
    optimizations.append("\tprogram.use_edabit(True)\n");
  if (not optimizations.empty())
    cerr << "This program might benefit from some protocol options." << endl
        << "Consider adding the following at the beginning of your code:"
        << endl << optimizations;
#ifndef __clang__
  cerr << "This virtual machine was compiled with GCC. Recompile with "
      "'CXX = clang++' in 'CONFIG.mine' for optimal performance." << endl;
#endif
}

template<class sint, class sgf2n>
void Machine<sint, sgf2n>::check_program()
{
  Hash hasher;
  for (auto& prog : progs)
    hasher.update(prog.get_hash());
  assert(P);
  Bundle<octetStream> bundle(*P);
  hasher.final(bundle.mine);
  try
  {
    bundle.compare(*P);
  }
  catch (mismatch_among_parties&)
  {
    throw runtime_error("program differs between parties");
  }
}

#endif