1 /* 2 * Copyright (c) 2006, 2018 Oracle and/or its affiliates. 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 */ 33 #include <linux/kernel.h> 34 #include <linux/slab.h> 35 #include <linux/rculist.h> 36 #include <linux/llist.h> 37 38 #include "rds_single_path.h" 39 #include "ib_mr.h" 40 #include "rds.h" 41 42 struct workqueue_struct *rds_ib_mr_wq; 43 44 static void rds_ib_odp_mr_worker(struct work_struct *work); 45 46 struct rds_ib_device *rds_ib_get_device(__be32 ipaddr) 47 { 48 struct rds_ib_device *rds_ibdev; 49 struct rds_ib_ipaddr *i_ipaddr; 50 51 rcu_read_lock(); 52 list_for_each_entry_rcu(rds_ibdev, &rds_ib_devices, list) { 53 list_for_each_entry_rcu(i_ipaddr, &rds_ibdev->ipaddr_list, list) { 54 if (i_ipaddr->ipaddr == ipaddr) { 55 refcount_inc(&rds_ibdev->refcount); 56 rcu_read_unlock(); 57 return rds_ibdev; 58 } 59 } 60 } 61 rcu_read_unlock(); 62 63 return NULL; 64 } 65 66 static int rds_ib_add_ipaddr(struct rds_ib_device *rds_ibdev, __be32 ipaddr) 67 { 68 struct rds_ib_ipaddr *i_ipaddr; 69 70 i_ipaddr = kmalloc_obj(*i_ipaddr); 71 if (!i_ipaddr) 72 return -ENOMEM; 73 74 i_ipaddr->ipaddr = ipaddr; 75 76 spin_lock_irq(&rds_ibdev->spinlock); 77 list_add_tail_rcu(&i_ipaddr->list, &rds_ibdev->ipaddr_list); 78 spin_unlock_irq(&rds_ibdev->spinlock); 79 80 return 0; 81 } 82 83 static void rds_ib_remove_ipaddr(struct rds_ib_device *rds_ibdev, __be32 ipaddr) 84 { 85 struct rds_ib_ipaddr *i_ipaddr; 86 struct rds_ib_ipaddr *to_free = NULL; 87 88 89 spin_lock_irq(&rds_ibdev->spinlock); 90 list_for_each_entry_rcu(i_ipaddr, &rds_ibdev->ipaddr_list, list) { 91 if (i_ipaddr->ipaddr == ipaddr) { 92 list_del_rcu(&i_ipaddr->list); 93 to_free = i_ipaddr; 94 break; 95 } 96 } 97 spin_unlock_irq(&rds_ibdev->spinlock); 98 99 if (to_free) 100 kfree_rcu(to_free, rcu); 101 } 102 103 int rds_ib_update_ipaddr(struct rds_ib_device *rds_ibdev, 104 struct in6_addr *ipaddr) 105 { 106 struct rds_ib_device *rds_ibdev_old; 107 108 rds_ibdev_old = rds_ib_get_device(ipaddr->s6_addr32[3]); 109 if (!rds_ibdev_old) 110 return rds_ib_add_ipaddr(rds_ibdev, ipaddr->s6_addr32[3]); 111 112 if (rds_ibdev_old != rds_ibdev) { 113 rds_ib_remove_ipaddr(rds_ibdev_old, ipaddr->s6_addr32[3]); 114 rds_ib_dev_put(rds_ibdev_old); 115 return rds_ib_add_ipaddr(rds_ibdev, ipaddr->s6_addr32[3]); 116 } 117 rds_ib_dev_put(rds_ibdev_old); 118 119 return 0; 120 } 121 122 void rds_ib_add_conn(struct rds_ib_device *rds_ibdev, struct rds_connection *conn) 123 { 124 struct rds_ib_connection *ic = conn->c_transport_data; 125 126 /* conn was previously on the nodev_conns_list */ 127 spin_lock_irq(&ib_nodev_conns_lock); 128 BUG_ON(list_empty(&ib_nodev_conns)); 129 BUG_ON(list_empty(&ic->ib_node)); 130 list_del(&ic->ib_node); 131 132 spin_lock(&rds_ibdev->spinlock); 133 list_add_tail(&ic->ib_node, &rds_ibdev->conn_list); 134 spin_unlock(&rds_ibdev->spinlock); 135 spin_unlock_irq(&ib_nodev_conns_lock); 136 137 ic->rds_ibdev = rds_ibdev; 138 refcount_inc(&rds_ibdev->refcount); 139 } 140 141 void rds_ib_remove_conn(struct rds_ib_device *rds_ibdev, struct rds_connection *conn) 142 { 143 struct rds_ib_connection *ic = conn->c_transport_data; 144 145 /* place conn on nodev_conns_list */ 146 spin_lock(&ib_nodev_conns_lock); 147 148 spin_lock_irq(&rds_ibdev->spinlock); 149 BUG_ON(list_empty(&ic->ib_node)); 150 list_del(&ic->ib_node); 151 spin_unlock_irq(&rds_ibdev->spinlock); 152 153 list_add_tail(&ic->ib_node, &ib_nodev_conns); 154 155 spin_unlock(&ib_nodev_conns_lock); 156 157 ic->rds_ibdev = NULL; 158 rds_ib_dev_put(rds_ibdev); 159 } 160 161 void rds_ib_destroy_nodev_conns(void) 162 { 163 struct rds_ib_connection *ic, *_ic; 164 LIST_HEAD(tmp_list); 165 166 /* avoid calling conn_destroy with irqs off */ 167 spin_lock_irq(&ib_nodev_conns_lock); 168 list_splice(&ib_nodev_conns, &tmp_list); 169 spin_unlock_irq(&ib_nodev_conns_lock); 170 171 list_for_each_entry_safe(ic, _ic, &tmp_list, ib_node) 172 rds_conn_destroy(ic->conn); 173 } 174 175 void rds_ib_get_mr_info(struct rds_ib_device *rds_ibdev, struct rds_info_rdma_connection *iinfo) 176 { 177 struct rds_ib_mr_pool *pool_1m = rds_ibdev->mr_1m_pool; 178 179 iinfo->rdma_mr_max = pool_1m->max_items; 180 iinfo->rdma_mr_size = pool_1m->max_pages; 181 } 182 183 #if IS_ENABLED(CONFIG_IPV6) 184 void rds6_ib_get_mr_info(struct rds_ib_device *rds_ibdev, 185 struct rds6_info_rdma_connection *iinfo6) 186 { 187 struct rds_ib_mr_pool *pool_1m = rds_ibdev->mr_1m_pool; 188 189 iinfo6->rdma_mr_max = pool_1m->max_items; 190 iinfo6->rdma_mr_size = pool_1m->max_pages; 191 } 192 #endif 193 194 struct rds_ib_mr *rds_ib_reuse_mr(struct rds_ib_mr_pool *pool) 195 { 196 struct rds_ib_mr *ibmr = NULL; 197 struct llist_node *ret; 198 unsigned long flags; 199 200 spin_lock_irqsave(&pool->clean_lock, flags); 201 ret = llist_del_first(&pool->clean_list); 202 spin_unlock_irqrestore(&pool->clean_lock, flags); 203 if (ret) { 204 ibmr = llist_entry(ret, struct rds_ib_mr, llnode); 205 if (pool->pool_type == RDS_IB_MR_8K_POOL) 206 rds_ib_stats_inc(s_ib_rdma_mr_8k_reused); 207 else 208 rds_ib_stats_inc(s_ib_rdma_mr_1m_reused); 209 } 210 211 return ibmr; 212 } 213 214 void rds_ib_sync_mr(void *trans_private, int direction) 215 { 216 struct rds_ib_mr *ibmr = trans_private; 217 struct rds_ib_device *rds_ibdev = ibmr->device; 218 219 if (ibmr->odp) 220 return; 221 222 switch (direction) { 223 case DMA_FROM_DEVICE: 224 ib_dma_sync_sg_for_cpu(rds_ibdev->dev, ibmr->sg, 225 ibmr->sg_dma_len, DMA_BIDIRECTIONAL); 226 break; 227 case DMA_TO_DEVICE: 228 ib_dma_sync_sg_for_device(rds_ibdev->dev, ibmr->sg, 229 ibmr->sg_dma_len, DMA_BIDIRECTIONAL); 230 break; 231 } 232 } 233 234 void __rds_ib_teardown_mr(struct rds_ib_mr *ibmr) 235 { 236 struct rds_ib_device *rds_ibdev = ibmr->device; 237 238 if (ibmr->sg_dma_len) { 239 ib_dma_unmap_sg(rds_ibdev->dev, 240 ibmr->sg, ibmr->sg_len, 241 DMA_BIDIRECTIONAL); 242 ibmr->sg_dma_len = 0; 243 } 244 245 /* Release the s/g list */ 246 if (ibmr->sg_len) { 247 unsigned int i; 248 249 for (i = 0; i < ibmr->sg_len; ++i) { 250 struct page *page = sg_page(&ibmr->sg[i]); 251 252 /* FIXME we need a way to tell a r/w MR 253 * from a r/o MR */ 254 unpin_user_pages_dirty_lock(&page, 1, true); 255 } 256 kfree(ibmr->sg); 257 258 ibmr->sg = NULL; 259 ibmr->sg_len = 0; 260 } 261 } 262 263 void rds_ib_teardown_mr(struct rds_ib_mr *ibmr) 264 { 265 unsigned int pinned = ibmr->sg_len; 266 267 __rds_ib_teardown_mr(ibmr); 268 if (pinned) { 269 struct rds_ib_mr_pool *pool = ibmr->pool; 270 271 atomic_sub(pinned, &pool->free_pinned); 272 } 273 } 274 275 static inline unsigned int rds_ib_flush_goal(struct rds_ib_mr_pool *pool, int free_all) 276 { 277 unsigned int item_count; 278 279 item_count = atomic_read(&pool->item_count); 280 if (free_all) 281 return item_count; 282 283 return 0; 284 } 285 286 /* 287 * given an llist of mrs, put them all into the list_head for more processing 288 */ 289 static unsigned int llist_append_to_list(struct llist_head *llist, 290 struct list_head *list) 291 { 292 struct rds_ib_mr *ibmr; 293 struct llist_node *node; 294 struct llist_node *next; 295 unsigned int count = 0; 296 297 node = llist_del_all(llist); 298 while (node) { 299 next = node->next; 300 ibmr = llist_entry(node, struct rds_ib_mr, llnode); 301 list_add_tail(&ibmr->unmap_list, list); 302 node = next; 303 count++; 304 } 305 return count; 306 } 307 308 /* 309 * this takes a list head of mrs and turns it into linked llist nodes 310 * of clusters. Each cluster has linked llist nodes of 311 * MR_CLUSTER_SIZE mrs that are ready for reuse. 312 */ 313 static void list_to_llist_nodes(struct list_head *list, 314 struct llist_node **nodes_head, 315 struct llist_node **nodes_tail) 316 { 317 struct rds_ib_mr *ibmr; 318 struct llist_node *cur = NULL; 319 struct llist_node **next = nodes_head; 320 321 list_for_each_entry(ibmr, list, unmap_list) { 322 cur = &ibmr->llnode; 323 *next = cur; 324 next = &cur->next; 325 } 326 *next = NULL; 327 *nodes_tail = cur; 328 } 329 330 /* 331 * Flush our pool of MRs. 332 * At a minimum, all currently unused MRs are unmapped. 333 * If the number of MRs allocated exceeds the limit, we also try 334 * to free as many MRs as needed to get back to this limit. 335 */ 336 int rds_ib_flush_mr_pool(struct rds_ib_mr_pool *pool, 337 int free_all, struct rds_ib_mr **ibmr_ret) 338 { 339 struct rds_ib_mr *ibmr; 340 struct llist_node *clean_nodes; 341 struct llist_node *clean_tail; 342 LIST_HEAD(unmap_list); 343 unsigned long unpinned = 0; 344 unsigned int nfreed = 0, dirty_to_clean = 0, free_goal; 345 346 if (pool->pool_type == RDS_IB_MR_8K_POOL) 347 rds_ib_stats_inc(s_ib_rdma_mr_8k_pool_flush); 348 else 349 rds_ib_stats_inc(s_ib_rdma_mr_1m_pool_flush); 350 351 if (ibmr_ret) { 352 DEFINE_WAIT(wait); 353 while (!mutex_trylock(&pool->flush_lock)) { 354 ibmr = rds_ib_reuse_mr(pool); 355 if (ibmr) { 356 *ibmr_ret = ibmr; 357 finish_wait(&pool->flush_wait, &wait); 358 goto out_nolock; 359 } 360 361 prepare_to_wait(&pool->flush_wait, &wait, 362 TASK_UNINTERRUPTIBLE); 363 if (llist_empty(&pool->clean_list)) 364 schedule(); 365 366 ibmr = rds_ib_reuse_mr(pool); 367 if (ibmr) { 368 *ibmr_ret = ibmr; 369 finish_wait(&pool->flush_wait, &wait); 370 goto out_nolock; 371 } 372 } 373 finish_wait(&pool->flush_wait, &wait); 374 } else 375 mutex_lock(&pool->flush_lock); 376 377 if (ibmr_ret) { 378 ibmr = rds_ib_reuse_mr(pool); 379 if (ibmr) { 380 *ibmr_ret = ibmr; 381 goto out; 382 } 383 } 384 385 /* Get the list of all MRs to be dropped. Ordering matters - 386 * we want to put drop_list ahead of free_list. 387 */ 388 dirty_to_clean = llist_append_to_list(&pool->drop_list, &unmap_list); 389 dirty_to_clean += llist_append_to_list(&pool->free_list, &unmap_list); 390 if (free_all) { 391 unsigned long flags; 392 393 spin_lock_irqsave(&pool->clean_lock, flags); 394 llist_append_to_list(&pool->clean_list, &unmap_list); 395 spin_unlock_irqrestore(&pool->clean_lock, flags); 396 } 397 398 free_goal = rds_ib_flush_goal(pool, free_all); 399 400 if (list_empty(&unmap_list)) 401 goto out; 402 403 rds_ib_unreg_frmr(&unmap_list, &nfreed, &unpinned, free_goal); 404 405 if (!list_empty(&unmap_list)) { 406 unsigned long flags; 407 408 list_to_llist_nodes(&unmap_list, &clean_nodes, &clean_tail); 409 if (ibmr_ret) { 410 *ibmr_ret = llist_entry(clean_nodes, struct rds_ib_mr, llnode); 411 clean_nodes = clean_nodes->next; 412 } 413 /* more than one entry in llist nodes */ 414 if (clean_nodes) { 415 spin_lock_irqsave(&pool->clean_lock, flags); 416 llist_add_batch(clean_nodes, clean_tail, 417 &pool->clean_list); 418 spin_unlock_irqrestore(&pool->clean_lock, flags); 419 } 420 } 421 422 atomic_sub(unpinned, &pool->free_pinned); 423 atomic_sub(dirty_to_clean, &pool->dirty_count); 424 atomic_sub(nfreed, &pool->item_count); 425 426 out: 427 mutex_unlock(&pool->flush_lock); 428 if (waitqueue_active(&pool->flush_wait)) 429 wake_up(&pool->flush_wait); 430 out_nolock: 431 return 0; 432 } 433 434 struct rds_ib_mr *rds_ib_try_reuse_ibmr(struct rds_ib_mr_pool *pool) 435 { 436 struct rds_ib_mr *ibmr = NULL; 437 int iter = 0; 438 439 while (1) { 440 ibmr = rds_ib_reuse_mr(pool); 441 if (ibmr) 442 return ibmr; 443 444 if (atomic_inc_return(&pool->item_count) <= pool->max_items) 445 break; 446 447 atomic_dec(&pool->item_count); 448 449 if (++iter > 2) { 450 if (pool->pool_type == RDS_IB_MR_8K_POOL) 451 rds_ib_stats_inc(s_ib_rdma_mr_8k_pool_depleted); 452 else 453 rds_ib_stats_inc(s_ib_rdma_mr_1m_pool_depleted); 454 break; 455 } 456 457 /* We do have some empty MRs. Flush them out. */ 458 if (pool->pool_type == RDS_IB_MR_8K_POOL) 459 rds_ib_stats_inc(s_ib_rdma_mr_8k_pool_wait); 460 else 461 rds_ib_stats_inc(s_ib_rdma_mr_1m_pool_wait); 462 463 rds_ib_flush_mr_pool(pool, 0, &ibmr); 464 if (ibmr) 465 return ibmr; 466 } 467 468 return NULL; 469 } 470 471 static void rds_ib_mr_pool_flush_worker(struct work_struct *work) 472 { 473 struct rds_ib_mr_pool *pool = container_of(work, struct rds_ib_mr_pool, flush_worker.work); 474 475 rds_ib_flush_mr_pool(pool, 0, NULL); 476 } 477 478 void rds_ib_free_mr(void *trans_private, int invalidate) 479 { 480 struct rds_ib_mr *ibmr = trans_private; 481 struct rds_ib_mr_pool *pool = ibmr->pool; 482 struct rds_ib_device *rds_ibdev = ibmr->device; 483 484 rdsdebug("RDS/IB: free_mr nents %u\n", ibmr->sg_len); 485 486 if (ibmr->odp) { 487 /* A MR created and marked as use_once. We use delayed work, 488 * because there is a change that we are in interrupt and can't 489 * call to ib_dereg_mr() directly. 490 */ 491 INIT_DELAYED_WORK(&ibmr->work, rds_ib_odp_mr_worker); 492 queue_delayed_work(rds_ib_mr_wq, &ibmr->work, 0); 493 return; 494 } 495 496 /* Return it to the pool's free list */ 497 rds_ib_free_frmr_list(ibmr); 498 499 atomic_add(ibmr->sg_len, &pool->free_pinned); 500 atomic_inc(&pool->dirty_count); 501 502 /* If we've pinned too many pages, request a flush */ 503 if (atomic_read(&pool->free_pinned) >= pool->max_free_pinned || 504 atomic_read(&pool->dirty_count) >= pool->max_items / 5) 505 queue_delayed_work(rds_ib_mr_wq, &pool->flush_worker, 10); 506 507 if (invalidate) { 508 if (likely(!in_interrupt())) { 509 rds_ib_flush_mr_pool(pool, 0, NULL); 510 } else { 511 /* We get here if the user created a MR marked 512 * as use_once and invalidate at the same time. 513 */ 514 queue_delayed_work(rds_ib_mr_wq, 515 &pool->flush_worker, 10); 516 } 517 } 518 519 rds_ib_dev_put(rds_ibdev); 520 } 521 522 void rds_ib_flush_mrs(void) 523 { 524 struct rds_ib_device *rds_ibdev; 525 526 down_read(&rds_ib_devices_lock); 527 list_for_each_entry(rds_ibdev, &rds_ib_devices, list) { 528 if (rds_ibdev->mr_8k_pool) 529 rds_ib_flush_mr_pool(rds_ibdev->mr_8k_pool, 0, NULL); 530 531 if (rds_ibdev->mr_1m_pool) 532 rds_ib_flush_mr_pool(rds_ibdev->mr_1m_pool, 0, NULL); 533 } 534 up_read(&rds_ib_devices_lock); 535 } 536 537 u32 rds_ib_get_lkey(void *trans_private) 538 { 539 struct rds_ib_mr *ibmr = trans_private; 540 541 return ibmr->u.mr->lkey; 542 } 543 544 void *rds_ib_get_mr(struct scatterlist *sg, unsigned long nents, 545 struct rds_sock *rs, u32 *key_ret, 546 struct rds_connection *conn, 547 u64 start, u64 length, int need_odp) 548 { 549 struct rds_ib_device *rds_ibdev; 550 struct rds_ib_mr *ibmr = NULL; 551 struct rds_ib_connection *ic = NULL; 552 int ret; 553 554 rds_ibdev = rds_ib_get_device(rs->rs_bound_addr.s6_addr32[3]); 555 if (!rds_ibdev) { 556 ret = -ENODEV; 557 goto out; 558 } 559 560 if (need_odp == ODP_ZEROBASED || need_odp == ODP_VIRTUAL) { 561 u64 virt_addr = need_odp == ODP_ZEROBASED ? 0 : start; 562 int access_flags = 563 (IB_ACCESS_LOCAL_WRITE | IB_ACCESS_REMOTE_READ | 564 IB_ACCESS_REMOTE_WRITE | IB_ACCESS_REMOTE_ATOMIC | 565 IB_ACCESS_ON_DEMAND); 566 struct ib_sge sge = {}; 567 struct ib_mr *ib_mr; 568 569 if (!rds_ibdev->odp_capable) { 570 ret = -EOPNOTSUPP; 571 goto out; 572 } 573 574 ib_mr = ib_reg_user_mr(rds_ibdev->pd, start, length, virt_addr, 575 access_flags); 576 577 if (IS_ERR(ib_mr)) { 578 rdsdebug("rds_ib_get_user_mr returned %d\n", 579 IS_ERR(ib_mr)); 580 ret = PTR_ERR(ib_mr); 581 goto out; 582 } 583 if (key_ret) 584 *key_ret = ib_mr->rkey; 585 586 ibmr = kzalloc_obj(*ibmr); 587 if (!ibmr) { 588 ib_dereg_mr(ib_mr); 589 ret = -ENOMEM; 590 goto out; 591 } 592 ibmr->u.mr = ib_mr; 593 ibmr->odp = 1; 594 595 sge.addr = virt_addr; 596 sge.length = length; 597 sge.lkey = ib_mr->lkey; 598 599 ib_advise_mr(rds_ibdev->pd, 600 IB_UVERBS_ADVISE_MR_ADVICE_PREFETCH_WRITE, 601 IB_UVERBS_ADVISE_MR_FLAG_FLUSH, &sge, 1); 602 return ibmr; 603 } 604 605 if (conn) { 606 ic = conn->c_transport_data; 607 if (!ic || !ic->i_cm_id || !ic->i_cm_id->qp) { 608 ret = -ENODEV; 609 goto out; 610 } 611 } 612 613 if (!rds_ibdev->mr_8k_pool || !rds_ibdev->mr_1m_pool) { 614 ret = -ENODEV; 615 goto out; 616 } 617 618 ibmr = rds_ib_reg_frmr(rds_ibdev, ic, sg, nents, key_ret); 619 if (IS_ERR(ibmr)) { 620 ret = PTR_ERR(ibmr); 621 pr_warn("RDS/IB: rds_ib_get_mr failed (errno=%d)\n", ret); 622 } else { 623 return ibmr; 624 } 625 626 out: 627 if (rds_ibdev) 628 rds_ib_dev_put(rds_ibdev); 629 630 return ERR_PTR(ret); 631 } 632 633 void rds_ib_destroy_mr_pool(struct rds_ib_mr_pool *pool) 634 { 635 cancel_delayed_work_sync(&pool->flush_worker); 636 rds_ib_flush_mr_pool(pool, 1, NULL); 637 WARN_ON(atomic_read(&pool->item_count)); 638 WARN_ON(atomic_read(&pool->free_pinned)); 639 kfree(pool); 640 } 641 642 struct rds_ib_mr_pool *rds_ib_create_mr_pool(struct rds_ib_device *rds_ibdev, 643 int pool_type) 644 { 645 struct rds_ib_mr_pool *pool; 646 647 pool = kzalloc_obj(*pool); 648 if (!pool) 649 return ERR_PTR(-ENOMEM); 650 651 pool->pool_type = pool_type; 652 init_llist_head(&pool->free_list); 653 init_llist_head(&pool->drop_list); 654 init_llist_head(&pool->clean_list); 655 spin_lock_init(&pool->clean_lock); 656 mutex_init(&pool->flush_lock); 657 init_waitqueue_head(&pool->flush_wait); 658 INIT_DELAYED_WORK(&pool->flush_worker, rds_ib_mr_pool_flush_worker); 659 660 if (pool_type == RDS_IB_MR_1M_POOL) { 661 /* +1 allows for unaligned MRs */ 662 pool->max_pages = RDS_MR_1M_MSG_SIZE + 1; 663 pool->max_items = rds_ibdev->max_1m_mrs; 664 } else { 665 /* pool_type == RDS_IB_MR_8K_POOL */ 666 pool->max_pages = RDS_MR_8K_MSG_SIZE + 1; 667 pool->max_items = rds_ibdev->max_8k_mrs; 668 } 669 670 pool->max_free_pinned = pool->max_items * pool->max_pages / 4; 671 pool->max_items_soft = rds_ibdev->max_mrs * 3 / 4; 672 673 return pool; 674 } 675 676 int rds_ib_mr_init(void) 677 { 678 rds_ib_mr_wq = alloc_workqueue("rds_mr_flushd", 679 WQ_MEM_RECLAIM | WQ_PERCPU, 0); 680 if (!rds_ib_mr_wq) 681 return -ENOMEM; 682 return 0; 683 } 684 685 /* By the time this is called all the IB devices should have been torn down and 686 * had their pools freed. As each pool is freed its work struct is waited on, 687 * so the pool flushing work queue should be idle by the time we get here. 688 */ 689 void rds_ib_mr_exit(void) 690 { 691 destroy_workqueue(rds_ib_mr_wq); 692 } 693 694 static void rds_ib_odp_mr_worker(struct work_struct *work) 695 { 696 struct rds_ib_mr *ibmr; 697 698 ibmr = container_of(work, struct rds_ib_mr, work.work); 699 ib_dereg_mr(ibmr->u.mr); 700 kfree(ibmr); 701 } 702