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