dict.c File Reference

#include "libxml.h"
#include <limits.h>
#include <stdlib.h>
#include <time.h>
#include <string.h>
#include <stdint.h>
#include <libxml/tree.h>
#include <libxml/dict.h>
#include <libxml/xmlmemory.h>
#include <libxml/xmlerror.h>
#include <libxml/globals.h>
#include "elfgcchack.h"

Include dependency graph for dict.c:

Go to the source code of this file.

Classes
struct	_xmlDictEntry
struct	_xmlDictStrings
struct	_xmlDict

Macros
#define	IN_LIBXML
#define	DICT_RANDOMIZATION
#define	MAX_HASH_LEN   3
#define	MIN_DICT_SIZE   128
#define	MAX_DICT_HASH   8 * 2048
#define	WITH_BIG_KEY
#define	xmlDictComputeKey(dict, name, len)
#define	xmlDictComputeQKey(dict, prefix, plen, name, len)

Typedefs
typedef struct _xmlDictEntry	xmlDictEntry
typedef xmlDictEntry *	xmlDictEntryPtr
typedef struct _xmlDictStrings	xmlDictStrings
typedef xmlDictStrings *	xmlDictStringsPtr

Functions
int	xmlInitializeDict (void)
int	__xmlInitializeDict (void)
int	__xmlRandom (void)
void	xmlDictCleanup (void)
static const xmlChar *	xmlDictAddString (xmlDictPtr dict, const xmlChar *name, unsigned int namelen)
static const xmlChar *	xmlDictAddQString (xmlDictPtr dict, const xmlChar *prefix, unsigned int plen, const xmlChar *name, unsigned int namelen)
static uint32_t	xmlDictComputeBigKey (const xmlChar *data, int namelen, int seed)
static unsigned long	xmlDictComputeBigQKey (const xmlChar *prefix, int plen, const xmlChar *name, int len, int seed)
static unsigned long	xmlDictComputeFastKey (const xmlChar *name, int namelen, int seed)
static unsigned long	xmlDictComputeFastQKey (const xmlChar *prefix, int plen, const xmlChar *name, int len, int seed)
xmlDictPtr	xmlDictCreate (void)
xmlDictPtr	xmlDictCreateSub (xmlDictPtr sub)
int	xmlDictReference (xmlDictPtr dict)
static int	xmlDictGrow (xmlDictPtr dict, size_t size)
void	xmlDictFree (xmlDictPtr dict)
to the dictionary @dict if not present.
Returns the internal copy of the name or NULL in case of internal error
const xmlChar *	xmlDictLookup (xmlDictPtr dict, const xmlChar *name, int len)
exists in the dictionary @dict.
Returns the internal copy of the name or NULL if not found.
const xmlChar *	xmlDictExists (xmlDictPtr dict, const xmlChar *name, int len)

Variables
static xmlRMutexPtr	xmlDictMutex = NULL
static int	xmlDictInitialized = 0

to the hash @dict if not present.
Returns the internal copy of the QName or NULL in case of internal error
#define	bottom_dict
const xmlChar *	xmlDictQLookup (xmlDictPtr dict, const xmlChar *prefix, const xmlChar *name)
int	xmlDictOwns (xmlDictPtr dict, const xmlChar *str)
int	xmlDictSize (xmlDictPtr dict)
size_t	xmlDictSetLimit (xmlDictPtr dict, size_t limit)
size_t	xmlDictGetUsage (xmlDictPtr dict)

Macro Definition Documentation

bottom_dict

#define bottom_dict

Definition at line 1290 of file dict.c.

DICT_RANDOMIZATION

#define DICT_RANDOMIZATION

Definition at line 42 of file dict.c.

IN_LIBXML

#define IN_LIBXML

Definition at line 19 of file dict.c.

MAX_DICT_HASH

#define MAX_DICT_HASH   8 * 2048

Definition at line 66 of file dict.c.

MAX_HASH_LEN

#define MAX_HASH_LEN   3

Definition at line 64 of file dict.c.

MIN_DICT_SIZE

#define MIN_DICT_SIZE   128

Definition at line 65 of file dict.c.

WITH_BIG_KEY

#define WITH_BIG_KEY

Definition at line 67 of file dict.c.

xmlDictComputeKey

#define xmlDictComputeKey	(		dict,
			name,
			len
	)

Value:

(((dict)->size == MIN_DICT_SIZE) ?                                  \
     xmlDictComputeFastKey(name, len, (dict)->seed) :                   \
     xmlDictComputeBigKey(name, len, (dict)->seed))

Definition at line 70 of file dict.c.

xmlDictComputeQKey

#define xmlDictComputeQKey	(		dict,
			prefix,
			plen,
			name,
			len
	)

Value:

(((prefix) == NULL) ?                                               \
      (xmlDictComputeKey(dict, name, len)) :                             \
      (((dict)->size == MIN_DICT_SIZE) ?                                \
       xmlDictComputeFastQKey(prefix, plen, name, len, (dict)->seed) :  \
       xmlDictComputeBigQKey(prefix, plen, name, len, (dict)->seed)))

