cm.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604
  1. /*
  2. * Copyright (c) 2012 Mellanox Technologies. All rights reserved.
  3. *
  4. * This software is available to you under a choice of one of two
  5. * licenses. You may choose to be licensed under the terms of the GNU
  6. * General Public License (GPL) Version 2, available from the file
  7. * COPYING in the main directory of this source tree, or the
  8. * OpenIB.org BSD license below:
  9. *
  10. * Redistribution and use in source and binary forms, with or
  11. * without modification, are permitted provided that the following
  12. * conditions are met:
  13. *
  14. * - Redistributions of source code must retain the above
  15. * copyright notice, this list of conditions and the following
  16. * disclaimer.
  17. *
  18. * - Redistributions in binary form must reproduce the above
  19. * copyright notice, this list of conditions and the following
  20. * disclaimer in the documentation and/or other materials
  21. * provided with the distribution.
  22. *
  23. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
  24. * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
  25. * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
  26. * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
  27. * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
  28. * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  29. * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
  30. * SOFTWARE.
  31. */
  32. #include <rdma/ib_mad.h>
  33. #include <linux/mlx4/cmd.h>
  34. #include <linux/rbtree.h>
  35. #include <linux/idr.h>
  36. #include <rdma/ib_cm.h>
  37. #include "mlx4_ib.h"
  38. #define CM_CLEANUP_CACHE_TIMEOUT (30 * HZ)
  39. struct id_map_entry {
  40. struct rb_node node;
  41. u32 sl_cm_id;
  42. u32 pv_cm_id;
  43. int slave_id;
  44. int scheduled_delete;
  45. struct mlx4_ib_dev *dev;
  46. struct list_head list;
  47. struct delayed_work timeout;
  48. };
  49. struct rej_tmout_entry {
  50. int slave;
  51. u32 rem_pv_cm_id;
  52. struct delayed_work timeout;
  53. struct xarray *xa_rej_tmout;
  54. };
  55. struct cm_generic_msg {
  56. struct ib_mad_hdr hdr;
  57. __be32 local_comm_id;
  58. __be32 remote_comm_id;
  59. unsigned char unused[2];
  60. __be16 rej_reason;
  61. };
  62. struct cm_sidr_generic_msg {
  63. struct ib_mad_hdr hdr;
  64. __be32 request_id;
  65. };
  66. struct cm_req_msg {
  67. unsigned char unused[0x60];
  68. union ib_gid primary_path_sgid;
  69. };
  70. static struct workqueue_struct *cm_wq;
  71. static void set_local_comm_id(struct ib_mad *mad, u32 cm_id)
  72. {
  73. if (mad->mad_hdr.attr_id == CM_SIDR_REQ_ATTR_ID) {
  74. struct cm_sidr_generic_msg *msg =
  75. (struct cm_sidr_generic_msg *)mad;
  76. msg->request_id = cpu_to_be32(cm_id);
  77. } else if (mad->mad_hdr.attr_id == CM_SIDR_REP_ATTR_ID) {
  78. pr_err("trying to set local_comm_id in SIDR_REP\n");
  79. return;
  80. } else {
  81. struct cm_generic_msg *msg = (struct cm_generic_msg *)mad;
  82. msg->local_comm_id = cpu_to_be32(cm_id);
  83. }
  84. }
  85. static u32 get_local_comm_id(struct ib_mad *mad)
  86. {
  87. if (mad->mad_hdr.attr_id == CM_SIDR_REQ_ATTR_ID) {
  88. struct cm_sidr_generic_msg *msg =
  89. (struct cm_sidr_generic_msg *)mad;
  90. return be32_to_cpu(msg->request_id);
  91. } else if (mad->mad_hdr.attr_id == CM_SIDR_REP_ATTR_ID) {
  92. pr_err("trying to set local_comm_id in SIDR_REP\n");
  93. return -1;
  94. } else {
  95. struct cm_generic_msg *msg = (struct cm_generic_msg *)mad;
  96. return be32_to_cpu(msg->local_comm_id);
  97. }
  98. }
  99. static void set_remote_comm_id(struct ib_mad *mad, u32 cm_id)
  100. {
  101. if (mad->mad_hdr.attr_id == CM_SIDR_REP_ATTR_ID) {
  102. struct cm_sidr_generic_msg *msg =
  103. (struct cm_sidr_generic_msg *)mad;
  104. msg->request_id = cpu_to_be32(cm_id);
  105. } else if (mad->mad_hdr.attr_id == CM_SIDR_REQ_ATTR_ID) {
  106. pr_err("trying to set remote_comm_id in SIDR_REQ\n");
  107. return;
  108. } else {
  109. struct cm_generic_msg *msg = (struct cm_generic_msg *)mad;
  110. msg->remote_comm_id = cpu_to_be32(cm_id);
  111. }
  112. }
  113. static u32 get_remote_comm_id(struct ib_mad *mad)
  114. {
  115. if (mad->mad_hdr.attr_id == CM_SIDR_REP_ATTR_ID) {
  116. struct cm_sidr_generic_msg *msg =
  117. (struct cm_sidr_generic_msg *)mad;
  118. return be32_to_cpu(msg->request_id);
  119. } else if (mad->mad_hdr.attr_id == CM_SIDR_REQ_ATTR_ID) {
  120. pr_err("trying to set remote_comm_id in SIDR_REQ\n");
  121. return -1;
  122. } else {
  123. struct cm_generic_msg *msg = (struct cm_generic_msg *)mad;
  124. return be32_to_cpu(msg->remote_comm_id);
  125. }
  126. }
  127. static union ib_gid gid_from_req_msg(struct ib_device *ibdev, struct ib_mad *mad)
  128. {
  129. struct cm_req_msg *msg = (struct cm_req_msg *)mad;
  130. return msg->primary_path_sgid;
  131. }
  132. /* Lock should be taken before called */
  133. static struct id_map_entry *
  134. id_map_find_by_sl_id(struct ib_device *ibdev, u32 slave_id, u32 sl_cm_id)
  135. {
  136. struct rb_root *sl_id_map = &to_mdev(ibdev)->sriov.sl_id_map;
  137. struct rb_node *node = sl_id_map->rb_node;
  138. while (node) {
  139. struct id_map_entry *id_map_entry =
  140. rb_entry(node, struct id_map_entry, node);
  141. if (id_map_entry->sl_cm_id > sl_cm_id)
  142. node = node->rb_left;
  143. else if (id_map_entry->sl_cm_id < sl_cm_id)
  144. node = node->rb_right;
  145. else if (id_map_entry->slave_id > slave_id)
  146. node = node->rb_left;
  147. else if (id_map_entry->slave_id < slave_id)
  148. node = node->rb_right;
  149. else
  150. return id_map_entry;
  151. }
  152. return NULL;
  153. }
  154. static void id_map_ent_timeout(struct work_struct *work)
  155. {
  156. struct delayed_work *delay = to_delayed_work(work);
  157. struct id_map_entry *ent = container_of(delay, struct id_map_entry, timeout);
  158. struct id_map_entry *found_ent;
  159. struct mlx4_ib_dev *dev = ent->dev;
  160. struct mlx4_ib_sriov *sriov = &dev->sriov;
  161. struct rb_root *sl_id_map = &sriov->sl_id_map;
  162. spin_lock(&sriov->id_map_lock);
  163. if (!xa_erase(&sriov->pv_id_table, ent->pv_cm_id))
  164. goto out;
  165. found_ent = id_map_find_by_sl_id(&dev->ib_dev, ent->slave_id, ent->sl_cm_id);
  166. if (found_ent && found_ent == ent)
  167. rb_erase(&found_ent->node, sl_id_map);
  168. out:
  169. list_del(&ent->list);
  170. spin_unlock(&sriov->id_map_lock);
  171. kfree(ent);
  172. }
  173. static void sl_id_map_add(struct ib_device *ibdev, struct id_map_entry *new)
  174. {
  175. struct rb_root *sl_id_map = &to_mdev(ibdev)->sriov.sl_id_map;
  176. struct rb_node **link = &sl_id_map->rb_node, *parent = NULL;
  177. struct id_map_entry *ent;
  178. int slave_id = new->slave_id;
  179. int sl_cm_id = new->sl_cm_id;
  180. ent = id_map_find_by_sl_id(ibdev, slave_id, sl_cm_id);
  181. if (ent) {
  182. pr_debug("overriding existing sl_id_map entry (cm_id = %x)\n",
  183. sl_cm_id);
  184. rb_replace_node(&ent->node, &new->node, sl_id_map);
  185. return;
  186. }
  187. /* Go to the bottom of the tree */
  188. while (*link) {
  189. parent = *link;
  190. ent = rb_entry(parent, struct id_map_entry, node);
  191. if (ent->sl_cm_id > sl_cm_id || (ent->sl_cm_id == sl_cm_id && ent->slave_id > slave_id))
  192. link = &(*link)->rb_left;
  193. else
  194. link = &(*link)->rb_right;
  195. }
  196. rb_link_node(&new->node, parent, link);
  197. rb_insert_color(&new->node, sl_id_map);
  198. }
  199. static struct id_map_entry *
  200. id_map_alloc(struct ib_device *ibdev, int slave_id, u32 sl_cm_id)
  201. {
  202. int ret;
  203. struct id_map_entry *ent;
  204. struct mlx4_ib_sriov *sriov = &to_mdev(ibdev)->sriov;
  205. ent = kmalloc(sizeof (struct id_map_entry), GFP_KERNEL);
  206. if (!ent)
  207. return ERR_PTR(-ENOMEM);
  208. ent->sl_cm_id = sl_cm_id;
  209. ent->slave_id = slave_id;
  210. ent->scheduled_delete = 0;
  211. ent->dev = to_mdev(ibdev);
  212. INIT_DELAYED_WORK(&ent->timeout, id_map_ent_timeout);
  213. ret = xa_alloc_cyclic(&sriov->pv_id_table, &ent->pv_cm_id, ent,
  214. xa_limit_32b, &sriov->pv_id_next, GFP_KERNEL);
  215. if (ret >= 0) {
  216. spin_lock(&sriov->id_map_lock);
  217. sl_id_map_add(ibdev, ent);
  218. list_add_tail(&ent->list, &sriov->cm_list);
  219. spin_unlock(&sriov->id_map_lock);
  220. return ent;
  221. }
  222. /*error flow*/
  223. kfree(ent);
  224. mlx4_ib_warn(ibdev, "Allocation failed (err:0x%x)\n", ret);
  225. return ERR_PTR(-ENOMEM);
  226. }
  227. static struct id_map_entry *
  228. id_map_get(struct ib_device *ibdev, int *pv_cm_id, int slave_id, int sl_cm_id)
  229. {
  230. struct id_map_entry *ent;
  231. struct mlx4_ib_sriov *sriov = &to_mdev(ibdev)->sriov;
  232. spin_lock(&sriov->id_map_lock);
  233. if (*pv_cm_id == -1) {
  234. ent = id_map_find_by_sl_id(ibdev, slave_id, sl_cm_id);
  235. if (ent)
  236. *pv_cm_id = (int) ent->pv_cm_id;
  237. } else
  238. ent = xa_load(&sriov->pv_id_table, *pv_cm_id);
  239. spin_unlock(&sriov->id_map_lock);
  240. return ent;
  241. }
  242. static void schedule_delayed(struct ib_device *ibdev, struct id_map_entry *id)
  243. {
  244. struct mlx4_ib_sriov *sriov = &to_mdev(ibdev)->sriov;
  245. unsigned long flags;
  246. spin_lock(&sriov->id_map_lock);
  247. spin_lock_irqsave(&sriov->going_down_lock, flags);
  248. /*make sure that there is no schedule inside the scheduled work.*/
  249. if (!sriov->is_going_down && !id->scheduled_delete) {
  250. id->scheduled_delete = 1;
  251. queue_delayed_work(cm_wq, &id->timeout, CM_CLEANUP_CACHE_TIMEOUT);
  252. } else if (id->scheduled_delete) {
  253. /* Adjust timeout if already scheduled */
  254. mod_delayed_work(cm_wq, &id->timeout, CM_CLEANUP_CACHE_TIMEOUT);
  255. }
  256. spin_unlock_irqrestore(&sriov->going_down_lock, flags);
  257. spin_unlock(&sriov->id_map_lock);
  258. }
  259. #define REJ_REASON(m) be16_to_cpu(((struct cm_generic_msg *)(m))->rej_reason)
  260. int mlx4_ib_multiplex_cm_handler(struct ib_device *ibdev, int port, int slave_id,
  261. struct ib_mad *mad)
  262. {
  263. struct id_map_entry *id;
  264. u32 sl_cm_id;
  265. int pv_cm_id = -1;
  266. if (mad->mad_hdr.attr_id == CM_REQ_ATTR_ID ||
  267. mad->mad_hdr.attr_id == CM_REP_ATTR_ID ||
  268. mad->mad_hdr.attr_id == CM_MRA_ATTR_ID ||
  269. mad->mad_hdr.attr_id == CM_SIDR_REQ_ATTR_ID ||
  270. (mad->mad_hdr.attr_id == CM_REJ_ATTR_ID && REJ_REASON(mad) == IB_CM_REJ_TIMEOUT)) {
  271. sl_cm_id = get_local_comm_id(mad);
  272. id = id_map_get(ibdev, &pv_cm_id, slave_id, sl_cm_id);
  273. if (id)
  274. goto cont;
  275. id = id_map_alloc(ibdev, slave_id, sl_cm_id);
  276. if (IS_ERR(id)) {
  277. mlx4_ib_warn(ibdev, "%s: id{slave: %d, sl_cm_id: 0x%x} Failed to id_map_alloc\n",
  278. __func__, slave_id, sl_cm_id);
  279. return PTR_ERR(id);
  280. }
  281. } else if (mad->mad_hdr.attr_id == CM_REJ_ATTR_ID ||
  282. mad->mad_hdr.attr_id == CM_SIDR_REP_ATTR_ID) {
  283. return 0;
  284. } else {
  285. sl_cm_id = get_local_comm_id(mad);
  286. id = id_map_get(ibdev, &pv_cm_id, slave_id, sl_cm_id);
  287. }
  288. if (!id) {
  289. pr_debug("id{slave: %d, sl_cm_id: 0x%x} is NULL! attr_id: 0x%x\n",
  290. slave_id, sl_cm_id, be16_to_cpu(mad->mad_hdr.attr_id));
  291. return -EINVAL;
  292. }
  293. cont:
  294. set_local_comm_id(mad, id->pv_cm_id);
  295. if (mad->mad_hdr.attr_id == CM_DREQ_ATTR_ID)
  296. schedule_delayed(ibdev, id);
  297. return 0;
  298. }
  299. static void rej_tmout_timeout(struct work_struct *work)
  300. {
  301. struct delayed_work *delay = to_delayed_work(work);
  302. struct rej_tmout_entry *item = container_of(delay, struct rej_tmout_entry, timeout);
  303. struct rej_tmout_entry *deleted;
  304. deleted = xa_cmpxchg(item->xa_rej_tmout, item->rem_pv_cm_id, item, NULL, 0);
  305. if (deleted != item)
  306. pr_debug("deleted(%p) != item(%p)\n", deleted, item);
  307. kfree(item);
  308. }
  309. static int alloc_rej_tmout(struct mlx4_ib_sriov *sriov, u32 rem_pv_cm_id, int slave)
  310. {
  311. struct rej_tmout_entry *item;
  312. struct rej_tmout_entry *old;
  313. int ret = 0;
  314. xa_lock(&sriov->xa_rej_tmout);
  315. item = xa_load(&sriov->xa_rej_tmout, (unsigned long)rem_pv_cm_id);
  316. if (item) {
  317. if (xa_err(item))
  318. ret = xa_err(item);
  319. else
  320. /* If a retry, adjust delayed work */
  321. mod_delayed_work(cm_wq, &item->timeout, CM_CLEANUP_CACHE_TIMEOUT);
  322. goto err_or_exists;
  323. }
  324. xa_unlock(&sriov->xa_rej_tmout);
  325. item = kmalloc(sizeof(*item), GFP_KERNEL);
  326. if (!item)
  327. return -ENOMEM;
  328. INIT_DELAYED_WORK(&item->timeout, rej_tmout_timeout);
  329. item->slave = slave;
  330. item->rem_pv_cm_id = rem_pv_cm_id;
  331. item->xa_rej_tmout = &sriov->xa_rej_tmout;
  332. old = xa_cmpxchg(&sriov->xa_rej_tmout, (unsigned long)rem_pv_cm_id, NULL, item, GFP_KERNEL);
  333. if (old) {
  334. pr_debug(
  335. "Non-null old entry (%p) or error (%d) when inserting\n",
  336. old, xa_err(old));
  337. kfree(item);
  338. return xa_err(old);
  339. }
  340. queue_delayed_work(cm_wq, &item->timeout, CM_CLEANUP_CACHE_TIMEOUT);
  341. return 0;
  342. err_or_exists:
  343. xa_unlock(&sriov->xa_rej_tmout);
  344. return ret;
  345. }
  346. static int lookup_rej_tmout_slave(struct mlx4_ib_sriov *sriov, u32 rem_pv_cm_id)
  347. {
  348. struct rej_tmout_entry *item;
  349. int slave;
  350. xa_lock(&sriov->xa_rej_tmout);
  351. item = xa_load(&sriov->xa_rej_tmout, (unsigned long)rem_pv_cm_id);
  352. if (!item || xa_err(item)) {
  353. pr_debug("Could not find slave. rem_pv_cm_id 0x%x error: %d\n",
  354. rem_pv_cm_id, xa_err(item));
  355. slave = !item ? -ENOENT : xa_err(item);
  356. } else {
  357. slave = item->slave;
  358. }
  359. xa_unlock(&sriov->xa_rej_tmout);
  360. return slave;
  361. }
  362. int mlx4_ib_demux_cm_handler(struct ib_device *ibdev, int port, int *slave,
  363. struct ib_mad *mad)
  364. {
  365. struct mlx4_ib_sriov *sriov = &to_mdev(ibdev)->sriov;
  366. u32 rem_pv_cm_id = get_local_comm_id(mad);
  367. u32 pv_cm_id;
  368. struct id_map_entry *id;
  369. int sts;
  370. if (mad->mad_hdr.attr_id == CM_REQ_ATTR_ID ||
  371. mad->mad_hdr.attr_id == CM_SIDR_REQ_ATTR_ID) {
  372. union ib_gid gid;
  373. if (!slave)
  374. return 0;
  375. gid = gid_from_req_msg(ibdev, mad);
  376. *slave = mlx4_ib_find_real_gid(ibdev, port, gid.global.interface_id);
  377. if (*slave < 0) {
  378. mlx4_ib_warn(ibdev, "failed matching slave_id by gid (0x%llx)\n",
  379. be64_to_cpu(gid.global.interface_id));
  380. return -ENOENT;
  381. }
  382. sts = alloc_rej_tmout(sriov, rem_pv_cm_id, *slave);
  383. if (sts)
  384. /* Even if this fails, we pass on the REQ to the slave */
  385. pr_debug("Could not allocate rej_tmout entry. rem_pv_cm_id 0x%x slave %d status %d\n",
  386. rem_pv_cm_id, *slave, sts);
  387. return 0;
  388. }
  389. pv_cm_id = get_remote_comm_id(mad);
  390. id = id_map_get(ibdev, (int *)&pv_cm_id, -1, -1);
  391. if (!id) {
  392. if (mad->mad_hdr.attr_id == CM_REJ_ATTR_ID &&
  393. REJ_REASON(mad) == IB_CM_REJ_TIMEOUT && slave) {
  394. *slave = lookup_rej_tmout_slave(sriov, rem_pv_cm_id);
  395. return (*slave < 0) ? *slave : 0;
  396. }
  397. pr_debug("Couldn't find an entry for pv_cm_id 0x%x, attr_id 0x%x\n",
  398. pv_cm_id, be16_to_cpu(mad->mad_hdr.attr_id));
  399. return -ENOENT;
  400. }
  401. if (slave)
  402. *slave = id->slave_id;
  403. set_remote_comm_id(mad, id->sl_cm_id);
  404. if (mad->mad_hdr.attr_id == CM_DREQ_ATTR_ID ||
  405. mad->mad_hdr.attr_id == CM_REJ_ATTR_ID)
  406. schedule_delayed(ibdev, id);
  407. return 0;
  408. }
  409. void mlx4_ib_cm_paravirt_init(struct mlx4_ib_dev *dev)
  410. {
  411. spin_lock_init(&dev->sriov.id_map_lock);
  412. INIT_LIST_HEAD(&dev->sriov.cm_list);
  413. dev->sriov.sl_id_map = RB_ROOT;
  414. xa_init_flags(&dev->sriov.pv_id_table, XA_FLAGS_ALLOC);
  415. xa_init(&dev->sriov.xa_rej_tmout);
  416. }
  417. static void rej_tmout_xa_cleanup(struct mlx4_ib_sriov *sriov, int slave)
  418. {
  419. struct rej_tmout_entry *item;
  420. bool flush_needed = false;
  421. unsigned long id;
  422. int cnt = 0;
  423. xa_lock(&sriov->xa_rej_tmout);
  424. xa_for_each(&sriov->xa_rej_tmout, id, item) {
  425. if (slave < 0 || slave == item->slave) {
  426. mod_delayed_work(cm_wq, &item->timeout, 0);
  427. flush_needed = true;
  428. ++cnt;
  429. }
  430. }
  431. xa_unlock(&sriov->xa_rej_tmout);
  432. if (flush_needed) {
  433. flush_workqueue(cm_wq);
  434. pr_debug("Deleted %d entries in xarray for slave %d during cleanup\n",
  435. cnt, slave);
  436. }
  437. if (slave < 0)
  438. WARN_ON(!xa_empty(&sriov->xa_rej_tmout));
  439. }
  440. /* slave = -1 ==> all slaves */
  441. /* TBD -- call paravirt clean for single slave. Need for slave RESET event */
  442. void mlx4_ib_cm_paravirt_clean(struct mlx4_ib_dev *dev, int slave)
  443. {
  444. struct mlx4_ib_sriov *sriov = &dev->sriov;
  445. struct rb_root *sl_id_map = &sriov->sl_id_map;
  446. struct list_head lh;
  447. struct rb_node *nd;
  448. int need_flush = 0;
  449. struct id_map_entry *map, *tmp_map;
  450. /* cancel all delayed work queue entries */
  451. INIT_LIST_HEAD(&lh);
  452. spin_lock(&sriov->id_map_lock);
  453. list_for_each_entry_safe(map, tmp_map, &dev->sriov.cm_list, list) {
  454. if (slave < 0 || slave == map->slave_id) {
  455. if (map->scheduled_delete)
  456. need_flush |= !cancel_delayed_work(&map->timeout);
  457. }
  458. }
  459. spin_unlock(&sriov->id_map_lock);
  460. if (need_flush)
  461. flush_workqueue(cm_wq); /* make sure all timers were flushed */
  462. /* now, remove all leftover entries from databases*/
  463. spin_lock(&sriov->id_map_lock);
  464. if (slave < 0) {
  465. while (rb_first(sl_id_map)) {
  466. struct id_map_entry *ent =
  467. rb_entry(rb_first(sl_id_map),
  468. struct id_map_entry, node);
  469. rb_erase(&ent->node, sl_id_map);
  470. xa_erase(&sriov->pv_id_table, ent->pv_cm_id);
  471. }
  472. list_splice_init(&dev->sriov.cm_list, &lh);
  473. } else {
  474. /* first, move nodes belonging to slave to db remove list */
  475. nd = rb_first(sl_id_map);
  476. while (nd) {
  477. struct id_map_entry *ent =
  478. rb_entry(nd, struct id_map_entry, node);
  479. nd = rb_next(nd);
  480. if (ent->slave_id == slave)
  481. list_move_tail(&ent->list, &lh);
  482. }
  483. /* remove those nodes from databases */
  484. list_for_each_entry_safe(map, tmp_map, &lh, list) {
  485. rb_erase(&map->node, sl_id_map);
  486. xa_erase(&sriov->pv_id_table, map->pv_cm_id);
  487. }
  488. /* add remaining nodes from cm_list */
  489. list_for_each_entry_safe(map, tmp_map, &dev->sriov.cm_list, list) {
  490. if (slave == map->slave_id)
  491. list_move_tail(&map->list, &lh);
  492. }
  493. }
  494. spin_unlock(&sriov->id_map_lock);
  495. /* free any map entries left behind due to cancel_delayed_work above */
  496. list_for_each_entry_safe(map, tmp_map, &lh, list) {
  497. list_del(&map->list);
  498. kfree(map);
  499. }
  500. rej_tmout_xa_cleanup(sriov, slave);
  501. }
  502. int mlx4_ib_cm_init(void)
  503. {
  504. cm_wq = alloc_workqueue("mlx4_ib_cm", 0, 0);
  505. if (!cm_wq)
  506. return -ENOMEM;
  507. return 0;
  508. }
  509. void mlx4_ib_cm_destroy(void)
  510. {
  511. destroy_workqueue(cm_wq);
  512. }