dds-bridge-sys 3.0.0

#include "solver_context.hpp"

#include <cstdlib>
#include <iostream>
#include <memory>

#include <api/dds.h>
#include <trans_table/trans_table_l.hpp>
#include <trans_table/trans_table_s.hpp>

// Owned-ThreadData constructor: allocate ThreadData as a member of the
// SolverContext so callers can create a context at the top of the stack
// and pass it down without a separate per-thread lookup.
SolverContext::SolverContext(SolverConfig cfg)
  : thr_(nullptr), cfg_(cfg)
{
  // Create an owned ThreadData instance and keep it in thr_.
  thr_ = std::make_shared<ThreadData>();
  // Ensure persistent facades like SearchContext see the bound ThreadData.
  search_.set_thread(thr_);
  search_.set_owner(this);
}

auto SolverContext::trans_table() const -> TransTable*
{
  // Delegate to per-context SearchContext member (lazy creation inside).
  return const_cast<SolverContext*>(this)->search_.trans_table();
}

// --- SearchContext disposal helper ---
auto SolverContext::SearchContext::dispose_trans_table() -> void
{
  // Simply reset the unique_ptr; logging/stats are handled by caller.
  tt_.reset();
}

// --- SearchContext out-of-line definitions ---
auto SolverContext::SearchContext::analysis_flag() -> bool&
{
  return thr_->analysisFlag;
}

auto SolverContext::SearchContext::analysis_flag() const -> bool
{
  return thr_->analysisFlag;
}
auto SolverContext::SearchContext::lowest_win(int depth, int suit) -> unsigned short& {
  return thr_->lowestWin[depth][suit];
}
auto SolverContext::SearchContext::lowest_win(int depth, int suit) const -> const unsigned short& {
  return thr_->lowestWin[depth][suit];
}
auto SolverContext::SearchContext::best_move(int depth) -> MoveType& {
  return thr_->bestMove[depth];
}
auto SolverContext::SearchContext::best_move(int depth) const -> const MoveType& {
  return thr_->bestMove[depth];
}
auto SolverContext::SearchContext::best_move_tt(int depth) -> MoveType& {
  return thr_->bestMoveTT[depth];
}
auto SolverContext::SearchContext::best_move_tt(int depth) const -> const MoveType& {
  return thr_->bestMoveTT[depth];
}
auto SolverContext::SearchContext::winners(int trickIndex) -> WinnersType& {
  return thr_->winners[trickIndex];
}
auto SolverContext::SearchContext::winners(int trickIndex) const -> const WinnersType& {
  return thr_->winners[trickIndex];
}
auto SolverContext::SearchContext::node_type_store(int hand) -> int&
{
  return thr_->nodeTypeStore[hand];
}

auto SolverContext::SearchContext::node_type_store(int hand) const -> const int&
{
  return thr_->nodeTypeStore[hand];
}

auto SolverContext::SearchContext::nodes() -> int&
{
  return thr_->nodes;
}

auto SolverContext::SearchContext::nodes() const -> const int&
{
  return thr_->nodes;
}

auto SolverContext::SearchContext::trick_nodes() -> int&
{
  return thr_->trickNodes;
}

auto SolverContext::SearchContext::trick_nodes() const -> const int&
{
  return thr_->trickNodes;
}

auto SolverContext::SearchContext::ini_depth() -> int&
{
  return thr_->iniDepth;
}

auto SolverContext::SearchContext::ini_depth() const -> int
{
  return thr_->iniDepth;
}

auto SolverContext::SearchContext::forbidden_moves() -> MoveType*
{
  return thr_->forbiddenMoves;
}

auto SolverContext::SearchContext::forbidden_moves() const -> const MoveType*
{
  return thr_->forbiddenMoves;
}

auto SolverContext::SearchContext::forbidden_move(int index) -> MoveType&
{
  return thr_->forbiddenMoves[index];
}

