Lines Matching refs:next
40 struct _xmlHashEntry *next;
200 xmlHashEntryPtr iter, next;
238 table->table[key].next = NULL;
242 iter = oldtable[i].next;
244 next = iter->next;
254 table->table[key].next = NULL;
257 iter->next = table->table[key].next;
258 table->table[key].next = iter;
265 iter = next;
291 xmlHashEntryPtr next;
305 next = iter->next;
321 iter = next;
525 for (insert = &(table->table[key]); insert->next != NULL;
526 insert = insert->next) {
538 for (insert = &(table->table[key]); insert->next != NULL;
539 insert = insert->next) {
571 entry->next = NULL;
576 insert->next = entry;
641 for (insert = &(table->table[key]); insert->next != NULL;
642 insert = insert->next) {
661 for (insert = &(table->table[key]); insert->next != NULL;
662 insert = insert->next) {
701 entry->next = NULL;
707 insert->next = entry;
737 for (entry = &(table->table[key]); entry != NULL; entry = entry->next) {
744 for (entry = &(table->table[key]); entry != NULL; entry = entry->next) {
783 for (entry = &(table->table[key]); entry != NULL; entry = entry->next) {
833 xmlHashEntryPtr next;
846 next = iter->next;
850 iter = next;
896 xmlHashEntryPtr next;
909 next = iter->next;
917 iter = next;
936 xmlHashEntryPtr next;
951 next = iter->next;
954 iter = next;
1042 for (entry = &(table->table[key]); entry != NULL; entry = entry->next) {
1058 prev->next = entry->next;
1061 if (entry->next == NULL) {
1064 entry = entry->next;