#include "arena.h"
#include "array.h"
#include "assign.h"
#include "averages.h"
#include "check.h"
#include "classify.h"
#include "clause.h"
#include "cover.h"
#include "extend.h"
#include "flags.h"
#include "format.h"
#include "frames.h"
#include "heap.h"
#include "kimits.h"
#include "kissat.h"
#include "literal.h"
#include "mode.h"
#include "options.h"
#include "phases.h"
#include "profile.h"
#include "proof.h"
#include "queue.h"
#include "random.h"
#include "reluctant.h"
#include "rephase.h"
#include "smooth.h"
#include "stack.h"
#include "statistics.h"
#include "value.h"
#include "vector.h"
#include "watch.h"
#include "global.h"
Go to the source code of this file.
|
| typedef typedefABC_NAMESPACE_HEADER_START struct datarank | datarank |
| |
| typedef struct import | import |
| |
| typedef struct termination | termination |
| |
◆ all_clauses
Value:
C != C##_END && (C##_NEXT = kissat_next_clause (C), true); \
C = C##_NEXT
Definition at line 279 of file internal.h.
279#define all_clauses(C) \
280 clause *C = (clause *) BEGIN_STACK (solver->arena), \
281 *const C##_END = (clause *) END_STACK (solver->arena), *C##_NEXT; \
282 C != C##_END && (C##_NEXT = kissat_next_clause (C), true); \
283 C = C##_NEXT
◆ all_literals
| #define all_literals |
( |
| LIT | ) |
|
Value:
Definition at line 274 of file internal.h.
274#define all_literals(LIT) \
275 unsigned LIT = 0, LIT##_END = LITS; \
276 LIT != LIT##_END; \
277 ++LIT
◆ all_variables
| #define all_variables |
( |
| IDX | ) |
|
Value:
Definition at line 269 of file internal.h.
269#define all_variables(IDX) \
270 unsigned IDX = 0, IDX##_END = solver->vars; \
271 IDX != IDX##_END; \
272 ++IDX
◆ capacity_last_learned
| #define capacity_last_learned (sizeof solver->last_learned / sizeof *solver->last_learned) |
Definition at line 285 of file internal.h.
285#define capacity_last_learned \
286 (sizeof solver->last_learned / sizeof *solver->last_learned)
◆ LITS
| #define LITS (2 * solver->vars) |
◆ real_end_last_learned
◆ really_all_last_learned
| #define really_all_last_learned |
( |
| REF_PTR | ) |
|
Value:
REF_PTR != REF_PTR##_END; \
REF_PTR++
#define real_end_last_learned
ABC_NAMESPACE_HEADER_START typedef unsigned reference
Definition at line 290 of file internal.h.
290#define really_all_last_learned(REF_PTR) \
291 reference *REF_PTR = solver->last_learned, \
292 *REF_PTR##_END = real_end_last_learned; \
293 REF_PTR != REF_PTR##_END; \
294 REF_PTR++
◆ SCORES
◆ TIER1
| #define TIER1 (solver->tier1[0]) |
◆ TIER2
| #define TIER2 (solver->tier2[1]) |
◆ VARS
◆ datarank
| typedef typedefABC_NAMESPACE_HEADER_START struct datarank datarank |
◆ import
| typedef struct import import |
◆ termination
| typedef struct termination termination |
◆ kissat_reset_last_learned()
| void kissat_reset_last_learned |
( |
kissat * | solver | ) |
|
Definition at line 22 of file internal.c.
22 {
25}
#define really_all_last_learned(REF_PTR)
◆ STACK() [1/5]
◆ STACK() [2/5]
◆ STACK() [3/5]
◆ STACK() [4/5]
| typedef STACK |
( |
watch * | | ) |
|
◆ STACK() [5/5]