abc/src/proof/acec/acecFadds.c
// for each FADD find the longest chain and reorder its inputs
for each FADD find the longest chain and reorder its inputs
for each FADD find the longest chain and reorder its inputs
void Gia_ManFindChains( Gia_Man_t * p, Vec_Int_t * vFadds, Vec_Int_t * vMap )
{
    int i;
    Vec_Int_t * vLength = Vec_IntStartFull( Gia_ManObjNum(p) );
    Dtc_ForEachFadd( vFadds, i )
        Gia_ManFindChains_rec( p, Vec_IntEntry(vFadds, 5*i+4), vFadds, vMap, vLength );
    Vec_IntFree( vLength );
}
void Gia_ManFindChains ( Gia_Man_t * p , Vec_Int_t * vFadds , Vec_Int_t * vMap ) { int i ; Vec_Int_t * vLength = Vec_IntStartFull ( Gia_ManObjNum ( p ) ) ; Dtc_ForEachFadd ( vFadds , i ) Gia_ManFindChains_rec ( p , Vec_IntEntry ( vFadds , 5 * i + 4 ) , vFadds , vMap , vLength ) ; Vec_IntFree ( vLength ) ; }
for each FADD find the longest chain and reorder its inputs
for each FADD find the longest chain and reorder its inputs
// for each FADD find the longest chain rooted in it