Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 1 | /* |
| 2 | * dict.c: dictionary of reusable strings, just used to avoid allocation |
| 3 | * and freeing operations. |
| 4 | * |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 5 | * Copyright (C) 2003-2012 Daniel Veillard. |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 6 | * |
| 7 | * Permission to use, copy, modify, and distribute this software for any |
| 8 | * purpose with or without fee is hereby granted, provided that the above |
| 9 | * copyright notice and this permission notice appear in all copies. |
| 10 | * |
| 11 | * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED |
| 12 | * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF |
Nick Wellnhofer | 20c6088 | 2020-03-08 17:19:42 +0100 | [diff] [blame] | 13 | * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE AUTHORS AND |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 14 | * CONTRIBUTORS ACCEPT NO RESPONSIBILITY IN ANY CONCEIVABLE MANNER. |
| 15 | * |
| 16 | * Author: daniel@veillard.com |
| 17 | */ |
| 18 | |
| 19 | #define IN_LIBXML |
| 20 | #include "libxml.h" |
| 21 | |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 22 | #include <limits.h> |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 23 | #include <stdlib.h> |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 24 | #include <time.h> |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 25 | |
| 26 | /* |
| 27 | * Following http://www.ocert.org/advisories/ocert-2011-003.html |
| 28 | * it seems that having hash randomization might be a good idea |
| 29 | * when using XML with untrusted data |
| 30 | * Note1: that it works correctly only if compiled with WITH_BIG_KEY |
| 31 | * which is the default. |
| 32 | * Note2: the fast function used for a small dict won't protect very |
| 33 | * well but since the attack is based on growing a very big hash |
| 34 | * list we will use the BigKey algo as soon as the hash size grows |
| 35 | * over MIN_DICT_SIZE so this actually works |
| 36 | */ |
Nick Wellnhofer | 72119af | 2022-03-02 01:14:08 +0100 | [diff] [blame] | 37 | #if !defined(FUZZING_BUILD_MODE_UNSAFE_FOR_PRODUCTION) |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 38 | #define DICT_RANDOMIZATION |
| 39 | #endif |
| 40 | |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 41 | #include <string.h> |
Rob Richards | b6b2ee1 | 2008-05-03 12:34:25 +0000 | [diff] [blame] | 42 | #ifdef HAVE_STDINT_H |
Daniel Veillard | e9100a5 | 2008-04-22 08:28:50 +0000 | [diff] [blame] | 43 | #include <stdint.h> |
Daniel Veillard | 7f4547c | 2008-10-03 07:58:23 +0000 | [diff] [blame] | 44 | #else |
| 45 | #ifdef HAVE_INTTYPES_H |
| 46 | #include <inttypes.h> |
Nick Wellnhofer | e389054 | 2017-10-09 00:20:01 +0200 | [diff] [blame] | 47 | #elif defined(_WIN32) |
Rob Richards | b6b2ee1 | 2008-05-03 12:34:25 +0000 | [diff] [blame] | 48 | typedef unsigned __int32 uint32_t; |
Rob Richards | b6b2ee1 | 2008-05-03 12:34:25 +0000 | [diff] [blame] | 49 | #endif |
Daniel Veillard | 7f4547c | 2008-10-03 07:58:23 +0000 | [diff] [blame] | 50 | #endif |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 51 | #include <libxml/tree.h> |
| 52 | #include <libxml/dict.h> |
| 53 | #include <libxml/xmlmemory.h> |
| 54 | #include <libxml/xmlerror.h> |
| 55 | #include <libxml/globals.h> |
| 56 | |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 57 | /* #define DEBUG_GROW */ |
| 58 | /* #define DICT_DEBUG_PATTERNS */ |
| 59 | |
Daniel Veillard | e9100a5 | 2008-04-22 08:28:50 +0000 | [diff] [blame] | 60 | #define MAX_HASH_LEN 3 |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 61 | #define MIN_DICT_SIZE 128 |
| 62 | #define MAX_DICT_HASH 8 * 2048 |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 63 | #define WITH_BIG_KEY |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 64 | |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 65 | #ifdef WITH_BIG_KEY |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 66 | #define xmlDictComputeKey(dict, name, len) \ |
| 67 | (((dict)->size == MIN_DICT_SIZE) ? \ |
| 68 | xmlDictComputeFastKey(name, len, (dict)->seed) : \ |
| 69 | xmlDictComputeBigKey(name, len, (dict)->seed)) |
Daniel Veillard | e9100a5 | 2008-04-22 08:28:50 +0000 | [diff] [blame] | 70 | |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 71 | #define xmlDictComputeQKey(dict, prefix, plen, name, len) \ |
| 72 | (((prefix) == NULL) ? \ |
| 73 | (xmlDictComputeKey(dict, name, len)) : \ |
| 74 | (((dict)->size == MIN_DICT_SIZE) ? \ |
| 75 | xmlDictComputeFastQKey(prefix, plen, name, len, (dict)->seed) : \ |
| 76 | xmlDictComputeBigQKey(prefix, plen, name, len, (dict)->seed))) |
Daniel Veillard | e9100a5 | 2008-04-22 08:28:50 +0000 | [diff] [blame] | 77 | |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 78 | #else /* !WITH_BIG_KEY */ |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 79 | #define xmlDictComputeKey(dict, name, len) \ |
| 80 | xmlDictComputeFastKey(name, len, (dict)->seed) |
| 81 | #define xmlDictComputeQKey(dict, prefix, plen, name, len) \ |
| 82 | xmlDictComputeFastQKey(prefix, plen, name, len, (dict)->seed) |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 83 | #endif /* WITH_BIG_KEY */ |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 84 | |
| 85 | /* |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 86 | * An entry in the dictionary |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 87 | */ |
| 88 | typedef struct _xmlDictEntry xmlDictEntry; |
| 89 | typedef xmlDictEntry *xmlDictEntryPtr; |
| 90 | struct _xmlDictEntry { |
| 91 | struct _xmlDictEntry *next; |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 92 | const xmlChar *name; |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 93 | unsigned int len; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 94 | int valid; |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 95 | unsigned long okey; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 96 | }; |
| 97 | |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 98 | typedef struct _xmlDictStrings xmlDictStrings; |
| 99 | typedef xmlDictStrings *xmlDictStringsPtr; |
| 100 | struct _xmlDictStrings { |
| 101 | xmlDictStringsPtr next; |
| 102 | xmlChar *free; |
| 103 | xmlChar *end; |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 104 | size_t size; |
| 105 | size_t nbStrings; |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 106 | xmlChar array[1]; |
| 107 | }; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 108 | /* |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 109 | * The entire dictionary |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 110 | */ |
| 111 | struct _xmlDict { |
Daniel Veillard | e96a2a4 | 2003-09-24 21:23:56 +0000 | [diff] [blame] | 112 | int ref_counter; |
| 113 | |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 114 | struct _xmlDictEntry *dict; |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 115 | size_t size; |
| 116 | unsigned int nbElems; |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 117 | xmlDictStringsPtr strings; |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 118 | |
| 119 | struct _xmlDict *subdict; |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 120 | /* used for randomization */ |
| 121 | int seed; |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 122 | /* used to impose a limit on size */ |
| 123 | size_t limit; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 124 | }; |
| 125 | |
| 126 | /* |
Daniel Veillard | 1441251 | 2005-01-21 23:53:26 +0000 | [diff] [blame] | 127 | * A mutex for modifying the reference counter for shared |
| 128 | * dictionaries. |
| 129 | */ |
| 130 | static xmlRMutexPtr xmlDictMutex = NULL; |
| 131 | |
| 132 | /* |
| 133 | * Whether the dictionary mutex was initialized. |
| 134 | */ |
| 135 | static int xmlDictInitialized = 0; |
| 136 | |
Daniel Veillard | 379ebc1 | 2012-05-18 15:41:31 +0800 | [diff] [blame] | 137 | #ifdef DICT_RANDOMIZATION |
| 138 | #ifdef HAVE_RAND_R |
| 139 | /* |
| 140 | * Internal data for random function, protected by xmlDictMutex |
| 141 | */ |
Wouter Van Rooy | e7715a5 | 2012-09-14 14:39:42 +0800 | [diff] [blame] | 142 | static unsigned int rand_seed = 0; |
Daniel Veillard | 379ebc1 | 2012-05-18 15:41:31 +0800 | [diff] [blame] | 143 | #endif |
| 144 | #endif |
| 145 | |
Daniel Veillard | 1441251 | 2005-01-21 23:53:26 +0000 | [diff] [blame] | 146 | /** |
William M. Brack | 4e1c2db | 2005-02-11 10:58:55 +0000 | [diff] [blame] | 147 | * xmlInitializeDict: |
Daniel Veillard | 1441251 | 2005-01-21 23:53:26 +0000 | [diff] [blame] | 148 | * |
Nick Wellnhofer | 40483d0 | 2022-03-06 13:55:48 +0100 | [diff] [blame^] | 149 | * DEPRECATED: This function will be made private. Call xmlInitParser to |
| 150 | * initialize the library. |
| 151 | * |
Daniel Veillard | 1441251 | 2005-01-21 23:53:26 +0000 | [diff] [blame] | 152 | * Do the dictionary mutex initialization. |
Daniel Veillard | ee8f1d4 | 2012-05-21 11:16:12 +0800 | [diff] [blame] | 153 | * |
| 154 | * Returns 0 if initialization was already done, and 1 if that |
| 155 | * call led to the initialization |
Daniel Veillard | 1441251 | 2005-01-21 23:53:26 +0000 | [diff] [blame] | 156 | */ |
Daniel Veillard | 379ebc1 | 2012-05-18 15:41:31 +0800 | [diff] [blame] | 157 | int xmlInitializeDict(void) { |
Daniel Veillard | 5fe9e9e | 2013-04-05 23:10:41 +0800 | [diff] [blame] | 158 | return(0); |
| 159 | } |
| 160 | |
| 161 | /** |
| 162 | * __xmlInitializeDict: |
| 163 | * |
| 164 | * This function is not public |
| 165 | * Do the dictionary mutex initialization. |
| 166 | * this function is not thread safe, initialization should |
| 167 | * normally be done once at setup when called from xmlOnceInit() |
| 168 | * we may also land in this code if thread support is not compiled in |
| 169 | * |
| 170 | * Returns 0 if initialization was already done, and 1 if that |
| 171 | * call led to the initialization |
| 172 | */ |
| 173 | int __xmlInitializeDict(void) { |
Daniel Veillard | 1441251 | 2005-01-21 23:53:26 +0000 | [diff] [blame] | 174 | if (xmlDictInitialized) |
| 175 | return(1); |
| 176 | |
| 177 | if ((xmlDictMutex = xmlNewRMutex()) == NULL) |
| 178 | return(0); |
Daniel Veillard | 379ebc1 | 2012-05-18 15:41:31 +0800 | [diff] [blame] | 179 | xmlRMutexLock(xmlDictMutex); |
Daniel Veillard | 1441251 | 2005-01-21 23:53:26 +0000 | [diff] [blame] | 180 | |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 181 | #ifdef DICT_RANDOMIZATION |
Daniel Veillard | 379ebc1 | 2012-05-18 15:41:31 +0800 | [diff] [blame] | 182 | #ifdef HAVE_RAND_R |
| 183 | rand_seed = time(NULL); |
| 184 | rand_r(& rand_seed); |
| 185 | #else |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 186 | srand(time(NULL)); |
| 187 | #endif |
Daniel Veillard | 379ebc1 | 2012-05-18 15:41:31 +0800 | [diff] [blame] | 188 | #endif |
Daniel Veillard | 1441251 | 2005-01-21 23:53:26 +0000 | [diff] [blame] | 189 | xmlDictInitialized = 1; |
Daniel Veillard | 379ebc1 | 2012-05-18 15:41:31 +0800 | [diff] [blame] | 190 | xmlRMutexUnlock(xmlDictMutex); |
Daniel Veillard | 1441251 | 2005-01-21 23:53:26 +0000 | [diff] [blame] | 191 | return(1); |
| 192 | } |
| 193 | |
Daniel Veillard | 379ebc1 | 2012-05-18 15:41:31 +0800 | [diff] [blame] | 194 | #ifdef DICT_RANDOMIZATION |
| 195 | int __xmlRandom(void) { |
| 196 | int ret; |
| 197 | |
| 198 | if (xmlDictInitialized == 0) |
Daniel Veillard | 5fe9e9e | 2013-04-05 23:10:41 +0800 | [diff] [blame] | 199 | __xmlInitializeDict(); |
Daniel Veillard | 379ebc1 | 2012-05-18 15:41:31 +0800 | [diff] [blame] | 200 | |
| 201 | xmlRMutexLock(xmlDictMutex); |
| 202 | #ifdef HAVE_RAND_R |
| 203 | ret = rand_r(& rand_seed); |
| 204 | #else |
| 205 | ret = rand(); |
| 206 | #endif |
| 207 | xmlRMutexUnlock(xmlDictMutex); |
| 208 | return(ret); |
| 209 | } |
| 210 | #endif |
| 211 | |
Daniel Veillard | 1441251 | 2005-01-21 23:53:26 +0000 | [diff] [blame] | 212 | /** |
Daniel Veillard | 2ae1338 | 2005-01-25 23:45:06 +0000 | [diff] [blame] | 213 | * xmlDictCleanup: |
Daniel Veillard | 1441251 | 2005-01-21 23:53:26 +0000 | [diff] [blame] | 214 | * |
Nick Wellnhofer | 40483d0 | 2022-03-06 13:55:48 +0100 | [diff] [blame^] | 215 | * DEPRECATED: This function will be made private. Call xmlCleanupParser |
| 216 | * to free global state but see the warnings there. xmlCleanupParser |
| 217 | * should be only called once at program exit. In most cases, you don't |
| 218 | * have call cleanup functions at all. |
| 219 | * |
Daniel Veillard | 379ebc1 | 2012-05-18 15:41:31 +0800 | [diff] [blame] | 220 | * Free the dictionary mutex. Do not call unless sure the library |
| 221 | * is not in use anymore ! |
Daniel Veillard | 1441251 | 2005-01-21 23:53:26 +0000 | [diff] [blame] | 222 | */ |
| 223 | void |
| 224 | xmlDictCleanup(void) { |
| 225 | if (!xmlDictInitialized) |
| 226 | return; |
| 227 | |
| 228 | xmlFreeRMutex(xmlDictMutex); |
| 229 | |
| 230 | xmlDictInitialized = 0; |
| 231 | } |
| 232 | |
| 233 | /* |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 234 | * xmlDictAddString: |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 235 | * @dict: the dictionary |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 236 | * @name: the name of the userdata |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 237 | * @len: the length of the name |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 238 | * |
| 239 | * Add the string to the array[s] |
| 240 | * |
| 241 | * Returns the pointer of the local string, or NULL in case of error. |
| 242 | */ |
| 243 | static const xmlChar * |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 244 | xmlDictAddString(xmlDictPtr dict, const xmlChar *name, unsigned int namelen) { |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 245 | xmlDictStringsPtr pool; |
| 246 | const xmlChar *ret; |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 247 | size_t size = 0; /* + sizeof(_xmlDictStrings) == 1024 */ |
| 248 | size_t limit = 0; |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 249 | |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 250 | #ifdef DICT_DEBUG_PATTERNS |
| 251 | fprintf(stderr, "-"); |
| 252 | #endif |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 253 | pool = dict->strings; |
| 254 | while (pool != NULL) { |
Nick Wellnhofer | 6472dfe | 2017-10-09 16:50:57 +0200 | [diff] [blame] | 255 | if ((size_t)(pool->end - pool->free) > namelen) |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 256 | goto found_pool; |
| 257 | if (pool->size > size) size = pool->size; |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 258 | limit += pool->size; |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 259 | pool = pool->next; |
| 260 | } |
| 261 | /* |
| 262 | * Not found, need to allocate |
| 263 | */ |
| 264 | if (pool == NULL) { |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 265 | if ((dict->limit > 0) && (limit > dict->limit)) { |
| 266 | return(NULL); |
| 267 | } |
| 268 | |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 269 | if (size == 0) size = 1000; |
| 270 | else size *= 4; /* exponential growth */ |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 271 | if (size < 4 * namelen) |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 272 | size = 4 * namelen; /* just in case ! */ |
| 273 | pool = (xmlDictStringsPtr) xmlMalloc(sizeof(xmlDictStrings) + size); |
| 274 | if (pool == NULL) |
| 275 | return(NULL); |
| 276 | pool->size = size; |
| 277 | pool->nbStrings = 0; |
| 278 | pool->free = &pool->array[0]; |
| 279 | pool->end = &pool->array[size]; |
| 280 | pool->next = dict->strings; |
| 281 | dict->strings = pool; |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 282 | #ifdef DICT_DEBUG_PATTERNS |
| 283 | fprintf(stderr, "+"); |
| 284 | #endif |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 285 | } |
| 286 | found_pool: |
| 287 | ret = pool->free; |
| 288 | memcpy(pool->free, name, namelen); |
| 289 | pool->free += namelen; |
| 290 | *(pool->free++) = 0; |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 291 | pool->nbStrings++; |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 292 | return(ret); |
| 293 | } |
| 294 | |
| 295 | /* |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 296 | * xmlDictAddQString: |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 297 | * @dict: the dictionary |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 298 | * @prefix: the prefix of the userdata |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 299 | * @plen: the prefix length |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 300 | * @name: the name of the userdata |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 301 | * @len: the length of the name |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 302 | * |
| 303 | * Add the QName to the array[s] |
| 304 | * |
| 305 | * Returns the pointer of the local string, or NULL in case of error. |
| 306 | */ |
| 307 | static const xmlChar * |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 308 | xmlDictAddQString(xmlDictPtr dict, const xmlChar *prefix, unsigned int plen, |
| 309 | const xmlChar *name, unsigned int namelen) |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 310 | { |
| 311 | xmlDictStringsPtr pool; |
| 312 | const xmlChar *ret; |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 313 | size_t size = 0; /* + sizeof(_xmlDictStrings) == 1024 */ |
| 314 | size_t limit = 0; |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 315 | |
| 316 | if (prefix == NULL) return(xmlDictAddString(dict, name, namelen)); |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 317 | |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 318 | #ifdef DICT_DEBUG_PATTERNS |
| 319 | fprintf(stderr, "="); |
| 320 | #endif |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 321 | pool = dict->strings; |
| 322 | while (pool != NULL) { |
Nick Wellnhofer | 6472dfe | 2017-10-09 16:50:57 +0200 | [diff] [blame] | 323 | if ((size_t)(pool->end - pool->free) > namelen + plen + 1) |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 324 | goto found_pool; |
| 325 | if (pool->size > size) size = pool->size; |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 326 | limit += pool->size; |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 327 | pool = pool->next; |
| 328 | } |
| 329 | /* |
| 330 | * Not found, need to allocate |
| 331 | */ |
| 332 | if (pool == NULL) { |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 333 | if ((dict->limit > 0) && (limit > dict->limit)) { |
| 334 | return(NULL); |
| 335 | } |
| 336 | |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 337 | if (size == 0) size = 1000; |
| 338 | else size *= 4; /* exponential growth */ |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 339 | if (size < 4 * (namelen + plen + 1)) |
| 340 | size = 4 * (namelen + plen + 1); /* just in case ! */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 341 | pool = (xmlDictStringsPtr) xmlMalloc(sizeof(xmlDictStrings) + size); |
| 342 | if (pool == NULL) |
| 343 | return(NULL); |
| 344 | pool->size = size; |
| 345 | pool->nbStrings = 0; |
| 346 | pool->free = &pool->array[0]; |
| 347 | pool->end = &pool->array[size]; |
| 348 | pool->next = dict->strings; |
| 349 | dict->strings = pool; |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 350 | #ifdef DICT_DEBUG_PATTERNS |
| 351 | fprintf(stderr, "+"); |
| 352 | #endif |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 353 | } |
| 354 | found_pool: |
| 355 | ret = pool->free; |
| 356 | memcpy(pool->free, prefix, plen); |
| 357 | pool->free += plen; |
| 358 | *(pool->free++) = ':'; |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 359 | memcpy(pool->free, name, namelen); |
| 360 | pool->free += namelen; |
| 361 | *(pool->free++) = 0; |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 362 | pool->nbStrings++; |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 363 | return(ret); |
| 364 | } |
| 365 | |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 366 | #ifdef WITH_BIG_KEY |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 367 | /* |
Daniel Veillard | e9100a5 | 2008-04-22 08:28:50 +0000 | [diff] [blame] | 368 | * xmlDictComputeBigKey: |
| 369 | * |
| 370 | * Calculate a hash key using a good hash function that works well for |
| 371 | * larger hash table sizes. |
| 372 | * |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 373 | * Hash function by "One-at-a-Time Hash" see |
Daniel Veillard | e9100a5 | 2008-04-22 08:28:50 +0000 | [diff] [blame] | 374 | * http://burtleburtle.net/bob/hash/doobs.html |
| 375 | */ |
Daniel Veillard | e9100a5 | 2008-04-22 08:28:50 +0000 | [diff] [blame] | 376 | |
Nick Wellnhofer | b88ae6d | 2019-10-14 15:38:28 +0200 | [diff] [blame] | 377 | #ifdef __clang__ |
Nick Wellnhofer | 44e7a0d | 2019-05-16 21:17:28 +0200 | [diff] [blame] | 378 | ATTRIBUTE_NO_SANITIZE("unsigned-integer-overflow") |
Nick Wellnhofer | b88ae6d | 2019-10-14 15:38:28 +0200 | [diff] [blame] | 379 | #endif |
Daniel Veillard | e9100a5 | 2008-04-22 08:28:50 +0000 | [diff] [blame] | 380 | static uint32_t |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 381 | xmlDictComputeBigKey(const xmlChar* data, int namelen, int seed) { |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 382 | uint32_t hash; |
| 383 | int i; |
Daniel Veillard | e9100a5 | 2008-04-22 08:28:50 +0000 | [diff] [blame] | 384 | |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 385 | if (namelen <= 0 || data == NULL) return(0); |
Daniel Veillard | e9100a5 | 2008-04-22 08:28:50 +0000 | [diff] [blame] | 386 | |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 387 | hash = seed; |
Daniel Veillard | e9100a5 | 2008-04-22 08:28:50 +0000 | [diff] [blame] | 388 | |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 389 | for (i = 0;i < namelen; i++) { |
| 390 | hash += data[i]; |
| 391 | hash += (hash << 10); |
| 392 | hash ^= (hash >> 6); |
Daniel Veillard | e9100a5 | 2008-04-22 08:28:50 +0000 | [diff] [blame] | 393 | } |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 394 | hash += (hash << 3); |
| 395 | hash ^= (hash >> 11); |
| 396 | hash += (hash << 15); |
Daniel Veillard | e9100a5 | 2008-04-22 08:28:50 +0000 | [diff] [blame] | 397 | |
| 398 | return hash; |
| 399 | } |
| 400 | |
| 401 | /* |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 402 | * xmlDictComputeBigQKey: |
| 403 | * |
| 404 | * Calculate a hash key for two strings using a good hash function |
| 405 | * that works well for larger hash table sizes. |
| 406 | * |
| 407 | * Hash function by "One-at-a-Time Hash" see |
| 408 | * http://burtleburtle.net/bob/hash/doobs.html |
| 409 | * |
| 410 | * Neither of the two strings must be NULL. |
| 411 | */ |
Nick Wellnhofer | b88ae6d | 2019-10-14 15:38:28 +0200 | [diff] [blame] | 412 | #ifdef __clang__ |
Nick Wellnhofer | 44e7a0d | 2019-05-16 21:17:28 +0200 | [diff] [blame] | 413 | ATTRIBUTE_NO_SANITIZE("unsigned-integer-overflow") |
Nick Wellnhofer | b88ae6d | 2019-10-14 15:38:28 +0200 | [diff] [blame] | 414 | #endif |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 415 | static unsigned long |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 416 | xmlDictComputeBigQKey(const xmlChar *prefix, int plen, |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 417 | const xmlChar *name, int len, int seed) |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 418 | { |
| 419 | uint32_t hash; |
| 420 | int i; |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 421 | |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 422 | hash = seed; |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 423 | |
| 424 | for (i = 0;i < plen; i++) { |
| 425 | hash += prefix[i]; |
| 426 | hash += (hash << 10); |
| 427 | hash ^= (hash >> 6); |
| 428 | } |
| 429 | hash += ':'; |
| 430 | hash += (hash << 10); |
| 431 | hash ^= (hash >> 6); |
| 432 | |
| 433 | for (i = 0;i < len; i++) { |
| 434 | hash += name[i]; |
| 435 | hash += (hash << 10); |
| 436 | hash ^= (hash >> 6); |
| 437 | } |
| 438 | hash += (hash << 3); |
| 439 | hash ^= (hash >> 11); |
| 440 | hash += (hash << 15); |
| 441 | |
| 442 | return hash; |
| 443 | } |
| 444 | #endif /* WITH_BIG_KEY */ |
| 445 | |
| 446 | /* |
Daniel Veillard | e9100a5 | 2008-04-22 08:28:50 +0000 | [diff] [blame] | 447 | * xmlDictComputeFastKey: |
| 448 | * |
| 449 | * Calculate a hash key using a fast hash function that works well |
| 450 | * for low hash table fill. |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 451 | */ |
| 452 | static unsigned long |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 453 | xmlDictComputeFastKey(const xmlChar *name, int namelen, int seed) { |
| 454 | unsigned long value = seed; |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 455 | |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 456 | if (name == NULL) return(0); |
Ranier Vilela | 3c8a3e9 | 2019-11-07 12:59:10 +0000 | [diff] [blame] | 457 | value += *name; |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 458 | value <<= 5; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 459 | if (namelen > 10) { |
| 460 | value += name[namelen - 1]; |
| 461 | namelen = 10; |
| 462 | } |
| 463 | switch (namelen) { |
| 464 | case 10: value += name[9]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 465 | /* Falls through. */ |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 466 | case 9: value += name[8]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 467 | /* Falls through. */ |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 468 | case 8: value += name[7]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 469 | /* Falls through. */ |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 470 | case 7: value += name[6]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 471 | /* Falls through. */ |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 472 | case 6: value += name[5]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 473 | /* Falls through. */ |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 474 | case 5: value += name[4]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 475 | /* Falls through. */ |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 476 | case 4: value += name[3]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 477 | /* Falls through. */ |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 478 | case 3: value += name[2]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 479 | /* Falls through. */ |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 480 | case 2: value += name[1]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 481 | /* Falls through. */ |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 482 | default: break; |
| 483 | } |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 484 | return(value); |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 485 | } |
| 486 | |
| 487 | /* |
Daniel Veillard | e9100a5 | 2008-04-22 08:28:50 +0000 | [diff] [blame] | 488 | * xmlDictComputeFastQKey: |
| 489 | * |
| 490 | * Calculate a hash key for two strings using a fast hash function |
| 491 | * that works well for low hash table fill. |
| 492 | * |
| 493 | * Neither of the two strings must be NULL. |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 494 | */ |
| 495 | static unsigned long |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 496 | xmlDictComputeFastQKey(const xmlChar *prefix, int plen, |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 497 | const xmlChar *name, int len, int seed) |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 498 | { |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 499 | unsigned long value = (unsigned long) seed; |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 500 | |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 501 | if (plen == 0) |
| 502 | value += 30 * (unsigned long) ':'; |
| 503 | else |
| 504 | value += 30 * (*prefix); |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 505 | |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 506 | if (len > 10) { |
David Drysdale | 6360a31 | 2015-11-20 10:47:12 +0800 | [diff] [blame] | 507 | int offset = len - (plen + 1 + 1); |
| 508 | if (offset < 0) |
| 509 | offset = len - (10 + 1); |
| 510 | value += name[offset]; |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 511 | len = 10; |
| 512 | if (plen > 10) |
| 513 | plen = 10; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 514 | } |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 515 | switch (plen) { |
| 516 | case 10: value += prefix[9]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 517 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 518 | case 9: value += prefix[8]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 519 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 520 | case 8: value += prefix[7]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 521 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 522 | case 7: value += prefix[6]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 523 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 524 | case 6: value += prefix[5]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 525 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 526 | case 5: value += prefix[4]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 527 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 528 | case 4: value += prefix[3]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 529 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 530 | case 3: value += prefix[2]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 531 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 532 | case 2: value += prefix[1]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 533 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 534 | case 1: value += prefix[0]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 535 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 536 | default: break; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 537 | } |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 538 | len -= plen; |
| 539 | if (len > 0) { |
| 540 | value += (unsigned long) ':'; |
| 541 | len--; |
| 542 | } |
| 543 | switch (len) { |
| 544 | case 10: value += name[9]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 545 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 546 | case 9: value += name[8]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 547 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 548 | case 8: value += name[7]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 549 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 550 | case 7: value += name[6]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 551 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 552 | case 6: value += name[5]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 553 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 554 | case 5: value += name[4]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 555 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 556 | case 4: value += name[3]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 557 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 558 | case 3: value += name[2]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 559 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 560 | case 2: value += name[1]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 561 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 562 | case 1: value += name[0]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 563 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 564 | default: break; |
| 565 | } |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 566 | return(value); |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 567 | } |
| 568 | |
| 569 | /** |
| 570 | * xmlDictCreate: |
| 571 | * |
| 572 | * Create a new dictionary |
| 573 | * |
Nick Wellnhofer | 8bbe450 | 2017-06-17 16:15:09 +0200 | [diff] [blame] | 574 | * Returns the newly created dictionary, or NULL if an error occurred. |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 575 | */ |
| 576 | xmlDictPtr |
| 577 | xmlDictCreate(void) { |
| 578 | xmlDictPtr dict; |
Daniel Veillard | 1441251 | 2005-01-21 23:53:26 +0000 | [diff] [blame] | 579 | |
| 580 | if (!xmlDictInitialized) |
Daniel Veillard | 5fe9e9e | 2013-04-05 23:10:41 +0800 | [diff] [blame] | 581 | if (!__xmlInitializeDict()) |
Daniel Veillard | 1441251 | 2005-01-21 23:53:26 +0000 | [diff] [blame] | 582 | return(NULL); |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 583 | |
| 584 | #ifdef DICT_DEBUG_PATTERNS |
| 585 | fprintf(stderr, "C"); |
| 586 | #endif |
| 587 | |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 588 | dict = xmlMalloc(sizeof(xmlDict)); |
| 589 | if (dict) { |
Daniel Veillard | e96a2a4 | 2003-09-24 21:23:56 +0000 | [diff] [blame] | 590 | dict->ref_counter = 1; |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 591 | dict->limit = 0; |
Daniel Veillard | e96a2a4 | 2003-09-24 21:23:56 +0000 | [diff] [blame] | 592 | |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 593 | dict->size = MIN_DICT_SIZE; |
| 594 | dict->nbElems = 0; |
| 595 | dict->dict = xmlMalloc(MIN_DICT_SIZE * sizeof(xmlDictEntry)); |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 596 | dict->strings = NULL; |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 597 | dict->subdict = NULL; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 598 | if (dict->dict) { |
Daniel Veillard | b242b08 | 2008-02-08 09:56:31 +0000 | [diff] [blame] | 599 | memset(dict->dict, 0, MIN_DICT_SIZE * sizeof(xmlDictEntry)); |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 600 | #ifdef DICT_RANDOMIZATION |
Daniel Veillard | 379ebc1 | 2012-05-18 15:41:31 +0800 | [diff] [blame] | 601 | dict->seed = __xmlRandom(); |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 602 | #else |
| 603 | dict->seed = 0; |
| 604 | #endif |
Daniel Veillard | b242b08 | 2008-02-08 09:56:31 +0000 | [diff] [blame] | 605 | return(dict); |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 606 | } |
| 607 | xmlFree(dict); |
| 608 | } |
| 609 | return(NULL); |
| 610 | } |
| 611 | |
| 612 | /** |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 613 | * xmlDictCreateSub: |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 614 | * @sub: an existing dictionary |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 615 | * |
| 616 | * Create a new dictionary, inheriting strings from the read-only |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 617 | * dictionary @sub. On lookup, strings are first searched in the |
| 618 | * new dictionary, then in @sub, and if not found are created in the |
| 619 | * new dictionary. |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 620 | * |
Nick Wellnhofer | 8bbe450 | 2017-06-17 16:15:09 +0200 | [diff] [blame] | 621 | * Returns the newly created dictionary, or NULL if an error occurred. |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 622 | */ |
| 623 | xmlDictPtr |
| 624 | xmlDictCreateSub(xmlDictPtr sub) { |
| 625 | xmlDictPtr dict = xmlDictCreate(); |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 626 | |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 627 | if ((dict != NULL) && (sub != NULL)) { |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 628 | #ifdef DICT_DEBUG_PATTERNS |
| 629 | fprintf(stderr, "R"); |
| 630 | #endif |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 631 | dict->seed = sub->seed; |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 632 | dict->subdict = sub; |
| 633 | xmlDictReference(dict->subdict); |
| 634 | } |
| 635 | return(dict); |
| 636 | } |
| 637 | |
| 638 | /** |
Daniel Veillard | e96a2a4 | 2003-09-24 21:23:56 +0000 | [diff] [blame] | 639 | * xmlDictReference: |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 640 | * @dict: the dictionary |
Daniel Veillard | e96a2a4 | 2003-09-24 21:23:56 +0000 | [diff] [blame] | 641 | * |
| 642 | * Increment the reference counter of a dictionary |
| 643 | * |
| 644 | * Returns 0 in case of success and -1 in case of error |
| 645 | */ |
| 646 | int |
| 647 | xmlDictReference(xmlDictPtr dict) { |
Daniel Veillard | 1441251 | 2005-01-21 23:53:26 +0000 | [diff] [blame] | 648 | if (!xmlDictInitialized) |
Daniel Veillard | 5fe9e9e | 2013-04-05 23:10:41 +0800 | [diff] [blame] | 649 | if (!__xmlInitializeDict()) |
Daniel Veillard | 1441251 | 2005-01-21 23:53:26 +0000 | [diff] [blame] | 650 | return(-1); |
| 651 | |
Daniel Veillard | e96a2a4 | 2003-09-24 21:23:56 +0000 | [diff] [blame] | 652 | if (dict == NULL) return -1; |
Daniel Veillard | 1441251 | 2005-01-21 23:53:26 +0000 | [diff] [blame] | 653 | xmlRMutexLock(xmlDictMutex); |
Daniel Veillard | e96a2a4 | 2003-09-24 21:23:56 +0000 | [diff] [blame] | 654 | dict->ref_counter++; |
Daniel Veillard | 1441251 | 2005-01-21 23:53:26 +0000 | [diff] [blame] | 655 | xmlRMutexUnlock(xmlDictMutex); |
Daniel Veillard | e96a2a4 | 2003-09-24 21:23:56 +0000 | [diff] [blame] | 656 | return(0); |
| 657 | } |
| 658 | |
| 659 | /** |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 660 | * xmlDictGrow: |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 661 | * @dict: the dictionary |
| 662 | * @size: the new size of the dictionary |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 663 | * |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 664 | * resize the dictionary |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 665 | * |
| 666 | * Returns 0 in case of success, -1 in case of failure |
| 667 | */ |
| 668 | static int |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 669 | xmlDictGrow(xmlDictPtr dict, size_t size) { |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 670 | unsigned long key, okey; |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 671 | size_t oldsize, i; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 672 | xmlDictEntryPtr iter, next; |
| 673 | struct _xmlDictEntry *olddict; |
| 674 | #ifdef DEBUG_GROW |
| 675 | unsigned long nbElem = 0; |
| 676 | #endif |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 677 | int ret = 0; |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 678 | int keep_keys = 1; |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 679 | |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 680 | if (dict == NULL) |
| 681 | return(-1); |
| 682 | if (size < 8) |
| 683 | return(-1); |
| 684 | if (size > 8 * 2048) |
| 685 | return(-1); |
| 686 | |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 687 | #ifdef DICT_DEBUG_PATTERNS |
| 688 | fprintf(stderr, "*"); |
| 689 | #endif |
| 690 | |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 691 | oldsize = dict->size; |
| 692 | olddict = dict->dict; |
| 693 | if (olddict == NULL) |
| 694 | return(-1); |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 695 | if (oldsize == MIN_DICT_SIZE) |
| 696 | keep_keys = 0; |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 697 | |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 698 | dict->dict = xmlMalloc(size * sizeof(xmlDictEntry)); |
| 699 | if (dict->dict == NULL) { |
| 700 | dict->dict = olddict; |
| 701 | return(-1); |
| 702 | } |
| 703 | memset(dict->dict, 0, size * sizeof(xmlDictEntry)); |
| 704 | dict->size = size; |
| 705 | |
| 706 | /* If the two loops are merged, there would be situations where |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 707 | a new entry needs to allocated and data copied into it from |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 708 | the main dict. It is nicer to run through the array twice, first |
| 709 | copying all the elements in the main array (less probability of |
| 710 | allocate) and then the rest, so we only free in the second loop. |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 711 | */ |
| 712 | for (i = 0; i < oldsize; i++) { |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 713 | if (olddict[i].valid == 0) |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 714 | continue; |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 715 | |
| 716 | if (keep_keys) |
| 717 | okey = olddict[i].okey; |
| 718 | else |
| 719 | okey = xmlDictComputeKey(dict, olddict[i].name, olddict[i].len); |
| 720 | key = okey % dict->size; |
| 721 | |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 722 | if (dict->dict[key].valid == 0) { |
| 723 | memcpy(&(dict->dict[key]), &(olddict[i]), sizeof(xmlDictEntry)); |
| 724 | dict->dict[key].next = NULL; |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 725 | dict->dict[key].okey = okey; |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 726 | } else { |
| 727 | xmlDictEntryPtr entry; |
| 728 | |
| 729 | entry = xmlMalloc(sizeof(xmlDictEntry)); |
| 730 | if (entry != NULL) { |
| 731 | entry->name = olddict[i].name; |
| 732 | entry->len = olddict[i].len; |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 733 | entry->okey = okey; |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 734 | entry->next = dict->dict[key].next; |
| 735 | entry->valid = 1; |
| 736 | dict->dict[key].next = entry; |
| 737 | } else { |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 738 | /* |
Jared Yanovich | 2a350ee | 2019-09-30 17:04:54 +0200 | [diff] [blame] | 739 | * we don't have much ways to alert from here |
Nick Wellnhofer | 8bbe450 | 2017-06-17 16:15:09 +0200 | [diff] [blame] | 740 | * result is losing an entry and unicity guarantee |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 741 | */ |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 742 | ret = -1; |
| 743 | } |
| 744 | } |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 745 | #ifdef DEBUG_GROW |
| 746 | nbElem++; |
| 747 | #endif |
| 748 | } |
| 749 | |
| 750 | for (i = 0; i < oldsize; i++) { |
| 751 | iter = olddict[i].next; |
| 752 | while (iter) { |
| 753 | next = iter->next; |
| 754 | |
| 755 | /* |
| 756 | * put back the entry in the new dict |
| 757 | */ |
| 758 | |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 759 | if (keep_keys) |
| 760 | okey = iter->okey; |
| 761 | else |
| 762 | okey = xmlDictComputeKey(dict, iter->name, iter->len); |
| 763 | key = okey % dict->size; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 764 | if (dict->dict[key].valid == 0) { |
| 765 | memcpy(&(dict->dict[key]), iter, sizeof(xmlDictEntry)); |
| 766 | dict->dict[key].next = NULL; |
| 767 | dict->dict[key].valid = 1; |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 768 | dict->dict[key].okey = okey; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 769 | xmlFree(iter); |
| 770 | } else { |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 771 | iter->next = dict->dict[key].next; |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 772 | iter->okey = okey; |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 773 | dict->dict[key].next = iter; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 774 | } |
| 775 | |
| 776 | #ifdef DEBUG_GROW |
| 777 | nbElem++; |
| 778 | #endif |
| 779 | |
| 780 | iter = next; |
| 781 | } |
| 782 | } |
| 783 | |
| 784 | xmlFree(olddict); |
| 785 | |
| 786 | #ifdef DEBUG_GROW |
| 787 | xmlGenericError(xmlGenericErrorContext, |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 788 | "xmlDictGrow : from %lu to %lu, %u elems\n", oldsize, size, nbElem); |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 789 | #endif |
| 790 | |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 791 | return(ret); |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 792 | } |
| 793 | |
| 794 | /** |
| 795 | * xmlDictFree: |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 796 | * @dict: the dictionary |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 797 | * |
| 798 | * Free the hash @dict and its contents. The userdata is |
| 799 | * deallocated with @f if provided. |
| 800 | */ |
| 801 | void |
| 802 | xmlDictFree(xmlDictPtr dict) { |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 803 | size_t i; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 804 | xmlDictEntryPtr iter; |
| 805 | xmlDictEntryPtr next; |
| 806 | int inside_dict = 0; |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 807 | xmlDictStringsPtr pool, nextp; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 808 | |
| 809 | if (dict == NULL) |
| 810 | return; |
Daniel Veillard | e96a2a4 | 2003-09-24 21:23:56 +0000 | [diff] [blame] | 811 | |
Daniel Veillard | 1441251 | 2005-01-21 23:53:26 +0000 | [diff] [blame] | 812 | if (!xmlDictInitialized) |
Daniel Veillard | 5fe9e9e | 2013-04-05 23:10:41 +0800 | [diff] [blame] | 813 | if (!__xmlInitializeDict()) |
Daniel Veillard | 1441251 | 2005-01-21 23:53:26 +0000 | [diff] [blame] | 814 | return; |
| 815 | |
Daniel Veillard | e96a2a4 | 2003-09-24 21:23:56 +0000 | [diff] [blame] | 816 | /* decrement the counter, it may be shared by a parser and docs */ |
Daniel Veillard | 1441251 | 2005-01-21 23:53:26 +0000 | [diff] [blame] | 817 | xmlRMutexLock(xmlDictMutex); |
Daniel Veillard | e96a2a4 | 2003-09-24 21:23:56 +0000 | [diff] [blame] | 818 | dict->ref_counter--; |
Daniel Veillard | 1bb16a1 | 2005-01-21 16:55:41 +0000 | [diff] [blame] | 819 | if (dict->ref_counter > 0) { |
Daniel Veillard | 1441251 | 2005-01-21 23:53:26 +0000 | [diff] [blame] | 820 | xmlRMutexUnlock(xmlDictMutex); |
Daniel Veillard | 1bb16a1 | 2005-01-21 16:55:41 +0000 | [diff] [blame] | 821 | return; |
| 822 | } |
| 823 | |
Daniel Veillard | 1441251 | 2005-01-21 23:53:26 +0000 | [diff] [blame] | 824 | xmlRMutexUnlock(xmlDictMutex); |
Daniel Veillard | e96a2a4 | 2003-09-24 21:23:56 +0000 | [diff] [blame] | 825 | |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 826 | if (dict->subdict != NULL) { |
| 827 | xmlDictFree(dict->subdict); |
| 828 | } |
| 829 | |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 830 | if (dict->dict) { |
Daniel Veillard | 6155d8a | 2003-08-19 15:01:28 +0000 | [diff] [blame] | 831 | for(i = 0; ((i < dict->size) && (dict->nbElems > 0)); i++) { |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 832 | iter = &(dict->dict[i]); |
| 833 | if (iter->valid == 0) |
| 834 | continue; |
| 835 | inside_dict = 1; |
| 836 | while (iter) { |
| 837 | next = iter->next; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 838 | if (!inside_dict) |
| 839 | xmlFree(iter); |
Daniel Veillard | 6155d8a | 2003-08-19 15:01:28 +0000 | [diff] [blame] | 840 | dict->nbElems--; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 841 | inside_dict = 0; |
| 842 | iter = next; |
| 843 | } |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 844 | } |
| 845 | xmlFree(dict->dict); |
| 846 | } |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 847 | pool = dict->strings; |
| 848 | while (pool != NULL) { |
| 849 | nextp = pool->next; |
| 850 | xmlFree(pool); |
| 851 | pool = nextp; |
| 852 | } |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 853 | xmlFree(dict); |
| 854 | } |
| 855 | |
| 856 | /** |
| 857 | * xmlDictLookup: |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 858 | * @dict: the dictionary |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 859 | * @name: the name of the userdata |
Daniel Veillard | 0fb1893 | 2003-09-07 09:14:37 +0000 | [diff] [blame] | 860 | * @len: the length of the name, if -1 it is recomputed |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 861 | * |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 862 | * Add the @name to the dictionary @dict if not present. |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 863 | * |
| 864 | * Returns the internal copy of the name or NULL in case of internal error |
| 865 | */ |
| 866 | const xmlChar * |
| 867 | xmlDictLookup(xmlDictPtr dict, const xmlChar *name, int len) { |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 868 | unsigned long key, okey, nbi = 0; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 869 | xmlDictEntryPtr entry; |
| 870 | xmlDictEntryPtr insert; |
| 871 | const xmlChar *ret; |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 872 | unsigned int l; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 873 | |
Daniel Veillard | 0fb1893 | 2003-09-07 09:14:37 +0000 | [diff] [blame] | 874 | if ((dict == NULL) || (name == NULL)) |
| 875 | return(NULL); |
| 876 | |
| 877 | if (len < 0) |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 878 | l = strlen((const char *) name); |
| 879 | else |
| 880 | l = len; |
| 881 | |
| 882 | if (((dict->limit > 0) && (l >= dict->limit)) || |
| 883 | (l > INT_MAX / 2)) |
| 884 | return(NULL); |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 885 | |
| 886 | /* |
| 887 | * Check for duplicate and insertion location. |
| 888 | */ |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 889 | okey = xmlDictComputeKey(dict, name, l); |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 890 | key = okey % dict->size; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 891 | if (dict->dict[key].valid == 0) { |
| 892 | insert = NULL; |
| 893 | } else { |
| 894 | for (insert = &(dict->dict[key]); insert->next != NULL; |
| 895 | insert = insert->next) { |
Daniel Veillard | c82c57e | 2004-01-12 16:24:34 +0000 | [diff] [blame] | 896 | #ifdef __GNUC__ |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 897 | if ((insert->okey == okey) && (insert->len == l)) { |
| 898 | if (!memcmp(insert->name, name, l)) |
Daniel Veillard | c82c57e | 2004-01-12 16:24:34 +0000 | [diff] [blame] | 899 | return(insert->name); |
| 900 | } |
| 901 | #else |
Patrick Gansterer | fd4f6fd | 2012-08-13 17:54:20 +0800 | [diff] [blame] | 902 | if ((insert->okey == okey) && (insert->len == l) && |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 903 | (!xmlStrncmp(insert->name, name, l))) |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 904 | return(insert->name); |
Daniel Veillard | c82c57e | 2004-01-12 16:24:34 +0000 | [diff] [blame] | 905 | #endif |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 906 | nbi++; |
| 907 | } |
Daniel Veillard | c82c57e | 2004-01-12 16:24:34 +0000 | [diff] [blame] | 908 | #ifdef __GNUC__ |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 909 | if ((insert->okey == okey) && (insert->len == l)) { |
| 910 | if (!memcmp(insert->name, name, l)) |
Daniel Veillard | c82c57e | 2004-01-12 16:24:34 +0000 | [diff] [blame] | 911 | return(insert->name); |
| 912 | } |
| 913 | #else |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 914 | if ((insert->okey == okey) && (insert->len == l) && |
| 915 | (!xmlStrncmp(insert->name, name, l))) |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 916 | return(insert->name); |
Daniel Veillard | c82c57e | 2004-01-12 16:24:34 +0000 | [diff] [blame] | 917 | #endif |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 918 | } |
| 919 | |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 920 | if (dict->subdict) { |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 921 | unsigned long skey; |
| 922 | |
| 923 | /* we cannot always reuse the same okey for the subdict */ |
| 924 | if (((dict->size == MIN_DICT_SIZE) && |
| 925 | (dict->subdict->size != MIN_DICT_SIZE)) || |
| 926 | ((dict->size != MIN_DICT_SIZE) && |
| 927 | (dict->subdict->size == MIN_DICT_SIZE))) |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 928 | skey = xmlDictComputeKey(dict->subdict, name, l); |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 929 | else |
| 930 | skey = okey; |
| 931 | |
| 932 | key = skey % dict->subdict->size; |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 933 | if (dict->subdict->dict[key].valid != 0) { |
| 934 | xmlDictEntryPtr tmp; |
| 935 | |
| 936 | for (tmp = &(dict->subdict->dict[key]); tmp->next != NULL; |
| 937 | tmp = tmp->next) { |
| 938 | #ifdef __GNUC__ |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 939 | if ((tmp->okey == skey) && (tmp->len == l)) { |
| 940 | if (!memcmp(tmp->name, name, l)) |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 941 | return(tmp->name); |
| 942 | } |
| 943 | #else |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 944 | if ((tmp->okey == skey) && (tmp->len == l) && |
| 945 | (!xmlStrncmp(tmp->name, name, l))) |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 946 | return(tmp->name); |
| 947 | #endif |
| 948 | nbi++; |
| 949 | } |
| 950 | #ifdef __GNUC__ |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 951 | if ((tmp->okey == skey) && (tmp->len == l)) { |
| 952 | if (!memcmp(tmp->name, name, l)) |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 953 | return(tmp->name); |
| 954 | } |
| 955 | #else |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 956 | if ((tmp->okey == skey) && (tmp->len == l) && |
| 957 | (!xmlStrncmp(tmp->name, name, l))) |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 958 | return(tmp->name); |
| 959 | #endif |
| 960 | } |
| 961 | key = okey % dict->size; |
| 962 | } |
| 963 | |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 964 | ret = xmlDictAddString(dict, name, l); |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 965 | if (ret == NULL) |
| 966 | return(NULL); |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 967 | if (insert == NULL) { |
| 968 | entry = &(dict->dict[key]); |
| 969 | } else { |
| 970 | entry = xmlMalloc(sizeof(xmlDictEntry)); |
| 971 | if (entry == NULL) |
| 972 | return(NULL); |
| 973 | } |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 974 | entry->name = ret; |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 975 | entry->len = l; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 976 | entry->next = NULL; |
| 977 | entry->valid = 1; |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 978 | entry->okey = okey; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 979 | |
| 980 | |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 981 | if (insert != NULL) |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 982 | insert->next = entry; |
| 983 | |
| 984 | dict->nbElems++; |
| 985 | |
| 986 | if ((nbi > MAX_HASH_LEN) && |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 987 | (dict->size <= ((MAX_DICT_HASH / 2) / MAX_HASH_LEN))) { |
| 988 | if (xmlDictGrow(dict, MAX_HASH_LEN * 2 * dict->size) != 0) |
| 989 | return(NULL); |
| 990 | } |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 991 | /* Note that entry may have been freed at this point by xmlDictGrow */ |
| 992 | |
| 993 | return(ret); |
| 994 | } |
| 995 | |
| 996 | /** |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 997 | * xmlDictExists: |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 998 | * @dict: the dictionary |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 999 | * @name: the name of the userdata |
| 1000 | * @len: the length of the name, if -1 it is recomputed |
| 1001 | * |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 1002 | * Check if the @name exists in the dictionary @dict. |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 1003 | * |
| 1004 | * Returns the internal copy of the name or NULL if not found. |
| 1005 | */ |
| 1006 | const xmlChar * |
| 1007 | xmlDictExists(xmlDictPtr dict, const xmlChar *name, int len) { |
| 1008 | unsigned long key, okey, nbi = 0; |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 1009 | xmlDictEntryPtr insert; |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1010 | unsigned int l; |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 1011 | |
| 1012 | if ((dict == NULL) || (name == NULL)) |
| 1013 | return(NULL); |
| 1014 | |
| 1015 | if (len < 0) |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1016 | l = strlen((const char *) name); |
| 1017 | else |
| 1018 | l = len; |
| 1019 | if (((dict->limit > 0) && (l >= dict->limit)) || |
| 1020 | (l > INT_MAX / 2)) |
| 1021 | return(NULL); |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 1022 | |
| 1023 | /* |
| 1024 | * Check for duplicate and insertion location. |
| 1025 | */ |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1026 | okey = xmlDictComputeKey(dict, name, l); |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 1027 | key = okey % dict->size; |
| 1028 | if (dict->dict[key].valid == 0) { |
| 1029 | insert = NULL; |
| 1030 | } else { |
| 1031 | for (insert = &(dict->dict[key]); insert->next != NULL; |
| 1032 | insert = insert->next) { |
| 1033 | #ifdef __GNUC__ |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1034 | if ((insert->okey == okey) && (insert->len == l)) { |
| 1035 | if (!memcmp(insert->name, name, l)) |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 1036 | return(insert->name); |
| 1037 | } |
| 1038 | #else |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1039 | if ((insert->okey == okey) && (insert->len == l) && |
| 1040 | (!xmlStrncmp(insert->name, name, l))) |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 1041 | return(insert->name); |
| 1042 | #endif |
| 1043 | nbi++; |
| 1044 | } |
| 1045 | #ifdef __GNUC__ |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1046 | if ((insert->okey == okey) && (insert->len == l)) { |
| 1047 | if (!memcmp(insert->name, name, l)) |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 1048 | return(insert->name); |
| 1049 | } |
| 1050 | #else |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1051 | if ((insert->okey == okey) && (insert->len == l) && |
| 1052 | (!xmlStrncmp(insert->name, name, l))) |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 1053 | return(insert->name); |
| 1054 | #endif |
| 1055 | } |
| 1056 | |
| 1057 | if (dict->subdict) { |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 1058 | unsigned long skey; |
| 1059 | |
| 1060 | /* we cannot always reuse the same okey for the subdict */ |
| 1061 | if (((dict->size == MIN_DICT_SIZE) && |
| 1062 | (dict->subdict->size != MIN_DICT_SIZE)) || |
| 1063 | ((dict->size != MIN_DICT_SIZE) && |
| 1064 | (dict->subdict->size == MIN_DICT_SIZE))) |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1065 | skey = xmlDictComputeKey(dict->subdict, name, l); |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 1066 | else |
| 1067 | skey = okey; |
| 1068 | |
| 1069 | key = skey % dict->subdict->size; |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 1070 | if (dict->subdict->dict[key].valid != 0) { |
| 1071 | xmlDictEntryPtr tmp; |
| 1072 | |
| 1073 | for (tmp = &(dict->subdict->dict[key]); tmp->next != NULL; |
| 1074 | tmp = tmp->next) { |
| 1075 | #ifdef __GNUC__ |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1076 | if ((tmp->okey == skey) && (tmp->len == l)) { |
| 1077 | if (!memcmp(tmp->name, name, l)) |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 1078 | return(tmp->name); |
| 1079 | } |
| 1080 | #else |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1081 | if ((tmp->okey == skey) && (tmp->len == l) && |
| 1082 | (!xmlStrncmp(tmp->name, name, l))) |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 1083 | return(tmp->name); |
| 1084 | #endif |
| 1085 | nbi++; |
| 1086 | } |
| 1087 | #ifdef __GNUC__ |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1088 | if ((tmp->okey == skey) && (tmp->len == l)) { |
| 1089 | if (!memcmp(tmp->name, name, l)) |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 1090 | return(tmp->name); |
| 1091 | } |
| 1092 | #else |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1093 | if ((tmp->okey == skey) && (tmp->len == l) && |
| 1094 | (!xmlStrncmp(tmp->name, name, l))) |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 1095 | return(tmp->name); |
| 1096 | #endif |
| 1097 | } |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 1098 | } |
| 1099 | |
| 1100 | /* not found */ |
| 1101 | return(NULL); |
| 1102 | } |
| 1103 | |
| 1104 | /** |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 1105 | * xmlDictQLookup: |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 1106 | * @dict: the dictionary |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 1107 | * @prefix: the prefix |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 1108 | * @name: the name |
| 1109 | * |
| 1110 | * Add the QName @prefix:@name to the hash @dict if not present. |
| 1111 | * |
| 1112 | * Returns the internal copy of the QName or NULL in case of internal error |
| 1113 | */ |
| 1114 | const xmlChar * |
| 1115 | xmlDictQLookup(xmlDictPtr dict, const xmlChar *prefix, const xmlChar *name) { |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 1116 | unsigned long okey, key, nbi = 0; |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 1117 | xmlDictEntryPtr entry; |
| 1118 | xmlDictEntryPtr insert; |
| 1119 | const xmlChar *ret; |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1120 | unsigned int len, plen, l; |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 1121 | |
| 1122 | if ((dict == NULL) || (name == NULL)) |
| 1123 | return(NULL); |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 1124 | if (prefix == NULL) |
| 1125 | return(xmlDictLookup(dict, name, -1)); |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 1126 | |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 1127 | l = len = strlen((const char *) name); |
| 1128 | plen = strlen((const char *) prefix); |
| 1129 | len += 1 + plen; |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 1130 | |
| 1131 | /* |
| 1132 | * Check for duplicate and insertion location. |
| 1133 | */ |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 1134 | okey = xmlDictComputeQKey(dict, prefix, plen, name, l); |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 1135 | key = okey % dict->size; |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 1136 | if (dict->dict[key].valid == 0) { |
| 1137 | insert = NULL; |
| 1138 | } else { |
| 1139 | for (insert = &(dict->dict[key]); insert->next != NULL; |
| 1140 | insert = insert->next) { |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 1141 | if ((insert->okey == okey) && (insert->len == len) && |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 1142 | (xmlStrQEqual(prefix, name, insert->name))) |
| 1143 | return(insert->name); |
| 1144 | nbi++; |
| 1145 | } |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 1146 | if ((insert->okey == okey) && (insert->len == len) && |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 1147 | (xmlStrQEqual(prefix, name, insert->name))) |
| 1148 | return(insert->name); |
| 1149 | } |
| 1150 | |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 1151 | if (dict->subdict) { |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 1152 | unsigned long skey; |
| 1153 | |
| 1154 | /* we cannot always reuse the same okey for the subdict */ |
| 1155 | if (((dict->size == MIN_DICT_SIZE) && |
| 1156 | (dict->subdict->size != MIN_DICT_SIZE)) || |
| 1157 | ((dict->size != MIN_DICT_SIZE) && |
| 1158 | (dict->subdict->size == MIN_DICT_SIZE))) |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 1159 | skey = xmlDictComputeQKey(dict->subdict, prefix, plen, name, l); |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 1160 | else |
| 1161 | skey = okey; |
| 1162 | |
| 1163 | key = skey % dict->subdict->size; |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 1164 | if (dict->subdict->dict[key].valid != 0) { |
| 1165 | xmlDictEntryPtr tmp; |
| 1166 | for (tmp = &(dict->subdict->dict[key]); tmp->next != NULL; |
| 1167 | tmp = tmp->next) { |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 1168 | if ((tmp->okey == skey) && (tmp->len == len) && |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 1169 | (xmlStrQEqual(prefix, name, tmp->name))) |
| 1170 | return(tmp->name); |
| 1171 | nbi++; |
| 1172 | } |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 1173 | if ((tmp->okey == skey) && (tmp->len == len) && |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 1174 | (xmlStrQEqual(prefix, name, tmp->name))) |
| 1175 | return(tmp->name); |
| 1176 | } |
| 1177 | key = okey % dict->size; |
| 1178 | } |
| 1179 | |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 1180 | ret = xmlDictAddQString(dict, prefix, plen, name, l); |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 1181 | if (ret == NULL) |
| 1182 | return(NULL); |
| 1183 | if (insert == NULL) { |
| 1184 | entry = &(dict->dict[key]); |
| 1185 | } else { |
| 1186 | entry = xmlMalloc(sizeof(xmlDictEntry)); |
| 1187 | if (entry == NULL) |
| 1188 | return(NULL); |
| 1189 | } |
| 1190 | entry->name = ret; |
| 1191 | entry->len = len; |
| 1192 | entry->next = NULL; |
| 1193 | entry->valid = 1; |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 1194 | entry->okey = okey; |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 1195 | |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1196 | if (insert != NULL) |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 1197 | insert->next = entry; |
| 1198 | |
| 1199 | dict->nbElems++; |
| 1200 | |
| 1201 | if ((nbi > MAX_HASH_LEN) && |
| 1202 | (dict->size <= ((MAX_DICT_HASH / 2) / MAX_HASH_LEN))) |
| 1203 | xmlDictGrow(dict, MAX_HASH_LEN * 2 * dict->size); |
| 1204 | /* Note that entry may have been freed at this point by xmlDictGrow */ |
| 1205 | |
| 1206 | return(ret); |
| 1207 | } |
| 1208 | |
| 1209 | /** |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 1210 | * xmlDictOwns: |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 1211 | * @dict: the dictionary |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 1212 | * @str: the string |
| 1213 | * |
Jared Yanovich | 2a350ee | 2019-09-30 17:04:54 +0200 | [diff] [blame] | 1214 | * check if a string is owned by the dictionary |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 1215 | * |
| 1216 | * Returns 1 if true, 0 if false and -1 in case of error |
| 1217 | * -1 in case of error |
| 1218 | */ |
| 1219 | int |
| 1220 | xmlDictOwns(xmlDictPtr dict, const xmlChar *str) { |
| 1221 | xmlDictStringsPtr pool; |
| 1222 | |
| 1223 | if ((dict == NULL) || (str == NULL)) |
| 1224 | return(-1); |
| 1225 | pool = dict->strings; |
| 1226 | while (pool != NULL) { |
William M. Brack | bf5cf21 | 2004-08-31 06:47:17 +0000 | [diff] [blame] | 1227 | if ((str >= &pool->array[0]) && (str <= pool->free)) |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 1228 | return(1); |
| 1229 | pool = pool->next; |
| 1230 | } |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 1231 | if (dict->subdict) |
| 1232 | return(xmlDictOwns(dict->subdict, str)); |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 1233 | return(0); |
| 1234 | } |
Daniel Veillard | e96a2a4 | 2003-09-24 21:23:56 +0000 | [diff] [blame] | 1235 | |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 1236 | /** |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 1237 | * xmlDictSize: |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 1238 | * @dict: the dictionary |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 1239 | * |
| 1240 | * Query the number of elements installed in the hash @dict. |
| 1241 | * |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 1242 | * Returns the number of elements in the dictionary or |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 1243 | * -1 in case of error |
| 1244 | */ |
| 1245 | int |
| 1246 | xmlDictSize(xmlDictPtr dict) { |
| 1247 | if (dict == NULL) |
| 1248 | return(-1); |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 1249 | if (dict->subdict) |
| 1250 | return(dict->nbElems + dict->subdict->nbElems); |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 1251 | return(dict->nbElems); |
| 1252 | } |
| 1253 | |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1254 | /** |
| 1255 | * xmlDictSetLimit: |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 1256 | * @dict: the dictionary |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1257 | * @limit: the limit in bytes |
| 1258 | * |
| 1259 | * Set a size limit for the dictionary |
| 1260 | * Added in 2.9.0 |
| 1261 | * |
| 1262 | * Returns the previous limit of the dictionary or 0 |
| 1263 | */ |
| 1264 | size_t |
| 1265 | xmlDictSetLimit(xmlDictPtr dict, size_t limit) { |
| 1266 | size_t ret; |
| 1267 | |
| 1268 | if (dict == NULL) |
| 1269 | return(0); |
| 1270 | ret = dict->limit; |
| 1271 | dict->limit = limit; |
| 1272 | return(ret); |
| 1273 | } |
| 1274 | |
| 1275 | /** |
| 1276 | * xmlDictGetUsage: |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 1277 | * @dict: the dictionary |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1278 | * |
| 1279 | * Get how much memory is used by a dictionary for strings |
| 1280 | * Added in 2.9.0 |
| 1281 | * |
| 1282 | * Returns the amount of strings allocated |
| 1283 | */ |
| 1284 | size_t |
| 1285 | xmlDictGetUsage(xmlDictPtr dict) { |
| 1286 | xmlDictStringsPtr pool; |
| 1287 | size_t limit = 0; |
| 1288 | |
| 1289 | if (dict == NULL) |
| 1290 | return(0); |
| 1291 | pool = dict->strings; |
| 1292 | while (pool != NULL) { |
| 1293 | limit += pool->size; |
| 1294 | pool = pool->next; |
| 1295 | } |
| 1296 | return(limit); |
| 1297 | } |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 1298 | |