Merge tag 'for_linus' of git://git.kernel.org/pub/scm/linux/kernel/git/mst/vhost
[cris-mirror.git] / drivers / infiniband / sw / rxe / rxe_cq.c
blobc4aabf78dc90f525d0e9a4da78fc0dc5b96bcd15
1 /*
2 * Copyright (c) 2016 Mellanox Technologies Ltd. All rights reserved.
3 * Copyright (c) 2015 System Fabric Works, Inc. All rights reserved.
5 * This software is available to you under a choice of one of two
6 * licenses. You may choose to be licensed under the terms of the GNU
7 * General Public License (GPL) Version 2, available from the file
8 * COPYING in the main directory of this source tree, or the
9 * OpenIB.org BSD license below:
11 * Redistribution and use in source and binary forms, with or
12 * without modification, are permitted provided that the following
13 * conditions are met:
15 * - Redistributions of source code must retain the above
16 * copyright notice, this list of conditions and the following
17 * disclaimer.
19 * - Redistributions in binary form must reproduce the above
20 * copyright notice, this list of conditions and the following
21 * disclaimer in the documentation and/or other materials
22 * provided with the distribution.
24 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
25 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
26 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
27 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS
28 * BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN
29 * ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
30 * CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
31 * SOFTWARE.
34 #include "rxe.h"
35 #include "rxe_loc.h"
36 #include "rxe_queue.h"
38 int rxe_cq_chk_attr(struct rxe_dev *rxe, struct rxe_cq *cq,
39 int cqe, int comp_vector, struct ib_udata *udata)
41 int count;
43 if (cqe <= 0) {
44 pr_warn("cqe(%d) <= 0\n", cqe);
45 goto err1;
48 if (cqe > rxe->attr.max_cqe) {
49 pr_warn("cqe(%d) > max_cqe(%d)\n",
50 cqe, rxe->attr.max_cqe);
51 goto err1;
54 if (cq) {
55 count = queue_count(cq->queue);
56 if (cqe < count) {
57 pr_warn("cqe(%d) < current # elements in queue (%d)",
58 cqe, count);
59 goto err1;
63 return 0;
65 err1:
66 return -EINVAL;
69 static void rxe_send_complete(unsigned long data)
71 struct rxe_cq *cq = (struct rxe_cq *)data;
72 unsigned long flags;
74 spin_lock_irqsave(&cq->cq_lock, flags);
75 if (cq->is_dying) {
76 spin_unlock_irqrestore(&cq->cq_lock, flags);
77 return;
79 spin_unlock_irqrestore(&cq->cq_lock, flags);
81 cq->ibcq.comp_handler(&cq->ibcq, cq->ibcq.cq_context);
84 int rxe_cq_from_init(struct rxe_dev *rxe, struct rxe_cq *cq, int cqe,
85 int comp_vector, struct ib_ucontext *context,
86 struct ib_udata *udata)
88 int err;
90 cq->queue = rxe_queue_init(rxe, &cqe,
91 sizeof(struct rxe_cqe));
92 if (!cq->queue) {
93 pr_warn("unable to create cq\n");
94 return -ENOMEM;
97 err = do_mmap_info(rxe, udata, false, context, cq->queue->buf,
98 cq->queue->buf_size, &cq->queue->ip);
99 if (err) {
100 kvfree(cq->queue->buf);
101 kfree(cq->queue);
102 return err;
105 if (udata)
106 cq->is_user = 1;
108 cq->is_dying = false;
110 tasklet_init(&cq->comp_task, rxe_send_complete, (unsigned long)cq);
112 spin_lock_init(&cq->cq_lock);
113 cq->ibcq.cqe = cqe;
114 return 0;
117 int rxe_cq_resize_queue(struct rxe_cq *cq, int cqe, struct ib_udata *udata)
119 int err;
121 err = rxe_queue_resize(cq->queue, (unsigned int *)&cqe,
122 sizeof(struct rxe_cqe),
123 cq->queue->ip ? cq->queue->ip->context : NULL,
124 udata, NULL, &cq->cq_lock);
125 if (!err)
126 cq->ibcq.cqe = cqe;
128 return err;
131 int rxe_cq_post(struct rxe_cq *cq, struct rxe_cqe *cqe, int solicited)
133 struct ib_event ev;
134 unsigned long flags;
136 spin_lock_irqsave(&cq->cq_lock, flags);
138 if (unlikely(queue_full(cq->queue))) {
139 spin_unlock_irqrestore(&cq->cq_lock, flags);
140 if (cq->ibcq.event_handler) {
141 ev.device = cq->ibcq.device;
142 ev.element.cq = &cq->ibcq;
143 ev.event = IB_EVENT_CQ_ERR;
144 cq->ibcq.event_handler(&ev, cq->ibcq.cq_context);
147 return -EBUSY;
150 memcpy(producer_addr(cq->queue), cqe, sizeof(*cqe));
152 /* make sure all changes to the CQ are written before we update the
153 * producer pointer
155 smp_wmb();
157 advance_producer(cq->queue);
158 spin_unlock_irqrestore(&cq->cq_lock, flags);
160 if ((cq->notify == IB_CQ_NEXT_COMP) ||
161 (cq->notify == IB_CQ_SOLICITED && solicited)) {
162 cq->notify = 0;
163 tasklet_schedule(&cq->comp_task);
166 return 0;
169 void rxe_cq_disable(struct rxe_cq *cq)
171 unsigned long flags;
173 spin_lock_irqsave(&cq->cq_lock, flags);
174 cq->is_dying = true;
175 spin_unlock_irqrestore(&cq->cq_lock, flags);
178 void rxe_cq_cleanup(struct rxe_pool_entry *arg)
180 struct rxe_cq *cq = container_of(arg, typeof(*cq), pelem);
182 if (cq->queue)
183 rxe_queue_cleanup(cq->queue);