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
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
|
/*
Copyright (c) 2010-2011 Gluster, Inc. <http://www.gluster.com>
This file is part of GlusterFS.
GlusterFS 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 3 of the License,
or (at your option) any later version.
GlusterFS 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, see
<http://www.gnu.org/licenses/>.
*/
#ifndef _CONFIG_H
#define _CONFIG_H
#include "config.h"
#endif
/* TODO: add NS locking */
#include "glusterfs.h"
#include "xlator.h"
#include "dht-common.h"
#include "defaults.h"
#include <sys/time.h>
int
dht_du_info_cbk (call_frame_t *frame, void *cookie, xlator_t *this,
int op_ret, int op_errno, struct statvfs *statvfs)
{
dht_conf_t *conf = NULL;
call_frame_t *prev = NULL;
int this_call_cnt = 0;
int i = 0;
double percent = 0;
double percent_inodes = 0;
uint64_t bytes = 0;
conf = this->private;
prev = cookie;
if (op_ret == -1) {
gf_log (this->name, GF_LOG_WARNING,
"failed to get disk info from %s", prev->this->name);
goto out;
}
if (statvfs && statvfs->f_blocks) {
percent = (statvfs->f_bavail * 100) / statvfs->f_blocks;
bytes = (statvfs->f_bavail * statvfs->f_frsize);
}
if (statvfs && statvfs->f_files) {
percent_inodes = (statvfs->f_ffree * 100) / statvfs->f_files;
} else {
/* set percent inodes to 100 for dynamically allocated inode filesystems
this logic holds good so that, distribute has nothing to worry about
total inodes rather let the 'create()' to be scheduled on the hashed
subvol regardless of the total inodes. since we have no awareness on
loosing inodes this logic fits well
*/
percent_inodes = 100;
}
LOCK (&conf->subvolume_lock);
{
for (i = 0; i < conf->subvolume_cnt; i++)
if (prev->this == conf->subvolumes[i]) {
conf->du_stats[i].avail_percent = percent;
conf->du_stats[i].avail_space = bytes;
conf->du_stats[i].avail_inodes = percent_inodes;
gf_log (this->name, GF_LOG_DEBUG,
"on subvolume '%s': avail_percent is: "
"%.2f and avail_space is: %"PRIu64" "
"and avail_inodes is: %.2f",
prev->this->name,
conf->du_stats[i].avail_percent,
conf->du_stats[i].avail_space,
conf->du_stats[i].avail_inodes);
}
}
UNLOCK (&conf->subvolume_lock);
out:
this_call_cnt = dht_frame_return (frame);
if (is_last_call (this_call_cnt))
DHT_STACK_DESTROY (frame);
return 0;
}
int
dht_get_du_info_for_subvol (xlator_t *this, int subvol_idx)
{
dht_conf_t *conf = NULL;
call_frame_t *statfs_frame = NULL;
dht_local_t *statfs_local = NULL;
call_pool_t *pool = NULL;
conf = this->private;
pool = this->ctx->pool;
statfs_frame = create_frame (this, pool);
if (!statfs_frame) {
goto err;
}
/* local->fop value is not used in this case */
statfs_local = dht_local_init (statfs_frame, NULL, NULL,
GF_FOP_MAXVALUE);
if (!statfs_local) {
goto err;
}
loc_t tmp_loc = { .inode = NULL,
.path = "/",
};
statfs_local->call_cnt = 1;
STACK_WIND (statfs_frame, dht_du_info_cbk,
conf->subvolumes[subvol_idx],
conf->subvolumes[subvol_idx]->fops->statfs,
&tmp_loc);
return 0;
err:
if (statfs_frame)
DHT_STACK_DESTROY (statfs_frame);
return -1;
}
int
dht_get_du_info (call_frame_t *frame, xlator_t *this, loc_t *loc)
{
int i = 0;
dht_conf_t *conf = NULL;
call_frame_t *statfs_frame = NULL;
dht_local_t *statfs_local = NULL;
struct timeval tv = {0,};
conf = this->private;
gettimeofday (&tv, NULL);
if (tv.tv_sec > (conf->refresh_interval
+ conf->last_stat_fetch.tv_sec)) {
statfs_frame = copy_frame (frame);
if (!statfs_frame) {
goto err;
}
/* In this case, 'local->fop' is not used */
statfs_local = dht_local_init (statfs_frame, loc, NULL,
GF_FOP_MAXVALUE);
if (!statfs_local) {
goto err;
}
loc_t tmp_loc = { .inode = NULL,
.path = "/",
};
statfs_local->call_cnt = conf->subvolume_cnt;
for (i = 0; i < conf->subvolume_cnt; i++) {
STACK_WIND (statfs_frame, dht_du_info_cbk,
conf->subvolumes[i],
conf->subvolumes[i]->fops->statfs,
&tmp_loc);
}
conf->last_stat_fetch.tv_sec = tv.tv_sec;
}
return 0;
err:
if (statfs_frame)
DHT_STACK_DESTROY (statfs_frame);
return -1;
}
gf_boolean_t
dht_is_subvol_filled (xlator_t *this, xlator_t *subvol)
{
int i = 0;
dht_conf_t *conf = NULL;
gf_boolean_t subvol_filled_inodes = _gf_false;
gf_boolean_t subvol_filled_space = _gf_false;
gf_boolean_t is_subvol_filled = _gf_false;
conf = this->private;
/* Check for values above specified percent or free disk */
LOCK (&conf->subvolume_lock);
{
for (i = 0; i < conf->subvolume_cnt; i++) {
if (subvol == conf->subvolumes[i]) {
if (conf->disk_unit == 'p') {
if (conf->du_stats[i].avail_percent <
conf->min_free_disk) {
subvol_filled_space = _gf_true;
break;
}
} else {
if (conf->du_stats[i].avail_space <
conf->min_free_disk) {
subvol_filled_space = _gf_true;
break;
}
}
if (conf->du_stats[i].avail_inodes <
conf->min_free_inodes) {
subvol_filled_inodes = _gf_true;
break;
}
}
}
}
UNLOCK (&conf->subvolume_lock);
if (subvol_filled_space && conf->subvolume_status[i]) {
if (!(conf->du_stats[i].log++ % (GF_UNIVERSAL_ANSWER * 10))) {
gf_log (this->name, GF_LOG_WARNING,
"disk space on subvolume '%s' is getting "
"full (%.2f %%), consider adding more nodes",
subvol->name,
(100 - conf->du_stats[i].avail_percent));
}
}
if (subvol_filled_inodes && conf->subvolume_status[i]) {
if (!(conf->du_stats[i].log++ % (GF_UNIVERSAL_ANSWER * 10))) {
gf_log (this->name, GF_LOG_CRITICAL,
"inodes on subvolume '%s' are at "
"(%.2f %%), consider adding more nodes",
subvol->name,
(100 - conf->du_stats[i].avail_inodes));
}
}
is_subvol_filled = (subvol_filled_space || subvol_filled_inodes);
return is_subvol_filled;
}
xlator_t *
dht_free_disk_available_subvol (xlator_t *this, xlator_t *subvol)
{
int i = 0;
double max = 0;
double max_inodes = 0;
xlator_t *avail_subvol = NULL;
dht_conf_t *conf = NULL;
conf = this->private;
LOCK (&conf->subvolume_lock);
{
for (i = 0; i < conf->subvolume_cnt; i++) {
if (conf->disk_unit == 'p') {
if ((conf->du_stats[i].avail_percent > max)
&& (conf->du_stats[i].avail_inodes > max_inodes)) {
max = conf->du_stats[i].avail_percent;
max_inodes = conf->du_stats[i].avail_inodes;
avail_subvol = conf->subvolumes[i];
}
} else {
if ((conf->du_stats[i].avail_space > max)
&& (conf->du_stats[i].avail_inodes > max_inodes)) {
max = conf->du_stats[i].avail_space;
max_inodes = conf->du_stats[i].avail_inodes;
avail_subvol = conf->subvolumes[i];
}
}
}
}
UNLOCK (&conf->subvolume_lock);
if (!avail_subvol) {
gf_log (this->name, GF_LOG_DEBUG,
"no subvolume has enough free space and inodes to create");
}
if ((max < conf->min_free_disk) && (max_inodes < conf->min_free_inodes))
avail_subvol = subvol;
if (!avail_subvol)
avail_subvol = subvol;
return avail_subvol;
}
|
