Lines Matching full:jobs
262 job = queue->jobs[queue->read_idx]; in util_queue_thread_func()
263 memset(&queue->jobs[queue->read_idx], 0, sizeof(struct util_queue_job)); in util_queue_thread_func()
278 /* signal remaining jobs before terminating */ in util_queue_thread_func()
282 if (queue->jobs[i].job) { in util_queue_thread_func()
283 util_queue_fence_signal(queue->jobs[i].fence); in util_queue_thread_func()
284 queue->jobs[i].job = NULL; in util_queue_thread_func()
308 queue->jobs = (struct util_queue_job*) in util_queue_init()
310 if (!queue->jobs) in util_queue_init()
367 if (queue->jobs) { in util_queue_init()
371 free(queue->jobs); in util_queue_init()
404 free(queue->jobs); in util_queue_destroy()
436 struct util_queue_job *jobs = in util_queue_add_job() local
439 assert(jobs); in util_queue_add_job()
441 /* Copy all queued jobs into the new list. */ in util_queue_add_job()
446 jobs[num_jobs++] = queue->jobs[i]; in util_queue_add_job()
452 free(queue->jobs); in util_queue_add_job()
453 queue->jobs = jobs; in util_queue_add_job()
464 ptr = &queue->jobs[queue->write_idx]; in util_queue_add_job()
498 if (queue->jobs[i].fence == fence) { in util_queue_drop_job()
499 if (queue->jobs[i].cleanup) in util_queue_drop_job()
500 queue->jobs[i].cleanup(queue->jobs[i].job, -1); in util_queue_drop_job()
503 memset(&queue->jobs[i], 0, sizeof(queue->jobs[i])); in util_queue_drop_job()
524 * Wait until all previously added jobs have completed.
534 /* If 2 threads were adding jobs for 2 different barries at the same time, in util_queue_finish()