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
47c15362
Commit
47c15362
authored
Sep 19, 2022
by
Alan Mishchenko
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Compiler warnings.
parent
fa6cdf9b
Show whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
27 additions
and
11 deletions
+27
-11
abclib.dsp
+4
-0
src/aig/gia/giaTtopt.cpp
+23
-11
No files found.
abclib.dsp
View file @
47c15362
...
@@ -5299,6 +5299,10 @@ SOURCE=.\src\aig\gia\giaTsim.c
...
@@ -5299,6 +5299,10 @@ SOURCE=.\src\aig\gia\giaTsim.c
# End Source File
# End Source File
# Begin Source File
# Begin Source File
SOURCE=.\src\aig\gia\giaTtopt.cpp
# End Source File
# Begin Source File
SOURCE=.\src\aig\gia\giaUnate.c
SOURCE=.\src\aig\gia\giaUnate.c
# End Source File
# End Source File
# Begin Source File
# Begin Source File
...
...
src/aig/gia/giaTtopt.cpp
View file @
47c15362
// Author : Yukio Miyasaka
// Author : Yukio Miyasaka
#ifdef _WIN32
#ifndef __MINGW32__
#pragma warning(disable : 4786) // warning C4786: identifier was truncated to '255' characters in the browser information
#endif
#endif
#include <vector>
#include <vector>
#include <algorithm>
#include <algorithm>
#include <cassert>
#include <cassert>
...
@@ -301,14 +308,15 @@ public:
...
@@ -301,14 +308,15 @@ public:
Save
(
0
);
Save
(
0
);
SaveIndices
(
0
);
SaveIndices
(
0
);
std
::
vector
<
int
>
vars
(
nInputs
);
std
::
vector
<
int
>
vars
(
nInputs
);
for
(
int
i
=
0
;
i
<
nInputs
;
i
++
)
{
int
i
;
for
(
i
=
0
;
i
<
nInputs
;
i
++
)
{
vars
[
i
]
=
i
;
vars
[
i
]
=
i
;
}
}
std
::
vector
<
unsigned
>
vCounts
(
nInputs
);
std
::
vector
<
unsigned
>
vCounts
(
nInputs
);
for
(
i
nt
i
=
0
;
i
<
nInputs
;
i
++
)
{
for
(
i
=
0
;
i
<
nInputs
;
i
++
)
{
vCounts
[
i
]
=
BDDNodeCountLevel
(
vLevels
[
i
]);
vCounts
[
i
]
=
BDDNodeCountLevel
(
vLevels
[
i
]);
}
}
for
(
i
nt
i
=
1
;
i
<
nInputs
;
i
++
)
{
for
(
i
=
1
;
i
<
nInputs
;
i
++
)
{
int
j
=
i
;
int
j
=
i
;
while
(
j
>
0
&&
vCounts
[
vars
[
j
-
1
]]
<
vCounts
[
vars
[
j
]])
{
while
(
j
>
0
&&
vCounts
[
vars
[
j
-
1
]]
<
vCounts
[
vars
[
j
]])
{
std
::
swap
(
vars
[
j
],
vars
[
j
-
1
]);
std
::
swap
(
vars
[
j
],
vars
[
j
-
1
]);
...
@@ -316,7 +324,8 @@ public:
...
@@ -316,7 +324,8 @@ public:
}
}
}
}
bool
turn
=
true
;
bool
turn
=
true
;
for
(
unsigned
j
=
0
;
j
<
vars
.
size
();
j
++
)
{
unsigned
j
;
for
(
j
=
0
;
j
<
vars
.
size
();
j
++
)
{
int
var
=
vars
[
j
];
int
var
=
vars
[
j
];
bool
updated
=
false
;
bool
updated
=
false
;
int
lev
=
vLevels
[
var
];
int
lev
=
vLevels
[
var
];
...
@@ -371,10 +380,11 @@ public:
...
@@ -371,10 +380,11 @@ public:
Save
(
2
);
Save
(
2
);
for
(
int
i
=
0
;
i
<
nRound
;
i
++
)
{
for
(
int
i
=
0
;
i
<
nRound
;
i
++
)
{
std
::
vector
<
int
>
vLevelsNew
(
nInputs
);
std
::
vector
<
int
>
vLevelsNew
(
nInputs
);
for
(
int
j
=
0
;
j
<
nInputs
;
j
++
)
{
int
j
;
for
(
j
=
0
;
j
<
nInputs
;
j
++
)
{
vLevelsNew
[
j
]
=
j
;
vLevelsNew
[
j
]
=
j
;
}
}
for
(
int
j
=
nInputs
-
1
;
j
>
0
;
j
--
)
{
for
(
j
=
nInputs
-
1
;
j
>
0
;
j
--
)
{
int
d
=
rand
()
%
j
;
int
d
=
rand
()
%
j
;
std
::
swap
(
vLevelsNew
[
j
],
vLevelsNew
[
d
]);
std
::
swap
(
vLevelsNew
[
j
],
vLevelsNew
[
d
]);
}
}
...
@@ -420,10 +430,11 @@ public:
...
@@ -420,10 +430,11 @@ public:
vvIndices
.
resize
(
nInputs
);
vvIndices
.
resize
(
nInputs
);
std
::
vector
<
std
::
vector
<
int
>
>
vvNodes
(
nInputs
);
std
::
vector
<
std
::
vector
<
int
>
>
vvNodes
(
nInputs
);
std
::
vector
<
int
>
vInputs
(
nInputs
);
std
::
vector
<
int
>
vInputs
(
nInputs
);
for
(
int
i
=
0
;
i
<
nInputs
;
i
++
)
{
int
i
;
for
(
i
=
0
;
i
<
nInputs
;
i
++
)
{
vInputs
[
vLevels
[
i
]]
=
Vec_IntEntry
(
vSupp
,
nInputs
-
i
-
1
)
<<
1
;
vInputs
[
vLevels
[
i
]]
=
Vec_IntEntry
(
vSupp
,
nInputs
-
i
-
1
)
<<
1
;
}
}
for
(
i
nt
i
=
0
;
i
<
nOutputs
;
i
++
)
{
for
(
i
=
0
;
i
<
nOutputs
;
i
++
)
{
int
node
=
BDDGenerateAigRec
(
pNew
,
vInputs
,
vvNodes
,
i
,
0
);
int
node
=
BDDGenerateAigRec
(
pNew
,
vInputs
,
vvNodes
,
i
,
0
);
Gia_ManAppendCo
(
pNew
,
node
);
Gia_ManAppendCo
(
pNew
,
node
);
}
}
...
@@ -918,17 +929,18 @@ public:
...
@@ -918,17 +929,18 @@ public:
int
BDDRebuild
(
int
lev
)
{
int
BDDRebuild
(
int
lev
)
{
RestoreCare
();
RestoreCare
();
for
(
int
i
=
lev
;
i
<
nInputs
;
i
++
)
{
int
i
;
for
(
i
=
lev
;
i
<
nInputs
;
i
++
)
{
vvIndices
[
i
].
clear
();
vvIndices
[
i
].
clear
();
vvMergedIndices
[
i
].
clear
();
vvMergedIndices
[
i
].
clear
();
if
(
i
)
{
if
(
i
)
{
vvRedundantIndices
[
i
-
1
].
clear
();
vvRedundantIndices
[
i
-
1
].
clear
();
}
}
}
}
for
(
i
nt
i
=
0
;
i
<
lev
;
i
++
)
{
for
(
i
=
0
;
i
<
lev
;
i
++
)
{
BDDRebuildByMerge
(
i
);
BDDRebuildByMerge
(
i
);
}
}
for
(
i
nt
i
=
lev
;
i
<
nInputs
;
i
++
)
{
for
(
i
=
lev
;
i
<
nInputs
;
i
++
)
{
if
(
!
i
)
{
if
(
!
i
)
{
for
(
int
j
=
0
;
j
<
nOutputs
;
j
++
)
{
for
(
int
j
=
0
;
j
<
nOutputs
;
j
++
)
{
if
(
!
IsDC
(
j
,
0
))
{
if
(
!
IsDC
(
j
,
0
))
{
...
...
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