/
stress-lsearch.c
228 lines (198 loc) · 6.7 KB
/
stress-lsearch.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
/*
* Copyright (C) 2013-2021 Canonical, Ltd.
* Copyright (C) 2022-2024 Colin Ian King.
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License
* as published by the Free Software Foundation; either version 2
* of the License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA.
*
*/
#include "stress-ng.h"
#include "core-sort.h"
#include "core-builtin.h"
#if defined(HAVE_SEARCH_H) && \
defined(HAVE_LSEARCH)
#include <search.h>
#endif
typedef void * (*lfind_func_t)(const void *key, const void *base, size_t *nmemb, size_t size,
int (*compare)(const void *p1, const void *p2));
typedef void * (*lsearch_func_t)(const void *key, void *base, size_t *nmemb, size_t size,
int (*compare)(const void *p1, const void *p2));
typedef struct {
const char *name;
const lfind_func_t lfind_func;
const lsearch_func_t lsearch_func;
} stress_lsearch_method_t;
#define LSEARCH_SIZE_SHIFT (20)
#define MIN_LSEARCH_SIZE (1 * KB)
#define MAX_LSEARCH_SIZE (1U << LSEARCH_SIZE_SHIFT) /* 1 MB */
#define DEFAULT_LSEARCH_SIZE (8 * KB)
static const stress_help_t help[] = {
{ NULL, "lsearch N", "start N workers that exercise a linear search" },
{ NULL, "lsearch-method M", "select lsearch method [ lsearch-libc | lsearch-nonlibc ]" },
{ NULL, "lsearch-ops N", "stop after N linear search bogo operations" },
{ NULL, "lsearch-size N", "number of 32 bit integers to lsearch" },
{ NULL, NULL, NULL }
};
static inline void OPTIMIZE3 * lfind_nonlibc(
const void *key,
const void *base,
size_t *nmemb,
size_t size,
int (*compare)(const void *p1, const void *p2))
{
register size_t i = 0;
register const char *found = base;
while ((i < *nmemb) && ((*compare)(key, (const void *)found) != 0)) {
i++;
found += size;
}
return (i < *nmemb) ? (void *)shim_unconstify_ptr(found) : NULL;
}
static void * OPTIMIZE3 lsearch_nonlibc(
const void *key,
void *base,
size_t *nmemb,
size_t size,
int (*compare)(const void *p1, const void *p2))
{
register void *result = lfind_nonlibc(key, base, nmemb, size, compare);
if (!result) {
result = shim_memcpy((char *)base + ((*nmemb) * size), key, size);
++(*nmemb);
}
return result;
}
/*
* stress_set_lsearch_size()
* set lsearch size from given option string
*/
static int stress_set_lsearch_size(const char *opt)
{
uint64_t lsearch_size;
lsearch_size = stress_get_uint64(opt);
stress_check_range("lsearch-size", lsearch_size,
MIN_LSEARCH_SIZE, MAX_LSEARCH_SIZE);
return stress_set_setting("lsearch-size", TYPE_ID_UINT64, &lsearch_size);
}
static const stress_lsearch_method_t stress_lsearch_methods[] = {
#if defined(HAVE_SEARCH_H) && \
defined(HAVE_LSEARCH)
{ "lsearch-libc", lfind, lsearch },
#endif
{ "lsearch-nonlibc", lfind_nonlibc, lsearch_nonlibc },
};
static int stress_set_lsearch_method(const char *opt)
{
size_t i;
for (i = 0; i < SIZEOF_ARRAY(stress_lsearch_methods); i++) {
if (strcmp(opt, stress_lsearch_methods[i].name) == 0) {
stress_set_setting("lsearch-method", TYPE_ID_SIZE_T, &i);
return 0;
}
}
(void)fprintf(stderr, "lsearch-method must be one of:");
for (i = 0; i < SIZEOF_ARRAY(stress_lsearch_methods); i++) {
(void)fprintf(stderr, " %s", stress_lsearch_methods[i].name);
}
(void)fprintf(stderr, "\n");
return -1;
}
static const stress_opt_set_func_t opt_set_funcs[] = {
{ OPT_lsearch_method, stress_set_lsearch_method },
{ OPT_lsearch_size, stress_set_lsearch_size },
{ 0, NULL }
};
/*
* stress_lsearch()
* stress lsearch
*/
static int stress_lsearch(stress_args_t *args)
{
int32_t *data, *root;
size_t i, max, lsearch_method = 0;
uint64_t lsearch_size = DEFAULT_LSEARCH_SIZE;
double rate, duration = 0.0, count = 0.0, sorted = 0.0;
lsearch_func_t lsearch_func;
lfind_func_t lfind_func;
int rc = EXIT_SUCCESS;
(void)stress_get_setting("lsearch-method", &lsearch_method);
lfind_func = stress_lsearch_methods[lsearch_method].lfind_func;
lsearch_func = stress_lsearch_methods[lsearch_method].lsearch_func;
if (!stress_get_setting("lsearch-size", &lsearch_size)) {
if (g_opt_flags & OPT_FLAGS_MAXIMIZE)
lsearch_size = MAX_LSEARCH_SIZE;
if (g_opt_flags & OPT_FLAGS_MINIMIZE)
lsearch_size = MIN_LSEARCH_SIZE;
}
max = (size_t)lsearch_size;
if ((data = calloc(max, sizeof(*data))) == NULL) {
pr_inf_skip("%s: malloc failed allocating %zd integers, "
"out of memory, skipping stressor\n", args->name, max);
return EXIT_NO_RESOURCE;
}
if ((root = calloc(max, sizeof(*data))) == NULL) {
free(data);
pr_inf_skip("%s: malloc failed allocating %zd integers , "
"out of memory, skipping stressor\n", args->name, max);
return EXIT_NO_RESOURCE;
}
stress_sort_data_int32_init(data, max);
stress_set_proc_state(args->name, STRESS_STATE_RUN);
do {
double t;
size_t n = 0;
stress_sort_data_int32_shuffle(data, max);
/* Step #1, populate with data */
for (i = 0; stress_continue_flag() && (i < max); i++) {
VOID_RET(void *, lsearch_func(&data[i], root, &n, sizeof(*data), stress_sort_cmp_fwd_int32));
}
/* Step #2, find */
stress_sort_compare_reset();
t = stress_time_now();
for (i = 0; stress_continue_flag() && (i < n); i++) {
int32_t *result;
result = lfind_func(&data[i], root, &n, sizeof(*data), stress_sort_cmp_fwd_int32);
if (g_opt_flags & OPT_FLAGS_VERIFY) {
if (result == NULL) {
pr_fail("%s: element %zu could not be found\n", args->name, i);
rc = EXIT_FAILURE;
} else if (*result != data[i]) {
pr_fail("%s: element %zu found %" PRIu32 ", expecting %" PRIu32 "\n",
args->name, i, *result, data[i]);
rc = EXIT_FAILURE;
}
}
}
duration += stress_time_now() - t;
count += (double)stress_sort_compare_get();
sorted += (double)i;
stress_bogo_inc(args);
} while (stress_continue(args));
stress_set_proc_state(args->name, STRESS_STATE_DEINIT);
rate = (duration > 0.0) ? count / duration : 0.0;
stress_metrics_set(args, 0, "lsearch comparisons per sec",
rate, STRESS_METRIC_HARMONIC_MEAN);
stress_metrics_set(args, 1, "lsearch comparisons per item",
count / sorted, STRESS_METRIC_HARMONIC_MEAN);
free(root);
free(data);
return rc;
}
stressor_info_t stress_lsearch_info = {
.stressor = stress_lsearch,
.class = CLASS_CPU_CACHE | CLASS_CPU | CLASS_MEMORY | CLASS_SEARCH,
.opt_set_funcs = opt_set_funcs,
.verify = VERIFY_OPTIONAL,
.help = help
};