flywithu/ntel-gpu-tools
1
0
Fork 0
mirror of https://github.com/tiagovignatti/intel-gpu-tools.git synced 2025-06-12 02:16:17 +00:00
Code Issues Releases Wiki Activity

benchmarks/gem_latency: Expose the workload factor

Browse Source 
Allow the user to select how many batches each producer submits before
waiting.

Signed-off-by: Chris Wilson <chris@chris-wilson.co.uk>
This commit is contained in:
Chris Wilson 2015-12-19 10:52:12 +00:00
parent 6dbe0a3012
commit 1db5b05243
1 changed files with 19 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

25
benchmarks/gem_latency.c
View File

@ -67,6 +67,7 @@ struct producer {
int complete; int complete;
igt_stats_t latency, throughput; igt_stats_t latency, throughput;
int workload;
int nconsumers; int nconsumers;
struct consumer *consumers; struct consumer *consumers;
}; };
@ -76,8 +77,8 @@ struct producer {
#define BLT_WRITE_ALPHA (1<<21) #define BLT_WRITE_ALPHA (1<<21)
#define BLT_WRITE_RGB (1<<20) #define BLT_WRITE_RGB (1<<20)
#define WIDTH 256 #define WIDTH 128
#define HEIGHT 256 #define HEIGHT 128
#define BCS_TIMESTAMP (0x22000 + 0x358) #define BCS_TIMESTAMP (0x22000 + 0x358)
@ -173,7 +174,7 @@ static void *producer(void *arg)
while (!done) { while (!done) {
uint32_t start = READ(BCS_TIMESTAMP); uint32_t start = READ(BCS_TIMESTAMP);
int batches = 10; int batches = p->workload;
while (batches--) while (batches--)
gem_execbuf(fd, &execbuf); gem_execbuf(fd, &execbuf);
@ -229,7 +230,7 @@ static double l_estimate(igt_stats_t *stats)
} }
#define CONTEXT 1 #define CONTEXT 1
static int run(int nproducers, int nconsumers, unsigned flags) static int run(int nproducers, int nconsumers, int workload, unsigned flags)
{ {
struct producer *p; struct producer *p;
igt_stats_t latency, throughput; igt_stats_t latency, throughput;
@ -260,6 +261,7 @@ static int run(int nproducers, int nconsumers, unsigned flags)
igt_stats_init(&p[n].latency); igt_stats_init(&p[n].latency);
igt_stats_init(&p[n].throughput); igt_stats_init(&p[n].throughput);
p[n].wait = nconsumers; p[n].wait = nconsumers;
p[n].workload = workload;
p[n].nconsumers = nconsumers; p[n].nconsumers = nconsumers;
p[n].consumers = calloc(nconsumers, sizeof(struct consumer)); p[n].consumers = calloc(nconsumers, sizeof(struct consumer));
for (m = 0; m < nconsumers; m++) { for (m = 0; m < nconsumers; m++) {
@ -308,17 +310,28 @@ int main(int argc, char **argv)
{ {
int producers = 8; int producers = 8;
int consumers = 1; int consumers = 1;
int workload = 10;
unsigned flags = 0; unsigned flags = 0;
int c; int c;
while ((c = getopt (argc, argv, "p:c:sa")) != -1) { while ((c = getopt (argc, argv, "p:c:w:s")) != -1) {
switch (c) { switch (c) {
case 'p': case 'p':
producers = atoi(optarg); producers = atoi(optarg);
if (producers < 1)
producers = 1;
break; break;
case 'c': case 'c':
consumers = atoi(optarg); consumers = atoi(optarg);
if (consumers < 0)
consumers = 0;
break;
case 'w':
workload = atoi(optarg);
if (workload < 1)
workload = 1;
break; break;
case 's': case 's':
@ -330,5 +343,5 @@ int main(int argc, char **argv)
} }
} }
return run(producers, consumers, flags); return run(producers, consumers, workload, flags);
} }