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
93c785e8
Commit
93c785e8
authored
Jun 03, 2016
by
Alan Mishchenko
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Small changes for today's experiments.
parent
e33d6e8d
Hide whitespace changes
Inline
Side-by-side
Showing
6 changed files
with
43 additions
and
9 deletions
+43
-9
src/aig/gia/giaDup.c
+1
-1
src/aig/gia/giaHash.c
+5
-5
src/aig/gia/giaShow.c
+10
-1
src/base/abci/abc.c
+6
-0
src/base/wlc/wlcBlast.c
+19
-0
src/proof/acec/acecPolyn.c
+2
-2
No files found.
src/aig/gia/giaDup.c
View file @
93c785e8
...
...
@@ -2949,7 +2949,7 @@ Gia_Man_t * Gia_ManDupCones( Gia_Man_t * p, int * pPos, int nPos, int fTrimPis )
// start the new manager
// Gia_ManFillValue( p );
pNew
=
Gia_ManStart
(
Vec_PtrSize
(
vLeaves
)
+
Vec_PtrSize
(
vNodes
)
+
Vec_PtrSize
(
vRoots
)
+
1
);
pNew
=
Gia_ManStart
(
(
fTrimPis
?
Vec_PtrSize
(
vLeaves
)
:
Gia_ManCiNum
(
p
))
+
Vec_PtrSize
(
vNodes
)
+
Vec_PtrSize
(
vRoots
)
+
1
);
pNew
->
pName
=
Abc_UtilStrsav
(
p
->
pName
);
pNew
->
pSpec
=
Abc_UtilStrsav
(
p
->
pSpec
);
// map the constant node
...
...
src/aig/gia/giaHash.c
View file @
93c785e8
...
...
@@ -575,11 +575,6 @@ int Gia_ManHashMuxReal( Gia_Man_t * p, int iLitC, int iLit1, int iLit0 )
***********************************************************************/
int
Gia_ManHashAnd
(
Gia_Man_t
*
p
,
int
iLit0
,
int
iLit1
)
{
if
(
p
->
fGiaSimple
)
{
assert
(
p
->
nHTable
==
0
);
return
Gia_ManAppendAnd
(
p
,
iLit0
,
iLit1
);
}
if
(
iLit0
<
2
)
return
iLit0
?
iLit1
:
0
;
if
(
iLit1
<
2
)
...
...
@@ -588,6 +583,11 @@ int Gia_ManHashAnd( Gia_Man_t * p, int iLit0, int iLit1 )
return
iLit1
;
if
(
iLit0
==
Abc_LitNot
(
iLit1
)
)
return
0
;
if
(
p
->
fGiaSimple
)
{
assert
(
p
->
nHTable
==
0
);
return
Gia_ManAppendAnd
(
p
,
iLit0
,
iLit1
);
}
if
(
(
p
->
nObjs
&
0xFF
)
==
0
&&
2
*
p
->
nHTable
<
Gia_ManAndNum
(
p
)
)
Gia_ManHashResize
(
p
);
if
(
p
->
fAddStrash
)
...
...
src/aig/gia/giaShow.c
View file @
93c785e8
...
...
@@ -362,20 +362,29 @@ void Gia_WriteDotAig( Gia_Man_t * pMan, char * pFileName, Vec_Int_t * vBold, int
fprintf( pFile, " Node%d [label = \"%d(%d%s)\"", pNode->Id, pNode->Id,
Gia_Regular(pNode->pEquiv)->Id, Gia_IsComplement(pNode->pEquiv)? "\'":"" );
*/
fprintf
(
pFile
,
" Node%d [label =
\"
%d
\"
"
,
i
,
i
);
if
(
vMarks
&&
Vec_IntEntry
(
vMarks
,
i
)
>
0
)
{
fprintf
(
pFile
,
" Node%d [label =
\"
%d_%d
\"
"
,
i
,
Vec_IntFind
(
vRemap
,
i
),
i
);
if
(
Abc_Lit2Att2
(
Vec_IntEntry
(
vMarks
,
i
))
==
2
)
fprintf
(
pFile
,
", shape = doubleoctagon"
);
else
fprintf
(
pFile
,
", shape = octagon"
);
}
else
if
(
Gia_ObjIsXor
(
pNode
)
)
{
fprintf
(
pFile
,
" Node%d [label =
\"
%d
\"
"
,
i
,
i
);
fprintf
(
pFile
,
", shape = doublecircle"
);
}
else
if
(
Gia_ObjIsMux
(
pMan
,
pNode
)
)
{
fprintf
(
pFile
,
" Node%d [label =
\"
%d
\"
"
,
i
,
i
);
fprintf
(
pFile
,
", shape = trapezium"
);
}
else
{
fprintf
(
pFile
,
" Node%d [label =
\"
%d
\"
"
,
i
,
i
);
fprintf
(
pFile
,
", shape = ellipse"
);
}
if
(
pNode
->
fMark0
)
fprintf
(
pFile
,
", style = filled"
);
...
...
src/base/abci/abc.c
View file @
93c785e8
...
...
@@ -6878,6 +6878,12 @@ int Abc_CommandRr( Abc_Frame_t * pAbc, int argc, char ** argv )
}
}
printf
(
"This command is obsolete."
);
printf
(
"To perform pure redudancy removal, try
\"
mfs -r
\"
.
\n
"
);
printf
(
"To perform something a little stronger try
\"
mfs2
\"\n
"
);
printf
(
"When working with an AIG, use
\"
logic
\"
before and
\"
strash
\"
after this command.
\n
"
);
return
0
;
if
(
pNtk
==
NULL
)
{
Abc_Print
(
-
1
,
"Empty network.
\n
"
);
src/base/wlc/wlcBlast.c
View file @
93c785e8
...
...
@@ -1344,6 +1344,25 @@ Gia_Man_t * Wlc_NtkBitBlast( Wlc_Ntk_t * p, Vec_Int_t * vBoxIds, int fGiaSimple
assert( Vec_PtrSize(pNew->vNamesOut) == Gia_ManCoNum(pNew) );
*/
pNew
->
pSpec
=
Abc_UtilStrsav
(
p
->
pSpec
?
p
->
pSpec
:
p
->
pName
);
// dump the miter parts
if
(
0
)
{
char
pFileName0
[
1000
],
pFileName1
[
1000
];
char
*
pNameGeneric
=
Extra_FileNameGeneric
(
p
->
pSpec
);
Vec_Int_t
*
vOrder
=
Vec_IntStartNatural
(
Gia_ManPoNum
(
pNew
)
);
Gia_Man_t
*
pGia0
=
Gia_ManDupCones
(
pNew
,
Vec_IntArray
(
vOrder
),
Vec_IntSize
(
vOrder
)
/
2
,
0
);
Gia_Man_t
*
pGia1
=
Gia_ManDupCones
(
pNew
,
Vec_IntArray
(
vOrder
)
+
Vec_IntSize
(
vOrder
)
/
2
,
Vec_IntSize
(
vOrder
)
/
2
,
0
);
assert
(
Gia_ManPoNum
(
pNew
)
%
2
==
0
);
sprintf
(
pFileName0
,
"%s_lhs_.aig"
,
pNameGeneric
);
sprintf
(
pFileName1
,
"%s_rhs_.aig"
,
pNameGeneric
);
Gia_AigerWrite
(
pGia0
,
pFileName0
,
0
,
0
);
Gia_AigerWrite
(
pGia1
,
pFileName1
,
0
,
0
);
Gia_ManStop
(
pGia0
);
Gia_ManStop
(
pGia1
);
Vec_IntFree
(
vOrder
);
ABC_FREE
(
pNameGeneric
);
printf
(
"Dumped two parts of the miter into files
\"
%s
\"
and
\"
%s
\"
.
\n
"
,
pFileName0
,
pFileName1
);
}
return
pNew
;
}
...
...
src/proof/acec/acecPolyn.c
View file @
93c785e8
...
...
@@ -311,8 +311,8 @@ void Gia_PolynBuildOne( Pln_Man_t * p, int iMono )
Vec_IntAppendMinus
(
p
->
vTempC
[
0
],
vConst
,
0
);
Gia_PolynBuildAdd
(
p
,
p
->
vTempC
[
0
],
p
->
vTempM
[
2
]
);
// C * y
//if ( !p->pGia->vXors || Vec_IntFind(p->pGia->vXors, iDriver)
> 0
)
{
//if ( !p->pGia->vXors || Vec_IntFind(p->pGia->vXors, iDriver)
== -1 || Vec_IntFind(p->pGia->vXors, iDriver) == 5
)
{
vConst
=
Hsh_VecReadEntry
(
p
->
pHashC
,
iConst
);
Vec_IntAppendMinus2x
(
p
->
vTempC
[
0
],
vConst
);
Gia_PolynBuildAdd
(
p
,
p
->
vTempC
[
0
],
p
->
vTempM
[
3
]
);
// -C * x * y
...
...
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