abc-master
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Friends Macros
Data Structures | Macros | Typedefs | Functions | Variables
espresso.h File Reference
#include "sparse.h"
#include "mincov.h"
#include "util_hack.h"

Go to the source code of this file.

Data Structures

struct  set_family
 
struct  cost_struct
 
struct  pair_struct
 
struct  symbolic_list_struct
 
struct  symbolic_label_struct
 
struct  symbolic_struct
 
struct  PLA_t
 
struct  pla_types_struct
 
struct  cube_struct
 
struct  cdata_struct
 

Macros

#define ABC__misc__espresso__espresso_h
 
#define print_time(t)   util_print_time(t)
 
#define LOGBPI   4 /* log(BPI)/log(2) */
 
#define WHICH_WORD(element)   (((element) >> LOGBPI) + 1)
 
#define WHICH_BIT(element)   ((element) & (BPI-1))
 
#define SET_SIZE(size)   ((size) <= BPI ? 3 : (WHICH_WORD((size)-1) + 2))
 
#define LOOP(set)   (set[0] & 0x03ff)
 
#define PUTLOOP(set, i)   (set[0] &= ~0x03ff, set[0] |= (i))
 
#define LOOPCOPY(set)   (LOOP(set) + 1)
 
#define SIZE(set)   (set[LOOP(set)+1])
 
#define PUTSIZE(set, size)   ((set[LOOP(set)+1]) = (size))
 
#define NELEM(set)   (BPI * LOOP(set))
 
#define LOOPINIT(size)   ((size <= BPI) ? 1 : WHICH_WORD((size)-1))
 
#define SET(set, flag)   (set[0] |= (flag))
 
#define RESET(set, flag)   (set[0] &= ~ (flag))
 
#define TESTP(set, flag)   (set[0] & (flag))
 
#define PRIME   0x8000 /* cube is prime */
 
#define NONESSEN   0x4000 /* cube cannot be essential prime */
 
#define ACTIVE   0x2000 /* cube is still active */
 
#define REDUND   0x1000 /* cube is redundant(at this point) */
 
#define COVERED   0x0800 /* cube has been covered */
 
#define RELESSEN   0x0400 /* cube is relatively essential */
 
#define foreach_set(R, last, p)   for(p=R->data,last=p+R->count*R->wsize;p<last;p+=R->wsize)
 
#define foreach_remaining_set(R, last, pfirst, p)   for(p=pfirst+R->wsize,last=R->data+R->count*R->wsize;p<last;p+=R->wsize)
 
#define foreach_active_set(R, last, p)   foreach_set(R,last,p) if (TESTP(p, ACTIVE))
 
#define foreachi_set(R, i, p)   for(p=R->data,i=0;i<R->count;p+=R->wsize,i++)
 
#define foreachi_active_set(R, i, p)   foreachi_set(R,i,p) if (TESTP(p, ACTIVE))
 
#define foreach_set_element(p, i, val, base)
 
#define GETSET(family, index)   ((family)->data + (family)->wsize * (index))
 
#define set_new(size)   set_clear(ALLOC(unsigned int, SET_SIZE(size)), size)
 
#define set_full(size)   set_fill(ALLOC(unsigned int, SET_SIZE(size)), size)
 
#define set_save(r)   set_copy(ALLOC(unsigned int, SET_SIZE(NELEM(r))), r)
 
#define set_free(r)   FREE(r)
 
#define is_in_set(set, e)   (set[WHICH_WORD(e)] & (1 << WHICH_BIT(e)))
 
#define set_remove(set, e)   (set[WHICH_WORD(e)] &= ~ (1 << WHICH_BIT(e)))
 
#define set_insert(set, e)   (set[WHICH_WORD(e)] |= 1 << WHICH_BIT(e))
 
#define INLINEset_copy(r, a)   {register int i_=LOOPCOPY(a); do r[i_]=a[i_]; while (--i_>=0);}
 
#define INLINEset_clear(r, size)   {register int i_=LOOPINIT(size); *r=i_; do r[i_] = 0; while (--i_ > 0);}
 
#define INLINEset_fill(r, size)
 
#define INLINEset_and(r, a, b)
 
#define INLINEset_or(r, a, b)
 
#define INLINEset_diff(r, a, b)
 
#define INLINEset_ndiff(r, a, b, fullset)
 
#define INLINEset_xor(r, a, b)
 
#define INLINEset_xnor(r, a, b, fullset)
 
#define INLINEset_merge(r, a, b, mask)
 
#define INLINEsetp_implies(a, b, when_false)
 
#define INLINEsetp_disjoint(a, b, when_false)
 
#define INLINEsetp_equal(a, b, when_false)
 
#define count_ones(v)   (bit_count[v & 255] + bit_count[(v >> 8) & 255])
 
#define bool   int
 
#define FALSE   0
 
#define TRUE   1
 
#define MAYBE   2
 
#define print_bool(x)   ((x) == 0 ? "FALSE" : ((x) == 1 ? "TRUE" : "MAYBE"))
 
#define pcube   pset
 
#define new_cube()   set_new(cube.size)
 
#define free_cube(r)   set_free(r)
 
#define pcover   pset_family
 
#define new_cover(i)   sf_new(i, cube.size)
 
#define free_cover(r)   sf_free(r)
 
#define free_cubelist(T)   FREE(T[0]); FREE(T);
 
#define equal(a, b)   (strcmp(a,b) == 0)
 
#define CUBELISTSIZE(T)   (((pcube *) T[1] - T) - 3)
 
#define IN
 
#define OUT
 
#define INOUT
 
#define F_type   1
 
#define D_type   2
 
#define R_type   4
 
#define PLEASURE_type   8 /* output format */
 
#define EQNTOTT_type   16 /* output format algebraic eqns */
 
#define KISS_type   128 /* output format kiss */
 
#define CONSTRAINTS_type   256 /* output the constraints (numeric) */
 
#define SYMBOLIC_CONSTRAINTS_type   512 /* output the constraints (symbolic) */
 
#define FD_type   (F_type | D_type)
 
#define FR_type   (F_type | R_type)
 
#define DR_type   (D_type | R_type)
 
#define FDR_type   (F_type | D_type | R_type)
 
#define COMPL   0x0001
 
#define ESSEN   0x0002
 
#define EXPAND   0x0004
 
#define EXPAND1   0x0008
 
#define GASP   0x0010
 
#define IRRED   0x0020
 
#define REDUCE   0x0040
 
#define REDUCE1   0x0080
 
#define SPARSE   0x0100
 
#define TAUT   0x0200
 
#define EXACT   0x0400
 
#define MINCOV   0x0800
 
#define MINCOV1   0x1000
 
#define SHARP   0x2000
 
#define IRRED1   0x4000
 
#define VERSION   "UC Berkeley, Espresso Version #2.3, Release date 01/31/88"
 
#define TIME_COUNT   16
 
#define READ_TIME   0
 
#define COMPL_TIME   1
 
#define ONSET_TIME   2
 
#define ESSEN_TIME   3
 
