#include <libxml/xmlversion.h>
#include <libxml/dict.h>
#include <libxml/xmlstring.h>

Include dependency graph for hash.h:

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

Macros
#define	XML_CAST_FPTR(fptr) fptr

Typedefs
typedef struct _xmlHashTable	xmlHashTable

typedef xmlHashTable *	xmlHashTablePtr

: the name associated
xmlHashScannerFull: @payload: the data in the hash @data: extra scanner data
typedef void(*	xmlHashDeallocator) (void payload, const xmlChar name)

typedef void (	xmlHashCopier) (void payload, const xmlChar name)

typedef void(*	xmlHashScanner) (void payload, void data, const xmlChar *name)

3: the third name associated
Callback when scanning data in a hash with the full scanner.
typedef void(*	xmlHashScannerFull) (void payload, void data, const xmlChar name, const xmlChar name2, const xmlChar *name3)

XMLPUBFUN xmlHashTablePtr	xmlHashCreate (int size)

XMLPUBFUN xmlHashTablePtr	xmlHashCreateDict (int size, xmlDictPtr dict)

XMLPUBFUN void	xmlHashFree (xmlHashTablePtr hash, xmlHashDeallocator dealloc)

XMLPUBFUN void	xmlHashDefaultDeallocator (void entry, const xmlChar name)

XMLPUBFUN int	xmlHashAddEntry (xmlHashTablePtr hash, const xmlChar name, void userdata)

XMLPUBFUN int	xmlHashUpdateEntry (xmlHashTablePtr hash, const xmlChar name, void userdata, xmlHashDeallocator dealloc)

XMLPUBFUN int	xmlHashAddEntry2 (xmlHashTablePtr hash, const xmlChar name, const xmlChar name2, void *userdata)

XMLPUBFUN int	xmlHashUpdateEntry2 (xmlHashTablePtr hash, const xmlChar name, const xmlChar name2, void *userdata, xmlHashDeallocator dealloc)

XMLPUBFUN int	xmlHashAddEntry3 (xmlHashTablePtr hash, const xmlChar name, const xmlChar name2, const xmlChar name3, void userdata)

XMLPUBFUN int	xmlHashUpdateEntry3 (xmlHashTablePtr hash, const xmlChar name, const xmlChar name2, const xmlChar name3, void userdata, xmlHashDeallocator dealloc)

XMLPUBFUN int	xmlHashRemoveEntry (xmlHashTablePtr hash, const xmlChar *name, xmlHashDeallocator dealloc)

XMLPUBFUN int	xmlHashRemoveEntry2 (xmlHashTablePtr hash, const xmlChar name, const xmlChar name2, xmlHashDeallocator dealloc)

XMLPUBFUN int	xmlHashRemoveEntry3 (xmlHashTablePtr hash, const xmlChar name, const xmlChar name2, const xmlChar *name3, xmlHashDeallocator dealloc)

XMLPUBFUN void *	xmlHashLookup (xmlHashTablePtr hash, const xmlChar *name)

XMLPUBFUN void *	xmlHashLookup2 (xmlHashTablePtr hash, const xmlChar name, const xmlChar name2)

XMLPUBFUN void *	xmlHashLookup3 (xmlHashTablePtr hash, const xmlChar name, const xmlChar name2, const xmlChar *name3)

XMLPUBFUN void *	xmlHashQLookup (xmlHashTablePtr hash, const xmlChar prefix, const xmlChar name)

XMLPUBFUN void *	xmlHashQLookup2 (xmlHashTablePtr hash, const xmlChar prefix, const xmlChar name, const xmlChar prefix2, const xmlChar name2)

XMLPUBFUN void *	xmlHashQLookup3 (xmlHashTablePtr hash, const xmlChar prefix, const xmlChar name, const xmlChar prefix2, const xmlChar name2, const xmlChar prefix3, const xmlChar name3)

XMLPUBFUN xmlHashTablePtr	xmlHashCopy (xmlHashTablePtr hash, xmlHashCopier copy)

XMLPUBFUN int	xmlHashSize (xmlHashTablePtr hash)

XMLPUBFUN void	xmlHashScan (xmlHashTablePtr hash, xmlHashScanner scan, void *data)

XMLPUBFUN void	xmlHashScan3 (xmlHashTablePtr hash, const xmlChar name, const xmlChar name2, const xmlChar name3, xmlHashScanner scan, void data)

XMLPUBFUN void	xmlHashScanFull (xmlHashTablePtr hash, xmlHashScannerFull scan, void *data)

