41 	new->next = *labels;  in add_label()
79 	assert(first->next == NULL);  in chain_property()
81 	first->next = list;  in chain_property()
89 	struct property *next;  in reverse_properties()  local
92 		next = p->next;  in reverse_properties()
93 		p->next = head;  in reverse_properties()
95 		p = next;  in reverse_properties()
154 		new_node->proplist = new_prop->next;  in merge_nodes()
155 		new_prop->next = NULL;  in merge_nodes()
231 	prop->next = NULL;  in add_property()
235 		p = &((*p)->next);  in add_property()
249 		prop = prop->next;  in delete_property_by_name()
314 	assert(first->next == NULL);  in chain_reserve_entry()
316 	first->next = list;  in chain_reserve_entry()
325 	new->next = NULL;  in add_reserve_entry()
330 	for (last = list; last->next; last = last->next)  in add_reserve_entry()
333 	last->next = new;  in add_reserve_entry()
602 	     ri = ri->next)  in sort_reserve_entries()
612 	     ri = ri->next)  in sort_reserve_entries()
619 		tbl[i]->next = tbl[i+1];  in sort_reserve_entries()
620 	tbl[n-1]->next = NULL;  in sort_reserve_entries()
655 		tbl[i]->next = tbl[i+1];  in sort_properties()
656 	tbl[n-1]->next = NULL;  in sort_properties()