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
|
/*
Copyright (c) 2009 Z RESEARCH, Inc. <http://www.zresearch.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/>.
*/
#include "glusterfs.h"
#include "afr.h"
#include "xlator.h"
#include "dict.h"
#include "xlator.h"
#include "hashfn.h"
#include "logging.h"
#include "stack.h"
#include "list.h"
#include "call-stub.h"
#include "defaults.h"
#include "common-utils.h"
#include "compat-errno.h"
#include "compat.h"
#include "byte-order.h"
#include "md5.h"
#include "afr-transaction.h"
#include "afr-self-heal.h"
#include "afr-self-heal-common.h"
#include "afr-self-heal-algorithm.h"
/*
This file contains the various self-heal algorithms
*/
/*
The "full" algorithm. Copies the entire file from
source to sinks.
*/
static int
sh_full_read_write_iter (call_frame_t *frame, xlator_t *this);
static int
sh_full_write_cbk (call_frame_t *frame, void *cookie, xlator_t *this,
int32_t op_ret, int32_t op_errno, struct stat *buf)
{
afr_private_t * priv = NULL;
afr_local_t * local = NULL;
afr_self_heal_t *sh = NULL;
int child_index = (long) cookie;
int call_count = 0;
priv = this->private;
local = frame->local;
sh = &local->self_heal;
gf_log (this->name, GF_LOG_TRACE,
"wrote %d bytes of data from %s to child %d, offset %"PRId64"",
op_ret, local->loc.path, child_index, sh->offset - op_ret);
LOCK (&frame->lock);
{
if (op_ret == -1) {
gf_log (this->name, GF_LOG_DEBUG,
"write to %s failed on subvolume %s (%s)",
local->loc.path,
priv->children[child_index]->name,
strerror (op_errno));
sh->op_failed = 1;
}
}
UNLOCK (&frame->lock);
call_count = afr_frame_return (frame);
if (call_count == 0) {
sh_full_read_write_iter (frame, this);
}
return 0;
}
static int
sh_full_read_cbk (call_frame_t *frame, void *cookie,
xlator_t *this, int32_t op_ret, int32_t op_errno,
struct iovec *vector, int32_t count, struct stat *buf,
struct iobref *iobref)
{
afr_private_t * priv = NULL;
afr_local_t * local = NULL;
afr_self_heal_t *sh = NULL;
int child_index = (long) cookie;
int i = 0;
int call_count = 0;
off_t offset;
priv = this->private;
local = frame->local;
sh = &local->self_heal;
call_count = sh->active_sinks;
local->call_count = call_count;
gf_log (this->name, GF_LOG_TRACE,
"read %d bytes of data from %s on child %d, offset %"PRId64"",
op_ret, local->loc.path, child_index, sh->offset);
if (op_ret <= 0) {
local->self_heal.algo_completion_cbk (frame, this);
return 0;
}
/* what if we read less than block size? */
offset = sh->offset;
sh->offset += op_ret;
if (sh->file_has_holes) {
if (iov_0filled (vector, count) == 0) {
/* the iter function depends on the
sh->offset already being updated
above
*/
sh_full_read_write_iter (frame, this);
goto out;
}
}
for (i = 0; i < priv->child_count; i++) {
if (sh->sources[i] || !local->child_up[i])
continue;
/* this is a sink, so write to it */
STACK_WIND_COOKIE (frame, sh_full_write_cbk,
(void *) (long) i,
priv->children[i],
priv->children[i]->fops->writev,
sh->healing_fd, vector, count, offset,
iobref);
if (!--call_count)
break;
}
out:
return 0;
}
static int
sh_full_read_write (call_frame_t *frame, xlator_t *this)
{
afr_private_t * priv = NULL;
afr_local_t * local = NULL;
afr_self_heal_t *sh = NULL;
priv = this->private;
local = frame->local;
sh = &local->self_heal;
STACK_WIND_COOKIE (frame, sh_full_read_cbk,
(void *) (long) sh->source,
priv->children[sh->source],
priv->children[sh->source]->fops->readv,
sh->healing_fd, sh->block_size,
sh->offset);
return 0;
}
static int
sh_full_read_write_iter (call_frame_t *frame, xlator_t *this)
{
afr_private_t * priv = NULL;
afr_local_t * local = NULL;
afr_self_heal_t *sh = NULL;
priv = this->private;
local = frame->local;
sh = &local->self_heal;
if (sh->op_failed) {
local->self_heal.algo_abort_cbk (frame, this);
goto out;
}
if (sh->offset >= sh->file_size) {
gf_log (this->name, GF_LOG_TRACE,
"closing fd's of %s",
local->loc.path);
local->self_heal.algo_completion_cbk (frame, this);
goto out;
}
sh_full_read_write (frame, this);
out:
return 0;
}
int
afr_sh_algo_full (call_frame_t *frame, xlator_t *this)
{
sh_full_read_write (frame, this);
return 0;
}
struct afr_sh_algorithm afr_self_heal_algorithms[] = {
{.name = "full", .fn = afr_sh_algo_full},
};
|
