Lines Matching refs:name2
42 xmlChar *name2; member
64 const xmlChar *name2, const xmlChar *name3) { in xmlHashComputeKey() argument
74 if (name2 != NULL) { in xmlHashComputeKey()
75 while ((ch = *name2++) != 0) { in xmlHashComputeKey()
90 const xmlChar *prefix2, const xmlChar *name2, in xmlHashComputeQKey() argument
117 if (name2 != NULL) { in xmlHashComputeQKey()
118 while ((ch = *name2++) != 0) { in xmlHashComputeQKey()
235 key = xmlHashComputeKey(table, oldtable[i].name, oldtable[i].name2, in xmlHashGrow()
250 key = xmlHashComputeKey(table, iter->name, iter->name2, in xmlHashGrow()
311 if (iter->name2) in xmlHashFree()
312 xmlFree(iter->name2); in xmlHashFree()
362 const xmlChar *name2, void *userdata) { in xmlHashAddEntry2() argument
363 return(xmlHashAddEntry3(table, name, name2, NULL, userdata)); in xmlHashAddEntry2()
401 const xmlChar *name2, void *userdata, in xmlHashUpdateEntry2() argument
403 return(xmlHashUpdateEntry3(table, name, name2, NULL, userdata, f)); in xmlHashUpdateEntry2()
432 const xmlChar *name2) { in xmlHashLookup2() argument
433 return(xmlHashLookup3(table, name, name2, NULL)); in xmlHashLookup2()
467 const xmlChar *name2) { in xmlHashQLookup2() argument
468 return(xmlHashQLookup3(table, prefix, name, prefix2, name2, NULL, NULL)); in xmlHashQLookup2()
487 const xmlChar *name2, const xmlChar *name3, in xmlHashAddEntry3() argument
505 if ((name2 != NULL) && (!xmlDictOwns(table->dict, name2))) { in xmlHashAddEntry3()
506 name2 = xmlDictLookup(table->dict, name2, -1); in xmlHashAddEntry3()
507 if (name2 == NULL) in xmlHashAddEntry3()
520 key = xmlHashComputeKey(table, name, name2, name3); in xmlHashAddEntry3()
528 (insert->name2 == name2) && in xmlHashAddEntry3()
534 (insert->name2 == name2) && in xmlHashAddEntry3()
541 (xmlStrEqual(insert->name2, name2)) && in xmlHashAddEntry3()
547 (xmlStrEqual(insert->name2, name2)) && in xmlHashAddEntry3()
563 entry->name2 = (xmlChar *) name2; in xmlHashAddEntry3()
567 entry->name2 = xmlStrdup(name2); in xmlHashAddEntry3()
603 const xmlChar *name2, const xmlChar *name3, in xmlHashUpdateEntry3() argument
621 if ((name2 != NULL) && (!xmlDictOwns(table->dict, name2))) { in xmlHashUpdateEntry3()
622 name2 = xmlDictLookup(table->dict, name2, -1); in xmlHashUpdateEntry3()
623 if (name2 == NULL) in xmlHashUpdateEntry3()
636 key = xmlHashComputeKey(table, name, name2, name3); in xmlHashUpdateEntry3()
644 (insert->name2 == name2) && in xmlHashUpdateEntry3()
653 (insert->name2 == name2) && in xmlHashUpdateEntry3()
664 (xmlStrEqual(insert->name2, name2)) && in xmlHashUpdateEntry3()
673 (xmlStrEqual(insert->name2, name2)) && in xmlHashUpdateEntry3()
693 entry->name2 = (xmlChar *) name2; in xmlHashUpdateEntry3()
697 entry->name2 = xmlStrdup(name2); in xmlHashUpdateEntry3()
725 const xmlChar *name2, const xmlChar *name3) { in xmlHashLookup3() argument
733 key = xmlHashComputeKey(table, name, name2, name3); in xmlHashLookup3()
739 (entry->name2 == name2) && in xmlHashLookup3()
746 (xmlStrEqual(entry->name2, name2)) && in xmlHashLookup3()
770 const xmlChar *prefix2, const xmlChar *name2, in xmlHashQLookup3() argument
780 name2, prefix3, name3); in xmlHashQLookup3()
785 (xmlStrQEqual(prefix2, name2, entry->name2)) && in xmlHashQLookup3()
799 const xmlChar *name2 ATTRIBUTE_UNUSED, in stubHashScannerFull()
850 iter->name2, iter->name3); in xmlHashScanFull()
882 const xmlChar *name2, const xmlChar *name3, in xmlHashScan3() argument
884 xmlHashScanFull3 (table, name, name2, name3, in xmlHashScan3()
903 const xmlChar *name2, const xmlChar *name3, in xmlHashScanFull3() argument
922 ((name2 == NULL) || (xmlStrEqual(name2, iter->name2))) && in xmlHashScanFull3()
926 iter->name2, iter->name3); in xmlHashScanFull3()
963 xmlHashAddEntry3(ret, iter->name, iter->name2, in xmlHashCopy()
1021 const xmlChar *name2, xmlHashDeallocator f) { in xmlHashRemoveEntry2() argument
1022 return(xmlHashRemoveEntry3(table, name, name2, NULL, f)); in xmlHashRemoveEntry2()
1041 const xmlChar *name2, const xmlChar *name3, xmlHashDeallocator f) { in xmlHashRemoveEntry3() argument
1049 key = xmlHashComputeKey(table, name, name2, name3); in xmlHashRemoveEntry3()
1055 xmlStrEqual(entry->name2, name2) && in xmlHashRemoveEntry3()
1063 if(entry->name2) in xmlHashRemoveEntry3()
1064 xmlFree(entry->name2); in xmlHashRemoveEntry3()