#define EXPAND_TIME   4
 
#define IRRED_TIME   5
 
#define REDUCE_TIME   6
 
#define GEXPAND_TIME   7
 
#define GIRRED_TIME   8
 
#define GREDUCE_TIME   9
 
#define PRIMES_TIME   10
 
#define MINCOV_TIME   11
 
#define MV_REDUCE_TIME   12
 
#define RAISE_IN_TIME   13
 
#define VERIFY_TIME   14
 
#define WRITE_TIME   15
 
#define NUMINPUTS   cube.num_binary_vars
 
#define NUMOUTPUTS   cube.part_size[cube.num_vars - 1]
 
#define POSITIVE_PHASE(pos)   (is_in_set(PLA->phase, cube.first_part[cube.output]+pos) != 0)
 
#define INLABEL(var)   PLA->label[cube.first_part[var] + 1]
 
#define OUTLABEL(pos)   PLA->label[cube.first_part[cube.output] + pos]
 
#define GETINPUT(c, pos)   ((c[WHICH_WORD(2*pos)] >> WHICH_BIT(2*pos)) & 3)
 
#define GETOUTPUT(c, pos)   (is_in_set(c, cube.first_part[cube.output] + pos) != 0)
 
#define PUTINPUT(c, pos, value)
 
#define PUTOUTPUT(c, pos, value)
 
#define TWO   3
 
#define DASH   3
 
#define ONE   2
 
#define ZERO   1
 
#define EXEC(fct, name, S)   {long t=ptime();fct;if(trace)print_trace(S,name,ptime()-t);}
 
#define EXEC_S(fct, name, S)   {long t=ptime();fct;if(summary)print_trace(S,name,ptime()-t);}
 
#define EXECUTE(fct, i, S, cost)   {long t=ptime();fct;totals(t,i,S,&(cost));}
 
#define CUBE_TEMP   10
 
#define DISJOINT   0x5555
 

Typedefs

typedef unsigned int * pset
 
typedef struct set_family set_family_t
 
typedef struct set_family * pset_family
 
typedef struct cost_struct cost_t
 
typedef struct cost_struct * pcost
 
typedef struct pair_struct pair_t
 
typedef struct pair_struct * ppair
 
typedef struct symbolic_list_struct symbolic_list_t
 
typedef struct
symbolic_label_struct 		symbolic_label_t
 
typedef struct symbolic_struct symbolic_t
 
typedef struct PLA_t * pPLA
 

Functions

ABC_NAMESPACE_HEADER_END int binate_split_select ()
 
pcover cubeunlist ()
 
pcube * cofactor ()
 
pcube * cube1list ()
 
pcube * cube2list ()
 
pcube * cube3list ()
 
pcube * scofactor ()
 
void massive_count ()
 
pcover complement ()
 
pcover simplify ()
 
void simp_comp ()
 
int d1_rm_equal ()
 
int rm2_contain ()
 
int rm2_equal ()
 
int rm_contain ()
 
int rm_equal ()
 
int rm_rev_contain ()
 
pset * sf_list ()
 
pset * sf_sort ()
 
pset_family d1merge ()
 
pset_family dist_merge ()
 
pset_family sf_contain ()
 
pset_family sf_dupl ()
 
pset_family sf_ind_contain ()
 
pset_family sf_ind_unlist ()
 
pset_family sf_merge ()
 
pset_family sf_rev_contain ()
 
pset_family sf_union ()
 
pset_family sf_unlist ()
 
void cube_setup ()
 
void restore_cube_struct ()
 
void save_cube_struct ()
 
void setdown_cube ()
 
void PLA_labels ()
 
char * get_word ()
 
int label_index ()
 
int read_pla ()
 
int read_symbolic ()
 
pPLA new_PLA ()
 
void PLA_summary ()
 
void free_PLA ()
 
void parse_pla ()
 
void read_cube ()
 
void skip_line ()
 
void foreach_output_function ()
 
int cubelist_partition ()
 
int so_both_do_espresso ()
 
int so_both_do_exact ()
 
int so_both_save ()
 
int so_do_espresso ()
 
int so_do_exact ()
 
int so_save ()
 
pcover cof_output ()
 
pcover lex_sort ()
 
pcover mini_sort ()
 
pcover random_order ()
 
pcover size_sort ()
 
pcover sort_reduce ()
 
pcover uncof_output ()
 
pcover unravel ()
 
pcover unravel_range ()
 
void so_both_espresso ()
 
void so_espresso ()
 
char * fmt_cost ()
 
char * print_cost ()
 
char * strsav ()
 
void copy_cost ()
 
void cover_cost ()
 
void fatal ()
 
void print_trace ()
 
void size_stamp ()
 
void totals ()
 
char * fmt_cube ()
 
char * fmt_expanded_cube ()
 
char * pc1 ()
 
char * pc2 ()
 
char * pc3 ()
 
void makeup_labels ()
 
void kiss_output ()
 
void kiss_print_cube ()
 
void output_symbolic_constraints ()
 
void cprint ()
 
void debug1_print ()
 
void debug_print ()
 
void eqn_output ()
 
void fpr_header ()
 
void fprint_pla ()
 
void pls_group ()
 
void pls_label ()
 
void pls_output ()
 
void print_cube ()
 
void print_expanded_cube ()
 
void sf_debug_print ()
 
void find_equiv_outputs ()
 
int check_equiv ()
 
pcover espresso ()
 
bool essen_cube ()
 
pcover cb_consensus ()
 
pcover cb_consensus_dist0 ()
 
pcover essential ()
 
pcover minimize_exact ()
 
pcover minimize_exact_literals ()
 
bool feasibly_covered ()
 
int most_frequent ()
 
pcover all_primes ()
 
pcover expand ()
 
pcover find_all_primes ()
 
void elim_lowering ()
 
void essen_parts ()
 
void essen_raising ()
 
void expand1 ()
 
void mincov ()
 
void select_feasible ()
 
void setup_BB_CC ()
 
pcover expand_gasp ()
 
pcover irred_gasp ()
 
pcover last_gasp ()
 
pcover super_gasp ()
 
void expand1_gasp ()
 
int util_getopt ()
 
void find_dc_inputs ()
 
void find_inputs ()
 
void form_bitvector ()
 
void map_dcset ()
 
void map_output_symbolic ()
 
void map_symbolic ()
 
pcover map_symbolic_cover ()
 
void symbolic_hack_labels ()
 
bool cube_is_covered ()
 
bool taut_special_cases ()
 
bool tautology ()
 
pcover irredundant ()
 
void mark_irredundant ()
 
void irred_split_cover ()
 
sm_matrix * irred_derive_table ()
 
pset minterms ()
 
void explode ()
 
void map ()
 
void output_phase_setup ()
 
pPLA set_phase ()
 
pcover opo ()
 
pcube find_phase ()
 
pset_family find_covers ()
 
pset_family form_cover_table ()
 
pset_family opo_leaf ()
 
pset_family opo_recur ()
 
void opoall ()
 
void phase_assignment ()
 
