/**CFile**************************************************************** FileName [nwkFlow.c] SystemName [ABC: Logic synthesis and verification system.] PackageName [Netlist representation.] Synopsis [Max-flow/min-cut computation.] Author [Alan Mishchenko] Affiliation [UC Berkeley] Date [Ver. 1.0. Started - June 20, 2005.] Revision [$Id: nwkFlow.c,v 1.00 2005/06/20 00:00:00 alanmi Exp $] ***********************************************************************/ #include "nwk.h" ABC_NAMESPACE_IMPL_START /* This code is based on the papers: A. Hurst, A. Mishchenko, and R. Brayton, "Fast minimum-register retiming via binary maximum-flow", Proc. FMCAD '07, pp. 181-187. A. Hurst, A. Mishchenko, and R. Brayton, "Scalable min-area retiming under simultaneous delay and initial state constraints". Proc. DAC'08. */ int DepthFwd, DepthBwd, DepthFwdMax, DepthBwdMax; //////////////////////////////////////////////////////////////////////// /// DECLARATIONS /// //////////////////////////////////////////////////////////////////////// // predecessors static inline Nwk_Obj_t * Nwk_ObjPred( Nwk_Obj_t * pObj ) { return pObj->pCopy; } static inline int Nwk_ObjSetPred( Nwk_Obj_t * pObj, Nwk_Obj_t * p ) { pObj->pCopy = p; return 1; } // sink static inline int Nwk_ObjIsSink( Nwk_Obj_t * pObj ) { return pObj->MarkA; } static inline void Nwk_ObjSetSink( Nwk_Obj_t * pObj ) { pObj->MarkA = 1; } // flow static inline int Nwk_ObjHasFlow( Nwk_Obj_t * pObj ) { return pObj->MarkB; } static inline void Nwk_ObjSetFlow( Nwk_Obj_t * pObj ) { pObj->MarkB = 1; } static inline void Nwk_ObjClearFlow( Nwk_Obj_t * pObj ) { pObj->MarkB = 0; } // representation of visited nodes // pObj->TravId < pNtk->nTravIds-2 --- not visited // pObj->TravId == pNtk->nTravIds-2 --- visited bot only // pObj->TravId == pNtk->nTravIds-1 --- visited top only // pObj->TravId == pNtk->nTravIds --- visited bot and top static inline int Nwk_ObjVisitedBotOnly( Nwk_Obj_t * pObj ) { return pObj->TravId == pObj->pMan->nTravIds - 2; } static inline int Nwk_ObjVisitedBot( Nwk_Obj_t * pObj ) { return pObj->TravId == pObj->pMan->nTravIds - 2 || pObj->TravId == pObj->pMan->nTravIds; } static inline int Nwk_ObjVisitedTop( Nwk_Obj_t * pObj ) { return pObj->TravId == pObj->pMan->nTravIds - 1 || pObj->TravId == pObj->pMan->nTravIds; } static inline void Nwk_ObjSetVisitedBot( Nwk_Obj_t * pObj ) { if ( pObj->TravId < pObj->pMan->nTravIds - 2 ) pObj->TravId = pObj->pMan->nTravIds - 2; else if ( pObj->TravId == pObj->pMan->nTravIds - 1 ) pObj->TravId = pObj->pMan->nTravIds; else assert( 0 ); } static inline void Nwk_ObjSetVisitedTop( Nwk_Obj_t * pObj ) { if ( pObj->TravId < pObj->pMan->nTravIds - 2 ) pObj->TravId = pObj->pMan->nTravIds - 1; else if ( pObj->TravId == pObj->pMan->nTravIds - 2 ) pObj->TravId = pObj->pMan->nTravIds; else assert( 0 ); } static inline Nwk_ManIncrementTravIdFlow( Nwk_Man_t * pMan ) { Nwk_ManIncrementTravId( pMan ); Nwk_ManIncrementTravId( pMan ); Nwk_ManIncrementTravId( pMan ); } static int Nwk_ManPushForwardTop_rec( Nwk_Obj_t * pObj, Nwk_Obj_t * pPred ); static int Nwk_ManPushForwardBot_rec( Nwk_Obj_t * pObj, Nwk_Obj_t * pPred ); static int Nwk_ManPushBackwardTop_rec( Nwk_Obj_t * pObj, Nwk_Obj_t * pPred ); static int Nwk_ManPushBackwardBot_rec( Nwk_Obj_t * pObj, Nwk_Obj_t * pPred ); //////////////////////////////////////////////////////////////////////// /// FUNCTION DEFINITIONS /// //////////////////////////////////////////////////////////////////////// /**Function************************************************************* Synopsis [Marks TFI of the node.] Description [] SideEffects [] SeeAlso [] ***********************************************************************/ void Nwk_Ma
/* Copyright 2017 Jack Humbert
 *
 * This program is free software: you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation, either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 * GNU General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program.  If not, see <http://www.gnu.org/licenses/>.
 */

