diff options
Diffstat (limited to 'bin/pax/tables.c')
| -rw-r--r-- | bin/pax/tables.c | 24 |
1 files changed, 12 insertions, 12 deletions
diff --git a/bin/pax/tables.c b/bin/pax/tables.c index f6ff451b04e..6e6b02c3951 100644 --- a/bin/pax/tables.c +++ b/bin/pax/tables.c @@ -1,4 +1,4 @@ -/* $OpenBSD: tables.c,v 1.18 2002/10/16 19:20:02 millert Exp $ */ +/* $OpenBSD: tables.c,v 1.19 2003/02/03 09:06:43 jmc Exp $ */ /* $NetBSD: tables.c,v 1.4 1995/03/21 09:07:45 cgd Exp $ */ /*- @@ -42,7 +42,7 @@ #if 0 static const char sccsid[] = "@(#)tables.c 8.1 (Berkeley) 5/31/93"; #else -static const char rcsid[] = "$OpenBSD: tables.c,v 1.18 2002/10/16 19:20:02 millert Exp $"; +static const char rcsid[] = "$OpenBSD: tables.c,v 1.19 2003/02/03 09:06:43 jmc Exp $"; #endif #endif /* not lint */ @@ -71,7 +71,7 @@ static const char rcsid[] = "$OpenBSD: tables.c,v 1.18 2002/10/16 19:20:02 mille * large archives. These database routines carefully combine memory usage and * temporary file storage in ways which will not significantly impact runtime * performance while allowing the largest possible archives to be handled. - * Trying to force the fit to the posix databases routines was not considered + * Trying to force the fit to the posix database routines was not considered * time well spent. */ @@ -313,14 +313,14 @@ lnk_end(void) * An append with an -u must read the archive and store the modification time * for every file on that archive before starting the write phase. It is clear * that this is one HUGE database. To save memory space, the actual file names - * are stored in a scatch file and indexed by an in memory hash table. The + * are stored in a scratch file and indexed by an in-memory hash table. The * hash table is indexed by hashing the file path. The nodes in the table store * the length of the filename and the lseek offset within the scratch file - * where the actual name is stored. Since there are never any deletions to this - * table, fragmentation of the scratch file is never a issue. Lookups seem to - * not exhibit any locality at all (files in the database are rarely - * looked up more than once...). So caching is just a waste of memory. The - * only limitation is the amount of scatch file space available to store the + * where the actual name is stored. Since there are never any deletions from + * this table, fragmentation of the scratch file is never a issue. Lookups + * seem to not exhibit any locality at all (files in the database are rarely + * looked up more than once...), so caching is just a waste of memory. The + * only limitation is the amount of scratch file space available to store the * path names. */ @@ -884,14 +884,14 @@ map_dev(ARCHD *arcn, u_long dev_mask, u_long ino_mask) /* * directory access/mod time reset table routines (for directories READ by pax) * - * The pax -t flag requires that access times of archive files to be the same + * The pax -t flag requires that access times of archive files be the same * before being read by pax. For regular files, access time is restored after * the file has been copied. This database provides the same functionality for * directories read during file tree traversal. Restoring directory access time * is more complex than files since directories may be read several times until * all the descendants in their subtree are visited by fts. Directory access * and modification times are stored during the fts pre-order visit (done - * before any descendants in the subtree is visited) and restored after the + * before any descendants in the subtree are visited) and restored after the * fts post-order visit (after all the descendants have been visited). In the * case of premature exit from a subtree (like from the effects of -n), any * directory entries left in this database are reset during final cleanup @@ -970,7 +970,7 @@ add_atdir(char *fname, dev_t dev, ino_t ino, time_t mtime, time_t atime) * return (the older entry always has the correct time). The only * way this will happen is when the same subtree can be traversed by * different args to pax and the -n option is aborting fts out of a - * subtree before all the post-order visits have been made). + * subtree before all the post-order visits have been made. */ indx = ((unsigned)ino) % A_TAB_SZ; if ((pt = atab[indx]) != NULL) { |