diogo/yap-6.3
Archived
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

simplified hash table management

Browse Source
This commit is contained in:
Fabrizio Riguzzi
2010-07-27 23:03:06 +02:00
parent 42bdf4f50b
commit b62c7b98f2
3 changed files with 5 additions and 67 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
packages/cplint/cplint_Prob.c
View File

@@ -121,7 +121,7 @@ so that it is not recomputed
variable v;
double res;
double * value_p;
DdNode **key,*nodereg;
DdNode *nodereg;
double *rp;
index=Cudd_NodeReadIndex(node);
@@ -136,7 +136,7 @@ so that it is not recomputed
else
{
nodereg=Cudd_Regular(node);
value_p=g_hash_table_lookup(nodes,&nodereg);
value_p=g_hash_table_lookup(nodes,nodereg);
if (value_p!=NULL)
{
if (comp)
@@ -150,11 +150,9 @@ so that it is not recomputed
v=vars.varar[mVarIndex];
nBit=v.nBit;
res=ProbBool(node,0,nBit,0,v,mVarIndex,vars,nodes,0);
key=(DdNode **)malloc(sizeof(DdNode *));
*key=nodereg;
rp=(double *)malloc(sizeof(double));
*rp=res;
g_hash_table_insert(nodes, key, rp);
g_hash_table_insert(nodes, nodereg, rp);
if (comp)
return 1-res;
else