giaSort.c File Reference

#include "gia.h"

Include dependency graph for giaSort.c:

Go to the source code of this file.

Functions
void	minisat_sort (int *array, int size, int(*comp)(const void *, const void *))
void	minisat_sort2 (int *array, int size)
int *	Gia_SortGetTest (int nSize)
void	Gia_SortVerifySorted (int *pArray, int nSize)
void	Gia_SortTest ()
void	minisat_sort3 (float *array, int *perm, int size)
int *	Gia_SortFloats (float *pArray, int *pPerm, int nSize)

Function Documentation

Gia_SortFloats()

int * Gia_SortFloats	(	float *	pArray,
		int *	pPerm,
		int	nSize )

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

Synopsis [Sorts the array of floating point numbers.]

Description []

SideEffects []

SeeAlso []

Definition at line 251 of file giaSort.c.

{
    int i;
    if ( pPerm == NULL )
    {
        pPerm = ABC_ALLOC( int, nSize );
        for ( i = 0; i < nSize; i++ )
            pPerm[i] = i;
    }
    minisat_sort3( pArray, pPerm, nSize );
//    for ( i = 1; i < nSize; i++ )
//        assert( pArray[i-1] <= pArray[i] );
    return pPerm;
}

Here is the call graph for this function:

Here is the caller graph for this function:

Gia_SortGetTest()

int * Gia_SortGetTest

(

int

nSize

)

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

Synopsis [This is implementation of qsort in MiniSat.]

Description []

SideEffects []

SeeAlso []

Definition at line 144 of file giaSort.c.

{
    int i, * pArray;
    srand( 0 );
    pArray = ABC_ALLOC( int, nSize );
    for ( i = 0; i < nSize; i++ )
        pArray[i] = rand();
    return pArray;
}

Here is the caller graph for this function:

Gia_SortTest()

void Gia_SortTest

(

)

Definition at line 159 of file giaSort.c.

{
    int nSize = 100000000;
    int * pArray;
    abctime clk = Abc_Clock();
 
    printf( "Sorting %d integers\n", nSize );
    pArray = Gia_SortGetTest( nSize );
clk = Abc_Clock();
    qsort( pArray, (size_t)nSize, 4, (int (*)(const void *, const void *)) num_cmp1 );
ABC_PRT( "qsort  ", Abc_Clock() - clk );
    Gia_SortVerifySorted( pArray, nSize );
    ABC_FREE( pArray );
 
    pArray = Gia_SortGetTest( nSize );
clk = Abc_Clock();
    minisat_sort( pArray, nSize, (int (*)(const void *, const void *)) num_cmp2 );
ABC_PRT( "minisat", Abc_Clock() - clk );
    Gia_SortVerifySorted( pArray, nSize );
    ABC_FREE( pArray );
 
    pArray = Gia_SortGetTest( nSize );
clk = Abc_Clock();
    minisat_sort2( pArray, nSize );
ABC_PRT( "minisat with inlined comparison", Abc_Clock() - clk );
    Gia_SortVerifySorted( pArray, nSize );
    ABC_FREE( pArray );
}

Here is the call graph for this function:

Gia_SortVerifySorted()

void Gia_SortVerifySorted	(	int *	pArray,
		int	nSize )

Definition at line 153 of file giaSort.c.

{
    int i;
    for ( i = 1; i < nSize; i++ )
        assert( pArray[i-1] <= pArray[i] );
}

Here is the caller graph for this function:

minisat_sort()

void minisat_sort	(	int *	array,
		int	size,
		int(*	comp )(const void *, const void *) )

Definition at line 79 of file giaSort.c.

{
    sort_rec(array,size,comp);
}

Here is the caller graph for this function:

minisat_sort2()

void minisat_sort2	(	int *	array,
		int	size )

Definition at line 128 of file giaSort.c.

{
    sort_rec2(array,size);
}

Here is the caller graph for this function:

minisat_sort3()

void minisat_sort3	(	float *	array,
		int *	perm,
		int	size )

Definition at line 235 of file giaSort.c.

{
    sort_rec3(array, perm, size);
}

Here is the caller graph for this function: