Lines Matching refs:subdict
123 struct _xmlDict *subdict; member
588 dict->subdict = NULL; in xmlDictCreate()
623 dict->subdict = sub; in xmlDictCreateSub()
624 xmlDictReference(dict->subdict); in xmlDictCreateSub()
817 if (dict->subdict != NULL) { in xmlDictFree()
818 xmlDictFree(dict->subdict); in xmlDictFree()
911 if (dict->subdict) { in xmlDictLookup()
916 (dict->subdict->size != MIN_DICT_SIZE)) || in xmlDictLookup()
918 (dict->subdict->size == MIN_DICT_SIZE))) in xmlDictLookup()
919 skey = xmlDictComputeKey(dict->subdict, name, l); in xmlDictLookup()
923 key = skey % dict->subdict->size; in xmlDictLookup()
924 if (dict->subdict->dict[key].valid != 0) { in xmlDictLookup()
927 for (tmp = &(dict->subdict->dict[key]); tmp->next != NULL; in xmlDictLookup()
1048 if (dict->subdict) { in xmlDictExists()
1053 (dict->subdict->size != MIN_DICT_SIZE)) || in xmlDictExists()
1055 (dict->subdict->size == MIN_DICT_SIZE))) in xmlDictExists()
1056 skey = xmlDictComputeKey(dict->subdict, name, l); in xmlDictExists()
1060 key = skey % dict->subdict->size; in xmlDictExists()
1061 if (dict->subdict->dict[key].valid != 0) { in xmlDictExists()
1064 for (tmp = &(dict->subdict->dict[key]); tmp->next != NULL; in xmlDictExists()
1142 if (dict->subdict) { in xmlDictQLookup()
1147 (dict->subdict->size != MIN_DICT_SIZE)) || in xmlDictQLookup()
1149 (dict->subdict->size == MIN_DICT_SIZE))) in xmlDictQLookup()
1150 skey = xmlDictComputeQKey(dict->subdict, prefix, plen, name, l); in xmlDictQLookup()
1154 key = skey % dict->subdict->size; in xmlDictQLookup()
1155 if (dict->subdict->dict[key].valid != 0) { in xmlDictQLookup()
1157 for (tmp = &(dict->subdict->dict[key]); tmp->next != NULL; in xmlDictQLookup()
1222 if (dict->subdict) in xmlDictOwns()
1223 return(xmlDictOwns(dict->subdict, str)); in xmlDictOwns()
1240 if (dict->subdict) in xmlDictSize()
1241 return(dict->nbElems + dict->subdict->nbElems); in xmlDictSize()