watch.c File Reference

#include "inline.h"
#include "sort.c"

Include dependency graph for watch.c:

Go to the source code of this file.

Macros
#define	INLINE_SORT

Functions
ABC_NAMESPACE_IMPL_START void	kissat_remove_binary_watch (kissat *solver, watches *watches, unsigned lit)
void	kissat_remove_blocking_watch (kissat *solver, watches *watches, reference ref)
void	kissat_substitute_large_watch (kissat *solver, watches *watches, watch src, watch dst)
void	kissat_flush_all_connected (kissat *solver)
void	kissat_flush_large_watches (kissat *solver)
void	kissat_watch_large_clauses (kissat *solver)
void	kissat_connect_irredundant_large_clauses (kissat *solver)
void	kissat_flush_large_connected (kissat *solver)

Macro Definition Documentation

INLINE_SORT

#define INLINE_SORT

Definition at line 1 of file watch.c.

Function Documentation

kissat_connect_irredundant_large_clauses()

void kissat_connect_irredundant_large_clauses

(

kissat *

solver

)

Definition at line 171 of file watch.c.

                                                               {
  KISSAT_assert (!solver->watching);
  LOG ("connecting all large irredundant clauses");
 
  clause *last_irredundant = kissat_last_irredundant_clause (solver);
 
  const value *const values = solver->values;
  watches *all_watches = solver->watches;
  ward *const arena = BEGIN_STACK (solver->arena);
 
  for (all_clauses (c)) {
    if (last_irredundant && c > last_irredundant)
      break;
    if (c->redundant)
      continue;
    if (c->garbage)
      continue;
    bool satisfied = false;
    KISSAT_assert (!solver->level);
    for (all_literals_in_clause (lit, c)) {
      const value value = values[lit];
      if (value <= 0)
        continue;
      satisfied = true;
      break;
    }
    if (satisfied) {
      kissat_mark_clause_as_garbage (solver, c);
      continue;
    }
    const reference ref = (ward *) c - arena;
    kissat_inlined_connect_clause (solver, all_watches, c, ref);
  }
}

Here is the call graph for this function:

Here is the caller graph for this function:

kissat_flush_all_connected()

void kissat_flush_all_connected

(

kissat *

solver

)

Definition at line 104 of file watch.c.

                                                 {
  KISSAT_assert (!solver->watching);
  LOG ("flush all connected binaries and clauses");
  watches *all_watches = solver->watches;
  for (all_literals (lit))
    RELEASE_WATCHES (all_watches[lit]);
}

kissat_flush_large_connected()

void kissat_flush_large_connected

(

kissat *

solver

)

Definition at line 206 of file watch.c.

                                                   {
  KISSAT_assert (!solver->watching);
  LOG ("flushing large connected clause references");
  size_t flushed = 0;
  for (all_literals (lit)) {
    watches *watches = &WATCHES (lit);
    watch *begin = BEGIN_WATCHES (*watches), *q = begin;
    const watch *const end_watches = END_WATCHES (*watches), *p = q;
    while (p != end_watches) {
      const watch head = *p++;
      if (head.type.binary)
        *q++ = head;
      else
        flushed++;
    }
    SET_END_OF_WATCHES (*watches, q);
  }
  LOG ("flushed %zu large clause references", flushed);
  (void) flushed;
}

Here is the caller graph for this function:

kissat_flush_large_watches()

void kissat_flush_large_watches

(

kissat *

solver

)

Definition at line 112 of file watch.c.

                                                 {
  KISSAT_assert (solver->watching);
  LOG ("flush large clause watches");
  watches *all_watches = solver->watches;
  signed char *marks = solver->marks;
  for (all_literals (lit)) {
    watches *lit_watches = all_watches + lit;
    watch *begin = BEGIN_WATCHES (*lit_watches), *q = begin;
    const watch *const end = END_WATCHES (*lit_watches), *p = q;
    while (p != end) {
      const watch watch = *q++ = *p++;
      if (!watch.type.binary)
        p++, q--;
      else {
        const unsigned other = watch.binary.lit;
        if (marks[other]) {
          if (lit < other) {
            LOGBINARY (lit, other, "flushing duplicated");
            kissat_delete_binary (solver, lit, other);
          }
          q--;
        } else
          marks[other] = 1;
      }
    }
    SET_END_OF_WATCHES (*lit_watches, q);
    for (p = begin; p != q; p++) {
      KISSAT_assert (p->type.binary);
      marks[p->binary.lit] = 0;
    }
  }
}

