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
|
/**CFile***********************************************************************
FileName [cuddRef.c]
PackageName [cudd]
Synopsis [Functions that manipulate the reference counts.]
Description [External procedures included in this module:
<ul>
<li> Cudd_Ref()
<li> Cudd_RecursiveDeref()
<li> Cudd_IterDerefBdd()
<li> Cudd_DelayedDerefBdd()
<li> Cudd_RecursiveDerefZdd()
<li> Cudd_Deref()
<li> Cudd_CheckZeroRef()
</ul>
Internal procedures included in this module:
<ul>
<li> cuddReclaim()
<li> cuddReclaimZdd()
<li> cuddClearDeathRow()
<li> cuddShrinkDeathRow()
<li> cuddIsInDeathRow()
<li> cuddTimesInDeathRow()
</ul>
]
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.]
******************************************************************************/
#include "util_hack.h"
#include "cuddInt.h"
ABC_NAMESPACE_IMPL_START
/*---------------------------------------------------------------------------*/
/* Constant declarations */
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
/* Stucture declarations */
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
/* Type declarations */
/*---------------------------------------------------------------------------*/
/*---------------------------------------------------------------------------*/
/* Variable declarations */
/*---------------------------------------------------------------------------*/
#ifndef lint
static char rcsid[] DD_UNUSED = "$Id: cuddRef.c,v 1.1.1.1 2003/02/24 22:23:53 wjiang Exp $";
#endif
/*---------------------------------------------------------------------------*/
/* Macro declarations */
/*---------------------------------------------------------------------------*/
/**AutomaticStart*************************************************************/
/*---------------------------------------------------------------------------*/
/* Static function prototypes */
/*---------------------------------------------------------------------------*/
/**AutomaticEnd***************************************************************/
/*---------------------------------------------------------------------------*/
/* Definition of exported functions */
/*---------------------------------------------------------------------------*/
/**Function********************************************************************
Synopsis [Increases the reference count of a node, if it is not
saturated.]
Description []
SideEffects [None]
SeeAlso [Cudd_RecursiveDeref Cudd_Deref]
******************************************************************************/
void
Cudd_Ref(
DdNode * n)
{
n = Cudd_Regular(n);
cuddSatInc(n->ref);
} /* end of Cudd_Ref */
/**Function********************************************************************
Synopsis [Decreases the reference count of node n.]
Description [Decreases the reference count of node n. If n dies,
recursively decreases the reference counts of its children. It is
used to dispose of a DD that is no longer needed.]
SideEffects [None]
SeeAlso [Cudd_Deref Cudd_Ref Cudd_RecursiveDerefZdd]
******************************************************************************/
void
Cudd_RecursiveDeref(
DdManager * table,
DdNode * n)
{
DdNode *N;
int ord;
DdNodePtr *stack = table->stack;
int SP = 1;
unsigned int live = table->keys - table->dead;
if (live > table->peakLiveNodes) {
table->peakLiveNodes = live;
}
N = Cudd_Regular(n);
do {
#ifdef DD_DEBUG
assert(N->ref != 0);
#endif
if (N->ref == 1) {
N->ref = 0;
table->dead++;
#ifdef DD_STATS
table->nodesDropped++;
#endif
if (cuddIsConstant(N)) {
table->constants.dead++;
N = stack[--SP];
} else {
ord = table->perm[N->index];
stack[SP++] = Cudd_Regular(cuddE(N));
table->subtables[ord].dead++;
N = cuddT(N);
}
} else {
cuddSatDec(N->ref);
N = stack[--SP];
}
} while (SP != 0);
} /* end of Cudd_RecursiveDeref */
/**Function********************************************************************
Synopsis [Decreases the reference count of BDD node n.]
Description [Decreases the reference count of node n. If n dies,
recursively decreases the reference counts of its children. It is
used to dispose of a BDD that is no longer needed. It is more
efficient than Cudd_RecursiveDeref, but it cannot be used on
ADDs. The greater efficiency comes from being able to assume that no
constant node will ever die as a result of a call to this
procedure.]
SideEffects [None]
SeeAlso [Cudd_RecursiveDeref Cudd_DelayedDerefBdd]
******************************************************************************/
void
Cudd_IterDerefBdd(
DdManager * table,
DdNode * n)
{
DdNode *N;
int ord;
DdNodePtr *stack = table->stack;
int SP = 1;
unsigned int live = table->keys - table->dead;
if (live > table->peakLiveNodes) {
table->peakLiveNodes = live;
}
N = Cudd_Regular(n);
do {
#ifdef DD_DEBUG
assert(N->ref != 0);
#endif
if (N->ref == 1) {
N->ref = 0;
table->dead++;
#ifdef DD_STATS
table->nodesDropped++;
#endif
ord = table->perm[N->index];
stack[SP++] = Cudd_Regular(cuddE(N));
table->subtables[ord].dead++;
N = cuddT(N);
} else {
cuddSatDec(N->ref);
N = stack[--SP];
}
} while (SP != 0);
} /* end of Cudd_IterDerefBdd */
/**Function********************************************************************
Synopsis [Decreases the reference count of BDD node n.]
Description [Enqueues node n for later dereferencing. If the queue
is full decreases the reference count of the oldest node N to make
room for n. If N dies, recursively decreases the reference counts of
its children. It is used to dispose of a BDD that is currently not
needed, but may be useful again in the near future. The dereferencing
proper is done as in Cudd_IterDerefBdd.]
SideEffects [None]
SeeAlso [Cudd_RecursiveDeref Cudd_IterDerefBdd]
******************************************************************************/
void
Cudd_DelayedDerefBdd(
DdManager * table,
DdNode * n)
{
DdNode *N;
int ord;
DdNodePtr *stack;
int SP;
unsigned int live = table->keys - table->dead;
if (live > table->peakLiveNodes) {
table->peakLiveNodes = live;
}
n = Cudd_Regular(n);
#ifdef DD_DEBUG
assert(n->ref != 0);
#endif
#ifdef DD_NO_DEATH_ROW
N = n;
#else
if (cuddIsConstant(n) || n->ref > 1) {
#ifdef DD_DEBUG
assert(n->ref != 1 && (!cuddIsConstant(n) || n == DD_ONE(table)));
#endif
cuddSatDec(n->ref);
return;
}
N = table->deathRow[table->nextDead];
if (N != NULL) {
#endif
#ifdef DD_DEBUG
assert(!Cudd_IsComplement(N));
#endif
stack = table->stack;
SP = 1;
do {
#ifdef DD_DEBUG
assert(N->ref != 0);
#endif
if (N->ref == 1) {
N->ref = 0;
table->dead++;
#ifdef DD_STATS
table->nodesDropped++;
#endif
ord = table->perm[N->index];
stack[SP++] = Cudd_Regular(cuddE(N));
table->subtables[ord].dead++;
N = cuddT(N);
} else {
cuddSatDec(N->ref);
N = stack[--SP];
}
} while (SP != 0);
#ifndef DD_NO_DEATH_ROW
}
table->deathRow[table->nextDead] = n;
/* Udate insertion point. */
table->nextDead++;
table->nextDead &= table->deadMask;
#if 0
if (table->nextDead == table->deathRowDepth) {
if (table->deathRowDepth < table->looseUpTo / 2) {
// extern void (*MMoutOfMemory)(long);
void (*saveHandler)(long) = MMoutOfMemory;
DdNodePtr *newRow;
MMoutOfMemory = Cudd_OutOfMem;
newRow = ABC_REALLOC(DdNodePtr,table->deathRow,2*table->deathRowDepth);
MMoutOfMemory = saveHandler;
if (newRow == NULL) {
table->nextDead = 0;
} else {
int i;
table->memused += table->deathRowDepth;
i = table->deathRowDepth;
table->deathRowDepth <<= 1;
for (; i < table->deathRowDepth; i++) {
newRow[i] = NULL;
}
table->deadMask = table->deathRowDepth - 1;
table->deathRow = newRow;
}
} else {
table->nextDead = 0;
}
}
#endif
#endif
} /* end of Cudd_DelayedDerefBdd */
/**Function********************************************************************
Synopsis [Decreases the reference count of ZDD node n.]
Description [Decreases the reference count of ZDD node n. If n dies,
recursively decreases the reference counts of its children. It is
used to dispose of a ZDD that is no longer needed.]
SideEffects [None]
SeeAlso [Cudd_Deref Cudd_Ref Cudd_RecursiveDeref]
******************************************************************************/
void
Cudd_RecursiveDerefZdd(
DdManager * table,
DdNode * n)
{
DdNode *N;
int ord;
DdNodePtr *stack = table->stack;
int SP = 1;
N = n;
do {
#ifdef DD_DEBUG
assert(N->ref != 0);
#endif
cuddSatDec(N->ref);
if (N->ref == 0) {
table->deadZ++;
#ifdef DD_STATS
table->nodesDropped++;
#endif
#ifdef DD_DEBUG
assert(!cuddIsConstant(N));
#endif
ord = table->permZ[N->index];
stack[SP++] = cuddE(N);
table->subtableZ[ord].dead++;
N = cuddT(N);
} else {
N = stack[--SP];
}
} while (SP != 0);
} /* end of Cudd_RecursiveDerefZdd */
/**Function********************************************************************
Synopsis [Decreases the reference count of node.]
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 Cudd_Ref.]
SideEffects [None]
SeeAlso [Cudd_RecursiveDeref Cudd_RecursiveDerefZdd Cudd_Ref]
******************************************************************************/
void
Cudd_Deref(
DdNode * node)
{
node = Cudd_Regular(node);
cuddSatDec(node->ref);
} /* end of Cudd_Deref */
/**Function********************************************************************
Synopsis [Checks the unique table for nodes with non-zero reference
counts.]
Description [Checks the unique table for nodes with non-zero
reference counts. It is normally called before Cudd_Quit to make sure
that there are no memory leaks due to missing Cudd_RecursiveDeref's.
Takes into account that reference counts may saturate and that the
basic constants and the projection functions are referenced by the
manager. Returns the number of nodes with non-zero reference count.
(Except for the cases mentioned above.)]
SideEffects [None]
SeeAlso []
******************************************************************************/
int
Cudd_CheckZeroRef(
DdManager * manager)
{
int size;
int i, j;
int remain; /* the expected number of remaining references to one */
DdNodePtr *nodelist;
DdNode *node;
DdNode *sentinel = &(manager->sentinel);
DdSubtable *subtable;
int count = 0;
int index;
#ifndef DD_NO_DEATH_ROW
cuddClearDeathRow(manager);
#endif
/* First look at the BDD/ADD subtables. */
remain = 1; /* reference from the manager */
size = manager->size;
remain += 2 * size; /* reference from the BDD projection functions */
for (i = 0; i < size; i++) {
subtable = &(manager->subtables[i]);
nodelist = subtable->nodelist;
for (j = 0; (unsigned) j < subtable->slots; j++) {
node = nodelist[j];
while (node != sentinel) {
if (node->ref != 0 && node->ref != DD_MAXREF) {
index = (int) node->index;
if (node != manager->vars[index]) {
count++;
} else {
if (node->ref != 1) {
count++;
}
}
}
node = node->next;
}
}
}
/* Then look at the ZDD subtables. */
size = manager->sizeZ;
if (size) /* references from ZDD universe */
remain += 2;
for (i = 0; i < size; i++) {
subtable = &(manager->subtableZ[i]);
nodelist = subtable->nodelist;
for (j = 0; (unsigned) j < subtable->slots; j++) {
node = nodelist[j];
while (node != NULL) {
if (node->ref != 0 && node->ref != DD_MAXREF) {
index = (int) node->index;
if (node == manager->univ[manager->permZ[index]]) {
if (node->ref > 2) {
count++;
}
} else {
count++;
}
}
node = node->next;
}
}
}
/* Now examine the constant table. Plusinfinity, minusinfinity, and
** zero are referenced by the manager. One is referenced by the
** manager, by the ZDD universe, and by all projection functions.
** All other nodes should have no references.
*/
nodelist = manager->constants.nodelist;
for (j = 0; (unsigned) j < manager->constants.slots; j++) {
node = nodelist[j];
while (node != NULL) {
if (node->ref != 0 && node->ref != DD_MAXREF) {
if (node == manager->one) {
if ((int) node->ref != remain) {
count++;
}
} else if (node == manager->zero ||
node == manager->plusinfinity ||
node == manager->minusinfinity) {
if (node->ref != 1) {
count++;
}
} else {
count++;
}
}
node = node->next;
}
}
return(count);
} /* end of Cudd_CheckZeroRef */
/*---------------------------------------------------------------------------*/
/* Definition of internal functions */
/*---------------------------------------------------------------------------*/
/**Function********************************************************************
Synopsis [Brings children of a dead node back.]
Description []
SideEffects [None]
SeeAlso [cuddReclaimZdd]
******************************************************************************/
void
cuddReclaim(
DdManager * table,
DdNode * n)
{
DdNode *N;
int ord;
DdNodePtr *stack = table->stack;
int SP = 1;
double initialDead = table->dead;
N = Cudd_Regular(n);
#ifdef DD_DEBUG
assert(N->ref == 0);
#endif
do {
if (N->ref == 0) {
N->ref = 1;
table->dead--;
if (cuddIsConstant(N)) {
table->constants.dead--;
N = stack[--SP];
} else {
ord = table->perm[N->index];
stack[SP++] = Cudd_Regular(cuddE(N));
table->subtables[ord].dead--;
N = cuddT(N);
}
} else {
cuddSatInc(N->ref);
N = stack[--SP];
}
} while (SP != 0);
N = Cudd_Regular(n);
cuddSatDec(N->ref);
table->reclaimed += initialDead - table->dead;
} /* end of cuddReclaim */
/**Function********************************************************************
Synopsis [Brings children of a dead ZDD node back.]
Description []
SideEffects [None]
SeeAlso [cuddReclaim]
******************************************************************************/
void
cuddReclaimZdd(
DdManager * table,
DdNode * n)
{
DdNode *N;
int ord;
DdNodePtr *stack = table->stack;
int SP = 1;
N = n;
#ifdef DD_DEBUG
assert(N->ref == 0);
#endif
do {
cuddSatInc(N->ref);
if (N->ref == 1) {
table->deadZ--;
table->reclaimed++;
#ifdef DD_DEBUG
assert(!cuddIsConstant(N));
#endif
ord = table->permZ[N->index];
stack[SP++] = cuddE(N);
table->subtableZ[ord].dead--;
N = cuddT(N);
} else {
N = stack[--SP];
}
} while (SP != 0);
cuddSatDec(n->ref);
} /* end of cuddReclaimZdd */
/**Function********************************************************************
Synopsis [Shrinks the death row.]
Description [Shrinks the death row by a factor of four.]
SideEffects [None]
SeeAlso [cuddClearDeathRow]
******************************************************************************/
void
cuddShrinkDeathRow(
DdManager *table)
{
#ifndef DD_NO_DEATH_ROW
int i;
if (table->deathRowDepth > 3) {
for (i = table->deathRowDepth/4; i < table->deathRowDepth; i++) {
if (table->deathRow[i] == NULL) break;
Cudd_IterDerefBdd(table,table->deathRow[i]);
table->deathRow[i] = NULL;
}
table->deathRowDepth /= 4;
table->deadMask = table->deathRowDepth - 2;
if ((unsigned) table->nextDead > table->deadMask) {
table->nextDead = 0;
}
table->deathRow = ABC_REALLOC(DdNodePtr, table->deathRow,
table->deathRowDepth);
}
#endif
} /* end of cuddShrinkDeathRow */
/**Function********************************************************************
Synopsis [Clears the death row.]
Description []
SideEffects [None]
SeeAlso [Cudd_DelayedDerefBdd Cudd_IterDerefBdd Cudd_CheckZeroRef
cuddGarbageCollect]
******************************************************************************/
void
cuddClearDeathRow(
DdManager *table)
{
#ifndef DD_NO_DEATH_ROW
int i;
for (i = 0; i < table->deathRowDepth; i++) {
if (table->deathRow[i] == NULL) break;
Cudd_IterDerefBdd(table,table->deathRow[i]);
table->deathRow[i] = NULL;
}
#ifdef DD_DEBUG
for (; i < table->deathRowDepth; i++) {
assert(table->deathRow[i] == NULL);
}
#endif
table->nextDead = 0;
#endif
} /* end of cuddClearDeathRow */
/**Function********************************************************************
Synopsis [Checks whether a node is in the death row.]
Description [Checks whether a node is in the death row. Returns the
position of the first occurrence if the node is present; -1
otherwise.]
SideEffects [None]
SeeAlso [Cudd_DelayedDerefBdd cuddClearDeathRow]
******************************************************************************/
int
cuddIsInDeathRow(
DdManager *dd,
DdNode *f)
{
#ifndef DD_NO_DEATH_ROW
int i;
for (i = 0; i < dd->deathRowDepth; i++) {
if (f == dd->deathRow[i]) {
return(i);
}
}
#endif
return(-1);
} /* end of cuddIsInDeathRow */
/**Function********************************************************************
Synopsis [Counts how many times a node is in the death row.]
Description []
SideEffects [None]
SeeAlso [Cudd_DelayedDerefBdd cuddClearDeathRow cuddIsInDeathRow]
******************************************************************************/
int
cuddTimesInDeathRow(
DdManager *dd,
DdNode *f)
{
int count = 0;
#ifndef DD_NO_DEATH_ROW
int i;
for (i = 0; i < dd->deathRowDepth; i++) {
count += f == dd->deathRow[i];
}
#endif
return(count);
} /* end of cuddTimesInDeathRow */
/*---------------------------------------------------------------------------*/
/* Definition of static functions */
/*---------------------------------------------------------------------------*/
ABC_NAMESPACE_IMPL_END
|