addr.c 8.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369
  1. /*
  2. * Copyright (c) 2005 Voltaire Inc. All rights reserved.
  3. * Copyright (c) 2002-2005, Network Appliance, Inc. All rights reserved.
  4. * Copyright (c) 1999-2005, Mellanox Technologies, Inc. All rights reserved.
  5. * Copyright (c) 2005 Intel Corporation. All rights reserved.
  6. *
  7. * This Software is licensed under one of the following licenses:
  8. *
  9. * 1) under the terms of the "Common Public License 1.0" a copy of which is
  10. * available from the Open Source Initiative, see
  11. * http://www.opensource.org/licenses/cpl.php.
  12. *
  13. * 2) under the terms of the "The BSD License" a copy of which is
  14. * available from the Open Source Initiative, see
  15. * http://www.opensource.org/licenses/bsd-license.php.
  16. *
  17. * 3) under the terms of the "GNU General Public License (GPL) Version 2" a
  18. * copy of which is available from the Open Source Initiative, see
  19. * http://www.opensource.org/licenses/gpl-license.php.
  20. *
  21. * Licensee has the right to choose one of the above licenses.
  22. *
  23. * Redistributions of source code must retain the above copyright
  24. * notice and one of the license notices.
  25. *
  26. * Redistributions in binary form must reproduce both the above copyright
  27. * notice, one of the license notices in the documentation
  28. * and/or other materials provided with the distribution.
  29. */
  30. #include <linux/mutex.h>
  31. #include <linux/inetdevice.h>
  32. #include <linux/workqueue.h>
  33. #include <linux/if_arp.h>
  34. #include <net/arp.h>
  35. #include <net/neighbour.h>
  36. #include <net/route.h>
  37. #include <net/netevent.h>
  38. #include <rdma/ib_addr.h>
  39. MODULE_AUTHOR("Sean Hefty");
  40. MODULE_DESCRIPTION("IB Address Translation");
  41. MODULE_LICENSE("Dual BSD/GPL");
  42. struct addr_req {
  43. struct list_head list;
  44. struct sockaddr src_addr;
  45. struct sockaddr dst_addr;
  46. struct rdma_dev_addr *addr;
  47. void *context;
  48. void (*callback)(int status, struct sockaddr *src_addr,
  49. struct rdma_dev_addr *addr, void *context);
  50. unsigned long timeout;
  51. int status;
  52. };
  53. static void process_req(void *data);
  54. static DEFINE_MUTEX(lock);
  55. static LIST_HEAD(req_list);
  56. static DECLARE_WORK(work, process_req, NULL);
  57. static struct workqueue_struct *addr_wq;
  58. int rdma_copy_addr(struct rdma_dev_addr *dev_addr, struct net_device *dev,
  59. const unsigned char *dst_dev_addr)
  60. {
  61. switch (dev->type) {
  62. case ARPHRD_INFINIBAND:
  63. dev_addr->dev_type = RDMA_NODE_IB_CA;
  64. break;
  65. case ARPHRD_ETHER:
  66. dev_addr->dev_type = RDMA_NODE_RNIC;
  67. break;
  68. default:
  69. return -EADDRNOTAVAIL;
  70. }
  71. memcpy(dev_addr->src_dev_addr, dev->dev_addr, MAX_ADDR_LEN);
  72. memcpy(dev_addr->broadcast, dev->broadcast, MAX_ADDR_LEN);
  73. if (dst_dev_addr)
  74. memcpy(dev_addr->dst_dev_addr, dst_dev_addr, MAX_ADDR_LEN);
  75. return 0;
  76. }
  77. EXPORT_SYMBOL(rdma_copy_addr);
  78. int rdma_translate_ip(struct sockaddr *addr, struct rdma_dev_addr *dev_addr)
  79. {
  80. struct net_device *dev;
  81. __be32 ip = ((struct sockaddr_in *) addr)->sin_addr.s_addr;
  82. int ret;
  83. dev = ip_dev_find(ip);
  84. if (!dev)
  85. return -EADDRNOTAVAIL;
  86. ret = rdma_copy_addr(dev_addr, dev, NULL);
  87. dev_put(dev);
  88. return ret;
  89. }
  90. EXPORT_SYMBOL(rdma_translate_ip);
  91. static void set_timeout(unsigned long time)
  92. {
  93. unsigned long delay;
  94. cancel_delayed_work(&work);
  95. delay = time - jiffies;
  96. if ((long)delay <= 0)
  97. delay = 1;
  98. queue_delayed_work(addr_wq, &work, delay);
  99. }
  100. static void queue_req(struct addr_req *req)
  101. {
  102. struct addr_req *temp_req;
  103. mutex_lock(&lock);
  104. list_for_each_entry_reverse(temp_req, &req_list, list) {
  105. if (time_after(req->timeout, temp_req->timeout))
  106. break;
  107. }
  108. list_add(&req->list, &temp_req->list);
  109. if (req_list.next == &req->list)
  110. set_timeout(req->timeout);
  111. mutex_unlock(&lock);
  112. }
  113. static void addr_send_arp(struct sockaddr_in *dst_in)
  114. {
  115. struct rtable *rt;
  116. struct flowi fl;
  117. u32 dst_ip = dst_in->sin_addr.s_addr;
  118. memset(&fl, 0, sizeof fl);
  119. fl.nl_u.ip4_u.daddr = dst_ip;
  120. if (ip_route_output_key(&rt, &fl))
  121. return;
  122. arp_send(ARPOP_REQUEST, ETH_P_ARP, rt->rt_gateway, rt->idev->dev,
  123. rt->rt_src, NULL, rt->idev->dev->dev_addr, NULL);
  124. ip_rt_put(rt);
  125. }
  126. static int addr_resolve_remote(struct sockaddr_in *src_in,
  127. struct sockaddr_in *dst_in,
  128. struct rdma_dev_addr *addr)
  129. {
  130. u32 src_ip = src_in->sin_addr.s_addr;
  131. u32 dst_ip = dst_in->sin_addr.s_addr;
  132. struct flowi fl;
  133. struct rtable *rt;
  134. struct neighbour *neigh;
  135. int ret;
  136. memset(&fl, 0, sizeof fl);
  137. fl.nl_u.ip4_u.daddr = dst_ip;
  138. fl.nl_u.ip4_u.saddr = src_ip;
  139. ret = ip_route_output_key(&rt, &fl);
  140. if (ret)
  141. goto out;
  142. /* If the device does ARP internally, return 'done' */
  143. if (rt->idev->dev->flags & IFF_NOARP) {
  144. rdma_copy_addr(addr, rt->idev->dev, NULL);
  145. goto put;
  146. }
  147. neigh = neigh_lookup(&arp_tbl, &rt->rt_gateway, rt->idev->dev);
  148. if (!neigh) {
  149. ret = -ENODATA;
  150. goto put;
  151. }
  152. if (!(neigh->nud_state & NUD_VALID)) {
  153. ret = -ENODATA;
  154. goto release;
  155. }
  156. if (!src_ip) {
  157. src_in->sin_family = dst_in->sin_family;
  158. src_in->sin_addr.s_addr = rt->rt_src;
  159. }
  160. ret = rdma_copy_addr(addr, neigh->dev, neigh->ha);
  161. release:
  162. neigh_release(neigh);
  163. put:
  164. ip_rt_put(rt);
  165. out:
  166. return ret;
  167. }
  168. static void process_req(void *data)
  169. {
  170. struct addr_req *req, *temp_req;
  171. struct sockaddr_in *src_in, *dst_in;
  172. struct list_head done_list;
  173. INIT_LIST_HEAD(&done_list);
  174. mutex_lock(&lock);
  175. list_for_each_entry_safe(req, temp_req, &req_list, list) {
  176. if (req->status) {
  177. src_in = (struct sockaddr_in *) &req->src_addr;
  178. dst_in = (struct sockaddr_in *) &req->dst_addr;
  179. req->status = addr_resolve_remote(src_in, dst_in,
  180. req->addr);
  181. }
  182. if (req->status && time_after(jiffies, req->timeout))
  183. req->status = -ETIMEDOUT;
  184. else if (req->status == -ENODATA)
  185. continue;
  186. list_del(&req->list);
  187. list_add_tail(&req->list, &done_list);
  188. }
  189. if (!list_empty(&req_list)) {
  190. req = list_entry(req_list.next, struct addr_req, list);
  191. set_timeout(req->timeout);
  192. }
  193. mutex_unlock(&lock);
  194. list_for_each_entry_safe(req, temp_req, &done_list, list) {
  195. list_del(&req->list);
  196. req->callback(req->status, &req->src_addr, req->addr,
  197. req->context);
  198. kfree(req);
  199. }
  200. }
  201. static int addr_resolve_local(struct sockaddr_in *src_in,
  202. struct sockaddr_in *dst_in,
  203. struct rdma_dev_addr *addr)
  204. {
  205. struct net_device *dev;
  206. u32 src_ip = src_in->sin_addr.s_addr;
  207. __be32 dst_ip = dst_in->sin_addr.s_addr;
  208. int ret;
  209. dev = ip_dev_find(dst_ip);
  210. if (!dev)
  211. return -EADDRNOTAVAIL;
  212. if (ZERONET(src_ip)) {
  213. src_in->sin_family = dst_in->sin_family;
  214. src_in->sin_addr.s_addr = dst_ip;
  215. ret = rdma_copy_addr(addr, dev, dev->dev_addr);
  216. } else if (LOOPBACK(src_ip)) {
  217. ret = rdma_translate_ip((struct sockaddr *)dst_in, addr);
  218. if (!ret)
  219. memcpy(addr->dst_dev_addr, dev->dev_addr, MAX_ADDR_LEN);
  220. } else {
  221. ret = rdma_translate_ip((struct sockaddr *)src_in, addr);
  222. if (!ret)
  223. memcpy(addr->dst_dev_addr, dev->dev_addr, MAX_ADDR_LEN);
  224. }
  225. dev_put(dev);
  226. return ret;
  227. }
  228. int rdma_resolve_ip(struct sockaddr *src_addr, struct sockaddr *dst_addr,
  229. struct rdma_dev_addr *addr, int timeout_ms,
  230. void (*callback)(int status, struct sockaddr *src_addr,
  231. struct rdma_dev_addr *addr, void *context),
  232. void *context)
  233. {
  234. struct sockaddr_in *src_in, *dst_in;
  235. struct addr_req *req;
  236. int ret = 0;
  237. req = kmalloc(sizeof *req, GFP_KERNEL);
  238. if (!req)
  239. return -ENOMEM;
  240. memset(req, 0, sizeof *req);
  241. if (src_addr)
  242. memcpy(&req->src_addr, src_addr, ip_addr_size(src_addr));
  243. memcpy(&req->dst_addr, dst_addr, ip_addr_size(dst_addr));
  244. req->addr = addr;
  245. req->callback = callback;
  246. req->context = context;
  247. src_in = (struct sockaddr_in *) &req->src_addr;
  248. dst_in = (struct sockaddr_in *) &req->dst_addr;
  249. req->status = addr_resolve_local(src_in, dst_in, addr);
  250. if (req->status == -EADDRNOTAVAIL)
  251. req->status = addr_resolve_remote(src_in, dst_in, addr);
  252. switch (req->status) {
  253. case 0:
  254. req->timeout = jiffies;
  255. queue_req(req);
  256. break;
  257. case -ENODATA:
  258. req->timeout = msecs_to_jiffies(timeout_ms) + jiffies;
  259. queue_req(req);
  260. addr_send_arp(dst_in);
  261. break;
  262. default:
  263. ret = req->status;
  264. kfree(req);
  265. break;
  266. }
  267. return ret;
  268. }
  269. EXPORT_SYMBOL(rdma_resolve_ip);
  270. void rdma_addr_cancel(struct rdma_dev_addr *addr)
  271. {
  272. struct addr_req *req, *temp_req;
  273. mutex_lock(&lock);
  274. list_for_each_entry_safe(req, temp_req, &req_list, list) {
  275. if (req->addr == addr) {
  276. req->status = -ECANCELED;
  277. req->timeout = jiffies;
  278. list_del(&req->list);
  279. list_add(&req->list, &req_list);
  280. set_timeout(req->timeout);
  281. break;
  282. }
  283. }
  284. mutex_unlock(&lock);
  285. }
  286. EXPORT_SYMBOL(rdma_addr_cancel);
  287. static int netevent_callback(struct notifier_block *self, unsigned long event,
  288. void *ctx)
  289. {
  290. if (event == NETEVENT_NEIGH_UPDATE) {
  291. struct neighbour *neigh = ctx;
  292. if (neigh->dev->type == ARPHRD_INFINIBAND &&
  293. (neigh->nud_state & NUD_VALID)) {
  294. set_timeout(jiffies);
  295. }
  296. }
  297. return 0;
  298. }
  299. static struct notifier_block nb = {
  300. .notifier_call = netevent_callback
  301. };
  302. static int addr_init(void)
  303. {
  304. addr_wq = create_singlethread_workqueue("ib_addr_wq");
  305. if (!addr_wq)
  306. return -ENOMEM;
  307. register_netevent_notifier(&nb);
  308. return 0;
  309. }
  310. static void addr_cleanup(void)
  311. {
  312. unregister_netevent_notifier(&nb);
  313. destroy_workqueue(addr_wq);
  314. }
  315. module_init(addr_init);
  316. module_exit(addr_cleanup);