Lines Matching defs:name2
42 xmlChar *name2;
64 const xmlChar *name2, const xmlChar *name3) {
74 if (name2 != NULL) {
75 while ((ch = *name2++) != 0) {
90 const xmlChar *prefix2, const xmlChar *name2,
117 if (name2 != NULL) {
118 while ((ch = *name2++) != 0) {
235 key = xmlHashComputeKey(table, oldtable[i].name, oldtable[i].name2,
250 key = xmlHashComputeKey(table, iter->name, iter->name2,
311 if (iter->name2)
312 xmlFree(iter->name2);
352 * @name2: a second name of the userdata
356 * by using the (@name, @name2) tuple. Duplicate tuples generate errors.
362 const xmlChar *name2, void *userdata) {
363 return(xmlHashAddEntry3(table, name, name2, NULL, userdata));
389 * @name2: a second name of the userdata
394 * by using the (@name, @name2) tuple. Existing entry for this tuple will
401 const xmlChar *name2, void *userdata,
403 return(xmlHashUpdateEntry3(table, name, name2, NULL, userdata, f));
424 * @name2: a second name of the userdata
426 * Find the userdata specified by the (@name, @name2) tuple.
432 const xmlChar *name2) {
433 return(xmlHashLookup3(table, name, name2, NULL));
458 * @name2: a second name of the userdata
467 const xmlChar *name2) {
468 return(xmlHashQLookup3(table, prefix, name, prefix2, name2, NULL, NULL));
475 * @name2: a second name of the userdata
480 * by using the tuple (@name, @name2, @name3). Duplicate entries generate
487 const xmlChar *name2, const xmlChar *name3,
505 if ((name2 != NULL) && (!xmlDictOwns(table->dict, name2))) {
506 name2 = xmlDictLookup(table->dict, name2, -1);
507 if (name2 == NULL)
520 key = xmlHashComputeKey(table, name, name2, name3);
528 (insert->name2 == name2) &&
534 (insert->name2 == name2) &&
541 (xmlStrEqual(insert->name2, name2)) &&
547 (xmlStrEqual(insert->name2, name2)) &&
563 entry->name2 = (xmlChar *) name2;
567 entry->name2 = xmlStrdup(name2);
590 * @name2: a second name of the userdata
596 * by using the tuple (@name, @name2, @name3). Existing entry for this tuple
603 const xmlChar *name2, const xmlChar *name3,
621 if ((name2 != NULL) && (!xmlDictOwns(table->dict, name2))) {
622 name2 = xmlDictLookup(table->dict, name2, -1);
623 if (name2 == NULL)
636 key = xmlHashComputeKey(table, name, name2, name3);
644 (insert->name2 == name2) &&
653 (insert->name2 == name2) &&
664 (xmlStrEqual(insert->name2, name2)) &&
673 (xmlStrEqual(insert->name2, name2)) &&
693 entry->name2 = (xmlChar *) name2;
697 entry->name2 = xmlStrdup(name2);
716 * @name2: a second name of the userdata
719 * Find the userdata specified by the (@name, @name2, @name3) tuple.
725 const xmlChar *name2, const xmlChar *name3) {
733 key = xmlHashComputeKey(table, name, name2, name3);
739 (entry->name2 == name2) &&
746 (xmlStrEqual(entry->name2, name2)) &&
759 * @name2: a second name of the userdata
763 * Find the userdata specified by the (@name, @name2, @name3) tuple.
770 const xmlChar *prefix2, const xmlChar *name2,
780 name2, prefix3, name3);
785 (xmlStrQEqual(prefix2, name2, entry->name2)) &&
799 const xmlChar *name2 ATTRIBUTE_UNUSED,
849 iter->name2, iter->name3);
860 * @name2: a second name of the userdata or NULL
866 * (@name, @name2, @name3) tuple. If one of the names is null,
871 const xmlChar *name2, const xmlChar *name3,
873 xmlHashScanFull3 (table, name, name2, name3,
881 * @name2: a second name of the userdata or NULL
887 * (@name, @name2, @name3) tuple. If one of the names is null,
892 const xmlChar *name2, const xmlChar *name3,
911 ((name2 == NULL) || (xmlStrEqual(name2, iter->name2))) &&
915 iter->name2, iter->name3);
952 xmlHashAddEntry3(ret, iter->name, iter->name2,
999 * @name2: a second name of the userdata
1002 * Find the userdata specified by the (@name, @name2) tuple and remove
1010 const xmlChar *name2, xmlHashDeallocator f) {
1011 return(xmlHashRemoveEntry3(table, name, name2, NULL, f));
1018 * @name2: a second name of the userdata
1022 * Find the userdata specified by the (@name, @name2, @name3) tuple and remove
1030 const xmlChar *name2, const xmlChar *name3, xmlHashDeallocator f) {
1038 key = xmlHashComputeKey(table, name, name2, name3);
1044 xmlStrEqual(entry->name2, name2) &&
1052 if(entry->name2)
1053 xmlFree(entry->name2);