hash.c File Reference

#include "libxml.h"
#include <string.h>
#include <libxml/parser.h>
#include <libxml/hash.h>
#include <libxml/xmlmemory.h>
#include <libxml/xmlerror.h>
#include <libxml/globals.h>
#include "elfgcchack.h"

Go to the source code of this file.

Data Structures
struct	xmlHashEntry
struct	xmlRefTable
struct	stubData
Defines
#define	IN_LIBXML
#define	MAX_HASH_LEN   8
Typedefs
typedef xmlHashEntry *	xmlHashEntryPtr
Functions
static unsigned long	xmlHashComputeKey (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3)
static unsigned long	xmlHashComputeQKey (xmlHashTablePtr table, const xmlChar *prefix, const xmlChar *name, const xmlChar *prefix2, const xmlChar *name2, const xmlChar *prefix3, const xmlChar *name3)
xmlHashTablePtr	xmlHashCreate (int size)
xmlHashTablePtr	xmlHashCreateDict (int size, xmlDictPtr dict)
static int	xmlHashGrow (xmlHashTablePtr table, int size)
void	xmlHashFree (xmlHashTablePtr table, xmlHashDeallocator f)
. Duplicate names generate errors.
Returns 0 the addition succeeded and -1 in case of error.
int	xmlHashAddEntry (xmlHashTablePtr table, const xmlChar *name, void *userdata)
, @name2) tuple. Duplicate tuples generate errors.
Returns 0 the addition succeeded and -1 in case of error.
int	xmlHashAddEntry2 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, void *userdata)
. Existing entry for this @name will be removed
and freed with if found. Returns 0 the addition succeeded and -1 in case of error.
int	xmlHashUpdateEntry (xmlHashTablePtr table, const xmlChar *name, void *userdata, xmlHashDeallocator f)
, @name2) tuple. Existing entry for this tuple will
be removed and freed with if found. Returns 0 the addition succeeded and -1 in case of error.
int	xmlHashUpdateEntry2 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, void *userdata, xmlHashDeallocator f)
.
Returns the pointer to the userdata
void *	xmlHashLookup (xmlHashTablePtr table, const xmlChar *name)
, @name2) tuple.
Returns the pointer to the userdata
void *	xmlHashLookup2 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2)
/@name.
Returns the pointer to the userdata
void *	xmlHashQLookup (xmlHashTablePtr table, const xmlChar *prefix, const xmlChar *name)
2: a second name of the userdata
void *	xmlHashQLookup2 (xmlHashTablePtr table, const xmlChar *prefix, const xmlChar *name, const xmlChar *prefix2, const xmlChar *name2)
, @name2, @name3). Duplicate entries generate
errors. Returns 0 the addition succeeded and -1 in case of error.
int	xmlHashAddEntry3 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, void *userdata)
, @name2, @name3). Existing entry for this tuple
will be removed and freed with if found. Returns 0 the addition succeeded and -1 in case of error.
int	xmlHashUpdateEntry3 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, void *userdata, xmlHashDeallocator f)
, @name2, @name3) tuple.
Returns the a pointer to the userdata
void *	xmlHashLookup3 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3)
void *	xmlHashQLookup3 (xmlHashTablePtr table, const xmlChar *prefix, const xmlChar *name, const xmlChar *prefix2, const xmlChar *name2, const xmlChar *prefix3, const xmlChar *name3)
static void	stubHashScannerFull (void *payload, void *data, const xmlChar *name, const xmlChar *name2 ATTRIBUTE_UNUSED, const xmlChar *name3 ATTRIBUTE_UNUSED)
void	xmlHashScan (xmlHashTablePtr table, xmlHashScanner f, void *data)
void	xmlHashScanFull (xmlHashTablePtr table, xmlHashScannerFull f, void *data)
, @name2, @name3) tuple. If one of the names is null,
the comparison is considered to match.
void	xmlHashScan3 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, xmlHashScanner f, void *data)
void	xmlHashScanFull3 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, xmlHashScannerFull f, void *data)
xmlHashTablePtr	xmlHashCopy (xmlHashTablePtr table, xmlHashCopier f)
int	xmlHashSize (xmlHashTablePtr table)
and remove
it from the hash . Existing userdata for this tuple will be removed and freed with . Returns 0 if the removal succeeded and -1 in case of error or not found.
int	xmlHashRemoveEntry (xmlHashTablePtr table, const xmlChar *name, xmlHashDeallocator f)
, @name2) tuple and remove
it from the hash . Existing userdata for this tuple will be removed and freed with . Returns 0 if the removal succeeded and -1 in case of error or not found.
int	xmlHashRemoveEntry2 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, xmlHashDeallocator f)
, @name2, @name3) tuple and remove
it from the hash . Existing userdata for this tuple will be removed and freed with . Returns 0 if the removal succeeded and -1 in case of error or not found.
#define	bottom_hash
int	xmlHashRemoveEntry3 (xmlHashTablePtr table, const xmlChar *name, const xmlChar *name2, const xmlChar *name3, xmlHashDeallocator f)