dauCount.c File Reference

#include "dauInt.h"

Include dependency graph for dauCount.c:

Go to the source code of this file.

Functions
void	Abc_TtCountGenerate ()
	FUNCTION DEFINITIONS ///.
int	Abc_TtCountOnesInCofsQuick_rec (word *pTruth, int nVars, int *pStore)
int	Abc_TtCountOnesInCofsQuick (word *pTruth, int nVars, int *pStore)
void	Abc_TtCountOnesInCofsTest2 ()
void	Abc_TtCountOnesInCofsTest ()

Function Documentation

Abc_TtCountGenerate()

void Abc_TtCountGenerate

(

)

FUNCTION DEFINITIONS ///.

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 305 of file dauCount.c.

{
    static word s_CMasks6[3] = {
        ABC_CONST(0x5555555555555555),
        ABC_CONST(0x3333333333333333),
        ABC_CONST(0x0F0F0F0F0F0F0F0F)
    };
    static int bit_count[256] = {
      0,1,1,2,1,2,2,3,1,2,2,3,2,3,3,4,1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,
      1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,
      1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,
      2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,
      1,2,2,3,2,3,3,4,2,3,3,4,3,4,4,5,2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,
      2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,
      2,3,3,4,3,4,4,5,3,4,4,5,4,5,5,6,3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,
      3,4,4,5,4,5,5,6,4,5,5,6,5,6,6,7,4,5,5,6,5,6,6,7,5,6,6,7,6,7,7,8
    };
    int i, k, c;
    printf("{ ");
    for ( i = 0; i < 256; i++, printf(" },\n{ ") )
    for ( k = 0; k <  32; k++ )
    {
        printf( "ABC_CONST(0x0%d", bit_count[i] );
        for ( c = 3; c >= 0; c-- )
            printf( "0%d", (((k >> c) & 1) == 0) * bit_count[i]  );
        for ( c = 2; c >= 0; c-- )
            printf( "0%d", bit_count[s_CMasks6[c] & i] );
        printf( ")%s", k == 31 ? "":", " );
    }
}

Abc_TtCountOnesInCofsQuick()

int Abc_TtCountOnesInCofsQuick	(	word *	pTruth,
		int	nVars,
		int *	pStore )

Definition at line 376 of file dauCount.c.

{
    if ( nVars == 0 )
        return (int)(pTruth[0] & 1);
    memset( pStore, 0, sizeof(int)*nVars );
    return Abc_TtCountOnesInCofsQuick_rec( pTruth, nVars, pStore );
}

Here is the call graph for this function:

Here is the caller graph for this function:

Abc_TtCountOnesInCofsQuick_rec()

int Abc_TtCountOnesInCofsQuick_rec	(	word *	pTruth,
		int	nVars,
		int *	pStore )

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 347 of file dauCount.c.

{
    if ( nVars <= 8 )
    {
        word Res = 0;
        unsigned char * pResC = (unsigned char *)&Res;
        unsigned char * pTruthC = (unsigned char *)pTruth;
        int i, nBytes = nVars <= 6 ? 4 : 1 << (nVars-4), nBytes2 = nBytes << 1;
        assert( nVars >= 1 && nVars <= 8 );
        for ( i = 0; i < nBytes; i++ )
            Res += Table[pTruthC[i]][i];
        if ( nVars == 8 )
            pStore[7] += pResC[7];
        for (      ; i < nBytes2; i++ )
            Res += Table[pTruthC[i]][i];
        for ( i = 0; i < nVars-1; i++ )
            pStore[i] += pResC[i];
        if ( nVars < 8 )
            pStore[nVars-1] += pResC[nVars-1];
        return (int)pResC[7];
    }
    else
    {
        int Res1 = Abc_TtCountOnesInCofsQuick_rec( pTruth,                    nVars-1, pStore );
        int Res2 = Abc_TtCountOnesInCofsQuick_rec( pTruth + (1 << (nVars-7)), nVars-1, pStore );
        pStore[nVars-1] = Res1;
        return Res1 + Res2;
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

Abc_TtCountOnesInCofsTest()

void Abc_TtCountOnesInCofsTest

(

)

Definition at line 410 of file dauCount.c.

{
    word Truth[4] = {0};
    int Store1[8] = {0}, Store2[8] = {0};
    int n, i, k, Res1, Res2;
    srand( time(NULL) );
    for ( n = 0; n < 1000000; n++ )
    {
        for ( i = 0; i < 4; i++ )
        for ( k = 0; k < 8; k++ )
            Truth[i] ^= (word)(rand() & 0xFF) << (k << 3);
        Res1 = Abc_TtCountOnesInCofsSimple( Truth, 8, Store1 );
        Res2 = Abc_TtCountOnesInCofsQuick( Truth, 8, Store2 );
        assert( Res1 == Res2 );
        for ( i = 0; i < 8; i++ )
            assert( Store1[i] == Store2[i] );
    }
}

Here is the call graph for this function:

Abc_TtCountOnesInCofsTest2()

void Abc_TtCountOnesInCofsTest2

(

)

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

Synopsis []

Description []

SideEffects []

SeeAlso []

Definition at line 396 of file dauCount.c.

{
    word Truth = ABC_CONST(0x5555555555555555) & ABC_CONST(0x3333333333333333);
 
    int Store1[8] = {0}, Store2[8] = {0};
    int i, Res1, Res2;
 
    Res1 = Abc_TtCountOnesInCofsSimple( &Truth, 2, Store1 );
    Res2 = Abc_TtCountOnesInCofsQuick( &Truth, 2, Store2 );
    assert( Res1 == Res2 );
    for ( i = 0; i < 8; i++ )
        assert( Store1[i] == Store2[i] );
 
}

Here is the call graph for this function: