PoPs_private.h File Reference

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

Go to the source code of this file.

Classes
struct	unitsDB_s
struct	PoPs_s

Typedefs
typedef struct unitsDB_s	unitsDB
typedef struct PoPs_s	PoPs

Functions
int	PoPs_releasePrivate (statusMessageReporting *smr)
char const *	unitsDB_addUnitIfNeeded (statusMessageReporting *smr, char const *unit)
int	unitsDB_index (statusMessageReporting *smr, char const *unit)
char const *	unitsDB_stringFromIndex (statusMessageReporting *smr, int index)

Typedef Documentation

typedef struct PoPs_s PoPs

Definition at line 15 of file PoPs_private.h.

typedef struct unitsDB_s unitsDB

Definition at line 14 of file PoPs_private.h.

Function Documentation

int PoPs_releasePrivate

(

statusMessageReporting *

smr

)

Definition at line 98 of file PoPs.cc.

                                                      {

    int i;

    for( i = 0; i < popsRoot.numberOfParticles; i++ ) PoP_free( popsRoot.pops[i] );
    smr_freeMemory( (void **) &(popsRoot.pops) );
    popsRoot.sorted = NULL;
    popsRoot.numberOfParticles = 0;
    popsRoot.allocated = 0;
    unitsDB_release( );
    return( 0 );
}

Here is the call graph for this function:

Here is the caller graph for this function:

char const* unitsDB_addUnitIfNeeded	(	statusMessageReporting *	smr,
		char const *	unit
	)

Definition at line 700 of file PoPs.cc.

                                                                                     {

    int i;

    for( i = 0; i < unitsRoot.numberOfUnits; i++ ) {
        if( strcmp(  unit, unitsRoot.unsorted[i] ) == 0 ) return( unitsRoot.unsorted[i] );
    }
    if( unitsRoot.numberOfUnits == unitsRoot.allocated ) {
        int size = unitsRoot.allocated + 20;
        char const **unsorted = (char const **) smr_malloc2( smr, size * sizeof( char * ), 0, "unsorted" );

        if( unsorted == NULL ) return( NULL );
        for( i = 0; i < unitsRoot.numberOfUnits; i++ ) unsorted[i] = unitsRoot.unsorted[i];
        smr_freeMemory( (void **) &(unitsRoot.unsorted) );
        unitsRoot.unsorted = unsorted;
        unitsRoot.allocated = size;
    }
    if( ( unitsRoot.unsorted[unitsRoot.numberOfUnits] = smr_allocateCopyString2( smr, unit, "unitsRoot.unsorted[unitsRoot.numberOfUnits]" ) ) == NULL ) 
        return( NULL );
    unitsRoot.numberOfUnits++;
    return( unitsRoot.unsorted[unitsRoot.numberOfUnits - 1] );
}

Here is the call graph for this function:

Here is the caller graph for this function:

int unitsDB_index	(	statusMessageReporting *	smr,
		char const *	unit
	)

Definition at line 725 of file PoPs.cc.

                                                                  {

    int i;

    for( i = 0; i < unitsRoot.numberOfUnits; i++ ) {
        if( !strcmp( unit, unitsRoot.unsorted[i] ) ) return( i );
    }
    return( -1 );
}

char const* unitsDB_stringFromIndex	(	statusMessageReporting *	smr,
		int	index
	)

Definition at line 737 of file PoPs.cc.

                                                                              {

    if( ( index < 0 ) || ( index >= unitsRoot.numberOfUnits ) ) {
        smr_setReportError2( smr, PoPs_smr_ID, 1, "index = %d out of baounds [0 to %d)", index, unitsRoot.numberOfUnits );
        return( NULL );
    }
    return( unitsRoot.unsorted[index] );
}