-
Notifications
You must be signed in to change notification settings - Fork 2
/
cuddauxUtil.c
170 lines (152 loc) · 4.02 KB
/
cuddauxUtil.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
/**CFile***********************************************************************
FileName [cuddauxUtil.c]
PackageName [cuddaux]
Synopsis [Manipulation of objects CuddauxMan, CuddauxCache, CuddauxHash.]
Description [Miscellaneous operations.]
Author [Bertrand Jeannet]
Copyright []
******************************************************************************/
#include <assert.h>
#include <stdio.h>
#include <stdlib.h>
#include <limits.h>
#include "cuddInt.h"
#include "util.h"
#include "st.h"
#include "cuddaux.h"
/* ********************************************************************** */
/* CuddauxMan */
/* ********************************************************************** */
void cuddauxManFree(struct CuddauxMan* man)
{
assert(man->count>=1);
if (man->count<=1){
assert(Cudd_CheckZeroRef(man->man)==0);
Cudd_Quit(man->man);
free(man);
}
else if (man->count != SIZE_MAX)
man->count--;
}
/* ********************************************************************** */
/* CuddauxCache */
/* ********************************************************************** */
DdLocalCache* cuddauxCacheReinit(struct CuddauxMan* man, struct CuddauxCache* cache)
{
if (cache->cache && cache->cache->manager!=man->man){
cuddauxCacheClear(cache);
}
if (cache->cache == NULL){
cache->cache =
cuddLocalCacheInit(man->man,
cache->arity,
cache->initialsize,
cache->maxsize);
if (cache->cache == NULL)
man->man->errorCode = CUDD_MEMORY_OUT;
else
cache->man = cuddauxManCopy(man);
}
return cache->cache;
}
/* ********************************************************************** */
/* CuddauxHash */
/* ********************************************************************** */
DdHashTable* cuddauxHashReinit(struct CuddauxMan* man, struct CuddauxHash* hash)
{
if (hash->man && hash->man!=man){
cuddauxHashClear(hash);
}
if (hash->hash == NULL){
hash->hash =
cuddHashTableInit(man->man,
hash->arity,
hash->initialsize);
if (hash->hash == NULL)
man->man->errorCode = CUDD_MEMORY_OUT;
else
hash->man = cuddauxManCopy(man);
}
return hash->hash;
}
/* ********************************************************************** */
/* common__t */
/* ********************************************************************** */
DdNode* cuddauxCommonLookupN(struct common* common, DdNode** tab)
{
int i;
bool maybe;
DdNode* res = NULL;
switch (common->arity){
case 1:
return cuddauxCommonLookup1(common,tab[0]);
case 2:
return cuddauxCommonLookup2(common,tab[0],tab[1]);
case 3:
return cuddauxCommonLookup3(common,tab[0],tab[1],tab[2]);
default:
switch (common->memo.discr){
case Global:
abort();
case Cache:
res = cuddLocalCacheLookup(common->memo.u.cache->cache,tab);
break;
case Hash:
maybe = false;
for (i=0;i<common->arity;i++){
if (tab[i]->ref!=1){
maybe=true; break;
}
}
if (maybe)
res = cuddHashTableLookup(common->memo.u.hash->hash,tab);
break;
default:
abort();
}
}
return res;
}
DdNode* cuddauxCommonInsertN(struct common* common, DdNode** tab, DdNode* res)
{
int i;
ptrint fanout;
switch (common->arity){
case 1:
return cuddauxCommonInsert1(common,tab[0],res);
case 2:
return cuddauxCommonInsert2(common,tab[0],tab[1],res);
case 3:
return cuddauxCommonInsert3(common,tab[0],tab[1],tab[2],res);
default:
switch (common->memo.discr){
case Global:
abort();
case Cache:
cuddLocalCacheInsert(common->memo.u.cache->cache,tab,res);
return res;
break;
case Hash:
fanout = 1;
for (i=0;i<common->arity;i++){
fanout *= tab[i]->ref;
if (fanout >= DD_MAXREF){
fanout = DD_MAXREF;
break;
}
}
if (fanout!=1){
cuddSatDec(fanout);
if (!cuddHashTableInsert(common->memo.u.hash->hash,tab,res,fanout)){
Cudd_RecursiveDeref(common->man->man, res);
return(NULL);
}
}
return res;
break;
default:
abort();
}
}
return res;
}