Home
last modified time | relevance | path

Searched refs:best (Results 1 – 12 of 12) sorted by relevance

/net/dccp/
Dqpolicy.c38 struct sk_buff *skb, *best = NULL; in qpolicy_prio_best_skb() local
41 if (best == NULL || skb->priority > best->priority) in qpolicy_prio_best_skb()
42 best = skb; in qpolicy_prio_best_skb()
43 return best; in qpolicy_prio_best_skb()
/net/batman-adv/
Doriginator.c1241 struct batadv_neigh_node *best = NULL, *neigh; in batadv_find_best_neighbor() local
1246 if (best && (bao->neigh.cmp(neigh, if_outgoing, best, in batadv_find_best_neighbor()
1253 if (best) in batadv_find_best_neighbor()
1254 batadv_neigh_node_put(best); in batadv_find_best_neighbor()
1256 best = neigh; in batadv_find_best_neighbor()
1260 return best; in batadv_find_best_neighbor()
Dbat_v.c428 bool best) in batadv_v_orig_dump_subentry() argument
464 if (best && nla_put_flag(msg, BATADV_ATTR_FLAG_BEST)) in batadv_v_orig_dump_subentry()
498 bool best; in batadv_v_orig_dump_entry() local
508 best = (neigh_node == neigh_node_best); in batadv_v_orig_dump_entry()
512 neigh_node, best)) { in batadv_v_orig_dump_entry()
Dbat_iv_ogm.c1929 bool best) in batadv_iv_ogm_orig_dump_subentry() argument
1960 if (best && nla_put_flag(msg, BATADV_ATTR_FLAG_BEST)) in batadv_iv_ogm_orig_dump_subentry()
1994 bool best; in batadv_iv_ogm_orig_dump_entry() local
2012 best = (neigh_node == neigh_node_best); in batadv_iv_ogm_orig_dump_entry()
2017 best)) { in batadv_iv_ogm_orig_dump_entry()
Dtranslation-table.c2031 bool best) in batadv_tt_global_dump_subentry() argument
2066 if (best && nla_put_flag(msg, BATADV_ATTR_FLAG_BEST)) in batadv_tt_global_dump_subentry()
2099 bool best; in batadv_tt_global_dump_entry() local
2109 best = (orig_entry == best_entry); in batadv_tt_global_dump_entry()
2112 orig_entry, best)) { in batadv_tt_global_dump_entry()
/net/sctp/
Dassociola.c1249 struct sctp_transport *best) in sctp_trans_elect_best() argument
1253 if (best == NULL || curr == best) in sctp_trans_elect_best()
1257 score_best = sctp_trans_score(best); in sctp_trans_elect_best()
1266 return sctp_trans_elect_tie(best, curr); in sctp_trans_elect_best()
1268 return best; in sctp_trans_elect_best()
/net/dcb/
DKconfig13 requirements (highly reliable, no drops vs. best effort vs. low
/net/hsr/
DKconfig21 This code is a "best effort" to comply with the HSR standard as
/net/xfrm/
Dxfrm_state.c1003 struct xfrm_state **best, int *acq_in_progress, in xfrm_state_look_at() argument
1024 if (!*best || in xfrm_state_look_at()
1025 (*best)->km.dying > x->km.dying || in xfrm_state_look_at()
1026 ((*best)->km.dying == x->km.dying && in xfrm_state_look_at()
1027 (*best)->curlft.add_time < x->curlft.add_time)) in xfrm_state_look_at()
1028 *best = x; in xfrm_state_look_at()
1053 struct xfrm_state *best = NULL; in xfrm_state_find() local
1076 &best, &acquire_in_progress, &error); in xfrm_state_find()
1078 if (best || acquire_in_progress) in xfrm_state_find()
1093 &best, &acquire_in_progress, &error); in xfrm_state_find()
[all …]
/net/netfilter/
Dx_tables.c376 int have_rev, best = -1; in xt_find_revision() local
379 have_rev = target_revfn(af, name, revision, &best); in xt_find_revision()
381 have_rev = match_revfn(af, name, revision, &best); in xt_find_revision()
384 if (best == -1) { in xt_find_revision()
389 *err = best; in xt_find_revision()
Dnf_tables_api.c3223 struct nft_set_estimate est, best; in nft_select_set_ops() local
3239 best.size = ~0; in nft_select_set_ops()
3240 best.lookup = ~0; in nft_select_set_ops()
3241 best.space = ~0; in nft_select_set_ops()
3253 if (est.lookup < best.lookup) in nft_select_set_ops()
3255 if (est.lookup == best.lookup && in nft_select_set_ops()
3256 est.space < best.space) in nft_select_set_ops()
3261 if (est.space < best.space) in nft_select_set_ops()
3263 if (est.space == best.space && in nft_select_set_ops()
3264 est.lookup < best.lookup) in nft_select_set_ops()
[all …]
/net/core/
Dpktgen.c3194 struct pktgen_dev *pkt_dev, *best = NULL; in next_to_run() local
3200 if (best == NULL) in next_to_run()
3201 best = pkt_dev; in next_to_run()
3202 else if (ktime_compare(pkt_dev->next_tx, best->next_tx) < 0) in next_to_run()
3203 best = pkt_dev; in next_to_run()
3207 return best; in next_to_run()