1 // SPDX-License-Identifier: GPL-2.0 OR Linux-OpenIB 2 /* 3 * Copyright (c) 2016 Mellanox Technologies Ltd. All rights reserved. 4 * Copyright (c) 2015 System Fabric Works, Inc. All rights reserved. 5 */ 6 #include <linux/vmalloc.h> 7 #include "rxe.h" 8 #include "rxe_loc.h" 9 #include "rxe_queue.h" 10 11 int rxe_cq_chk_attr(struct rxe_dev *rxe, struct rxe_cq *cq, 12 int cqe, int comp_vector) 13 { 14 int count; 15 16 if (cqe <= 0) { 17 pr_warn("cqe(%d) <= 0\n", cqe); 18 goto err1; 19 } 20 21 if (cqe > rxe->attr.max_cqe) { 22 pr_warn("cqe(%d) > max_cqe(%d)\n", 23 cqe, rxe->attr.max_cqe); 24 goto err1; 25 } 26 27 if (cq) { 28 count = queue_count(cq->queue, QUEUE_TYPE_TO_CLIENT); 29 if (cqe < count) { 30 pr_warn("cqe(%d) < current # elements in queue (%d)", 31 cqe, count); 32 goto err1; 33 } 34 } 35 36 return 0; 37 38 err1: 39 return -EINVAL; 40 } 41 42 static void rxe_send_complete(struct tasklet_struct *t) 43 { 44 struct rxe_cq *cq = from_tasklet(cq, t, comp_task); 45 46 spin_lock_bh(&cq->cq_lock); 47 if (cq->is_dying) { 48 spin_unlock_bh(&cq->cq_lock); 49 return; 50 } 51 spin_unlock_bh(&cq->cq_lock); 52 53 cq->ibcq.comp_handler(&cq->ibcq, cq->ibcq.cq_context); 54 } 55 56 int rxe_cq_from_init(struct rxe_dev *rxe, struct rxe_cq *cq, int cqe, 57 int comp_vector, struct ib_udata *udata, 58 struct rxe_create_cq_resp __user *uresp) 59 { 60 int err; 61 enum queue_type type; 62 63 type = QUEUE_TYPE_TO_CLIENT; 64 cq->queue = rxe_queue_init(rxe, &cqe, 65 sizeof(struct rxe_cqe), type); 66 if (!cq->queue) { 67 pr_warn("unable to create cq\n"); 68 return -ENOMEM; 69 } 70 71 err = do_mmap_info(rxe, uresp ? &uresp->mi : NULL, udata, 72 cq->queue->buf, cq->queue->buf_size, &cq->queue->ip); 73 if (err) { 74 vfree(cq->queue->buf); 75 kfree(cq->queue); 76 return err; 77 } 78 79 cq->is_user = uresp; 80 81 cq->is_dying = false; 82 83 tasklet_setup(&cq->comp_task, rxe_send_complete); 84 85 spin_lock_init(&cq->cq_lock); 86 cq->ibcq.cqe = cqe; 87 return 0; 88 } 89 90 int rxe_cq_resize_queue(struct rxe_cq *cq, int cqe, 91 struct rxe_resize_cq_resp __user *uresp, 92 struct ib_udata *udata) 93 { 94 int err; 95 96 err = rxe_queue_resize(cq->queue, (unsigned int *)&cqe, 97 sizeof(struct rxe_cqe), udata, 98 uresp ? &uresp->mi : NULL, NULL, &cq->cq_lock); 99 if (!err) 100 cq->ibcq.cqe = cqe; 101 102 return err; 103 } 104 105 int rxe_cq_post(struct rxe_cq *cq, struct rxe_cqe *cqe, int solicited) 106 { 107 struct ib_event ev; 108 int full; 109 void *addr; 110 111 spin_lock_bh(&cq->cq_lock); 112 113 full = queue_full(cq->queue, QUEUE_TYPE_TO_CLIENT); 114 if (unlikely(full)) { 115 spin_unlock_bh(&cq->cq_lock); 116 if (cq->ibcq.event_handler) { 117 ev.device = cq->ibcq.device; 118 ev.element.cq = &cq->ibcq; 119 ev.event = IB_EVENT_CQ_ERR; 120 cq->ibcq.event_handler(&ev, cq->ibcq.cq_context); 121 } 122 123 return -EBUSY; 124 } 125 126 addr = queue_producer_addr(cq->queue, QUEUE_TYPE_TO_CLIENT); 127 memcpy(addr, cqe, sizeof(*cqe)); 128 129 queue_advance_producer(cq->queue, QUEUE_TYPE_TO_CLIENT); 130 131 spin_unlock_bh(&cq->cq_lock); 132 133 if ((cq->notify == IB_CQ_NEXT_COMP) || 134 (cq->notify == IB_CQ_SOLICITED && solicited)) { 135 cq->notify = 0; 136 tasklet_schedule(&cq->comp_task); 137 } 138 139 return 0; 140 } 141 142 void rxe_cq_disable(struct rxe_cq *cq) 143 { 144 spin_lock_bh(&cq->cq_lock); 145 cq->is_dying = true; 146 spin_unlock_bh(&cq->cq_lock); 147 } 148 149 void rxe_cq_cleanup(struct rxe_pool_elem *elem) 150 { 151 struct rxe_cq *cq = container_of(elem, typeof(*cq), elem); 152 153 if (cq->queue) 154 rxe_queue_cleanup(cq->queue); 155 } 156