PageRenderTime 51ms CodeModel.GetById 17ms RepoModel.GetById 0ms app.codeStats 0ms

/net/ipv4/ipmr_base.c

https://gitlab.com/Skylake/linux-kernel
C | 370 lines | 302 code | 59 blank | 9 comment | 49 complexity | 57d98080d635c2c7468b08d6b658588f MD5 | raw file
  1. /* Linux multicast routing support
  2. * Common logic shared by IPv4 [ipmr] and IPv6 [ip6mr] implementation
  3. */
  4. #include <linux/mroute_base.h>
  5. /* Sets everything common except 'dev', since that is done under locking */
  6. void vif_device_init(struct vif_device *v,
  7. struct net_device *dev,
  8. unsigned long rate_limit,
  9. unsigned char threshold,
  10. unsigned short flags,
  11. unsigned short get_iflink_mask)
  12. {
  13. v->dev = NULL;
  14. v->bytes_in = 0;
  15. v->bytes_out = 0;
  16. v->pkt_in = 0;
  17. v->pkt_out = 0;
  18. v->rate_limit = rate_limit;
  19. v->flags = flags;
  20. v->threshold = threshold;
  21. if (v->flags & get_iflink_mask)
  22. v->link = dev_get_iflink(dev);
  23. else
  24. v->link = dev->ifindex;
  25. }
  26. EXPORT_SYMBOL(vif_device_init);
  27. struct mr_table *
  28. mr_table_alloc(struct net *net, u32 id,
  29. struct mr_table_ops *ops,
  30. void (*expire_func)(struct timer_list *t),
  31. void (*table_set)(struct mr_table *mrt,
  32. struct net *net))
  33. {
  34. struct mr_table *mrt;
  35. int err;
  36. mrt = kzalloc(sizeof(*mrt), GFP_KERNEL);
  37. if (!mrt)
  38. return ERR_PTR(-ENOMEM);
  39. mrt->id = id;
  40. write_pnet(&mrt->net, net);
  41. mrt->ops = *ops;
  42. err = rhltable_init(&mrt->mfc_hash, mrt->ops.rht_params);
  43. if (err) {
  44. kfree(mrt);
  45. return ERR_PTR(err);
  46. }
  47. INIT_LIST_HEAD(&mrt->mfc_cache_list);
  48. INIT_LIST_HEAD(&mrt->mfc_unres_queue);
  49. timer_setup(&mrt->ipmr_expire_timer, expire_func, 0);
  50. mrt->mroute_reg_vif_num = -1;
  51. table_set(mrt, net);
  52. return mrt;
  53. }
  54. EXPORT_SYMBOL(mr_table_alloc);
  55. void *mr_mfc_find_parent(struct mr_table *mrt, void *hasharg, int parent)
  56. {
  57. struct rhlist_head *tmp, *list;
  58. struct mr_mfc *c;
  59. list = rhltable_lookup(&mrt->mfc_hash, hasharg, *mrt->ops.rht_params);
  60. rhl_for_each_entry_rcu(c, tmp, list, mnode)
  61. if (parent == -1 || parent == c->mfc_parent)
  62. return c;
  63. return NULL;
  64. }
  65. EXPORT_SYMBOL(mr_mfc_find_parent);
  66. void *mr_mfc_find_any_parent(struct mr_table *mrt, int vifi)
  67. {
  68. struct rhlist_head *tmp, *list;
  69. struct mr_mfc *c;
  70. list = rhltable_lookup(&mrt->mfc_hash, mrt->ops.cmparg_any,
  71. *mrt->ops.rht_params);
  72. rhl_for_each_entry_rcu(c, tmp, list, mnode)
  73. if (c->mfc_un.res.ttls[vifi] < 255)
  74. return c;
  75. return NULL;
  76. }
  77. EXPORT_SYMBOL(mr_mfc_find_any_parent);
  78. void *mr_mfc_find_any(struct mr_table *mrt, int vifi, void *hasharg)
  79. {
  80. struct rhlist_head *tmp, *list;
  81. struct mr_mfc *c, *proxy;
  82. list = rhltable_lookup(&mrt->mfc_hash, hasharg, *mrt->ops.rht_params);
  83. rhl_for_each_entry_rcu(c, tmp, list, mnode) {
  84. if (c->mfc_un.res.ttls[vifi] < 255)
  85. return c;
  86. /* It's ok if the vifi is part of the static tree */
  87. proxy = mr_mfc_find_any_parent(mrt, c->mfc_parent);
  88. if (proxy && proxy->mfc_un.res.ttls[vifi] < 255)
  89. return c;
  90. }
  91. return mr_mfc_find_any_parent(mrt, vifi);
  92. }
  93. EXPORT_SYMBOL(mr_mfc_find_any);
  94. #ifdef CONFIG_PROC_FS
  95. void *mr_vif_seq_idx(struct net *net, struct mr_vif_iter *iter, loff_t pos)
  96. {
  97. struct mr_table *mrt = iter->mrt;
  98. for (iter->ct = 0; iter->ct < mrt->maxvif; ++iter->ct) {
  99. if (!VIF_EXISTS(mrt, iter->ct))
  100. continue;
  101. if (pos-- == 0)
  102. return &mrt->vif_table[iter->ct];
  103. }
  104. return NULL;
  105. }
  106. EXPORT_SYMBOL(mr_vif_seq_idx);
  107. void *mr_vif_seq_next(struct seq_file *seq, void *v, loff_t *pos)
  108. {
  109. struct mr_vif_iter *iter = seq->private;
  110. struct net *net = seq_file_net(seq);
  111. struct mr_table *mrt = iter->mrt;
  112. ++*pos;
  113. if (v == SEQ_START_TOKEN)
  114. return mr_vif_seq_idx(net, iter, 0);
  115. while (++iter->ct < mrt->maxvif) {
  116. if (!VIF_EXISTS(mrt, iter->ct))
  117. continue;
  118. return &mrt->vif_table[iter->ct];
  119. }
  120. return NULL;
  121. }
  122. EXPORT_SYMBOL(mr_vif_seq_next);
  123. void *mr_mfc_seq_idx(struct net *net,
  124. struct mr_mfc_iter *it, loff_t pos)
  125. {
  126. struct mr_table *mrt = it->mrt;
  127. struct mr_mfc *mfc;
  128. rcu_read_lock();
  129. it->cache = &mrt->mfc_cache_list;
  130. list_for_each_entry_rcu(mfc, &mrt->mfc_cache_list, list)
  131. if (pos-- == 0)
  132. return mfc;
  133. rcu_read_unlock();
  134. spin_lock_bh(it->lock);
  135. it->cache = &mrt->mfc_unres_queue;
  136. list_for_each_entry(mfc, it->cache, list)
  137. if (pos-- == 0)
  138. return mfc;
  139. spin_unlock_bh(it->lock);
  140. it->cache = NULL;
  141. return NULL;
  142. }
  143. EXPORT_SYMBOL(mr_mfc_seq_idx);
  144. void *mr_mfc_seq_next(struct seq_file *seq, void *v,
  145. loff_t *pos)
  146. {
  147. struct mr_mfc_iter *it = seq->private;
  148. struct net *net = seq_file_net(seq);
  149. struct mr_table *mrt = it->mrt;
  150. struct mr_mfc *c = v;
  151. ++*pos;
  152. if (v == SEQ_START_TOKEN)
  153. return mr_mfc_seq_idx(net, seq->private, 0);
  154. if (c->list.next != it->cache)
  155. return list_entry(c->list.next, struct mr_mfc, list);
  156. if (it->cache == &mrt->mfc_unres_queue)
  157. goto end_of_list;
  158. /* exhausted cache_array, show unresolved */
  159. rcu_read_unlock();
  160. it->cache = &mrt->mfc_unres_queue;
  161. spin_lock_bh(it->lock);
  162. if (!list_empty(it->cache))
  163. return list_first_entry(it->cache, struct mr_mfc, list);
  164. end_of_list:
  165. spin_unlock_bh(it->lock);
  166. it->cache = NULL;
  167. return NULL;
  168. }
  169. EXPORT_SYMBOL(mr_mfc_seq_next);
  170. #endif
  171. int mr_fill_mroute(struct mr_table *mrt, struct sk_buff *skb,
  172. struct mr_mfc *c, struct rtmsg *rtm)
  173. {
  174. struct rta_mfc_stats mfcs;
  175. struct nlattr *mp_attr;
  176. struct rtnexthop *nhp;
  177. unsigned long lastuse;
  178. int ct;
  179. /* If cache is unresolved, don't try to parse IIF and OIF */
  180. if (c->mfc_parent >= MAXVIFS) {
  181. rtm->rtm_flags |= RTNH_F_UNRESOLVED;
  182. return -ENOENT;
  183. }
  184. if (VIF_EXISTS(mrt, c->mfc_parent) &&
  185. nla_put_u32(skb, RTA_IIF,
  186. mrt->vif_table[c->mfc_parent].dev->ifindex) < 0)
  187. return -EMSGSIZE;
  188. if (c->mfc_flags & MFC_OFFLOAD)
  189. rtm->rtm_flags |= RTNH_F_OFFLOAD;
  190. mp_attr = nla_nest_start(skb, RTA_MULTIPATH);
  191. if (!mp_attr)
  192. return -EMSGSIZE;
  193. for (ct = c->mfc_un.res.minvif; ct < c->mfc_un.res.maxvif; ct++) {
  194. if (VIF_EXISTS(mrt, ct) && c->mfc_un.res.ttls[ct] < 255) {
  195. struct vif_device *vif;
  196. nhp = nla_reserve_nohdr(skb, sizeof(*nhp));
  197. if (!nhp) {
  198. nla_nest_cancel(skb, mp_attr);
  199. return -EMSGSIZE;
  200. }
  201. nhp->rtnh_flags = 0;
  202. nhp->rtnh_hops = c->mfc_un.res.ttls[ct];
  203. vif = &mrt->vif_table[ct];
  204. nhp->rtnh_ifindex = vif->dev->ifindex;
  205. nhp->rtnh_len = sizeof(*nhp);
  206. }
  207. }
  208. nla_nest_end(skb, mp_attr);
  209. lastuse = READ_ONCE(c->mfc_un.res.lastuse);
  210. lastuse = time_after_eq(jiffies, lastuse) ? jiffies - lastuse : 0;
  211. mfcs.mfcs_packets = c->mfc_un.res.pkt;
  212. mfcs.mfcs_bytes = c->mfc_un.res.bytes;
  213. mfcs.mfcs_wrong_if = c->mfc_un.res.wrong_if;
  214. if (nla_put_64bit(skb, RTA_MFC_STATS, sizeof(mfcs), &mfcs, RTA_PAD) ||
  215. nla_put_u64_64bit(skb, RTA_EXPIRES, jiffies_to_clock_t(lastuse),
  216. RTA_PAD))
  217. return -EMSGSIZE;
  218. rtm->rtm_type = RTN_MULTICAST;
  219. return 1;
  220. }
  221. EXPORT_SYMBOL(mr_fill_mroute);
  222. int mr_rtm_dumproute(struct sk_buff *skb, struct netlink_callback *cb,
  223. struct mr_table *(*iter)(struct net *net,
  224. struct mr_table *mrt),
  225. int (*fill)(struct mr_table *mrt,
  226. struct sk_buff *skb,
  227. u32 portid, u32 seq, struct mr_mfc *c,
  228. int cmd, int flags),
  229. spinlock_t *lock)
  230. {
  231. unsigned int t = 0, e = 0, s_t = cb->args[0], s_e = cb->args[1];
  232. struct net *net = sock_net(skb->sk);
  233. struct mr_table *mrt;
  234. struct mr_mfc *mfc;
  235. rcu_read_lock();
  236. for (mrt = iter(net, NULL); mrt; mrt = iter(net, mrt)) {
  237. if (t < s_t)
  238. goto next_table;
  239. list_for_each_entry_rcu(mfc, &mrt->mfc_cache_list, list) {
  240. if (e < s_e)
  241. goto next_entry;
  242. if (fill(mrt, skb, NETLINK_CB(cb->skb).portid,
  243. cb->nlh->nlmsg_seq, mfc,
  244. RTM_NEWROUTE, NLM_F_MULTI) < 0)
  245. goto done;
  246. next_entry:
  247. e++;
  248. }
  249. e = 0;
  250. s_e = 0;
  251. spin_lock_bh(lock);
  252. list_for_each_entry(mfc, &mrt->mfc_unres_queue, list) {
  253. if (e < s_e)
  254. goto next_entry2;
  255. if (fill(mrt, skb, NETLINK_CB(cb->skb).portid,
  256. cb->nlh->nlmsg_seq, mfc,
  257. RTM_NEWROUTE, NLM_F_MULTI) < 0) {
  258. spin_unlock_bh(lock);
  259. goto done;
  260. }
  261. next_entry2:
  262. e++;
  263. }
  264. spin_unlock_bh(lock);
  265. e = 0;
  266. s_e = 0;
  267. next_table:
  268. t++;
  269. }
  270. done:
  271. rcu_read_unlock();
  272. cb->args[1] = e;
  273. cb->args[0] = t;
  274. return skb->len;
  275. }
  276. EXPORT_SYMBOL(mr_rtm_dumproute);
  277. int mr_dump(struct net *net, struct notifier_block *nb, unsigned short family,
  278. int (*rules_dump)(struct net *net,
  279. struct notifier_block *nb),
  280. struct mr_table *(*mr_iter)(struct net *net,
  281. struct mr_table *mrt),
  282. rwlock_t *mrt_lock)
  283. {
  284. struct mr_table *mrt;
  285. int err;
  286. err = rules_dump(net, nb);
  287. if (err)
  288. return err;
  289. for (mrt = mr_iter(net, NULL); mrt; mrt = mr_iter(net, mrt)) {
  290. struct vif_device *v = &mrt->vif_table[0];
  291. struct mr_mfc *mfc;
  292. int vifi;
  293. /* Notifiy on table VIF entries */
  294. read_lock(mrt_lock);
  295. for (vifi = 0; vifi < mrt->maxvif; vifi++, v++) {
  296. if (!v->dev)
  297. continue;
  298. mr_call_vif_notifier(nb, net, family,
  299. FIB_EVENT_VIF_ADD,
  300. v, vifi, mrt->id);
  301. }
  302. read_unlock(mrt_lock);
  303. /* Notify on table MFC entries */
  304. list_for_each_entry_rcu(mfc, &mrt->mfc_cache_list, list)
  305. mr_call_mfc_notifier(nb, net, family,
  306. FIB_EVENT_ENTRY_ADD,
  307. mfc, mrt->id);
  308. }
  309. return 0;
  310. }
  311. EXPORT_SYMBOL(mr_dump);