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
|
/*
* Force a readahead of files by opening them and reading the first bytes
*
* Copyright (C) Volker Lendecke 2008
*
* This program 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 2 of the License, or
* (at your option) any later version.
*
* This program 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, write to the Free Software
* Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include "includes.h"
struct preopen_state;
struct preopen_helper {
struct preopen_state *state;
struct fd_event *fde;
pid_t pid;
int fd;
bool busy;
};
struct preopen_state {
int num_helpers;
struct preopen_helper *helpers;
size_t to_read; /* How many bytes to read in children? */
int queue_max;
char *template_fname; /* Filename to be sent to children */
size_t number_start; /* start offset into "template_fname" */
int num_digits; /* How many digits is the number long? */
int fnum_sent; /* last fname sent to children */
int fnum_queue_end; /* last fname to be sent, based on
* last open call + preopen:queuelen
*/
name_compare_entry *preopen_names;
};
static void preopen_helper_destroy(struct preopen_helper *c)
{
int status;
close(c->fd);
c->fd = -1;
kill(c->pid, SIGKILL);
waitpid(c->pid, &status, 0);
c->busy = true;
}
static void preopen_queue_run(struct preopen_state *state)
{
char *pdelimiter;
char delimiter;
pdelimiter = state->template_fname + state->number_start
+ state->num_digits;
delimiter = *pdelimiter;
while (state->fnum_sent < state->fnum_queue_end) {
ssize_t written;
size_t to_write;
int helper;
for (helper=0; helper<state->num_helpers; helper++) {
if (state->helpers[helper].busy) {
continue;
}
break;
}
if (helper == state->num_helpers) {
/* everyone is busy */
return;
}
snprintf(state->template_fname + state->number_start,
state->num_digits + 1,
"%.*lu", state->num_digits,
(long unsigned int)(state->fnum_sent + 1));
*pdelimiter = delimiter;
to_write = talloc_get_size(state->template_fname);
written = write_data(state->helpers[helper].fd,
state->template_fname, to_write);
state->helpers[helper].busy = true;
if (written != to_write) {
preopen_helper_destroy(&state->helpers[helper]);
}
state->fnum_sent += 1;
}
}
static void preopen_helper_readable(struct event_context *ev,
struct fd_event *fde, uint16_t flags,
void *priv)
{
struct preopen_helper *helper = (struct preopen_helper *)priv;
struct preopen_state *state = helper->state;
ssize_t nread;
char c;
if ((flags & EVENT_FD_READ) == 0) {
return;
}
nread = read(helper->fd, &c, 1);
if (nread <= 0) {
preopen_helper_destroy(helper);
return;
}
helper->busy = false;
preopen_queue_run(state);
}
static int preopen_helpers_destructor(struct preopen_state *c)
{
int i;
for (i=0; i<c->num_helpers; i++) {
if (c->helpers[i].fd == -1) {
continue;
}
preopen_helper_destroy(&c->helpers[i]);
}
return 0;
}
static bool preopen_helper_open_one(int sock_fd, char **pnamebuf,
size_t to_read, void *filebuf)
{
char *namebuf = *pnamebuf;
ssize_t nwritten, nread;
char c = 0;
int fd;
nread = 0;
while ((nread == 0) || (namebuf[nread-1] != '\0')) {
ssize_t thistime;
thistime = read(sock_fd, namebuf + nread,
talloc_get_size(namebuf) - nread);
if (thistime <= 0) {
return false;
}
nread += thistime;
if (nread == talloc_get_size(namebuf)) {
namebuf = TALLOC_REALLOC_ARRAY(
NULL, namebuf, char,
talloc_get_size(namebuf) * 2);
if (namebuf == NULL) {
return false;
}
*pnamebuf = namebuf;
}
}
fd = open(namebuf, O_RDONLY);
if (fd == -1) {
goto done;
}
nread = read(fd, filebuf, to_read);
close(fd);
done:
nwritten = write(sock_fd, &c, 1);
return true;
}
static bool preopen_helper(int fd, size_t to_read)
{
char *namebuf;
void *readbuf;
namebuf = TALLOC_ARRAY(NULL, char, 1024);
if (namebuf == NULL) {
return false;
}
readbuf = talloc_size(NULL, to_read);
if (readbuf == NULL) {
TALLOC_FREE(namebuf);
return false;
}
while (preopen_helper_open_one(fd, &namebuf, to_read, readbuf)) {
;
}
TALLOC_FREE(readbuf);
TALLOC_FREE(namebuf);
return false;
}
static NTSTATUS preopen_init_helper(struct preopen_helper *h)
{
int fdpair[2];
NTSTATUS status;
if (socketpair(AF_UNIX, SOCK_STREAM, 0, fdpair) == -1) {
status = map_nt_error_from_unix(errno);
DEBUG(10, ("socketpair() failed: %s\n", strerror(errno)));
return status;
}
h->pid = sys_fork();
if (h->pid == -1) {
return map_nt_error_from_unix(errno);
}
if (h->pid == 0) {
close(fdpair[0]);
preopen_helper(fdpair[1], h->state->to_read);
exit(0);
}
close(fdpair[1]);
h->fd = fdpair[0];
h->fde = event_add_fd(smbd_event_context(), h->state, h->fd,
EVENT_FD_READ, preopen_helper_readable, h);
if (h->fde == NULL) {
close(h->fd);
h->fd = -1;
return NT_STATUS_NO_MEMORY;
}
h->busy = false;
return NT_STATUS_OK;
}
static NTSTATUS preopen_init_helpers(TALLOC_CTX *mem_ctx, size_t to_read,
int num_helpers, int queue_max,
struct preopen_state **presult)
{
struct preopen_state *result;
int i;
result = talloc(mem_ctx, struct preopen_state);
if (result == NULL) {
return NT_STATUS_NO_MEMORY;
}
result->num_helpers = num_helpers;
result->helpers = TALLOC_ARRAY(result, struct preopen_helper,
num_helpers);
if (result->helpers == NULL) {
TALLOC_FREE(result);
return NT_STATUS_NO_MEMORY;
}
result->to_read = to_read;
result->queue_max = queue_max;
result->template_fname = NULL;
result->fnum_sent = 0;
for (i=0; i<num_helpers; i++) {
result->helpers[i].state = result;
result->helpers[i].fd = -1;
}
talloc_set_destructor(result, preopen_helpers_destructor);
for (i=0; i<num_helpers; i++) {
preopen_init_helper(&result->helpers[i]);
}
*presult = result;
return NT_STATUS_OK;
}
static void preopen_free_helpers(void **ptr)
{
TALLOC_FREE(*ptr);
}
static struct preopen_state *preopen_state_get(vfs_handle_struct *handle)
{
struct preopen_state *state;
NTSTATUS status;
const char *namelist;
if (SMB_VFS_HANDLE_TEST_DATA(handle)) {
SMB_VFS_HANDLE_GET_DATA(handle, state, struct preopen_state,
return NULL);
return state;
}
namelist = lp_parm_const_string(SNUM(handle->conn), "preopen", "names",
NULL);
if (namelist == NULL) {
return NULL;
}
status = preopen_init_helpers(
NULL,
lp_parm_int(SNUM(handle->conn), "preopen", "num_bytes", 1),
lp_parm_int(SNUM(handle->conn), "preopen", "helpers", 1),
lp_parm_int(SNUM(handle->conn), "preopen", "queuelen", 10),
&state);
if (!NT_STATUS_IS_OK(status)) {
return NULL;
}
set_namearray(&state->preopen_names, (char *)namelist);
if (state->preopen_names == NULL) {
TALLOC_FREE(state);
return NULL;
}
if (!SMB_VFS_HANDLE_TEST_DATA(handle)) {
SMB_VFS_HANDLE_SET_DATA(handle, state, preopen_free_helpers,
struct preopen_state, return NULL);
}
return state;
}
static bool preopen_parse_fname(const char *fname, unsigned long *pnum,
size_t *pstart_idx, int *pnum_digits)
{
const char *p, *q;
unsigned long num;
p = strrchr_m(fname, '/');
if (p == NULL) {
p = fname;
}
p += 1;
while (p[0] != '\0') {
if (isdigit(p[0]) && isdigit(p[1]) && isdigit(p[2])) {
break;
}
p += 1;
}
if (*p == '\0') {
/* no digits around */
return false;
}
num = strtoul(p, (char **)&q, 10);
if (num+1 < num) {
/* overflow */
return false;
}
*pnum = num;
*pstart_idx = (p - fname);
*pnum_digits = (q - p);
return true;
}
static int preopen_open(vfs_handle_struct *handle,
struct smb_filename *smb_fname, files_struct *fsp,
int flags, mode_t mode)
{
struct preopen_state *state;
int res;
unsigned long num;
DEBUG(10, ("preopen_open called on %s\n", smb_fname_str_dbg(smb_fname)));
state = preopen_state_get(handle);
if (state == NULL) {
return SMB_VFS_NEXT_OPEN(handle, smb_fname, fsp, flags, mode);
}
res = SMB_VFS_NEXT_OPEN(handle, smb_fname, fsp, flags, mode);
if (res == -1) {
return -1;
}
if (flags != O_RDONLY) {
return res;
}
if (!is_in_path(smb_fname->base_name, state->preopen_names, true)) {
DEBUG(10, ("%s does not match the preopen:names list\n",
smb_fname_str_dbg(smb_fname)));
return res;
}
TALLOC_FREE(state->template_fname);
state->template_fname = talloc_asprintf(
state, "%s/%s", fsp->conn->connectpath, smb_fname->base_name);
if (state->template_fname == NULL) {
return res;
}
if (!preopen_parse_fname(state->template_fname, &num,
&state->number_start, &state->num_digits)) {
TALLOC_FREE(state->template_fname);
return res;
}
if (num > state->fnum_sent) {
/*
* Helpers were too slow, there's no point in reading
* files in helpers that we already read in the
* parent.
*/
state->fnum_sent = num;
}
if ((state->fnum_queue_end != 0) /* Something was started earlier */
&& (num < (state->fnum_queue_end - state->queue_max))) {
/*
* "num" is before the queue we announced. This means
* a new run is started.
*/
state->fnum_sent = num;
}
state->fnum_queue_end = num + state->queue_max;
preopen_queue_run(state);
return res;
}
/* VFS operations structure */
static vfs_op_tuple preopen_ops[] = {
{SMB_VFS_OP(preopen_open), SMB_VFS_OP_OPEN,
SMB_VFS_LAYER_TRANSPARENT},
{SMB_VFS_OP(NULL), SMB_VFS_OP_NOOP,
SMB_VFS_LAYER_NOOP}
};
NTSTATUS vfs_preopen_init(void);
NTSTATUS vfs_preopen_init(void)
{
return smb_register_vfs(SMB_VFS_INTERFACE_VERSION,
"preopen", preopen_ops);
}
|