Definition at line 75 of file dict.c.

Typedef Documentation

xmlDictEntry

typedef struct _xmlDictEntry xmlDictEntry

Definition at line 92 of file dict.c.

xmlDictEntryPtr

typedef xmlDictEntry* xmlDictEntryPtr

Definition at line 93 of file dict.c.

xmlDictStrings

typedef struct _xmlDictStrings xmlDictStrings

Definition at line 102 of file dict.c.

xmlDictStringsPtr

typedef xmlDictStrings* xmlDictStringsPtr

Definition at line 103 of file dict.c.

Function Documentation

__xmlInitializeDict()

int __xmlInitializeDict

(

void

)

__xmlInitializeDict:

This function is not public Do the dictionary mutex initialization. this function is not thread safe, initialization should normally be done once at setup when called from xmlOnceInit() we may also land in this code if thread support is not compiled in

Returns 0 if initialization was already done, and 1 if that call led to the initialization

Definition at line 175 of file dict.c.

                              {
    if (xmlDictInitialized)
        return(1);

    if ((xmlDictMutex = xmlNewRMutex()) == NULL)
        return(0);
    xmlRMutexLock(xmlDictMutex);

#ifdef DICT_RANDOMIZATION
#ifdef HAVE_RAND_R
    rand_seed = time(NULL);
    rand_r(& rand_seed);
#else
    srand(time(NULL));
#endif
#endif
    xmlDictInitialized = 1;
    xmlRMutexUnlock(xmlDictMutex);
    return(1);
}

Referenced by __xmlRandom(), xmlDictCreate(), xmlDictFree(), and xmlDictReference().

__xmlRandom()

int __xmlRandom

(

void

)

Definition at line 197 of file dict.c.

                      {
    int ret;

    if (xmlDictInitialized == 0)
        __xmlInitializeDict();

    xmlRMutexLock(xmlDictMutex);
#ifdef HAVE_RAND_R
    ret = rand_r(& rand_seed);
#else
    ret = rand();
#endif
    xmlRMutexUnlock(xmlDictMutex);
    return(ret);
}

Referenced by xmlDictCreate(), and xmlHashCreate().

xmlDictAddQString()

static const xmlChar* xmlDictAddQString ( xmlDictPtr  dict, const xmlChar *  prefix, unsigned int  plen, const xmlChar *  name, unsigned int  namelen  )

static

Definition at line 305 of file dict.c.

{
    xmlDictStringsPtr pool;
    const xmlChar *ret;
    size_t size = 0; /* + sizeof(_xmlDictStrings) == 1024 */
    size_t limit = 0;

    if (prefix == NULL) return(xmlDictAddString(dict, name, namelen));

#ifdef DICT_DEBUG_PATTERNS
    fprintf(stderr, "=");
#endif
    pool = dict->strings;
    while (pool != NULL) {
    if ((size_t)(pool->end - pool->free) > namelen + plen + 1)
        goto found_pool;
    if (pool->size > size) size = pool->size;
        limit += pool->size;
    pool = pool->next;
    }
    /*
     * Not found, need to allocate
     */
    if (pool == NULL) {
        if ((dict->limit > 0) && (limit > dict->limit)) {
            return(NULL);
        }

        if (size == 0) size = 1000;
    else size *= 4; /* exponential growth */
        if (size < 4 * (namelen + plen + 1))
        size = 4 * (namelen + plen + 1); /* just in case ! */
    pool = (xmlDictStringsPtr) xmlMalloc(sizeof(xmlDictStrings) + size);
    if (pool == NULL)
        return(NULL);
    pool->size = size;
    pool->nbStrings = 0;
    pool->free = &pool->array[0];
    pool->end = &pool->array[size];
    pool->next = dict->strings;
    dict->strings = pool;
#ifdef DICT_DEBUG_PATTERNS
        fprintf(stderr, "+");
#endif
    }
found_pool:
    ret = pool->free;
    memcpy(pool->free, prefix, plen);
    pool->free += plen;
    *(pool->free++) = ':';
    memcpy(pool->free, name, namelen);
    pool->free += namelen;
    *(pool->free++) = 0;
    pool->nbStrings++;
    return(ret);
}

Referenced by xmlDictQLookup().

xmlDictAddString()

static const xmlChar* xmlDictAddString ( xmlDictPtr  dict, const xmlChar *  name, unsigned int  namelen  )

static

