#include "base/abc/abc.h"
#include "base/io/ioAbc.h"

Include dependency graph for abcDebug.c:

Functions
void	Abc_NtkAutoDebug (Abc_Ntk_t pNtk, int(pFuncError)(Abc_Ntk_t *))
	FUNCTION DEFINITIONS ///.

int	Abc_NtkFindGivenFanin (Abc_Ntk_t pNtk, int Step, Abc_Obj_t ppObj, Abc_Obj_t *ppFanin)

Function Documentation

◆ Abc_NtkAutoDebug()

void Abc_NtkAutoDebug	(	Abc_Ntk_t *	pNtk,
		int(*	pFuncError )(Abc_Ntk_t *) )

FUNCTION DEFINITIONS ///.

Function*************************************************************

Synopsis [Takes a network and a procedure to test.]

Description [The network demonstrates the bug in the procedure. Procedure should return 1 if the bug is demonstrated.]

SideEffects []

SeeAlso []

Definition at line 50 of file abcDebug.c.

{
    Abc_Ntk_t * pNtkMod;
    char * pFileName = "bug_found.blif";
    int i, nSteps, nIter, ModNum, RandNum = 1;
    abctime clk, clkTotal = Abc_Clock();
    assert( Abc_NtkIsLogic(pNtk) );
    srand( 0x123123 );
    // create internal copy of the network
    pNtk = Abc_NtkDup(pNtk);
    if ( !(*pFuncError)( pNtk ) )
    {
        printf( "The original network does not cause the bug. Quitting.\n" );
        Abc_NtkDelete( pNtk );
        return;
    }
    // perform incremental modifications
    for ( nIter = 0; ; nIter++ )
    {
        clk = Abc_Clock();
        // count how many ways of modifying the network exists
        nSteps = 2 * Abc_NtkCountFaninsTotal(pNtk);
        // try modifying the network as many times
        RandNum ^= rand();
        for ( i = 0; i < nSteps; i++ )
        {
            // get the shifted number of bug
            ModNum = (i + RandNum) % nSteps;
            // get the modified network
            pNtkMod = Abc_NtkAutoDebugModify( pNtk, ModNum/2, ModNum%2 );
            // write the network
            Io_WriteBlifLogic( pNtk, "bug_temp.blif", 1 );   
            // check if the bug is still there
            if ( (*pFuncError)( pNtkMod ) ) // bug is still there
            {
                Abc_NtkDelete( pNtk );
                pNtk = pNtkMod;
                break;
            }
            else // no bug
                Abc_NtkDelete( pNtkMod );
        }
        printf( "Iter %6d : Latches = %6d. Nodes = %6d. Steps = %6d. Error step = %3d.  ", 
            nIter, Abc_NtkLatchNum(pNtk), Abc_NtkNodeNum(pNtk), nSteps, i );
        ABC_PRT( "Time", Abc_Clock() - clk );
        if ( i == nSteps ) // could not modify it while preserving the bug
            break;
    }
    // write out the final network
    Io_WriteBlifLogic( pNtk, pFileName, 1 );
    printf( "Final network written into file \"%s\". ", pFileName );
    ABC_PRT( "Total time", Abc_Clock() - clkTotal );
    Abc_NtkDelete( pNtk );
}

Here is the call graph for this function:

◆ Abc_NtkFindGivenFanin()

int Abc_NtkFindGivenFanin	(	Abc_Ntk_t *	pNtk,
		int	Step,
		Abc_Obj_t **	ppObj,
		Abc_Obj_t **	ppFanin )

Function*************************************************************

Synopsis [Returns the node and fanin to be modified.]

Description []