lucky.h File Reference

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
struct	permInfo

Functions
unsigned	Kit_TruthSemiCanonicize_new (unsigned *pInOut, unsigned *pAux, int nVars, char *pCanonPerm)
unsigned	luckyCanonicizer_final_fast (word *pInOut, int nVars, char *pCanonPerm)
unsigned	luckyCanonicizer_final_fast1 (word *pInOut, int nVars, char *pCanonPerm)
void	resetPCanonPermArray (char *x, int nVars)
permInfo *	setPermInfoPtr (int var)
void	freePermInfoPtr (permInfo *x)
void	simpleMinimal (word *x, word *pAux, word *minimal, permInfo *pi, int nVars)

Function Documentation

freePermInfoPtr()

void freePermInfoPtr ( permInfo * x )

extern

Definition at line 126 of file luckySimple.c.

{
    free(x->flipArray);
    free(x->swapArray);
    free(x);
}

Here is the call graph for this function:

Here is the caller graph for this function:

Kit_TruthSemiCanonicize_new()

unsigned Kit_TruthSemiCanonicize_new ( unsigned * pInOut, unsigned * pAux, int nVars, char * pCanonPerm )

extern

Definition at line 611 of file lucky.c.

{
    unsigned Result;
    if ( nVars < 6 )
    {
         word Temp = ((word)pInOut[0] << 32) | (word)pInOut[0];
         Result = Kit_TruthSemiCanonicize_new_internal( &Temp, nVars, pCanonPerm );
         pInOut[0] = (unsigned)Temp;
    }
    else
         Result = Kit_TruthSemiCanonicize_new_internal( (word *)pInOut, nVars, pCanonPerm );
    return Result;
}

Here is the call graph for this function:

luckyCanonicizer_final_fast()

unsigned luckyCanonicizer_final_fast ( word * pInOut, int nVars, char * pCanonPerm )

extern

Definition at line 818 of file luckyFast16.c.

{
    int nWords;
    int pStore[16];
    unsigned uCanonPhase = 0;
#ifdef LUCKY_VERIFY
    word temp[1024] = {0};
    word duplicate[1024] = {0};
    Kit_TruthCopy_64bit( duplicate, pInOut, nVars );
#endif
    if ( nVars <= 6 )
        pInOut[0] = luckyCanonicizer_final_fast_6Vars( pInOut[0], pStore, pCanonPerm, &uCanonPhase);
    else if ( nVars <= 16 )
    {
        nWords = (nVars <= 6) ? 1 : (1 << (nVars - 6));
        luckyCanonicizer_final_fast_16Vars( pInOut, nVars, nWords, pStore, pCanonPerm, &uCanonPhase );
    }
    else assert( 0 );
#ifdef LUCKY_VERIFY
    Kit_TruthCopy_64bit( temp, pInOut, nVars );
    assert( ! luckyCheck(temp, duplicate, nVars, pCanonPerm, uCanonPhase) );
#endif
        return uCanonPhase;
}

Here is the call graph for this function:

Here is the caller graph for this function:

luckyCanonicizer_final_fast1()

unsigned luckyCanonicizer_final_fast1 ( word * pInOut, int nVars, char * pCanonPerm )

extern

Definition at line 843 of file luckyFast16.c.

{
    int nWords;
    int pStore[16];
    unsigned uCanonPhase = 0;
#ifdef LUCKY_VERIFY
    word temp[1024] = {0};
    word duplicate[1024] = {0};
    Kit_TruthCopy_64bit( duplicate, pInOut, nVars );
#endif
    if ( nVars <= 6 )
        pInOut[0] = luckyCanonicizer_final_fast_6Vars1( pInOut[0], pStore, pCanonPerm, &uCanonPhase);
    else if ( nVars <= 16 )
    {
        nWords = 1 << (nVars - 6);
        luckyCanonicizer_final_fast_16Vars1( pInOut, nVars, nWords, pStore, pCanonPerm, &uCanonPhase );
    }
    else assert( 0 );
#ifdef LUCKY_VERIFY
    Kit_TruthCopy_64bit( temp, pInOut, nVars );
    assert( ! luckyCheck(temp, duplicate, nVars, pCanonPerm, uCanonPhase) );
#endif
    return uCanonPhase;
}

Here is the call graph for this function:

Here is the caller graph for this function:

resetPCanonPermArray()

void resetPCanonPermArray ( char * x, int nVars )

extern

Definition at line 30 of file luckyFast6.c.

{
    int i;
    for(i=0;i<nVars;i++)
        x[i] = 'a'+i;
}

Here is the caller graph for this function:

setPermInfoPtr()

permInfo * setPermInfoPtr ( int var )

extern

Definition at line 110 of file luckySimple.c.

{
    permInfo* x;
    x = (permInfo*) malloc(sizeof(permInfo));
    x->flipCtr=0;
    x->varN = var; 
    x->totalFlips=(1<<var)-1;
    x->swapCtr=0;
    x->totalSwaps=factorial(var)-1;
    x->flipArray = (int*) malloc(sizeof(int)*x->totalFlips);
    x->swapArray = (int*) malloc(sizeof(int)*x->totalSwaps);
    fillInSwapArray(x);
    fillInFlipArray(x);
    return x;
}

Here is the call graph for this function:

Here is the caller graph for this function:

simpleMinimal()

void simpleMinimal ( word * x, word * pAux, word * minimal, permInfo * pi, int nVars )

extern

Definition at line 156 of file luckySimple.c.

{
    int i,j=0;
    Kit_TruthCopy_64bit( pAux, x, nVars );
    Kit_TruthNot_64bit( x, nVars );
    
    minWord(x, pAux, minimal, nVars);
    
    for(i=pi->totalSwaps-1;i>=0;i--)
    {
        Kit_TruthSwapAdjacentVars_64bit(x, nVars, pi->swapArray[i]);
        Kit_TruthSwapAdjacentVars_64bit(pAux, nVars, pi->swapArray[i]);
        minWord3(x, pAux, minimal, nVars);
    }
    for(j=pi->totalFlips-1;j>=0;j--)
    {
        Kit_TruthSwapAdjacentVars_64bit(x, nVars, 0);
        Kit_TruthSwapAdjacentVars_64bit(pAux, nVars, 0);
        Kit_TruthChangePhase_64bit(x, nVars, pi->flipArray[j]);
        Kit_TruthChangePhase_64bit(pAux, nVars, pi->flipArray[j]);
        minWord3(x, pAux, minimal, nVars);
        for(i=pi->totalSwaps-1;i>=0;i--)
        {
            Kit_TruthSwapAdjacentVars_64bit(x, nVars, pi->swapArray[i]);
            Kit_TruthSwapAdjacentVars_64bit(pAux, nVars, pi->swapArray[i]);
            minWord3(x, pAux, minimal, nVars);
        }
    } 
    Kit_TruthCopy_64bit( x, minimal, nVars );    
}

Here is the call graph for this function:

Here is the caller graph for this function: