Lines Matching refs:ipc
24 #include "sst-ipc.h"
32 static struct ipc_message *msg_get_empty(struct sst_generic_ipc *ipc)
36 if (!list_empty(&ipc->empty_list)) {
37 msg = list_first_entry(&ipc->empty_list, struct ipc_message,
45 static int tx_wait_done(struct sst_generic_ipc *ipc,
55 spin_lock_irqsave(&ipc->dsp->spinlock, flags);
57 if (ipc->ops.shim_dbg != NULL)
58 ipc->ops.shim_dbg(ipc, "message timeout");
73 list_add_tail(&msg->list, &ipc->empty_list);
74 spin_unlock_irqrestore(&ipc->dsp->spinlock, flags);
78 static int ipc_tx_message(struct sst_generic_ipc *ipc,
85 spin_lock_irqsave(&ipc->dsp->spinlock, flags);
87 msg = msg_get_empty(ipc);
89 spin_unlock_irqrestore(&ipc->dsp->spinlock, flags);
102 if ((request.size) && (ipc->ops.tx_data_copy != NULL))
103 ipc->ops.tx_data_copy(msg, request.data, request.size);
105 list_add_tail(&msg->list, &ipc->tx_list);
106 schedule_work(&ipc->kwork);
107 spin_unlock_irqrestore(&ipc->dsp->spinlock, flags);
110 return tx_wait_done(ipc, msg, reply);
115 static int msg_empty_list_init(struct sst_generic_ipc *ipc)
119 ipc->msg = kcalloc(IPC_EMPTY_LIST_SIZE, sizeof(struct ipc_message),
121 if (ipc->msg == NULL)
125 ipc->msg[i].tx.data = kzalloc(ipc->tx_data_max_size, GFP_KERNEL);
126 if (ipc->msg[i].tx.data == NULL)
129 ipc->msg[i].rx.data = kzalloc(ipc->rx_data_max_size, GFP_KERNEL);
130 if (ipc->msg[i].rx.data == NULL) {
131 kfree(ipc->msg[i].tx.data);
135 init_waitqueue_head(&ipc->msg[i].waitq);
136 list_add(&ipc->msg[i].list, &ipc->empty_list);
143 kfree(ipc->msg[i-1].tx.data);
144 kfree(ipc->msg[i-1].rx.data);
147 kfree(ipc->msg);
154 struct sst_generic_ipc *ipc =
158 spin_lock_irq(&ipc->dsp->spinlock);
160 while (!list_empty(&ipc->tx_list) && !ipc->pending) {
165 if (ipc->ops.is_dsp_busy && ipc->ops.is_dsp_busy(ipc->dsp)) {
166 dev_dbg(ipc->dev, "ipc_tx_msgs dsp busy\n");
170 msg = list_first_entry(&ipc->tx_list, struct ipc_message, list);
171 list_move(&msg->list, &ipc->rx_list);
173 if (ipc->ops.tx_msg != NULL)
174 ipc->ops.tx_msg(ipc, msg);
177 spin_unlock_irq(&ipc->dsp->spinlock);
180 int sst_ipc_tx_message_wait(struct sst_generic_ipc *ipc,
190 if (ipc->ops.check_dsp_lp_on)
191 if (ipc->ops.check_dsp_lp_on(ipc->dsp, true))
194 ret = ipc_tx_message(ipc, request, reply, 1);
196 if (ipc->ops.check_dsp_lp_on)
197 if (ipc->ops.check_dsp_lp_on(ipc->dsp, false))
204 int sst_ipc_tx_message_nowait(struct sst_generic_ipc *ipc,
207 return ipc_tx_message(ipc, request, NULL, 0);
211 int sst_ipc_tx_message_nopm(struct sst_generic_ipc *ipc,
214 return ipc_tx_message(ipc, request, reply, 1);
218 struct ipc_message *sst_ipc_reply_find_msg(struct sst_generic_ipc *ipc,
224 if (ipc->ops.reply_msg_match != NULL)
225 header = ipc->ops.reply_msg_match(header, &mask);
229 if (list_empty(&ipc->rx_list)) {
230 dev_err(ipc->dev, "error: rx list empty but received 0x%llx\n",
235 list_for_each_entry(msg, &ipc->rx_list, list) {
245 void sst_ipc_tx_msg_reply_complete(struct sst_generic_ipc *ipc,
251 list_add_tail(&msg->list, &ipc->empty_list);
257 int sst_ipc_init(struct sst_generic_ipc *ipc)
261 INIT_LIST_HEAD(&ipc->tx_list);
262 INIT_LIST_HEAD(&ipc->rx_list);
263 INIT_LIST_HEAD(&ipc->empty_list);
264 init_waitqueue_head(&ipc->wait_txq);
266 ret = msg_empty_list_init(ipc);
270 INIT_WORK(&ipc->kwork, ipc_tx_msgs);
275 void sst_ipc_fini(struct sst_generic_ipc *ipc)
279 cancel_work_sync(&ipc->kwork);
281 if (ipc->msg) {
283 kfree(ipc->msg[i].tx.data);
284 kfree(ipc->msg[i].rx.data);
286 kfree(ipc->msg);