XMLPUBFUN void	xmlHashScanFull3 (xmlHashTablePtr hash, const xmlChar name, const xmlChar name2, const xmlChar name3, xmlHashScannerFull scan, void data)

Macro Definition Documentation

◆ XML_CAST_FPTR

#define XML_CAST_FPTR ( fptr ) fptr

XML_CAST_FPTR: @fptr: pointer to a function

Macro to do a casting from an object pointer to a function pointer without encountering a warning from gcc

define XML_CAST_FPTR(fptr) (*(void **)(&fptr)) This macro violated ISO C aliasing rules (gcc4 on s390 broke) so it is disabled now

Definition at line 48 of file hash.h.

Typedef Documentation

◆ xmlHashCopier

typedef void *(* xmlHashCopier) (void *payload, const xmlChar *name)

Definition at line 70 of file hash.h.

◆ xmlHashDeallocator

typedef void(* xmlHashDeallocator) (void *payload, const xmlChar *name)

Definition at line 60 of file hash.h.

◆ xmlHashScanner

typedef void(* xmlHashScanner) (void *payload, void *data, const xmlChar *name)

Definition at line 79 of file hash.h.

◆ xmlHashScannerFull

typedef void(* xmlHashScannerFull) (void *payload, void *data, const xmlChar *name, const xmlChar *name2, const xmlChar *name3)

Definition at line 90 of file hash.h.

◆ xmlHashTable

typedef struct _xmlHashTable xmlHashTable

Definition at line 25 of file hash.h.

◆ xmlHashTablePtr

typedef xmlHashTable* xmlHashTablePtr

Definition at line 26 of file hash.h.

Function Documentation

◆ xmlHashAddEntry()

XMLPUBFUN int xmlHashAddEntry	(	xmlHashTablePtr	hash,
		const xmlChar *	key,
		void *	payload
	)

xmlHashAddEntry: @hash: hash table @key: string key @payload: pointer to the payload

Add a hash table entry. If an entry with this key already exists, payload will not be updated and -1 is returned. This return value can't be distinguished from out-of-memory errors, so this function should be used with care.

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

Definition at line 621 of file hash.c.

                                                                         {
    return(xmlHashUpdateInternal(hash, key, NULL, NULL, payload, NULL, 0));
}

Referenced by cache_add_entry(), xmlAddID(), xmlAddNotationDecl(), xmlAddRef(), xsltGetExtData(), xsltInitCtxtExt(), xsltInitCtxtKey(), xsltNamespaceAlias(), xsltRegisterExtModuleFull(), and xsltStyleInitializeStylesheetModule().

◆ xmlHashAddEntry2()

XMLPUBFUN int xmlHashAddEntry2	(	xmlHashTablePtr	hash,
		const xmlChar *	key,
		const xmlChar *	key2,
		void *	payload
	)

xmlHashAddEntry2: @hash: hash table @key: first string key @key2: second string key @payload: pointer to the payload

Add a hash table entry with two strings as key.

See xmlHashAddEntry.

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

Definition at line 639 of file hash.c.

                                                     {
    return(xmlHashUpdateInternal(hash, key, key2, NULL, payload, NULL, 0));
}

Referenced by xmlAddElementDecl(), xmlAddSpecialAttr(), xmlGetDtdElementDesc2(), xsltAddTemplate(), xsltDocumentElem(), xsltEvalGlobalVariables(), xsltParseStylesheetAttributeSet(), xsltParseStylesheetOutput(), xsltParseStylesheetPreserveSpace(), xsltParseStylesheetStripSpace(), xsltProcessUserParamInternal(), xsltRegisterExtElement(), xsltRegisterExtFunction(), and xsltResolveSASCallback().

◆ xmlHashAddEntry3()

XMLPUBFUN int xmlHashAddEntry3	(	xmlHashTablePtr	hash,
		const xmlChar *	key,
		const xmlChar *	key2,
		const xmlChar *	key3,
		void *	payload
	)

xmlHashAddEntry3: @hash: hash table @key: first string key @key2: second string key @key3: third string key @payload: pointer to the payload

Add a hash table entry with three strings as key.

See xmlHashAddEntry.

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

Definition at line 659 of file hash.c.

                                {
    return(xmlHashUpdateInternal(hash, key, key2, key3, payload, NULL, 0));
}

Referenced by xmlAddAttributeDecl(), xmlHashCopy(), and xsltAddTemplate().

