]>
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-2000
6 * Stelian Pop <pop@cybercable.fr> - Alcôve <www.alcove.fr>, 2000
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
43 static const char rcsid
[] =
44 "$Id: symtab.c,v 1.10 2000/11/10 14:42:25 stelian Exp $";
48 * These routines maintain the symbol table which tracks the state
49 * of the file system being restored. They provide lookup by either
50 * name or inode number. They also provide for creation, deletion,
51 * and renaming of entries. Because of the dynamic nature of pathnames,
52 * names should not be saved, but always constructed just before they
53 * are needed, by calling "myname".
56 #include <sys/param.h>
61 #include <linux/ext2_fs.h>
62 #include <bsdcompat.h>
64 #include <ufs/ufs/dinode.h>
65 #endif /* __linux__ */
68 #include <compaterr.h>
76 #include <ext2fs/ext2fs.h>
83 * The following variables define the inode symbol table.
84 * The primary hash table is dynamically allocated based on
85 * the number of inodes in the file system (maxino), scaled by
86 * HASHFACTOR. The variable "entry" points to the hash table;
87 * the variable "entrytblsize" indicates its size (in entries).
90 static struct entry
**entry
;
91 static long entrytblsize
;
93 static void addino
__P((ino_t
, struct entry
*));
94 static struct entry
*lookupparent
__P((char *));
95 static void removeentry
__P((struct entry
*));
98 * Look up an entry by inode number
101 lookupino(ino_t inum
)
103 register struct entry
*ep
;
105 if (inum
< WINO
|| inum
>= maxino
)
107 for (ep
= entry
[inum
% entrytblsize
]; ep
!= NULL
; ep
= ep
->e_next
)
108 if (ep
->e_ino
== inum
)
114 * Add an entry into the entry table
117 addino(ino_t inum
, struct entry
*np
)
121 if (inum
< WINO
|| inum
>= maxino
)
122 panic("addino: out of range %d\n", inum
);
123 epp
= &entry
[inum
% entrytblsize
];
128 for (np
= np
->e_next
; np
!= NULL
; np
= np
->e_next
)
129 if (np
->e_ino
== inum
)
130 badentry(np
, "duplicate inum");
134 * Delete an entry from the entry table
137 deleteino(ino_t inum
)
139 register struct entry
*next
;
142 if (inum
< WINO
|| inum
>= maxino
)
143 panic("deleteino: out of range %d\n", inum
);
144 prev
= &entry
[inum
% entrytblsize
];
145 for (next
= *prev
; next
!= NULL
; next
= next
->e_next
) {
146 if (next
->e_ino
== inum
) {
148 *prev
= next
->e_next
;
151 prev
= &next
->e_next
;
153 panic("deleteino: %d not found\n", inum
);
157 * Look up an entry by name
160 lookupname(char *name
)
162 register struct entry
*ep
;
163 register char *np
, *cp
;
164 char buf
[MAXPATHLEN
];
167 for (ep
= lookupino(ROOTINO
); ep
!= NULL
; ep
= ep
->e_entries
) {
168 for (np
= buf
; *cp
!= '/' && *cp
!= '\0' &&
169 np
< &buf
[sizeof(buf
)]; )
171 if (np
== &buf
[sizeof(buf
)])
174 for ( ; ep
!= NULL
; ep
= ep
->e_sibling
)
175 if (strcmp(ep
->e_name
, buf
) == 0)
186 * Look up the parent of a pathname
188 static struct entry
*
189 lookupparent(char *name
)
194 tailindex
= strrchr(name
, '/');
195 if (tailindex
== NULL
)
198 ep
= lookupname(name
);
202 if (ep
->e_type
!= NODE
)
203 panic("%s is not a directory\n", name
);
208 * Determine the current pathname of a node or leaf
211 myname(struct entry
*ep
)
214 static char namebuf
[MAXPATHLEN
];
216 for (cp
= &namebuf
[MAXPATHLEN
- 2]; cp
> &namebuf
[ep
->e_namlen
]; ) {
218 memmove(cp
, ep
->e_name
, (size_t)ep
->e_namlen
);
219 if (ep
== lookupino(ROOTINO
))
224 panic("%s: pathname too long\n", cp
);
229 * Unused symbol table entries are linked together on a free list
230 * headed by the following pointer.
232 static struct entry
*freelist
= NULL
;
235 * add an entry to the symbol table
238 addentry(char *name
, ino_t inum
, int type
)
240 register struct entry
*np
, *ep
;
242 if (freelist
!= NULL
) {
244 freelist
= np
->e_next
;
245 memset(np
, 0, sizeof(struct entry
));
247 np
= (struct entry
*)calloc(1, sizeof(struct entry
));
249 errx(1, "no memory to extend symbol table");
251 np
->e_type
= type
& ~LINK
;
252 ep
= lookupparent(name
);
254 if (inum
!= ROOTINO
|| lookupino(ROOTINO
) != NULL
)
255 panic("bad name to addentry %s\n", name
);
256 np
->e_name
= savename(name
);
257 np
->e_namlen
= strlen(name
);
262 np
->e_name
= savename(strrchr(name
, '/') + 1);
263 np
->e_namlen
= strlen(np
->e_name
);
265 np
->e_sibling
= ep
->e_entries
;
268 ep
= lookupino(inum
);
270 panic("link to non-existent name\n");
272 np
->e_links
= ep
->e_links
;
274 } else if (inum
!= 0) {
275 if (lookupino(inum
) != NULL
)
276 panic("duplicate entry\n");
283 * delete an entry from the symbol table
286 freeentry(struct entry
*ep
)
288 register struct entry
*np
;
291 if (ep
->e_flags
!= REMOVED
)
292 badentry(ep
, "not marked REMOVED");
293 if (ep
->e_type
== NODE
) {
294 if (ep
->e_links
!= NULL
)
295 badentry(ep
, "freeing referenced directory");
296 if (ep
->e_entries
!= NULL
)
297 badentry(ep
, "freeing non-empty directory");
299 if (ep
->e_ino
!= 0) {
300 np
= lookupino(ep
->e_ino
);
302 badentry(ep
, "lookupino failed");
306 if (ep
->e_links
!= NULL
)
307 addino(inum
, ep
->e_links
);
309 for (; np
!= NULL
; np
= np
->e_links
) {
310 if (np
->e_links
== ep
) {
311 np
->e_links
= ep
->e_links
;
316 badentry(ep
, "link not found");
320 freename(ep
->e_name
);
321 ep
->e_next
= freelist
;
326 * Relocate an entry in the tree structure
329 moveentry(struct entry
*ep
, char *newname
)
334 np
= lookupparent(newname
);
336 badentry(ep
, "cannot move ROOT");
337 if (np
!= ep
->e_parent
) {
340 ep
->e_sibling
= np
->e_entries
;
343 cp
= strrchr(newname
, '/') + 1;
344 freename(ep
->e_name
);
345 ep
->e_name
= savename(cp
);
346 ep
->e_namlen
= strlen(cp
);
347 if (strcmp(gentempname(ep
), ep
->e_name
) == 0)
348 ep
->e_flags
|= TMPNAME
;
350 ep
->e_flags
&= ~TMPNAME
;
354 * Remove an entry in the tree structure
357 removeentry(struct entry
*ep
)
359 register struct entry
*np
;
362 if (np
->e_entries
== ep
) {
363 np
->e_entries
= ep
->e_sibling
;
365 for (np
= np
->e_entries
; np
!= NULL
; np
= np
->e_sibling
) {
366 if (np
->e_sibling
== ep
) {
367 np
->e_sibling
= ep
->e_sibling
;
372 badentry(ep
, "cannot find entry in parent list");
377 * Table of unused string entries, sorted by length.
379 * Entries are allocated in STRTBLINCR sized pieces so that names
380 * of similar lengths can use the same entry. The value of STRTBLINCR
381 * is chosen so that every entry has at least enough space to hold
382 * a "struct strtbl" header. Thus every entry can be linked onto an
383 * appropriate free list.
385 * NB. The macro "allocsize" below assumes that "struct strhdr"
386 * has a size that is a power of two.
392 #define STRTBLINCR (sizeof(struct strhdr))
393 #define allocsize(size) (((size) + 1 + STRTBLINCR - 1) & ~(STRTBLINCR - 1))
395 static struct strhdr strtblhdr
[allocsize(MAXNAMLEN
) / STRTBLINCR
];
398 * Allocate space for a name. It first looks to see if it already
399 * has an appropriate sized entry, and if not allocates a new one.
411 np
= strtblhdr
[len
/ STRTBLINCR
].next
;
413 strtblhdr
[len
/ STRTBLINCR
].next
= np
->next
;
416 cp
= malloc((unsigned)allocsize(len
));
418 errx(1, "no space for string table");
420 (void) strcpy(cp
, name
);
425 * Free space for a name. The resulting entry is linked onto the
426 * appropriate free list.
431 struct strhdr
*tp
, *np
;
433 tp
= &strtblhdr
[strlen(name
) / STRTBLINCR
];
434 np
= (struct strhdr
*)name
;
440 * Useful quantities placed at the end of a dumped symbol table.
442 struct symtableheader
{
445 int32_t entrytblsize
;
453 * dump a snapshot of the symbol table
456 dumpsymtable(char *filename
, long checkpt
)
458 register struct entry
*ep
, *tep
;
460 struct entry temp
, *tentry
;
461 long mynum
= 1, stroff
= 0;
463 struct symtableheader hdr
;
465 Vprintf(stdout
, "Check pointing the restore\n");
468 if ((fd
= fopen(filename
, "w")) == NULL
) {
470 panic("cannot create save file %s for symbol table\n",
475 * Assign indices to each entry
476 * Write out the string entries
478 for (i
= WINO
; i
<= maxino
; i
++) {
479 for (ep
= lookupino(i
); ep
!= NULL
; ep
= ep
->e_links
) {
480 ep
->e_index
= mynum
++;
481 (void) fwrite(ep
->e_name
, sizeof(char),
482 (int)allocsize(ep
->e_namlen
), fd
);
486 * Convert pointers to indexes, and output
490 for (i
= WINO
; i
<= maxino
; i
++) {
491 for (ep
= lookupino(i
); ep
!= NULL
; ep
= ep
->e_links
) {
492 memmove(tep
, ep
, sizeof(struct entry
));
493 tep
->e_name
= (char *)stroff
;
494 stroff
+= allocsize(ep
->e_namlen
);
495 tep
->e_parent
= (struct entry
*)ep
->e_parent
->e_index
;
496 if (ep
->e_links
!= NULL
)
498 (struct entry
*)ep
->e_links
->e_index
;
499 if (ep
->e_sibling
!= NULL
)
501 (struct entry
*)ep
->e_sibling
->e_index
;
502 if (ep
->e_entries
!= NULL
)
504 (struct entry
*)ep
->e_entries
->e_index
;
505 if (ep
->e_next
!= NULL
)
507 (struct entry
*)ep
->e_next
->e_index
;
508 (void) fwrite((char *)tep
, sizeof(struct entry
), 1, fd
);
512 * Convert entry pointers to indexes, and output
514 for (i
= 0; i
< entrytblsize
; i
++) {
515 if (entry
[i
] == NULL
)
518 tentry
= (struct entry
*)entry
[i
]->e_index
;
519 (void) fwrite((char *)&tentry
, sizeof(struct entry
*), 1, fd
);
523 hdr
.entrytblsize
= entrytblsize
;
524 hdr
.stringsize
= stroff
;
525 hdr
.dumptime
= dumptime
;
526 hdr
.dumpdate
= dumpdate
;
528 (void) fwrite((char *)&hdr
, sizeof(struct symtableheader
), 1, fd
);
531 panic("output error to file %s writing symbol table\n",
538 * Initialize a symbol table from a file
541 initsymtable(char *filename
)
545 register struct entry
*ep
;
546 struct entry
*baseep
, *lep
;
547 struct symtableheader hdr
;
552 Vprintf(stdout
, "Initialize symbol table.\n");
553 if (filename
== NULL
) {
554 entrytblsize
= maxino
/ HASHFACTOR
;
555 entry
= (struct entry
**)
556 calloc((unsigned)entrytblsize
, sizeof(struct entry
*));
557 if (entry
== (struct entry
**)NULL
)
558 errx(1, "no memory for entry table");
559 ep
= addentry(".", ROOTINO
, NODE
);
563 if ((fd
= open(filename
, O_RDONLY
, 0)) < 0) {
565 errx(1, "cannot open symbol table file %s", filename
);
567 if (fstat(fd
, &stbuf
) < 0) {
569 errx(1, "cannot stat symbol table file %s", filename
);
571 tblsize
= stbuf
.st_size
- sizeof(struct symtableheader
);
572 base
= calloc(sizeof(char), (unsigned)tblsize
);
574 errx(1, "cannot allocate space for symbol table");
575 if (read(fd
, base
, (int)tblsize
) < 0 ||
576 read(fd
, (char *)&hdr
, sizeof(struct symtableheader
)) < 0) {
578 errx(1, "cannot read symbol table file %s", filename
);
583 * For normal continuation, insure that we are using
584 * the next incremental tape
586 if (hdr
.dumpdate
!= dumptime
)
587 errx(1, "Incremental tape too %s",
588 (hdr
.dumpdate
< dumptime
) ? "low" : "high");
592 * For restart, insure that we are using the same tape
594 curfile
.action
= SKIP
;
595 dumptime
= hdr
.dumptime
;
596 dumpdate
= hdr
.dumpdate
;
598 newtapebuf(hdr
.ntrec
);
602 panic("initsymtable called from command %c\n", command
);
606 entrytblsize
= hdr
.entrytblsize
;
607 entry
= (struct entry
**)
608 (base
+ tblsize
- (entrytblsize
* sizeof(struct entry
*)));
609 baseep
= (struct entry
*)(base
+ hdr
.stringsize
- sizeof(struct entry
));
610 lep
= (struct entry
*)entry
;
611 for (i
= 0; i
< entrytblsize
; i
++) {
612 if (entry
[i
] == NULL
)
614 entry
[i
] = &baseep
[(long)entry
[i
]];
616 for (ep
= &baseep
[1]; ep
< lep
; ep
++) {
617 ep
->e_name
= base
+ (long)ep
->e_name
;
618 ep
->e_parent
= &baseep
[(long)ep
->e_parent
];
619 if (ep
->e_sibling
!= NULL
)
620 ep
->e_sibling
= &baseep
[(long)ep
->e_sibling
];
621 if (ep
->e_links
!= NULL
)
622 ep
->e_links
= &baseep
[(long)ep
->e_links
];
623 if (ep
->e_entries
!= NULL
)
624 ep
->e_entries
= &baseep
[(long)ep
->e_entries
];
625 if (ep
->e_next
!= NULL
)
626 ep
->e_next
= &baseep
[(long)ep
->e_next
];