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
12d21480
Commit
12d21480
authored
Sep 18, 2017
by
Alan Mishchenko
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Changes to Glucose to enable resetting the solver.
parent
3a1032c1
Hide whitespace changes
Inline
Side-by-side
Showing
5 changed files
with
88 additions
and
0 deletions
+88
-0
src/sat/glucose/Alloc.h
+1
-0
src/sat/glucose/Glucose.cpp
+64
-0
src/sat/glucose/SimpSolver.cpp
+21
-0
src/sat/glucose/SimpSolver.h
+1
-0
src/sat/glucose/Solver.h
+1
-0
No files found.
src/sat/glucose/Alloc.h
View file @
12d21480
...
@@ -58,6 +58,7 @@ class RegionAllocator
...
@@ -58,6 +58,7 @@ class RegionAllocator
Ref
alloc
(
int
size
);
Ref
alloc
(
int
size
);
void
free_
(
int
size
)
{
wasted_
+=
size
;
}
void
free_
(
int
size
)
{
wasted_
+=
size
;
}
void
clear
()
{
sz
=
0
;
wasted_
=
0
;
}
// Deref, Load Effective Address (LEA), Inverse of LEA (AEL):
// Deref, Load Effective Address (LEA), Inverse of LEA (AEL):
T
&
operator
[](
Ref
r
)
{
assert
(
r
>=
0
&&
r
<
sz
);
return
memory
[
r
];
}
T
&
operator
[](
Ref
r
)
{
assert
(
r
>=
0
&&
r
<
sz
);
return
memory
[
r
];
}
...
...
src/sat/glucose/Glucose.cpp
View file @
12d21480
...
@@ -1428,3 +1428,66 @@ void Solver::garbageCollect()
...
@@ -1428,3 +1428,66 @@ void Solver::garbageCollect()
ca
.
size
()
*
ClauseAllocator
::
Unit_Size
,
to
.
size
()
*
ClauseAllocator
::
Unit_Size
);
ca
.
size
()
*
ClauseAllocator
::
Unit_Size
,
to
.
size
()
*
ClauseAllocator
::
Unit_Size
);
to
.
moveTo
(
ca
);
to
.
moveTo
(
ca
);
}
}
void
Solver
::
reset
()
{
// Reset everything
ok
=
true
;
K
=
(
double
)
opt_K
;
R
=
(
double
)
opt_R
;
firstReduceDB
=
opt_first_reduce_db
;
var_decay
=
(
double
)
opt_var_decay
;
//max_var_decay = opt_max_var_decay;
solves
=
starts
=
decisions
=
propagations
=
conflicts
=
conflictsRestarts
=
0
;
curRestart
=
1
;
cla_inc
=
var_inc
=
1
;
watches
.
clear
(
false
);
// We don't free the memory, new calls should be of the same size order.
watchesBin
.
clear
(
false
);
//unaryWatches.clear(false);
qhead
=
0
;
simpDB_assigns
=
-
1
;
simpDB_props
=
0
;
order_heap
.
clear
(
false
);
progress_estimate
=
0
;
//lastLearntClause = CRef_Undef;
conflict_budget
=
-
1
;
propagation_budget
=
-
1
;
nbVarsInitialFormula
=
INT32_MAX
;
totalTime4Sat
=
0.
;
totalTime4Unsat
=
0.
;
nbSatCalls
=
nbUnsatCalls
=
0
;
MYFLAG
=
0
;
lbdQueue
.
clear
(
false
);
lbdQueue
.
initSize
(
sizeLBDQueue
);
trailQueue
.
clear
(
false
);
trailQueue
.
initSize
(
sizeTrailQueue
);
sumLBD
=
0
;
nbclausesbeforereduce
=
firstReduceDB
;
//stats.clear();
//stats.growTo(coreStatsSize, 0);
clauses
.
clear
(
false
);
learnts
.
clear
(
false
);
//permanentLearnts.clear(false);
//unaryWatchedClauses.clear(false);
model
.
clear
(
false
);
conflict
.
clear
(
false
);
activity
.
clear
(
false
);
assigns
.
clear
(
false
);
polarity
.
clear
(
false
);
//forceUNSAT.clear(false);
decision
.
clear
(
false
);
trail
.
clear
(
false
);
nbpos
.
clear
(
false
);
trail_lim
.
clear
(
false
);
vardata
.
clear
(
false
);
assumptions
.
clear
(
false
);
permDiff
.
clear
(
false
);
lastDecisionLevel
.
clear
(
false
);
ca
.
clear
();
seen
.
clear
(
false
);
analyze_stack
.
clear
(
false
);
analyze_toclear
.
clear
(
false
);
add_tmp
.
clear
(
false
);
assumptionPositions
.
clear
(
false
);
initialPositions
.
clear
(
false
);
}
\ No newline at end of file
src/sat/glucose/SimpSolver.cpp
View file @
12d21480
...
@@ -751,3 +751,24 @@ void SimpSolver::garbageCollect()
...
@@ -751,3 +751,24 @@ void SimpSolver::garbageCollect()
ca
.
size
()
*
ClauseAllocator
::
Unit_Size
,
to
.
size
()
*
ClauseAllocator
::
Unit_Size
);
ca
.
size
()
*
ClauseAllocator
::
Unit_Size
,
to
.
size
()
*
ClauseAllocator
::
Unit_Size
);
to
.
moveTo
(
ca
);
to
.
moveTo
(
ca
);
}
}
void
SimpSolver
::
reset
()
{
Solver
::
reset
();
grow
=
opt_grow
;
asymm_lits
=
eliminated_vars
=
bwdsub_assigns
=
n_touched
=
0
;
elimclauses
.
clear
(
false
);
touched
.
clear
(
false
);
occurs
.
clear
(
false
);
n_occ
.
clear
(
false
);
elim_heap
.
clear
(
false
);
subsumption_queue
.
clear
(
false
);
frozen
.
clear
(
false
);
eliminated
.
clear
(
false
);
vec
<
Lit
>
dummy
(
1
,
lit_Undef
);
ca
.
extra_clause_field
=
true
;
// NOTE: must happen before allocating the dummy clause below.
bwdsub_tmpunit
=
ca
.
alloc
(
dummy
);
remove_satisfied
=
false
;
}
src/sat/glucose/SimpSolver.h
View file @
12d21480
...
@@ -66,6 +66,7 @@ class SimpSolver : public Solver {
...
@@ -66,6 +66,7 @@ class SimpSolver : public Solver {
// Memory managment:
// Memory managment:
//
//
virtual
void
reset
();
virtual
void
garbageCollect
();
virtual
void
garbageCollect
();
...
...
src/sat/glucose/Solver.h
View file @
12d21480
...
@@ -131,6 +131,7 @@ public:
...
@@ -131,6 +131,7 @@ public:
// Memory managment:
// Memory managment:
//
//
virtual
void
reset
();
virtual
void
garbageCollect
();
// virtuality causes segfault for some reason
virtual
void
garbageCollect
();
// virtuality causes segfault for some reason
void
checkGarbage
(
double
gf
);
void
checkGarbage
(
double
gf
);
void
checkGarbage
();
void
checkGarbage
();
...
...
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