auto SolverContext::SearchContext::forbidden_move(int index) const -> const MoveType&
{
  return thr_->forbiddenMoves[index];
}
auto SolverContext::SearchContext::clear_forbidden_moves() -> void {
  for (int k = 0; k <= 13; ++k) {
    thr_->forbiddenMoves[k].rank = 0;
    thr_->forbiddenMoves[k].suit = 0;
  }
}

// New: per-context transposition table accessors
auto SolverContext::SearchContext::maybe_trans_table() const -> TransTable* {
  return tt_ ? tt_.get() : nullptr;
}

auto SolverContext::SearchContext::trans_table() -> TransTable* {
  if (tt_) return tt_.get();
  // Require owner (for config and utilities). If missing, fall back
  // to Large with built-in defaults.
  TTKind kind = (owner_ ? owner_->config().tt_kind_ : TTKind::Large);
  int defMB = (owner_ ? owner_->config().tt_mem_default_mb_ : 0);
  int maxMB = (owner_ ? owner_->config().tt_mem_maximum_mb_ : 0);
  // Final fallback to THREADMEM_* constants
  if (defMB <= 0 || maxMB <= 0) {
    if (kind == TTKind::Small) {
      defMB = THREADMEM_SMALL_DEF_MB;
      maxMB = THREADMEM_SMALL_MAX_MB;
    } else {
      defMB = THREADMEM_LARGE_DEF_MB;
      maxMB = THREADMEM_LARGE_MAX_MB;
    }
  }
  // Optional environment overrides
  if (const char* s = std::getenv("DDS_TT_DEFAULT_MB")) {
    int v = std::atoi(s);
    if (v > 0) defMB = v;
  }
  if (const char* s = std::getenv("DDS_TT_LIMIT_MB")) {
    int v = std::atoi(s);
    if (v > 0) maxMB = std::min(maxMB, v);
  }
  if (maxMB < defMB) maxMB = defMB;

  // Create appropriate concrete table
  if (kind == TTKind::Small)
    tt_ = std::unique_ptr<TransTable>(new TransTableS());
  else
    tt_ = std::unique_ptr<TransTable>(new TransTableL());

  tt_->set_memory_default(defMB);
  tt_->set_memory_maximum(maxMB);
  tt_->make_tt();

#ifdef DDS_UTILITIES_LOG
  {
    const char kch = (kind == TTKind::Small ? 'S' : 'L');
    char buf[96];
    std::snprintf(buf, sizeof(buf), "tt:create|%c|%d|%d", kch, defMB, maxMB);
    if (owner_) owner_->utilities().log_append(std::string(buf));
  }
#endif

#ifdef DDS_UTILITIES_STATS
  if (owner_) owner_->utilities().util().stats().tt_creates++;
#endif

  // Optional one-time debug print per creation
  if (const char* dbg = std::getenv("DDS_DEBUG_TT_CREATE")) {
    if (*dbg) {
      std::cerr << "[DDS] TT create: kind="
                << (kind == TTKind::Small ? 'S' : 'L')
                << " defMB=" << defMB
                << " maxMB=" << maxMB
                << std::endl;
    }
  }

  return tt_.get();
}

auto SolverContext::maybe_trans_table() const -> TransTable*
{
  return search_.maybe_trans_table();
}

auto SolverContext::dispose_trans_table() const -> void
{
#ifdef DDS_UTILITIES_LOG
    // Append a tiny debug entry indicating TT disposal.
    utilities().log_append("tt:dispose");
#endif
#ifdef DDS_UTILITIES_STATS
    utilities().util().stats().tt_disposes++;
#endif
  // Dispose the member-owned TT (if any)
  const_cast<SolverContext*>(this)->search_.dispose_trans_table();
}

// Defaulted destructor defined out-of-line so destruction of the
// owned std::shared_ptr<ThreadData> happens where ThreadData is a
// complete type.
SolverContext::~SolverContext() = default;

