Searched refs:msg_queue (Results 1 - 12 of 12) sorted by relevance
/drivers/staging/tidspbridge/include/dspbridge/ |
H A D | msgdefs.h | 24 struct msg_queue;
|
H A D | dspmsg.h | 34 struct msg_queue **msgq, 39 extern void bridge_msg_delete_queue(struct msg_queue *msg_queue_obj); 41 extern int bridge_msg_get(struct msg_queue *msg_queue_obj, 44 extern int bridge_msg_put(struct msg_queue *msg_queue_obj, 47 extern int bridge_msg_register_notify(struct msg_queue *msg_queue_obj, 53 extern void bridge_msg_set_queue_id(struct msg_queue *msg_queue_obj,
|
H A D | dspdefs.h | 842 struct msg_queue **msgq, u32 msgq_id, u32 max_msgs, void *h); 869 typedef void (*fxn_msg_deletequeue) (struct msg_queue *msg_queue_obj); 890 typedef int(*fxn_msg_get) (struct msg_queue *msg_queue_obj, 912 typedef int(*fxn_msg_put) (struct msg_queue *msg_queue_obj, 937 (struct msg_queue *msg_queue_obj, 955 typedef void (*fxn_msg_setqueueid) (struct msg_queue *msg_queue_obj,
|
/drivers/staging/tidspbridge/core/ |
H A D | _msg_sm.h | 78 * have msg_queue to hold all messages that come up from the corresponding 101 * ======== msg_queue ======== 102 * Each NODE has a msg_queue for receiving messages from the 103 * corresponding node on the DSP. The msg_queue object maintains a list 107 * The msg_queue's hSynEvent gets posted when a message is ready. 109 struct msg_queue { struct
|
H A D | msg_sm.c | 42 static void delete_msg_queue(struct msg_queue *msg_queue_obj, u32 num_to_dsp); 78 * msg_queue object is created. 103 * Create a msg_queue for sending/receiving messages to/from a node 106 int bridge_msg_create_queue(struct msg_mgr *hmsg_mgr, struct msg_queue **msgq, 111 struct msg_queue *msg_q; 118 /* Allocate msg_queue object */ 119 msg_q = kzalloc(sizeof(struct msg_queue), GFP_KERNEL); 212 void bridge_msg_delete_queue(struct msg_queue *msg_queue_obj) 245 int bridge_msg_get(struct msg_queue *msg_queue_obj, 325 int bridge_msg_put(struct msg_queue *msg_queue_ob [all...] |
H A D | io_sm.c | 1186 struct msg_queue *msg_queue_obj;
|
/drivers/spi/ |
H A D | spi-ti-ssp.c | 36 struct list_head msg_queue; member in struct:ti_ssp_spi 186 while (!list_empty(&hw->msg_queue)) { 192 m = container_of(hw->msg_queue.next, struct spi_message, 285 list_add_tail(&m->queue, &hw->msg_queue); 321 INIT_LIST_HEAD(&hw->msg_queue); 366 while (!list_empty(&hw->msg_queue)) {
|
H A D | spi-orion.c | 43 struct list_head msg_queue; member in struct:orion_spi 285 while (!list_empty(&orion_spi->msg_queue)) { 293 m = container_of(orion_spi->msg_queue.next, struct spi_message, 439 list_add_tail(&m->queue, &orion_spi->msg_queue); 503 INIT_LIST_HEAD(&spi->msg_queue);
|
H A D | spi-omap-100k.c | 92 struct list_head msg_queue; member in struct:omap1_spi100k 349 while (!list_empty(&spi100k->msg_queue)) { 357 m = container_of(spi100k->msg_queue.next, struct spi_message, 479 list_add_tail(&m->queue, &spi100k->msg_queue); 530 INIT_LIST_HEAD(&spi100k->msg_queue); 580 while (!list_empty(&spi100k->msg_queue) && limit--) { 586 if (!list_empty(&spi100k->msg_queue))
|
H A D | spi-ep93xx.c | 74 * @current_msg and @msg_queue 86 * @msg_queue: queue for the messages 109 * @running, and @msg_queue. 124 struct list_head msg_queue; member in struct:ep93xx_spi 393 list_add_tail(&msg->queue, &espi->msg_queue); 898 list_empty(&espi->msg_queue)) { 902 msg = list_first_entry(&espi->msg_queue, struct spi_message, queue); 915 if (espi->running && !list_empty(&espi->msg_queue)) 1122 INIT_LIST_HEAD(&espi->msg_queue); 1173 while (!list_empty(&espi->msg_queue)) { [all...] |
H A D | spi-omap2-mcspi.c | 116 struct list_head msg_queue; member in struct:omap2_mcspi 868 while (!list_empty(&mcspi->msg_queue)) { 879 m = container_of(mcspi->msg_queue.next, struct spi_message, 1044 list_add_tail(&m->queue, &mcspi->msg_queue); 1147 INIT_LIST_HEAD(&mcspi->msg_queue);
|
/drivers/staging/tidspbridge/rmgr/ |
H A D | node.c | 224 struct msg_queue *msg_queue_obj;
|
Completed in 160 milliseconds