forked from ColinIanKing/stress-ng
-
Notifications
You must be signed in to change notification settings - Fork 0
/
stress-dentry.c
199 lines (172 loc) · 4.53 KB
/
stress-dentry.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
/*
* Copyright (C) 2013-2017 Canonical, Ltd.
*
* 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.
*
* This code is a complete clean re-write of the stress tool by
* Colin Ian King <colin.king@canonical.com> and attempts to be
* backwardly compatible with the stress tool by Amos Waterland
* <apw@rossby.metr.ou.edu> but has more stress tests and more
* functionality.
*
*/
#include "stress-ng.h"
#define ORDER_FORWARD 0x00
#define ORDER_REVERSE 0x01
#define ORDER_STRIDE 0x02
#define ORDER_RANDOM 0x03
#define ORDER_NONE 0x04
typedef struct {
const char *name;
uint8_t denty_order;
} dentry_removal_t;
static const dentry_removal_t dentry_removals[] = {
{ "forward", ORDER_FORWARD },
{ "reverse", ORDER_REVERSE },
{ "stride", ORDER_STRIDE },
{ "random", ORDER_RANDOM },
{ NULL, ORDER_NONE },
};
void stress_set_dentries(const char *opt)
{
uint64_t dentries;
dentries = get_uint64(opt);
check_range("dentries", dentries,
MIN_DENTRIES, MAX_DENTRIES);
set_setting("dentries", TYPE_ID_UINT64, &dentries);
}
/*
* stress_set_dentry_order()
* set dentry ordering from give option
*/
int stress_set_dentry_order(const char *opt)
{
const dentry_removal_t *dr;
for (dr = dentry_removals; dr->name; dr++) {
if (!strcmp(dr->name, opt)) {
uint8_t dentry_order = dr->denty_order;
set_setting("dentry-order",
TYPE_ID_UINT8, &dentry_order);
return 0;
}
}
(void)fprintf(stderr, "dentry-order must be one of:");
for (dr = dentry_removals; dr->name; dr++) {
(void)fprintf(stderr, " %s", dr->name);
}
(void)fprintf(stderr, "\n");
return -1;
}
/*
* stress_dentry_unlink()
* remove all dentries
*/
static void stress_dentry_unlink(
const args_t *args,
const uint64_t n,
const uint8_t dentry_order)
{
uint64_t i, j;
uint64_t prime;
const uint8_t ord = (dentry_order == ORDER_RANDOM) ?
mwc32() % 3 : dentry_order;
switch (ord) {
case ORDER_REVERSE:
for (i = 0; i < n; i++) {
char path[PATH_MAX];
uint64_t gray_code;
j = (n - 1) - i;
gray_code = (j >> 1) ^ j;
stress_temp_filename_args(args,
path, sizeof(path), gray_code);
(void)unlink(path);
}
break;
case ORDER_STRIDE:
prime = stress_get_prime64(n);
for (i = 0, j = prime; i < n; i++, j += prime) {
char path[PATH_MAX];
uint64_t k = j % n;
uint64_t gray_code = (k >> 1) ^ k;
stress_temp_filename_args(args,
path, sizeof(path), gray_code);
(void)unlink(path);
}
break;
case ORDER_FORWARD:
default:
for (i = 0; i < n; i++) {
char path[PATH_MAX];
uint64_t gray_code = (i >> 1) ^ i;
stress_temp_filename_args(args,
path, sizeof(path), gray_code);
(void)unlink(path);
}
break;
}
sync();
}
/*
* stress_dentry
* stress dentries
*/
int stress_dentry(const args_t *args)
{
int ret;
uint64_t dentries = DEFAULT_DENTRIES;
uint8_t dentry_order = ORDER_RANDOM;
if (!get_setting("dentries", &dentries)) {
if (g_opt_flags & OPT_FLAGS_MAXIMIZE)
dentries = MAX_DENTRIES;
if (g_opt_flags & OPT_FLAGS_MINIMIZE)
dentries = MIN_DENTRIES;
}
(void)get_setting("dentry-order", &dentry_order);
ret = stress_temp_dir_mk_args(args);
if (ret < 0)
return exit_status(-ret);
do {
uint64_t i, n = dentries;
for (i = 0; i < n; i++) {
char path[PATH_MAX];
uint64_t gray_code = (i >> 1) ^ i;
int fd;
stress_temp_filename_args(args,
path, sizeof(path), gray_code);
if ((fd = open(path, O_CREAT | O_RDWR,
S_IRUSR | S_IWUSR)) < 0) {
if (errno != ENOSPC)
pr_fail_err("open");
n = i;
break;
}
(void)close(fd);
if (!keep_stressing())
goto abort;
inc_counter(args);
}
stress_dentry_unlink(args, n, dentry_order);
if (!g_keep_stressing_flag)
break;
sync();
} while (keep_stressing());
abort:
/* force unlink of all files */
pr_tidy("%s: removing %" PRIu64 " entries\n",
args->name, dentries);
stress_dentry_unlink(args, dentries, dentry_order);
(void)stress_temp_dir_rm_args(args);
return EXIT_SUCCESS;
}