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
2bad2663
Commit
2bad2663
authored
Feb 15, 2014
by
Alan Mishchenko
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Enabling default no output in &icheck.
parent
bd45eca4
Show whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
8 additions
and
0 deletions
+8
-0
src/sat/bmc/bmcICheck.c
+8
-0
No files found.
src/sat/bmc/bmcICheck.c
View file @
2bad2663
...
@@ -206,6 +206,7 @@ void Bmc_PerformICheck( Gia_Man_t * p, int nFramesMax, int nTimeOut, int fEmpty,
...
@@ -206,6 +206,7 @@ void Bmc_PerformICheck( Gia_Man_t * p, int nFramesMax, int nTimeOut, int fEmpty,
assert
(
nFramesMax
>
0
);
assert
(
nFramesMax
>
0
);
assert
(
Gia_ManRegNum
(
p
)
>
0
);
assert
(
Gia_ManRegNum
(
p
)
>
0
);
if
(
fVerbose
)
printf
(
"Solving M-inductiveness for design %s with %d AND nodes and %d flip-flops:
\n
"
,
printf
(
"Solving M-inductiveness for design %s with %d AND nodes and %d flip-flops:
\n
"
,
Gia_ManName
(
p
),
Gia_ManAndNum
(
p
),
Gia_ManRegNum
(
p
)
);
Gia_ManName
(
p
),
Gia_ManAndNum
(
p
),
Gia_ManRegNum
(
p
)
);
...
@@ -272,10 +273,12 @@ void Bmc_PerformICheck( Gia_Man_t * p, int nFramesMax, int nTimeOut, int fEmpty,
...
@@ -272,10 +273,12 @@ void Bmc_PerformICheck( Gia_Man_t * p, int nFramesMax, int nTimeOut, int fEmpty,
fChanges
=
1
;
fChanges
=
1
;
}
}
// report the results
// report the results
if
(
fVerbose
)
printf
(
"M =%4d : AIG =%8d. SAT vars =%8d. SAT conf =%8d. S =%6d. (%6.2f %%) "
,
printf
(
"M =%4d : AIG =%8d. SAT vars =%8d. SAT conf =%8d. S =%6d. (%6.2f %%) "
,
nFramesMax
,
(
nFramesMax
+
1
)
*
Gia_ManAndNum
(
pMiter
),
nFramesMax
,
(
nFramesMax
+
1
)
*
Gia_ManAndNum
(
pMiter
),
Gia_ManRegNum
(
p
)
+
Gia_ManCoNum
(
p
)
+
sat_solver_nvars
(
pSat
),
Gia_ManRegNum
(
p
)
+
Gia_ManCoNum
(
p
)
+
sat_solver_nvars
(
pSat
),
sat_solver_nconflicts
(
pSat
),
nLitsUsed
,
100
.
0
*
nLitsUsed
/
Gia_ManRegNum
(
p
)
);
sat_solver_nconflicts
(
pSat
),
nLitsUsed
,
100
.
0
*
nLitsUsed
/
Gia_ManRegNum
(
p
)
);
if
(
fVerbose
)
Abc_PrintTime
(
1
,
"Time"
,
Abc_Clock
()
-
clkStart
);
Abc_PrintTime
(
1
,
"Time"
,
Abc_Clock
()
-
clkStart
);
// count the number of negative literals
// count the number of negative literals
sat_solver_delete
(
pSat
);
sat_solver_delete
(
pSat
);
...
@@ -375,19 +378,23 @@ void Bmc_PerformISearchOne( Gia_Man_t * p, int nFramesMax, int nTimeOut, int fRe
...
@@ -375,19 +378,23 @@ void Bmc_PerformISearchOne( Gia_Man_t * p, int nFramesMax, int nTimeOut, int fRe
else
assert
(
0
);
else
assert
(
0
);
// report the results
// report the results
//printf( "Round %d: ", o );
//printf( "Round %d: ", o );
if
(
fVerbose
)
printf
(
"I = %4d : AIG =%8d. SAT vars =%8d. SAT conf =%8d. S =%6d. (%6.2f %%) "
,
printf
(
"I = %4d : AIG =%8d. SAT vars =%8d. SAT conf =%8d. S =%6d. (%6.2f %%) "
,
i
,
(
nFramesMax
+
1
)
*
Gia_ManAndNum
(
pMiter
),
i
,
(
nFramesMax
+
1
)
*
Gia_ManAndNum
(
pMiter
),
Gia_ManRegNum
(
p
)
+
Gia_ManCoNum
(
p
)
+
sat_solver_nvars
(
pSat
),
Gia_ManRegNum
(
p
)
+
Gia_ManCoNum
(
p
)
+
sat_solver_nvars
(
pSat
),
sat_solver_nconflicts
(
pSat
),
nLitsUsed
,
100
.
0
*
nLitsUsed
/
Gia_ManRegNum
(
p
)
);
sat_solver_nconflicts
(
pSat
),
nLitsUsed
,
100
.
0
*
nLitsUsed
/
Gia_ManRegNum
(
p
)
);
if
(
fVerbose
)
ABC_PRTr
(
"Time"
,
Abc_Clock
()
-
clkStart
);
ABC_PRTr
(
"Time"
,
Abc_Clock
()
-
clkStart
);
fflush
(
stdout
);
fflush
(
stdout
);
}
}
// report the results
// report the results
//printf( "Round %d: ", o );
//printf( "Round %d: ", o );
if
(
fVerbose
)
printf
(
"M = %4d : AIG =%8d. SAT vars =%8d. SAT conf =%8d. S =%6d. (%6.2f %%) "
,
printf
(
"M = %4d : AIG =%8d. SAT vars =%8d. SAT conf =%8d. S =%6d. (%6.2f %%) "
,
nFramesMax
,
(
nFramesMax
+
1
)
*
Gia_ManAndNum
(
pMiter
),
nFramesMax
,
(
nFramesMax
+
1
)
*
Gia_ManAndNum
(
pMiter
),
Gia_ManRegNum
(
p
)
+
Gia_ManCoNum
(
p
)
+
sat_solver_nvars
(
pSat
),
Gia_ManRegNum
(
p
)
+
Gia_ManCoNum
(
p
)
+
sat_solver_nvars
(
pSat
),
sat_solver_nconflicts
(
pSat
),
nLitsUsed
,
100
.
0
*
nLitsUsed
/
Gia_ManRegNum
(
p
)
);
sat_solver_nconflicts
(
pSat
),
nLitsUsed
,
100
.
0
*
nLitsUsed
/
Gia_ManRegNum
(
p
)
);
if
(
fVerbose
)
Abc_PrintTime
(
1
,
"Time"
,
Abc_Clock
()
-
clkStart
);
Abc_PrintTime
(
1
,
"Time"
,
Abc_Clock
()
-
clkStart
);
fflush
(
stdout
);
fflush
(
stdout
);
...
@@ -401,6 +408,7 @@ Vec_Int_t * Bmc_PerformISearch( Gia_Man_t * p, int nFramesMax, int nTimeOut, int
...
@@ -401,6 +408,7 @@ Vec_Int_t * Bmc_PerformISearch( Gia_Man_t * p, int nFramesMax, int nTimeOut, int
{
{
Vec_Int_t
*
vLits
,
*
vFlops
;
Vec_Int_t
*
vLits
,
*
vFlops
;
int
i
,
f
;
int
i
,
f
;
if
(
fVerbose
)
printf
(
"Solving M-inductiveness for design %s with %d AND nodes and %d flip-flops:
\n
"
,
printf
(
"Solving M-inductiveness for design %s with %d AND nodes and %d flip-flops:
\n
"
,
Gia_ManName
(
p
),
Gia_ManAndNum
(
p
),
Gia_ManRegNum
(
p
)
);
Gia_ManName
(
p
),
Gia_ManAndNum
(
p
),
Gia_ManRegNum
(
p
)
);
fflush
(
stdout
);
fflush
(
stdout
);
...
...
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