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
32868822
Commit
32868822
authored
Sep 23, 2013
by
Alan Mishchenko
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Experiments with exact matching into LUT structures.
parent
eec94a70
Show whitespace changes
Inline
Side-by-side
Showing
3 changed files
with
121 additions
and
4 deletions
+121
-4
src/aig/gia/giaIf.c
+72
-4
src/map/if/if.h
+1
-0
src/map/if/ifDec07.c
+48
-0
No files found.
src/aig/gia/giaIf.c
View file @
32868822
...
@@ -668,6 +668,54 @@ int Gia_ManFromIfLogicCreateLut( Gia_Man_t * pNew, word * pRes, Vec_Int_t * vLea
...
@@ -668,6 +668,54 @@ int Gia_ManFromIfLogicCreateLut( Gia_Man_t * pNew, word * pRes, Vec_Int_t * vLea
return
iObjLit1
;
return
iObjLit1
;
}
}
/**Function*************************************************************
Synopsis [Write mapping for LUT with given fanins.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
int
Gia_ManFromIfLogicCreateLutSpecial
(
Gia_Man_t
*
pNew
,
word
*
pRes
,
Vec_Int_t
*
vLeaves
,
Vec_Int_t
*
vLeavesTemp
,
Vec_Int_t
*
vCover
,
Vec_Int_t
*
vMapping
,
Vec_Int_t
*
vMapping2
,
Vec_Int_t
*
vPacking
)
{
word
z
=
If_CutPerformDerive07
(
NULL
,
(
unsigned
*
)
pRes
,
Vec_IntSize
(
vLeaves
),
Vec_IntSize
(
vLeaves
),
NULL
);
word
Truth
;
int
i
,
iObjLit1
,
iObjLit2
;
// create first LUT
Vec_IntClear
(
vLeavesTemp
);
for
(
i
=
0
;
i
<
4
;
i
++
)
{
int
v
=
(
int
)((
z
>>
(
16
+
(
i
<<
2
)))
&
7
);
Vec_IntPush
(
vLeavesTemp
,
Vec_IntEntry
(
vLeaves
,
v
)
);
}
Truth
=
(
z
&
0xffff
);
Truth
|=
(
Truth
<<
16
);
Truth
|=
(
Truth
<<
32
);
iObjLit1
=
Gia_ManFromIfLogicCreateLut
(
pNew
,
&
Truth
,
vLeavesTemp
,
vCover
,
vMapping
,
vMapping2
);
// create second LUT
Vec_IntClear
(
vLeavesTemp
);
for
(
i
=
0
;
i
<
4
;
i
++
)
{
int
v
=
(
int
)((
z
>>
(
48
+
(
i
<<
2
)))
&
7
);
if
(
v
==
7
)
Vec_IntPush
(
vLeavesTemp
,
iObjLit1
);
else
Vec_IntPush
(
vLeavesTemp
,
Vec_IntEntry
(
vLeaves
,
v
)
);
}
Truth
=
((
z
>>
32
)
&
0xffff
);
Truth
|=
(
Truth
<<
16
);
Truth
|=
(
Truth
<<
32
);
iObjLit2
=
Gia_ManFromIfLogicCreateLut
(
pNew
,
&
Truth
,
vLeavesTemp
,
vCover
,
vMapping
,
vMapping2
);
// write packing
Vec_IntPush
(
vPacking
,
2
);
Vec_IntPush
(
vPacking
,
Abc_Lit2Var
(
iObjLit1
)
);
Vec_IntPush
(
vPacking
,
Abc_Lit2Var
(
iObjLit2
)
);
Vec_IntAddToEntry
(
vPacking
,
0
,
1
);
return
iObjLit2
;
}
/**Function*************************************************************
/**Function*************************************************************
...
@@ -681,13 +729,31 @@ int Gia_ManFromIfLogicCreateLut( Gia_Man_t * pNew, word * pRes, Vec_Int_t * vLea
...
@@ -681,13 +729,31 @@ int Gia_ManFromIfLogicCreateLut( Gia_Man_t * pNew, word * pRes, Vec_Int_t * vLea
***********************************************************************/
***********************************************************************/
int
Gia_ManFromIfLogicNode
(
Gia_Man_t
*
pNew
,
int
iObj
,
Vec_Int_t
*
vLeaves
,
Vec_Int_t
*
vLeavesTemp
,
int
Gia_ManFromIfLogicNode
(
Gia_Man_t
*
pNew
,
int
iObj
,
Vec_Int_t
*
vLeaves
,
Vec_Int_t
*
vLeavesTemp
,
word
*
pRes
,
char
*
pStr
,
Vec_Int_t
*
vCover
,
Vec_Int_t
*
vMapping
,
Vec_Int_t
*
vMapping2
,
Vec_Int_t
*
vPacking
,
int
fCheck75
)
word
*
pRes
,
char
*
pStr
,
Vec_Int_t
*
vCover
,
Vec_Int_t
*
vMapping
,
Vec_Int_t
*
vMapping2
,
Vec_Int_t
*
vPacking
,
int
fCheck75
,
int
fCheck44e
)
{
{
int
nLeaves
=
Vec_IntSize
(
vLeaves
);
int
nLeaves
=
Vec_IntSize
(
vLeaves
);
int
i
,
Length
,
nLutLeaf
,
nLutLeaf2
,
nLutRoot
,
iObjLit1
,
iObjLit2
,
iObjLit3
;
int
i
,
Length
,
nLutLeaf
,
nLutLeaf2
,
nLutRoot
,
iObjLit1
,
iObjLit2
,
iObjLit3
;
// workaround for the special case
// workaround for the special case
if
(
fCheck75
)
if
(
fCheck75
)
pStr
=
"54"
;
pStr
=
"54"
;
// perform special case matching for 44
if
(
fCheck44e
)
{
if
(
Vec_IntSize
(
vLeaves
)
<=
4
)
{
// create mapping
iObjLit1
=
Gia_ManFromIfLogicCreateLut
(
pNew
,
pRes
,
vLeaves
,
vCover
,
vMapping
,
vMapping2
);
// write packing
if
(
!
Gia_ObjIsCi
(
Gia_ManObj
(
pNew
,
Abc_Lit2Var
(
iObjLit1
)))
)
{
Vec_IntPush
(
vPacking
,
1
);
Vec_IntPush
(
vPacking
,
Abc_Lit2Var
(
iObjLit1
)
);
Vec_IntAddToEntry
(
vPacking
,
0
,
1
);
}
return
iObjLit1
;
}
return
Gia_ManFromIfLogicCreateLutSpecial
(
pNew
,
pRes
,
vLeaves
,
vLeavesTemp
,
vCover
,
vMapping
,
vMapping2
,
vPacking
);
}
// check if there is no LUT structures
// check if there is no LUT structures
if
(
pStr
==
NULL
)
if
(
pStr
==
NULL
)
return
Gia_ManFromIfLogicCreateLut
(
pNew
,
pRes
,
vLeaves
,
vCover
,
vMapping
,
vMapping2
);
return
Gia_ManFromIfLogicCreateLut
(
pNew
,
pRes
,
vLeaves
,
vCover
,
vMapping
,
vMapping2
);
...
@@ -1045,10 +1111,12 @@ Gia_Man_t * Gia_ManFromIfLogic( If_Man_t * pIfMan )
...
@@ -1045,10 +1111,12 @@ Gia_Man_t * Gia_ManFromIfLogic( If_Man_t * pIfMan )
word
Truth
=
0
,
*
pTruthTable
;
word
Truth
=
0
,
*
pTruthTable
;
int
i
,
k
,
Entry
;
int
i
,
k
,
Entry
;
assert
(
!
pIfMan
->
pPars
->
fDeriveLuts
||
pIfMan
->
pPars
->
fTruth
);
assert
(
!
pIfMan
->
pPars
->
fDeriveLuts
||
pIfMan
->
pPars
->
fTruth
);
if
(
pIfMan
->
pPars
->
fEnableCheck07
)
pIfMan
->
pPars
->
fDeriveLuts
=
0
;
// start mapping and packing
// start mapping and packing
vMapping
=
Vec_IntStart
(
If_ManObjNum
(
pIfMan
)
);
vMapping
=
Vec_IntStart
(
If_ManObjNum
(
pIfMan
)
);
vMapping2
=
Vec_IntStart
(
1
);
vMapping2
=
Vec_IntStart
(
1
);
if
(
pIfMan
->
pPars
->
fDeriveLuts
&&
(
pIfMan
->
pPars
->
pLutStruct
||
pIfMan
->
pPars
->
fEnableCheck75
||
pIfMan
->
pPars
->
fEnableCheck75u
)
)
if
(
pIfMan
->
pPars
->
fDeriveLuts
&&
(
pIfMan
->
pPars
->
pLutStruct
||
pIfMan
->
pPars
->
fEnableCheck75
||
pIfMan
->
pPars
->
fEnableCheck75u
||
pIfMan
->
pPars
->
fEnableCheck07
)
)
{
{
vPacking
=
Vec_IntAlloc
(
1000
);
vPacking
=
Vec_IntAlloc
(
1000
);
Vec_IntPush
(
vPacking
,
0
);
Vec_IntPush
(
vPacking
,
0
);
...
@@ -1068,7 +1136,7 @@ Gia_Man_t * Gia_ManFromIfLogic( If_Man_t * pIfMan )
...
@@ -1068,7 +1136,7 @@ Gia_Man_t * Gia_ManFromIfLogic( If_Man_t * pIfMan )
{
{
pCutBest
=
If_ObjCutBest
(
pIfObj
);
pCutBest
=
If_ObjCutBest
(
pIfObj
);
// perform sorting of cut leaves by delay, so that the slowest pin drives the fastest input of the LUT
// perform sorting of cut leaves by delay, so that the slowest pin drives the fastest input of the LUT
if
(
!
pIfMan
->
pPars
->
fDelayOpt
&&
!
pIfMan
->
pPars
->
pLutStruct
&&
!
pIfMan
->
pPars
->
fUserRecLib
&&
!
pIfMan
->
pPars
->
nGateSize
&&
!
pIfMan
->
pPars
->
fEnableCheck75
&&
!
pIfMan
->
pPars
->
fEnableCheck75u
)
if
(
!
pIfMan
->
pPars
->
fDelayOpt
&&
!
pIfMan
->
pPars
->
pLutStruct
&&
!
pIfMan
->
pPars
->
fUserRecLib
&&
!
pIfMan
->
pPars
->
nGateSize
&&
!
pIfMan
->
pPars
->
fEnableCheck75
&&
!
pIfMan
->
pPars
->
fEnableCheck75u
&&
!
pIfMan
->
pPars
->
fEnableCheck07
)
If_CutRotatePins
(
pIfMan
,
pCutBest
);
If_CutRotatePins
(
pIfMan
,
pCutBest
);
// collect leaves of the best cut
// collect leaves of the best cut
Vec_IntClear
(
vLeaves
);
Vec_IntClear
(
vLeaves
);
...
@@ -1086,7 +1154,7 @@ Gia_Man_t * Gia_ManFromIfLogic( If_Man_t * pIfMan )
...
@@ -1086,7 +1154,7 @@ Gia_Man_t * Gia_ManFromIfLogic( If_Man_t * pIfMan )
pTruthTable
=
&
Truth
;
pTruthTable
=
&
Truth
;
}
}
// perform decomposition of the cut
// perform decomposition of the cut
pIfObj
->
iCopy
=
Gia_ManFromIfLogicNode
(
pNew
,
i
,
vLeaves
,
vLeaves2
,
pTruthTable
,
pIfMan
->
pPars
->
pLutStruct
,
vCover
,
vMapping
,
vMapping2
,
vPacking
,
(
pIfMan
->
pPars
->
fEnableCheck75
||
pIfMan
->
pPars
->
fEnableCheck75u
)
);
pIfObj
->
iCopy
=
Gia_ManFromIfLogicNode
(
pNew
,
i
,
vLeaves
,
vLeaves2
,
pTruthTable
,
pIfMan
->
pPars
->
pLutStruct
,
vCover
,
vMapping
,
vMapping2
,
vPacking
,
(
pIfMan
->
pPars
->
fEnableCheck75
||
pIfMan
->
pPars
->
fEnableCheck75u
)
,
pIfMan
->
pPars
->
fEnableCheck07
);
pIfObj
->
iCopy
=
Abc_LitNotCond
(
pIfObj
->
iCopy
,
pCutBest
->
fCompl
);
pIfObj
->
iCopy
=
Abc_LitNotCond
(
pIfObj
->
iCopy
,
pCutBest
->
fCompl
);
}
}
else
else
...
...
src/map/if/if.h
View file @
32868822
...
@@ -491,6 +491,7 @@ extern float If_CutPowerRef( If_Man_t * p, If_Cut_t * pCut, If_Obj_t *
...
@@ -491,6 +491,7 @@ extern float If_CutPowerRef( If_Man_t * p, If_Cut_t * pCut, If_Obj_t *
extern
float
If_CutPowerDerefed
(
If_Man_t
*
p
,
If_Cut_t
*
pCut
,
If_Obj_t
*
pRoot
);
extern
float
If_CutPowerDerefed
(
If_Man_t
*
p
,
If_Cut_t
*
pCut
,
If_Obj_t
*
pRoot
);
extern
float
If_CutPowerRefed
(
If_Man_t
*
p
,
If_Cut_t
*
pCut
,
If_Obj_t
*
pRoot
);
extern
float
If_CutPowerRefed
(
If_Man_t
*
p
,
If_Cut_t
*
pCut
,
If_Obj_t
*
pRoot
);
/*=== ifDec.c =============================================================*/
/*=== ifDec.c =============================================================*/
extern
word
If_CutPerformDerive07
(
If_Man_t
*
p
,
unsigned
*
pTruth
,
int
nVars
,
int
nLeaves
,
char
*
pStr
);
extern
int
If_CutPerformCheck07
(
If_Man_t
*
p
,
unsigned
*
pTruth
,
int
nVars
,
int
nLeaves
,
char
*
pStr
);
extern
int
If_CutPerformCheck07
(
If_Man_t
*
p
,
unsigned
*
pTruth
,
int
nVars
,
int
nLeaves
,
char
*
pStr
);
extern
int
If_CutPerformCheck08
(
If_Man_t
*
p
,
unsigned
*
pTruth
,
int
nVars
,
int
nLeaves
,
char
*
pStr
);
extern
int
If_CutPerformCheck08
(
If_Man_t
*
p
,
unsigned
*
pTruth
,
int
nVars
,
int
nLeaves
,
char
*
pStr
);
extern
int
If_CutPerformCheck10
(
If_Man_t
*
p
,
unsigned
*
pTruth
,
int
nVars
,
int
nLeaves
,
char
*
pStr
);
extern
int
If_CutPerformCheck10
(
If_Man_t
*
p
,
unsigned
*
pTruth
,
int
nVars
,
int
nLeaves
,
char
*
pStr
);
...
...
src/map/if/ifDec07.c
View file @
32868822
...
@@ -675,6 +675,54 @@ int If_Dec7PickBestMux( word t[2], word c0r[2], word c1r[2] )
...
@@ -675,6 +675,54 @@ int If_Dec7PickBestMux( word t[2], word c0r[2], word c1r[2] )
SeeAlso []
SeeAlso []
***********************************************************************/
***********************************************************************/
word
If_CutPerformDerive07
(
If_Man_t
*
p
,
unsigned
*
pTruth
,
int
nVars
,
int
nLeaves
,
char
*
pStr
)
{
if
(
nLeaves
<
5
)
return
1
;
if
(
nLeaves
==
5
)
{
word
z
,
t
=
((
word
*
)
pTruth
)[
0
];
// if ( If_Dec6CheckMux(t) >= 0 )
// return 1;
z
=
If_Dec6Perform
(
t
,
1
);
If_Dec6Verify
(
t
,
z
);
return
z
;
}
if
(
nLeaves
==
6
)
{
word
z
,
t
=
((
word
*
)
pTruth
)[
0
];
// if ( If_Dec6CheckMux(t) >= 0 )
// return 1;
z
=
If_Dec6Perform
(
t
,
1
);
If_Dec6Verify
(
t
,
z
);
return
z
;
}
if
(
nLeaves
==
7
)
{
word
z
,
t
[
2
];
t
[
0
]
=
((
word
*
)
pTruth
)[
0
];
t
[
1
]
=
((
word
*
)
pTruth
)[
1
];
if
(
If_Dec7CheckMux
(
t
)
>=
0
)
return
1
;
z
=
If_Dec7Perform
(
t
,
1
);
If_Dec7Verify
(
t
,
z
);
return
z
;
}
assert
(
0
);
return
0
;
}
/**Function*************************************************************
Synopsis [Performs additional check.]
Description []
SideEffects []
SeeAlso []
***********************************************************************/
int
If_CutPerformCheck07
(
If_Man_t
*
p
,
unsigned
*
pTruth
,
int
nVars
,
int
nLeaves
,
char
*
pStr
)
int
If_CutPerformCheck07
(
If_Man_t
*
p
,
unsigned
*
pTruth
,
int
nVars
,
int
nLeaves
,
char
*
pStr
)
{
{
int
fDerive
=
0
;
int
fDerive
=
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