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
50e324ce
Commit
50e324ce
authored
Oct 07, 2016
by
Alan Mishchenko
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Adding switch &mfs -b to preserve white boxes during optimization.
parent
659d2889
Hide whitespace changes
Inline
Side-by-side
Showing
5 changed files
with
19 additions
and
7 deletions
+19
-7
src/aig/gia/giaMfs.c
+3
-3
src/base/abci/abc.c
+6
-2
src/opt/sfm/sfm.h
+2
-1
src/opt/sfm/sfmCore.c
+1
-0
src/opt/sfm/sfmWin.c
+7
-1
No files found.
src/aig/gia/giaMfs.c
View file @
50e324ce
...
...
@@ -239,7 +239,7 @@ Sfm_Ntk_t * Gia_ManExtractMfs( Gia_Man_t * p )
SeeAlso []
***********************************************************************/
Gia_Man_t
*
Gia_ManInsertMfs
(
Gia_Man_t
*
p
,
Sfm_Ntk_t
*
pNtk
)
Gia_Man_t
*
Gia_ManInsertMfs
(
Gia_Man_t
*
p
,
Sfm_Ntk_t
*
pNtk
,
int
fAllBoxes
)
{
extern
int
Gia_ManFromIfLogicCreateLut
(
Gia_Man_t
*
pNew
,
word
*
pRes
,
Vec_Int_t
*
vLeaves
,
Vec_Int_t
*
vCover
,
Vec_Int_t
*
vMapping
,
Vec_Int_t
*
vMapping2
);
Gia_Man_t
*
pNew
;
Gia_Obj_t
*
pObj
;
...
...
@@ -294,7 +294,7 @@ Gia_Man_t * Gia_ManInsertMfs( Gia_Man_t * p, Sfm_Ntk_t * pNtk )
// collect nodes in the given order
vBoxesLeft
=
Vec_IntAlloc
(
nBoxes
);
vMfsTopo
=
Sfm_NtkDfs
(
pNtk
,
vGroups
,
vGroupMap
,
vBoxesLeft
);
vMfsTopo
=
Sfm_NtkDfs
(
pNtk
,
vGroups
,
vGroupMap
,
vBoxesLeft
,
fAllBoxes
);
assert
(
Vec_IntSize
(
vBoxesLeft
)
<=
nBoxes
);
assert
(
Vec_IntSize
(
vMfsTopo
)
>
0
);
...
...
@@ -458,7 +458,7 @@ Gia_Man_t * Gia_ManPerformMfs( Gia_Man_t * p, Sfm_Par_t * pPars )
}
else
{
pNew
=
Gia_ManInsertMfs
(
p
,
pNtk
);
pNew
=
Gia_ManInsertMfs
(
p
,
pNtk
,
pPars
->
fAllBoxes
);
if
(
pPars
->
fVerbose
)
Abc_Print
(
1
,
"The network has %d nodes changed by
\"
&mfs
\"
.
\n
"
,
nNodes
);
// check integrity
...
...
src/base/abci/abc.c
View file @
50e324ce
...
...
@@ -40612,7 +40612,7 @@ int Abc_CommandAbc9Mfs( Abc_Frame_t * pAbc, int argc, char ** argv )
pPars
->
nDepthMax
=
100
;
pPars
->
nWinSizeMax
=
2000
;
Extra_UtilGetoptReset
();
while
(
(
c
=
Extra_UtilGetopt
(
argc
,
argv
,
"WFDMLCNdaevwh"
)
)
!=
EOF
)
while
(
(
c
=
Extra_UtilGetopt
(
argc
,
argv
,
"WFDMLCNdae
b
vwh"
)
)
!=
EOF
)
{
switch
(
c
)
{
...
...
@@ -40702,6 +40702,9 @@ int Abc_CommandAbc9Mfs( Abc_Frame_t * pAbc, int argc, char ** argv )
case
'e'
:
pPars
->
fMoreEffort
^=
1
;
break
;
case
'b'
:
pPars
->
fAllBoxes
^=
1
;
break
;
case
'v'
:
pPars
->
fVerbose
^=
1
;
break
;
...
...
@@ -40734,7 +40737,7 @@ int Abc_CommandAbc9Mfs( Abc_Frame_t * pAbc, int argc, char ** argv )
return
0
;
usage:
Abc_Print
(
-
2
,
"usage: &mfs [-WFDMLCN <num>] [-daevwh]
\n
"
);
Abc_Print
(
-
2
,
"usage: &mfs [-WFDMLCN <num>] [-dae
b
vwh]
\n
"
);
Abc_Print
(
-
2
,
"
\t
performs don't-care-based optimization of logic networks
\n
"
);
Abc_Print
(
-
2
,
"
\t
-W <num> : the number of levels in the TFO cone (0 <= num) [default = %d]
\n
"
,
pPars
->
nTfoLevMax
);
Abc_Print
(
-
2
,
"
\t
-F <num> : the max number of fanouts to skip (1 <= num) [default = %d]
\n
"
,
pPars
->
nFanoutMax
);
...
...
@@ -40746,6 +40749,7 @@ usage:
Abc_Print
(
-
2
,
"
\t
-d : toggle performing redundancy removal [default = %s]
\n
"
,
pPars
->
fRrOnly
?
"yes"
:
"no"
);
Abc_Print
(
-
2
,
"
\t
-a : toggle minimizing area or area+edges [default = %s]
\n
"
,
pPars
->
fArea
?
"area"
:
"area+edges"
);
Abc_Print
(
-
2
,
"
\t
-e : toggle high-effort resubstitution [default = %s]
\n
"
,
pPars
->
fMoreEffort
?
"yes"
:
"no"
);
Abc_Print
(
-
2
,
"
\t
-b : toggle preserving all while boxes [default = %s]
\n
"
,
pPars
->
fAllBoxes
?
"yes"
:
"no"
);
Abc_Print
(
-
2
,
"
\t
-v : toggle printing optimization summary [default = %s]
\n
"
,
pPars
->
fVerbose
?
"yes"
:
"no"
);
Abc_Print
(
-
2
,
"
\t
-w : toggle printing detailed stats for each node [default = %s]
\n
"
,
pPars
->
fVeryVerbose
?
"yes"
:
"no"
);
Abc_Print
(
-
2
,
"
\t
-h : print the command usage
\n
"
);
src/opt/sfm/sfm.h
View file @
50e324ce
...
...
@@ -67,6 +67,7 @@ struct Sfm_Par_t_
int
fZeroCost
;
// enable zero-cost replacement
int
fUseSim
;
// enable simulation
int
fPrintDecs
;
// enable printing decompositions
int
fAllBoxes
;
// enable preserving all boxes
int
fLibVerbose
;
// enable library stats
int
fDelayVerbose
;
// enable delay stats
int
fVerbose
;
// enable basic stats
...
...
@@ -93,7 +94,7 @@ extern word * Sfm_NodeReadTruth( Sfm_Ntk_t * p, int i );
extern
int
Sfm_NodeReadFixed
(
Sfm_Ntk_t
*
p
,
int
i
);
extern
int
Sfm_NodeReadUsed
(
Sfm_Ntk_t
*
p
,
int
i
);
/*=== sfmWin.c ==========================================================*/
extern
Vec_Int_t
*
Sfm_NtkDfs
(
Sfm_Ntk_t
*
p
,
Vec_Wec_t
*
vGroups
,
Vec_Int_t
*
vGroupMap
,
Vec_Int_t
*
vBoxesLeft
);
extern
Vec_Int_t
*
Sfm_NtkDfs
(
Sfm_Ntk_t
*
p
,
Vec_Wec_t
*
vGroups
,
Vec_Int_t
*
vGroupMap
,
Vec_Int_t
*
vBoxesLeft
,
int
fAllBoxes
);
ABC_NAMESPACE_HEADER_END
...
...
src/opt/sfm/sfmCore.c
View file @
50e324ce
...
...
@@ -54,6 +54,7 @@ void Sfm_ParSetDefault( Sfm_Par_t * pPars )
pPars
->
fRrOnly
=
0
;
// perform redundancy removal
pPars
->
fArea
=
0
;
// performs optimization for area
pPars
->
fMoreEffort
=
0
;
// performs high-affort minimization
pPars
->
fAllBoxes
=
0
;
// enable preserving all boxes
pPars
->
fVerbose
=
0
;
// enable basic stats
pPars
->
fVeryVerbose
=
0
;
// enable detailed stats
}
...
...
src/opt/sfm/sfmWin.c
View file @
50e324ce
...
...
@@ -163,13 +163,19 @@ void Sfm_NtkDfs_rec( Sfm_Ntk_t * p, int iNode, Vec_Int_t * vNodes, Vec_Wec_t * v
Vec_IntPush
(
vNodes
,
iNode
);
}
}
Vec_Int_t
*
Sfm_NtkDfs
(
Sfm_Ntk_t
*
p
,
Vec_Wec_t
*
vGroups
,
Vec_Int_t
*
vGroupMap
,
Vec_Int_t
*
vBoxesLeft
)
Vec_Int_t
*
Sfm_NtkDfs
(
Sfm_Ntk_t
*
p
,
Vec_Wec_t
*
vGroups
,
Vec_Int_t
*
vGroupMap
,
Vec_Int_t
*
vBoxesLeft
,
int
fAllBoxes
)
{
Vec_Int_t
*
vNodes
;
int
i
;
Vec_IntClear
(
vBoxesLeft
);
vNodes
=
Vec_IntAlloc
(
p
->
nObjs
);
Sfm_NtkIncrementTravId
(
p
);
if
(
fAllBoxes
)
{
Vec_Int_t
*
vGroup
;
Vec_WecForEachLevel
(
vGroups
,
vGroup
,
i
)
Sfm_NtkDfs_rec
(
p
,
Vec_IntEntry
(
vGroup
,
0
),
vNodes
,
vGroups
,
vGroupMap
,
vBoxesLeft
);
}
Sfm_NtkForEachPo
(
p
,
i
)
Sfm_NtkDfs_rec
(
p
,
Sfm_ObjFanin
(
p
,
i
,
0
),
vNodes
,
vGroups
,
vGroupMap
,
vBoxesLeft
);
return
vNodes
;
...
...
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