Searched refs:queueHead (Results 1 – 2 of 2) sorted by relevance
43 size_t queueHead; member86 { POOL_job const job = ctx->queue[ctx->queueHead]; in POOL_thread()87 ctx->queueHead = (ctx->queueHead + 1) % ctx->queueSize; in POOL_thread()89 ctx->queueEmpty = ctx->queueHead == ctx->queueTail; in POOL_thread()130 ctx->queueHead = 0; in POOL_create_advanced()252 return ctx->queueHead == ((ctx->queueTail + 1) % ctx->queueSize); in isQueueFull()
7014 size_t queueHead; member7057 { POOL_job const job = ctx->queue[ctx->queueHead]; in POOL_thread()7058 ctx->queueHead = (ctx->queueHead + 1) % ctx->queueSize; in POOL_thread()7060 ctx->queueEmpty = ctx->queueHead == ctx->queueTail; in POOL_thread()7097 ctx->queueHead = 0; in POOL_create_advanced()7217 return ctx->queueHead == ((ctx->queueTail + 1) % ctx->queueSize); in isQueueFull()