-/* $OpenBSD: ar_subs.c,v 1.35 2014/01/08 04:43:48 guenther Exp $ */
+/* $OpenBSD: ar_subs.c,v 1.36 2014/01/08 06:41:49 guenther Exp $ */
/* $NetBSD: ar_subs.c,v 1.5 1995/03/21 09:07:06 cgd Exp $ */
/*-
return;
/*
- * if this is not append, and there are no files, we do not write a
+ * if this is not append, and there are no files, we do not write a
* trailer
*/
wr_one = is_app;
-/* $OpenBSD: tables.c,v 1.28 2014/01/08 04:43:48 guenther Exp $ */
+/* $OpenBSD: tables.c,v 1.29 2014/01/08 06:41:49 guenther Exp $ */
/* $NetBSD: tables.c,v 1.4 1995/03/21 09:07:45 cgd Exp $ */
/*-
* 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 from
- * this table, fragmentation of the scratch file is never a issue. Lookups
+ * 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
-/* $OpenBSD: tar.c,v 1.51 2014/01/08 04:58:36 guenther Exp $ */
+/* $OpenBSD: tar.c,v 1.52 2014/01/08 06:41:49 guenther Exp $ */
/* $NetBSD: tar.c,v 1.5 1995/03/21 09:07:49 cgd Exp $ */
/*-
}
}
- if (!arcn->ln_nlen &&
+ if (!arcn->ln_nlen &&
hd->typeflag != LONGLINKTYPE && hd->typeflag != LONGNAMETYPE) {
arcn->ln_nlen = expandname(arcn->ln_name, sizeof(arcn->ln_name),
&gnu_link_string, hd->linkname, sizeof(hd->linkname));