void repeated_phase_assignment ()
 
void generate_all_pairs ()
 
int ** find_pairing_cost ()
 
void find_best_cost ()
 
int greedy_best_cost ()
 
void minimize_pair ()
 
void pair_free ()
 
void pair_all ()
 
pcover delvar ()
 
pcover pairvar ()
 
ppair pair_best_cost ()
 
ppair pair_new ()
 
ppair pair_save ()
 
void print_pair ()
 
void find_optimal_pairing ()
 
void set_pair ()
 
void set_pair1 ()
 
pcover primes_consensus ()
 
bool sccc_special_cases ()
 
pcover reduce ()
 
pcube reduce_cube ()
 
pcube sccc ()
 
pcube sccc_cube ()
 
pcube sccc_merge ()
 
bool set_andp ()
 
bool set_orp ()
 
bool setp_disjoint ()
 
bool setp_empty ()
 
bool setp_equal ()
 
bool setp_full ()
 
bool setp_implies ()
 
char * pbv1 ()
 
char * ps1 ()
 
int * sf_count ()
 
int * sf_count_restricted ()
 
int bit_index ()
 
int set_dist ()
 
int set_ord ()
 
void set_adjcnt ()
 
pset set_and ()
 
pset set_clear ()
 
pset set_copy ()
 
pset set_diff ()
 
pset set_fill ()
 
pset set_merge ()
 
pset set_or ()
 
pset set_xor ()
 
pset sf_and ()
 
pset sf_or ()
 
pset_family sf_active ()
 
pset_family sf_addcol ()
 
pset_family sf_addset ()
 
pset_family sf_append ()
 
pset_family sf_bm_read ()
 
pset_family sf_compress ()
 
pset_family sf_copy ()
 
pset_family sf_copy_col ()
 
pset_family sf_delc ()
 
pset_family sf_delcol ()
 
pset_family sf_inactive ()
 
pset_family sf_join ()
 
pset_family sf_new ()
 
pset_family sf_permute ()
 
pset_family sf_read ()
 
pset_family sf_save ()
 
pset_family sf_transpose ()
 
void set_write ()
 
void sf_bm_print ()
 
void sf_cleanup ()
 
void sf_delset ()
 
void sf_free ()
 
void sf_print ()
 
void sf_write ()
 
bool ccommon ()
 
bool cdist0 ()
 
bool full_row ()
 
int ascend ()
 
int cactive ()
 
int cdist ()
 
int cdist01 ()
 
int cvolume ()
 
int d1_order ()
 
int d1_order_size ()
 
int desc1 ()
 
int descend ()
 
int lex_order ()
 
int lex_order1 ()
 
pset force_lower ()
 
void consensus ()
 
pcover cb1_dsharp ()
 
pcover cb_dsharp ()
 
pcover cb_recur_dsharp ()
 
pcover cb_recur_sharp ()
 
pcover cb_sharp ()
 
pcover cv_dsharp ()
 
pcover cv_intersect ()
 
pcover cv_sharp ()
 
pcover dsharp ()
 
pcover make_disjoint ()
 
pcover sharp ()
 
pset do_sm_minimum_cover ()
 
pcover make_sparse ()
 
pcover mv_reduce ()
 
pcover find_all_minimal_covers_petrick ()
 
pcover map_cover_to_unate ()
 
pcover map_unate_to_cover ()
 
pset_family exact_minimum_cover ()
 
pset_family gen_primes ()
 
pset_family unate_compl ()
 
pset_family unate_complement ()
 
pset_family unate_intersect ()
 
void PLA_permute ()
 
bool PLA_verify ()
 
bool check_consistency ()
 
bool verify ()
 

Variables

int bit_count [256]
 
unsigned int debug
 
bool verbose_debug
 
char * total_name [TIME_COUNT]
 
long total_time [TIME_COUNT]
 
int total_calls [TIME_COUNT]
 
bool echo_comments
 
bool echo_unknown_commands
 
bool force_irredundant
 
bool skip_make_sparse
 
bool kiss
 
bool pos
 
bool print_solution
 
bool recompute_onset
 
bool remove_essential
 
bool single_expand
 
bool summary
 
bool trace
 
bool unwrap_onset
 
bool use_random_order
 
bool use_super_gasp
 
char * filename
 
bool debug_exact_minimization
 
struct pla_types_struct pla_types []
 
struct cube_struct cube temp_cube_save
 
struct cdata_struct cdata temp_cdata_save
 

Macro Definition Documentation

#define ABC__misc__espresso__espresso_h

Definition at line 21 of file espresso.h.

#define ACTIVE   0x2000 /* cube is still active */

Definition at line 129 of file espresso.h.

#define bool   int

Definition at line 254 of file espresso.h.

#define COMPL   0x0001

Definition at line 351 of file espresso.h.

#define COMPL_TIME   1

Definition at line 373 of file espresso.h.

#define CONSTRAINTS_type   256 /* output the constraints (numeric) */

Definition at line 343 of file espresso.h.

#define count_ones (   v)    (bit_count[v & 255] + bit_count[(v >> 8) & 255])

Definition at line 245 of file espresso.h.

#define COVERED   0x0800 /* cube has been covered */

Definition at line 131 of file espresso.h.

#define CUBE_TEMP   10

Definition at line 469 of file espresso.h.

#define CUBELISTSIZE (   T)    (((pcube *) T[1] - T) - 3)

Definition at line 329 of file espresso.h.

#define D_type   2

Definition at line 338 of file espresso.h.

#define DASH   3

Definition at line 413 of file espresso.h.

#define DISJOINT   0x5555

Definition at line 514 of file espresso.h.

#define DR_type   (D_type | R_type)

Definition at line 347 of file espresso.h.

#define EQNTOTT_type   16 /* output format algebraic eqns */

Definition at line 341 of file espresso.h.

#define equal (   a,
  b 
)    (strcmp(a,b) == 0)

Definition at line 326 of file espresso.h.

#define ESSEN   0x0002

Definition at line 352 of file espresso.h.

#define ESSEN_TIME   3

Definition at line 375 of file espresso.h.

#define EXACT   0x0400

Definition at line 361 of file espresso.h.

#define EXEC (   fct,
  name,
  S 
)    {long t=ptime();fct;if(trace)print_trace(S,name,ptime()-t);}

Definition at line 418 of file espresso.h.

#define EXEC_S (   fct,
  name,
  S 
)    {long t=ptime();fct;if(summary)print_trace(S,name,ptime()-t);}

Definition at line 420 of file espresso.h.

#define EXECUTE (   fct,
  i,
  S,
  cost 
)    {long t=ptime();fct;totals(t,i,S,&(cost));}

Definition at line 422 of file espresso.h.

#define EXPAND   0x0004

Definition at line 353 of file espresso.h.

#define EXPAND1   0x0008

Definition at line 354 of file espresso.h.

#define EXPAND_TIME   4

Definition at line 376 of file espresso.h.

#define F_type   1

Definition at line 337 of file espresso.h.

#define FALSE   0

Definition at line 255 of file espresso.h.

