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