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
b7176ee3
Commit
b7176ee3
authored
Dec 03, 2021
by
Alan Mishchenko
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Adding command-line switch 'testnpn -A 12' for P-only canonical form computation.
parent
03b9f417
Hide whitespace changes
Inline
Side-by-side
Showing
3 changed files
with
16 additions
and
2 deletions
+16
-2
src/base/abci/abc.c
+1
-0
src/base/abci/abcNpn.c
+14
-1
src/opt/dau/dauCanon.c
+1
-1
No files found.
src/base/abci/abc.c
View file @
b7176ee3
...
@@ -6961,6 +6961,7 @@ usage:
...
@@ -6961,6 +6961,7 @@ usage:
Abc_Print
(
-
2
,
"
\t
9: adjustable algorithm (heuristic) by XueGong Zhou at Fudan University, Shanghai
\n
"
);
Abc_Print
(
-
2
,
"
\t
9: adjustable algorithm (heuristic) by XueGong Zhou at Fudan University, Shanghai
\n
"
);
Abc_Print
(
-
2
,
"
\t
10: adjustable algorithm (exact) by XueGong Zhou at Fudan University, Shanghai
\n
"
);
Abc_Print
(
-
2
,
"
\t
10: adjustable algorithm (exact) by XueGong Zhou at Fudan University, Shanghai
\n
"
);
Abc_Print
(
-
2
,
"
\t
11: new cost-aware exact algorithm by XueGong Zhou at Fudan University, Shanghai
\n
"
);
Abc_Print
(
-
2
,
"
\t
11: new cost-aware exact algorithm by XueGong Zhou at Fudan University, Shanghai
\n
"
);
Abc_Print
(
-
2
,
"
\t
12: new fast hybrid semi-canonical form (permutation only)
\n
"
);
Abc_Print
(
-
2
,
"
\t
-N <num> : the number of support variables (binary files only) [default = unused]
\n
"
);
Abc_Print
(
-
2
,
"
\t
-N <num> : the number of support variables (binary files only) [default = unused]
\n
"
);
Abc_Print
(
-
2
,
"
\t
-d : toggle dumping resulting functions into a file [default = %s]
\n
"
,
fDumpRes
?
"yes"
:
"no"
);
Abc_Print
(
-
2
,
"
\t
-d : toggle dumping resulting functions into a file [default = %s]
\n
"
,
fDumpRes
?
"yes"
:
"no"
);
Abc_Print
(
-
2
,
"
\t
-b : toggle dumping in binary format [default = %s]
\n
"
,
fBinary
?
"yes"
:
"no"
);
Abc_Print
(
-
2
,
"
\t
-b : toggle dumping in binary format [default = %s]
\n
"
,
fBinary
?
"yes"
:
"no"
);
src/base/abci/abcNpn.c
View file @
b7176ee3
...
@@ -208,6 +208,8 @@ void Abc_TruthNpnPerform( Abc_TtStore_t * p, int NpnType, int fVerbose )
...
@@ -208,6 +208,8 @@ void Abc_TruthNpnPerform( Abc_TtStore_t * p, int NpnType, int fVerbose )
pAlgoName
=
"adjustable algorithm (exact) "
;
pAlgoName
=
"adjustable algorithm (exact) "
;
else
if
(
NpnType
==
11
)
else
if
(
NpnType
==
11
)
pAlgoName
=
"new cost-aware exact algorithm "
;
pAlgoName
=
"new cost-aware exact algorithm "
;
else
if
(
NpnType
==
12
)
pAlgoName
=
"new hybrid fast (P) "
;
assert
(
p
->
nVars
<=
16
);
assert
(
p
->
nVars
<=
16
);
if
(
pAlgoName
)
if
(
pAlgoName
)
...
@@ -356,6 +358,17 @@ void Abc_TruthNpnPerform( Abc_TtStore_t * p, int NpnType, int fVerbose )
...
@@ -356,6 +358,17 @@ void Abc_TruthNpnPerform( Abc_TtStore_t * p, int NpnType, int fVerbose )
}
}
Abc_TtHieManStop
(
pMan
);
Abc_TtHieManStop
(
pMan
);
}
}
else
if
(
NpnType
==
12
)
{
for
(
i
=
0
;
i
<
p
->
nFuncs
;
i
++
)
{
if
(
fVerbose
)
printf
(
"%7d : "
,
i
);
uCanonPhase
=
Abc_TtCanonicizePerm
(
p
->
pFuncs
[
i
],
p
->
nVars
,
pCanonPerm
);
if
(
fVerbose
)
Extra_PrintHex
(
stdout
,
(
unsigned
*
)
p
->
pFuncs
[
i
],
p
->
nVars
),
Abc_TruthNpnPrint
(
pCanonPerm
,
uCanonPhase
,
p
->
nVars
),
printf
(
"
\n
"
);
}
}
else
assert
(
0
);
else
assert
(
0
);
clk
=
Abc_Clock
()
-
clk
;
clk
=
Abc_Clock
()
-
clk
;
printf
(
"Classes =%9d "
,
Abc_TruthNpnCountUnique
(
p
)
);
printf
(
"Classes =%9d "
,
Abc_TruthNpnCountUnique
(
p
)
);
...
@@ -419,7 +432,7 @@ int Abc_NpnTest( char * pFileName, int NpnType, int nVarNum, int fDumpRes, int f
...
@@ -419,7 +432,7 @@ int Abc_NpnTest( char * pFileName, int NpnType, int nVarNum, int fDumpRes, int f
{
{
if
(
fVerbose
)
if
(
fVerbose
)
printf
(
"Using truth tables from file
\"
%s
\"
...
\n
"
,
pFileName
);
printf
(
"Using truth tables from file
\"
%s
\"
...
\n
"
,
pFileName
);
if
(
NpnType
>=
0
&&
NpnType
<=
1
1
)
if
(
NpnType
>=
0
&&
NpnType
<=
1
2
)
Abc_TruthNpnTest
(
pFileName
,
NpnType
,
nVarNum
,
fDumpRes
,
fBinary
,
fVerbose
);
Abc_TruthNpnTest
(
pFileName
,
NpnType
,
nVarNum
,
fDumpRes
,
fBinary
,
fVerbose
);
else
else
printf
(
"Unknown canonical form value (%d).
\n
"
,
NpnType
);
printf
(
"Unknown canonical form value (%d).
\n
"
,
NpnType
);
...
...
src/opt/dau/dauCanon.c
View file @
b7176ee3
...
@@ -1027,7 +1027,7 @@ int Abc_TtCofactorPerm( word * pTruth, int i, int nWords, int fSwapOnly, char *
...
@@ -1027,7 +1027,7 @@ int Abc_TtCofactorPerm( word * pTruth, int i, int nWords, int fSwapOnly, char *
SeeAlso []
SeeAlso []
***********************************************************************/
***********************************************************************/
#define CANON_VERIFY
//
#define CANON_VERIFY
unsigned
Abc_TtCanonicize
(
word
*
pTruth
,
int
nVars
,
char
*
pCanonPerm
)
unsigned
Abc_TtCanonicize
(
word
*
pTruth
,
int
nVars
,
char
*
pCanonPerm
)
{
{
int
pStoreIn
[
17
];
int
pStoreIn
[
17
];
...
...
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