◆ xmlHashCopy()

XMLPUBFUN xmlHashTablePtr xmlHashCopy	(	xmlHashTablePtr	hash,
		xmlHashCopier	copy
	)

xmlHashCopy: @hash: hash table @copy: copier function for items in the hash

Copy the hash @table using @copy to copy payloads.

Returns the new table or NULL if a memory allocation failed.

Definition at line 1050 of file hash.c.

                                                      {
    const xmlHashEntry *entry, *end;
    xmlHashTablePtr ret;
 
    if ((hash == NULL) || (copy == NULL))
        return(NULL);
 
    ret = xmlHashCreate(hash->size);
    if (ret == NULL)
        return(NULL);
 
    if (hash->size == 0)
        return(ret);
 
    end = &hash->table[hash->size];
 
    for (entry = hash->table; entry < end; entry++) {
        if (entry->hashValue != 0)
            xmlHashAddEntry3(ret, entry->key, entry->key2, entry->key3,
                             copy(entry->payload, entry->key));
    }
 
    return(ret);
}

◆ xmlHashCreate()

XMLPUBFUN xmlHashTablePtr xmlHashCreate ( int size )

xmlHashCreate: @size: initial size of the hash table

Create a new hash table. Set size to zero if the number of entries can't be estimated.

Returns the newly created object, or NULL if a memory allocation failed.

Definition at line 160 of file hash.c.

                        {
    xmlHashTablePtr hash;
 
    xmlInitParser();
 
    hash = xmlMalloc(sizeof(*hash));
    if (hash == NULL)
        return(NULL);
    hash->dict = NULL;
    hash->size = 0;
    hash->table = NULL;
    hash->nbElems = 0;
    hash->randomSeed = xmlRandom();
#ifdef FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION
    hash->randomSeed = 0;
#endif
 
    /*
     * Unless a larger size is passed, the backing table is created
     * lazily with MIN_HASH_SIZE capacity. In practice, there are many
     * hash tables which are never filled.
     */
    if (size > MIN_HASH_SIZE) {
        unsigned newSize = MIN_HASH_SIZE * 2;
 
        while ((newSize < (unsigned) size) && (newSize < MAX_HASH_SIZE))
            newSize *= 2;
 
        if (xmlHashGrow(hash, newSize) != 0) {
            xmlFree(hash);
            return(NULL);
        }
    }
 
    return(hash);
}

Referenced by SchemaCache_create(), xmlHashCopy(), xmlHashCreateDict(), xsltAddTemplate(), xsltApplyStylesheetInternal(), xsltDocumentElem(), xsltGatherNamespaces(), xsltGetExtData(), xsltInitCtxtExt(), xsltNamespaceAlias(), xsltNewKeyTable(), xsltParseStylesheetAttributeSet(), xsltParseStylesheetOutput(), xsltParseStylesheetPreserveSpace(), xsltParseStylesheetStripSpace(), xsltProcessUserParamInternal(), xsltRegisterExtElement(), xsltRegisterExtFunction(), xsltRegisterExtModuleElement(), xsltRegisterExtModuleFull(), xsltRegisterExtModuleFunction(), xsltRegisterExtModuleTopLevel(), xsltResolveStylesheetAttributeSet(), and xsltStyleInitializeStylesheetModule().

◆ xmlHashCreateDict()

XMLPUBFUN xmlHashTablePtr xmlHashCreateDict	(	int	size,
		xmlDictPtr	dict
	)

xmlHashCreateDict: @size: the size of the hash table @dict: a dictionary to use for the hash

Create a new hash table backed by a dictionary. This can reduce resource usage considerably if most keys passed to API functions originate from this dictionary.

Returns the newly created object, or NULL if a memory allocation failed.

Definition at line 209 of file hash.c.

                                             {
    xmlHashTablePtr hash;
 
    hash = xmlHashCreate(size);
    if (hash != NULL) {
        hash->dict = dict;
        xmlDictReference(dict);
    }
    return(hash);
}

Referenced by xmlAddAttributeDecl(), xmlAddDefAttrs(), xmlAddElementDecl(), xmlAddID(), xmlAddNotationDecl(), xmlAddRef(), xmlAddSpecialAttr(), and xmlGetDtdElementDesc2().

◆ xmlHashDefaultDeallocator()

XMLPUBFUN void xmlHashDefaultDeallocator	(	void *	entry,
		const xmlChar *	name
	)

◆ xmlHashFree()

