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
|
/*
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.
*/
#ifndef _FD_H
#define _FD_H
#ifndef _CONFIG_H
#define _CONFIG_H
#include "config.h"
#endif
#include "list.h"
#include <sys/types.h>
#include <unistd.h>
#include "glusterfs.h"
#include "locking.h"
#include "fd-lk.h"
struct _inode;
struct _dict;
struct fd_lk_ctx;
struct _fd_ctx {
union {
uint64_t key;
void *xl_key;
};
union {
uint64_t value1;
void *ptr1;
};
};
/* If this structure changes, please have mercy on the booster maintainer
* and update the fd_t struct in booster/src/booster-fd.h.
* See the comment there to know why.
*/
struct _fd {
uint64_t pid;
int32_t flags;
int32_t refcount;
struct list_head inode_list;
struct _inode *inode;
gf_lock_t lock; /* used ONLY for manipulating
'struct _fd_ctx' array (_ctx).*/
struct _fd_ctx *_ctx;
int xl_count; /* Number of xl referred in this fd */
struct fd_lk_ctx *lk_ctx;
};
typedef struct _fd fd_t;
struct fd_table_entry {
fd_t *fd;
int next_free;
};
typedef struct fd_table_entry fdentry_t;
struct _fdtable {
int refcount;
uint32_t max_fds;
pthread_mutex_t lock;
fdentry_t *fdentries;
int first_free;
};
typedef struct _fdtable fdtable_t;
/* Signifies no more entries in the fd table. */
#define GF_FDTABLE_END -1
/* This is used to invalidated
* the next_free value in an fdentry that has been allocated
*/
#define GF_FDENTRY_ALLOCATED -2
#include "logging.h"
#include "xlator.h"
inline void
gf_fd_put (fdtable_t *fdtable, int32_t fd);
fd_t *
gf_fd_fdptr_get (fdtable_t *fdtable, int64_t fd);
fdtable_t *
gf_fd_fdtable_alloc (void);
int
gf_fd_unused_get (fdtable_t *fdtable, fd_t *fdptr);
fdentry_t *
gf_fd_fdtable_get_all_fds (fdtable_t *fdtable, uint32_t *count);
void
gf_fd_fdtable_destroy (fdtable_t *fdtable);
fd_t *
__fd_ref (fd_t *fd);
fd_t *
fd_ref (fd_t *fd);
fd_t *
__fd_unref (fd_t *fd);
void
fd_unref (fd_t *fd);
fd_t *
fd_create (struct _inode *inode, pid_t pid);
fd_t *
fd_create_uint64 (struct _inode *inode, uint64_t pid);
fd_t *
fd_lookup (struct _inode *inode, pid_t pid);
fd_t *
fd_lookup_uint64 (struct _inode *inode, uint64_t pid);
fd_t *
fd_anonymous (inode_t *inode);
gf_boolean_t
fd_is_anonymous (fd_t *fd);
uint8_t
fd_list_empty (struct _inode *inode);
fd_t *
fd_bind (fd_t *fd);
fd_t *
__fd_bind (fd_t *fd);
int
fd_ctx_set (fd_t *fd, xlator_t *xlator, uint64_t value);
int
fd_ctx_get (fd_t *fd, xlator_t *xlator, uint64_t *value);
int
fd_ctx_del (fd_t *fd, xlator_t *xlator, uint64_t *value);
int
__fd_ctx_set (fd_t *fd, xlator_t *xlator, uint64_t value);
int
__fd_ctx_get (fd_t *fd, xlator_t *xlator, uint64_t *value);
int
__fd_ctx_del (fd_t *fd, xlator_t *xlator, uint64_t *value);
fd_t *
__fd_ref (fd_t *fd);
void
fd_ctx_dump (fd_t *fd, char *prefix);
fdentry_t *
gf_fd_fdtable_copy_all_fds (fdtable_t *fdtable, uint32_t *count);
fdentry_t *
__gf_fd_fdtable_copy_all_fds (fdtable_t *fdtable, uint32_t *count);
void
gf_fdptr_put (fdtable_t *fdtable, fd_t *fd);
#endif /* _FD_H */
|
