ABC: A System for Sequential Synthesis and Verification
 
Loading...
Searching...
No Matches
queue.h
Go to the documentation of this file.
1#ifndef _queue_h_INCLUDED
2#define _queue_h_INCLUDED
3
4#include "global.h"
6
7#define DISCONNECT UINT_MAX
8#define DISCONNECTED(IDX) ((int) (IDX) < 0)
9
10struct kissat;
11
12typedef struct links links;
13typedef struct queue queue;
14
15struct links {
16 unsigned prev, next;
17 unsigned stamp;
18};
19
20struct queue {
21 unsigned first, last, stamp;
22 struct {
23 unsigned idx, stamp;
25};
26
27void kissat_init_queue (struct kissat *);
30
31#define LINK(IDX) (solver->links[KISSAT_assert ((IDX) < VARS), (IDX)])
32
33#if defined(CHECK_QUEUE) && !defined(KISSAT_NDEBUG)
34void kissat_check_queue (struct kissat *);
35#else
36#define kissat_check_queue(...) \
37 do { \
38 } while (0)
39#endif
40
42
43#endif
#define ABC_NAMESPACE_HEADER_END
#define ABC_NAMESPACE_HEADER_START
NAMESPACES ///.
void kissat_reset_search_of_queue(struct kissat *)
Definition queue.c:15
void kissat_init_queue(struct kissat *)
Definition queue.c:7
void kissat_reassign_queue_stamps(struct kissat *)
Definition queue.c:24
#define kissat_check_queue(...)
Definition queue.h:36
Definition queue.h:20
unsigned last
Definition queue.h:21
unsigned idx
Definition queue.h:23
unsigned first
Definition queue.h:21
unsigned stamp
Definition queue.h:21
struct queue::@155145366230376277010262212306311251364106156233 search