Definition at line 241 of file dict.c.

                                                                             {
    xmlDictStringsPtr pool;
    const xmlChar *ret;
    size_t size = 0; /* + sizeof(_xmlDictStrings) == 1024 */
    size_t limit = 0;

#ifdef DICT_DEBUG_PATTERNS
    fprintf(stderr, "-");
#endif
    pool = dict->strings;
    while (pool != NULL) {
    if ((size_t)(pool->end - pool->free) > namelen)
        goto found_pool;
    if (pool->size > size) size = pool->size;
        limit += pool->size;
    pool = pool->next;
    }
    /*
     * Not found, need to allocate
     */
    if (pool == NULL) {
        if ((dict->limit > 0) && (limit > dict->limit)) {
            return(NULL);
        }

        if (size == 0) size = 1000;
    else size *= 4; /* exponential growth */
        if (size < 4 * namelen)
        size = 4 * namelen; /* just in case ! */
    pool = (xmlDictStringsPtr) xmlMalloc(sizeof(xmlDictStrings) + size);
    if (pool == NULL)
        return(NULL);
    pool->size = size;
    pool->nbStrings = 0;
    pool->free = &pool->array[0];
    pool->end = &pool->array[size];
    pool->next = dict->strings;
    dict->strings = pool;
#ifdef DICT_DEBUG_PATTERNS
        fprintf(stderr, "+");
#endif
    }
found_pool:
    ret = pool->free;
    memcpy(pool->free, name, namelen);
    pool->free += namelen;
    *(pool->free++) = 0;
    pool->nbStrings++;
    return(ret);
}

Referenced by xmlDictAddQString(), and xmlDictLookup().

xmlDictCleanup()

void xmlDictCleanup

(

void

)

xmlDictCleanup:

Free the dictionary mutex. Do not call unless sure the library is not in use anymore !

Definition at line 221 of file dict.c.

                     {
    if (!xmlDictInitialized)
        return;

    xmlFreeRMutex(xmlDictMutex);

    xmlDictInitialized = 0;
}

Referenced by xmlCleanupParser().

xmlDictComputeBigKey()

static uint32_t xmlDictComputeBigKey ( const xmlChar *  data, int  namelen, int  seed  )

static

Definition at line 375 of file dict.c.

                                                                 {
    uint32_t hash;
    int i;

    if (namelen <= 0 || data == NULL) return(0);

    hash = seed;

    for (i = 0;i < namelen; i++) {
        hash += data[i];
    hash += (hash << 10);
    hash ^= (hash >> 6);
    }
    hash += (hash << 3);
    hash ^= (hash >> 11);
    hash += (hash << 15);

    return hash;
}

xmlDictComputeBigQKey()

static unsigned long xmlDictComputeBigQKey ( const xmlChar *  prefix, int  plen, const xmlChar *  name, int  len, int  seed  )

static

Definition at line 407 of file dict.c.

{
    uint32_t hash;
    int i;

    hash = seed;

    for (i = 0;i < plen; i++) {
        hash += prefix[i];
    hash += (hash << 10);
    hash ^= (hash >> 6);
    }
    hash += ':';
    hash += (hash << 10);
    hash ^= (hash >> 6);

    for (i = 0;i < len; i++) {
        hash += name[i];
    hash += (hash << 10);
    hash ^= (hash >> 6);
    }
    hash += (hash << 3);
    hash ^= (hash >> 11);
    hash += (hash << 15);

    return hash;
}

xmlDictComputeFastKey()

static unsigned long xmlDictComputeFastKey ( const xmlChar *  name, int  namelen, int  seed  )

static

Definition at line 444 of file dict.c.

                                                                  {
    unsigned long value = seed;

    if (name == NULL) return(0);
    value = *name;
    value <<= 5;
    if (namelen > 10) {
        value += name[namelen - 1];
        namelen = 10;
    }
    switch (namelen) {
        case 10: value += name[9];
        /* Falls through. */
        case 9: value += name[8];
        /* Falls through. */
        case 8: value += name[7];
        /* Falls through. */
        case 7: value += name[6];
        /* Falls through. */
        case 6: value += name[5];
        /* Falls through. */
        case 5: value += name[4];
        /* Falls through. */
        case 4: value += name[3];
        /* Falls through. */
        case 3: value += name[2];
        /* Falls through. */
        case 2: value += name[1];
        /* Falls through. */
        default: break;
    }
    return(value);
}

xmlDictComputeFastQKey()

static unsigned long xmlDictComputeFastQKey ( const xmlChar *  prefix, int  plen, const xmlChar *  name, int  len, int  seed  )

static

Definition at line 487 of file dict.c.

{
    unsigned long value = (unsigned long) seed;

    if (plen == 0)
    value += 30 * (unsigned long) ':';
    else
    value += 30 * (*prefix);

    if (len > 10) {
        int offset = len - (plen + 1 + 1);
    if (offset < 0)
        offset = len - (10 + 1);
    value += name[offset];
        len = 10;
    if (plen > 10)
        plen = 10;
    }
    switch (plen) {
        case 10: value += prefix[9];
        /* Falls through. */
        case 9: value += prefix[8];
        /* Falls through. */
        case 8: value += prefix[7];
        /* Falls through. */
        case 7: value += prefix[6];
        /* Falls through. */
        case 6: value += prefix[5];
        /* Falls through. */
        case 5: value += prefix[4];
        /* Falls through. */
        case 4: value += prefix[3];
        /* Falls through. */
        case 3: value += prefix[2];
        /* Falls through. */
        case 2: value += prefix[1];
        /* Falls through. */
        case 1: value += prefix[0];
        /* Falls through. */
        default: break;
    }
    len -= plen;
    if (len > 0) {
        value += (unsigned long) ':';
    len--;
    }
    switch (len) {
        case 10: value += name[9];
        /* Falls through. */
        case 9: value += name[8];
        /* Falls through. */
        case 8: value += name[7];
        /* Falls through. */
        case 7: value += name[6];
        /* Falls through. */
        case 6: value += name[5];
        /* Falls through. */
        case 5: value += name[4];
        /* Falls through. */
        case 4: value += name[3];
        /* Falls through. */
        case 3: value += name[2];
        /* Falls through. */
        case 2: value += name[1];
        /* Falls through. */
        case 1: value += name[0];
        /* Falls through. */
        default: break;
    }
    return(value);
}

