Lines Matching refs:tasks_queue
666 } tasks_queue; variable
678 tasks_queue.q = (dest_f_t*)bs_calloc(TASK_QUEUE_ALLOC_SIZE, sizeof(dest_f_t)); in nrf_ppi_init()
679 tasks_queue.size = TASK_QUEUE_ALLOC_SIZE; in nrf_ppi_init()
688 if (tasks_queue.q) { in nrf_ppi_clean_up()
689 free(tasks_queue.q); in nrf_ppi_clean_up()
690 tasks_queue.q = NULL; in nrf_ppi_clean_up()
698 for (i = 0; i < tasks_queue.used; i++){ in nrf_ppi_enqueue_task()
699 if (tasks_queue.q[i] == task){ //We ignore dups in nrf_ppi_enqueue_task()
704 if (tasks_queue.used >= tasks_queue.size) { in nrf_ppi_enqueue_task()
705 tasks_queue.size += TASK_QUEUE_ALLOC_SIZE; in nrf_ppi_enqueue_task()
706 tasks_queue.q = bs_realloc(tasks_queue.q, tasks_queue.size*sizeof(dest_f_t)); in nrf_ppi_enqueue_task()
708 tasks_queue.q[tasks_queue.used++] = task; in nrf_ppi_enqueue_task()
713 for (i = 0; i < tasks_queue.used; i++) { in nrf_ppi_dequeue_all_tasks()
714 if (tasks_queue.q[i]) { in nrf_ppi_dequeue_all_tasks()
715 dest_f_t f = tasks_queue.q[i]; in nrf_ppi_dequeue_all_tasks()
716 tasks_queue.q[i] = NULL; in nrf_ppi_dequeue_all_tasks()
720 tasks_queue.used = 0; in nrf_ppi_dequeue_all_tasks()