#define FD_type   (F_type | D_type)

Definition at line 345 of file espresso.h.

#define FDR_type   (F_type | D_type | R_type)

Definition at line 348 of file espresso.h.

#define foreach_active_set (   R,
  last,
  p 
)    foreach_set(R,last,p) if (TESTP(p, ACTIVE))

Definition at line 139 of file espresso.h.

#define foreach_remaining_set (   R,
  last,
  pfirst,
  p 
)    for(p=pfirst+R->wsize,last=R->data+R->count*R->wsize;p<last;p+=R->wsize)

Definition at line 137 of file espresso.h.

#define foreach_set (   R,
  last,
  p 
)    for(p=R->data,last=p+R->count*R->wsize;p<last;p+=R->wsize)

Definition at line 135 of file espresso.h.

#define foreach_set_element (   p,
  i,
  val,
  base 
)
Value:
for(i = LOOP(p); i > 0; ) \
for(val = p[i], base = --i << LOGBPI; val != 0; base++, val >>= 1) \
if (val & 1)
p
static Llb_Mgr_t * p
Definition: llb3Image.c:950
LOGBPI
#define LOGBPI
Definition: espresso.h:69
LOOP
#define LOOP(set)
Definition: espresso.h:104

Definition at line 155 of file espresso.h.

#define foreachi_active_set (   R,
  i,
  p 
)    foreachi_set(R,i,p) if (TESTP(p, ACTIVE))

Definition at line 145 of file espresso.h.

#define foreachi_set (   R,
  i,
  p 
)    for(p=R->data,i=0;i<R->count;p+=R->wsize,i++)

Definition at line 143 of file espresso.h.

#define FR_type   (F_type | R_type)

Definition at line 346 of file espresso.h.

#define free_cover (   r)    sf_free(r)

Definition at line 266 of file espresso.h.

#define free_cube (   r)    set_free(r)

Definition at line 263 of file espresso.h.

#define free_cubelist (   T)    FREE(T[0]); FREE(T);

Definition at line 267 of file espresso.h.

#define GASP   0x0010

Definition at line 355 of file espresso.h.

#define GETINPUT (   c,
  pos 
)    ((c[WHICH_WORD(2*pos)] >> WHICH_BIT(2*pos)) & 3)

Definition at line 400 of file espresso.h.

#define GETOUTPUT (   c,
  pos 
)    (is_in_set(c, cube.first_part[cube.output] + pos) != 0)

Definition at line 402 of file espresso.h.

#define GETSET (   family,
  index 
)    ((family)->data + (family)->wsize * (index))

Definition at line 161 of file espresso.h.

#define GEXPAND_TIME   7

Definition at line 379 of file espresso.h.

#define GIRRED_TIME   8

Definition at line 380 of file espresso.h.

#define GREDUCE_TIME   9

Definition at line 381 of file espresso.h.

#define IN

Definition at line 332 of file espresso.h.

#define INLABEL (   var)    PLA->label[cube.first_part[var] + 1]

Definition at line 397 of file espresso.h.

#define INLINEset_and (   r,
  a,
  b 
)
Value:
{register int i_=LOOP(a); PUTLOOP(r,i_);\
do r[i_] = a[i_] & b[i_]; while (--i_>0);}
PUTLOOP
#define PUTLOOP(set, i)
Definition: espresso.h:105
LOOP
#define LOOP(set)
Definition: espresso.h:104

Definition at line 202 of file espresso.h.

#define INLINEset_clear (   r,
  size 
)    {register int i_=LOOPINIT(size); *r=i_; do r[i_] = 0; while (--i_ > 0);}

Definition at line 197 of file espresso.h.

#define INLINEset_copy (   r,
  a 
)    {register int i_=LOOPCOPY(a); do r[i_]=a[i_]; while (--i_>=0);}

Definition at line 195 of file espresso.h.

#define INLINEset_diff (   r,
  a,
  b 
)
Value:
{register int i_=LOOP(a); PUTLOOP(r,i_);\
do r[i_] = a[i_] & ~ b[i_]; while (--i_>0);}
PUTLOOP
#define PUTLOOP(set, i)
Definition: espresso.h:105
LOOP
#define LOOP(set)
Definition: espresso.h:104

Definition at line 208 of file espresso.h.

#define INLINEset_fill (   r,
  size 
)
Value:
{register int i_=LOOPINIT(size); *r=i_; \
r[i_]=((unsigned int)(~0))>>(i_*BPI-size); while(--i_>0) r[i_]=~0;}
size
static int size
Definition: cuddSign.c:86
LOOPINIT
#define LOOPINIT(size)
Definition: espresso.h:117

Definition at line 199 of file espresso.h.

#define INLINEset_merge (   r,
  a,
  b,
  mask 
)
Value:
{register int i_=LOOP(a); PUTLOOP(r,i_);\
do r[i_] = (a[i_]&mask[i_]) | (b[i_]&~mask[i_]); while (--i_>0);}
PUTLOOP
#define PUTLOOP(set, i)
Definition: espresso.h:105
LOOP
#define LOOP(set)
Definition: espresso.h:104

Definition at line 225 of file espresso.h.

#define INLINEset_ndiff (   r,
  a,
  b,
  fullset 
)
Value:
{register int i_=LOOP(a); PUTLOOP(r,i_);\
do r[i_] = fullset[i_] & (a[i_] | ~ b[i_]); while (--i_>0);}
PUTLOOP
#define PUTLOOP(set, i)
Definition: espresso.h:105
LOOP
#define LOOP(set)
Definition: espresso.h:104

Definition at line 211 of file espresso.h.

#define INLINEset_or (   r,
  a,
  b 
)
Value:
{register int i_=LOOP(a); PUTLOOP(r,i_);\
do r[i_] = a[i_] | b[i_]; while (--i_>0);}
PUTLOOP
#define PUTLOOP(set, i)
Definition: espresso.h:105
LOOP
#define LOOP(set)
Definition: espresso.h:104

Definition at line 205 of file espresso.h.

#define INLINEset_xnor (   r,
  a,
  b,
  fullset 
)
Value:
{register int i_=LOOP(a); PUTLOOP(r,i_);\
do r[i_] = fullset[i_] & ~ (a[i_] ^ b[i_]); while (--i_>0);}
PUTLOOP
#define PUTLOOP(set, i)
Definition: espresso.h:105
LOOP
#define LOOP(set)
Definition: espresso.h:104

Definition at line 221 of file espresso.h.

#define INLINEset_xor (   r,
  a,
  b 
)
Value:
{register int i_=LOOP(a); PUTLOOP(r,i_);\
do r[i_] = a[i_] ^ b[i_]; while (--i_>0);}
PUTLOOP
#define PUTLOOP(set, i)
Definition: espresso.h:105
LOOP
#define LOOP(set)
Definition: espresso.h:104

Definition at line 218 of file espresso.h.