XMLPUBFUN void xmlHashFree	(	xmlHashTablePtr	hash,
		xmlHashDeallocator	dealloc
	)

xmlHashFree: @hash: hash table @dealloc: deallocator function or NULL

Free the hash and its contents. The payload is deallocated with @dealloc if provided.

Definition at line 229 of file hash.c.

                                                              {
    if (hash == NULL)
        return;
 
    if (hash->table) {
        const xmlHashEntry *end = &hash->table[hash->size];
        const xmlHashEntry *entry;
 
        for (entry = hash->table; entry < end; entry++) {
            if (entry->hashValue == 0)
                continue;
            if ((dealloc != NULL) && (entry->payload != NULL))
                dealloc(entry->payload, entry->key);
            if (hash->dict == NULL) {
                if (entry->key)
                    xmlFree(entry->key);
                if (entry->key2)
                    xmlFree(entry->key2);
                if (entry->key3)
                    xmlFree(entry->key3);
            }
        }
 
        xmlFree(hash->table);
    }
 
    if (hash->dict)
        xmlDictFree(hash->dict);
 
    xmlFree(hash);
}

Referenced by schema_cache_Release(), xmlCleanSpecialAttr(), xmlCtxtReset(), xmlFreeAttributeTable(), xmlFreeElementTable(), xmlFreeIDTable(), xmlFreeNotationTable(), xmlFreeParserCtxt(), xmlFreeRefTable(), xsltCleanupGlobals(), xsltFreeAttributeSetsHashes(), xsltFreeCtxtExts(), xsltFreeGlobalVariables(), xsltFreeKeyTable(), xsltFreeNamespaceAliasHashes(), xsltFreeStylesheet(), xsltFreeTemplateHashes(), xsltResolveStylesheetAttributeSet(), xsltShutdownCtxtExts(), xsltShutdownExts(), xsltUnregisterAllExtModuleElement(), xsltUnregisterAllExtModuleFunction(), xsltUnregisterAllExtModules(), and xsltUnregisterAllExtModuleTopLevel().

◆ xmlHashLookup()

XMLPUBFUN void * xmlHashLookup	(	xmlHashTablePtr	hash,
		const xmlChar *	key
	)

xmlHashLookup: @hash: hash table @key: string key

Find the entry specified by @key.

Returns a pointer to the payload or NULL if no entry was found.

Definition at line 739 of file hash.c.

                                                        {
    return(xmlHashLookup3(hash, key, NULL, NULL));
}

Referenced by cache_copy(), get_entry(), lookup_schema_elemDecl(), schema_cache_get(), xmlAddRef(), xmlGetDtdNotationDesc(), xmlGetID(), xmlGetRefs(), xmlRemoveID(), xmlRemoveRef(), xsltApplySequenceConstructor(), xsltCheckInstructionElement(), xsltCheckParentElement(), xsltCopyNamespaceList(), xsltGatherNamespaces(), xsltGetExtData(), xsltGetExtInfo(), xsltGetKey(), xsltGetNamespace(), xsltInitCtxtExt(), xsltInitCtxtKey(), xsltRegisterExtModuleFull(), xsltRegisterExtPrefix(), xsltStyleGetExtData(), and xsltStyleInitializeStylesheetModule().

◆ xmlHashLookup2()

XMLPUBFUN void * xmlHashLookup2	(	xmlHashTablePtr	hash,
		const xmlChar *	key,
		const xmlChar *	key2
	)

xmlHashLookup2: @hash: hash table @key: first string key @key2: second string key

Find the payload specified by the (@key, @key2) tuple.

Returns a pointer to the payload or NULL if no entry was found.

Definition at line 754 of file hash.c.

                                   {
    return(xmlHashLookup3(hash, key, key2, NULL));
}

Referenced by xmlAddDefAttrs(), xmlAddElementDecl(), xmlAddSpecialAttr(), xmlGetDtdElementDesc(), xmlGetDtdElementDesc2(), xmlGetDtdQElementDesc(), xmlParseStartTag2(), xsltAddTemplate(), xsltApplyAttributeSet(), xsltCopyText(), xsltCopyTextString(), xsltEvalGlobalVariables(), xsltExtElementLookup(), xsltExtModuleElementLookup(), xsltExtModuleElementPreComputeLookup(), xsltExtModuleFunctionLookup(), xsltExtModuleTopLevelLookup(), xsltFindElemSpaceHandling(), xsltFindTemplate(), xsltGlobalVariableLookup(), xsltParseStylesheetAttributeSet(), xsltPreComputeExtModuleElement(), xsltProcessUserParamInternal(), xsltResolveAttrSet(), xsltResolveUseAttrSets(), and xsltXPathFunctionLookup().

