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
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
|
/*
Copyright (c) 2006-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 _COMMON_UTILS_H
#define _COMMON_UTILS_H
#ifndef _CONFIG_H
#define _CONFIG_H
#include "config.h"
#endif
#include <stdint.h>
#include <sys/uio.h>
#include <netdb.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <pthread.h>
#ifndef GF_BSD_HOST_OS
#include <alloca.h>
#endif
void trap (void);
#define GF_UNIVERSAL_ANSWER 42 /* :O */
/* To solve type punned error */
#define VOID(ptr) ((void **) ((void *) ptr))
#include "logging.h"
#include "glusterfs.h"
#include "locking.h"
#include "mem-pool.h"
#include "uuid.h"
#define min(a,b) ((a)<(b)?(a):(b))
#define max(a,b) ((a)>(b)?(a):(b))
#define roof(a,b) ((((a)+(b)-1)/((b)?(b):1))*(b))
#define floor(a,b) (((a)/((b)?(b):1))*(b))
#define GF_UNIT_KB 1024ULL
#define GF_UNIT_MB 1048576ULL
#define GF_UNIT_GB 1073741824ULL
#define GF_UNIT_TB 1099511627776ULL
#define GF_UNIT_PB 1125899906842624ULL
#define GF_UNIT_KB_STRING "KB"
#define GF_UNIT_MB_STRING "MB"
#define GF_UNIT_GB_STRING "GB"
#define GF_UNIT_TB_STRING "TB"
#define GF_UNIT_PB_STRING "PB"
#define GF_UNIT_PERCENT_STRING "%"
#define GEOREP "geo-replication"
#define GHADOOP "glusterfs-hadoop"
#define WIPE(statp) do { typeof(*statp) z = {0,}; if (statp) *statp = z; } while (0)
#define IS_EXT_FS(fs_name) \
(!strcmp (fs_name, "ext2") || \
!strcmp (fs_name, "ext3") || \
!strcmp (fs_name, "ext4"))
/* Defining this here as it is needed by glusterd for setting
* nfs port in volume status.
*/
#define GF_NFS3_PORT 38467
enum _gf_boolean
{
_gf_false = 0,
_gf_true = 1
};
/*
* we could have initialized these as +ve values and treated
* them as negative while comparing etc.. (which would have
* saved us with the pain of assigning values), but since we
* only have a couple of clients that use this feature, it's
* okay.
*/
enum _gf_client_pid
{
GF_CLIENT_PID_MAX = 0,
GF_CLIENT_PID_GSYNCD = -1,
GF_CLIENT_PID_HADOOP = -2,
GF_CLIENT_PID_MIN = -3
};
typedef enum _gf_boolean gf_boolean_t;
typedef enum _gf_client_pid gf_client_pid_t;
typedef int (*gf_cmp) (void *, void *);
void gf_global_variable_init(void);
in_addr_t gf_resolve_ip (const char *hostname, void **dnscache);
void gf_log_volume_file (FILE *specfp);
void gf_print_trace (int32_t signal);
extern char *gf_fop_list[GF_FOP_MAXVALUE];
extern char *gf_mgmt_list[GF_MGMT_MAXVALUE];
#define VECTORSIZE(count) (count * (sizeof (struct iovec)))
#define STRLEN_0(str) (strlen(str) + 1)
#define VALIDATE_OR_GOTO(arg,label) do { \
if (!arg) { \
errno = EINVAL; \
gf_log_callingfn ((this ? (this->name) : \
"(Govinda! Govinda!)"), \
GF_LOG_WARNING, \
"invalid argument: " #arg); \
goto label; \
} \
} while (0)
#define GF_VALIDATE_OR_GOTO(name,arg,label) do { \
if (!arg) { \
errno = EINVAL; \
gf_log_callingfn (name, GF_LOG_ERROR, \
"invalid argument: " #arg); \
goto label; \
} \
} while (0)
#define GF_VALIDATE_OR_GOTO_WITH_ERROR(name, arg, label, errno, error) do { \
if (!arg) { \
errno = error; \
gf_log_callingfn (name, GF_LOG_ERROR, \
"invalid argument: " #arg); \
goto label; \
} \
}while (0)
#define GF_ASSERT_AND_GOTO_WITH_ERROR(name, arg, label, errno, error) do { \
if (!arg) { \
GF_ASSERT (0); \
errno = error; \
goto label; \
} \
}while (0)
#define GF_VALIDATE_ABSOLUTE_PATH_OR_GOTO(name,arg,label) \
do { \
GF_VALIDATE_OR_GOTO (name, arg, label); \
if ((arg[0]) != '/') { \
errno = EINVAL; \
gf_log_callingfn (name, GF_LOG_ERROR, \
"invalid argument: " #arg); \
goto label; \
} \
} while (0)
#define GF_REMOVE_SLASH_FROM_PATH(path, string) \
do { \
int i = 0; \
for (i = 1; i < strlen (path); i++) { \
string[i-1] = path[i]; \
if (string[i-1] == '/') \
string[i-1] = '-'; \
} \
} while (0)
#define GF_IF_INTERNAL_XATTR_GOTO(pattern, dict, trav, op_errno, label) \
do { \
if (!dict) { \
gf_log (this->name, GF_LOG_ERROR, \
"setxattr dict is null"); \
goto label; \
} \
trav = dict->members_list; \
while (trav) { \
if (!fnmatch (pattern, trav->key, 0)) { \
op_errno = EPERM; \
gf_log (this->name, GF_LOG_ERROR, \
"attempt to set internal" \
" xattr: %s: %s", trav->key, \
strerror (op_errno)); \
goto label; \
} \
trav = trav->next; \
} \
} while (0)
#define GF_IF_NATIVE_XATTR_GOTO(pattern, key, op_errno, label) \
do { \
if (!key) { \
gf_log (this->name, GF_LOG_ERROR, \
"no key for removexattr"); \
goto label; \
} \
if (!fnmatch (pattern, key, 0)) { \
op_errno = EPERM; \
gf_log (this->name, GF_LOG_ERROR, \
"attempt to remove internal " \
"xattr: %s: %s", key, \
strerror (op_errno)); \
goto label; \
} \
} while (0)
#define GF_FILE_CONTENT_REQUESTED(_xattr_req,_content_limit) \
(dict_get_uint64 (_xattr_req, "glusterfs.content", _content_limit) == 0)
#ifdef DEBUG
#define GF_ASSERT(x) assert (x);
#else
#define GF_ASSERT(x) \
do { \
if (!(x)) { \
gf_log_callingfn ("", GF_LOG_ERROR, \
"Assertion failed: " #x); \
} \
} while (0)
#endif
#define GF_UUID_ASSERT(u) \
if (uuid_is_null (u))\
GF_ASSERT (!"uuid null");
union gf_sock_union {
struct sockaddr_storage storage;
struct sockaddr_in6 sin6;
struct sockaddr_in sin;
struct sockaddr sa;
};
#define GF_HIDDEN_PATH ".glusterfs"
static inline void
iov_free (struct iovec *vector, int count)
{
int i;
for (i = 0; i < count; i++)
FREE (vector[i].iov_base);
GF_FREE (vector);
}
static inline int
iov_length (const struct iovec *vector, int count)
{
int i = 0;
size_t size = 0;
for (i = 0; i < count; i++)
size += vector[i].iov_len;
return size;
}
static inline struct iovec *
iov_dup (struct iovec *vector, int count)
{
int bytecount = 0;
int i;
struct iovec *newvec = NULL;
bytecount = (count * sizeof (struct iovec));
newvec = GF_MALLOC (bytecount, gf_common_mt_iovec);
if (!newvec)
return NULL;
for (i = 0; i < count; i++) {
newvec[i].iov_len = vector[i].iov_len;
newvec[i].iov_base = vector[i].iov_base;
}
return newvec;
}
static inline int
iov_subset (struct iovec *orig, int orig_count,
off_t src_offset, off_t dst_offset,
struct iovec *new)
{
int new_count = 0;
int i;
off_t offset = 0;
size_t start_offset = 0;
size_t end_offset = 0;
for (i = 0; i < orig_count; i++) {
if ((offset + orig[i].iov_len < src_offset)
|| (offset > dst_offset)) {
goto not_subset;
}
if (!new) {
goto count_only;
}
start_offset = 0;
end_offset = orig[i].iov_len;
if (src_offset >= offset) {
start_offset = (src_offset - offset);
}
if (dst_offset <= (offset + orig[i].iov_len)) {
end_offset = (dst_offset - offset);
}
new[new_count].iov_base = orig[i].iov_base + start_offset;
new[new_count].iov_len = end_offset - start_offset;
count_only:
new_count++;
not_subset:
offset += orig[i].iov_len;
}
return new_count;
}
static inline void
iov_unload (char *buf, const struct iovec *vector, int count)
{
int i;
int copied = 0;
for (i = 0; i < count; i++) {
memcpy (buf + copied, vector[i].iov_base, vector[i].iov_len);
copied += vector[i].iov_len;
}
}
static inline int
mem_0filled (const char *buf, size_t size)
{
int i = 0;
int ret = 0;
for (i = 0; i < size; i++) {
ret = buf[i];
if (ret)
break;
}
return ret;
}
static inline int
iov_0filled (struct iovec *vector, int count)
{
int i = 0;
int ret = 0;
for (i = 0; i < count; i++) {
ret = mem_0filled (vector[i].iov_base, vector[i].iov_len);
if (ret)
break;
}
return ret;
}
static inline void *
memdup (const void *ptr, size_t size)
{
void *newptr = NULL;
newptr = GF_MALLOC (size, gf_common_mt_memdup);
if (!newptr)
return NULL;
memcpy (newptr, ptr, size);
return newptr;
}
/*
* rounds up nr to power of two. If nr is already a power of two, just returns
* nr
*/
int32_t gf_roundup_power_of_two (uint32_t nr);
/*
* rounds up nr to next power of two. If nr is already a power of two, next
* power of two is returned.
*/
int32_t gf_roundup_next_power_of_two (uint32_t nr);
char *gf_trim (char *string);
int gf_strsplit (const char *str, const char *delim,
char ***tokens, int *token_count);
int gf_volume_name_validate (const char *volume_name);
int gf_string2long (const char *str, long *n);
int gf_string2ulong (const char *str, unsigned long *n);
int gf_string2int (const char *str, int *n);
int gf_string2uint (const char *str, unsigned int *n);
int gf_string2double (const char *str, double *n);
int gf_string2longlong (const char *str, long long *n);
int gf_string2ulonglong (const char *str, unsigned long long *n);
int gf_string2int8 (const char *str, int8_t *n);
int gf_string2int16 (const char *str, int16_t *n);
int gf_string2int32 (const char *str, int32_t *n);
int gf_string2int64 (const char *str, int64_t *n);
int gf_string2uint8 (const char *str, uint8_t *n);
int gf_string2uint16 (const char *str, uint16_t *n);
int gf_string2uint32 (const char *str, uint32_t *n);
int gf_string2uint64 (const char *str, uint64_t *n);
int gf_strstr (const char *str, const char *delim, const char *match);
int gf_string2ulong_base10 (const char *str, unsigned long *n);
int gf_string2uint_base10 (const char *str, unsigned int *n);
int gf_string2uint8_base10 (const char *str, uint8_t *n);
int gf_string2uint16_base10 (const char *str, uint16_t *n);
int gf_string2uint32_base10 (const char *str, uint32_t *n);
int gf_string2uint64_base10 (const char *str, uint64_t *n);
int gf_string2bytesize (const char *str, uint64_t *n);
int gf_string2percent_or_bytesize (const char *str, uint64_t *n,
gf_boolean_t *is_percent);
int gf_string2boolean (const char *str, gf_boolean_t *b);
int gf_string2percent (const char *str, uint32_t *n);
int gf_string2time (const char *str, uint32_t *n);
int gf_lockfd (int fd);
int gf_unlockfd (int fd);
int get_checksum_for_file (int fd, uint32_t *checksum);
int log_base2 (unsigned long x);
int get_checksum_for_path (char *path, uint32_t *checksum);
char *strtail (char *str, const char *pattern);
void skipwhite (char **s);
char *nwstrtail (char *str, char *pattern);
void skip_word (char **str);
/* returns a new string with nth word of given string. n>=1 */
char *get_nth_word (const char *str, int n);
char valid_host_name (char *address, int length);
char valid_ipv4_address (char *address, int length, gf_boolean_t wildcard_acc);
char valid_ipv6_address (char *address, int length, gf_boolean_t wildcard_acc);
char valid_internet_address (char *address, gf_boolean_t wildcard_acc);
char valid_ipv4_wildcard_check (char *address);
char valid_ipv6_wildcard_check (char *address);
char valid_wildcard_internet_address (char *address);
char *uuid_utoa (uuid_t uuid);
char *uuid_utoa_r (uuid_t uuid, char *dst);
char *lkowner_utoa (gf_lkowner_t *lkowner);
char *lkowner_utoa_r (gf_lkowner_t *lkowner, char *dst, int len);
void gf_array_insertionsort (void *a, int l, int r, size_t elem_size,
gf_cmp cmp);
int gf_is_str_int (const char *value);
char *gf_uint64_2human_readable (uint64_t);
int validate_brick_name (char *brick);
char *get_host_name (char *word, char **host);
char *get_path_name (char *word, char **path);
void gf_path_strip_trailing_slashes (char *path);
uint64_t get_mem_size ();
int gf_client_pid_check (gf_client_pid_t npid);
#endif /* _COMMON_UTILS_H */
|