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
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
|
/*
Copyright (c) 2008-2012 Red Hat, Inc. <http://www.redhat.com>
This file is part of GlusterFS.
This file is licensed to you under your choice of the GNU Lesser
General Public License, version 3 or any later version (LGPLv3 or
later), or the GNU General Public License, version 2 (GPLv2), in all
cases as published by the Free Software Foundation.
*/
/* TODO: add NS locking */
#include "glusterfs.h"
#include "xlator.h"
#include "dht-common.h"
#include "dht-messages.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,
dict_t *xdata)
{
dht_conf_t *conf = NULL;
xlator_t *prev = NULL;
int this_call_cnt = 0;
int i = 0;
double percent = 0;
double percent_inodes = 0;
uint64_t bytes = 0;
uint32_t bpc; /* blocks per chunk */
uint32_t chunks = 0;
conf = this->private;
prev = cookie;
if (op_ret == -1) {
gf_msg (this->name, GF_LOG_WARNING, op_errno,
DHT_MSG_GET_DISK_INFO_ERROR,
"failed to get disk info from %s", prev->name);
goto out;
}
if (statvfs && statvfs->f_blocks) {
percent = (statvfs->f_bavail * 100) / statvfs->f_blocks;
bytes = (statvfs->f_bavail * statvfs->f_frsize);
/*
* A 32-bit count of 1MB chunks allows a maximum brick size of
* ~4PB. It's possible that we could see a single local FS
* bigger than that some day, but this code is likely to be
* irrelevant by then. Meanwhile, it's more important to keep
* the chunk size small so the layout-calculation code that
* uses this value can be tested on normal machines.
*/
bpc = (1 << 20) / statvfs->f_bsize;
chunks = (statvfs->f_blocks + bpc - 1) / bpc;
}
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. The rationale is that distribute need not
* worry about total inodes; rather, let the 'create()' be
* scheduled on the hashed subvol regardless of the total
* inodes.
*/
percent_inodes = 100;
}
LOCK (&conf->subvolume_lock);
{
for (i = 0; i < conf->subvolume_cnt; i++)
if (prev == 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;
conf->du_stats[i].chunks = chunks;
gf_msg_debug (this->name, 0,
"subvolume '%s': avail_percent "
"is: %.2f and avail_space "
"is: %" PRIu64" and avail_inodes"
" is: %.2f",
prev->name,
conf->du_stats[i].avail_percent,
conf->du_stats[i].avail_space,
conf->du_stats[i].avail_inodes);
break; /* no point in looping further */
}
}
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;
loc_t tmp_loc = {0,};
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;
}
/* make it root gfid, should be enough to get the proper info back */
tmp_loc.gfid[15] = 1;
statfs_local->call_cnt = 1;
STACK_WIND_COOKIE (statfs_frame, dht_du_info_cbk,
conf->subvolumes[subvol_idx],
conf->subvolumes[subvol_idx],
conf->subvolumes[subvol_idx]->fops->statfs,
&tmp_loc, NULL);
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;
int ret = -1;
dht_conf_t *conf = NULL;
call_frame_t *statfs_frame = NULL;
dht_local_t *statfs_local = NULL;
struct timeval tv = {0,};
loc_t tmp_loc = {0,};
conf = this->private;
gettimeofday (&tv, NULL);
/* make it root gfid, should be enough to get the proper
info back */
tmp_loc.gfid[15] = 1;
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;
}
statfs_local->params = dict_new ();
if (!statfs_local->params)
goto err;
ret = dict_set_int8 (statfs_local->params,
GF_INTERNAL_IGNORE_DEEM_STATFS, 1);
if (ret) {
gf_msg (this->name, GF_LOG_ERROR, 0,
DHT_MSG_DICT_SET_FAILED,
"Failed to set "
GF_INTERNAL_IGNORE_DEEM_STATFS" in dict");
goto err;
}
statfs_local->call_cnt = conf->subvolume_cnt;
for (i = 0; i < conf->subvolume_cnt; i++) {
STACK_WIND_COOKIE (statfs_frame, dht_du_info_cbk,
conf->subvolumes[i],
conf->subvolumes[i],
conf->subvolumes[i]->fops->statfs,
&tmp_loc, statfs_local->params);
}
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_msg (this->name, GF_LOG_WARNING, 0,
DHT_MSG_SUBVOL_INSUFF_SPACE,
"disk space on subvolume '%s' is getting "
"full (%.2f %%), consider adding more bricks",
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_msg (this->name, GF_LOG_CRITICAL, 0,
DHT_MSG_SUBVOL_INSUFF_INODES,
"inodes on subvolume '%s' are at "
"(%.2f %%), consider adding more bricks",
subvol->name,
(100 - conf->du_stats[i].avail_inodes));
}
}
is_subvol_filled = (subvol_filled_space || subvol_filled_inodes);
return is_subvol_filled;
}
/*Get the best subvolume to create the file in*/
xlator_t *
dht_free_disk_available_subvol (xlator_t *this, xlator_t *subvol,
dht_local_t *local)
{
xlator_t *avail_subvol = NULL;
dht_conf_t *conf = NULL;
dht_layout_t *layout = NULL;
loc_t *loc = NULL;
conf = this->private;
if (!local)
goto out;
loc = &local->loc;
if (!local->layout) {
layout = dht_layout_get (this, loc->parent);
if (!layout) {
gf_msg_debug (this->name, 0,
"Missing layout. path=%s,"
" parent gfid = %s", loc->path,
uuid_utoa (loc->parent->gfid));
goto out;
}
} else {
layout = dht_layout_ref (this, local->layout);
}
LOCK (&conf->subvolume_lock);
{
avail_subvol = dht_subvol_with_free_space_inodes(this, subvol,
layout);
if(!avail_subvol)
{
avail_subvol = dht_subvol_maxspace_nonzeroinode(this,
subvol,
layout);
}
}
UNLOCK (&conf->subvolume_lock);
out:
if (!avail_subvol) {
gf_msg_debug (this->name, 0,
"No subvolume has enough free space \
and/or inodes to create");
avail_subvol = subvol;
}
if (layout)
dht_layout_unref (this, layout);
return avail_subvol;
}
static inline
int32_t dht_subvol_has_err (dht_conf_t *conf, xlator_t *this,
dht_layout_t *layout)
{
int ret = -1;
int i = 0;
if (!this || !layout)
goto out;
/* check if subvol has layout errors, before selecting it */
for (i = 0; i < layout->cnt; i++) {
if (!strcmp (layout->list[i].xlator->name, this->name) &&
(layout->list[i].err != 0)) {
ret = -1;
goto out;
}
}
/* discard decommissioned subvol */
if (conf->decommission_subvols_cnt) {
for (i = 0; i < conf->subvolume_cnt; i++) {
if (conf->decommissioned_bricks[i] &&
conf->decommissioned_bricks[i] == this) {
ret = -1;
goto out;
}
}
}
ret = 0;
out:
return ret;
}
/*Get subvolume which has both space and inodes more than the min criteria*/
xlator_t *
dht_subvol_with_free_space_inodes(xlator_t *this, xlator_t *subvol,
dht_layout_t *layout)
{
int i = 0;
double max = 0;
double max_inodes = 0;
int ignore_subvol = 0;
xlator_t *avail_subvol = NULL;
dht_conf_t *conf = NULL;
conf = this->private;
for(i=0; i < conf->subvolume_cnt; i++) {
/* check if subvol has layout errors and also it is not a
* decommissioned brick, before selecting it */
ignore_subvol = dht_subvol_has_err (conf, conf->subvolumes[i],
layout);
if (ignore_subvol)
continue;
if ((conf->disk_unit == 'p') &&
(conf->du_stats[i].avail_percent > conf->min_free_disk) &&
(conf->du_stats[i].avail_inodes > conf->min_free_inodes)) {
if ((conf->du_stats[i].avail_inodes > max_inodes) ||
(conf->du_stats[i].avail_percent > max)) {
max = conf->du_stats[i].avail_percent;
max_inodes = conf->du_stats[i].avail_inodes;
avail_subvol = conf->subvolumes[i];
}
}
if ((conf->disk_unit != 'p') &&
(conf->du_stats[i].avail_space > conf->min_free_disk) &&
(conf->du_stats[i].avail_inodes > conf->min_free_inodes)) {
if ((conf->du_stats[i].avail_inodes > max_inodes) ||
(conf->du_stats[i].avail_space > max)) {
max = conf->du_stats[i].avail_space;
max_inodes = conf->du_stats[i].avail_inodes;
avail_subvol = conf->subvolumes[i];
}
}
}
return avail_subvol;
}
/* Get subvol which has atleast one inode and maximum space */
xlator_t *
dht_subvol_maxspace_nonzeroinode (xlator_t *this, xlator_t *subvol,
dht_layout_t *layout)
{
int i = 0;
double max = 0;
int ignore_subvol = 0;
xlator_t *avail_subvol = NULL;
dht_conf_t *conf = NULL;
conf = this->private;
for (i = 0; i < conf->subvolume_cnt; i++) {
/* check if subvol has layout errors and also it is not a
* decommissioned brick, before selecting it*/
ignore_subvol = dht_subvol_has_err (conf, conf->subvolumes[i],
layout);
if (ignore_subvol)
continue;
if (conf->disk_unit == 'p') {
if ((conf->du_stats[i].avail_percent > max)
&& (conf->du_stats[i].avail_inodes > 0 )) {
max = conf->du_stats[i].avail_percent;
avail_subvol = conf->subvolumes[i];
}
} else {
if ((conf->du_stats[i].avail_space > max)
&& (conf->du_stats[i].avail_inodes > 0)) {
max = conf->du_stats[i].avail_space;
avail_subvol = conf->subvolumes[i];
}
}
}
return avail_subvol;
}
|