abc_global.h File Reference

#include <time.h>
#include <stdarg.h>
#include <stdlib.h>
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include "abc_namespaces.h"

Include dependency graph for abc_global.h:

Go to the source code of this file.

Macros
#define	ABC_USE_BRIDGE
	INCLUDES ///.
#define	ABC_DLLIMPORT
#define	ABC_DLL   ABC_DLLIMPORT
#define	___unused
#define	ABC_CONST(number)
	PARAMETERS ///.
#define	ABC_INFINITY   (1000000000)
	MACRO DEFINITIONS ///.
#define	ABC_INT_MAX   (2147483647)
#define	ABC_SWAP(Type, a, b)
#define	ABC_PRT(a, t)
#define	ABC_PRTr(a, t)
#define	ABC_PRTn(a, t)
#define	ABC_PRTP(a, t, T)
#define	ABC_PRM(a, f)
#define	ABC_PRMr(a, f)
#define	ABC_PRMn(a, f)
#define	ABC_PRMP(a, f, F)
#define	ABC_ALLOC(type, num)
#define	ABC_CALLOC(type, num)
#define	ABC_FALLOC(type, num)
#define	ABC_FREE(obj)
#define	ABC_REALLOC(type, obj, num)
#define	APPLE_MACH   0
#define	APPLE_MACH   0
#define	BRIDGE_NETLIST   106
#define	BRIDGE_ABS_NETLIST   107

Typedefs
typedef ABC_UINT64_T	word
typedef ABC_INT64_T	iword
typedef ABC_INT64_T	abctime

Enumerations
enum	Abc_VerbLevel {   ABC_PROMPT = -2 , ABC_ERROR = -1 , ABC_WARNING = 0 , ABC_STANDARD = 1 ,   ABC_VERBOSE = 2 }

Functions
int	Gia_ManToBridgeText (FILE *pFile, int Size, unsigned char *pBuffer)
int	Gia_ManToBridgeAbsNetlist (FILE *pFile, void *p, int pkg_type)
char *	vnsprintf (const char *format, va_list args)
char *	nsprintf (const char *format,...)
void	Abc_MergeSort (int *pInput, int nSize)
int *	Abc_MergeSortCost (int *pCosts, int nSize)
void	Abc_MergeSortCost2 (int *pInput, int nSize, int *pCost)
void	Abc_MergeSortCost2Reverse (int *pInput, int nSize, int *pCost)
void	Abc_QuickSort1 (word *pData, int nSize, int fDecrease)
void	Abc_QuickSort2 (word *pData, int nSize, int fDecrease)
void	Abc_QuickSort3 (word *pData, int nSize, int fDecrease)
void	Abc_QuickSortCostData (int *pCosts, int nSize, int fDecrease, word *pData, int *pResult)
int *	Abc_QuickSortCost (int *pCosts, int nSize, int fDecrease)
unsigned	Abc_Random (int fReset)
word	Abc_RandomW (int fReset)
void	Util_ProcessThreads (int(*pUserFunc)(void *), void *vData, int nProcs, int TimeOut, int fVerbose)
	DECLARATIONS ///.

Macro Definition Documentation

___unused

#define ___unused

Definition at line 64 of file abc_global.h.

ABC_ALLOC

#define ABC_ALLOC	(		type,
			num )

Value:

((type *) malloc(sizeof(type) * (size_t)(num)))

Definition at line 264 of file abc_global.h.

ABC_CALLOC

#define ABC_CALLOC	(		type,
			num )

Value:

((type *) calloc((size_t)(num), sizeof(type)))

Definition at line 265 of file abc_global.h.

ABC_CONST

#define ABC_CONST

(

number

)

Value:

number

PARAMETERS ///.

BASIC TYPES /// Pointer difference type; replacement for ptrdiff_t. This is a signed integral type that is the same size as a pointer. NOTE: This type may be different sizes on different platforms. Unsigned integral type that can contain a pointer. This is an unsigned integral type that is the same size as a pointer. NOTE: This type may be different sizes on different platforms. Signed integral type that can contain a pointer. This is a signed integral type that is the same size as a pointer. NOTE: This type may be different sizes on different platforms. 64-bit signed integral type. 64-bit unsigned integral type.

