Lines Matching defs:parms
451 n->parms = neigh_parms_clone(&tbl->parms);
618 if (n->parms->neigh_setup &&
619 (error = n->parms->neigh_setup(n)) < 0) {
624 n->confirmed = jiffies - (NEIGH_VAR(n->parms, BASE_REACHABLE_TIME) << 1);
635 if (n->parms->dead) {
824 static void neigh_parms_destroy(struct neigh_parms *parms);
826 static inline void neigh_parms_put(struct neigh_parms *parms)
828 if (refcount_dec_and_test(&parms->refcnt))
829 neigh_parms_destroy(parms);
860 neigh_parms_put(neigh->parms);
946 n->used + NEIGH_VAR(n->parms, GC_STALETIME)))) {
976 NEIGH_VAR(&tbl->parms, BASE_REACHABLE_TIME) >> 1);
982 struct neigh_parms *p = n->parms;
1047 neigh->confirmed + neigh->parms->reachable_time)) {
1049 next = neigh->confirmed + neigh->parms->reachable_time;
1052 NEIGH_VAR(neigh->parms, DELAY_PROBE_TIME))) {
1057 next = now + NEIGH_VAR(neigh->parms, DELAY_PROBE_TIME);
1068 NEIGH_VAR(neigh->parms, DELAY_PROBE_TIME))) {
1074 next = neigh->confirmed + neigh->parms->reachable_time;
1081 next = now + max(NEIGH_VAR(neigh->parms, RETRANS_TIME),
1086 next = now + max(NEIGH_VAR(neigh->parms, RETRANS_TIME), HZ/100);
1132 if (NEIGH_VAR(neigh->parms, MCAST_PROBES) +
1133 NEIGH_VAR(neigh->parms, APP_PROBES)) {
1137 NEIGH_VAR(neigh->parms, UCAST_PROBES));
1141 next = now + max(NEIGH_VAR(neigh->parms, RETRANS_TIME),
1159 NEIGH_VAR(neigh->parms, DELAY_PROBE_TIME));
1165 NEIGH_VAR(neigh->parms, QUEUE_LEN_BYTES)) {
1357 neigh->parms->reachable_time :
1370 (NEIGH_VAR(neigh->parms, BASE_REACHABLE_TIME) << 1);
1451 jiffies + max(NEIGH_VAR(neigh->parms, RETRANS_TIME),
1637 p = kmemdup(&tbl->parms, sizeof(*p), GFP_KERNEL);
1655 list_add(&p->list, &tbl->parms.list);
1666 struct neigh_parms *parms =
1669 neigh_parms_put(parms);
1672 void neigh_parms_release(struct neigh_table *tbl, struct neigh_parms *parms)
1674 if (!parms || parms == &tbl->parms)
1677 list_del(&parms->list);
1678 parms->dead = 1;
1680 if (parms->dev)
1681 dev_put(parms->dev);
1682 call_rcu(&parms->rcu_head, neigh_rcu_free_parms);
1686 static void neigh_parms_destroy(struct neigh_parms *parms)
1688 kfree(parms);
1702 list_add(&tbl->parms.list, &tbl->parms_list);
1703 write_pnet(&tbl->parms.net, &init_net);
1704 refcount_set(&tbl->parms.refcnt, 1);
1705 tbl->parms.reachable_time =
1706 neigh_rand_reach_time(NEIGH_VAR(&tbl->parms, BASE_REACHABLE_TIME));
1735 tbl->parms.reachable_time);
1741 tbl->last_rand = now + tbl->parms.reachable_time * 20;
2006 static int neightbl_fill_parms(struct sk_buff *skb, struct neigh_parms *parms)
2014 if ((parms->dev &&
2015 nla_put_u32(skb, NDTPA_IFINDEX, parms->dev->ifindex)) ||
2016 nla_put_u32(skb, NDTPA_REFCNT, refcount_read(&parms->refcnt)) ||
2018 NEIGH_VAR(parms, QUEUE_LEN_BYTES)) ||
2021 NEIGH_VAR(parms, QUEUE_LEN_BYTES) / SKB_TRUESIZE(ETH_FRAME_LEN)) ||
2022 nla_put_u32(skb, NDTPA_PROXY_QLEN, NEIGH_VAR(parms, PROXY_QLEN)) ||
2023 nla_put_u32(skb, NDTPA_APP_PROBES, NEIGH_VAR(parms, APP_PROBES)) ||
2025 NEIGH_VAR(parms, UCAST_PROBES)) ||
2027 NEIGH_VAR(parms, MCAST_PROBES)) ||
2029 NEIGH_VAR(parms, MCAST_REPROBES)) ||
2030 nla_put_msecs(skb, NDTPA_REACHABLE_TIME, parms->reachable_time,
2033 NEIGH_VAR(parms, BASE_REACHABLE_TIME), NDTPA_PAD) ||
2035 NEIGH_VAR(parms, GC_STALETIME), NDTPA_PAD) ||
2037 NEIGH_VAR(parms, DELAY_PROBE_TIME), NDTPA_PAD) ||
2039 NEIGH_VAR(parms, RETRANS_TIME), NDTPA_PAD) ||
2041 NEIGH_VAR(parms, ANYCAST_DELAY), NDTPA_PAD) ||
2043 NEIGH_VAR(parms, PROXY_DELAY), NDTPA_PAD) ||
2045 NEIGH_VAR(parms, LOCKTIME), NDTPA_PAD))
2130 BUG_ON(tbl->parms.dev);
2131 if (neightbl_fill_parms(skb, &tbl->parms) < 0)
2146 struct neigh_parms *parms,
2165 neightbl_fill_parms(skb, parms) < 0)
2423 p = list_next_entry(&tbl->parms, list);