dn_rules.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425
  1. /*
  2. * DECnet An implementation of the DECnet protocol suite for the LINUX
  3. * operating system. DECnet is implemented using the BSD Socket
  4. * interface as the means of communication with the user level.
  5. *
  6. * DECnet Routing Forwarding Information Base (Rules)
  7. *
  8. * Author: Steve Whitehouse <SteveW@ACM.org>
  9. * Mostly copied from Alexey Kuznetsov's ipv4/fib_rules.c
  10. *
  11. *
  12. * Changes:
  13. *
  14. */
  15. #include <linux/string.h>
  16. #include <linux/net.h>
  17. #include <linux/socket.h>
  18. #include <linux/sockios.h>
  19. #include <linux/init.h>
  20. #include <linux/skbuff.h>
  21. #include <linux/netlink.h>
  22. #include <linux/rtnetlink.h>
  23. #include <linux/proc_fs.h>
  24. #include <linux/netdevice.h>
  25. #include <linux/timer.h>
  26. #include <linux/spinlock.h>
  27. #include <linux/in_route.h>
  28. #include <linux/list.h>
  29. #include <linux/rcupdate.h>
  30. #include <asm/atomic.h>
  31. #include <asm/uaccess.h>
  32. #include <net/neighbour.h>
  33. #include <net/dst.h>
  34. #include <net/flow.h>
  35. #include <net/dn.h>
  36. #include <net/dn_fib.h>
  37. #include <net/dn_neigh.h>
  38. #include <net/dn_dev.h>
  39. struct dn_fib_rule
  40. {
  41. struct hlist_node r_hlist;
  42. atomic_t r_clntref;
  43. u32 r_preference;
  44. unsigned char r_table;
  45. unsigned char r_action;
  46. unsigned char r_dst_len;
  47. unsigned char r_src_len;
  48. __le16 r_src;
  49. __le16 r_srcmask;
  50. __le16 r_dst;
  51. __le16 r_dstmask;
  52. __le16 r_srcmap;
  53. u8 r_flags;
  54. #ifdef CONFIG_DECNET_ROUTE_FWMARK
  55. u32 r_fwmark;
  56. #endif
  57. int r_ifindex;
  58. char r_ifname[IFNAMSIZ];
  59. int r_dead;
  60. struct rcu_head rcu;
  61. };
  62. static struct dn_fib_rule default_rule = {
  63. .r_clntref = ATOMIC_INIT(2),
  64. .r_preference = 0x7fff,
  65. .r_table = RT_TABLE_MAIN,
  66. .r_action = RTN_UNICAST
  67. };
  68. static struct hlist_head dn_fib_rules;
  69. int dn_fib_rtm_delrule(struct sk_buff *skb, struct nlmsghdr *nlh, void *arg)
  70. {
  71. struct rtattr **rta = arg;
  72. struct rtmsg *rtm = NLMSG_DATA(nlh);
  73. struct dn_fib_rule *r;
  74. struct hlist_node *node;
  75. int err = -ESRCH;
  76. hlist_for_each_entry(r, node, &dn_fib_rules, r_hlist) {
  77. if ((!rta[RTA_SRC-1] || memcmp(RTA_DATA(rta[RTA_SRC-1]), &r->r_src, 2) == 0) &&
  78. rtm->rtm_src_len == r->r_src_len &&
  79. rtm->rtm_dst_len == r->r_dst_len &&
  80. (!rta[RTA_DST-1] || memcmp(RTA_DATA(rta[RTA_DST-1]), &r->r_dst, 2) == 0) &&
  81. #ifdef CONFIG_DECNET_ROUTE_FWMARK
  82. (!rta[RTA_PROTOINFO-1] || memcmp(RTA_DATA(rta[RTA_PROTOINFO-1]), &r->r_fwmark, 4) == 0) &&
  83. #endif
  84. (!rtm->rtm_type || rtm->rtm_type == r->r_action) &&
  85. (!rta[RTA_PRIORITY-1] || memcmp(RTA_DATA(rta[RTA_PRIORITY-1]), &r->r_preference, 4) == 0) &&
  86. (!rta[RTA_IIF-1] || rtattr_strcmp(rta[RTA_IIF-1], r->r_ifname) == 0) &&
  87. (!rtm->rtm_table || (r && rtm->rtm_table == r->r_table))) {
  88. err = -EPERM;
  89. if (r == &default_rule)
  90. break;
  91. hlist_del_rcu(&r->r_hlist);
  92. r->r_dead = 1;
  93. dn_fib_rule_put(r);
  94. err = 0;
  95. break;
  96. }
  97. }
  98. return err;
  99. }
  100. static inline void dn_fib_rule_put_rcu(struct rcu_head *head)
  101. {
  102. struct dn_fib_rule *r = container_of(head, struct dn_fib_rule, rcu);
  103. kfree(r);
  104. }
  105. void dn_fib_rule_put(struct dn_fib_rule *r)
  106. {
  107. if (atomic_dec_and_test(&r->r_clntref)) {
  108. if (r->r_dead)
  109. call_rcu(&r->rcu, dn_fib_rule_put_rcu);
  110. else
  111. printk(KERN_DEBUG "Attempt to free alive dn_fib_rule\n");
  112. }
  113. }
  114. int dn_fib_rtm_newrule(struct sk_buff *skb, struct nlmsghdr *nlh, void *arg)
  115. {
  116. struct rtattr **rta = arg;
  117. struct rtmsg *rtm = NLMSG_DATA(nlh);
  118. struct dn_fib_rule *r, *new_r, *last = NULL;
  119. struct hlist_node *node = NULL;
  120. unsigned char table_id;
  121. if (rtm->rtm_src_len > 16 || rtm->rtm_dst_len > 16)
  122. return -EINVAL;
  123. if (rta[RTA_IIF-1] && RTA_PAYLOAD(rta[RTA_IIF-1]) > IFNAMSIZ)
  124. return -EINVAL;
  125. if (rtm->rtm_type == RTN_NAT)
  126. return -EINVAL;
  127. table_id = rtm->rtm_table;
  128. if (table_id == RT_TABLE_UNSPEC) {
  129. struct dn_fib_table *tb;
  130. if (rtm->rtm_type == RTN_UNICAST) {
  131. if ((tb = dn_fib_empty_table()) == NULL)
  132. return -ENOBUFS;
  133. table_id = tb->n;
  134. }
  135. }
  136. new_r = kmalloc(sizeof(*new_r), GFP_KERNEL);
  137. if (!new_r)
  138. return -ENOMEM;
  139. memset(new_r, 0, sizeof(*new_r));
  140. if (rta[RTA_SRC-1])
  141. memcpy(&new_r->r_src, RTA_DATA(rta[RTA_SRC-1]), 2);
  142. if (rta[RTA_DST-1])
  143. memcpy(&new_r->r_dst, RTA_DATA(rta[RTA_DST-1]), 2);
  144. if (rta[RTA_GATEWAY-1])
  145. memcpy(&new_r->r_srcmap, RTA_DATA(rta[RTA_GATEWAY-1]), 2);
  146. new_r->r_src_len = rtm->rtm_src_len;
  147. new_r->r_dst_len = rtm->rtm_dst_len;
  148. new_r->r_srcmask = dnet_make_mask(rtm->rtm_src_len);
  149. new_r->r_dstmask = dnet_make_mask(rtm->rtm_dst_len);
  150. #ifdef CONFIG_DECNET_ROUTE_FWMARK
  151. if (rta[RTA_PROTOINFO-1])
  152. memcpy(&new_r->r_fwmark, RTA_DATA(rta[RTA_PROTOINFO-1]), 4);
  153. #endif
  154. new_r->r_action = rtm->rtm_type;
  155. new_r->r_flags = rtm->rtm_flags;
  156. if (rta[RTA_PRIORITY-1])
  157. memcpy(&new_r->r_preference, RTA_DATA(rta[RTA_PRIORITY-1]), 4);
  158. new_r->r_table = table_id;
  159. if (rta[RTA_IIF-1]) {
  160. struct net_device *dev;
  161. rtattr_strlcpy(new_r->r_ifname, rta[RTA_IIF-1], IFNAMSIZ);
  162. new_r->r_ifindex = -1;
  163. dev = dev_get_by_name(new_r->r_ifname);
  164. if (dev) {
  165. new_r->r_ifindex = dev->ifindex;
  166. dev_put(dev);
  167. }
  168. }
  169. r = container_of(dn_fib_rules.first, struct dn_fib_rule, r_hlist);
  170. if (!new_r->r_preference) {
  171. if (r && r->r_hlist.next != NULL) {
  172. r = container_of(r->r_hlist.next, struct dn_fib_rule, r_hlist);
  173. if (r->r_preference)
  174. new_r->r_preference = r->r_preference - 1;
  175. }
  176. }
  177. hlist_for_each_entry(r, node, &dn_fib_rules, r_hlist) {
  178. if (r->r_preference > new_r->r_preference)
  179. break;
  180. last = r;
  181. }
  182. atomic_inc(&new_r->r_clntref);
  183. if (last)
  184. hlist_add_after_rcu(&last->r_hlist, &new_r->r_hlist);
  185. else
  186. hlist_add_before_rcu(&new_r->r_hlist, &r->r_hlist);
  187. return 0;
  188. }
  189. int dn_fib_lookup(const struct flowi *flp, struct dn_fib_res *res)
  190. {
  191. struct dn_fib_rule *r, *policy;
  192. struct dn_fib_table *tb;
  193. __le16 saddr = flp->fld_src;
  194. __le16 daddr = flp->fld_dst;
  195. struct hlist_node *node;
  196. int err;
  197. rcu_read_lock();
  198. hlist_for_each_entry_rcu(r, node, &dn_fib_rules, r_hlist) {
  199. if (((saddr^r->r_src) & r->r_srcmask) ||
  200. ((daddr^r->r_dst) & r->r_dstmask) ||
  201. #ifdef CONFIG_DECNET_ROUTE_FWMARK
  202. (r->r_fwmark && r->r_fwmark != flp->fld_fwmark) ||
  203. #endif
  204. (r->r_ifindex && r->r_ifindex != flp->iif))
  205. continue;
  206. switch(r->r_action) {
  207. case RTN_UNICAST:
  208. case RTN_NAT:
  209. policy = r;
  210. break;
  211. case RTN_UNREACHABLE:
  212. rcu_read_unlock();
  213. return -ENETUNREACH;
  214. default:
  215. case RTN_BLACKHOLE:
  216. rcu_read_unlock();
  217. return -EINVAL;
  218. case RTN_PROHIBIT:
  219. rcu_read_unlock();
  220. return -EACCES;
  221. }
  222. if ((tb = dn_fib_get_table(r->r_table, 0)) == NULL)
  223. continue;
  224. err = tb->lookup(tb, flp, res);
  225. if (err == 0) {
  226. res->r = policy;
  227. if (policy)
  228. atomic_inc(&policy->r_clntref);
  229. rcu_read_unlock();
  230. return 0;
  231. }
  232. if (err < 0 && err != -EAGAIN) {
  233. rcu_read_unlock();
  234. return err;
  235. }
  236. }
  237. rcu_read_unlock();
  238. return -ESRCH;
  239. }
  240. unsigned dnet_addr_type(__le16 addr)
  241. {
  242. struct flowi fl = { .nl_u = { .dn_u = { .daddr = addr } } };
  243. struct dn_fib_res res;
  244. unsigned ret = RTN_UNICAST;
  245. struct dn_fib_table *tb = dn_fib_tables[RT_TABLE_LOCAL];
  246. res.r = NULL;
  247. if (tb) {
  248. if (!tb->lookup(tb, &fl, &res)) {
  249. ret = res.type;
  250. dn_fib_res_put(&res);
  251. }
  252. }
  253. return ret;
  254. }
  255. __le16 dn_fib_rules_policy(__le16 saddr, struct dn_fib_res *res, unsigned *flags)
  256. {
  257. struct dn_fib_rule *r = res->r;
  258. if (r->r_action == RTN_NAT) {
  259. int addrtype = dnet_addr_type(r->r_srcmap);
  260. if (addrtype == RTN_NAT) {
  261. saddr = (saddr&~r->r_srcmask)|r->r_srcmap;
  262. *flags |= RTCF_SNAT;
  263. } else if (addrtype == RTN_LOCAL || r->r_srcmap == 0) {
  264. saddr = r->r_srcmap;
  265. *flags |= RTCF_MASQ;
  266. }
  267. }
  268. return saddr;
  269. }
  270. static void dn_fib_rules_detach(struct net_device *dev)
  271. {
  272. struct hlist_node *node;
  273. struct dn_fib_rule *r;
  274. hlist_for_each_entry(r, node, &dn_fib_rules, r_hlist) {
  275. if (r->r_ifindex == dev->ifindex)
  276. r->r_ifindex = -1;
  277. }
  278. }
  279. static void dn_fib_rules_attach(struct net_device *dev)
  280. {
  281. struct hlist_node *node;
  282. struct dn_fib_rule *r;
  283. hlist_for_each_entry(r, node, &dn_fib_rules, r_hlist) {
  284. if (r->r_ifindex == -1 && strcmp(dev->name, r->r_ifname) == 0)
  285. r->r_ifindex = dev->ifindex;
  286. }
  287. }
  288. static int dn_fib_rules_event(struct notifier_block *this, unsigned long event, void *ptr)
  289. {
  290. struct net_device *dev = ptr;
  291. switch(event) {
  292. case NETDEV_UNREGISTER:
  293. dn_fib_rules_detach(dev);
  294. dn_fib_sync_down(0, dev, 1);
  295. case NETDEV_REGISTER:
  296. dn_fib_rules_attach(dev);
  297. dn_fib_sync_up(dev);
  298. }
  299. return NOTIFY_DONE;
  300. }
  301. static struct notifier_block dn_fib_rules_notifier = {
  302. .notifier_call = dn_fib_rules_event,
  303. };
  304. static int dn_fib_fill_rule(struct sk_buff *skb, struct dn_fib_rule *r,
  305. struct netlink_callback *cb, unsigned int flags)
  306. {
  307. struct rtmsg *rtm;
  308. struct nlmsghdr *nlh;
  309. unsigned char *b = skb->tail;
  310. nlh = NLMSG_NEW_ANSWER(skb, cb, RTM_NEWRULE, sizeof(*rtm), flags);
  311. rtm = NLMSG_DATA(nlh);
  312. rtm->rtm_family = AF_DECnet;
  313. rtm->rtm_dst_len = r->r_dst_len;
  314. rtm->rtm_src_len = r->r_src_len;
  315. rtm->rtm_tos = 0;
  316. #ifdef CONFIG_DECNET_ROUTE_FWMARK
  317. if (r->r_fwmark)
  318. RTA_PUT(skb, RTA_PROTOINFO, 4, &r->r_fwmark);
  319. #endif
  320. rtm->rtm_table = r->r_table;
  321. rtm->rtm_protocol = 0;
  322. rtm->rtm_scope = 0;
  323. rtm->rtm_type = r->r_action;
  324. rtm->rtm_flags = r->r_flags;
  325. if (r->r_dst_len)
  326. RTA_PUT(skb, RTA_DST, 2, &r->r_dst);
  327. if (r->r_src_len)
  328. RTA_PUT(skb, RTA_SRC, 2, &r->r_src);
  329. if (r->r_ifname[0])
  330. RTA_PUT(skb, RTA_IIF, IFNAMSIZ, &r->r_ifname);
  331. if (r->r_preference)
  332. RTA_PUT(skb, RTA_PRIORITY, 4, &r->r_preference);
  333. if (r->r_srcmap)
  334. RTA_PUT(skb, RTA_GATEWAY, 2, &r->r_srcmap);
  335. nlh->nlmsg_len = skb->tail - b;
  336. return skb->len;
  337. nlmsg_failure:
  338. rtattr_failure:
  339. skb_trim(skb, b - skb->data);
  340. return -1;
  341. }
  342. int dn_fib_dump_rules(struct sk_buff *skb, struct netlink_callback *cb)
  343. {
  344. int idx = 0;
  345. int s_idx = cb->args[0];
  346. struct dn_fib_rule *r;
  347. struct hlist_node *node;
  348. rcu_read_lock();
  349. hlist_for_each_entry(r, node, &dn_fib_rules, r_hlist) {
  350. if (idx < s_idx)
  351. continue;
  352. if (dn_fib_fill_rule(skb, r, cb, NLM_F_MULTI) < 0)
  353. break;
  354. idx++;
  355. }
  356. rcu_read_unlock();
  357. cb->args[0] = idx;
  358. return skb->len;
  359. }
  360. void __init dn_fib_rules_init(void)
  361. {
  362. INIT_HLIST_HEAD(&dn_fib_rules);
  363. hlist_add_head(&default_rule.r_hlist, &dn_fib_rules);
  364. register_netdevice_notifier(&dn_fib_rules_notifier);
  365. }
  366. void __exit dn_fib_rules_cleanup(void)
  367. {
  368. unregister_netdevice_notifier(&dn_fib_rules_notifier);
  369. }