Definition at line 240 of file abc_global.h.

ABC_DLL

#define ABC_DLL   ABC_DLLIMPORT

Definition at line 57 of file abc_global.h.

ABC_DLLIMPORT

#define ABC_DLLIMPORT

Definition at line 53 of file abc_global.h.

ABC_FALLOC

#define ABC_FALLOC	(		type,
			num )

Value:

((type *) memset(malloc(sizeof(type) * (size_t)(num)), 0xff, sizeof(type) * (size_t)(num)))

Definition at line 266 of file abc_global.h.

ABC_FREE

#define ABC_FREE

(

obj

)

Value:

((obj) ? (free((char *) (obj)), (obj) = 0) : 0)

Definition at line 267 of file abc_global.h.

ABC_INFINITY

#define ABC_INFINITY   (1000000000)

MACRO DEFINITIONS ///.

Definition at line 250 of file abc_global.h.

ABC_INT_MAX

#define ABC_INT_MAX   (2147483647)

Definition at line 251 of file abc_global.h.

ABC_PRM

#define ABC_PRM	(		a,
			f )

Value:

(Abc_Print(1, "%s =", (a)), Abc_Print(1, "%10.3f MB\n",    1.0*((double)(f))/(1<<20)))

Definition at line 259 of file abc_global.h.

ABC_PRMn

#define ABC_PRMn	(		a,
			f )

Value:

(Abc_Print(1, "%s =", (a)), Abc_Print(1, "%10.3f MB  ",    1.0*((double)(f))/(1<<20)))

Definition at line 261 of file abc_global.h.

ABC_PRMP

#define ABC_PRMP	(		a,
			f,
			F )

Value:

(Abc_Print(1, "%s =", (a)), Abc_Print(1, "%10.3f MB (%6.2f %%)\n",  (1.0*((double)(f))/(1<<20)), (((double)(F))? 100.0*((double)(f))/((double)(F)) : 0.0) ) )

Definition at line 262 of file abc_global.h.

ABC_PRMr

#define ABC_PRMr	(		a,
			f )

Value:

(Abc_Print(1, "%s =", (a)), Abc_Print(1, "%10.3f MB\r",    1.0*((double)(f))/(1<<20)))

Definition at line 260 of file abc_global.h.

ABC_PRT

#define ABC_PRT	(		a,
			t )

Value:

(Abc_Print(1, "%s =", (a)), Abc_Print(1, "%9.2f sec\n", 1.0*((double)(t))/((double)CLOCKS_PER_SEC)))

Definition at line 255 of file abc_global.h.

ABC_PRTn

#define ABC_PRTn	(		a,
			t )

Value:

(Abc_Print(1, "%s =", (a)), Abc_Print(1, "%9.2f sec  ", 1.0*((double)(t))/((double)CLOCKS_PER_SEC)))

Definition at line 257 of file abc_global.h.

ABC_PRTP

#define ABC_PRTP	(		a,
			t,
			T )

Value:

(Abc_Print(1, "%s =", (a)), Abc_Print(1, "%9.2f sec (%6.2f %%)\n", 1.0*((double)(t))/((double)CLOCKS_PER_SEC), ((double)(T))? 100.0*((double)(t))/((double)(T)) : 0.0))

Definition at line 258 of file abc_global.h.

ABC_PRTr

#define ABC_PRTr	(		a,
			t )

Value:

(Abc_Print(1, "%s =", (a)), Abc_Print(1, "%9.2f sec\r", 1.0*((double)(t))/((double)CLOCKS_PER_SEC)))

Definition at line 256 of file abc_global.h.

ABC_REALLOC

#define ABC_REALLOC	(		type,
			obj,
			num )

Value:

        ((obj) ? ((type *) realloc((char *)(obj), sizeof(type) * (size_t)(num))) : \
         ((type *) malloc(sizeof(type) * (size_t)(num))))

Definition at line 268 of file abc_global.h.

#define ABC_REALLOC(type, obj, num) \
        ((obj) ? ((type *) realloc((char *)(obj), sizeof(type) * (size_t)(num))) : \
         ((type *) malloc(sizeof(type) * (size_t)(num))))

