]> git.wh0rd.org - dump.git/blob - restore/utilities.c
Hashlist implementation for directory entries in restore.
[dump.git] / restore / utilities.c
1 /*
2 * Ported to Linux's Second Extended File System as part of the
3 * dump and restore backup suit
4 * Remy Card <card@Linux.EU.Org>, 1994-1997
5 * Stelian Pop <stelian@popies.net>, 1999-2000
6 * Stelian Pop <stelian@popies.net> - AlcĂ´ve <www.alcove.com>, 2000-2002
7 */
8
9 /*
10 * Copyright (c) 1983, 1993
11 * The Regents of the University of California. All rights reserved.
12 *
13 * Redistribution and use in source and binary forms, with or without
14 * modification, are permitted provided that the following conditions
15 * are met:
16 * 1. Redistributions of source code must retain the above copyright
17 * notice, this list of conditions and the following disclaimer.
18 * 2. Redistributions in binary form must reproduce the above copyright
19 * notice, this list of conditions and the following disclaimer in the
20 * documentation and/or other materials provided with the distribution.
21 * 3. Neither the name of the University nor the names of its contributors
22 * may be used to endorse or promote products derived from this software
23 * without specific prior written permission.
24 *
25 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
26 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
28 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * SUCH DAMAGE.
36 */
37
38 #ifndef lint
39 static const char rcsid[] =
40 "$Id: utilities.c,v 1.25 2004/12/14 14:07:58 stelian Exp $";
41 #endif /* not lint */
42
43 #include <config.h>
44 #include <compatlfs.h>
45 #include <sys/types.h>
46 #include <errno.h>
47 #include <compaterr.h>
48 #include <stdio.h>
49 #include <string.h>
50 #include <unistd.h>
51
52 #include <sys/param.h>
53 #include <sys/stat.h>
54
55 #ifdef __linux__
56 #include <sys/time.h>
57 #include <time.h>
58 #include <fcntl.h>
59 #ifdef HAVE_EXT2FS_EXT2_FS_H
60 #include <ext2fs/ext2_fs.h>
61 #else
62 #include <linux/ext2_fs.h>
63 #endif
64 #include <ext2fs/ext2fs.h>
65 #include <bsdcompat.h>
66 #else /* __linux__ */
67 #ifdef sunos
68 #include <sys/time.h>
69 #include <sys/fcntl.h>
70 #include <bsdcompat.h>
71 #else
72 #include <ufs/ufs/dinode.h>
73 #include <ufs/ufs/dir.h>
74 #endif
75 #endif /* __linux__ */
76 #ifdef DUMP_MACOSX
77 #include "darwin.h"
78 #endif
79 #include "restore.h"
80 #include "extern.h"
81
82 /*
83 * Insure that all the components of a pathname exist.
84 */
85 void
86 pathcheck(char *name)
87 {
88 char *cp;
89 struct entry *ep;
90 char *start;
91
92 start = strchr(name, '/');
93 if (start == 0)
94 return;
95 for (cp = start; *cp != '\0'; cp++) {
96 if (*cp != '/')
97 continue;
98 *cp = '\0';
99 ep = lookupname(name);
100 if (ep == NULL) {
101 /* Safe; we know the pathname exists in the dump. */
102 ep = addentry(name, pathsearch(name)->d_ino, NODE);
103 newnode(ep);
104 }
105 ep->e_flags |= NEW|KEEP;
106 *cp = '/';
107 }
108 }
109
110 /*
111 * Change a name to a unique temporary name.
112 */
113 void
114 mktempname(struct entry *ep)
115 {
116 char oldname[MAXPATHLEN];
117
118 if (ep->e_flags & TMPNAME)
119 badentry(ep, "mktempname: called with TMPNAME");
120 ep->e_flags |= TMPNAME;
121 (void) strcpy(oldname, myname(ep));
122 freename(ep->e_name);
123 ep->e_name = savename(gentempname(ep));
124 ep->e_namlen = strlen(ep->e_name);
125 renameit(oldname, myname(ep));
126 }
127
128 /*
129 * Generate a temporary name for an entry.
130 */
131 char *
132 gentempname(struct entry *ep)
133 {
134 static char name[MAXPATHLEN];
135 struct entry *np;
136 long i = 0;
137
138 for (np = lookupino(ep->e_ino);
139 np != NULL && np != ep; np = np->e_links)
140 i++;
141 if (np == NULL)
142 badentry(ep, "not on ino list");
143 (void) snprintf(name, sizeof(name), "%s%ld%lu", TMPHDR, i, (unsigned long)ep->e_ino);
144 return (name);
145 }
146
147 /*
148 * Rename a file or directory.
149 */
150 void
151 renameit(char *from, char *to)
152 {
153 if (!Nflag && rename(from, to) < 0) {
154 warn("cannot rename %s to %s", from, to);
155 return;
156 }
157 Vprintf(stdout, "rename %s to %s\n", from, to);
158 }
159
160 /*
161 * Create a new node (directory).
162 */
163 void
164 newnode(struct entry *np)
165 {
166 char *cp;
167 if (np->e_type != NODE)
168 badentry(np, "newnode: not a node");
169 cp = myname(np);
170 if (command == 'C') return;
171
172 if (!Nflag && mkdir(cp, 0777) < 0 && !uflag) {
173 np->e_flags |= EXISTED;
174 warn("%s", cp);
175 return;
176 }
177 Vprintf(stdout, "Make node %s\n", cp);
178 }
179
180 /*
181 * Remove an old node (directory).
182 */
183 void
184 removenode(struct entry *ep)
185 {
186 char *cp;
187
188 if (ep->e_type != NODE)
189 badentry(ep, "removenode: not a node");
190 if (ep->e_entries != NULL) {
191 int i;
192 for (i = 0; i < DIRHASH_SIZE; i++) {
193 if (ep->e_entries[i] != NULL)
194 badentry(ep, "removenode: non-empty directory");
195 }
196 }
197 ep->e_flags |= REMOVED;
198 ep->e_flags &= ~TMPNAME;
199 cp = myname(ep);
200 if (!Nflag && rmdir(cp) < 0) {
201 warn("%s", cp);
202 return;
203 }
204 Vprintf(stdout, "Remove node %s\n", cp);
205 }
206
207 /*
208 * Remove a leaf.
209 */
210 void
211 removeleaf(struct entry *ep)
212 {
213 char *cp;
214
215 if (command == 'C') return;
216
217 if (ep->e_type != LEAF)
218 badentry(ep, "removeleaf: not a leaf");
219 ep->e_flags |= REMOVED;
220 ep->e_flags &= ~TMPNAME;
221 cp = myname(ep);
222 if (!Nflag && unlink(cp) < 0) {
223 warn("%s", cp);
224 return;
225 }
226 Vprintf(stdout, "Remove leaf %s\n", cp);
227 }
228
229 /*
230 * Create a link.
231 */
232 int
233 linkit(char *existing, char *new, int type)
234 {
235
236 /* if we want to unlink first, do it now so *link() won't fail */
237 if (uflag && !Nflag)
238 (void)unlink(new);
239
240 if (type == SYMLINK) {
241 if (!Nflag && symlink(existing, new) < 0) {
242 warn("cannot create symbolic link %s->%s",
243 new, existing);
244 return (FAIL);
245 }
246 } else if (type == HARDLINK) {
247 int ret;
248
249 if (!Nflag && (ret = link(existing, new)) < 0) {
250
251 #if !defined(__linux__) && !defined(sunos)
252 struct stat s;
253
254 /*
255 * Most likely, the schg flag is set. Clear the
256 * flags and try again.
257 */
258 if (stat(existing, &s) == 0 && s.st_flags != 0 &&
259 chflags(existing, 0) == 0) {
260 ret = link(existing, new);
261 chflags(existing, s.st_flags);
262 }
263 #else
264 unsigned long s;
265
266 /*
267 * Most likely, the immutable or append-only attribute
268 * is set. Clear the attributes and try again.
269 */
270 #ifdef sunos
271 #else
272 if (fgetflags (existing, &s) != -1 &&
273 fsetflags (existing, 0) != -1) {
274 ret = link(existing, new);
275 fsetflags(existing, s);
276 }
277 #endif
278 #endif
279 if (ret < 0) {
280 warn("warning: cannot create hard link %s->%s",
281 new, existing);
282 return (FAIL);
283 }
284 }
285 } else {
286 panic("linkit: unknown type %d\n", type);
287 return (FAIL);
288 }
289 Vprintf(stdout, "Create %s link %s->%s\n",
290 type == SYMLINK ? "symbolic" : "hard", new, existing);
291 return (GOOD);
292 }
293
294 #if !defined(__linux__) && !defined(sunos)
295 /*
296 * Create a whiteout.
297 */
298 int
299 addwhiteout(char *name)
300 {
301
302 if (!Nflag && mknod(name, S_IFWHT, 0) < 0) {
303 warn("cannot create whiteout %s", name);
304 return (FAIL);
305 }
306 Vprintf(stdout, "Create whiteout %s\n", name);
307 return (GOOD);
308 }
309
310 /*
311 * Delete a whiteout.
312 */
313 void
314 delwhiteout(struct entry *ep)
315 {
316 char *name;
317
318 if (ep->e_type != LEAF)
319 badentry(ep, "delwhiteout: not a leaf");
320 ep->e_flags |= REMOVED;
321 ep->e_flags &= ~TMPNAME;
322 name = myname(ep);
323 if (!Nflag && undelete(name) < 0) {
324 warn("cannot delete whiteout %s", name);
325 return;
326 }
327 Vprintf(stdout, "Delete whiteout %s\n", name);
328 }
329 #endif
330
331 /*
332 * find lowest number file (above "start") that needs to be extracted
333 */
334 dump_ino_t
335 lowerbnd(dump_ino_t start)
336 {
337 struct entry *ep;
338
339 for ( ; start < maxino; start++) {
340 ep = lookupino(start);
341 if (ep == NULL || ep->e_type == NODE)
342 continue;
343 if (ep->e_flags & (NEW|EXTRACT))
344 return (start);
345 }
346 return (start);
347 }
348
349 /*
350 * find highest number file (below "start") that needs to be extracted
351 */
352 dump_ino_t
353 upperbnd(dump_ino_t start)
354 {
355 struct entry *ep;
356
357 for ( ; start > ROOTINO; start--) {
358 ep = lookupino(start);
359 if (ep == NULL || ep->e_type == NODE)
360 continue;
361 if (ep->e_flags & (NEW|EXTRACT))
362 return (start);
363 }
364 return (start);
365 }
366
367 /*
368 * report on a badly formed entry
369 */
370 void
371 badentry(struct entry *ep, const char *msg)
372 {
373
374 fprintf(stderr, "bad entry: %s\n", msg);
375 fprintf(stderr, "name: %s\n", myname(ep));
376 fprintf(stderr, "parent name %s\n", myname(ep->e_parent));
377 if (ep->e_sibling != NULL)
378 fprintf(stderr, "sibling name: %s\n", myname(ep->e_sibling));
379 if (ep->e_entries != NULL) {
380 int i;
381 for (i = 0; i < DIRHASH_SIZE; i++) {
382 if (ep->e_entries[i] != NULL) {
383 fprintf(stderr, "next entry name: %s\n", myname(ep->e_entries[0]));
384 break;
385 }
386 }
387 }
388 if (ep->e_links != NULL)
389 fprintf(stderr, "next link name: %s\n", myname(ep->e_links));
390 if (ep->e_next != NULL)
391 fprintf(stderr,
392 "next hashchain name: %s\n", myname(ep->e_next));
393 fprintf(stderr, "entry type: %s\n",
394 ep->e_type == NODE ? "NODE" : "LEAF");
395 fprintf(stderr, "inode number: %lu\n", (unsigned long)ep->e_ino);
396 panic("flags: %s\n", flagvalues(ep));
397 }
398
399 /*
400 * Construct a string indicating the active flag bits of an entry.
401 */
402 char *
403 flagvalues(struct entry *ep)
404 {
405 static char flagbuf[BUFSIZ];
406
407 (void) strcpy(flagbuf, "|NIL");
408 flagbuf[0] = '\0';
409 if (ep->e_flags & REMOVED)
410 (void) strcat(flagbuf, "|REMOVED");
411 if (ep->e_flags & TMPNAME)
412 (void) strcat(flagbuf, "|TMPNAME");
413 if (ep->e_flags & EXTRACT)
414 (void) strcat(flagbuf, "|EXTRACT");
415 if (ep->e_flags & NEW)
416 (void) strcat(flagbuf, "|NEW");
417 if (ep->e_flags & KEEP)
418 (void) strcat(flagbuf, "|KEEP");
419 if (ep->e_flags & EXISTED)
420 (void) strcat(flagbuf, "|EXISTED");
421 return (&flagbuf[1]);
422 }
423
424 /*
425 * Check to see if a name is on a dump tape.
426 */
427 dump_ino_t
428 dirlookup(const char *name)
429 {
430 struct direct *dp;
431 dump_ino_t ino;
432
433 ino = ((dp = pathsearch(name)) == NULL) ? 0 : dp->d_ino;
434
435 if (ino == 0 || TSTINO(ino, dumpmap) == 0)
436 fprintf(stderr, "%s is not on the tape\n", name);
437 return (ino);
438 }
439
440 /*
441 * Elicit a reply.
442 */
443 int
444 reply(const char *question)
445 {
446 char c;
447
448 do {
449 fprintf(stderr, "%s? [yn] ", question);
450 (void) fflush(stderr);
451 c = getc(terminal);
452 while (c != '\n' && getc(terminal) != '\n')
453 if (feof(terminal))
454 return (FAIL);
455 } while (c != 'y' && c != 'n');
456 if (c == 'y')
457 return (GOOD);
458 return (FAIL);
459 }
460
461 /*
462 * handle unexpected inconsistencies
463 */
464 #ifdef __STDC__
465 #include <stdarg.h>
466 #else
467 #include <varargs.h>
468 #endif
469
470 void
471 #ifdef __STDC__
472 panic(const char *fmt, ...)
473 #else
474 panic(fmt, va_alist)
475 char *fmt;
476 va_dcl
477 #endif
478 {
479 va_list ap;
480 #ifdef __STDC__
481 va_start(ap, fmt);
482 #else
483 va_start(ap);
484 #endif
485
486 vfprintf(stderr, fmt, ap);
487 if (yflag)
488 return;
489 if (reply("abort") == GOOD) {
490 if (reply("dump core") == GOOD)
491 abort();
492 exit(1);
493 }
494 }
495
496 void resizemaps(dump_ino_t oldmax, dump_ino_t newmax)
497 {
498 char *map;
499
500 if (usedinomap) {
501 map = calloc((unsigned)1, (unsigned)howmany(newmax, NBBY));
502 if (map == NULL)
503 errx(1, "no memory for active inode map");
504 memcpy(map, usedinomap, howmany(oldmax, NBBY));
505 free(usedinomap);
506 usedinomap = map;
507 }
508 if (dumpmap) {
509 map = calloc((unsigned)1, (unsigned)howmany(newmax, NBBY));
510 if (map == NULL)
511 errx(1, "no memory for file dump list");
512 memcpy(map, dumpmap, howmany(oldmax, NBBY));
513 free(dumpmap);
514 dumpmap = map;
515 }
516 }
517
518 void
519 GetPathFile(char *source, char *path, char *fname)
520 {
521 char *p, *s;
522
523 *path = 0;
524 *fname = 0;
525 p = s = source;
526 while (*s) {
527 if (*s == '/') {
528 p = s + 1;
529 }
530 s++;
531 }
532 if (p == source) {
533 *path = 0;
534 } else {
535 strncpy(path, source, p - source);
536 path[p - source] = 0;
537 }
538 strcpy(fname, p);
539 }
540
541 #ifdef USE_QFA
542 /*
543 * search for ino in QFA file
544 *
545 * if exactmatch:
546 * if ino found return tape number and tape position
547 * if ino not found return tnum=0 and tpos=0
548 *
549 * if not exactmatch:
550 * if ino found return tape number and tape position
551 * if ino not found return tape number and tape position of last smaller ino
552 * if no smaller inode found return tnum=0 and tpos=0
553 */
554 int
555 Inode2Tapepos(dump_ino_t ino, long *tnum, long long *tpos, int exactmatch)
556 {
557 char *p, *pp;
558 char numbuff[32];
559 unsigned long tmpino;
560 long tmptnum;
561 long long tmptpos;
562
563 *tpos = 0;
564 *tnum = 0;
565 if (fseek(gTapeposfp, gSeekstart, SEEK_SET) == -1)
566 return errno;
567 while (1) {
568 gSeekstart = ftell(gTapeposfp); /* remember for later use */
569 if (fgets(gTps, sizeof(gTps), gTapeposfp) == NULL) {
570 return 0;
571 }
572 gTps[strlen(gTps) - 1] = 0; /* delete end of line */
573 p = gTps;
574 bzero(numbuff, sizeof(numbuff));
575 pp = numbuff;
576 /* read inode */
577 while ((*p != 0) && (*p != '\t'))
578 *pp++ = *p++;
579 tmpino = atol(numbuff);
580 if (*p == 0)
581 return 1; /* may NOT happen */
582 p++;
583 bzero(numbuff, sizeof(numbuff));
584 pp = numbuff;
585 /* read tapenum */
586 while ((*p != 0) && (*p != '\t'))
587 *pp++ = *p++;
588 if (*p == 0)
589 return 1; /* may NOT happen */
590 tmptnum = atol(numbuff);
591 p++;
592 bzero(numbuff, sizeof(numbuff));
593 pp = numbuff;
594 /* read tapepos */
595 while ((*p != 0) && (*p != '\t'))
596 *pp++ = *p++;
597 tmptpos = atoll(numbuff);
598
599 if (exactmatch) {
600 if (tmpino == ino) {
601 *tnum = tmptnum;
602 *tpos = tmptpos;
603 return 0;
604 }
605 } else {
606 if (tmpino > ino) {
607 return 0;
608 } else {
609 *tnum = tmptnum;
610 *tpos = tmptpos;
611 }
612 }
613 }
614 return 0;
615 }
616
617 #ifdef sunos
618 int
619 GetSCSIIDFromPath(char *devPath, long *id)
620 {
621 int len;
622 char fbuff[2048];
623 char path[2048];
624 char fname[2048];
625 char *fpn = fname;
626 char idstr[32];
627 char *ip = idstr;
628
629 bzero(fbuff, sizeof(fbuff));
630 if ((len = readlink(devPath, fbuff, 2048)) == -1) {
631 return errno;
632 }
633 fbuff[len] = 0;
634 GetPathFile(fbuff, path, fname);
635 (void)memset(idstr, 0, sizeof(idstr));
636 while (*fpn && (*fpn != ',')) {
637 if (*fpn <= '9' && *fpn >= '0') {
638 *ip = *fpn;
639 ip++;
640 }
641 fpn++;
642 }
643 if (*idstr) {
644 *id = atol(idstr);
645 } else {
646 *id = -1;
647 }
648 return 0;
649 }
650 #endif
651 #endif /* USE_QFA */
652
653 #ifdef DUMP_MACOSX
654 int
655 CreateAppleDoubleFileRes(char *oFile, FndrFileInfo *finderinfo, mode_t mode, int flags,
656 struct timeval *timep, u_int32_t uid, u_int32_t gid)
657 {
658 int err = 0;
659 int fdout;
660 char *p;
661 char *pp;
662 ASDHeaderPtr hp;
663 ASDEntryPtr ep;
664 long thesize;
665 long n;
666
667
668 n = 1; /* number of entries in double file ._ only finderinfo */
669 /*
670 no data fork
671 n++;
672 currently no resource fork
673 n++;
674 */
675
676 thesize = sizeof(ASDHeader) + (n * sizeof(ASDEntry)) + INFOLEN;
677 if ((pp = p = (char *)malloc(thesize)) == NULL) {
678 err = errno;
679 return err;
680 }
681
682 hp = (ASDHeaderPtr)p;
683 p += sizeof(ASDHeader);
684 ep = (ASDEntryPtr)p;
685 p += sizeof(ASDEntry) * n;
686
687 hp->magic = ADOUBLE_MAGIC;
688 hp->version = ASD_VERSION2;
689
690 bzero(&hp->filler, sizeof(hp->filler));
691 hp->entries = (short)n;
692
693 ep->entryID = EntryFinderInfo;
694 ep->offset = p - pp - CORRECT;
695 ep->len = INFOLEN; /* sizeof(MacFInfo) + sizeof(FXInfo); */
696 bzero(p, ep->len);
697 bcopy(finderinfo, p, sizeof(FndrFileInfo));
698 p += ep->len;
699 ep++;
700
701 if ((fdout = open(oFile, O_WRONLY | O_CREAT | O_TRUNC, 0666)) < 0) {
702 err = errno;
703 free(pp);
704 return err;
705 }
706
707 /* write the ASDHeader */
708 if (write(fdout, pp, sizeof(ASDHeader) - CORRECT) == -1) {
709 err = errno;
710 close(fdout);
711 free(pp);
712 unlink(oFile);
713 return err;
714 }
715 /* write the ASDEntries */
716 if (write(fdout, pp + sizeof(ASDHeader), thesize - sizeof(ASDHeader)) == -1) {
717 err = errno;
718 close(fdout);
719 free(pp);
720 unlink(oFile);
721 return err;
722 }
723
724 (void)fchown(fdout, uid, gid);
725 (void)fchmod(fdout, mode);
726 close(fdout);
727 (void)fsetflags(oFile, flags);
728 utimes(oFile, timep);
729 free(pp);
730 return err;
731 }
732 #endif /* DUMP_MACOSX */