646 	int n = 0, i = 0;  in sort_reserve_entries()  local
661 		tbl[i++] = ri;  in sort_reserve_entries()
666 	for (i = 0; i < (n-1); i++)  in sort_reserve_entries()
667 		tbl[i]->next = tbl[i+1];  in sort_reserve_entries()
685 	int n = 0, i = 0;  in sort_properties()  local
697 		tbl[i++] = prop;  in sort_properties()
702 	for (i = 0; i < (n-1); i++)  in sort_properties()
703 		tbl[i]->next = tbl[i+1];  in sort_properties()
721 	int n = 0, i = 0;  in sort_subnodes()  local
733 		tbl[i++] = subnode;  in sort_subnodes()
738 	for (i = 0; i < (n-1); i++)  in sort_subnodes()
739 		tbl[i]->next_sibling = tbl[i+1];  in sort_subnodes()
936 	int i, depth;  in add_local_fixup_entry()  local
947 	for (wn = node, i = depth - 1; wn; wn = wn->parent, i--)  in add_local_fixup_entry()
948 		compp[i] = wn->name;  in add_local_fixup_entry()
951 	for (wn = lfn, i = 1; i < depth; i++, wn = nwn) {  in add_local_fixup_entry()
953 		nwn = get_subnode(wn, compp[i]);  in add_local_fixup_entry()
955 			nwn = build_and_name_child_node(wn, compp[i]);  in add_local_fixup_entry()