solver* solver_new(void)
{
solver* s = (solver*)malloc(sizeof(solver));
/* initialize vectors */
vecp_new(&s->clauses);
vecp_new(&s->learnts);
veci_new(&s->order);
veci_new(&s->trail_lim);
veci_new(&s->tagged);
veci_new(&s->stack);
veci_new(&s->model);
/* initialize arrays */
s->wlists = 0;
s->activity = 0;
s->assigns = 0;
s->orderpos = 0;
s->reasons = 0;
s->levels = 0;
s->tags = 0;
s->trail = 0;
/* initialize other vars */
s->size = 0;
s->cap = 0;
s->qhead = 0;
s->qtail = 0;
s->cla_inc = 1;
s->cla_decay = 1;
s->var_inc = 1;
s->var_decay = 1;
s->root_level = 0;
s->simpdb_assigns = 0;
s->simpdb_props = 0;
s->random_seed = 91648253;
s->progress_estimate = 0;
s->binary = (clause*)malloc(sizeof(clause)
+ sizeof(lit)*2);
s->binary->size_learnt = (2 << 1);
s->verbosity = 0;
s->stats.starts = 0;
s->stats.decisions = 0;
s->stats.propagations = 0;
s->stats.inspects = 0;
s->stats.conflicts = 0;
s->stats.clauses = 0;
s->stats.clauses_literals = 0;
s->stats.learnts = 0;
s->stats.learnts_literals = 0;
s->stats.max_literals = 0;
s->stats.tot_literals = 0;
return s;
}
void solver_setnvars(solver* s,int n)
{
int var;
if (s->cap < n){
while (s->cap < n) s->cap = s->cap*2+1;
s->wlists = (vecp*) realloc(s->wlists,
sizeof(vecp)*s->cap*2);
s->activity = (double*) realloc(s->activity,
sizeof(double)*s->cap);
s->assigns = (lbool*) realloc(s->assigns,
sizeof(lbool)*s->cap);
s->orderpos = (int*) realloc(s->orderpos,
sizeof(int)*s->cap);
s->reasons = (clause**)realloc(s->reasons,
sizeof(clause*)*s->cap);
s->levels = (int*) realloc(s->levels,
sizeof(int)*s->cap);
s->tags = (lbool*) realloc(s->tags,
sizeof(lbool)*s->cap);
s->trail = (lit*) realloc(s->trail,
sizeof(lit)*s->cap);
}
for (var = s->size; var < n; var++){
vecp_new(&s->wlists[2*var]);
vecp_new(&s->wlists[2*var+1]);
s->activity [var] = 0;
s->assigns [var] = l_Undef;
s->orderpos [var] = veci_size(&s->order);
s->reasons [var] = (clause*)0;
s->levels [var] = 0;
s->tags [var] = l_Undef;
/* does not hold because variables enqueued at top level will
not be reinserted in the heap
assert(veci_size(&s->order) == var);
*/
veci_push(&s->order,var);
order_update(s, var);
}
s->size = n > s->size ? n : s->size;
}
solver* solver_new(void)
{
solver* s = (solver*)malloc(sizeof(solver));
vecp_new(&s->clauses);
// initialize arrays
s->decisions = 0; // just setting all the pointers to NULL initially
s->level_choice = 0;
s->assigns = 0;
s->levels = 0;
s->counts = 0;
// initialize other variables
s->size = 0;
s->cap = 0;
s->tail = 0;
s->cur_level = -1;
s->satisfied = false;
return s;
}