Lines Matching refs:entry
55 * A single entry in the hash table
263 a new entry needs to allocated and data copied into it from
283 * put back the entry in the new table
409 * by using the @name. Existing entry for this @name will be removed
429 * by using the (@name, @name2) tuple. Existing entry for this tuple will
525 xmlHashEntryPtr entry;
589 entry = &(table->table[key]);
591 entry = xmlMalloc(sizeof(xmlHashEntry));
592 if (entry == NULL)
597 entry->name = (xmlChar *) name;
598 entry->name2 = (xmlChar *) name2;
599 entry->name3 = (xmlChar *) name3;
601 entry->name = xmlStrdup(name);
602 entry->name2 = xmlStrdup(name2);
603 entry->name3 = xmlStrdup(name3);
605 entry->payload = userdata;
606 entry->next = NULL;
607 entry->valid = 1;
611 insert->next = entry;
631 * by using the tuple (@name, @name2, @name3). Existing entry for this tuple
641 xmlHashEntryPtr entry;
719 entry = &(table->table[key]);
721 entry = xmlMalloc(sizeof(xmlHashEntry));
722 if (entry == NULL)
727 entry->name = (xmlChar *) name;
728 entry->name2 = (xmlChar *) name2;
729 entry->name3 = (xmlChar *) name3;
731 entry->name = xmlStrdup(name);
732 entry->name2 = xmlStrdup(name2);
733 entry->name3 = xmlStrdup(name3);
735 entry->payload = userdata;
736 entry->next = NULL;
737 entry->valid = 1;
742 insert->next = entry;
762 xmlHashEntryPtr entry;
772 for (entry = &(table->table[key]); entry != NULL; entry = entry->next) {
773 if ((entry->name == name) &&
774 (entry->name2 == name2) &&
775 (entry->name3 == name3))
776 return(entry->payload);
779 for (entry = &(table->table[key]); entry != NULL; entry = entry->next) {
780 if ((xmlStrEqual(entry->name, name)) &&
781 (xmlStrEqual(entry->name2, name2)) &&
782 (xmlStrEqual(entry->name3, name3)))
783 return(entry->payload);
808 xmlHashEntryPtr entry;
818 for (entry = &(table->table[key]); entry != NULL; entry = entry->next) {
819 if ((xmlStrQEqual(prefix, name, entry->name)) &&
820 (xmlStrQEqual(prefix2, name2, entry->name2)) &&
821 (xmlStrQEqual(prefix3, name3, entry->name3)))
822 return(entry->payload);
1078 xmlHashEntryPtr entry;
1088 for (entry = &(table->table[key]); entry != NULL; entry = entry->next) {
1089 if (xmlStrEqual(entry->name, name) &&
1090 xmlStrEqual(entry->name2, name2) &&
1091 xmlStrEqual(entry->name3, name3)) {
1092 if ((f != NULL) && (entry->payload != NULL))
1093 f(entry->payload, entry->name);
1094 entry->payload = NULL;
1096 if(entry->name)
1097 xmlFree(entry->name);
1098 if(entry->name2)
1099 xmlFree(entry->name2);
1100 if(entry->name3)
1101 xmlFree(entry->name3);
1104 prev->next = entry->next;
1105 xmlFree(entry);
1107 if (entry->next == NULL) {
1108 entry->valid = 0;
1110 entry = entry->next;
1111 memcpy(&(table->table[key]), entry, sizeof(xmlHashEntry));
1112 xmlFree(entry);
1118 prev = entry;