xmlDictCreate()

xmlDictPtr xmlDictCreate

(

void

)

xmlDictCreate:

Create a new dictionary

Returns the newly created dictionary, or NULL if an error occurred.

Definition at line 568 of file dict.c.

                    {
    xmlDictPtr dict;

    if (!xmlDictInitialized)
        if (!__xmlInitializeDict())
            return(NULL);

#ifdef DICT_DEBUG_PATTERNS
    fprintf(stderr, "C");
#endif

    dict = xmlMalloc(sizeof(xmlDict));
    if (dict) {
        dict->ref_counter = 1;
        dict->limit = 0;

        dict->size = MIN_DICT_SIZE;
    dict->nbElems = 0;
        dict->dict = xmlMalloc(MIN_DICT_SIZE * sizeof(xmlDictEntry));
    dict->strings = NULL;
    dict->subdict = NULL;
        if (dict->dict) {
        memset(dict->dict, 0, MIN_DICT_SIZE * sizeof(xmlDictEntry));
#ifdef DICT_RANDOMIZATION
            dict->seed = __xmlRandom();
#else
            dict->seed = 0;
#endif
        return(dict);
        }
        xmlFree(dict);
    }
    return(NULL);
}

Referenced by xmlDictCreateSub(), xmlInitParserCtxt(), and xsltNewStylesheet().

xmlDictCreateSub()

xmlDictPtr xmlDictCreateSub

(

xmlDictPtr

sub

)

xmlDictCreateSub: @sub: an existing dictionary

Create a new dictionary, inheriting strings from the read-only dictionary @sub. On lookup, strings are first searched in the new dictionary, then in @sub, and if not found are created in the new dictionary.

Returns the newly created dictionary, or NULL if an error occurred.

Definition at line 615 of file dict.c.

                                 {
    xmlDictPtr dict = xmlDictCreate();

    if ((dict != NULL) && (sub != NULL)) {
#ifdef DICT_DEBUG_PATTERNS
        fprintf(stderr, "R");
#endif
        dict->seed = sub->seed;
        dict->subdict = sub;
    xmlDictReference(dict->subdict);
    }
    return(dict);
}

Referenced by xsltNewTransformContext().

xmlDictExists()

const xmlChar* xmlDictExists	(	xmlDictPtr	dict,
		const xmlChar *	name,
		int	len
	)

Definition at line 998 of file dict.c.

                                                             {
    unsigned long key, okey, nbi = 0;
    xmlDictEntryPtr insert;
    unsigned int l;

    if ((dict == NULL) || (name == NULL))
    return(NULL);

    if (len < 0)
        l = strlen((const char *) name);
    else
        l = len;
    if (((dict->limit > 0) && (l >= dict->limit)) ||
        (l > INT_MAX / 2))
        return(NULL);

    /*
     * Check for duplicate and insertion location.
     */
    okey = xmlDictComputeKey(dict, name, l);
    key = okey % dict->size;
    if (dict->dict[key].valid == 0) {
    insert = NULL;
    } else {
    for (insert = &(dict->dict[key]); insert->next != NULL;
         insert = insert->next) {
#ifdef __GNUC__
        if ((insert->okey == okey) && (insert->len == l)) {
        if (!memcmp(insert->name, name, l))
            return(insert->name);
        }
#else
        if ((insert->okey == okey) && (insert->len == l) &&
            (!xmlStrncmp(insert->name, name, l)))
        return(insert->name);
#endif
        nbi++;
    }
#ifdef __GNUC__
    if ((insert->okey == okey) && (insert->len == l)) {
        if (!memcmp(insert->name, name, l))
        return(insert->name);
    }
#else
    if ((insert->okey == okey) && (insert->len == l) &&
        (!xmlStrncmp(insert->name, name, l)))
        return(insert->name);
#endif
    }

    if (dict->subdict) {
        unsigned long skey;

        /* we cannot always reuse the same okey for the subdict */
        if (((dict->size == MIN_DICT_SIZE) &&
         (dict->subdict->size != MIN_DICT_SIZE)) ||
            ((dict->size != MIN_DICT_SIZE) &&
         (dict->subdict->size == MIN_DICT_SIZE)))
        skey = xmlDictComputeKey(dict->subdict, name, l);
    else
        skey = okey;

    key = skey % dict->subdict->size;
    if (dict->subdict->dict[key].valid != 0) {
        xmlDictEntryPtr tmp;

        for (tmp = &(dict->subdict->dict[key]); tmp->next != NULL;
         tmp = tmp->next) {
#ifdef __GNUC__
        if ((tmp->okey == skey) && (tmp->len == l)) {
            if (!memcmp(tmp->name, name, l))
            return(tmp->name);
        }
#else
        if ((tmp->okey == skey) && (tmp->len == l) &&
            (!xmlStrncmp(tmp->name, name, l)))
            return(tmp->name);
#endif
        nbi++;
        }
#ifdef __GNUC__
        if ((tmp->okey == skey) && (tmp->len == l)) {
        if (!memcmp(tmp->name, name, l))
            return(tmp->name);
        }
#else
        if ((tmp->okey == skey) && (tmp->len == l) &&
        (!xmlStrncmp(tmp->name, name, l)))
        return(tmp->name);
#endif
    }
    }

    /* not found */
    return(NULL);
}