◆ xmlHashLookup3()

XMLPUBFUN void * xmlHashLookup3	(	xmlHashTablePtr	hash,
		const xmlChar *	key,
		const xmlChar *	key2,
		const xmlChar *	key3
	)

xmlHashLookup3: @hash: hash table @key: first string key @key2: second string key @key3: third string key

Find the payload specified by the (@key, @key2, @key3) tuple.

Returns a pointer to the payload or NULL if no entry was found.

Definition at line 806 of file hash.c.

                                                         {
    const xmlHashEntry *entry;
    unsigned hashValue;
    int found;
 
    if ((hash == NULL) || (hash->size == 0) || (key == NULL))
        return(NULL);
    hashValue = xmlHashValue(hash->randomSeed, key, key2, key3, NULL);
    entry = xmlHashFindEntry(hash, key, key2, key3, hashValue, &found);
    if (found)
        return(entry->payload);
    return(NULL);
}

Referenced by xmlAddAttributeDecl(), xmlGetDtdAttrDesc(), xmlGetDtdQAttrDesc(), xmlHashLookup(), xmlHashLookup2(), xsltAddTemplate(), and xsltGetTemplate().

◆ xmlHashQLookup()

XMLPUBFUN void * xmlHashQLookup	(	xmlHashTablePtr	hash,
		const xmlChar *	prefix,
		const xmlChar *	name
	)

Definition at line 770 of file hash.c.

                                    {
    return(xmlHashQLookup3(hash, prefix, name, NULL, NULL, NULL, NULL));
}

◆ xmlHashQLookup2()

XMLPUBFUN void * xmlHashQLookup2	(	xmlHashTablePtr	hash,
		const xmlChar *	prefix,
		const xmlChar *	name,
		const xmlChar *	prefix2,
		const xmlChar *	name2
	)

Definition at line 788 of file hash.c.

                                      {
    return(xmlHashQLookup3(hash, prefix, name, prefix2, name2, NULL, NULL));
}

Referenced by xmlParseAttribute2().

◆ xmlHashQLookup3()

XMLPUBFUN void * xmlHashQLookup3	(	xmlHashTablePtr	hash,
		const xmlChar *	prefix,
		const xmlChar *	name,
		const xmlChar *	prefix2,
		const xmlChar *	name2,
		const xmlChar *	prefix3,
		const xmlChar *	name3
	)

Definition at line 837 of file hash.c.

                                                              {
    const xmlHashEntry *entry;
    unsigned hashValue, mask, pos, displ;
 
    if ((hash == NULL) || (hash->size == 0) || (name == NULL))
        return(NULL);
 
    hashValue = xmlHashQNameValue(hash->randomSeed, prefix, name, prefix2,
                                  name2, prefix3, name3);
    mask = hash->size - 1;
    pos = hashValue & mask;
    entry = &hash->table[pos];
 
    if (entry->hashValue != 0) {
        displ = 0;
        hashValue |= MAX_HASH_SIZE;
 
        do {
            if ((hashValue == entry->hashValue) &&
                (xmlStrQEqual(prefix, name, entry->key)) &&
                (xmlStrQEqual(prefix2, name2, entry->key2)) &&
                (xmlStrQEqual(prefix3, name3, entry->key3)))
                return(entry->payload);
 
            displ++;
            pos++;
            entry++;
            if ((pos & mask) == 0)
                entry = hash->table;
        } while ((entry->hashValue != 0) &&
                 (((pos - entry->hashValue) & mask) >= displ));
    }
 
    return(NULL);
}

Referenced by xmlHashQLookup(), and xmlHashQLookup2().

◆ xmlHashRemoveEntry()

XMLPUBFUN int xmlHashRemoveEntry	(	xmlHashTablePtr	hash,
		const xmlChar *	key,
		xmlHashDeallocator	dealloc
	)

xmlHashRemoveEntry: @hash: hash table @key: string key @dealloc: deallocator function for removed item or NULL

Find the entry specified by the @key and remove it from the hash table. Payload will be freed with @dealloc.

Returns 0 on success and -1 if no entry was found.

Definition at line 1102 of file hash.c.

                                                   {
    return(xmlHashRemoveEntry3(hash, key, NULL, NULL, dealloc));
}

