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
0b7734ca
Commit
0b7734ca
authored
Oct 25, 2015
by
Alan Mishchenko
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Added switch 'satclp -Z' to control the max size of the cone to work with (fix overlow).
parent
45bf6324
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
11 additions
and
7 deletions
+11
-7
src/base/abci/abcCollapse.c
+11
-7
No files found.
src/base/abci/abcCollapse.c
View file @
0b7734ca
...
@@ -420,7 +420,7 @@ Abc_Ntk_t * Abc_NtkFromSops( Abc_Ntk_t * pNtk, int nCubeLim, int nBTLimit, int n
...
@@ -420,7 +420,7 @@ Abc_Ntk_t * Abc_NtkFromSops( Abc_Ntk_t * pNtk, int nCubeLim, int nBTLimit, int n
Vec_Ptr_t
*
vDriverCopy
,
*
vCoNodes
,
*
vDfsNodes
;
Vec_Ptr_t
*
vDriverCopy
,
*
vCoNodes
,
*
vDfsNodes
;
Vec_Int_t
*
vNodeCoIds
,
*
vLevel
;
Vec_Int_t
*
vNodeCoIds
,
*
vLevel
;
Vec_Wec_t
*
vSupps
;
Vec_Wec_t
*
vSupps
;
int
i
,
Cost
;
int
i
;
// Abc_NtkForEachCi( pNtk, pNode, i )
// Abc_NtkForEachCi( pNtk, pNode, i )
// printf( "%d ", Abc_ObjFanoutNum(pNode) );
// printf( "%d ", Abc_ObjFanoutNum(pNode) );
...
@@ -433,17 +433,21 @@ Abc_Ntk_t * Abc_NtkFromSops( Abc_Ntk_t * pNtk, int nCubeLim, int nBTLimit, int n
...
@@ -433,17 +433,21 @@ Abc_Ntk_t * Abc_NtkFromSops( Abc_Ntk_t * pNtk, int nCubeLim, int nBTLimit, int n
// compute cost of the largest node
// compute cost of the largest node
if
(
nCubeLim
>
0
)
if
(
nCubeLim
>
0
)
{
{
pNode
=
(
Abc_Obj_t
*
)
Vec_PtrEntry
(
vCoNodes
,
0
);
word
Cost
;
pNode
=
(
Abc_Obj_t
*
)
Vec_PtrEntry
(
vCoNodes
,
0
);
vDfsNodes
=
Abc_NtkDfsNodes
(
pNtk
,
&
pNode
,
1
);
vDfsNodes
=
Abc_NtkDfsNodes
(
pNtk
,
&
pNode
,
1
);
vLevel
=
Vec_WecEntry
(
vSupps
,
Abc_ObjFaninId0
(
pNode
)
);
vLevel
=
Vec_WecEntry
(
vSupps
,
Abc_ObjFaninId0
(
pNode
)
);
Cost
=
Vec_PtrSize
(
vDfsNodes
)
*
Vec_IntSize
(
vLevel
)
*
nCubeLim
;
Cost
=
(
word
)
Vec_PtrSize
(
vDfsNodes
)
*
(
word
)
Vec_IntSize
(
vLevel
)
*
(
word
)
nCubeLim
;
Vec_PtrFree
(
vDfsNodes
);
if
(
Cost
>
(
word
)
nCostMax
)
if
(
Cost
>
nCostMax
)
{
{
printf
(
"Cost of the largest output cone exceeded the limit (%d * %d * %d > %d).
\n
"
,
Vec_PtrSize
(
vDfsNodes
),
Vec_IntSize
(
vLevel
),
nCubeLim
,
nCostMax
);
Vec_PtrFree
(
vDfsNodes
);
Vec_PtrFree
(
vCoNodes
);
Vec_PtrFree
(
vCoNodes
);
Vec_WecFree
(
vSupps
);
Vec_WecFree
(
vSupps
);
return
NULL
;
return
NULL
;
}
}
Vec_PtrFree
(
vDfsNodes
);
}
}
// collect CO IDs in this order
// collect CO IDs in this order
vNodeCoIds
=
Vec_IntAlloc
(
Abc_NtkCoNum
(
pNtk
)
);
vNodeCoIds
=
Vec_IntAlloc
(
Abc_NtkCoNum
(
pNtk
)
);
...
@@ -486,7 +490,7 @@ Abc_Ntk_t * Abc_NtkFromSops( Abc_Ntk_t * pNtk, int nCubeLim, int nBTLimit, int n
...
@@ -486,7 +490,7 @@ Abc_Ntk_t * Abc_NtkFromSops( Abc_Ntk_t * pNtk, int nCubeLim, int nBTLimit, int n
Abc_ObjAddFanin
(
pNode
->
pCopy
,
pNodeNew
);
Abc_ObjAddFanin
(
pNode
->
pCopy
,
pNodeNew
);
continue
;
continue
;
}
}
pNodeNew
=
Abc_NtkFromSopsOne
(
pNtkNew
,
pNtk
,
Vec_IntEntry
(
vNodeCoIds
,
i
),
Vec_WecEntry
(
vSupps
,
Abc_ObjFanin0
(
pNode
)
->
Id
),
nCubeLim
,
nBTLimit
,
fCanon
,
fReverse
,
fVerbose
);
pNodeNew
=
Abc_NtkFromSopsOne
(
pNtkNew
,
pNtk
,
Vec_IntEntry
(
vNodeCoIds
,
i
),
Vec_WecEntry
(
vSupps
,
Abc_ObjFanin0
(
pNode
)
->
Id
),
nCubeLim
,
nBTLimit
,
fCanon
,
fReverse
,
i
?
0
:
fVerbose
);
if
(
pNodeNew
==
NULL
)
if
(
pNodeNew
==
NULL
)
{
{
Abc_NtkDelete
(
pNtkNew
);
Abc_NtkDelete
(
pNtkNew
);
...
...
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