#define INLINEsetp_disjoint (   a,
  b,
  when_false 
)
Value:
{register int i_=LOOP(a); do if (a[i_]&b[i_]) break; while (--i_>0);\
if (i_ != 0) when_false;}
if
if(last==0)
Definition: sparse_int.h:34
LOOP
#define LOOP(set)
Definition: espresso.h:104

Definition at line 231 of file espresso.h.

#define INLINEsetp_equal (   a,
  b,
  when_false 
)
Value:
{register int i_=LOOP(a); do if (a[i_]!=b[i_]) break; while (--i_>0);\
if (i_ != 0) when_false;}
if
if(last==0)
Definition: sparse_int.h:34
LOOP
#define LOOP(set)
Definition: espresso.h:104

Definition at line 234 of file espresso.h.

#define INLINEsetp_implies (   a,
  b,
  when_false 
)
Value:
{register int i_=LOOP(a); do if (a[i_]&~b[i_]) break; while (--i_>0);\
if (i_ != 0) when_false;}
if
if(last==0)
Definition: sparse_int.h:34
LOOP
#define LOOP(set)
Definition: espresso.h:104

Definition at line 228 of file espresso.h.

#define INOUT

Definition at line 334 of file espresso.h.

#define IRRED   0x0020

Definition at line 356 of file espresso.h.

#define IRRED1   0x4000

Definition at line 365 of file espresso.h.

#define IRRED_TIME   5

Definition at line 377 of file espresso.h.

#define is_in_set (   set,
  e 
)    (set[WHICH_WORD(e)] & (1 << WHICH_BIT(e)))

Definition at line 170 of file espresso.h.

#define KISS_type   128 /* output format kiss */

Definition at line 342 of file espresso.h.

#define LOGBPI   4 /* log(BPI)/log(2) */

Definition at line 69 of file espresso.h.

#define LOOP (   set)    (set[0] & 0x03ff)

Definition at line 104 of file espresso.h.

#define LOOPCOPY (   set)    (LOOP(set) + 1)

Definition at line 111 of file espresso.h.

#define LOOPINIT (   size)    ((size <= BPI) ? 1 : WHICH_WORD((size)-1))

Definition at line 117 of file espresso.h.

#define MAYBE   2

Definition at line 257 of file espresso.h.

#define MINCOV   0x0800

Definition at line 362 of file espresso.h.

#define MINCOV1   0x1000

Definition at line 363 of file espresso.h.

#define MINCOV_TIME   11

Definition at line 383 of file espresso.h.

#define MV_REDUCE_TIME   12

Definition at line 384 of file espresso.h.

#define NELEM (   set)    (BPI * LOOP(set))

Definition at line 116 of file espresso.h.

#define new_cover (   i)    sf_new(i, cube.size)

Definition at line 265 of file espresso.h.

#define new_cube ( )    set_new(cube.size)

Definition at line 262 of file espresso.h.

#define NONESSEN   0x4000 /* cube cannot be essential prime */

Definition at line 128 of file espresso.h.

#define NUMINPUTS   cube.num_binary_vars

Definition at line 391 of file espresso.h.

#define NUMOUTPUTS   cube.part_size[cube.num_vars - 1]

Definition at line 392 of file espresso.h.

#define ONE   2

Definition at line 414 of file espresso.h.

#define ONSET_TIME   2

Definition at line 374 of file espresso.h.

#define OUT

Definition at line 333 of file espresso.h.

#define OUTLABEL (   pos)    PLA->label[cube.first_part[cube.output] + pos]

Definition at line 398 of file espresso.h.

#define pcover   pset_family

Definition at line 264 of file espresso.h.

#define pcube   pset

Definition at line 261 of file espresso.h.

#define PLEASURE_type   8 /* output format */

Definition at line 340 of file espresso.h.

#define POSITIVE_PHASE (   pos)    (is_in_set(PLA->phase, cube.first_part[cube.output]+pos) != 0)

Definition at line 394 of file espresso.h.

#define PRIME   0x8000 /* cube is prime */

Definition at line 127 of file espresso.h.

#define PRIMES_TIME   10

Definition at line 382 of file espresso.h.

#define print_bool (   x)    ((x) == 0 ? "FALSE" : ((x) == 1 ? "TRUE" : "MAYBE"))

Definition at line 258 of file espresso.h.

#define print_time (   t)    util_print_time(t)

Definition at line 22 of file espresso.h.

#define PUTINPUT (   c,
  pos,
  value 
)
Value:
c[WHICH_WORD(2*pos)] = (c[WHICH_WORD(2*pos)] & ~(3 << WHICH_BIT(2*pos)))\
| (value << WHICH_BIT(2*pos))
pos
bool pos
Definition: globals.c:30
WHICH_BIT
#define WHICH_BIT(element)
Definition: espresso.h:88
WHICH_WORD
#define WHICH_WORD(element)
Definition: espresso.h:87
value
int value
Definition: misc/espresso/main.h:90

Definition at line 405 of file espresso.h.

#define PUTLOOP (   set,
  i 
)    (set[0] &= ~0x03ff, set[0] |= (i))

Definition at line 105 of file espresso.h.

#define PUTOUTPUT (   c,
  pos,
  value 
)
Value:
c[WHICH_WORD(pos)] = (c[WHICH_WORD(pos)] & ~(1 << WHICH_BIT(pos)))\
| (value << WHICH_BIT(pos))
pos
bool pos
Definition: globals.c:30
WHICH_BIT
#define WHICH_BIT(element)
Definition: espresso.h:88
WHICH_WORD
#define WHICH_WORD(element)
Definition: espresso.h:87
value
int value
Definition: misc/espresso/main.h:90

Definition at line 408 of file espresso.h.

#define PUTSIZE (   set,
  size 
)    ((set[LOOP(set)+1]) = (size))

Definition at line 113 of file espresso.h.

#define R_type   4

Definition at line 339 of file espresso.h.

#define RAISE_IN_TIME   13

Definition at line 385 of file espresso.h.

#define READ_TIME   0

Definition at line 372 of file espresso.h.

#define REDUCE   0x0040

Definition at line 357 of file espresso.h.

#define REDUCE1   0x0080

Definition at line 358 of file espresso.h.

#define REDUCE_TIME   6

Definition at line 378 of file espresso.h.

#define REDUND   0x1000 /* cube is redundant(at this point) */

Definition at line 130 of file espresso.h.

#define RELESSEN   0x0400 /* cube is relatively essential */

Definition at line 132 of file espresso.h.

#define RESET (   set,
  flag 
)    (set[0] &= ~ (flag))

Definition at line 123 of file espresso.h.

#define SET (   set,
  flag 
)    (set[0] |= (flag))

Definition at line 122 of file espresso.h.

#define set_free (   r)    FREE(r)

Definition at line 167 of file espresso.h.

#define set_full (   size)    set_fill(ALLOC(unsigned int, SET_SIZE(size)), size)

Definition at line 165 of file espresso.h.

#define set_insert (   set,
  e 
)    (set[WHICH_WORD(e)] |= 1 << WHICH_BIT(e))

Definition at line 172 of file espresso.h.

#define set_new (   size)    set_clear(ALLOC(unsigned int, SET_SIZE(size)), size)

