Lines Matching defs:dqp
157 struct mlx4_promisc_qp *dqp = NULL;
178 dqp = kmalloc(sizeof(*dqp), GFP_KERNEL);
179 if (!dqp) {
183 dqp->qpn = qpn;
184 list_add_tail(&dqp->list, &new_entry->duplicates);
229 if (dqp) {
230 list_del(&dqp->list);
231 kfree(dqp);
246 struct mlx4_promisc_qp *dqp;
271 list_for_each_entry(dqp, &entry->duplicates, list) {
272 if (qpn == dqp->qpn)
277 dqp = kmalloc(sizeof(*dqp), GFP_KERNEL);
278 if (!dqp)
280 dqp->qpn = qpn;
281 list_add_tail(&dqp->list, &entry->duplicates);
294 struct mlx4_promisc_qp *dqp, *tmp_dqp;
317 list_for_each_entry_safe(dqp, tmp_dqp, &entry->duplicates, list) {
318 if (dqp->qpn == qpn) {
319 list_del(&dqp->list);
320 kfree(dqp);
426 struct mlx4_promisc_qp *dqp;
482 dqp = kmalloc(sizeof(*dqp), GFP_KERNEL);
483 if (!dqp) {
487 dqp->qpn = qpn;
488 list_add_tail(&dqp->list,
519 list_for_each_entry(dqp, &s_steer->promisc_qps[steer], list) {
525 mgm->qp[members_count++] = cpu_to_be32(dqp->qpn & MGM_QPN_MASK);
557 struct mlx4_promisc_qp *dqp;
590 list_for_each_entry(dqp, &s_steer->promisc_qps[steer], list)
591 mgm->qp[members_count++] = cpu_to_be32(dqp->qpn & MGM_QPN_MASK);
604 list_for_each_entry(dqp, &entry->duplicates, list) {
605 if (dqp->qpn == qpn) {
614 list_del(&dqp->list);
615 kfree(dqp);