1 // SPDX-License-Identifier: GPL-2.0 OR Linux-OpenIB
2 /*
3 * Copyright (c) 2022 Hewlett Packard Enterprise, Inc. All rights reserved.
4 * Copyright (c) 2016 Mellanox Technologies Ltd. All rights reserved.
5 * Copyright (c) 2015 System Fabric Works, Inc. All rights reserved.
6 */
7
8 /*
9 * rxe_mcast.c implements driver support for multicast transport.
10 * It is based on two data structures struct rxe_mcg ('mcg') and
11 * struct rxe_mca ('mca'). An mcg is allocated each time a qp is
12 * attached to a new mgid for the first time. These are indexed by
13 * a red-black tree using the mgid. This data structure is searched
14 * for the mcg when a multicast packet is received and when another
15 * qp is attached to the same mgid. It is cleaned up when the last qp
16 * is detached from the mcg. Each time a qp is attached to an mcg an
17 * mca is created. It holds a pointer to the qp and is added to a list
18 * of qp's that are attached to the mcg. The qp_list is used to replicate
19 * mcast packets in the rxe receive path.
20 */
21
22 #include "rxe.h"
23
24 /**
25 * rxe_mcast_add - add multicast address to rxe device
26 * @rxe: rxe device object
27 * @mgid: multicast address as a gid
28 *
29 * Returns 0 on success else an error
30 */
rxe_mcast_add(struct rxe_dev * rxe,union ib_gid * mgid)31 static int rxe_mcast_add(struct rxe_dev *rxe, union ib_gid *mgid)
32 {
33 unsigned char ll_addr[ETH_ALEN];
34 struct net_device *ndev;
35 int ret;
36
37 ndev = ib_device_get_netdev(&rxe->ib_dev, 1);
38 if (!ndev)
39 return -ENODEV;
40
41 ipv6_eth_mc_map((struct in6_addr *)mgid->raw, ll_addr);
42
43 ret = dev_mc_add(ndev, ll_addr);
44 dev_put(ndev);
45
46 return ret;
47 }
48
49 /**
50 * rxe_mcast_del - delete multicast address from rxe device
51 * @rxe: rxe device object
52 * @mgid: multicast address as a gid
53 *
54 * Returns 0 on success else an error
55 */
rxe_mcast_del(struct rxe_dev * rxe,union ib_gid * mgid)56 static int rxe_mcast_del(struct rxe_dev *rxe, union ib_gid *mgid)
57 {
58 unsigned char ll_addr[ETH_ALEN];
59 struct net_device *ndev;
60 int ret;
61
62 ndev = ib_device_get_netdev(&rxe->ib_dev, 1);
63 if (!ndev)
64 return -ENODEV;
65
66 ipv6_eth_mc_map((struct in6_addr *)mgid->raw, ll_addr);
67
68 ret = dev_mc_del(ndev, ll_addr);
69 dev_put(ndev);
70
71 return ret;
72 }
73
74 /**
75 * __rxe_insert_mcg - insert an mcg into red-black tree (rxe->mcg_tree)
76 * @mcg: mcg object with an embedded red-black tree node
77 *
78 * Context: caller must hold a reference to mcg and rxe->mcg_lock and
79 * is responsible to avoid adding the same mcg twice to the tree.
80 */
__rxe_insert_mcg(struct rxe_mcg * mcg)81 static void __rxe_insert_mcg(struct rxe_mcg *mcg)
82 {
83 struct rb_root *tree = &mcg->rxe->mcg_tree;
84 struct rb_node **link = &tree->rb_node;
85 struct rb_node *node = NULL;
86 struct rxe_mcg *tmp;
87 int cmp;
88
89 while (*link) {
90 node = *link;
91 tmp = rb_entry(node, struct rxe_mcg, node);
92
93 cmp = memcmp(&tmp->mgid, &mcg->mgid, sizeof(mcg->mgid));
94 if (cmp > 0)
95 link = &(*link)->rb_left;
96 else
97 link = &(*link)->rb_right;
98 }
99
100 rb_link_node(&mcg->node, node, link);
101 rb_insert_color(&mcg->node, tree);
102 }
103
104 /**
105 * __rxe_remove_mcg - remove an mcg from red-black tree holding lock
106 * @mcg: mcast group object with an embedded red-black tree node
107 *
108 * Context: caller must hold a reference to mcg and rxe->mcg_lock
109 */
__rxe_remove_mcg(struct rxe_mcg * mcg)110 static void __rxe_remove_mcg(struct rxe_mcg *mcg)
111 {
112 rb_erase(&mcg->node, &mcg->rxe->mcg_tree);
113 }
114
115 /**
116 * __rxe_lookup_mcg - lookup mcg in rxe->mcg_tree while holding lock
117 * @rxe: rxe device object
118 * @mgid: multicast IP address
119 *
120 * Context: caller must hold rxe->mcg_lock
121 * Returns: mcg on success and takes a ref to mcg else NULL
122 */
__rxe_lookup_mcg(struct rxe_dev * rxe,union ib_gid * mgid)123 static struct rxe_mcg *__rxe_lookup_mcg(struct rxe_dev *rxe,
124 union ib_gid *mgid)
125 {
126 struct rb_root *tree = &rxe->mcg_tree;
127 struct rxe_mcg *mcg;
128 struct rb_node *node;
129 int cmp;
130
131 node = tree->rb_node;
132
133 while (node) {
134 mcg = rb_entry(node, struct rxe_mcg, node);
135
136 cmp = memcmp(&mcg->mgid, mgid, sizeof(*mgid));
137
138 if (cmp > 0)
139 node = node->rb_left;
140 else if (cmp < 0)
141 node = node->rb_right;
142 else
143 break;
144 }
145
146 if (node) {
147 kref_get(&mcg->ref_cnt);
148 return mcg;
149 }
150
151 return NULL;
152 }
153
154 /**
155 * rxe_lookup_mcg - lookup up mcg in red-back tree
156 * @rxe: rxe device object
157 * @mgid: multicast IP address
158 *
159 * Returns: mcg if found else NULL
160 */
rxe_lookup_mcg(struct rxe_dev * rxe,union ib_gid * mgid)161 struct rxe_mcg *rxe_lookup_mcg(struct rxe_dev *rxe, union ib_gid *mgid)
162 {
163 struct rxe_mcg *mcg;
164
165 spin_lock_bh(&rxe->mcg_lock);
166 mcg = __rxe_lookup_mcg(rxe, mgid);
167 spin_unlock_bh(&rxe->mcg_lock);
168
169 return mcg;
170 }
171
172 /**
173 * __rxe_init_mcg - initialize a new mcg
174 * @rxe: rxe device
175 * @mgid: multicast address as a gid
176 * @mcg: new mcg object
177 *
178 * Initializes the mcg fields. The mcg is private and not yet visible in
179 * mcg_tree, so this may run without rxe->mcg_lock; __rxe_publish_mcg()
180 * makes it visible under the lock once it is ready.
181 */
__rxe_init_mcg(struct rxe_dev * rxe,union ib_gid * mgid,struct rxe_mcg * mcg)182 static void __rxe_init_mcg(struct rxe_dev *rxe, union ib_gid *mgid,
183 struct rxe_mcg *mcg)
184 {
185 kref_init(&mcg->ref_cnt);
186 memcpy(&mcg->mgid, mgid, sizeof(mcg->mgid));
187 INIT_LIST_HEAD(&mcg->qp_list);
188 mcg->rxe = rxe;
189 }
190
191 /**
192 * __rxe_publish_mcg - make a fully initialized mcg visible in mcg_tree
193 * @mcg: the mcg object
194 *
195 * Context: caller must hold rxe->mcg_lock and a reference on mcg
196 */
__rxe_publish_mcg(struct rxe_mcg * mcg)197 static void __rxe_publish_mcg(struct rxe_mcg *mcg)
198 {
199 /* caller holds a ref on mcg but that will be dropped when mcg goes
200 * out of scope. We need to take a ref on the pointer that will be
201 * saved in the red-black tree by __rxe_insert_mcg and used to lookup
202 * mcg from mgid later. Inserting mcg makes it visible to outside so
203 * this is done last after the object is ready and the multicast
204 * address has been programmed.
205 */
206 kref_get(&mcg->ref_cnt);
207 __rxe_insert_mcg(mcg);
208 }
209
210 /**
211 * rxe_get_mcg - lookup or allocate a mcg
212 * @rxe: rxe device object
213 * @mgid: multicast IP address as a gid
214 *
215 * Returns: mcg on success else ERR_PTR(error)
216 */
rxe_get_mcg(struct rxe_dev * rxe,union ib_gid * mgid)217 static struct rxe_mcg *rxe_get_mcg(struct rxe_dev *rxe, union ib_gid *mgid)
218 {
219 struct rxe_mcg *mcg, *tmp;
220 int err;
221
222 if (rxe->attr.max_mcast_grp == 0)
223 return ERR_PTR(-EINVAL);
224
225 /* check to see if mcg already exists */
226 mcg = rxe_lookup_mcg(rxe, mgid);
227 if (mcg)
228 return mcg;
229
230 /* check to see if we have reached limit */
231 if (atomic_inc_return(&rxe->mcg_num) > rxe->attr.max_mcast_grp) {
232 err = -ENOMEM;
233 goto err_dec;
234 }
235
236 /* speculative alloc of new mcg */
237 mcg = kzalloc_obj(*mcg);
238 if (!mcg) {
239 err = -ENOMEM;
240 goto err_dec;
241 }
242 __rxe_init_mcg(rxe, mgid, mcg);
243
244 /* program the multicast address while mcg is still private, before
245 * it is inserted into mcg_tree. dev_mc_add() may sleep so this must
246 * run outside mcg_lock. On failure mcg was never published, so a
247 * plain free is correct and the tree is untouched.
248 */
249 err = rxe_mcast_add(rxe, mgid);
250 if (err) {
251 kfree(mcg);
252 goto err_dec;
253 }
254
255 spin_lock_bh(&rxe->mcg_lock);
256 /* re-check to see if someone else just added it while we were adding
257 * the multicast address; if so use theirs and drop ours
258 */
259 tmp = __rxe_lookup_mcg(rxe, mgid);
260 if (tmp) {
261 spin_unlock_bh(&rxe->mcg_lock);
262 rxe_mcast_del(rxe, mgid);
263 atomic_dec(&rxe->mcg_num);
264 kfree(mcg);
265 return tmp;
266 }
267
268 __rxe_publish_mcg(mcg);
269 spin_unlock_bh(&rxe->mcg_lock);
270
271 return mcg;
272
273 err_dec:
274 atomic_dec(&rxe->mcg_num);
275 return ERR_PTR(err);
276 }
277
278 /**
279 * rxe_cleanup_mcg - cleanup mcg for kref_put
280 * @kref: struct kref embnedded in mcg
281 */
rxe_cleanup_mcg(struct kref * kref)282 void rxe_cleanup_mcg(struct kref *kref)
283 {
284 struct rxe_mcg *mcg = container_of(kref, typeof(*mcg), ref_cnt);
285
286 kfree(mcg);
287 }
288
289 /**
290 * __rxe_destroy_mcg - destroy mcg object holding rxe->mcg_lock
291 * @mcg: the mcg object
292 *
293 * Context: caller is holding rxe->mcg_lock
294 * no qp's are attached to mcg
295 */
__rxe_destroy_mcg(struct rxe_mcg * mcg)296 static void __rxe_destroy_mcg(struct rxe_mcg *mcg)
297 {
298 struct rxe_dev *rxe = mcg->rxe;
299
300 /* remove mcg from red-black tree then drop ref */
301 __rxe_remove_mcg(mcg);
302 kref_put(&mcg->ref_cnt, rxe_cleanup_mcg);
303
304 atomic_dec(&rxe->mcg_num);
305 }
306
307 /**
308 * rxe_destroy_mcg - destroy mcg object
309 * @mcg: the mcg object
310 *
311 * Context: no qp's are attached to mcg
312 */
rxe_destroy_mcg(struct rxe_mcg * mcg)313 static void rxe_destroy_mcg(struct rxe_mcg *mcg)
314 {
315 /* delete mcast address outside of lock */
316 rxe_mcast_del(mcg->rxe, &mcg->mgid);
317
318 spin_lock_bh(&mcg->rxe->mcg_lock);
319 __rxe_destroy_mcg(mcg);
320 spin_unlock_bh(&mcg->rxe->mcg_lock);
321 }
322
323 /**
324 * __rxe_init_mca - initialize a new mca holding lock
325 * @qp: qp object
326 * @mcg: mcg object
327 * @mca: empty space for new mca
328 *
329 * Context: caller must hold references on qp and mcg, rxe->mcg_lock
330 * and pass memory for new mca
331 *
332 * Returns: 0 on success else an error
333 */
__rxe_init_mca(struct rxe_qp * qp,struct rxe_mcg * mcg,struct rxe_mca * mca)334 static int __rxe_init_mca(struct rxe_qp *qp, struct rxe_mcg *mcg,
335 struct rxe_mca *mca)
336 {
337 struct rxe_dev *rxe = to_rdev(qp->ibqp.device);
338 int n;
339
340 n = atomic_inc_return(&rxe->mcg_attach);
341 if (n > rxe->attr.max_total_mcast_qp_attach) {
342 atomic_dec(&rxe->mcg_attach);
343 return -ENOMEM;
344 }
345
346 n = atomic_inc_return(&mcg->qp_num);
347 if (n > rxe->attr.max_mcast_qp_attach) {
348 atomic_dec(&mcg->qp_num);
349 atomic_dec(&rxe->mcg_attach);
350 return -ENOMEM;
351 }
352
353 atomic_inc(&qp->mcg_num);
354
355 rxe_get(qp);
356 mca->qp = qp;
357
358 list_add_tail(&mca->qp_list, &mcg->qp_list);
359
360 return 0;
361 }
362
363 /**
364 * rxe_attach_mcg - attach qp to mcg if not already attached
365 * @qp: qp object
366 * @mcg: mcg object
367 *
368 * Context: caller must hold reference on qp and mcg.
369 * Returns: 0 on success else an error
370 */
rxe_attach_mcg(struct rxe_mcg * mcg,struct rxe_qp * qp)371 static int rxe_attach_mcg(struct rxe_mcg *mcg, struct rxe_qp *qp)
372 {
373 struct rxe_dev *rxe = mcg->rxe;
374 struct rxe_mca *mca, *tmp;
375 int err;
376
377 /* check to see if the qp is already a member of the group */
378 spin_lock_bh(&rxe->mcg_lock);
379 list_for_each_entry(mca, &mcg->qp_list, qp_list) {
380 if (mca->qp == qp) {
381 spin_unlock_bh(&rxe->mcg_lock);
382 return 0;
383 }
384 }
385 spin_unlock_bh(&rxe->mcg_lock);
386
387 /* speculative alloc new mca without using GFP_ATOMIC */
388 mca = kzalloc_obj(*mca);
389 if (!mca)
390 return -ENOMEM;
391
392 spin_lock_bh(&rxe->mcg_lock);
393 /* re-check to see if someone else just attached qp */
394 list_for_each_entry(tmp, &mcg->qp_list, qp_list) {
395 if (tmp->qp == qp) {
396 kfree(mca);
397 err = 0;
398 goto out;
399 }
400 }
401
402 err = __rxe_init_mca(qp, mcg, mca);
403 if (err)
404 kfree(mca);
405 out:
406 spin_unlock_bh(&rxe->mcg_lock);
407 return err;
408 }
409
410 /**
411 * __rxe_cleanup_mca - cleanup mca object holding lock
412 * @mca: mca object
413 * @mcg: mcg object
414 *
415 * Context: caller must hold a reference to mcg and rxe->mcg_lock
416 */
__rxe_cleanup_mca(struct rxe_mca * mca,struct rxe_mcg * mcg)417 static void __rxe_cleanup_mca(struct rxe_mca *mca, struct rxe_mcg *mcg)
418 {
419 list_del(&mca->qp_list);
420
421 atomic_dec(&mcg->qp_num);
422 atomic_dec(&mcg->rxe->mcg_attach);
423 atomic_dec(&mca->qp->mcg_num);
424 rxe_put(mca->qp);
425
426 kfree(mca);
427 }
428
429 /**
430 * rxe_detach_mcg - detach qp from mcg
431 * @mcg: mcg object
432 * @qp: qp object
433 *
434 * Returns: 0 on success else an error if qp is not attached.
435 */
rxe_detach_mcg(struct rxe_mcg * mcg,struct rxe_qp * qp)436 static int rxe_detach_mcg(struct rxe_mcg *mcg, struct rxe_qp *qp)
437 {
438 struct rxe_dev *rxe = mcg->rxe;
439 struct rxe_mca *mca, *tmp;
440
441 spin_lock_bh(&rxe->mcg_lock);
442 list_for_each_entry_safe(mca, tmp, &mcg->qp_list, qp_list) {
443 if (mca->qp == qp) {
444 __rxe_cleanup_mca(mca, mcg);
445
446 /* if the number of qp's attached to the
447 * mcast group falls to zero go ahead and
448 * tear it down. This will not free the
449 * object since we are still holding a ref
450 * from the caller
451 */
452 if (atomic_read(&mcg->qp_num) <= 0)
453 __rxe_destroy_mcg(mcg);
454
455 spin_unlock_bh(&rxe->mcg_lock);
456 return 0;
457 }
458 }
459
460 /* we didn't find the qp on the list */
461 spin_unlock_bh(&rxe->mcg_lock);
462 return -EINVAL;
463 }
464
465 /**
466 * rxe_attach_mcast - attach qp to multicast group (see IBA-11.3.1)
467 * @ibqp: (IB) qp object
468 * @mgid: multicast IP address
469 * @mlid: multicast LID, ignored for RoCEv2 (see IBA-A17.5.6)
470 *
471 * Returns: 0 on success else an errno
472 */
rxe_attach_mcast(struct ib_qp * ibqp,union ib_gid * mgid,u16 mlid)473 int rxe_attach_mcast(struct ib_qp *ibqp, union ib_gid *mgid, u16 mlid)
474 {
475 int err;
476 struct rxe_dev *rxe = to_rdev(ibqp->device);
477 struct rxe_qp *qp = to_rqp(ibqp);
478 struct rxe_mcg *mcg;
479
480 /* takes a ref on mcg if successful */
481 mcg = rxe_get_mcg(rxe, mgid);
482 if (IS_ERR(mcg))
483 return PTR_ERR(mcg);
484
485 err = rxe_attach_mcg(mcg, qp);
486
487 /* if we failed to attach the first qp to mcg tear it down */
488 if (atomic_read(&mcg->qp_num) == 0)
489 rxe_destroy_mcg(mcg);
490
491 kref_put(&mcg->ref_cnt, rxe_cleanup_mcg);
492
493 return err;
494 }
495
496 /**
497 * rxe_detach_mcast - detach qp from multicast group (see IBA-11.3.2)
498 * @ibqp: address of (IB) qp object
499 * @mgid: multicast IP address
500 * @mlid: multicast LID, ignored for RoCEv2 (see IBA-A17.5.6)
501 *
502 * Returns: 0 on success else an errno
503 */
rxe_detach_mcast(struct ib_qp * ibqp,union ib_gid * mgid,u16 mlid)504 int rxe_detach_mcast(struct ib_qp *ibqp, union ib_gid *mgid, u16 mlid)
505 {
506 struct rxe_dev *rxe = to_rdev(ibqp->device);
507 struct rxe_qp *qp = to_rqp(ibqp);
508 struct rxe_mcg *mcg;
509 int err;
510
511 mcg = rxe_lookup_mcg(rxe, mgid);
512 if (!mcg)
513 return -EINVAL;
514
515 err = rxe_detach_mcg(mcg, qp);
516 kref_put(&mcg->ref_cnt, rxe_cleanup_mcg);
517
518 return err;
519 }
520