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