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
2d38fc16
Commit
2d38fc16
authored
Jun 07, 2014
by
Alan Mishchenko
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Adding print-out to &splitprove to see impact of cof variable on AIG size.
parent
8a341c20
Show whitespace changes
Inline
Side-by-side
Showing
4 changed files
with
49 additions
and
18 deletions
+49
-18
src/base/abc/abc.h
+1
-1
src/base/abci/abc.c
+10
-11
src/base/abci/abcPrint.c
+13
-1
src/proof/cec/cecSplit.c
+25
-5
No files found.
src/base/abc/abc.h
View file @
2d38fc16
...
...
@@ -795,7 +795,7 @@ extern ABC_DLL float Abc_NtkMfsTotalSwitching( Abc_Ntk_t * pNtk );
extern
ABC_DLL
void
Abc_NtkPrintStats
(
Abc_Ntk_t
*
pNtk
,
int
fFactored
,
int
fSaveBest
,
int
fDumpResult
,
int
fUseLutLib
,
int
fPrintMuxes
,
int
fPower
,
int
fGlitch
,
int
fSkipBuf
);
extern
ABC_DLL
void
Abc_NtkPrintIo
(
FILE
*
pFile
,
Abc_Ntk_t
*
pNtk
,
int
fPrintFlops
);
extern
ABC_DLL
void
Abc_NtkPrintLatch
(
FILE
*
pFile
,
Abc_Ntk_t
*
pNtk
);
extern
ABC_DLL
void
Abc_NtkPrintFanio
(
FILE
*
pFile
,
Abc_Ntk_t
*
pNtk
);
extern
ABC_DLL
void
Abc_NtkPrintFanio
(
FILE
*
pFile
,
Abc_Ntk_t
*
pNtk
,
int
fUsePis
);
extern
ABC_DLL
void
Abc_NtkPrintFanioNew
(
FILE
*
pFile
,
Abc_Ntk_t
*
pNtk
,
int
fMffc
);
extern
ABC_DLL
void
Abc_NodePrintFanio
(
FILE
*
pFile
,
Abc_Obj_t
*
pNode
);
extern
ABC_DLL
void
Abc_NtkPrintFactor
(
FILE
*
pFile
,
Abc_Ntk_t
*
pNtk
,
int
fUseRealNames
);
...
...
src/base/abci/abc.c
View file @
2d38fc16
...
...
@@ -1407,17 +1407,17 @@ int Abc_CommandPrintFanio( Abc_Frame_t * pAbc, int argc, char ** argv )
{
Abc_Ntk_t
*
pNtk
=
Abc_FrameReadNtk
(
pAbc
);
int
c
;
int
fMffc
;
int
fVerbose
;
// set defaults
fMffc
=
0
;
fVerbose
=
0
;
int
fUsePis
=
0
;
int
fMffc
=
0
;
int
fVerbose
=
0
;
Extra_UtilGetoptReset
();
while
(
(
c
=
Extra_UtilGetopt
(
argc
,
argv
,
"mvh"
)
)
!=
EOF
)
while
(
(
c
=
Extra_UtilGetopt
(
argc
,
argv
,
"
i
mvh"
)
)
!=
EOF
)
{
switch
(
c
)
{
case
'i'
:
fUsePis
^=
1
;
break
;
case
'm'
:
fMffc
^=
1
;
break
;
...
...
@@ -1430,23 +1430,22 @@ int Abc_CommandPrintFanio( Abc_Frame_t * pAbc, int argc, char ** argv )
goto
usage
;
}
}
if
(
pNtk
==
NULL
)
{
Abc_Print
(
-
1
,
"Empty network.
\n
"
);
return
1
;
}
// print the nodes
if
(
fVerbose
)
Abc_NtkPrintFanio
(
stdout
,
pNtk
);
Abc_NtkPrintFanio
(
stdout
,
pNtk
,
fUsePis
);
else
Abc_NtkPrintFanioNew
(
stdout
,
pNtk
,
fMffc
);
return
0
;
usage:
Abc_Print
(
-
2
,
"usage: print_fanio [-mvh]
\n
"
);
Abc_Print
(
-
2
,
"usage: print_fanio [-
i
mvh]
\n
"
);
Abc_Print
(
-
2
,
"
\t
prints the statistics about fanins/fanouts of all nodes
\n
"
);
Abc_Print
(
-
2
,
"
\t
-i : toggles considering fanouts of primary inputs only [default = %s]
\n
"
,
fUsePis
?
"yes"
:
"no"
);
Abc_Print
(
-
2
,
"
\t
-m : toggles printing MFFC sizes instead of fanouts [default = %s]
\n
"
,
fMffc
?
"yes"
:
"no"
);
Abc_Print
(
-
2
,
"
\t
-v : toggles verbose way of printing the stats [default = %s]
\n
"
,
fVerbose
?
"yes"
:
"no"
);
Abc_Print
(
-
2
,
"
\t
-h : print the command usage
\n
"
);
src/base/abci/abcPrint.c
View file @
2d38fc16
...
...
@@ -524,7 +524,7 @@ void Abc_NtkPrintLatch( FILE * pFile, Abc_Ntk_t * pNtk )
SeeAlso []
***********************************************************************/
void
Abc_NtkPrintFanio
(
FILE
*
pFile
,
Abc_Ntk_t
*
pNtk
)
void
Abc_NtkPrintFanio
(
FILE
*
pFile
,
Abc_Ntk_t
*
pNtk
,
int
fUsePis
)
{
Abc_Obj_t
*
pNode
;
int
i
,
k
,
nFanins
,
nFanouts
;
...
...
@@ -558,6 +558,18 @@ void Abc_NtkPrintFanio( FILE * pFile, Abc_Ntk_t * pNtk )
vFanins
->
pArray
[
nFanins
]
++
;
vFanouts
->
pArray
[
nFanouts
]
++
;
}
if
(
fUsePis
)
{
Vec_IntFill
(
vFanouts
,
Vec_IntSize
(
vFanouts
),
0
);
Abc_NtkForEachCi
(
pNtk
,
pNode
,
i
)
{
if
(
Abc_NtkIsNetlist
(
pNtk
)
)
nFanouts
=
Abc_ObjFanoutNum
(
Abc_ObjFanout0
(
pNode
)
);
else
nFanouts
=
Abc_ObjFanoutNum
(
pNode
);
vFanouts
->
pArray
[
nFanouts
]
++
;
}
}
fprintf
(
pFile
,
"The distribution of fanins and fanouts in the network:
\n
"
);
fprintf
(
pFile
,
" Number Nodes with fanin Nodes with fanout
\n
"
);
for
(
k
=
0
;
k
<
vFanins
->
nSize
;
k
++
)
...
...
src/proof/cec/cecSplit.c
View file @
2d38fc16
...
...
@@ -203,7 +203,7 @@ Gia_Man_t * Gia_PermuteSpecial( Gia_Man_t * p )
SeeAlso []
***********************************************************************/
int
Gia_SplitCofVar2
(
Gia_Man_t
*
p
)
int
Gia_SplitCofVar2
(
Gia_Man_t
*
p
,
int
*
pnFanouts
,
int
*
pnCost
)
{
Gia_Obj_t
*
pObj
;
int
i
,
iBest
=
-
1
,
CostBest
=
-
1
;
...
...
@@ -213,15 +213,17 @@ int Gia_SplitCofVar2( Gia_Man_t * p )
if
(
CostBest
<
Gia_ObjRefNum
(
p
,
pObj
)
)
iBest
=
i
,
CostBest
=
Gia_ObjRefNum
(
p
,
pObj
);
assert
(
iBest
>=
0
);
*
pnFanouts
=
Gia_ObjRefNum
(
p
,
Gia_ManPi
(
p
,
iBest
));
*
pnCost
=
-
1
;
return
iBest
;
}
int
Gia_SplitCofVar
(
Gia_Man_t
*
p
,
int
LookAhead
)
int
Gia_SplitCofVar
(
Gia_Man_t
*
p
,
int
LookAhead
,
int
*
pnFanouts
,
int
*
pnCost
)
{
Gia_Man_t
*
pPart
;
int
Cost0
,
Cost1
,
CostBest
=
ABC_INFINITY
;
int
*
pOrder
,
i
,
iBest
=
-
1
;
if
(
LookAhead
==
1
)
return
Gia_SplitCofVar2
(
p
);
return
Gia_SplitCofVar2
(
p
,
pnFanouts
,
pnCost
);
pOrder
=
Gia_PermuteSpecialOrder
(
p
);
LookAhead
=
Abc_MinInt
(
LookAhead
,
Gia_ManPiNum
(
p
)
);
for
(
i
=
0
;
i
<
LookAhead
;
i
++
)
...
...
@@ -251,6 +253,8 @@ int Gia_SplitCofVar( Gia_Man_t * p, int LookAhead )
}
ABC_FREE
(
pOrder
);
assert
(
iBest
>=
0
);
*
pnFanouts
=
Gia_ObjRefNum
(
p
,
Gia_ManPi
(
p
,
iBest
));
*
pnCost
=
CostBest
;
return
iBest
;
}
...
...
@@ -428,11 +432,19 @@ int Cec_GiaSplitTest2( Gia_Man_t * p, int nProcs, int nTimeOut, int nIterMax, in
Gia_Man_t
*
pLast
=
(
Gia_Man_t
*
)
Vec_PtrPop
(
vStack
);
// determine cofactoring variable
int
Depth
=
1
+
(
pLast
->
vCofVars
?
Vec_IntSize
(
pLast
->
vCofVars
)
:
0
);
int
iVar
=
Gia_SplitCofVar
(
pLast
,
LookAhead
);
int
nFanouts
,
Cost
,
iVar
=
Gia_SplitCofVar
(
pLast
,
LookAhead
,
&
nFanouts
,
&
Cost
);
// cofactor
Gia_Man_t
*
pPart
=
Gia_ManDupCofactor
(
pLast
,
iVar
,
0
);
if
(
pLast
->
vCofVars
==
NULL
)
pLast
->
vCofVars
=
Vec_IntAlloc
(
100
);
// print results
if
(
fVerbose
)
{
// Cec_GiaSplitPrintRefs( pLast );
printf
(
"Var = %5d. Fanouts = %5d. Cost = %8d. AndBefore = %6d. AndAfter = %6d.
\n
"
,
iVar
,
nFanouts
,
Cost
,
Gia_ManAndNum
(
pLast
),
Gia_ManAndNum
(
pPart
)
);
// Cec_GiaSplitPrintRefs( pPart );
}
// create variable
pPart
->
vCofVars
=
Vec_IntAlloc
(
Vec_IntSize
(
pLast
->
vCofVars
)
+
1
);
Vec_IntAppend
(
pPart
->
vCofVars
,
pLast
->
vCofVars
);
...
...
@@ -630,13 +642,21 @@ int Cec_GiaSplitTest( Gia_Man_t * p, int nProcs, int nTimeOut, int nIterMax, int
if
(
ThData
[
i
].
Result
==
-
1
)
// UNDEC
{
// determine cofactoring variable
int
iVar
=
Gia_SplitCofVar
(
pLast
,
LookAhead
);
int
nFanouts
,
Cost
,
iVar
=
Gia_SplitCofVar
(
pLast
,
LookAhead
,
&
nFanouts
,
&
Cost
);
// cofactor
Gia_Man_t
*
pPart
=
Gia_ManDupCofactor
(
pLast
,
iVar
,
0
);
pPart
->
vCofVars
=
Vec_IntAlloc
(
Vec_IntSize
(
pLast
->
vCofVars
)
+
1
);
Vec_IntAppend
(
pPart
->
vCofVars
,
pLast
->
vCofVars
);
Vec_IntPush
(
pPart
->
vCofVars
,
Abc_Var2Lit
(
iVar
,
1
)
);
Vec_PtrPush
(
vStack
,
pPart
);
// print results
if
(
fVerbose
)
{
// Cec_GiaSplitPrintRefs( pLast );
printf
(
"Var = %5d. Fanouts = %5d. Cost = %8d. AndBefore = %6d. AndAfter = %6d.
\n
"
,
iVar
,
nFanouts
,
Cost
,
Gia_ManAndNum
(
pLast
),
Gia_ManAndNum
(
pPart
)
);
// Cec_GiaSplitPrintRefs( pPart );
}
// cofactor
pPart
=
Gia_ManDupCofactor
(
pLast
,
iVar
,
1
);
pPart
->
vCofVars
=
Vec_IntAlloc
(
Vec_IntSize
(
pLast
->
vCofVars
)
+
1
);
...
...
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