Definition at line 164 of file espresso.h.

#define set_remove (   set,
  e 
)    (set[WHICH_WORD(e)] &= ~ (1 << WHICH_BIT(e)))

Definition at line 171 of file espresso.h.

#define set_save (   r)    set_copy(ALLOC(unsigned int, SET_SIZE(NELEM(r))), r)

Definition at line 166 of file espresso.h.

#define SET_SIZE (   size)    ((size) <= BPI ? 3 : (WHICH_WORD((size)-1) + 2))

Definition at line 94 of file espresso.h.

#define SHARP   0x2000

Definition at line 364 of file espresso.h.

#define SIZE (   set)    (set[LOOP(set)+1])

Definition at line 112 of file espresso.h.

#define SPARSE   0x0100

Definition at line 359 of file espresso.h.

#define SYMBOLIC_CONSTRAINTS_type   512 /* output the constraints (symbolic) */

Definition at line 344 of file espresso.h.

#define TAUT   0x0200

Definition at line 360 of file espresso.h.

#define TESTP (   set,
  flag 
)    (set[0] & (flag))

Definition at line 124 of file espresso.h.

#define TIME_COUNT   16

Definition at line 371 of file espresso.h.

#define TRUE   1

Definition at line 256 of file espresso.h.

#define TWO   3

Definition at line 412 of file espresso.h.

#define VERIFY_TIME   14

Definition at line 386 of file espresso.h.

#define VERSION   "UC Berkeley, Espresso Version #2.3, Release date 01/31/88"

Definition at line 367 of file espresso.h.

#define WHICH_BIT (   element)    ((element) & (BPI-1))

Definition at line 88 of file espresso.h.

#define WHICH_WORD (   element)    (((element) >> LOGBPI) + 1)

Definition at line 87 of file espresso.h.

#define WRITE_TIME   15

Definition at line 387 of file espresso.h.

#define ZERO   1

Definition at line 415 of file espresso.h.

Typedef Documentation

typedef struct cost_struct cost_t
typedef struct pair_struct pair_t
typedef struct cost_struct * pcost
typedef struct pair_struct * ppair
typedef struct PLA_t * pPLA
typedef unsigned int* pset

Definition at line 73 of file espresso.h.

typedef struct set_family * pset_family
typedef struct set_family set_family_t
typedef struct symbolic_label_struct symbolic_label_t
typedef struct symbolic_list_struct symbolic_list_t
typedef struct symbolic_struct symbolic_t

Function Documentation

pcover all_primes ( )
int ascend ( )
ABC_NAMESPACE_HEADER_END int binate_split_select ( )
int bit_index ( )
int cactive ( )
pcover cb1_dsharp ( )
pcover cb_consensus ( )
pcover cb_consensus_dist0 ( )
pcover cb_dsharp ( )
pcover cb_recur_dsharp ( )
pcover cb_recur_sharp ( )
pcover cb_sharp ( )
bool ccommon ( )
int cdist ( )
bool cdist0 ( )
int cdist01 ( )
bool check_consistency ( )
int check_equiv ( )
pcover cof_output ( )
pcube* cofactor ( )
pcover complement ( )
void consensus ( )
void copy_cost ( )
void cover_cost ( )
void cprint ( )
pcube* cube1list ( )
pcube* cube2list ( )
pcube* cube3list ( )
bool cube_is_covered ( )
void cube_setup ( )

Definition at line 27 of file cubestr.c.

28 {
29  register int i, var;
30  register pcube p;
31 
32  if (cube.num_binary_vars < 0 || cube.num_vars < cube.num_binary_vars)
33  fatal("cube size is silly, error in .i/.o or .mv");
34 
35  cube.num_mv_vars = cube.num_vars - cube.num_binary_vars;
36  cube.output = cube.num_mv_vars > 0 ? cube.num_vars - 1 : -1;
37 
38  cube.size = 0;
39  cube.first_part = ALLOC(int, cube.num_vars);
40  cube.last_part = ALLOC(int, cube.num_vars);
41  cube.first_word = ALLOC(int, cube.num_vars);
42  cube.last_word = ALLOC(int, cube.num_vars);
43  for(var = 0; var < cube.num_vars; var++) {
44  if (var < cube.num_binary_vars)
45  cube.part_size[var] = 2;
46  cube.first_part[var] = cube.size;
47  cube.first_word[var] = WHICH_WORD(cube.size);
48  cube.size += ABS(cube.part_size[var]);
49  cube.last_part[var] = cube.size - 1;
50  cube.last_word[var] = WHICH_WORD(cube.size - 1);
51  }
52 
53  cube.var_mask = ALLOC(pset, cube.num_vars);
54  cube.sparse = ALLOC(int, cube.num_vars);
55  cube.binary_mask = new_cube();
56  cube.mv_mask = new_cube();
57  for(var = 0; var < cube.num_vars; var++) {
58  p = cube.var_mask[var] = new_cube();
59  for(i = cube.first_part[var]; i <= cube.last_part[var]; i++)
60  set_insert(p, i);
61  if (var < cube.num_binary_vars) {
62  INLINEset_or(cube.binary_mask, cube.binary_mask, p);
63  cube.sparse[var] = 0;
64  } else {
65  INLINEset_or(cube.mv_mask, cube.mv_mask, p);
66  cube.sparse[var] = 1;
67  }
68  }
69  if (cube.num_binary_vars == 0)
70  cube.inword = -1;
71  else {
72  cube.inword = cube.last_word[cube.num_binary_vars - 1];
73  cube.inmask = cube.binary_mask[cube.inword] & DISJOINT;
74  }
75 
76  cube.temp = ALLOC(pset, CUBE_TEMP);
77  for(i = 0; i < CUBE_TEMP; i++)
78  cube.temp[i] = new_cube();
79  cube.fullset = set_fill(new_cube(), cube.size);
80  cube.emptyset = new_cube();
81 
82  cdata.part_zeros = ALLOC(int, cube.size);
83  cdata.var_zeros = ALLOC(int, cube.num_vars);
84  cdata.parts_active = ALLOC(int, cube.num_vars);
85  cdata.is_unate = ALLOC(int, cube.num_vars);
86 }
CUBE_TEMP
#define CUBE_TEMP
Definition: espresso.h:469
fatal
void fatal(char *s)
Definition: cvrmisc.c:140
new_cube
#define new_cube()
Definition: espresso.h:262
p
static Llb_Mgr_t * p
Definition: llb3Image.c:950
Minisat::var
int var(Lit p)
Definition: SolverTypes.h:62
ABS
#define ABS(a)
Definition: util_old.h:250
INLINEset_or
#define INLINEset_or(r, a, b)
Definition: espresso.h:205
ALLOC
#define ALLOC(type, num)
Definition: avl.h:27
DISJOINT
#define DISJOINT
Definition: espresso.h:514
pset
unsigned int * pset
Definition: espresso.h:73
set_fill
pset set_fill()
set_insert
#define set_insert(set, e)
Definition: espresso.h:172
WHICH_WORD
#define WHICH_WORD(element)
Definition: espresso.h:87
pcube
#define pcube
Definition: espresso.h:261
int cubelist_partition ( )
pcover cubeunlist ( )
pcover cv_dsharp ( )
pcover cv_intersect ( )
pcover cv_sharp ( )
int cvolume ( )
int d1_order ( )
int d1_order_size ( )
int d1_rm_equal ( )
pset_family d1merge ( )
void debug1_print ( )
void debug_print ( )
pcover delvar ( )
int desc1 ( )
int descend ( )
pset_family dist_merge ( )
pset do_sm_minimum_cover ( )
pcover dsharp ( )
void elim_lowering ( )
void eqn_output ( )
pcover espresso ( )
bool essen_cube ( )
void essen_parts ( )
void essen_raising ( )
pcover essential ( )
pset_family exact_minimum_cover ( )
pcover expand ( )
void expand1 ( )
void expand1_gasp ( )
pcover expand_gasp ( )
void explode ( )
void fatal ( )
bool feasibly_covered ( )
pcover find_all_minimal_covers_petrick ( )
pcover find_all_primes ( )
void find_best_cost ( )
pset_family find_covers ( )
void find_dc_inputs ( )
void find_equiv_outputs ( )
void find_inputs ( )
void find_optimal_pairing ( )
int** find_pairing_cost ( )
pcube find_phase ( )
char* fmt_cost ( )
char* fmt_cube ( )
char* fmt_expanded_cube ( )
pset force_lower ( )
void foreach_output_function ( )
void form_bitvector ( )
pset_family form_cover_table ( )
void fpr_header ( )
void fprint_pla ( )
void free_PLA ( )
bool full_row ( )
pset_family gen_primes ( )
void generate_all_pairs ( )
char* get_word ( )
int greedy_best_cost ( )
sm_matrix* irred_derive_table ( )
pcover irred_gasp ( )
void irred_split_cover ( )
pcover irredundant ( )
void kiss_output ( )
void kiss_print_cube ( )
int label_index ( )
pcover last_gasp ( )
int lex_order ( )
int lex_order1 ( )
pcover lex_sort ( )
pcover make_disjoint ( )
pcover make_sparse ( )
void makeup_labels ( )
void map ( )
pcover map_cover_to_unate ( )
void map_dcset ( )
void map_output_symbolic ( )
void map_symbolic ( )
pcover map_symbolic_cover ( )
pcover map_unate_to_cover ( )
void mark_irredundant ( )
void massive_count ( )
void mincov ( )
pcover mini_sort ( )
pcover minimize_exact ( )
pcover minimize_exact_literals ( )
void minimize_pair ( )
pset minterms ( )
int most_frequent ( )
pcover mv_reduce ( )
pPLA new_PLA ( )