xmlDictFree()

void xmlDictFree

(

xmlDictPtr

dict

)

xmlDictFree: @dict: the dictionary

Free the hash @dict and its contents. The userdata is deallocated with @f if provided.

Definition at line 793 of file dict.c.

                             {
    size_t i;
    xmlDictEntryPtr iter;
    xmlDictEntryPtr next;
    int inside_dict = 0;
    xmlDictStringsPtr pool, nextp;

    if (dict == NULL)
    return;

    if (!xmlDictInitialized)
        if (!__xmlInitializeDict())
            return;

    /* decrement the counter, it may be shared by a parser and docs */
    xmlRMutexLock(xmlDictMutex);
    dict->ref_counter--;
    if (dict->ref_counter > 0) {
        xmlRMutexUnlock(xmlDictMutex);
        return;
    }

    xmlRMutexUnlock(xmlDictMutex);

    if (dict->subdict != NULL) {
        xmlDictFree(dict->subdict);
    }

    if (dict->dict) {
    for(i = 0; ((i < dict->size) && (dict->nbElems > 0)); i++) {
        iter = &(dict->dict[i]);
        if (iter->valid == 0)
        continue;
        inside_dict = 1;
        while (iter) {
        next = iter->next;
        if (!inside_dict)
            xmlFree(iter);
        dict->nbElems--;
        inside_dict = 0;
        iter = next;
        }
    }
    xmlFree(dict->dict);
    }
    pool = dict->strings;
    while (pool != NULL) {
        nextp = pool->next;
    xmlFree(pool);
    pool = nextp;
    }
    xmlFree(dict);
}

Referenced by xmlFreeParserCtxt(), xmlHashFree(), xmlParseBalancedChunkMemoryInternal(), xmlParseCtxtExternalEntity(), xmlParseInNodeContext(), xsltDocDefaultLoaderFunc(), xsltFreeStylesheet(), xsltFreeTransformContext(), and xsltParseStylesheetImportedDoc().

xmlDictGetUsage()

size_t xmlDictGetUsage

(

xmlDictPtr

dict

)

xmlDictGetUsage: @dict: the dictionary

Get how much memory is used by a dictionary for strings Added in 2.9.0

Returns the amount of strings allocated

Definition at line 1276 of file dict.c.

                                 {
    xmlDictStringsPtr pool;
    size_t limit = 0;

    if (dict == NULL)
    return(0);
    pool = dict->strings;
    while (pool != NULL) {
        limit += pool->size;
    pool = pool->next;
    }
    return(limit);
}

xmlDictGrow()

static int xmlDictGrow ( xmlDictPtr  dict, size_t  size  )

static

xmlDictGrow: @dict: the dictionary @size: the new size of the dictionary

resize the dictionary

Returns 0 in case of success, -1 in case of failure

