Lines Matching refs: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);
351 * @name2: a second name of the userdata
355 * by using the (@name, @name2) tuple. Duplicate tuples generate errors.
361 const xmlChar *name2, void *userdata) {
362 return(xmlHashAddEntry3(table, name, name2, NULL, userdata));
388 * @name2: a second name of the userdata
393 * by using the (@name, @name2) tuple. Existing entry for this tuple will
400 const xmlChar *name2, void *userdata,
402 return(xmlHashUpdateEntry3(table, name, name2, NULL, userdata, f));
423 * @name2: a second name of the userdata
425 * Find the userdata specified by the (@name, @name2) tuple.
431 const xmlChar *name2) {
432 return(xmlHashLookup3(table, name, name2, NULL));
457 * @name2: a second name of the userdata
466 const xmlChar *name2) {
467 return(xmlHashQLookup3(table, prefix, name, prefix2, name2, NULL, NULL));
474 * @name2: a second name of the userdata
479 * by using the tuple (@name, @name2, @name3). Duplicate entries generate
486 const xmlChar *name2, const xmlChar *name3,
504 if ((name2 != NULL) && (!xmlDictOwns(table->dict, name2))) {
505 name2 = xmlDictLookup(table->dict, name2, -1);
506 if (name2 == NULL)
519 key = xmlHashComputeKey(table, name, name2, name3);
527 (insert->name2 == name2) &&
533 (insert->name2 == name2) &&
540 (xmlStrEqual(insert->name2, name2)) &&
546 (xmlStrEqual(insert->name2, name2)) &&
562 entry->name2 = (xmlChar *) name2;
566 entry->name2 = xmlStrdup(name2);
589 * @name2: a second name of the userdata
595 * by using the tuple (@name, @name2, @name3). Existing entry for this tuple
602 const xmlChar *name2, const xmlChar *name3,
620 if ((name2 != NULL) && (!xmlDictOwns(table->dict, name2))) {
621 name2 = xmlDictLookup(table->dict, name2, -1);
622 if (name2 == NULL)
635 key = xmlHashComputeKey(table, name, name2, name3);
643 (insert->name2 == name2) &&
652 (insert->name2 == name2) &&
663 (xmlStrEqual(insert->name2, name2)) &&
672 (xmlStrEqual(insert->name2, name2)) &&
692 entry->name2 = (xmlChar *) name2;
696 entry->name2 = xmlStrdup(name2);
715 * @name2: a second name of the userdata
718 * Find the userdata specified by the (@name, @name2, @name3) tuple.
724 const xmlChar *name2, const xmlChar *name3) {
732 key = xmlHashComputeKey(table, name, name2, name3);
738 (entry->name2 == name2) &&
745 (xmlStrEqual(entry->name2, name2)) &&
758 * @name2: a second name of the userdata
762 * Find the userdata specified by the (@name, @name2, @name3) tuple.
769 const xmlChar *prefix2, const xmlChar *name2,
779 name2, prefix3, name3);
784 (xmlStrQEqual(prefix2, name2, entry->name2)) &&
798 const xmlChar *name2 ATTRIBUTE_UNUSED,
849 iter->name2, iter->name3);
870 * @name2: a second name of the userdata or NULL
876 * (@name, @name2, @name3) tuple. If one of the names is null,
881 const xmlChar *name2, const xmlChar *name3,
883 xmlHashScanFull3 (table, name, name2, name3,
891 * @name2: a second name of the userdata or NULL
897 * (@name, @name2, @name3) tuple. If one of the names is null,
902 const xmlChar *name2, const xmlChar *name3,
921 ((name2 == NULL) || (xmlStrEqual(name2, iter->name2))) &&
925 iter->name2, iter->name3);
962 xmlHashAddEntry3(ret, iter->name, iter->name2,
1009 * @name2: a second name of the userdata
1012 * Find the userdata specified by the (@name, @name2) tuple and remove
1020 const xmlChar *name2, xmlHashDeallocator f) {
1021 return(xmlHashRemoveEntry3(table, name, name2, NULL, f));
1028 * @name2: a second name of the userdata
1032 * Find the userdata specified by the (@name, @name2, @name3) tuple and remove
1040 const xmlChar *name2, const xmlChar *name3, xmlHashDeallocator f) {
1048 key = xmlHashComputeKey(table, name, name2, name3);
1054 xmlStrEqual(entry->name2, name2) &&
1062 if(entry->name2)
1063 xmlFree(entry->name2);
