abc/src/proof/acec/acecFadds.c
// prints chains beginning in majority nodes contained in vTops
prints chains beginning in majority nodes contained in vTops
prints chains beginning in majority nodes contained in vTops
void Gia_ManPrintChains( Gia_Man_t * p, Vec_Int_t * vFadds, Vec_Int_t * vMap, Vec_Wec_t * vChains )
{
    Vec_Int_t * vChain;
    int i, k, iFadd, Count = 0;
    Vec_WecForEachLevel( vChains, vChain, i )
    {
        Count += Vec_IntSize(vChain);
        if ( i < 10 )
        {
            printf( "Chain %4d : %4d    ", i, Vec_IntSize(vChain) );
            Vec_IntForEachEntry( vChain, iFadd, k )
            {
                printf( "%d(%d) ", iFadd, Vec_IntEntry(vFadds, 5*iFadd+4) );
                if ( k != Vec_IntSize(vChain) - 1 )
                    printf( "-> " );
                if ( k > 6 )
                {
                    printf( "..." );
                    break;
                }
            }
            printf( "\n" );
        }
        else if ( i == 10 )
            printf( "...\n" );
    }
    printf( "Total chains = %d. Total full-adders = %d.\n", Vec_WecSize(vChains), Count );
}
void Gia_ManPrintChains ( Gia_Man_t * p , Vec_Int_t * vFadds , Vec_Int_t * vMap , Vec_Wec_t * vChains ) { Vec_Int_t * vChain ; int i , k , iFadd , Count = 0 ; Vec_WecForEachLevel ( vChains , vChain , i ) { Count += Vec_IntSize ( vChain ) ; if ( i < 10 ) { printf ( " " , i , Vec_IntSize ( vChain ) ) ; Vec_IntForEachEntry ( vChain , iFadd , k ) { printf ( " " , iFadd , Vec_IntEntry ( vFadds , 5 * iFadd + 4 ) ) ; if ( k != Vec_IntSize ( vChain ) - 1 ) printf ( " " ) ; if ( k > 6 ) { printf ( " " ) ; break ; } } printf ( " \n " ) ; } else if ( i == 10 ) printf ( " \n " ) ; } printf ( " \n " , Vec_WecSize ( vChains ) , Count ) ; }
prints chains beginning in majority nodes contained in vTops
prints chains beginning in majority nodes contained in vTops