2 Bacula® - The Network Backup Solution
4 Copyright (C) 2000-2008 Free Software Foundation Europe e.V.
6 The main author of Bacula is Kern Sibbald, with contributions from
7 many others, a complete list can be found in the file AUTHORS.
8 This program is Free Software; you can redistribute it and/or
9 modify it under the terms of version two of the GNU General Public
10 License as published by the Free Software Foundation and included
13 This program is distributed in the hope that it will be useful, but
14 WITHOUT ANY WARRANTY; without even the implied warranty of
15 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
16 General Public License for more details.
18 You should have received a copy of the GNU General Public License
19 along with this program; if not, write to the Free Software
20 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
23 Bacula® is a registered trademark of John Walker.
24 The licensor of Bacula is the Free Software Foundation Europe
25 (FSFE), Fiduciary Program, Sumatrastrasse 25, 8006 Zürich,
26 Switzerland, email:ftf@fsfeurope.org.
29 * Main routine for finding files on a file system.
30 * The heart of the work to find the files on the
31 * system is done in find_one.c. Here we have the
32 * higher level control as well as the matching
33 * routines for the new syntax Options resource.
44 int32_t name_max; /* filename max length */
45 int32_t path_max; /* path name max length */
49 #define bmalloc(x) sm_malloc(__FILE__, __LINE__, x)
51 static int our_callback(FF_PKT *ff, void *hpkt, bool top_level);
52 static bool accept_file(FF_PKT *ff);
54 static const int fnmode = 0;
57 * Initialize the find files "global" variables
59 FF_PKT *init_find_files()
63 ff = (FF_PKT *)bmalloc(sizeof(FF_PKT));
64 memset(ff, 0, sizeof(FF_PKT));
66 ff->sys_fname = get_pool_memory(PM_FNAME);
68 /* Get system path and filename maximum lengths */
69 path_max = pathconf(".", _PC_PATH_MAX);
70 if (path_max < 1024) {
74 name_max = pathconf(".", _PC_NAME_MAX);
75 if (name_max < 1024) {
78 path_max++; /* add for EOS */
79 name_max++; /* add for EOS */
81 Dmsg1(100, "init_find_files ff=%p\n", ff);
86 * Set find_files options. For the moment, we only
87 * provide for full/incremental saves, and setting
88 * of save_time. For additional options, see above
91 set_find_options(FF_PKT *ff, int incremental, time_t save_time)
93 Dmsg0(100, "Enter set_find_options()\n");
94 ff->incremental = incremental;
95 ff->save_time = save_time;
96 Dmsg0(100, "Leave set_find_options()\n");
100 * For VSS we need to know which windows drives
101 * are used, because we create a snapshot of all used
102 * drives before operation
104 * the function returns the number of used drives and
105 * fills "drives" with up to 26 (A..Z) drive names
109 get_win32_driveletters(FF_PKT *ff, char* szDrives)
111 /* szDrives must be at least 27 bytes long */
113 #if !defined(HAVE_WIN32)
117 szDrives[0] = 0; /* make empty */
120 findFILESET *fileset = ff->fileset;
125 for (i=0; i<fileset->include_list.size(); i++) {
126 findINCEXE *incexe = (findINCEXE *)fileset->include_list.get(i);
128 /* look through all files and check */
129 foreach_dlist(node, &incexe->name_list) {
130 char *fname = node->c_str();
131 /* fname should match x:/ */
132 if (strlen(fname) >= 2 && B_ISALPHA(fname[0])
133 && fname[1] == ':') {
135 /* always add in uppercase */
136 char ch = toupper(fname[0]);
137 /* if not found in string, add drive letter */
138 if (!strchr(szDrives,ch)) {
139 szDrives[nCount] = ch;
140 szDrives[nCount+1] = 0;
151 * Call this subroutine with a callback subroutine as the first
152 * argument and a packet as the second argument, this packet
153 * will be passed back to the callback subroutine as the last
156 * The callback subroutine gets called with:
157 * arg1 -- the FF_PKT containing filename, link, stat, ftype, flags, etc
158 * arg2 -- the user supplied packet
162 find_files(JCR *jcr, FF_PKT *ff, int callback(FF_PKT *ff_pkt, void *hpkt, bool top_level))
164 ff->callback = callback;
166 /* This is the new way */
167 findFILESET *fileset = ff->fileset;
171 ff->VerifyOpts[0] = 'V';
172 ff->VerifyOpts[1] = 0;
173 for (i=0; i<fileset->include_list.size(); i++) {
174 findINCEXE *incexe = (findINCEXE *)fileset->include_list.get(i);
175 fileset->incexe = incexe;
177 * By setting all options, we in effect or the global options
178 * which is what we want.
180 for (j=0; j<incexe->opts_list.size(); j++) {
181 findFOPTS *fo = (findFOPTS *)incexe->opts_list.get(j);
182 ff->flags |= fo->flags;
183 ff->GZIP_level = fo->GZIP_level;
184 ff->strip_path = fo->strip_path;
185 ff->fstypes = fo->fstype;
186 ff->drivetypes = fo->drivetype;
187 bstrncat(ff->VerifyOpts, fo->VerifyOpts, sizeof(ff->VerifyOpts));
190 foreach_dlist(node, &incexe->name_list) {
191 char *fname = node->c_str();
192 Dmsg1(100, "F %s\n", fname);
193 ff->top_fname = fname;
194 if (find_one_file(jcr, ff, our_callback, ff->top_fname, (dev_t)-1, true) == 0) {
195 return 0; /* error return */
198 foreach_dlist(node, &incexe->plugin_list) {
199 char *fname = node->c_str();
200 Dmsg1(100, "PluginCommand: %s\n", fname);
201 ff->top_fname = fname;
202 ff->cmd_plugin = true;
203 generate_plugin_event(jcr, bEventPluginCommand, (void *)fname);
204 ff->cmd_plugin = false;
211 static bool accept_file(FF_PKT *ff)
215 findFILESET *fileset = ff->fileset;
216 findINCEXE *incexe = fileset->incexe;
217 const char *basename;
218 int (*match_func)(const char *pattern, const char *string, int flags);
220 if (ff->flags & FO_ENHANCEDWILD) {
221 // match_func = enh_fnmatch;
222 match_func = fnmatch;
223 if ((basename = last_path_separator(ff->fname)) != NULL)
226 basename = ff->fname;
228 match_func = fnmatch;
229 basename = ff->fname;
232 for (j = 0; j < incexe->opts_list.size(); j++) {
233 findFOPTS *fo = (findFOPTS *)incexe->opts_list.get(j);
234 ff->flags = fo->flags;
235 ff->GZIP_level = fo->GZIP_level;
236 ff->fstypes = fo->fstype;
237 ff->drivetypes = fo->drivetype;
239 fnm_flags = (ff->flags & FO_IGNORECASE) ? FNM_CASEFOLD : 0;
240 fnm_flags |= (ff->flags & FO_ENHANCEDWILD) ? FNM_PATHNAME : 0;
242 if (S_ISDIR(ff->statp.st_mode)) {
243 for (k=0; k<fo->wilddir.size(); k++) {
244 if (match_func((char *)fo->wilddir.get(k), ff->fname, fnmode|fnm_flags) == 0) {
245 if (ff->flags & FO_EXCLUDE) {
246 Dmsg2(100, "Exclude wilddir: %s file=%s\n", (char *)fo->wilddir.get(k),
248 return false; /* reject dir */
250 return true; /* accept dir */
254 for (k=0; k<fo->wildfile.size(); k++) {
255 if (match_func((char *)fo->wildfile.get(k), ff->fname, fnmode|fnm_flags) == 0) {
256 if (ff->flags & FO_EXCLUDE) {
257 Dmsg2(100, "Exclude wildfile: %s file=%s\n", (char *)fo->wildfile.get(k),
259 return false; /* reject file */
261 return true; /* accept file */
265 for (k=0; k<fo->wildbase.size(); k++) {
266 if (match_func((char *)fo->wildbase.get(k), basename, fnmode|fnm_flags) == 0) {
267 if (ff->flags & FO_EXCLUDE) {
268 Dmsg2(100, "Exclude wildbase: %s file=%s\n", (char *)fo->wildbase.get(k),
270 return false; /* reject file */
272 return true; /* accept file */
276 for (k=0; k<fo->wild.size(); k++) {
277 if (match_func((char *)fo->wild.get(k), ff->fname, fnmode|fnm_flags) == 0) {
278 if (ff->flags & FO_EXCLUDE) {
279 Dmsg2(100, "Exclude wild: %s file=%s\n", (char *)fo->wild.get(k),
281 return false; /* reject file */
283 return true; /* accept file */
286 if (S_ISDIR(ff->statp.st_mode)) {
287 for (k=0; k<fo->regexdir.size(); k++) {
288 const int nmatch = 30;
289 regmatch_t pmatch[nmatch];
290 if (regexec((regex_t *)fo->regexdir.get(k), ff->fname, nmatch, pmatch, 0) == 0) {
291 if (ff->flags & FO_EXCLUDE) {
292 return false; /* reject file */
294 return true; /* accept file */
298 for (k=0; k<fo->regexfile.size(); k++) {
299 const int nmatch = 30;
300 regmatch_t pmatch[nmatch];
301 if (regexec((regex_t *)fo->regexfile.get(k), ff->fname, nmatch, pmatch, 0) == 0) {
302 if (ff->flags & FO_EXCLUDE) {
303 return false; /* reject file */
305 return true; /* accept file */
309 for (k=0; k<fo->regex.size(); k++) {
310 const int nmatch = 30;
311 regmatch_t pmatch[nmatch];
312 if (regexec((regex_t *)fo->regex.get(k), ff->fname, nmatch, pmatch, 0) == 0) {
313 if (ff->flags & FO_EXCLUDE) {
314 return false; /* reject file */
316 return true; /* accept file */
320 * If we have an empty Options clause with exclude, then
323 if (ff->flags & FO_EXCLUDE &&
324 fo->regex.size() == 0 && fo->wild.size() == 0 &&
325 fo->regexdir.size() == 0 && fo->wilddir.size() == 0 &&
326 fo->regexfile.size() == 0 && fo->wildfile.size() == 0 &&
327 fo->wildbase.size() == 0) {
328 return false; /* reject file */
332 /* Now apply the Exclude { } directive */
333 for (i=0; i<fileset->exclude_list.size(); i++) {
334 findINCEXE *incexe = (findINCEXE *)fileset->exclude_list.get(i);
335 for (j=0; j<incexe->opts_list.size(); j++) {
336 findFOPTS *fo = (findFOPTS *)incexe->opts_list.get(j);
337 fnm_flags = (fo->flags & FO_IGNORECASE) ? FNM_CASEFOLD : 0;
338 for (k=0; k<fo->wild.size(); k++) {
339 if (fnmatch((char *)fo->wild.get(k), ff->fname, fnmode|fnm_flags) == 0) {
340 Dmsg1(100, "Reject wild1: %s\n", ff->fname);
341 return false; /* reject file */
345 fnm_flags = (incexe->current_opts != NULL && incexe->current_opts->flags & FO_IGNORECASE)
348 foreach_dlist(node, &incexe->name_list) {
349 char *fname = node->c_str();
350 if (fnmatch(fname, ff->fname, fnmode|fnm_flags) == 0) {
351 Dmsg1(100, "Reject wild2: %s\n", ff->fname);
352 return false; /* reject file */
360 * The code comes here for each file examined.
361 * We filter the files, then call the user's callback if
362 * the file is included.
364 static int our_callback(FF_PKT *ff, void *hpkt, bool top_level)
367 return ff->callback(ff, hpkt, top_level); /* accept file */
381 // return ff->callback(ff, hpkt, top_level);
383 /* These items can be filtered */
394 if (accept_file(ff)) {
395 return ff->callback(ff, hpkt, top_level);
397 Dmsg1(100, "Skip file %s\n", ff->fname);
398 return -1; /* ignore this file */
402 Dmsg1(000, "Unknown FT code %d\n", ff->type);
409 * Terminate find_files() and release
410 * all allocated memory
413 term_find_files(FF_PKT *ff)
417 free_pool_memory(ff->sys_fname);
418 if (ff->fname_save) {
419 free_pool_memory(ff->fname_save);
422 free_pool_memory(ff->link_save);
424 hard_links = term_find_one(ff);