Referenced by cache_add_entry(), cache_remove_entry(), xmlRemoveID(), and xsltUnregisterExtModule().

◆ xmlHashRemoveEntry2()

XMLPUBFUN int xmlHashRemoveEntry2	(	xmlHashTablePtr	hash,
		const xmlChar *	key,
		const xmlChar *	key2,
		xmlHashDeallocator	dealloc
	)

xmlHashRemoveEntry2: @hash: hash table @key: first string key @key2: second string key @dealloc: deallocator function for removed item or NULL

Remove an entry with two strings as key.

See xmlHashRemoveEntry.

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

Definition at line 1121 of file hash.c.

                                                                     {
    return(xmlHashRemoveEntry3(hash, key, key2, NULL, dealloc));
}

Referenced by xmlAddElementDecl(), xmlCleanSpecialAttrCallback(), xsltResolveAttrSet(), xsltUnregisterExtModuleElement(), xsltUnregisterExtModuleFunction(), and xsltUnregisterExtModuleTopLevel().

◆ xmlHashRemoveEntry3()

XMLPUBFUN int xmlHashRemoveEntry3	(	xmlHashTablePtr	hash,
		const xmlChar *	key,
		const xmlChar *	key2,
		const xmlChar *	key3,
		xmlHashDeallocator	dealloc
	)

xmlHashRemoveEntry3: @hash: hash table @key: first string key @key2: second string key @key3: third string key @dealloc: deallocator function for removed item or NULL

Remove an entry with three strings as key.

See xmlHashRemoveEntry.

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

Definition at line 1142 of file hash.c.

                                                {
    xmlHashEntry *entry, *cur, *next;
    unsigned hashValue, mask, pos, nextpos;
    int found;
 
    if ((hash == NULL) || (hash->size == 0) || (key == NULL))
        return(-1);
 
    hashValue = xmlHashValue(hash->randomSeed, key, key2, key3, NULL);
    entry = xmlHashFindEntry(hash, key, key2, key3, hashValue, &found);
    if (!found)
        return(-1);
 
    if ((dealloc != NULL) && (entry->payload != NULL))
        dealloc(entry->payload, entry->key);
    if (hash->dict == NULL) {
        if (entry->key)
            xmlFree(entry->key);
        if (entry->key2)
            xmlFree(entry->key2);
        if (entry->key3)
            xmlFree(entry->key3);
    }
 
    /*
     * Find end of probe sequence. Entries at their initial probe
     * position start a new sequence.
     */
    mask = hash->size - 1;
    pos = entry - hash->table;
    cur = entry;
 
    while (1) {
        nextpos = pos + 1;
        next = cur + 1;
        if ((nextpos & mask) == 0)
            next = hash->table;
 
        if ((next->hashValue == 0) ||
            (((next->hashValue - nextpos) & mask) == 0))
            break;
 
        cur = next;
        pos = nextpos;
    }
 
    /*
     * Backward shift
     */
    next = entry + 1;
 
    if (cur < entry) {
        xmlHashEntry *end = &hash->table[hash->size];
 
        memmove(entry, next, (char *) end - (char *) next);
        entry = hash->table;
        end[-1] = *entry;
        next = entry + 1;
    }
 
    memmove(entry, next, (char *) cur - (char *) entry);
 
    /*
     * Update entry
     */
    cur->hashValue = 0;
 
    hash->nbElems--;
 
    return(0);
}

Referenced by xmlHashRemoveEntry(), and xmlHashRemoveEntry2().

◆ xmlHashScan()

XMLPUBFUN void xmlHashScan	(	xmlHashTablePtr	hash,
		xmlHashScanner	scan,
		void *	data
	)

xmlHashScan: @hash: hash table @scan: scanner function for items in the hash @data: extra data passed to @scan

Scan the hash @table and apply @scan to each value.

Definition at line 898 of file hash.c.

                                                                   {
    stubData sdata;
    sdata.data = data;
    sdata.scan = scan;
    xmlHashScanFull(hash, stubHashScannerFull, &sdata);
}

Referenced by schema_cache_addCollection(), xsltCleanupGlobals(), xsltEvalGlobalVariables(), xsltFixImportedCompSteps(), xsltInitCtxtExts(), xsltShutdownCtxtExts(), and xsltShutdownExts().

◆ xmlHashScan3()

