Lines Matching full:size
48 (((dict)->size == MIN_DICT_SIZE) ? \
55 (((dict)->size == MIN_DICT_SIZE) ? \
85 int size;
96 int size;
161 int size = 0; /* + sizeof(_xmlDictStrings) == 1024 */
170 if (pool->size > size) size = pool->size;
177 if (size == 0) size = 1000;
178 else size *= 4; /* exponential growth */
179 if (size < 4 * namelen)
180 size = 4 * namelen; /* just in case ! */
181 pool = (xmlDictStringsPtr) xmlMalloc(sizeof(xmlDictStrings) + size);
184 pool->size = size;
187 pool->end = &pool->array[size];
221 int size = 0; /* + sizeof(_xmlDictStrings) == 1024 */
232 if (pool->size > size) size = pool->size;
239 if (size == 0) size = 1000;
240 else size *= 4; /* exponential growth */
241 if (size < 4 * (namelen + plen + 1))
242 size = 4 * (namelen + plen + 1); /* just in case ! */
243 pool = (xmlDictStringsPtr) xmlMalloc(sizeof(xmlDictStrings) + size);
246 pool->size = size;
249 pool->end = &pool->array[size];
456 dict->size = MIN_DICT_SIZE;
519 * @size: the new size of the dictionnary
526 xmlDictGrow(xmlDictPtr dict, int size) {
539 if (size < 8)
541 if (size > 8 * 2048)
548 oldsize = dict->size;
555 dict->dict = xmlMalloc(size * sizeof(xmlDictEntry));
560 memset(dict->dict, 0, size * sizeof(xmlDictEntry));
561 dict->size = size;
577 key = okey % dict->size;
620 key = okey % dict->size;
645 "xmlDictGrow : from %d to %d, %d elems\n", oldsize, size, nbElem);
688 for(i = 0; ((i < dict->size) && (dict->nbElems > 0)); i++) {
741 key = okey % dict->size;
775 if (((dict->size == MIN_DICT_SIZE) &&
776 (dict->subdict->size != MIN_DICT_SIZE)) ||
777 ((dict->size != MIN_DICT_SIZE) &&
778 (dict->subdict->size == MIN_DICT_SIZE)))
783 key = skey % dict->subdict->size;
812 key = okey % dict->size;
838 (dict->size <= ((MAX_DICT_HASH / 2) / MAX_HASH_LEN))) {
839 if (xmlDictGrow(dict, MAX_HASH_LEN * 2 * dict->size) != 0)
872 key = okey % dict->size;
906 if (((dict->size == MIN_DICT_SIZE) &&
907 (dict->subdict->size != MIN_DICT_SIZE)) ||
908 ((dict->size != MIN_DICT_SIZE) &&
909 (dict->subdict->size == MIN_DICT_SIZE)))
914 key = skey % dict->subdict->size;
980 key = okey % dict->size;
1000 if (((dict->size == MIN_DICT_SIZE) &&
1001 (dict->subdict->size != MIN_DICT_SIZE)) ||
1002 ((dict->size != MIN_DICT_SIZE) &&
1003 (dict->subdict->size == MIN_DICT_SIZE)))
1008 key = skey % dict->subdict->size;
1022 key = okey % dict->size;
1047 (dict->size <= ((MAX_DICT_HASH / 2) / MAX_HASH_LEN)))
1048 xmlDictGrow(dict, MAX_HASH_LEN * 2 * dict->size);
