Lines Matching full:strings
2 * dict.c: dictionary of reusable strings, just used to avoid allocation
121 xmlDictStringsPtr strings;
250 pool = dict->strings;
277 pool->next = dict->strings;
278 dict->strings = pool;
318 pool = dict->strings;
345 pool->next = dict->strings;
346 dict->strings = pool;
398 * Calculate a hash key for two strings using a good hash function
404 * Neither of the two strings must be NULL.
472 * Calculate a hash key for two strings using a fast hash function
475 * Neither of the two strings must be NULL.
555 dict->strings = NULL;
575 * Create a new dictionary, inheriting strings from the read-only
576 * dictionnary @sub. On lookup, strings are first searched in the
806 pool = dict->strings;
1184 pool = dict->strings;
1238 * Get how much memory is used by a dictionary for strings
1241 * Returns the amount of strings allocated
1250 pool = dict->strings;
