scsi/bfa/bfa_svc.c

5332 	struct bfa_uf_s   *uf = cbarg;
5333 	struct bfa_uf_mod_s *ufm = BFA_UF_MOD(uf->bfa);
5336 		ufm->ufrecv(ufm->cbarg, uf);
5371 	struct bfa_uf_s   *uf;
5381 	for (i = 0, uf = ufm->uf_list; i < ufm->num_ufs; i++, uf++) {
5382 		memset(uf, 0, sizeof(struct bfa_uf_s));
5383 		uf->bfa = ufm->bfa;
5384 		uf->uf_tag = i;
5385 		uf->pb_len = BFA_PER_UF_DMA_SZ;
5386 		uf->buf_kva = bfa_mem_get_dmabuf_kva(ufm, i, BFA_PER_UF_DMA_SZ);
5387 		uf->buf_pa = ufm_pbs_pa(ufm, i);
5388 		list_add_tail(&uf->qe, &ufm->uf_free_q);
5394 	bfa_mem_kva_curp(ufm) = (u8 *) uf;
5450 	struct bfa_uf_s   *uf;
5452 	bfa_q_deq(&uf_mod->uf_free_q, &uf);
5453 	return uf;
5457 bfa_uf_put(struct bfa_uf_mod_s *uf_mod, struct bfa_uf_s *uf)
5459 	list_add_tail(&uf->qe, &uf_mod->uf_free_q);
5463 bfa_uf_post(struct bfa_uf_mod_s *ufm, struct bfa_uf_s *uf)
5471 	memcpy(uf_post_msg, &ufm->uf_buf_posts[uf->uf_tag],
5475 	bfa_trc(ufm->bfa, uf->uf_tag);
5477 	list_add_tail(&uf->qe, &ufm->uf_posted_q);
5484 	struct bfa_uf_s   *uf;
5486 	while ((uf = bfa_uf_get(uf_mod)) != NULL) {
5487 		if (bfa_uf_post(uf_mod, uf) != BFA_STATUS_OK)
5497 	struct bfa_uf_s *uf = &ufm->uf_list[uf_tag];
5502 			bfa_mem_get_dmabuf_kva(ufm, uf_tag, uf->pb_len);
5508 	list_del(&uf->qe);	/* dequeue from posted queue */
5510 	uf->data_ptr = buf;
5511 	uf->data_len = m->xfr_len;
5513 	WARN_ON(uf->data_len < sizeof(struct fchs_s));
5515 	if (uf->data_len == sizeof(struct fchs_s)) {
5517 			       uf->data_len, (struct fchs_s *)buf);
5521 				      BFA_PL_EID_RX, uf->data_len,
5526 		__bfa_cb_uf_recv(uf, BFA_TRUE);
5528 		bfa_cb_queue(bfa, &uf->hcb_qe, __bfa_cb_uf_recv, uf);
5535 	struct bfa_uf_s *uf;
5538 	/* Enqueue unused uf resources to free_q */
5542 		uf = (struct bfa_uf_s *) qe;
5543 		list_del(&uf->qe);
5544 		bfa_uf_put(ufm, uf);
5573  * @param[in]		uf		unsolicited frame to be freed
5578 bfa_uf_free(struct bfa_uf_s *uf)
5580 	bfa_uf_put(BFA_UF_MOD(uf->bfa), uf);
5581 	bfa_uf_post_all(BFA_UF_MOD(uf->bfa));
5587  *  uf_pub BFA uf module public functions