Lines Matching defs:pbl

507 			  struct qedr_pbl_info *pbl_info, struct qedr_pbl *pbl)
513 		if (!pbl[i].va)
516 				  pbl[i].va, pbl[i].pa);
519 	kfree(pbl);
554 	/* Two-Layer PBLs, if we have more than one pbl we need to initialize
583 			DP_ERR(dev, "prepare pbl table: too many pages %d\n",
588 		/* calculate required pbl page size */
615 		 "prepare pbl table: num_pbes=%d, num_pbls=%d, pbl_size=%d\n",
622 			       struct qedr_pbl *pbl,
633 	/* If we have a two layered pbl, the first pbl points to the rest
634 	 * of the pbls and the first entry lays on the second pbl in the table
637 		pbl_tbl = &pbl[1];
639 		pbl_tbl = pbl;
662 		/* If the given pbl is full storing the pbes, move to next pbl.
729 	cq->latest_cqe = qed_chain_consume(&cq->pbl);
980 		rc = dev->ops->common->chain_alloc(dev->cdev, &cq->pbl,
985 		page_cnt = qed_chain_get_page_cnt(&cq->pbl);
986 		pbl_ptr = qed_chain_get_pbl_phys(&cq->pbl);
987 		cq->ibcq.cqe = cq->pbl.capacity;
1021 		cq->toggle_cqe = qed_chain_get_last_elem(&cq->pbl);
1025 		cq->cq_cons = qed_chain_get_cons_idx_u32(&cq->pbl);
1050 		dev->ops->common->chain_free(dev->cdev, &cq->pbl);
1079 	dev->ops->common->chain_free(dev->cdev, &cq->pbl);
1335 	qed_chain_reset(&qph->pbl);
1459 	dev->ops->common->chain_free(dev->cdev, &hw_srq->pbl);
1527 	rc = dev->ops->common->chain_alloc(dev->cdev, &hw_srq->pbl, &params);
1593 		struct qed_chain *pbl;
1599 		pbl = &hw_srq->pbl;
1600 		page_cnt = qed_chain_get_page_cnt(pbl);
1601 		pbl_base_addr = qed_chain_get_pbl_phys(pbl);
2047 	rc = dev->ops->common->chain_alloc(dev->cdev, &qp->sq.pbl, &params);
2051 	in_params->sq_num_pages = qed_chain_get_page_cnt(&qp->sq.pbl);
2052 	in_params->sq_pbl_ptr = qed_chain_get_pbl_phys(&qp->sq.pbl);
2058 	rc = dev->ops->common->chain_alloc(dev->cdev, &qp->rq.pbl, &params);
2062 	in_params->rq_num_pages = qed_chain_get_page_cnt(&qp->rq.pbl);
2063 	in_params->rq_pbl_ptr = qed_chain_get_pbl_phys(&qp->rq.pbl);
2113 	rc = dev->ops->common->chain_alloc(dev->cdev, &qp->sq.pbl, &params);
2123 	rc = dev->ops->common->chain_alloc(dev->cdev, &qp->rq.pbl, &params);
2140 	dev->ops->common->chain_free(dev->cdev, &qp->sq.pbl);
2143 	dev->ops->common->chain_free(dev->cdev, &qp->rq.pbl);
2896 	struct qedr_pbl *pbl, *tmp;
2905 	list_for_each_entry_safe(pbl, tmp, &info->free_pbl_list, list_entry) {
2906 		list_del(&pbl->list_entry);
2907 		qedr_free_pbl(dev, &info->pbl_info, pbl);
3187 		struct qedr_pbl *pbl;
3194 		pbl = list_first_entry(&info->inuse_pbl_list,
3196 		list_move_tail(&pbl->list_entry, &info->free_pbl_list);
3324 				wqe = (char *)qed_chain_produce(&qp->sq.pbl);
3382 		struct rdma_sq_sge *sge = qed_chain_produce(&qp->sq.pbl);
3445 	fwqe2 = (struct rdma_sq_fmr_wqe_2nd *)qed_chain_produce(&qp->sq.pbl);
3511 	pbl_is_full = qed_chain_get_elem_left_u32(&qp->sq.pbl) <
3564 	wqe = qed_chain_produce(&qp->sq.pbl);
3589 		swqe2 = qed_chain_produce(&qp->sq.pbl);
3604 		swqe2 = qed_chain_produce(&qp->sq.pbl);
3615 		swqe2 = qed_chain_produce(&qp->sq.pbl);
3637 		rwqe2 = qed_chain_produce(&qp->sq.pbl);
3650 		rwqe2 = qed_chain_produce(&qp->sq.pbl);
3667 		rwqe2 = qed_chain_produce(&qp->sq.pbl);
3681 		awqe2 = qed_chain_produce(&qp->sq.pbl);
3685 		awqe3 = qed_chain_produce(&qp->sq.pbl);
3744 		qed_chain_set_prod(&qp->sq.pbl, value, wqe);
3837 	struct qed_chain *pbl;
3845 	pbl = &srq->hw_srq.pbl;
3861 		hdr = qed_chain_produce(pbl);
3875 			struct rdma_srq_sge *srq_sge = qed_chain_produce(pbl);
3906 		 qed_chain_get_elem_left(pbl));
3928 		if (qed_chain_get_elem_left_u32(&qp->rq.pbl) <
3932 			       qed_chain_get_elem_left_u32(&qp->rq.pbl),
3942 			    qed_chain_produce(&qp->rq.pbl);
3965 			    qed_chain_produce(&qp->rq.pbl);
4040  * algorithm determining whether we can free a pbl or not.
4100 			qed_chain_consume(&qp->sq.pbl);
4327 		qed_chain_consume(&qp->rq.pbl);
4351 			qed_chain_consume(&qp->rq.pbl);
4431 	old_cons = qed_chain_get_cons_idx_u32(&cq->pbl);
4473 	new_cons = qed_chain_get_cons_idx_u32(&cq->pbl);