Definition at line 648 of file cvrin.c.

649 {
650  pPLA PLA;
651 
652  PLA = ALLOC(PLA_t, 1);
653  PLA->F = PLA->D = PLA->R = (pcover) NULL;
654  PLA->phase = (pcube) NULL;
655  PLA->pair = (ppair) NULL;
656  PLA->label = (char **) NULL;
657  PLA->filename = (char *) NULL;
658  PLA->pla_type = 0;
659  PLA->symbolic = NIL(symbolic_t);
660  PLA->symbolic_output = NIL(symbolic_t);
661  return PLA;
662 }
PLA_t::pair
ppair pair
Definition: espresso.h:320
symbolic_struct
Definition: espresso.h:305
pcover
#define pcover
Definition: espresso.h:264
NIL
#define NIL(type)
Definition: avl.h:25
PLA_t::symbolic
symbolic_t * symbolic
Definition: espresso.h:322
PLA_t::filename
char * filename
Definition: espresso.h:317
ALLOC
#define ALLOC(type, num)
Definition: avl.h:27
PLA_t::F
pcover F
Definition: espresso.h:316
PLA_t::pla_type
int pla_type
Definition: espresso.h:318
PLA_t::phase
pcube phase
Definition: espresso.h:319
PLA_t::D
pcover D
Definition: espresso.h:316
PLA_t::R
pcover R
Definition: espresso.h:316
ppair
struct pair_struct * ppair
PLA_t::symbolic_output
symbolic_t * symbolic_output
Definition: espresso.h:323
PLA_t::label
char ** label
Definition: espresso.h:321
PLA_t
Definition: espresso.h:315
pcube
#define pcube
Definition: espresso.h:261
pcover opo ( )
pset_family opo_leaf ( )
pset_family opo_recur ( )
void opoall ( )
void output_phase_setup ( )
void output_symbolic_constraints ( )
void pair_all ( )
ppair pair_best_cost ( )
void pair_free ( )
ppair pair_new ( )
ppair pair_save ( )
pcover pairvar ( )
void parse_pla ( )
char* pbv1 ( )
char* pc1 ( )
char* pc2 ( )
char* pc3 ( )
void phase_assignment ( )
void PLA_labels ( )
void PLA_permute ( )
void PLA_summary ( )
bool PLA_verify ( )
void pls_group ( )
void pls_label ( )
void pls_output ( )
pcover primes_consensus ( )
char* print_cost ( )
void print_cube ( )
void print_expanded_cube ( )
void print_pair ( )
void print_trace ( )
char* ps1 ( )
pcover random_order ( )
void read_cube ( )
int read_pla ( )
int read_symbolic ( )
pcover reduce ( )
pcube reduce_cube ( )
void repeated_phase_assignment ( )
void restore_cube_struct ( )

Definition at line 151 of file cubestr.c.

152 {
153  cube = temp_cube_save; /* structure copy ! */
154  cdata = temp_cdata_save; /* "" */
155 }
temp_cdata_save
struct cdata_struct cdata temp_cdata_save
Definition: globals.c:68
temp_cube_save
struct cube_struct cube temp_cube_save
Definition: globals.c:67
int rm2_contain ( )
int rm2_equal ( )
int rm_contain ( )
int rm_equal ( )
int rm_rev_contain ( )
void save_cube_struct ( )

Definition at line 134 of file cubestr.c.

135 {
136  temp_cube_save = cube; /* structure copy ! */
137  temp_cdata_save = cdata; /* "" */
138 
139  cube.first_part = cube.last_part = (int *) NULL;
140  cube.first_word = cube.last_word = (int *) NULL;
141  cube.part_size = (int *) NULL;
142  cube.binary_mask = cube.mv_mask = (pcube) NULL;
143  cube.fullset = cube.emptyset = (pcube) NULL;
144  cube.var_mask = cube.temp = (pcube *) NULL;
145 
146  cdata.part_zeros = cdata.var_zeros = cdata.parts_active = (int *) NULL;
147  cdata.is_unate = (bool *) NULL;
148 }
cdata_struct::part_zeros
int * part_zeros
Definition: espresso.h:494
temp_cdata_save
struct cdata_struct cdata temp_cdata_save
Definition: globals.c:68
temp_cube_save
struct cube_struct cube temp_cube_save
Definition: globals.c:67
pcube
#define pcube
Definition: espresso.h:261
pcube sccc ( )
pcube sccc_cube ( )
pcube sccc_merge ( )
bool sccc_special_cases ( )
pcube* scofactor ( )
void select_feasible ( )
void set_adjcnt ( )
pset set_and ( )
bool set_andp ( )
pset set_clear ( )
pset set_copy ( )
pset set_diff ( )
int set_dist ( )
pset set_fill ( )
pset set_merge ( )
pset set_or ( )
int set_ord ( )
bool set_orp ( )
void set_pair ( )
void set_pair1 ( )
pPLA set_phase ( )
void set_write ( )
pset set_xor ( )
void setdown_cube ( )

