Skip to content
Projects
Groups
Snippets
Help
This project
Loading...
Sign in / Register
Toggle navigation
A
abc
Overview
Overview
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
lvzhengyang
abc
Commits
3906e37c
Commit
3906e37c
authored
Jan 22, 2012
by
Alan Mishchenko
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Bug fix for incorrect memory allocation in main SAT solver, leading to crashes in 'dsec'.
parent
fb918249
Hide whitespace changes
Inline
Side-by-side
Showing
3 changed files
with
6 additions
and
6 deletions
+6
-6
src/aig/ivy/ivyFraig.c
+4
-4
src/proof/cec/cecSolve.c
+1
-1
src/proof/fra/fraSat.c
+1
-1
No files found.
src/aig/ivy/ivyFraig.c
View file @
3906e37c
...
@@ -2119,9 +2119,9 @@ int Ivy_FraigNodesAreEquiv( Ivy_FraigMan_t * p, Ivy_Obj_t * pOld, Ivy_Obj_t * pN
...
@@ -2119,9 +2119,9 @@ int Ivy_FraigNodesAreEquiv( Ivy_FraigMan_t * p, Ivy_Obj_t * pOld, Ivy_Obj_t * pN
if
(
p
->
pSat
==
NULL
)
if
(
p
->
pSat
==
NULL
)
{
{
p
->
pSat
=
sat_solver_new
();
p
->
pSat
=
sat_solver_new
();
p
->
pSat
->
factors
=
ABC_CALLOC
(
double
,
1
);
p
->
nSatVars
=
1
;
sat_solver_setnvars
(
p
->
pSat
,
1000
);
sat_solver_setnvars
(
p
->
pSat
,
1000
);
p
->
pSat
->
factors
=
ABC_CALLOC
(
double
,
1000
);
p
->
nSatVars
=
1
;
// var 0 is reserved for const1 node - add the clause
// var 0 is reserved for const1 node - add the clause
// pLits[0] = toLit( 0 );
// pLits[0] = toLit( 0 );
// sat_solver_addclause( p->pSat, pLits, pLits + 1 );
// sat_solver_addclause( p->pSat, pLits, pLits + 1 );
...
@@ -2271,9 +2271,9 @@ int Ivy_FraigNodeIsConst( Ivy_FraigMan_t * p, Ivy_Obj_t * pNew )
...
@@ -2271,9 +2271,9 @@ int Ivy_FraigNodeIsConst( Ivy_FraigMan_t * p, Ivy_Obj_t * pNew )
if
(
p
->
pSat
==
NULL
)
if
(
p
->
pSat
==
NULL
)
{
{
p
->
pSat
=
sat_solver_new
();
p
->
pSat
=
sat_solver_new
();
p
->
pSat
->
factors
=
ABC_CALLOC
(
double
,
1
);
p
->
nSatVars
=
1
;
sat_solver_setnvars
(
p
->
pSat
,
1000
);
sat_solver_setnvars
(
p
->
pSat
,
1000
);
p
->
pSat
->
factors
=
ABC_CALLOC
(
double
,
1000
);
p
->
nSatVars
=
1
;
// var 0 is reserved for const1 node - add the clause
// var 0 is reserved for const1 node - add the clause
// pLits[0] = toLit( 0 );
// pLits[0] = toLit( 0 );
// sat_solver_addclause( p->pSat, pLits, pLits + 1 );
// sat_solver_addclause( p->pSat, pLits, pLits + 1 );
...
...
src/proof/cec/cecSolve.c
View file @
3906e37c
...
@@ -376,8 +376,8 @@ void Cec_ManSatSolverRecycle( Cec_ManSat_t * p )
...
@@ -376,8 +376,8 @@ void Cec_ManSatSolverRecycle( Cec_ManSat_t * p )
sat_solver_delete
(
p
->
pSat
);
sat_solver_delete
(
p
->
pSat
);
}
}
p
->
pSat
=
sat_solver_new
();
p
->
pSat
=
sat_solver_new
();
p
->
pSat
->
factors
=
ABC_CALLOC
(
double
,
1
);
sat_solver_setnvars
(
p
->
pSat
,
1000
);
sat_solver_setnvars
(
p
->
pSat
,
1000
);
p
->
pSat
->
factors
=
ABC_CALLOC
(
double
,
1000
);
// var 0 is not used
// var 0 is not used
// var 1 is reserved for const0 node - add the clause
// var 1 is reserved for const0 node - add the clause
p
->
nSatVars
=
1
;
p
->
nSatVars
=
1
;
...
...
src/proof/fra/fraSat.c
View file @
3906e37c
...
@@ -512,7 +512,7 @@ int Fra_SetActivityFactors_rec( Fra_Man_t * p, Aig_Obj_t * pObj, int LevelMin, i
...
@@ -512,7 +512,7 @@ int Fra_SetActivityFactors_rec( Fra_Man_t * p, Aig_Obj_t * pObj, int LevelMin, i
// set the factor of this variable
// set the factor of this variable
// (LevelMax-LevelMin) / (pObj->Level-LevelMin) = p->pPars->dActConeBumpMax / ThisBump
// (LevelMax-LevelMin) / (pObj->Level-LevelMin) = p->pPars->dActConeBumpMax / ThisBump
if
(
p
->
pSat
->
factors
==
NULL
)
if
(
p
->
pSat
->
factors
==
NULL
)
p
->
pSat
->
factors
=
ABC_CALLOC
(
double
,
p
->
pSat
->
size
);
p
->
pSat
->
factors
=
ABC_CALLOC
(
double
,
p
->
pSat
->
cap
);
p
->
pSat
->
factors
[
Fra_ObjSatNum
(
pObj
)]
=
p
->
pPars
->
dActConeBumpMax
*
(
pObj
->
Level
-
LevelMin
)
/
(
LevelMax
-
LevelMin
);
p
->
pSat
->
factors
[
Fra_ObjSatNum
(
pObj
)]
=
p
->
pPars
->
dActConeBumpMax
*
(
pObj
->
Level
-
LevelMin
)
/
(
LevelMax
-
LevelMin
);
veci_push
(
&
p
->
pSat
->
act_vars
,
Fra_ObjSatNum
(
pObj
));
veci_push
(
&
p
->
pSat
->
act_vars
,
Fra_ObjSatNum
(
pObj
));
// explore the fanins
// explore the fanins
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment