source: MondoRescue/branches/2.2.10/mondo/src/common/libmondo-filelist.c@ 2357

Last change on this file since 2357 was 2357, checked in by Bruno Cornec, 15 years ago
  • Some more fgets => mr_getline transformations
  • XWIN define is gone
  • Property svn:keywords set to Id
File size: 48.8 KB
RevLine 
[2030]1/*
[128]2 $Id: libmondo-filelist.c 2357 2009-08-29 01:22:10Z bruno $
[1]3*/
4
5/**
6 * @file
7 * Functions which create, chop, and edit the filelist.
8 */
9
10#include "my-stuff.h"
11#include "mondostructures.h"
[541]12#include "lib-common-externs.h"
[1]13#include "libmondo-filelist.h"
14#include "libmondo-string-EXT.h"
15#include "libmondo-files-EXT.h"
16#include "libmondo-fork-EXT.h"
[541]17#include "libmondo-gui-EXT.h"
[1]18#include "libmondo-tools-EXT.h"
[2211]19#include "mr_mem.h"
[2241]20#include "mr_str.h"
[1]21
22#include <time.h>
23#include <stdio.h>
24#include <sys/types.h>
25#include <sys/stat.h>
26#include <dirent.h>
27#include <errno.h>
28#include <stdio.h>
29
30
[128]31extern ssize_t getline(char **lineptr, size_t * n, FILE * stream);
[1316]32extern char *MONDO_LOGFILE;
[1]33
[1645]34/* Reference to global bkpinfo */
35extern struct s_bkpinfo *bkpinfo;
[1]36
[1645]37
[2321]38int mondo_makefilelist(char *logfile, char *include_paths, char *excp, int differential, char *userdef_filelist);
[1]39
40
41/*@unused@*/
[128]42//static char cvsid[] = "$Id: libmondo-filelist.c 2357 2009-08-29 01:22:10Z bruno $";
[1]43
44/**
45 * Number of lines in the filelist last loaded.
46 * @warning This implies that two filesets cannot be loaded at once.
47 * @ingroup globalGroup
48 */
49long g_original_noof_lines_in_filelist = 0;
50
51/**
52 * Number of filesets in the current backup.
53 * @ingroup globalGroup
54 */
[128]55long g_noof_sets = 0;
[1]56
57extern bool g_text_mode;
58extern newtComponent g_progressForm;
59extern int g_currentY;
60extern int g_noof_rows;
61
[944]62extern char *g_getfacl;
63extern char *g_getfattr;
[1]64
65
66
67/**
68 * @addtogroup filelistGroup
69 * @{
70 */
71/**
72 * Call chop_filelist() to chop the filelist into sets.
73 * @param bkpinfo The backup information structure. Fields used:
74 * - @c bkpinfo->image_devs
75 * - @c bkpinfo->optimal_set_size
76 * - @c bkpinfo->scratchdir
77 * - @c bkpinfo->tmpdir
78 * @see chop_filelist
79 */
[1645]80int call_filelist_chopper()
[1]81{
[128]82 /*@ buffers *********************** */
[2265]83 char *dev = NULL;
84 char *filelist = NULL;
85 char *tempfile = NULL;
[128]86 long noof_sets;
[1]87
[128]88 /*@ pointers ********************** */
[2327]89 char *ptr = NULL;
[128]90 FILE *fout;
[1]91
[128]92 /*@ int *************************** */
93 int i, retval = 0;
[1]94
[541]95 mvaddstr_and_log_it(g_currentY, 0, "Dividing filelist into sets");
[1]96
[541]97 log_to_screen("Dividing filelist into sets. Please wait.");
[128]98 i = 0;
[2323]99 mr_asprintf(filelist, "%s/archives/filelist.full", bkpinfo->scratchdir);
[128]100 if (!does_file_exist(filelist)) {
101 log_it("filelist %s not found", filelist);
[2265]102 mr_free(filelist);
[128]103 fatal_error("call_filelist_chopper() -- filelist not found!");
104 }
[1]105
[2321]106 noof_sets = chop_filelist(filelist, bkpinfo->optimal_set_size);
[2265]107 mr_free(filelist);
[1645]108 estimate_noof_media_required(noof_sets); // for cosmetic purposes
[1]109
[2323]110 mr_asprintf(tempfile, "%s/biggielist.txt", bkpinfo->tmpdir);
[128]111 if (!(fout = fopen(tempfile, "a"))) {
112 log_OS_error("Cannot append to biggielist");
113 retval++;
[2265]114 mr_free(tempfile);
115 return (retval);
[128]116 }
[2265]117 mr_free(tempfile);
118
[2327]119 if (bkpinfo->image_devs) {
120 log_it("image_devs : %s", bkpinfo->image_devs);
[1]121
[2327]122 ptr = bkpinfo->image_devs;
[1]123
[2327]124 while (ptr && *ptr) {
125 mr_asprintf(dev, "%s", ptr);
126 log_it("Examining imagedev %s", dev);
127 for (i = 0; i < (int) strlen(dev) && dev[i] != ' '; i++);
128 dev[i] = '\0';
129 if (!strlen(dev)) {
130 mr_free(dev);
131 continue;
132 }
133 fprintf(fout, "%s\n", dev);
134 log_it("Adding '%s' to biggielist", dev);
135 if ((ptr = strchr(ptr, ' '))) {
136 ptr++;
137 }
138 mr_free(dev);
[128]139 }
[1]140 }
[128]141 paranoid_fclose(fout);
142 mvaddstr_and_log_it(g_currentY++, 74, "Done.");
[1]143
[128]144 return (retval);
[1]145}
146
147
[128]148int sort_file(char *orig_fname)
[1]149{
[2265]150 char *tmp_fname = NULL;
151 char *command = NULL;
[128]152 int retval = 0;
[1]153
[1475]154 log_msg(5, "Sorting file %s", orig_fname);
[1]155
[128]156 if (!does_file_exist(orig_fname)) {
[1475]157 log_msg(2, "file %s empty", orig_fname);
[128]158 return (0);
159 } // no sense in trying to sort an empty file
160
[2323]161 mr_asprintf(tmp_fname, "%s/sortfile", bkpinfo->tmpdir);
162 mr_asprintf(command, "sort %s > %s 2>> %s", orig_fname, tmp_fname, MONDO_LOGFILE);
[128]163 retval = system(command);
[2265]164 mr_free(command);
165
[128]166 if (retval) {
167 log_msg(2, "Failed to sort %s - oh dear", orig_fname);
168 } else {
[2265]169 log_msg(5, "Sorted %s --> %s OK. Copying it back to %s now", orig_fname, tmp_fname, orig_fname);
[2323]170 mr_asprintf(command, "mv -f %s %s", tmp_fname, orig_fname);
[1475]171 retval += run_program_and_log_output(command, 5);
[2265]172 mr_free(command);
173
[128]174 if (retval) {
[2265]175 log_msg(2, "Failed to copy %s back to %s - oh dear", tmp_fname, orig_fname);
[128]176 } else {
[1475]177 log_msg(5, "%s was sorted OK.", orig_fname);
[128]178 }
[1]179 }
[2265]180 mr_free(tmp_fname);
[1475]181 log_msg(5, "Finished sorting file %s", orig_fname);
[128]182 return (retval);
[1]183}
184
185
186
187/**
188 * Chop the filelist into sets.
189 * Each fileset is a list of files whose total (uncompressed) size is usually
190 * about X KB. Files bigger than 8X KB are placed in a "biggielist"; they will
191 * be sliced and compressed separately from the regular files.
192 *
193 * @param filelist The big filelist (filelist.full) to chop up.
194 * @param maxsetsizeK Optimal size of a fileset (X above).
195 * @return number of errors encountered (0 for success).
196 */
[2321]197int chop_filelist(char *filelist, long maxsetsizeK)
[1]198{
199/*@ long ****************************************/
[128]200 long lino = 0;
201 long max_sane_size_for_a_file;
202 long curr_set_size;
203 long noof_lines;
204 long siz;
[1]205
[128]206 /*@ int **************************************** */
207 int i;
208 long curr_set_no;
[1]209
[128]210 /*@ buffers ************************************* */
[2265]211 char *outfname = NULL;
212 char *biggie_fname = NULL;
[2340]213 char *incoming = NULL;
[2265]214 char *tmp = NULL;
[1]215
[128]216 /*@ pointers *********************************** */
217 FILE *fin;
218 FILE *fout;
219 FILE *fbig;
[1]220
[128]221 /*@ structures ********************************* */
222 struct stat buf;
223 int err = 0;
[1]224
[128]225 assert_string_is_neither_NULL_nor_zerolength(filelist);
226 assert(maxsetsizeK > 0);
227
[1236]228 max_sane_size_for_a_file = 64L * 1024L;
[1]229// max_sane_size_for_a_file = maxsetsizeK*2;
230// if (max_sane_size_for_a_file > 32*1024)
231// { max_sane_size_for_a_file = 32*1024; }
[128]232
233 log_it("filelist=%s;", filelist);
234 open_evalcall_form("Dividing filelist into sets");
235 noof_lines = count_lines_in_file(filelist);
236 if (!(fin = fopen(filelist, "r"))) {
237 log_OS_error("Cannot openin filelist");
238 return (0);
[1]239 }
[128]240 curr_set_no = 0;
241 curr_set_size = 0;
[2323]242 mr_asprintf(outfname, "%s/filelist.%ld", bkpinfo->tmpdir, curr_set_no);
243 mr_asprintf(biggie_fname, "%s/biggielist.txt", bkpinfo->tmpdir);
[128]244 log_it("outfname=%s; biggie_fname=%s", outfname, biggie_fname);
245 if (!(fbig = fopen(biggie_fname, "w"))) {
246 log_OS_error("Cannot openout biggie_fname");
247 err++;
[2265]248 mr_free(outfname);
249 mr_free(biggie_fname);
250 return (curr_set_no + 1);
[1]251 }
[128]252 if (!(fout = fopen(outfname, "w"))) {
253 log_OS_error("Cannot openout outfname");
254 err++;
[2265]255 mr_free(outfname);
256 mr_free(biggie_fname);
257 return (curr_set_no + 1);
[1]258 }
[2265]259
[2340]260 mr_getline(incoming, fin);
[128]261 while (!feof(fin)) {
262 lino++;
263 i = strlen(incoming) - 1;
264 if (i < 0) {
265 i = 0;
266 }
[2340]267 /* Now that we dyn. alloc is truncating needed ?
[128]268 if (i > MAX_STR_LEN - 1) {
269 incoming[MAX_STR_LEN - 30] = '\0';
270 log_msg(1, "Warning - truncating file %s's name", incoming);
271 err++;
272 }
[2340]273 */
[128]274 if (incoming[i] < 32) {
275 incoming[i] = '\0';
276 }
277 if (!strncmp(incoming, "/dev/", 5)) {
278 siz = 1;
279 } else if (lstat(incoming, &buf) != 0) {
280 siz = 0;
281 } else {
282 siz = (long) (buf.st_size >> 10);
283 }
[2265]284 if (siz > max_sane_size_for_a_file) {
[128]285 fprintf(fbig, "%s\n", incoming);
286 } else {
287 curr_set_size += siz;
288 fprintf(fout, "%s\n", incoming);
289 if (curr_set_size > maxsetsizeK) {
290 paranoid_fclose(fout);
291 sort_file(outfname);
[2265]292 mr_free(outfname);
[128]293 curr_set_no++;
294 curr_set_size = 0;
[2265]295
[2323]296 mr_asprintf(outfname, "%s/filelist.%ld", bkpinfo->tmpdir, curr_set_no);
[128]297 if (!(fout = fopen(outfname, "w"))) {
298 log_OS_error("Unable to openout outfname");
299 err++;
[2265]300 mr_free(outfname);
301 mr_free(biggie_fname);
[2340]302 mr_free(incoming);
[2265]303 return (curr_set_no + 1);
[128]304 }
305 update_evalcall_form((int) (lino * 100 / noof_lines));
306 }
307 }
[2340]308 mr_free(incoming);
309 mr_getline(incoming, fin);
[1]310 }
[2340]311 mr_free(incoming);
312
[128]313 paranoid_fclose(fin);
314 paranoid_fclose(fout);
315 paranoid_fclose(fbig);
316
317 if (length_of_file(outfname) <= 2) {
318 unlink(outfname);
319 g_noof_sets--;
[1]320 }
[128]321 g_noof_sets = curr_set_no;
322 sort_file(outfname);
[2265]323 mr_free(outfname);
324
[128]325 sort_file(biggie_fname);
[2265]326 mr_free(biggie_fname);
327
[2323]328 mr_asprintf(outfname, "%s/LAST-FILELIST-NUMBER", bkpinfo->tmpdir);
329 mr_asprintf(tmp, "%ld", curr_set_no);
[128]330 if (write_one_liner_data_file(outfname, tmp)) {
331 log_OS_error
332 ("Unable to echo write one-liner to LAST-FILELIST-NUMBER");
333 err = 1;
[1]334 }
[2265]335 mr_free(tmp);
336 mr_free(outfname);
337
[128]338 if (curr_set_no == 0) {
[2324]339 log_msg(1, "Only one fileset. Fine.");
[128]340 } else {
[2324]341 log_msg(1, "Filelist divided into %ld sets", curr_set_no + 1);
[1]342 }
[128]343 close_evalcall_form();
344 /* This is to work around an obscure bug in Newt; open a form, close it,
345 carry on... I don't know why it works but it works. If you don't do this
346 then update_progress_form() won't show the "time taken / time remaining"
347 line. The bug only crops up AFTER the call to chop_filelist(). Weird. */
348 if (!g_text_mode) {
349 open_progress_form("", "", "", "", 100);
350 newtPopHelpLine();
351 newtFormDestroy(g_progressForm);
352 newtPopWindow();
[1]353 }
[128]354 return (err ? 0 : curr_set_no + 1);
[1]355}
356
357
358
359
360
361/**
362 * Free all the memory used by a filelist structure.
363 * Since this may take a long time for large filelists, a progress bar will be displayed.
364 * @param filelist The filelist to free.
365 */
[128]366void free_filelist(struct s_node *filelist)
[1]367{
[128]368 /*@ int's ******************************************************* */
369 static int depth = 0;
370 int percentage;
[1]371
[128]372 /*@ long's ****************************************************** */
373 static long i = 0;
[1]374
[128]375 /*@ end vars **************************************************** */
[1]376
[128]377 assert(filelist != NULL);
378 if (depth == 0) {
379 open_evalcall_form("Freeing memory");
[541]380 log_to_screen("Freeing memory formerly occupied by filelist");
[128]381 }
382 depth++;
[1]383
[128]384 if (filelist->ch == '\0') {
385 if (!(i++ % 1111)) {
386 percentage =
387 (int) (i * 100 / g_original_noof_lines_in_filelist);
388 update_evalcall_form(percentage);
[1]389
[128]390 }
[1]391 }
392
[128]393 if (filelist->right) {
394 free_filelist(filelist->right);
395 filelist->right = NULL;
396 }
397 if (filelist->down) {
[1]398/* if (!(i++ %39999)) { update_evalcall_form(0); } */
[128]399 free_filelist(filelist->down);
400 filelist->down = NULL;
401 }
402 filelist->ch = '\0';
403 paranoid_free(filelist);
404 depth--;
405 if (depth == 0) {
406 close_evalcall_form();
407 log_it("Finished freeing memory");
408 }
[1]409}
410
411
[128]412int call_exe_and_pipe_output_to_fd(char *syscall, FILE * pout)
[1]413{
[2351]414 FILE *pattr = NULL;
415 char *tmp = NULL;
416
[128]417 pattr = popen(syscall, "r");
418 if (!pattr) {
419 log_msg(1, "Failed to open fattr() %s", syscall);
420 return (1);
[1]421 }
[128]422 if (feof(pattr)) {
423 log_msg(1, "Failed to call fattr() %s", syscall);
424 paranoid_pclose(pattr);
425 return (2);
[1]426 }
[2351]427 for (mr_getline(tmp, pattr); !feof(pattr); mr_getline(tmp, pattr)) {
[128]428 fputs(tmp, pout);
[2351]429 mr_free(tmp);
[128]430 }
[2351]431 mr_free(tmp);
[128]432 paranoid_pclose(pattr);
433 return (0);
[1]434}
435
436
437
[128]438int gen_aux_list(char *filelist, char *syscall_sprintf,
439 char *auxlist_fname)
[1]440{
[2351]441 FILE *fin = NULL;
442 FILE *pout = NULL;
[2265]443 char *pout_command = NULL;
[2351]444 char *syscall = NULL;
445 char *file_to_analyze = NULL;
[1015]446 char *strtmp = NULL;
[1552]447 char *tmp = NULL;
[128]448 int i;
449
450 if (!(fin = fopen(filelist, "r"))) {
451 log_msg(1, "Cannot openin filelist %s", filelist);
452 return (1);
453 }
[2323]454 mr_asprintf(pout_command, "gzip -c1 > %s", auxlist_fname);
[128]455 if (!(pout = popen(pout_command, "w"))) {
456 log_msg(1, "Cannot openout auxlist_fname %s", auxlist_fname);
457 fclose(fin);
[2265]458 mr_free(pout_command);
[128]459 return (4);
460 }
[2265]461 mr_free(pout_command);
462
[2351]463 for (mr_getline(file_to_analyze, fin); !feof(fin); mr_getline(file_to_analyze, fin)) {
[128]464 i = strlen(file_to_analyze);
465 if (i > 0 && file_to_analyze[i - 1] < 32) {
466 file_to_analyze[i - 1] = '\0';
467 }
468 log_msg(8, "Analyzing %s", file_to_analyze);
[2206]469 tmp = mr_stresc(file_to_analyze, "`$\\\"(){}[]'*?&|!#~", '\\');
[2323]470 mr_asprintf(strtmp, syscall_sprintf, tmp);
[2357]471 mr_free(tmp);
472
[2323]473 mr_asprintf(syscall, "%s 2>> /dev/null", strtmp); // " MONDO_LOGFILE);
[2324]474 mr_free(strtmp);
[2357]475
[128]476 call_exe_and_pipe_output_to_fd(syscall, pout);
[2324]477 mr_free(syscall);
[2351]478 mr_free(file_to_analyze);
[128]479 }
[2351]480 mr_free(file_to_analyze);
[128]481 paranoid_fclose(fin);
482 paranoid_pclose(pout);
483 return (0);
[1]484}
485
486
[128]487int get_acl_list(char *filelist, char *facl_fname)
[1]488{
[2265]489 char *command = NULL;
[128]490 int retval = 0;
491
[944]492 if (g_getfacl != NULL) {
[2323]493 mr_asprintf(command, "touch %s", facl_fname);
[943]494 run_program_and_log_output(command, 8);
[2265]495 mr_free(command);
496
[2323]497 mr_asprintf(command, "getfacl --all-effective -P %s 2>> %s | gzip -c1 > %s 2>> %s", filelist, MONDO_LOGFILE, facl_fname, MONDO_LOGFILE);
[2227]498 log_it("%s",command);
[128]499 retval = system(command);
[2265]500 mr_free(command);
[128]501 }
502 return (retval);
[1]503}
504
505
[128]506int get_fattr_list(char *filelist, char *fattr_fname)
[1]507{
[128]508 char *command;
509 int retval = 0;
510
[944]511 if (g_getfattr != NULL) {
[2323]512 mr_asprintf(command, "touch %s", fattr_fname);
[942]513 run_program_and_log_output(command, 8);
[2265]514 mr_free(command);
[128]515 retval =
516 gen_aux_list(filelist, "getfattr --en=hex -P -d \"%s\"",
517 fattr_fname);
518 }
519 return (retval);
[1]520}
521
522
[128]523int set_EXAT_list(char *orig_msklist, char *original_exat_fname,
524 char *executable)
[1]525{
[128]526 const int my_depth = 8;
[2265]527 char *command = NULL;
528 char *syscall_pin = NULL;
529 char *syscall_pout = NULL;
[2351]530 char *incoming = NULL;
531 char *current_subset_file = NULL;
[2331]532 char *current_master_file = NULL;
[2265]533 char *masklist = NULL;
[128]534 int retval = 0;
535 int i;
536 char *p, *q;
537 FILE *pin, *pout, *faclin;
[1]538
[2287]539 log_msg(1, "set_EXAT_list(%s, %s, %s)", orig_msklist, original_exat_fname, executable);
[128]540 if (!orig_msklist || !orig_msklist[0]
541 || !does_file_exist(orig_msklist)) {
[2265]542 log_msg(1, "No masklist provided. I shall therefore set ALL attributes.");
[2323]543 mr_asprintf(command, "gzip -dc %s | %s --restore - 2>> %s", original_exat_fname, executable, MONDO_LOGFILE);
[128]544 log_msg(1, "command = %s", command);
545 retval = system(command);
[2265]546 mr_free(command);
[128]547 log_msg(1, "Returning w/ retval=%d", retval);
548 return (retval);
549 }
550 if (length_of_file(original_exat_fname) <= 0) {
[2287]551 log_msg(1, "original_exat_fname %s is empty or missing, so no need to set EXAT list", original_exat_fname);
[128]552 return (0);
553 }
[2323]554 mr_asprintf(masklist, "%s/masklist", bkpinfo->tmpdir);
555 mr_asprintf(command, "cp -f %s %s", orig_msklist, masklist);
[128]556 run_program_and_log_output(command, 1);
[2265]557 mr_free(command);
558
[128]559 sort_file(masklist);
[1]560
[2323]561 mr_asprintf(syscall_pout, "%s --restore - 2>> %s", executable, MONDO_LOGFILE);
[128]562 log_msg(1, "syscall_pout = %s", syscall_pout);
563 pout = popen(syscall_pout, "w");
[2265]564 mr_free(syscall_pout);
565
[128]566 if (!pout) {
[2230]567 log_it("Unable to openout to syscall_pout");
[2265]568 mr_free(masklist);
[128]569 return (1);
570 }
[2265]571
[2323]572 mr_asprintf(syscall_pin, "gzip -dc %s", original_exat_fname);
[2265]573 log_msg(1, "syscall_pin = %s", syscall_pin);
[128]574 pin = popen(syscall_pin, "r");
[2265]575 mr_free(syscall_pin);
576
[128]577 if (!pin) {
578 pclose(pout);
[2230]579 log_it("Unable to openin from syscall");
[128]580 return (1);
581 }
582 faclin = fopen(masklist, "r");
583 if (!faclin) {
584 pclose(pin);
585 pclose(pout);
[2230]586 log_it("Unable to openin masklist");
[2265]587 mr_free(masklist);
[128]588 return (1);
589 }
590// printf("Hi there. Starting the loop\n");
[1]591
[2351]592 mr_getline(current_subset_file, faclin);
593 mr_getline(incoming, pin);
[128]594 while (!feof(pin) && !feof(faclin)) {
[2331]595 mr_asprintf(current_master_file, "%s", incoming + 8);
[1]596
[128]597 p = current_subset_file;
598 if (*p == '/') {
599 p++;
600 }
601 i = strlen(p);
602 if (i > 0 && p[i - 1] < 32) {
603 p[i - 1] = '\0';
604 }
605
606
607 q = current_master_file;
608 if (*q == '/') {
609 q++;
610 }
611 i = strlen(q);
612 if (i > 0 && q[i - 1] < 32) {
613 q[i - 1] = '\0';
614 }
615
616 i = strcmp(p, q);
617 log_msg(my_depth, "'%s' v '%s' --> %d\n", p, q, i);
618
[1]619// printf("%s v %s --> %d\n", p, q, i);
[128]620
621 if (i < 0) { // read another subset file in.
622 log_msg(my_depth, "Reading next subset line in\n\n");
[2351]623 mr_free(current_subset_file);
624 mr_getline(current_subset_file, faclin);
[128]625 continue;
626 }
627
628 if (!i) {
629 fputs(incoming, pout);
630 }
[2351]631 mr_free(incoming);
632 mr_getline(incoming, pin);
[128]633 if (!i) {
634 log_msg(my_depth, "Copying master %s", q);
635 }
636
637 while (!feof(pin) && strncmp(incoming, "# file: ", 8)) {
638 if (!i) {
639 fputs(incoming, pout);
640 }
[2351]641 mr_free(incoming);
642 mr_getline(incoming, pin);
[128]643 }
644 if (!i) {
[2351]645 mr_free(current_subset_file);
646 mr_getline(current_subset_file, faclin);
[128]647 }
[2331]648 mr_free(current_master_file);
[1]649 }
[2351]650 mr_free(current_subset_file);
651 mr_free(incoming);
[128]652 fclose(faclin);
653 pclose(pin);
654 pclose(pout);
[1]655
[128]656 unlink(masklist);
[2265]657 mr_free(masklist);
658
[128]659 return (retval);
660}
[1]661
662
[2331]663int set_fattr_list(char *masklist, char *fattr_fname) {
664
665 char *tmp = NULL;
666
667 tmp = find_home_of_exe("setfattr");
668 if (tmp) {
669 mr_free(tmp);
[912]670 return (set_EXAT_list(masklist, fattr_fname, "setfattr"));
671 } else {
[2331]672 mr_free(tmp);
[912]673 log_msg(1, "ERROR: set_EXAT_list: setfattr doesn't exist");
674 return(0);
675 }
[1]676}
677
678
679
[2331]680int set_acl_list(char *masklist, char *acl_fname) {
681
682 char *tmp = NULL;
683
684 tmp = find_home_of_exe("setfacl");
685 if (tmp) {
686 mr_free(tmp);
[912]687 return (set_EXAT_list(masklist, acl_fname, "setfacl"));
688 } else {
[2331]689 mr_free(tmp);
[912]690 log_msg(1, "ERROR: set_EXAT_list: setfacl doesn't exist");
691 return(0);
692 }
[1]693}
694
695
696/**
697 * Get the number of the last fileset in the backup.
698 * @return The last filelist number.
699 * @note This function should only be called at restore-time.
700 */
[1645]701int get_last_filelist_number()
[1]702{
[128]703 /*@ buffers ***************************************************** */
[2325]704 char *val_sz = NULL;
[2265]705 char *cfg_fname = NULL;
[1]706
[128]707 /*@ long ******************************************************** */
708 int val_i;
[1]709
[128]710 /*@ end vars **************************************************** */
[1]711
[128]712 assert(bkpinfo != NULL);
[1]713
[2323]714 mr_asprintf(cfg_fname, "%s/mondo-restore.cfg", bkpinfo->tmpdir);
[2325]715 val_sz = read_cfg_var(cfg_fname, "last-filelist-number");
[2265]716 mr_free(cfg_fname);
717
[2325]718 if (val_sz == NULL) {
719 mr_asprintf(val_sz, "");
720 }
[128]721 val_i = atoi(val_sz);
[2325]722 mr_free(val_sz);
723
[128]724 if (val_i <= 0) {
725 val_i = 500;
726 }
727 return (val_i);
[1]728}
729
730
731/**
732 * Add a string at @p startnode.
733 * @param startnode The node to start at when searching for where to add the string.
734 * @param string_to_add The string to add.
735 * @return 0 for success, 1 for failure.
736 * @bug I don't understand this function. Would someone care to explain it?
737 */
[128]738int add_string_at_node(struct s_node *startnode, char *string_to_add)
[1]739{
740
741
[128]742 /*@ int ******************************************************** */
743 int noof_chars;
744 int i;
745 int res;
[1]746
[128]747 /*@ sturctures ************************************************* */
748 struct s_node *node, *newnode;
[1]749
[128]750 /*@ char ****************************************************** */
751 char char_to_add;
[1]752
[128]753 /*@ bools ****************************************************** */
[1]754
[128]755 const bool sosodef = FALSE;
[1]756
[128]757 static int depth = 0;
758 static char original_string[MAX_STR_LEN];
[1]759
[128]760 assert(startnode != NULL);
761 assert(string_to_add != NULL);
[1]762
[128]763 if (!depth) {
764 strcpy(original_string, string_to_add);
765 }
[1]766
[128]767 noof_chars = strlen(string_to_add) + 1; /* we include the '\0' */
[1]768
[2351]769 /* walk across tree if necessary */
[128]770 node = startnode;
771 char_to_add = string_to_add[0];
772 if (node->right != NULL && node->ch < char_to_add) {
773 log_msg(7, "depth=%d --- going RIGHT ... %c-->%c", depth,
774 char_to_add, node->ch, (node->right)->ch);
775 return (add_string_at_node(node->right, string_to_add));
776 }
[1]777
[2351]778 /* walk down tree if appropriate */
[128]779 if (node->down != NULL && node->ch == char_to_add) {
780 log_msg(7, "depth=%d char=%c --- going DOWN", depth, char_to_add);
781 depth++;
782 res = add_string_at_node(node->down, string_to_add + 1);
783 depth--;
784 return (res);
785 }
[1]786
[128]787 if (char_to_add == '\0' && node->ch == '\0') {
788 log_msg(6, "%s already in tree", original_string);
789 return (1);
790 }
[1]791
[2351]792 /* add here */
[128]793 if (!(newnode = (struct s_node *) malloc(sizeof(struct s_node)))) {
[541]794 log_to_screen("failed to malloc");
[128]795 depth--;
796 return (1);
797 }
798 if (char_to_add < node->ch) // add to the left of node
[1]799 {
[128]800 log_msg(7, "depth=%d char=%c --- adding (left)", depth,
801 char_to_add);
802 memcpy((void *) newnode, (void *) node, sizeof(struct s_node));
803 node->right = newnode;
804 } else if (char_to_add > node->ch) // add to the right of node
805 {
806 log_msg(7, "depth=%d char=%c --- adding (right)", depth,
807 char_to_add);
808 newnode->right = node->right; // newnode is to the RIGHT of node
809 node->right = newnode;
810 node = newnode;
[1]811 }
[128]812 // from now on, we're working on 'node'
813 node->down = NULL;
814 node->ch = char_to_add;
815 node->expanded = node->selected = FALSE;
816 if (char_to_add == '\0') {
817 log_msg(6, "Added %s OK", original_string);
818 return (0);
819 }
820// add the rest
821 log_msg(6, "Adding remaining chars ('%s')", string_to_add + 1);
822 for (i = 1; i < noof_chars; i++) {
823 if (!
824 (node->down =
825 (struct s_node *) malloc(sizeof(struct s_node)))) {
[541]826 log_to_screen("%s - failed to malloc", string_to_add);
[128]827 return (1);
828 }
829 node = node->down;
830 char_to_add = string_to_add[i];
831 log_msg(6, "Adding '%c'", char_to_add);
832 node->ch = char_to_add;
833 node->right = node->down = NULL;
834 node->expanded = node->selected = FALSE;
835 if (!node->ch) {
836 node->selected = sosodef;
837 }
838 }
839 log_msg(6, "Finally - added %s OK", original_string);
840 return (0);
[1]841}
842
843
844
845
846/**
847 * Load a filelist into a <tt>struct s_node</tt>.
848 * When you are done with the filelist, call free_filelist().
849 * @param filelist_fname The file to load the filelist from.
850 * @return A filelist tree structure.
851 */
[128]852struct s_node *load_filelist(char *filelist_fname)
[1]853{
854
[128]855 /*@ structures ************************************************* */
856 struct s_node *filelist;
[1]857
[128]858 /*@ pointers *************************************************** */
859 FILE *pin;
[1]860
[128]861 /*@ buffers **************************************************** */
[2265]862 char *command_to_open_fname = NULL;
[2351]863 char *fname = NULL;
864 char *tmp = NULL;
[128]865 int pos_in_fname;
866 /*@ int ******************************************************** */
867 int percentage;
[1]868
[128]869 /*@ long ******************************************************* */
870 long lines_in_filelist;
871 long lino = 0;
872 /*@ end vars *************************************************** */
[1]873
[128]874 assert_string_is_neither_NULL_nor_zerolength(filelist_fname);
[1]875
[128]876 if (!does_file_exist(filelist_fname)) {
877 fatal_error("filelist does not exist -- cannot load it");
[1]878 }
[541]879 log_to_screen("Loading filelist");
[2351]880 mr_asprintf(tmp, "zcat %s | wc -l", filelist_fname);
881 log_msg(6, "tmp = %s", tmp);
882 lines_in_filelist = atol(call_program_and_get_last_line_of_output(tmp));
883 mr_free(tmp);
[2265]884
[128]885 if (lines_in_filelist < 3) {
[541]886 log_to_screen("Warning - surprisingly short filelist.");
[1]887 }
[128]888 g_original_noof_lines_in_filelist = lines_in_filelist;
889 if (!(filelist = (struct s_node *) malloc(sizeof(struct s_node)))) {
890 return (NULL);
[1]891 }
[128]892 filelist->ch = '/';
893 filelist->right = NULL;
894 filelist->down = malloc(sizeof(struct s_node));
895 filelist->expanded = filelist->selected = FALSE;
896 (filelist->down)->ch = '\0';
897 (filelist->down)->right = (filelist->down)->down = FALSE;
898 (filelist->down)->expanded = (filelist->down)->selected = FALSE;
[2265]899
[2323]900 mr_asprintf(command_to_open_fname, "gzip -dc %s", filelist_fname);
[128]901 if (!(pin = popen(command_to_open_fname, "r"))) {
902 log_OS_error("Unable to openin filelist_fname");
[2265]903 mr_free(command_to_open_fname);
[128]904 return (NULL);
905 }
[2265]906 mr_free(command_to_open_fname);
907
[541]908 open_evalcall_form("Loading filelist from disk");
[2351]909 for (mr_getline(fname, pin); !feof(pin); mr_getline(fname, pin)) {
910 if ((strlen(fname) > 0) && (fname[strlen(fname) - 1] == 13 || fname[strlen(fname) - 1] == 10)) {
[128]911 fname[strlen(fname) - 1] = '\0';
912 }
913 if (!strlen(fname)) {
[2351]914 mr_free(fname);
[128]915 continue;
916 }
917 for (pos_in_fname = 0; fname[pos_in_fname] != '\0'; pos_in_fname++) {
918 if (fname[pos_in_fname] != '/') {
919 continue;
920 }
[2351]921 mr_asprintf(tmp, "%s", fname);
[128]922 tmp[pos_in_fname] = '\0';
923 if (strlen(tmp)) {
924 add_string_at_node(filelist, tmp);
925 }
[2351]926 mr_free(tmp);
[128]927 }
928 add_string_at_node(filelist, fname);
[2351]929
[128]930 if (!(++lino % 1111)) {
931 percentage = (int) (lino * 100 / lines_in_filelist);
932 update_evalcall_form(percentage);
933 }
[2357]934 mr_free(fname);
[128]935 }
[2351]936 mr_free(fname);
937
[128]938 paranoid_pclose(pin);
939 close_evalcall_form();
940 log_it("Finished loading filelist");
941 return (filelist);
[1]942}
943
944
945/**
946 * Log a list of files in @p node.
947 * @param node The toplevel node to use.
948 */
[128]949void show_filelist(struct s_node *node)
[1]950{
[128]951 static int depth = 0;
952 static char current_string[200];
[1]953
[128]954 if (depth == 0) {
955 log_msg(0, "----------------show filelist--------------");
956 }
957 current_string[depth] = node->ch;
[1]958
[128]959 log_msg(3, "depth=%d", depth);
960 if (node->down) {
961 log_msg(3, "moving down");
962 depth++;
963 show_filelist(node->down);
964 depth--;
965 }
[1]966
[128]967 if (!node->ch) {
968 log_msg(0, "%s\n", current_string);
969 }
[1]970
[128]971 if (node->right) {
972 log_msg(3, "moving right");
973 show_filelist(node->right);
974 }
975 if (depth == 0) {
976 log_msg(0, "----------------show filelist--------------");
977 }
978 return;
[1]979}
980
981
982
983
984/**
985 * Reset the filelist to the state it was when it was loaded. This does not
986 * touch the file on disk.
987 * @param filelist The filelist tree structure.
988 */
[128]989void reload_filelist(struct s_node *filelist)
[1]990{
[128]991 assert(filelist != NULL);
992 toggle_node_selection(filelist, FALSE);
993 toggle_path_expandability(filelist, "/", FALSE);
994 toggle_all_root_dirs_on(filelist);
[1]995}
996
997
998
999/**
1000 * Save a filelist tree structure to disk.
1001 * @param filelist The filelist tree structure to save.
1002 * @param outfname Where to save it.
1003 */
[128]1004void save_filelist(struct s_node *filelist, char *outfname)
[1]1005{
[128]1006 /*@ int ********************************************************* */
1007 static int percentage;
1008 static int depth = 0;
[1]1009
[128]1010 /*@ buffers ***************************************************** */
1011 static char str[MAX_STR_LEN];
[1]1012
[128]1013 /*@ structures ************************************************** */
1014 struct s_node *node;
[1]1015
[128]1016 /*@ pointers **************************************************** */
1017 static FILE *fout = NULL;
[1]1018
[128]1019 /*@ long ******************************************************** */
1020 static long lines_in_filelist = 0;
1021 static long lino = 0;
[1]1022
[128]1023 /*@ end vars *************************************************** */
[1]1024
[128]1025 assert(filelist != NULL);
1026 assert(outfname != NULL); // will be zerolength if save_filelist() is called by itself
1027 if (depth == 0) {
[541]1028 log_to_screen("Saving filelist");
[128]1029 if (!(fout = fopen(outfname, "w"))) {
1030 fatal_error("Cannot openout/save filelist");
1031 }
1032 lines_in_filelist = g_original_noof_lines_in_filelist; /* set by load_filelist() */
[541]1033 open_evalcall_form("Saving selection to disk");
[1]1034 }
[128]1035 for (node = filelist; node != NULL; node = node->right) {
1036 str[depth] = node->ch;
1037 log_msg(5, "depth=%d ch=%c", depth, node->ch);
1038 if (!node->ch) {
1039// if (node->selected)
1040// {
1041 fprintf(fout, "%s\n", str);
1042// }
1043 if (!(++lino % 1111)) {
1044 percentage = (int) (lino * 100 / lines_in_filelist);
1045 update_evalcall_form(percentage);
1046 }
1047 }
1048 if (node->down) {
1049 depth++;
1050 save_filelist(node->down, "");
1051 depth--;
1052 }
[1]1053 }
[128]1054 if (depth == 0) {
1055 paranoid_fclose(fout);
1056 close_evalcall_form();
1057 log_it("Finished saving filelist");
1058 }
[1]1059}
1060
1061
1062
1063/**
1064 * Toggle all root dirs on.
1065 * @param filelist The filelist tree structure to operate on.
1066 * @bug I don't understand this function. Would someone care to explain it?
1067 */
[128]1068void toggle_all_root_dirs_on(struct s_node *filelist)
[1]1069{
[128]1070 /*@ structures ************************************************** */
1071 struct s_node *node;
[1]1072
[128]1073 /*@ int ********************************************************* */
1074 static int depth = 0;
1075 static int root_dirs_expanded;
[1]1076
[128]1077 /*@ buffers ***************************************************** */
1078 static char filename[MAX_STR_LEN];
[1]1079
[128]1080 /*@ end vars *************************************************** */
[1]1081
[128]1082 assert(filelist != NULL);
1083 if (depth == 0) {
1084 log_it("Toggling all root dirs ON");
1085 root_dirs_expanded = 0;
[1]1086 }
[128]1087 for (node = filelist; node != NULL; node = node->right) {
1088 filename[depth] = node->ch;
1089 if (node->ch == '\0' && strlen(filename) > 1
1090 && (!strchr(filename + 1, '/'))) {
1091 node->selected = FALSE;
1092 node->expanded = TRUE;
1093// log_it (filename);
1094 root_dirs_expanded++;
1095 }
1096 if (node->down) {
1097 depth++;
1098 toggle_all_root_dirs_on(node->down);
1099 depth--;
1100 }
[1]1101 }
[128]1102 if (depth == 0) {
1103 log_it("Finished toggling all root dirs ON");
1104 }
[1]1105}
1106
1107
1108/**
1109 * Toggle the expandability of a path.
1110 * @param filelist The filelist tree to operate on.
1111 * @param pathname The path to toggle expandability of.
1112 * @param on_or_off Whether to toggle it on or off.
1113 * @bug I don't understand this function. Would someone care to explain it?
1114 */
1115void
[128]1116toggle_path_expandability(struct s_node *filelist, char *pathname,
1117 bool on_or_off)
[1]1118{
1119
[128]1120 /*@ int ******************************************************** */
1121 static int depth = 0;
1122 static int total_expanded;
1123 static int root_depth;
1124 int j;
1125 /*@ structures ************************************************* */
1126 struct s_node *node;
[1]1127
[128]1128 /*@ buffers **************************************************** */
1129 static char current_filename[MAX_STR_LEN];
[1]1130
1131/* char tmp[MAX_STR_LEN+2]; */
1132
[128]1133 /*@ end vars *************************************************** */
[1]1134
[128]1135 assert(filelist != NULL);
1136 assert_string_is_neither_NULL_nor_zerolength(pathname);
1137 if (depth == 0) {
1138 total_expanded = 0;
[1]1139// log_it ("Toggling path's expandability");
[128]1140 for (root_depth = (int) strlen(pathname);
1141 root_depth > 0 && pathname[root_depth - 1] != '/';
1142 root_depth--);
1143 if (root_depth < 2) {
1144 root_depth = (int) strlen(pathname);
1145 }
[1]1146 }
[128]1147 for (node = filelist; node != NULL; node = node->right) {
1148 current_filename[depth] = node->ch;
1149 if (node->down) {
1150 depth++;
1151 toggle_path_expandability(node->down, pathname, on_or_off);
1152 depth--;
[1]1153 }
[128]1154 if (node->ch == '\0') {
1155 if (!strncmp(pathname, current_filename, strlen(pathname))) {
1156 for (j = root_depth;
1157 current_filename[j] != '/'
1158 && current_filename[j] != '\0'; j++);
1159 if (current_filename[j] != '\0') {
1160 for (j++;
1161 current_filename[j] != '/'
1162 && current_filename[j] != '\0'; j++);
1163 }
1164 if (current_filename[j] == '\0') {
1165 node->expanded =
1166 (!strcmp(pathname, current_filename) ? TRUE :
1167 on_or_off);
1168 }
1169 }
[1]1170 }
[128]1171 if (node->expanded) {
1172 if (total_expanded < ARBITRARY_MAXIMUM - 32
1173 || !strrchr(current_filename + strlen(pathname), '/')) {
1174 total_expanded++;
1175 } else {
1176 node->expanded = FALSE;
1177 }
1178 }
[1]1179 }
[128]1180 if (depth == 0) {
1181// log_it ("Finished toggling expandability");
[1]1182 }
1183}
1184
1185/**
1186 * Toggle whether a path is selected.
1187 * @param filelist The filelist tree to operate on.
1188 * @param pathname The path to toggle selection of.
1189 * @param on_or_off Whether to toggle it on or off.
1190 * @bug I don't understand this function. Would someone care to explain it?
1191 */
1192void
[128]1193toggle_path_selection(struct s_node *filelist, char *pathname,
1194 bool on_or_off)
[1]1195{
[128]1196 /*@ int ********************************************************* */
1197 static int depth = 0;
1198 int j;
[1]1199
[128]1200 /*@ structures ************************************************** */
1201 struct s_node *node;
[1]1202
[128]1203 /*@ buffers ***************************************************** */
1204 static char current_filename[MAX_STR_LEN];
[1]1205
[128]1206 /*@ end vars *************************************************** */
1207 assert(filelist != NULL);
1208 assert_string_is_neither_NULL_nor_zerolength(pathname);
1209 if (depth == 0) {
1210 log_it("Toggling path's selection");
[1]1211 }
[128]1212 for (node = filelist; node != NULL; node = node->right) {
1213 current_filename[depth] = node->ch;
1214 if (node->down) {
1215 depth++;
1216 toggle_path_selection(node->down, pathname, on_or_off);
1217 depth--;
[1]1218 }
[128]1219 if (node->ch == '\0') {
1220 if (!strncmp(pathname, current_filename, strlen(pathname))) {
1221 for (j = 0;
1222 pathname[j] != '\0'
1223 && pathname[j] == current_filename[j]; j++);
[2265]1224 if (current_filename[j] == '/'
1225 || current_filename[j] == '\0') {
1226 node->selected = on_or_off;
[128]1227 }
1228 }
1229 }
[1]1230 }
[128]1231 if (depth == 0) {
1232 log_it("Finished toggling selection");
1233 }
[1]1234}
1235
1236
1237/**
1238 * Toggle node selection of a filelist tree.
1239 * @param filelist The filelist tree to operate on.
1240 * @param on_or_off Whether to toggle selection on or off.
1241 * @bug I don't understand this function. Would someone care to explain it?
1242 */
[128]1243void toggle_node_selection(struct s_node *filelist, bool on_or_off)
[1]1244{
[128]1245 /*@ structure ************************************************** */
1246 struct s_node *node;
[1]1247
[128]1248 /*@ end vars *************************************************** */
1249 assert(filelist != NULL);
1250 for (node = filelist; node != NULL; node = node->right) {
1251 if (node->ch == '/') {
1252 continue;
1253 } /* don't go deep */
1254 if (node->ch == '\0') {
1255 node->selected = on_or_off;
1256 }
1257 if (node->down) {
1258 toggle_node_selection(node->down, on_or_off);
1259 }
[1]1260 }
1261}
1262
1263
1264
1265
1266
1267
1268
1269/**
1270 * The pathname to the skeleton filelist, used to give better progress reporting for mondo_makefilelist().
1271 */
[128]1272char *g_skeleton_filelist = NULL;
[1]1273
1274/**
1275 * Number of entries in the skeleton filelist.
1276 */
[128]1277long g_skeleton_entries = 0;
[1]1278
1279/**
1280 * Wrapper around mondo_makefilelist().
1281 * @param bkpinfo The backup information structure. Fields used:
1282 * - @c bkpinfo->differential
1283 * - @c bkpinfo->exclude_paths
1284 * - @c bkpinfo->include_paths
1285 * - @c bkpinfo->make_filelist
1286 * - @c bkpinfo->scratchdir
1287 * - @c bkpinfo->tmpdir
1288 * @return 0 for success, nonzero for failure.
1289 * @see mondo_makefilelist
1290 */
[1645]1291int prepare_filelist()
[1]1292{
1293
[128]1294 /*@ int **************************************************** */
1295 int res = 0;
[1]1296
[128]1297 assert(bkpinfo != NULL);
[2320]1298 log_it("tmpdir=%s; scratchdir=%s", bkpinfo->tmpdir, bkpinfo->scratchdir);
[128]1299 if (bkpinfo->make_filelist) {
1300 mvaddstr_and_log_it(g_currentY, 0,
[541]1301 "Making catalog of files to be backed up");
[128]1302 } else {
1303 mvaddstr_and_log_it(g_currentY, 0,
[541]1304 "Using supplied catalog of files to be backed up");
[128]1305 }
[1]1306
[128]1307 if (bkpinfo->make_filelist) {
1308 res =
[2321]1309 mondo_makefilelist(MONDO_LOGFILE, bkpinfo->include_paths, bkpinfo->exclude_paths, bkpinfo->differential, NULL);
[128]1310 } else {
1311 res =
[2321]1312 mondo_makefilelist(MONDO_LOGFILE, NULL, bkpinfo->exclude_paths, bkpinfo->differential, bkpinfo->include_paths);
[128]1313 }
[1]1314
[128]1315 if (res) {
[676]1316 log_OS_error("Call to mondo_makefilelist failed");
[541]1317 mvaddstr_and_log_it(g_currentY++, 74, "Failed.");
[128]1318 } else {
[541]1319 mvaddstr_and_log_it(g_currentY++, 74, "Done.");
[128]1320 }
1321 return (res);
[1]1322}
1323
1324
1325/**
1326 * Recursively list all files in @p dir newer than @p time_of_last_full_backup to @p fout.
1327 * @param dir The directory to list to @p fout.
1328 * @param sth The directories to skip (exclude).
1329 * @param fout The file to write everything to.
1330 * @param time_of_last_full_backup Only backup files newer than this (0 to disable).
1331 * @return 0, always.
1332 * @bug Return value should be @c void.
1333 */
[2340]1334int open_and_list_dir(char *dir1, char *sth, FILE * fout, time_t time_of_last_full_backup) {
1335
[820]1336 const char delims[] = " ";
1337
[128]1338 DIR *dip;
1339 struct dirent *dit;
1340 struct stat statbuf;
[2099]1341 char *new;
[2340]1342 char *tmp = NULL;
[2198]1343 char *dir = NULL;
[128]1344 static int percentage = 0;
[2340]1345 char *skip_these = NULL;
1346 char *new_with_spaces = NULL;
[820]1347 char *strtmp;
1348 char *token;
[2340]1349 char *find_excludes = NULL;
1350 char *name_of_evalcall_form = NULL;
1351 char *find_skeleton_marker = NULL;
[128]1352 int i;
[820]1353 int lastpos = 0;
[128]1354 static int depth = 0;
1355 char *p;
1356 static int counter = 0;
1357 static int uberctr = 0;
[2340]1358 static long skeleton_lino = 0L;
1359 static time_t last_time = (time_t)0;
[128]1360 time_t this_time;
[1]1361
[2206]1362 dir = mr_stresc(dir1, "`$\\\"(){}'[]&*?|!#~", '\\');
[128]1363 p = strrchr(dir, '/');
1364 if (p) {
1365 if (!strcmp(p, "/.") || !strcmp(p, "/..")) {
[2241]1366 mr_free(dir);
[128]1367 return (0);
1368 }
1369 }
1370
1371 if (!depth) {
[2323]1372 mr_asprintf(find_excludes, " ");
[2320]1373 if (sth != NULL) {
1374 while((token = mr_strtok(sth, delims, &lastpos))) {
1375 mr_strcat(find_excludes," -path %s -prune -o", token);
[2321]1376 mr_free(token);
[2320]1377 }
[820]1378 }
[1]1379#if linux
[128]1380 // 2.6 has /sys as a proc-type thing -- must be excluded
[2323]1381 mr_asprintf(strtmp, "find '%s' -fstype mvfs -prune -o -fstype devpts -prune -o -fstype tmpfs -prune -o -fstype proc -prune -o -fstype sysfs -prune -o %s -type d -print > %s 2> /dev/null", dir, find_excludes, g_skeleton_filelist);
[1]1382#else
[128]1383 // On BSD, for example, /sys is the kernel sources -- don't exclude
[2323]1384 mr_asprintf(strtmp, "find '%s' -fstype mvfs -prune -o -path /proc -prune -o %s -type d -print > %s 2> /dev/null", dir, find_excludes, g_skeleton_filelist);
[1]1385#endif
[2320]1386 mr_free(find_excludes);
1387
[820]1388 log_msg(5, "find command = %s", strtmp);
[2202]1389 (void)system(strtmp);
[2320]1390 mr_free(strtmp);
1391
[2323]1392 mr_asprintf(tmp, "wc -l %s | awk '{print $1;}'", g_skeleton_filelist);
[2320]1393 g_skeleton_entries = 1 + atol(call_program_and_get_last_line_of_output(tmp));
1394 mr_free(tmp);
1395
[2340]1396 mr_asprintf(name_of_evalcall_form, "Making catalog of %s", dir);
[128]1397 open_evalcall_form(name_of_evalcall_form);
[2340]1398 mr_free(name_of_evalcall_form);
1399
[128]1400 skeleton_lino = 1;
1401 log_msg(5, "entries = %ld", g_skeleton_entries);
1402 percentage = 0;
[2190]1403 } else // update evalcall form if appropriate
[128]1404 {
[2340]1405 mr_asprintf(find_skeleton_marker, "grep -Fv '%s' %s > %s.new 2> /dev/null", dir, g_skeleton_filelist, g_skeleton_filelist);
[128]1406 if (!system(find_skeleton_marker)) {
1407 percentage = (int) (skeleton_lino * 100 / g_skeleton_entries);
1408 skeleton_lino++;
[2340]1409 mr_free(find_skeleton_marker);
1410
1411 mr_asprintf(find_skeleton_marker, "mv -f %s.new %s", g_skeleton_filelist, g_skeleton_filelist);
1412 (void)system(find_skeleton_marker);
[128]1413 time(&this_time);
1414 if (this_time != last_time) {
1415 last_time = this_time;
1416 if (!g_text_mode) {
[2323]1417 mr_asprintf(tmp, "Reading %-68s", dir);
[128]1418 newtDrawRootText(0, g_noof_rows - 3, tmp);
[2324]1419 mr_free(tmp);
[128]1420 }
1421 update_evalcall_form(percentage);
1422 }
[1]1423 }
[2340]1424 mr_free(find_skeleton_marker);
[128]1425 }
[1]1426
[128]1427 depth++;
[1]1428
1429// log_msg(0, "Cataloguing %s", dir);
[128]1430 if (sth[0] == ' ') {
[2323]1431 mr_asprintf(skip_these, "%s", sth);
[128]1432 } else {
[2323]1433 mr_asprintf(skip_these, " %s ", sth);
[128]1434 }
[2323]1435 mr_asprintf(new_with_spaces, " %s ", dir);
[128]1436 if ((dip = opendir(dir)) == NULL) {
[2323]1437 mr_asprintf(tmp,"opendir %s", dir);
[1260]1438 log_OS_error(tmp);
[2324]1439 mr_free(tmp);
[128]1440 } else if (strstr(skip_these, new_with_spaces)) {
1441 fprintf(fout, "%s\n", dir); // if excluded dir then print dir ONLY
1442 } else {
1443 fprintf(fout, "%s\n", dir);
1444 while ((dit = readdir(dip)) != NULL) {
1445 i++;
1446 if (strcmp(dir, "/")) {
[2323]1447 mr_asprintf(new,"%s/%s",dir,dit->d_name);
[2099]1448 } else {
[2323]1449 mr_asprintf(new,"%s%s",dir,dit->d_name);
[128]1450 }
[2340]1451 mr_free(new_with_spaces);
[2323]1452 mr_asprintf(new_with_spaces, " %s ", new);
[128]1453 if (strstr(skip_these, new_with_spaces)) {
1454 fprintf(fout, "%s\n", new);
[2324]1455 mr_free(new_with_spaces);
[128]1456 } else {
[2324]1457 mr_free(new_with_spaces);
[128]1458 if (!lstat(new, &statbuf)) {
1459 if (!S_ISLNK(statbuf.st_mode)
1460 && S_ISDIR(statbuf.st_mode)) {
[2340]1461 open_and_list_dir(new, skip_these, fout, time_of_last_full_backup);
[128]1462 } else {
[2340]1463 if (time_of_last_full_backup == 0 || time_of_last_full_backup < statbuf.st_ctime) {
[128]1464 fprintf(fout, "%s\n", new);
1465 if ((counter++) > 128) {
1466 counter = 0;
1467 uberctr++;
[2323]1468 mr_asprintf(tmp, " %c ", special_dot_char(uberctr));
[128]1469 if (!g_text_mode) {
[2324]1470 newtDrawRootText(77, g_noof_rows - 3, tmp);
[128]1471 newtRefresh();
1472 }
[2340]1473 mr_free(tmp);
[128]1474 }
1475 }
1476 }
1477 }
1478 }
[2340]1479 mr_free(new);
[1]1480 }
[128]1481 }
[2340]1482 mr_free(new_with_spaces);
1483 mr_free(skip_these);
[2241]1484 mr_free(dir);
[2099]1485
[128]1486 if (dip) {
1487 if (closedir(dip) == -1) {
1488 log_OS_error("closedir");
1489 }
1490 }
1491 depth--;
1492 if (!depth) {
1493 close_evalcall_form();
1494 unlink(g_skeleton_filelist);
1495 log_msg(5, "g_skeleton_entries = %ld", g_skeleton_entries);
1496 }
1497 return (0);
[1]1498}
1499
1500
1501
1502/**
1503 * Get the next entry in the space-separated list in @p incoming.
1504 * So if @p incoming was '"one and two" three four', we would
1505 * return "one and two".
1506 * @param incoming The list to get the next entry from.
1507 * @return The first item in the list (respecting double quotes).
1508 * @note The returned string points to static data that will be overwritten with each call.
1509 */
[128]1510char *next_entry(char *incoming)
[1]1511{
[2100]1512 char *sz_res;
[128]1513 char *p;
1514 bool in_quotes = FALSE;
[1]1515
[2323]1516 mr_asprintf(sz_res, "%s", incoming);
[128]1517 p = sz_res;
1518 while ((*p != ' ' || in_quotes) && *p != '\0') {
1519 if (*p == '\"') {
1520 in_quotes = !in_quotes;
1521 }
1522 p++;
1523 }
1524 *p = '\0';
1525 return (sz_res);
[1]1526}
1527
1528
1529
1530/**
1531 * Create the filelist for the backup. It will be stored in [scratchdir]/archives/filelist.full.
1532 * @param logfile Unused.
1533 * @param include_paths The paths to back up, or NULL if you're using a user-defined filelist.
1534 * @param excp The paths to NOT back up.
1535 * @param differential The differential level (currently only 0 and 1 are supported).
1536 * @param userdef_filelist The user-defined filelist, or NULL if you're using @p include_paths.
1537 * @return 0, always.
1538 * @bug @p logfile is unused.
1539 * @bug Return value is meaningless.
1540 */
[2321]1541int mondo_makefilelist(char *logfile, char *include_paths, char *excp, int differential, char *userdef_filelist)
[1]1542{
1543 char *p, *q;
[2099]1544 char *sz_datefile;
[2320]1545 char *sz_filelist;
1546 char *exclude_paths = NULL;
1547 char *tmp;
[1]1548 int i;
[128]1549 FILE *fout;
[2265]1550 char *command = NULL;
[128]1551 time_t time_of_last_full_backup = 0;
[1]1552 struct stat statbuf;
[1854]1553 char *tmp1 = NULL;
[1856]1554 char *tmp2 = NULL;
[1]1555
[128]1556 malloc_string(tmp);
1557 malloc_string(g_skeleton_filelist);
[2323]1558 mr_asprintf(sz_datefile,MONDO_CACHE"/difflevel.%d" , 0);
[128]1559 if (!include_paths && !userdef_filelist) {
[2324]1560 fatal_error("Please supply either include_paths or userdef_filelist");
[128]1561 }
[2279]1562 // make hole for filelist
[2323]1563 mr_asprintf(command, "mkdir -p %s/archives", bkpinfo->scratchdir);
[128]1564 paranoid_system(command);
[2265]1565 mr_free(command);
1566
[2323]1567 mr_asprintf(sz_filelist, "%s/tmpfs/filelist.full", bkpinfo->tmpdir);
[128]1568 make_hole_for_file(sz_filelist);
[1]1569
[128]1570 if (differential == 0) {
1571 // restore last good datefile if it exists
[2323]1572 mr_asprintf(command, "cp -f %s.aborted %s", sz_datefile, sz_datefile);
[128]1573 run_program_and_log_output(command, 3);
[2265]1574 mr_free(command);
1575
[128]1576 // backup last known good datefile just in case :)
1577 if (does_file_exist(sz_datefile)) {
[2324]1578 mr_asprintf(command, "mv -f %s %s.aborted", sz_datefile, sz_datefile);
[128]1579 paranoid_system(command);
[2265]1580 mr_free(command);
[128]1581 }
1582 make_hole_for_file(sz_datefile);
1583 write_one_liner_data_file(sz_datefile,
1584 call_program_and_get_last_line_of_output
1585 ("date +%s"));
1586 } else if (lstat(sz_datefile, &statbuf)) {
[2340]1587 log_msg(2, "Warning - unable to find date of previous backup. Full backup instead.");
[128]1588 differential = 0;
1589 time_of_last_full_backup = 0;
1590 } else {
1591 time_of_last_full_backup = statbuf.st_mtime;
1592 log_msg(2, "Differential backup. Yay.");
1593 }
[2099]1594 paranoid_free(sz_datefile);
[1]1595
1596// use user-specified filelist (if specified)
[128]1597 if (userdef_filelist) {
[2340]1598 log_msg(1, "Using the user-specified filelist - %s - instead of calculating one", userdef_filelist);
[2323]1599 mr_asprintf(command, "cp -f %s %s", userdef_filelist, sz_filelist);
[128]1600 if (run_program_and_log_output(command, 3)) {
[2265]1601 mr_free(command);
[128]1602 fatal_error("Failed to copy user-specified filelist");
1603 }
[2265]1604 mr_free(command);
[128]1605 } else {
[2320]1606 if (include_paths) {
1607 log_msg(2, "include_paths = '%s'", include_paths);
1608 }
[128]1609 log_msg(1, "Calculating filelist");
[2323]1610 mr_asprintf(tmp2, "%s", call_program_and_get_last_line_of_output("mount | grep -Ew 'ntfs|ntfs-3g|fat|vfat|dos' | awk '{print $3}'"));
[1856]1611 if (strlen(tmp2) < 1) {
[2323]1612 mr_asprintf(tmp1," ");
[1856]1613 } else {
1614 log_msg(2, "Found windows FS: %s",tmp2);
[2323]1615 mr_asprintf(tmp1, "find %s -name '/win386.swp' -o -name '/hiberfil.sys' -o -name '/pagefile.sys' 2> /dev/null\n",tmp2);
[2324]1616 mr_free(tmp2);
[2323]1617 mr_asprintf(tmp2, "%s", call_program_and_get_last_line_of_output(tmp1));
[1856]1618 log_msg(2, "Found windows files: %s",tmp2);
1619 }
[2320]1620 mr_free(tmp1);
[1]1621
[2323]1622 mr_asprintf(exclude_paths, " %s %s %s %s %s . .. " MNT_CDROM " " MNT_FLOPPY " /media /tmp /proc /sys " MINDI_CACHE, MONDO_CACHE, (excp == NULL) ? "" : excp, tmp2, (bkpinfo->tmpdir[0] == '/' && bkpinfo->tmpdir[1] == '/') ? (bkpinfo->tmpdir + 1) : bkpinfo->tmpdir, (bkpinfo->scratchdir[0] == '/' && bkpinfo->scratchdir[1] == '/') ? (bkpinfo->scratchdir + 1) : bkpinfo->scratchdir);
[2320]1623 mr_free(tmp2);
[1856]1624
[128]1625 log_msg(2, "Excluding paths = '%s'", exclude_paths);
[2320]1626 log_msg(2, "Generating skeleton filelist so that we can track our progress");
[2321]1627 sprintf(g_skeleton_filelist, "%s/tmpfs/skeleton.txt", bkpinfo->tmpdir);
[128]1628 make_hole_for_file(g_skeleton_filelist);
1629 log_msg(4, "g_skeleton_entries = %ld", g_skeleton_entries);
1630 log_msg(2, "Opening out filelist to %s", sz_filelist);
1631 if (!(fout = fopen(sz_filelist, "w"))) {
1632 fatal_error("Cannot openout to sz_filelist");
[1]1633 }
[128]1634 i = 0;
[2320]1635 if ((!include_paths) || (strlen(include_paths) == 0)) {
[128]1636 log_msg(1, "Including only '/' in %s", sz_filelist);
1637 open_and_list_dir("/", exclude_paths, fout,
1638 time_of_last_full_backup);
1639 } else {
1640 p = include_paths;
1641 while (*p) {
1642 q = next_entry(p);
1643 log_msg(1, "Including %s in filelist %s", q, sz_filelist);
1644 open_and_list_dir(q, exclude_paths, fout,
1645 time_of_last_full_backup);
1646 p += strlen(q);
[2100]1647 paranoid_free(q);
[128]1648 while (*p == ' ') {
1649 p++;
1650 }
[1]1651 }
1652 }
[2320]1653 mr_free(exclude_paths);
[128]1654 paranoid_fclose(fout);
1655 }
1656 log_msg(2, "Copying new filelist to scratchdir");
[2323]1657 mr_asprintf(command, "mkdir -p %s/archives", bkpinfo->scratchdir);
[128]1658 paranoid_system(command);
[2265]1659 mr_free(command);
1660
[2323]1661 mr_asprintf(command, "cp -f %s %s/archives/", sz_filelist, bkpinfo->scratchdir);
[128]1662 paranoid_system(command);
[2265]1663 mr_free(command);
1664
[2323]1665 mr_asprintf(command, "mv -f %s %s", sz_filelist, bkpinfo->tmpdir);
[128]1666 paranoid_system(command);
[2265]1667 mr_free(command);
1668
[2099]1669 paranoid_free(sz_filelist);
[128]1670 log_msg(2, "Freeing variables");
1671 paranoid_free(tmp);
1672 paranoid_free(g_skeleton_filelist);
1673 log_msg(2, "Exiting");
1674 return (0);
[1]1675}
1676
1677
1678
1679
1680/**
1681 * Locate the string @p string_to_find in the tree rooted at @p startnode.
1682 * @param startnode The node containing the root of the directory tree.
1683 * @param string_to_find The string to look for at @p startnode.
1684 * @return The node containing the last element of @p string_to_find, or NULL if
1685 * it was not found.
1686 */
[128]1687struct s_node *find_string_at_node(struct s_node *startnode,
1688 char *string_to_find)
[1]1689{
[128]1690 /*@ int ******************************************************** */
1691 int noof_chars;
1692 static int depth = 0;
1693 static char original_string[MAX_STR_LEN];
[1]1694
[128]1695 /*@ sturctures ************************************************* */
1696 struct s_node *node;
[1]1697
[128]1698 /*@ char ****************************************************** */
1699 char char_to_find;
[1]1700
[128]1701 /*@ bools ****************************************************** */
[1]1702
[128]1703 if (!depth) {
1704 strcpy(original_string, string_to_find);
1705 }
[1]1706
[128]1707 assert(startnode != NULL);
1708 assert(string_to_find != NULL);
[1]1709
[128]1710 noof_chars = strlen(string_to_find) + 1; /* we include the '\0' */
[1]1711
[128]1712 log_msg(7, "starting --- str=%s", string_to_find);
[1]1713
1714/* walk across tree if necessary */
[128]1715 node = startnode;
1716 char_to_find = string_to_find[0];
1717 if (node->right != NULL && node->ch < char_to_find) {
1718 log_msg(7, "depth=%d --- going RIGHT ... %c-->%c", depth,
1719 char_to_find, node->ch, (node->right)->ch);
1720 return (find_string_at_node(node->right, string_to_find));
1721 }
[1]1722
1723/* walk down tree if appropriate */
[128]1724 if (node->down != NULL && node->ch == char_to_find) {
1725 log_msg(7, "depth=%d char=%c --- going DOWN", depth, char_to_find);
1726 depth++;
1727 node = find_string_at_node(node->down, string_to_find + 1);
1728 depth--;
1729 return (node);
1730 }
[1]1731
[128]1732 if (char_to_find == '\0' && node->ch == '\0') {
1733 log_msg(7, "%s is in tree", original_string);
1734 return (node);
1735 } else {
1736 log_msg(7, "%s is NOT in tree", original_string);
1737 return (NULL);
1738 }
[1]1739}
1740
1741
1742
1743/**
1744 * Write all entries in @p needles_list_fname which are also in
1745 * @p filelist to @p matches_list_fname.
1746 * @param needles_list_fname A file containing strings to look for, 1 per line.
1747 * @param filelist The node for the root of the directory structure to search in.
1748 * @param matches_list_fname The filename where we should put the matches.
1749 * @return The number of matches found.
1750 */
[128]1751long save_filelist_entries_in_common(char *needles_list_fname,
1752 struct s_node *filelist,
1753 char *matches_list_fname,
1754 bool use_star)
[1]1755{
[128]1756 int retval = 0;
1757 struct s_node *found_node;
1758 FILE *fin;
1759 FILE *fout;
1760 char *fname;
1761 char *tmp;
[2331]1762 size_t len = 0;
[1]1763
[128]1764 malloc_string(fname);
1765 malloc_string(tmp);
1766 log_msg(5, "starting");
1767 log_msg(5, "needles_list_fname = %s", needles_list_fname);
1768 log_msg(5, "matches_list_fname = %s", matches_list_fname);
1769 if (!(fin = fopen(needles_list_fname, "r"))) {
1770 fatal_error("Cannot openin needles_list_fname");
1771 }
1772 if (!(fout = fopen(matches_list_fname, "w"))) {
1773 fatal_error("Cannot openout matches_list_fname");
1774 }
1775 while (!feof(fin)) {
[1]1776// fscanf(fin, "%s\n", fname);
[128]1777 len = MAX_STR_LEN - 1;
[2202]1778 (void)getline(&fname, &len, fin); // patch by Scrub
[128]1779 if (!use_star) {
1780 if (fname[0] == '/') {
1781 strcpy(tmp, fname);
1782 } else {
1783 tmp[0] = '/';
1784 strcpy(tmp + 1, fname);
1785 }
1786 strcpy(fname, tmp);
1787 }
1788 while (strlen(fname) > 0 && fname[strlen(fname) - 1] < 32) {
1789 fname[strlen(fname) - 1] = '\0';
1790 }
[1]1791
[128]1792 log_msg(5, "Looking for '%s'", fname);
1793 found_node = find_string_at_node(filelist, fname);
1794 if (found_node) {
1795 if (found_node->selected) {
1796 if (fname[0] == '/') {
1797 strcpy(tmp, fname + 1);
1798 strcpy(fname, tmp);
1799 }
1800 log_msg(5, "Found '%s'", fname);
1801 turn_wildcard_chars_into_literal_chars(tmp, fname);
1802 fprintf(fout, "%s\n", tmp);
1803 retval++;
1804 }
[1]1805 }
1806 }
[128]1807 paranoid_fclose(fout);
1808 paranoid_fclose(fin);
1809 paranoid_free(fname);
1810 paranoid_free(tmp);
1811 return (retval);
[1]1812}
1813
1814
1815
1816
1817
1818
1819/**
1820 * Add all files listed in @p list_of_files_fname to the directory structure rooted at
1821 * @p filelist.
1822 * @param filelist The top node of the directory structure to add the files to.
1823 * @param list_of_files_fname The file containing the files to add, 1 per line.
1824 * @param flag_em If TRUE, then flag the added files for restoration.
1825 * @return 0 for success, nonzero for failure.
1826 */
[128]1827int add_list_of_files_to_filelist(struct s_node *filelist,
1828 char *list_of_files_fname, bool flag_em)
[1]1829{
[2351]1830 FILE *fin = NULL;
1831 char *tmp = NULL;
1832 struct s_node *nod = NULL;
[1]1833
[128]1834 log_msg(3, "Adding %s to filelist", list_of_files_fname);
1835 if (!(fin = fopen(list_of_files_fname, "r"))) {
[2227]1836 log_it("%s",list_of_files_fname);
[128]1837 return (1);
1838 }
[2351]1839 for (mr_getline(tmp, fin); !feof(fin); mr_getline(tmp, fin)) {
[128]1840 if (!tmp[0]) {
[2351]1841 mr_free(tmp);
[128]1842 continue;
1843 }
[2351]1844 if ((strlen(tmp) > 0) && (tmp[strlen(tmp) - 1] == 13 || tmp[strlen(tmp) - 1] == 10)) {
[128]1845 tmp[strlen(tmp) - 1] = '\0';
1846 }
1847 log_msg(2, "tmp = '%s'", tmp);
1848 if (!tmp[0]) {
[2351]1849 mr_free(tmp);
[128]1850 continue;
1851 }
1852 if ((nod = find_string_at_node(filelist, tmp))) {
1853 log_msg(5, "Found '%s' in filelist already. Cool.", tmp);
1854 } else {
1855 add_string_at_node(filelist, tmp);
1856 nod = find_string_at_node(filelist, tmp);
1857 }
[1]1858
[128]1859 if (nod && flag_em) {
1860 toggle_path_selection(filelist, tmp, TRUE);
1861 log_msg(5, "Flagged '%s'", tmp);
1862 }
[2351]1863 mr_free(tmp);
[1]1864 }
[2351]1865 mr_free(tmp);
[128]1866 paranoid_fclose(fin);
1867 return (0);
[1]1868}
1869
1870/* @} - end of filelistGroup */
Note: See TracBrowser for help on using the repository browser.