Home | History | Annotate | Download | only in libxml2

Lines Matching defs:name3

59     xmlChar *name3;
83 const xmlChar *name2, const xmlChar *name3) {
103 if (name3 != NULL) {
104 while ((ch = *name3++) != 0) {
115 const xmlChar *prefix3, const xmlChar *name3) {
157 if (name3 != NULL) {
158 while ((ch = *name3++) != 0) {
268 oldtable[i].name3);
283 iter->name3);
345 if (iter->name3)
346 xmlFree(iter->name3);
507 * @name3: a third name of the userdata
511 * by using the tuple (@name, @name2, @name3). Duplicate entries generate
518 const xmlChar *name2, const xmlChar *name3,
541 if ((name3 != NULL) && (!xmlDictOwns(table->dict, name3))) {
542 name3 = xmlDictLookup(table->dict, name3, -1);
543 if (name3 == NULL)
551 key = xmlHashComputeKey(table, name, name2, name3);
560 (insert->name3 == name3))
566 (insert->name3 == name3))
573 (xmlStrEqual(insert->name3, name3)))
579 (xmlStrEqual(insert->name3, name3)))
595 entry->name3 = (xmlChar *) name3;
599 entry->name3 = xmlStrdup(name3);
622 * @name3: a third name of the userdata
627 * by using the tuple (@name, @name2, @name3). Existing entry for this tuple
634 const xmlChar *name2, const xmlChar *name3,
657 if ((name3 != NULL) && (!xmlDictOwns(table->dict, name3))) {
658 name3 = xmlDictLookup(table->dict, name3, -1);
659 if (name3 == NULL)
667 key = xmlHashComputeKey(table, name, name2, name3);
676 (insert->name3 == name3)) {
685 (insert->name3 == name3)) {
696 (xmlStrEqual(insert->name3, name3))) {
705 (xmlStrEqual(insert->name3, name3))) {
725 entry->name3 = (xmlChar *) name3;
729 entry->name3 = xmlStrdup(name3);
748 * @name3: a third 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);
771 (entry->name3 == name3))
778 (xmlStrEqual(entry->name3, name3)))
792 * @name3: a third name of the userdata
794 * Find the userdata specified by the (@name, @name2, @name3) tuple.
802 const xmlChar *prefix3, const xmlChar *name3) {
811 name2, prefix3, name3);
817 (xmlStrQEqual(prefix3, name3, entry->name3)))
831 const xmlChar *name3 ATTRIBUTE_UNUSED) {
881 iter->name2, iter->name3);
903 * @name3: a third 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,
924 * @name3: a third 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,
954 ((name3 == NULL) || (xmlStrEqual(name3, iter->name3))) &&
957 iter->name2, iter->name3);
998 iter->name3, f(iter->payload, iter->name));
1064 * @name3: a third name of the userdata
1067 * Find the userdata specified by the (@name, @name2, @name3) tuple and remove
1075 const xmlChar *name2, const xmlChar *name3, xmlHashDeallocator f) {
1083 key = xmlHashComputeKey(table, name, name2, name3);
1090 xmlStrEqual(entry->name3, name3)) {
1099 if(entry->name3)
1100 xmlFree(entry->name3);