Home
last modified time | relevance | path

Searched refs:NUM_QUERIES (Results 1 - 3 of 3) sorted by relevance

/third_party/mesa3d/src/gallium/auxiliary/hud/
H A Dhud_driver_query.c42 #define NUM_QUERIES 8 macro
50 struct pipe_query *query[NUM_QUERIES];
51 union pipe_query_result *result[NUM_QUERIES];
68 unsigned idx = (bq->head - bq->pending + 1) % NUM_QUERIES; in hud_batch_query_update()
87 bq->head = (bq->head + 1) % NUM_QUERIES; in hud_batch_query_update()
89 if (bq->pending == NUM_QUERIES) { in hud_batch_query_update()
92 NUM_QUERIES); in hud_batch_query_update()
185 for (idx = 0; idx < NUM_QUERIES; ++idx) { in hud_batch_query_cleanup()
207 struct pipe_query *query[NUM_QUERIES];
220 unsigned idx = (bq->head - bq->pending) % NUM_QUERIES; in query_new_value_batch()
[all...]
/third_party/skia/tests/
H A DRTreeTest.cpp14 static const size_t NUM_QUERIES = 50; variable
48 for (size_t i = 0; i < NUM_QUERIES; ++i) { in run_queries()
/third_party/mesa3d/src/gallium/drivers/zink/
H A Dzink_query.c16 #define NUM_QUERIES 5000 macro
18 #define NUM_QUERIES 500 macro
172 pool_create.queryCount = NUM_QUERIES; in find_or_allocate_qp()
353 NUM_QUERIES * get_num_results(query) * sizeof(uint64_t)); in qbo_append()
433 if (pool->last_range == NUM_QUERIES) in query_pool_get_range()
734 assert(query_id < NUM_QUERIES); in copy_pool_results_to_buffer()

Completed in 4 milliseconds