Lines Matching refs:subdict
123 struct _xmlDict *subdict; member
559 dict->subdict = NULL; in xmlDictCreate()
594 dict->subdict = sub; in xmlDictCreateSub()
595 xmlDictReference(dict->subdict); in xmlDictCreateSub()
788 if (dict->subdict != NULL) { in xmlDictFree()
789 xmlDictFree(dict->subdict); in xmlDictFree()
882 if (dict->subdict) { in xmlDictLookup()
887 (dict->subdict->size != MIN_DICT_SIZE)) || in xmlDictLookup()
889 (dict->subdict->size == MIN_DICT_SIZE))) in xmlDictLookup()
890 skey = xmlDictComputeKey(dict->subdict, name, l); in xmlDictLookup()
894 key = skey % dict->subdict->size; in xmlDictLookup()
895 if (dict->subdict->dict[key].valid != 0) { in xmlDictLookup()
898 for (tmp = &(dict->subdict->dict[key]); tmp->next != NULL; in xmlDictLookup()
1019 if (dict->subdict) { in xmlDictExists()
1024 (dict->subdict->size != MIN_DICT_SIZE)) || in xmlDictExists()
1026 (dict->subdict->size == MIN_DICT_SIZE))) in xmlDictExists()
1027 skey = xmlDictComputeKey(dict->subdict, name, l); in xmlDictExists()
1031 key = skey % dict->subdict->size; in xmlDictExists()
1032 if (dict->subdict->dict[key].valid != 0) { in xmlDictExists()
1035 for (tmp = &(dict->subdict->dict[key]); tmp->next != NULL; in xmlDictExists()
1113 if (dict->subdict) { in xmlDictQLookup()
1118 (dict->subdict->size != MIN_DICT_SIZE)) || in xmlDictQLookup()
1120 (dict->subdict->size == MIN_DICT_SIZE))) in xmlDictQLookup()
1121 skey = xmlDictComputeQKey(dict->subdict, prefix, plen, name, l); in xmlDictQLookup()
1125 key = skey % dict->subdict->size; in xmlDictQLookup()
1126 if (dict->subdict->dict[key].valid != 0) { in xmlDictQLookup()
1128 for (tmp = &(dict->subdict->dict[key]); tmp->next != NULL; in xmlDictQLookup()
1193 if (dict->subdict) in xmlDictOwns()
1194 return(xmlDictOwns(dict->subdict, str)); in xmlDictOwns()
1211 if (dict->subdict) in xmlDictSize()
1212 return(dict->nbElems + dict->subdict->nbElems); in xmlDictSize()