XMLPUBFUN void xmlHashScan3	(	xmlHashTablePtr	hash,
		const xmlChar *	key,
		const xmlChar *	key2,
		const xmlChar *	key3,
		xmlHashScanner	scan,
		void *	data
	)

xmlHashScan3: @hash: hash table @key: first string key or NULL @key2: second string key or NULL @key3: third string key or NULL @scan: scanner function for items in the hash @data: extra data passed to @scan

Scan the hash @table and apply @scan to each value matching (@key, @key2, @key3) tuple. If one of the keys is null, the comparison is considered to match.

Definition at line 969 of file hash.c.

                                              {
    stubData sdata;
    sdata.data = data;
    sdata.scan = scan;
    xmlHashScanFull3(hash, key, key2, key3, stubHashScannerFull, &sdata);
}

◆ xmlHashScanFull()

XMLPUBFUN void xmlHashScanFull	(	xmlHashTablePtr	hash,
		xmlHashScannerFull	scan,
		void *	data
	)

xmlHashScanFull: @hash: hash table @scan: scanner function for items in the hash @data: extra data passed to @scan

Scan the hash @table and apply @scan to each value.

Definition at line 914 of file hash.c.

                                                                           {
    const xmlHashEntry *entry, *end;
    xmlHashEntry old;
    unsigned i;
 
    if ((hash == NULL) || (hash->size == 0) || (scan == NULL))
        return;
 
    /*
     * We must handle the case that a scanned entry is removed when executing
     * the callback (xmlCleanSpecialAttr and possibly other places).
     *
     * Find the start of a probe sequence to avoid scanning entries twice if
     * a deletion happens.
     */
    entry = hash->table;
    end = &hash->table[hash->size];
    while (entry->hashValue != 0) {
        if (++entry >= end)
            entry = hash->table;
    }
 
    for (i = 0; i < hash->size; i++) {
        if ((entry->hashValue != 0) && (entry->payload != NULL)) {
            /*
             * Make sure to rescan after a possible deletion.
             */
            do {
                old = *entry;
                scan(entry->payload, data, entry->key, entry->key2, entry->key3);
            } while ((entry->hashValue != 0) &&
                     (entry->payload != NULL) &&
                     ((entry->key != old.key) ||
                      (entry->key2 != old.key2) ||
                      (entry->key3 != old.key3)));
        }
        if (++entry >= end)
            entry = hash->table;
    }
}

Referenced by xmlCleanSpecialAttr(), xmlHashScan(), xsltDebugDumpExtensions(), and xsltResolveStylesheetAttributeSet().

◆ xmlHashScanFull3()

XMLPUBFUN void xmlHashScanFull3	(	xmlHashTablePtr	hash,
		const xmlChar *	key,
		const xmlChar *	key2,
		const xmlChar *	key3,
		xmlHashScannerFull	scan,
		void *	data
	)

xmlHashScanFull3: @hash: hash table @key: first string key or NULL @key2: second string key or NULL @key3: third string key or NULL @scan: scanner function for items in the hash @data: extra data passed to @scan

Scan the hash @table and apply @scan to each value matching (@key, @key2, @key3) tuple. If one of the keys is null, the comparison is considered to match.

Definition at line 992 of file hash.c.

                                                      {
    const xmlHashEntry *entry, *end;
    xmlHashEntry old;
    unsigned i;
 
    if ((hash == NULL) || (hash->size == 0) || (scan == NULL))
        return;
 
    /*
     * We must handle the case that a scanned entry is removed when executing
     * the callback (xmlCleanSpecialAttr and possibly other places).
     *
     * Find the start of a probe sequence to avoid scanning entries twice if
     * a deletion happens.
     */
    entry = hash->table;
    end = &hash->table[hash->size];
    while (entry->hashValue != 0) {
        if (++entry >= end)
            entry = hash->table;
    }
 
    for (i = 0; i < hash->size; i++) {
        if ((entry->hashValue != 0) && (entry->payload != NULL)) {
            /*
             * Make sure to rescan after a possible deletion.
             */
            do {
                if (((key != NULL) && (strcmp((const char *) key,
                                              (const char *) entry->key) != 0)) ||
                    ((key2 != NULL) && (!xmlFastStrEqual(key2, entry->key2))) ||
                    ((key3 != NULL) && (!xmlFastStrEqual(key3, entry->key3))))
                    break;
                old = *entry;
                scan(entry->payload, data, entry->key, entry->key2, entry->key3);
            } while ((entry->hashValue != 0) &&
                     (entry->payload != NULL) &&
                     ((entry->key != old.key) ||
                      (entry->key2 != old.key2) ||
                      (entry->key3 != old.key3)));
        }
        if (++entry >= end)
            entry = hash->table;
    }
}

