84 	struct tlpm_node *best = NULL;  in tlpm_match()  local
101 			if (!best || i > best->n_bits)  in tlpm_match()
102 				best = list;  in tlpm_match()
106 	return best;  in tlpm_match()
113 	struct tlpm_node *best = tlpm_match(list, key, n_bits);  in tlpm_delete()  local
116 	if (!best || best->n_bits != n_bits)  in tlpm_delete()
119 	if (best == list) {  in tlpm_delete()
120 		node = best->next;  in tlpm_delete()
121 		free(best);  in tlpm_delete()
126 		if (node->next == best) {  in tlpm_delete()
127 			node->next = best->next;  in tlpm_delete()
128 			free(best);  in tlpm_delete()