Definition at line 660 of file dict.c.

                                          {
    unsigned long key, okey;
    size_t oldsize, i;
    xmlDictEntryPtr iter, next;
    struct _xmlDictEntry *olddict;
#ifdef DEBUG_GROW
    unsigned long nbElem = 0;
#endif
    int ret = 0;
    int keep_keys = 1;

    if (dict == NULL)
    return(-1);
    if (size < 8)
        return(-1);
    if (size > 8 * 2048)
    return(-1);

#ifdef DICT_DEBUG_PATTERNS
    fprintf(stderr, "*");
#endif

    oldsize = dict->size;
    olddict = dict->dict;
    if (olddict == NULL)
        return(-1);
    if (oldsize == MIN_DICT_SIZE)
        keep_keys = 0;

    dict->dict = xmlMalloc(size * sizeof(xmlDictEntry));
    if (dict->dict == NULL) {
    dict->dict = olddict;
    return(-1);
    }
    memset(dict->dict, 0, size * sizeof(xmlDictEntry));
    dict->size = size;

    /*  If the two loops are merged, there would be situations where
    a new entry needs to allocated and data copied into it from
    the main dict. It is nicer to run through the array twice, first
    copying all the elements in the main array (less probability of
    allocate) and then the rest, so we only free in the second loop.
    */
    for (i = 0; i < oldsize; i++) {
    if (olddict[i].valid == 0)
        continue;

    if (keep_keys)
        okey = olddict[i].okey;
    else
        okey = xmlDictComputeKey(dict, olddict[i].name, olddict[i].len);
    key = okey % dict->size;

    if (dict->dict[key].valid == 0) {
        memcpy(&(dict->dict[key]), &(olddict[i]), sizeof(xmlDictEntry));
        dict->dict[key].next = NULL;
        dict->dict[key].okey = okey;
    } else {
        xmlDictEntryPtr entry;

        entry = xmlMalloc(sizeof(xmlDictEntry));
        if (entry != NULL) {
        entry->name = olddict[i].name;
        entry->len = olddict[i].len;
        entry->okey = okey;
        entry->next = dict->dict[key].next;
        entry->valid = 1;
        dict->dict[key].next = entry;
        } else {
            /*
         * we don't have much ways to alert from herei
         * result is losing an entry and unicity guarantee
         */
            ret = -1;
        }
    }
#ifdef DEBUG_GROW
    nbElem++;
#endif
    }

    for (i = 0; i < oldsize; i++) {
    iter = olddict[i].next;
    while (iter) {
        next = iter->next;

        /*
         * put back the entry in the new dict
         */

        if (keep_keys)
        okey = iter->okey;
        else
        okey = xmlDictComputeKey(dict, iter->name, iter->len);
        key = okey % dict->size;
        if (dict->dict[key].valid == 0) {
        memcpy(&(dict->dict[key]), iter, sizeof(xmlDictEntry));
        dict->dict[key].next = NULL;
        dict->dict[key].valid = 1;
        dict->dict[key].okey = okey;
        xmlFree(iter);
        } else {
        iter->next = dict->dict[key].next;
        iter->okey = okey;
        dict->dict[key].next = iter;
        }

#ifdef DEBUG_GROW
        nbElem++;
#endif

        iter = next;
    }
    }

    xmlFree(olddict);

#ifdef DEBUG_GROW
    xmlGenericError(xmlGenericErrorContext,
        "xmlDictGrow : from %lu to %lu, %u elems\n", oldsize, size, nbElem);
#endif

    return(ret);
}

Referenced by xmlDictLookup(), and xmlDictQLookup().

xmlDictLookup()

const xmlChar* xmlDictLookup	(	xmlDictPtr	dict,
		const xmlChar *	name,
		int	len
	)

Definition at line 858 of file dict.c.

                                                             {
    unsigned long key, okey, nbi = 0;
    xmlDictEntryPtr entry;
    xmlDictEntryPtr insert;
    const xmlChar *ret;
    unsigned int l;

    if ((dict == NULL) || (name == NULL))
    return(NULL);

    if (len < 0)
        l = strlen((const char *) name);
    else
        l = len;

    if (((dict->limit > 0) && (l >= dict->limit)) ||
        (l > INT_MAX / 2))
        return(NULL);

    /*
     * Check for duplicate and insertion location.
     */
    okey = xmlDictComputeKey(dict, name, l);
    key = okey % dict->size;
    if (dict->dict[key].valid == 0) {
    insert = NULL;
    } else {
    for (insert = &(dict->dict[key]); insert->next != NULL;
         insert = insert->next) {
#ifdef __GNUC__
        if ((insert->okey == okey) && (insert->len == l)) {
        if (!memcmp(insert->name, name, l))
            return(insert->name);
        }
#else
        if ((insert->okey == okey) && (insert->len == l) &&
            (!xmlStrncmp(insert->name, name, l)))
        return(insert->name);
#endif
        nbi++;
    }
#ifdef __GNUC__
    if ((insert->okey == okey) && (insert->len == l)) {
        if (!memcmp(insert->name, name, l))
        return(insert->name);
    }
#else
    if ((insert->okey == okey) && (insert->len == l) &&
        (!xmlStrncmp(insert->name, name, l)))
        return(insert->name);
#endif
    }

    if (dict->subdict) {
        unsigned long skey;

        /* we cannot always reuse the same okey for the subdict */
        if (((dict->size == MIN_DICT_SIZE) &&
         (dict->subdict->size != MIN_DICT_SIZE)) ||
            ((dict->size != MIN_DICT_SIZE) &&
         (dict->subdict->size == MIN_DICT_SIZE)))
        skey = xmlDictComputeKey(dict->subdict, name, l);
    else
        skey = okey;

    key = skey % dict->subdict->size;
    if (dict->subdict->dict[key].valid != 0) {
        xmlDictEntryPtr tmp;

        for (tmp = &(dict->subdict->dict[key]); tmp->next != NULL;
         tmp = tmp->next) {
#ifdef __GNUC__
        if ((tmp->okey == skey) && (tmp->len == l)) {
            if (!memcmp(tmp->name, name, l))
            return(tmp->name);
        }
#else
        if ((tmp->okey == skey) && (tmp->len == l) &&
            (!xmlStrncmp(tmp->name, name, l)))
            return(tmp->name);
#endif
        nbi++;
        }
#ifdef __GNUC__
        if ((tmp->okey == skey) && (tmp->len == l)) {
        if (!memcmp(tmp->name, name, l))
            return(tmp->name);
        }
#else
        if ((tmp->okey == skey) && (tmp->len == l) &&
        (!xmlStrncmp(tmp->name, name, l)))
        return(tmp->name);
#endif
    }
    key = okey % dict->size;
    }

    ret = xmlDictAddString(dict, name, l);
    if (ret == NULL)
        return(NULL);
    if (insert == NULL) {
    entry = &(dict->dict[key]);
    } else {
    entry = xmlMalloc(sizeof(xmlDictEntry));
    if (entry == NULL)
         return(NULL);
    }
    entry->name = ret;
    entry->len = l;
    entry->next = NULL;
    entry->valid = 1;
    entry->okey = okey;


    if (insert != NULL)
    insert->next = entry;

    dict->nbElems++;

    if ((nbi > MAX_HASH_LEN) &&
        (dict->size <= ((MAX_DICT_HASH / 2) / MAX_HASH_LEN))) {
    if (xmlDictGrow(dict, MAX_HASH_LEN * 2 * dict->size) != 0)
        return(NULL);
    }
    /* Note that entry may have been freed at this point by xmlDictGrow */

    return(ret);
}

