/net/dccp/ |
D | qpolicy.c | 41 struct sk_buff *skb, *best = NULL; in qpolicy_prio_best_skb() local 44 if (best == NULL || skb->priority > best->priority) in qpolicy_prio_best_skb() 45 best = skb; in qpolicy_prio_best_skb() 46 return best; in qpolicy_prio_best_skb()
|
/net/batman-adv/ |
D | originator.c | 1199 struct batadv_neigh_node *best = NULL, *neigh; in batadv_find_best_neighbor() local 1204 if (best && (bao->neigh.cmp(neigh, if_outgoing, best, in batadv_find_best_neighbor() 1211 if (best) in batadv_find_best_neighbor() 1212 batadv_neigh_node_put(best); in batadv_find_best_neighbor() 1214 best = neigh; in batadv_find_best_neighbor() 1218 return best; in batadv_find_best_neighbor()
|
D | bat_v.c | 439 bool best) in batadv_v_orig_dump_subentry() argument 475 if (best && nla_put_flag(msg, BATADV_ATTR_FLAG_BEST)) in batadv_v_orig_dump_subentry() 509 bool best; in batadv_v_orig_dump_entry() local 519 best = (neigh_node == neigh_node_best); in batadv_v_orig_dump_entry() 523 neigh_node, best)) { in batadv_v_orig_dump_entry()
|
D | bat_iv_ogm.c | 2004 bool best) in batadv_iv_ogm_orig_dump_subentry() argument 2035 if (best && nla_put_flag(msg, BATADV_ATTR_FLAG_BEST)) in batadv_iv_ogm_orig_dump_subentry() 2069 bool best; in batadv_iv_ogm_orig_dump_entry() local 2087 best = (neigh_node == neigh_node_best); in batadv_iv_ogm_orig_dump_entry() 2092 best)) { in batadv_iv_ogm_orig_dump_entry()
|
D | translation-table.c | 1942 bool best) in batadv_tt_global_dump_subentry() argument 1976 if (best && nla_put_flag(msg, BATADV_ATTR_FLAG_BEST)) in batadv_tt_global_dump_subentry() 2009 bool best; in batadv_tt_global_dump_entry() local 2019 best = (orig_entry == best_entry); in batadv_tt_global_dump_entry() 2022 orig_entry, best)) { in batadv_tt_global_dump_entry()
|
/net/wireless/ |
D | db.txt | 13 # best option is to extract the db.txt file from the wireless-regdb git
|
/net/dcb/ |
D | Kconfig | 12 requirements (highly reliable, no drops vs. best effort vs. low
|
/net/sctp/ |
D | associola.c | 1250 struct sctp_transport *best) in sctp_trans_elect_best() argument 1254 if (best == NULL || curr == best) in sctp_trans_elect_best() 1258 score_best = sctp_trans_score(best); in sctp_trans_elect_best() 1267 return sctp_trans_elect_tie(best, curr); in sctp_trans_elect_best() 1269 return best; in sctp_trans_elect_best()
|
/net/xfrm/ |
D | xfrm_state.c | 748 struct xfrm_state **best, int *acq_in_progress, in xfrm_state_look_at() argument 768 if (!*best || in xfrm_state_look_at() 769 (*best)->km.dying > x->km.dying || in xfrm_state_look_at() 770 ((*best)->km.dying == x->km.dying && in xfrm_state_look_at() 771 (*best)->curlft.add_time < x->curlft.add_time)) in xfrm_state_look_at() 772 *best = x; in xfrm_state_look_at() 795 struct xfrm_state *best = NULL; in xfrm_state_find() local 817 &best, &acquire_in_progress, &error); in xfrm_state_find() 819 if (best || acquire_in_progress) in xfrm_state_find() 833 &best, &acquire_in_progress, &error); in xfrm_state_find() [all …]
|
/net/hsr/ |
D | Kconfig | 20 This code is a "best effort" to comply with the HSR standard as
|
/net/netfilter/ |
D | x_tables.c | 314 int have_rev, best = -1; in xt_find_revision() local 318 have_rev = target_revfn(af, name, revision, &best); in xt_find_revision() 320 have_rev = match_revfn(af, name, revision, &best); in xt_find_revision() 324 if (best == -1) { in xt_find_revision() 329 *err = best; in xt_find_revision()
|
D | nf_tables_api.c | 2338 struct nft_set_estimate est, best; in nft_select_set_ops() local 2357 best.size = ~0; in nft_select_set_ops() 2358 best.class = ~0; in nft_select_set_ops() 2368 if (est.class < best.class) in nft_select_set_ops() 2370 if (est.class == best.class && est.size < best.size) in nft_select_set_ops() 2374 if (est.size < best.size) in nft_select_set_ops() 2376 if (est.size == best.size && est.class < best.class) in nft_select_set_ops() 2389 best = est; in nft_select_set_ops()
|
/net/core/ |
D | pktgen.c | 3271 struct pktgen_dev *pkt_dev, *best = NULL; in next_to_run() local 3277 if (best == NULL) in next_to_run() 3278 best = pkt_dev; in next_to_run() 3279 else if (ktime_compare(pkt_dev->next_tx, best->next_tx) < 0) in next_to_run() 3280 best = pkt_dev; in next_to_run() 3284 return best; in next_to_run()
|