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