qp_list
struct list_head qp_list;
list_for_each_entry(pp, &pkey->qp_list, qp_list) {
INIT_LIST_HEAD(&pkey->qp_list);
list_add(&pp->qp_list, &pkey->qp_list);
list_del(&pp->qp_list);
struct list_head qp_list;
list_add_tail(&qp->list, &rdev->qp_list);
list_add_tail(&qp->list, &rdev->qp_list);
INIT_LIST_HEAD(&rdev->qp_list);
list_for_each_entry(qp, &rdev->qp_list, list) {
list_for_each_entry(qp, &rdev->qp_list, list) {
static void deref_qps(struct qp_list *qp_list)
for (idx = 0; idx < qp_list->idx; idx++)
c4iw_qp_rem_ref(&qp_list->qps[idx]->ibqp);
static void recover_lost_dbs(struct uld_ctx *ctx, struct qp_list *qp_list)
for (idx = 0; idx < qp_list->idx; idx++) {
struct c4iw_qp *qp = qp_list->qps[idx];
struct qp_list qp_list;
qp_list.qps = kzalloc_objs(*qp_list.qps, count, GFP_ATOMIC);
if (!qp_list.qps) {
qp_list.idx = 0;
qp_list.qps[qp_list.idx++] = qp;
recover_lost_dbs(ctx, &qp_list);
deref_qps(&qp_list);
kfree(qp_list.qps);
list_for_each_entry_rcu(p, &mcast->qp_list, list) {
struct list_head qp_list; /* list of all qps on this dev */
INIT_LIST_HEAD(&hr_dev->qp_list);
list_for_each_entry(hr_qp, &hr_dev->qp_list, node) {
list_add_tail(&hr_qp->node, &hr_dev->qp_list);
INIT_LIST_HEAD(&cntr->qp_list);
list_add_tail(&qp->qp_list_counter, &cntr->qp_list);
list_for_each_entry(qp, &cntr->qp_list, qp_list_counter) {
struct list_head qp_list;
INIT_LIST_HEAD(&ibdev->qp_list);
list_for_each_entry(mqp, &ibdev->qp_list, qps_list) {
struct list_head qp_list;
list_add_tail(&qp->qps_list, &dev->qp_list);
list_add_tail(&qp->qps_list, &dev->qp_list);
list_for_each_entry(mqp, &ibdev->qp_list, qps_list) {
INIT_LIST_HEAD(&dev->qp_list);
struct list_head qp_list;
list_add_tail(&qp->qps_list, &dev->qp_list);
list_add_tail(&qp->qps_list, &dev->qp_list);
list_add_tail(&qp->qps_list, &dev->qp_list);
list_add_tail(&qp->qps_list, &dev->qp_list);
list_for_each_entry_rcu(p, &tmcast->qp_list, list) {
list_add_tail_rcu(&mqp->list, &tmcast->qp_list);
list_add_tail_rcu(&mqp->list, &mcast->qp_list);
list_for_each_entry_safe(p, tmp, &mcast->qp_list, list) {
if (list_empty(&mcast->qp_list)) {
INIT_LIST_HEAD(&mcast->qp_list);
list_for_each_entry_safe(p, tmp, &mcast->qp_list, list)
INIT_LIST_HEAD(&mcg->qp_list);
list_add_tail(&mca->qp_list, &mcg->qp_list);
list_for_each_entry(mca, &mcg->qp_list, qp_list) {
list_for_each_entry(tmp, &mcg->qp_list, qp_list) {
list_del(&mca->qp_list);
list_for_each_entry_safe(mca, tmp, &mcg->qp_list, qp_list) {
list_for_each_entry(mca, &mcg->qp_list, qp_list) {
if (mca->qp_list.next != &mcg->qp_list) {
struct list_head qp_list;
struct list_head qp_list;
struct list_head qp_list;
INIT_LIST_HEAD(&sdev->qp_list);
list_add_tail(&qp->devq, &sdev->qp_list);
static void qp_list_add_entry(struct qp_list *qp_list, struct qp_entry *entry)
list_add(&entry->list_item, &qp_list->head);
static void qp_list_remove_entry(struct qp_list *qp_list,
static struct qp_entry *qp_list_get_head(struct qp_list *qp_list)
if (!list_empty(&qp_list->head)) {
list_first_entry(&qp_list->head, struct qp_entry,
static struct qp_list qp_broker_list = {
static struct qp_list qp_guest_endpoints = {
static struct qp_entry *qp_list_find(struct qp_list *qp_list,
list_for_each_entry(entry, &qp_list->head, list_item) {
struct list_head *qp_list =
list_for_each_entry_safe(qp, tmp, qp_list, com.list) {
struct list_head *qp_list =
list_for_each_entry_safe(qp, tmp, qp_list, com.list) {
struct list_head qp_list;
if (list_empty(&vha->qp_list))
if (list_empty(&vha->qp_list)) {
list_add_tail(&qpair->qp_list_elem, &vha->qp_list);
list_for_each_entry_safe(qpair, tqpair, &vha->qp_list,
INIT_LIST_HEAD(&vha->qp_list);
list_for_each_entry(qpair, &base_vha->qp_list,
list_for_each_entry(qpair, &base_vha->qp_list, qp_list_elem)
list_for_each_entry(qpair, &base_vha->qp_list, qp_list_elem)
list_for_each_entry(qpair, &base_vha->qp_list, qp_list_elem)
list_for_each_entry(qpair, &base_vha->qp_list, qp_list_elem)
list_for_each_entry(qp, &base_vha->qp_list,
struct list_head qp_list;
struct list_head qp_list;