ABC_SWAP

#define ABC_SWAP	(		Type,
			a,
			b )

Value:

{ Type t = a; a = b; b = t; }

Definition at line 253 of file abc_global.h.

ABC_USE_BRIDGE

#define ABC_USE_BRIDGE

INCLUDES ///.

CFile****************************************************************

FileName [abc_global.h]

SystemName [ABC: Logic synthesis and verification system.]

PackageName [Global declarations.]

Synopsis [Global declarations.]

Author [Alan Mishchenko]

Affiliation [UC Berkeley]

Date [Ver. 1.0. Started - Jan 30, 2009.]

Revision [

Id

abc_global.h,v 1.00 2009/01/30 00:00:00 alanmi Exp

]

Definition at line 29 of file abc_global.h.

APPLE_MACH [1/2]

#define APPLE_MACH   0

APPLE_MACH [2/2]

#define APPLE_MACH   0

BRIDGE_ABS_NETLIST

#define BRIDGE_ABS_NETLIST   107

Definition at line 387 of file abc_global.h.

BRIDGE_NETLIST

#define BRIDGE_NETLIST   106

Definition at line 386 of file abc_global.h.

Typedef Documentation

abctime

typedef ABC_INT64_T abctime

Definition at line 332 of file abc_global.h.

iword

typedef ABC_INT64_T iword

Definition at line 244 of file abc_global.h.

word

typedef ABC_UINT64_T word

Definition at line 243 of file abc_global.h.

Enumeration Type Documentation

Abc_VerbLevel

enum Abc_VerbLevel

Enumerator
ABC_PROMPT
ABC_ERROR
ABC_WARNING
ABC_STANDARD
ABC_VERBOSE

Definition at line 373 of file abc_global.h.

{
    ABC_PROMPT   = -2,
    ABC_ERROR    = -1,
    ABC_WARNING  =  0,
    ABC_STANDARD =  1,
    ABC_VERBOSE  =  2
};

Function Documentation

Abc_MergeSort()

void Abc_MergeSort ( int * pInput, int nSize )

extern

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

Synopsis [Returns the sorted array of integers.]

Description [This procedure is about 10% faster than qsort().]

SideEffects []

SeeAlso []

Definition at line 129 of file utilSort.c.

