1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
1019
1020
1021
1022
1023
1024
1025
1026
1027
1028
1029
1030
1031
1032
1033
1034
1035
1036
1037
1038
1039
1040
1041
1042
1043
1044
1045
1046
1047
1048
1049
1050
1051
1052
1053
1054
1055
1056
1057
1058
1059
1060
1061
1062
1063
1064
1065
1066
1067
1068
1069
1070
1071
1072
1073
1074
1075
1076
1077
1078
1079
1080
1081
1082
1083
1084
1085
1086
1087
1088
1089
1090
1091
1092
1093
1094
1095
1096
1097
1098
1099
1100
1101
1102
1103
1104
1105
1106
1107
1108
1109
1110
1111
1112
1113
1114
1115
1116
1117
1118
1119
1120
1121
1122
1123
1124
1125
1126
1127
1128
1129
1130
1131
1132
1133
|
/**CHeaderFile*****************************************************************
FileName [cuddInt.h]
PackageName [cudd]
Synopsis [Internal data structures of the CUDD package.]
Description []
SeeAlso []
Author [Fabio Somenzi]
Copyright [This file was created at the University of Colorado at
Boulder. The University of Colorado at Boulder makes no warranty
about the suitability of this software for any purpose. It is
presented on an AS IS basis.]
Revision [$Id: cuddInt.h,v 1.1.1.1 2003/02/24 22:23:52 wjiang Exp $]
******************************************************************************/
#ifndef _CUDDINT
#define _CUDDINT
/*---------------------------------------------------------------------------*/
/* Nested includes */
/*---------------------------------------------------------------------------*/
#ifdef DD_MIS
#include "array.h"
#include "list.h"
#include "st.h"
#include "espresso.h"
#include "node.h"
#ifdef SIS
#include "graph.h"
#include "astg.h"
#endif
#include "network.h"
#endif
#include <math.h>
#include "cudd.h"
#include "st.h"
#if defined(__GNUC__)
# define DD_INLINE __inline__
# if (__GNUC__ >2 || __GNUC_MINOR__ >=7)
# define DD_UNUSED __attribute__ ((__unused__))
# else
# define DD_UNUSED
# endif
#else
# if defined(__cplusplus)
# define DD_INLINE inline
# else
# define DD_INLINE
# endif
# define DD_UNUSED
#endif
/*---------------------------------------------------------------------------*/
/* Constant declarations */
/*---------------------------------------------------------------------------*/
#define DD_MAXREF ((DdHalfWord) ~0)
#define DD_DEFAULT_RESIZE 10 /* how many extra variables */
/* should be added when resizing */
#define DD_MEM_CHUNK 1022
/* These definitions work for CUDD_VALUE_TYPE == double */
#define DD_ONE_VAL (1.0)
#define DD_ZERO_VAL (0.0)
#define DD_EPSILON (1.0e-12)
/* The definitions of +/- infinity in terms of HUGE_VAL work on
** the DECstations and on many other combinations of OS/compiler.
*/
#ifdef HAVE_IEEE_754
# define DD_PLUS_INF_VAL (HUGE_VAL)
#else
# define DD_PLUS_INF_VAL (10e301)
# define DD_CRI_HI_MARK (10e150)
# define DD_CRI_LO_MARK (-(DD_CRI_HI_MARK))
#endif
#define DD_MINUS_INF_VAL (-(DD_PLUS_INF_VAL))
#define DD_NON_CONSTANT ((DdNode *) 1) /* for Cudd_bddIteConstant */
/* Unique table and cache management constants. */
#define DD_MAX_SUBTABLE_DENSITY 4 /* tells when to resize a subtable */
/* gc when this percent are dead (measured w.r.t. slots, not keys)
** The first limit (LO) applies normally. The second limit applies when
** the package believes more space for the unique table (i.e., more dead
** nodes) would improve performance, and the unique table is not already
** too large. The third limit applies when memory is low.
*/
#define DD_GC_FRAC_LO DD_MAX_SUBTABLE_DENSITY * 0.25
#define DD_GC_FRAC_HI DD_MAX_SUBTABLE_DENSITY * 1.0
#define DD_GC_FRAC_MIN 0.2
#define DD_MIN_HIT 30 /* resize cache when hit ratio
above this percentage (default) */
#define DD_MAX_LOOSE_FRACTION 5 /* 1 / (max fraction of memory used for
unique table in fast growth mode) */
#define DD_MAX_CACHE_FRACTION 3 /* 1 / (max fraction of memory used for
computed table if resizing enabled) */
#define DD_STASH_FRACTION 64 /* 1 / (fraction of memory set
aside for emergencies) */
#define DD_MAX_CACHE_TO_SLOTS_RATIO 4 /* used to limit the cache size */
/* Variable ordering default parameter values. */
#define DD_SIFT_MAX_VAR 1000
#define DD_SIFT_MAX_SWAPS 2000000
#define DD_DEFAULT_RECOMB 0
#define DD_MAX_REORDER_GROWTH 1.2
#define DD_FIRST_REORDER 4004 /* 4 for the constants */
#define DD_DYN_RATIO 2 /* when to dynamically reorder */
/* Primes for cache hash functions. */
#define DD_P1 12582917
#define DD_P2 4256249
#define DD_P3 741457
#define DD_P4 1618033999
/* Cache tags for 3-operand operators. These tags are stored in the
** least significant bits of the cache operand pointers according to
** the following scheme. The tag consists of two hex digits. Both digits
** must be even, so that they do not interfere with complementation bits.
** The least significant one is stored in Bits 3:1 of the f operand in the
** cache entry. Bit 1 is always 1, so that we can differentiate
** three-operand operations from one- and two-operand operations.
** Therefore, the least significant digit is one of {2,6,a,e}. The most
** significant digit occupies Bits 3:1 of the g operand in the cache
** entry. It can by any even digit between 0 and e. This gives a total
** of 5 bits for the tag proper, which means a maximum of 32 three-operand
** operations. */
#define DD_ADD_ITE_TAG 0x02
#define DD_BDD_AND_ABSTRACT_TAG 0x06
#define DD_BDD_XOR_EXIST_ABSTRACT_TAG 0x0a
#define DD_BDD_ITE_TAG 0x0e
#define DD_ADD_BDD_DO_INTERVAL_TAG 0x22
#define DD_BDD_CLIPPING_AND_ABSTRACT_UP_TAG 0x26
#define DD_BDD_CLIPPING_AND_ABSTRACT_DOWN_TAG 0x2a
#define DD_BDD_COMPOSE_RECUR_TAG 0x2e
#define DD_ADD_COMPOSE_RECUR_TAG 0x42
#define DD_ADD_NON_SIM_COMPOSE_TAG 0x46
#define DD_EQUIV_DC_TAG 0x4a
#define DD_ZDD_ITE_TAG 0x4e
#define DD_ADD_ITE_CONSTANT_TAG 0x62
#define DD_ADD_EVAL_CONST_TAG 0x66
#define DD_BDD_ITE_CONSTANT_TAG 0x6a
#define DD_ADD_OUT_SUM_TAG 0x6e
#define DD_BDD_LEQ_UNLESS_TAG 0x82
#define DD_ADD_TRIANGLE_TAG 0x86
/* Generator constants. */
#define CUDD_GEN_CUBES 0
#define CUDD_GEN_NODES 1
#define CUDD_GEN_ZDD_PATHS 2
#define CUDD_GEN_EMPTY 0
#define CUDD_GEN_NONEMPTY 1
/*---------------------------------------------------------------------------*/
/* Stucture declarations */
/*---------------------------------------------------------------------------*/
struct DdGen {
DdManager *manager;
int type;
int status;
union {
struct {
int *cube;
CUDD_VALUE_TYPE value;
} cubes;
struct {
st_table *visited;
st_generator *stGen;
} nodes;
} gen;
struct {
int sp;
DdNode **stack;
} stack;
DdNode *node;
};
/*---------------------------------------------------------------------------*/
/* Type declarations */
/*---------------------------------------------------------------------------*/
/* Hooks in CUDD are functions that the application registers with the
** manager so that they are called at appropriate times. The functions
** are passed the manager as argument; they should return 1 if
** successful and 0 otherwise.
*/
typedef struct DdHook { /* hook list element */
int (*f) ARGS((DdManager *, char *, void *)); /* function to be called */
struct DdHook *next; /* next element in the list */
} DdHook;
#if SIZEOF_VOID_P == 8 && SIZEOF_INT == 4
typedef long ptrint;
typedef unsigned long ptruint;
#else
typedef int ptrint;
typedef unsigned int ptruint;
#endif
#ifdef __osf__
#pragma pointer_size save
#pragma pointer_size short
#endif
typedef DdNode *DdNodePtr;
/* Generic local cache item. */
typedef struct DdLocalCacheItem {
DdNode *value;
#ifdef DD_CACHE_PROFILE
ptrint count;
#endif
DdNode *key[1];
} DdLocalCacheItem;
/* Local cache. */
typedef struct DdLocalCache {
DdLocalCacheItem *item;
unsigned int itemsize;
unsigned int keysize;
unsigned int slots;
int shift;
double lookUps;
double minHit;
double hits;
unsigned int maxslots;
DdManager *manager;
struct DdLocalCache *next;
} DdLocalCache;
/* Generic hash item. */
typedef struct DdHashItem {
struct DdHashItem *next;
ptrint count;
DdNode *value;
DdNode *key[1];
} DdHashItem;
/* Local hash table */
typedef struct DdHashTable {
unsigned int keysize;
unsigned int itemsize;
DdHashItem **bucket;
DdHashItem *nextFree;
DdHashItem **memoryList;
unsigned int numBuckets;
int shift;
unsigned int size;
unsigned int maxsize;
DdManager *manager;
} DdHashTable;
typedef struct DdCache {
DdNode *f,*g; /* DDs */
ptruint h; /* either operator or DD */
DdNode *data; /* already constructed DD */
#ifdef DD_CACHE_PROFILE
ptrint count;
#endif
} DdCache;
typedef struct DdSubtable { /* subtable for one index */
DdNode **nodelist; /* hash table */
int shift; /* shift for hash function */
unsigned int slots; /* size of the hash table */
unsigned int keys; /* number of nodes stored in this table */
unsigned int maxKeys; /* slots * DD_MAX_SUBTABLE_DENSITY */
unsigned int dead; /* number of dead nodes in this table */
unsigned int next; /* index of next variable in group */
int bindVar; /* flag to bind this variable to its level */
/* Fields for lazy sifting. */
Cudd_VariableType varType; /* variable type (ps, ns, pi) */
int pairIndex; /* corresponding variable index (ps <-> ns) */
int varHandled; /* flag: 1 means variable is already handled */
Cudd_LazyGroupType varToBeGrouped; /* tells what grouping to apply */
} DdSubtable;
struct DdManager { /* specialized DD symbol table */
/* Constants */
DdNode sentinel; /* for collision lists */
DdNode *one; /* constant 1 */
DdNode *zero; /* constant 0 */
DdNode *plusinfinity; /* plus infinity */
DdNode *minusinfinity; /* minus infinity */
DdNode *background; /* background value */
/* Computed Table */
DdCache *acache; /* address of allocated memory for cache */
DdCache *cache; /* the cache-based computed table */
unsigned int cacheSlots; /* total number of cache entries */
int cacheShift; /* shift value for cache hash function */
double cacheMisses; /* number of cache misses (since resizing) */
double cacheHits; /* number of cache hits (since resizing) */
double minHit; /* hit percentage above which to resize */
int cacheSlack; /* slots still available for resizing */
unsigned int maxCacheHard; /* hard limit for cache size */
/* Unique Table */
int size; /* number of unique subtables */
int sizeZ; /* for ZDD */
int maxSize; /* max number of subtables before resizing */
int maxSizeZ; /* for ZDD */
DdSubtable *subtables; /* array of unique subtables */
DdSubtable *subtableZ; /* for ZDD */
DdSubtable constants; /* unique subtable for the constants */
unsigned int slots; /* total number of hash buckets */
unsigned int keys; /* total number of BDD and ADD nodes */
unsigned int keysZ; /* total number of ZDD nodes */
unsigned int dead; /* total number of dead BDD and ADD nodes */
unsigned int deadZ; /* total number of dead ZDD nodes */
unsigned int maxLive; /* maximum number of live nodes */
unsigned int minDead; /* do not GC if fewer than these dead */
double gcFrac; /* gc when this fraction is dead */
int gcEnabled; /* gc is enabled */
unsigned int looseUpTo; /* slow growth beyond this limit */
/* (measured w.r.t. slots, not keys) */
unsigned int initSlots; /* initial size of a subtable */
DdNode **stack; /* stack for iterative procedures */
double allocated; /* number of nodes allocated */
/* (not during reordering) */
double reclaimed; /* number of nodes brought back from the dead */
int isolated; /* isolated projection functions */
int *perm; /* current variable perm. (index to level) */
int *permZ; /* for ZDD */
int *invperm; /* current inv. var. perm. (level to index) */
int *invpermZ; /* for ZDD */
DdNode **vars; /* projection functions */
int *map; /* variable map for fast swap */
DdNode **univ; /* ZDD 1 for each variable */
int linearSize; /* number of rows and columns of linear */
long *interact; /* interacting variable matrix */
long *linear; /* linear transform matrix */
/* Memory Management */
DdNode **memoryList; /* memory manager for symbol table */
DdNode *nextFree; /* list of ABC_FREE nodes */
char *stash; /* memory reserve */
#ifndef DD_NO_DEATH_ROW
DdNode **deathRow; /* queue for dereferencing */
int deathRowDepth; /* number of slots in the queue */
int nextDead; /* index in the queue */
unsigned deadMask; /* mask for circular index update */
#endif
/* General Parameters */
CUDD_VALUE_TYPE epsilon; /* tolerance on comparisons */
/* Dynamic Reordering Parameters */
int reordered; /* flag set at the end of reordering */
int reorderings; /* number of calls to Cudd_ReduceHeap */
int siftMaxVar; /* maximum number of vars sifted */
int siftMaxSwap; /* maximum number of swaps per sifting */
double maxGrowth; /* maximum growth during reordering */
double maxGrowthAlt; /* alternate maximum growth for reordering */
int reordCycle; /* how often to apply alternate threshold */
int autoDyn; /* automatic dynamic reordering flag (BDD) */
int autoDynZ; /* automatic dynamic reordering flag (ZDD) */
Cudd_ReorderingType autoMethod; /* default reordering method */
Cudd_ReorderingType autoMethodZ; /* default reordering method (ZDD) */
int realign; /* realign ZDD order after BDD reordering */
int realignZ; /* realign BDD order after ZDD reordering */
unsigned int nextDyn; /* reorder if this size is reached */
unsigned int countDead; /* if 0, count deads to trigger reordering */
MtrNode *tree; /* Variable group tree (BDD) */
MtrNode *treeZ; /* Variable group tree (ZDD) */
Cudd_AggregationType groupcheck; /* Used during group sifting */
int recomb; /* Used during group sifting */
int symmviolation; /* Used during group sifting */
int arcviolation; /* Used during group sifting */
int populationSize; /* population size for GA */
int numberXovers; /* number of crossovers for GA */
DdLocalCache *localCaches; /* local caches currently in existence */
#ifdef __osf__
#pragma pointer_size restore
#endif
char *hooks; /* application-specific field (used by vis) */
DdHook *preGCHook; /* hooks to be called before GC */
DdHook *postGCHook; /* hooks to be called after GC */
DdHook *preReorderingHook; /* hooks to be called before reordering */
DdHook *postReorderingHook; /* hooks to be called after reordering */
FILE *out; /* stdout for this manager */
FILE *err; /* stderr for this manager */
#ifdef __osf__
#pragma pointer_size save
#pragma pointer_size short
#endif
Cudd_ErrorType errorCode; /* info on last error */
/* Statistical counters. */
long memused; /* total memory allocated for the manager */
long maxmem; /* target maximum memory */
long maxmemhard; /* hard limit for maximum memory */
int garbageCollections; /* number of garbage collections */
long GCTime; /* total time spent in garbage collection */
long reordTime; /* total time spent in reordering */
double totCachehits; /* total number of cache hits */
double totCacheMisses; /* total number of cache misses */
double cachecollisions; /* number of cache collisions */
double cacheinserts; /* number of cache insertions */
double cacheLastInserts; /* insertions at the last cache resizing */
double cachedeletions; /* number of deletions during garbage coll. */
#ifdef DD_STATS
double nodesFreed; /* number of nodes returned to the ABC_FREE list */
double nodesDropped; /* number of nodes killed by dereferencing */
#endif
unsigned int peakLiveNodes; /* maximum number of live nodes */
#ifdef DD_UNIQUE_PROFILE
double uniqueLookUps; /* number of unique table lookups */
double uniqueLinks; /* total distance traveled in coll. chains */
#endif
#ifdef DD_COUNT
double recursiveCalls; /* number of recursive calls */
#ifdef DD_STATS
double nextSample; /* when to write next line of stats */
#endif
double swapSteps; /* number of elementary reordering steps */
#endif
#ifdef DD_MIS
/* mis/verif compatibility fields */
array_t *iton; /* maps ids in ddNode to node_t */
array_t *order; /* copy of order_list */
lsHandle handle; /* where it is in network BDD list */
network_t *network;
st_table *local_order; /* for local BDDs */
int nvars; /* variables used so far */
int threshold; /* for pseudo var threshold value*/
#endif
};
typedef struct Move {
DdHalfWord x;
DdHalfWord y;
unsigned int flags;
int size;
struct Move *next;
} Move;
/* Generic level queue item. */
typedef struct DdQueueItem {
struct DdQueueItem *next;
struct DdQueueItem *cnext;
void *key;
} DdQueueItem;
/* Level queue. */
typedef struct DdLevelQueue {
void *first;
DdQueueItem **last;
DdQueueItem *freelist;
DdQueueItem **buckets;
int levels;
int itemsize;
int size;
int maxsize;
int numBuckets;
int shift;
} DdLevelQueue;
#ifdef __osf__
#pragma pointer_size restore
#endif
/*---------------------------------------------------------------------------*/
/* Variable declarations */
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
/* Macro declarations */
/*---------------------------------------------------------------------------*/
/**Macro***********************************************************************
Synopsis [Adds node to the head of the ABC_FREE list.]
Description [Adds node to the head of the ABC_FREE list. Does not
deallocate memory chunks that become ABC_FREE. This function is also
used by the dynamic reordering functions.]
SideEffects [None]
SeeAlso [cuddAllocNode cuddDynamicAllocNode]
******************************************************************************/
#define cuddDeallocNode(unique,node) \
(node)->next = (unique)->nextFree; \
(unique)->nextFree = node;
/**Macro***********************************************************************
Synopsis [Increases the reference count of a node, if it is not
saturated.]
Description [Increases the reference count of a node, if it is not
saturated. This being a macro, it is faster than Cudd_Ref, but it
cannot be used in constructs like cuddRef(a = b()).]
SideEffects [none]
SeeAlso [Cudd_Ref]
******************************************************************************/
#define cuddRef(n) cuddSatInc(Cudd_Regular(n)->ref)
/**Macro***********************************************************************
Synopsis [Decreases the reference count of a node, if it is not
saturated.]
Description [Decreases the reference count of node. It is primarily
used in recursive procedures to decrease the ref count of a result
node before returning it. This accomplishes the goal of removing the
protection applied by a previous cuddRef. This being a macro, it is
faster than Cudd_Deref, but it cannot be used in constructs like
cuddDeref(a = b()).]
SideEffects [none]
SeeAlso [Cudd_Deref]
******************************************************************************/
#define cuddDeref(n) cuddSatDec(Cudd_Regular(n)->ref)
/**Macro***********************************************************************
Synopsis [Returns 1 if the node is a constant node.]
Description [Returns 1 if the node is a constant node (rather than an
internal node). All constant nodes have the same index
(CUDD_CONST_INDEX). The pointer passed to cuddIsConstant must be regular.]
SideEffects [none]
SeeAlso [Cudd_IsConstant]
******************************************************************************/
#define cuddIsConstant(node) ((node)->index == CUDD_CONST_INDEX)
/**Macro***********************************************************************
Synopsis [Returns the then child of an internal node.]
Description [Returns the then child of an internal node. If
<code>node</code> is a constant node, the result is unpredictable.
The pointer passed to cuddT must be regular.]
SideEffects [none]
SeeAlso [Cudd_T]
******************************************************************************/
#define cuddT(node) ((node)->type.kids.T)
/**Macro***********************************************************************
Synopsis [Returns the else child of an internal node.]
Description [Returns the else child of an internal node. If
<code>node</code> is a constant node, the result is unpredictable.
The pointer passed to cuddE must be regular.]
SideEffects [none]
SeeAlso [Cudd_E]
******************************************************************************/
#define cuddE(node) ((node)->type.kids.E)
/**Macro***********************************************************************
Synopsis [Returns the value of a constant node.]
Description [Returns the value of a constant node. If
<code>node</code> is an internal node, the result is unpredictable.
The pointer passed to cuddV must be regular.]
SideEffects [none]
SeeAlso [Cudd_V]
******************************************************************************/
#define cuddV(node) ((node)->type.value)
/**Macro***********************************************************************
Synopsis [Finds the current position of variable index in the
order.]
Description [Finds the current position of variable index in the
order. This macro duplicates the functionality of Cudd_ReadPerm,
but it does not check for out-of-bounds indices and it is more
efficient.]
SideEffects [none]
SeeAlso [Cudd_ReadPerm]
******************************************************************************/
#define cuddI(dd,index) (((index)==CUDD_CONST_INDEX)?(int)(index):(dd)->perm[(index)])
/**Macro***********************************************************************
Synopsis [Finds the current position of ZDD variable index in the
order.]
Description [Finds the current position of ZDD variable index in the
order. This macro duplicates the functionality of Cudd_ReadPermZdd,
but it does not check for out-of-bounds indices and it is more
efficient.]
SideEffects [none]
SeeAlso [Cudd_ReadPermZdd]
******************************************************************************/
#define cuddIZ(dd,index) (((index)==CUDD_CONST_INDEX)?(int)(index):(dd)->permZ[(index)])
/**Macro***********************************************************************
Synopsis [Hash function for the unique table.]
Description []
SideEffects [none]
SeeAlso [ddCHash ddCHash2]
******************************************************************************/
#if SIZEOF_VOID_P == 8 && SIZEOF_INT == 4
#define ddHash(f,g,s) \
((((unsigned)(unsigned long)(f) * DD_P1 + \
(unsigned)(unsigned long)(g)) * DD_P2) >> (s))
#else
#define ddHash(f,g,s) \
((((unsigned)(f) * DD_P1 + (unsigned)(g)) * DD_P2) >> (s))
#endif
/**Macro***********************************************************************
Synopsis [Hash function for the cache.]
Description []
SideEffects [none]
SeeAlso [ddHash ddCHash2]
******************************************************************************/
#if SIZEOF_VOID_P == 8 && SIZEOF_INT == 4
#define ddCHash(o,f,g,h,s) \
((((((unsigned)(unsigned long)(f) + (unsigned)(unsigned long)(o)) * DD_P1 + \
(unsigned)(unsigned long)(g)) * DD_P2 + \
(unsigned)(unsigned long)(h)) * DD_P3) >> (s))
#else
#define ddCHash(o,f,g,h,s) \
((((((unsigned)(f) + (unsigned)(o)) * DD_P1 + (unsigned)(g)) * DD_P2 + \
(unsigned)(h)) * DD_P3) >> (s))
#endif
/**Macro***********************************************************************
Synopsis [Hash function for the cache for functions with two
operands.]
Description []
SideEffects [none]
SeeAlso [ddHash ddCHash]
******************************************************************************/
#if SIZEOF_VOID_P == 8 && SIZEOF_INT == 4
#define ddCHash2(o,f,g,s) \
(((((unsigned)(unsigned long)(f) + (unsigned)(unsigned long)(o)) * DD_P1 + \
(unsigned)(unsigned long)(g)) * DD_P2) >> (s))
#else
#define ddCHash2(o,f,g,s) \
(((((unsigned)(f) + (unsigned)(o)) * DD_P1 + (unsigned)(g)) * DD_P2) >> (s))
#endif
/**Macro***********************************************************************
Synopsis [Clears the 4 least significant bits of a pointer.]
Description []
SideEffects [none]
SeeAlso []
******************************************************************************/
#define cuddClean(p) ((DdNode *)((ptruint)(p) & ~0xf))
/**Macro***********************************************************************
Synopsis [Computes the minimum of two numbers.]
Description []
SideEffects [none]
SeeAlso [ddMax]
******************************************************************************/
#define ddMin(x,y) (((y) < (x)) ? (y) : (x))
/**Macro***********************************************************************
Synopsis [Computes the maximum of two numbers.]
Description []
SideEffects [none]
SeeAlso [ddMin]
******************************************************************************/
#define ddMax(x,y) (((y) > (x)) ? (y) : (x))
/**Macro***********************************************************************
Synopsis [Computes the absolute value of a number.]
Description []
SideEffects [none]
SeeAlso []
******************************************************************************/
#define ddAbs(x) (((x)<0) ? -(x) : (x))
/**Macro***********************************************************************
Synopsis [Returns 1 if the absolute value of the difference of the two
arguments x and y is less than e.]
Description []
SideEffects [none]
SeeAlso []
******************************************************************************/
#define ddEqualVal(x,y,e) (ddAbs((x)-(y))<(e))
/**Macro***********************************************************************
Synopsis [Saturating increment operator.]
Description []
SideEffects [none]
SeeAlso [cuddSatDec]
******************************************************************************/
#if SIZEOF_VOID_P == 8 && SIZEOF_INT == 4
#define cuddSatInc(x) ((x)++)
#else
#define cuddSatInc(x) ((x) += (x) != (DdHalfWord)DD_MAXREF)
#endif
/**Macro***********************************************************************
Synopsis [Saturating decrement operator.]
Description []
SideEffects [none]
SeeAlso [cuddSatInc]
******************************************************************************/
#if SIZEOF_VOID_P == 8 && SIZEOF_INT == 4
#define cuddSatDec(x) ((x)--)
#else
#define cuddSatDec(x) ((x) -= (x) != (DdHalfWord)DD_MAXREF)
#endif
/**Macro***********************************************************************
Synopsis [Returns the constant 1 node.]
Description []
SideEffects [none]
SeeAlso [DD_ZERO DD_PLUS_INFINITY DD_MINUS_INFINITY]
******************************************************************************/
#define DD_ONE(dd) ((dd)->one)
/**Macro***********************************************************************
Synopsis [Returns the arithmetic 0 constant node.]
Description [Returns the arithmetic 0 constant node. This is different
from the logical zero. The latter is obtained by
Cudd_Not(DD_ONE(dd)).]
SideEffects [none]
SeeAlso [DD_ONE Cudd_Not DD_PLUS_INFINITY DD_MINUS_INFINITY]
******************************************************************************/
#define DD_ZERO(dd) ((dd)->zero)
/**Macro***********************************************************************
Synopsis [Returns the plus infinity constant node.]
Description []
SideEffects [none]
SeeAlso [DD_ONE DD_ZERO DD_MINUS_INFINITY]
******************************************************************************/
#define DD_PLUS_INFINITY(dd) ((dd)->plusinfinity)
/**Macro***********************************************************************
Synopsis [Returns the minus infinity constant node.]
Description []
SideEffects [none]
SeeAlso [DD_ONE DD_ZERO DD_PLUS_INFINITY]
******************************************************************************/
#define DD_MINUS_INFINITY(dd) ((dd)->minusinfinity)
/**Macro***********************************************************************
Synopsis [Enforces DD_MINUS_INF_VAL <= x <= DD_PLUS_INF_VAL.]
Description [Enforces DD_MINUS_INF_VAL <= x <= DD_PLUS_INF_VAL.
Furthermore, if x <= DD_MINUS_INF_VAL/2, x is set to
DD_MINUS_INF_VAL. Similarly, if DD_PLUS_INF_VAL/2 <= x, x is set to
DD_PLUS_INF_VAL. Normally this macro is a NOOP. However, if
HAVE_IEEE_754 is not defined, it makes sure that a value does not
get larger than infinity in absolute value, and once it gets to
infinity, stays there. If the value overflows before this macro is
applied, no recovery is possible.]
SideEffects [none]
SeeAlso []
******************************************************************************/
#ifdef HAVE_IEEE_754
#define cuddAdjust(x)
#else
#define cuddAdjust(x) ((x) = ((x) >= DD_CRI_HI_MARK) ? DD_PLUS_INF_VAL : (((x) <= DD_CRI_LO_MARK) ? DD_MINUS_INF_VAL : (x)))
#endif
/**Macro***********************************************************************
Synopsis [Extract the least significant digit of a double digit.]
Description [Extract the least significant digit of a double digit. Used
in the manipulation of arbitrary precision integers.]
SideEffects [None]
SeeAlso [DD_MSDIGIT]
******************************************************************************/
#define DD_LSDIGIT(x) ((x) & DD_APA_MASK)
/**Macro***********************************************************************
Synopsis [Extract the most significant digit of a double digit.]
Description [Extract the most significant digit of a double digit. Used
in the manipulation of arbitrary precision integers.]
SideEffects [None]
SeeAlso [DD_LSDIGIT]
******************************************************************************/
#define DD_MSDIGIT(x) ((x) >> DD_APA_BITS)
/**Macro***********************************************************************
Synopsis [Outputs a line of stats.]
Description [Outputs a line of stats if DD_COUNT and DD_STATS are
defined. Increments the number of recursive calls if DD_COUNT is
defined.]
SideEffects [None]
SeeAlso []
******************************************************************************/
#ifdef DD_COUNT
#ifdef DD_STATS
#define statLine(dd) dd->recursiveCalls++; \
if (dd->recursiveCalls == dd->nextSample) {(void) fprintf(dd->err, \
"@%.0f: %u nodes %u live %.0f dropped %.0f reclaimed\n", dd->recursiveCalls, \
dd->keys, dd->keys - dd->dead, dd->nodesDropped, dd->reclaimed); \
dd->nextSample += 250000;}
#else
#define statLine(dd) dd->recursiveCalls++;
#endif
#else
#define statLine(dd)
#endif
/**AutomaticStart*************************************************************/
/*---------------------------------------------------------------------------*/
/* Function prototypes */
/*---------------------------------------------------------------------------*/
EXTERN DdNode * cuddAddExistAbstractRecur ARGS((DdManager *manager, DdNode *f, DdNode *cube));
EXTERN DdNode * cuddAddUnivAbstractRecur ARGS((DdManager *manager, DdNode *f, DdNode *cube));
EXTERN DdNode * cuddAddOrAbstractRecur ARGS((DdManager *manager, DdNode *f, DdNode *cube));
EXTERN DdNode * cuddAddApplyRecur ARGS((DdManager *dd, DdNode * (*)(DdManager *, DdNode **, DdNode **), DdNode *f, DdNode *g));
EXTERN DdNode * cuddAddMonadicApplyRecur ARGS((DdManager * dd, DdNode * (*op)(DdManager *, DdNode *), DdNode * f));
EXTERN DdNode * cuddAddScalarInverseRecur ARGS((DdManager *dd, DdNode *f, DdNode *epsilon));
EXTERN DdNode * cuddAddIteRecur ARGS((DdManager *dd, DdNode *f, DdNode *g, DdNode *h));
EXTERN DdNode * cuddAddCmplRecur ARGS((DdManager *dd, DdNode *f));
EXTERN DdNode * cuddAddNegateRecur ARGS((DdManager *dd, DdNode *f));
EXTERN DdNode * cuddAddRoundOffRecur ARGS((DdManager *dd, DdNode *f, double trunc));
EXTERN DdNode * cuddUnderApprox ARGS((DdManager *dd, DdNode *f, int numVars, int threshold, int safe, double quality));
EXTERN DdNode * cuddRemapUnderApprox ARGS((DdManager *dd, DdNode *f, int numVars, int threshold, double quality));
EXTERN DdNode * cuddBiasedUnderApprox ARGS((DdManager *dd, DdNode *f, DdNode *b, int numVars, int threshold, double quality1, double quality0));
EXTERN DdNode * cuddBddAndAbstractRecur ARGS((DdManager *manager, DdNode *f, DdNode *g, DdNode *cube));
EXTERN int cuddAnnealing ARGS((DdManager *table, int lower, int upper));
EXTERN DdNode * cuddBddExistAbstractRecur ARGS((DdManager *manager, DdNode *f, DdNode *cube));
EXTERN DdNode * cuddBddXorExistAbstractRecur ARGS((DdManager *manager, DdNode *f, DdNode *g, DdNode *cube));
EXTERN DdNode * cuddBddBooleanDiffRecur ARGS((DdManager *manager, DdNode *f, DdNode *var));
EXTERN DdNode * cuddBddIteRecur ARGS((DdManager *dd, DdNode *f, DdNode *g, DdNode *h));
EXTERN DdNode * cuddBddIntersectRecur ARGS((DdManager *dd, DdNode *f, DdNode *g));
EXTERN DdNode * cuddBddAndRecur ARGS((DdManager *manager, DdNode *f, DdNode *g));
EXTERN DdNode * cuddBddXorRecur ARGS((DdManager *manager, DdNode *f, DdNode *g));
EXTERN DdNode * cuddBddTransfer ARGS((DdManager *ddS, DdManager *ddD, DdNode *f));
EXTERN DdNode * cuddAddBddDoPattern ARGS((DdManager *dd, DdNode *f));
EXTERN int cuddInitCache ARGS((DdManager *unique, unsigned int cacheSize, unsigned int maxCacheSize));
EXTERN void cuddCacheInsert ARGS((DdManager *table, ptruint op, DdNode *f, DdNode *g, DdNode *h, DdNode *data));
EXTERN void cuddCacheInsert2 ARGS((DdManager *table, DdNode * (*)(DdManager *, DdNode *, DdNode *), DdNode *f, DdNode *g, DdNode *data));
EXTERN void cuddCacheInsert1 ARGS((DdManager *table, DdNode * (*)(DdManager *, DdNode *), DdNode *f, DdNode *data));
EXTERN DdNode * cuddCacheLookup ARGS((DdManager *table, ptruint op, DdNode *f, DdNode *g, DdNode *h));
EXTERN DdNode * cuddCacheLookupZdd ARGS((DdManager *table, ptruint op, DdNode *f, DdNode *g, DdNode *h));
EXTERN DdNode * cuddCacheLookup2 ARGS((DdManager *table, DdNode * (*)(DdManager *, DdNode *, DdNode *), DdNode *f, DdNode *g));
EXTERN DdNode * cuddCacheLookup1 ARGS((DdManager *table, DdNode * (*)(DdManager *, DdNode *), DdNode *f));
EXTERN DdNode * cuddCacheLookup2Zdd ARGS((DdManager *table, DdNode * (*)(DdManager *, DdNode *, DdNode *), DdNode *f, DdNode *g));
EXTERN DdNode * cuddCacheLookup1Zdd ARGS((DdManager *table, DdNode * (*)(DdManager *, DdNode *), DdNode *f));
EXTERN DdNode * cuddConstantLookup ARGS((DdManager *table, ptruint op, DdNode *f, DdNode *g, DdNode *h));
EXTERN int cuddCacheProfile ARGS((DdManager *table, FILE *fp));
EXTERN void cuddCacheResize ARGS((DdManager *table));
EXTERN void cuddCacheFlush ARGS((DdManager *table));
EXTERN int cuddComputeFloorLog2 ARGS((unsigned int value));
EXTERN int cuddHeapProfile ARGS((DdManager *dd));
EXTERN void cuddPrintNode ARGS((DdNode *f, FILE *fp));
EXTERN void cuddPrintVarGroups ARGS((DdManager * dd, MtrNode * root, int zdd, int silent));
EXTERN DdNode * cuddBddClippingAnd ARGS((DdManager *dd, DdNode *f, DdNode *g, int maxDepth, int direction));
EXTERN DdNode * cuddBddClippingAndAbstract ARGS((DdManager *dd, DdNode *f, DdNode *g, DdNode *cube, int maxDepth, int direction));
EXTERN void cuddGetBranches ARGS((DdNode *g, DdNode **g1, DdNode **g0));
EXTERN int cuddCheckCube ARGS((DdManager *dd, DdNode *g));
EXTERN DdNode * cuddCofactorRecur ARGS((DdManager *dd, DdNode *f, DdNode *g));
EXTERN DdNode * cuddBddComposeRecur ARGS((DdManager *dd, DdNode *f, DdNode *g, DdNode *proj));
EXTERN DdNode * cuddAddComposeRecur ARGS((DdManager *dd, DdNode *f, DdNode *g, DdNode *proj));
EXTERN int cuddExact ARGS((DdManager *table, int lower, int upper));
EXTERN DdNode * cuddBddConstrainRecur ARGS((DdManager *dd, DdNode *f, DdNode *c));
EXTERN DdNode * cuddBddRestrictRecur ARGS((DdManager *dd, DdNode *f, DdNode *c));
EXTERN DdNode * cuddAddConstrainRecur ARGS((DdManager *dd, DdNode *f, DdNode *c));
EXTERN DdNode * cuddAddRestrictRecur ARGS((DdManager *dd, DdNode *f, DdNode *c));
EXTERN DdNode * cuddBddLICompaction ARGS((DdManager *dd, DdNode *f, DdNode *c));
EXTERN int cuddGa ARGS((DdManager *table, int lower, int upper));
EXTERN int cuddTreeSifting ARGS((DdManager *table, Cudd_ReorderingType method));
EXTERN int cuddZddInitUniv ARGS((DdManager *zdd));
EXTERN void cuddZddFreeUniv ARGS((DdManager *zdd));
EXTERN void cuddSetInteract ARGS((DdManager *table, int x, int y));
EXTERN int cuddTestInteract ARGS((DdManager *table, int x, int y));
EXTERN int cuddInitInteract ARGS((DdManager *table));
EXTERN DdLocalCache * cuddLocalCacheInit ARGS((DdManager *manager, unsigned int keySize, unsigned int cacheSize, unsigned int maxCacheSize));
EXTERN void cuddLocalCacheQuit ARGS((DdLocalCache *cache));
EXTERN void cuddLocalCacheInsert ARGS((DdLocalCache *cache, DdNodePtr *key, DdNode *value));
EXTERN DdNode * cuddLocalCacheLookup ARGS((DdLocalCache *cache, DdNodePtr *key));
EXTERN void cuddLocalCacheClearDead ARGS((DdManager *manager));
EXTERN int cuddIsInDeathRow ARGS((DdManager *dd, DdNode *f));
EXTERN int cuddTimesInDeathRow ARGS((DdManager *dd, DdNode *f));
EXTERN void cuddLocalCacheClearAll ARGS((DdManager *manager));
#ifdef DD_CACHE_PROFILE
EXTERN int cuddLocalCacheProfile ARGS((DdLocalCache *cache));
#endif
EXTERN DdHashTable * cuddHashTableInit ARGS((DdManager *manager, unsigned int keySize, unsigned int initSize));
EXTERN void cuddHashTableQuit ARGS((DdHashTable *hash));
EXTERN int cuddHashTableInsert ARGS((DdHashTable *hash, DdNodePtr *key, DdNode *value, ptrint count));
EXTERN DdNode * cuddHashTableLookup ARGS((DdHashTable *hash, DdNodePtr *key));
EXTERN int cuddHashTableInsert1 ARGS((DdHashTable *hash, DdNode *f, DdNode *value, ptrint count));
EXTERN DdNode * cuddHashTableLookup1 ARGS((DdHashTable *hash, DdNode *f));
EXTERN int cuddHashTableInsert2 ARGS((DdHashTable *hash, DdNode *f, DdNode *g, DdNode *value, ptrint count));
EXTERN DdNode * cuddHashTableLookup2 ARGS((DdHashTable *hash, DdNode *f, DdNode *g));
EXTERN int cuddHashTableInsert3 ARGS((DdHashTable *hash, DdNode *f, DdNode *g, DdNode *h, DdNode *value, ptrint count));
EXTERN DdNode * cuddHashTableLookup3 ARGS((DdHashTable *hash, DdNode *f, DdNode *g, DdNode *h));
EXTERN DdLevelQueue * cuddLevelQueueInit ARGS((int levels, int itemSize, int numBuckets));
EXTERN void cuddLevelQueueQuit ARGS((DdLevelQueue *queue));
EXTERN void * cuddLevelQueueEnqueue ARGS((DdLevelQueue *queue, void *key, int level));
EXTERN void cuddLevelQueueDequeue ARGS((DdLevelQueue *queue, int level));
EXTERN int cuddLinearAndSifting ARGS((DdManager *table, int lower, int upper));
EXTERN DdNode * cuddBddLiteralSetIntersectionRecur ARGS((DdManager *dd, DdNode *f, DdNode *g));
EXTERN DdNode * cuddCProjectionRecur ARGS((DdManager *dd, DdNode *R, DdNode *Y, DdNode *Ysupp));
EXTERN DdNode * cuddBddClosestCube ARGS((DdManager *dd, DdNode *f, DdNode *g, CUDD_VALUE_TYPE bound));
EXTERN void cuddReclaim ARGS((DdManager *table, DdNode *n));
EXTERN void cuddReclaimZdd ARGS((DdManager *table, DdNode *n));
EXTERN void cuddClearDeathRow ARGS((DdManager *table));
EXTERN void cuddShrinkDeathRow ARGS((DdManager *table));
EXTERN DdNode * cuddDynamicAllocNode ARGS((DdManager *table));
EXTERN int cuddSifting ARGS((DdManager *table, int lower, int upper));
EXTERN int cuddSwapping ARGS((DdManager *table, int lower, int upper, Cudd_ReorderingType heuristic));
EXTERN int cuddNextHigh ARGS((DdManager *table, int x));
EXTERN int cuddNextLow ARGS((DdManager *table, int x));
EXTERN int cuddSwapInPlace ARGS((DdManager *table, int x, int y));
EXTERN int cuddBddAlignToZdd ARGS((DdManager *table));
EXTERN DdNode * cuddBddMakePrime ARGS((DdManager *dd, DdNode *cube, DdNode *f));
EXTERN DdNode * cuddSolveEqnRecur ARGS((DdManager *bdd, DdNode *F, DdNode *Y, DdNode **G, int n, int *yIndex, int i));
EXTERN DdNode * cuddVerifySol ARGS((DdManager *bdd, DdNode *F, DdNode **G, int *yIndex, int n));
#ifdef ST_INCLUDED
EXTERN DdNode* cuddSplitSetRecur ARGS((DdManager *manager, st_table *mtable, int *varSeen, DdNode *p, double n, double max, int index));
#endif
EXTERN DdNode * cuddSubsetHeavyBranch ARGS((DdManager *dd, DdNode *f, int numVars, int threshold));
EXTERN DdNode * cuddSubsetShortPaths ARGS((DdManager *dd, DdNode *f, int numVars, int threshold, int hardlimit));
EXTERN int cuddSymmCheck ARGS((DdManager *table, int x, int y));
EXTERN int cuddSymmSifting ARGS((DdManager *table, int lower, int upper));
EXTERN int cuddSymmSiftingConv ARGS((DdManager *table, int lower, int upper));
EXTERN DdNode * cuddAllocNode ARGS((DdManager *unique));
EXTERN DdManager * cuddInitTable ARGS((unsigned int numVars, unsigned int numVarsZ, unsigned int numSlots, unsigned int looseUpTo));
EXTERN void cuddFreeTable ARGS((DdManager *unique));
EXTERN int cuddGarbageCollect ARGS((DdManager *unique, int clearCache));
EXTERN int cuddGarbageCollectZdd ARGS((DdManager *unique, int clearCache));
EXTERN DdNode * cuddZddGetNode ARGS((DdManager *zdd, int id, DdNode *T, DdNode *E));
EXTERN DdNode * cuddZddGetNodeIVO ARGS((DdManager *dd, int index, DdNode *g, DdNode *h));
EXTERN DdNode * cuddUniqueInter ARGS((DdManager *unique, int index, DdNode *T, DdNode *E));
EXTERN DdNode * cuddUniqueInterIVO ARGS((DdManager *unique, int index, DdNode *T, DdNode *E));
EXTERN DdNode * cuddUniqueInterZdd ARGS((DdManager *unique, int index, DdNode *T, DdNode *E));
EXTERN DdNode * cuddUniqueConst ARGS((DdManager *unique, CUDD_VALUE_TYPE value));
EXTERN void cuddRehash ARGS((DdManager *unique, int i));
EXTERN void cuddShrinkSubtable ARGS((DdManager *unique, int i));
EXTERN int cuddInsertSubtables ARGS((DdManager *unique, int n, int level));
EXTERN int cuddDestroySubtables ARGS((DdManager *unique, int n));
EXTERN int cuddResizeTableZdd ARGS((DdManager *unique, int index));
EXTERN void cuddSlowTableGrowth ARGS((DdManager *unique));
EXTERN int cuddP ARGS((DdManager *dd, DdNode *f));
#ifdef ST_INCLUDED
EXTERN enum st_retval cuddStCountfree ARGS((char *key, char *value, char *arg));
EXTERN int cuddCollectNodes ARGS((DdNode *f, st_table *visited));
#endif
EXTERN int cuddWindowReorder ARGS((DdManager *table, int low, int high, Cudd_ReorderingType submethod));
EXTERN DdNode * cuddZddProduct ARGS((DdManager *dd, DdNode *f, DdNode *g));
EXTERN DdNode * cuddZddUnateProduct ARGS((DdManager *dd, DdNode *f, DdNode *g));
EXTERN DdNode * cuddZddWeakDiv ARGS((DdManager *dd, DdNode *f, DdNode *g));
EXTERN DdNode * cuddZddWeakDivF ARGS((DdManager *dd, DdNode *f, DdNode *g));
EXTERN DdNode * cuddZddDivide ARGS((DdManager *dd, DdNode *f, DdNode *g));
EXTERN DdNode * cuddZddDivideF ARGS((DdManager *dd, DdNode *f, DdNode *g));
EXTERN int cuddZddGetCofactors3 ARGS((DdManager *dd, DdNode *f, int v, DdNode **f1, DdNode **f0, DdNode **fd));
EXTERN int cuddZddGetCofactors2 ARGS((DdManager *dd, DdNode *f, int v, DdNode **f1, DdNode **f0));
EXTERN DdNode * cuddZddComplement ARGS((DdManager *dd, DdNode *node));
EXTERN int cuddZddGetPosVarIndex(DdManager * dd, int index);
EXTERN int cuddZddGetNegVarIndex(DdManager * dd, int index);
EXTERN int cuddZddGetPosVarLevel(DdManager * dd, int index);
EXTERN int cuddZddGetNegVarLevel(DdManager * dd, int index);
EXTERN int cuddZddTreeSifting ARGS((DdManager *table, Cudd_ReorderingType method));
EXTERN DdNode * cuddZddIsop ARGS((DdManager *dd, DdNode *L, DdNode *U, DdNode **zdd_I));
EXTERN DdNode * cuddBddIsop ARGS((DdManager *dd, DdNode *L, DdNode *U));
EXTERN DdNode * cuddMakeBddFromZddCover ARGS((DdManager *dd, DdNode *node));
EXTERN int cuddZddLinearSifting ARGS((DdManager *table, int lower, int upper));
EXTERN int cuddZddAlignToBdd ARGS((DdManager *table));
EXTERN int cuddZddNextHigh ARGS((DdManager *table, int x));
EXTERN int cuddZddNextLow ARGS((DdManager *table, int x));
EXTERN int cuddZddUniqueCompare ARGS((int *ptr_x, int *ptr_y));
EXTERN int cuddZddSwapInPlace ARGS((DdManager *table, int x, int y));
EXTERN int cuddZddSwapping ARGS((DdManager *table, int lower, int upper, Cudd_ReorderingType heuristic));
EXTERN int cuddZddSifting ARGS((DdManager *table, int lower, int upper));
EXTERN DdNode * cuddZddIte ARGS((DdManager *dd, DdNode *f, DdNode *g, DdNode *h));
EXTERN DdNode * cuddZddUnion ARGS((DdManager *zdd, DdNode *P, DdNode *Q));
EXTERN DdNode * cuddZddIntersect ARGS((DdManager *zdd, DdNode *P, DdNode *Q));
EXTERN DdNode * cuddZddDiff ARGS((DdManager *zdd, DdNode *P, DdNode *Q));
EXTERN DdNode * cuddZddChangeAux ARGS((DdManager *zdd, DdNode *P, DdNode *zvar));
EXTERN DdNode * cuddZddSubset1 ARGS((DdManager *dd, DdNode *P, int var));
EXTERN DdNode * cuddZddSubset0 ARGS((DdManager *dd, DdNode *P, int var));
EXTERN DdNode * cuddZddChange ARGS((DdManager *dd, DdNode *P, int var));
EXTERN int cuddZddSymmCheck ARGS((DdManager *table, int x, int y));
EXTERN int cuddZddSymmSifting ARGS((DdManager *table, int lower, int upper));
EXTERN int cuddZddSymmSiftingConv ARGS((DdManager *table, int lower, int upper));
EXTERN int cuddZddP ARGS((DdManager *zdd, DdNode *f));
/**AutomaticEnd***************************************************************/
#endif /* _CUDDINT */
|