/
find.c
448 lines (413 loc) · 14.5 KB
/
find.c
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
/*
BAREOS® - Backup Archiving REcovery Open Sourced
Copyright (C) 2000-2012 Free Software Foundation Europe e.V.
Copyright (C) 2011-2012 Planets Communications B.V.
Copyright (C) 2013-2013 Bareos GmbH & Co. KG
This program is Free Software; you can redistribute it and/or
modify it under the terms of version three of the GNU Affero General Public
License as published by the Free Software Foundation and included
in the file LICENSE.
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
Affero General Public License for more details.
You should have received a copy of the GNU Affero General Public License
along with this program; if not, write to the Free Software
Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301, USA.
*/
/*
* Main routine for finding files on a file system.
* The heart of the work to find the files on the
* system is done in find_one.c. Here we have the
* higher level control as well as the matching
* routines for the new syntax Options resource.
*
* Kern E. Sibbald, MM
*/
#include "bareos.h"
#include "find.h"
static const int dbglvl = 450;
int32_t name_max; /* filename max length */
int32_t path_max; /* path name max length */
#ifdef DEBUG
#undef bmalloc
#define bmalloc(x) sm_malloc(__FILE__, __LINE__, x)
#endif
static int our_callback(JCR *jcr, FF_PKT *ff, bool top_level);
static const int fnmode = 0;
/*
* Initialize the find files "global" variables
*/
FF_PKT *init_find_files()
{
FF_PKT *ff;
ff = (FF_PKT *)bmalloc(sizeof(FF_PKT));
memset(ff, 0, sizeof(FF_PKT));
ff->sys_fname = get_pool_memory(PM_FNAME);
/* Get system path and filename maximum lengths */
path_max = pathconf(".", _PC_PATH_MAX);
if (path_max < 2048) {
path_max = 2048;
}
name_max = pathconf(".", _PC_NAME_MAX);
if (name_max < 2048) {
name_max = 2048;
}
path_max++; /* add for EOS */
name_max++; /* add for EOS */
Dmsg1(dbglvl, "init_find_files ff=%p\n", ff);
return ff;
}
/*
* Set find_files options. For the moment, we only
* provide for full/incremental saves, and setting
* of save_time. For additional options, see above
*/
void set_find_options(FF_PKT *ff, int incremental, time_t save_time)
{
Dmsg0(dbglvl, "Enter set_find_options()\n");
ff->incremental = incremental;
ff->save_time = save_time;
Dmsg0(dbglvl, "Leave set_find_options()\n");
}
void set_find_changed_function(FF_PKT *ff, bool check_fct(JCR *jcr, FF_PKT *ff))
{
Dmsg0(dbglvl, "Enter set_find_changed_function()\n");
ff->check_fct = check_fct;
}
/*
* Call this subroutine with a callback subroutine as the first
* argument and a packet as the second argument, this packet
* will be passed back to the callback subroutine as the last
* argument.
*
*/
int find_files(JCR *jcr, FF_PKT *ff, int file_save(JCR *jcr, FF_PKT *ff_pkt, bool top_level),
int plugin_save(JCR *jcr, FF_PKT *ff_pkt, bool top_level))
{
ff->file_save = file_save;
ff->plugin_save = plugin_save;
/* This is the new way */
findFILESET *fileset = ff->fileset;
if (fileset) {
int i, j;
/* TODO: We probably need be move the initialization in the fileset loop,
* at this place flags options are "concatenated" accross Include {} blocks
* (not only Options{} blocks inside a Include{})
*/
ff->flags = 0;
for (i = 0; i < fileset->include_list.size(); i++) {
findINCEXE *incexe = (findINCEXE *)fileset->include_list.get(i);
fileset->incexe = incexe;
/* Here, we reset some values between two different Include{} */
strcpy(ff->VerifyOpts, "V");
strcpy(ff->AccurateOpts, "Cmcs"); /* mtime+ctime+size by default */
strcpy(ff->BaseJobOpts, "Jspug5"); /* size+perm+user+group+chk */
ff->plugin = NULL;
ff->opt_plugin = false;
/*
* By setting all options, we in effect OR the global options
* which is what we want.
*/
for (j = 0; j < incexe->opts_list.size(); j++) {
findFOPTS *fo = (findFOPTS *)incexe->opts_list.get(j);
ff->flags |= fo->flags;
ff->Compress_algo = fo->Compress_algo;
ff->Compress_level = fo->Compress_level;
ff->strip_path = fo->strip_path;
ff->size_match = fo->size_match;
ff->fstypes = fo->fstype;
ff->drivetypes = fo->drivetype;
if (fo->plugin != NULL) {
ff->plugin = fo->plugin; /* TODO: generate a plugin event ? */
ff->opt_plugin = true;
}
bstrncat(ff->VerifyOpts, fo->VerifyOpts, sizeof(ff->VerifyOpts)); /* TODO: Concat or replace? */
if (fo->AccurateOpts[0]) {
bstrncpy(ff->AccurateOpts, fo->AccurateOpts, sizeof(ff->AccurateOpts));
}
if (fo->BaseJobOpts[0]) {
bstrncpy(ff->BaseJobOpts, fo->BaseJobOpts, sizeof(ff->BaseJobOpts));
}
}
Dmsg4(50, "Verify=<%s> Accurate=<%s> BaseJob=<%s> flags=<%d>\n",
ff->VerifyOpts, ff->AccurateOpts, ff->BaseJobOpts, ff->flags);
dlistString *node;
foreach_dlist(node, &incexe->name_list) {
char *fname = node->c_str();
Dmsg1(dbglvl, "F %s\n", fname);
ff->top_fname = fname;
if (find_one_file(jcr, ff, our_callback, ff->top_fname, (dev_t)-1, true) == 0) {
return 0; /* error return */
}
if (job_canceled(jcr)) {
return 0;
}
}
foreach_dlist(node, &incexe->plugin_list) {
char *fname = node->c_str();
if (!plugin_save) {
Jmsg(jcr, M_FATAL, 0, _("Plugin: \"%s\" not found.\n"), fname);
return 0;
}
Dmsg1(dbglvl, "PluginCommand: %s\n", fname);
ff->top_fname = fname;
ff->cmd_plugin = true;
plugin_save(jcr, ff, true);
ff->cmd_plugin = false;
if (job_canceled(jcr)) {
return 0;
}
}
}
}
return 1;
}
/*
* Test if the currently selected directory (in ff->fname) is
* explicitly in the Include list or explicitly in the Exclude
* list.
*/
bool is_in_fileset(FF_PKT *ff)
{
dlistString *node;
char *fname;
int i;
findINCEXE *incexe;
findFILESET *fileset = ff->fileset;
if (fileset) {
for (i = 0; i < fileset->include_list.size(); i++) {
incexe = (findINCEXE *)fileset->include_list.get(i);
foreach_dlist(node, &incexe->name_list) {
fname = node->c_str();
Dmsg2(dbglvl, "Inc fname=%s ff->fname=%s\n", fname, ff->fname);
if (bstrcmp(fname, ff->fname)) {
return true;
}
}
}
for (i = 0; i < fileset->exclude_list.size(); i++) {
incexe = (findINCEXE *)fileset->exclude_list.get(i);
foreach_dlist(node, &incexe->name_list) {
fname = node->c_str();
Dmsg2(dbglvl, "Exc fname=%s ff->fname=%s\n", fname, ff->fname);
if (bstrcmp(fname, ff->fname)) {
return true;
}
}
}
}
return false;
}
bool accept_file(FF_PKT *ff)
{
int i, j, k;
int fnm_flags;
findFILESET *fileset = ff->fileset;
findINCEXE *incexe = fileset->incexe;
const char *basename;
int (*match_func)(const char *pattern, const char *string, int flags);
Dmsg1(dbglvl, "enter accept_file: fname=%s\n", ff->fname);
if (ff->flags & FO_ENHANCEDWILD) {
match_func = fnmatch;
if ((basename = last_path_separator(ff->fname)) != NULL)
basename++;
else
basename = ff->fname;
} else {
match_func = fnmatch;
basename = ff->fname;
}
for (j = 0; j < incexe->opts_list.size(); j++) {
findFOPTS *fo = (findFOPTS *)incexe->opts_list.get(j);
ff->flags = fo->flags;
ff->Compress_algo = fo->Compress_algo;
ff->Compress_level = fo->Compress_level;
ff->fstypes = fo->fstype;
ff->drivetypes = fo->drivetype;
fnm_flags = (ff->flags & FO_IGNORECASE) ? FNM_CASEFOLD : 0;
fnm_flags |= (ff->flags & FO_ENHANCEDWILD) ? FNM_PATHNAME : 0;
if (S_ISDIR(ff->statp.st_mode)) {
for (k = 0; k < fo->wilddir.size(); k++) {
if (match_func((char *)fo->wilddir.get(k), ff->fname, fnmode|fnm_flags) == 0) {
if (ff->flags & FO_EXCLUDE) {
Dmsg2(dbglvl, "Exclude wilddir: %s file=%s\n", (char *)fo->wilddir.get(k),
ff->fname);
return false; /* reject dir */
}
return true; /* accept dir */
}
}
} else {
for (k = 0; k < fo->wildfile.size(); k++) {
if (match_func((char *)fo->wildfile.get(k), ff->fname, fnmode|fnm_flags) == 0) {
if (ff->flags & FO_EXCLUDE) {
Dmsg2(dbglvl, "Exclude wildfile: %s file=%s\n", (char *)fo->wildfile.get(k),
ff->fname);
return false; /* reject file */
}
return true; /* accept file */
}
}
for (k = 0; k < fo->wildbase.size(); k++) {
if (match_func((char *)fo->wildbase.get(k), basename, fnmode|fnm_flags) == 0) {
if (ff->flags & FO_EXCLUDE) {
Dmsg2(dbglvl, "Exclude wildbase: %s file=%s\n", (char *)fo->wildbase.get(k),
basename);
return false; /* reject file */
}
return true; /* accept file */
}
}
}
for (k = 0; k < fo->wild.size(); k++) {
if (match_func((char *)fo->wild.get(k), ff->fname, fnmode|fnm_flags) == 0) {
if (ff->flags & FO_EXCLUDE) {
Dmsg2(dbglvl, "Exclude wild: %s file=%s\n", (char *)fo->wild.get(k),
ff->fname);
return false; /* reject file */
}
return true; /* accept file */
}
}
if (S_ISDIR(ff->statp.st_mode)) {
for (k = 0; k < fo->regexdir.size(); k++) {
const int nmatch = 30;
regmatch_t pmatch[nmatch];
if (regexec((regex_t *)fo->regexdir.get(k), ff->fname, nmatch, pmatch, 0) == 0) {
if (ff->flags & FO_EXCLUDE) {
return false; /* reject file */
}
return true; /* accept file */
}
}
} else {
for (k = 0; k < fo->regexfile.size(); k++) {
const int nmatch = 30;
regmatch_t pmatch[nmatch];
if (regexec((regex_t *)fo->regexfile.get(k), ff->fname, nmatch, pmatch, 0) == 0) {
if (ff->flags & FO_EXCLUDE) {
return false; /* reject file */
}
return true; /* accept file */
}
}
}
for (k = 0; k < fo->regex.size(); k++) {
const int nmatch = 30;
regmatch_t pmatch[nmatch];
if (regexec((regex_t *)fo->regex.get(k), ff->fname, nmatch, pmatch, 0) == 0) {
if (ff->flags & FO_EXCLUDE) {
return false; /* reject file */
}
return true; /* accept file */
}
}
/*
* If we have an empty Options clause with exclude, then
* exclude the file
*/
if (ff->flags & FO_EXCLUDE &&
fo->regex.size() == 0 && fo->wild.size() == 0 &&
fo->regexdir.size() == 0 && fo->wilddir.size() == 0 &&
fo->regexfile.size() == 0 && fo->wildfile.size() == 0 &&
fo->wildbase.size() == 0) {
return false; /* reject file */
}
}
/*
* Now apply the Exclude { } directive
*/
for (i = 0; i < fileset->exclude_list.size(); i++) {
findINCEXE *incexe = (findINCEXE *)fileset->exclude_list.get(i);
for (j = 0; j < incexe->opts_list.size(); j++) {
findFOPTS *fo = (findFOPTS *)incexe->opts_list.get(j);
fnm_flags = (fo->flags & FO_IGNORECASE) ? FNM_CASEFOLD : 0;
for (k = 0; k < fo->wild.size(); k++) {
if (fnmatch((char *)fo->wild.get(k), ff->fname, fnmode|fnm_flags) == 0) {
Dmsg1(dbglvl, "Reject wild1: %s\n", ff->fname);
return false; /* reject file */
}
}
}
fnm_flags = (incexe->current_opts != NULL &&
incexe->current_opts->flags & FO_IGNORECASE) ? FNM_CASEFOLD : 0;
dlistString *node;
foreach_dlist(node, &incexe->name_list) {
char *fname = node->c_str();
if (fnmatch(fname, ff->fname, fnmode|fnm_flags) == 0) {
Dmsg1(dbglvl, "Reject wild2: %s\n", ff->fname);
return false; /* reject file */
}
}
}
return true;
}
/*
* The code comes here for each file examined.
* We filter the files, then call the user's callback if
* the file is included.
*/
static int our_callback(JCR *jcr, FF_PKT *ff, bool top_level)
{
if (top_level) {
return ff->file_save(jcr, ff, top_level); /* accept file */
}
switch (ff->type) {
case FT_NOACCESS:
case FT_NOFOLLOW:
case FT_NOSTAT:
case FT_NOCHG:
case FT_ISARCH:
case FT_NORECURSE:
case FT_NOFSCHG:
case FT_INVALIDFS:
case FT_INVALIDDT:
case FT_NOOPEN:
// return ff->file_save(jcr, ff, top_level);
/* These items can be filtered */
case FT_LNKSAVED:
case FT_REGE:
case FT_REG:
case FT_LNK:
case FT_DIRBEGIN:
case FT_DIREND:
case FT_RAW:
case FT_FIFO:
case FT_SPEC:
case FT_DIRNOCHG:
case FT_REPARSE:
case FT_JUNCTION:
if (accept_file(ff)) {
return ff->file_save(jcr, ff, top_level);
} else {
Dmsg1(dbglvl, "Skip file %s\n", ff->fname);
return -1; /* ignore this file */
}
default:
Dmsg1(000, "Unknown FT code %d\n", ff->type);
return 0;
}
}
/*
* Terminate find_files() and release
* all allocated memory
*/
int term_find_files(FF_PKT *ff)
{
int hard_links;
free_pool_memory(ff->sys_fname);
if (ff->fname_save) {
free_pool_memory(ff->fname_save);
}
if (ff->link_save) {
free_pool_memory(ff->link_save);
}
if (ff->ignoredir_fname) {
free_pool_memory(ff->ignoredir_fname);
}
hard_links = term_find_one(ff);
free(ff);
return hard_links;
}