Lines Matching refs:queue
84 * pushes data onto the appropriate queue, and each queue is pulled
91 * dynamically in terms of blocks. Each queue is represented as a
131 /* Unfortunately the per-queue state is a little more complicated than
135 * two end blocks. Thus the queue either looks like this:
235 /* This seems to be the size of each queue in chunks. */
249 for (int queue = 0; queue < num_queues; queue++) {
252 printf("\tCLUSTER_%s:\n\n", cluster_names[queue]);
256 data1.writer[queue].first_block);
258 data1.writer_second_block[queue]);
259 printf("\t\twriter_chunk: %d\n", data1.writer[queue].chunk);
261 data1.reader[queue].first_block);
263 data1.reader_second_block[queue]);
264 printf("\t\treader_chunk: %d\n", data1.reader[queue].chunk);
265 printf("\t\tblock_count: %d\n", data1.block_count[queue]);
266 printf("\t\tunk2: 0x%x\n", data1.unk2[queue]);
267 printf("\t\tqueue_size: %d\n\n", queue_sizes[queue]);
270 uint32_t cur_chunk = data1.reader[queue].chunk;
271 uint32_t cur_block = cur_chunk > 3 ? data1.reader[queue].first_block
272 : data1.reader_second_block[queue];
273 uint32_t last_chunk = data1.writer[queue].chunk;
274 uint32_t last_block = last_chunk > 3 ? data1.writer[queue].first_block
275 : data1.writer_second_block[queue];
306 if (calculated_queue_size != queue_sizes[queue]) {