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
05c8b785
Commit
05c8b785
authored
Jul 11, 2012
by
Alan Mishchenko
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Changes to clause mapping.
parent
b9ee5d85
Hide whitespace changes
Inline
Side-by-side
Showing
3 changed files
with
6 additions
and
6 deletions
+6
-6
src/aig/gia/giaAbsGla.c
+3
-3
src/aig/gia/giaAbsVta.c
+2
-2
src/sat/bsat/satSolver2.h
+1
-1
No files found.
src/aig/gia/giaAbsGla.c
View file @
05c8b785
...
...
@@ -1096,7 +1096,7 @@ Gla_Man_t * Gla_ManStart( Gia_Man_t * pGia0, Gia_ParVta_t * pPars )
Vec_IntPush
(
p
->
vAbs
,
Gla_ObjId
(
p
,
pGla
)
);
}
// other
p
->
vCla2Obj
=
Vec_IntAlloc
(
1000
);
Vec_IntPush
(
p
->
vCla2Obj
,
-
1
);
p
->
vCla2Obj
=
Vec_IntAlloc
(
1000
);
//
Vec_IntPush( p->vCla2Obj, -1 );
p
->
pSat
=
sat_solver2_new
();
// p->pSat->fVerbose = p->pPars->fVerbose;
// sat_solver2_set_learntmax( p->pSat, pPars->nLearnedMax );
...
...
@@ -1195,7 +1195,7 @@ Gla_Man_t * Gla_ManStart2( Gia_Man_t * pGia, Gia_ParVta_t * pPars )
Vec_IntPush
(
p
->
vAbs
,
Gla_ObjId
(
p
,
pGla
)
);
}
// other
p
->
vCla2Obj
=
Vec_IntAlloc
(
1000
);
Vec_IntPush
(
p
->
vCla2Obj
,
-
1
);
p
->
vCla2Obj
=
Vec_IntAlloc
(
1000
);
//
Vec_IntPush( p->vCla2Obj, -1 );
p
->
pSat
=
sat_solver2_new
();
p
->
nSatVars
=
1
;
return
p
;
...
...
@@ -1914,7 +1914,7 @@ int Gia_GlaPerform( Gia_Man_t * pAig, Gia_ParVta_t * pPars, int fStartVta )
sat_solver2_rollback
(
p
->
pSat
);
// update storage
Gla_ManRollBack
(
p
);
Vec_IntShrink
(
p
->
vCla2Obj
,
(
int
)
p
->
pSat
->
stats
.
clauses
+
1
);
Vec_IntShrink
(
p
->
vCla2Obj
,
(
int
)
p
->
pSat
->
stats
.
clauses
);
p
->
nSatVars
=
nVarsOld
;
// load this timeframe
Gia_GlaAddToAbs
(
p
,
vCore
,
0
);
...
...
src/aig/gia/giaAbsVta.c
View file @
05c8b785
...
...
@@ -1034,7 +1034,7 @@ Vta_Man_t * Vga_ManStart( Gia_Man_t * pGia, Gia_ParVta_t * pPars )
p
->
nSeenGla
=
1
;
p
->
nSeenAll
=
1
;
// other data
p
->
vCla2Var
=
Vec_IntAlloc
(
1000
);
Vec_IntPush
(
p
->
vCla2Var
,
-
1
);
p
->
vCla2Var
=
Vec_IntAlloc
(
1000
);
//
Vec_IntPush( p->vCla2Var, -1 );
p
->
vCores
=
Vec_PtrAlloc
(
100
);
p
->
pSat
=
sat_solver2_new
();
// p->pSat->fVerbose = p->pPars->fVerbose;
...
...
@@ -1658,7 +1658,7 @@ int Gia_VtaPerformInt( Gia_Man_t * pAig, Gia_ParVta_t * pPars )
sat_solver2_rollback
(
p
->
pSat
);
// update storage
Vga_ManRollBack
(
p
,
nObjOld
);
Vec_IntShrink
(
p
->
vCla2Var
,
(
int
)
p
->
pSat
->
stats
.
clauses
+
1
);
Vec_IntShrink
(
p
->
vCla2Var
,
(
int
)
p
->
pSat
->
stats
.
clauses
);
// load this timeframe
Vga_ManLoadSlice
(
p
,
vCore
,
0
);
Vec_IntFree
(
vCore
);
...
...
src/sat/bsat/satSolver2.h
View file @
05c8b785
...
...
@@ -160,7 +160,7 @@ struct sat_solver2_t
};
static
inline
clause
*
clause2_read
(
sat_solver2
*
s
,
cla
h
)
{
return
Sat_MemClauseHand
(
&
s
->
Mem
,
h
);
}
static
inline
int
clause2_proofid
(
sat_solver2
*
s
,
clause
*
c
,
int
partA
)
{
return
c
->
lrn
?
(
veci_begin
(
&
s
->
claProofs
)[
clause_id
(
c
)]
<<
2
)
|
(
partA
<<
1
)
:
(
(
clause_id
(
c
)
+
1
)
<<
2
)
|
(
partA
<<
1
)
|
1
;
}
static
inline
int
clause2_proofid
(
sat_solver2
*
s
,
clause
*
c
,
int
partA
)
{
return
c
->
lrn
?
(
veci_begin
(
&
s
->
claProofs
)[
clause_id
(
c
)]
<<
2
)
|
(
partA
<<
1
)
:
(
clause_id
(
c
)
<<
2
)
|
(
partA
<<
1
)
|
1
;
}
// these two only work after creating a clause before the solver is called
static
inline
int
clause2_is_partA
(
sat_solver2
*
s
,
int
h
)
{
return
clause2_read
(
s
,
h
)
->
partA
;
}
...
...
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