Referenced by xmlAddAttributeDecl(), xmlAddDefAttrs(), xmlAddID(), xmlCopyDocElementContent(), xmlDetectSAX2(), xmlDictQLookup(), xmlHashAddEntry3(), xmlHashUpdateEntry3(), xmlNewDocElementContent(), xmlParseBalancedChunkMemoryInternal(), xmlParseCtxtExternalEntity(), xmlParseInNodeContext(), xmlParseName(), xmlParseNameComplex(), xmlParseNCName(), xmlParseNCNameComplex(), xmlParseQName(), xmlParseReference(), xmlParseStartTag2(), xmlSAX2TextNode(), xsltAddTemplate(), xsltApplyAttributeSet(), xsltApplyStylesheetInternal(), xsltAttribute(), xsltAttributeComp(), xsltAttrListTemplateProcess(), xsltAttrTemplateProcess(), xsltElement(), xsltElementComp(), xsltEvalStaticAttrValueTemplate(), xsltGetCNsProp(), xsltGetQNameProperty(), xsltGetQNameURI2(), xsltNumberComp(), xsltParseStylesheetAttributeSet(), xsltParseStylesheetTemplate(), xsltParseTemplateContent(), xsltPreprocessStylesheet(), xsltProcessUserParamInternal(), xsltRegisterGlobalVariable(), xsltShallowCopyAttr(), xsltSortComp(), xsltSplitQName(), xsltStackLookup(), and xsltXPathVariableLookup().

xmlDictOwns()

int xmlDictOwns	(	xmlDictPtr	dict,
		const xmlChar *	str
	)

xmlDictOwns: @dict: the dictionary @str: the string

check if a string is owned by the disctionary

Returns 1 if true, 0 if false and -1 in case of error -1 in case of error

Definition at line 1211 of file dict.c.

                                                 {
    xmlDictStringsPtr pool;

    if ((dict == NULL) || (str == NULL))
    return(-1);
    pool = dict->strings;
    while (pool != NULL) {
        if ((str >= &pool->array[0]) && (str <= pool->free))
        return(1);
    pool = pool->next;
    }
    if (dict->subdict)
        return(xmlDictOwns(dict->subdict, str));
    return(0);
}

Referenced by xmlFreeAttribute(), xmlFreeDocElementContent(), xmlHashAddEntry3(), xmlHashUpdateEntry3(), xmlParseEnumerationType(), xmlParseNotationType(), xmlSAX2Characters(), xmlSAX2ExternalSubset(), xsltAttrListTemplateProcess(), xsltAttrTemplateProcess(), xsltCopyText(), xsltParseTemplateContent(), and xsltPreprocessStylesheet().

xmlDictQLookup()

const xmlChar* xmlDictQLookup	(	xmlDictPtr	dict,
		const xmlChar *	prefix,
		const xmlChar *	name
	)