auto SolverContext::reset_for_solve() const -> void
{
#ifdef DDS_UTILITIES_LOG
  {
    char buf[32];
    std::snprintf(buf, sizeof(buf), "ctx:reset_for_solve");
    utilities().log_append(std::string(buf));
  }
#endif
  if (auto* tt = search_.maybe_trans_table())
    tt->reset_memory(ResetReason::FreeMemory);
  if (!thr_) return;
  // Reset a subset of search state to a clean slate.
  thr_->nodes = 0;
  thr_->trickNodes = 0;
  thr_->analysisFlag = false;
  for (int d = 0; d < 50; ++d) {
    thr_->bestMove[d].suit = 0;
    thr_->bestMove[d].rank = 0;
    thr_->bestMoveTT[d].suit = 0;
    thr_->bestMoveTT[d].rank = 0;
    for (int s = 0; s < DDS_SUITS; ++s) {
      thr_->lowestWin[d][s] = 0;
    }
  }
  for (int t = 0; t < 13; ++t) {
    thr_->winners[t].number = 0;
  }
  for (int k = 0; k <= 13; ++k) {
    thr_->forbiddenMoves[k].rank = 0;
    thr_->forbiddenMoves[k].suit = 0;
  }
}

auto SolverContext::clear_tt() const -> void
{
#ifdef DDS_UTILITIES_LOG
  utilities().log_append("tt:clear");
#endif
  if (auto* tt = search_.maybe_trans_table())
    tt->return_all_memory();
}

auto SolverContext::resize_tt(int defMB, int maxMB) const -> void
{
#ifdef DDS_UTILITIES_LOG
  {
    char buf[64];
    std::snprintf(buf, sizeof(buf), "tt:resize|%d|%d", defMB, maxMB);
    utilities().log_append(std::string(buf));
  }
#endif
  if (auto* tt = search_.maybe_trans_table())
  {
    if (maxMB < defMB) maxMB = defMB;
  tt->set_memory_default(defMB);
  tt->set_memory_maximum(maxMB);
  }
}

auto SolverContext::configure_tt(TTKind kind, int defMB, int maxMB) -> void
{
  // Apply environment limit if present to preserve existing behavior.
  if (const char* s = std::getenv("DDS_TT_LIMIT_MB")) {
    int v = std::atoi(s);
    if (v > 0) maxMB = std::min(maxMB, v);
  }
  if (maxMB < defMB) maxMB = defMB;

  // Persist configuration for future TT creations.
  cfg_.tt_kind_ = kind;
  cfg_.tt_mem_default_mb_ = defMB;
  cfg_.tt_mem_maximum_mb_ = maxMB;

  auto* tt = search_.maybe_trans_table();
  if (!tt) return; // Nothing to apply now; will take effect on lazy creation.

  // If kind changes, dispose and recreate now to ensure effect is applied.
  bool is_small = (dynamic_cast<TransTableS*>(tt) != nullptr);
  TTKind current_kind = is_small ? TTKind::Small : TTKind::Large;
  if (current_kind != kind) {
    dispose_trans_table();
    // Force immediate creation with new config to keep behavior explicit.
    (void)trans_table();
    return;
  }

  // Same kind: resize in-place.
  resize_tt(defMB, maxMB);
}

// Lightweight reset matching legacy ResetBestMoves semantics.
auto SolverContext::reset_best_moves_lite() const -> void
{
#ifdef DDS_UTILITIES_LOG
  utilities().log_append("ctx:reset_best_moves_lite");
#endif
  if (!thr_) return;
  for (int d = 0; d <= 49; ++d)
  {
    thr_->bestMove[d].rank = 0;
    thr_->bestMoveTT[d].rank = 0;
  }
  // Keep memUsed in sync as the legacy code did
  if (auto* tt = search_.maybe_trans_table())
    thr_->memUsed = tt->memory_in_use() + ThreadMemoryUsed();
  else
    thr_->memUsed = ThreadMemoryUsed();
#ifdef DDS_AB_STATS
  thr_->ABStats.Reset();
#endif
}