Referenced by xmlHashScan3().

◆ xmlHashSize()

XMLPUBFUN int xmlHashSize ( xmlHashTablePtr hash )

xmlHashSize: @hash: hash table

Query the number of elements in the hash table.

Returns the number of elements in the hash table or -1 in case of error.

Definition at line 1085 of file hash.c.

                                  {
    if (hash == NULL)
        return(-1);
    return(hash->nbElems);
}

Referenced by lookup_schema_elemDecl(), and xmlCleanSpecialAttr().

◆ xmlHashUpdateEntry()

XMLPUBFUN int xmlHashUpdateEntry	(	xmlHashTablePtr	hash,
		const xmlChar *	key,
		void *	payload,
		xmlHashDeallocator	dealloc
	)

xmlHashUpdateEntry: @hash: hash table @key: string key @payload: pointer to the payload @dealloc: deallocator function for replaced item or NULL

Add a hash table entry. If an entry with this key already exists, the old payload will be freed and updated with the new value.

Returns 0 in case of success, -1 if a memory allocation failed.

Definition at line 678 of file hash.c.

                                                              {
    return(xmlHashUpdateInternal(hash, key, NULL, NULL, payload,
                                 dealloc, 1));
}

Referenced by xmlRemoveRef(), and xsltGatherNamespaces().

◆ xmlHashUpdateEntry2()

XMLPUBFUN int xmlHashUpdateEntry2	(	xmlHashTablePtr	hash,
		const xmlChar *	key,
		const xmlChar *	key2,
		void *	payload,
		xmlHashDeallocator	dealloc
	)

xmlHashUpdateEntry2: @hash: hash table @key: first string key @key2: second string key @payload: pointer to the payload @dealloc: deallocator function for replaced item or NULL

Add a hash table entry with two strings as key.

See xmlHashUpdateEntry.

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

Definition at line 699 of file hash.c.

                                               {
    return(xmlHashUpdateInternal(hash, key, key2, NULL, payload,
                                 dealloc, 1));
}

Referenced by xmlAddDefAttrs(), xsltRegisterExtModuleElement(), xsltRegisterExtModuleFunction(), and xsltRegisterExtModuleTopLevel().

◆ xmlHashUpdateEntry3()

XMLPUBFUN int xmlHashUpdateEntry3	(	xmlHashTablePtr	hash,
		const xmlChar *	key,
		const xmlChar *	key2,
		const xmlChar *	key3,
		void *	payload,
		xmlHashDeallocator	dealloc
	)

xmlHashUpdateEntry3: @hash: hash table @key: first string key @key2: second string key @key3: third string key @payload: pointer to the payload @dealloc: deallocator function for replaced item or NULL

Add a hash table entry with three strings as key.

See xmlHashUpdateEntry.

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

Definition at line 722 of file hash.c.

                                                              {
    return(xmlHashUpdateInternal(hash, key, key2, key3, payload,
                                 dealloc, 1));
}

Referenced by xsltAddTemplate().

Macros

Typedefs

3: the third name associated

Macro Definition Documentation

◆ XML_CAST_FPTR

Typedef Documentation

◆ xmlHashCopier

◆ xmlHashDeallocator

◆ xmlHashScanner

◆ xmlHashScannerFull

◆ xmlHashTable

◆ xmlHashTablePtr

Function Documentation

◆ xmlHashAddEntry()

◆ xmlHashAddEntry2()

◆ xmlHashAddEntry3()

◆ xmlHashCopy()

◆ xmlHashCreate()

◆ xmlHashCreateDict()

◆ xmlHashDefaultDeallocator()

◆ xmlHashFree()

◆ xmlHashLookup()

◆ xmlHashLookup2()

◆ xmlHashLookup3()

◆ xmlHashQLookup()

◆ xmlHashQLookup2()

◆ xmlHashQLookup3()

◆ xmlHashRemoveEntry()

◆ xmlHashRemoveEntry2()

◆ xmlHashRemoveEntry3()

◆ xmlHashScan()

◆ xmlHashScan3()

◆ xmlHashScanFull()

◆ xmlHashScanFull3()

◆ xmlHashSize()

◆ xmlHashUpdateEntry()

◆ xmlHashUpdateEntry2()

◆ xmlHashUpdateEntry3()