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
|
/*
Copyright (c) 2012 Red Hat <http://www.redhat.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 _LK_OWNER_H
#define _LK_OWNER_H
#ifndef _CONFIG_H
#define _CONFIG_H
#include "config.h"
#endif
#define GF_MAX_LOCK_OWNER_LEN 1024 /* 1kB as per NLM */
/* 16strings-16strings-... */
#define GF_LKOWNER_BUF_SIZE ((GF_MAX_LOCK_OWNER_LEN * 2) + \
(GF_MAX_LOCK_OWNER_LEN / 8))
typedef struct gf_lkowner_ {
int len;
char data[GF_MAX_LOCK_OWNER_LEN];
} gf_lkowner_t;
/* LKOWNER to string functions */
static inline void
lkowner_unparse (gf_lkowner_t *lkowner, char *buf, int buf_len)
{
int i = 0;
int j = 0;
for (i = 0; i < lkowner->len; i++) {
if (i && !(i % 8)) {
buf[j] = '-';
j++;
}
sprintf (&buf[j], "%02hhx", lkowner->data[i]);
j += 2;
if (j == buf_len)
break;
}
if (j < buf_len)
buf[j] = '\0';
}
static inline void
set_lk_owner_from_ptr (gf_lkowner_t *lkowner, void *data)
{
int i = 0;
int j = 0;
lkowner->len = sizeof (unsigned long);
for (i = 0, j = 0; i < lkowner->len; i++, j += 8) {
lkowner->data[i] = (char)((((unsigned long)data) >> j) & 0xff);
}
}
static inline void
set_lk_owner_from_uint64 (gf_lkowner_t *lkowner, uint64_t data)
{
int i = 0;
int j = 0;
lkowner->len = 8;
for (i = 0, j = 0; i < lkowner->len; i++, j += 8) {
lkowner->data[i] = (char)((data >> j) & 0xff);
}
}
/* Return true if the locks have the same owner */
static inline int
is_same_lkowner (gf_lkowner_t *l1, gf_lkowner_t *l2)
{
return ((l1->len == l2->len) && !memcmp(l1->data, l2->data, l1->len));
}
#endif /* _LK_OWNER_H */
|
