string_cache.h File Reference

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

Go to the source code of this file.

Data Structures
struct	STRING_CACHE
Functions
STRING_CACHE *	sc_new_string_cache (void)
long	sc_lookup_string (STRING_CACHE *sc, char *string)
long	sc_add_string (STRING_CACHE *sc, char *string)
int	sc_valid_id (STRING_CACHE *sc, long string_id)
void *	sc_do_alloc (long, long)
void	sc_free_string_cache (STRING_CACHE *sc)

---

Function Documentation

long sc_add_string	(	STRING_CACHE *	sc,
		char *	string
	)

Definition at line 84 of file string_cache.c.

{
    long i;
    long hash;
    void *a;

    i = sc_lookup_string(sc, string);
    if(i >= 0)
                return i;
    if(sc->free >= sc->size)
        {
            sc->size = sc->size * 2 + 10;

            a = sc_do_alloc(sc->size, sizeof(char *));
            if(sc->free > 0)
                memcpy(a, sc->string, sc->free * sizeof(char *));
            free(sc->string);
            sc->string = (char **)a;

            a = sc_do_alloc(sc->size, sizeof(void *));
            if(sc->free > 0)
                memcpy(a, sc->data, sc->free * sizeof(void *));
            free(sc->data);
            sc->data = (void **)a;

            generate_sc_hash(sc);
        }
    i = sc->free;
    sc->free++;
    sc->string[i] = strdup(string);
    sc->data[i] = NULL;
    hash = string_hash(sc, string) % sc->string_hash_size;
    sc->next_string[i] = sc->string_hash[hash];
    sc->string_hash[hash] = i;
    return i;
}

Here is the call graph for this function:

Here is the caller graph for this function:

void* sc_do_alloc	(	long	,
		long
	)

Definition at line 134 of file string_cache.c.

{
    void *r;

    if(a < 1)
        a = 1;
    if(b < 1)
        b = 1;
    r = calloc(a, b);
    while(r == NULL)
        {
            fprintf(stderr,
                    "Failed to allocated %ld chunks of %ld bytes (%ld bytes total)\n",
                    a, b, a * b);
            sleep(1);
            r = calloc(a, b);
        }
    return r;
}

Here is the caller graph for this function:

void sc_free_string_cache

(

STRING_CACHE *

sc

)

Definition at line 156 of file string_cache.c.

{
    long i;

    if(sc == NULL)
        return;
    for(i = 0; i < sc->free; i++)
        if (sc->string != NULL)
            free(sc->string[i]);
    free(sc->string);
    sc->string = NULL;
    if(sc->data != NULL)
        {
//          free(sc->data);
            sc->data = NULL;
        }
    if(sc->string_hash != NULL)
        {
            free(sc->string_hash);
            sc->string_hash = NULL;
        }
    if(sc->next_string != NULL)
        {
            free(sc->next_string);
            sc->next_string = NULL;
        }
    free(sc);
}

Here is the caller graph for this function:

long sc_lookup_string	(	STRING_CACHE *	sc,
		char *	string
	)

Definition at line 67 of file string_cache.c.

{
    long i, hash;

    hash = string_hash(sc, string) % sc->string_hash_size;
    i = sc->string_hash[hash];
    while(i >= 0)
        {
            if(!strcmp(sc->string[i], string))
                return i;
            i = sc->next_string[i];
        }
    return -1;
}

Here is the call graph for this function:

Here is the caller graph for this function:

STRING_CACHE* sc_new_string_cache

(

void

)

Definition at line 48 of file string_cache.c.

{
    STRING_CACHE *sc;

    sc = (STRING_CACHE *)sc_do_alloc(1, sizeof(STRING_CACHE));
    sc->size = 100;
    sc->string_hash_size = 0;
    sc->string_hash = NULL;
    sc->next_string = NULL;
    sc->free = 0;
    sc->string = (char **)sc_do_alloc(sc->size, sizeof(char *));
    sc->data = (void **)sc_do_alloc(sc->size, sizeof(void *));
    sc->mod = 834535547;
    sc->mul = 247999;
    generate_sc_hash(sc);
    return sc;
}

Here is the call graph for this function:

Here is the caller graph for this function:

int sc_valid_id	(	STRING_CACHE *	sc,
		long	string_id
	)

Definition at line 123 of file string_cache.c.

{
    if(string_id < 0)
        return 0;
    if(string_id >= sc->free)
        return 0;
    return 1;
}