2 * Copyright (c) 2007, 2017 Oracle and/or its affiliates. All rights reserved.
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:
10 * Redistribution and use in source and binary forms, with or
11 * without modification, are permitted provided that the following
14 * - Redistributions of source code must retain the above
15 * copyright notice, this list of conditions and the following
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.
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
33 #include <linux/pagemap.h>
34 #include <linux/slab.h>
35 #include <linux/rbtree.h>
36 #include <linux/dma-mapping.h> /* for DMA_*_DEVICE */
43 * - should we detect duplicate keys on a socket? hmm.
44 * - an rdma is an mlock, apply rlimit?
48 * get the number of pages by looking at the page indices that the start and
49 * end addresses fall in.
51 * Returns 0 if the vec is invalid. It is invalid if the number of bytes
52 * causes the address to wrap or overflows an unsigned int. This comes
53 * from being stored in the 'length' member of 'struct scatterlist'.
55 static unsigned int rds_pages_in_vec(struct rds_iovec *vec)
57 if ((vec->addr + vec->bytes <= vec->addr) ||
58 (vec->bytes > (u64)UINT_MAX))
61 return ((vec->addr + vec->bytes + PAGE_SIZE - 1) >> PAGE_SHIFT) -
62 (vec->addr >> PAGE_SHIFT);
65 static struct rds_mr *rds_mr_tree_walk(struct rb_root *root, u64 key,
66 struct rds_mr *insert)
68 struct rb_node **p = &root->rb_node;
69 struct rb_node *parent = NULL;
74 mr = rb_entry(parent, struct rds_mr, r_rb_node);
78 else if (key > mr->r_key)
85 rb_link_node(&insert->r_rb_node, parent, p);
86 rb_insert_color(&insert->r_rb_node, root);
87 refcount_inc(&insert->r_refcount);
93 * Destroy the transport-specific part of a MR.
95 static void rds_destroy_mr(struct rds_mr *mr)
97 struct rds_sock *rs = mr->r_sock;
98 void *trans_private = NULL;
101 rdsdebug("RDS: destroy mr key is %x refcnt %u\n",
102 mr->r_key, refcount_read(&mr->r_refcount));
104 if (test_and_set_bit(RDS_MR_DEAD, &mr->r_state))
107 spin_lock_irqsave(&rs->rs_rdma_lock, flags);
108 if (!RB_EMPTY_NODE(&mr->r_rb_node))
109 rb_erase(&mr->r_rb_node, &rs->rs_rdma_keys);
110 trans_private = mr->r_trans_private;
111 mr->r_trans_private = NULL;
112 spin_unlock_irqrestore(&rs->rs_rdma_lock, flags);
115 mr->r_trans->free_mr(trans_private, mr->r_invalidate);
118 void __rds_put_mr_final(struct rds_mr *mr)
125 * By the time this is called we can't have any more ioctls called on
126 * the socket so we don't need to worry about racing with others.
128 void rds_rdma_drop_keys(struct rds_sock *rs)
131 struct rb_node *node;
134 /* Release any MRs associated with this socket */
135 spin_lock_irqsave(&rs->rs_rdma_lock, flags);
136 while ((node = rb_first(&rs->rs_rdma_keys))) {
137 mr = rb_entry(node, struct rds_mr, r_rb_node);
138 if (mr->r_trans == rs->rs_transport)
139 mr->r_invalidate = 0;
140 rb_erase(&mr->r_rb_node, &rs->rs_rdma_keys);
141 RB_CLEAR_NODE(&mr->r_rb_node);
142 spin_unlock_irqrestore(&rs->rs_rdma_lock, flags);
145 spin_lock_irqsave(&rs->rs_rdma_lock, flags);
147 spin_unlock_irqrestore(&rs->rs_rdma_lock, flags);
149 if (rs->rs_transport && rs->rs_transport->flush_mrs)
150 rs->rs_transport->flush_mrs();
154 * Helper function to pin user pages.
156 static int rds_pin_pages(unsigned long user_addr, unsigned int nr_pages,
157 struct page **pages, int write)
159 unsigned int gup_flags = FOLL_LONGTERM;
163 gup_flags |= FOLL_WRITE;
165 ret = get_user_pages_fast(user_addr, nr_pages, gup_flags, pages);
166 if (ret >= 0 && ret < nr_pages) {
168 put_page(pages[ret]);
175 static int __rds_rdma_map(struct rds_sock *rs, struct rds_get_mr_args *args,
176 u64 *cookie_ret, struct rds_mr **mr_ret,
177 struct rds_conn_path *cp)
179 struct rds_mr *mr = NULL, *found;
180 unsigned int nr_pages;
181 struct page **pages = NULL;
182 struct scatterlist *sg;
185 rds_rdma_cookie_t cookie;
190 if (ipv6_addr_any(&rs->rs_bound_addr) || !rs->rs_transport) {
191 ret = -ENOTCONN; /* XXX not a great errno */
195 if (!rs->rs_transport->get_mr) {
200 nr_pages = rds_pages_in_vec(&args->vec);
206 /* Restrict the size of mr irrespective of underlying transport
207 * To account for unaligned mr regions, subtract one from nr_pages
209 if ((nr_pages - 1) > (RDS_MAX_MSG_SIZE >> PAGE_SHIFT)) {
214 rdsdebug("RDS: get_mr addr %llx len %llu nr_pages %u\n",
215 args->vec.addr, args->vec.bytes, nr_pages);
217 /* XXX clamp nr_pages to limit the size of this alloc? */
218 pages = kcalloc(nr_pages, sizeof(struct page *), GFP_KERNEL);
224 mr = kzalloc(sizeof(struct rds_mr), GFP_KERNEL);
230 refcount_set(&mr->r_refcount, 1);
231 RB_CLEAR_NODE(&mr->r_rb_node);
232 mr->r_trans = rs->rs_transport;
235 if (args->flags & RDS_RDMA_USE_ONCE)
237 if (args->flags & RDS_RDMA_INVALIDATE)
238 mr->r_invalidate = 1;
239 if (args->flags & RDS_RDMA_READWRITE)
243 * Pin the pages that make up the user buffer and transfer the page
244 * pointers to the mr's sg array. We check to see if we've mapped
245 * the whole region after transferring the partial page references
246 * to the sg array so that we can have one page ref cleanup path.
248 * For now we have no flag that tells us whether the mapping is
249 * r/o or r/w. We need to assume r/w, or we'll do a lot of RDMA to
252 ret = rds_pin_pages(args->vec.addr, nr_pages, pages, 1);
257 sg = kcalloc(nents, sizeof(*sg), GFP_KERNEL);
263 sg_init_table(sg, nents);
265 /* Stick all pages into the scatterlist */
266 for (i = 0 ; i < nents; i++)
267 sg_set_page(&sg[i], pages[i], PAGE_SIZE, 0);
269 rdsdebug("RDS: trans_private nents is %u\n", nents);
271 /* Obtain a transport specific MR. If this succeeds, the
272 * s/g list is now owned by the MR.
273 * Note that dma_map() implies that pending writes are
274 * flushed to RAM, so no dma_sync is needed here. */
275 trans_private = rs->rs_transport->get_mr(sg, nents, rs,
277 cp ? cp->cp_conn : NULL);
279 if (IS_ERR(trans_private)) {
280 for (i = 0 ; i < nents; i++)
281 put_page(sg_page(&sg[i]));
283 ret = PTR_ERR(trans_private);
287 mr->r_trans_private = trans_private;
289 rdsdebug("RDS: get_mr put_user key is %x cookie_addr %p\n",
290 mr->r_key, (void *)(unsigned long) args->cookie_addr);
292 /* The user may pass us an unaligned address, but we can only
293 * map page aligned regions. So we keep the offset, and build
294 * a 64bit cookie containing <R_Key, offset> and pass that
296 cookie = rds_rdma_make_cookie(mr->r_key, args->vec.addr & ~PAGE_MASK);
298 *cookie_ret = cookie;
300 if (args->cookie_addr && put_user(cookie, (u64 __user *)(unsigned long) args->cookie_addr)) {
305 /* Inserting the new MR into the rbtree bumps its
306 * reference count. */
307 spin_lock_irqsave(&rs->rs_rdma_lock, flags);
308 found = rds_mr_tree_walk(&rs->rs_rdma_keys, mr->r_key, mr);
309 spin_unlock_irqrestore(&rs->rs_rdma_lock, flags);
311 BUG_ON(found && found != mr);
313 rdsdebug("RDS: get_mr key is %x\n", mr->r_key);
315 refcount_inc(&mr->r_refcount);
327 int rds_get_mr(struct rds_sock *rs, char __user *optval, int optlen)
329 struct rds_get_mr_args args;
331 if (optlen != sizeof(struct rds_get_mr_args))
334 if (copy_from_user(&args, (struct rds_get_mr_args __user *)optval,
335 sizeof(struct rds_get_mr_args)))
338 return __rds_rdma_map(rs, &args, NULL, NULL, NULL);
341 int rds_get_mr_for_dest(struct rds_sock *rs, char __user *optval, int optlen)
343 struct rds_get_mr_for_dest_args args;
344 struct rds_get_mr_args new_args;
346 if (optlen != sizeof(struct rds_get_mr_for_dest_args))
349 if (copy_from_user(&args, (struct rds_get_mr_for_dest_args __user *)optval,
350 sizeof(struct rds_get_mr_for_dest_args)))
354 * Initially, just behave like get_mr().
355 * TODO: Implement get_mr as wrapper around this
358 new_args.vec = args.vec;
359 new_args.cookie_addr = args.cookie_addr;
360 new_args.flags = args.flags;
362 return __rds_rdma_map(rs, &new_args, NULL, NULL, NULL);
366 * Free the MR indicated by the given R_Key
368 int rds_free_mr(struct rds_sock *rs, char __user *optval, int optlen)
370 struct rds_free_mr_args args;
374 if (optlen != sizeof(struct rds_free_mr_args))
377 if (copy_from_user(&args, (struct rds_free_mr_args __user *)optval,
378 sizeof(struct rds_free_mr_args)))
381 /* Special case - a null cookie means flush all unused MRs */
382 if (args.cookie == 0) {
383 if (!rs->rs_transport || !rs->rs_transport->flush_mrs)
385 rs->rs_transport->flush_mrs();
389 /* Look up the MR given its R_key and remove it from the rbtree
390 * so nobody else finds it.
391 * This should also prevent races with rds_rdma_unuse.
393 spin_lock_irqsave(&rs->rs_rdma_lock, flags);
394 mr = rds_mr_tree_walk(&rs->rs_rdma_keys, rds_rdma_cookie_key(args.cookie), NULL);
396 rb_erase(&mr->r_rb_node, &rs->rs_rdma_keys);
397 RB_CLEAR_NODE(&mr->r_rb_node);
398 if (args.flags & RDS_RDMA_INVALIDATE)
399 mr->r_invalidate = 1;
401 spin_unlock_irqrestore(&rs->rs_rdma_lock, flags);
407 * call rds_destroy_mr() ourselves so that we're sure it's done by the time
408 * we return. If we let rds_mr_put() do it it might not happen until
409 * someone else drops their ref.
417 * This is called when we receive an extension header that
418 * tells us this MR was used. It allows us to implement
421 void rds_rdma_unuse(struct rds_sock *rs, u32 r_key, int force)
427 spin_lock_irqsave(&rs->rs_rdma_lock, flags);
428 mr = rds_mr_tree_walk(&rs->rs_rdma_keys, r_key, NULL);
430 pr_debug("rds: trying to unuse MR with unknown r_key %u!\n",
432 spin_unlock_irqrestore(&rs->rs_rdma_lock, flags);
436 if (mr->r_use_once || force) {
437 rb_erase(&mr->r_rb_node, &rs->rs_rdma_keys);
438 RB_CLEAR_NODE(&mr->r_rb_node);
441 spin_unlock_irqrestore(&rs->rs_rdma_lock, flags);
443 /* May have to issue a dma_sync on this memory region.
444 * Note we could avoid this if the operation was a RDMA READ,
445 * but at this point we can't tell. */
446 if (mr->r_trans->sync_mr)
447 mr->r_trans->sync_mr(mr->r_trans_private, DMA_FROM_DEVICE);
449 /* If the MR was marked as invalidate, this will
450 * trigger an async flush. */
457 void rds_rdma_free_op(struct rm_rdma_op *ro)
461 for (i = 0; i < ro->op_nents; i++) {
462 struct page *page = sg_page(&ro->op_sg[i]);
464 /* Mark page dirty if it was possibly modified, which
465 * is the case for a RDMA_READ which copies from remote
468 WARN_ON(!page->mapping && irqs_disabled());
469 set_page_dirty(page);
474 kfree(ro->op_notifier);
475 ro->op_notifier = NULL;
479 void rds_atomic_free_op(struct rm_atomic_op *ao)
481 struct page *page = sg_page(ao->op_sg);
483 /* Mark page dirty if it was possibly modified, which
484 * is the case for a RDMA_READ which copies from remote
486 set_page_dirty(page);
489 kfree(ao->op_notifier);
490 ao->op_notifier = NULL;
496 * Count the number of pages needed to describe an incoming iovec array.
498 static int rds_rdma_pages(struct rds_iovec iov[], int nr_iovecs)
501 unsigned int nr_pages;
504 /* figure out the number of pages in the vector */
505 for (i = 0; i < nr_iovecs; i++) {
506 nr_pages = rds_pages_in_vec(&iov[i]);
510 tot_pages += nr_pages;
513 * nr_pages for one entry is limited to (UINT_MAX>>PAGE_SHIFT)+1,
514 * so tot_pages cannot overflow without first going negative.
523 int rds_rdma_extra_size(struct rds_rdma_args *args,
524 struct rds_iov_vector *iov)
526 struct rds_iovec *vec;
527 struct rds_iovec __user *local_vec;
529 unsigned int nr_pages;
532 local_vec = (struct rds_iovec __user *)(unsigned long) args->local_vec_addr;
534 if (args->nr_local == 0)
537 iov->iov = kcalloc(args->nr_local,
538 sizeof(struct rds_iovec),
545 if (copy_from_user(vec, local_vec, args->nr_local *
546 sizeof(struct rds_iovec)))
548 iov->len = args->nr_local;
550 /* figure out the number of pages in the vector */
551 for (i = 0; i < args->nr_local; i++, vec++) {
553 nr_pages = rds_pages_in_vec(vec);
557 tot_pages += nr_pages;
560 * nr_pages for one entry is limited to (UINT_MAX>>PAGE_SHIFT)+1,
561 * so tot_pages cannot overflow without first going negative.
567 return tot_pages * sizeof(struct scatterlist);
571 * The application asks for a RDMA transfer.
572 * Extract all arguments and set up the rdma_op
574 int rds_cmsg_rdma_args(struct rds_sock *rs, struct rds_message *rm,
575 struct cmsghdr *cmsg,
576 struct rds_iov_vector *vec)
578 struct rds_rdma_args *args;
579 struct rm_rdma_op *op = &rm->rdma;
581 unsigned int nr_bytes;
582 struct page **pages = NULL;
583 struct rds_iovec *iovs;
587 if (cmsg->cmsg_len < CMSG_LEN(sizeof(struct rds_rdma_args))
588 || rm->rdma.op_active)
591 args = CMSG_DATA(cmsg);
593 if (ipv6_addr_any(&rs->rs_bound_addr)) {
594 ret = -ENOTCONN; /* XXX not a great errno */
598 if (args->nr_local > UIO_MAXIOV) {
603 if (vec->len != args->nr_local) {
610 nr_pages = rds_rdma_pages(iovs, args->nr_local);
616 pages = kcalloc(nr_pages, sizeof(struct page *), GFP_KERNEL);
622 op->op_write = !!(args->flags & RDS_RDMA_READWRITE);
623 op->op_fence = !!(args->flags & RDS_RDMA_FENCE);
624 op->op_notify = !!(args->flags & RDS_RDMA_NOTIFY_ME);
625 op->op_silent = !!(args->flags & RDS_RDMA_SILENT);
627 op->op_recverr = rs->rs_recverr;
629 op->op_sg = rds_message_alloc_sgs(rm, nr_pages, &ret);
633 if (op->op_notify || op->op_recverr) {
634 /* We allocate an uninitialized notifier here, because
635 * we don't want to do that in the completion handler. We
636 * would have to use GFP_ATOMIC there, and don't want to deal
637 * with failed allocations.
639 op->op_notifier = kmalloc(sizeof(struct rds_notifier), GFP_KERNEL);
640 if (!op->op_notifier) {
644 op->op_notifier->n_user_token = args->user_token;
645 op->op_notifier->n_status = RDS_RDMA_SUCCESS;
648 /* The cookie contains the R_Key of the remote memory region, and
649 * optionally an offset into it. This is how we implement RDMA into
651 * When setting up the RDMA, we need to add that offset to the
652 * destination address (which is really an offset into the MR)
653 * FIXME: We may want to move this into ib_rdma.c
655 op->op_rkey = rds_rdma_cookie_key(args->cookie);
656 op->op_remote_addr = args->remote_vec.addr + rds_rdma_cookie_offset(args->cookie);
660 rdsdebug("RDS: rdma prepare nr_local %llu rva %llx rkey %x\n",
661 (unsigned long long)args->nr_local,
662 (unsigned long long)args->remote_vec.addr,
665 for (i = 0; i < args->nr_local; i++) {
666 struct rds_iovec *iov = &iovs[i];
667 /* don't need to check, rds_rdma_pages() verified nr will be +nonzero */
668 unsigned int nr = rds_pages_in_vec(iov);
670 rs->rs_user_addr = iov->addr;
671 rs->rs_user_bytes = iov->bytes;
673 /* If it's a WRITE operation, we want to pin the pages for reading.
674 * If it's a READ operation, we need to pin the pages for writing.
676 ret = rds_pin_pages(iov->addr, nr, pages, !op->op_write);
682 rdsdebug("RDS: nr_bytes %u nr %u iov->bytes %llu iov->addr %llx\n",
683 nr_bytes, nr, iov->bytes, iov->addr);
685 nr_bytes += iov->bytes;
687 for (j = 0; j < nr; j++) {
688 unsigned int offset = iov->addr & ~PAGE_MASK;
689 struct scatterlist *sg;
691 sg = &op->op_sg[op->op_nents + j];
692 sg_set_page(sg, pages[j],
693 min_t(unsigned int, iov->bytes, PAGE_SIZE - offset),
696 rdsdebug("RDS: sg->offset %x sg->len %x iov->addr %llx iov->bytes %llu\n",
697 sg->offset, sg->length, iov->addr, iov->bytes);
699 iov->addr += sg->length;
700 iov->bytes -= sg->length;
706 if (nr_bytes > args->remote_vec.bytes) {
707 rdsdebug("RDS nr_bytes %u remote_bytes %u do not match\n",
709 (unsigned int) args->remote_vec.bytes);
713 op->op_bytes = nr_bytes;
719 rds_rdma_free_op(op);
721 rds_stats_inc(s_send_rdma);
727 * The application wants us to pass an RDMA destination (aka MR)
730 int rds_cmsg_rdma_dest(struct rds_sock *rs, struct rds_message *rm,
731 struct cmsghdr *cmsg)
738 if (cmsg->cmsg_len < CMSG_LEN(sizeof(rds_rdma_cookie_t)) ||
739 rm->m_rdma_cookie != 0)
742 memcpy(&rm->m_rdma_cookie, CMSG_DATA(cmsg), sizeof(rm->m_rdma_cookie));
744 /* We are reusing a previously mapped MR here. Most likely, the
745 * application has written to the buffer, so we need to explicitly
746 * flush those writes to RAM. Otherwise the HCA may not see them
747 * when doing a DMA from that buffer.
749 r_key = rds_rdma_cookie_key(rm->m_rdma_cookie);
751 spin_lock_irqsave(&rs->rs_rdma_lock, flags);
752 mr = rds_mr_tree_walk(&rs->rs_rdma_keys, r_key, NULL);
754 err = -EINVAL; /* invalid r_key */
756 refcount_inc(&mr->r_refcount);
757 spin_unlock_irqrestore(&rs->rs_rdma_lock, flags);
760 mr->r_trans->sync_mr(mr->r_trans_private, DMA_TO_DEVICE);
761 rm->rdma.op_rdma_mr = mr;
767 * The application passes us an address range it wants to enable RDMA
768 * to/from. We map the area, and save the <R_Key,offset> pair
769 * in rm->m_rdma_cookie. This causes it to be sent along to the peer
770 * in an extension header.
772 int rds_cmsg_rdma_map(struct rds_sock *rs, struct rds_message *rm,
773 struct cmsghdr *cmsg)
775 if (cmsg->cmsg_len < CMSG_LEN(sizeof(struct rds_get_mr_args)) ||
776 rm->m_rdma_cookie != 0)
779 return __rds_rdma_map(rs, CMSG_DATA(cmsg), &rm->m_rdma_cookie,
780 &rm->rdma.op_rdma_mr, rm->m_conn_path);
784 * Fill in rds_message for an atomic request.
786 int rds_cmsg_atomic(struct rds_sock *rs, struct rds_message *rm,
787 struct cmsghdr *cmsg)
789 struct page *page = NULL;
790 struct rds_atomic_args *args;
793 if (cmsg->cmsg_len < CMSG_LEN(sizeof(struct rds_atomic_args))
794 || rm->atomic.op_active)
797 args = CMSG_DATA(cmsg);
799 /* Nonmasked & masked cmsg ops converted to masked hw ops */
800 switch (cmsg->cmsg_type) {
801 case RDS_CMSG_ATOMIC_FADD:
802 rm->atomic.op_type = RDS_ATOMIC_TYPE_FADD;
803 rm->atomic.op_m_fadd.add = args->fadd.add;
804 rm->atomic.op_m_fadd.nocarry_mask = 0;
806 case RDS_CMSG_MASKED_ATOMIC_FADD:
807 rm->atomic.op_type = RDS_ATOMIC_TYPE_FADD;
808 rm->atomic.op_m_fadd.add = args->m_fadd.add;
809 rm->atomic.op_m_fadd.nocarry_mask = args->m_fadd.nocarry_mask;
811 case RDS_CMSG_ATOMIC_CSWP:
812 rm->atomic.op_type = RDS_ATOMIC_TYPE_CSWP;
813 rm->atomic.op_m_cswp.compare = args->cswp.compare;
814 rm->atomic.op_m_cswp.swap = args->cswp.swap;
815 rm->atomic.op_m_cswp.compare_mask = ~0;
816 rm->atomic.op_m_cswp.swap_mask = ~0;
818 case RDS_CMSG_MASKED_ATOMIC_CSWP:
819 rm->atomic.op_type = RDS_ATOMIC_TYPE_CSWP;
820 rm->atomic.op_m_cswp.compare = args->m_cswp.compare;
821 rm->atomic.op_m_cswp.swap = args->m_cswp.swap;
822 rm->atomic.op_m_cswp.compare_mask = args->m_cswp.compare_mask;
823 rm->atomic.op_m_cswp.swap_mask = args->m_cswp.swap_mask;
826 BUG(); /* should never happen */
829 rm->atomic.op_notify = !!(args->flags & RDS_RDMA_NOTIFY_ME);
830 rm->atomic.op_silent = !!(args->flags & RDS_RDMA_SILENT);
831 rm->atomic.op_active = 1;
832 rm->atomic.op_recverr = rs->rs_recverr;
833 rm->atomic.op_sg = rds_message_alloc_sgs(rm, 1, &ret);
834 if (!rm->atomic.op_sg)
837 /* verify 8 byte-aligned */
838 if (args->local_addr & 0x7) {
843 ret = rds_pin_pages(args->local_addr, 1, &page, 1);
848 sg_set_page(rm->atomic.op_sg, page, 8, offset_in_page(args->local_addr));
850 if (rm->atomic.op_notify || rm->atomic.op_recverr) {
851 /* We allocate an uninitialized notifier here, because
852 * we don't want to do that in the completion handler. We
853 * would have to use GFP_ATOMIC there, and don't want to deal
854 * with failed allocations.
856 rm->atomic.op_notifier = kmalloc(sizeof(*rm->atomic.op_notifier), GFP_KERNEL);
857 if (!rm->atomic.op_notifier) {
862 rm->atomic.op_notifier->n_user_token = args->user_token;
863 rm->atomic.op_notifier->n_status = RDS_RDMA_SUCCESS;
866 rm->atomic.op_rkey = rds_rdma_cookie_key(args->cookie);
867 rm->atomic.op_remote_addr = args->remote_addr + rds_rdma_cookie_offset(args->cookie);
873 rm->atomic.op_active = 0;
874 kfree(rm->atomic.op_notifier);