{
    int * pOutput;
    if ( nSize < 2 )
        return;
    pOutput = (int *) malloc( sizeof(int) * nSize );
    Abc_Sort_rec( pInput, pInput + nSize, pOutput );
    free( pOutput );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Abc_MergeSortCost()

int * Abc_MergeSortCost ( int * pCosts, int nSize )

extern

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

Synopsis [Sorting procedure.]

Description [Returns permutation for the non-decreasing order of costs.]

SideEffects []

SeeAlso []

Definition at line 442 of file utilSort.c.

{
    int i, * pResult, * pInput, * pOutput;
    pResult = (int *) calloc( sizeof(int), nSize );
    if ( nSize < 2 )
        return pResult;
    pInput  = (int *) malloc( sizeof(int) * 2 * nSize );
    pOutput = (int *) malloc( sizeof(int) * 2 * nSize );
    for ( i = 0; i < nSize; i++ )
        pInput[2*i] = i, pInput[2*i+1] = pCosts[i];
    Abc_MergeSortCost_rec( pInput, pInput + 2*nSize, pOutput );
    for ( i = 0; i < nSize; i++ )
        pResult[i] = pInput[2*i];
    free( pOutput );
    free( pInput );
    return pResult;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Abc_MergeSortCost2()

void Abc_MergeSortCost2 ( int * pInput, int nSize, int * pCost )

extern

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

Synopsis [Returns the sorted array of integers.]

Description [This procedure is about 10% faster than qsort().]

SideEffects []

SeeAlso []

Definition at line 231 of file utilSort.c.

{
    int * pOutput;
    if ( nSize < 2 )
        return;
    pOutput = (int *) malloc( sizeof(int) * nSize );
    Abc_SortCost2_rec( pInput, pInput + nSize, pOutput, pCost );
    free( pOutput );
}

Here is the call graph for this function:

Abc_MergeSortCost2Reverse()

void Abc_MergeSortCost2Reverse ( int * pInput, int nSize, int * pCost )

extern

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

Synopsis [Returns the sorted array of integers.]

Description [This procedure is about 10% faster than qsort().]

SideEffects []

SeeAlso []

Definition at line 333 of file utilSort.c.

{
    int * pOutput;
    if ( nSize < 2 )
        return;
    pOutput = (int *) malloc( sizeof(int) * nSize );
    Abc_SortCost2Reverse_rec( pInput, pInput + nSize, pOutput, pCost );
    free( pOutput );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Abc_QuickSort1()

void Abc_QuickSort1 ( word * pData, int nSize, int fDecrease )

extern

Definition at line 681 of file utilSort.c.

{
    int i, fVerify = 0;
    if ( fDecrease )
    {
        qsort( (void *)pData, (size_t)nSize, sizeof(word), (int (*)(const void *, const void *))Abc_QuickSort1CompareDec );
        if ( fVerify )
            for ( i = 1; i < nSize; i++ )
                assert( (unsigned)pData[i-1] >= (unsigned)pData[i] );
    }
    else
    {
        qsort( (void *)pData, (size_t)nSize, sizeof(word), (int (*)(const void *, const void *))Abc_QuickSort1CompareInc );
        if ( fVerify )
            for ( i = 1; i < nSize; i++ )
                assert( (unsigned)pData[i-1] <= (unsigned)pData[i] );
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

Abc_QuickSort2()

void Abc_QuickSort2 ( word * pData, int nSize, int fDecrease )

extern

Definition at line 866 of file utilSort.c.

{
    int i, fVerify = 0;
    if ( fDecrease )
    {
        Abc_QuickSort2Dec_rec( pData, 0, nSize - 1 );
        if ( fVerify )
            for ( i = 1; i < nSize; i++ )
                assert( (unsigned)pData[i-1] >= (unsigned)pData[i] );
    }
    else
    {
        Abc_QuickSort2Inc_rec( pData, 0, nSize - 1 );
        if ( fVerify )
            for ( i = 1; i < nSize; i++ )
                assert( (unsigned)pData[i-1] <= (unsigned)pData[i] );
    }
}

Here is the call graph for this function:

Abc_QuickSort3()

void Abc_QuickSort3 ( word * pData, int nSize, int fDecrease )

extern

Definition at line 884 of file utilSort.c.

{
    int i, fVerify = 1;
    if ( fDecrease )
    {
        Abc_QuickSort2Dec_rec( pData, 0, nSize - 1 );
        if ( fVerify )
            for ( i = 1; i < nSize; i++ )
                assert( (unsigned)pData[i-1] >= (unsigned)pData[i] );
    }
    else
    {
        Abc_QuickSort2Inc_rec( pData, 0, nSize - 1 );
        if ( fVerify )
            for ( i = 1; i < nSize; i++ )
                assert( (unsigned)pData[i-1] <= (unsigned)pData[i] );
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

Abc_QuickSortCost()

int * Abc_QuickSortCost ( int * pCosts, int nSize, int fDecrease )

extern

Definition at line 923 of file utilSort.c.

{
    word * pData = ABC_ALLOC( word, nSize );
    int * pResult = ABC_ALLOC( int, nSize );
    Abc_QuickSortCostData( pCosts, nSize, fDecrease, pData, pResult );
    ABC_FREE( pData );
    return pResult;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Abc_QuickSortCostData()

void Abc_QuickSortCostData ( int * pCosts, int nSize, int fDecrease, word * pData, int * pResult )

extern

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

Synopsis [Wrapper around QuickSort to sort entries based on cost.]

Description []

SideEffects []

SeeAlso []

Definition at line 914 of file utilSort.c.

{
    int i;
    for ( i = 0; i < nSize; i++ )
        pData[i] = ((word)i << 32) | pCosts[i];
    Abc_QuickSort3( pData, nSize, fDecrease );
    for ( i = 0; i < nSize; i++ )
        pResult[i] = (int)(pData[i] >> 32);
}

Here is the call graph for this function:

Here is the caller graph for this function:

Abc_Random()

unsigned Abc_Random ( int fReset )

extern

Definition at line 1004 of file utilSort.c.

{
#ifdef _MSC_VER
    static unsigned int m_z = NUMBER1;
    static unsigned int m_w = NUMBER2;
#else
    static __thread unsigned int m_z = NUMBER1;
    static __thread unsigned int m_w = NUMBER2;
#endif    
    if ( fReset )
    {
        m_z = NUMBER1;
        m_w = NUMBER2;
    }
    m_z = 36969 * (m_z & 65535) + (m_z >> 16);
    m_w = 18000 * (m_w & 65535) + (m_w >> 16);
    return (m_z << 16) + m_w;
}

Abc_RandomW()

word Abc_RandomW ( int fReset )

extern

Definition at line 1022 of file utilSort.c.

{
    return ((word)Abc_Random(fReset) << 32) | ((word)Abc_Random(fReset) << 0);
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManToBridgeAbsNetlist()

int Gia_ManToBridgeAbsNetlist ( FILE * pFile, void * p, int pkg_type )

extern

Definition at line 192 of file utilBridge.c.

{
    Vec_Str_t * vBuffer;
    vBuffer = Gia_ManToBridgeVec( (Gia_Man_t *)p );
    Gia_CreateHeader( pFile, pkg_type, Vec_StrSize(vBuffer), (unsigned char *)Vec_StrArray(vBuffer) );
    Vec_StrFree( vBuffer );
    return 1;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_ManToBridgeText()

int Gia_ManToBridgeText ( FILE * pFile, int Size, unsigned char * pBuffer )

extern

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 171 of file utilBridge.c.

{
    Gia_CreateHeader( pFile, BRIDGE_TEXT_MESSAGE, Size, pBuffer );
    return 1;
}

Here is the call graph for this function:

nsprintf()

char * nsprintf ( const char * format, ... )

extern

Definition at line 233 of file utilFile.c.

{
    char* ret;
    va_list args;
    va_start(args, format);
    ret = vnsprintf(format, args);
    va_end(args);
    return ret;
}

Here is the call graph for this function:

Util_ProcessThreads()

void Util_ProcessThreads ( int(* pUserFunc )(void *), void * vData, int nProcs, int TimeOut, int fVerbose )

extern

DECLARATIONS ///.

CFile****************************************************************

FileName [utilPth.c]

SystemName [ABC: Logic synthesis and verification system.]

PackageName [Generic interface to pthreads.]

Synopsis [Generic interface to pthreads.]

Author [Alan Mishchenko]

Affiliation [UC Berkeley]

Date [Ver. 1.0. Started - August 3, 2024.]

Revision [

Id

utilPth.c,v 1.00 2024/08/03 00:00:00 alanmi Exp

] FUNCTION DEFINITIONS /// Function*************************************************************

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 70 of file utilPth.c.

{
    void * pData; int i;
    Vec_PtrForEachEntry( void *, (Vec_Ptr_t *)vData, pData, i )
        pUserFunc( pData );
}

Here is the caller graph for this function:

vnsprintf()

char * vnsprintf ( const char * format, va_list args )

extern

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

Synopsis []

Description []

SideEffects []

SeeAlso [] Function*************************************************************

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 196 of file utilFile.c.

{
    unsigned n;
    char*    ret;
    va_list  args_copy;
 
    static FILE* dummy_file = NULL;
    if (!dummy_file)
    {
#if !defined(_MSC_VER) && !defined(__MINGW32)
        dummy_file = fopen("/dev/null", "wb");
#else
        dummy_file = fopen("NUL", "wb");
#endif
    }
 
#if defined(__va_copy)
    __va_copy(args_copy, args);
#else
  #if defined(va_copy)
    va_copy(args_copy, args);
  #else
    args_copy = args;
  #endif
#endif
    n = vfprintf(dummy_file, format, args);
    ret = ABC_ALLOC( char, n + 1 );
    ret[n] = (char)255;
    args = args_copy;
    vsprintf(ret, format, args);
#if !defined(__va_copy) && defined(va_copy)
    va_end(args_copy);
#endif
    assert(ret[n] == 0);
    return ret;
}

Here is the caller graph for this function: