2 Bacula® - The Network Backup Solution
4 Copyright (C) 2000-2007 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 * Find all specified files (determined by calls to name_add()
152 * This routine calls the (handle_file) subroutine with all
153 * sorts of good information for the final disposition of
156 * Call this subroutine with a callback subroutine as the first
157 * argument and a packet as the second argument, this packet
158 * will be passed back to the callback subroutine as the last
161 * The callback subroutine gets called with:
162 * arg1 -- the FF_PKT containing filename, link, stat, ftype, flags, etc
163 * arg2 -- the user supplied packet
167 find_files(JCR *jcr, FF_PKT *ff, int callback(FF_PKT *ff_pkt, void *hpkt, bool top_level),
170 ff->callback = callback;
172 /* This is the new way */
173 findFILESET *fileset = ff->fileset;
177 ff->VerifyOpts[0] = 'V';
178 ff->VerifyOpts[1] = 0;
179 for (i=0; i<fileset->include_list.size(); i++) {
180 findINCEXE *incexe = (findINCEXE *)fileset->include_list.get(i);
181 fileset->incexe = incexe;
183 * By setting all options, we in effect or the global options
184 * which is what we want.
186 for (j=0; j<incexe->opts_list.size(); j++) {
187 findFOPTS *fo = (findFOPTS *)incexe->opts_list.get(j);
188 ff->flags |= fo->flags;
189 ff->GZIP_level = fo->GZIP_level;
190 ff->strip_path = fo->strip_path;
191 ff->fstypes = fo->fstype;
192 ff->drivetypes = fo->drivetype;
193 bstrncat(ff->VerifyOpts, fo->VerifyOpts, sizeof(ff->VerifyOpts));
196 foreach_dlist(node, &incexe->name_list) {
197 char *fname = node->c_str();
198 Dmsg1(100, "F %s\n", fname);
199 ff->top_fname = fname;
200 if (find_one_file(jcr, ff, our_callback, his_pkt, ff->top_fname, (dev_t)-1, true) == 0) {
201 return 0; /* error return */
209 static bool accept_file(FF_PKT *ff)
213 findFILESET *fileset = ff->fileset;
214 findINCEXE *incexe = fileset->incexe;
215 const char *basename;
216 int (*match_func)(const char *pattern, const char *string, int flags);
218 if (ff->flags & FO_ENHANCEDWILD) {
219 match_func = enh_fnmatch;
220 if ((basename = last_path_separator(ff->fname)) != NULL)
223 basename = ff->fname;
225 match_func = fnmatch;
226 basename = ff->fname;
229 for (j = 0; j < incexe->opts_list.size(); j++) {
230 findFOPTS *fo = (findFOPTS *)incexe->opts_list.get(j);
231 ff->flags = fo->flags;
232 ff->GZIP_level = fo->GZIP_level;
233 ff->reader = fo->reader;
234 ff->writer = fo->writer;
235 ff->fstypes = fo->fstype;
236 ff->drivetypes = fo->drivetype;
238 fnm_flags = (ff->flags & FO_IGNORECASE) ? FNM_CASEFOLD : 0;
239 fnm_flags |= (ff->flags & FO_ENHANCEDWILD) ? FNM_PATHNAME : 0;
241 if (S_ISDIR(ff->statp.st_mode)) {
242 for (k=0; k<fo->wilddir.size(); k++) {
243 if (match_func((char *)fo->wilddir.get(k), ff->fname, fnmode|fnm_flags) == 0) {
244 if (ff->flags & FO_EXCLUDE) {
245 Dmsg2(100, "Exclude wilddir: %s file=%s\n", (char *)fo->wilddir.get(k),
247 return false; /* reject dir */
249 return true; /* accept dir */
253 for (k=0; k<fo->wildfile.size(); k++) {
254 if (match_func((char *)fo->wildfile.get(k), ff->fname, fnmode|fnm_flags) == 0) {
255 if (ff->flags & FO_EXCLUDE) {
256 Dmsg2(100, "Exclude wildfile: %s file=%s\n", (char *)fo->wildfile.get(k),
258 return false; /* reject file */
260 return true; /* accept file */
264 for (k=0; k<fo->wildbase.size(); k++) {
265 if (match_func((char *)fo->wildbase.get(k), basename, fnmode|fnm_flags) == 0) {
266 if (ff->flags & FO_EXCLUDE) {
267 Dmsg2(100, "Exclude wildbase: %s file=%s\n", (char *)fo->wildbase.get(k),
269 return false; /* reject file */
271 return true; /* accept file */
275 for (k=0; k<fo->wild.size(); k++) {
276 if (match_func((char *)fo->wild.get(k), ff->fname, fnmode|fnm_flags) == 0) {
277 if (ff->flags & FO_EXCLUDE) {
278 Dmsg2(100, "Exclude wild: %s file=%s\n", (char *)fo->wild.get(k),
280 return false; /* reject file */
282 return true; /* accept file */
285 if (S_ISDIR(ff->statp.st_mode)) {
286 for (k=0; k<fo->regexdir.size(); k++) {
287 const int nmatch = 30;
288 regmatch_t pmatch[nmatch];
289 if (regexec((regex_t *)fo->regexdir.get(k), ff->fname, nmatch, pmatch, 0) == 0) {
290 if (ff->flags & FO_EXCLUDE) {
291 return false; /* reject file */
293 return true; /* accept file */
297 for (k=0; k<fo->regexfile.size(); k++) {
298 const int nmatch = 30;
299 regmatch_t pmatch[nmatch];
300 if (regexec((regex_t *)fo->regexfile.get(k), ff->fname, nmatch, pmatch, 0) == 0) {
301 if (ff->flags & FO_EXCLUDE) {
302 return false; /* reject file */
304 return true; /* accept file */
308 for (k=0; k<fo->regex.size(); k++) {
309 const int nmatch = 30;
310 regmatch_t pmatch[nmatch];
311 if (regexec((regex_t *)fo->regex.get(k), ff->fname, nmatch, pmatch, 0) == 0) {
312 if (ff->flags & FO_EXCLUDE) {
313 return false; /* reject file */
315 return true; /* accept file */
319 * If we have an empty Options clause with exclude, then
322 if (ff->flags & FO_EXCLUDE &&
323 fo->regex.size() == 0 && fo->wild.size() == 0 &&
324 fo->regexdir.size() == 0 && fo->wilddir.size() == 0 &&
325 fo->regexfile.size() == 0 && fo->wildfile.size() == 0 &&
326 fo->wildbase.size() == 0) {
327 return false; /* reject file */
331 /* Now apply the Exclude { } directive */
332 for (i=0; i<fileset->exclude_list.size(); i++) {
333 findINCEXE *incexe = (findINCEXE *)fileset->exclude_list.get(i);
334 for (j=0; j<incexe->opts_list.size(); j++) {
335 findFOPTS *fo = (findFOPTS *)incexe->opts_list.get(j);
336 fnm_flags = (fo->flags & FO_IGNORECASE) ? FNM_CASEFOLD : 0;
337 for (k=0; k<fo->wild.size(); k++) {
338 if (fnmatch((char *)fo->wild.get(k), ff->fname, fnmode|fnm_flags) == 0) {
339 Dmsg1(100, "Reject wild1: %s\n", ff->fname);
340 return false; /* reject file */
344 fnm_flags = (incexe->current_opts != NULL && incexe->current_opts->flags & FO_IGNORECASE)
347 foreach_dlist(node, &incexe->name_list) {
348 char *fname = node->c_str();
349 if (fnmatch(fname, ff->fname, fnmode|fnm_flags) == 0) {
350 Dmsg1(100, "Reject wild2: %s\n", ff->fname);
351 return false; /* reject file */
359 * The code comes here for each file examined.
360 * We filter the files, then call the user's callback if
361 * the file is included.
363 static int our_callback(FF_PKT *ff, void *hpkt, bool top_level)
366 return ff->callback(ff, hpkt, top_level); /* accept file */
380 // return ff->callback(ff, hpkt, top_level);
382 /* These items can be filtered */
393 if (accept_file(ff)) {
394 // Dmsg2(000, "Accept file %s; reader=%s\n", ff->fname, NPRT(ff->reader));
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);