]>
git.wh0rd.org - dump.git/blob - restore/symtab.c
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 <pop@cybercable.fr>, 1999
10 * Copyright (c) 1983, 1993
11 * The Regents of the University of California. All rights reserved.
13 * Redistribution and use in source and binary forms, with or without
14 * modification, are permitted provided that the following conditions
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. All advertising materials mentioning features or use of this software
22 * must display the following acknowledgement:
23 * This product includes software developed by the University of
24 * California, Berkeley and its contributors.
25 * 4. Neither the name of the University nor the names of its contributors
26 * may be used to endorse or promote products derived from this software
27 * without specific prior written permission.
29 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
30 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
31 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
32 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
33 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
34 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
35 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
36 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
37 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
38 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
44 static char sccsid
[] = "@(#)symtab.c 8.3 (Berkeley) 4/28/95";
46 static const char rcsid
[] =
47 "$Id: symtab.c,v 1.2 1999/10/11 12:53:24 stelian Exp $";
51 * These routines maintain the symbol table which tracks the state
52 * of the file system being restored. They provide lookup by either
53 * name or inode number. They also provide for creation, deletion,
54 * and renaming of entries. Because of the dynamic nature of pathnames,
55 * names should not be saved, but always constructed just before they
56 * are needed, by calling "myname".
59 #include <sys/param.h>
64 #include <linux/ext2_fs.h>
65 #include <bsdcompat.h>
67 #include <ufs/ufs/dinode.h>
68 #endif /* __linux__ */
78 #include <ext2fs/ext2fs.h>
85 * The following variables define the inode symbol table.
86 * The primary hash table is dynamically allocated based on
87 * the number of inodes in the file system (maxino), scaled by
88 * HASHFACTOR. The variable "entry" points to the hash table;
89 * the variable "entrytblsize" indicates its size (in entries).
92 static struct entry
**entry
;
93 static long entrytblsize
;
95 static void addino
__P((ino_t
, struct entry
*));
96 static struct entry
*lookupparent
__P((char *));
97 static void removeentry
__P((struct entry
*));
100 * Look up an entry by inode number
106 register struct entry
*ep
;
108 if (inum
< WINO
|| inum
>= maxino
)
110 for (ep
= entry
[inum
% entrytblsize
]; ep
!= NULL
; ep
= ep
->e_next
)
111 if (ep
->e_ino
== inum
)
117 * Add an entry into the entry table
126 if (inum
< WINO
|| inum
>= maxino
)
127 panic("addino: out of range %d\n", inum
);
128 epp
= &entry
[inum
% entrytblsize
];
133 for (np
= np
->e_next
; np
!= NULL
; np
= np
->e_next
)
134 if (np
->e_ino
== inum
)
135 badentry(np
, "duplicate inum");
139 * Delete an entry from the entry table
145 register struct entry
*next
;
148 if (inum
< WINO
|| inum
>= maxino
)
149 panic("deleteino: out of range %d\n", inum
);
150 prev
= &entry
[inum
% entrytblsize
];
151 for (next
= *prev
; next
!= NULL
; next
= next
->e_next
) {
152 if (next
->e_ino
== inum
) {
154 *prev
= next
->e_next
;
157 prev
= &next
->e_next
;
159 panic("deleteino: %d not found\n", inum
);
163 * Look up an entry by name
169 register struct entry
*ep
;
170 register char *np
, *cp
;
171 char buf
[MAXPATHLEN
];
174 for (ep
= lookupino(ROOTINO
); ep
!= NULL
; ep
= ep
->e_entries
) {
175 for (np
= buf
; *cp
!= '/' && *cp
!= '\0' &&
176 np
< &buf
[sizeof(buf
)]; )
178 if (np
== &buf
[sizeof(buf
)])
181 for ( ; ep
!= NULL
; ep
= ep
->e_sibling
)
182 if (strcmp(ep
->e_name
, buf
) == 0)
193 * Look up the parent of a pathname
195 static struct entry
*
202 tailindex
= strrchr(name
, '/');
203 if (tailindex
== NULL
)
206 ep
= lookupname(name
);
210 if (ep
->e_type
!= NODE
)
211 panic("%s is not a directory\n", name
);
216 * Determine the current pathname of a node or leaf
220 register struct entry
*ep
;
223 static char namebuf
[MAXPATHLEN
];
225 for (cp
= &namebuf
[MAXPATHLEN
- 2]; cp
> &namebuf
[ep
->e_namlen
]; ) {
227 memmove(cp
, ep
->e_name
, (long)ep
->e_namlen
);
228 if (ep
== lookupino(ROOTINO
))
233 panic("%s: pathname too long\n", cp
);
238 * Unused symbol table entries are linked together on a free list
239 * headed by the following pointer.
241 static struct entry
*freelist
= NULL
;
244 * add an entry to the symbol table
247 addentry(name
, inum
, type
)
252 register struct entry
*np
, *ep
;
254 if (freelist
!= NULL
) {
256 freelist
= np
->e_next
;
257 memset(np
, 0, (long)sizeof(struct entry
));
259 np
= (struct entry
*)calloc(1, sizeof(struct entry
));
261 panic("no memory to extend symbol table\n");
263 np
->e_type
= type
& ~LINK
;
264 ep
= lookupparent(name
);
266 if (inum
!= ROOTINO
|| lookupino(ROOTINO
) != NULL
)
267 panic("bad name to addentry %s\n", name
);
268 np
->e_name
= savename(name
);
269 np
->e_namlen
= strlen(name
);
274 np
->e_name
= savename(strrchr(name
, '/') + 1);
275 np
->e_namlen
= strlen(np
->e_name
);
277 np
->e_sibling
= ep
->e_entries
;
280 ep
= lookupino(inum
);
282 panic("link to non-existent name\n");
284 np
->e_links
= ep
->e_links
;
286 } else if (inum
!= 0) {
287 if (lookupino(inum
) != NULL
)
288 panic("duplicate entry\n");
295 * delete an entry from the symbol table
299 register struct entry
*ep
;
301 register struct entry
*np
;
304 if (ep
->e_flags
!= REMOVED
)
305 badentry(ep
, "not marked REMOVED");
306 if (ep
->e_type
== NODE
) {
307 if (ep
->e_links
!= NULL
)
308 badentry(ep
, "freeing referenced directory");
309 if (ep
->e_entries
!= NULL
)
310 badentry(ep
, "freeing non-empty directory");
312 if (ep
->e_ino
!= 0) {
313 np
= lookupino(ep
->e_ino
);
315 badentry(ep
, "lookupino failed");
319 if (ep
->e_links
!= NULL
)
320 addino(inum
, ep
->e_links
);
322 for (; np
!= NULL
; np
= np
->e_links
) {
323 if (np
->e_links
== ep
) {
324 np
->e_links
= ep
->e_links
;
329 badentry(ep
, "link not found");
333 freename(ep
->e_name
);
334 ep
->e_next
= freelist
;
339 * Relocate an entry in the tree structure
342 moveentry(ep
, newname
)
343 register struct entry
*ep
;
349 np
= lookupparent(newname
);
351 badentry(ep
, "cannot move ROOT");
352 if (np
!= ep
->e_parent
) {
355 ep
->e_sibling
= np
->e_entries
;
358 cp
= strrchr(newname
, '/') + 1;
359 freename(ep
->e_name
);
360 ep
->e_name
= savename(cp
);
361 ep
->e_namlen
= strlen(cp
);
362 if (strcmp(gentempname(ep
), ep
->e_name
) == 0)
363 ep
->e_flags
|= TMPNAME
;
365 ep
->e_flags
&= ~TMPNAME
;
369 * Remove an entry in the tree structure
373 register struct entry
*ep
;
375 register struct entry
*np
;
378 if (np
->e_entries
== ep
) {
379 np
->e_entries
= ep
->e_sibling
;
381 for (np
= np
->e_entries
; np
!= NULL
; np
= np
->e_sibling
) {
382 if (np
->e_sibling
== ep
) {
383 np
->e_sibling
= ep
->e_sibling
;
388 badentry(ep
, "cannot find entry in parent list");
393 * Table of unused string entries, sorted by length.
395 * Entries are allocated in STRTBLINCR sized pieces so that names
396 * of similar lengths can use the same entry. The value of STRTBLINCR
397 * is chosen so that every entry has at least enough space to hold
398 * a "struct strtbl" header. Thus every entry can be linked onto an
399 * appropriate free list.
401 * NB. The macro "allocsize" below assumes that "struct strhdr"
402 * has a size that is a power of two.
408 #define STRTBLINCR (sizeof(struct strhdr))
409 #define allocsize(size) (((size) + 1 + STRTBLINCR - 1) & ~(STRTBLINCR - 1))
411 static struct strhdr strtblhdr
[allocsize(NAME_MAX
) / STRTBLINCR
];
414 * Allocate space for a name. It first looks to see if it already
415 * has an appropriate sized entry, and if not allocates a new one.
428 np
= strtblhdr
[len
/ STRTBLINCR
].next
;
430 strtblhdr
[len
/ STRTBLINCR
].next
= np
->next
;
433 cp
= malloc((unsigned)allocsize(len
));
435 panic("no space for string table\n");
437 (void) strcpy(cp
, name
);
442 * Free space for a name. The resulting entry is linked onto the
443 * appropriate free list.
449 struct strhdr
*tp
, *np
;
451 tp
= &strtblhdr
[strlen(name
) / STRTBLINCR
];
452 np
= (struct strhdr
*)name
;
458 * Useful quantities placed at the end of a dumped symbol table.
460 struct symtableheader
{
463 int32_t entrytblsize
;
471 * dump a snapshot of the symbol table
474 dumpsymtable(filename
, checkpt
)
478 register struct entry
*ep
, *tep
;
480 struct entry temp
, *tentry
;
481 long mynum
= 1, stroff
= 0;
483 struct symtableheader hdr
;
485 vprintf(stdout
, "Check pointing the restore\n");
488 if ((fd
= fopen(filename
, "w")) == NULL
) {
489 fprintf(stderr
, "fopen: %s\n", strerror(errno
));
490 panic("cannot create save file %s for symbol table\n",
495 * Assign indices to each entry
496 * Write out the string entries
498 for (i
= WINO
; i
<= maxino
; i
++) {
499 for (ep
= lookupino(i
); ep
!= NULL
; ep
= ep
->e_links
) {
500 ep
->e_index
= mynum
++;
501 (void) fwrite(ep
->e_name
, sizeof(char),
502 (int)allocsize(ep
->e_namlen
), fd
);
506 * Convert pointers to indexes, and output
510 for (i
= WINO
; i
<= maxino
; i
++) {
511 for (ep
= lookupino(i
); ep
!= NULL
; ep
= ep
->e_links
) {
512 memmove(tep
, ep
, (long)sizeof(struct entry
));
513 tep
->e_name
= (char *)stroff
;
514 stroff
+= allocsize(ep
->e_namlen
);
515 tep
->e_parent
= (struct entry
*)ep
->e_parent
->e_index
;
516 if (ep
->e_links
!= NULL
)
518 (struct entry
*)ep
->e_links
->e_index
;
519 if (ep
->e_sibling
!= NULL
)
521 (struct entry
*)ep
->e_sibling
->e_index
;
522 if (ep
->e_entries
!= NULL
)
524 (struct entry
*)ep
->e_entries
->e_index
;
525 if (ep
->e_next
!= NULL
)
527 (struct entry
*)ep
->e_next
->e_index
;
528 (void) fwrite((char *)tep
, sizeof(struct entry
), 1, fd
);
532 * Convert entry pointers to indexes, and output
534 for (i
= 0; i
< entrytblsize
; i
++) {
535 if (entry
[i
] == NULL
)
538 tentry
= (struct entry
*)entry
[i
]->e_index
;
539 (void) fwrite((char *)&tentry
, sizeof(struct entry
*), 1, fd
);
543 hdr
.entrytblsize
= entrytblsize
;
544 hdr
.stringsize
= stroff
;
545 hdr
.dumptime
= dumptime
;
546 hdr
.dumpdate
= dumpdate
;
548 (void) fwrite((char *)&hdr
, sizeof(struct symtableheader
), 1, fd
);
550 fprintf(stderr
, "fwrite: %s\n", strerror(errno
));
551 panic("output error to file %s writing symbol table\n",
558 * Initialize a symbol table from a file
561 initsymtable(filename
)
566 register struct entry
*ep
;
567 struct entry
*baseep
, *lep
;
568 struct symtableheader hdr
;
573 vprintf(stdout
, "Initialize symbol table.\n");
574 if (filename
== NULL
) {
575 entrytblsize
= maxino
/ HASHFACTOR
;
576 entry
= (struct entry
**)
577 calloc((unsigned)entrytblsize
, sizeof(struct entry
*));
578 if (entry
== (struct entry
**)NULL
)
579 panic("no memory for entry table\n");
580 ep
= addentry(".", ROOTINO
, NODE
);
584 if ((fd
= open(filename
, O_RDONLY
, 0)) < 0) {
585 fprintf(stderr
, "open: %s\n", strerror(errno
));
586 panic("cannot open symbol table file %s\n", filename
);
588 if (fstat(fd
, &stbuf
) < 0) {
589 fprintf(stderr
, "stat: %s\n", strerror(errno
));
590 panic("cannot stat symbol table file %s\n", filename
);
592 tblsize
= stbuf
.st_size
- sizeof(struct symtableheader
);
593 base
= calloc(sizeof(char), (unsigned)tblsize
);
595 panic("cannot allocate space for symbol table\n");
596 if (read(fd
, base
, (int)tblsize
) < 0 ||
597 read(fd
, (char *)&hdr
, sizeof(struct symtableheader
)) < 0) {
598 fprintf(stderr
, "read: %s\n", strerror(errno
));
599 panic("cannot read symbol table file %s\n", filename
);
604 * For normal continuation, insure that we are using
605 * the next incremental tape
607 if (hdr
.dumpdate
!= dumptime
) {
608 if (hdr
.dumpdate
< dumptime
)
609 fprintf(stderr
, "Incremental tape too low\n");
611 fprintf(stderr
, "Incremental tape too high\n");
617 * For restart, insure that we are using the same tape
619 curfile
.action
= SKIP
;
620 dumptime
= hdr
.dumptime
;
621 dumpdate
= hdr
.dumpdate
;
623 newtapebuf(hdr
.ntrec
);
627 panic("initsymtable called from command %c\n", command
);
631 entrytblsize
= hdr
.entrytblsize
;
632 entry
= (struct entry
**)
633 (base
+ tblsize
- (entrytblsize
* sizeof(struct entry
*)));
634 baseep
= (struct entry
*)(base
+ hdr
.stringsize
- sizeof(struct entry
));
635 lep
= (struct entry
*)entry
;
636 for (i
= 0; i
< entrytblsize
; i
++) {
637 if (entry
[i
] == NULL
)
639 entry
[i
] = &baseep
[(long)entry
[i
]];
641 for (ep
= &baseep
[1]; ep
< lep
; ep
++) {
642 ep
->e_name
= base
+ (long)ep
->e_name
;
643 ep
->e_parent
= &baseep
[(long)ep
->e_parent
];
644 if (ep
->e_sibling
!= NULL
)
645 ep
->e_sibling
= &baseep
[(long)ep
->e_sibling
];
646 if (ep
->e_links
!= NULL
)
647 ep
->e_links
= &baseep
[(long)ep
->e_links
];
648 if (ep
->e_entries
!= NULL
)
649 ep
->e_entries
= &baseep
[(long)ep
->e_entries
];
650 if (ep
->e_next
!= NULL
)
651 ep
->e_next
= &baseep
[(long)ep
->e_next
];