auto ThreadMemoryUsed() -> double
{
  // TODO:  Only needed because SolverIF wants to set it. Avoid?
  double memUsed =
    8192 * sizeof(RelRanksType)
    / static_cast<double>(1024.);

  return memUsed;
}

// --- MoveGenContext out-of-line definitions ---
// No TLS allocator shim required: move generation now runs without a global allocator hook.

auto SolverContext::MoveGenContext::move_gen_0(
  const int tricks,
  const Pos& tpos,
  const MoveType& bestMove,
  const MoveType& bestMoveTT,
  const RelRanksType thrp_rel[]) -> int
{
  auto rc = thr_->moves.MoveGen0(tricks, tpos, bestMove, bestMoveTT, thrp_rel);
  return rc;
}

auto SolverContext::MoveGenContext::move_gen_123(
  const int tricks,
  const int relHand,
  const Pos& tpos) -> int
{
  auto rc = thr_->moves.MoveGen123(tricks, relHand, tpos);
  return rc;
}

auto SolverContext::MoveGenContext::purge(
  const int tricks,
  const int relHand,
  const MoveType forbiddenMoves[]) -> void
{
  thr_->moves.Purge(tricks, relHand, forbiddenMoves);
}

auto SolverContext::MoveGenContext::make_next(
  const int trick,
  const int relHand,
  const unsigned short win_ranks[]) -> const MoveType*
{
  return thr_->moves.MakeNext(trick, relHand, win_ranks);
}

auto SolverContext::MoveGenContext::make_next_simple(
  const int trick,
  const int relHand) -> const MoveType*
{
  return thr_->moves.MakeNextSimple(trick, relHand);
}

auto SolverContext::MoveGenContext::get_length(
  const int trick,
  const int relHand) const -> int
{
  return thr_->moves.GetLength(trick, relHand);
}

auto SolverContext::MoveGenContext::rewind(
  const int tricks,
  const int relHand) -> void
{
  thr_->moves.Rewind(tricks, relHand);
}

auto SolverContext::MoveGenContext::register_hit(
  const int tricks,
  const int relHand) -> void
{
  thr_->moves.RegisterHit(tricks, relHand);
}

auto SolverContext::MoveGenContext::get_trick_data(const int tricks) -> const TrickDataType&
{
  return thr_->moves.GetTrickData(tricks);
}

auto SolverContext::MoveGenContext::make_specific(
  const MoveType& mply,
  const int trick,
  const int relHand) -> void
{
  thr_->moves.MakeSpecific(mply, trick, relHand);
}

auto SolverContext::MoveGenContext::trick_to_text(const int trick) const -> std::string
{
  return thr_->moves.TrickToText(trick);
}

auto SolverContext::MoveGenContext::reinit(
  const int tricks,
  const int leadHand) -> void
{
  thr_->moves.Reinit(tricks, leadHand);
}

auto SolverContext::MoveGenContext::init(
  const int tricks,
  const int relStartHand,
  const int initialRanks[],
  const int initialSuits[],
  const unsigned short rank_in_suit[DDS_HANDS][DDS_SUITS],
  const int trump,
  const int leadHand) -> void
{
  thr_->moves.Init(tricks, relStartHand, initialRanks, initialSuits,
                   rank_in_suit, trump, leadHand);
}

auto SolverContext::MoveGenContext::print_trick_stats(std::ofstream& fout) const -> void
{
  thr_->moves.PrintTrickStats(fout);
}

auto SolverContext::MoveGenContext::print_function_stats(std::ofstream& fout) const -> void
{
  thr_->moves.PrintFunctionStats(fout);
}

auto SolverContext::MoveGenContext::print_trick_details(std::ofstream& fout) const -> void
{
  thr_->moves.PrintTrickDetails(fout);
}