1 /*
2 * CSV Display module for the hash benchmark program
3 * Part of xxHash project
4 * Copyright (C) 2019-present, Yann Collet
5 *
6 * BSD 2-Clause License (http://www.opensource.org/licenses/bsd-license.php)
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions are
10 * met:
11 *
12 * * Redistributions of source code must retain the above copyright
13 * notice, this list of conditions and the following disclaimer.
14 * * Redistributions in binary form must reproduce the above
15 * copyright notice, this list of conditions and the following disclaimer
16 * in the documentation and/or other materials provided with the
17 * distribution.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
20 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
21 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
22 * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
23 * OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
24 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
25 * LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
26 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
27 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
28 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
29 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 *
31 * You can contact the author at :
32 * - xxHash homepage: http://www.xxhash.com
33 * - xxHash source repository : https://github.com/Cyan4973/xxHash
34 */
35
36
37 /* === Dependencies === */
38
39 #include <stdlib.h> /* rand */
40 #include <stdio.h> /* printf */
41 #include <assert.h>
42
43 #include "benchHash.h"
44 #include "bhDisplay.h"
45
46
47 /* === benchmark large input === */
48
49 #define MB_UNIT 1000000
50 #define BENCH_LARGE_ITER_MS 490
51 #define BENCH_LARGE_TOTAL_MS 1010
bench_oneHash_largeInput(Bench_Entry hashDesc,int minlog,int maxlog)52 static void bench_oneHash_largeInput(Bench_Entry hashDesc, int minlog, int maxlog)
53 {
54 printf("%-7s", hashDesc.name);
55 for (int sizelog=minlog; sizelog<=maxlog; sizelog++) {
56 size_t const inputSize = (size_t)1 << sizelog;
57 double const nbhps = bench_hash(hashDesc.hash, BMK_throughput,
58 inputSize, BMK_fixedSize,
59 BENCH_LARGE_TOTAL_MS, BENCH_LARGE_ITER_MS);
60 printf(",%9.1f", nbhps * inputSize / MB_UNIT); fflush(NULL);
61 }
62 printf("\n");
63 }
64
bench_largeInput(Bench_Entry const * hashDescTable,int nbHashes,int minlog,int maxlog)65 void bench_largeInput(Bench_Entry const* hashDescTable, int nbHashes, int minlog, int maxlog)
66 {
67 assert(maxlog < 31);
68 assert(minlog >= 0);
69 printf("benchmarking large inputs : from %u bytes (log%i) to %u MB (log%i) \n",
70 1U << minlog, minlog,
71 (1U << maxlog) >> 20, maxlog);
72 for (int i=0; i<nbHashes; i++)
73 bench_oneHash_largeInput(hashDescTable[i], minlog, maxlog);
74 }
75
76
77
78 /* === benchmark small input === */
79
80 #define BENCH_SMALL_ITER_MS 170
81 #define BENCH_SMALL_TOTAL_MS 490
bench_throughput_oneHash_smallInputs(Bench_Entry hashDesc,size_t sizeMin,size_t sizeMax)82 static void bench_throughput_oneHash_smallInputs(Bench_Entry hashDesc, size_t sizeMin, size_t sizeMax)
83 {
84 printf("%-7s", hashDesc.name);
85 for (size_t s=sizeMin; s<sizeMax+1; s++) {
86 double const nbhps = bench_hash(hashDesc.hash, BMK_throughput,
87 s, BMK_fixedSize,
88 BENCH_SMALL_TOTAL_MS, BENCH_SMALL_ITER_MS);
89 printf(",%11.1f", nbhps); fflush(NULL);
90 }
91 printf("\n");
92 }
93
bench_throughput_smallInputs(Bench_Entry const * hashDescTable,int nbHashes,size_t sizeMin,size_t sizeMax)94 void bench_throughput_smallInputs(Bench_Entry const* hashDescTable, int nbHashes, size_t sizeMin, size_t sizeMax)
95 {
96 printf("Throughput small inputs of fixed size : \n");
97 for (int i=0; i<nbHashes; i++)
98 bench_throughput_oneHash_smallInputs(hashDescTable[i], sizeMin, sizeMax);
99 }
100
101
102
103 /* === Latency measurements (small keys) === */
104
bench_latency_oneHash_smallInputs(Bench_Entry hashDesc,size_t size_min,size_t size_max)105 static void bench_latency_oneHash_smallInputs(Bench_Entry hashDesc, size_t size_min, size_t size_max)
106 {
107 printf("%-7s", hashDesc.name);
108 for (size_t s=size_min; s<size_max+1; s++) {
109 double const nbhps = bench_hash(hashDesc.hash, BMK_latency,
110 s, BMK_fixedSize,
111 BENCH_SMALL_TOTAL_MS, BENCH_SMALL_ITER_MS);
112 printf(",%11.1f", nbhps); fflush(NULL);
113 }
114 printf("\n");
115 }
116
bench_latency_smallInputs(Bench_Entry const * hashDescTable,int nbHashes,size_t size_min,size_t size_max)117 void bench_latency_smallInputs(Bench_Entry const* hashDescTable, int nbHashes, size_t size_min, size_t size_max)
118 {
119 printf("Latency for small inputs of fixed size : \n");
120 for (int i=0; i<nbHashes; i++)
121 bench_latency_oneHash_smallInputs(hashDescTable[i], size_min, size_max);
122 }
123
124
125 /* === Random input Length === */
126
bench_randomInputLength_withOneHash(Bench_Entry hashDesc,size_t size_min,size_t size_max)127 static void bench_randomInputLength_withOneHash(Bench_Entry hashDesc, size_t size_min, size_t size_max)
128 {
129 printf("%-7s", hashDesc.name);
130 for (size_t s=size_min; s<size_max+1; s++) {
131 srand((unsigned)s); /* ensure random sequence of length will be the same for a given s */
132 double const nbhps = bench_hash(hashDesc.hash, BMK_throughput,
133 s, BMK_randomSize,
134 BENCH_SMALL_TOTAL_MS, BENCH_SMALL_ITER_MS);
135 printf(",%11.1f", nbhps); fflush(NULL);
136 }
137 printf("\n");
138 }
139
bench_throughput_randomInputLength(Bench_Entry const * hashDescTable,int nbHashes,size_t size_min,size_t size_max)140 void bench_throughput_randomInputLength(Bench_Entry const* hashDescTable, int nbHashes, size_t size_min, size_t size_max)
141 {
142 printf("benchmarking random size inputs [1-N] : \n");
143 for (int i=0; i<nbHashes; i++)
144 bench_randomInputLength_withOneHash(hashDescTable[i], size_min, size_max);
145 }
146
147
148 /* === Latency with Random input Length === */
149
bench_latency_oneHash_randomInputLength(Bench_Entry hashDesc,size_t size_min,size_t size_max)150 static void bench_latency_oneHash_randomInputLength(Bench_Entry hashDesc, size_t size_min, size_t size_max)
151 {
152 printf("%-7s", hashDesc.name);
153 for (size_t s=size_min; s<size_max+1; s++) {
154 srand((unsigned)s); /* ensure random sequence of length will be the same for a given s */
155 double const nbhps = bench_hash(hashDesc.hash, BMK_latency,
156 s, BMK_randomSize,
157 BENCH_SMALL_TOTAL_MS, BENCH_SMALL_ITER_MS);
158 printf(",%11.1f", nbhps); fflush(NULL);
159 }
160 printf("\n");
161 }
162
bench_latency_randomInputLength(Bench_Entry const * hashDescTable,int nbHashes,size_t size_min,size_t size_max)163 void bench_latency_randomInputLength(Bench_Entry const* hashDescTable, int nbHashes, size_t size_min, size_t size_max)
164 {
165 printf("Latency for small inputs of random size [1-N] : \n");
166 for (int i=0; i<nbHashes; i++)
167 bench_latency_oneHash_randomInputLength(hashDescTable[i], size_min, size_max);
168 }
169