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 |
Nick Wellnhofer | 7f3f3f1 | 2023-05-03 03:20:14 +0200 | [diff] [blame] | 65 | #define MAX_DICT_HASH 100000000 |
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 | 8c2e508 | 2023-03-12 14:45:14 +0100 | [diff] [blame] | 357 | ATTRIBUTE_NO_SANITIZE("unsigned-shift-base") |
Nick Wellnhofer | b88ae6d | 2019-10-14 15:38:28 +0200 | [diff] [blame] | 358 | #endif |
Daniel Veillard | e9100a5 | 2008-04-22 08:28:50 +0000 | [diff] [blame] | 359 | static uint32_t |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 360 | xmlDictComputeBigKey(const xmlChar* data, int namelen, int seed) { |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 361 | uint32_t hash; |
| 362 | int i; |
Daniel Veillard | e9100a5 | 2008-04-22 08:28:50 +0000 | [diff] [blame] | 363 | |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 364 | if (namelen <= 0 || data == NULL) return(0); |
Daniel Veillard | e9100a5 | 2008-04-22 08:28:50 +0000 | [diff] [blame] | 365 | |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 366 | hash = seed; |
Daniel Veillard | e9100a5 | 2008-04-22 08:28:50 +0000 | [diff] [blame] | 367 | |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 368 | for (i = 0;i < namelen; i++) { |
| 369 | hash += data[i]; |
| 370 | hash += (hash << 10); |
| 371 | hash ^= (hash >> 6); |
Daniel Veillard | e9100a5 | 2008-04-22 08:28:50 +0000 | [diff] [blame] | 372 | } |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 373 | hash += (hash << 3); |
| 374 | hash ^= (hash >> 11); |
| 375 | hash += (hash << 15); |
Daniel Veillard | e9100a5 | 2008-04-22 08:28:50 +0000 | [diff] [blame] | 376 | |
| 377 | return hash; |
| 378 | } |
| 379 | |
| 380 | /* |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 381 | * xmlDictComputeBigQKey: |
| 382 | * |
| 383 | * Calculate a hash key for two strings using a good hash function |
| 384 | * that works well for larger hash table sizes. |
| 385 | * |
| 386 | * Hash function by "One-at-a-Time Hash" see |
| 387 | * http://burtleburtle.net/bob/hash/doobs.html |
| 388 | * |
| 389 | * Neither of the two strings must be NULL. |
| 390 | */ |
Nick Wellnhofer | b88ae6d | 2019-10-14 15:38:28 +0200 | [diff] [blame] | 391 | #ifdef __clang__ |
Nick Wellnhofer | 44e7a0d | 2019-05-16 21:17:28 +0200 | [diff] [blame] | 392 | ATTRIBUTE_NO_SANITIZE("unsigned-integer-overflow") |
Nick Wellnhofer | 8c2e508 | 2023-03-12 14:45:14 +0100 | [diff] [blame] | 393 | ATTRIBUTE_NO_SANITIZE("unsigned-shift-base") |
Nick Wellnhofer | b88ae6d | 2019-10-14 15:38:28 +0200 | [diff] [blame] | 394 | #endif |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 395 | static unsigned long |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 396 | xmlDictComputeBigQKey(const xmlChar *prefix, int plen, |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 397 | const xmlChar *name, int len, int seed) |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 398 | { |
| 399 | uint32_t hash; |
| 400 | int i; |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 401 | |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 402 | hash = seed; |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 403 | |
| 404 | for (i = 0;i < plen; i++) { |
| 405 | hash += prefix[i]; |
| 406 | hash += (hash << 10); |
| 407 | hash ^= (hash >> 6); |
| 408 | } |
| 409 | hash += ':'; |
| 410 | hash += (hash << 10); |
| 411 | hash ^= (hash >> 6); |
| 412 | |
| 413 | for (i = 0;i < len; i++) { |
| 414 | hash += name[i]; |
| 415 | hash += (hash << 10); |
| 416 | hash ^= (hash >> 6); |
| 417 | } |
| 418 | hash += (hash << 3); |
| 419 | hash ^= (hash >> 11); |
| 420 | hash += (hash << 15); |
| 421 | |
| 422 | return hash; |
| 423 | } |
| 424 | #endif /* WITH_BIG_KEY */ |
| 425 | |
| 426 | /* |
Daniel Veillard | e9100a5 | 2008-04-22 08:28:50 +0000 | [diff] [blame] | 427 | * xmlDictComputeFastKey: |
| 428 | * |
| 429 | * Calculate a hash key using a fast hash function that works well |
| 430 | * for low hash table fill. |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 431 | */ |
| 432 | static unsigned long |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 433 | xmlDictComputeFastKey(const xmlChar *name, int namelen, int seed) { |
| 434 | unsigned long value = seed; |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 435 | |
Nick Wellnhofer | 547edbf | 2023-04-07 11:49:27 +0200 | [diff] [blame] | 436 | if ((name == NULL) || (namelen <= 0)) |
| 437 | return(value); |
Ranier Vilela | 3c8a3e9 | 2019-11-07 12:59:10 +0000 | [diff] [blame] | 438 | value += *name; |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 439 | value <<= 5; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 440 | if (namelen > 10) { |
| 441 | value += name[namelen - 1]; |
| 442 | namelen = 10; |
| 443 | } |
| 444 | switch (namelen) { |
| 445 | case 10: value += name[9]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 446 | /* Falls through. */ |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 447 | case 9: value += name[8]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 448 | /* Falls through. */ |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 449 | case 8: value += name[7]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 450 | /* Falls through. */ |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 451 | case 7: value += name[6]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 452 | /* Falls through. */ |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 453 | case 6: value += name[5]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 454 | /* Falls through. */ |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 455 | case 5: value += name[4]; |
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 4: value += name[3]; |
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 3: value += name[2]; |
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 2: value += name[1]; |
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 | default: break; |
| 464 | } |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 465 | return(value); |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 466 | } |
| 467 | |
| 468 | /* |
Daniel Veillard | e9100a5 | 2008-04-22 08:28:50 +0000 | [diff] [blame] | 469 | * xmlDictComputeFastQKey: |
| 470 | * |
| 471 | * Calculate a hash key for two strings using a fast hash function |
| 472 | * that works well for low hash table fill. |
| 473 | * |
| 474 | * Neither of the two strings must be NULL. |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 475 | */ |
| 476 | static unsigned long |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 477 | xmlDictComputeFastQKey(const xmlChar *prefix, int plen, |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 478 | const xmlChar *name, int len, int seed) |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 479 | { |
Nick Wellnhofer | ad338ca | 2022-09-01 01:18:30 +0200 | [diff] [blame] | 480 | unsigned long value = seed; |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 481 | |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 482 | if (plen == 0) |
Nick Wellnhofer | ad338ca | 2022-09-01 01:18:30 +0200 | [diff] [blame] | 483 | value += 30 * ':'; |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 484 | else |
| 485 | value += 30 * (*prefix); |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 486 | |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 487 | if (len > 10) { |
David Drysdale | 6360a31 | 2015-11-20 10:47:12 +0800 | [diff] [blame] | 488 | int offset = len - (plen + 1 + 1); |
| 489 | if (offset < 0) |
| 490 | offset = len - (10 + 1); |
| 491 | value += name[offset]; |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 492 | len = 10; |
| 493 | if (plen > 10) |
| 494 | plen = 10; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 495 | } |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 496 | switch (plen) { |
| 497 | case 10: value += prefix[9]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 498 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 499 | case 9: value += prefix[8]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 500 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 501 | case 8: value += prefix[7]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 502 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 503 | case 7: value += prefix[6]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 504 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 505 | case 6: value += prefix[5]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 506 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 507 | case 5: value += prefix[4]; |
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 4: value += prefix[3]; |
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 3: value += prefix[2]; |
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 2: value += prefix[1]; |
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 1: value += prefix[0]; |
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 | default: break; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 518 | } |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 519 | len -= plen; |
| 520 | if (len > 0) { |
Nick Wellnhofer | ad338ca | 2022-09-01 01:18:30 +0200 | [diff] [blame] | 521 | value += ':'; |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 522 | len--; |
| 523 | } |
| 524 | switch (len) { |
| 525 | case 10: value += name[9]; |
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 | case 9: value += name[8]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 528 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 529 | case 8: value += name[7]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 530 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 531 | case 7: value += name[6]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 532 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 533 | case 6: value += name[5]; |
J. Peter Mugaas | d2c329a | 2017-10-21 13:49:31 +0200 | [diff] [blame] | 534 | /* Falls through. */ |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 535 | case 5: value += name[4]; |
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 4: value += name[3]; |
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 3: value += name[2]; |
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 2: value += name[1]; |
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 1: value += name[0]; |
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 | default: break; |
| 546 | } |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 547 | return(value); |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 548 | } |
| 549 | |
| 550 | /** |
| 551 | * xmlDictCreate: |
| 552 | * |
| 553 | * Create a new dictionary |
| 554 | * |
Nick Wellnhofer | 8bbe450 | 2017-06-17 16:15:09 +0200 | [diff] [blame] | 555 | * Returns the newly created dictionary, or NULL if an error occurred. |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 556 | */ |
| 557 | xmlDictPtr |
| 558 | xmlDictCreate(void) { |
| 559 | xmlDictPtr dict; |
Daniel Veillard | 1441251 | 2005-01-21 23:53:26 +0000 | [diff] [blame] | 560 | |
Nick Wellnhofer | 9ef80ff | 2022-11-25 12:33:25 +0100 | [diff] [blame] | 561 | xmlInitParser(); |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 562 | |
| 563 | #ifdef DICT_DEBUG_PATTERNS |
| 564 | fprintf(stderr, "C"); |
| 565 | #endif |
| 566 | |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 567 | dict = xmlMalloc(sizeof(xmlDict)); |
| 568 | if (dict) { |
Daniel Veillard | e96a2a4 | 2003-09-24 21:23:56 +0000 | [diff] [blame] | 569 | dict->ref_counter = 1; |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 570 | dict->limit = 0; |
Daniel Veillard | e96a2a4 | 2003-09-24 21:23:56 +0000 | [diff] [blame] | 571 | |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 572 | dict->size = MIN_DICT_SIZE; |
| 573 | dict->nbElems = 0; |
| 574 | dict->dict = xmlMalloc(MIN_DICT_SIZE * sizeof(xmlDictEntry)); |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 575 | dict->strings = NULL; |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 576 | dict->subdict = NULL; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 577 | if (dict->dict) { |
Daniel Veillard | b242b08 | 2008-02-08 09:56:31 +0000 | [diff] [blame] | 578 | memset(dict->dict, 0, MIN_DICT_SIZE * sizeof(xmlDictEntry)); |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 579 | #ifdef DICT_RANDOMIZATION |
Daniel Veillard | 379ebc1 | 2012-05-18 15:41:31 +0800 | [diff] [blame] | 580 | dict->seed = __xmlRandom(); |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 581 | #else |
| 582 | dict->seed = 0; |
| 583 | #endif |
Daniel Veillard | b242b08 | 2008-02-08 09:56:31 +0000 | [diff] [blame] | 584 | return(dict); |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 585 | } |
| 586 | xmlFree(dict); |
| 587 | } |
| 588 | return(NULL); |
| 589 | } |
| 590 | |
| 591 | /** |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 592 | * xmlDictCreateSub: |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 593 | * @sub: an existing dictionary |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 594 | * |
| 595 | * Create a new dictionary, inheriting strings from the read-only |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 596 | * dictionary @sub. On lookup, strings are first searched in the |
| 597 | * new dictionary, then in @sub, and if not found are created in the |
| 598 | * new dictionary. |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 599 | * |
Nick Wellnhofer | 8bbe450 | 2017-06-17 16:15:09 +0200 | [diff] [blame] | 600 | * Returns the newly created dictionary, or NULL if an error occurred. |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 601 | */ |
| 602 | xmlDictPtr |
| 603 | xmlDictCreateSub(xmlDictPtr sub) { |
| 604 | xmlDictPtr dict = xmlDictCreate(); |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 605 | |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 606 | if ((dict != NULL) && (sub != NULL)) { |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 607 | #ifdef DICT_DEBUG_PATTERNS |
| 608 | fprintf(stderr, "R"); |
| 609 | #endif |
Daniel Veillard | 8973d58 | 2012-02-04 19:07:44 +0800 | [diff] [blame] | 610 | dict->seed = sub->seed; |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 611 | dict->subdict = sub; |
| 612 | xmlDictReference(dict->subdict); |
| 613 | } |
| 614 | return(dict); |
| 615 | } |
| 616 | |
| 617 | /** |
Daniel Veillard | e96a2a4 | 2003-09-24 21:23:56 +0000 | [diff] [blame] | 618 | * xmlDictReference: |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 619 | * @dict: the dictionary |
Daniel Veillard | e96a2a4 | 2003-09-24 21:23:56 +0000 | [diff] [blame] | 620 | * |
| 621 | * Increment the reference counter of a dictionary |
| 622 | * |
| 623 | * Returns 0 in case of success and -1 in case of error |
| 624 | */ |
| 625 | int |
| 626 | xmlDictReference(xmlDictPtr dict) { |
| 627 | if (dict == NULL) return -1; |
Nick Wellnhofer | 65d381f | 2022-11-24 20:54:18 +0100 | [diff] [blame] | 628 | xmlMutexLock(&xmlDictMutex); |
Daniel Veillard | e96a2a4 | 2003-09-24 21:23:56 +0000 | [diff] [blame] | 629 | dict->ref_counter++; |
Nick Wellnhofer | 65d381f | 2022-11-24 20:54:18 +0100 | [diff] [blame] | 630 | xmlMutexUnlock(&xmlDictMutex); |
Daniel Veillard | e96a2a4 | 2003-09-24 21:23:56 +0000 | [diff] [blame] | 631 | return(0); |
| 632 | } |
| 633 | |
| 634 | /** |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 635 | * xmlDictGrow: |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 636 | * @dict: the dictionary |
| 637 | * @size: the new size of the dictionary |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 638 | * |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 639 | * resize the dictionary |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 640 | * |
| 641 | * Returns 0 in case of success, -1 in case of failure |
| 642 | */ |
| 643 | static int |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 644 | xmlDictGrow(xmlDictPtr dict, size_t size) { |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 645 | unsigned long key, okey; |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 646 | size_t oldsize, i; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 647 | xmlDictEntryPtr iter, next; |
| 648 | struct _xmlDictEntry *olddict; |
| 649 | #ifdef DEBUG_GROW |
| 650 | unsigned long nbElem = 0; |
| 651 | #endif |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 652 | int ret = 0; |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 653 | int keep_keys = 1; |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 654 | |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 655 | if (dict == NULL) |
| 656 | return(-1); |
| 657 | if (size < 8) |
| 658 | return(-1); |
Nick Wellnhofer | 7f3f3f1 | 2023-05-03 03:20:14 +0200 | [diff] [blame] | 659 | if (size > MAX_DICT_HASH) |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 660 | return(-1); |
| 661 | |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 662 | #ifdef DICT_DEBUG_PATTERNS |
| 663 | fprintf(stderr, "*"); |
| 664 | #endif |
| 665 | |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 666 | oldsize = dict->size; |
| 667 | olddict = dict->dict; |
| 668 | if (olddict == NULL) |
| 669 | return(-1); |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 670 | if (oldsize == MIN_DICT_SIZE) |
| 671 | keep_keys = 0; |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 672 | |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 673 | dict->dict = xmlMalloc(size * sizeof(xmlDictEntry)); |
| 674 | if (dict->dict == NULL) { |
| 675 | dict->dict = olddict; |
| 676 | return(-1); |
| 677 | } |
| 678 | memset(dict->dict, 0, size * sizeof(xmlDictEntry)); |
| 679 | dict->size = size; |
| 680 | |
| 681 | /* If the two loops are merged, there would be situations where |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 682 | a new entry needs to allocated and data copied into it from |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 683 | the main dict. It is nicer to run through the array twice, first |
| 684 | copying all the elements in the main array (less probability of |
| 685 | 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] | 686 | */ |
| 687 | for (i = 0; i < oldsize; i++) { |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 688 | if (olddict[i].valid == 0) |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 689 | continue; |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 690 | |
| 691 | if (keep_keys) |
| 692 | okey = olddict[i].okey; |
| 693 | else |
| 694 | okey = xmlDictComputeKey(dict, olddict[i].name, olddict[i].len); |
| 695 | key = okey % dict->size; |
| 696 | |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 697 | if (dict->dict[key].valid == 0) { |
| 698 | memcpy(&(dict->dict[key]), &(olddict[i]), sizeof(xmlDictEntry)); |
| 699 | dict->dict[key].next = NULL; |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 700 | dict->dict[key].okey = okey; |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 701 | } else { |
| 702 | xmlDictEntryPtr entry; |
| 703 | |
| 704 | entry = xmlMalloc(sizeof(xmlDictEntry)); |
| 705 | if (entry != NULL) { |
| 706 | entry->name = olddict[i].name; |
| 707 | entry->len = olddict[i].len; |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 708 | entry->okey = okey; |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 709 | entry->next = dict->dict[key].next; |
| 710 | entry->valid = 1; |
| 711 | dict->dict[key].next = entry; |
| 712 | } else { |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 713 | /* |
Jared Yanovich | 2a350ee | 2019-09-30 17:04:54 +0200 | [diff] [blame] | 714 | * we don't have much ways to alert from here |
Nick Wellnhofer | 8bbe450 | 2017-06-17 16:15:09 +0200 | [diff] [blame] | 715 | * result is losing an entry and unicity guarantee |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 716 | */ |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 717 | ret = -1; |
| 718 | } |
| 719 | } |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 720 | #ifdef DEBUG_GROW |
| 721 | nbElem++; |
| 722 | #endif |
| 723 | } |
| 724 | |
| 725 | for (i = 0; i < oldsize; i++) { |
| 726 | iter = olddict[i].next; |
| 727 | while (iter) { |
| 728 | next = iter->next; |
| 729 | |
| 730 | /* |
| 731 | * put back the entry in the new dict |
| 732 | */ |
| 733 | |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 734 | if (keep_keys) |
| 735 | okey = iter->okey; |
| 736 | else |
| 737 | okey = xmlDictComputeKey(dict, iter->name, iter->len); |
| 738 | key = okey % dict->size; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 739 | if (dict->dict[key].valid == 0) { |
| 740 | memcpy(&(dict->dict[key]), iter, sizeof(xmlDictEntry)); |
| 741 | dict->dict[key].next = NULL; |
| 742 | dict->dict[key].valid = 1; |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 743 | dict->dict[key].okey = okey; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 744 | xmlFree(iter); |
| 745 | } else { |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 746 | iter->next = dict->dict[key].next; |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 747 | iter->okey = okey; |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 748 | dict->dict[key].next = iter; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 749 | } |
| 750 | |
| 751 | #ifdef DEBUG_GROW |
| 752 | nbElem++; |
| 753 | #endif |
| 754 | |
| 755 | iter = next; |
| 756 | } |
| 757 | } |
| 758 | |
| 759 | xmlFree(olddict); |
| 760 | |
| 761 | #ifdef DEBUG_GROW |
| 762 | xmlGenericError(xmlGenericErrorContext, |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 763 | "xmlDictGrow : from %lu to %lu, %u elems\n", oldsize, size, nbElem); |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 764 | #endif |
| 765 | |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 766 | return(ret); |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 767 | } |
| 768 | |
| 769 | /** |
| 770 | * xmlDictFree: |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 771 | * @dict: the dictionary |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 772 | * |
| 773 | * Free the hash @dict and its contents. The userdata is |
| 774 | * deallocated with @f if provided. |
| 775 | */ |
| 776 | void |
| 777 | xmlDictFree(xmlDictPtr dict) { |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 778 | size_t i; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 779 | xmlDictEntryPtr iter; |
| 780 | xmlDictEntryPtr next; |
| 781 | int inside_dict = 0; |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 782 | xmlDictStringsPtr pool, nextp; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 783 | |
| 784 | if (dict == NULL) |
| 785 | return; |
Daniel Veillard | e96a2a4 | 2003-09-24 21:23:56 +0000 | [diff] [blame] | 786 | |
| 787 | /* decrement the counter, it may be shared by a parser and docs */ |
Nick Wellnhofer | 65d381f | 2022-11-24 20:54:18 +0100 | [diff] [blame] | 788 | xmlMutexLock(&xmlDictMutex); |
Daniel Veillard | e96a2a4 | 2003-09-24 21:23:56 +0000 | [diff] [blame] | 789 | dict->ref_counter--; |
Daniel Veillard | 1bb16a1 | 2005-01-21 16:55:41 +0000 | [diff] [blame] | 790 | if (dict->ref_counter > 0) { |
Nick Wellnhofer | 65d381f | 2022-11-24 20:54:18 +0100 | [diff] [blame] | 791 | xmlMutexUnlock(&xmlDictMutex); |
Daniel Veillard | 1bb16a1 | 2005-01-21 16:55:41 +0000 | [diff] [blame] | 792 | return; |
| 793 | } |
| 794 | |
Nick Wellnhofer | 65d381f | 2022-11-24 20:54:18 +0100 | [diff] [blame] | 795 | xmlMutexUnlock(&xmlDictMutex); |
Daniel Veillard | e96a2a4 | 2003-09-24 21:23:56 +0000 | [diff] [blame] | 796 | |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 797 | if (dict->subdict != NULL) { |
| 798 | xmlDictFree(dict->subdict); |
| 799 | } |
| 800 | |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 801 | if (dict->dict) { |
Daniel Veillard | 6155d8a | 2003-08-19 15:01:28 +0000 | [diff] [blame] | 802 | for(i = 0; ((i < dict->size) && (dict->nbElems > 0)); i++) { |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 803 | iter = &(dict->dict[i]); |
| 804 | if (iter->valid == 0) |
| 805 | continue; |
| 806 | inside_dict = 1; |
| 807 | while (iter) { |
| 808 | next = iter->next; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 809 | if (!inside_dict) |
| 810 | xmlFree(iter); |
Daniel Veillard | 6155d8a | 2003-08-19 15:01:28 +0000 | [diff] [blame] | 811 | dict->nbElems--; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 812 | inside_dict = 0; |
| 813 | iter = next; |
| 814 | } |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 815 | } |
| 816 | xmlFree(dict->dict); |
| 817 | } |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 818 | pool = dict->strings; |
| 819 | while (pool != NULL) { |
| 820 | nextp = pool->next; |
| 821 | xmlFree(pool); |
| 822 | pool = nextp; |
| 823 | } |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 824 | xmlFree(dict); |
| 825 | } |
| 826 | |
| 827 | /** |
| 828 | * xmlDictLookup: |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 829 | * @dict: the dictionary |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 830 | * @name: the name of the userdata |
Daniel Veillard | 0fb1893 | 2003-09-07 09:14:37 +0000 | [diff] [blame] | 831 | * @len: the length of the name, if -1 it is recomputed |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 832 | * |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 833 | * Add the @name to the dictionary @dict if not present. |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 834 | * |
| 835 | * Returns the internal copy of the name or NULL in case of internal error |
| 836 | */ |
| 837 | const xmlChar * |
| 838 | xmlDictLookup(xmlDictPtr dict, const xmlChar *name, int len) { |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 839 | unsigned long key, okey, nbi = 0; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 840 | xmlDictEntryPtr entry; |
| 841 | xmlDictEntryPtr insert; |
| 842 | const xmlChar *ret; |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 843 | unsigned int l; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 844 | |
Daniel Veillard | 0fb1893 | 2003-09-07 09:14:37 +0000 | [diff] [blame] | 845 | if ((dict == NULL) || (name == NULL)) |
| 846 | return(NULL); |
| 847 | |
| 848 | if (len < 0) |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 849 | l = strlen((const char *) name); |
| 850 | else |
| 851 | l = len; |
| 852 | |
| 853 | if (((dict->limit > 0) && (l >= dict->limit)) || |
| 854 | (l > INT_MAX / 2)) |
| 855 | return(NULL); |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 856 | |
| 857 | /* |
| 858 | * Check for duplicate and insertion location. |
| 859 | */ |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 860 | okey = xmlDictComputeKey(dict, name, l); |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 861 | key = okey % dict->size; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 862 | if (dict->dict[key].valid == 0) { |
| 863 | insert = NULL; |
| 864 | } else { |
| 865 | for (insert = &(dict->dict[key]); insert->next != NULL; |
| 866 | insert = insert->next) { |
Daniel Veillard | c82c57e | 2004-01-12 16:24:34 +0000 | [diff] [blame] | 867 | #ifdef __GNUC__ |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 868 | if ((insert->okey == okey) && (insert->len == l)) { |
| 869 | if (!memcmp(insert->name, name, l)) |
Daniel Veillard | c82c57e | 2004-01-12 16:24:34 +0000 | [diff] [blame] | 870 | return(insert->name); |
| 871 | } |
| 872 | #else |
Patrick Gansterer | fd4f6fd | 2012-08-13 17:54:20 +0800 | [diff] [blame] | 873 | if ((insert->okey == okey) && (insert->len == l) && |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 874 | (!xmlStrncmp(insert->name, name, l))) |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 875 | return(insert->name); |
Daniel Veillard | c82c57e | 2004-01-12 16:24:34 +0000 | [diff] [blame] | 876 | #endif |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 877 | nbi++; |
| 878 | } |
Daniel Veillard | c82c57e | 2004-01-12 16:24:34 +0000 | [diff] [blame] | 879 | #ifdef __GNUC__ |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 880 | if ((insert->okey == okey) && (insert->len == l)) { |
| 881 | if (!memcmp(insert->name, name, l)) |
Daniel Veillard | c82c57e | 2004-01-12 16:24:34 +0000 | [diff] [blame] | 882 | return(insert->name); |
| 883 | } |
| 884 | #else |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 885 | if ((insert->okey == okey) && (insert->len == l) && |
| 886 | (!xmlStrncmp(insert->name, name, l))) |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 887 | return(insert->name); |
Daniel Veillard | c82c57e | 2004-01-12 16:24:34 +0000 | [diff] [blame] | 888 | #endif |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 889 | } |
| 890 | |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 891 | if (dict->subdict) { |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 892 | unsigned long skey; |
| 893 | |
| 894 | /* we cannot always reuse the same okey for the subdict */ |
| 895 | if (((dict->size == MIN_DICT_SIZE) && |
| 896 | (dict->subdict->size != MIN_DICT_SIZE)) || |
| 897 | ((dict->size != MIN_DICT_SIZE) && |
| 898 | (dict->subdict->size == MIN_DICT_SIZE))) |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 899 | skey = xmlDictComputeKey(dict->subdict, name, l); |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 900 | else |
| 901 | skey = okey; |
| 902 | |
| 903 | key = skey % dict->subdict->size; |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 904 | if (dict->subdict->dict[key].valid != 0) { |
| 905 | xmlDictEntryPtr tmp; |
| 906 | |
| 907 | for (tmp = &(dict->subdict->dict[key]); tmp->next != NULL; |
| 908 | tmp = tmp->next) { |
| 909 | #ifdef __GNUC__ |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 910 | if ((tmp->okey == skey) && (tmp->len == l)) { |
| 911 | if (!memcmp(tmp->name, name, l)) |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 912 | return(tmp->name); |
| 913 | } |
| 914 | #else |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 915 | if ((tmp->okey == skey) && (tmp->len == l) && |
| 916 | (!xmlStrncmp(tmp->name, name, l))) |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 917 | return(tmp->name); |
| 918 | #endif |
| 919 | nbi++; |
| 920 | } |
| 921 | #ifdef __GNUC__ |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 922 | if ((tmp->okey == skey) && (tmp->len == l)) { |
| 923 | if (!memcmp(tmp->name, name, l)) |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 924 | return(tmp->name); |
| 925 | } |
| 926 | #else |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 927 | if ((tmp->okey == skey) && (tmp->len == l) && |
| 928 | (!xmlStrncmp(tmp->name, name, l))) |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 929 | return(tmp->name); |
| 930 | #endif |
| 931 | } |
| 932 | key = okey % dict->size; |
| 933 | } |
| 934 | |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 935 | ret = xmlDictAddString(dict, name, l); |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 936 | if (ret == NULL) |
| 937 | return(NULL); |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 938 | if (insert == NULL) { |
| 939 | entry = &(dict->dict[key]); |
| 940 | } else { |
| 941 | entry = xmlMalloc(sizeof(xmlDictEntry)); |
| 942 | if (entry == NULL) |
| 943 | return(NULL); |
| 944 | } |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 945 | entry->name = ret; |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 946 | entry->len = l; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 947 | entry->next = NULL; |
| 948 | entry->valid = 1; |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 949 | entry->okey = okey; |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 950 | |
| 951 | |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 952 | if (insert != NULL) |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 953 | insert->next = entry; |
| 954 | |
| 955 | dict->nbElems++; |
| 956 | |
| 957 | if ((nbi > MAX_HASH_LEN) && |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 958 | (dict->size <= ((MAX_DICT_HASH / 2) / MAX_HASH_LEN))) { |
| 959 | if (xmlDictGrow(dict, MAX_HASH_LEN * 2 * dict->size) != 0) |
| 960 | return(NULL); |
| 961 | } |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 962 | /* Note that entry may have been freed at this point by xmlDictGrow */ |
| 963 | |
| 964 | return(ret); |
| 965 | } |
| 966 | |
| 967 | /** |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 968 | * xmlDictExists: |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 969 | * @dict: the dictionary |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 970 | * @name: the name of the userdata |
| 971 | * @len: the length of the name, if -1 it is recomputed |
| 972 | * |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 973 | * Check if the @name exists in the dictionary @dict. |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 974 | * |
| 975 | * Returns the internal copy of the name or NULL if not found. |
| 976 | */ |
| 977 | const xmlChar * |
| 978 | xmlDictExists(xmlDictPtr dict, const xmlChar *name, int len) { |
Nick Wellnhofer | b6f1298 | 2022-10-24 20:47:10 +0200 | [diff] [blame] | 979 | unsigned long key, okey; |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 980 | xmlDictEntryPtr insert; |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 981 | unsigned int l; |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 982 | |
| 983 | if ((dict == NULL) || (name == NULL)) |
| 984 | return(NULL); |
| 985 | |
| 986 | if (len < 0) |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 987 | l = strlen((const char *) name); |
| 988 | else |
| 989 | l = len; |
| 990 | if (((dict->limit > 0) && (l >= dict->limit)) || |
| 991 | (l > INT_MAX / 2)) |
| 992 | return(NULL); |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 993 | |
| 994 | /* |
| 995 | * Check for duplicate and insertion location. |
| 996 | */ |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 997 | okey = xmlDictComputeKey(dict, name, l); |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 998 | key = okey % dict->size; |
| 999 | if (dict->dict[key].valid == 0) { |
| 1000 | insert = NULL; |
| 1001 | } else { |
| 1002 | for (insert = &(dict->dict[key]); insert->next != NULL; |
| 1003 | insert = insert->next) { |
| 1004 | #ifdef __GNUC__ |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1005 | if ((insert->okey == okey) && (insert->len == l)) { |
| 1006 | if (!memcmp(insert->name, name, l)) |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 1007 | return(insert->name); |
| 1008 | } |
| 1009 | #else |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1010 | if ((insert->okey == okey) && (insert->len == l) && |
| 1011 | (!xmlStrncmp(insert->name, name, l))) |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 1012 | return(insert->name); |
| 1013 | #endif |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 1014 | } |
| 1015 | #ifdef __GNUC__ |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1016 | if ((insert->okey == okey) && (insert->len == l)) { |
| 1017 | if (!memcmp(insert->name, name, l)) |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 1018 | return(insert->name); |
| 1019 | } |
| 1020 | #else |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1021 | if ((insert->okey == okey) && (insert->len == l) && |
| 1022 | (!xmlStrncmp(insert->name, name, l))) |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 1023 | return(insert->name); |
| 1024 | #endif |
| 1025 | } |
| 1026 | |
| 1027 | if (dict->subdict) { |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 1028 | unsigned long skey; |
| 1029 | |
| 1030 | /* we cannot always reuse the same okey for the subdict */ |
| 1031 | if (((dict->size == MIN_DICT_SIZE) && |
| 1032 | (dict->subdict->size != MIN_DICT_SIZE)) || |
| 1033 | ((dict->size != MIN_DICT_SIZE) && |
| 1034 | (dict->subdict->size == MIN_DICT_SIZE))) |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1035 | skey = xmlDictComputeKey(dict->subdict, name, l); |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 1036 | else |
| 1037 | skey = okey; |
| 1038 | |
| 1039 | key = skey % dict->subdict->size; |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 1040 | if (dict->subdict->dict[key].valid != 0) { |
| 1041 | xmlDictEntryPtr tmp; |
| 1042 | |
| 1043 | for (tmp = &(dict->subdict->dict[key]); tmp->next != NULL; |
| 1044 | tmp = tmp->next) { |
| 1045 | #ifdef __GNUC__ |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1046 | if ((tmp->okey == skey) && (tmp->len == l)) { |
| 1047 | if (!memcmp(tmp->name, name, l)) |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 1048 | return(tmp->name); |
| 1049 | } |
| 1050 | #else |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1051 | if ((tmp->okey == skey) && (tmp->len == l) && |
| 1052 | (!xmlStrncmp(tmp->name, name, l))) |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 1053 | return(tmp->name); |
| 1054 | #endif |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 1055 | } |
| 1056 | #ifdef __GNUC__ |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1057 | if ((tmp->okey == skey) && (tmp->len == l)) { |
| 1058 | if (!memcmp(tmp->name, name, l)) |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 1059 | return(tmp->name); |
| 1060 | } |
| 1061 | #else |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1062 | if ((tmp->okey == skey) && (tmp->len == l) && |
| 1063 | (!xmlStrncmp(tmp->name, name, l))) |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 1064 | return(tmp->name); |
| 1065 | #endif |
| 1066 | } |
Daniel Veillard | 6bb3e86 | 2004-11-24 12:39:00 +0000 | [diff] [blame] | 1067 | } |
| 1068 | |
| 1069 | /* not found */ |
| 1070 | return(NULL); |
| 1071 | } |
| 1072 | |
| 1073 | /** |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 1074 | * xmlDictQLookup: |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 1075 | * @dict: the dictionary |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 1076 | * @prefix: the prefix |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 1077 | * @name: the name |
| 1078 | * |
| 1079 | * Add the QName @prefix:@name to the hash @dict if not present. |
| 1080 | * |
| 1081 | * Returns the internal copy of the QName or NULL in case of internal error |
| 1082 | */ |
| 1083 | const xmlChar * |
| 1084 | xmlDictQLookup(xmlDictPtr dict, const xmlChar *prefix, const xmlChar *name) { |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 1085 | unsigned long okey, key, nbi = 0; |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 1086 | xmlDictEntryPtr entry; |
| 1087 | xmlDictEntryPtr insert; |
| 1088 | const xmlChar *ret; |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1089 | unsigned int len, plen, l; |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 1090 | |
| 1091 | if ((dict == NULL) || (name == NULL)) |
| 1092 | return(NULL); |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 1093 | if (prefix == NULL) |
| 1094 | return(xmlDictLookup(dict, name, -1)); |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 1095 | |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 1096 | l = len = strlen((const char *) name); |
| 1097 | plen = strlen((const char *) prefix); |
| 1098 | len += 1 + plen; |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 1099 | |
| 1100 | /* |
| 1101 | * Check for duplicate and insertion location. |
| 1102 | */ |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 1103 | okey = xmlDictComputeQKey(dict, prefix, plen, name, l); |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 1104 | key = okey % dict->size; |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 1105 | if (dict->dict[key].valid == 0) { |
| 1106 | insert = NULL; |
| 1107 | } else { |
| 1108 | for (insert = &(dict->dict[key]); insert->next != NULL; |
| 1109 | insert = insert->next) { |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 1110 | if ((insert->okey == okey) && (insert->len == len) && |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 1111 | (xmlStrQEqual(prefix, name, insert->name))) |
| 1112 | return(insert->name); |
| 1113 | nbi++; |
| 1114 | } |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 1115 | if ((insert->okey == okey) && (insert->len == len) && |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 1116 | (xmlStrQEqual(prefix, name, insert->name))) |
| 1117 | return(insert->name); |
| 1118 | } |
| 1119 | |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 1120 | if (dict->subdict) { |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 1121 | unsigned long skey; |
| 1122 | |
| 1123 | /* we cannot always reuse the same okey for the subdict */ |
| 1124 | if (((dict->size == MIN_DICT_SIZE) && |
| 1125 | (dict->subdict->size != MIN_DICT_SIZE)) || |
| 1126 | ((dict->size != MIN_DICT_SIZE) && |
| 1127 | (dict->subdict->size == MIN_DICT_SIZE))) |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 1128 | skey = xmlDictComputeQKey(dict->subdict, prefix, plen, name, l); |
Daniel Veillard | 424785e | 2008-08-06 09:35:25 +0000 | [diff] [blame] | 1129 | else |
| 1130 | skey = okey; |
| 1131 | |
| 1132 | key = skey % dict->subdict->size; |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 1133 | if (dict->subdict->dict[key].valid != 0) { |
| 1134 | xmlDictEntryPtr tmp; |
| 1135 | for (tmp = &(dict->subdict->dict[key]); tmp->next != NULL; |
| 1136 | tmp = tmp->next) { |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 1137 | if ((tmp->okey == skey) && (tmp->len == len) && |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 1138 | (xmlStrQEqual(prefix, name, tmp->name))) |
| 1139 | return(tmp->name); |
| 1140 | nbi++; |
| 1141 | } |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 1142 | if ((tmp->okey == skey) && (tmp->len == len) && |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 1143 | (xmlStrQEqual(prefix, name, tmp->name))) |
| 1144 | return(tmp->name); |
| 1145 | } |
| 1146 | key = okey % dict->size; |
| 1147 | } |
| 1148 | |
Daniel Veillard | ffda65f | 2008-08-07 16:33:49 +0000 | [diff] [blame] | 1149 | ret = xmlDictAddQString(dict, prefix, plen, name, l); |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 1150 | if (ret == NULL) |
| 1151 | return(NULL); |
| 1152 | if (insert == NULL) { |
| 1153 | entry = &(dict->dict[key]); |
| 1154 | } else { |
| 1155 | entry = xmlMalloc(sizeof(xmlDictEntry)); |
| 1156 | if (entry == NULL) |
| 1157 | return(NULL); |
| 1158 | } |
| 1159 | entry->name = ret; |
| 1160 | entry->len = len; |
| 1161 | entry->next = NULL; |
| 1162 | entry->valid = 1; |
Daniel Veillard | d68f891 | 2008-08-08 10:09:19 +0000 | [diff] [blame] | 1163 | entry->okey = okey; |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 1164 | |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1165 | if (insert != NULL) |
Daniel Veillard | e72c508 | 2003-09-19 12:44:05 +0000 | [diff] [blame] | 1166 | insert->next = entry; |
| 1167 | |
| 1168 | dict->nbElems++; |
| 1169 | |
| 1170 | if ((nbi > MAX_HASH_LEN) && |
| 1171 | (dict->size <= ((MAX_DICT_HASH / 2) / MAX_HASH_LEN))) |
| 1172 | xmlDictGrow(dict, MAX_HASH_LEN * 2 * dict->size); |
| 1173 | /* Note that entry may have been freed at this point by xmlDictGrow */ |
| 1174 | |
| 1175 | return(ret); |
| 1176 | } |
| 1177 | |
| 1178 | /** |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 1179 | * xmlDictOwns: |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 1180 | * @dict: the dictionary |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 1181 | * @str: the string |
| 1182 | * |
Jared Yanovich | 2a350ee | 2019-09-30 17:04:54 +0200 | [diff] [blame] | 1183 | * check if a string is owned by the dictionary |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 1184 | * |
| 1185 | * Returns 1 if true, 0 if false and -1 in case of error |
| 1186 | * -1 in case of error |
| 1187 | */ |
| 1188 | int |
| 1189 | xmlDictOwns(xmlDictPtr dict, const xmlChar *str) { |
| 1190 | xmlDictStringsPtr pool; |
| 1191 | |
| 1192 | if ((dict == NULL) || (str == NULL)) |
| 1193 | return(-1); |
| 1194 | pool = dict->strings; |
| 1195 | while (pool != NULL) { |
William M. Brack | bf5cf21 | 2004-08-31 06:47:17 +0000 | [diff] [blame] | 1196 | if ((str >= &pool->array[0]) && (str <= pool->free)) |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 1197 | return(1); |
| 1198 | pool = pool->next; |
| 1199 | } |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 1200 | if (dict->subdict) |
| 1201 | return(xmlDictOwns(dict->subdict, str)); |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 1202 | return(0); |
| 1203 | } |
Daniel Veillard | e96a2a4 | 2003-09-24 21:23:56 +0000 | [diff] [blame] | 1204 | |
Daniel Veillard | 81514ba | 2003-09-16 23:17:26 +0000 | [diff] [blame] | 1205 | /** |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 1206 | * xmlDictSize: |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 1207 | * @dict: the dictionary |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 1208 | * |
| 1209 | * Query the number of elements installed in the hash @dict. |
| 1210 | * |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 1211 | * Returns the number of elements in the dictionary or |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 1212 | * -1 in case of error |
| 1213 | */ |
| 1214 | int |
| 1215 | xmlDictSize(xmlDictPtr dict) { |
| 1216 | if (dict == NULL) |
| 1217 | return(-1); |
Daniel Veillard | 4773df2 | 2004-01-23 13:15:13 +0000 | [diff] [blame] | 1218 | if (dict->subdict) |
| 1219 | return(dict->nbElems + dict->subdict->nbElems); |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 1220 | return(dict->nbElems); |
| 1221 | } |
| 1222 | |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1223 | /** |
| 1224 | * xmlDictSetLimit: |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 1225 | * @dict: the dictionary |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1226 | * @limit: the limit in bytes |
| 1227 | * |
| 1228 | * Set a size limit for the dictionary |
| 1229 | * Added in 2.9.0 |
| 1230 | * |
| 1231 | * Returns the previous limit of the dictionary or 0 |
| 1232 | */ |
| 1233 | size_t |
| 1234 | xmlDictSetLimit(xmlDictPtr dict, size_t limit) { |
| 1235 | size_t ret; |
| 1236 | |
| 1237 | if (dict == NULL) |
| 1238 | return(0); |
| 1239 | ret = dict->limit; |
| 1240 | dict->limit = limit; |
| 1241 | return(ret); |
| 1242 | } |
| 1243 | |
| 1244 | /** |
| 1245 | * xmlDictGetUsage: |
Jan Pokorný | bb654fe | 2016-04-13 16:56:07 +0200 | [diff] [blame] | 1246 | * @dict: the dictionary |
Daniel Veillard | 7c693da | 2012-07-25 16:32:18 +0800 | [diff] [blame] | 1247 | * |
| 1248 | * Get how much memory is used by a dictionary for strings |
| 1249 | * Added in 2.9.0 |
| 1250 | * |
| 1251 | * Returns the amount of strings allocated |
| 1252 | */ |
| 1253 | size_t |
| 1254 | xmlDictGetUsage(xmlDictPtr dict) { |
| 1255 | xmlDictStringsPtr pool; |
| 1256 | size_t limit = 0; |
| 1257 | |
| 1258 | if (dict == NULL) |
| 1259 | return(0); |
| 1260 | pool = dict->strings; |
| 1261 | while (pool != NULL) { |
| 1262 | limit += pool->size; |
| 1263 | pool = pool->next; |
| 1264 | } |
| 1265 | return(limit); |
| 1266 | } |
Daniel Veillard | 2fdbd32 | 2003-08-18 12:15:38 +0000 | [diff] [blame] | 1267 | |