Definition at line 1106 of file dict.c.

                                                                            {
    unsigned long okey, key, nbi = 0;
    xmlDictEntryPtr entry;
    xmlDictEntryPtr insert;
    const xmlChar *ret;
    unsigned int len, plen, l;

    if ((dict == NULL) || (name == NULL))
    return(NULL);
    if (prefix == NULL)
        return(xmlDictLookup(dict, name, -1));

    l = len = strlen((const char *) name);
    plen = strlen((const char *) prefix);
    len += 1 + plen;

    /*
     * Check for duplicate and insertion location.
     */
    okey = xmlDictComputeQKey(dict, prefix, plen, name, l);
    key = okey % dict->size;
    if (dict->dict[key].valid == 0) {
    insert = NULL;
    } else {
    for (insert = &(dict->dict[key]); insert->next != NULL;
         insert = insert->next) {
        if ((insert->okey == okey) && (insert->len == len) &&
            (xmlStrQEqual(prefix, name, insert->name)))
        return(insert->name);
        nbi++;
    }
    if ((insert->okey == okey) && (insert->len == len) &&
        (xmlStrQEqual(prefix, name, insert->name)))
        return(insert->name);
    }

    if (dict->subdict) {
        unsigned long skey;

        /* we cannot always reuse the same okey for the subdict */
        if (((dict->size == MIN_DICT_SIZE) &&
         (dict->subdict->size != MIN_DICT_SIZE)) ||
            ((dict->size != MIN_DICT_SIZE) &&
         (dict->subdict->size == MIN_DICT_SIZE)))
        skey = xmlDictComputeQKey(dict->subdict, prefix, plen, name, l);
    else
        skey = okey;

    key = skey % dict->subdict->size;
    if (dict->subdict->dict[key].valid != 0) {
        xmlDictEntryPtr tmp;
        for (tmp = &(dict->subdict->dict[key]); tmp->next != NULL;
         tmp = tmp->next) {
        if ((tmp->okey == skey) && (tmp->len == len) &&
            (xmlStrQEqual(prefix, name, tmp->name)))
            return(tmp->name);
        nbi++;
        }
        if ((tmp->okey == skey) && (tmp->len == len) &&
        (xmlStrQEqual(prefix, name, tmp->name)))
        return(tmp->name);
    }
    key = okey % dict->size;
    }

    ret = xmlDictAddQString(dict, prefix, plen, name, l);
    if (ret == NULL)
        return(NULL);
    if (insert == NULL) {
    entry = &(dict->dict[key]);
    } else {
    entry = xmlMalloc(sizeof(xmlDictEntry));
    if (entry == NULL)
         return(NULL);
    }
    entry->name = ret;
    entry->len = len;
    entry->next = NULL;
    entry->valid = 1;
    entry->okey = okey;

    if (insert != NULL)
    insert->next = entry;

    dict->nbElems++;

    if ((nbi > MAX_HASH_LEN) &&
        (dict->size <= ((MAX_DICT_HASH / 2) / MAX_HASH_LEN)))
    xmlDictGrow(dict, MAX_HASH_LEN * 2 * dict->size);
    /* Note that entry may have been freed at this point by xmlDictGrow */

    return(ret);
}

Referenced by xmlSAX2StartElementNs(), xsltApplyStylesheetInternal(), and xsltDocumentElem().

xmlDictReference()

int xmlDictReference

(

xmlDictPtr

dict

)

xmlDictReference: @dict: the dictionary

Increment the reference counter of a dictionary

Returns 0 in case of success and -1 in case of error

Definition at line 638 of file dict.c.

                                  {
    if (!xmlDictInitialized)
        if (!__xmlInitializeDict())
            return(-1);

    if (dict == NULL) return -1;
    xmlRMutexLock(xmlDictMutex);
    dict->ref_counter++;
    xmlRMutexUnlock(xmlDictMutex);
    return(0);
}

Referenced by xmlDictCreateSub(), xmlHashCreateDict(), xmlParseBalancedChunkMemoryInternal(), xmlParseCtxtExternalEntity(), xmlParseExternalEntityPrivate(), xmlSAX2StartDocument(), xsltApplyStylesheetInternal(), xsltCreateRVT(), xsltDocDefaultLoaderFunc(), xsltDocumentElem(), xsltLoadStylesheetPI(), and xsltParseStylesheetImportedDoc().

xmlDictSetLimit()

size_t xmlDictSetLimit	(	xmlDictPtr	dict,
		size_t	limit
	)

xmlDictSetLimit: @dict: the dictionary @limit: the limit in bytes

Set a size limit for the dictionary Added in 2.9.0

Returns the previous limit of the dictionary or 0

Definition at line 1256 of file dict.c.

                                               {
    size_t ret;

    if (dict == NULL)
    return(0);
    ret = dict->limit;
    dict->limit = limit;
    return(ret);
}

Referenced by xmlCtxtUseOptionsInternal(), and xmlInitParserCtxt().

xmlDictSize()

int xmlDictSize

(

xmlDictPtr

dict

)

xmlDictSize: @dict: the dictionary

Query the number of elements installed in the hash @dict.

Returns the number of elements in the dictionary or -1 in case of error

Definition at line 1237 of file dict.c.

                             {
    if (dict == NULL)
    return(-1);
    if (dict->subdict)
        return(dict->nbElems + dict->subdict->nbElems);
    return(dict->nbElems);
}

xmlInitializeDict()

int xmlInitializeDict

(

void

)

xmlInitializeDict:

Do the dictionary mutex initialization. this function is deprecated

Returns 0 if initialization was already done, and 1 if that call led to the initialization

Definition at line 159 of file dict.c.

                            {
    return(0);
}

Referenced by xmlInitParser().

Variable Documentation

xmlDictInitialized

int xmlDictInitialized = 0

static

Definition at line 139 of file dict.c.

Referenced by __xmlInitializeDict(), __xmlRandom(), xmlDictCleanup(), xmlDictCreate(), xmlDictFree(), and xmlDictReference().

xmlDictMutex

xmlRMutexPtr xmlDictMutex = NULL

static

Definition at line 134 of file dict.c.

Referenced by __xmlInitializeDict(), __xmlRandom(), xmlDictCleanup(), xmlDictFree(), and xmlDictReference().