/
biddyMain.c
15906 lines (13756 loc) · 486 KB
/
biddyMain.c
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
/***************************************************************************//*!
\file biddyMain.c
\brief File biddyMain.c contains main functions for representation and
manipulation of boolean functions with various types of Binary Decision
Diagrams.
### Description
PackageName [Biddy]
Synopsis [Biddy provides data structures and algorithms for the
representation and manipulation of Boolean functions with
ROBDDs, 0-sup-BDDs, and TZBDDs. A hash table is used for quick
search of nodes. Complement edges decreases the number of
nodes. An automatic garbage collection with a system age is
implemented. Variable swapping and sifting are implemented.]
FileName [biddyMain.c]
Revision [$Revision: 674 $]
Date [$Date: 2022-12-29 19:49:52 +0100 (čet, 29 dec 2022) $]
Authors [Robert Meolic (robert@meolic.com)]
### Copyright
Copyright (C) 2006, 2019 UM FERI, Koroska cesta 46, SI-2000 Maribor, Slovenia.
Copyright (C) 2019, 2022 Robert Meolic, SI-2000 Maribor, Slovenia.
Biddy is free software; you can redistribute it and/or modify it under the terms
of the GNU General Public License as published by the Free Software Foundation;
either version 2 of the License, or (at your option) any later version.
Biddy is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A
PARTICULAR PURPOSE. See the GNU General Public License for more details.
You should have received a copy of the GNU General Public License along with
this program; if not, write to the Free Software Foundation, Inc., 51 Franklin
Street, Fifth Floor, Boston, MA 02110-1301 USA.
### More info
See also: biddy.h, biddyInt.h
*******************************************************************************/
#include "biddyInt.h"
#ifdef UNIX
#include <unistd.h> /* used for sysconf(), UNIX only */
#include <sys/resource.h> /* used for setrlimit(), UNIX only */
#include <sys/time.h> /* used for initialization of random numbers, UNIX only */
#endif
#ifdef UNIXXX
#include <malloc.h> /* experimental */
#endif
/*----------------------------------------------------------------------------*/
/* Constant declarations */
/*----------------------------------------------------------------------------*/
/* ALL SIZES ARE unsigned int */
/* Size of node and cache tables must be 2^N-1 */
/* e.g. 2^16-1 = 65535, 2^20-1 = 1048575, 2^24-1 = 16777215 */
/* If BDD node is 24B (e.g. 32-bit GNU/Linux systems) */
/* 256 nodes is 6 kB */
/* 65536 nodes is 1.5 MB */
/* 262144 nodes is 6 MB */
/* 524288 nodes is 12 MB */
/* 1048576 nodes is 24.0 MB */
/* 2097152 nodes is 48.0 MB */
/* 4194304 nodes is 96.0 MB */
/* 8388608 nodes is 192.0 MB */
/* 16777216 nodes is 384.0 MB */
/* If BDD node is 48B (e.g. 64-bit GNU/Linux systems), then: */
/* 256 nodes is 12 kB */
/* 65536 nodes is 3.0 MB */
/* 262144 nodes is 12 MB */
/* 524288 nodes is 24 MB */
/* 1048576 nodes is 48.0 MB */
/* 2097152 nodes is 96.0 MB */
/* 4194304 nodes is 192.0 MB */
/* 8388608 nodes is 384.0 MB */
/* 16777216 nodes is 768.0 MB */
#define TINY_SIZE 1023
#define SMALL_SIZE 65535
#define MEDIUM_SIZE 262143
#define LARGE_SIZE 1048575
#define XLARGE_SIZE 2097151
#define XXLARGE_SIZE 4194303
#define XXXLARGE_SIZE 8388607
#define HUGE_SIZE 16777215
/*----------------------------------------------------------------------------*/
/* Variable declarations */
/*----------------------------------------------------------------------------*/
/* EXPORTED VARIABLES */
#ifdef __cplusplus
extern "C" {
#endif
#ifdef __cplusplus
}
#endif
/* INTERNAL VARIABLES */
Biddy_Manager biddyAnonymousManager /* anonymous manager */
= NULL;
BiddyLocalInfo *biddyLocalInfo /* local info table */
= NULL;
/* Biddy_Edge debug_edge = NULL; */ /* debugging, only */
/* Biddy_Boolean biddySiftingActive = FALSE; */ /* debugging, only */
/*----------------------------------------------------------------------------*/
/* Static function prototypes */
/*----------------------------------------------------------------------------*/
static Biddy_Boolean isEqv(Biddy_Manager MNG1, Biddy_Edge f1, Biddy_Manager MNG2, Biddy_Edge f2);
static BiddyLocalInfo * createLocalInfo(Biddy_Manager MNG, Biddy_Edge f, BiddyLocalInfo *c);
static void deleteLocalInfo(Biddy_Manager MNG, Biddy_Edge f);
static inline unsigned int nodeTableHash(Biddy_Variable v, Biddy_Edge pf, Biddy_Edge pt, unsigned int size);
static inline void addNodeTable(Biddy_Manager MNG, unsigned int hash, BiddyNode *node, BiddyNode *sup1);
static inline BiddyNode *findNodeTable(Biddy_Manager MNG, Biddy_Variable v, Biddy_Edge pf, Biddy_Edge pt, BiddyNode **thesup);
static void addVariableElement(Biddy_Manager MNG, Biddy_String x, Biddy_Boolean varelem, Biddy_Boolean complete);
static void evalProbability(Biddy_Manager MNG, Biddy_Edge f, double *c1, double *c0, Biddy_Boolean *leftmost);
static Biddy_Boolean checkFunctionOrdering(Biddy_Manager MNG, Biddy_Edge f);
static Biddy_Variable getGlobalOrdering(Biddy_Manager MNG, Biddy_Variable v);
static Biddy_Variable swapWithHigher(Biddy_Manager MNG, Biddy_Variable v, Biddy_Boolean *active);
static Biddy_Variable swapWithLower(Biddy_Manager MNG, Biddy_Variable v, Biddy_Boolean *active);
static void swapVariables(Biddy_Manager MNG, Biddy_Variable low, Biddy_Variable high, Biddy_Boolean *active);
static void oneSwap(Biddy_Manager MNG, BiddyNode *sup, Biddy_Variable low, Biddy_Variable high, Biddy_Edge *u0, Biddy_Edge *u1);
#ifndef COMPACT
static void oneSwapEdge(Biddy_Manager MNG, Biddy_Edge sup, Biddy_Variable low, Biddy_Variable high, Biddy_Edge *u, Biddy_Boolean *active);
#endif
static void nullOrdering(BiddyOrderingTable table);
static void alphabeticOrdering(Biddy_Manager MNG, BiddyOrderingTable table);
static void nodeNumberOrdering(Biddy_Manager MNG, Biddy_Edge f, unsigned int *i, BiddyOrderingTable ordering);
/* static void reorderVariables(Biddy_Manager MNG, int numV, BiddyVariableOrder *tableV, int numN, BiddyNodeList *tableN, int id); */ /* NOT IMPLEMENTED, YET */
static void constructBDD(Biddy_Manager MNG, int numN, BiddyNodeList *tableN, int id);
static void concat(char **s1, const char *s2);
static void debugNode(Biddy_Manager MNG, BiddyNode *node);
static void debugEdge(Biddy_Manager MNG, Biddy_Edge edge);
/* debugging */
/*
static void writeORDER(Biddy_Manager MNG);
static void debugORDERING(Biddy_Manager MNG, BiddyOrderingTable table, Biddy_Variable varnum);
*/
/* currently, not used */
/*
static void writeBDD(Biddy_Manager MNG, Biddy_Edge f);
static void warshall(BiddyOrderingTable table, Biddy_Variable varnum);
*/
/*----------------------------------------------------------------------------*/
/* Definition of exported functions */
/*----------------------------------------------------------------------------*/
/***************************************************************************//*!
\brief Function Biddy_InitMNG initialize a manager.
### Description
Biddy_InitMNG creates and initializes a manager.
Initialization consists of creating manager structure (MNG),
node table (biddyNodeTable), variable table (biddyVariableTable),
formula table (biddyFormulaTable), four basic caches (biddyOPCache,
biddyEACache, biddyRCCache, and biddyReplaceCache), and cache list
(biddyCacheList). Biddy_InitMNG also initializes constant edges
(biddyOne, biddyZero), memory management and automatic garbage collection.
### Side effects
Allocates a lot of memory.
### More info
Macro Biddy_InitAnonymous() will initialize anonymous manager.
Macro Biddy_Init() will initialize anonymous manager for ROBDDs.
*******************************************************************************/
#ifdef __cplusplus
extern "C" {
#endif
void
Biddy_InitMNG(Biddy_Manager *mng, int bddtype)
{
BiddyInitMNG(mng,bddtype);
}
#ifdef __cplusplus
}
#endif
/***************************************************************************//*!
\brief Function Biddy_ExitMNG deletes a manager.
### Description
Deallocates all memory allocated by Biddy_InitMNG, Biddy_FoaVariable,
Biddy_FoaNode etc.
### Side effects
### More info
Macro Biddy_Exit() will delete anonymous manager.
*******************************************************************************/
#ifdef __cplusplus
extern "C" {
#endif
void
Biddy_ExitMNG(Biddy_Manager *mng)
{
BiddyExitMNG(mng);
}
#ifdef __cplusplus
}
#endif
/***************************************************************************//*!
\brief Function Biddy_About reports version of Biddy package.
### Description
### Side effects
### More info
*******************************************************************************/
#ifdef __cplusplus
extern "C" {
#endif
Biddy_String
Biddy_About()
{
return BiddyAbout();
}
#ifdef __cplusplus
}
#endif
/***************************************************************************//*!
\brief Function Biddy_GetThen returns THEN successor.
### Description
Input mark is not transfered! External use, only.
### Side effects
For terminal nodes, function returns the same node.
### More info
Macro BiddyT(fun) is defined for internal use.
*******************************************************************************/
#ifdef __cplusplus
extern "C" {
#endif
Biddy_Edge
Biddy_GetThen(Biddy_Edge fun)
{
Biddy_Edge r;
if (BiddyIsTerminal(fun)) return fun;
r = BiddyT(fun);
/* EXTERNAL FUNCTIONS MUST RETURN NON-OBSOLETE NODE */
if ((BiddyN(r)->expiry) &&
((BiddyN(r)->expiry<BiddyN(fun)->expiry) || !(BiddyN(fun)->expiry))
)
{
BiddyN(r)->expiry = BiddyN(fun)->expiry;
}
return r;
}
#ifdef __cplusplus
}
#endif
/***************************************************************************//*!
\brief Function Biddy_GetElse returns ELSE successor.
### Description
Input mark is not transfered! External use, only.
### Side effects
For terminal nodes, function returns the same node.
### More info
Macro BiddyE(fun) is defined for internal use.
*******************************************************************************/
#ifdef __cplusplus
extern "C" {
#endif
Biddy_Edge
Biddy_GetElse(Biddy_Edge fun)
{
Biddy_Edge r;
if (BiddyIsTerminal(fun)) return fun;
r = BiddyE(fun);
/* EXTERNAL FUNCTIONS MUST RETURN NON-OBSOLETE NODE */
if ((BiddyN(r)->expiry) &&
((BiddyN(r)->expiry<BiddyN(fun)->expiry) || !(BiddyN(fun)->expiry))
)
{
BiddyN(r)->expiry = BiddyN(fun)->expiry;
}
return r;
}
#ifdef __cplusplus
}
#endif
/***************************************************************************//*!
\brief Function Biddy_GetTopVariable returns the top variable.
### Description
External use, only.
### Side effects
### More info
Macro BiddyV(fun) is defined for internal use.
*******************************************************************************/
#ifdef __cplusplus
extern "C" {
#endif
Biddy_Variable
Biddy_GetTopVariable(Biddy_Edge fun)
{
return BiddyV(fun);
}
#ifdef __cplusplus
}
#endif
/***************************************************************************//*!
\brief Function Biddy_Managed_GetTerminal returns unmarked and untagged
edge pointing to terminal node 1.
### Description
Terminal node depends on a manager.
### Side effects
### More info
Internally, use macro biddyTerminal.
Macro Biddy_GetTerminal() is defined for use with anonymous manager.
*******************************************************************************/
#ifdef __cplusplus
extern "C" {
#endif
Biddy_Edge
Biddy_Managed_GetTerminal(Biddy_Manager MNG)
{
if (!MNG) MNG = biddyAnonymousManager;
if (biddyManagerType == BIDDYTYPEOBDD) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPEOBDDC) {
/* IMPLEMENTED */
}
#ifndef COMPACT
else if (biddyManagerType == BIDDYTYPEZBDD) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPEZBDDC) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPETZBDD) {
/* IMPLEMENTED */
}
#endif
else {
fprintf(stderr,"Biddy_Managed_GetTerminal: Unsupported BDD type!\n");
return biddyNull;
}
return biddyTerminal;
}
#ifdef __cplusplus
}
#endif
/***************************************************************************//*!
\brief Function Biddy_Managed_GetConstantZero returns constant 0.
### Description
Constants 0 and 1 depend on a manager.
For combination sets, constant 0 coincides with empty set.
### Side effects
### More info
Internally, use macro biddyZero.
Macro Biddy_GetConstantZero() is defined for use with anonymous manager.
Macros Biddy_Managed_GetEmptySet(MNG) and Biddy_GetEmptySet() are defined
for manipulation of combination sets.
*******************************************************************************/
#ifdef __cplusplus
extern "C" {
#endif
Biddy_Edge
Biddy_Managed_GetConstantZero(Biddy_Manager MNG)
{
if (!MNG) MNG = biddyAnonymousManager;
if (biddyManagerType == BIDDYTYPEOBDD) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPEOBDDC) {
/* IMPLEMENTED */
}
#ifndef COMPACT
else if (biddyManagerType == BIDDYTYPEZBDD) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPEZBDDC) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPETZBDD) {
/* IMPLEMENTED */
}
#endif
else {
fprintf(stderr,"Biddy_Managed_GetConstantZero: Unsupported BDD type!\n");
return biddyNull;
}
return biddyZero;
}
#ifdef __cplusplus
}
#endif
/***************************************************************************//*!
\brief Function Biddy_Managed_GetConstantOne returns constant 1.
### Description
Constants 0 and 1 depend on a manager.
For combination sets, constant 1 coincides with universal set.
### Side effects
For ZBDDs and ZFDDs, you should always obtain constant 1 through the call
of this function!
### More info
Internally, use macro biddyOne (also for ZBDDs and ZFDDs!).
Macro Biddy_GetConstantOne() is defined for use with anonymous manager.
Macros Biddy_Managed_GetUniversalSet(MNG) and Biddy_GetUniversalSet() are
defined for manipulation of combination sets.
*******************************************************************************/
#ifdef __cplusplus
extern "C" {
#endif
Biddy_Edge
Biddy_Managed_GetConstantOne(Biddy_Manager MNG)
{
if (!MNG) MNG = biddyAnonymousManager;
if (biddyManagerType == BIDDYTYPEOBDD) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPEOBDDC) {
/* IMPLEMENTED */
}
#ifndef COMPACT
else if (biddyManagerType == BIDDYTYPEZBDD) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPEZBDDC) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPETZBDD) {
/* IMPLEMENTED */
}
#endif
else {
fprintf(stderr,"Biddy_Managed_GetConstantOne: Unsupported BDD type!\n");
return biddyNull;
}
return biddyOne;
}
#ifdef __cplusplus
}
#endif
/***************************************************************************//*!
\brief Function Biddy_Managed_IsSmaller returns TRUE if the first variable is
smaller (= lower = previous = above = topmore).
### Description
### Side effects
### More info
Internally, use macro BiddyIsSmaller(table,fv,gv).
Macro Biddy_IsSmaller(fv,gv) is defined for use with anonymous manager.
*******************************************************************************/
#ifdef __cplusplus
extern "C" {
#endif
Biddy_Boolean
Biddy_Managed_IsSmaller(Biddy_Manager MNG, Biddy_Variable fv, Biddy_Variable gv)
{
if (!MNG) MNG = biddyAnonymousManager;
if (biddyManagerType == BIDDYTYPEOBDD) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPEOBDDC) {
/* IMPLEMENTED */
}
#ifndef COMPACT
else if (biddyManagerType == BIDDYTYPEZBDD) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPEZBDDC) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPETZBDD) {
/* IMPLEMENTED */
}
#endif
else {
fprintf(stderr,"Biddy_Managed_IsSmaller: Unsupported BDD type!\n");
return FALSE;
}
return BiddyIsSmaller(biddyOrderingTable,fv,gv);
}
#ifdef __cplusplus
}
#endif
/***************************************************************************//*!
\brief Function Biddy_Managed_IsLowest returns TRUE if the variable is
the lowest one (lowest == topmost).
### Description
### Side effects
### More info
Internally, use macro BiddyIsLowest(v).
Macro Biddy_IsLowest(v) is defined for use with anonymous manager.
*******************************************************************************/
#ifdef __cplusplus
extern "C" {
#endif
Biddy_Boolean
Biddy_Managed_IsLowest(Biddy_Manager MNG, Biddy_Variable v)
{
/* lowest (topmost) variable has global ordering 1 */
/* global ordering is the number of zeros in corresponding line of orderingTable */
if (!MNG) MNG = biddyAnonymousManager;
if (biddyManagerType == BIDDYTYPEOBDD) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPEOBDDC) {
/* IMPLEMENTED */
}
#ifndef COMPACT
else if (biddyManagerType == BIDDYTYPEZBDD) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPEZBDDC) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPETZBDD) {
/* IMPLEMENTED */
}
#endif
else {
fprintf(stderr,"Biddy_Managed_IsLowest: Unsupported BDD type!\n");
return FALSE;
}
/* FOR OBDDs AND OFDDs: the lowest (topmost) variable always has prev=biddyVariableTable.size */
/* FOR ZBDDs, ZFDDs, TZBDDs, AND TZFDDs: the topmost variable always has prev=biddyVariableTable.num */
if (v >= biddyVariableTable.num) {
return FALSE;
} else {
return (biddyVariableTable.table[v].prev >= biddyVariableTable.num);
}
}
#ifdef __cplusplus
}
#endif
/***************************************************************************//*!
\brief Function Biddy_Managed_IsHighest returns TRUE if the variable is
the highest one if terminal node is ignored (highest == bottommost).
### Description
### Side effects
### More info
Internally, use macro BiddyIsHighest(v).
Macro Biddy_IsHighest(v) is defined for use with anonymous manager.
*******************************************************************************/
#ifdef __cplusplus
extern "C" {
#endif
Biddy_Boolean
Biddy_Managed_IsHighest(Biddy_Manager MNG, Biddy_Variable v)
{
/* highest (bottommost) variable is '1' and has global ordering numUsedVariables */
/* global ordering is the number of zeros in corresponding line of orderingTable */
if (!MNG) MNG = biddyAnonymousManager;
if (biddyManagerType == BIDDYTYPEOBDD) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPEOBDDC) {
/* IMPLEMENTED */
}
#ifndef COMPACT
else if (biddyManagerType == BIDDYTYPEZBDD) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPEZBDDC) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPETZBDD) {
/* IMPLEMENTED */
}
#endif
else {
fprintf(stderr,"Biddy_Managed_IsHighest: Unsupported BDD type!\n");
return FALSE;
}
/* ALWAYS: the highest (bottommost) variable has next=0 */
if ((biddyVariableTable.num == 1) && (v == 0)) return TRUE;
if ((v == 0) || (v >= biddyVariableTable.num)) {
return FALSE;
} else {
return (biddyVariableTable.table[v].next == 0);
}
}
#ifdef __cplusplus
}
#endif
/***************************************************************************//*!
\brief Function Biddy_Managed_Refresh refreshes top node in a given function.
### Description
This is an external variant of internal macro BiddyRefresh
This is needed for implementing user caches.
### Side effects
### More info
Internally, use macro BiddyRefresh(f).
Macro Biddy_Refresh(f) is defined for use with anonymous manager.
*******************************************************************************/
#ifdef __cplusplus
extern "C" {
#endif
void
Biddy_Managed_Refresh(Biddy_Manager MNG, Biddy_Edge f)
{
if (!MNG) MNG = biddyAnonymousManager;
if (biddyManagerType == BIDDYTYPEOBDD) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPEOBDDC) {
/* IMPLEMENTED */
}
#ifndef COMPACT
else if (biddyManagerType == BIDDYTYPEZBDD) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPEZBDDC) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPETZBDD) {
/* IMPLEMENTED */
}
#endif
else {
fprintf(stderr,"Biddy_Managed_Refresh: Unsupported BDD type!\n");
return;
}
BiddyRefresh(f);
}
#ifdef __cplusplus
}
#endif
/***************************************************************************//*!
\brief Function Biddy_Managed_IsOK returns TRUE iff given node is not obsolete.
### Description
This is needed for implementation of user caches.
TO DO: implement internal macro to avoid using BiddyManagedIsOK.
### Side effects
### More info
Internally, use macro BiddyIsOK(f) - NOT IMPLEMENTED, YET!
Macro BiddyIsOKDebug(f) is defined for debugging, it checks more properties
and not only the expiry value.
Macro Biddy_IsOK(f) is defined for use with anonymous manager.
*******************************************************************************/
#ifdef __cplusplus
extern "C" {
#endif
Biddy_Boolean
Biddy_Managed_IsOK(Biddy_Manager MNG, Biddy_Edge f)
{
if (!MNG) MNG = biddyAnonymousManager;
if (biddyManagerType == BIDDYTYPEOBDD) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPEOBDDC) {
/* IMPLEMENTED */
}
#ifndef COMPACT
else if (biddyManagerType == BIDDYTYPEZBDD) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPEZBDDC) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPETZBDD) {
/* IMPLEMENTED */
}
#endif
else {
fprintf(stderr,"Biddy_Managed_IsOK: Unsupported BDD type!\n");
return FALSE;
}
return BiddyManagedIsOK(MNG,f);
}
#ifdef __cplusplus
}
#endif
/***************************************************************************//*!
\brief Function Biddy_Managed_GetManagerType reports BDD type used in the
manager.
### Description
### Side effects
### More info
Macro Biddy_GetManagerType() is defined for use with anonymous manager.
*******************************************************************************/
#ifdef __cplusplus
extern "C" {
#endif
int
Biddy_Managed_GetManagerType(Biddy_Manager MNG)
{
if (!MNG) MNG = biddyAnonymousManager;
if (biddyManagerType == BIDDYTYPEOBDD) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPEOBDDC) {
/* IMPLEMENTED */
}
#ifndef COMPACT
else if (biddyManagerType == BIDDYTYPEZBDD) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPEZBDDC) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPETZBDD) {
/* IMPLEMENTED */
}
#endif
else {
fprintf(stderr,"Biddy_Managed_GetManagerType: Unsupported BDD type!\n");
return 0;
}
return BiddyManagedGetManagerType(MNG);
}
#ifdef __cplusplus
}
#endif
/***************************************************************************//*!
\brief Function Biddy_Managed_GetManagerName reports the name of the BDD type
used in the manager.
### Description
### Side effects
### More info
Macro Biddy_GetManagerName() is defined for use with anonymous manager.
*******************************************************************************/
#ifdef __cplusplus
extern "C" {
#endif
Biddy_String
Biddy_Managed_GetManagerName(Biddy_Manager MNG)
{
if (!MNG) MNG = biddyAnonymousManager;
if (biddyManagerType == BIDDYTYPEOBDD) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPEOBDDC) {
/* IMPLEMENTED */
}
#ifndef COMPACT
else if (biddyManagerType == BIDDYTYPEZBDD) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPEZBDDC) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPETZBDD) {
/* IMPLEMENTED */
}
#endif
else {
fprintf(stderr,"Biddy_Managed_GetManagerName: Unsupported BDD type!\n");
return 0;
}
return BiddyManagedGetManagerName(MNG);
}
#ifdef __cplusplus
}
#endif
/***************************************************************************//*!
\brief Function Biddy_Managed_SetManagerParameters set modifiable parameters.
### Description
Function expect 6 float values. If the value is < 0 then the parameter
is not modified. The parameters are:
biddyNodeTable.gcratio (do not delete nodes if the effect is to small),
biddyNodeTable.gcratioF (do not delete nodes if the effect is to small),
biddyNodeTable.gcratioX (do not delete nodes if the effect is to small),
biddyNodeTable.resizeratio (resize Node table if there are to many nodes),
biddyNodeTable.resizeratioF (resize Node table if there are to many nodes),
biddyNodeTable.resizeratioX (resize Node table if there are to many nodes),
biddyNodeTable.siftingtreshold (stop sifting if the size of the system
grows to much),
biddyNodeTable.fsiftingtreshold (stop sifting if the size of the function
grows to much),
biddyNodeTable.convergesiftingtreshold (stop one step of converging sifting
if the size of the system grows to much),
biddyNodeTable.fconvergesiftingtreshold (stop one step of converging sifting
if the size of the function grows to much).
### Side effects
Initial values are given in Biddy_InitMNG.
### More info
Macro Biddy_SetManagerParameters() is defined for use with anonymous
manager.
*******************************************************************************/
#ifdef __cplusplus
extern "C" {
#endif
void
Biddy_Managed_SetManagerParameters(Biddy_Manager MNG, float gcr, float gcrF,
float gcrX, float rr, float rrF, float rrX, float st, float cst)
{
if (!MNG) MNG = biddyAnonymousManager;
if (biddyManagerType == BIDDYTYPEOBDD) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPEOBDDC) {
/* IMPLEMENTED */
}
#ifndef COMPACT
else if (biddyManagerType == BIDDYTYPEZBDD) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPEZBDDC) {
/* IMPLEMENTED */
}
else if (biddyManagerType == BIDDYTYPETZBDD) {
/* IMPLEMENTED */
}
#endif
else {
fprintf(stderr,"Biddy_Managed_SetManagerParameters: Unsupported BDD type!\n");
return;
}
BiddyManagedSetManagerParameters(MNG,gcr,gcrF,gcrX,rr,rrF,rrX,st,cst);
}
#ifdef __cplusplus
}
#endif
/***************************************************************************//*!
\brief Function Biddy_Managed_GetBaseSet returns set containing only a null
combination, i.e. it returns {{}}.
### Description
### Side effects
### More info
Macro Biddy_GetBaseSet() is defined for use with anonymous manager.
*******************************************************************************/
#ifdef __cplusplus
extern "C" {
#endif
Biddy_Edge
Biddy_Managed_GetBaseSet(Biddy_Manager MNG)
{
Biddy_Edge r;
if (!MNG) MNG = biddyAnonymousManager;
r = biddyNull;
if (biddyManagerType == BIDDYTYPEOBDD) {
/* IMPLEMENTED */
r = BiddyManagedGetBaseSet(MNG);
BiddyRefresh(r); /* not always refreshed by BiddyManagedGetBaseSet */
}
else if (biddyManagerType == BIDDYTYPEOBDDC) {
/* IMPLEMENTED */
r = BiddyManagedGetBaseSet(MNG);
BiddyRefresh(r); /* not always refreshed by BiddyManagedGetBaseSet */
}
#ifndef COMPACT
else if (biddyManagerType == BIDDYTYPEZBDD) {
/* IMPLEMENTED */
r = BiddyManagedGetBaseSet(MNG);
/* BiddyRefresh() */ /* not needed, because terminal node is returned */
}
else if (biddyManagerType == BIDDYTYPEZBDDC) {
/* IMPLEMENTED */
r = BiddyManagedGetBaseSet(MNG);
/* BiddyRefresh() */ /* not needed, because terminal node is returned */
}
else if (biddyManagerType == BIDDYTYPETZBDD) {
/* IMPLEMENTED */
r = BiddyManagedGetBaseSet(MNG);
/* BiddyRefresh() */ /* not needed, because terminal node is returned */
}
#endif
else {
fprintf(stderr,"Biddy_Managed_GetBaseSet: Unsupported BDD type!\n");
return biddyNull;
}
return r;
}
#ifdef __cplusplus
}
#endif
/***************************************************************************//*!
\brief Function Biddy_Managed_TransferMark returns edge with inverted
complement bit iff the second parameter is TRUE and normalization
rules require this.