#ifndef PROCESS_TERMINAL_H
#define PROCESS_TERMINAL_H

#include "quantum.h"

#define TERM_ON KC_NO
#define TERM_OFF KC_NO

#endif
generated by cgit v1.2.3 (git 2.25.1) at 2025-11-09 10:00:43 +0000
******************************** Synopsis [Returns 0 if there is an unmarked path to a CI.] Description [] SideEffects [] SeeAlso [] ***********************************************************************/ int Nwk_ManVerifyCut_rec( Nwk_Obj_t * pObj ) { Nwk_Obj_t * pNext; int i; if ( pObj->MarkA ) return 1; if ( Nwk_ObjIsLo(pObj) ) return 0; if ( Nwk_ObjIsTravIdCurrent( pObj ) ) return 1; Nwk_ObjSetTravIdCurrent( pObj ); Nwk_ObjForEachFanin( pObj, pNext, i ) if ( !Nwk_ManVerifyCut_rec( pNext ) ) return 0; return 1; } /**Function************************************************************* Synopsis [Verifies the forward cut.] Description [] SideEffects [] SeeAlso [] ***********************************************************************/ int Nwk_ManRetimeVerifyCutForward( Nwk_Man_t * pMan, Vec_Ptr_t * vNodes ) { Nwk_Obj_t * pObj; int i; // mark the nodes Vec_PtrForEachEntry( Nwk_Obj_t *, vNodes, pObj, i ) { assert( pObj->MarkA == 0 ); pObj->MarkA = 1; } // traverse from the COs Nwk_ManIncrementTravId( pMan ); Nwk_ManForEachCo( pMan, pObj, i ) if ( !Nwk_ManVerifyCut_rec( pObj ) ) printf( "Nwk_ManRetimeVerifyCutForward(): Internal cut verification failed.\n" ); // unmark the nodes Vec_PtrForEachEntry( Nwk_Obj_t *, vNodes, pObj, i ) pObj->MarkA = 0; return 1; } /**Function************************************************************* Synopsis [Verifies the forward cut.] Description [] SideEffects [] SeeAlso [] ***********************************************************************/ int Nwk_ManRetimeVerifyCutBackward( Nwk_Man_t * pMan, Vec_Ptr_t * vNodes ) { return 1; } /**Function************************************************************* Synopsis [Computes minimum cut for forward retiming.] Description [] SideEffects [] SeeAlso [] ***********************************************************************/ Vec_Ptr_t * Nwk_ManRetimeCutForward( Nwk_Man_t * pMan, int nLatches, int fVerbose ) { Vec_Ptr_t * vNodes; Nwk_Obj_t * pObj; int i, RetValue, Counter = 0, Counter2 = 0; clock_t clk = clock(); // set the sequential parameters pMan->nLatches = nLatches; pMan->nTruePis = Nwk_ManCiNum(pMan) - nLatches; pMan->nTruePos = Nwk_ManCoNum(pMan) - nLatches; // mark the COs and the TFO of PIs Nwk_ManForEachCo( pMan, pObj, i ) pObj->MarkA = 1; Nwk_ManForEachPiSeq( pMan, pObj, i ) Nwk_ManMarkTfoCone_rec( pObj ); // start flow computation from each LO Nwk_ManIncrementTravIdFlow( pMan ); Nwk_ManForEachLoSeq( pMan, pObj, i ) { if ( !Nwk_ManPushForwardFast_rec( pObj, NULL ) ) continue; Nwk_ManIncrementTravIdFlow( pMan ); Counter++; } if ( fVerbose ) printf( "Forward: Max-flow = %4d -> ", Counter ); // continue flow computation from each LO DepthFwdMax = DepthFwd = 0; Nwk_ManIncrementTravIdFlow( pMan ); Nwk_ManForEachLoSeq( pMan, pObj, i ) { printf( "%d ", DepthFwdMax ); if ( !Nwk_ManPushForwardBot_rec( pObj, NULL ) ) continue; assert( DepthFwd == 0 ); Nwk_ManIncrementTravIdFlow( pMan ); Counter2++; } printf( "DepthMax = %d.\n", DepthFwdMax ); if ( fVerbose ) printf( "%4d. ", Counter+Counter2 ); // repeat flow computation from each LO if ( Counter2 > 0 ) { Nwk_ManIncrementTravIdFlow( pMan ); Nwk_ManForEachLoSeq( pMan, pObj, i ) { RetValue = Nwk_ManPushForwardBot_rec( pObj, NULL ); assert( !RetValue ); } } // cut is a set of nodes whose bottom is visited but top is not visited vNodes = Vec_PtrAlloc( Counter+Counter2 ); Counter = 0; Nwk_ManForEachObj( pMan, pObj, i ) { if ( Nwk_ObjVisitedBotOnly(pObj) ) { assert( Nwk_ObjHasFlow(pObj) ); assert( !Nwk_ObjIsCo(pObj) ); Vec_PtrPush( vNodes, pObj ); Counter += Nwk_ObjIsCi(pObj); } } Nwk_ManCleanMarks( pMan ); assert( Nwk_ManRetimeVerifyCutForward(pMan, vNodes) ); if ( fVerbose ) { printf( "Min-cut = %4d. Unmoved = %4d. ", Vec_PtrSize(vNodes), Counter ); PRT( "Time", clock() - clk ); } return vNodes; } /**Function************************************************************* Synopsis [Computes minimum cut for backward retiming.] Description [] SideEffects [] SeeAlso [] ***********************************************************************/ Vec_Ptr_t * Nwk_ManRetimeCutBackward( Nwk_Man_t * pMan, int nLatches, int fVerbose ) { Vec_Ptr_t * vNodes; Nwk_Obj_t * pObj; int i, RetValue, Counter = 0, Counter2 = 0; clock_t clk = clock(); // set the sequential parameters pMan->nLatches = nLatches; pMan->nTruePis = Nwk_ManCiNum(pMan) - nLatches; pMan->nTruePos = Nwk_ManCoNum(pMan) - nLatches; // mark the CIs, the TFI of POs, and the constant nodes Nwk_ManForEachCi( pMan, pObj, i ) pObj->MarkA = 1; Nwk_ManForEachPoSeq( pMan, pObj, i ) Nwk_ManMarkTfiCone_rec( pObj ); Nwk_ManForEachNode( pMan, pObj, i ) if ( Nwk_ObjFaninNum(pObj) == 0 ) pObj->MarkA = 1; // start flow computation from each LI driver Nwk_ManIncrementTravIdFlow( pMan ); Nwk_ManForEachLiSeq( pMan, pObj, i ) { if ( !Nwk_ManPushBackwardFast_rec( Nwk_ObjFanin0(pObj), NULL ) ) continue; Nwk_ManIncrementTravIdFlow( pMan ); Counter++; } if ( fVerbose ) printf( "Backward: Max-flow = %4d -> ", Counter ); // continue flow computation from each LI driver Nwk_ManIncrementTravIdFlow( pMan ); Nwk_ManForEachLiSeq( pMan, pObj, i ) { if ( !Nwk_ManPushBackwardBot_rec( Nwk_ObjFanin0(pObj), NULL ) ) continue; Nwk_ManIncrementTravIdFlow( pMan ); Counter2++; } if ( fVerbose ) printf( "%4d. ", Counter+Counter2 ); // repeat flow computation from each LI driver if ( Counter2 > 0 ) { Nwk_ManIncrementTravIdFlow( pMan ); Nwk_ManForEachLiSeq( pMan, pObj, i ) { RetValue = Nwk_ManPushBackwardBot_rec( Nwk_ObjFanin0(pObj), NULL ); assert( !RetValue ); } } // cut is a set of nodes whose bottom is visited but top is not visited vNodes = Vec_PtrAlloc( Counter+Counter2 ); Nwk_ManForEachObj( pMan, pObj, i ) { if ( Nwk_ObjVisitedBotOnly(pObj) ) { assert( Nwk_ObjHasFlow(pObj) ); assert( !Nwk_ObjIsCo(pObj) ); Vec_PtrPush( vNodes, pObj ); } } // count CO drivers Counter = 0; Nwk_ManForEachLiSeq( pMan, pObj, i ) if ( Nwk_ObjVisitedBotOnly( Nwk_ObjFanin0(pObj) ) ) Counter++; Nwk_ManCleanMarks( pMan ); assert( Nwk_ManRetimeVerifyCutBackward(pMan, vNodes) ); if ( fVerbose ) { printf( "Min-cut = %4d. Unmoved = %4d. ", Vec_PtrSize(vNodes), Counter ); PRT( "Time", clock() - clk ); } return vNodes; } //////////////////////////////////////////////////////////////////////// /// END OF FILE /// //////////////////////////////////////////////////////////////////////// ABC_NAMESPACE_IMPL_END