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
97a2e6f2
Commit
97a2e6f2
authored
Feb 17, 2012
by
Alan Mishchenko
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Isomorphism checking code.
parent
5d7c5685
Expand all
Show whitespace changes
Inline
Side-by-side
Showing
3 changed files
with
67 additions
and
0 deletions
+67
-0
src/aig/saig/saigIso.c
+6
-0
src/aig/saig/saigIsoSlow.c
+0
-0
src/misc/vec/vecVec.h
+61
-0
No files found.
src/aig/saig/saigIso.c
View file @
97a2e6f2
...
...
@@ -503,6 +503,12 @@ Aig_Man_t * Iso_ManFilterPos( Aig_Man_t * pAig, Vec_Ptr_t ** pvPosEquivs, int fV
printf( " Unique = %d\n", nUnique );
}
*/
// canonicize order
Vec_PtrForEachEntry
(
Vec_Int_t
*
,
vClasses
,
vLevel
,
i
)
Vec_IntSort
(
vLevel
,
0
);
Vec_VecSortByFirstInt
(
(
Vec_Vec_t
*
)
vClasses
,
0
);
// collect the first ones
vRemain
=
Vec_IntAlloc
(
100
);
Vec_PtrForEachEntry
(
Vec_Int_t
*
,
vClasses
,
vLevel
,
i
)
...
...
src/aig/saig/saigIsoSlow.c
View file @
97a2e6f2
This diff is collapsed.
Click to expand it.
src/misc/vec/vecVec.h
View file @
97a2e6f2
...
...
@@ -588,6 +588,67 @@ static inline void Vec_VecSort( Vec_Vec_t * p, int fReverse )
/**Function*************************************************************
Synopsis [Comparison procedure for two integers.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
static
int
Vec_VecSortCompare3
(
Vec_Int_t
**
pp1
,
Vec_Int_t
**
pp2
)
{
if
(
Vec_IntEntry
(
*
pp1
,
0
)
<
Vec_IntEntry
(
*
pp2
,
0
)
)
return
-
1
;
if
(
Vec_IntEntry
(
*
pp1
,
0
)
>
Vec_IntEntry
(
*
pp2
,
0
)
)
return
1
;
return
0
;
}
/**Function*************************************************************
Synopsis [Comparison procedure for two integers.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
static
int
Vec_VecSortCompare4
(
Vec_Int_t
**
pp1
,
Vec_Int_t
**
pp2
)
{
if
(
Vec_IntEntry
(
*
pp1
,
0
)
>
Vec_IntEntry
(
*
pp2
,
0
)
)
return
-
1
;
if
(
Vec_IntEntry
(
*
pp1
,
0
)
<
Vec_IntEntry
(
*
pp2
,
0
)
)
return
1
;
return
0
;
}
/**Function*************************************************************
Synopsis [Sorting the entries by their integer value.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
static
inline
void
Vec_VecSortByFirstInt
(
Vec_Vec_t
*
p
,
int
fReverse
)
{
if
(
fReverse
)
qsort
(
(
void
*
)
p
->
pArray
,
p
->
nSize
,
sizeof
(
void
*
),
(
int
(
*
)(
const
void
*
,
const
void
*
))
Vec_VecSortCompare4
);
else
qsort
(
(
void
*
)
p
->
pArray
,
p
->
nSize
,
sizeof
(
void
*
),
(
int
(
*
)(
const
void
*
,
const
void
*
))
Vec_VecSortCompare3
);
}
/**Function*************************************************************
Synopsis []
Description []
...
...
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