diff options
Diffstat (limited to 'src/base/abci/abcExact.c')
| -rw-r--r-- | src/base/abci/abcExact.c | 12 |
1 files changed, 7 insertions, 5 deletions
diff --git a/src/base/abci/abcExact.c b/src/base/abci/abcExact.c index 04d2ebee..40a5a6ca 100644 --- a/src/base/abci/abcExact.c +++ b/src/base/abci/abcExact.c @@ -1020,13 +1020,15 @@ int Abc_ExactInputNum() { return 0; } -// this procedure takes input arrival times (pArrTimeProfile) and -// return the output smallest possible output arrival time -int Abc_ExactDelayCost( int nVars, word * pTruth, int * pArrTimeProfile ) +// this procedure takes TT and input arrival times (pArrTimeProfile) and return the smallest output arrival time; +// it also returns the pin-to-pin delays (pPerm) between each cut leaf and the cut output and the cut area cost (Cost) +// the area cost should not exceed 2048, if the cut is implementable; otherwise, it should be ABC_INFINITY +int Abc_ExactDelayCost( word * pTruth, int nVars, int * pArrTimeProfile, char * pPerm, int * Cost ) { - return 0; + *Cost = ABC_INFINITY; + return ABC_INFINITY; } -// this procedure returns a new node whose output in terms of the given fanins whose output +// this procedure returns a new node whose output in terms of the given fanins // has the smallest possible arrival time (in agreement with the above Abc_ExactDelayCost) Abc_Obj_t * Abc_ExactBuildNode( word * pTruth, int nVars, int * pArrTimeProfile, Abc_Obj_t ** pFanins ) { |