88     for (int i = 0; implementations[i].name != NULL; i++)  in find_impl()  local
90 	if (strcmp(implementations[i].name, name) == 0)  in find_impl()
92 	    return i;  in find_impl()
138     printf("%11u ", (unsigned int) blksize); fflush(stdout);  in benchmark()
141     for (uint32_t i = 0; i < numops; i ++)  in benchmark()  local
144 	uint32_t random = ((uint32_t *) base)[i % (poolsize / 4)];  in benchmark()
156     printf("%11ju ", (uintmax_t) ((accbytes / elapsed_ms) * 1000) / MEGABYTE);  in benchmark()
158     printf("%11u ", cyc_per_blk);  in benchmark()
179     while ((c = getopt(argc, argv, "b:df:i:n:p:")) != -1)  in main()
209 	    case 'i' :  in main()
260 			"-i <impl>       Implementation\n"  in main()
265 		for (int i = 0; implementations[i].name != NULL; i++)  in main()  local
267 		    printf(" %s", implementations[i].name);  in main()
286     for (size_t i = 0; i < POOLSIZE / 4; i++)  in main()  local
288 	((uint32_t *) base)[i] = rand();  in main()
314 	for (int i = 0; i < 96; i++)  in main()  local
316 	    if (i % 8 == 0)  in main()
317 		printf("%2u:", i);  in main()
318 	    printf(" %02x", base[i]);  in main()
319 	    if (i % 8 == 7)  in main()
351 	printf("%11s %11s %11s %11s\n",  in main()
356 	printf("%11s %11s %11s %11s\n",  in main()
368 	for (int i = 0; sizes[i] != 0; i++)  in main()  local
370 	    uint32_t numops = NUMOPS * 10000 / (40 + sizes[i]);  in main()
371 	    benchmark(base, POOLSIZE, sizes[i], numops, CPUFREQ);  in main()