uverbs_main.c 25 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936
  1. /*
  2. * Copyright (c) 2005 Topspin Communications. All rights reserved.
  3. * Copyright (c) 2005, 2006 Cisco Systems. All rights reserved.
  4. * Copyright (c) 2005 Mellanox Technologies. All rights reserved.
  5. * Copyright (c) 2005 Voltaire, Inc. All rights reserved.
  6. * Copyright (c) 2005 PathScale, Inc. All rights reserved.
  7. *
  8. * This software is available to you under a choice of one of two
  9. * licenses. You may choose to be licensed under the terms of the GNU
  10. * General Public License (GPL) Version 2, available from the file
  11. * COPYING in the main directory of this source tree, or the
  12. * OpenIB.org BSD license below:
  13. *
  14. * Redistribution and use in source and binary forms, with or
  15. * without modification, are permitted provided that the following
  16. * conditions are met:
  17. *
  18. * - Redistributions of source code must retain the above
  19. * copyright notice, this list of conditions and the following
  20. * disclaimer.
  21. *
  22. * - Redistributions in binary form must reproduce the above
  23. * copyright notice, this list of conditions and the following
  24. * disclaimer in the documentation and/or other materials
  25. * provided with the distribution.
  26. *
  27. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  28. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  29. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  30. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  31. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  32. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  33. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  34. * SOFTWARE.
  35. */
  36. #include <linux/module.h>
  37. #include <linux/init.h>
  38. #include <linux/device.h>
  39. #include <linux/err.h>
  40. #include <linux/fs.h>
  41. #include <linux/poll.h>
  42. #include <linux/sched.h>
  43. #include <linux/file.h>
  44. #include <linux/cdev.h>
  45. #include <linux/anon_inodes.h>
  46. #include <linux/slab.h>
  47. #include <asm/uaccess.h>
  48. #include "uverbs.h"
  49. MODULE_AUTHOR("Roland Dreier");
  50. MODULE_DESCRIPTION("InfiniBand userspace verbs access");
  51. MODULE_LICENSE("Dual BSD/GPL");
  52. enum {
  53. IB_UVERBS_MAJOR = 231,
  54. IB_UVERBS_BASE_MINOR = 192,
  55. IB_UVERBS_MAX_DEVICES = 32
  56. };
  57. #define IB_UVERBS_BASE_DEV MKDEV(IB_UVERBS_MAJOR, IB_UVERBS_BASE_MINOR)
  58. static struct class *uverbs_class;
  59. DEFINE_SPINLOCK(ib_uverbs_idr_lock);
  60. DEFINE_IDR(ib_uverbs_pd_idr);
  61. DEFINE_IDR(ib_uverbs_mr_idr);
  62. DEFINE_IDR(ib_uverbs_mw_idr);
  63. DEFINE_IDR(ib_uverbs_ah_idr);
  64. DEFINE_IDR(ib_uverbs_cq_idr);
  65. DEFINE_IDR(ib_uverbs_qp_idr);
  66. DEFINE_IDR(ib_uverbs_srq_idr);
  67. DEFINE_IDR(ib_uverbs_xrcd_idr);
  68. static DEFINE_SPINLOCK(map_lock);
  69. static DECLARE_BITMAP(dev_map, IB_UVERBS_MAX_DEVICES);
  70. static ssize_t (*uverbs_cmd_table[])(struct ib_uverbs_file *file,
  71. const char __user *buf, int in_len,
  72. int out_len) = {
  73. [IB_USER_VERBS_CMD_GET_CONTEXT] = ib_uverbs_get_context,
  74. [IB_USER_VERBS_CMD_QUERY_DEVICE] = ib_uverbs_query_device,
  75. [IB_USER_VERBS_CMD_QUERY_PORT] = ib_uverbs_query_port,
  76. [IB_USER_VERBS_CMD_ALLOC_PD] = ib_uverbs_alloc_pd,
  77. [IB_USER_VERBS_CMD_DEALLOC_PD] = ib_uverbs_dealloc_pd,
  78. [IB_USER_VERBS_CMD_REG_MR] = ib_uverbs_reg_mr,
  79. [IB_USER_VERBS_CMD_DEREG_MR] = ib_uverbs_dereg_mr,
  80. [IB_USER_VERBS_CMD_CREATE_COMP_CHANNEL] = ib_uverbs_create_comp_channel,
  81. [IB_USER_VERBS_CMD_CREATE_CQ] = ib_uverbs_create_cq,
  82. [IB_USER_VERBS_CMD_RESIZE_CQ] = ib_uverbs_resize_cq,
  83. [IB_USER_VERBS_CMD_POLL_CQ] = ib_uverbs_poll_cq,
  84. [IB_USER_VERBS_CMD_REQ_NOTIFY_CQ] = ib_uverbs_req_notify_cq,
  85. [IB_USER_VERBS_CMD_DESTROY_CQ] = ib_uverbs_destroy_cq,
  86. [IB_USER_VERBS_CMD_CREATE_QP] = ib_uverbs_create_qp,
  87. [IB_USER_VERBS_CMD_QUERY_QP] = ib_uverbs_query_qp,
  88. [IB_USER_VERBS_CMD_MODIFY_QP] = ib_uverbs_modify_qp,
  89. [IB_USER_VERBS_CMD_DESTROY_QP] = ib_uverbs_destroy_qp,
  90. [IB_USER_VERBS_CMD_POST_SEND] = ib_uverbs_post_send,
  91. [IB_USER_VERBS_CMD_POST_RECV] = ib_uverbs_post_recv,
  92. [IB_USER_VERBS_CMD_POST_SRQ_RECV] = ib_uverbs_post_srq_recv,
  93. [IB_USER_VERBS_CMD_CREATE_AH] = ib_uverbs_create_ah,
  94. [IB_USER_VERBS_CMD_DESTROY_AH] = ib_uverbs_destroy_ah,
  95. [IB_USER_VERBS_CMD_ATTACH_MCAST] = ib_uverbs_attach_mcast,
  96. [IB_USER_VERBS_CMD_DETACH_MCAST] = ib_uverbs_detach_mcast,
  97. [IB_USER_VERBS_CMD_CREATE_SRQ] = ib_uverbs_create_srq,
  98. [IB_USER_VERBS_CMD_MODIFY_SRQ] = ib_uverbs_modify_srq,
  99. [IB_USER_VERBS_CMD_QUERY_SRQ] = ib_uverbs_query_srq,
  100. [IB_USER_VERBS_CMD_DESTROY_SRQ] = ib_uverbs_destroy_srq,
  101. [IB_USER_VERBS_CMD_OPEN_XRCD] = ib_uverbs_open_xrcd,
  102. [IB_USER_VERBS_CMD_CLOSE_XRCD] = ib_uverbs_close_xrcd,
  103. [IB_USER_VERBS_CMD_CREATE_XSRQ] = ib_uverbs_create_xsrq,
  104. [IB_USER_VERBS_CMD_OPEN_QP] = ib_uverbs_open_qp
  105. };
  106. static void ib_uverbs_add_one(struct ib_device *device);
  107. static void ib_uverbs_remove_one(struct ib_device *device);
  108. static void ib_uverbs_release_dev(struct kobject *kobj)
  109. {
  110. struct ib_uverbs_device *dev =
  111. container_of(kobj, struct ib_uverbs_device, kobj);
  112. kfree(dev);
  113. }
  114. static struct kobj_type ib_uverbs_dev_ktype = {
  115. .release = ib_uverbs_release_dev,
  116. };
  117. static void ib_uverbs_release_event_file(struct kref *ref)
  118. {
  119. struct ib_uverbs_event_file *file =
  120. container_of(ref, struct ib_uverbs_event_file, ref);
  121. kfree(file);
  122. }
  123. void ib_uverbs_release_ucq(struct ib_uverbs_file *file,
  124. struct ib_uverbs_event_file *ev_file,
  125. struct ib_ucq_object *uobj)
  126. {
  127. struct ib_uverbs_event *evt, *tmp;
  128. if (ev_file) {
  129. spin_lock_irq(&ev_file->lock);
  130. list_for_each_entry_safe(evt, tmp, &uobj->comp_list, obj_list) {
  131. list_del(&evt->list);
  132. kfree(evt);
  133. }
  134. spin_unlock_irq(&ev_file->lock);
  135. kref_put(&ev_file->ref, ib_uverbs_release_event_file);
  136. }
  137. spin_lock_irq(&file->async_file->lock);
  138. list_for_each_entry_safe(evt, tmp, &uobj->async_list, obj_list) {
  139. list_del(&evt->list);
  140. kfree(evt);
  141. }
  142. spin_unlock_irq(&file->async_file->lock);
  143. }
  144. void ib_uverbs_release_uevent(struct ib_uverbs_file *file,
  145. struct ib_uevent_object *uobj)
  146. {
  147. struct ib_uverbs_event *evt, *tmp;
  148. spin_lock_irq(&file->async_file->lock);
  149. list_for_each_entry_safe(evt, tmp, &uobj->event_list, obj_list) {
  150. list_del(&evt->list);
  151. kfree(evt);
  152. }
  153. spin_unlock_irq(&file->async_file->lock);
  154. }
  155. static void ib_uverbs_detach_umcast(struct ib_qp *qp,
  156. struct ib_uqp_object *uobj)
  157. {
  158. struct ib_uverbs_mcast_entry *mcast, *tmp;
  159. list_for_each_entry_safe(mcast, tmp, &uobj->mcast_list, list) {
  160. ib_detach_mcast(qp, &mcast->gid, mcast->lid);
  161. list_del(&mcast->list);
  162. kfree(mcast);
  163. }
  164. }
  165. static int ib_uverbs_cleanup_ucontext(struct ib_uverbs_file *file,
  166. struct ib_ucontext *context)
  167. {
  168. struct ib_uobject *uobj, *tmp;
  169. if (!context)
  170. return 0;
  171. context->closing = 1;
  172. list_for_each_entry_safe(uobj, tmp, &context->ah_list, list) {
  173. struct ib_ah *ah = uobj->object;
  174. idr_remove_uobj(&ib_uverbs_ah_idr, uobj);
  175. ib_destroy_ah(ah);
  176. kfree(uobj);
  177. }
  178. list_for_each_entry_safe(uobj, tmp, &context->qp_list, list) {
  179. struct ib_qp *qp = uobj->object;
  180. struct ib_uqp_object *uqp =
  181. container_of(uobj, struct ib_uqp_object, uevent.uobject);
  182. idr_remove_uobj(&ib_uverbs_qp_idr, uobj);
  183. if (qp != qp->real_qp) {
  184. ib_close_qp(qp);
  185. } else {
  186. ib_uverbs_detach_umcast(qp, uqp);
  187. ib_destroy_qp(qp);
  188. }
  189. ib_uverbs_release_uevent(file, &uqp->uevent);
  190. kfree(uqp);
  191. }
  192. list_for_each_entry_safe(uobj, tmp, &context->cq_list, list) {
  193. struct ib_cq *cq = uobj->object;
  194. struct ib_uverbs_event_file *ev_file = cq->cq_context;
  195. struct ib_ucq_object *ucq =
  196. container_of(uobj, struct ib_ucq_object, uobject);
  197. idr_remove_uobj(&ib_uverbs_cq_idr, uobj);
  198. ib_destroy_cq(cq);
  199. ib_uverbs_release_ucq(file, ev_file, ucq);
  200. kfree(ucq);
  201. }
  202. list_for_each_entry_safe(uobj, tmp, &context->srq_list, list) {
  203. struct ib_srq *srq = uobj->object;
  204. struct ib_uevent_object *uevent =
  205. container_of(uobj, struct ib_uevent_object, uobject);
  206. idr_remove_uobj(&ib_uverbs_srq_idr, uobj);
  207. ib_destroy_srq(srq);
  208. ib_uverbs_release_uevent(file, uevent);
  209. kfree(uevent);
  210. }
  211. /* XXX Free MWs */
  212. list_for_each_entry_safe(uobj, tmp, &context->mr_list, list) {
  213. struct ib_mr *mr = uobj->object;
  214. idr_remove_uobj(&ib_uverbs_mr_idr, uobj);
  215. ib_dereg_mr(mr);
  216. kfree(uobj);
  217. }
  218. mutex_lock(&file->device->xrcd_tree_mutex);
  219. list_for_each_entry_safe(uobj, tmp, &context->xrcd_list, list) {
  220. struct ib_xrcd *xrcd = uobj->object;
  221. struct ib_uxrcd_object *uxrcd =
  222. container_of(uobj, struct ib_uxrcd_object, uobject);
  223. idr_remove_uobj(&ib_uverbs_xrcd_idr, uobj);
  224. ib_uverbs_dealloc_xrcd(file->device, xrcd);
  225. kfree(uxrcd);
  226. }
  227. mutex_unlock(&file->device->xrcd_tree_mutex);
  228. list_for_each_entry_safe(uobj, tmp, &context->pd_list, list) {
  229. struct ib_pd *pd = uobj->object;
  230. idr_remove_uobj(&ib_uverbs_pd_idr, uobj);
  231. ib_dealloc_pd(pd);
  232. kfree(uobj);
  233. }
  234. return context->device->dealloc_ucontext(context);
  235. }
  236. static void ib_uverbs_comp_dev(struct ib_uverbs_device *dev)
  237. {
  238. complete(&dev->comp);
  239. }
  240. static void ib_uverbs_release_file(struct kref *ref)
  241. {
  242. struct ib_uverbs_file *file =
  243. container_of(ref, struct ib_uverbs_file, ref);
  244. module_put(file->device->ib_dev->owner);
  245. if (atomic_dec_and_test(&file->device->refcount))
  246. ib_uverbs_comp_dev(file->device);
  247. kfree(file);
  248. }
  249. static ssize_t ib_uverbs_event_read(struct file *filp, char __user *buf,
  250. size_t count, loff_t *pos)
  251. {
  252. struct ib_uverbs_event_file *file = filp->private_data;
  253. struct ib_uverbs_event *event;
  254. int eventsz;
  255. int ret = 0;
  256. spin_lock_irq(&file->lock);
  257. while (list_empty(&file->event_list)) {
  258. spin_unlock_irq(&file->lock);
  259. if (filp->f_flags & O_NONBLOCK)
  260. return -EAGAIN;
  261. if (wait_event_interruptible(file->poll_wait,
  262. !list_empty(&file->event_list)))
  263. return -ERESTARTSYS;
  264. spin_lock_irq(&file->lock);
  265. }
  266. event = list_entry(file->event_list.next, struct ib_uverbs_event, list);
  267. if (file->is_async)
  268. eventsz = sizeof (struct ib_uverbs_async_event_desc);
  269. else
  270. eventsz = sizeof (struct ib_uverbs_comp_event_desc);
  271. if (eventsz > count) {
  272. ret = -EINVAL;
  273. event = NULL;
  274. } else {
  275. list_del(file->event_list.next);
  276. if (event->counter) {
  277. ++(*event->counter);
  278. list_del(&event->obj_list);
  279. }
  280. }
  281. spin_unlock_irq(&file->lock);
  282. if (event) {
  283. if (copy_to_user(buf, event, eventsz))
  284. ret = -EFAULT;
  285. else
  286. ret = eventsz;
  287. }
  288. kfree(event);
  289. return ret;
  290. }
  291. static unsigned int ib_uverbs_event_poll(struct file *filp,
  292. struct poll_table_struct *wait)
  293. {
  294. unsigned int pollflags = 0;
  295. struct ib_uverbs_event_file *file = filp->private_data;
  296. poll_wait(filp, &file->poll_wait, wait);
  297. spin_lock_irq(&file->lock);
  298. if (!list_empty(&file->event_list))
  299. pollflags = POLLIN | POLLRDNORM;
  300. spin_unlock_irq(&file->lock);
  301. return pollflags;
  302. }
  303. static int ib_uverbs_event_fasync(int fd, struct file *filp, int on)
  304. {
  305. struct ib_uverbs_event_file *file = filp->private_data;
  306. return fasync_helper(fd, filp, on, &file->async_queue);
  307. }
  308. static int ib_uverbs_event_close(struct inode *inode, struct file *filp)
  309. {
  310. struct ib_uverbs_event_file *file = filp->private_data;
  311. struct ib_uverbs_event *entry, *tmp;
  312. spin_lock_irq(&file->lock);
  313. file->is_closed = 1;
  314. list_for_each_entry_safe(entry, tmp, &file->event_list, list) {
  315. if (entry->counter)
  316. list_del(&entry->obj_list);
  317. kfree(entry);
  318. }
  319. spin_unlock_irq(&file->lock);
  320. if (file->is_async) {
  321. ib_unregister_event_handler(&file->uverbs_file->event_handler);
  322. kref_put(&file->uverbs_file->ref, ib_uverbs_release_file);
  323. }
  324. kref_put(&file->ref, ib_uverbs_release_event_file);
  325. return 0;
  326. }
  327. static const struct file_operations uverbs_event_fops = {
  328. .owner = THIS_MODULE,
  329. .read = ib_uverbs_event_read,
  330. .poll = ib_uverbs_event_poll,
  331. .release = ib_uverbs_event_close,
  332. .fasync = ib_uverbs_event_fasync,
  333. .llseek = no_llseek,
  334. };
  335. void ib_uverbs_comp_handler(struct ib_cq *cq, void *cq_context)
  336. {
  337. struct ib_uverbs_event_file *file = cq_context;
  338. struct ib_ucq_object *uobj;
  339. struct ib_uverbs_event *entry;
  340. unsigned long flags;
  341. if (!file)
  342. return;
  343. spin_lock_irqsave(&file->lock, flags);
  344. if (file->is_closed) {
  345. spin_unlock_irqrestore(&file->lock, flags);
  346. return;
  347. }
  348. entry = kmalloc(sizeof *entry, GFP_ATOMIC);
  349. if (!entry) {
  350. spin_unlock_irqrestore(&file->lock, flags);
  351. return;
  352. }
  353. uobj = container_of(cq->uobject, struct ib_ucq_object, uobject);
  354. entry->desc.comp.cq_handle = cq->uobject->user_handle;
  355. entry->counter = &uobj->comp_events_reported;
  356. list_add_tail(&entry->list, &file->event_list);
  357. list_add_tail(&entry->obj_list, &uobj->comp_list);
  358. spin_unlock_irqrestore(&file->lock, flags);
  359. wake_up_interruptible(&file->poll_wait);
  360. kill_fasync(&file->async_queue, SIGIO, POLL_IN);
  361. }
  362. static void ib_uverbs_async_handler(struct ib_uverbs_file *file,
  363. __u64 element, __u64 event,
  364. struct list_head *obj_list,
  365. u32 *counter)
  366. {
  367. struct ib_uverbs_event *entry;
  368. unsigned long flags;
  369. spin_lock_irqsave(&file->async_file->lock, flags);
  370. if (file->async_file->is_closed) {
  371. spin_unlock_irqrestore(&file->async_file->lock, flags);
  372. return;
  373. }
  374. entry = kmalloc(sizeof *entry, GFP_ATOMIC);
  375. if (!entry) {
  376. spin_unlock_irqrestore(&file->async_file->lock, flags);
  377. return;
  378. }
  379. entry->desc.async.element = element;
  380. entry->desc.async.event_type = event;
  381. entry->desc.async.reserved = 0;
  382. entry->counter = counter;
  383. list_add_tail(&entry->list, &file->async_file->event_list);
  384. if (obj_list)
  385. list_add_tail(&entry->obj_list, obj_list);
  386. spin_unlock_irqrestore(&file->async_file->lock, flags);
  387. wake_up_interruptible(&file->async_file->poll_wait);
  388. kill_fasync(&file->async_file->async_queue, SIGIO, POLL_IN);
  389. }
  390. void ib_uverbs_cq_event_handler(struct ib_event *event, void *context_ptr)
  391. {
  392. struct ib_ucq_object *uobj = container_of(event->element.cq->uobject,
  393. struct ib_ucq_object, uobject);
  394. ib_uverbs_async_handler(uobj->uverbs_file, uobj->uobject.user_handle,
  395. event->event, &uobj->async_list,
  396. &uobj->async_events_reported);
  397. }
  398. void ib_uverbs_qp_event_handler(struct ib_event *event, void *context_ptr)
  399. {
  400. struct ib_uevent_object *uobj;
  401. uobj = container_of(event->element.qp->uobject,
  402. struct ib_uevent_object, uobject);
  403. ib_uverbs_async_handler(context_ptr, uobj->uobject.user_handle,
  404. event->event, &uobj->event_list,
  405. &uobj->events_reported);
  406. }
  407. void ib_uverbs_srq_event_handler(struct ib_event *event, void *context_ptr)
  408. {
  409. struct ib_uevent_object *uobj;
  410. uobj = container_of(event->element.srq->uobject,
  411. struct ib_uevent_object, uobject);
  412. ib_uverbs_async_handler(context_ptr, uobj->uobject.user_handle,
  413. event->event, &uobj->event_list,
  414. &uobj->events_reported);
  415. }
  416. void ib_uverbs_event_handler(struct ib_event_handler *handler,
  417. struct ib_event *event)
  418. {
  419. struct ib_uverbs_file *file =
  420. container_of(handler, struct ib_uverbs_file, event_handler);
  421. ib_uverbs_async_handler(file, event->element.port_num, event->event,
  422. NULL, NULL);
  423. }
  424. struct file *ib_uverbs_alloc_event_file(struct ib_uverbs_file *uverbs_file,
  425. int is_async)
  426. {
  427. struct ib_uverbs_event_file *ev_file;
  428. struct file *filp;
  429. ev_file = kmalloc(sizeof *ev_file, GFP_KERNEL);
  430. if (!ev_file)
  431. return ERR_PTR(-ENOMEM);
  432. kref_init(&ev_file->ref);
  433. spin_lock_init(&ev_file->lock);
  434. INIT_LIST_HEAD(&ev_file->event_list);
  435. init_waitqueue_head(&ev_file->poll_wait);
  436. ev_file->uverbs_file = uverbs_file;
  437. ev_file->async_queue = NULL;
  438. ev_file->is_async = is_async;
  439. ev_file->is_closed = 0;
  440. filp = anon_inode_getfile("[infinibandevent]", &uverbs_event_fops,
  441. ev_file, O_RDONLY);
  442. if (IS_ERR(filp))
  443. kfree(ev_file);
  444. return filp;
  445. }
  446. /*
  447. * Look up a completion event file by FD. If lookup is successful,
  448. * takes a ref to the event file struct that it returns; if
  449. * unsuccessful, returns NULL.
  450. */
  451. struct ib_uverbs_event_file *ib_uverbs_lookup_comp_file(int fd)
  452. {
  453. struct ib_uverbs_event_file *ev_file = NULL;
  454. struct file *filp;
  455. filp = fget(fd);
  456. if (!filp)
  457. return NULL;
  458. if (filp->f_op != &uverbs_event_fops)
  459. goto out;
  460. ev_file = filp->private_data;
  461. if (ev_file->is_async) {
  462. ev_file = NULL;
  463. goto out;
  464. }
  465. kref_get(&ev_file->ref);
  466. out:
  467. fput(filp);
  468. return ev_file;
  469. }
  470. static ssize_t ib_uverbs_write(struct file *filp, const char __user *buf,
  471. size_t count, loff_t *pos)
  472. {
  473. struct ib_uverbs_file *file = filp->private_data;
  474. struct ib_uverbs_cmd_hdr hdr;
  475. if (count < sizeof hdr)
  476. return -EINVAL;
  477. if (copy_from_user(&hdr, buf, sizeof hdr))
  478. return -EFAULT;
  479. if (hdr.in_words * 4 != count)
  480. return -EINVAL;
  481. if (hdr.command >= ARRAY_SIZE(uverbs_cmd_table) ||
  482. !uverbs_cmd_table[hdr.command])
  483. return -EINVAL;
  484. if (!file->ucontext &&
  485. hdr.command != IB_USER_VERBS_CMD_GET_CONTEXT)
  486. return -EINVAL;
  487. if (!(file->device->ib_dev->uverbs_cmd_mask & (1ull << hdr.command)))
  488. return -ENOSYS;
  489. return uverbs_cmd_table[hdr.command](file, buf + sizeof hdr,
  490. hdr.in_words * 4, hdr.out_words * 4);
  491. }
  492. static int ib_uverbs_mmap(struct file *filp, struct vm_area_struct *vma)
  493. {
  494. struct ib_uverbs_file *file = filp->private_data;
  495. if (!file->ucontext)
  496. return -ENODEV;
  497. else
  498. return file->device->ib_dev->mmap(file->ucontext, vma);
  499. }
  500. /*
  501. * ib_uverbs_open() does not need the BKL:
  502. *
  503. * - the ib_uverbs_device structures are properly reference counted and
  504. * everything else is purely local to the file being created, so
  505. * races against other open calls are not a problem;
  506. * - there is no ioctl method to race against;
  507. * - the open method will either immediately run -ENXIO, or all
  508. * required initialization will be done.
  509. */
  510. static int ib_uverbs_open(struct inode *inode, struct file *filp)
  511. {
  512. struct ib_uverbs_device *dev;
  513. struct ib_uverbs_file *file;
  514. int ret;
  515. dev = container_of(inode->i_cdev, struct ib_uverbs_device, cdev);
  516. if (!atomic_inc_not_zero(&dev->refcount))
  517. return -ENXIO;
  518. if (!try_module_get(dev->ib_dev->owner)) {
  519. ret = -ENODEV;
  520. goto err;
  521. }
  522. file = kmalloc(sizeof *file, GFP_KERNEL);
  523. if (!file) {
  524. ret = -ENOMEM;
  525. goto err_module;
  526. }
  527. file->device = dev;
  528. file->ucontext = NULL;
  529. file->async_file = NULL;
  530. kref_init(&file->ref);
  531. mutex_init(&file->mutex);
  532. filp->private_data = file;
  533. kobject_get(&dev->kobj);
  534. return nonseekable_open(inode, filp);
  535. err_module:
  536. module_put(dev->ib_dev->owner);
  537. err:
  538. if (atomic_dec_and_test(&dev->refcount))
  539. ib_uverbs_comp_dev(dev);
  540. return ret;
  541. }
  542. static int ib_uverbs_close(struct inode *inode, struct file *filp)
  543. {
  544. struct ib_uverbs_file *file = filp->private_data;
  545. struct ib_uverbs_device *dev = file->device;
  546. ib_uverbs_cleanup_ucontext(file, file->ucontext);
  547. if (file->async_file)
  548. kref_put(&file->async_file->ref, ib_uverbs_release_event_file);
  549. kref_put(&file->ref, ib_uverbs_release_file);
  550. kobject_put(&dev->kobj);
  551. return 0;
  552. }
  553. static const struct file_operations uverbs_fops = {
  554. .owner = THIS_MODULE,
  555. .write = ib_uverbs_write,
  556. .open = ib_uverbs_open,
  557. .release = ib_uverbs_close,
  558. .llseek = no_llseek,
  559. };
  560. static const struct file_operations uverbs_mmap_fops = {
  561. .owner = THIS_MODULE,
  562. .write = ib_uverbs_write,
  563. .mmap = ib_uverbs_mmap,
  564. .open = ib_uverbs_open,
  565. .release = ib_uverbs_close,
  566. .llseek = no_llseek,
  567. };
  568. static struct ib_client uverbs_client = {
  569. .name = "uverbs",
  570. .add = ib_uverbs_add_one,
  571. .remove = ib_uverbs_remove_one
  572. };
  573. static ssize_t show_ibdev(struct device *device, struct device_attribute *attr,
  574. char *buf)
  575. {
  576. struct ib_uverbs_device *dev = dev_get_drvdata(device);
  577. if (!dev)
  578. return -ENODEV;
  579. return sprintf(buf, "%s\n", dev->ib_dev->name);
  580. }
  581. static DEVICE_ATTR(ibdev, S_IRUGO, show_ibdev, NULL);
  582. static ssize_t show_dev_abi_version(struct device *device,
  583. struct device_attribute *attr, char *buf)
  584. {
  585. struct ib_uverbs_device *dev = dev_get_drvdata(device);
  586. if (!dev)
  587. return -ENODEV;
  588. return sprintf(buf, "%d\n", dev->ib_dev->uverbs_abi_ver);
  589. }
  590. static DEVICE_ATTR(abi_version, S_IRUGO, show_dev_abi_version, NULL);
  591. static CLASS_ATTR_STRING(abi_version, S_IRUGO,
  592. __stringify(IB_USER_VERBS_ABI_VERSION));
  593. static dev_t overflow_maj;
  594. static DECLARE_BITMAP(overflow_map, IB_UVERBS_MAX_DEVICES);
  595. /*
  596. * If we have more than IB_UVERBS_MAX_DEVICES, dynamically overflow by
  597. * requesting a new major number and doubling the number of max devices we
  598. * support. It's stupid, but simple.
  599. */
  600. static int find_overflow_devnum(void)
  601. {
  602. int ret;
  603. if (!overflow_maj) {
  604. ret = alloc_chrdev_region(&overflow_maj, 0, IB_UVERBS_MAX_DEVICES,
  605. "infiniband_verbs");
  606. if (ret) {
  607. printk(KERN_ERR "user_verbs: couldn't register dynamic device number\n");
  608. return ret;
  609. }
  610. }
  611. ret = find_first_zero_bit(overflow_map, IB_UVERBS_MAX_DEVICES);
  612. if (ret >= IB_UVERBS_MAX_DEVICES)
  613. return -1;
  614. return ret;
  615. }
  616. static void ib_uverbs_add_one(struct ib_device *device)
  617. {
  618. int devnum;
  619. dev_t base;
  620. struct ib_uverbs_device *uverbs_dev;
  621. if (!device->alloc_ucontext)
  622. return;
  623. uverbs_dev = kzalloc(sizeof *uverbs_dev, GFP_KERNEL);
  624. if (!uverbs_dev)
  625. return;
  626. atomic_set(&uverbs_dev->refcount, 1);
  627. init_completion(&uverbs_dev->comp);
  628. uverbs_dev->xrcd_tree = RB_ROOT;
  629. mutex_init(&uverbs_dev->xrcd_tree_mutex);
  630. kobject_init(&uverbs_dev->kobj, &ib_uverbs_dev_ktype);
  631. spin_lock(&map_lock);
  632. devnum = find_first_zero_bit(dev_map, IB_UVERBS_MAX_DEVICES);
  633. if (devnum >= IB_UVERBS_MAX_DEVICES) {
  634. spin_unlock(&map_lock);
  635. devnum = find_overflow_devnum();
  636. if (devnum < 0)
  637. goto err;
  638. spin_lock(&map_lock);
  639. uverbs_dev->devnum = devnum + IB_UVERBS_MAX_DEVICES;
  640. base = devnum + overflow_maj;
  641. set_bit(devnum, overflow_map);
  642. } else {
  643. uverbs_dev->devnum = devnum;
  644. base = devnum + IB_UVERBS_BASE_DEV;
  645. set_bit(devnum, dev_map);
  646. }
  647. spin_unlock(&map_lock);
  648. uverbs_dev->ib_dev = device;
  649. uverbs_dev->num_comp_vectors = device->num_comp_vectors;
  650. cdev_init(&uverbs_dev->cdev, NULL);
  651. uverbs_dev->cdev.owner = THIS_MODULE;
  652. uverbs_dev->cdev.ops = device->mmap ? &uverbs_mmap_fops : &uverbs_fops;
  653. uverbs_dev->cdev.kobj.parent = &uverbs_dev->kobj;
  654. kobject_set_name(&uverbs_dev->cdev.kobj, "uverbs%d", uverbs_dev->devnum);
  655. if (cdev_add(&uverbs_dev->cdev, base, 1))
  656. goto err_cdev;
  657. uverbs_dev->dev = device_create(uverbs_class, device->dma_device,
  658. uverbs_dev->cdev.dev, uverbs_dev,
  659. "uverbs%d", uverbs_dev->devnum);
  660. if (IS_ERR(uverbs_dev->dev))
  661. goto err_cdev;
  662. if (device_create_file(uverbs_dev->dev, &dev_attr_ibdev))
  663. goto err_class;
  664. if (device_create_file(uverbs_dev->dev, &dev_attr_abi_version))
  665. goto err_class;
  666. ib_set_client_data(device, &uverbs_client, uverbs_dev);
  667. return;
  668. err_class:
  669. device_destroy(uverbs_class, uverbs_dev->cdev.dev);
  670. err_cdev:
  671. cdev_del(&uverbs_dev->cdev);
  672. if (uverbs_dev->devnum < IB_UVERBS_MAX_DEVICES)
  673. clear_bit(devnum, dev_map);
  674. else
  675. clear_bit(devnum, overflow_map);
  676. err:
  677. if (atomic_dec_and_test(&uverbs_dev->refcount))
  678. ib_uverbs_comp_dev(uverbs_dev);
  679. wait_for_completion(&uverbs_dev->comp);
  680. kobject_put(&uverbs_dev->kobj);
  681. return;
  682. }
  683. static void ib_uverbs_remove_one(struct ib_device *device)
  684. {
  685. struct ib_uverbs_device *uverbs_dev = ib_get_client_data(device, &uverbs_client);
  686. if (!uverbs_dev)
  687. return;
  688. dev_set_drvdata(uverbs_dev->dev, NULL);
  689. device_destroy(uverbs_class, uverbs_dev->cdev.dev);
  690. cdev_del(&uverbs_dev->cdev);
  691. if (uverbs_dev->devnum < IB_UVERBS_MAX_DEVICES)
  692. clear_bit(uverbs_dev->devnum, dev_map);
  693. else
  694. clear_bit(uverbs_dev->devnum - IB_UVERBS_MAX_DEVICES, overflow_map);
  695. if (atomic_dec_and_test(&uverbs_dev->refcount))
  696. ib_uverbs_comp_dev(uverbs_dev);
  697. wait_for_completion(&uverbs_dev->comp);
  698. kobject_put(&uverbs_dev->kobj);
  699. }
  700. static char *uverbs_devnode(struct device *dev, umode_t *mode)
  701. {
  702. if (mode)
  703. *mode = 0666;
  704. return kasprintf(GFP_KERNEL, "infiniband/%s", dev_name(dev));
  705. }
  706. static int __init ib_uverbs_init(void)
  707. {
  708. int ret;
  709. ret = register_chrdev_region(IB_UVERBS_BASE_DEV, IB_UVERBS_MAX_DEVICES,
  710. "infiniband_verbs");
  711. if (ret) {
  712. printk(KERN_ERR "user_verbs: couldn't register device number\n");
  713. goto out;
  714. }
  715. uverbs_class = class_create(THIS_MODULE, "infiniband_verbs");
  716. if (IS_ERR(uverbs_class)) {
  717. ret = PTR_ERR(uverbs_class);
  718. printk(KERN_ERR "user_verbs: couldn't create class infiniband_verbs\n");
  719. goto out_chrdev;
  720. }
  721. uverbs_class->devnode = uverbs_devnode;
  722. ret = class_create_file(uverbs_class, &class_attr_abi_version.attr);
  723. if (ret) {
  724. printk(KERN_ERR "user_verbs: couldn't create abi_version attribute\n");
  725. goto out_class;
  726. }
  727. ret = ib_register_client(&uverbs_client);
  728. if (ret) {
  729. printk(KERN_ERR "user_verbs: couldn't register client\n");
  730. goto out_class;
  731. }
  732. return 0;
  733. out_class:
  734. class_destroy(uverbs_class);
  735. out_chrdev:
  736. unregister_chrdev_region(IB_UVERBS_BASE_DEV, IB_UVERBS_MAX_DEVICES);
  737. out:
  738. return ret;
  739. }
  740. static void __exit ib_uverbs_cleanup(void)
  741. {
  742. ib_unregister_client(&uverbs_client);
  743. class_destroy(uverbs_class);
  744. unregister_chrdev_region(IB_UVERBS_BASE_DEV, IB_UVERBS_MAX_DEVICES);
  745. if (overflow_maj)
  746. unregister_chrdev_region(overflow_maj, IB_UVERBS_MAX_DEVICES);
  747. idr_destroy(&ib_uverbs_pd_idr);
  748. idr_destroy(&ib_uverbs_mr_idr);
  749. idr_destroy(&ib_uverbs_mw_idr);
  750. idr_destroy(&ib_uverbs_ah_idr);
  751. idr_destroy(&ib_uverbs_cq_idr);
  752. idr_destroy(&ib_uverbs_qp_idr);
  753. idr_destroy(&ib_uverbs_srq_idr);
  754. }
  755. module_init(ib_uverbs_init);
  756. module_exit(ib_uverbs_cleanup);