Lines Matching refs:mcg
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
14 * for the mcg when a multicast packet is received and when another
16 * is detached from the mcg. Each time a qp is attached to an mcg an
18 * of qp's that are attached to the mcg. The qp_list is used to replicate
57 * __rxe_insert_mcg - insert an mcg into red-black tree (rxe->mcg_tree)
58 * @mcg: mcg object with an embedded red-black tree node
60 * Context: caller must hold a reference to mcg and rxe->mcg_lock and
61 * is responsible to avoid adding the same mcg twice to the tree.
63 static void __rxe_insert_mcg(struct rxe_mcg *mcg)
65 struct rb_root *tree = &mcg->rxe->mcg_tree;
75 cmp = memcmp(&tmp->mgid, &mcg->mgid, sizeof(mcg->mgid));
82 rb_link_node(&mcg->node, node, link);
83 rb_insert_color(&mcg->node, tree);
87 * __rxe_remove_mcg - remove an mcg from red-black tree holding lock
88 * @mcg: mcast group object with an embedded red-black tree node
90 * Context: caller must hold a reference to mcg and rxe->mcg_lock
92 static void __rxe_remove_mcg(struct rxe_mcg *mcg)
94 rb_erase(&mcg->node, &mcg->rxe->mcg_tree);
98 * __rxe_lookup_mcg - lookup mcg in rxe->mcg_tree while holding lock
103 * Returns: mcg on success and takes a ref to mcg else NULL
109 struct rxe_mcg *mcg;
116 mcg = rb_entry(node, struct rxe_mcg, node);
118 cmp = memcmp(&mcg->mgid, mgid, sizeof(*mgid));
129 kref_get(&mcg->ref_cnt);
130 return mcg;
137 * rxe_lookup_mcg - lookup up mcg in red-back tree
141 * Returns: mcg if found else NULL
145 struct rxe_mcg *mcg;
148 mcg = __rxe_lookup_mcg(rxe, mgid);
151 return mcg;
155 * __rxe_init_mcg - initialize a new mcg
158 * @mcg: new mcg object
160 * Context: caller should hold rxe->mcg lock
163 struct rxe_mcg *mcg)
165 kref_init(&mcg->ref_cnt);
166 memcpy(&mcg->mgid, mgid, sizeof(mcg->mgid));
167 INIT_LIST_HEAD(&mcg->qp_list);
168 mcg->rxe = rxe;
170 /* caller holds a ref on mcg but that will be
171 * dropped when mcg goes out of scope. We need to take a ref
173 * by __rxe_insert_mcg and used to lookup mcg from mgid later.
174 * Inserting mcg makes it visible to outside so this should
177 kref_get(&mcg->ref_cnt);
178 __rxe_insert_mcg(mcg);
182 * rxe_get_mcg - lookup or allocate a mcg
186 * Returns: mcg on success else ERR_PTR(error)
190 struct rxe_mcg *mcg, *tmp;
196 /* check to see if mcg already exists */
197 mcg = rxe_lookup_mcg(rxe, mgid);
198 if (mcg)
199 return mcg;
207 /* speculative alloc of new mcg */
208 mcg = kzalloc(sizeof(*mcg), GFP_KERNEL);
209 if (!mcg) {
220 kfree(mcg);
224 __rxe_init_mcg(rxe, mgid, mcg);
230 return mcg;
232 kfree(mcg);
239 * rxe_cleanup_mcg - cleanup mcg for kref_put
240 * @kref: struct kref embnedded in mcg
244 struct rxe_mcg *mcg = container_of(kref, typeof(*mcg), ref_cnt);
246 kfree(mcg);
250 * __rxe_destroy_mcg - destroy mcg object holding rxe->mcg_lock
251 * @mcg: the mcg object
254 * no qp's are attached to mcg
256 static void __rxe_destroy_mcg(struct rxe_mcg *mcg)
258 struct rxe_dev *rxe = mcg->rxe;
260 /* remove mcg from red-black tree then drop ref */
261 __rxe_remove_mcg(mcg);
262 kref_put(&mcg->ref_cnt, rxe_cleanup_mcg);
268 * rxe_destroy_mcg - destroy mcg object
269 * @mcg: the mcg object
271 * Context: no qp's are attached to mcg
273 static void rxe_destroy_mcg(struct rxe_mcg *mcg)
276 rxe_mcast_del(mcg->rxe, &mcg->mgid);
278 spin_lock_bh(&mcg->rxe->mcg_lock);
279 __rxe_destroy_mcg(mcg);
280 spin_unlock_bh(&mcg->rxe->mcg_lock);
286 * @mcg: mcg object
289 * Context: caller must hold references on qp and mcg, rxe->mcg_lock
294 static int __rxe_init_mca(struct rxe_qp *qp, struct rxe_mcg *mcg,
306 n = atomic_inc_return(&mcg->qp_num);
308 atomic_dec(&mcg->qp_num);
318 list_add_tail(&mca->qp_list, &mcg->qp_list);
324 * rxe_attach_mcg - attach qp to mcg if not already attached
326 * @mcg: mcg object
328 * Context: caller must hold reference on qp and mcg.
331 static int rxe_attach_mcg(struct rxe_mcg *mcg, struct rxe_qp *qp)
333 struct rxe_dev *rxe = mcg->rxe;
339 list_for_each_entry(mca, &mcg->qp_list, qp_list) {
354 list_for_each_entry(tmp, &mcg->qp_list, qp_list) {
362 err = __rxe_init_mca(qp, mcg, mca);
373 * @mcg: mcg object
375 * Context: caller must hold a reference to mcg and rxe->mcg_lock
377 static void __rxe_cleanup_mca(struct rxe_mca *mca, struct rxe_mcg *mcg)
381 atomic_dec(&mcg->qp_num);
382 atomic_dec(&mcg->rxe->mcg_attach);
390 * rxe_detach_mcg - detach qp from mcg
391 * @mcg: mcg object
396 static int rxe_detach_mcg(struct rxe_mcg *mcg, struct rxe_qp *qp)
398 struct rxe_dev *rxe = mcg->rxe;
402 list_for_each_entry_safe(mca, tmp, &mcg->qp_list, qp_list) {
404 __rxe_cleanup_mca(mca, mcg);
412 if (atomic_read(&mcg->qp_num) <= 0)
413 __rxe_destroy_mcg(mcg);
438 struct rxe_mcg *mcg;
440 /* takes a ref on mcg if successful */
441 mcg = rxe_get_mcg(rxe, mgid);
442 if (IS_ERR(mcg))
443 return PTR_ERR(mcg);
445 err = rxe_attach_mcg(mcg, qp);
447 /* if we failed to attach the first qp to mcg tear it down */
448 if (atomic_read(&mcg->qp_num) == 0)
449 rxe_destroy_mcg(mcg);
451 kref_put(&mcg->ref_cnt, rxe_cleanup_mcg);
468 struct rxe_mcg *mcg;
471 mcg = rxe_lookup_mcg(rxe, mgid);
472 if (!mcg)
475 err = rxe_detach_mcg(mcg, qp);
476 kref_put(&mcg->ref_cnt, rxe_cleanup_mcg);