Here is the call graph for this function:

Here is the caller graph for this function:

kissat_remove_binary_watch()

ABC_NAMESPACE_IMPL_START void kissat_remove_binary_watch	(	kissat *	solver,
		watches *	watches,
		unsigned	lit )

Definition at line 8 of file watch.c.

                                               {
  watch *const begin = BEGIN_WATCHES (*watches);
  watch *const end = END_WATCHES (*watches);
  watch *q = begin;
  watch const *p = q;
#ifndef KISSAT_NDEBUG
  bool found = false;
#endif
  while (p != end) {
    const watch watch = *q++ = *p++;
    if (!watch.type.binary) {
      *q++ = *p++;
      continue;
    }
    const unsigned other = watch.binary.lit;
    if (other != lit)
      continue;
#ifndef KISSAT_NDEBUG
    KISSAT_assert (!found);
    found = true;
#endif
    q--;
  }
  KISSAT_assert (found);
#ifdef KISSAT_COMPACT
  watches->size -= 1;
#else
  KISSAT_assert (begin + 1 <= end);
  watches->end -= 1;
#endif
  const watch empty = {.raw = INVALID_VECTOR_ELEMENT};
  end[-1] = empty;
  KISSAT_assert (solver->vectors.usable < MAX_SECTOR - 1);
  solver->vectors.usable += 1;
  kissat_check_vectors (solver);
}

kissat_remove_blocking_watch()

void kissat_remove_blocking_watch	(	kissat *	solver,
		watches *	watches,
		reference	ref )

Definition at line 46 of file watch.c.

                                                  {
  KISSAT_assert (solver->watching);
  watch *const begin = BEGIN_WATCHES (*watches);
  watch *const end = END_WATCHES (*watches);
  watch *q = begin;
  watch const *p = q;
#ifndef KISSAT_NDEBUG
  bool found = false;
#endif
  while (p != end) {
    const watch head = *q++ = *p++;
    if (head.type.binary)
      continue;
    const watch tail = *q++ = *p++;
    if (tail.raw != ref)
      continue;
#ifndef KISSAT_NDEBUG
    KISSAT_assert (!found);
    found = true;
#endif
    q -= 2;
  }
  KISSAT_assert (found);
#ifdef KISSAT_COMPACT
  watches->size -= 2;
#else
  KISSAT_assert (begin + 2 <= end);
  watches->end -= 2;
#endif
  const watch empty = {.raw = INVALID_VECTOR_ELEMENT};
  end[-2] = end[-1] = empty;
  KISSAT_assert (solver->vectors.usable < MAX_SECTOR - 2);
  solver->vectors.usable += 2;
  kissat_check_vectors (solver);
}

kissat_substitute_large_watch()

void kissat_substitute_large_watch	(	kissat *	solver,
		watches *	watches,
		watch	src,
		watch	dst )

Definition at line 83 of file watch.c.

                                                          {
  KISSAT_assert (!solver->watching);
  watch *const begin = BEGIN_WATCHES (*watches);
  const watch *const end = END_WATCHES (*watches);
#ifndef KISSAT_NDEBUG
  bool found = false;
#endif
  for (watch *p = begin; p != end; p++) {
    const watch head = *p;
    if (head.raw != src.raw)
      continue;
#ifndef KISSAT_NDEBUG
    found = true;
#endif
    *p = dst;
    break;
  }
  KISSAT_assert (found);
}

kissat_watch_large_clauses()

void kissat_watch_large_clauses

(

kissat *

solver

)

Definition at line 145 of file watch.c.

                                                 {
  LOG ("watching all large clauses");
  KISSAT_assert (solver->watching);
 
  const value *const values = solver->values;
  const assigned *const assigned = solver->assigned;
  watches *watches = solver->watches;
  ward *const arena = BEGIN_STACK (solver->arena);
 
  for (all_clauses (c)) {
    if (c->garbage)
      continue;
 
    unsigned *lits = c->lits;
    kissat_sort_literals (solver, values, assigned, c->size, lits);
    c->searched = 2;
 
    const reference ref = (ward *) c - arena;
    const unsigned l0 = lits[0];
    const unsigned l1 = lits[1];
 
    kissat_push_blocking_watch (solver, watches + l0, l1, ref);
    kissat_push_blocking_watch (solver, watches + l1, l0, ref);
  }
}

Here is the call graph for this function:

Here is the caller graph for this function: