vitri 0.2.0

CNF preprocessing and vtree construction (variable trees) for circuit compilation and model counting: preprocesses a DIMACS CNF, records the arithmetic to lift a model count back to the original, and builds a good vtree for it — for any d-DNNF/SDD/TDD compiler, or any model counter that takes a vtree.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142

#include "cadical_shim.h"

#include <cadical.hpp>

#include <new>
#include <vector>

namespace {

// Adapts CaDiCaL's abstract Terminator to a C callback. CaDiCaL polls this
// between rounds/phases, so a deadline expressed here bounds a runaway pass
// without needing to interrupt the solver from another thread.
struct FnTerminator final : public CaDiCaL::Terminator {
  cadical_shim_terminate_cb cb;
  void *state;
  FnTerminator (cadical_shim_terminate_cb c, void *s) : cb (c), state (s) {}
  bool terminate () override { return cb (state); }
};

// Adapts CaDiCaL's abstract ClauseIterator to a C callback. The vector is
// handed over as a pointer/length pair and is only valid for the call.
struct FnClauseIterator final : public CaDiCaL::ClauseIterator {
  cadical_shim_clause_cb cb;
  void *state;
  FnClauseIterator (cadical_shim_clause_cb c, void *s) : cb (c), state (s) {}
  bool clause (const std::vector<int> &c) override {
    return cb (state, c.data (), static_cast<int> (c.size ()));
  }
};

// The handle owns the terminator adapter so the Rust side only has to keep its
// own callback state alive, not a second C++ object.
struct Wrapper {
  CaDiCaL::Solver solver;
  FnTerminator *terminator = nullptr;
  ~Wrapper () { delete terminator; }
};

inline Wrapper *unwrap (cadical_shim_solver *s) {
  return reinterpret_cast<Wrapper *> (s);
}

} // namespace

extern "C" {

cadical_shim_solver *cadical_shim_new (void) {
  return reinterpret_cast<cadical_shim_solver *> (new (std::nothrow) Wrapper ());
}

void cadical_shim_delete (cadical_shim_solver *s) { delete unwrap (s); }

void cadical_shim_add (cadical_shim_solver *s, int lit) {
  unwrap (s)->solver.add (lit);
}

void cadical_shim_assume (cadical_shim_solver *s, int lit) {
  unwrap (s)->solver.assume (lit);
}

void cadical_shim_constrain (cadical_shim_solver *s, int lit) {
  unwrap (s)->solver.constrain (lit);
}

int cadical_shim_solve (cadical_shim_solver *s) {
  return unwrap (s)->solver.solve ();
}

int cadical_shim_simplify (cadical_shim_solver *s, int rounds) {
  return unwrap (s)->solver.simplify (rounds);
}

int cadical_shim_val (cadical_shim_solver *s, int lit) {
  return unwrap (s)->solver.val (lit);
}

int cadical_shim_fixed (cadical_shim_solver *s, int lit) {
  return unwrap (s)->solver.fixed (lit);
}

bool cadical_shim_flippable (cadical_shim_solver *s, int lit) {
  return unwrap (s)->solver.flippable (lit);
}

void cadical_shim_freeze (cadical_shim_solver *s, int lit) {
  unwrap (s)->solver.freeze (lit);
}

void cadical_shim_phase (cadical_shim_solver *s, int lit) {
  unwrap (s)->solver.phase (lit);
}

void cadical_shim_reserve (cadical_shim_solver *s, int min_max_var) {
  unwrap (s)->solver.reserve (min_max_var);
}

bool cadical_shim_limit (cadical_shim_solver *s, const char *name, int val) {
  return unwrap (s)->solver.limit (name, val);
}

bool cadical_shim_traverse_clauses (cadical_shim_solver *s,
                                    cadical_shim_clause_cb cb, void *state) {
  FnClauseIterator it (cb, state);
  return unwrap (s)->solver.traverse_clauses (it);
}

void cadical_shim_connect_terminator (cadical_shim_solver *s,
                                      cadical_shim_terminate_cb cb,
                                      void *state) {
  Wrapper *w = unwrap (s);
  // Replacing an existing terminator must not leak the old adapter.
  w->solver.disconnect_terminator ();
  delete w->terminator;
  w->terminator = new FnTerminator (cb, state);
  w->solver.connect_terminator (w->terminator);
}

void cadical_shim_disconnect_terminator (cadical_shim_solver *s) {
  Wrapper *w = unwrap (s);
  w->solver.disconnect_terminator ();
  delete w->terminator;
  w->terminator = nullptr;
}

long long cadical_shim_redundant (cadical_shim_solver *s) {
  return unwrap (s)->solver.redundant ();
}

long long cadical_shim_irredundant (cadical_shim_solver *s) {
  return unwrap (s)->solver.irredundant ();
}

double cadical_shim_score_of (cadical_shim_solver *s, int lit) {
  return vitri_cadical_score_of (&unwrap (s)->solver, lit);
}

void cadical_shim_search_stats (cadical_shim_solver *s, long long *out,
                                unsigned long n) {
  vitri_cadical_search_stats (&unwrap (s)->solver, out, n);
}

} // extern "C"