Lines Matching refs:name2
58 xmlChar *name2;
83 const xmlChar *name2, const xmlChar *name3) {
97 if (name2 != NULL) {
98 while ((ch = *name2++) != 0) {
114 const xmlChar *prefix2, const xmlChar *name2,
145 if (name2 != NULL) {
146 while ((ch = *name2++) != 0) {
267 key = xmlHashComputeKey(table, oldtable[i].name, oldtable[i].name2,
282 key = xmlHashComputeKey(table, iter->name, iter->name2,
343 if (iter->name2)
344 xmlFree(iter->name2);
383 * @name2: a second name of the userdata
387 * by using the (@name, @name2) tuple. Duplicate tuples generate errors.
393 const xmlChar *name2, void *userdata) {
394 return(xmlHashAddEntry3(table, name, name2, NULL, userdata));
420 * @name2: a second name of the userdata
425 * by using the (@name, @name2) tuple. Existing entry for this tuple will
432 const xmlChar *name2, void *userdata,
434 return(xmlHashUpdateEntry3(table, name, name2, NULL, userdata, f));
455 * @name2: a second name of the userdata
457 * Find the userdata specified by the (@name, @name2) tuple.
463 const xmlChar *name2) {
464 return(xmlHashLookup3(table, name, name2, NULL));
489 * @name2: a second name of the userdata
498 const xmlChar *name2) {
499 return(xmlHashQLookup3(table, prefix, name, prefix2, name2, NULL, NULL));
506 * @name2: a second name of the userdata
511 * by using the tuple (@name, @name2, @name3). Duplicate entries generate
518 const xmlChar *name2, const xmlChar *name3,
536 if ((name2 != NULL) && (!xmlDictOwns(table->dict, name2))) {
537 name2 = xmlDictLookup(table->dict, name2, -1);
538 if (name2 == NULL)
551 key = xmlHashComputeKey(table, name, name2, name3);
559 (insert->name2 == name2) &&
565 (insert->name2 == name2) &&
572 (xmlStrEqual(insert->name2, name2)) &&
578 (xmlStrEqual(insert->name2, name2)) &&
594 entry->name2 = (xmlChar *) name2;
598 entry->name2 = xmlStrdup(name2);
621 * @name2: a second name of the userdata
627 * by using the tuple (@name, @name2, @name3). Existing entry for this tuple
634 const xmlChar *name2, const xmlChar *name3,
652 if ((name2 != NULL) && (!xmlDictOwns(table->dict, name2))) {
653 name2 = xmlDictLookup(table->dict, name2, -1);
654 if (name2 == NULL)
667 key = xmlHashComputeKey(table, name, name2, name3);
675 (insert->name2 == name2) &&
684 (insert->name2 == name2) &&
695 (xmlStrEqual(insert->name2, name2)) &&
704 (xmlStrEqual(insert->name2, name2)) &&
724 entry->name2 = (xmlChar *) name2;
728 entry->name2 = xmlStrdup(name2);
747 * @name2: a second name of the userdata
750 * Find the userdata specified by the (@name, @name2, @name3) tuple.
756 const xmlChar *name2, const xmlChar *name3) {
764 key = xmlHashComputeKey(table, name, name2, name3);
770 (entry->name2 == name2) &&
777 (xmlStrEqual(entry->name2, name2)) &&
790 * @name2: a second name of the userdata
794 * Find the userdata specified by the (@name, @name2, @name3) tuple.
801 const xmlChar *prefix2, const xmlChar *name2,
811 name2, prefix3, name3);
816 (xmlStrQEqual(prefix2, name2, entry->name2)) &&
830 const xmlChar *name2 ATTRIBUTE_UNUSED,
881 iter->name2, iter->name3);
902 * @name2: a second name of the userdata or NULL
908 * (@name, @name2, @name3) tuple. If one of the names is null,
913 const xmlChar *name2, const xmlChar *name3,
915 xmlHashScanFull3 (table, name, name2, name3,
923 * @name2: a second name of the userdata or NULL
929 * (@name, @name2, @name3) tuple. If one of the names is null,
934 const xmlChar *name2, const xmlChar *name3,
953 ((name2 == NULL) || (xmlStrEqual(name2, iter->name2))) &&
957 iter->name2, iter->name3);
994 xmlHashAddEntry3(ret, iter->name, iter->name2,
1041 * @name2: a second name of the userdata
1044 * Find the userdata specified by the (@name, @name2) tuple and remove
1052 const xmlChar *name2, xmlHashDeallocator f) {
1053 return(xmlHashRemoveEntry3(table, name, name2, NULL, f));
1060 * @name2: a second name of the userdata
1064 * Find the userdata specified by the (@name, @name2, @name3) tuple and remove
1072 const xmlChar *name2, const xmlChar *name3, xmlHashDeallocator f) {
1080 key = xmlHashComputeKey(table, name, name2, name3);
1086 xmlStrEqual(entry->name2, name2) &&
1094 if(entry->name2)
1095 xmlFree(entry->name2);