Definition at line 95 of file cubestr.c.

96 {
97  register int i, var;
98 
99  FREE(cube.first_part);
100  FREE(cube.last_part);
101  FREE(cube.first_word);
102  FREE(cube.last_word);
103  FREE(cube.sparse);
104 
105  free_cube(cube.binary_mask);
106  free_cube(cube.mv_mask);
107  free_cube(cube.fullset);
108  free_cube(cube.emptyset);
109  for(var = 0; var < cube.num_vars; var++)
110  free_cube(cube.var_mask[var]);
111  FREE(cube.var_mask);
112 
113  for(i = 0; i < CUBE_TEMP; i++)
114  free_cube(cube.temp[i]);
115  FREE(cube.temp);
116 
117  FREE(cdata.part_zeros);
118  FREE(cdata.var_zeros);
119  FREE(cdata.parts_active);
120  FREE(cdata.is_unate);
121 
122  cube.first_part = cube.last_part = (int *) NULL;
123  cube.first_word = cube.last_word = (int *) NULL;
124  cube.sparse = (int *) NULL;
125  cube.binary_mask = cube.mv_mask = (pcube) NULL;
126  cube.fullset = cube.emptyset = (pcube) NULL;
127  cube.var_mask = cube.temp = (pcube *) NULL;
128 
129  cdata.part_zeros = cdata.var_zeros = cdata.parts_active = (int *) NULL;
130  cdata.is_unate = (bool *) NULL;
131 }
CUBE_TEMP
#define CUBE_TEMP
Definition: espresso.h:469
Minisat::var
int var(Lit p)
Definition: SolverTypes.h:62
free_cube
#define free_cube(r)
Definition: espresso.h:263
FREE
#define FREE(obj)
Definition: avl.h:31
pcube
#define pcube
Definition: espresso.h:261
bool setp_disjoint ( )
bool setp_empty ( )
bool setp_equal ( )
bool setp_full ( )
bool setp_implies ( )
void setup_BB_CC ( )
pset_family sf_active ( )
pset_family sf_addcol ( )
pset_family sf_addset ( )
pset sf_and ( )
pset_family sf_append ( )
void sf_bm_print ( )
pset_family sf_bm_read ( )
void sf_cleanup ( )

Definition at line 374 of file set.c.

375 {
376  register pset_family p, pnext;
377  for(p = set_family_garbage; p != (pset_family) NULL; p = pnext) {
378  pnext = p->next;
379  FREE(p);
380  }
381  set_family_garbage = (pset_family) NULL;
382 }
p
static Llb_Mgr_t * p
Definition: llb3Image.c:950
set_family::next
struct set_family * next
Definition: espresso.h:83
set_family
Definition: espresso.h:76
FREE
#define FREE(obj)
Definition: avl.h:31
pset_family
struct set_family * pset_family
set_family_garbage
static ABC_NAMESPACE_IMPL_START pset_family set_family_garbage
Definition: set.c:20
pset_family sf_compress ( )
pset_family sf_contain ( )
pset_family sf_copy ( )
pset_family sf_copy_col ( )
int* sf_count ( )
int* sf_count_restricted ( )
void sf_debug_print ( )
pset_family sf_delc ( )
pset_family sf_delcol ( )
void sf_delset ( )
pset_family sf_dupl ( )
void sf_free ( )
pset_family sf_inactive ( )
pset_family sf_ind_contain ( )
pset_family sf_ind_unlist ( )
pset_family sf_join ( )
pset* sf_list ( )
pset_family sf_merge ( )
pset_family sf_new ( )
pset sf_or ( )
pset_family sf_permute ( )
void sf_print ( )
pset_family sf_read ( )
pset_family sf_rev_contain ( )
pset_family sf_save ( )
pset* sf_sort ( )
pset_family sf_transpose ( )
pset_family sf_union ( )
pset_family sf_unlist ( )
void sf_write ( )
pcover sharp ( )
void simp_comp ( )
pcover simplify ( )
pcover size_sort ( )
void size_stamp ( )
void skip_line ( )
int so_both_do_espresso ( )
int so_both_do_exact ( )
void so_both_espresso ( )
int so_both_save ( )
int so_do_espresso ( )
int so_do_exact ( )
void so_espresso ( )
int so_save ( )
pcover sort_reduce ( )
char* strsav ( )
pcover super_gasp ( )
void symbolic_hack_labels ( )
bool taut_special_cases ( )
bool tautology ( )
void totals ( )
pset_family unate_compl ( )
pset_family unate_complement ( )
pset_family unate_intersect ( )
pcover uncof_output ( )
pcover unravel ( )
pcover unravel_range ( )
int util_getopt ( )
bool verify ( )

Variable Documentation

int bit_count[256]

Definition at line 70 of file globals.c.

unsigned int debug

Definition at line 19 of file globals.c.

bool debug_exact_minimization
bool echo_comments

Definition at line 25 of file globals.c.

bool echo_unknown_commands

Definition at line 26 of file globals.c.

char* filename

Definition at line 40 of file globals.c.

bool force_irredundant

Definition at line 27 of file globals.c.

bool kiss

Definition at line 29 of file globals.c.

struct pla_types_struct pla_types[]

Definition at line 42 of file globals.c.

bool pos

Definition at line 30 of file globals.c.

bool print_solution

Definition at line 31 of file globals.c.

bool recompute_onset

Definition at line 32 of file globals.c.

bool remove_essential

Definition at line 33 of file globals.c.

bool single_expand

Definition at line 34 of file globals.c.

bool skip_make_sparse

Definition at line 28 of file globals.c.

bool summary

Definition at line 35 of file globals.c.

struct cdata_struct cdata temp_cdata_save

Definition at line 68 of file globals.c.

struct cube_struct cube temp_cube_save

Definition at line 67 of file globals.c.

int total_calls[TIME_COUNT]

Definition at line 23 of file globals.c.

char* total_name[TIME_COUNT]

Definition at line 21 of file globals.c.

long total_time[TIME_COUNT]

Definition at line 22 of file globals.c.

bool trace

Definition at line 36 of file globals.c.

bool unwrap_onset

Definition at line 37 of file globals.c.

bool use_random_order

Definition at line 38 of file globals.c.

bool use_super_gasp

Definition at line 39 of file globals.c.

bool verbose_debug

Definition at line 20 of file globals.c.