Searched refs:best (Results 1 – 6 of 6) sorted by relevance
85 struct tlpm_node *best = NULL; in tlpm_match() local102 if (!best || i > best->n_bits) in tlpm_match()103 best = list; in tlpm_match()107 return best; in tlpm_match()114 struct tlpm_node *best = tlpm_match(list, key, n_bits); in tlpm_delete() local117 if (!best || best->n_bits != n_bits) in tlpm_delete()120 if (best == list) { in tlpm_delete()121 node = best->next; in tlpm_delete()122 free(best); in tlpm_delete()127 if (node->next == best) { in tlpm_delete()[all …]
334 struct aliasinfo *best = NULL; in find_one_alias() local338 (!best || strlen(best->name) < strlen(a->name))) { in find_one_alias()339 best = a; in find_one_alias()341 return best; in find_one_alias()344 return best; in find_one_alias()
26 or architecture. It is best to check the KVM kernel module source code for the
279 For best results it is usually a good idea to use it with interval290 for best results. Otherwise the bottlenecks may be inconsistent
285 possible use to the public, the best way to achieve this is to make it
1196 This is best explained with some examples. The simplest case looks